{"task_id": "nmp3_0001e8eb-17b3-5bd9-b7ec-fa259a6b2a02", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Determine all functions $f:\\mathbb{R}_{\\ge0}\\to\\mathbb{R}_{\\ge0}$ such that for all $x,y\\ge0$\n-- \\[\n-- f(x^2)+f(f(y))=f\\bigl(f(x)+y^2\\bigr)-2f(xy).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility predicate for the functional equation.\n\nThe domain and codomain are both `ℝ≥0`. The equality itself is stated in `ℝ`,\nso that subtraction and the coefficient `2` are the ordinary real operations.\nAll terms in the original equation are nonnegative, but using `ℝ` avoids any\ntruncated-subtraction convention of `ℝ≥0`. -/\ndef Admissible (f : NNReal → NNReal) : Prop :=\n ∀ x y : NNReal,\n (f (x ^ 2) : Real) + (f (f y) : Real) =\n (f (f x + y ^ 2) : Real) - 2 * (f (x * y) : Real)\n\n/-- The identically zero function on `ℝ≥0`. -/\ndef zeroSolution : NNReal → NNReal :=\n fun _ => 0\n\n/-- The squaring function on `ℝ≥0`. -/\ndef squareSolution : NNReal → NNReal :=\n fun x => x ^ 2\n\n/-- The proposed complete answer set: the zero function and the squaring function. -/\ndef ProposedSolutions : Set (NNReal → NNReal) :=\n {f | f = zeroSolution ∨ f = squareSolution}\n\n/-- A set `S` is a complete answer exactly when its members are precisely the\nadmissible functions. The two directions of the `↔` are the soundness and\ncompleteness parts of the classification. -/\ndef CompleteAnswer (S : Set (NNReal → NNReal)) : Prop :=\n ∀ f : NNReal → NNReal, f ∈ S ↔ Admissible f\n\n/-- The formal statement of the original problem: the proposed answer set\nconsisting of the zero and squaring functions is exactly the solution set. -/\ndef Target : Prop :=\n CompleteAnswer ProposedSolutions\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0001e8eb-17b3-5bd9-b7ec-fa259a6b2a02", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "24f7bbc31cb277e12075f7fbc845bc8ffad109ebdd6baf0db9e6e72c0528fb99", "task_path": "tasks/nmp3_0001e8eb-17b3-5bd9-b7ec-fa259a6b2a02", "metadata": {"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"}} {"task_id": "nmp3_0038fcfc-14de-5989-bd2e-befab5715d65", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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$).\nimport Mathlib\n\n/-!\n# Formalization of a fixed-point statement for a self-map of a closed interval\n\nThe source problem considers a continuous map `f : [a,b] → [a,b]` for which\ntwo interior points are mapped to the two endpoints. It asks to prove that\nthe second iterate `f ∘ f` has at least three distinct fixed points in the\ninterval.\n\nWe represent the interval map by a total real function together with the\npredicate that it maps `[a,b]` into itself, and continuity on `[a,b]` by\n`ContinuousOn`. The target assertion is stated as a proposition; no proof is\nincluded.\n-/\n\nnamespace Problem\n\n/-- The codomain condition for `f : [a,b] → [a,b]`, represented for a total\nreal-valued function. -/\ndef MapsIntervalIntoItself (a b : ℝ) (f : ℝ → ℝ) : Prop :=\n Set.MapsTo f (Set.Icc a b) (Set.Icc a b)\n\n/-- There exist two points in the open interval `(a,b)` that are mapped to the\nleft and right endpoints, respectively. -/\ndef HasInteriorPreimagesOfEndpoints (a b : ℝ) (f : ℝ → ℝ) : Prop :=\n ∃ α β : ℝ,\n α ∈ Set.Ioo a b ∧\n β ∈ Set.Ioo a b ∧\n f α = a ∧\n f β = b\n\n/-- The conclusion that the second iterate `f ∘ f` has at least three distinct\nfixed points in the closed interval `[a,b]`. -/\ndef AtLeastThreeFixedPointsOfComp (a b : ℝ) (f : ℝ → ℝ) : Prop :=\n ∃ x₁ x₂ x₃ : ℝ,\n x₁ ∈ Set.Icc a b ∧\n x₂ ∈ Set.Icc a b ∧\n x₃ ∈ Set.Icc a b ∧\n (f ∘ f) x₁ = x₁ ∧\n (f ∘ f) x₂ = x₂ ∧\n (f ∘ f) x₃ = x₃ ∧\n x₁ ≠ x₂ ∧\n x₁ ≠ x₃ ∧\n x₂ ≠ x₃\n\n/-- The formal target: if `f : [a,b] → [a,b]` is continuous and maps two\ninterior points to the two endpoints, then `f ∘ f` has at least three distinct\nfixed points in `[a,b]`. -/\ndef Target : Prop :=\n ∀ (a b : ℝ) (f : ℝ → ℝ),\n MapsIntervalIntoItself a b f →\n ContinuousOn f (Set.Icc a b) →\n HasInteriorPreimagesOfEndpoints a b f →\n AtLeastThreeFixedPointsOfComp a b f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0038fcfc-14de-5989-bd2e-befab5715d65", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c3d4dc381108bba26b8ae824740ade88a83d711432b6a30f6e02e3f76b7af946", "task_path": "tasks/nmp3_0038fcfc-14de-5989-bd2e-befab5715d65", "metadata": {"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"}} {"task_id": "nmp3_00433297-225c-5a9a-9365-f121df4aee70", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $a,b,c$ are real numbers with $a+b+c=3$. Prove that \n-- $$\\frac{1}{5a^2-4a+11}+\\frac{1}{5b^2-4b+11}+\\frac{1}{5c^2-4c+11}\\le\\frac14.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The quadratic denominator appearing in each summand of the problem. -/\ndef denominator (x : Real) : Real :=\n 5 * x ^ 2 - 4 * x + 11\n\n/-- Every denominator is positive, so the reciprocal expressions are ordinary\nreal fractions (and Lean's total division agrees with field division). -/\ntheorem denominator_pos (x : Real) : 0 < denominator x := by\n unfold denominator\n have h : 0 ≤ (5 * x - 2) ^ 2 := sq_nonneg (5 * x - 2)\n nlinarith\n\n/-- The full left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : Real) : Real :=\n 1 / denominator a + 1 / denominator b + 1 / denominator c\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs : Real :=\n (1 : Real) / 4\n\n/-- The proposition asserted by the problem: for all real `a`, `b`, and `c`\nsatisfying `a + b + c = 3`, the stated reciprocal sum is at most one quarter. -/\ndef Target : Prop :=\n ∀ (a b c : Real),\n a + b + c = 3 →\n lhs a b c ≤ rhs\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "00433297-225c-5a9a-9365-f121df4aee70", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "74257e36b1b317e671cc6ee18c7bb1b6e043b3f66d60269e374835374bbc7d6c", "task_path": "tasks/nmp3_00433297-225c-5a9a-9365-f121df4aee70", "metadata": {"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"}} {"task_id": "nmp3_005bdb6d-a4be-59c4-90a2-b42904244471", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 that every dominant set contains at least $k$ towns. Prove that the towns can be partitioned into $2001-k$ republics such that no two towns in the same republic are directly connected by a road (i.e. the graph is $(2001-k)$‑colorable).\nimport Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex\nimport Mathlib.Data.Finset.Card\n\n/-!\n# Domination lower bounds and graph colorability\n\nThis file formalizes the statement of the following problem.\n\nThere are 2001 towns joined by roads. Every town is incident to at least one\nroad, and no town is adjacent to every other town. A set `D` of towns is\ndominant when every town outside `D` is adjacent to a town in `D`. If every\ndominant set has at least `k` towns, then the graph on the towns is\n`(2001 - k)`-colorable.\n\nThe final declaration, `Problem.Target`, is the unproved mathematical\nassertion. It is a proposition-valued definition, not a proof.\n-/\n\nnamespace Problem\n\n/-- An arbitrary set of 2001 towns, labelled by `Fin 2001`. -/\nabbrev Town : Type := Fin 2001\n\n/-- A set `D` of towns is dominant if every town outside `D` is adjacent to at\nleast one town in `D`. Towns that already lie in `D` are not required to have\na neighbour in `D`; this matches the source definition exactly. -/\ndef IsDominant (G : SimpleGraph Town) (D : Finset Town) : Prop :=\n ∀ (v : Town), v ∉ D → ∃ (u : Town), u ∈ D ∧ G.Adj v u\n\n/-- Every town is incident to at least one road, equivalently the graph has no\nisolated vertex. -/\ndef EveryTownIncidentToSomeRoad (G : SimpleGraph Town) : Prop :=\n ∀ (v : Town), ∃ (w : Town), G.Adj v w\n\n/-- No town is directly connected by a road to every other town. The\ninequality `w ≠ v` is essential: a simple graph never has a loop at `v`, so\nwithout it this condition would be impossible. -/\ndef NoTownAdjacentToEveryOtherTown (G : SimpleGraph Town) : Prop :=\n ∀ (v : Town), ∃ (w : Town), w ≠ v ∧ ¬ G.Adj v w\n\n/-- Every dominant set contains at least `k` towns. -/\ndef EveryDominantSetHasAtLeast (G : SimpleGraph Town) (k : ℕ) : Prop :=\n ∀ (D : Finset Town), IsDominant G D → k ≤ D.card\n\n/-- The complete assertion of the problem: for every simple graph on the 2001\ntowns and every natural number `k`, if the three graph/domination hypotheses\nhold, then the graph is colorable with `2001 - k` colours. -/\ndef Target : Prop :=\n ∀ (G : SimpleGraph Town) (k : ℕ),\n EveryTownIncidentToSomeRoad G →\n NoTownAdjacentToEveryOtherTown G →\n EveryDominantSetHasAtLeast G k →\n G.Colorable ((2001 : ℕ) - k)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "005bdb6d-a4be-59c4-90a2-b42904244471", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5a55fd25545c3401debc3fdbc652be34c9bd25a7e4d544efad94b856eb21c692", "task_path": "tasks/nmp3_005bdb6d-a4be-59c4-90a2-b42904244471", "metadata": {"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"}} {"task_id": "nmp3_0060bc23-6a89-55a0-a2e2-51056a34aae9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ satisfy $a^{2}b+b^{2}c+c^{2}a=1$. Prove that \n-- \\[\n-- 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)}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The constraint `a^2 * b + b^2 * c + c^2 * a = 1`. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a ^ 2 * b + b ^ 2 * c + c ^ 2 * a = 1\n\n/-- The left-hand side of the asserted inequality. -/\ndef LHS (a b c : ℝ) : ℝ :=\n a ^ 3 + b ^ 3 + c ^ 3 + 1\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 2 * Real.sqrt ((a ^ 2 + b ^ 2 + c ^ 2) *\n (a ^ 3 * b + b ^ 3 * c + c ^ 3 * a))\n\n/-- The claimed inequality under the nonnegativity constraints and the constraint. -/\ndef Claim (a b c : ℝ) : Prop :=\n 0 ≤ a → 0 ≤ b → 0 ≤ c → Constraint a b c → LHS a b c ≥ RHS a b c\n\n/-- The complete assertion: for all nonnegative real `a`, `b`, `c` satisfying\n`a ^ 2 * b + b ^ 2 * c + c ^ 2 * a = 1`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Claim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0060bc23-6a89-55a0-a2e2-51056a34aae9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "819298faf1830be34b36be3e2d861ec9485281e9f4b204545dad909a1e13ac55", "task_path": "tasks/nmp3_0060bc23-6a89-55a0-a2e2-51056a34aae9", "metadata": {"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"}} {"task_id": "nmp3_006262ed-772c-5620-b3fe-20a443b17b3d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 must exist two blue numbers that are consecutive).\nimport Mathlib\n\n/-!\n# Formal statement: red-blue colorings of integers greater than 1000\n\nThis module states the combinatorial assertion from the problem. It contains\ndefinitions only; the target is a `Prop`-valued declaration, not a proof.\n-/\n\nnamespace Problem\n\n/-- The integers greater than `1000` that are being colored. -/\nabbrev Domain : Type := {n : ℤ // 1000 < n}\n\n/-- The two available colors. Each colored integer has exactly one color. -/\ninductive Color where\n | red\n | blue\n deriving DecidableEq, Repr\n\n/-- A coloring assigns one of the two colors to every integer greater than `1000`. -/\nabbrev Coloring : Type := Domain → Color\n\n/-- An integer greater than `1000` is red exactly when its color is `red`. -/\ndef IsRed (c : Coloring) (n : Domain) : Prop :=\n c n = Color.red\n\n/-- An integer greater than `1000` is blue exactly when its color is `blue`. -/\ndef IsBlue (c : Coloring) (n : Domain) : Prop :=\n c n = Color.blue\n\n/-- Multiplication of two integers greater than `1000` again gives an integer\ngreater than `1000`, so it is an operation on `Domain`. -/\ndef mulDomain (x y : Domain) : Domain :=\n ⟨x.1 * y.1, by\n have hx : (1000 : ℤ) < x.1 := x.2\n have hy : (1000 : ℤ) < y.1 := y.2\n nlinarith [mul_pos (by omega : (0 : ℤ) < x.1)\n (by omega : (0 : ℤ) < y.1)]⟩\n\n/-- The coloring condition: the product of any two distinct red integers\ngreater than `1000` is blue. -/\ndef ProductOfDistinctRedsIsBlue (c : Coloring) : Prop :=\n ∀ (x y : Domain), x ≠ y → IsRed c x → IsRed c y → IsBlue c (mulDomain x y)\n\n/-- Two integers greater than `1000` are consecutive when one is obtained from\nthe other by adding one. -/\ndef Consecutive (x y : Domain) : Prop :=\n x.1 + 1 = y.1 ∨ y.1 + 1 = x.1\n\n/-- There exist two blue integers greater than `1000` that are consecutive. -/\ndef HasTwoConsecutiveBlueNumbers (c : Coloring) : Prop :=\n ∃ x y : Domain, IsBlue c x ∧ IsBlue c y ∧ Consecutive x y\n\n/-- The property that no two blue integers greater than `1000` differ by one. -/\ndef NoTwoBlueNumbersDifferByOne (c : Coloring) : Prop :=\n ∀ x y : Domain, IsBlue c x → IsBlue c y → ¬ Consecutive x y\n\n/-- The target assertion: every coloring of all integers greater than `1000`\nwith the distinct-red-product condition must contain two consecutive blue\nintegers. -/\ndef Target : Prop :=\n ∀ c : Coloring, ProductOfDistinctRedsIsBlue c → HasTwoConsecutiveBlueNumbers c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "006262ed-772c-5620-b3fe-20a443b17b3d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f5902d752dec75f3237017ef240a12c175f290e2f205d7790de12711f7df25c0", "task_path": "tasks/nmp3_006262ed-772c-5620-b3fe-20a443b17b3d", "metadata": {"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"}} {"task_id": "nmp3_00636aa7-4b2f-52ba-8da3-8973991f2ead", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers such that $a^{2}+b^{2}+c^{2}=1$. Prove that \n-- \\[\n-- \\frac{a}{1+bc}+\\frac{b}{1+ac}+\\frac{c}{1+ab}\\le \\sqrt{2}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nLet `a`, `b`, and `c` be positive real numbers satisfying\n`a^2 + b^2 + c^2 = 1`. Prove the inequality\n`a / (1 + b*c) + b / (1 + a*c) + c / (1 + a*b) ≤ sqrt 2`.\n\nThe proposition below records the assertion without supplying a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side\n`a / (1 + b*c) + b / (1 + a*c) + c / (1 + a*b)`. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a / (1 + b * c) + b / (1 + a * c) + c / (1 + a * b)\n\n/-- The full assertion of the problem: for all positive real numbers `a`, `b`, `c`\nwith `a^2 + b^2 + c^2 = 1`, the displayed sum is at most `sqrt 2`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = (1 : ℝ) →\n LHS a b c ≤ Real.sqrt (2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "00636aa7-4b2f-52ba-8da3-8973991f2ead", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ef1c60b685a2725602747ffbd497a8776df0ff84182b1081b9183b59cddc0e91", "task_path": "tasks/nmp3_00636aa7-4b2f-52ba-8da3-8973991f2ead", "metadata": {"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"}} {"task_id": "nmp3_009daa63-9878-5893-b975-ac888618b565", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\bigl(ab^3+bc^3+ca^3\\bigr)\\bigl(ab+bc+ca\\bigr)\\le 16.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the inequality problem\n\nThe source problem asks to prove that for all positive real numbers `a`, `b`, `c`\nwith `a + b + c = 3`, the product\n\n`(a * b ^ 3 + b * c ^ 3 + c * a ^ 3) * (a * b + b * c + c * a)`\n\nis at most `16`.\n-/\n\nnamespace Problem\n\n/-- The proposition asserted by the problem: for all positive real numbers\n`a`, `b`, and `c` satisfying `a + b + c = 3`,\n`(a*b^3 + b*c^3 + c*a^3) * (a*b + b*c + c*a) ≤ 16`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c → a + b + c = 3 →\n (a * b ^ 3 + b * c ^ 3 + c * a ^ 3) *\n (a * b + b * c + c * a) ≤ 16\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "009daa63-9878-5893-b975-ac888618b565", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4e81d996c2226f25a393cde50d5c8dc447a4dd99cb01d8462c403e6daf52ac10", "task_path": "tasks/nmp3_009daa63-9878-5893-b975-ac888618b565", "metadata": {"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"}} {"task_id": "nmp3_00ac1c64-6c7b-5f4a-a0d1-f61461ca525d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 unordered pair of the $n$ people has shaken hands exactly once in total (i.e., no pair ever shakes hands more than once and every pair shakes hands at least once). Prove that all meetings have the same number of attendants.\nimport Mathlib.Data.Finset.Card\nimport Mathlib.Data.Fintype.Fin\n\n/-!\n# The handshake-meeting problem\n\nThis file formalizes the statement of the problem. The people are represented by\n`Fin n`, and the `n` meetings (one per day) are indexed by the same type `Fin n`.\nA meeting is represented by the `Finset` of people attending it. The target is a\nproposition; it is not proved here.\n-/\n\nnamespace Problem\n\n/-- The `n` people in the problem. -/\nabbrev Person (n : ℕ) : Type := Fin n\n\n/-- The `n` days on which the `n` meetings are held. -/\nabbrev Day (n : ℕ) : Type := Fin n\n\n/-- A schedule assigns to each day the finite set of people attending that day's meeting. -/\nabbrev MeetingSchedule (n : ℕ) : Type := Day n → Finset (Person n)\n\n/-- Person `p` attends the meeting on day `d`. -/\ndef Attends {n : ℕ} (schedule : MeetingSchedule n) (d : Day n) (p : Person n) : Prop :=\n p ∈ schedule d\n\n/-- A handshake between two distinct people occurs at the meeting on day `d` exactly when\nboth people attend that meeting. A meeting contributes one handshake for every unordered\npair of distinct attendees. -/\ndef HandshakeInMeeting {n : ℕ} (schedule : MeetingSchedule n)\n (d : Day n) (u v : Person n) : Prop :=\n u ≠ v ∧ Attends schedule d u ∧ Attends schedule d v\n\n/-- Every meeting has at least three attendants. -/\ndef EveryMeetingAttendedByAtLeastThree {n : ℕ}\n (schedule : MeetingSchedule n) : Prop :=\n ∀ d : Day n, 3 ≤ (schedule d).card\n\n/-- Every unordered pair of distinct people shakes hands exactly once in total.\nThe unique `d` is the unique meeting day on which both people attend. Quantifying over\nordered pairs `u v` with `u ≠ v` is the usual orientation-free quantification over\nunordered pairs. -/\ndef EveryUnorderedPairShakesHandsExactlyOnce {n : ℕ}\n (schedule : MeetingSchedule n) : Prop :=\n ∀ u v : Person n, u ≠ v → ∃! d : Day n, HandshakeInMeeting schedule d u v\n\n/-- The admissibility conditions stated in the problem for the meeting schedule. -/\ndef AdmissibleSchedule {n : ℕ} (schedule : MeetingSchedule n) : Prop :=\n EveryMeetingAttendedByAtLeastThree schedule ∧\n EveryUnorderedPairShakesHandsExactlyOnce schedule\n\n/-- All meetings have the same number of attendants. -/\ndef AllMeetingsHaveSameNumberOfAttendees {n : ℕ}\n (schedule : MeetingSchedule n) : Prop :=\n ∀ d e : Day n, (schedule d).card = (schedule e).card\n\n/-- The complete formal statement: for every natural number `n ≥ 3`, every schedule of\n`n` meetings whose meetings have at least three attendees and in which every unordered\npair of people shakes hands exactly once, all meetings have the same number of attendees. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 3 ≤ n → ∀ schedule : MeetingSchedule n,\n AdmissibleSchedule schedule → AllMeetingsHaveSameNumberOfAttendees schedule\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "00ac1c64-6c7b-5f4a-a0d1-f61461ca525d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "554d29c29b726779fd86cb6e44cc497b6efba18d4f96ca3e79e4abe4c5dc5fbc", "task_path": "tasks/nmp3_00ac1c64-6c7b-5f4a-a0d1-f61461ca525d", "metadata": {"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"}} {"task_id": "nmp3_00ac344b-9d0b-5051-87c0-b106c9048e51", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,n$ be integers with $a>b>1$, $b$ odd, and $n\\ge1$. If $b^n\\mid a^n-1$, prove that \n-- $$a^b>\\frac{3^n}{n}\\,. $$\nimport Mathlib\n\n/-!\n# Formalization of the divisibility and inequality problem\n\nThe original problem asks us to prove, for integers `a`, `b`, and `n` with\n`a > b > 1`, `b` odd, and `n ≥ 1`, that if `b^n` divides `a^n - 1`\nthen `a^b > 3^n / n`.\n\nSince `b > 1` and `n ≥ 1`, the integer exponents appearing in the statement\nare nonnegative. We therefore write each exponent as the corresponding\nnatural number via `Int.toNat`.\n-/\n\nnamespace Problem\n\n/-- The proposition stated by the problem.\n\nFor all integers `a`, `b`, `n`, if `a > b`, `b > 1`, `b` is odd, `n ≥ 1`,\nand `b ^ n` divides `a ^ n - 1` in `ℤ`, then\n`(a : ℝ) ^ b > (3 : ℝ) ^ n / (n : ℝ)`. -/\ndef Target : Prop :=\n ∀ (a b n : ℤ),\n a > b →\n b > 1 →\n Odd b →\n n ≥ 1 →\n (b ^ n.toNat : ℤ) ∣ a ^ n.toNat - 1 →\n (a : ℝ) ^ b.toNat > (3 : ℝ) ^ n.toNat / (n : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "00ac344b-9d0b-5051-87c0-b106c9048e51", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "443891494d4f0a14ecf32c61f740ea4b658eadeb65d567d76f0100fdcfc887a3", "task_path": "tasks/nmp3_00ac344b-9d0b-5051-87c0-b106c9048e51", "metadata": {"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"}} {"task_id": "nmp3_00bb5767-64ce-5a68-bc5d-cded70380691", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers such that $\\sqrt{x}+\\sqrt{y}+\\sqrt{z}=1$. Prove that \n-- \\[\n-- \\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.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the square-root-normalized inequality\n\nThe original problem asks for a proof of an inequality in three positive real\nnumbers satisfying `sqrt x + sqrt y + sqrt z = 1`.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real variables in the problem:\nall three are positive and the sum of their real square roots is one. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧\n Real.sqrt x + Real.sqrt y + Real.sqrt z = 1\n\n/-- A single summand\n`(a^2 + b*c) / sqrt (2*a^2*(b+c))` of the displayed cyclic left-hand side. -/\nnoncomputable def Summand (a b c : ℝ) : ℝ :=\n (a ^ 2 + b * c) / Real.sqrt (2 * a ^ 2 * (b + c))\n\n/-- The complete cyclic left-hand side displayed in the problem. -/\nnoncomputable def LHS (x y z : ℝ) : ℝ :=\n Summand x y z + Summand y z x + Summand z x y\n\n/-- The asserted inequality, before imposing the hypotheses. -/\ndef Inequality (x y z : ℝ) : Prop :=\n LHS x y z ≥ 1\n\n/-- The proposition to be proved: for every triple of positive real numbers\nwhose square roots sum to one, the displayed cyclic sum is at least one. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "00bb5767-64ce-5a68-bc5d-cded70380691", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fe619ae6f737de24279ab89905d2763805e5b0be549f20d4b52884a2b7317386", "task_path": "tasks/nmp3_00bb5767-64ce-5a68-bc5d-cded70380691", "metadata": {"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"}} {"task_id": "nmp3_00ce5740-0a39-5f85-8513-cdd2b3974366", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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.\nimport Mathlib\n\n/-!\n# Formalization of the integer perfect-square problem\n\nThe original problem asks to show that no nonzero integer `n` makes all three\ninteger values `2 * n ^ 2 + 1`, `3 * n ^ 2 + 1`, and `6 * n ^ 2 + 1` perfect\nsquares. The declarations below state that assertion as a proposition; no\nproof of it is supplied here.\n-/\n\nnamespace Problem\n\n/-- An integer `z` is a perfect square when it is the square of an integer. -/\ndef IsPerfectSquare (z : ℤ) : Prop :=\n ∃ k : ℤ, k ^ 2 = z\n\n/-- The three integer values associated to `n` are all perfect squares. -/\ndef AllThreePerfectSquares (n : ℤ) : Prop :=\n IsPerfectSquare ((2 : ℤ) * n ^ 2 + 1) ∧\n IsPerfectSquare ((3 : ℤ) * n ^ 2 + 1) ∧\n IsPerfectSquare ((6 : ℤ) * n ^ 2 + 1)\n\n/-- A nonzero integer `n` is admissible when all three associated values are\nperfect squares. -/\ndef Admissible (n : ℤ) : Prop :=\n n ≠ 0 ∧ AllThreePerfectSquares n\n\n/-- There is no nonzero integer `n` for which all three associated values are\nperfect squares. -/\ndef Target : Prop :=\n ¬ ∃ n : ℤ, Admissible n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "00ce5740-0a39-5f85-8513-cdd2b3974366", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b2097dffaef2fdf70832e6a1fbb59fac09a0fc935212ed0004dfaff2451cac0c", "task_path": "tasks/nmp3_00ce5740-0a39-5f85-8513-cdd2b3974366", "metadata": {"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"}} {"task_id": "nmp3_00df6b1c-a479-5af6-b1bf-25af692e0e1d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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}\\,. $\nimport Mathlib\n\n/-!\n# Formal statement: long chords among points on the unit circle\n\nWe model the unit circle in the Euclidean plane as the set of points of\n`EuclideanSpace ℝ (Fin 2)` whose norm is `1`. A chord is represented by the\nunordered two-element subset of the given finite set formed by its endpoints.\n-/\n\nnoncomputable section\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- A point of the Euclidean plane lies on the unit circle when its norm is one. -/\ndef OnUnitCircle (p : EuclideanSpace ℝ (Fin 2)) : Prop :=\n ‖p‖ = 1\n\n/-- A two-element subset of the given finite point set is a long chord when the\ndistance between its (necessarily distinct) endpoints is greater than `sqrt 2`. -/\ndef IsLongChord (P : Finset (EuclideanSpace ℝ (Fin 2)))\n (s : Finset (EuclideanSpace ℝ (Fin 2))) : Prop :=\n s ∈ P.powersetCard 2 ∧\n ∀ x ∈ s, ∀ y ∈ s, x ≠ y → Real.sqrt 2 < dist x y\n\n/-- The number of unordered long chords with both endpoints in `P`. -/\ndef longChordCount (P : Finset (EuclideanSpace ℝ (Fin 2))) : ℕ :=\n letI : DecidablePred (fun s : Finset (EuclideanSpace ℝ (Fin 2)) =>\n IsLongChord P s) := Classical.decPred _\n ((P.powersetCard 2).filter (fun s => IsLongChord P s)).card\n\n/-- For any `n` points on the unit circle, the number of chords between two of\nthe points whose length is greater than `sqrt 2` is at most `n^2 / 3`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (P : Finset (EuclideanSpace ℝ (Fin 2))),\n P.card = n →\n (∀ p ∈ P, OnUnitCircle p) →\n (longChordCount P : ℝ) ≤ (n : ℝ) ^ 2 / 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "00df6b1c-a479-5af6-b1bf-25af692e0e1d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "26b31030282d2aeaf5d56b706f81a2f88deec4c2e232172c33f3ac4ba81e4a51", "task_path": "tasks/nmp3_00df6b1c-a479-5af6-b1bf-25af692e0e1d", "metadata": {"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"}} {"task_id": "nmp3_00f0830e-fd86-511c-9b0d-1c0b06f8e0ad", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ be real numbers such that $x+y+z=3$. Prove that \n-- \\[\n-- \\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)\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nProblem: for positive real numbers `x`, `y`, `z` with `x + y + z = 3`,\nprove\n`x^3/(y^3+8) + y^3/(z^3+8) + z^3/(x^3+8)\n ≥ 1/9 + (2/27) * (x*y + x*z + y*z)`.\n\nThis file only states the target; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real variables. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = (3 : ℝ)\n\n/-- The asserted inequality, with all operations and comparisons over `ℝ`. -/\ndef Inequality (x y z : ℝ) : Prop :=\n x ^ 3 / (y ^ 3 + (8 : ℝ)) + y ^ 3 / (z ^ 3 + (8 : ℝ)) +\n z ^ 3 / (x ^ 3 + (8 : ℝ)) ≥\n (1 : ℝ) / 9 + (2 : ℝ) / 27 * (x * y + x * z + y * z)\n\n/-- The full universal statement of the problem. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "00f0830e-fd86-511c-9b0d-1c0b06f8e0ad", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ea45bc85445cdfc4ca2e470ff570ee2fe94ef57b62a96f473f4a145de5f606a5", "task_path": "tasks/nmp3_00f0830e-fd86-511c-9b0d-1c0b06f8e0ad", "metadata": {"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"}} {"task_id": "nmp3_00f88d1a-eb0c-594c-b460-b5213b23f69c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c\\ge 0$, prove that \n-- $$a^2+b^2+c^2+2abc+1\\ge 2(ab+bc+ca).$$\nimport Mathlib\n\n/-!\n# Formal statement: nonnegative real three-variable inequality\n\nThe original problem asks, for nonnegative `a`, `b`, and `c`, to prove\n\n`a^2 + b^2 + c^2 + 2abc + 1 ≥ 2(ab + bc + ca)`.\n\nThe declaration below records the complete quantified proposition as a\n`Prop`-valued definition. No proof is supplied at this stage.\n-/\n\nnamespace Problem\n\n/-- For all real numbers `a`, `b`, and `c` satisfying `0 ≤ a`, `0 ≤ b`, and\n`0 ≤ c`, one has\n`a^2 + b^2 + c^2 + 2abc + 1 ≥ 2(ab + bc + ca)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c →\n a ^ 2 + b ^ 2 + c ^ 2 + 2 * a * b * c + 1 ≥\n 2 * (a * b + b * c + c * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "00f88d1a-eb0c-594c-b460-b5213b23f69c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "58054e5c2c7b1c0a68b41148207a6c2e440fc0eb932edb3dfa9b67b8f55cdf5b", "task_path": "tasks/nmp3_00f88d1a-eb0c-594c-b460-b5213b23f69c", "metadata": {"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"}} {"task_id": "nmp3_0102dc7c-9292-549e-b15b-27d4fe8d5119", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers \\(a,b,c\\),\n-- \\[\n-- 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).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThis file records the proposition asserted in `problem.md`; it does not contain a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 2 * a + 3 * b + 5 * c -\n (8 / 3 : ℝ) * (Real.sqrt (a * b) + Real.sqrt (b * c) + Real.sqrt (c * a))\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (1 / 3 : ℝ) * (a ^ 2 / b + b ^ 2 / c + (4 * c ^ 2) / a)\n\n/-- The pointwise inequality asserted for a fixed triple of real numbers. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ rhs a b c\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the stated expression is at most\nthe stated right-hand side.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0102dc7c-9292-549e-b15b-27d4fe8d5119", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a97e451994adb29b03f634d4c7001bba6992de9543f9c7b96cb243eadca06a66", "task_path": "tasks/nmp3_0102dc7c-9292-549e-b15b-27d4fe8d5119", "metadata": {"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"}} {"task_id": "nmp3_0109d911-5554-581f-8c4b-5bd93de39338", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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.\nimport Mathlib.Data.Nat.PrimeFin\nimport Mathlib.Algebra.Ring.Parity\n\n/-!\n# Formalization of the problem statement\n\nLet `k` be a nonzero natural number and `m` an odd natural number. The\nproblem asks us to prove that there is a natural number `n` for which the\nnatural number `m ^ n + n ^ m` has at least `k` distinct prime factors.\n-/\n\nnamespace Problem\n\n/-- The number of distinct prime factors of a natural number.\n\nMathlib's `Nat.primeFactors` is the finset of primes dividing the argument,\nso taking its cardinality counts each prime divisor exactly once. For `0`,\n`Nat.primeFactors 0` is empty; here the relevant expression is positive in\nall cases in which the target is used with an odd `m`. -/\ndef distinctPrimeFactorCount (a : ℕ) : ℕ :=\n a.primeFactors.card\n\n/-- `a` has at least `k` distinct prime factors. -/\ndef HasAtLeastNDistinctPrimeFactors (a k : ℕ) : Prop :=\n k ≤ distinctPrimeFactorCount a\n\n/-- The admissibility condition in the problem, with the existential\nwitness `n` made explicit: `m ^ n + n ^ m` has at least `k` distinct prime\nfactors. -/\ndef IsSolution (k m n : ℕ) : Prop :=\n HasAtLeastNDistinctPrimeFactors (m ^ n + n ^ m) k\n\n/-- The complete assertion of the problem.\n\nFor every natural number `k` with `k ≠ 0` and every odd natural number `m`,\nthere exists a natural number `n` such that `m ^ n + n ^ m` has at least\n`k` distinct prime factors. -/\ndef Target : Prop :=\n ∀ (k : ℕ), k ≠ 0 → ∀ (m : ℕ), Odd m → ∃ n : ℕ, IsSolution k m n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0109d911-5554-581f-8c4b-5bd93de39338", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d291e8d34c9d999497c677a4c523962cccaa5a19240891564ebe81b44ea03849", "task_path": "tasks/nmp3_0109d911-5554-581f-8c4b-5bd93de39338", "metadata": {"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"}} {"task_id": "nmp3_01148b2c-6ad6-53bd-9cb8-ff57109ee9cc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 graph). Moreover, every unordered pair of distinct teams must play each other on exactly one of the days. Prove that for every pair of consecutive days there is at least one team that plays on both days; equivalently, if $S_i$ denotes the set of teams that play on day $i$, then $S_i\\cap S_{i+1}\\neq\\varnothing$ for all $i=1,\\dots,49$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The fifty teams in the tournament, represented by `0, ..., 49`. -/\nabbrev Team : Type := Fin 50\n\n/-- The fifty days of the tournament, represented by `0, ..., 49`. -/\nabbrev Day : Type := Fin 50\n\n/-- A schedule assigns to each day the finite set of teams present that day. -/\nabbrev Schedule : Type := Day → Finset Team\n\n/-- Teams `a` and `b` play each other on day `d` exactly when both are among\nthe teams present on day `d`. The tournament description supplies no separate\nmatch-multiplicity data beyond the daily team sets. -/\ndef PlayedOn (S : Schedule) (d : Day) (a b : Team) : Prop :=\n a ∈ S d ∧ b ∈ S d\n\n/-- Admissibility of a schedule: every day has at least two teams present, and\nevery unordered pair of distinct teams plays on exactly one day. -/\ndef ScheduleAdmissible (S : Schedule) : Prop :=\n (∀ d : Day, 2 ≤ (S d).card) ∧\n (∀ a b : Team, a ≠ b → ∃! d : Day, PlayedOn S d a b)\n\n/-- Consecutive-day intersection property for a schedule: each pair of days\nindexed by `i` and `i + 1` (with `i` ranging over `0, ..., 48`, corresponding\nto `1, ..., 49` in the source) has a common team. -/\ndef ConsecutiveIntersectionProperty (S : Schedule) : Prop :=\n ∀ i : Fin 49, ∃ t : Team, t ∈ S i.castSucc ∧ t ∈ S i.succ\n\n/-- The assertion of the problem: every admissible fifty-team, fifty-day\nround-robin schedule has a common team on every pair of consecutive days. -/\ndef Target : Prop :=\n ∀ S : Schedule, ScheduleAdmissible S → ConsecutiveIntersectionProperty S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "01148b2c-6ad6-53bd-9cb8-ff57109ee9cc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "43f7771bff92b85fbc9932a7c92304604a4167c4592de1fb3fb6903df4f1306f", "task_path": "tasks/nmp3_01148b2c-6ad6-53bd-9cb8-ff57109ee9cc", "metadata": {"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"}} {"task_id": "nmp3_012ad00c-45e5-52e9-b03e-cf1e9272a28d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 algorithm which is guaranteed to determine whether the towns are all mutually reachable (i.e. whether the graph is connected) must, in the worst case, ask at least 2016 questions.\n/-\nFormalization of the query-complexity lower bound for deciding connectivity of a\nsimple undirected graph on 64 labelled towns.\n\nThe problem is formalized as a statement about deterministic adaptive decision\ntrees. A tree's worst-case number of queries is the maximum, over all simple\ngraphs on the 64 towns, of the number of queries made along the path induced by\nthat graph. A tree is correct when its Boolean output on every graph is true\nexactly when the graph is connected.\n-/\nimport Mathlib.Combinatorics.SimpleGraph.Connectivity.Finite\nimport Mathlib.Data.Sym.Card\n\nnoncomputable section\nopen Classical\n\nnamespace Problem\n\n/-- The country has exactly 64 towns. -/\ndef NumberOfTowns : Nat := 64\n\n/-- The town set: 64 labelled towns. -/\nabbrev Town : Type := Fin NumberOfTowns\n\ninstance instNonemptyTown : Nonempty Town := ⟨⟨0, by decide⟩⟩\n\n/-- The town type has exactly 64 elements. -/\ntheorem card_town : Fintype.card Town = NumberOfTowns := rfl\n\n/-- The number appearing in the lower bound. -/\ndef RequiredQuestionLowerBound : Nat := 2016\n\n/-- An allowed query is an unordered pair of two distinct towns. -/\nabbrev TownPair : Type := {p : Sym2 Town // ¬ p.IsDiag}\n\n/-- There are exactly 2016 allowed unordered pairs of distinct towns. -/\ntheorem card_townPair : Fintype.card TownPair = RequiredQuestionLowerBound := by\n rw [Sym2.card_subtype_not_diag]\n rfl\n\n/-- A possible unknown road configuration: a simple undirected graph on the towns. -/\nabbrev Graph : Type := SimpleGraph Town\n\n/-- The road status attached to an unordered pair of vertices in a simple graph.\nThe proof of symmetry is used to make this a well-defined function on `Sym2 Town`. -/\nnoncomputable def sym2Adj (G : Graph) (p : Sym2 Town) : Prop :=\n Sym2.lift ⟨fun a b => G.Adj a b, fun a b => propext (G.adj_comm a b)⟩ p\n\n/-- The yes/no road status of an allowed query: an unordered pair of two distinct\ntowns. -/\nnoncomputable def pairAdj (G : Graph) (p : TownPair) : Prop :=\n sym2Adj G p.1\n\n/-- On a concrete off-diagonal pair `s(a, b)`, `pairAdj` is precisely the graph\nadjacency relation between `a` and `b`. -/\ntheorem pairAdj_mk (G : Graph) {a b : Town}\n (h : ¬ (s(a, b) : Sym2 Town).IsDiag) :\n pairAdj G ⟨s(a, b), h⟩ ↔ G.Adj a b := by\n simp [pairAdj, sym2Adj]\n\n/-- Every two towns are mutually reachable. -/\ndef AllMutuallyReachable (G : Graph) : Prop :=\n ∀ u v : Town, G.Reachable u v\n\n/-- On a nonempty vertex set, the preceding predicate is the graph-theoretic\nnotion of connectedness. -/\ntheorem allMutuallyReachable_iff_connected (G : Graph) :\n AllMutuallyReachable G ↔ G.Connected := by\n constructor\n · intro h\n exact SimpleGraph.Connected.mk (fun u v => h u v)\n · intro h u v\n exact h u v\n\n/-- A deterministic adaptive query algorithm, represented as a finite binary\ndecision tree. At a query node, the left subtree is followed after a `yes`\nanswer and the right subtree after a `no` answer. A leaf returns the algorithm's\nBoolean answer. -/\ninductive QueryTree : Type where\n | leaf : Bool → QueryTree\n | query : TownPair → QueryTree → QueryTree → QueryTree\n\nnamespace QueryTree\n\n/-- Run a decision tree on a graph, following the answers given by the graph. -/\nnoncomputable def run : QueryTree → Graph → Bool\n | .leaf answer, _ => answer\n | .query p yesBranch noBranch, G =>\n if pairAdj G p then run yesBranch G else run noBranch G\n\n/-- Number of questions asked by one run of a decision tree on a graph. -/\nnoncomputable def queryCount : QueryTree → Graph → Nat\n | .leaf _, _ => 0\n | .query p yesBranch noBranch, G =>\n if pairAdj G p then 1 + queryCount yesBranch G\n else 1 + queryCount noBranch G\n\n/-- The algorithm is guaranteed to decide connectedness correctly on every\nsimple graph on the 64 towns. -/\ndef Correct (T : QueryTree) : Prop :=\n ∀ G : Graph, T.run G = true ↔ G.Connected\n\n/-- The worst-case number of questions asked by a decision tree, maximized over\nall possible road configurations. -/\nnoncomputable def worstCaseQueries (T : QueryTree) : Nat :=\n Finset.univ.sup (fun G : Graph => T.queryCount G)\n\nend QueryTree\n\n/-- The formal target: every correct deterministic adaptive algorithm for\nconnectedness on 64 towns has worst-case query count at least 2016. -/\ndef Target : Prop :=\n ∀ T : QueryTree, T.Correct → RequiredQuestionLowerBound ≤ T.worstCaseQueries\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "012ad00c-45e5-52e9-b03e-cf1e9272a28d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4ce8f24a1a190e92e7919dc27dba2ded71c33b50fcda0e879d396bc2a5ac28f9", "task_path": "tasks/nmp3_012ad00c-45e5-52e9-b03e-cf1e9272a28d", "metadata": {"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"}} {"task_id": "nmp3_012d67cc-72b6-5f2f-9702-898a85c25dc1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- \n-- \\[\n-- \\frac{a+b}{\\sqrt{a+b-c}}+\\frac{b+c}{\\sqrt{b+c-a}}+\\frac{c+a}{\\sqrt{c+a-b}}\\ge 6.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the three-variable triangle inequality\n\nThe source problem asks us to prove an inequality under the assumptions that\n`a`, `b`, and `c` are positive side lengths of a (nondegenerate) triangle and\nthat their squared sum is `3`.\n-/\n\nnamespace Problem\n\n/-- The three side lengths are strictly positive. -/\ndef PositiveSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The three strict triangle inequalities. -/\ndef TriangleInequalities (a b c : ℝ) : Prop :=\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- `a`, `b`, and `c` are positive side lengths of a nondegenerate triangle. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n PositiveSideLengths a b c ∧ TriangleInequalities a b c\n\n/-- The normalization condition `a^2 + b^2 + c^2 = 3`. -/\ndef SquaredSumEqualsThree (a b c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 = 3\n\n/-- All hypotheses of the source problem, in their original order. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositiveSideLengths a b c ∧\n TriangleInequalities a b c ∧\n SquaredSumEqualsThree a b c\n\n/-- The left-hand side of the requested inequality. -/\nnoncomputable def TriangleInequalityLHS (a b c : ℝ) : ℝ :=\n (a + b) / Real.sqrt (a + b - c) +\n (b + c) / Real.sqrt (b + c - a) +\n (c + a) / Real.sqrt (c + a - b)\n\n/-- The complete assertion to be proved in the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → TriangleInequalityLHS a b c ≥ 6\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "012d67cc-72b6-5f2f-9702-898a85c25dc1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "787d5a551d8531b35933f3b03184aaefab14f962597358bc26a7f1f401bfbb10", "task_path": "tasks/nmp3_012d67cc-72b6-5f2f-9702-898a85c25dc1", "metadata": {"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"}} {"task_id": "nmp3_014b7c63-da53-59ca-bf80-812e5fd6a70e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- \\[\n-- \\Bigl|\\, -1+\\prod_{j\\in I}(1+a_j)\\Bigr|\\le\\frac12.\n-- \\] \n-- Prove that \n-- \\[\n-- \\sum_{j=1}^{n}|a_j|\\le 3.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the complex product-perturbation problem\n\nLet `n` be a positive integer and let `a : Fin n → ℂ` be a finite family of complex\nnumbers. If, for every nonempty subset `I` of the index set, the complex number\n`-1 + ∏_{j ∈ I} (1 + a j)` has modulus at most `1 / 2`, then the sum of the moduli\nof the `a j` is at most `3`.\n\nThis file only records the statement as a proposition. No proof is supplied.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The hypothesis of the problem: every nonempty subset of the index set satisfies\nthe stated modulus bound. -/\ndef Hypothesis (n : ℕ) (a : Fin n → ℂ) : Prop :=\n ∀ I : Finset (Fin n), I.Nonempty →\n ‖(-1 : ℂ) + ∏ j ∈ I, ((1 : ℂ) + a j)‖ ≤ (1 / 2 : ℝ)\n\n/-- The conclusion of the problem: the sum of the moduli of the `a j` is at most\n`3`. -/\ndef Conclusion (n : ℕ) (a : Fin n → ℂ) : Prop :=\n (∑ j : Fin n, ‖a j‖) ≤ (3 : ℝ)\n\n/-- The complete assertion to be proved, with the positivity of `n` and the choice\nof the complex family made explicit. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 0 < n → ∀ a : Fin n → ℂ, Hypothesis n a → Conclusion n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "014b7c63-da53-59ca-bf80-812e5fd6a70e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ae0ead6f4cf293ac41f1e677f9de9a7d554d6647e591311959a777a7c6991a14", "task_path": "tasks/nmp3_014b7c63-da53-59ca-bf80-812e5fd6a70e", "metadata": {"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"}} {"task_id": "nmp3_015b38ab-676d-50d5-8783-ed229d4f1093", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\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}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe source asks, for positive real numbers `a`, `b`, and `c`, to prove the\nstated three-term inequality. This file records only the proposition; it does\nnot supply a proof.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and\n`c`, the three-term cyclic expression on the left is at least the three-term\ncyclic expression on the right. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n (a * b) / (c * (c + a)) +\n (b * c) / (a * (a + b)) +\n (c * a) / (b * (b + c)) ≥\n a / (c + a) + b / (a + b) + c / (b + c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "015b38ab-676d-50d5-8783-ed229d4f1093", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f12d869951e8b727d09928384c8eec5b0982221c8c81553949fe707ef4bfb35b", "task_path": "tasks/nmp3_015b38ab-676d-50d5-8783-ed229d4f1093", "metadata": {"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"}} {"task_id": "nmp3_015ccf91-a35d-5ad9-a703-d3a64c6bca82", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sqrt{a^{2}+bc}+\\sqrt{b^{2}+ca}+\\sqrt{c^{2}+ab}\\le\\frac32\\,(a+b+c).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable radical inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\n`sqrt (a^2 + b*c) + sqrt (b^2 + c*a) + sqrt (c^2 + a*b) ≤ (3/2)*(a+b+c)`.\n\nThis module contains only the statement (as a proposition-valued definition);\nit does not assert or prove the proposition.\n-/\n\nnamespace Problem\n\n/-- The assertion of the source problem: for all positive reals `a`, `b`, `c`,\nthe sum of the three square roots is at most `3/2` times their sum. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n Real.sqrt (a ^ 2 + b * c) +\n Real.sqrt (b ^ 2 + c * a) +\n Real.sqrt (c ^ 2 + a * b) ≤\n (3 / 2 : ℝ) * (a + b + c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "015ccf91-a35d-5ad9-a703-d3a64c6bca82", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "46c95779d4978ed7a547d7f2f59b0bd351ca51c2299a56c24379a24acfb1073f", "task_path": "tasks/nmp3_015ccf91-a35d-5ad9-a703-d3a64c6bca82", "metadata": {"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"}} {"task_id": "nmp3_019fe152-b07d-5333-ad03-4bc0a34c3e00", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\mathbb N$ denote the set of non‑negative integers and let $f:\\mathbb N\\to\\mathbb N$ satisfy \n-- \\[\n-- f\\big(f\\big(f(n)\\big)\\big)0$ and $A+B+C=\\pi$). Prove that \n-- \\[\n-- \\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\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Triangle-angle cosine inequality\n\nThis file formalizes the statement of the problem. The target is stated as a\nproposition-valued definition; no proof of the inequality is supplied.\n-/\n\nnamespace Problem\n\n/-- `IsTriangleInteriorAngles A B C` says that the real numbers `A`, `B`, and\n`C` are positive and sum to `π`, the characteristic angle conditions for the\nthree interior angles of a (nondegenerate) Euclidean triangle. -/\ndef IsTriangleInteriorAngles (A B C : ℝ) : Prop :=\n 0 < A ∧ 0 < B ∧ 0 < C ∧ A + B + C = Real.pi\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def TriangleCosineExpression (A B C : ℝ) : ℝ :=\n Real.cos A * Real.cos ((B - C) / 2) +\n Real.cos B * Real.cos ((C - A) / 2) +\n Real.cos C * Real.cos ((A - B) / 2)\n\n/-- The inequality asserted in the problem for a particular angle triple. -/\nnoncomputable def TriangleCosineInequality (A B C : ℝ) : Prop :=\n TriangleCosineExpression A B C ≤ (3 : ℝ) / 2\n\n/-- The assertion to be proved: for all real angles `A`, `B`, and `C` that\nare positive and sum to `π`, the triangle-angle cosine expression is at most\n`3 / 2`. Trigonometry is interpreted in radians, as indicated by the angle\nsum being `π`. -/\nnoncomputable def Target : Prop :=\n ∀ A B C : ℝ,\n IsTriangleInteriorAngles A B C → TriangleCosineInequality A B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "01a8f6df-ed6d-5ebf-ad3d-05faa93c3a61", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "74091bf1101a35b5971242afd4e4a34618b0adfbedaa1369f63e9fb25565baf9", "task_path": "tasks/nmp3_01a8f6df-ed6d-5ebf-ad3d-05faa93c3a61", "metadata": {"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"}} {"task_id": "nmp3_01b614de-cbf9-5830-865f-65e17dd783e0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- \\[\n-- |a_i-a_j|\\ge\\frac1{i+j}\\qquad\\text{for all }i\\neq j.\n-- \\] \n-- Prove that $c\\ge 1\\,.\nimport Mathlib\n\n/-!\n# Formal statement of the sequence separation bound problem\n\nThe source problem indexes the sequence by positive integers. We therefore\nmodel it as a function on `ℕ+` (the positive natural numbers). The constant\n`c` is universally quantified among the real constants satisfying the stated\nnonnegativity/upper-bound condition, which is the standard reading in which the\nconclusion `c ≥ 1` refers to the bound appearing in the hypothesis.\n-/\n\nnamespace Problem\n\n/-- Every term of the sequence is nonnegative and bounded above by `c`. -/\ndef NonnegativeBounded (a : ℕ+ → ℝ) (c : ℝ) : Prop :=\n ∀ i : ℕ+, 0 ≤ a i ∧ a i ≤ c\n\n/-- Distinct terms are separated by at least `1 / (i + j)`, where `i + j`\nis addition in the positive natural numbers. -/\ndef PairwiseSeparated (a : ℕ+ → ℝ) : Prop :=\n ∀ i j : ℕ+, i ≠ j →\n (1 : ℝ) / ((i + j : ℕ+) : ℝ) ≤ |a i - a j|\n\n/-- The hypotheses of the problem for a sequence and a real upper bound `c`. -/\ndef Admissible (a : ℕ+ → ℝ) (c : ℝ) : Prop :=\n NonnegativeBounded a c ∧ PairwiseSeparated a\n\n/-- The assertion to be proved: every admissible real upper bound is at least `1`. -/\ndef Target : Prop :=\n ∀ (a : ℕ+ → ℝ) (c : ℝ), Admissible a c → (1 : ℝ) ≤ c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "01b614de-cbf9-5830-865f-65e17dd783e0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f2c074280c4bffe9e2501e54c3fcb239ae27ee8a813a9b64b93fae14a050f537", "task_path": "tasks/nmp3_01b614de-cbf9-5830-865f-65e17dd783e0", "metadata": {"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"}} {"task_id": "nmp3_021e0854-40f1-5b92-a02c-cb1adfe36448", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- \\[\n-- \\frac{a^{2}b+b^{2}c+c^{2}a}{ab^{2}+bc^{2}+ca^{2}}=\\frac{7}{9}.\n-- \\] \n-- Prove that \n-- \\[\n-- 3(a^{3}+b^{3}+c^{3})+4(ab+bc+ca)+a+b+c\\;\\ge\\;6\\bigl(a^{2}+b^{2}+c^{2}+2abc\\bigr).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- `a`, `b`, and `c` are the side lengths of a nondegenerate triangle:\nthey are positive and satisfy all three strict triangle inequalities. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The ratio condition from the problem, using ordinary real division. -/\ndef RatioCondition (a b c : ℝ) : Prop :=\n (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a) /\n (a * b ^ 2 + b * c ^ 2 + c * a ^ 2) = 7 / 9\n\n/-- The hypotheses of the problem: triangle side lengths and the required ratio. -/\ndef Admissible (a b c : ℝ) : Prop :=\n IsTriangleSideLengths a b c ∧ RatioCondition a b c\n\n/-- The inequality asserted in the conclusion of the problem. -/\ndef InequalityConclusion (a b c : ℝ) : Prop :=\n 3 * (a ^ 3 + b ^ 3 + c ^ 3) +\n 4 * (a * b + b * c + c * a) + a + b + c ≥\n 6 * (a ^ 2 + b ^ 2 + c ^ 2 + 2 * a * b * c)\n\n/-- The complete universal proposition to be proved. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → InequalityConclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "021e0854-40f1-5b92-a02c-cb1adfe36448", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "49fe9033e157daf8f4ed6d3f939e89eea5bbc2d53d1014fce92867b44f830af2", "task_path": "tasks/nmp3_021e0854-40f1-5b92-a02c-cb1adfe36448", "metadata": {"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"}} {"task_id": "nmp3_02238f43-7f2d-5df3-b7b4-adb506e098e8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers such that $xyz\\ge 1$. Prove that \n-- \\[\n-- \\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.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypothesis that `x`, `y`, and `z` are positive real numbers whose\nproduct is at least one. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ 1 ≤ x * y * z\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n (x ^ 5 - x ^ 2) / (x ^ 5 + y ^ 2 + z ^ 2) +\n (y ^ 5 - y ^ 2) / (x ^ 2 + y ^ 5 + z ^ 2) +\n (z ^ 5 - z ^ 2) / (x ^ 2 + y ^ 2 + z ^ 5)\n\n/-- The inequality asserted by the problem, for fixed positive reals whose\nproduct is at least one. -/\ndef Inequality (x y z : ℝ) : Prop :=\n lhs x y z ≥ 0\n\n/-- The full universally quantified statement of the problem: for every triple\nof positive real numbers with product at least one, the displayed sum is\nnonnegative. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "02238f43-7f2d-5df3-b7b4-adb506e098e8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "52ae1062408236a268fbfc3742913df481220c8ca1204ec9b7acc797bd263ff3", "task_path": "tasks/nmp3_02238f43-7f2d-5df3-b7b4-adb506e098e8", "metadata": {"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"}} {"task_id": "nmp3_022a8bd3-1846-58e5-942c-bf545cedbf49", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- \\frac{a+b}{a^{2}+b^{2}}+\\frac{b+c}{b^{2}+c^{2}}+\\frac{c+a}{c^{2}+a^{2}}\n-- \\;\\ge\\;\n-- \\frac{3\\,(a^{3}+b^{3}+c^{3})}{a^{4}+b^{4}+c^{4}}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement: cyclic rational inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`, the\ninequality\n\n`(a + b) / (a^2 + b^2) + (b + c) / (b^2 + c^2) + (c + a) / (c^2 + a^2)\n ≥ 3 * (a^3 + b^3 + c^3) / (a^4 + b^4 + c^4)`.\n\nThis file only records the statement; it does not contain a proof.\n-/\n\nnamespace Problem\n\n/-- The triple `(a, b, c)` consists of strictly positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a + b) / (a ^ 2 + b ^ 2) +\n (b + c) / (b ^ 2 + c ^ 2) +\n (c + a) / (c ^ 2 + a ^ 2)\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 3 * (a ^ 3 + b ^ 3 + c ^ 3) / (a ^ 4 + b ^ 4 + c ^ 4)\n\n/-- The inequality asserted in the source problem, for a fixed triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete universal proposition asserted by the source problem: for every\ntriple of strictly positive real numbers, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "022a8bd3-1846-58e5-942c-bf545cedbf49", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "34e472ec253619aea43fbac503a54a9156aa77473614ea8d08d734e9d4d5d98f", "task_path": "tasks/nmp3_022a8bd3-1846-58e5-942c-bf545cedbf49", "metadata": {"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"}} {"task_id": "nmp3_0267c852-08a2-5017-b249-a7b6673d8932", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A rational number $x$ is given. Prove that there exists a sequence of rational numbers $x_0,x_1,x_2,\\dots$ such that \n-- \n-- (a) $x_0=x$; \n-- \n-- (b) for every $n\\ge 1$, either $x_n=2x_{\\,n-1}$ or $x_n=2x_{\\,n-1}+\\frac1n$; \n-- \n-- (c) $x_n$ is an integer for some $n$.\nimport Mathlib.Data.Rat.Defs\n\n/-!\n# Formalization of the rational sequence problem\n\nThe problem asks: for every rational number `x`, there is a sequence\n`x_0, x_1, x_2, ...` of rational numbers satisfying the initial condition,\nthe prescribed recurrence alternatives, and eventually attaining an integer\nvalue.\n\nThis file only states the assertion; it contains no proof of it.\n-/\n\nnamespace Problem\n\n/-- A rational number is an integer when it is the image of some integer under\nthe canonical coercion `ℤ → ℚ`. This makes explicit that \"integer\" allows\nnegative integers as well as nonnegative ones. -/\ndef IsInteger (q : ℚ) : Prop :=\n ∃ z : ℤ, q = (z : ℚ)\n\n/-- `AdmissibleSequence x xSeq` says that the rational sequence `xSeq` has the\nthree properties required by the problem for the given rational number `x`.\n\nThe index type is `ℕ`, so the sequence begins at index `0`; clause (b) only\nquantifies over indices `n` with `1 ≤ n`. Clause (c) is interpreted literally\nas asking for some natural index `n` (possibly `0`) whose term is an integer. -/\ndef AdmissibleSequence (x : ℚ) (xSeq : ℕ → ℚ) : Prop :=\n xSeq 0 = x ∧\n (∀ n : ℕ, 1 ≤ n →\n xSeq n = 2 * xSeq (n - 1) ∨\n xSeq n = 2 * xSeq (n - 1) + 1 / (n : ℚ)) ∧\n ∃ n : ℕ, IsInteger (xSeq n)\n\n/-- The full statement: every rational number `x` admits a sequence of\nrational numbers satisfying conditions (a), (b), and (c). -/\ndef Target : Prop :=\n ∀ x : ℚ, ∃ xSeq : ℕ → ℚ, AdmissibleSequence x xSeq\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0267c852-08a2-5017-b249-a7b6673d8932", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "62f133837aa95cef8b2fd767ae117487df8aac49795279d07998aee093957993", "task_path": "tasks/nmp3_0267c852-08a2-5017-b249-a7b6673d8932", "metadata": {"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"}} {"task_id": "nmp3_0278239b-800e-5aea-82c9-11a2d68dcf8c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, $c$ be positive real numbers. Prove that\n-- \\[\n-- \\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}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a three-variable real inequality\n\nThe source problem asks to prove an inequality for three positive real numbers.\nThis file contains only the formal statement; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- `a`, `b`, and `c` are positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The inequality asserted in the source problem, for arbitrary real `a`, `b`, `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a / (b + c) + b / (c + a) + c / (a + b) ≥\n (3 : ℝ) / 2 +\n (2 * (a ^ 3 + b ^ 3 + c ^ 3 - 3 * (a * b * c))) /\n ((a + b + c) ^ 3)\n\n/-- The complete statement to be proved: for every triple of positive real numbers,\nthe asserted inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0278239b-800e-5aea-82c9-11a2d68dcf8c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "64fb31569330e09dabdde718f867711dec4572b6981f6a585742a0de1b759002", "task_path": "tasks/nmp3_0278239b-800e-5aea-82c9-11a2d68dcf8c", "metadata": {"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"}} {"task_id": "nmp3_029bf7ff-39bf-585e-b5b2-52d06b233a45", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\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}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic cubic inequality\n\nThe original problem asks, for positive `a`, `b`, and `c`, to prove\nthe stated three-term lower bound. The division operations below are\nreal division, and the positivity hypotheses make every denominator\nstrictly positive.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\ndef LHS (a b c : ℝ) : ℝ :=\n ((a + b) * (b + c)) / (c ^ 3 + a ^ 3) +\n ((b + c) * (c + a)) / (a ^ 3 + b ^ 3) +\n ((c + a) * (a + b)) / (b ^ 3 + c ^ 3)\n\n/-- The right-hand side of the target inequality. -/\ndef RHS (a b c : ℝ) : ℝ :=\n 2 * (a + b + c) ^ 3 / (a ^ 2 + b ^ 2 + c ^ 2) ^ 2\n\n/-- The inequality asserted for a fixed triple of positive reals. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ RHS a b c\n\n/--\nThe universal statement of the problem: for all positive real numbers\n`a`, `b`, and `c`, the stated cyclic inequality holds.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "029bf7ff-39bf-585e-b5b2-52d06b233a45", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ad9a6f842a617ae65dc074c4fc505952ea6806c138b9612c2cd28405ba0a8370", "task_path": "tasks/nmp3_029bf7ff-39bf-585e-b5b2-52d06b233a45", "metadata": {"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"}} {"task_id": "nmp3_02ccf615-e889-5fdf-950e-6132d227fc43", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,\\;y,\\;z>0$ be real numbers. Prove that\n-- \\[\n-- x^4+y^4+z^4+1+2xyz\\;\\ge\\;x^2+y^2+z^2+x^2y^2+y^2z^2+z^2x^2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a three-variable real polynomial inequality\n\nThe source problem asks to prove, for positive reals `x`, `y`, and `z`, that\n\n`x^4 + y^4 + z^4 + 1 + 2xyz ≥ x^2 + y^2 + z^2 + x^2y^2 + y^2z^2 + z^2x^2`.\n\nThe declarations below only state the problem. No proof of the inequality is\nincluded; in particular, `Problem.Target` is a `Prop`-valued definition whose\nbody is the assertion to be proved.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (x y z : ℝ) : ℝ :=\n x ^ 4 + y ^ 4 + z ^ 4 + 1 + 2 * x * y * z\n\n/-- The right-hand side of the displayed inequality. -/\ndef rhs (x y z : ℝ) : ℝ :=\n x ^ 2 + y ^ 2 + z ^ 2 + x ^ 2 * y ^ 2 + y ^ 2 * z ^ 2 + z ^ 2 * x ^ 2\n\n/--\nFor all positive real numbers `x`, `y`, and `z`, the polynomial on the\nleft-hand side of the displayed inequality is at least the polynomial on the\nright-hand side.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → lhs x y z ≥ rhs x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "02ccf615-e889-5fdf-950e-6132d227fc43", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "67df20591b52ea881c537a188c09646b415652383a7db86bef4055e1dc4566c0", "task_path": "tasks/nmp3_02ccf615-e889-5fdf-950e-6132d227fc43", "metadata": {"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"}} {"task_id": "nmp3_02ed466f-1103-5bfc-b26c-1d19fd7e2991", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be non‑negative real numbers satisfying $ab+bc+ca>0$. Prove that \n-- \\[\n-- \\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.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the non-negative real inequality\n\nThe source asks to prove an inequality for all non-negative real numbers\n`a`, `b`, and `c` satisfying `a * b + b * c + c * a > 0`. The definition\nbelow only states that proposition; it contains no proof.\n-/\n\nnamespace Problem\n\n/-- The target proposition: for all non-negative real numbers `a`, `b`, and\n`c` satisfying `a * b + b * c + c * a > 0`, the displayed sum of four\nfractions is at least `6`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n 0 < a * b + b * c + c * a →\n a ^ 2 / (a ^ 2 + b * c)\n + b ^ 2 / (b ^ 2 + c * a)\n + c ^ 2 / (c ^ 2 + a * b)\n + ((a + b + c) ^ 3 + 9 * a * b * c)\n / ((a + b) * (b + c) * (c + a)) ≥ 6\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "02ed466f-1103-5bfc-b26c-1d19fd7e2991", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "275913f71860f43f5a2467b4dfb9c119030ac34f4523f20542ce8d1838f3eab0", "task_path": "tasks/nmp3_02ed466f-1103-5bfc-b26c-1d19fd7e2991", "metadata": {"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"}} {"task_id": "nmp3_032d2e17-1214-5940-bdfa-af061e9b9e94", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) satisfy \\(ab+bc+ca=3\\). Prove that \n-- \\[\n-- \\frac{a}{2a+b^{2}}+\\frac{b}{2b+c^{2}}+\\frac{c}{2c+a^{2}}\\le 1 .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility condition for the parameters `a`, `b`, and `c`:\nthey are positive real numbers satisfying `ab + bc + ca = 3`. -/\ndef admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = 3\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / (2 * a + b ^ 2) + b / (2 * b + c ^ 2) + c / (2 * c + a ^ 2)\n\n/-- The assertion of the problem: for all positive real `a`, `b`, and `c`\nwith `ab + bc + ca = 3`, the indicated sum is at most `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, admissible a b c → lhs a b c ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "032d2e17-1214-5940-bdfa-af061e9b9e94", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f49f5e2dcab4080caabc47e46c9738715f017e940f5ab64f3fc9d903f619d2f1", "task_path": "tasks/nmp3_032d2e17-1214-5940-bdfa-af061e9b9e94", "metadata": {"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"}} {"task_id": "nmp3_03504ebf-70b6-53bb-80db-700cfe58e144", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 $\\triangle EMN$ again at $R$. Prove that $\\displaystyle\\angle ARC = 90^\\circ$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.Convex.Between\nimport Mathlib.Geometry.Euclidean.Circumcenter\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\nnoncomputable section\n\nopen scoped Affine EuclideanGeometry\nopen EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane used to state the problem. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `D` is the point where the internal bisector of `∠BAC` meets the open side `BC`.\nThe strict betweenness `Sbtw ℝ B D C` puts `D` in the interior of segment `BC`, and the\nangle equality is the internal-bisector condition at `A`. -/\ndef IsInternalBisectorFoot (A B C D : Plane) : Prop :=\n Sbtw ℝ B D C ∧ EuclideanGeometry.angle B A D = EuclideanGeometry.angle D A C\n\n/-- `E` is the second intersection of the line `AD` with the circle `Ω`: the line passes\nthrough `A`, the point `E` is on the same circle, and `E` is not the already known\nintersection `A`. -/\ndef IsSecondIntersectionOfLine\n (Ω : EuclideanGeometry.Sphere Plane) (A D E : Plane) : Prop :=\n A ∈ Ω ∧ E ∈ Ω ∧ E ≠ A ∧ E ∈ line[ℝ, A, D]\n\n/-- The sphere `Ω` is the circle with center `O` passing through `A`, `B`, and `C`. -/\ndef IsCircleThrough\n (Ω : EuclideanGeometry.Sphere Plane) (O A B C : Plane) : Prop :=\n Ω.center = O ∧ 0 < Ω.radius ∧ A ∈ Ω ∧ B ∈ Ω ∧ C ∈ Ω\n\n/-- The full hypothesis configuration of the problem.\n\n`ABC` and `EMN` are nondegenerate triangles, represented as `Affine.Triangle`, so that\nthe circumcircle `EMN.circumsphere` is the usual unique circumcircle of `E`, `M`, and `N`.\nThe points `A`, `B`, `M`, etc. occurring in the source statement are the corresponding\nsimplex vertices or the explicitly named points below. -/\ndef Configuration\n (ABC : Affine.Triangle ℝ Plane)\n (O : Plane)\n (Ω : EuclideanGeometry.Sphere Plane)\n (D E M N : Plane)\n (EMN : Affine.Triangle ℝ Plane)\n (R : Plane) : Prop :=\n let A : Plane := ABC.points 0\n let B : Plane := ABC.points 1\n let C : Plane := ABC.points 2\n IsCircleThrough Ω O A B C ∧\n IsInternalBisectorFoot A B C D ∧\n IsSecondIntersectionOfLine Ω A D E ∧\n M = midpoint ℝ A D ∧\n N = midpoint ℝ A C ∧\n EMN.points 0 = E ∧\n EMN.points 1 = M ∧\n EMN.points 2 = N ∧\n R ≠ M ∧\n R ∈ EMN.circumsphere ∧\n R ∈ line[ℝ, M, B]\n\n/-- The assertion to be proved: in every configuration satisfying the hypotheses of the\nproblem, the angle `∠ARC` is a right angle. -/\ndef Target : Prop :=\n ∀ (ABC : Affine.Triangle ℝ Plane)\n (O : Plane)\n (Ω : EuclideanGeometry.Sphere Plane)\n (D E M N : Plane)\n (EMN : Affine.Triangle ℝ Plane)\n (R : Plane),\n Configuration ABC O Ω D E M N EMN R →\n EuclideanGeometry.angle (ABC.points 0) R (ABC.points 2) = Real.pi / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "03504ebf-70b6-53bb-80db-700cfe58e144", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3e7b2a23904dfea6b39f6da6d113333ebc21c5f69ba5b6be39a59967074a036d", "task_path": "tasks/nmp3_03504ebf-70b6-53bb-80db-700cfe58e144", "metadata": {"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"}} {"task_id": "nmp3_037228b9-fcbc-5108-a04c-39989f6a03e7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- \\[\n-- \\min\\{|A|,|B|\\}\\le \\log_2 n\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the product-plus-one square problem\n\nThe source problem asks, for every integer `n ≥ 4`, for subsets `A` and `B` of\n`{1, 2, ..., n}` with `a * b + 1` a perfect square for every `a ∈ A` and\n`b ∈ B`, to prove that `min (|A|, |B|) ≤ log₂ n`.\n\nWe represent subsets of the finite set `S` by `Finset`s together with an\nexplicit subset condition. The logarithm is the real base-two logarithm.\n-/\n\nnamespace Problem\n\n/-- The finite set `S = {1, 2, ..., n}`. -/\ndef S (n : ℕ) : Finset ℕ := Finset.Icc (1 : ℕ) n\n\n/-- A natural number is a perfect square when it is the square of a natural number. -/\ndef IsPerfectSquare (m : ℕ) : Prop := ∃ k : ℕ, m = k ^ 2\n\n/-- The condition that `a * b + 1` is a perfect square for all `a ∈ A`, `b ∈ B`. -/\ndef PairwiseProductPlusOneSquare (A B : Finset ℕ) : Prop :=\n ∀ a ∈ A, ∀ b ∈ B, IsPerfectSquare (a * b + 1)\n\n/-- `A` and `B` are subsets of `S n` and satisfy the product-plus-one condition. -/\ndef AdmissiblePair (n : ℕ) (A B : Finset ℕ) : Prop :=\n A ⊆ S n ∧ B ⊆ S n ∧ PairwiseProductPlusOneSquare A B\n\n/-- The minimum of the two cardinalities, regarded as a real number. -/\ndef MinCardinality (A B : Finset ℕ) : ℝ :=\n ((min A.card B.card : ℕ) : ℝ)\n\n/-- The real base-two logarithm of `n`. -/\nnoncomputable def LogBaseTwo (n : ℕ) : ℝ := Real.logb 2 (n : ℝ)\n\n/-- The asserted upper bound `min (|A|, |B|) ≤ log₂ n`. -/\ndef Bound (n : ℕ) (A B : Finset ℕ) : Prop :=\n MinCardinality A B ≤ LogBaseTwo n\n\n/-- The full mathematical assertion of the problem.\n\nFor every natural number `n` with `n ≥ 4`, and for every pair of finite subsets\n`A` and `B` of `S n` satisfying the square condition, the smaller of the two\ncardinalities is at most the real base-two logarithm of `n`. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 4 ≤ n → ∀ (A B : Finset ℕ),\n AdmissiblePair n A B → Bound n A B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "037228b9-fcbc-5108-a04c-39989f6a03e7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8353e2fbee493f11064b9609df839d1f87850bc463e46efc4b379447f186c144", "task_path": "tasks/nmp3_037228b9-fcbc-5108-a04c-39989f6a03e7", "metadata": {"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"}} {"task_id": "nmp3_0378cb21-a34c-5e6c-9e25-3f667bcfcfb3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k,n\\in\\mathbb N$ (positive integers). Prove that \n-- $$n(n+1)\\mid (k+1)!\\bigl(1^k+2^k+\\cdots+n^k\\bigr).$$\nimport Mathlib\n\n/-!\n# Formalization of the divisibility statement\n\nThe source problem asks, for positive integers `k` and `n`, to prove that\n`n * (n + 1)` divides `(k + 1)! * (1^k + 2^k + ... + n^k)`.\n\nThis file only states the target proposition. It deliberately contains no\nproof of that proposition.\n-/\n\nnamespace Problem\n\n/-- The power sum `1^k + 2^k + ... + n^k`, represented as a finite sum over\nthe indices `0, ..., n - 1` shifted by one. -/\ndef PowerSum (n k : ℕ) : ℕ :=\n ∑ i ∈ Finset.range n, (i + 1) ^ k\n\n/-- The assertion to be proved: for all positive integers `k` and `n`,\n`n(n+1)` divides `(k+1)!` times the power sum `1^k + ... + n^k`. -/\ndef Target : Prop :=\n ∀ k n : ℕ, 0 < k → 0 < n →\n n * (n + 1) ∣ Nat.factorial (k + 1) * PowerSum n k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0378cb21-a34c-5e6c-9e25-3f667bcfcfb3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dd428202799b33bce4839dcb89e310df6acb3424654b468f1f2790522831c8c1", "task_path": "tasks/nmp3_0378cb21-a34c-5e6c-9e25-3f667bcfcfb3", "metadata": {"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"}} {"task_id": "nmp3_03aa86d4-4d11-539b-bd23-c0c69054983d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers. Prove that \n-- \\[\n-- \\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}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem: for every triple of positive real numbers\n`x`, `y`, and `z`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n x ^ 4 / (8 * y ^ 3 + 5 * z ^ 3) +\n y ^ 4 / (8 * z ^ 3 + 5 * x ^ 3) +\n z ^ 4 / (8 * x ^ 3 + 5 * y ^ 3) ≥\n (x + y + z) / 13\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "03aa86d4-4d11-539b-bd23-c0c69054983d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "25e0c85cf3fba4ab8329de1a4a242505b13dfc0160b5a8236e9b2033df43265f", "task_path": "tasks/nmp3_03aa86d4-4d11-539b-bd23-c0c69054983d", "metadata": {"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"}} {"task_id": "nmp3_03b3d17e-db91-54bc-910a-841b090f6cf2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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$.\nimport Mathlib\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real coordinate space of dimension two. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The angle of 120 degrees, expressed in radians. -/\ndef angle120 : ℝ := 2 * Real.pi / 3\n\n/-- Three points form a genuine (nondegenerate) triangle. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- A point lies in the strict interior of the triangle, expressed using strictly positive\nbarycentric coordinates. -/\ndef StrictlyInsideTriangle (A B C P : Plane) : Prop :=\n ∃ x y z : ℝ,\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = 1 ∧\n P = x • A + y • B + z • C\n\n/-- All three interior angles of the triangle are strictly less than 120 degrees. -/\ndef InteriorAnglesLt120 (A B C : Plane) : Prop :=\n EuclideanGeometry.angle B A C < angle120 ∧\n EuclideanGeometry.angle A B C < angle120 ∧\n EuclideanGeometry.angle A C B < angle120\n\n/-- The three angles formed by the segments from a point to the vertices are all 120 degrees. -/\ndef SeesVerticesAt120 (A B C P : Plane) : Prop :=\n EuclideanGeometry.angle A P B = angle120 ∧\n EuclideanGeometry.angle B P C = angle120 ∧\n EuclideanGeometry.angle C P A = angle120\n\n/-- For every nondegenerate triangle all of whose interior angles are less than 120 degrees,\nthere exists a point in the strict interior of the triangle from which the three segments to\nthe vertices form three 120-degree angles. -/\ndef Target : Prop :=\n ∀ A B C : Plane,\n IsTriangle A B C →\n InteriorAnglesLt120 A B C →\n ∃ P : Plane, StrictlyInsideTriangle A B C P ∧ SeesVerticesAt120 A B C P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "03b3d17e-db91-54bc-910a-841b090f6cf2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "03f05103733ee699d26978d273aefb94faf519993b806a4e1e6b1a13469e92c7", "task_path": "tasks/nmp3_03b3d17e-db91-54bc-910a-841b090f6cf2", "metadata": {"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"}} {"task_id": "nmp3_03c1e611-d008-5e0b-b822-0dac2d0e6439", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 two coins, each neighbour gains one). Determine all possible initial distributions of the $n$ coins for which there exists a finite sequence of moves after which every child has exactly one coin.\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-!\n# Coins on a circle\n\nThis file formalizes the statement of the following problem.\n\nLet `n > 3` be a positive integer. `n` children sit in a circle and `n`\nidentical coins are distributed among them (some children may receive zero\ncoins). In one move a child who currently has at least two coins gives one\ncoin to each of its two immediate neighbours. The problem asks for all\ninitial distributions from which some finite sequence of such moves ends with\nexactly one coin at every child.\n\nChildren are represented by `Fin n`, labelled in cyclic order. A\ndistribution is a function `Fin n → ℕ`, so non-negativity is built into the\ntype and an unlimited supply of coins is not permitted by the initial\ncondition. The target condition is that the proposed complete-answer\npredicate holds exactly for the initial distributions from which the all-ones\nconfiguration is reachable.\n-/\n\n/-- The left neighbour of the child indexed by `i` on the cycle. -/\ndef leftNeighbor (n : ℕ) [NeZero n] (i : Fin n) : Fin n :=\n ⟨(i.val + n - 1) % n,\n Nat.mod_lt _ (Nat.pos_of_ne_zero (NeZero.ne n))⟩\n\n/-- The right neighbour of the child indexed by `i` on the cycle. -/\ndef rightNeighbor (n : ℕ) [NeZero n] (i : Fin n) : Fin n :=\n ⟨(i.val + 1) % n,\n Nat.mod_lt _ (Nat.pos_of_ne_zero (NeZero.ne n))⟩\n\n/-- The distribution obtained when child `i` gives one coin to each immediate\nneighbour. The subtraction is saturated at zero in `ℕ`; legal moves below\nrequire `2 ≤ c i`, so on every legal move it represents the actual loss of two\ncoins. The stated problem always has `n > 3`, hence `i` is distinct from its\ntwo neighbours and those neighbours are distinct from one another. -/\ndef fire (n : ℕ) [NeZero n] (i : Fin n) (c : Fin n → ℕ) : Fin n → ℕ :=\n fun j =>\n c j - (if j = i then 2 else 0) +\n (if j = leftNeighbor n i then 1 else 0) +\n (if j = rightNeighbor n i then 1 else 0)\n\n/-- One legal move: choose a child with at least two coins and fire that child. -/\ndef Move (n : ℕ) [NeZero n] (c d : Fin n → ℕ) : Prop :=\n ∃ i : Fin n, 2 ≤ c i ∧ d = fire n i c\n\n/-- The distribution in which every child has exactly one coin. -/\ndef allOnes (n : ℕ) : Fin n → ℕ :=\n fun _ => 1\n\n/-- There is a finite sequence of legal moves (possibly the empty sequence)\nfrom `c` to the all-ones configuration. -/\ndef ReachableToAllOnes (n : ℕ) [NeZero n] (c : Fin n → ℕ) : Prop :=\n Relation.ReflTransGen (Move n) c (allOnes n)\n\n/-- An initial distribution of exactly `n` coins among the `n` children. -/\ndef InitialDistribution (n : ℕ) (c : Fin n → ℕ) : Prop :=\n (∑ i : Fin n, c i) = n\n\n/-- The original admissibility condition for `n > 3`: `c` is an initial\ndistribution of `n` coins and can be transformed into the all-ones\ndistribution by a finite sequence of legal moves. The hypothesis `3 < n` is\nimmediately outside this predicate in `Target`. -/\ndef Admissible (n : ℕ) [NeZero n] (c : Fin n → ℕ) : Prop :=\n InitialDistribution n c ∧ ReachableToAllOnes n c\n\n/-- The first moment of a distribution, indexed by `0, ..., n - 1` around the\ncircle. A move at child `i` changes this by a multiple of `n`. -/\ndef Moment (n : ℕ) (c : Fin n → ℕ) : ℤ :=\n ∑ i : Fin n, (i.val : ℤ) * (c i : ℤ)\n\n/-- The invariant condition for the answer: the first moment is congruent\nmodulo `n` to the first moment of the all-ones distribution. With the fixed\ntotal number `n` of coins, this is a complete invariant on a cycle. -/\ndef MomentCondition (n : ℕ) (c : Fin n → ℕ) : Prop :=\n Int.ModEq (n : ℤ) (Moment n c) (Moment n (allOnes n))\n\n/-- The proposed complete answer: initial distributions of `n` coins whose\nfirst moment has the same residue modulo `n` as the all-ones configuration. -/\ndef AnswerCondition (n : ℕ) (c : Fin n → ℕ) : Prop :=\n InitialDistribution n c ∧ MomentCondition n c\n\n/-- A proposed answer predicate is complete when, in both directions, it holds\nexactly for the admissible distributions. Thus `answer c → Admissible c`\nrules out false positives and `Admissible c → answer c` rules out omissions. -/\ndef CompleteAnswer (n : ℕ) [NeZero n]\n (answer : (Fin n → ℕ) → Prop) : Prop :=\n ∀ c : Fin n → ℕ, answer c ↔ Admissible n c\n\n/-- The formal target statement for every integer `n > 3`: `AnswerCondition`\nis a complete classification of the initial distributions from which the\nall-ones distribution can be reached. Equivalently, it states both that every\ndistribution satisfying the moment condition is admissible and that every\nadmissible initial distribution satisfies the moment condition. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (hn : 3 < n),\n @CompleteAnswer n ⟨by omega⟩ (@AnswerCondition n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "03c1e611-d008-5e0b-b822-0dac2d0e6439", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2e854add150dbce025fdad06025036f8b9c1515997cc90efeee1981867a4a9b6", "task_path": "tasks/nmp3_03c1e611-d008-5e0b-b822-0dac2d0e6439", "metadata": {"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"}} {"task_id": "nmp3_03c7b87a-865f-59b3-830d-8684ee33b727", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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.\nimport Mathlib\n\n/-!\n# Formalization of a partition theorem for `k`-element subsets\n\nThe original problem: if `n > k ≥ 1`, `p` is prime and `p` divides\n`Nat.choose n k`, then the `k`-element subsets of `{1, ..., n}` admit a\npartition into `p` equal-size classes, and the class of a subset depends only\non the sum of its elements.\n\nWe represent the ground set `{1, ..., n}` as `Fin n` with the obvious\nidentification `i ↦ (i : ℕ) + 1`. Thus a `k`-element subset is a finite set\nof `Fin n` with cardinality `k`.\n-/\n\nnamespace Problem\n\n/-- The type of `k`-element subsets of the ground set `{1, ..., n}`.\n\nAn element `i : Fin n` is identified with the natural number `(i : ℕ) + 1`. -/\nabbrev KSubset (n k : ℕ) : Type :=\n {S : Finset (Fin n) // S.card = k}\n\n/-- The sum of the elements of a finite set of `Fin n`, after identifying\n`i : Fin n` with the natural number `i + 1`. -/\ndef finsetSum {n : ℕ} (S : Finset (Fin n)) : ℕ :=\n ∑ i ∈ S, ((i : ℕ) + 1)\n\n/-- The sum of the elements of a `k`-element subset of `{1, ..., n}`. -/\ndef subsetSum {n k : ℕ} (S : KSubset n k) : ℕ :=\n finsetSum S.1\n\n/-- A coloring by `Fin p` is an equal-size partition into `p` nonempty classes\nwhen it is surjective and all its fibers have the same cardinality.\n\nSurjectivity says that each of the `p` classes is nonempty, so this records the\nusual meaning of a partition into `p` classes. The common cardinality is\nexistentially quantified. -/\ndef EqualSizePartition {α : Type*} [Fintype α]\n (p : ℕ) (color : α → Fin p) : Prop :=\n Function.Surjective color ∧\n ∃ q : ℕ, ∀ i : Fin p,\n (Finset.univ.filter (fun a : α => color a = i)).card = q\n\n/-- The class assignment respects the sum of elements: two `k`-element\nsubsets with the same sum are assigned the same class. -/\ndef SameSumSameClass {n k p : ℕ} (color : KSubset n k → Fin p) : Prop :=\n ∀ S T : KSubset n k, subsetSum S = subsetSum T → color S = color T\n\n/-- The full assertion of the problem.\n\nFor all natural numbers `n`, `k`, and `p` with `n > k`, `k ≥ 1`, `p` prime,\nand `p ∣ Nat.choose n k`, there exists an assignment of the `k`-element\nsubsets of `{1, ..., n}` to `p` classes such that the classes form an\nequal-size partition into `p` nonempty classes, and any two subsets with equal\nelement sum lie in the same class. -/\ndef Target : Prop :=\n ∀ (n k p : ℕ), n > k → 1 ≤ k → Nat.Prime p → p ∣ Nat.choose n k →\n ∃ color : KSubset n k → Fin p,\n EqualSizePartition p color ∧ SameSumSameClass color\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "03c7b87a-865f-59b3-830d-8684ee33b727", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3f0447a12d7667d0adcde1d447e41376a71a00c596c2229dd3087989c9b7e1a3", "task_path": "tasks/nmp3_03c7b87a-865f-59b3-830d-8684ee33b727", "metadata": {"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"}} {"task_id": "nmp3_03cb7436-c3e8-51ce-9757-0cd3d507a2eb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k)_{k\\ge 1}$, defined by \n-- \\[\n-- a_k=\\Big\\lfloor\\frac{n^{k}}{k}\\Big\\rfloor,\n-- \\] \n-- are odd. (Here $\\lfloor x\\rfloor$ denotes the greatest integer not exceeding $x$.)\nimport Mathlib\n\nnamespace Problem\n\n/-- The sequence term\n`a_k = ⌊n^k / k⌋`, for an integer `n` and a positive integer index `k`.\nThe index type `ℕ+` is the subtype of natural numbers `k` with `k ≥ 1`;\n`n^k` is first formed as an integer and then regarded as a real number so\nthat the displayed quotient and floor have their usual mathematical meaning. -/\nnoncomputable def a (n : ℤ) (k : ℕ+) : ℤ :=\n ⌊(((n ^ (k : ℕ) : ℤ) : ℝ) / ((k : ℕ) : ℝ))⌋\n\n/-- The admissibility condition on the integer parameter `n`: `n > 1`. -/\ndef nAdmissible (n : ℤ) : Prop :=\n 1 < n\n\n/-- The set of positive indices at which the corresponding sequence term is odd. -/\ndef oddTermIndices (n : ℤ) : Set ℕ+ :=\n {k : ℕ+ | Odd (a n k)}\n\n/-- The conclusion that infinitely many terms of the sequence are odd, expressed\nas infinitude of the set of positive indices carrying odd terms. -/\ndef InfinitelyManyOddTerms (n : ℤ) : Prop :=\n (oddTermIndices n).Infinite\n\n/-- For every integer `n > 1`, infinitely many terms of the sequence\n`a_k = ⌊n^k / k⌋`, indexed by positive integers `k`, are odd. -/\ndef Target : Prop :=\n ∀ n : ℤ, nAdmissible n → InfinitelyManyOddTerms n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "03cb7436-c3e8-51ce-9757-0cd3d507a2eb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f47018341a19bcef7fcdc1d7363882694ae0e29b911ae78795aefc6a558965c6", "task_path": "tasks/nmp3_03cb7436-c3e8-51ce-9757-0cd3d507a2eb", "metadata": {"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"}} {"task_id": "nmp3_0433c78b-a393-52b8-8f85-9690f0eab56f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$ and $b$ be positive integers with $a-b>1$. Prove that there exist infinitely many positive integers $n$ such that \n-- $$n^2\\mid a^n-b^n.$$\nimport Mathlib\n\n/-!\n# Formalization of the target problem\n\nLet `a` and `b` be positive integers with `a - b > 1`. Then there are\ninfinitely many positive integers `n` for which `n^2` divides `a^n - b^n`.\n\nThe integer coercions below make explicit that the subtractions in the\nhypothesis and in the divisibility condition are taken in `ℤ`, rather than\nusing truncated subtraction on `ℕ`.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition for a candidate positive integer `n`.\n\nHere `a` and `b` are natural numbers, while the indicated subtraction and\ndivisibility are performed in the integers. -/\ndef Admissible (a b n : ℕ) : Prop :=\n 0 < n ∧ (n : ℤ) ^ 2 ∣ (a : ℤ) ^ n - (b : ℤ) ^ n\n\n/-- The complete statement: for every pair of positive integers `a`, `b`\nsatisfying `a - b > 1`, the set of positive integers `n` for which\n`n^2 ∣ a^n - b^n` is infinite. -/\ndef Target : Prop :=\n ∀ a b : ℕ,\n 0 < a →\n 0 < b →\n 1 < (a : ℤ) - (b : ℤ) →\n Set.Infinite {n : ℕ | Admissible a b n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0433c78b-a393-52b8-8f85-9690f0eab56f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9402759edca108c9db608ff7dd043d8032781a4e0eb381d5b8ba142c550057d6", "task_path": "tasks/nmp3_0433c78b-a393-52b8-8f85-9690f0eab56f", "metadata": {"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"}} {"task_id": "nmp3_04366e49-981c-5f8c-a893-039c92eeabe0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- 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})\\,}.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement\n\nThe source problem asks to prove a real inequality for all positive real\nnumbers `a`, `b`, and `c`.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition `a > 0`, `b > 0`, and `c > 0`. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n (0 : ℝ) < a ∧ (0 : ℝ) < b ∧ (0 : ℝ) < c\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * b * ((a ^ 3 + b ^ 3) / (a ^ 2 + b ^ 2)) +\n b * c * ((b ^ 3 + c ^ 3) / (b ^ 2 + c ^ 2)) +\n c * a * ((c ^ 3 + a ^ 3) / (c ^ 2 + a ^ 2))\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n Real.sqrt (3 * a * b * c * (a ^ 3 + b ^ 3 + c ^ 3))\n\n/-- The complete inequality asserted by the problem: for every positive real\ntriple `(a, b, c)`, the right-hand side is at most the left-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → rhs a b c ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "04366e49-981c-5f8c-a893-039c92eeabe0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "59aa53a2366c52c32df61d0a867525d0ae1a06cb4f3e5af11cfd8feeea788ab1", "task_path": "tasks/nmp3_04366e49-981c-5f8c-a893-039c92eeabe0", "metadata": {"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"}} {"task_id": "nmp3_04bc1c3a-605c-55f2-a507-8a3164678700", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- $$a+b\\mid a\\,m^{\\,a}+b\\,n^{\\,b}\\,. $$\nimport Mathlib.Data.Nat.GCD.Basic\nimport Mathlib.Data.Set.Finite.Basic\n\nnamespace Problem\n\n/-- The admissibility condition for an ordered pair of positive integers `(a, b)`\nin the problem, for fixed positive integers `m` and `n`. -/\ndef AdmissiblePair (m n a b : ℕ) : Prop :=\n 0 < a ∧ 0 < b ∧ Nat.Coprime a b ∧\n (a + b) ∣ a * m ^ a + b * n ^ b\n\n/-- The assertion of the problem: for every pair of positive integers `m` and `n`,\nthere are infinitely many ordered pairs `(a, b)` of positive coprime integers\nsatisfying the stated divisibility condition. -/\ndef Target : Prop :=\n ∀ m n : ℕ, 0 < m → 0 < n →\n Set.Infinite {p : ℕ × ℕ | AdmissiblePair m n p.1 p.2}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "04bc1c3a-605c-55f2-a507-8a3164678700", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "88419d59220ee17d885511b3ad765ec73eff1f362eecf98407fb2041a1c09839", "task_path": "tasks/nmp3_04bc1c3a-605c-55f2-a507-8a3164678700", "metadata": {"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"}} {"task_id": "nmp3_04d29e31-d4f8-59ec-9021-6792eb10e9e2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers with $0\\le a,b,c\\le1$. Prove that \n-- \\[\n-- \\left(\\frac{a}{1+a}\\right)^{3}+\\left(\\frac{b}{1+b}\\right)^{3}+\\left(\\frac{c}{1+c}\\right)^{3}\n-- \\;\\ge\\; abc\\Bigg[\\left(\\frac{1}{1+a}\\right)^{3}+\\left(\\frac{1}{1+b}\\right)^{3}+\\left(\\frac{1}{1+c}\\right)^{3}\\Bigg].\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the real-variable inequality\n\nThe source problem asks one to prove an inequality for all real numbers\n`a`, `b`, and `c` in the closed unit interval. The declarations below\nrecord the domains, the admissibility predicate, the two sides of the\ninequality, and the proposition to be proved. No proof is supplied here.\n-/\n\nnamespace Problem\n\n/-- The original hypothesis `0 ≤ a,b,c ≤ 1`, with real-valued variables. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ a ≤ 1 ∧ 0 ≤ b ∧ b ≤ 1 ∧ 0 ≤ c ∧ c ≤ 1\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LeftSide (a b c : ℝ) : ℝ :=\n (a / (1 + a)) ^ (3 : ℕ) +\n (b / (1 + b)) ^ (3 : ℕ) +\n (c / (1 + c)) ^ (3 : ℕ)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def RightSide (a b c : ℝ) : ℝ :=\n a * b * c *\n (((1 : ℝ) / (1 + a)) ^ (3 : ℕ) +\n ((1 : ℝ) / (1 + b)) ^ (3 : ℕ) +\n ((1 : ℝ) / (1 + c)) ^ (3 : ℕ))\n\n/-- The asserted pointwise inequality before quantifying over admissible triples. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LeftSide a b c ≥ RightSide a b c\n\n/-- The full universally quantified assertion from the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "04d29e31-d4f8-59ec-9021-6792eb10e9e2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "93b16d5249149cbfc464a22cf6bf14def82abe73da855d5e20f3ce5aa8bc1af2", "task_path": "tasks/nmp3_04d29e31-d4f8-59ec-9021-6792eb10e9e2", "metadata": {"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"}} {"task_id": "nmp3_04f56662-128d-5246-bc21-1b60f2cd2040", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be a prime such that $p^2\\mid 2^{\\,p-1}-1$. Prove that for every positive integer $n$, the integer \n-- $$T=(p-1)(p!+2^{\\,n})$$ \n-- has at least three distinct prime divisors.\nimport Mathlib\n\n/-!\n# Formalization of the source problem\n\nThe source problem asks to prove that, if a prime `p` is a base-2 Wieferich\nprime (that is, `p ^ 2` divides `2 ^ (p - 1) - 1`), then for every positive\ninteger `n`, the integer `(p - 1) * (p! + 2 ^ n)` has at least three distinct\nprime divisors.\n\nThis file states the assertion as a proposition. No proof of the assertion is\nprovided or assumed here.\n-/\n\nnamespace Problem\n\n/-- The integer expression `T = (p - 1) * (p! + 2 ^ n)` from the problem.\n\nWe work in the natural numbers. The source quantities are all positive\nintegers: `p` is prime, `n` is positive, and hence both factors are positive.\n-/\ndef T (p n : ℕ) : ℕ :=\n (p - 1) * (Nat.factorial p + 2 ^ n)\n\n/-- `m` has at least three distinct prime divisors.\n\nThis is stated directly using three pairwise distinct primes, each of which\ndivides `m`. This is equivalent to the source phrase \"has at least three\ndistinct prime divisors\". -/\ndef HasAtLeastThreeDistinctPrimeDivisors (m : ℕ) : Prop :=\n ∃ q r s : ℕ,\n Nat.Prime q ∧ Nat.Prime r ∧ Nat.Prime s ∧\n q ≠ r ∧ q ≠ s ∧ r ≠ s ∧\n q ∣ m ∧ r ∣ m ∧ s ∣ m\n\n/-- The complete assertion of the problem.\n\nFor every prime `p` satisfying `p ^ 2 ∣ 2 ^ (p - 1) - 1`, and every positive\ninteger `n`, the integer `T = (p - 1) * (p! + 2 ^ n)` has at least three\ndistinct prime divisors. -/\ndef Target : Prop :=\n ∀ p : ℕ,\n Nat.Prime p →\n p ^ 2 ∣ 2 ^ (p - 1) - 1 →\n ∀ n : ℕ,\n 0 < n →\n HasAtLeastThreeDistinctPrimeDivisors (T p n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "04f56662-128d-5246-bc21-1b60f2cd2040", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d74e0e3f738844b4ab996ae6532a6d434fb903cebbfb636cdaf36f0a06f9df74", "task_path": "tasks/nmp3_04f56662-128d-5246-bc21-1b60f2cd2040", "metadata": {"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"}} {"task_id": "nmp3_050e8491-e779-53f5-966f-e4f84f959027", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- \\[\n-- \\bigcup_{k\\in I}A_k=\\bigcup_{k\\in J}A_k\\qquad\\text{and}\\qquad \n-- \\bigcap_{k\\in I}A_k=\\bigcap_{k\\in J}A_k\\,.\n-- \\]\nmodule\n\npublic import Mathlib\n\n@[expose] public section\n\nnamespace Problem\n\n/-- Every one of the `n + 2` family members is a nonempty subset of `Fin n`. -/\ndef FamilyNonempty {n : ℕ} (A : Fin (n + 2) → Set (Fin n)) : Prop :=\n ∀ k : Fin (n + 2), (A k).Nonempty\n\n/-- Two subsets of the index type `Fin (n + 2)` are nonempty and disjoint. -/\ndef IndexPairNonemptyDisjoint {n : ℕ} (I J : Set (Fin (n + 2))) : Prop :=\n I.Nonempty ∧ J.Nonempty ∧ Disjoint I J\n\n/-- The unions of the family members indexed by `I` and by `J` are equal. -/\ndef UnionAgree {n : ℕ} (A : Fin (n + 2) → Set (Fin n))\n (I J : Set (Fin (n + 2))) : Prop :=\n (⋃ k ∈ I, A k) = (⋃ k ∈ J, A k)\n\n/-- The intersections of the family members indexed by `I` and by `J` are equal. -/\ndef IntersectionAgree {n : ℕ} (A : Fin (n + 2) → Set (Fin n))\n (I J : Set (Fin (n + 2))) : Prop :=\n (⋂ k ∈ I, A k) = (⋂ k ∈ J, A k)\n\n/-- Both required equalities, for the same pair of index subsets. -/\ndef SameUnionAndIntersection {n : ℕ} (A : Fin (n + 2) → Set (Fin n))\n (I J : Set (Fin (n + 2))) : Prop :=\n Problem.UnionAgree A I J ∧ Problem.IntersectionAgree A I J\n\n/-- The assertion of the problem: for every natural number `n` and every family\n`A : Fin (n + 2) → Set (Fin n)` of nonempty subsets, there are nonempty disjoint\nindex subsets `I J` of `Fin (n + 2)` for which the corresponding unions and\nintersections agree. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (A : Fin (n + 2) → Set (Fin n)),\n Problem.FamilyNonempty A →\n ∃ I J : Set (Fin (n + 2)),\n Problem.IndexPairNonemptyDisjoint I J ∧\n Problem.SameUnionAndIntersection A I J\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "050e8491-e779-53f5-966f-e4f84f959027", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "524a0a865ee2024f981f0d3b1ffa8b6675dd5c3e21eba1e1b7f13cd8fdbe51a6", "task_path": "tasks/nmp3_050e8491-e779-53f5-966f-e4f84f959027", "metadata": {"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"}} {"task_id": "nmp3_0533e1aa-f9ef-55f4-a930-33d629eb7439", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers. Prove that \n-- \\[\n-- \\sum_{cyc}\\frac{xy}{xy+x^{2}+y^{2}}\\le \\sum_{cyc}\\frac{x}{2x+z}.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the cyclic inequality problem in `problem.md`.\n\nThe source states: for positive real numbers `x`, `y`, and `z`,\n`∑_cyc xy / (xy + x^2 + y^2) ≤ ∑_cyc x / (2x + z)`.\n\nHere `∑_cyc f(x,y,z)` is interpreted in the usual way as the three-term\ncyclic sum `f(x,y,z) + f(y,z,x) + f(z,x,y)`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The three-term cyclic sum of a function of three real variables:\n`f x y z + f y z x + f z x y`. -/\ndef cyclicSum (f : ℝ → ℝ → ℝ → ℝ) (x y z : ℝ) : ℝ :=\n f x y z + f y z x + f z x y\n\n/-- The summand on the left-hand side, before taking the cyclic sum. -/\ndef lhsSummand (x y : ℝ) (_z : ℝ) : ℝ :=\n (x * y) / (x * y + x ^ 2 + y ^ 2)\n\n/-- The summand on the right-hand side, before taking the cyclic sum. -/\ndef rhsSummand (x _y : ℝ) (z : ℝ) : ℝ :=\n x / (2 * x + z)\n\n/-- The left-hand cyclic sum of the inequality. -/\ndef lhs (x y z : ℝ) : ℝ :=\n cyclicSum lhsSummand x y z\n\n/-- The right-hand cyclic sum of the inequality. -/\ndef rhs (x y z : ℝ) : ℝ :=\n cyclicSum rhsSummand x y z\n\n/-- The stated inequality for a fixed triple of real numbers. -/\ndef Inequality (x y z : ℝ) : Prop :=\n lhs x y z ≤ rhs x y z\n\n/-- The three variables are positive real numbers, as required in the problem. -/\ndef PositiveTriple (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The full assertion of the problem: for all positive real `x`, `y`, and `z`,\nthe cyclic sum on the left is at most the cyclic sum on the right. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, PositiveTriple x y z → Inequality x y z\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0533e1aa-f9ef-55f4-a930-33d629eb7439", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a880130f481df72533ab6ba2009ab7be32c06003a808778f3793a6afbdd1709b", "task_path": "tasks/nmp3_0533e1aa-f9ef-55f4-a930-33d629eb7439", "metadata": {"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"}} {"task_id": "nmp3_0533fb56-28c6-5805-bc89-e9ffd19b17cd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for all positive real numbers \\(a,b,c\\),\n-- \n-- \\[\n-- \\frac{3a^{2}-2ab-b^{2}}{3a^{2}+2ab+3b^{2}}\n-- +\\frac{3b^{2}-2bc-c^{2}}{3b^{2}+2bc+3c^{2}}\n-- +\\frac{3c^{2}-2ca-a^{2}}{3c^{2}+2ca+3a^{2}}\n-- \\ge 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic real inequality\n\nThe source problem asks to show that a cyclic sum of three rational\nexpressions in positive real numbers is nonnegative. The declarations below\nformalize exactly that assertion. No proof of the assertion is included.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- One cyclic summand, with variables `x` and `y`:\n`(3x^2 - 2xy - y^2) / (3x^2 + 2xy + 3y^2)`. -/\ndef cyclicSummand (x y : ℝ) : ℝ :=\n (3 * x ^ 2 - 2 * x * y - y ^ 2) /\n (3 * x ^ 2 + 2 * x * y + 3 * y ^ 2)\n\n/-- The left-hand side of the inequality: the three cyclic summands\n`(a,b)`, `(b,c)`, and `(c,a)`. -/\ndef lhs (a b c : ℝ) : ℝ :=\n cyclicSummand a b + cyclicSummand b c + cyclicSummand c a\n\n/-- The complete assertion of the problem: for every triple of positive real\nnumbers `a`, `b`, and `c`, the cyclic sum is nonnegative. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → 0 ≤ lhs a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0533fb56-28c6-5805-bc89-e9ffd19b17cd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "543402b8b5c4540dbce3dbac1ebc88a3d2a895bcc1836cbc924498133cda129d", "task_path": "tasks/nmp3_0533fb56-28c6-5805-bc89-e9ffd19b17cd", "metadata": {"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"}} {"task_id": "nmp3_0565fc8f-4f00-58f0-a37b-4e28d04af7d9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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.\nimport Mathlib\n\n/-!\n# Formalization of the rational power-sum problem\n\nThe source problem asks to prove that a finite tuple of rational numbers all of\nwhose positive power sums are integers must itself consist of integers.\n-/\n\nnamespace Problem\n\n/-- The `m`-th power sum of a finite rational tuple is an integer.\n\nThe witness is an integer `z`; the power sum is compared with its image in `ℚ`. -/\ndef PowerSumIsInteger (n : ℕ) (a : Fin n → ℚ) (m : ℕ) : Prop :=\n ∃ z : ℤ, (∑ i : Fin n, (a i) ^ m) = (z : ℚ)\n\n/-- Every positive power sum of the finite rational tuple `a` is an integer. -/\ndef PowerSumsAreIntegers (n : ℕ) (a : Fin n → ℚ) : Prop :=\n ∀ m : ℕ, 0 < m → PowerSumIsInteger n a m\n\n/-- Every entry of the finite rational tuple `a` is an integer. -/\ndef AllEntriesAreIntegers (n : ℕ) (a : Fin n → ℚ) : Prop :=\n ∀ i : Fin n, ∃ z : ℤ, a i = (z : ℚ)\n\n/-- The statement to be proved: for every natural number `n` and rational\nnumbers `a_1, ..., a_n`, if every positive power sum is an integer, then every\n`a_i` is an integer. The case `n = 0` is the empty tuple; the empty positive\npower sums are `0` and the pointwise conclusion is vacuous. -/\ndef Target : Prop :=\n ∀ (n : ℕ), ∀ (a : Fin n → ℚ),\n PowerSumsAreIntegers n a → AllEntriesAreIntegers n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0565fc8f-4f00-58f0-a37b-4e28d04af7d9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e69bd4a4ff1a369f9dace9786241f09c6ddb7369d85c88b1c0b1164eac0d98b9", "task_path": "tasks/nmp3_0565fc8f-4f00-58f0-a37b-4e28d04af7d9", "metadata": {"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"}} {"task_id": "nmp3_0569f0dd-cebf-5f10-8667-d33cf64da62b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- \\[\n-- \\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.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three positive real numbers `a`, `b`, and `c` satisfy the strict triangle\ninequalities, in the cyclic naming convention of the problem. -/\ndef TriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ a + c > b ∧ b + c > a\n\n/-- The left-hand side of the inequality in the problem, as a real-valued\nexpression in `a`, `b`, and `c`. -/\nnoncomputable def InequalityLHS (a b c : ℝ) : ℝ :=\n (4 * b * c / a - a) * (a - b) * (a - c) +\n (4 * a * c / b - b) * (b - c) * (b - a) +\n (4 * a * b / c - c) * (c - a) * (c - b)\n\n/-- The assertion to be proved: for every triple of positive real numbers that\nsatisfies the three strict triangle inequalities, the indicated expression is\nnonnegative. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, TriangleSideLengths a b c → InequalityLHS a b c ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0569f0dd-cebf-5f10-8667-d33cf64da62b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ec441483cf83e0f2e93861a84ad9a42f3b9b48e05dac387fd7942179f8e77e70", "task_path": "tasks/nmp3_0569f0dd-cebf-5f10-8667-d33cf64da62b", "metadata": {"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"}} {"task_id": "nmp3_056c17dd-1e22-5096-87a9-2f6c89bcd437", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\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).\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a cyclic sum inequality\n\nFor positive real numbers `a`, `b`, and `c`, we state\n\n\\[\n\\left(\\sum_{\\mathrm{cyc}}\\frac{a}{b+c}\\right)^2\n\\le\n\\left(\\sum_{\\mathrm{cyc}}\\frac{a^2}{bc+c^2}\\right)\n\\left(\\sum_{\\mathrm{cyc}}\\frac{a}{a+b}\\right).\n\\]\n\nThe cyclic sums range over the three cyclic permutations\n`(a,b,c)`, `(b,c,a)`, and `(c,a,b)`.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The cyclic sum of a three-variable expression over the cyclic permutations\n`(a,b,c)`, `(b,c,a)`, and `(c,a,b)`. -/\ndef cyclicSum (f : ℝ → ℝ → ℝ → ℝ) (a b c : ℝ) : ℝ :=\n f a b c + f b c a + f c a b\n\n/-- The first cyclic sum: `a / (b + c) + b / (c + a) + c / (a + b)`. -/\ndef firstSum (a b c : ℝ) : ℝ :=\n cyclicSum (fun x y z : ℝ => x / (y + z)) a b c\n\n/-- The second cyclic sum:\n`a ^ 2 / (b * c + c ^ 2) + b ^ 2 / (c * a + a ^ 2) + c ^ 2 / (a * b + b ^ 2)`. -/\ndef secondSum (a b c : ℝ) : ℝ :=\n cyclicSum (fun x y z : ℝ => x ^ 2 / (y * z + z ^ 2)) a b c\n\n/-- The third cyclic sum:\n`a / (a + b) + b / (b + c) + c / (c + a)`. -/\ndef thirdSum (a b c : ℝ) : ℝ :=\n cyclicSum (fun x y _z : ℝ => x / (x + y)) a b c\n\n/-- The asserted inequality for fixed real numbers `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (firstSum a b c) ^ 2 ≤ secondSum a b c * thirdSum a b c\n\n/-- The original problem: for all positive real numbers `a`, `b`, and `c`, the\ncyclic inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "056c17dd-1e22-5096-87a9-2f6c89bcd437", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "964ebe00abe083d19de03c160018caa98448c9cd12902625acdb182430d4ed55", "task_path": "tasks/nmp3_056c17dd-1e22-5096-87a9-2f6c89bcd437", "metadata": {"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"}} {"task_id": "nmp3_0579d7ef-7b0d-57ec-a2e4-6506e21977aa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- \\[\n-- \\sum_{i=1}^n\\frac{x_i}{\\,x_{i+1}-x_{i+1}^3\\,}\\ge\\frac{n^3}{\\,n^2-1\\,}.\n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/--\nThe assertion of the problem: for every integer `n ≥ 2` and every positive real\nsequence `x₁, …, xₙ` whose sum is `1`, if the sequence is extended periodically\nby `xₙ₊₁ = x₁`, then\n`∑ i=1..n xᵢ / (xᵢ₊₁ - xᵢ₊₁³) ≥ n³ / (n² - 1)`.\n\nThe sequence is represented as a function `ℕ → ℝ`; only the terms with indices\nin `Finset.Icc 1 n` are constrained, apart from the required relation\n`x (n + 1) = x 1`. Real division is Lean's total real division.\n-/\ndef Target : Prop :=\n ∀ (n : ℕ), 2 ≤ n → ∀ (x : ℕ → ℝ),\n (∀ i : ℕ, i ∈ Finset.Icc 1 n → 0 < x i) →\n (∑ i ∈ Finset.Icc 1 n, x i) = (1 : ℝ) →\n x (n + 1) = x 1 →\n (∑ i ∈ Finset.Icc 1 n,\n x i / (x (i + 1) - (x (i + 1)) ^ 3)) ≥\n (n : ℝ) ^ 3 / ((n : ℝ) ^ 2 - 1)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0579d7ef-7b0d-57ec-a2e4-6506e21977aa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3a00aa24dd141ed4a81ea14fcc9cba8822a0b7e26b6130fb34196f8f668d757c", "task_path": "tasks/nmp3_0579d7ef-7b0d-57ec-a2e4-6506e21977aa", "metadata": {"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"}} {"task_id": "nmp3_0599ceef-1849-5046-8714-f53261072892", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 i0$ with $x\\ge y\\ge z$ and $xy+yz+zx=1$. Prove that \n-- \\[\n-- x^{3}z^{2}+y^{3}x^{2}+z^{3}y^{2}\\;\\ge\\;\\frac{2}{\\,5(x+y+z)+9xyz\\,}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three strict positivity assumptions on the variables. -/\ndef Positive (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The non-strict ordering assumption `x ≥ y ≥ z`. -/\ndef Ordered (x y z : ℝ) : Prop :=\n x ≥ y ∧ y ≥ z\n\n/-- The constraint `xy + yz + zx = 1`. -/\ndef Constraint (x y z : ℝ) : Prop :=\n x * y + y * z + z * x = 1\n\n/-- The full hypothesis package for the problem: positivity, the ordering\n`x ≥ y ≥ z`, and the constraint `xy + yz + zx = 1`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n Positive x y z ∧ Ordered x y z ∧ Constraint x y z\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def LHS (x y z : ℝ) : ℝ :=\n x ^ 3 * z ^ 2 + y ^ 3 * x ^ 2 + z ^ 3 * y ^ 2\n\n/-- The denominator on the right-hand side of the desired inequality. -/\nnoncomputable def Denominator (x y z : ℝ) : ℝ :=\n 5 * (x + y + z) + 9 * (x * y * z)\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def RHS (x y z : ℝ) : ℝ :=\n 2 / Denominator x y z\n\n/-- The asserted inequality, for fixed admissible `x`, `y`, and `z`. -/\nnoncomputable def Conclusion (x y z : ℝ) : Prop :=\n LHS x y z ≥ RHS x y z\n\n/-- The assertion to be proved: for all positive real `x`, `y`, and `z` with\n`x ≥ y ≥ z` and `xy + yz + zx = 1`, the stated lower bound on\n`x^3 z^2 + y^3 x^2 + z^3 y^2` holds. -/\nnoncomputable def Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Conclusion x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0720ac41-7fea-5aaa-8422-2c09c86d0878", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c115ab97df0f8b75f10061021ecdb9df5b36e2bba6de3427bf3372230e285298", "task_path": "tasks/nmp3_0720ac41-7fea-5aaa-8422-2c09c86d0878", "metadata": {"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"}} {"task_id": "nmp3_07442508-5806-5629-a3d7-e644f2e5e7af", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $abc=1$. Prove that \n-- \\[\n-- \\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}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the inequality problem\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nsatisfying `a * b * c = (1 : ℝ)`, the inequality\n\n`(a*c + a*b^2)/(a+b) + (b*a + b*c^2)/(b+c) + (c*b + c*a^2)/(c+a)`\n` ≥ 9/(a^2 + b^2 + c^2)`.\n\nThe declaration `Problem.Target` below is the complete proposition to be proved.\nNo proof is supplied here.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef lhs (a : ℝ) (b : ℝ) (c : ℝ) : ℝ :=\n (a * c + a * b ^ (2 : ℕ)) / (a + b) +\n (b * a + b * c ^ (2 : ℕ)) / (b + c) +\n (c * b + c * a ^ (2 : ℕ)) / (c + a)\n\n/-- The right-hand side of the inequality in the source problem. -/\ndef rhs (a : ℝ) (b : ℝ) (c : ℝ) : ℝ :=\n (9 : ℝ) / (a ^ (2 : ℕ) + b ^ (2 : ℕ) + c ^ (2 : ℕ))\n\n/-- The inequality asserted at a fixed triple of real numbers. -/\ndef Claim (a : ℝ) (b : ℝ) (c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete universal proposition stated by the source problem: for all positive\nreal `a`, `b`, and `c` with `a * b * c = (1 : ℝ)`, the asserted inequality holds. -/\ndef Target : Prop :=\n ∀ (a : ℝ) (b : ℝ) (c : ℝ),\n 0 < a → 0 < b → 0 < c → a * b * c = (1 : ℝ) → Claim a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "07442508-5806-5629-a3d7-e644f2e5e7af", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3e78da892384be07c06ea961e57aa8a84963c9457c15e7fcb3dfcad80c522713", "task_path": "tasks/nmp3_07442508-5806-5629-a3d7-e644f2e5e7af", "metadata": {"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"}} {"task_id": "nmp3_0759d031-53d5-5308-acb1-614eb9c9f26c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 $C_{1}$ again at $F\\neq P$. Let $H$ be the point on ray $AF$ such that $AH=AP$, and let $K$ be the point on ray $BE$ such that $BK=BP$. Prove that the five points $A,\\;H,\\;Q,\\;K,\\;B$ are concyclic.\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A point of the Euclidean plane, represented by its Cartesian coordinates. -/\nstructure Point where\n x : ℝ\n y : ℝ\n\n/-- Difference of two points, viewed as a vector. -/\ndef vsub (X Y : Point) : Point :=\n ⟨X.x - Y.x, X.y - Y.y⟩\n\n/-- Sum of a point and a vector (with both represented by `Point`). -/\ndef vadd (X Y : Point) : Point :=\n ⟨X.x + Y.x, X.y + Y.y⟩\n\n/-- Scalar multiplication of a vector. -/\ndef smul (t : ℝ) (X : Point) : Point :=\n ⟨t * X.x, t * X.y⟩\n\n/-- Dot product of two vectors. -/\ndef dot (X Y : Point) : ℝ :=\n X.x * Y.x + X.y * Y.y\n\n/-- Signed two-dimensional cross product. -/\ndef cross (X Y : Point) : ℝ :=\n X.x * Y.y - X.y * Y.x\n\n/-- Squared Euclidean norm of a vector. -/\ndef normSq (X : Point) : ℝ :=\n dot X X\n\n/-- Squared Euclidean distance between two points. -/\ndef distSq (X Y : Point) : ℝ :=\n normSq (vsub X Y)\n\n/-- Euclidean distance between two points. -/\ndef dist (X Y : Point) : ℝ :=\n Real.sqrt (distSq X Y)\n\n/-- A circle in the Euclidean plane, represented by its center and radius. -/\nstructure Circle where\n center : Point\n radius : ℝ\n\nnamespace Circle\n\n/-- A circle is nondegenerate when its radius is positive. -/\ndef Positive (C : Circle) : Prop :=\n 0 < C.radius\n\n/-- A point lies on a circle when its distance from the center is the radius. -/\ndef On (C : Circle) (X : Point) : Prop :=\n dist C.center X = C.radius\n\nend Circle\n\n/-- The three points `X`, `Y`, `Z` are collinear. -/\ndef Collinear (X Y Z : Point) : Prop :=\n cross (vsub Y X) (vsub Z X) = 0\n\n/-- The line through `X` and `Y` is tangent to `C` at `X`. -/\ndef IsTangentLineAt (C : Circle) (X Y : Point) : Prop :=\n X ≠ Y ∧\n Circle.On C X ∧\n dot (vsub X C.center) (vsub Y X) = 0\n\n/-- The (non-oriented) Euclidean distance from `Z` to the line through `X` and `Y`. -/\ndef lineDist (X Y Z : Point) : ℝ :=\n Real.sqrt ((cross (vsub Y X) (vsub Z X)) ^ 2 / normSq (vsub Y X))\n\n/-- The line through `A` and `B` is closer to `P` than to `Q`. -/\ndef LineCloserToPThanQ (A B P Q : Point) : Prop :=\n lineDist A B P < lineDist A B Q\n\n/-- The point `X` lies on the closed ray starting at `A` and passing through `F`. -/\ndef OnRay (A F X : Point) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ X = vadd A (smul t (vsub F A))\n\n/-- `X` is the unique point on ray `AF` at distance `AP` from `A`. -/\ndef IsUniquePointOnRayAtDistance (A F P X : Point) : Prop :=\n OnRay A F X ∧\n dist A X = dist A P ∧\n ∀ Y : Point, OnRay A F Y → dist A Y = dist A P → Y = X\n\n/-- The two circles intersect exactly in the two distinct points `P` and `Q`. -/\ndef CirclesIntersectAt (C1 C2 : Circle) (P Q : Point) : Prop :=\n C1 ≠ C2 ∧\n P ≠ Q ∧\n Circle.On C1 P ∧\n Circle.On C2 P ∧\n Circle.On C1 Q ∧\n Circle.On C2 Q ∧\n ∀ X : Point, Circle.On C1 X → Circle.On C2 X → X = P ∨ X = Q\n\n/-- The line through `A` and `B` is a common tangent to `C1` and `C2`,\ntangent to `C1` at `A` and to `C2` at `B`. -/\ndef IsCommonTangentLine (C1 C2 : Circle) (A B : Point) : Prop :=\n IsTangentLineAt C1 A B ∧ IsTangentLineAt C2 B A\n\n/-- The common tangent line through `A` and `B` is the one closer to `P` than to `Q`. -/\ndef IsCommonTangentLineCloserToP\n (C1 C2 : Circle) (P Q A B : Point) : Prop :=\n IsCommonTangentLine C1 C2 A B ∧\n LineCloserToPThanQ A B P Q\n\n/-- The tangent to `C1` at `P` meets `C2` again, and exactly, at `E`. -/\ndef IsSecondIntersectionOfTangentAtP\n (C1 C2 : Circle) (P E : Point) : Prop :=\n Circle.On C2 P ∧\n Circle.On C2 E ∧\n P ≠ E ∧\n IsTangentLineAt C1 P E ∧\n ∀ Z : Point,\n Circle.On C2 Z → Collinear P E Z → Z = P ∨ Z = E\n\n/-- The complete configuration in the statement, including the constructed\npoints `E`, `F`, `H`, and `K` with their defining properties. -/\ndef Setup\n (C1 C2 : Circle) (P Q A B E F H K : Point) : Prop :=\n Circle.Positive C1 ∧\n Circle.Positive C2 ∧\n CirclesIntersectAt C1 C2 P Q ∧\n IsCommonTangentLineCloserToP C1 C2 P Q A B ∧\n IsSecondIntersectionOfTangentAtP C1 C2 P E ∧\n IsSecondIntersectionOfTangentAtP C2 C1 P F ∧\n IsUniquePointOnRayAtDistance A F P H ∧\n IsUniquePointOnRayAtDistance B E P K\n\n/-- The five points `A`, `H`, `Q`, `K`, `B` lie on one nondegenerate circle. -/\ndef ConcyclicFive (A H Q K B : Point) : Prop :=\n ∃ C : Circle,\n Circle.Positive C ∧\n Circle.On C A ∧\n Circle.On C H ∧\n Circle.On C Q ∧\n Circle.On C K ∧\n Circle.On C B\n\n/-- The assertion to be proved: for every configuration satisfying the stated\nhypotheses, the five points `A`, `H`, `Q`, `K`, `B` are concyclic. -/\ndef Target : Prop :=\n ∀ (C1 C2 : Circle) (P Q A B E F H K : Point),\n Setup C1 C2 P Q A B E F H K →\n ConcyclicFive A H Q K B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0759d031-53d5-5308-acb1-614eb9c9f26c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f1e646b01f94ae60729ebd3055d75550b3cefeddf4af73b61832bee80ebca8ac", "task_path": "tasks/nmp3_0759d031-53d5-5308-acb1-614eb9c9f26c", "metadata": {"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"}} {"task_id": "nmp3_075bb2be-717d-57ed-8c14-18431984bf99", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all real numbers $a,b,c$,\n-- \\[\n-- \\frac{ab(a+b)+bc(b+c)+ca(c+a)}{(a^2+1)(b^2+1)(c^2+1)}\\le\\frac34.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The numerator of the displayed expression, for real numbers `a`, `b`, `c`. -/\ndef Numerator (a b c : ℝ) : ℝ :=\n a * b * (a + b) + b * c * (b + c) + c * a * (c + a)\n\n/-- The denominator of the displayed expression, for real numbers `a`, `b`, `c`. -/\ndef Denominator (a b c : ℝ) : ℝ :=\n (a ^ 2 + 1) * (b ^ 2 + 1) * (c ^ 2 + 1)\n\n/-- The inequality asserted for fixed real numbers `a`, `b`, `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n Numerator a b c / Denominator a b c ≤ (3 : ℝ) / 4\n\n/-- The full universal assertion stated in the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "075bb2be-717d-57ed-8c14-18431984bf99", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "64a4d2403969bbffa2d8d84b6099fc1b8114021015f4467b63bc5c1a7a777938", "task_path": "tasks/nmp3_075bb2be-717d-57ed-8c14-18431984bf99", "metadata": {"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"}} {"task_id": "nmp3_075c0b23-d098-5976-8796-6c46175173aa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- $$P(x)\\equiv Q_p(x)^2\\pmod p.$$ \n-- Prove that there exists a polynomial $R(x)\\in\\mathbb Z[x]$ satisfying $P(x)=R(x)^2\\,. $\nimport Mathlib\n\n/-!\n# Formalization: integer polynomials that are squares modulo every prime\n\nThis file states the assertion from the problem. Polynomial congruence modulo\nan integer `p` is represented by equality after reduction of coefficients to\n`ZMod p`, which is the same as coefficientwise congruence modulo `p`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/--\n`IsCongruentModulo P Q p` says that `P` and `Q` are congruent modulo `p` as\npolynomials with coefficients in `ZMod p`. Equivalently, every coefficient of\n`P - Q` is divisible by `p`.\n-/\ndef IsCongruentModulo (P Q : Polynomial ℤ) (p : ℕ) : Prop :=\n Polynomial.map (Int.castRingHom (ZMod p)) P =\n Polynomial.map (Int.castRingHom (ZMod p)) Q\n\n/--\n`IsSquareModuloEveryPrime P` is the hypothesis of the problem: for every prime\n`p`, there is an integer polynomial `Q` whose square is congruent to `P`\nmodulo `p`.\n-/\ndef IsSquareModuloEveryPrime (P : Polynomial ℤ) : Prop :=\n ∀ p : ℕ, Nat.Prime p →\n ∃ Q : Polynomial ℤ, IsCongruentModulo P (Q ^ 2) p\n\n/--\n`IsSquareInIntegerPolynomials P` says that `P` is the square of an integer\npolynomial.\n-/\ndef IsSquareInIntegerPolynomials (P : Polynomial ℤ) : Prop :=\n ∃ R : Polynomial ℤ, P = R ^ 2\n\n/--\nThe statement to be proved: every integer polynomial that is a square modulo\nevery prime is itself a square in `ℤ[X]`.\n-/\ndef Target : Prop :=\n ∀ P : Polynomial ℤ,\n IsSquareModuloEveryPrime P → IsSquareInIntegerPolynomials P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "075c0b23-d098-5976-8796-6c46175173aa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "65cd33ec0db8c3a3fbed67c54d2e9cc82e716308fbba7d8a317222c2ed3835d5", "task_path": "tasks/nmp3_075c0b23-d098-5976-8796-6c46175173aa", "metadata": {"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"}} {"task_id": "nmp3_0762ab31-43c6-5375-947d-2632badee080", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $ab+bc+ca+abc=4$. Prove that \n-- $$a^2+b^2+c^2+a^2b+b^2c+c^2a\\ge2(ab+bc+ca).$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The three variables are nonnegative real numbers. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The equation `ab + bc + ca + abc = 4` imposed on the three variables. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a * b + b * c + c * a + a * b * c = 4\n\n/-- The variables `a`, `b`, and `c` are nonnegative real numbers satisfying\n`ab + bc + ca + abc = 4`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ Constraint a b c\n\n/-- The assertion from the problem: for all nonnegative real `a`, `b`, and `c`\nsatisfying `ab + bc + ca + abc = 4`, one has\n`a² + b² + c² + a²b + b²c + c²a ≥ 2(ab + bc + ca)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n a ^ 2 + b ^ 2 + c ^ 2 + a ^ 2 * b + b ^ 2 * c + c ^ 2 * a ≥\n 2 * (a * b + b * c + c * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0762ab31-43c6-5375-947d-2632badee080", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2d3f5cf89e9ea91356dc31cdea4ab5190efd48439440d71599a933cdaa677b79", "task_path": "tasks/nmp3_0762ab31-43c6-5375-947d-2632badee080", "metadata": {"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"}} {"task_id": "nmp3_07778375-580f-5a8d-bb3c-29c0dbb80cc0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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$.\nimport Mathlib\n\n/-!\n# Formalization of a positive-integers gcd/divisibility problem\n\nThe source problem asks for a proof that the only positive integer solution of a\nsymmetric system of pairwise coprimality and divisibility conditions is\n`(a, b, c) = (1, 1, 1)`.\n\nThe statements below formalize the problem over `ℕ`. The positivity hypotheses\nare kept explicitly, so `ℕ` together with `0 < a`, `0 < b`, and `0 < c` represents\nthe positive-integer domain from the source.\n-/\n\nnamespace Problem\n\n/-- The three variables are positive. -/\ndef PositiveTriple (a b c : ℕ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The pairwise gcd conditions `gcd(a,b) = gcd(b,c) = gcd(c,a) = 1`. -/\ndef PairwiseGCDEqualsOne (a b c : ℕ) : Prop :=\n Nat.gcd a b = 1 ∧ Nat.gcd b c = 1 ∧ Nat.gcd c a = 1\n\n/-- The three stated cyclic divisibility conditions. -/\ndef DivisibilityConditions (a b c : ℕ) : Prop :=\n (a + b) ∣ b ^ 2 + c ^ 2 ∧\n (b + c) ∣ c ^ 2 + a ^ 2 ∧\n (c + a) ∣ a ^ 2 + b ^ 2\n\n/-- The complete hypothesis predicate of the source problem for `a`, `b`, `c`. -/\ndef Admissible (a b c : ℕ) : Prop :=\n PositiveTriple a b c ∧\n PairwiseGCDEqualsOne a b c ∧\n DivisibilityConditions a b c\n\n/-- The desired conclusion `a = b = c = 1`, written as three simultaneous\n`ℕ`-equalities. -/\ndef Conclusion (a b c : ℕ) : Prop :=\n a = 1 ∧ b = 1 ∧ c = 1\n\n/-- The proposition to be proved: every admissible triple of positive natural\nnumbers is `(1, 1, 1)`. -/\ndef Target : Prop :=\n ∀ a b c : ℕ, Admissible a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "07778375-580f-5a8d-bb3c-29c0dbb80cc0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "20e19da75ac08c768957f63210363119641bf2b660ad7ebcf9a165c46ea3bc6a", "task_path": "tasks/nmp3_07778375-580f-5a8d-bb3c-29c0dbb80cc0", "metadata": {"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"}} {"task_id": "nmp3_0782f131-144a-54ea-81cf-7c78adc0fa6f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- \\[\n-- 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})\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- All three real numbers `a`, `b`, and `c` are non-negative. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- At most one of the three real numbers `a`, `b`, and `c` is equal to zero.\nEquivalently, no two of them vanish simultaneously. -/\ndef AtMostOneZero (a b c : ℝ) : Prop :=\n (a ≠ 0 ∨ b ≠ 0) ∧ (a ≠ 0 ∨ c ≠ 0) ∧ (b ≠ 0 ∨ c ≠ 0)\n\n/-- The three pairwise sums appearing in the denominators are strictly positive. -/\ndef PairwiseSumsPositive (a b c : ℝ) : Prop :=\n 0 < b + c ∧ 0 < c + a ∧ 0 < a + b\n\n/-- The admissible triples in the problem: non-negative reals with at most one zero,\ntogether with the explicitly stated positivity of the three pairwise sums. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ AtMostOneZero a b c ∧ PairwiseSumsPositive a b c\n\n/-- The left-hand side of the claimed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (2 : ℝ) * (a ^ 3 / (b + c) + b ^ 3 / (c + a) + c ^ 3 / (a + b)) +\n (a + b + c) ^ 2\n\n/-- The right-hand side of the claimed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (4 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The claimed inequality for one fixed admissible triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full assertion to be proved: for every non-negative real triple with at\nmost one zero (and hence positive pairwise sums as stated in the problem), the\ndisplayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0782f131-144a-54ea-81cf-7c78adc0fa6f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "40acb4dad9651e6630f755ccfec0784214bee8ca373419264667eb70916b9151", "task_path": "tasks/nmp3_0782f131-144a-54ea-81cf-7c78adc0fa6f", "metadata": {"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"}} {"task_id": "nmp3_0792c7d6-c665-5c8c-8588-2d0d81953f37", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb{Q}\\to\\mathbb{Z}$ assign an integer to each rational point on the real line. Prove that there exist rational numbers $a0$. Prove that \n-- \\[\n-- \\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}}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe source problem asks to prove, for nonnegative reals `a`, `b`, `c`\nsatisfying `ab + bc + ca > 0`, the inequality\n\n`sqrt(a^4 + 4abc(b+c)) / (a^2 + 2bc) + ... >= (a+b+c)^2 / (a^2+b^2+c^2)`.\n\nThe declaration `Problem.Target` below records the exact proposition to be\nproved. It is a proposition-valued definition, as required for a statement\nformalization; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The first radicand:\n`a^4 + 4abc(b+c)`. -/\nnoncomputable def radicandA (a b c : ℝ) : ℝ :=\n a ^ 4 + (4 : ℝ) * a * b * c * (b + c)\n\n/-- The second radicand:\n`b^4 + 4abc(c+a)`. -/\nnoncomputable def radicandB (a b c : ℝ) : ℝ :=\n b ^ 4 + (4 : ℝ) * a * b * c * (c + a)\n\n/-- The third radicand:\n`c^4 + 4abc(a+b)`. -/\nnoncomputable def radicandC (a b c : ℝ) : ℝ :=\n c ^ 4 + (4 : ℝ) * a * b * c * (a + b)\n\n/-- The first denominator:\n`a^2 + 2bc`. -/\nnoncomputable def denominatorA (a b c : ℝ) : ℝ :=\n a ^ 2 + (2 : ℝ) * b * c\n\n/-- The second denominator:\n`b^2 + 2ca`. -/\nnoncomputable def denominatorB (a b c : ℝ) : ℝ :=\n b ^ 2 + (2 : ℝ) * c * a\n\n/-- The third denominator:\n`c^2 + 2ab`. -/\nnoncomputable def denominatorC (a b c : ℝ) : ℝ :=\n c ^ 2 + (2 : ℝ) * a * b\n\n/-- The first summand of the left-hand side. -/\nnoncomputable def summandA (a b c : ℝ) : ℝ :=\n Real.sqrt (radicandA a b c) / denominatorA a b c\n\n/-- The second summand of the left-hand side. -/\nnoncomputable def summandB (a b c : ℝ) : ℝ :=\n Real.sqrt (radicandB a b c) / denominatorB a b c\n\n/-- The third summand of the left-hand side. -/\nnoncomputable def summandC (a b c : ℝ) : ℝ :=\n Real.sqrt (radicandC a b c) / denominatorC a b c\n\n/-- The complete left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n summandA a b c + summandB a b c + summandC a b c\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a + b + c) ^ 2 / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The admissibility assumptions `a,b,c ≥ 0` and `ab+bc+ca > 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a * b + b * c + c * a\n\n/-- The asserted inequality, for fixed `a`, `b`, and `c`. -/\nnoncomputable def InequalityHolds (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete universally quantified statement of the source problem. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "07def91c-39db-5a54-8b9a-0aa138ffa55f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "75fa44fa17b68b203dc1d3e9fe00f1bc6beabda043ef38073a43379b87eebc1f", "task_path": "tasks/nmp3_07def91c-39db-5a54-8b9a-0aa138ffa55f", "metadata": {"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"}} {"task_id": "nmp3_0818ce94-9da4-5257-9aa2-41e7b77c5a2f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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.\nimport Mathlib\n\nnoncomputable section\nopen Classical\n\nnamespace Problem\n\n/-- The Euclidean plane, represented by two real coordinates. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The two possible colors of a point. -/\ninductive Color : Type\n | red\n | yellow\n deriving DecidableEq\n\n/-- A coloring uses only the two permitted colors. Since `Color` itself has\nexactly the constructors `red` and `yellow`, this predicate makes the coloring\nhypothesis explicit. -/\ndef IsRedYellowColoring (c : Plane → Color) : Prop :=\n ∀ z : Plane, c z = Color.red ∨ c z = Color.yellow\n\n/-- The signed area of the parallelogram spanned by two plane vectors. -/\ndef cross2 (u v : Plane) : ℝ :=\n u 0 * v 1 - u 1 * v 0\n\n/-- The orientation of the ordered triple `(a,b,c)`: positive for a\ncounterclockwise turn, negative for a clockwise turn, and zero if collinear. -/\ndef orientation (a b c : Plane) : ℝ :=\n cross2 (b - a) (c - a)\n\n/-- The successor of a pentagon index in cyclic order. -/\ndef nextVertex (i : Fin 5) : Fin 5 :=\n finRotate 5 i\n\n/-- The predecessor of a pentagon index in cyclic order. -/\ndef prevVertex (i : Fin 5) : Fin 5 :=\n (finRotate 5).symm i\n\n/-- The vertices, indexed in order, form a strictly convex pentagon traversed\ncounterclockwise. The all-triples condition is the standard\noriented-matroid characterization of five distinct points in strictly convex\ncyclic order. -/\ndef CounterclockwiseConvexPentagon (p : Fin 5 → Plane) : Prop :=\n Function.Injective p ∧\n ∀ i j k : Fin 5, i < j → j < k → 0 < orientation (p i) (p j) (p k)\n\n/-- The vertices, indexed in order, form a strictly convex pentagon traversed\nclockwise. -/\ndef ClockwiseConvexPentagon (p : Fin 5 → Plane) : Prop :=\n Function.Injective p ∧\n ∀ i j k : Fin 5, i < j → j < k → orientation (p i) (p j) (p k) < 0\n\n/-- A convex pentagon, with the five vertices supplied in either cyclic\norientation. `Function.Injective` is included explicitly to state that there\nare five distinct vertices. -/\ndef ConvexPentagon (p : Fin 5 → Plane) : Prop :=\n CounterclockwiseConvexPentagon p ∨ ClockwiseConvexPentagon p\n\n/-- The (smaller) interior angle at the `i`-th vertex of a convex pentagon.\nFor a convex polygon, this is the usual interior angle, measured in radians. -/\nnoncomputable def interiorAngle (p : Fin 5 → Plane) (i : Fin 5) : ℝ :=\n EuclideanGeometry.angle (p (prevVertex i)) (p i) (p (nextVertex i))\n\n/-- The interior angle at the `i`-th vertex is a right angle. -/\ndef RightInteriorAngle (p : Fin 5 → Plane) (i : Fin 5) : Prop :=\n interiorAngle p i = Real.pi / 2\n\n/-- Exactly three of the five interior angles are right angles. The finite set\n`s` is required to consist precisely of the indices at which the right-angle\npredicate holds. -/\ndef HasThreeRightInteriorAngles (p : Fin 5 → Plane) : Prop :=\n ∃ s : Finset (Fin 5),\n s.card = 3 ∧ ∀ i : Fin 5, i ∈ s ↔ RightInteriorAngle p i\n\n/-- All five pentagon vertices have one common color. -/\ndef AllVerticesSameColor (c : Plane → Color) (p : Fin 5 → Plane) : Prop :=\n ∃ col : Color, ∀ i : Fin 5, c (p i) = col\n\n/-- The complete statement: every red/yellow coloring of the plane has a\nstrictly convex pentagon whose five vertices are monochromatic and which has\nthree right interior angles. -/\ndef Target : Prop :=\n ∀ c : Plane → Color, IsRedYellowColoring c →\n ∃ p : Fin 5 → Plane,\n AllVerticesSameColor c p ∧\n ConvexPentagon p ∧ HasThreeRightInteriorAngles p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0818ce94-9da4-5257-9aa2-41e7b77c5a2f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9106990f1badcdc8ee71eee147abbc347400bdd8f407397839a19f32775d564f", "task_path": "tasks/nmp3_0818ce94-9da4-5257-9aa2-41e7b77c5a2f", "metadata": {"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"}} {"task_id": "nmp3_08222375-1b9d-56f7-8ba3-eb6f8cc6846e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- $$m\\mid a_j+a_{j+1}+\\dots +a_{j+l_j-1}.$$ \n-- Prove that \n-- $$l_1+l_2+\\dots +l_n\\le mn.$$\nimport Mathlib.Algebra.BigOperators.Group.Finset.Basic\nimport Mathlib.Data.Int.Basic\nimport Mathlib.Data.Fintype.Basic\n\nnamespace Problem\n\nopen scoped BigOperators\n\n/-- The positive-integer index type `{1, 2, 3, ...}` for the sequence. -/\nabbrev PositiveIndex : Type := { i : ℕ // 0 < i }\n\n/-- The source condition `a_i = a_{i-n}` for every `i > n`. -/\ndef Periodic (n : ℕ) (a : PositiveIndex → ℤ) : Prop :=\n ∀ (i : PositiveIndex) (hi : n < i.val),\n a i = a ⟨i.val - n, Nat.sub_pos_of_lt hi⟩\n\n/-- The sum of `l` consecutive terms beginning at the positive index `j`. -/\ndef windowSum (a : PositiveIndex → ℤ) (j : PositiveIndex) (l : ℕ) : ℤ :=\n ∑ k ∈ Finset.range l,\n a ⟨j.val + k, Nat.add_pos_left j.property k⟩\n\n/-- A positive length `l` whose window sum beginning at `j` is divisible by `m`. -/\ndef AdmissibleLength (m : ℕ) (a : PositiveIndex → ℤ) (j : PositiveIndex) (l : ℕ) : Prop :=\n 0 < l ∧ (m : ℤ) ∣ windowSum a j l\n\n/-- `l` is the smallest positive admissible length beginning at `j`. -/\ndef IsLeastPositiveAdmissibleLength\n (m : ℕ) (a : PositiveIndex → ℤ) (j : PositiveIndex) (l : ℕ) : Prop :=\n AdmissibleLength m a j l ∧\n ∀ k : ℕ, AdmissibleLength m a j k → l ≤ k\n\n/-- There is a unique smallest positive admissible length beginning at `j`. -/\ndef HasUniqueLeastPositiveAdmissibleLength\n (m : ℕ) (a : PositiveIndex → ℤ) (j : PositiveIndex) : Prop :=\n ∃! l : ℕ, IsLeastPositiveAdmissibleLength m a j l\n\n/-- The positive index corresponding to the source's `j ∈ {1, ..., n}`. -/\ndef oneBasedIndex {n : ℕ} (j : Fin n) : PositiveIndex :=\n ⟨j.val + 1, Nat.succ_pos j.val⟩\n\n/-- For every `j` in `1, ..., n`, the least positive admissible length at `j`\nexists and is unique. -/\ndef AllLeastPositiveAdmissibleLengthsExistUniquely\n (m n : ℕ) (a : PositiveIndex → ℤ) : Prop :=\n ∀ j : Fin n, HasUniqueLeastPositiveAdmissibleLength m a (oneBasedIndex j)\n\n/-- A length function whose `j`-th entry is the least positive admissible length at `j`. -/\ndef IsLeastLengthAssignment\n (m n : ℕ) (a : PositiveIndex → ℤ) (l : Fin n → ℕ) : Prop :=\n ∀ j : Fin n, IsLeastPositiveAdmissibleLength m a (oneBasedIndex j) (l j)\n\n/-- The proposed conclusion `l_1 + ... + l_n ≤ m * n`. -/\ndef LengthSumAtMost (m n : ℕ) (l : Fin n → ℕ) : Prop :=\n (∑ j : Fin n, l j) ≤ m * n\n\n/-- The formal statement of the problem: for positive `m, n` and every `n`-periodic\ninteger sequence `(a_i)_{i ≥ 1}`, the least positive admissible lengths `l_j`\nexist uniquely for `j = 1, ..., n`, and their sum is at most `m * n`. -/\ndef Target : Prop :=\n ∀ (m n : ℕ) (a : PositiveIndex → ℤ),\n 0 < m → 0 < n → Periodic n a →\n AllLeastPositiveAdmissibleLengthsExistUniquely m n a ∧\n ∃ l : Fin n → ℕ,\n IsLeastLengthAssignment m n a l ∧ LengthSumAtMost m n l\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "08222375-1b9d-56f7-8ba3-eb6f8cc6846e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6c6d8ddd42681a3787cc4cd5206f409198bd2735bb14c38521f540e10ca617a1", "task_path": "tasks/nmp3_08222375-1b9d-56f7-8ba3-eb6f8cc6846e", "metadata": {"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"}} {"task_id": "nmp3_082ac614-e21d-576a-9ffb-56502ec63a8f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers such that $x+y+z=1$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{xy}{\\sqrt{xy+yz}}\\le\\frac{\\sqrt2}{2}\\,.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\n/-!\n# Formal statement for the cyclic square-root inequality\n\nThe source problem asks, for positive real numbers `x`, `y`, and `z` whose sum is\n`1`, to prove the cyclic inequality\n`∑_cyc xy / sqrt (xy + yz) ≤ sqrt 2 / 2`.\n\nThis module records the statement as a proposition-valued definition. No proof is\nprovided.\n-/\n\nnamespace Problem\n\n/-- The predicate that `x`, `y`, and `z` are positive real numbers summing to one. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = 1\n\n/-- One cyclic summand, namely `xy / sqrt (xy + yz)`. -/\nnoncomputable def cyclicTerm (x y z : ℝ) : ℝ :=\n x * y / Real.sqrt (x * y + y * z)\n\n/--\nThe cyclic sum\n`xy / sqrt (xy + yz) + yz / sqrt (yz + zx) + zx / sqrt (zx + xy)`.\n-/\nnoncomputable def cyclicSum (x y z : ℝ) : ℝ :=\n cyclicTerm x y z + cyclicTerm y z x + cyclicTerm z x y\n\n/-- The assertion to be proved in the source problem. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n Admissible x y z → cyclicSum x y z ≤ (Real.sqrt 2) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "082ac614-e21d-576a-9ffb-56502ec63a8f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c436398e6db3a4f0f6cad16979a153305299812c9e9fbdbe46c2218cec269c0d", "task_path": "tasks/nmp3_082ac614-e21d-576a-9ffb-56502ec63a8f", "metadata": {"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"}} {"task_id": "nmp3_082dc2dd-fc97-5fc4-904c-fd68753e618e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{ab^2}{13a+3b^2}+\\frac{bc^2}{13b+3c^2}+\\frac{ca^2}{13c+3a^2}\\le\\frac{3}{16}.\n-- \\]\nimport Mathlib.Data.Real.Basic\n\nnamespace Problem\n\n/-- The hypotheses of the inequality: `a`, `b`, and `c` are positive reals\nwhose sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The left-hand side of the stated inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * b ^ 2 / (13 * a + 3 * b ^ 2) +\n b * c ^ 2 / (13 * b + 3 * c ^ 2) +\n c * a ^ 2 / (13 * c + 3 * a ^ 2)\n\n/-- The right-hand side of the stated inequality. -/\nnoncomputable def rhs : ℝ := 3 / 16\n\n/-- The complete universally quantified assertion stated in the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≤ rhs\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "082dc2dd-fc97-5fc4-904c-fd68753e618e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a9a4d68cb29c0a01d2acdd96832e9b9e62cfeb389974447743a6dd66097cad5e", "task_path": "tasks/nmp3_082dc2dd-fc97-5fc4-904c-fd68753e618e", "metadata": {"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"}} {"task_id": "nmp3_0850e212-3989-524f-9179-2dee411d8a13", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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.\nimport Mathlib\n\nnamespace Problem\n\n/-- A natural number `n` is a sum of distinct perfect squares of positive\nintegers if there is a nonempty finite set of distinct square values, each of\nwhich is the square of a positive integer, whose sum is `n`. -/\ndef IsSumOfDistinctSquares (n : ℕ) : Prop :=\n ∃ s : Finset ℕ,\n s.Nonempty ∧\n (∀ q ∈ s, ∃ a : ℕ, 0 < a ∧ q = a ^ 2) ∧\n s.sum (fun q : ℕ => q) = n\n\n/-- The set of positive integers that cannot be represented as a sum of\ndistinct perfect squares of positive integers. -/\ndef NonrepresentablePositiveIntegers : Set ℕ :=\n {n : ℕ | 0 < n ∧ ¬ IsSumOfDistinctSquares n}\n\n/-- There is a natural-number bound above which every natural number is a sum\nof distinct perfect squares of positive integers. -/\ndef BoundedRepresentability : Prop :=\n ∃ M : ℕ, ∀ n : ℕ, M < n → IsSumOfDistinctSquares n\n\n/-- The assertion of the problem: the positive integers that are not sums of\ndistinct positive squares form a finite set, equivalently there is a bound\nabove which every natural number has such a representation. -/\ndef Target : Prop :=\n NonrepresentablePositiveIntegers.Finite ∧ BoundedRepresentability\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0850e212-3989-524f-9179-2dee411d8a13", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "16a4f22c888a41d6139d0e92af443533262cd7a1dafd6aa23aee453caaaa2c75", "task_path": "tasks/nmp3_0850e212-3989-524f-9179-2dee411d8a13", "metadata": {"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"}} {"task_id": "nmp3_08570448-11bf-5d67-b72d-4319324eb581", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ such that $a+b+c=3$. Prove that \n-- \\[\n-- \\bigl(a^2b+b^2c+c^2a\\bigr)\\,(ab+bc+ca)\\le 9.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement: a cyclic cubic-times-symmetric quadratic inequality\n\nSource problem: for nonnegative real numbers `a`, `b`, and `c` with\n`a + b + c = 3`, prove that\n`(a^2*b + b^2*c + c^2*a) * (a*b + b*c + c*a) <= 9`.\n-/\n\nnamespace Problem\n\n/-- The admissibility assumptions on the real variables in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a + b + c = 3\n\n/-- The inequality asserted for each admissible triple. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a) * (a * b + b * c + c * a) ≤ 9\n\n/-- The complete universally quantified target statement.\n\nThe variables range over real numbers. The nonnegativity constraints and the constraint\n`a + b + c = 3` are hypotheses; the displayed product inequality is the conclusion. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "08570448-11bf-5d67-b72d-4319324eb581", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "58adce4c8d2cf318ce4635f22365721179ea505f803795bf0c22db4bfd479e84", "task_path": "tasks/nmp3_08570448-11bf-5d67-b72d-4319324eb581", "metadata": {"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"}} {"task_id": "nmp3_08acbe00-b29f-5a3b-9b9b-2031bff62e9d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb R\\to\\mathbb R$ satisfy \n-- \n-- 1. $f(1)=1$, \n-- 2. $f(a+b)=f(a)+f(b)$ for all $a,b\\in\\mathbb R$, \n-- 3. $f(x)\\,f\\!\\bigl(\\tfrac1x\\bigr)=1$ for all $x\\in\\mathbb R\\setminus\\{0\\}$. \n-- \n-- Prove that $f(x)=x$ for every real $x$.\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The normalization condition `f(1) = 1`. -/\ndef NormalizedAtOne (f : ℝ → ℝ) : Prop :=\n f 1 = 1\n\n/-- Additivity of `f` over all real numbers:\n`f (a + b) = f a + f b` for every `a b : ℝ`. -/\ndef AdditiveOnReal (f : ℝ → ℝ) : Prop :=\n ∀ a b : ℝ, f (a + b) = f a + f b\n\n/-- The reciprocal product condition:\n`f x * f (1 / x) = 1` for every nonzero real `x`. -/\ndef InverseProductOne (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, x ≠ 0 → f x * f (1 / x) = 1\n\n/-- The three hypotheses imposed on `f` in the problem. -/\ndef Assumptions (f : ℝ → ℝ) : Prop :=\n NormalizedAtOne f ∧ AdditiveOnReal f ∧ InverseProductOne f\n\n/-- The conclusion that `f` is the identity on the real line. -/\ndef IdentityOnReal (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, f x = x\n\n/-- The full assertion of the problem: every real-valued function on `ℝ` that is\nnormalized at `1`, additive, and satisfies the given reciprocal product condition\nis the identity function. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, Assumptions f → IdentityOnReal f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "08acbe00-b29f-5a3b-9b9b-2031bff62e9d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "be6cdef4219a7f94004e48fb55805b4b534ef613789143bdbfeea9b050e3b042", "task_path": "tasks/nmp3_08acbe00-b29f-5a3b-9b9b-2031bff62e9d", "metadata": {"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"}} {"task_id": "nmp3_08e59a5e-9446-5ced-86d2-c903cb6bd96d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A sequence of real numbers $(a_n)_{n\\ge1}$ satisfies \n-- \\[\n-- a_n=-\\max_{\\,i+j=n}(a_i+a_j)\\qquad\\text{for every integer }n>2017,\n-- \\] \n-- 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 real constant $M$ such that $|a_n|\\le M$ for all $n\\in\\mathbb N.$\nimport Mathlib\n\n/-!\n# Formalization of a boundedness problem for a recursively constrained real sequence\n\nThe source problem considers a real sequence indexed by positive integers. We model it\nas a total function `a : ℕ → ℝ`; statements about the sequence are restricted to positive\nindices, so the arbitrary value at index `0` is never used.\n\nFor `n > 2017`, the source requires that `a n` is the negative of the maximum of\n`a i + a j` over all positive natural numbers `i, j` with `i + j = n`. The set\n`PairSums a n` contains precisely those candidate values. The recurrence is expressed\nby saying that `-a n` is a greatest element of that set (and hence that the maximum is\nattained and has value `-a n`).\n-/\n\nnamespace Problem\n\n/-- The set of all values `a i + a j` for positive indices `i` and `j` with `i + j = n`. -/\ndef PairSums (a : ℕ → ℝ) (n : ℕ) : Set ℝ :=\n {x : ℝ | ∃ i j : ℕ, 0 < i ∧ 0 < j ∧ i + j = n ∧ x = a i + a j}\n\n/-- The recurrence condition from the problem: for every integer `n > 2017`,\n`-a n` is the maximum of `a i + a j` over positive `i, j` with `i + j = n`.\nEquivalently, `a n = -max (a i + a j)`. -/\ndef SatisfiesRecurrence (a : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, 2017 < n → IsGreatest (PairSums a n) (-(a n))\n\n/-- The desired boundedness conclusion, stated on the positive indices of the sequence. -/\ndef BoundedOnPositiveIndices (a : ℕ → ℝ) : Prop :=\n ∃ M : ℝ, ∀ n : ℕ, 0 < n → |a n| ≤ M\n\n/-- The complete target proposition: every real sequence satisfying the recurrence is\nbounded on its positive indices. -/\ndef Target : Prop :=\n ∀ a : ℕ → ℝ, SatisfiesRecurrence a → BoundedOnPositiveIndices a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "08e59a5e-9446-5ced-86d2-c903cb6bd96d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c5f27238cee5c7c35795d47ae923d97a6c838e437b190b9f9d89ea1d48007dfe", "task_path": "tasks/nmp3_08e59a5e-9446-5ced-86d2-c903cb6bd96d", "metadata": {"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"}} {"task_id": "nmp3_08f48b0c-515f-5e98-97d5-32919822c1f8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\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}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable real inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`\nsatisfying `a * b * c = 1`, to prove the displayed inequality. The\ndeclaration `Problem.Target` below records that proposition. No proof is\nprovided at this statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (3 * a ^ 2 + 2 * b ^ 2) / (a * (a ^ 2 + b ^ 2)) +\n (3 * b ^ 2 + 2 * c ^ 2) / (b * (b ^ 2 + c ^ 2)) +\n (3 * c ^ 2 + 2 * a ^ 2) / (c * (c ^ 2 + a ^ 2))\n\n/--\nFor all positive real numbers `a`, `b`, and `c` with `a * b * c = 1`,\nthe displayed cyclic sum is at least `15 / 2`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n (15 : ℝ) / 2 ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "08f48b0c-515f-5e98-97d5-32919822c1f8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2a3a07586acff6735dbca55a735c4957b39202f76a722e9becf872b0b52672ac", "task_path": "tasks/nmp3_08f48b0c-515f-5e98-97d5-32919822c1f8", "metadata": {"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"}} {"task_id": "nmp3_094ae2ce-bc84-5d73-889e-473ed983ee46", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers \\(a,b,c,x,y,z\\) satisfying \\(a+x=b+y=c+z=1\\), prove that \n-- \\[\n-- (abc+xyz)\\Big(\\frac{1}{ay}+\\frac{1}{bz}+\\frac{1}{cx}\\Big)\\ge 3.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe source problem asks to prove, for positive real numbers\n`a, b, c, x, y, z` satisfying `a + x = b + y = c + z = 1`, that\n`(abc + xyz) * (1/(ay) + 1/(bz) + 1/(cx)) ≥ 3`.\n\nThe assertion is represented as a proposition-valued definition; no proof is\nincluded, as this task is statement formalization only.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved: for all positive reals `a, b, c, x, y, z`\nwith `a + x = 1`, `b + y = 1`, and `c + z = 1`,\n`(abc + xyz) * (1/(ay) + 1/(bz) + 1/(cx)) ≥ 3`. -/\ndef Target : Prop :=\n ∀ a b c x y z : ℝ,\n 0 < a → 0 < b → 0 < c →\n 0 < x → 0 < y → 0 < z →\n a + x = 1 → b + y = 1 → c + z = 1 →\n (a * b * c + x * y * z) *\n (1 / (a * y) + 1 / (b * z) + 1 / (c * x)) ≥ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "094ae2ce-bc84-5d73-889e-473ed983ee46", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "365653b66960da87b07e0fc12a97f3f5db8d4275cb78af082b7abd287fd51ac6", "task_path": "tasks/nmp3_094ae2ce-bc84-5d73-889e-473ed983ee46", "metadata": {"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"}} {"task_id": "nmp3_0977561f-225d-55ee-ad91-19418d057820", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ with $xyz=1$. Prove that \n-- \\[\n-- \\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.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the xyz inequality\n\nThe source problem asks to prove, for positive real numbers `x`, `y`, and `z`\nwith `x * y * z = 1`, the inequality\n\n`x / (1 / x ^ 8 + y + z) + y / (1 / y ^ 8 + z + x)\n + z / (1 / z ^ 8 + x + y) ≥ 1`.\n\nThe declarations below record the admissibility predicate, the left-hand side,\nand the universally quantified target proposition without asserting a proof.\n-/\n\nnamespace Problem\n\n/-- The constraint on the variables in the source problem:\n`x`, `y`, and `z` are positive reals and their product is `1`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x * y * z = 1\n\n/-- The left-hand side of the required inequality, with real division and\nnatural-number powers. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n x / (1 / x ^ 8 + y + z) +\n y / (1 / y ^ 8 + z + x) +\n z / (1 / z ^ 8 + x + y)\n\n/-- The target assertion: every positive real triple with product `1` satisfies\nthe stated inequality. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → lhs x y z ≥ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0977561f-225d-55ee-ad91-19418d057820", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "da416674246cf0fee7ef4ae8d57d9896abd407a4754c668aebeb4388eadcc0e7", "task_path": "tasks/nmp3_0977561f-225d-55ee-ad91-19418d057820", "metadata": {"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"}} {"task_id": "nmp3_0984e84b-88a4-5fc0-84a4-9adf6f89ba03", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Determine all continuous functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that \n-- \\[f(x+y+xy)=f(x)+f(y)+f(xy)\\] \n-- for every $x,y\\in\\mathbb{R}$.\nimport Mathlib\n\n/-!\n# Formal statement of the functional-equation classification problem\n\nThe problem asks for all continuous real-valued functions on `ℝ` satisfying\n`f (x + y + x*y) = f x + f y + f (x*y)` for every `x y : ℝ`.\n\nThe declarations below do not prove the classification. They define the\nadmissibility predicate, a candidate solution set, and the complete-answer\npredicate expressing both inclusions.\n-/\n\nnamespace Problem\n\n/-- The admissibility predicate for a function `f : ℝ → ℝ`.\n\n`f` is continuous and satisfies the functional equation for every pair of\nreal numbers `x` and `y`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n Continuous f ∧\n ∀ x y : ℝ, f (x + y + x * y) = f x + f y + f (x * y)\n\n/-- A function is linear through the origin when it is multiplication by a\nsingle real constant. -/\ndef IsLinearThroughOrigin (f : ℝ → ℝ) : Prop :=\n ∃ c : ℝ, ∀ x : ℝ, f x = c * x\n\n/-- The proposed complete answer set: all real multiples of the identity. -/\ndef SolutionSet : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | IsLinearThroughOrigin f}\n\n/-- A proposed set `S` is a complete solution set when it contains exactly the\nadmissible functions. This records both directions of the classification. -/\ndef IsCompleteSolutionSet (S : Set (ℝ → ℝ)) : Prop :=\n (∀ f : ℝ → ℝ, f ∈ S → Admissible f) ∧\n (∀ f : ℝ → ℝ, Admissible f → f ∈ S)\n\n/-- The classification claim for the problem, with `SolutionSet` as the\nproposed answer. -/\ndef Target : Prop :=\n IsCompleteSolutionSet SolutionSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0984e84b-88a4-5fc0-84a4-9adf6f89ba03", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5fbca6b70f27ece82270434e68fc0278f33b039e0a24039e868bc525d099d1e7", "task_path": "tasks/nmp3_0984e84b-88a4-5fc0-84a4-9adf6f89ba03", "metadata": {"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"}} {"task_id": "nmp3_09a43ec3-fcce-5e24-9332-7f7e304fca97", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- \\[\n-- \\frac{1}{x+y}+\\frac{1}{y+z}+\\frac{1}{z+x}\\ge \n-- \\frac{x}{x^{2}+yz}+\\frac{y}{y^{2}+xz}+\\frac{z}{z^{2}+xy}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The inequality stated in the problem, for positive real `x`, `y`, and `z`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n (1 / (x + y) + 1 / (y + z) + 1 / (z + x) : ℝ) ≥\n x / (x ^ 2 + y * z) + y / (y ^ 2 + x * z) + z / (z ^ 2 + x * y)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "09a43ec3-fcce-5e24-9332-7f7e304fca97", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e9ffe3e1688bd90b7264093a7eed55177b5594b452edc1e61af0e189170ec2cb", "task_path": "tasks/nmp3_09a43ec3-fcce-5e24-9332-7f7e304fca97", "metadata": {"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"}} {"task_id": "nmp3_09f1de93-968e-5ae5-aeaf-3d732a3d145a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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. Prove that $a_1=a_2=\\dots =a_{2n+1}$.\nimport Mathlib\n\nnamespace Problem\n\nopen scoped BigOperators\n\n/-- The remaining values after deleting the index `i` can be split into two\nsubsets of exactly `n` indices each, with equal sums.\n\nIndices are used as occurrences, so repeated values of `a` are treated as\ndistinct multiset elements, as in the original problem. -/\ndef BalancedDecompositionAt (n : ℕ) (a : Fin (2 * n + 1) → ℝ)\n (i : Fin (2 * n + 1)) : Prop :=\n ∃ S T : Finset (Fin (2 * n + 1)),\n S.card = n ∧\n T.card = n ∧\n Disjoint S T ∧\n S ∪ T = Finset.univ.erase i ∧\n (∑ j ∈ S, a j) = ∑ j ∈ T, a j\n\n/-- Every one of the `2n+1` indexed real numbers has the balanced-decomposition\nproperty after its own index is removed. -/\ndef Admissible (n : ℕ) (a : Fin (2 * n + 1) → ℝ) : Prop :=\n ∀ i : Fin (2 * n + 1), BalancedDecompositionAt n a i\n\n/-- The assertion of the problem: for every integer `n ≥ 1`, if every deletion\nof one of the `2n+1` real numbers leaves a multiset that can be partitioned\ninto two `n`-element subsets with equal sums, then all `2n+1` numbers are equal. -/\ndef Target : Prop :=\n ∀ n : ℕ, 1 ≤ n → ∀ a : Fin (2 * n + 1) → ℝ,\n Admissible n a → ∀ i j : Fin (2 * n + 1), a i = a j\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "09f1de93-968e-5ae5-aeaf-3d732a3d145a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7e5cc782293420034d285c0a5067575ebbba0089ab447c6a23ea432730f36407", "task_path": "tasks/nmp3_09f1de93-968e-5ae5-aeaf-3d732a3d145a", "metadata": {"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"}} {"task_id": "nmp3_0a477f55-5c73-5c1d-aa13-7adabd8262d2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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$,\n-- \\[\n-- f(x^n)\\le f(x)\\,f(x^2)^{\\frac12}\\,f(x^3)^{\\frac13}\\cdots f(x^n)^{\\frac1n}.\n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The positive real numbers, used as the domain and codomain of `f`. -/\nabbrev PosReal : Type := Submonoid.pos ℝ\n\n/-- The hypothesis that `f : (0, ∞) → (0, ∞)` is submultiplicative:\n`f (x * y) ≤ f x * f y` for all positive real `x` and `y`. -/\ndef Admissible (f : PosReal → PosReal) : Prop :=\n ∀ x y : PosReal, f (x * y) ≤ f x * f y\n\n/-- The assertion to be proved: for every submultiplicative function\n`f : (0, ∞) → (0, ∞)`, every positive real `x`, and every positive integer `n`,\n`f (x ^ n)` is at most the product of `f (x ^ k) ^ (1 / k)` over `1 ≤ k ≤ n`. -/\ndef Target : Prop :=\n ∀ f : PosReal → PosReal, Admissible f →\n ∀ (x : PosReal) (n : ℕ), 0 < n →\n (f (x ^ n) : ℝ) ≤\n ∏ k ∈ Finset.Icc 1 n, (f (x ^ k) : ℝ) ^ ((k : ℝ)⁻¹)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0a477f55-5c73-5c1d-aa13-7adabd8262d2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8cc4d8dc75510d91654ec4675c23da2c9a4a4cb9ef0d5b86a973c274443d4f08", "task_path": "tasks/nmp3_0a477f55-5c73-5c1d-aa13-7adabd8262d2", "metadata": {"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"}} {"task_id": "nmp3_0a5d8699-998f-5db0-b2b0-2f5a7079c929", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- \\[\n-- \\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.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the real-variable denominator inequality\n\nThe source problem asks to prove, for all real numbers `x`, `y`, and `z`\nwhose three squared-pair denominators are nonzero, a non-strict upper bound\nfor the stated three-term real sum.\n-/\n\nnamespace Problem\n\n/-- The three-term real expression appearing on the left-hand side of the\nsource inequality. -/\nnoncomputable def LHS (x y z : ℝ) : ℝ :=\n x * (x + y) / (x ^ 2 + y ^ 2) +\n y * (y + z) / (y ^ 2 + z ^ 2) +\n z * (z + x) / (z ^ 2 + x ^ 2)\n\n/-- The universal assertion stated in the source problem: for every triple of\nreal numbers with all three pair-sum-of-squares denominators nonzero, the\nspecified left-hand side is at most `3`. -/\ndef Target : Prop :=\n ∀ (x y z : ℝ),\n x ^ 2 + y ^ 2 ≠ 0 →\n y ^ 2 + z ^ 2 ≠ 0 →\n z ^ 2 + x ^ 2 ≠ 0 →\n LHS x y z ≤ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0a5d8699-998f-5db0-b2b0-2f5a7079c929", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4dc8c5dec597805c80f0865ecbb6e44e94a6f2863e2e090bd684ec2ecd20d7e9", "task_path": "tasks/nmp3_0a5d8699-998f-5db0-b2b0-2f5a7079c929", "metadata": {"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"}} {"task_id": "nmp3_0a65bf83-cd65-566c-a602-a460a84e10a5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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$, and the circles $(AHB)$ and $(BOC)$ intersect again at $F\\neq B$. Prove that $ME = MF\\,. $\nmodule\n\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\npublic import Mathlib.Geometry.Euclidean.Circumcenter\n\n/-!\n# Formal statement of the triangle median-distance problem\n\nThe ambient plane is the real Euclidean plane `EuclideanSpace ℝ (Fin 2)`.\nThe main declaration, `Problem.Target`, is the proposition asserted by the\nproblem; it is not a proof of that proposition.\n-/\n\n@[expose] public section\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A point of the Euclidean plane used throughout the formalization. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/--\n`AcuteTriangle A B C` says that the distinct points `A`, `B`, and `C` form an\nacute-angled triangle: each of its three (undirected) interior angles is\nstrictly less than a right angle.\n-/\ndef AcuteTriangle (A B C : Point) : Prop :=\n A ≠ B ∧ B ≠ C ∧ C ≠ A ∧\n EuclideanGeometry.angle B A C < Real.pi / 2 ∧\n EuclideanGeometry.angle A B C < Real.pi / 2 ∧\n EuclideanGeometry.angle B C A < Real.pi / 2\n\n/--\n`IsCircumcenter A B C O` says that `O` is equidistant from the three vertices\n`A`, `B`, and `C`, i.e. it is the center of their circumcircle.\n-/\ndef IsCircumcenter (A B C O : Point) : Prop :=\n dist O A = dist O B ∧ dist O B = dist O C\n\n/--\n`IsAltitudeFoot B A C H` says that `H` lies on the line `AC` and that `BH` is\nperpendicular to `AC`.\n-/\ndef IsAltitudeFoot (B A C H : Point) : Prop :=\n H ∈ affineSpan ℝ ({A, C} : Set Point) ∧\n inner ℝ (B - H) (C - A) = 0\n\n/-- `IsMidpoint A C M` says that `M` is the midpoint of the segment `AC`. -/\ndef IsMidpoint (A C M : Point) : Prop :=\n M = midpoint ℝ A C\n\n/-- A nondegenerate Euclidean circle passes through each of the three given points. -/\ndef IsCircleThrough (A B C : Point) (Γ : EuclideanGeometry.Sphere Point) : Prop :=\n 0 < Γ.radius ∧ A ∈ Γ ∧ B ∈ Γ ∧ C ∈ Γ\n\n/--\n`IsUniqueCircleThrough A B C Γ` says that `Γ` is the unique nondegenerate\ncircle through `A`, `B`, and `C`.\n-/\ndef IsUniqueCircleThrough (A B C : Point) (Γ : EuclideanGeometry.Sphere Point) : Prop :=\n IsCircleThrough A B C Γ ∧\n ∀ Δ : EuclideanGeometry.Sphere Point, IsCircleThrough A B C Δ → Δ = Γ\n\n/--\n`IsSecondIntersection P Q R S T U B X` is the construction saying that the\ncircle through `P`, `Q`, and `R` and the circle through `S`, `T`, and `U` are\ndistinct, meet at `B`, and meet again exactly at the further point `X`, with\n`X ≠ B`. The two triples determine unique circles.\n-/\ndef IsSecondIntersection\n (P Q R S T U B X : Point) : Prop :=\n ∃ Γ₁ Γ₂ : EuclideanGeometry.Sphere Point,\n IsUniqueCircleThrough P Q R Γ₁ ∧\n IsUniqueCircleThrough S T U Γ₂ ∧\n Γ₁ ≠ Γ₂ ∧\n B ∈ Γ₁ ∧ B ∈ Γ₂ ∧\n X ∈ Γ₁ ∧ X ∈ Γ₂ ∧\n X ≠ B ∧\n ∀ Y : Point, Y ∈ Γ₁ → Y ∈ Γ₂ → Y = B ∨ Y = X\n\n/--\nThe assertion of the problem: for every acute triangle `ABC`, every\ncircumcenter `O`, every altitude foot `H` from `B` to `AC`, and every midpoint\n`M` of `AC`, there are second intersections `E` and `F` as specified, and the\ntwo distances `ME` and `MF` are equal.\n-/\ndef Target : Prop :=\n ∀ (A B C O H M : Point),\n AcuteTriangle A B C →\n IsCircumcenter A B C O →\n IsAltitudeFoot B A C H →\n IsMidpoint A C M →\n ∃ E : Point,\n IsSecondIntersection A O B B H C B E ∧\n ∃ F : Point,\n IsSecondIntersection A H B B O C B F ∧\n dist M E = dist M F\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0a65bf83-cd65-566c-a602-a460a84e10a5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "485dfdb354595c692789952b1ff6104c6d6ceb1fbecc1a8f931df57421c7e7f0", "task_path": "tasks/nmp3_0a65bf83-cd65-566c-a602-a460a84e10a5", "metadata": {"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"}} {"task_id": "nmp3_0a7d99e8-e3f2-5e95-b1a1-7677e21c0215", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ and $\\displaystyle\\frac1a+\\frac1b+\\frac1c=1$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a-1}{b}}+\\sqrt{\\frac{b-1}{c}}+\\sqrt{\\frac{c-1}{a}}\\ge\\sqrt6\\,. \n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the target assertion in `problem.md`.\n\nThe source states: for positive real numbers `a`, `b`, `c` satisfying\n`1 / a + 1 / b + 1 / c = 1`, prove that\n`sqrt ((a - 1) / b) + sqrt ((b - 1) / c) + sqrt ((c - 1) / a) ≥ sqrt 6`.\n\nThis file only records the proposition; it deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved, with `a`, `b`, and `c` interpreted as real\nnumbers and with real division and the real square root. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c →\n 1 / a + 1 / b + 1 / c = 1 →\n Real.sqrt ((a - 1) / b) + Real.sqrt ((b - 1) / c) +\n Real.sqrt ((c - 1) / a) ≥\n Real.sqrt 6\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0a7d99e8-e3f2-5e95-b1a1-7677e21c0215", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "debe8563f0bf5cdd7653837350e5aa82567d6a10a92215415b6b228a1a0aab3f", "task_path": "tasks/nmp3_0a7d99e8-e3f2-5e95-b1a1-7677e21c0215", "metadata": {"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"}} {"task_id": "nmp3_0a90363a-46ad-5ed8-a7ab-16134789df58", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x_1,x_2,\\dots,x_k$ be positive real numbers with $k>3$. Prove that \n-- \\[\n-- \\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,\n-- \\] \n-- where the indices are taken cyclically (e.g., $x_{k+1}=x_1$, $x_0=x_k$).\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic denominator inequality\n\nThe problem considers positive real numbers indexed cyclically by `k > 3`.\nThis file records the assertion as a proposition; it does not prove it.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The predecessor of an index on the cycle `Fin k`.\nFor `k = n + 1`, adding `n` modulo `k` is the same as subtracting one modulo `k`. -/\ndef cyclicPrev : (k : ℕ) → Fin k → Fin k\n | 0, i => i.elim0\n | n + 1, i => Fin.ofNat (n + 1) (i.val + n)\n\n/-- The successor of an index on the cycle `Fin k`. -/\ndef cyclicNext : (k : ℕ) → Fin k → Fin k\n | 0, i => i.elim0\n | n + 1, i => Fin.ofNat (n + 1) (i.val + 1)\n\n/-- The cyclic sum on the left-hand side of the claimed inequality. -/\nnoncomputable def cyclicSum (k : ℕ) (x : Fin k → ℝ) : ℝ :=\n ∑ i : Fin k, x i / (x (cyclicPrev k i) + x (cyclicNext k i))\n\n/-- All entries of the finite sequence are positive. -/\ndef PositiveEntries (k : ℕ) (x : Fin k → ℝ) : Prop :=\n ∀ i : Fin k, 0 < x i\n\n/-- The assertion in the problem: for every natural `k > 3`, and every positive\nreal cyclic sequence of length `k`, the cyclic sum is at least `2`. -/\ndef Target : Prop :=\n ∀ (k : ℕ), 3 < k → ∀ (x : Fin k → ℝ),\n PositiveEntries k x → cyclicSum k x ≥ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0a90363a-46ad-5ed8-a7ab-16134789df58", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e5d9989de43cdc6dd0c9cb86bde26011c41d17218a9c9ea346c70219c7855fcd", "task_path": "tasks/nmp3_0a90363a-46ad-5ed8-a7ab-16134789df58", "metadata": {"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"}} {"task_id": "nmp3_0b082f99-f0b0-5af6-9072-8f5b3359f734", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $a_1,\\dots,a_n$ are integers with $\\gcd(a_1,\\dots,a_n)=1$. Let $S\\subseteq\\mathbb Z$ satisfy \n-- \n-- (a) $a_i\\in S$ for each $i=1,\\dots,n$; \n-- \n-- (b) $a_i-a_j\\in S$ for all $i,j\\in\\{1,\\dots,n\\}$ (indices need not be distinct); \n-- \n-- (c) For any integers $x,y\\in S$, if $x+y\\in S$ then $x-y\\in S$. \n-- \n-- Prove that $S=\\mathbb Z\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the integer additive-set problem\n\nThe source problem gives a finite family `a₁, …, aₙ` of integers with\n`gcd(a₁, …, aₙ) = 1` and a subset `S ⊆ ℤ` satisfying three closure\nconditions, and asks to prove `S = ℤ`.\n\nWe index the family by `Fin n` rather than by `1, …, n`; this is only a\nreindexing and does not change the quantified conditions.\n-/\n\nnamespace Problem\n\n/-- The greatest common divisor of the finite integer family `a`. This is the\nnormalized `Finset.gcd`, so for an integer family its value is nonnegative. -/\ndef FamilyGcd {n : ℕ} (a : Fin n → ℤ) : ℤ :=\n (Finset.univ : Finset (Fin n)).gcd a\n\n/-- The hypothesis `gcd(a₁, …, aₙ) = 1`, expressed for the `Fin n`-indexed\nfamily `a`. -/\ndef GcdOne {n : ℕ} (a : Fin n → ℤ) : Prop :=\n FamilyGcd a = 1\n\n/-- The admissibility conditions imposed on the integer family `a` and the set\n`S ⊆ ℤ`.\n\nThe conjuncts are, in order:\n* `gcd(a₁, …, aₙ) = 1`;\n* condition (a): every member of the family belongs to `S`;\n* condition (b): every difference `aᵢ - aⱼ` belongs to `S`, including `i = j`;\n* condition (c): whenever `x, y ∈ S` and `x + y ∈ S`, then `x - y ∈ S`.\n-/\ndef Admissible (n : ℕ) (a : Fin n → ℤ) (S : Set ℤ) : Prop :=\n GcdOne a ∧\n (∀ i : Fin n, a i ∈ S) ∧\n (∀ i j : Fin n, a i - a j ∈ S) ∧\n (∀ x y : ℤ, x ∈ S → y ∈ S → x + y ∈ S → x - y ∈ S)\n\n/-- The complete assertion to be proved: for every `n : ℕ`, every integer\nfamily `a₁, …, aₙ` with gcd one, and every subset `S ⊆ ℤ` satisfying (a),\n(b), and (c), one has `S = ℤ`.\n\nThe `n = 0` case is included by the `Fin n` encoding. There the `Finset.gcd`\nof the empty family is `0`, so `GcdOne a` is false and the implication is\nvacuous; this does not add any non-vacuous mathematical content to the\nintended family case. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (a : Fin n → ℤ) (S : Set ℤ),\n Admissible n a S → S = (Set.univ : Set ℤ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0b082f99-f0b0-5af6-9072-8f5b3359f734", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ae68e1939ab3712dbd53793e0d865d482912cf4b6a5a3663959b0e6e6463ce99", "task_path": "tasks/nmp3_0b082f99-f0b0-5af6-9072-8f5b3359f734", "metadata": {"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"}} {"task_id": "nmp3_0b0b696a-c4d1-5fe9-a9e3-e60d6797deb9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be nonnegative real numbers. Prove that \n-- \\[\n-- 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.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nFor all nonnegative real numbers `a`, `b`, `c`, and `d`, the inequality\n`a^4 + b^4 + c^4 + d^4 + 2abcd ≥ a^2b^2 + a^2c^2 + a^2d^2 +\nb^2c^2 + b^2d^2 + c^2d^2` holds.\n-/\ndef Target : Prop :=\n ∀ (a b c d : ℝ),\n 0 ≤ a → 0 ≤ b → 0 ≤ c → 0 ≤ d →\n a ^ 4 + b ^ 4 + c ^ 4 + d ^ 4 + 2 * a * b * c * d ≥\n a ^ 2 * b ^ 2 + a ^ 2 * c ^ 2 + a ^ 2 * d ^ 2 +\n b ^ 2 * c ^ 2 + b ^ 2 * d ^ 2 + c ^ 2 * d ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0b0b696a-c4d1-5fe9-a9e3-e60d6797deb9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c9a79bdd026298732e4875770c87a88fc4b2882b18cba9f828954b91f195ddf5", "task_path": "tasks/nmp3_0b0b696a-c4d1-5fe9-a9e3-e60d6797deb9", "metadata": {"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"}} {"task_id": "nmp3_0b1aca32-a32c-554a-9448-cf704fa003eb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge 0$ satisfy $x^2+y^2+z^2=1$. Prove that \n-- \\[\n-- \\sqrt{1-xy}\\,\\sqrt{1-yz}+\\sqrt{1-yz}\\,\\sqrt{1-zx}+\\sqrt{1-zx}\\,\\sqrt{1-xy}\\ge 2.\n-- \\] \n-- (The sum is taken cyclically over $(x,y,z)$.)\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The real square root of `1 - x * y`, one of the three radical factors in\nthe displayed cyclic sum. -/\ndef sqrtOneSubMul (x y : ℝ) : ℝ := Real.sqrt (1 - x * y)\n\n/-- The cyclic sum\n`sqrt (1 - x*y) * sqrt (1 - y*z)\n + sqrt (1 - y*z) * sqrt (1 - z*x)\n + sqrt (1 - z*x) * sqrt (1 - x*y)`\nfrom the statement, expressed for the ordered triple `(x, y, z)`. -/\ndef cyclicSum (x y z : ℝ) : ℝ :=\n sqrtOneSubMul x y * sqrtOneSubMul y z +\n sqrtOneSubMul y z * sqrtOneSubMul z x +\n sqrtOneSubMul z x * sqrtOneSubMul x y\n\n/-- The three nonnegativity assumptions in the problem. -/\ndef NonnegativeCoordinates (x y z : ℝ) : Prop :=\n 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z\n\n/-- The unit-sphere constraint appearing in the problem. -/\ndef UnitSphereEquation (x y z : ℝ) : Prop :=\n x ^ 2 + y ^ 2 + z ^ 2 = 1\n\n/-- The inequality asserted in the problem. -/\ndef InequalityConclusion (x y z : ℝ) : Prop :=\n 2 ≤ cyclicSum x y z\n\n/-- The assertion to be proved: for every triple of nonnegative real numbers\n`x, y, z` satisfying `x^2 + y^2 + z^2 = 1`, the displayed cyclic sum is at\nleast `2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n NonnegativeCoordinates x y z →\n UnitSphereEquation x y z →\n InequalityConclusion x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0b1aca32-a32c-554a-9448-cf704fa003eb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8be83f1a75c43e67dcc49ae7d98991efe4dd06afc46df2798255147314442975", "task_path": "tasks/nmp3_0b1aca32-a32c-554a-9448-cf704fa003eb", "metadata": {"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"}} {"task_id": "nmp3_0b1bb5c5-3438-5f93-a27a-1b78facb4dc7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ with $xyz=1$. Prove that \n-- \\[\n-- \\frac{1}{\\sqrt{4x^{2}+x+4}}+\\frac{1}{\\sqrt{4y^{2}+y+4}}+\\frac{1}{\\sqrt{4z^{2}+z+4}}\\le 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic square-root inequality\n\nThe source problem asks, for positive real numbers `x`, `y`, and `z` whose\nproduct is `1`, to prove the stated upper bound for the sum of the three\nreciprocal square-root terms.\n-/\n\nnamespace Problem\n\n/-- The summand appearing in the inequality, with its argument explicitly\ntyped as a real number. -/\nnoncomputable def sqrtReciprocalTerm (x : ℝ) : ℝ :=\n 1 / Real.sqrt ((4 : ℝ) * x ^ 2 + x + 4)\n\n/-- The assertion of the source problem: for all positive real `x`, `y`, and\n`z` satisfying `x * y * z = 1`, the sum of the three corresponding reciprocal\nsquare-root terms is at most `1`. -/\nnoncomputable def Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x * y * z = (1 : ℝ) →\n sqrtReciprocalTerm x + sqrtReciprocalTerm y + sqrtReciprocalTerm z ≤ (1 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0b1bb5c5-3438-5f93-a27a-1b78facb4dc7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0e9df14aa441c74d270803ecc96e68231c82fe15e1e05e5fd18aed7969576b3c", "task_path": "tasks/nmp3_0b1bb5c5-3438-5f93-a27a-1b78facb4dc7", "metadata": {"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"}} {"task_id": "nmp3_0b34a3c5-036e-51b4-aab3-841226d0eee3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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 \n-- \\[\n-- \\frac{PA}{a^{2}}+\\frac{PB}{b^{2}}+\\frac{PC}{c^{2}}\\ge\\frac1R.\n-- \\] \n-- Equivalently, $\\displaystyle\\frac{PA}{BC^{2}}+\\frac{PB}{CA^{2}}+\\frac{PC}{AB^{2}}\\ge\\frac1R\\,. $\nmodule\n\npublic import Mathlib.Geometry.Euclidean.Circumcenter\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Analysis.Convex.Hull\n\n/-!\n# Formal statement of the triangle distance inequality\n\nThe problem concerns a nondegenerate triangle in the Euclidean plane and a\npoint in its strict interior. The side names `a`, `b`, `c` and the\ncircumradius `R` are represented by definitions rather than independent\nparameters.\n-/\n\nnoncomputable section\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real vector space with two coordinates. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A nondegenerate triangle in the Euclidean plane, with vertices indexed by `0`, `1`, `2`. -/\nabbrev Triangle : Type := Affine.Triangle ℝ Plane\n\n/-- The vertex `A`, at index `0`. -/\ndef vertexA (t : Triangle) : Plane := t.points 0\n\n/-- The vertex `B`, at index `1`. -/\ndef vertexB (t : Triangle) : Plane := t.points 1\n\n/-- The vertex `C`, at index `2`. -/\ndef vertexC (t : Triangle) : Plane := t.points 2\n\n/-- The side length `a = BC`. -/\ndef sideA (t : Triangle) : ℝ := dist (vertexB t) (vertexC t)\n\n/-- The side length `b = CA`. -/\ndef sideB (t : Triangle) : ℝ := dist (vertexC t) (vertexA t)\n\n/-- The side length `c = AB`. -/\ndef sideC (t : Triangle) : ℝ := dist (vertexA t) (vertexB t)\n\n/-- The circumradius `R` of the triangle. -/\ndef circumradiusR (t : Triangle) : ℝ := t.circumradius\n\n/-- The assertion that `P` lies in the strict interior of triangle `ABC`. -/\ndef InsideTriangle (t : Triangle) (P : Plane) : Prop :=\n P ∈ interior (convexHull ℝ (Set.range t.points))\n\n/-- The left-hand side `PA / a^2 + PB / b^2 + PC / c^2`. -/\ndef lhs (t : Triangle) (P : Plane) : ℝ :=\n dist P (vertexA t) / (sideA t) ^ 2 +\n dist P (vertexB t) / (sideB t) ^ 2 +\n dist P (vertexC t) / (sideC t) ^ 2\n\n/-- The assertion proved in the problem: for every point `P` strictly inside a\nnondegenerate triangle `ABC`, the stated sum is at least the reciprocal of the\ncircumradius. -/\ndef Target : Prop :=\n ∀ (t : Triangle) (P : Plane), InsideTriangle t P → lhs t P ≥ 1 / circumradiusR t\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0b34a3c5-036e-51b4-aab3-841226d0eee3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "553c2a20273e63398932b957bbadae3bd3f71b39e2590bd4a033f6a97526783e", "task_path": "tasks/nmp3_0b34a3c5-036e-51b4-aab3-841226d0eee3", "metadata": {"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"}} {"task_id": "nmp3_0b3e46c4-8626-5f96-940b-c8205c38a579", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a>1$ be a positive integer. For $n\\ge1$ define \n-- \\[\n-- a_n=\\Bigl\\lfloor\\frac{a^n}{n}\\Bigr\\rfloor .\n-- \\]\n-- 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$).\nmodule\n\npublic import Mathlib.Algebra.Order.Archimedean.Real.Basic\n\n/-!\n# The sequence `a_n = floor (a ^ n / n)`\n\nThis file states the target proposition from the problem. It does not prove\nthe proposition: `Problem.Target` is a `Prop`-valued definition whose body is\nthe quantified statement.\n-/\n\nnamespace Problem\n\n/-- For a natural number `a` and an index `n`, the value\n`floor (((a ^ n : ℕ) : ℝ) / (n : ℝ))` from the problem. The definition is total in\n`n`; the target below only uses indices satisfying `1 ≤ n`. -/\npublic noncomputable def term (a : ℕ) (n : ℕ) : ℤ :=\n ⌊(((a ^ n : ℕ) : ℝ) / (n : ℝ))⌋\n\n/-- The assertion of the problem: for every integer `a > 1`, and every\npositive integer `N`, some term `floor (a ^ n / n)` with `n ≥ 1` is divisible\nby `N`. -/\npublic def Target : Prop :=\n ∀ (a : ℕ), 1 < a →\n ∀ (N : ℕ), 0 < N →\n ∃ (n : ℕ), 1 ≤ n ∧ (N : ℤ) ∣ term a n\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0b3e46c4-8626-5f96-940b-c8205c38a579", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f8f4f44b6cdabe9308d81db124f1800fb98d9206e6601d56b63947ba04d15bbe", "task_path": "tasks/nmp3_0b3e46c4-8626-5f96-940b-c8205c38a579", "metadata": {"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"}} {"task_id": "nmp3_0b6ffd6e-e8cd-5781-85fb-895b59e8b41b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For every integer $x\\ge 4$, prove that there exist integers $a,b,c,d,e$ such that \n-- \\[\n-- x^3=a^3+b^3+c^3+d^3+e^3\n-- \\qquad\\text{and}\\qquad \n-- |a|,|b|,|c|,|d|,|e| x + v) '' P\n\n/-- Area of the common interior overlap of `P` and its translate by `v`. -/\nnoncomputable def overlapArea (P : Set Plane) (v : Plane) : ℝ :=\n area (interior P ∩ interior (translate v P))\n\n/-- A translation vector whose Euclidean length is exactly `1 / 100`. -/\ndef TranslationAtRequiredDistance (v : Plane) : Prop :=\n ‖v‖ = (1 : ℝ) / 100\n\n/-- The assertion from the problem: there is a universal real constant `c < 1`\nsuch that every unit-area polygon admits a translation by distance `1/100` whose\ninterior-overlap area is at most `c`.\n\nThe constant `c` is quantified before `P`, so it is independent of the polygon.\nNo positivity or optimality condition on `c` is added: the source only requires\n`c < 1`. -/\nnoncomputable def Target : Prop :=\n ∃ c : ℝ, c < 1 ∧\n ∀ P : Set Plane,\n IsPolygon P →\n area P = (1 : ℝ) →\n ∃ v : Plane,\n TranslationAtRequiredDistance v ∧ overlapArea P v ≤ c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0b9a99de-5eed-5152-bbeb-d8dd391c0daf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1869e19af3f90878736593ff10d1e1775c111128158d463e909a55ae5ffe64e6", "task_path": "tasks/nmp3_0b9a99de-5eed-5152-bbeb-d8dd391c0daf", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0b9a99de-5eed-5152-bbeb-d8dd391c0daf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0bb4018b-3f84-5eeb-b404-62a15cd37865", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for positive real numbers \\(a,b,c\\) satisfying \\(a+b+c=1\\),\n-- \\[\n-- \\frac{ab}{\\sqrt{ab+bc}}+\\frac{bc}{\\sqrt{bc+ca}}+\\frac{ca}{\\sqrt{ca+ab}}\\le\\frac{1}{\\sqrt2}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissibility condition for the variables in the inequality:\n`a`, `b`, and `c` are positive real numbers whose sum is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 1\n\n/-- The left-hand side of the desired inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a * b) / Real.sqrt (a * b + b * c) +\n (b * c) / Real.sqrt (b * c + c * a) +\n (c * a) / Real.sqrt (c * a + a * b)\n\n/-- The desired inequality, for a fixed admissible triple `(a, b, c)`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ (1 : ℝ) / Real.sqrt 2\n\n/-- The full universal assertion stated in the problem: for every triple of\npositive real numbers `a`, `b`, `c` satisfying `a + b + c = 1`, the stated\ncyclic square-root inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0bb4018b-3f84-5eeb-b404-62a15cd37865", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0e5b9797f74b1f1b2ffee3ca489fc2a900c8e9028f6fda5f0f74d3a539b4083c", "task_path": "tasks/nmp3_0bb4018b-3f84-5eeb-b404-62a15cd37865", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0bb4018b-3f84-5eeb-b404-62a15cd37865", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0bc2419b-1a7c-579c-9a04-34fd3c8a3601", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,b_1,a_2,b_2,\\dots ,a_n,b_n$ be non‑negative real numbers. Prove that \n-- \\[\n-- \\sum_{i=1}^{n}\\sum_{j=1}^{n}\\min\\{a_i a_j,\\;b_i b_j\\}\\;\\le\\;\\sum_{i=1}^{n}\\sum_{j=1}^{n}\\min\\{a_i b_j,\\;a_j b_i\\}.\n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality, indexed by `Fin n`. -/\ndef LeftHandSide (n : ℕ) (a b : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, ∑ j : Fin n, min (a i * a j) (b i * b j)\n\n/-- The right-hand side of the target inequality, indexed by `Fin n`. -/\ndef RightHandSide (n : ℕ) (a b : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, ∑ j : Fin n, min (a i * b j) (a j * b i)\n\n/-- All coordinates of both sequences are non-negative. -/\ndef NonnegativeCoordinates (n : ℕ) (a b : Fin n → ℝ) : Prop :=\n (∀ i : Fin n, 0 ≤ a i) ∧ (∀ i : Fin n, 0 ≤ b i)\n\n/-- The assertion in the problem. The indices `1, ..., n` from the source are\nrepresented by the finite type `Fin n`; sums over `Fin n` are the corresponding\nfinite sums. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (a b : Fin n → ℝ),\n NonnegativeCoordinates n a b → LeftHandSide n a b ≤ RightHandSide n a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0bc2419b-1a7c-579c-9a04-34fd3c8a3601", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "84e246bb9da4e6cc422203a1c3f6b3a3019931ed604a5b8e6548b00536d80f9b", "task_path": "tasks/nmp3_0bc2419b-1a7c-579c-9a04-34fd3c8a3601", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0bc2419b-1a7c-579c-9a04-34fd3c8a3601", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0bfc1884-4de4-592b-bb3f-b71f32ae6f7b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In a group of $k$ people, some are acquainted with each other and some are not. Each evening one person invites all of his acquaintances to a party and introduces any two of them who are not yet acquainted (i.e., after the party all of his acquaintances become pairwise acquainted). Suppose that after each person has arranged at least one party there still exist two people who do not know each other. Prove that those two people will not meet each other at the next party.\nimport Mathlib.Combinatorics.SimpleGraph.Basic\n\n/-!\n# Formalization of the acquaintance-party problem\n\nThe acquaintance relation is represented by a `SimpleGraph` on the finite type\n`Fin k`. One evening is represented by a graph transformation: if `host`\ngives the party, then every two acquaintances of `host` become adjacent. The\ninitial acquaintance graph is arbitrary.\n\nThe main declaration, `Problem.Target`, is a proposition (not a proof): after\nsome number of evenings in which every person has hosted at least once, any two\ndistinct people who are not acquainted will not both be present at the next\nevening's party.\n-/\n\nnamespace Problem\n\n/-- The graph after one person (`host`) gives a party. Existing acquaintances\nare retained, and all pairs of current acquaintances of the host are made\nacquainted. (The host is not one of their own acquaintances, since the graph\nis loopless.) -/\ndef PartyStep {V : Type*} (G : SimpleGraph V) (host : V) : SimpleGraph V where\n Adj x y := G.Adj x y ∨ (x ≠ y ∧ G.Adj host x ∧ G.Adj host y)\n symm := ⟨by\n intro x y hxy\n rcases hxy with hxy | ⟨hne, hhx, hhy⟩\n · exact Or.inl (G.symm.symm x y hxy)\n · exact Or.inr ⟨hne.symm, hhy, hhx⟩⟩\n loopless := ⟨by\n intro x hxx\n rcases hxx with hxx | ⟨hne, _hhx, _hhy⟩\n · exact G.loopless.irrefl x hxx\n · exact (hne rfl).elim⟩\n\n/-- The acquaintance graph after the first `n` evenings, where `hosts i` is the\nhost of evening `i` (with zero-based indexing). -/\ndef StateAfter {V : Type*} (initial : SimpleGraph V) (hosts : ℕ → V) :\n ℕ → SimpleGraph V\n | 0 => initial\n | n + 1 => PartyStep (StateAfter initial hosts n) (hosts n)\n\n/-- By time `n`, every person has hosted at least one of the evenings\n`0, ..., n - 1`. -/\ndef AllHaveHostedBy {V : Type*} (hosts : ℕ → V) (n : ℕ) : Prop :=\n ∀ person : V, ∃ i : ℕ, i < n ∧ hosts i = person\n\n/-- There are two distinct people who are not acquainted in `G`. -/\ndef HasUnacquaintedPair {V : Type*} (G : SimpleGraph V) : Prop :=\n ∃ x y : V, x ≠ y ∧ ¬ G.Adj x y\n\n/-- A person is present at the party hosted by `host`: either they are the host,\nor they are one of the host's invited acquaintances. -/\ndef PresentAtParty {V : Type*} (G : SimpleGraph V) (host person : V) : Prop :=\n person = host ∨ G.Adj host person\n\n/-- The two people `x` and `y` meet each other at the party hosted by `host`,\nin the sense that both are present at that party. -/\ndef MeetAtParty {V : Type*} (G : SimpleGraph V) (host x y : V) : Prop :=\n x ≠ y ∧ PresentAtParty G host x ∧ PresentAtParty G host y\n\n/-- The assertion to be proved.\n\nFor every finite group size `k`, every initial acquaintance graph, every\nsequence of hosts, and every time `n` after which every person has hosted at\nleast once: if two distinct people `x`, `y` are still unacquainted after those\n`n` evenings, then at the next evening (hosted by `hosts n`) they are not both\npresent and hence do not meet.\n\nThe final universal quantification over `x` and `y` makes precise the phrase\n\"those two people\": any pair witnessing the stated remaining non-acquaintance\nis covered. -/\ndef Target : Prop :=\n ∀ (k : ℕ) (initial : SimpleGraph (Fin k)) (hosts : ℕ → Fin k) (n : ℕ),\n AllHaveHostedBy hosts n →\n HasUnacquaintedPair (StateAfter initial hosts n) →\n ∀ x y : Fin k,\n x ≠ y →\n ¬ (StateAfter initial hosts n).Adj x y →\n ¬ MeetAtParty (StateAfter initial hosts n) (hosts n) x y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0bfc1884-4de4-592b-bb3f-b71f32ae6f7b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a9605b038e505747e6a9d9d4f321add2e63e7155f0619696994270dd50a3bf4d", "task_path": "tasks/nmp3_0bfc1884-4de4-592b-bb3f-b71f32ae6f7b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0bfc1884-4de4-592b-bb3f-b71f32ae6f7b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0c18f8ec-69b0-59be-aebd-a8ca1a92c3f9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- \\frac{a^{2}+bc}{b^{2}+bc+c^{2}}+\\frac{b^{2}+ca}{c^{2}+ca+a^{2}}+\\frac{c^{2}+ab}{a^{2}+ab+b^{2}}\\ge 2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, `c`,\nthat a symmetric cyclic rational expression is at least `2`.\n\nThis file records the target as a proposition. No proof of the target is\nincluded.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b * c) / (b ^ 2 + b * c + c ^ 2) +\n (b ^ 2 + c * a) / (c ^ 2 + c * a + a ^ 2) +\n (c ^ 2 + a * b) / (a ^ 2 + a * b + b ^ 2)\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the cyclic sum on the\nleft-hand side is at least `2`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → 2 ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c18f8ec-69b0-59be-aebd-a8ca1a92c3f9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "890c7973723b9f4904c5f33f663486b014d28e689f16528d560631c5c3b7b704", "task_path": "tasks/nmp3_0c18f8ec-69b0-59be-aebd-a8ca1a92c3f9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c18f8ec-69b0-59be-aebd-a8ca1a92c3f9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0c19be24-dadc-594a-90ab-38bceab1b2fa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a+b+c=3abc$. Prove that \n-- \\[\n-- \\sqrt{a^{2}+1}+\\sqrt{b^{2}+1}+\\sqrt{c^{2}+1}\\le\n-- \\sqrt{a^{2}+b^{2}+c^{2}+4(ab+bc+ca)+3}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a three-variable inequality under a product-sum constraint\n\nThe source problem asks to prove that for all positive real numbers `a`, `b`, and\n`c` satisfying `a + b + c = 3abc`, the stated square-root inequality holds.\n-/\n\nnamespace Problem\n\n/--\nThe proposition stated by the problem.\n\nFor all positive real numbers `a`, `b`, and `c` satisfying\n`a + b + c = 3 * a * b * c`, one has\n`sqrt (a^2 + 1) + sqrt (b^2 + 1) + sqrt (c^2 + 1)` at most\n`sqrt (a^2 + b^2 + c^2 + 4 * (a*b + b*c + c*a) + 3)`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 3 * a * b * c →\n Real.sqrt (a ^ 2 + 1) + Real.sqrt (b ^ 2 + 1) + Real.sqrt (c ^ 2 + 1) ≤\n Real.sqrt (a ^ 2 + b ^ 2 + c ^ 2 + 4 * (a * b + b * c + c * a) + 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c19be24-dadc-594a-90ab-38bceab1b2fa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fec941119b7fb7159f29feabc4c0b36d195a0413ff18332d73b91e62c573fbf2", "task_path": "tasks/nmp3_0c19be24-dadc-594a-90ab-38bceab1b2fa", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c19be24-dadc-594a-90ab-38bceab1b2fa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0c369f5d-6d75-5f0a-8d46-1a2a88881ccd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be real numbers (not all zero). Prove that \n-- \\[\n-- \\frac{ab}{4a^{2}+b^{2}+4c^{2}}+\\frac{bc}{4b^{2}+c^{2}+4a^{2}}+\\frac{ca}{4c^{2}+a^{2}+4b^{2}}\\le\\frac13\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the stated real-variable inequality\n\nThe source problem asks to prove an inequality for all real triples\n`(a, b, c)` that are not all zero. There is no requested equality case or\nsolution set; the entire assertion is represented by `Problem.Target`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * b / (4 * a ^ 2 + b ^ 2 + 4 * c ^ 2) +\n b * c / (4 * b ^ 2 + c ^ 2 + 4 * a ^ 2) +\n c * a / (4 * c ^ 2 + a ^ 2 + 4 * b ^ 2)\n\n/-- The source assertion: for every real triple `(a, b, c)` which is not\nall zero, the cyclic sum is at most `1 / 3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, (a ≠ 0 ∨ b ≠ 0 ∨ c ≠ 0) → lhs a b c ≤ (1 : ℝ) / 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c369f5d-6d75-5f0a-8d46-1a2a88881ccd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "94f8c33a2fa7551401d624fd2a1dc54c8a690aff009724ca584a1e203df16766", "task_path": "tasks/nmp3_0c369f5d-6d75-5f0a-8d46-1a2a88881ccd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c369f5d-6d75-5f0a-8d46-1a2a88881ccd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0c4f037e-687d-5c56-a748-1e022f262b28", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Determine all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that for all real numbers $x$ and $y$,\n-- $$f\\bigl(xf(y)-f(x)\\bigr)=2f(x)+xy.$$\nimport Mathlib\n\n/-!\n# Formalization of the functional-equation classification problem\n\nThe problem asks for all functions `f : ℝ → ℝ` satisfying\n\n`f (x * f y - f x) = 2 * f x + x * y`\n\nfor every pair of real numbers `x` and `y`. The declarations below separate\nthe admissibility predicate from the predicate expressing correctness of a\ncomplete proposed answer. The concrete proposed-answer set is the singleton\ncontaining the function `x ↦ 1 - x`; no proof of the classification is supplied\nhere, since this file only formalizes the statement.\n-/\n\nnamespace Problem\n\n/-- Admissibility for the functional equation: `f` is a function from `ℝ` to\n`ℝ`, and the displayed identity holds for every pair of real numbers `x`, `y`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ (x y : ℝ), f (x * f y - f x) = 2 * f x + x * y\n\n/-- The pointwise specification of the proposed solution `x ↦ 1 - x`. -/\ndef CandidateSolution (f : ℝ → ℝ) : Prop :=\n ∀ (x : ℝ), f x = 1 - x\n\n/-- The proposed answer set for the classification: exactly the function\n`x ↦ 1 - x`. -/\ndef AnswerSet : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | CandidateSolution f}\n\n/-- A set of real functions is a complete answer exactly when it consists of\nall and only the admissible functions. Both directions of the classification\nare included in the iff. -/\ndef IsCompleteSolutionSet (S : Set (ℝ → ℝ)) : Prop :=\n ∀ (f : ℝ → ℝ), f ∈ S ↔ Admissible f\n\n/-- The complete-answer statement for the concrete proposed answer set: every\nreal function belongs to the proposed answer set exactly when it is admissible. -/\ndef Target : Prop :=\n ∀ (f : ℝ → ℝ), f ∈ AnswerSet ↔ Admissible f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c4f037e-687d-5c56-a748-1e022f262b28", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "225f5acbca4ac973b8466bec7c5447cd209c5421411d4c58711823596e0c8bf7", "task_path": "tasks/nmp3_0c4f037e-687d-5c56-a748-1e022f262b28", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c4f037e-687d-5c56-a748-1e022f262b28", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0c61ce20-6bc3-5888-bdde-bbd7bc59725c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- $$2\\sqrt{a^2+b^2+c^2}+\\sqrt{ab+bc+ca}\\ge\\sqrt{a^2+ab+b^2}+\\sqrt{b^2+bc+c^2}+\\sqrt{c^2+ca+a^2}.$$\nimport Mathlib\n\n/-!\nFormal statement of the target inequality.\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\n`2 * sqrt (a^2 + b^2 + c^2) + sqrt (a*b + b*c + c*a)`\nis at least\n`sqrt (a^2+ab+b^2) + sqrt (b^2+bc+c^2) + sqrt (c^2+ca+a^2)`.\n-/\n\nnamespace Problem\n\n/-- The assertion from the problem: for all positive real numbers `a`, `b`, `c`,\nthe stated square-root inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (2 : ℝ) * Real.sqrt (a ^ 2 + b ^ 2 + c ^ 2) +\n Real.sqrt (a * b + b * c + c * a) ≥\n Real.sqrt (a ^ 2 + a * b + b ^ 2) +\n Real.sqrt (b ^ 2 + b * c + c ^ 2) +\n Real.sqrt (c ^ 2 + c * a + a ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c61ce20-6bc3-5888-bdde-bbd7bc59725c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6fc2e1ae978998a22f40a5820b5f0d874cd01eef13ce3dc5b26938751de0fb89", "task_path": "tasks/nmp3_0c61ce20-6bc3-5888-bdde-bbd7bc59725c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c61ce20-6bc3-5888-bdde-bbd7bc59725c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0c64e68d-e821-55c4-a943-b867f1a8b38c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(0<\\lambda<1\\) be a real number and let \\(A\\) be a multiset of positive integers (multiplicity of an integer is allowed). For each \\(n\\in\\mathbb N\\) define \n-- \\[\n-- A_n=\\{a\\in A:\\;a\\le n\\},\n-- \\] \n-- counting each occurrence of an element. Assume that for every \\(n\\) the number of elements of \\(A_n\\) (counted with multiplicity) satisfies \n-- \\[\n-- |A_n|\\le n\\lambda .\n-- \\] \n-- Prove that there exist infinitely many \\(n\\in\\mathbb N\\) such that the sum of all elements of \\(A_n\\) (again counting multiplicities) obeys \n-- \\[\n-- \\sum_{a\\in A_n} a\\;\\le\\;\\frac{n(n+1)}2\\,\\lambda .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: prefix cardinality and prefix sums for multisets of positive integers\n\nThis file formalizes the statement of the problem. A multiset of positive\nintegers is represented by its multiplicity function `A : ℕ+ → ℕ`. For each\n`n`, `AUpTo A n` is the finite multiset of all occurrences of positive\nintegers at most `n`, with repetitions according to their multiplicities.\n-/\n\nnamespace Problem\n\n/-- The positive natural number associated with a natural number known to be at least one. -/\ndef natToPNat (a : ℕ) (ha : 1 ≤ a) : ℕ+ :=\n ⟨a, Nat.lt_of_lt_of_le Nat.zero_lt_one ha⟩\n\n/-- The multiset `A_n` of all occurrences of elements of `A` that are at most `n`.\n\nStarting from the natural integers `1, ..., n`, each integer `a` is repeated\n`A a` times. Thus the resulting multiset records multiplicities, and it is\nempty when `n = 0`. -/\ndef AUpTo (A : ℕ+ → ℕ) (n : ℕ) : Multiset ℕ :=\n (Finset.Icc 1 n).attach.val.bind fun a =>\n Multiset.replicate (A (natToPNat a.1 (Finset.mem_Icc.mp a.2).1)) a.1\n\n/-- The cardinality `|A_n|`, counting every occurrence separately. -/\ndef countUpTo (A : ℕ+ → ℕ) (n : ℕ) : ℕ :=\n (AUpTo A n).card\n\n/-- The sum of all elements of `A_n`, counting every occurrence separately. -/\ndef sumUpTo (A : ℕ+ → ℕ) (n : ℕ) : ℕ :=\n (AUpTo A n).sum\n\n/-- The assumed prefix cardinality condition: for every `n`,\n`|A_n| ≤ n * λ`. -/\ndef PrefixCardinalityBound (A : ℕ+ → ℕ) (lam : ℝ) : Prop :=\n ∀ n : ℕ, (countUpTo A n : ℝ) ≤ (n : ℝ) * lam\n\n/-- The asserted prefix sum inequality for a particular `n`. -/\ndef PrefixSumBound (A : ℕ+ → ℕ) (lam : ℝ) (n : ℕ) : Prop :=\n (sumUpTo A n : ℝ) ≤\n ((n : ℝ) * ((n : ℝ) + 1) / 2) * lam\n\n/-- There are infinitely many `n` at which the asserted prefix sum inequality holds. -/\ndef InfinitelyManyPrefixSumBounds (A : ℕ+ → ℕ) (lam : ℝ) : Prop :=\n {n : ℕ | PrefixSumBound A lam n}.Infinite\n\n/-- The complete proposition of the problem: for every real `0 < λ < 1` and every\nmultiset `A` of positive integers with `|A_n| ≤ n * λ` for all `n`, the prefix\nsum inequality `∑_{a ∈ A_n} a ≤ n(n+1)/2 * λ` holds for infinitely many `n`. -/\ndef Target : Prop :=\n ∀ (lam : ℝ) (A : ℕ+ → ℕ),\n 0 < lam →\n lam < 1 →\n PrefixCardinalityBound A lam →\n InfinitelyManyPrefixSumBounds A lam\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c64e68d-e821-55c4-a943-b867f1a8b38c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7567fd2d7426961e448c2b0a324daa095a1217fb1245d7165c54d4ba9d399d2d", "task_path": "tasks/nmp3_0c64e68d-e821-55c4-a943-b867f1a8b38c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c64e68d-e821-55c4-a943-b867f1a8b38c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0c77f44b-1330-59db-93bd-99071428f349", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $a,b,c$,\n-- \\[\n-- \\sqrt{\\frac{a}{8b+c}}+\\sqrt{\\frac{b}{8c+a}}+\\sqrt{\\frac{c}{8a+b}}\\ge 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-term square-root inequality\n\nThis file records the statement of the problem. The principal real square\nroot is Mathlib's `Real.sqrt`, and all divisions and inequalities below are\nin the real numbers.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`, the sum\n`sqrt (a / (8b + c)) + sqrt (b / (8c + a)) + sqrt (c / (8a + b))`\nis at least `1`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n 1 ≤ Real.sqrt (a / (8 * b + c)) +\n Real.sqrt (b / (8 * c + a)) +\n Real.sqrt (c / (8 * a + b))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c77f44b-1330-59db-93bd-99071428f349", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a2a4f0b67800fea42167c1124259659b58e50f1d0bc1d52646ed16a6e04f60f8", "task_path": "tasks/nmp3_0c77f44b-1330-59db-93bd-99071428f349", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c77f44b-1330-59db-93bd-99071428f349", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0c7bdcd9-913c-5572-b861-f1ad9996ab8f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ be real numbers such that \n-- \\[\n-- x^{2}+y^{2}+z^{2}=x^{2}y^{2}+y^{2}z^{2}+z^{2}x^{2}.\n-- \\] \n-- Prove that \n-- \\[\n-- \\bigl((x-y)(y-z)(z-x)\\bigr)^{2}\\le 2\\Bigl((x^{2}-y^{2})^{2}+(y^{2}-z^{2})^{2}+(z^{2}-x^{2})^{2}\\Bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe original problem asks to prove an inequality for three positive real numbers\nsubject to a symmetric quadratic constraint. This file records the statement only;\nit intentionally contains no proof of the assertion.\n-/\n\nnamespace Problem\n\n/-- The hypotheses of the problem: `x`, `y`, and `z` are positive real numbers\nsatisfying `x^2 + y^2 + z^2 = x^2 y^2 + y^2 z^2 + z^2 x^2`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧\n x ^ 2 + y ^ 2 + z ^ 2 =\n x ^ 2 * y ^ 2 + y ^ 2 * z ^ 2 + z ^ 2 * x ^ 2\n\n/-- The inequality asserted by the problem, for a fixed triple `(x, y, z)`. -/\ndef Inequality (x y z : ℝ) : Prop :=\n ((x - y) * (y - z) * (z - x)) ^ 2 ≤\n 2 * ((x ^ 2 - y ^ 2) ^ 2 +\n (y ^ 2 - z ^ 2) ^ 2 +\n (z ^ 2 - x ^ 2) ^ 2)\n\n/-- The complete statement to be proved: every positive real solution of the\ngiven constraint satisfies the asserted inequality. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c7bdcd9-913c-5572-b861-f1ad9996ab8f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d069109db413d50ec48c85f4aba033fc360453e1854577f4786f7351c82d77f2", "task_path": "tasks/nmp3_0c7bdcd9-913c-5572-b861-f1ad9996ab8f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c7bdcd9-913c-5572-b861-f1ad9996ab8f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0c859c60-4371-53e7-a455-86f6996a5642", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all non‑negative real numbers $a,b,c$, prove that \n-- \\[\n-- (ab+bc+ca)(a+b+c)(3a+4b+5c)\\ge (b+2c+6\\sqrt{ab+bc+ca})\\,(a+b)(b+c)(c+a)\\,. \n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Statement of the non-negative-real inequality\n\nThe original problem asks to prove a single inequality for all triples of\nnon-negative real numbers. We keep the ambient type as `ℝ` and state the\nnon-negativity assumptions explicitly, so that the square root is the usual\nreal square root `Real.sqrt` and no domain information is hidden in a subtype.\n-/\n\nnamespace Problem\n\n/-- The non-negativity hypotheses on the three real variables in the problem. -/\ndef NonnegativeTriple (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The left-hand side\n`(ab + bc + ca) * (a + b + c) * (3a + 4b + 5c)`. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a * b + b * c + c * a) * (a + b + c) * (3 * a + 4 * b + 5 * c)\n\n/-- The right-hand side\n`(b + 2c + 6 * sqrt(ab + bc + ca)) * (a + b) * (b + c) * (c + a)`. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (b + 2 * c + 6 * Real.sqrt (a * b + b * c + c * a)) *\n (a + b) * (b + c) * (c + a)\n\n/-- The asserted pointwise inequality for a fixed triple of real numbers. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete universally quantified assertion of the problem: for every\nthree non-negative real numbers `a`, `b`, and `c`, the displayed inequality\nholds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, NonnegativeTriple a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c859c60-4371-53e7-a455-86f6996a5642", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9b891d6ff5bb807a742e66b06f81c2991d2a65317b6dde35a081eae694cd6968", "task_path": "tasks/nmp3_0c859c60-4371-53e7-a455-86f6996a5642", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c859c60-4371-53e7-a455-86f6996a5642", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0c912790-b4cb-5b86-b8ee-14597cd3e357", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ satisfying \n-- \\[f(xy)+f(x+y)=f(x)f(y)+f(x)+f(y)\\qquad\\forall\\,x,y\\in\\mathbb{R}.\\]\nimport Mathlib.Basic.Real.Basic\nimport Mathlib.Data.Set.Basic\n\n/-!\n# Formal statement for: Find all functions satisfying a functional equation\n\nThe original problem asks for all functions `f : ℝ → ℝ` such that\n\n`f (x * y) + f (x + y) = f x * f y + f x + f y`\n\nfor every pair of real numbers `x` and `y`.\n\nThis file records the admissibility predicate, a candidate complete solution set,\nthe two-direction completeness criterion for an arbitrary candidate, and the\nclosed target proposition for the candidate discovered for this problem.\nNo proof of the target is supplied here: it is a proposition-valued declaration.\n-/\n\nnamespace Problem\n\n/-- The admissibility predicate for the functional equation in the problem. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x * y) + f (x + y) = f x * f y + f x + f y\n\n/-- The zero function on the real line. -/\ndef ZeroFunction : ℝ → ℝ :=\n fun _ : ℝ => 0\n\n/-- The identity function on the real line. -/\ndef IdentityFunction : ℝ → ℝ :=\n fun x : ℝ => x\n\n/-- The proposed complete answer set: the zero function and the identity function. -/\ndef ProposedSolutionSet : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | f = ZeroFunction ∨ f = IdentityFunction}\n\n/--\nA set `S` of real functions is a complete solution set when every member is\nadmissible and every admissible function belongs to it. Thus both directions\nof the classification are required, for every `f : ℝ → ℝ`.\n-/\ndef IsCompleteSolutionSet (S : Set (ℝ → ℝ)) : Prop :=\n (∀ f : ℝ → ℝ, f ∈ S → Admissible f) ∧\n (∀ f : ℝ → ℝ, Admissible f → f ∈ S)\n\n/--\nThe target assertion: `ProposedSolutionSet` is precisely the set of all\nadmissible functions. This is a proposition to be proved, not a proof of it.\n-/\ndef Target : Prop :=\n IsCompleteSolutionSet ProposedSolutionSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c912790-b4cb-5b86-b8ee-14597cd3e357", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "70f999dd5b4207285dfac61c07a9d961720bcf1d068f59a4b4951dd78ee47d70", "task_path": "tasks/nmp3_0c912790-b4cb-5b86-b8ee-14597cd3e357", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0c912790-b4cb-5b86-b8ee-14597cd3e357", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0ccd3d9c-09e9-5721-b251-162d5d4b92a1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$, $m$, and $k$ be positive integers satisfying $(n-1)n(n+1)=m^k$. Prove that $k=1$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility condition for the original problem: `n`, `m`, and `k`\nare natural numbers representing positive integers, and `(n - 1) * n * (n + 1)`\nequals `m ^ k`. Since `n` is assumed positive below, the natural-number\nsubtraction `n - 1` agrees with ordinary integer subtraction. -/\ndef Admissible (n m k : Nat) : Prop :=\n 0 < n ∧ 0 < m ∧ 0 < k ∧ (n - 1) * n * (n + 1) = m ^ k\n\n/-- The proposition asserted by the problem: for every three positive integers\n`n`, `m`, and `k` satisfying `(n - 1) * n * (n + 1) = m ^ k`, one has `k = 1`. -/\ndef Target : Prop :=\n ∀ (n m k : Nat), Admissible n m k → k = 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0ccd3d9c-09e9-5721-b251-162d5d4b92a1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8c5706b52d4c674b895368d19f3333477af00040584e54c1e50e19584aff3236", "task_path": "tasks/nmp3_0ccd3d9c-09e9-5721-b251-162d5d4b92a1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0ccd3d9c-09e9-5721-b251-162d5d4b92a1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0cd9bd8e-a3b2-5300-b9b1-25ef154768a8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- There are 100 girls and 100 colors. For each color there are exactly 100 balls, so there are 10 000 balls in total. Initially each girl possesses exactly 100 balls (the initial distribution may be arbitrary, subject only to the total of 100 balls per color). A move consists of two girls swapping one ball each (each gives one of her balls to the other). Prove that there exists a sequence of moves such that \n-- \n-- 1. each ball participates in at most one exchange, and \n-- 2. after all moves each girl has one ball of each of the 100 colors (i.e., her 100 balls are all of distinct colors).\nimport Mathlib\n\n/-!\n# Formalization of the 100 girls and 100 colors exchange problem\n\nThe problem concerns 100 labelled girls, 100 colours, and 100 labelled balls of\neach colour. There are thus 10,000 balls. A configuration is represented by\nan ownership function from balls to girls. A move is a chronological record of\ntwo distinct girls swapping one ball owned by each of them. A finite list of\nsuch moves is valid when each move is executable in the configuration obtained\nfrom the preceding moves. The final ownership is obtained by folding all the\nswaps over the initial ownership function.\n\nThe target asserts, for every initial ownership function in which every girl\nowns exactly 100 balls (the 100-balls-per-colour condition is built into the\ntype of balls and is also stated explicitly), the existence of a finite valid\nsequence of moves in which no ball occurs in more than one move and whose final\nownership gives every girl exactly one ball of every colour.\n-/\n\nnamespace Problem\n\n/-- The number of girls, colours, and balls of each colour. -/\nabbrev N : Nat := 100\n\n/-- The 100 girls. -/\nabbrev Girl : Type := Fin N\n\n/-- The 100 colours. -/\nabbrev Color : Type := Fin N\n\n/-- A ball is determined by its colour and by an index among the 100 balls of\nthat colour. -/\nabbrev Ball : Type := Color × Fin N\n\n/-- The colour of a ball. -/\ndef Ball.color (b : Ball) : Color := b.1\n\n/-- A move records two girls and the ball that each of them gives to the\nother. -/\nstructure Move where\n firstGirl : Girl\n secondGirl : Girl\n firstBall : Ball\n secondBall : Ball\n deriving Repr, DecidableEq\n\nnamespace Move\n\n/-- A move uses a ball if that ball is either one of the two exchanged balls. -/\ndef UsesBall (m : Move) (b : Ball) : Prop :=\n m.firstBall = b ∨ m.secondBall = b\n\n/-- Two moves use no ball in common. Used together with `List.Pairwise`, this\nexpresses that every ball participates in at most one exchange. -/\ndef DisjointFrom (m₁ m₂ : Move) : Prop :=\n m₁.firstBall ≠ m₂.firstBall ∧\n m₁.firstBall ≠ m₂.secondBall ∧\n m₁.secondBall ≠ m₂.firstBall ∧\n m₁.secondBall ≠ m₂.secondBall\n\nend Move\n\n/-- The ownership function obtained after performing one move. The two swapped\nballs change owners; every other ball keeps its owner. -/\ndef StateAfterMove (owner : Ball → Girl) (m : Move) : Ball → Girl :=\n fun b =>\n if b = m.firstBall then m.secondGirl\n else if b = m.secondBall then m.firstGirl\n else owner b\n\n/-- A move is executable in a configuration if it uses two distinct girls, two\ndistinct balls, and each girl owns the ball she gives. -/\ndef ValidMove (owner : Ball → Girl) (m : Move) : Prop :=\n m.firstGirl ≠ m.secondGirl ∧\n m.firstBall ≠ m.secondBall ∧\n owner m.firstBall = m.firstGirl ∧\n owner m.secondBall = m.secondGirl\n\n/-- Validity of a chronological list of moves: each move is executable in the\nconfiguration reached after all earlier moves. -/\ndef ValidMoveSequence (owner : Ball → Girl) : List Move → Prop\n | [] => True\n | m :: ms => ValidMove owner m ∧ ValidMoveSequence (StateAfterMove owner m) ms\n\n/-- The final ownership function after performing a finite list of moves. -/\ndef FinalOwner (owner : Ball → Girl) (moves : List Move) : Ball → Girl :=\n moves.foldl StateAfterMove owner\n\n/-- No ball occurs in two distinct moves of the sequence. Because the two\nballs within one move are required to be distinct by `ValidMove`, this is\nprecisely the statement that each ball participates in at most one exchange. -/\ndef BallsUsedAtMostOnce (moves : List Move) : Prop :=\n moves.Pairwise Move.DisjointFrom\n\n/-- Every girl owns exactly one ball of every colour after the sequence. -/\ndef FinalConfiguration (owner : Ball → Girl) (moves : List Move) : Prop :=\n ∀ (g : Girl) (c : Color),\n ∃! b : Ball, b.color = c ∧ FinalOwner owner moves b = g\n\n/-- The assumed initial condition: every girl owns exactly 100 balls, and every\ncolour is represented by exactly 100 balls. The latter condition is a\nconsequence of the definition of `Ball`, but is included explicitly to retain\nall the hypotheses stated in the problem. -/\ndef InitialConfiguration (owner : Ball → Girl) : Prop :=\n (∀ g : Girl, Fintype.card {b : Ball // owner b = g} = N) ∧\n (∀ c : Color, Fintype.card {b : Ball // b.color = c} = N)\n\n/-- Admissibility of a proposed finite sequence of moves for a given initial\nconfiguration: it is sequentially executable, each ball is exchanged at most\nonce, and the final configuration has exactly one ball of each colour for each\ngirl. -/\ndef GoodExchangeSequence (owner : Ball → Girl) (moves : List Move) : Prop :=\n ValidMoveSequence owner moves ∧\n BallsUsedAtMostOnce moves ∧\n FinalConfiguration owner moves\n\n/-- The statement to be proved: for every initial distribution satisfying the\nstated ball-count conditions, there exists a finite sequence of swaps that is\nvalid, exchanges each ball at most once, and reaches a configuration in which\nevery girl has one ball of every colour. -/\ndef Target : Prop :=\n ∀ owner : Ball → Girl,\n InitialConfiguration owner →\n ∃ moves : List Move, GoodExchangeSequence owner moves\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0cd9bd8e-a3b2-5300-b9b1-25ef154768a8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b6d3ba07c81282bfe49d0880e42a56e9315a020ab2e03d353038f5752aa66bd8", "task_path": "tasks/nmp3_0cd9bd8e-a3b2-5300-b9b1-25ef154768a8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0cd9bd8e-a3b2-5300-b9b1-25ef154768a8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0cdf5275-06d5-5401-865d-870b57983a09", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ satisfy $ab+bc+ca=1$. Let $m,n$ be positive integers with $m>n$. Prove that \n-- \\[\n-- \\frac{a}{(m^{2}-n^{2})\\sqrt{a^{2}+1}}+\\frac{b}{2mn\\sqrt{b^{2}+1}}+\\frac{c}{(m^{2}+n^{2})\\sqrt{c^{2}+1}}\\le \\frac{m^{2}+n^{2}}{2mn\\,(m^{2}-n^{2})}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissibility conditions from the problem: `a`, `b`, and `c` are\nnonnegative reals satisfying `ab + bc + ca = 1`, while `m` and `n` are\npositive natural numbers with `m > n`. -/\ndef IsAdmissible (a b c : ℝ) (m n : ℕ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧\n a * b + b * c + c * a = 1 ∧\n 0 < m ∧ 0 < n ∧ n < m\n\n/-- The left-hand side of the inequality in the problem, with all integer\ncoefficients regarded as real numbers. -/\ndef lhs (a b c : ℝ) (m n : ℕ) : ℝ :=\n a / (((m : ℝ) ^ 2 - (n : ℝ) ^ 2) * Real.sqrt (a ^ 2 + 1)) +\n b / (((2 : ℝ) * (m : ℝ) * (n : ℝ)) * Real.sqrt (b ^ 2 + 1)) +\n c / (((m : ℝ) ^ 2 + (n : ℝ) ^ 2) * Real.sqrt (c ^ 2 + 1))\n\n/-- The right-hand side of the inequality in the problem, with all integer\ncoefficients regarded as real numbers. -/\ndef rhs (m n : ℕ) : ℝ :=\n ((m : ℝ) ^ 2 + (n : ℝ) ^ 2) /\n (((2 : ℝ) * (m : ℝ) * (n : ℝ)) *\n ((m : ℝ) ^ 2 - (n : ℝ) ^ 2))\n\n/-- The assertion stated in the problem: for all admissible nonnegative real\n`a`, `b`, `c` and all positive natural numbers `m > n`, the stated inequality\nholds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ) (m n : ℕ),\n IsAdmissible a b c m n → lhs a b c m n ≤ rhs m n\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0cdf5275-06d5-5401-865d-870b57983a09", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d87579bd9ee976ab8bad17c193f39aca3b8e27dd795a85c31ececf172ce94dae", "task_path": "tasks/nmp3_0cdf5275-06d5-5401-865d-870b57983a09", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0cdf5275-06d5-5401-865d-870b57983a09", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0ce1237c-6734-5a82-a7e6-4a313eb8a4f8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any positive real numbers $x,\\;y,\\;z$ satisfying \n-- \\[\n-- xyz+xy+yz+zx=4,\n-- \\] \n-- prove that \n-- \\[\n-- \\sqrt{\\frac{xy+x+y}{z}}+\\sqrt{\\frac{yz+y+z}{x}}+\\sqrt{\\frac{zx+z+x}{y}}\n-- \\;\\ge\\;\n-- 3\\sqrt{\\frac{3(x+2)(y+2)(z+2)}{(2x+1)(2y+1)(2z+1)}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe source problem asks one to prove, for all positive real numbers `x`, `y`, `z`\nsatisfying `x*y*z + x*y + y*z + z*x = 4`, the stated square-root inequality.\nThis file records that proposition as a `Prop`-valued definition. It does not\nprovide a proof.\n-/\n\nnamespace Problem\n\n/-- The positivity hypothesis on the three variables. -/\ndef PositiveTriple (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The constraint `xyz + xy + yz + zx = 4`. -/\ndef Constraint (x y z : ℝ) : Prop :=\n x * y * z + x * y + y * z + z * x = 4\n\n/-- The left-hand side of the required inequality. -/\nnoncomputable def LHS (x y z : ℝ) : ℝ :=\n Real.sqrt ((x * y + x + y) / z) +\n Real.sqrt ((y * z + y + z) / x) +\n Real.sqrt ((z * x + z + x) / y)\n\n/-- The right-hand side of the required inequality. -/\nnoncomputable def RHS (x y z : ℝ) : ℝ :=\n 3 * Real.sqrt\n (3 * (x + 2) * (y + 2) * (z + 2) /\n ((2 * x + 1) * (2 * y + 1) * (2 * z + 1)))\n\n/-- The complete assertion to be proved: for every positive real triple satisfying\n`xyz + xy + yz + zx = 4`, the left-hand side is at least the right-hand side. -/\nnoncomputable def Target : Prop :=\n ∀ x y z : ℝ,\n PositiveTriple x y z → Constraint x y z → LHS x y z ≥ RHS x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0ce1237c-6734-5a82-a7e6-4a313eb8a4f8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3056cb9b29f79302bfbedfd96ebafa1f5d53248d95ef7fca74e9adc24d205a65", "task_path": "tasks/nmp3_0ce1237c-6734-5a82-a7e6-4a313eb8a4f8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0ce1237c-6734-5a82-a7e6-4a313eb8a4f8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0d198e27-3976-558f-985f-a2afe03f1538", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer and let $x_1,x_2,\\dots,x_n$ be positive real numbers satisfying $x_1x_2\\cdots x_n=1$. Prove that\n-- \\[\n-- \\sum_{i=1}^{n} x_i\\sqrt{x_1^2+x_2^2+\\cdots+x_i^2}\\ge\\frac{n+1}{2}\\sqrt{n}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThis file states (without proof) the inequality from the problem:\n\nFor every positive integer `n` and positive real numbers `x₁, ..., xₙ` whose\nproduct is `1`,\n\n`∑ i = 1..n x_i * sqrt(x_1^2 + ... + x_i^2) ≥ (n+1)/2 * sqrt(n)`.\n\nThe list is represented by a function `x : Fin n → ℝ`, indexed by the\nzero-based type `Fin n`. The prefix `x_1, ..., x_i` is represented by the\nfinite set of indices `j` with `j.val ≤ i.val`.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The prefix square sum `x_1^2 + ... + x_i^2`, using zero-based `Fin n`\nindices; index `i : Fin n` corresponds to the original index `i + 1`. -/\nnoncomputable def prefixSquares (n : ℕ) (x : Fin n → ℝ) (i : Fin n) : ℝ :=\n ∑ j ∈ Finset.univ.filter (fun j : Fin n => j.val ≤ i.val), x j ^ 2\n\n/-- The left-hand side\n`∑_{i=1}^{n} x_i * sqrt(x_1^2 + ... + x_i^2)`. -/\nnoncomputable def lhs (n : ℕ) (x : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, x i * Real.sqrt (prefixSquares n x i)\n\n/-- The right-hand side `(n+1)/2 * sqrt(n)`. -/\nnoncomputable def rhs (n : ℕ) : ℝ :=\n ((n : ℝ) + 1) / 2 * Real.sqrt (n : ℝ)\n\n/-- The assertion to be proved: for every positive integer `n` and every\npositive real `n`-tuple with product `1`, the required inequality holds. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (x : Fin n → ℝ),\n 0 < n →\n (∀ i : Fin n, 0 < x i) →\n (∏ i : Fin n, x i = 1) →\n lhs n x ≥ rhs n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d198e27-3976-558f-985f-a2afe03f1538", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b07baa69daa2f21e254d2d02834f0165885efc570d83666ee1454121c336bab3", "task_path": "tasks/nmp3_0d198e27-3976-558f-985f-a2afe03f1538", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d198e27-3976-558f-985f-a2afe03f1538", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0d232135-581b-5a85-8a0c-49768a53f0b7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>1$ be an integer. Define a sequence of binary strings of length $n$, $s(1),s(2),\\dots$, as follows:\n-- \n-- - $s(1)=0^{\\,n-1}1$ (i.e. $n-1$ zeros followed by a $1$).\n-- - Given $s(k)$, delete its leftmost digit to obtain a $(n-1)$‑bit string $t$. If the $n$‑bit string $t1$ (the string $t$ with a $1$ appended) has not appeared among $s(1),\\dots,s(k)$, set $s(k+1)=t1$; otherwise set $s(k+1)=t0$.\n-- \n-- Let $N=2^{n}$. Prove that the strings $s(1),s(2),\\dots,s(N)$ are pairwise distinct (i.e. no repetition occurs before the $N$‑th term).\nimport Mathlib\n\nset_option autoImplicit false\n\nnamespace Problem\n\n/-- A binary string of length `n`, represented as a function from `Fin n` to bits.\nThe Boolean value `false` denotes the digit `0`, and `true` denotes the digit `1`. -/\nabbrev BinaryString (n : ℕ) : Type := Fin n → Bool\n\n/-- Delete the leftmost digit of a binary string of length `n + 1`. -/\ndef dropLeft {n : ℕ} (x : BinaryString (n + 1)) : BinaryString n :=\n fun i : Fin n => x i.succ\n\n/-- Append one bit to the right of a binary string. -/\ndef appendBit {n : ℕ} (x : BinaryString n) (b : Bool) : BinaryString (n + 1) :=\n Fin.lastCases b x\n\n/-- Perform the combined operation in the recurrence: delete the leftmost digit\nand append `b` on the right. -/\ndef appendAfterDrop {n : ℕ} (x : BinaryString n) (b : Bool) : BinaryString n :=\n match n with\n | 0 => fun i : Fin 0 => nomatch i\n | _ + 1 => appendBit (dropLeft x) b\n\n/-- The initial word `0^(n-1)1`: all entries are `false` except the last,\nwhich is `true`. -/\ndef initialString : (n : ℕ) → BinaryString n\n | 0 => fun i : Fin 0 => nomatch i\n | n + 1 => Fin.lastCases true (fun _ : Fin n => false)\n\n/-- The candidate word obtained by deleting the leftmost digit of `x` and\nappending the bit `1`. -/\ndef candidateOne {n : ℕ} (x : BinaryString n) : BinaryString n :=\n appendAfterDrop x true\n\n/-- The candidate word obtained by deleting the leftmost digit of `x` and\nappending the bit `0`. -/\ndef candidateZero {n : ℕ} (x : BinaryString n) : BinaryString n :=\n appendAfterDrop x false\n\n/-- The next term prescribed by the rule. The `history` argument is the list\n`s(1), ..., s(k)`, and it includes the current term `s(k)`. -/\ndef nextTerm {n : ℕ} (x : BinaryString n) (history : List (BinaryString n)) :\n BinaryString n :=\n if candidateOne x ∈ history then candidateZero x else candidateOne x\n\n/-- The state after `k` internal steps: the current zero-based term (which is\nthe original term `s(k+1)`) and the list of all terms seen through that point.\nThus the second component at stage `k` is `s(1), ..., s(k+1)`. -/\ndef sequenceState (n : ℕ) :\n ℕ → BinaryString n × List (BinaryString n)\n | 0 =>\n let first := initialString n\n (first, [first])\n | k + 1 =>\n let previous := sequenceState n k\n let next := nextTerm previous.1 previous.2\n (next, previous.2 ++ [next])\n\n/-- The original one-indexed sequence `s(1), s(2), ...`; the index `k` is a\npositive natural number. -/\ndef s (n : ℕ) (k : PNat) : BinaryString n :=\n (sequenceState n (k.val - 1)).1\n\n/-- The quantity `N = 2^n`. -/\ndef N (n : ℕ) : ℕ :=\n 2 ^ n\n\n/-- The list `s(1), ..., s(N)` of the first `N = 2^n` terms. -/\ndef firstNTerms (n : ℕ) : List (BinaryString n) :=\n (List.range (N n)).map\n (fun k : ℕ => s n ⟨k + 1, Nat.succ_pos k⟩)\n\n/-- The assertion that the first `N = 2^n` terms are pairwise distinct. -/\ndef PairwiseDistinctFirstN (n : ℕ) : Prop :=\n (firstNTerms n).Nodup\n\n/-- The full statement of the problem: for every integer `n > 1`, the binary\nstrings `s(1), s(2), ..., s(N)` are pairwise distinct, where `N = 2^n`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 1 < n → PairwiseDistinctFirstN n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d232135-581b-5a85-8a0c-49768a53f0b7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4de631803d781877a759354affe051cd2e333ed1bafb56f842b6c844362e85fa", "task_path": "tasks/nmp3_0d232135-581b-5a85-8a0c-49768a53f0b7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d232135-581b-5a85-8a0c-49768a53f0b7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0d45b833-cbbe-5261-9e77-e02e215d5401", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $\\displaystyle\\frac{1}{a^{5}}+\\frac{1}{b^{5}}+\\frac{1}{c^{5}}=3$. Prove that \n-- \\[\n-- \\sqrt[5]{a^{5}+5}+\\sqrt[5]{b^{5}+5}+\\sqrt[5]{c^{5}+5}\\le \n-- \\sqrt[5]{5a^{5}+1}+\\sqrt[5]{5b^{5}+1}+\\sqrt[5]{5c^{5}+1}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the fifth-root inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c` satisfying\n`1 / a ^ 5 + 1 / b ^ 5 + 1 / c ^ 5 = 3`, to prove a sum inequality involving\nprincipal real fifth roots. The fifth root is represented by the real power\n`x ^ (1 / 5 : ℝ)`, which is the standard principal nonnegative real fifth root\nfor nonnegative `x`. In the target all radicands are positive.\n-/\n\nnamespace Problem\n\n/-- Real exponentiation by `1 / 5`. On nonnegative `x`, this is the principal\nnonnegative real fifth root. -/\nnoncomputable def fifthRoot (x : ℝ) : ℝ :=\n Real.rpow x ((1 : ℝ) / 5)\n\n/--\nFor all positive real `a`, `b`, and `c` satisfying\n`1 / a ^ 5 + 1 / b ^ 5 + 1 / c ^ 5 = 3`, the sum of the fifth roots of\n`a ^ 5 + 5`, `b ^ 5 + 5`, and `c ^ 5 + 5` is at most the sum of the fifth\nroots of `5 * a ^ 5 + 1`, `5 * b ^ 5 + 1`, and `5 * c ^ 5 + 1`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n ((1 : ℝ) / (a ^ (5 : ℕ)) + (1 : ℝ) / (b ^ (5 : ℕ)) +\n (1 : ℝ) / (c ^ (5 : ℕ)) = (3 : ℝ)) →\n fifthRoot ((a ^ (5 : ℕ)) + (5 : ℝ)) +\n fifthRoot ((b ^ (5 : ℕ)) + (5 : ℝ)) +\n fifthRoot ((c ^ (5 : ℕ)) + (5 : ℝ)) ≤\n fifthRoot ((5 : ℝ) * (a ^ (5 : ℕ)) + (1 : ℝ)) +\n fifthRoot ((5 : ℝ) * (b ^ (5 : ℕ)) + (1 : ℝ)) +\n fifthRoot ((5 : ℝ) * (c ^ (5 : ℕ)) + (1 : ℝ))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d45b833-cbbe-5261-9e77-e02e215d5401", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3289dfdab4aa57875473255fb166ae1327ffd8470ba5b753d1e6bae85a7be66b", "task_path": "tasks/nmp3_0d45b833-cbbe-5261-9e77-e02e215d5401", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d45b833-cbbe-5261-9e77-e02e215d5401", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0d50bab5-6abe-5fb8-b35e-c96c0b6dc1c3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, $c$ be non‑negative real numbers such that $a^2+3b^2+7c^2=11$. Prove that \n-- \\[\n-- 2b+6c+abc\\le 9.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks to prove a universal inequality for three nonnegative\nreal variables satisfying a quadratic normalization condition.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved: for all real numbers `a`, `b`, and `c`, if each\nis nonnegative and `a^2 + 3*b^2 + 7*c^2 = 11`, then\n`2*b + 6*c + a*b*c ≤ 9`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a ^ 2 + 3 * b ^ 2 + 7 * c ^ 2 = 11 →\n 2 * b + 6 * c + a * b * c ≤ 9\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d50bab5-6abe-5fb8-b35e-c96c0b6dc1c3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6c03a0b4c1cba1c511f90a7568bdee7b272f86b86b22cea1a5539156312049f9", "task_path": "tasks/nmp3_0d50bab5-6abe-5fb8-b35e-c96c0b6dc1c3", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d50bab5-6abe-5fb8-b35e-c96c0b6dc1c3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0d6206dc-e3d3-55d9-9d95-faaa5e9dafa3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given non‑negative real numbers $a,b,c$ such that $a+b+c=3$, prove that \n-- \\[\n-- \\sqrt{a+bc}+\\sqrt{b+ca}+\\sqrt{c+ab}\\;\\ge\\;\\sqrt2\\,(ab+bc+ca)\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nProblem: for nonnegative real numbers `a`, `b`, `c` with `a + b + c = 3`,\nprove\n`sqrt (a + b*c) + sqrt (b + c*a) + sqrt (c + a*b) ≥ sqrt 2 * (a*b + b*c + c*a)`.\n-/\n\nnamespace Problem\n\n/-- The target inequality for all nonnegative real `a`, `b`, `c` whose sum is `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n a + b + c = (3 : ℝ) →\n Real.sqrt (a + b * c) + Real.sqrt (b + c * a) + Real.sqrt (c + a * b) ≥\n Real.sqrt (2 : ℝ) * (a * b + b * c + c * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d6206dc-e3d3-55d9-9d95-faaa5e9dafa3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c40c5407b8d0edc0b55484750694846ae43e7203a3b36e30ee515990ce44fe98", "task_path": "tasks/nmp3_0d6206dc-e3d3-55d9-9d95-faaa5e9dafa3", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d6206dc-e3d3-55d9-9d95-faaa5e9dafa3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0d8a4380-4251-530d-8d25-f074849c026f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ and $k$ be positive integers and let \n-- \\[\n-- T=\\{(x,y,z)\\in\\mathbb N^3\\mid 1\\le x,y,z\\le n\\}\n-- \\]\n-- be the set of lattice points in the $n\\times n\\times n$ cube. Suppose exactly $3n^2-3n+1+k$ points of $T$ are colored red and the coloring satisfies the following property: if $P$ and $Q$ are red points and the line segment $PQ$ is parallel to one of the coordinate axes, then every lattice point on $PQ$ is also red. Prove that there exist at least $k$ axis‑parallel unit cubes (side length $1$) whose eight vertices are all red.\nimport Mathlib\n\n/-!\n# Formalization of the lattice-cube red-point problem\n\nThe points of the `n × n × n` cubic lattice are represented by triples of\n`Fin n`. A `Fin n` index `i` denotes the integral coordinate `i.val + 1`,\nso the represented coordinates range over `1, ..., n` exactly as in the\nstatement of the problem.\n-/\n\nnamespace Problem\n\n/-- The lattice cube `T`: indices `0, ..., n - 1` represent the coordinates\n`1, ..., n` of a point. -/\nabbrev Point (n : ℕ) : Type := Fin n × Fin n × Fin n\n\n/-- The first (zero-based) lattice coordinate of a point. -/\ndef xCoord {n : ℕ} (p : Point n) : Fin n := p.1\n\n/-- The second (zero-based) lattice coordinate of a point. -/\ndef yCoord {n : ℕ} (p : Point n) : Fin n := p.2.1\n\n/-- The third (zero-based) lattice coordinate of a point. -/\ndef zCoord {n : ℕ} (p : Point n) : Fin n := p.2.2\n\n/-- The value of the third coordinate lies between the corresponding values\nof the first two coordinates, in either order. -/\ndef CoordBetween {n : ℕ} (a b t : Fin n) : Prop :=\n (a.val ≤ t.val ∧ t.val ≤ b.val) ∨ (b.val ≤ t.val ∧ t.val ≤ a.val)\n\n/-- The segment with endpoints `p` and `q` is parallel to one of the three\ncoordinate axes. This also admits the degenerate case `p = q`. -/\ndef AxisAlignedSegment {n : ℕ} (p q : Point n) : Prop :=\n (yCoord p = yCoord q ∧ zCoord p = zCoord q) ∨\n (xCoord p = xCoord q ∧ zCoord p = zCoord q) ∨\n (xCoord p = xCoord q ∧ yCoord p = yCoord q)\n\n/-- A lattice point `r` lies on the axis-parallel segment joining `p` and `q`.\nThe relevant coordinates of the endpoints are compared inclusively, and both\nendpoint orders are allowed. -/\ndef OnAxisSegment {n : ℕ} (p q r : Point n) : Prop :=\n (yCoord p = yCoord q ∧ zCoord p = zCoord q ∧\n yCoord r = yCoord p ∧ zCoord r = zCoord p ∧\n CoordBetween (xCoord p) (xCoord q) (xCoord r)) ∨\n (xCoord p = xCoord q ∧ zCoord p = zCoord q ∧\n xCoord r = xCoord p ∧ zCoord r = zCoord p ∧\n CoordBetween (yCoord p) (yCoord q) (yCoord r)) ∨\n (xCoord p = xCoord q ∧ yCoord p = yCoord q ∧\n xCoord r = xCoord p ∧ yCoord r = yCoord p ∧\n CoordBetween (zCoord p) (zCoord q) (zCoord r))\n\n/-- If two red points determine an axis-parallel segment, then every lattice\npoint on that segment is red. -/\ndef AxisSegmentClosure {n : ℕ} (R : Set (Point n)) : Prop :=\n ∀ p q : Point n,\n R p → R q → AxisAlignedSegment p q →\n ∀ r : Point n, OnAxisSegment p q r → R r\n\n/-- Select the lower or upper coordinate of a unit-cube edge. The proof `h`\nis exactly the condition that the upper coordinate still lies in `T`. -/\ndef stepCoord {n : ℕ} (i : Fin n) (up : Bool) (h : i.val + 1 < n) : Fin n :=\n if up then ⟨i.val + 1, h⟩ else i\n\n/-- A point is the lower corner of an axis-parallel unit cube contained in\n`T`, with `Fin` indices viewed as `0, ..., n - 1`. -/\ndef IsUnitCubeLowerCorner {n : ℕ} (c : Point n) : Prop :=\n c.1.val + 1 < n ∧ c.2.1.val + 1 < n ∧ c.2.2.val + 1 < n\n\n/-- The axis-parallel unit cube with lower corner `c` has all eight of its\nvertices red. The three `Bool` quantifiers select the two possible values\nfor each of the three coordinates. -/\ndef AllRedUnitCube {n : ℕ} (R : Set (Point n)) (c : Point n) : Prop :=\n ∃ h : IsUnitCubeLowerCorner c,\n ∀ b₀ b₁ b₂ : Bool,\n R (stepCoord c.1 b₀ h.1,\n stepCoord c.2.1 b₁ h.2.1,\n stepCoord c.2.2 b₂ h.2.2)\n\n/-- The set of lower corners of axis-parallel unit cubes whose eight vertices\nare all red. -/\ndef AllRedUnitCubes {n : ℕ} (R : Set (Point n)) : Set (Point n) :=\n {c | AllRedUnitCube R c}\n\n/-- The number of axis-parallel unit cubes whose eight vertices are all red. -/\nnoncomputable def RedUnitCubeCount {n : ℕ} (R : Set (Point n)) : ℕ :=\n (AllRedUnitCubes R).ncard\n\n/-- The red points are exactly `3 n^2 - 3 n + 1 + k` in number. -/\ndef HasRedPointCount {n : ℕ} (R : Set (Point n)) (k : ℕ) : Prop :=\n R.ncard = 3 * n ^ 2 - 3 * n + 1 + k\n\n/-- There are at least `k` axis-parallel unit cubes all of whose vertices are\nred. -/\ndef HasAtLeastRedUnitCubes {n : ℕ} (R : Set (Point n)) (k : ℕ) : Prop :=\n k ≤ RedUnitCubeCount R\n\n/-- The assertion to be proved: for all positive integers `n` and `k`, every\nred subset of the `n × n × n` lattice that has exactly\n`3 n^2 - 3 n + 1 + k` points and is closed under lattice points on\naxis-parallel segments contains at least `k` unit cubes whose eight vertices\nare all red. -/\ndef Target : Prop :=\n ∀ (n k : ℕ), 0 < n → 0 < k →\n ∀ R : Set (Point n),\n HasRedPointCount R k →\n AxisSegmentClosure R →\n HasAtLeastRedUnitCubes R k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d8a4380-4251-530d-8d25-f074849c026f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "87b297117376e6ccf6079eabad4ffd892a0ed5913298b3d8348b50bf0ba699d2", "task_path": "tasks/nmp3_0d8a4380-4251-530d-8d25-f074849c026f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d8a4380-4251-530d-8d25-f074849c026f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0d94c7eb-76b4-5cc5-88a9-bd7150b46ef3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{ab-bc+ca}{b^{2}+c^{2}}+\\frac{bc-ca+ab}{c^{2}+a^{2}}+\\frac{ca-ab+bc}{a^{2}+b^{2}}\\ge\\frac32\\,.\n-- \\] \n-- (The sum is taken cyclically over $a,b,c$.)\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The first cyclic term\n`(a*b - b*c + c*a) / (b^2 + c^2)` of the displayed sum. -/\ndef cyclicTerm (a b c : ℝ) : ℝ :=\n (a * b - b * c + c * a) / (b ^ 2 + c ^ 2)\n\n/-- The full cyclic sum displayed in the problem. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The assertion stated in the problem: for all positive real `a`, `b`, and `c`,\nthe displayed cyclic sum is at least `3/2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n cyclicSum a b c ≥ (3 : ℝ) / 2\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d94c7eb-76b4-5cc5-88a9-bd7150b46ef3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "066590990692c1b39b389727813992095f0acb76c8bc9acf95a6f5ac018ddc4d", "task_path": "tasks/nmp3_0d94c7eb-76b4-5cc5-88a9-bd7150b46ef3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0d94c7eb-76b4-5cc5-88a9-bd7150b46ef3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0da47794-32c4-5c4b-a14e-aa7fc98e6371", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $S$ be a finite set and let $\\mathcal{A}$ be the set of all functions $S\\to S$. Let $f\\in\\mathcal{A}$ and denote $T=f(S)$, the image of $S$ under $f$. Suppose that for every $g\\in\\mathcal{A}$ with $g\\neq f$ we have \n-- $$f\\circ g\\circ f\\neq g\\circ f\\circ g.$$\n-- Prove that $f(T)=T$.\nimport Mathlib.Data.Set.Basic\nimport Mathlib.Data.Fintype.Basic\n\nuniverse u\n\nnamespace Problem\n\n/-- The set `A` of all functions from `S` to `S`. -/\ndef Functions (S : Type u) : Set (S → S) :=\n Set.univ\n\n/-- The image `T = f(S)` of the whole finite set `S` under `f`. -/\ndef TImage (S : Type u) (f : S → S) : Set S :=\n Set.range f\n\n/-- The hypothesis that no function `g ≠ f` gives the same value under the two\ncomposite expressions `f ∘ g ∘ f` and `g ∘ f ∘ g`. -/\ndef Hypothesis (S : Type u) (f : S → S) : Prop :=\n ∀ (g : S → S), g ∈ Functions S → g ≠ f →\n (f ∘ g ∘ f) ≠ (g ∘ f ∘ g)\n\n/-- The asserted conclusion `f(T) = T`, where `T = f(S)`. -/\ndef Conclusion (S : Type u) (f : S → S) : Prop :=\n Set.image f (TImage S f) = TImage S f\n\n/-- The complete statement: for every finite set `S`, every function `f : S → S`\nsatisfying the stated uniqueness-like hypothesis must satisfy `f(T) = T`, where\n`T` is the image of `S` under `f`. -/\ndef Target : Prop :=\n ∀ (S : Type u), ∀ [Fintype S], ∀ (f : S → S),\n f ∈ Functions S → Hypothesis S f → Conclusion S f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0da47794-32c4-5c4b-a14e-aa7fc98e6371", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fac199f1b114f010b38cef97788ab524a0227d98c090854a890953b28d415673", "task_path": "tasks/nmp3_0da47794-32c4-5c4b-a14e-aa7fc98e6371", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0da47794-32c4-5c4b-a14e-aa7fc98e6371", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0dd0148c-6449-5031-b3b6-814ca7b15d8b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be positive real numbers such that $a+b+c+d=4$. Prove that \n-- \\[\n-- \\frac{a^{2}}{b+c+d}+\\frac{b^{2}}{a+c+d}+\\frac{c^{2}}{a+b+d}+\\frac{d^{2}}{a+b+c}+\\frac{2}{3}\\ge\\frac12\\,(a^{2}+b^{2}+c^{2}+d^{2}) .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility condition on the four real parameters: all are strictly\npositive and their sum is four. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n (0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d) ∧ a + b + c + d = (4 : ℝ)\n\n/-- The asserted inequality, as a proposition about four real parameters. -/\ndef Inequality (a b c d : ℝ) : Prop :=\n a ^ 2 / (b + c + d) +\n b ^ 2 / (a + c + d) +\n c ^ 2 / (a + b + d) +\n d ^ 2 / (a + b + c) +\n (2 / 3 : ℝ) ≥\n (1 / 2 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2)\n\n/-- The complete statement to be proved. -/\ndef Target : Prop :=\n ∀ (a b c d : ℝ), Admissible a b c d → Inequality a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0dd0148c-6449-5031-b3b6-814ca7b15d8b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "82df9c88ebe139cef68464280e1c8baf9312db1b19e37d28bfae3992c856588d", "task_path": "tasks/nmp3_0dd0148c-6449-5031-b3b6-814ca7b15d8b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0dd0148c-6449-5031-b3b6-814ca7b15d8b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0dd0ae80-ffe1-5469-91f1-9548e08ff358", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x$ be a real number. Suppose that $n^x$ is an integer for every positive integer $n$ (i.e., the numbers $1^x,2^x,3^x,\\dots$ are all integers). Prove that $x$ is a non‑negative integer (hence a positive integer unless $x=0$).\nimport Mathlib\n\n/-!\n# Formal statement\n\nThis file formalizes the assertion of `problem.md`: if a real number `x` has the\nproperty that `n ^ x` is an integer for every positive integer `n`, then `x` is a\nnon-negative integer (and hence a positive integer when `x ≠ 0`).\n\nThe declarations below only state the mathematical proposition. They do not\ncontain a proof.\n-/\n\nnamespace Problem\n\n/-- A real number is an integer if it is the image of an integer under the\ncanonical embedding `ℤ → ℝ`. -/\ndef IsIntegerReal (y : ℝ) : Prop :=\n ∃ k : ℤ, y = (k : ℝ)\n\n/-- The hypothesis from the problem: for every positive integer `n`, the real\nnumber `n ^ x` is an integer. -/\ndef IntegerPowerHypothesis (x : ℝ) : Prop :=\n ∀ n : ℕ, 0 < n → IsIntegerReal (Real.rpow (n : ℝ) x)\n\n/-- A real number is a non-negative integer, represented as the image of a\nnatural number under the canonical embedding `ℕ → ℝ`. -/\ndef NonnegativeInteger (x : ℝ) : Prop :=\n ∃ m : ℕ, x = (m : ℝ)\n\n/-- A real number is a positive integer, represented as the image of a positive\nnatural number under the canonical embedding `ℕ → ℝ`. -/\ndef PositiveInteger (x : ℝ) : Prop :=\n ∃ m : ℕ, 0 < m ∧ x = (m : ℝ)\n\n/-- The complete conclusion stated in the problem. The first conjunct is the\nrequested non-negativity and integrality of `x`; the second is the parenthetical\nconsequence that `x` is positive whenever it is nonzero. -/\ndef StatedConclusion (x : ℝ) : Prop :=\n NonnegativeInteger x ∧ (x ≠ 0 → PositiveInteger x)\n\n/-- For a fixed real number `x`, the implication asserted by the problem. -/\ndef Claim (x : ℝ) : Prop :=\n IntegerPowerHypothesis x → StatedConclusion x\n\n/-- The complete target proposition: for every real number `x`, if every\npositive integral power `n ^ x` is an integer, then `x` is a non-negative integer\n(and is a positive integer when `x ≠ 0`). -/\ndef Target : Prop :=\n ∀ x : ℝ, Claim x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0dd0ae80-ffe1-5469-91f1-9548e08ff358", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0b9693e9884563f5c36f305f60fe3622e8767ca05799a75d0caffa3e9f0a7ba1", "task_path": "tasks/nmp3_0dd0ae80-ffe1-5469-91f1-9548e08ff358", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0dd0ae80-ffe1-5469-91f1-9548e08ff358", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0e10d9d1-4e2f-52ec-a847-072549245f4a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose that $a_0,a_1,\\dots$ and $b_0,b_1,\\dots$ are two sequences of positive integers with $a_0,b_0\\ge2$ and \n-- \n-- \\[\n-- a_{n+1}= \\gcd(a_n,b_n)+1,\\qquad \n-- b_{n+1}= \\operatorname{lcm}(a_n,b_n)-1\\qquad (n\\ge0).\n-- \\]\n-- \n-- Prove that the sequence $\\{a_n\\}$ is eventually periodic; i.e. there exist integers $N\\ge0$ and $t>0$ such that $a_{n+t}=a_n$ for all $n\\ge N\\,. $\nimport Mathlib\n\n/-!\n# Formal statement: eventual periodicity of the first sequence\n\nThe original problem considers two sequences of positive integers\n`a₀, a₁, ...` and `b₀, b₁, ...` with initial values at least `2`,\nsubject to the mutual recurrences\n\n`a_{n+1} = gcd(a_n, b_n) + 1` and\n`b_{n+1} = lcm(a_n, b_n) - 1`.\n\nThe target asserts that the first sequence `a` is eventually periodic.\n-/\n\nnamespace Problem\n\n/-- A sequence `a : ℕ → ℕ` is eventually periodic if there are a starting\nindex `N ≥ 0` and a positive period `t` such that `a (n + t) = a n` for every\n`a n` with `n ≥ N`. -/\ndef EventuallyPeriodic (a : ℕ → ℕ) : Prop :=\n ∃ N t : ℕ, 0 < t ∧ ∀ n : ℕ, N ≤ n → a (n + t) = a n\n\n/-- The admissibility conditions for a pair of sequences `a` and `b` in the\nproblem: both are positive everywhere, their initial terms are at least `2`,\nand they satisfy the two given recurrences for every `n ≥ 0`. -/\ndef IsAdmissiblePair (a b : ℕ → ℕ) : Prop :=\n (∀ n : ℕ, 0 < a n ∧ 0 < b n) ∧\n 2 ≤ a 0 ∧\n 2 ≤ b 0 ∧\n (∀ n : ℕ, a (n + 1) = Nat.gcd (a n) (b n) + 1) ∧\n (∀ n : ℕ, b (n + 1) = Nat.lcm (a n) (b n) - 1)\n\n/-- The problem's target assertion: every admissible pair of positive integer\nsequences has an eventually periodic first sequence. -/\ndef Target : Prop :=\n ∀ (a b : ℕ → ℕ), IsAdmissiblePair a b → EventuallyPeriodic a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e10d9d1-4e2f-52ec-a847-072549245f4a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5e85dd68ecd80dc0a862beee2603d8749b8c4f47d1f6f0bdf79d6e9872af4b5f", "task_path": "tasks/nmp3_0e10d9d1-4e2f-52ec-a847-072549245f4a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e10d9d1-4e2f-52ec-a847-072549245f4a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0e2adbd4-9f73-5f7a-acc8-c46fc531187b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle and let $X\\in BC$, $Y\\in CA$, $Z\\in AB$ be points lying in the interior of the respective sides. Let $G$ be the centroid of triangle $XYZ$. Consider the homothety with centre $G$ and factor $4$, which maps $X,Y,Z$ to $X',Y',Z'$ respectively. Prove that triangle $X'Y'Z'$ contains (covers) at least one of the vertices $A$, $B$, or $C$.\nimport Mathlib\n\n/-!\n# Formal statement: centroid homothety covering a triangle vertex\n\nThis file states the planar affine/Euclidean geometry problem from\n`problem.md`. It introduces the points, side-interior condition, centroid,\nhomothety, and the closed triangular region used for containment, and then\nstates the target proposition. No proof of the target is supplied.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, represented as the real inner-product space\non two coordinates. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Three planar points form a nondegenerate triangle exactly when they are\naffinely independent. -/\ndef NondegenerateTriangle (A B C : Point) : Prop :=\n AffineIndependent ℝ (fun i : Fin 3 => ![A, B, C] i)\n\n/-- `R` lies in the relative interior of the side with endpoints `P` and `Q`.\nThis is the open segment, so it excludes both endpoints. -/\ndef InSideInterior (P Q R : Point) : Prop :=\n R ∈ openSegment ℝ P Q\n\n/-- The centroid of the triangle with vertices `X`, `Y`, and `Z`, computed as\ntheir arithmetic mean. -/\ndef centroidXYZ (X Y Z : Point) : Point :=\n (1 / 3 : ℝ) • (X + Y + Z)\n\n/-- `G` is the centroid of the triangle with vertices `X`, `Y`, and `Z`. -/\ndef IsCentroid (G X Y Z : Point) : Prop :=\n G = centroidXYZ X Y Z\n\n/-- The image of `P` under the homothety with centre `G` and factor `r`. -/\ndef homothety (G : Point) (r : ℝ) (P : Point) : Point :=\n G + r • (P - G)\n\n/-- `P'` is the image of `P` under the homothety with centre `G` and factor\n`r`. -/\ndef HomothetyImage (G : Point) (r : ℝ) (P P' : Point) : Prop :=\n P' = homothety G r P\n\n/-- The closed triangular region bounded by `P`, `Q`, and `R`, including its\nboundary and all of its interior. Convex hull is used so the formalization\ndoes not impose a nondegeneracy condition on the displayed image triangle. -/\ndef TriangleRegion (P Q R : Point) : Set Point :=\n convexHull ℝ ({P, Q, R} : Set Point)\n\n/-- The point `V` belongs to the closed triangular region with vertices\n`P`, `Q`, and `R`. -/\ndef InTriangleRegion (V P Q R : Point) : Prop :=\n V ∈ TriangleRegion P Q R\n\n/-- The triangle with vertices `P`, `Q`, and `R` contains at least one of\n`A`, `B`, and `C`. -/\ndef CoversAtLeastOneVertex\n (A B C P Q R : Point) : Prop :=\n InTriangleRegion A P Q R ∨\n InTriangleRegion B P Q R ∨\n InTriangleRegion C P Q R\n\n/-- The initial hypotheses of the construction: `A`, `B`, `C` form a\nnondegenerate triangle, and `X`, `Y`, `Z` lie in the interiors of the sides\n`BC`, `CA`, and `AB`, respectively. -/\ndef Setup (A B C X Y Z : Point) : Prop :=\n NondegenerateTriangle A B C ∧\n InSideInterior B C X ∧\n InSideInterior C A Y ∧\n InSideInterior A B Z\n\n/-- The assertion to be proved. For every triangle `ABC`, and every choice of\ninterior points `X`, `Y`, `Z` on the sides `BC`, `CA`, `AB`, let `G` be the\ncentroid of `XYZ` and let `X'`, `Y'`, `Z'` be the images of `X`, `Y`, `Z`\nunder the homothety with centre `G` and factor `4`. Then `X'Y'Z'` contains at\nleast one of `A`, `B`, `C`. -/\ndef Target : Prop :=\n ∀ A B C X Y Z : Point,\n Setup A B C X Y Z →\n let G : Point := centroidXYZ X Y Z\n let X' : Point := homothety G (4 : ℝ) X\n let Y' : Point := homothety G (4 : ℝ) Y\n let Z' : Point := homothety G (4 : ℝ) Z\n CoversAtLeastOneVertex A B C X' Y' Z'\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e2adbd4-9f73-5f7a-acc8-c46fc531187b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bc529ca080ff17d7666364f8539a51b6506a459f0bb5a68f12a1b248d96a707a", "task_path": "tasks/nmp3_0e2adbd4-9f73-5f7a-acc8-c46fc531187b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e2adbd4-9f73-5f7a-acc8-c46fc531187b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0e3328d7-b06c-5080-a830-7301c49f3edc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exist infinitely many positive integers $n$ such that \n-- \\[\n-- (n+1)(n+2)(n+3)(n+4)(n+5)(n+6)\n-- \\]\n-- can be expressed as a sum of two perfect squares.\nimport Mathlib\n\nnamespace Problem\n\n/-- A natural number is a sum of two perfect squares when it is the sum of the\nsquares of two natural numbers. In particular, zero squares are permitted. -/\ndef IsSumOfTwoSquares (m : ℕ) : Prop :=\n ∃ a b : ℕ, m = a ^ 2 + b ^ 2\n\n/-- The product `(n + 1) * (n + 2) * ... * (n + 6)`. -/\ndef SixConsecutiveProduct (n : ℕ) : ℕ :=\n (n + 1) * (n + 2) * (n + 3) * (n + 4) * (n + 5) * (n + 6)\n\n/-- A positive integer `n` satisfying the property in the problem. -/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧ IsSumOfTwoSquares (SixConsecutiveProduct n)\n\n/-- There are infinitely many positive integers `n` for which the product of the\nsix consecutive integers from `n + 1` through `n + 6` is a sum of two perfect\nsquares. -/\ndef Target : Prop :=\n Set.Infinite {n : ℕ | Admissible n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e3328d7-b06c-5080-a830-7301c49f3edc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6b90da1466447d7408a64e05f2172d770a8261cffc6f472a659548394f72930f", "task_path": "tasks/nmp3_0e3328d7-b06c-5080-a830-7301c49f3edc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e3328d7-b06c-5080-a830-7301c49f3edc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0e4311de-3c47-5540-85ef-bdb4404530ae", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there is no integer $n$ such that $n^7+7$ is a perfect square.\nimport Mathlib\n\n/-!\n# No integer whose seventh power plus seven is a perfect square\n\nThis file contains the formal statement of the problem only. In particular,\n`Problem.Target` is a proposition-valued definition, not a theorem asserting\nor proving its body.\n-/\n\nnamespace Problem\n\n/-- An integer `x` is a perfect square when it is the square of an integer. -/\ndef IsPerfectSquare (x : ℤ) : Prop :=\n ∃ m : ℤ, x = m ^ 2\n\n/-- There is no integer `n` for which `n ^ 7 + 7` is a perfect square. -/\ndef Target : Prop :=\n ¬ ∃ n : ℤ, IsPerfectSquare (n ^ 7 + 7)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e4311de-3c47-5540-85ef-bdb4404530ae", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "62b6f1007b12ff7cdf0b0e36e15327675da727314bc5d2a06f9d9bc949fe9fe8", "task_path": "tasks/nmp3_0e4311de-3c47-5540-85ef-bdb4404530ae", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e4311de-3c47-5540-85ef-bdb4404530ae", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0e4331f8-78dc-5744-b399-e9307bc60f3f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$ satisfying $a^2+b^2+c^2=3$, prove that $a^2c+b^2a+c^2b\\le abc+2$.\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the inequality problem\n\nThe problem asks to prove, for all positive real numbers `a`, `b`, and `c`\nwhose squares sum to `3`, that\n`a^2 c + b^2 a + c^2 b ≤ a b c + 2`.\n-/\n\nnamespace Problem\n\n/-- The proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = 3 →\n a ^ 2 * c + b ^ 2 * a + c ^ 2 * b ≤ a * b * c + 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e4331f8-78dc-5744-b399-e9307bc60f3f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f14e8d11a972866ef5ef604ceb0e425f6b7d3df329c27781d25760d6b67ac7be", "task_path": "tasks/nmp3_0e4331f8-78dc-5744-b399-e9307bc60f3f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e4331f8-78dc-5744-b399-e9307bc60f3f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0e49c1c2-2875-5642-bf91-2f720a5aa2f3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ be real numbers such that $(a+b)(b+c)(c+d)(d+a)=1$. Prove that \n-- \\[\n-- (2a+b+c)(2b+c+d)(2c+d+a)(2d+a+b)\\,(abcd)^2\\le\\frac1{16}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the four-variable inequality problem.\n\nThe source problem asks for a proof of an inequality for four positive real\nnumbers satisfying a product equation. This file declares the complete\nuniversally quantified proposition. It is a statement formalization only;\nno proof term or additional logical assumption is introduced.\n-/\n\nnamespace Problem\n\n/-- The strict positivity assumptions on the four real variables. -/\ndef Positive (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d\n\n/-- The product equation imposed on the four real variables. -/\ndef ProductEquation (a b c d : ℝ) : Prop :=\n (a + b) * (b + c) * (c + d) * (d + a) = (1 : ℝ)\n\n/-- All hypotheses of the problem, in their source order: positivity of\n`a`, `b`, `c`, and `d`, followed by the product equation. -/\ndef Hypothesis (a b c d : ℝ) : Prop :=\n Positive a b c d ∧ ProductEquation a b c d\n\n/-- The inequality asserted at the end of the problem. -/\ndef Conclusion (a b c d : ℝ) : Prop :=\n (2 * a + b + c) * (2 * b + c + d) * (2 * c + d + a) *\n (2 * d + a + b) * (a * b * c * d) ^ 2 ≤\n (1 : ℝ) / 16\n\n/-- The complete universally quantified assertion of the source problem:\nfor every quadruple of real numbers satisfying `Hypothesis`, the stated\ninequality `Conclusion` holds. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Hypothesis a b c d → Conclusion a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e49c1c2-2875-5642-bf91-2f720a5aa2f3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0df32a3f4bdaac4b929cfaa522e0b23d888c7a941a7809d9a631f1135be60e86", "task_path": "tasks/nmp3_0e49c1c2-2875-5642-bf91-2f720a5aa2f3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e49c1c2-2875-5642-bf91-2f720a5aa2f3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0e5f9e48-4b21-5142-8415-f6a15e4f6111", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with $a+b,\\;b+c,\\;c+a>0$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a}{\\,b+c\\,}}+\\sqrt{\\frac{b}{\\,c+a\\,}}+\\sqrt{\\frac{c}{\\,a+b\\,}}\n-- \\ge 1+\\frac{2\\bigl(a^{2}+b^{2}+c^{2}\\bigr)}{(a+b+c)^{2}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the nonnegative-variable square-root inequality\n\nThis file states the problem exactly as a universally quantified real inequality.\nNo proof of the inequality is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypotheses from the problem.\n\nThe variables `a`, `b`, and `c` are nonnegative real numbers, and each of the\nthree pairwise sums is strictly positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧\n 0 < a + b ∧ 0 < b + c ∧ 0 < c + a\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a / (b + c)) + Real.sqrt (b / (c + a)) + Real.sqrt (c / (a + b))\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 1 + (2 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2) / (a + b + c) ^ 2\n\n/-- The inequality asserted in the problem, under its stated admissibility\nhypotheses, for every ordered triple of nonnegative real numbers whose pairwise\nsums are positive. -/\nnoncomputable def Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → rhs a b c ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e5f9e48-4b21-5142-8415-f6a15e4f6111", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "42c1e54cc46e3d7b0958506720cb2ae4ae9d0c390859263a8940617fad72c27d", "task_path": "tasks/nmp3_0e5f9e48-4b21-5142-8415-f6a15e4f6111", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e5f9e48-4b21-5142-8415-f6a15e4f6111", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0e9f0c34-62cd-5a06-a17a-dfaf2d9a791c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c$ are three sides of a triangle (i.e. $a,b,c>0$ and $a+b>c$, $b+c>a$, $c+a>b$), prove that \n-- \\[\n-- \\frac{1}{a+2b}+\\frac{1}{b+2c}+\\frac{1}{c+2a}\\ge \\sqrt{\\frac{3}{ab+bc+ca}}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the triangle-sides inequality\n\nThe source problem asks us to prove, for positive real numbers `a`, `b`, and `c`\nthat satisfy the three strict triangle inequalities, the inequality\n\n`1 / (a + 2*b) + 1 / (b + 2*c) + 1 / (c + 2*a)\n ≥ sqrt (3 / (a*b + b*c + c*a))`.\n\nThis file records the proposition only; it deliberately contains no proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The admissible triples in the source problem: positive real side lengths\nsatisfying the three strict triangle inequalities. -/\ndef IsTriangleSideTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef leftHandSide (a b c : ℝ) : ℝ :=\n 1 / (a + 2 * b) + 1 / (b + 2 * c) + 1 / (c + 2 * a)\n\n/-- The right-hand side of the inequality in the source problem. Real division\nand the principal real square root are used. -/\ndef rightHandSide (a b c : ℝ) : ℝ :=\n Real.sqrt (3 / (a * b + b * c + c * a))\n\n/-- The full proposition requested by the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsTriangleSideTriple a b c →\n leftHandSide a b c ≥ rightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e9f0c34-62cd-5a06-a17a-dfaf2d9a791c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6a5b0f2391974824157602989875aafe51dd03c132174bbb68e6a548e731817d", "task_path": "tasks/nmp3_0e9f0c34-62cd-5a06-a17a-dfaf2d9a791c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0e9f0c34-62cd-5a06-a17a-dfaf2d9a791c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0ea48ed8-6e50-5932-9ce6-4d4beb2b66ff", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^3+b^3+c^3+3abc}{(a+b)(b+c)(c+a)}+\\frac{(a+b+c)^2}{6(a^2+b^2+c^2)}\\ge\\frac54\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality problem.\n\nThe source problem asks, for all strictly positive real numbers `a`, `b`, and `c`,\nto prove the displayed inequality. We package the full universally quantified\nassertion as a proposition-valued definition. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`,\n`(a^3 + b^3 + c^3 + 3abc) / ((a+b)(b+c)(c+a))\n + (a+b+c)^2 / (6(a^2+b^2+c^2)) ≥ 5/4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n (a ^ 3 + b ^ 3 + c ^ 3 + 3 * a * b * c) /\n ((a + b) * (b + c) * (c + a)) +\n (a + b + c) ^ 2 / (6 * (a ^ 2 + b ^ 2 + c ^ 2)) ≥\n 5 / 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0ea48ed8-6e50-5932-9ce6-4d4beb2b66ff", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b3109e535516a26f37b1aaaf5682b46da01d555327a8ed4350e42354fa4ce329", "task_path": "tasks/nmp3_0ea48ed8-6e50-5932-9ce6-4d4beb2b66ff", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0ea48ed8-6e50-5932-9ce6-4d4beb2b66ff", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0eab852a-619c-5a64-a0bb-ac88970cfdb5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for each $n\\in\\mathbb N$ there exist natural numbers $a_1\\varphi(a_2)>\\dots>\\varphi(a_n)\\!,\n-- \\] \n-- where $\\varphi$ denotes Euler's totient function.\nimport Mathlib.Data.Nat.Totient\n\n/-!\n# Strictly increasing natural numbers with strictly decreasing Euler totients\n\nThis file formalizes the statement of the target problem. The sequence\n`a₁, …, aₙ` is represented as a function `a : Fin n → ℕ`; hence its entries\nare indexed by `0, …, n - 1`, corresponding to the source indices `1, …, n`.\n-/\n\nnamespace Problem\n\n/-- The admissibility predicate for a proposed sequence of length `n`.\n\nThe first conjunct says that the sequence is strictly increasing. The second\nconjunct says that applying Euler's totient function produces a strictly\ndecreasing sequence. -/\ndef Admissible (n : ℕ) (a : Fin n → ℕ) : Prop :=\n (∀ i j : Fin n, i < j → a i < a j) ∧\n (∀ i j : Fin n, i < j → Nat.totient (a j) < Nat.totient (a i))\n\n/-- For every natural number `n`, there exists a strictly increasing sequence\nof `n` natural numbers whose Euler totients are strictly decreasing. -/\ndef Target : Prop :=\n ∀ n : ℕ, ∃ a : Fin n → ℕ, Admissible n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0eab852a-619c-5a64-a0bb-ac88970cfdb5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4418bceadd58d10e52ac4e80bf666ad9686662ad673c1c0bbf09d4484a73b05f", "task_path": "tasks/nmp3_0eab852a-619c-5a64-a0bb-ac88970cfdb5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0eab852a-619c-5a64-a0bb-ac88970cfdb5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0eb4fbae-a557-5c57-986a-1612a1a7a30d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a$, $b$, $c$, prove that \n-- \\[\n-- \\sqrt{\\frac{a^{4}+2b^{2}c^{2}}{a^{2}+2bc}}\n-- +\\sqrt{\\frac{b^{4}+2c^{2}a^{2}}{b^{2}+2ca}}\n-- +\\sqrt{\\frac{c^{4}+2a^{2}b^{2}}{c^{2}+2ab}}\n-- \\;\\ge\\;a+b+c.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable radical inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthat the sum of three specified square roots is at least `a + b + c`.\nThe declarations below formalize that proposition without asserting a proof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The summand\n`sqrt ((a^4 + 2 * b^2 * c^2) / (a^2 + 2 * b * c))`. -/\ndef summand (a b c : ℝ) : ℝ :=\n Real.sqrt ((a ^ 4 + 2 * b ^ 2 * c ^ 2) / (a ^ 2 + 2 * b * c))\n\n/-- The left-hand side of the inequality:\nthe sum of the three cyclic summands. -/\ndef lhs (a b c : ℝ) : ℝ :=\n summand a b c + summand b c a + summand c a b\n\n/-- The assertion from the problem: for all positive real numbers `a`, `b`, and `c`,\nthe cyclic sum of the three square roots is at least `a + b + c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n lhs a b c ≥ a + b + c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0eb4fbae-a557-5c57-986a-1612a1a7a30d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "91d8b7caf163a953c92fed9499db24a2f60411c1e454dc8fc535c97f4c802f2d", "task_path": "tasks/nmp3_0eb4fbae-a557-5c57-986a-1612a1a7a30d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0eb4fbae-a557-5c57-986a-1612a1a7a30d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0ee28651-2269-562f-b3a7-d62db988db94", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a convex hexagon $ABCDEF$ inscribed in a circle, prove that \n-- $$AC\\cdot BD\\cdot CE\\cdot DF\\cdot EA\\cdot FB\\;\\ge\\;27\\;AB\\cdot BC\\cdot CD\\cdot DE\\cdot EF\\cdot FA.$$\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic convex hexagon inequality\n\nThe source problem asks for a proof of a product inequality for the six side\nlengths and six \"skip-one\" chord lengths of a convex hexagon inscribed in a\ncircle. This file records the statement only; no proof is provided.\n\nVertices are indexed by `Fin 6`, with `0,1,2,3,4,5` corresponding to\n`A,B,C,D,E,F`.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane used for all vertices. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The point of the unit circle centered at the origin with parameter `θ`. -/\nnoncomputable def unitCirclePoint (θ : ℝ) : Point :=\n !₂[Real.cos θ, Real.sin θ]\n\n/-- The cyclic order of six angles when the vertices are traversed\ncounterclockwise. The last inequality chooses a lift of the angles to an\ninterval of length `2π`. -/\ndef CounterclockwiseAngleOrder (angle : Fin 6 → ℝ) : Prop :=\n angle 0 < angle 1 ∧\n angle 1 < angle 2 ∧\n angle 2 < angle 3 ∧\n angle 3 < angle 4 ∧\n angle 4 < angle 5 ∧\n angle 5 < angle 0 + 2 * Real.pi\n\n/-- The cyclic order of six angles when the vertices are traversed clockwise.\nThe last inequality chooses a lift of the angles to an interval of length `2π`. -/\ndef ClockwiseAngleOrder (angle : Fin 6 → ℝ) : Prop :=\n angle 0 > angle 1 ∧\n angle 1 > angle 2 ∧\n angle 2 > angle 3 ∧\n angle 3 > angle 4 ∧\n angle 4 > angle 5 ∧\n angle 5 > angle 0 - 2 * Real.pi\n\n/--\nA convex cyclic hexagon whose vertices, in the order `A,B,C,D,E,F`, occur\nsuccessively on a circle of positive radius. Either orientation around the\ncircle is allowed.\n\nThe angular inequalities are the precise expression of the cyclic order and\nconvexity of the polygon with the given vertex order. Since the angles are\nstrictly ordered through an interval of length `2π`, the six vertices are\npairwise distinct and form a nondegenerate convex hexagon.\n-/\ndef ConvexCyclicHexagon (p : Fin 6 → Point) : Prop :=\n ∃ (center : Point) (radius : ℝ) (angle : Fin 6 → ℝ),\n 0 < radius ∧\n (∀ i : Fin 6, p i = center + radius • unitCirclePoint (angle i)) ∧\n (CounterclockwiseAngleOrder angle ∨ ClockwiseAngleOrder angle)\n\n/-- The length of the chord joining the `i`-th and `j`-th vertices. -/\nnoncomputable def chordLength (p : Fin 6 → Point) (i j : Fin 6) : ℝ :=\n dist (p i) (p j)\n\n/-- The product of the six side lengths `AB · BC · CD · DE · EF · FA`. -/\nnoncomputable def sideProduct (p : Fin 6 → Point) : ℝ :=\n chordLength p 0 1 * chordLength p 1 2 *\n chordLength p 2 3 * chordLength p 3 4 *\n chordLength p 4 5 * chordLength p 5 0\n\n/--\nThe product of the six skip-one chord lengths\n`AC · BD · CE · DF · EA · FB`.\n-/\nnoncomputable def skipOneChordProduct (p : Fin 6 → Point) : ℝ :=\n chordLength p 0 2 * chordLength p 1 3 *\n chordLength p 2 4 * chordLength p 3 5 *\n chordLength p 4 0 * chordLength p 5 1\n\n/--\nThe assertion of the problem: for every convex hexagon inscribed in a circle,\nthe product of the six skip-one chord lengths is at least `27` times the\nproduct of the six side lengths.\n-/\ndef Target : Prop :=\n ∀ p : Fin 6 → Point,\n ConvexCyclicHexagon p →\n skipOneChordProduct p ≥ 27 * sideProduct p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0ee28651-2269-562f-b3a7-d62db988db94", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cc3f6c0067dcb8192bbda779c0a3f4d131d4323f8a3957fa463f3b481e168f17", "task_path": "tasks/nmp3_0ee28651-2269-562f-b3a7-d62db988db94", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0ee28651-2269-562f-b3a7-d62db988db94", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0f718ba6-29cf-5cb0-9a37-f03b7b97834d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for positive real numbers \\(a,b,c\\) satisfying \n-- \\[\n-- a^{4}+b^{4}+c^{4}\\ge a^{3}+b^{3}+c^{3},\n-- \\]\n-- the following inequality holds:\n-- \\[\n-- \\frac{a^{3}}{\\sqrt{\\,b^{4}+b^{2}c^{2}+c^{4}\\,}}+\\frac{b^{3}}{\\sqrt{\\,a^{4}+a^{2}c^{2}+c^{4}\\,}}+\\frac{c^{3}}{\\sqrt{\\,a^{4}+b^{2}a^{2}+b^{4}\\,}}\\ge\\sqrt{3}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three variables are positive real numbers. The word \"positive\" is\nformalized by the strict inequalities `0 < a`, `0 < b`, and `0 < c`. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The power-sum hypothesis from the problem. -/\ndef PowerSumCondition (a b c : ℝ) : Prop :=\n a ^ 4 + b ^ 4 + c ^ 4 ≥ a ^ 3 + b ^ 3 + c ^ 3\n\n/-- The left-hand side of the desired inequality. Its three denominators are\nrespectively `√(b^4 + b^2 c^2 + c^4)`,\n`√(a^4 + a^2 c^2 + c^4)`, and `√(a^4 + b^2 a^2 + b^4)`. -/\nnoncomputable def InequalityLHS (a b c : ℝ) : ℝ :=\n a ^ 3 / Real.sqrt (b ^ 4 + b ^ 2 * c ^ 2 + c ^ 4) +\n b ^ 3 / Real.sqrt (a ^ 4 + a ^ 2 * c ^ 2 + c ^ 4) +\n c ^ 3 / Real.sqrt (a ^ 4 + b ^ 2 * a ^ 2 + b ^ 4)\n\n/-- The right-hand side of the desired inequality, the principal real square\nroot of `3`. -/\nnoncomputable def InequalityRHS : ℝ :=\n Real.sqrt 3\n\n/-- The assertion in the problem: for every triple of positive real numbers\n`a`, `b`, `c` satisfying `a^4 + b^4 + c^4 ≥ a^3 + b^3 + c^3`, the displayed\nsum of the three quotients is at least `√3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n PositiveTriple a b c →\n PowerSumCondition a b c →\n InequalityLHS a b c ≥ InequalityRHS\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0f718ba6-29cf-5cb0-9a37-f03b7b97834d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7d96f7da5a426938021b725af0ea0761ddf9df13ae9aa91635a328dd7a0dee62", "task_path": "tasks/nmp3_0f718ba6-29cf-5cb0-9a37-f03b7b97834d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0f718ba6-29cf-5cb0-9a37-f03b7b97834d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0f8269e9-df98-5b91-acf1-9f8d0268b730", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $ab+bc+ca=3$. Prove that \n-- \\[\n-- \\frac1{\\sqrt{2a^2+5ab+2b^2}}+\\frac1{\\sqrt{2b^2+5bc+2c^2}}+\\frac1{\\sqrt{2c^2+5ca+2a^2}}\\ge1.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the three-variable radical inequality\n\nThe source problem asks to prove an inequality for three nonnegative real\nnumbers satisfying the symmetric condition `ab + bc + ca = 3`.\n\nThis file only formalizes the statement. `Problem.Target` is a proposition;\nno proof of it is supplied here.\n-/\n\nnamespace Problem\n\n/-- The three nonnegativity assumptions from the source, in the order\n`a`, `b`, `c`. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n (0 : ℝ) ≤ a ∧ (0 : ℝ) ≤ b ∧ (0 : ℝ) ≤ c\n\n/-- The equality constraint `ab + bc + ca = 3` from the source. -/\ndef SumConstraint (a b c : ℝ) : Prop :=\n a * b + b * c + c * a = (3 : ℝ)\n\n/-- One cyclic summand with the two indicated adjacent variables. -/\nnoncomputable def Summand (a b : ℝ) : ℝ :=\n (1 : ℝ) / Real.sqrt ((2 : ℝ) * a ^ 2 + (5 : ℝ) * a * b + (2 : ℝ) * b ^ 2)\n\n/-- The left-hand side of the source inequality, with cyclic order `(a,b)`,\n`(b,c)`, `(c,a)`. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n Summand a b + Summand b c + Summand c a\n\n/-- The complete assertion of the source problem.\n\nThe three real variables are universally quantified in the order `a`, `b`,\n`c`. Their three nonnegativity assumptions occur in the source order,\nfollowed by the equality constraint, and then the conclusion. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n Nonnegative a b c →\n SumConstraint a b c →\n (1 : ℝ) ≤ LHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0f8269e9-df98-5b91-acf1-9f8d0268b730", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "341872091fce76f36c35c58cba83ad8cbe5a27f6d8533aa276e9cf8c10356f89", "task_path": "tasks/nmp3_0f8269e9-df98-5b91-acf1-9f8d0268b730", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0f8269e9-df98-5b91-acf1-9f8d0268b730", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0f90abdf-3d74-58ca-806d-1f84501ee60f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A positive integer is called monotonic if, when written in base 10, its digits are weakly increasing (i.e., each digit is at least as large as the previous one). A positive integer cannot have leading digit 0. Prove that for every positive integer $n$, there exists an $n$‑digit monotonic number that is a perfect square.\nimport Mathlib\n\n/-!\n# Monotonic decimal digits and square numbers\n\nThe source problem asks to prove that, for every positive integer `n`, there is\nan `n`-digit positive integer whose decimal digits are weakly increasing from\nthe most significant digit to the least significant digit, and which is a\nperfect square.\n\nThis file contains only the formal statement. In particular, `Problem.Target`\nis a proposition-valued definition; no proof of it is supplied here.\n-/\n\nnamespace Problem\n\n/-- The digit in the `place`-th base-10 position of `x`, where place `0` is the\nunits digit, used with the standard Euclidean division and remainder on natural\nnumbers. Positions above the most significant digit evaluate to `0`. -/\ndef decimalDigit (x : Nat) (place : Nat) : Nat :=\n (x / 10 ^ place) % 10\n\n/-- The decimal digits of a positive natural number are weakly increasing when\nread from left to right, equivalently when indexed from the most significant\nposition down to the units position. In the digit-index notation, adjacent\ndigits of `x` satisfy `d_(i+1) <= d_i`: the digit in the next more significant\nposition is no larger than the digit in the less significant position. This\ncondition applies exactly when both positions occur in the decimal expansion;\n`10 ^ (i + 1) <= x` says that position `i + 1` is present. -/\ndef IsMonotonicNumber (x : Nat) : Prop :=\n 0 < x ∧\n ∀ i : Nat, 10 ^ (i + 1) <= x → decimalDigit x (i + 1) <= decimalDigit x i\n\n/-- `x` has exactly `n` decimal digits. For positive `n`, this is the usual\nrange `10 ^ (n - 1) <= x < 10 ^ n`, which also ensures that the leading digit\nis nonzero. The condition `0 < n` is included so that the definition itself\ndoes not assign a decimal length to `0`. -/\ndef IsNDigit (n : Nat) (x : Nat) : Prop :=\n 0 < n ∧ 10 ^ (n - 1) <= x ∧ x < 10 ^ n\n\n/-- A natural number is a perfect square if it is the square of an integer\n(naturally represented here by a natural number). -/\ndef IsPerfectSquare (x : Nat) : Prop :=\n ∃ r : Nat, x = r * r\n\n/-- `x` is an `n`-digit monotonic perfect square: it has exactly `n` decimal\ndigits, its decimal digits are weakly increasing from left to right, and it is\na perfect square. -/\ndef IsNDigitMonotonicSquare (n : Nat) (x : Nat) : Prop :=\n IsNDigit n x ∧ IsMonotonicNumber x ∧ IsPerfectSquare x\n\n/-- The source problem's full assertion: for every positive integer `n`, there\nexists an `n`-digit monotonic number that is a perfect square. -/\ndef Target : Prop :=\n ∀ n : Nat, 0 < n → ∃ x : Nat, IsNDigitMonotonicSquare n x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0f90abdf-3d74-58ca-806d-1f84501ee60f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fa985f4b49145dce92c6fcc74b4efc6afaa4fb1c038110a219a46b3d7f6f4155", "task_path": "tasks/nmp3_0f90abdf-3d74-58ca-806d-1f84501ee60f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0f90abdf-3d74-58ca-806d-1f84501ee60f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0fbbf0bc-1c49-5aa8-8de1-b66a9be0e8db", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a cyclic quadrilateral. Let the diagonals $AC$ and $BD$ intersect at $K$. Let $M$ and $N$ be the midpoints of $AC$ and $BD$, respectively. The circumcircles of $\\triangle ADM$ and $\\triangle BCM$ intersect again at a point $L\\neq M$. Prove that the four points $K$, $L$, $M$, and $N$ are concyclic. (All points are distinct.)\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Sphere.Basic\n\n/-!\n# Formal statement: a four-point concyclicity theorem\n\nThe ambient space is the real Euclidean plane `ℝ²`. The declarations below\nrecord the hypotheses and conclusion of the problem as propositions. In\nparticular, `Problem.Target` is a proposition; no proof of it is supplied.\n-/\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The real Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The eight named points `A`, `B`, `C`, `D`, `K`, `L`, `M`, and `N` are\npairwise distinct. -/\ndef AllNamedPointsDistinct (A B C D K L M N : Plane) : Prop :=\n Function.Injective (fun i : Fin 8 => ![A, B, C, D, K, L, M, N] i)\n\n/-- Four points are concyclic when they all lie on one Euclidean circle. -/\ndef FourPointsConcyclic (A B C D : Plane) : Prop :=\n EuclideanGeometry.Concyclic ({A, B, C, D} : Set Plane)\n\n/-- The quadrilateral with vertices `A`, `B`, `C`, and `D` is cyclic. -/\ndef CyclicQuadrilateral (A B C D : Plane) : Prop :=\n FourPointsConcyclic A B C D\n\n/-- The diagonal segments `AC` and `BD` meet strictly at the unique point `K`.\n\nThe two `Sbtw` conjuncts say that `K` is strictly between the endpoints of\neach diagonal, and the final conjunct records uniqueness of their common point.\n-/\ndef DiagonalsMeetAt (A B C D K : Plane) : Prop :=\n Sbtw ℝ A K C ∧\n Sbtw ℝ B K D ∧\n ∀ x : Plane, Sbtw ℝ A x C → Sbtw ℝ B x D → x = K\n\n/-- `s` is the circumcircle of the nondegenerate triangle with vertices `x`,\n`y`, and `z`. The uniqueness conjunct explicitly identifies the unique circle\nthrough the three vertices. -/\ndef IsCircumcircleOfTriangle (s : EuclideanGeometry.Sphere Plane)\n (x y z : Plane) : Prop :=\n ¬ Collinear ℝ ({x, y, z} : Set Plane) ∧\n x ∈ s ∧ y ∈ s ∧ z ∈ s ∧\n ∀ t : EuclideanGeometry.Sphere Plane,\n x ∈ t → y ∈ t → z ∈ t → t = s\n\n/-- The circumcircle of triangle `ADM` and the circumcircle of triangle `BCM`\nmeet again at `L`, with `L ≠ M`.\n\nThe two existential spheres are constrained to be the unique circumcircles of\ntheir respective triangles. Every common point of those circles is either\n`M` or `L`; since both `M` and `L` are known common points and `L ≠ M`, the\nintersection is exactly `{M, L}`.\n-/\ndef CircumcirclesMeetAgainAt (A B C D M L : Plane) : Prop :=\n L ≠ M ∧\n ∃ sADM sBCM : EuclideanGeometry.Sphere Plane,\n IsCircumcircleOfTriangle sADM A D M ∧\n IsCircumcircleOfTriangle sBCM B C M ∧\n L ∈ sADM ∧ L ∈ sBCM ∧\n ∀ p : Plane, p ∈ sADM → p ∈ sBCM → p = M ∨ p = L\n\n/-- Formalized target: for every configuration of eight pairwise distinct\npoints satisfying the cyclic-quadrilateral, diagonal-intersection, midpoint,\nand second-circumcircle-intersection hypotheses, the points `K`, `L`, `M`, and\n`N` are concyclic. -/\ndef Target : Prop :=\n ∀ (A B C D : Plane),\n CyclicQuadrilateral A B C D →\n ∀ (K : Plane),\n DiagonalsMeetAt A B C D K →\n ∀ (M N : Plane),\n M = midpoint ℝ A C →\n N = midpoint ℝ B D →\n ∀ (L : Plane),\n CircumcirclesMeetAgainAt A B C D M L →\n AllNamedPointsDistinct A B C D K L M N →\n FourPointsConcyclic K L M N\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0fbbf0bc-1c49-5aa8-8de1-b66a9be0e8db", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cfb9d673c92ef2c80601a3a7b176d900d83defad2ff68c0fdad1639f5e08baf4", "task_path": "tasks/nmp3_0fbbf0bc-1c49-5aa8-8de1-b66a9be0e8db", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0fbbf0bc-1c49-5aa8-8de1-b66a9be0e8db", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0fdbd4a7-e7f0-5676-8555-9eea9e12ed63", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\frac{(a+2b+c)^3}{3a^3+2b^3+3c^3}+\\frac{(a+b+2c)^3}{3a^3+3b^3+2c^3}+\\frac{(2a+b+c)^3}{2a^3+3b^3+3c^3}\\le 24.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization target\n\nFor all positive real numbers `a`, `b`, `c`, the stated sum of three\ncubic ratios is at most `24`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n ((a + 2 * b + c) ^ 3) / (3 * a ^ 3 + 2 * b ^ 3 + 3 * c ^ 3) +\n ((a + b + 2 * c) ^ 3) / (3 * a ^ 3 + 3 * b ^ 3 + 2 * c ^ 3) +\n ((2 * a + b + c) ^ 3) / (2 * a ^ 3 + 3 * b ^ 3 + 3 * c ^ 3)\n\n/-- The proposition claimed in the problem: for every triple of positive\nreal numbers, the stated left-hand side is at most `24`. -/\ndef Target : Prop :=\n ∀ (a : ℝ) (b : ℝ) (c : ℝ),\n 0 < a → 0 < b → 0 < c → lhs a b c ≤ 24\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0fdbd4a7-e7f0-5676-8555-9eea9e12ed63", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7acfdb5d7751a88c6f456a6a08ce035000b35608fd61877acc8043a36c429d85", "task_path": "tasks/nmp3_0fdbd4a7-e7f0-5676-8555-9eea9e12ed63", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0fdbd4a7-e7f0-5676-8555-9eea9e12ed63", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_0ffcbaa3-7f99-5d62-bad5-e67bf4e4efb5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a^3}{c\\!\\left(2a^2+b^2+c^2\\right)}+\\frac{b^3}{a\\!\\left(2b^2+c^2+a^2\\right)}+\\frac{c^3}{b\\!\\left(2c^2+a^2+b^2\\right)}\\ge\\frac{9\\left(a^2+b^2+c^2\\right)}{4\\left(a+b+c\\right)^2}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of a three-variable real inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe inequality\n\n`a^3 / (c * (2a^2 + b^2 + c^2)) +\n b^3 / (a * (2b^2 + c^2 + a^2)) +\n c^3 / (b * (2c^2 + a^2 + b^2))\n ≥ 9 * (a^2 + b^2 + c^2) / (4 * (a + b + c)^2)`.\n\nThe declaration `Problem.Target` below states that assertion as a proposition.\n-/\n\nnamespace Problem\n\n/-- The positivity hypotheses on the three real variables. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side appearing in the source inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a ^ 3 / (c * (2 * a ^ 2 + b ^ 2 + c ^ 2)) +\n b ^ 3 / (a * (2 * b ^ 2 + c ^ 2 + a ^ 2)) +\n c ^ 3 / (b * (2 * c ^ 2 + a ^ 2 + b ^ 2))\n\n/-- The right-hand side appearing in the source inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n (9 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2) / (4 * (a + b + c) ^ 2)\n\n/-- The complete assertion to be proved: for every triple of positive real numbers,\nthe left-hand side is at least the right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ RHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0ffcbaa3-7f99-5d62-bad5-e67bf4e4efb5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "de81de5e4c80ea7bb4a3c6c6271dfe8852792637fda3eab8b1c50daa61552dde", "task_path": "tasks/nmp3_0ffcbaa3-7f99-5d62-bad5-e67bf4e4efb5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "0ffcbaa3-7f99-5d62-bad5-e67bf4e4efb5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_100fbe28-38ed-51cd-b7af-f7005903bb4f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^{3}}{a^{3}+(a+b)^{3}}+\\frac{b^{3}}{b^{3}+(b+c)^{3}}+\\frac{c^{3}}{c^{3}+(c+a)^{3}}\\ge\\frac13\\; .\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the cyclic rational inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\nthat the cyclic sum of three cubic rational expressions is at least `1 / 3`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 3 / (a ^ 3 + (a + b) ^ 3) +\n b ^ 3 / (b ^ 3 + (b + c) ^ 3) +\n c ^ 3 / (c ^ 3 + (c + a) ^ 3)\n\n/--\nThe assertion of the source problem: for all positive real numbers `a`, `b`,\nand `c`, the cyclic sum `Problem.lhs a b c` is at least `1 / 3`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n lhs a b c ≥ (1 / 3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "100fbe28-38ed-51cd-b7af-f7005903bb4f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7f111229a71db9341723e370415483de449eefe72f52bf2e82369119f1169a06", "task_path": "tasks/nmp3_100fbe28-38ed-51cd-b7af-f7005903bb4f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "100fbe28-38ed-51cd-b7af-f7005903bb4f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_101979ab-8c21-5ffd-8110-ae602532b94a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>3$ be an odd integer. Prove that there exists a prime $p$ such that $p\\mid\\bigl(2^{\\varphi(n)}-1\\bigr)$ but $p\\nmid n\\,$, where $\\varphi$ denotes Euler’s totient function.\nimport Mathlib.Data.Nat.Totient\n\n/-!\n# Formal statement\n\nLet `n > 3` be an odd integer. Then there is a prime `p` which divides\n`2 ^ φ(n) - 1` but does not divide `n`.\n\nBecause Euler's totient function in Mathlib is defined on natural numbers and\nthe hypothesis `n > 3` makes `n` positive, we represent the integer variable\n`n` by a natural number. This is the standard domain of `Nat.totient`.\n-/\n\nnamespace Problem\n\n/-- The complete universal assertion of the problem. For every natural number\n`n` greater than `3` and odd, there exists a prime `p` such that `p` divides\n`2 ^ Nat.totient n - 1` but `p` does not divide `n`. Here `Nat.totient` is\nEuler's totient function. -/\ndef Target : Prop :=\n ∀ n : ℕ, 3 < n → Odd n →\n ∃ p : ℕ, Nat.Prime p ∧ p ∣ (2 ^ Nat.totient n - 1) ∧ ¬ p ∣ n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "101979ab-8c21-5ffd-8110-ae602532b94a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a825afd6238b8d4a2eafa537971e3642bf48cb62a018c1c8ff31380c459fbdd8", "task_path": "tasks/nmp3_101979ab-8c21-5ffd-8110-ae602532b94a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "101979ab-8c21-5ffd-8110-ae602532b94a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_10333d1c-4295-5443-be06-fce8c1d727d8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k$ be a positive integer. For each non‑negative integer $n$, define $f(n)$ to be the number of integer $k$‑tuples $(x_1,\\dots,x_k)\\in\\mathbb Z^k$ that satisfy \n-- \\[\n-- |x_1|+|x_2|+\\cdots+|x_k|\\le n .\n-- \\] \n-- Prove that for every $n\\ge 1$,\n-- \\[\n-- f(n-1)\\,f(n+1)\\;\\le\\;f(n)^2 .\n-- \\]\nimport Mathlib.Data.Int.NatAbs\nimport Mathlib.Data.Int.Interval\nimport Mathlib.Data.Fintype.Pi\nimport Mathlib.Algebra.BigOperators.Fin\nimport Mathlib.Algebra.Order.BigOperators.Group.Finset\nimport Mathlib.Algebra.Order.Group.Defs\nimport Mathlib.Algebra.Order.Group.Int\n\n/-!\n# Formal statement of the integer lattice-point inequality\n\nFor a positive integer `k`, the original problem defines `f n` as the number of\ninteger `k`-tuples whose coordinates have sum of absolute values at most `n`.\nThe target proposition is the log-convexity-type inequality\n`f (n - 1) * f (n + 1) ≤ f n ^ 2` for every positive `n`.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The finite type of integers lying between `-n` and `n`. -/\nabbrev BoundedInt (n : ℕ) : Type :=\n {z : ℤ // z ∈ Finset.Icc (-(n : ℤ)) (n : ℤ)}\n\n/-- The finite set of integer `k`-tuples all of whose coordinates lie in `[-n, n]`.\nThis is the finite ambient set used to count the tuples in `f`. -/\ndef boundedIntegerTuples (k n : ℕ) : Finset (Fin k → ℤ) :=\n (Finset.univ : Finset (Fin k → BoundedInt n)).image\n (fun (x : Fin k → BoundedInt n) (i : Fin k) => (x i : ℤ))\n\n/-- The condition that an integer `k`-tuple has `ℓ¹`-norm at most `n`. -/\nabbrev isIntegerTupleOfL1NormAtMost (k n : ℕ) (x : Fin k → ℤ) : Prop :=\n ∑ i : Fin k, Int.natAbs (x i) ≤ n\n\n/-- The finite set of integer `k`-tuples with `∑ i, |x i| ≤ n`.\n\nThe ambient finite set consists of tuples in `[-n,n]^k`. For `n : ℕ`, every tuple\nwhose sum of absolute values is at most `n` has each coordinate in this interval,\nso filtering this finite set gives exactly the tuples counted by the problem. -/\ndef integerTuplesWithL1NormLE (k n : ℕ) : Finset (Fin k → ℤ) :=\n (boundedIntegerTuples k n).filter (isIntegerTupleOfL1NormAtMost k n)\n\n/-- The function `f` from the problem, with the fixed positive integer `k` made explicit:\n`f k n` is the number of integer `k`-tuples with `∑ i, |x i| ≤ n`. -/\ndef f (k n : ℕ) : ℕ :=\n (integerTuplesWithL1NormLE k n).card\n\n/-- Membership in the finite ambient set means exactly that every coordinate lies\nin the interval `[-n, n]`. -/\nlemma mem_boundedIntegerTuples_iff {k n : ℕ} {x : Fin k → ℤ} :\n x ∈ boundedIntegerTuples k n ↔\n ∀ i : Fin k, (x i) ∈ Finset.Icc (-(n : ℤ)) (n : ℤ) := by\n classical\n simp only [boundedIntegerTuples, Finset.mem_image, Finset.mem_univ, true_and]\n constructor\n · rintro ⟨y, rfl⟩ i\n exact (y i).property\n · intro hx\n exact ⟨fun i => ⟨x i, hx i⟩, rfl⟩\n\n/-- For a natural bound `n`, membership in the filtered finite ambient set is\n`∑ i, Int.natAbs (x i) ≤ n`, exactly the condition defining the tuples counted by `f`. -/\nlemma mem_integerTuplesWithL1NormLE_iff {k n : ℕ} {x : Fin k → ℤ} :\n x ∈ integerTuplesWithL1NormLE k n ↔\n ∑ i : Fin k, Int.natAbs (x i) ≤ n := by\n classical\n rw [integerTuplesWithL1NormLE, Finset.mem_filter]\n constructor\n · exact fun h => h.2\n · intro hsum\n refine ⟨?_, hsum⟩\n rw [mem_boundedIntegerTuples_iff]\n intro i\n rw [Finset.mem_Icc]\n have hterm : Int.natAbs (x i) ≤ ∑ j : Fin k, Int.natAbs (x j) := by\n exact Finset.single_le_sum (fun j _ => Nat.zero_le (Int.natAbs (x j)))\n (Finset.mem_univ i)\n have hterm' : Int.natAbs (x i) ≤ n := le_trans hterm hsum\n have htermZ : ((x i).natAbs : ℤ) ≤ (n : ℤ) := by exact_mod_cast hterm'\n constructor\n · have habs : -(((x i).natAbs : ℤ)) ≤ x i := by\n have h := neg_abs_le (x i)\n rwa [Int.abs_eq_natAbs] at h\n exact le_trans (neg_le_neg htermZ) habs\n · have hle : x i ≤ ((x i).natAbs : ℤ) := by\n simpa [Int.abs_eq_natAbs] using le_abs_self (x i)\n exact le_trans hle htermZ\n\n/-- The displayed inequality for a fixed `k` and `n`. The expression `n - 1`\nis natural-number subtraction; under the target's hypothesis `1 ≤ n` it is the\nnon-negative integer `n - 1`. -/\ndef targetInequality (k n : ℕ) : Prop :=\n f k (n - 1) * f k (n + 1) ≤ f k n ^ 2\n\n/-- The complete assertion: for every positive integer `k` and every integer\n`n ≥ 1`, `f (n - 1) * f (n + 1) ≤ f n ^ 2`. -/\ndef Target : Prop :=\n ∀ (k : ℕ), 0 < k → ∀ (n : ℕ), 1 ≤ n → targetInequality k n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "10333d1c-4295-5443-be06-fce8c1d727d8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a1ff6e6696d1b09541827ceff46205f9bf55075addfcb48dbea564d404382717", "task_path": "tasks/nmp3_10333d1c-4295-5443-be06-fce8c1d727d8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "10333d1c-4295-5443-be06-fce8c1d727d8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_103b2bee-60a7-5308-a05d-d13378a066f5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P$ and $Q$ be interior points of triangle $ABC$ such that $\\angle ACP=\\angle BCQ$ and $\\angle CAP=\\angle BAQ$. Let $D$, $E$, and $F$ be the feet of the perpendiculars from $P$ to the lines $BC$, $CA$, and $AB$, respectively. Prove that if $\\angle DEF=90^\\circ$, then $Q$ is the orthocenter of triangle $BDF\\,. $\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the formalization. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The assertion that `A`, `B`, and `C` are the vertices of a genuine\n(non-degenerate) triangle. In the plane this is the negation of collinearity. -/\ndef IsNondegenerateTriangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- `P` is strictly inside the triangle with vertices `A`, `B`, and `C`.\nThe witness expresses `P` as a convex combination of the vertices with all\nthree barycentric coefficients strictly positive. -/\ndef IsInteriorPoint (A B C P : Plane) : Prop :=\n ∃ (α β γ : ℝ),\n 0 < α ∧ 0 < β ∧ 0 < γ ∧ α + β + γ = 1 ∧\n P = α • A + β • B + γ • C\n\n/-- The orthogonal projection of `P` onto the line through `X` and `Y`.\nWhen `X ≠ Y`, this is the foot of the perpendicular from `P` to that line.\nAll uses in `Target` involve pairs of distinct vertices of a non-degenerate\ntriangle, so the denominator is nonzero. -/\nnoncomputable def perpendicularFoot (P X Y : Plane) : Plane :=\n X + ((inner ℝ (P - X) (Y - X) / ‖Y - X‖ ^ 2) • (Y - X))\n\n/-- `D` lies on the line through `X` and `Y`, and `PD` is perpendicular to\nthat line. This is the geometric characterization of a foot of the\nperpendicular from `P` to the line `XY`. -/\ndef IsPerpendicularFoot (P X Y D : Plane) : Prop :=\n D ∈ affineSpan ℝ ({X, Y} : Set Plane) ∧\n inner ℝ (P - D) (Y - X) = 0\n\n/-- The projection formula `perpendicularFoot` lands on the line `XY`. -/\ntheorem perpendicularFoot_mem_line (P X Y : Plane) :\n perpendicularFoot P X Y ∈ affineSpan ℝ ({X, Y} : Set Plane) := by\n let s : AffineSubspace ℝ Plane := affineSpan ℝ ({X, Y} : Set Plane)\n have hX : X ∈ s := by\n dsimp [s]\n exact subset_affineSpan ℝ _ (by simp)\n have hY : Y ∈ s := by\n dsimp [s]\n exact subset_affineSpan ℝ _ (by simp)\n have h := AffineSubspace.smul_vsub_vadd_mem s\n (inner ℝ (P - X) (Y - X) / ‖Y - X‖ ^ 2) hY hX hX\n simpa [perpendicularFoot, s, vsub_eq_sub, add_comm] using h\n\n/-- For distinct `X` and `Y`, the vector from the projection of `P` to `P` is\northogonal to the direction `Y - X` of the line. -/\ntheorem perpendicularFoot_perp (P X Y : Plane) (hXY : X ≠ Y) :\n inner ℝ (P - perpendicularFoot P X Y) (Y - X) = 0 := by\n rw [perpendicularFoot]\n have hYX : Y - X ≠ 0 := sub_ne_zero.mpr hXY.symm\n have hden : ‖Y - X‖ ^ 2 ≠ 0 := pow_ne_zero 2 (norm_ne_zero_iff.mpr hYX)\n rw [show P - (X + ((inner ℝ (P - X) (Y - X) / ‖Y - X‖ ^ 2) • (Y - X)))\n = (P - X) - ((inner ℝ (P - X) (Y - X) / ‖Y - X‖ ^ 2) • (Y - X)) by abel]\n rw [inner_sub_left, inner_sub_right, inner_smul_left]\n simp [hden]\n\n/-- For distinct `X` and `Y`, `perpendicularFoot P X Y` satisfies the explicit\nfoot-of-perpendicular predicate. -/\ntheorem perpendicularFoot_isFoot (P X Y : Plane) (hXY : X ≠ Y) :\n IsPerpendicularFoot P X Y (perpendicularFoot P X Y) :=\n ⟨perpendicularFoot_mem_line P X Y, perpendicularFoot_perp P X Y hXY⟩\n\n/-- On a non-degenerate line through distinct points `X` and `Y`, any point\nsatisfying the foot-of-perpendicular predicate is the projection computed by\n`perpendicularFoot`; in particular the perpendicular foot is unique. -/\ntheorem eq_perpendicularFoot_of_isFoot (P X Y D : Plane) (hXY : X ≠ Y)\n (hD : IsPerpendicularFoot P X Y D) : D = perpendicularFoot P X Y := by\n let u : Plane := Y - X\n have hu : u ≠ 0 := by\n dsimp [u]\n exact sub_ne_zero.mpr hXY.symm\n have huinner : inner ℝ u u ≠ 0 := by\n rw [real_inner_self_eq_norm_sq]\n exact pow_ne_zero 2 (norm_ne_zero_iff.mpr hu)\n have hline : D ∈ line[ℝ, X, Y] := by\n simpa [IsPerpendicularFoot, u] using hD.1\n rw [mem_affineSpan_pair_iff_exists_lineMap_eq] at hline\n obtain ⟨r, hr⟩ := hline\n have hDexpr : D = X + r • u := by\n rw [← hr, AffineMap.lineMap_apply]\n simp [u, vsub_eq_sub, add_comm]\n have hperp : inner ℝ (P - (X + r • u)) u = 0 := by\n simpa [hDexpr, u] using hD.2\n rw [show P - (X + r • u) = (P - X) - r • u by abel] at hperp\n rw [inner_sub_left, inner_smul_left] at hperp\n simp at hperp\n have hr_eq : r = inner ℝ (P - X) u / inner ℝ u u := by\n rw [eq_div_iff huinner]\n rw [real_inner_self_eq_norm_sq u]\n linarith\n rw [hDexpr, hr_eq]\n simp [perpendicularFoot, u]\n\n/-- The non-oriented angle at the middle point is a right angle. -/\ndef IsRightAngle (X Y Z : Plane) : Prop :=\n EuclideanGeometry.angle X Y Z = Real.pi / 2\n\n/-- `Q` is the orthocenter of the non-degenerate triangle with ordered vertices\n`B`, `D`, and `F`. The first conjunct records non-degeneracy, and the remaining\nthree conjuncts say that `Q` lies on the three altitudes. -/\ndef IsOrthocenterOfTriangle (Q B D F : Plane) : Prop :=\n ¬ Collinear ℝ ({B, D, F} : Set Plane) ∧\n inner ℝ (Q - B) (F - D) = 0 ∧\n inner ℝ (Q - D) (F - B) = 0 ∧\n inner ℝ (Q - F) (D - B) = 0\n\n/-- The full statement of the problem: for every non-degenerate triangle `ABC`\nand interior points `P` and `Q` satisfying the two angle equalities, if the\nfeet `D`, `E`, and `F` of the perpendiculars from `P` to `B C`, `C A`, and\n`A B` satisfy `∠DEF = 90°`, then `Q` is the orthocenter of triangle `B D F`. -/\ndef Target : Prop :=\n ∀ (A B C P Q : Plane),\n IsNondegenerateTriangle A B C →\n IsInteriorPoint A B C P →\n IsInteriorPoint A B C Q →\n EuclideanGeometry.angle A C P = EuclideanGeometry.angle B C Q →\n EuclideanGeometry.angle C A P = EuclideanGeometry.angle B A Q →\n let D : Plane := perpendicularFoot P B C\n let E : Plane := perpendicularFoot P C A\n let F : Plane := perpendicularFoot P A B\n IsRightAngle D E F →\n IsOrthocenterOfTriangle Q B D F\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "103b2bee-60a7-5308-a05d-d13378a066f5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6b18229b5c9c28898c441967f0400a31f7a9748c29b8d3103521a1e6e222dde2", "task_path": "tasks/nmp3_103b2bee-60a7-5308-a05d-d13378a066f5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "103b2bee-60a7-5308-a05d-d13378a066f5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_107234ba-a6ff-50ec-b650-1532fc4e1916", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a prime $p$, prove that for all but finitely many primes $q$ the sum \n-- \\[\n-- \\sum_{k=1}^{\\left\\lfloor \\frac{q}{p}\\right\\rfloor} k^{\\,p-1}\n-- \\]\n-- is not divisible by $q$.\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nGiven a prime `p`, show that for all but finitely many primes `q`, the sum\n`∑ k = 1..⌊q / p⌋, k ^ (p - 1)` is not divisible by `q`.\n\nThe formal statement below collects the primes `q` that violate the conclusion and\nasserts that this set is finite. This is the standard meaning of \"all but finitely\nmany primes `q`\".\n-/\n\nnamespace Problem\n\n/-- The sum appearing in the problem, over natural-number indices\n`1 ≤ k ≤ ⌊q / p⌋`. Natural-number division is used for the floor. -/\ndef powerSum (p q : ℕ) : ℕ :=\n ∑ k ∈ Finset.Icc 1 (q / p), k ^ (p - 1)\n\n/-- The non-divisibility statement in the problem: `q` does not divide the sum. -/\ndef SumNotDivisible (p q : ℕ) : Prop :=\n ¬ q ∣ powerSum p q\n\n/-- A prime `q` is exceptional for `p` when the problem's sum is divisible by `q`. -/\ndef IsExceptionalPrime (p q : ℕ) : Prop :=\n Nat.Prime q ∧ q ∣ powerSum p q\n\n/-- The set of exceptional prime values of `q` for a fixed `p`. -/\ndef exceptionalPrimes (p : ℕ) : Set ℕ :=\n {q | IsExceptionalPrime p q}\n\n/-- The asserted theorem: for every prime `p`, only finitely many primes `q` make\nthe sum `∑_{k=1}^{⌊q/p⌋} k^(p-1)` divisible by `q`. Equivalently, for all but\nfinitely many primes `q`, that sum is not divisible by `q`. -/\ndef Target : Prop :=\n ∀ p : ℕ, Nat.Prime p → Set.Finite (exceptionalPrimes p)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "107234ba-a6ff-50ec-b650-1532fc4e1916", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8129c6149a1e57d892b0a097457f143c181e3e2f36767e462fbf3a206a568e66", "task_path": "tasks/nmp3_107234ba-a6ff-50ec-b650-1532fc4e1916", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "107234ba-a6ff-50ec-b650-1532fc4e1916", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_108dad43-91c7-5175-a33d-aaed11f671da", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) satisfy \\(a^{2}+b^{2}+c^{2}+2abc=1\\). Prove that \n-- \\[\n-- \\frac{1}{(a+b+c)^{2}}+\\frac{1}{9\\,(a^{2}+b^{2}+c^{2})}\\ge \\frac{16}{27}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of an inequality under a positive-variable constraint\n\nThe original problem asks to prove an inequality for positive real numbers\n`a`, `b`, and `c` satisfying\n`a ^ 2 + b ^ 2 + c ^ 2 + 2 * a * b * c = 1`.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition on the three real variables from the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a ^ 2 + b ^ 2 + c ^ 2 + 2 * a * b * c = 1\n\n/-- The inequality asserted by the problem, as a proposition to be proved. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n 1 / (a + b + c) ^ 2 +\n 1 / (9 * (a ^ 2 + b ^ 2 + c ^ 2)) ≥\n (16 : ℝ) / 27\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "108dad43-91c7-5175-a33d-aaed11f671da", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "332205921fe878ab81a361a0ed86222bde9b54a7f1451f28a37b615883647a0d", "task_path": "tasks/nmp3_108dad43-91c7-5175-a33d-aaed11f671da", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "108dad43-91c7-5175-a33d-aaed11f671da", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_109e15d7-fbf3-57d7-b47c-b9c35e14e8a4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For non‑negative real numbers $a,b,c,d$, prove that \n-- \\[\n-- \\prod_{\\text{sym}}\\left(\\frac{a+b}{2}\\right)\\;\\ge\\;\\left(\\frac{abc+abd+acd+bcd}{4}\\right)^{2},\n-- \\] \n-- where the symmetric product $\\prod_{\\text{sym}}$ is taken over all unordered pairs $\\{a,b\\},\\{a,c\\},\\{a,d\\},\\{b,c\\},\\{b,d\\},\\{c,d\\}$, i.e. \n-- \\[\n-- \\prod_{\\text{sym}}\\left(\\frac{a+b}{2}\\right)=\\left(\\frac{a+b}{2}\\right)\\!\\left(\\frac{a+c}{2}\\right)\\!\\left(\\frac{a+d}{2}\\right)\\!\\left(\\frac{b+c}{2}\\right)\\!\\left(\\frac{b+d}{2}\\right)\\!\\left(\\frac{c+d}{2}\\right).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: symmetric-pair-product inequality for four nonnegative reals\n\nThis file formalizes the problem statement only. The target proposition is a\n`Prop`-valued definition; no proof of it is supplied here.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The product of the six averages over unordered pairs drawn from `a`, `b`,\n`c`, and `d`, written out in the order displayed in the problem. -/\ndef SymmetricPairAverageProduct (a b c d : ℝ) : ℝ :=\n ((a + b) / (2 : ℝ)) * ((a + c) / (2 : ℝ)) * ((a + d) / (2 : ℝ)) *\n ((b + c) / (2 : ℝ)) * ((b + d) / (2 : ℝ)) * ((c + d) / (2 : ℝ))\n\n/-- The numerator `abc + abd + acd + bcd` occurring on the right-hand side. -/\ndef TripleProductSum (a b c d : ℝ) : ℝ :=\n a * b * c + a * b * d + a * c * d + b * c * d\n\n/-- For all nonnegative real numbers `a`, `b`, `c`, and `d`, the product of the six\naverages of unordered pairs is at least the square of one quarter of\n`abc + abd + acd + bcd`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c → 0 ≤ d →\n SymmetricPairAverageProduct a b c d ≥\n (TripleProductSum a b c d / (4 : ℝ)) ^ (2 : ℕ)\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "109e15d7-fbf3-57d7-b47c-b9c35e14e8a4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c2a5f0b4cfcf538134e98d499de33d4cdd32919103fab9bef1feee220167bb44", "task_path": "tasks/nmp3_109e15d7-fbf3-57d7-b47c-b9c35e14e8a4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "109e15d7-fbf3-57d7-b47c-b9c35e14e8a4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_10adf3f8-b33e-50f5-83cd-f8ca810abf04", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose that $f$ and $g$ are functions defined on the set of positive integers and taking positive integer values. Assume that for every positive integer $n$ the two relations \n-- \\[f(g(n))=f(n)+1\\qquad\\text{and}\\qquad g(f(n))=g(n)+1\\] \n-- hold. Prove that $f(n)=g(n)$ for all positive integers $n$.\nimport Mathlib.Data.PNat.Basic\n\n/-!\n# Functional equations on the positive integers\n\nThis file formalizes the statement of the problem. The theorem itself is\nrepresented by the proposition `Problem.Target`; no proof is included here.\n-/\n\nnamespace Problem\n\n/-- The assumed system of functional equations.\n\nFor every positive integer `n`, both\n`f (g n) = f n + 1` and `g (f n) = g n + 1` hold. -/\ndef FunctionalEquations (f g : ℕ+ → ℕ+) : Prop :=\n ∀ n : ℕ+, f (g n) = f n + 1 ∧ g (f n) = g n + 1\n\n/-- The assertion of the problem: if positive-integer-valued functions `f` and\n`g` on the positive integers satisfy both functional equations at every\npositive integer `n`, then `f n = g n` for every positive integer `n`. -/\ndef Target : Prop :=\n ∀ (f g : ℕ+ → ℕ+),\n FunctionalEquations f g →\n ∀ n : ℕ+, f n = g n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "10adf3f8-b33e-50f5-83cd-f8ca810abf04", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6bef3265334329d1c6e2131fca15e7f87a4f68c191631ccc71f6ed703aeec8dd", "task_path": "tasks/nmp3_10adf3f8-b33e-50f5-83cd-f8ca810abf04", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "10adf3f8-b33e-50f5-83cd-f8ca810abf04", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_10ef41ac-8e55-50fa-9233-82cc10119a5d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be the side lengths of a (non‑degenerate) triangle and suppose\n-- \\[\n-- a^{3}+b^{3}+c^{3}=3.\n-- \\]\n-- Prove that\n-- \\[\n-- \\frac{a^{3}}{a^{2}+ab+b^{2}}+\\frac{b^{3}}{b^{2}+bc+c^{2}}+\\frac{c^{3}}{c^{2}+ca+a^{2}}\\ge 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion that `a`, `b`, and `c` are the side lengths of a\nnon-degenerate triangle. Concretely, the side lengths are positive and\nsatisfy the three strict triangle inequalities. -/\ndef IsNondegenerateTriangle (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The hypotheses of the problem: `a`, `b`, and `c` are side lengths of a\nnon-degenerate triangle and their cubes sum to `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n IsNondegenerateTriangle a b c ∧ a ^ 3 + b ^ 3 + c ^ 3 = (3 : ℝ)\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n a ^ 3 / (a ^ 2 + a * b + b ^ 2) +\n b ^ 3 / (b ^ 2 + b * c + c ^ 2) +\n c ^ 3 / (c ^ 2 + c * a + a ^ 2)\n\n/-- The target proposition of the problem: for every triple of real numbers\nthat is admissible in the sense above, the stated cyclic sum is at least one. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LeftHandSide a b c ≥ (1 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "10ef41ac-8e55-50fa-9233-82cc10119a5d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e615518cd5aa8dc1fea085e2eaa42c9b66a3e5357b81949a378aaa402c9d6120", "task_path": "tasks/nmp3_10ef41ac-8e55-50fa-9233-82cc10119a5d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "10ef41ac-8e55-50fa-9233-82cc10119a5d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_10f6e9de-677b-583e-b25f-6086e266a2b5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle with circumcenter $O$ and circumcircle $(O)$. Let the tangent to $(O)$ at $A$ intersect $BC$ at $E$. Let $P$ be an interior point of $\\triangle ABC$ such that the lines $AP$, $BP$, $CP$ meet $(O)$ again at $H$, $I$, $K$, respectively. If $HI = HK$, prove that $EA = EP$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.Convex.Basic\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\n/-!\n# Formal statement of the geometry problem\n\nWe work in the real Euclidean plane `EuclideanSpace ℝ (Fin 2)`.\nThe statement is a universal implication: for every configuration satisfying\nthe hypotheses of the problem, if `HI = HK`, then `EA = EP`.\n-/\n\nnamespace Problem\n\n/-- The ambient Euclidean plane. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Three points are the vertices of a nondegenerate triangle when they are\nnot collinear. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- `O` is a circumcenter of the triangle with vertices `A`, `B`, and `C`:\nit is equidistant from all three vertices. Noncollinearity of the vertices\nmakes this the usual unique circumcenter. -/\ndef IsCircumcenter (O A B C : Plane) : Prop :=\n dist O A = dist O B ∧ dist O B = dist O C\n\n/-- `X` lies on the affine line through `A` and `B`. -/\ndef OnLine (X A B : Plane) : Prop :=\n X ∈ line[ℝ, A, B]\n\n/-- `P` is an interior point of the triangle with vertices `A`, `B`, and `C`.\nThis is membership in the topological interior of the convex hull of the three\nvertices, so boundary points are excluded. -/\ndef IsInteriorPointOfTriangle (P A B C : Plane) : Prop :=\n P ∈ interior (convexHull ℝ ({A, B, C} : Set Plane))\n\n/-- `X` lies on the circle centered at `O` and passing through `A`. -/\ndef OnCircle (O A X : Plane) : Prop :=\n dist O X = dist O A\n\n/-- `E` lies on the tangent line to the circle centered at `O` through `A`\nat the point `A`. The tangent is the line through `A` perpendicular to the\nradius `OA`. -/\ndef OnTangentAt (O A E : Plane) : Prop :=\n inner ℝ (A - O) (E - A) = 0\n\n/-- `X` is the second intersection of the line through the vertex `B` and `P`\nwith the circle centered at `O` through `A`. The vertex `B` is the first\nintersection; the condition `X ≠ B` selects the other one. The circle is\nanchored at `A` so that all three secants use the same circumcircle. -/\ndef IsSecondIntersection (O A B P X : Plane) : Prop :=\n OnLine X B P ∧ OnCircle O A X ∧ X ≠ B\n\n/-- The complete configuration in the problem. The arguments are ordered as\n`A B C O E P H I K`. -/\ndef Configuration\n (A B C O E P H I K : Plane) : Prop :=\n IsTriangle A B C ∧\n IsCircumcenter O A B C ∧\n OnTangentAt O A E ∧\n OnLine E B C ∧\n IsInteriorPointOfTriangle P A B C ∧\n IsSecondIntersection O A A P H ∧\n IsSecondIntersection O A B P I ∧\n IsSecondIntersection O A C P K\n\n/-- The target assertion: in every configuration as above, the hypothesis\n`HI = HK` implies the conclusion `EA = EP`. Here all segment names denote\nordinary Euclidean distances. -/\ndef Target : Prop :=\n ∀ A B C O E P H I K : Plane,\n Configuration A B C O E P H I K →\n dist H I = dist H K →\n dist E A = dist E P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "10f6e9de-677b-583e-b25f-6086e266a2b5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "be6c81e03ad6e613adf12ba490bcd90f83953a490f4c61bc7129ca618cae34bd", "task_path": "tasks/nmp3_10f6e9de-677b-583e-b25f-6086e266a2b5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "10f6e9de-677b-583e-b25f-6086e266a2b5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_11023349-f0d2-5d3b-96e5-be68b0a58930", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Does there exist an infinite sequence of positive integers \\((a_n)_{n\\ge 0}\\) such that \n-- \n-- 1. \\(\\gcd(a_i,a_j)=1\\) for all \\(i\\neq j\\) (the terms are pairwise coprime), and \n-- \n-- 2. for every \\(n\\ge 0\\) the polynomial \n-- \\[\n-- P_n(x)=\\sum_{i=0}^{n} a_i x^i\n-- \\] \n-- is irreducible over \\(\\mathbb Z[x]\\) (i.e., irreducible in \\(\\mathbb Z[x]\\))? \n-- \n-- Provide a construction or proof of existence.\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- A sequence `a : ℕ → ℕ` is pairwise coprime: distinct indices give coprime terms. -/\ndef PairwiseCoprime (a : ℕ → ℕ) : Prop :=\n ∀ i j : ℕ, i ≠ j → Nat.Coprime (a i) (a j)\n\n/-- The partial polynomial\n`P_n(x) = ∑_{i=0}^{n} a_i x^i`, regarded as an element of `ℤ[x]`. -/\nnoncomputable def PartialPolynomial (a : ℕ → ℕ) (n : ℕ) : Polynomial ℤ :=\n ∑ i ∈ Finset.range (n + 1), Polynomial.C (a i : ℤ) * Polynomial.X ^ i\n\n/-- Every term of the sequence is a positive integer. -/\ndef PositiveSequence (a : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, 0 < a n\n\n/-- Every partial polynomial of the sequence is irreducible in `ℤ[x]`. -/\nnoncomputable def AllPartialPolynomialsIrreducible (a : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, Irreducible (PartialPolynomial a n)\n\n/-- The admissibility predicate for a sequence in the problem. -/\ndef IsAdmissibleSequence (a : ℕ → ℕ) : Prop :=\n PositiveSequence a ∧\n PairwiseCoprime a ∧\n AllPartialPolynomialsIrreducible a\n\n/-- The existence statement of the problem. -/\ndef Target : Prop :=\n ∃ a : ℕ → ℕ, IsAdmissibleSequence a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11023349-f0d2-5d3b-96e5-be68b0a58930", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "769942629a6e2a3bc5edab9abf36a66d7085615b032158551ee3e769290a5568", "task_path": "tasks/nmp3_11023349-f0d2-5d3b-96e5-be68b0a58930", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11023349-f0d2-5d3b-96e5-be68b0a58930", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_11230de4-1479-58cf-b91b-e9c0914b87bd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x$, $y$, $z$ be positive real numbers such that $x+y+z=1$. Prove that \n-- \\[\n-- x\\sqrt{\\frac{y}{\\,x+z\\,}}+y\\sqrt{\\frac{z}{\\,x+y\\,}}+z\\sqrt{\\frac{x}{\\,y+z\\,}}\\le\\frac{\\sqrt2}{2}.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\ndef lhs (x y z : ℝ) : ℝ :=\n x * Real.sqrt (y / (x + z)) +\n y * Real.sqrt (z / (x + y)) +\n z * Real.sqrt (x / (y + z))\n\n/-- The assertion that for every positive real triple summing to one, the stated\ninequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z → x + y + z = 1 →\n lhs x y z ≤ (Real.sqrt 2) / 2\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11230de4-1479-58cf-b91b-e9c0914b87bd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b89f6b3b5479bf0146cea201ee55b3e75ccbff568522bbb80a17a7c43d94775d", "task_path": "tasks/nmp3_11230de4-1479-58cf-b91b-e9c0914b87bd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11230de4-1479-58cf-b91b-e9c0914b87bd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_11483078-9485-5b98-9e17-3ec8f87547da", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{a^{2}+bc}{\\sqrt{\\bigl(a^{3}+bc(b+c)\\bigr)\\bigl(abc+bc(b+c)\\bigr)}}\\ge\\frac{6}{a+b+c}\\, .\n-- \\] \n-- (The sum is taken over the cyclic permutations of $(a,b,c)$.)\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThe source problem asks to prove a cyclic inequality for positive real numbers.\nThe cyclic sum is written as an explicit sum of the three cyclic shifts of\n`(a, b, c)`.\n-/\n\nnamespace Problem\n\n/-- One summand of the cyclic sum in the problem, with variables in the order\n`(a, b, c)`. -/\nnoncomputable def cyclicTerm (a b c : ℝ) : ℝ :=\n (a ^ 2 + b * c) /\n Real.sqrt ((a ^ 3 + b * c * (b + c)) *\n (a * b * c + b * c * (b + c)))\n\n/-- The cyclic sum over the three cyclic permutations of `(a, b, c)`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The assertion to be proved: for all positive real `a`, `b`, and `c`,\nthe cyclic sum is at least `6 / (a + b + c)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n cyclicSum a b c ≥ 6 / (a + b + c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11483078-9485-5b98-9e17-3ec8f87547da", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d165d14b7bc46de1c5762b4a5c76b32943f2d547ec04ef9a12bdfe7c95fb95f0", "task_path": "tasks/nmp3_11483078-9485-5b98-9e17-3ec8f87547da", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11483078-9485-5b98-9e17-3ec8f87547da", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_114efe23-1265-54dd-9c44-a4531847b29c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^2+b^2+c^2=3$. Prove that \n-- \\[\n-- \\frac{a}{b^2+c^2+7bc+3}+\\frac{b}{c^2+a^2+7ca+3}+\\frac{c}{a^2+b^2+7ab+3}\\le\\frac{3}{4abc\\,(ab+bc+ca)}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the cyclic inequality\n\nThe source problem asks to prove an inequality for three positive real numbers\n`a`, `b`, and `c` whose squared sum is `3`.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissibility conditions on `a`, `b`, and `c`: all are positive and\ntheir squared sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 2 + b ^ 2 + c ^ 2 = 3\n\n/-- The left-hand side of the desired inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a / (b ^ 2 + c ^ 2 + 7 * b * c + 3) +\n b / (c ^ 2 + a ^ 2 + 7 * c * a + 3) +\n c / (a ^ 2 + b ^ 2 + 7 * a * b + 3)\n\n/-- The right-hand side of the desired inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 3 / (4 * a * b * c * (a * b + b * c + c * a))\n\n/-- The asserted pointwise inequality. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ rhs a b c\n\n/-- The complete statement of the source problem: for every triple of positive\nreal numbers satisfying `a^2 + b^2 + c^2 = 3`, the cyclic fractional\ninequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "114efe23-1265-54dd-9c44-a4531847b29c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c934ba05fd1d2cb42d43bf2c626fda34dac77ae231fc64bdcfcd8c3c95d8978f", "task_path": "tasks/nmp3_114efe23-1265-54dd-9c44-a4531847b29c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "114efe23-1265-54dd-9c44-a4531847b29c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_117ac380-fea6-597d-8439-a60013ed115d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $x,y,z$, prove that \n-- $$3\\Big(\\sum_{\\text{cyc}}y^{2}z\\Big)\\Big(\\sum_{\\text{cyc}}yz^{2}\\Big)\\ge xyz\\Big(\\sum_{\\text{cyc}}x\\Big)^{3}.$$ \n-- Here $\\displaystyle\\sum_{\\text{cyc}}y^{2}z=x^{2}y+y^{2}z+z^{2}x$ and $\\displaystyle\\sum_{\\text{cyc}}yz^{2}=xy^{2}+yz^{2}+zx^{2}\\,. $\nimport Mathlib\n\nnamespace Problem\n\n/-- The first cyclic sum from the problem:\n`∑_cyc y² z = x² y + y² z + z² x`. -/\ndef cyclicSumY2Z (x y z : ℝ) : ℝ :=\n x ^ 2 * y + y ^ 2 * z + z ^ 2 * x\n\n/-- The second cyclic sum from the problem:\n`∑_cyc y z² = x y² + y z² + z x²`. -/\ndef cyclicSumYZ2 (x y z : ℝ) : ℝ :=\n x * y ^ 2 + y * z ^ 2 + z * x ^ 2\n\n/-- For all positive real numbers `x`, `y`, and `z`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z →\n 3 * cyclicSumY2Z x y z * cyclicSumYZ2 x y z ≥\n x * y * z * (x + y + z) ^ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "117ac380-fea6-597d-8439-a60013ed115d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "877bad54c42db8439a1b0d77ab52b2d3bc2c9b9904dc1b353a5d069d26dbd811", "task_path": "tasks/nmp3_117ac380-fea6-597d-8439-a60013ed115d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "117ac380-fea6-597d-8439-a60013ed115d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1190df83-00e5-58fe-bff9-1cfcc4b4a882", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c,d>0\\) with \\(abcd=1\\). Let \\(p,q\\ge0\\) satisfy \\(p+q=3\\). Prove that \n-- \\[\n-- \\frac{1}{1+pa+qa^{2}}+\\frac{1}{1+pb+qb^{2}}+\\frac{1}{1+pc+qc^{2}}+\\frac{1}{1+pd+qd^{2}}\\ge1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The summand `1 / (1 + p*x + q*x^2)` appearing in the inequality. -/\nnoncomputable def summand (p q x : ℝ) : ℝ :=\n 1 / (1 + p * x + q * x ^ 2)\n\n/-- The assertion of the problem: for all positive reals `a`, `b`, `c`, `d`\nwith `a*b*c*d = 1`, and all nonnegative reals `p`, `q` with `p + q = 3`,\nthe four-term sum of the displayed rational expressions is at least `1`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d →\n a * b * c * d = 1 →\n ∀ p q : ℝ,\n 0 ≤ p → 0 ≤ q → p + q = 3 →\n summand p q a + summand p q b + summand p q c + summand p q d ≥ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1190df83-00e5-58fe-bff9-1cfcc4b4a882", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7115b3871e8092474eaf7dcbd6d6fd4e1ed4f75853d16dc5115ddf7b44b1c127", "task_path": "tasks/nmp3_1190df83-00e5-58fe-bff9-1cfcc4b4a882", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1190df83-00e5-58fe-bff9-1cfcc4b4a882", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_11a6c33e-12e7-5a17-ae69-ffe858628cc3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$ and $b$ be integers with $a\\ge3$ and $b\\ge3$, and suppose $a^{\\,b}+1$ is a perfect square. Let $m$ denote the number of distinct prime factors of $a$, and $n$ denote the number of distinct prime factors of $b$. Prove that $m\\ge n+2$.\nimport Mathlib\n\n/-!\nThis file formalizes the statement of the target problem. The target is\nrecorded as a proposition-valued definition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- An integer is a perfect square if it is the square of an integer. -/\ndef IsPerfectSquare (z : ℤ) : Prop :=\n ∃ x : ℤ, z = x ^ 2\n\n/-- The number of distinct prime factors of an integer.\n\nFor a positive integer, this is the cardinality of the finite set of primes\ndividing it. Taking `natAbs` gives the standard extension to all integers\n(although the hypotheses `3 ≤ a` and `3 ≤ b` make both inputs positive). -/\ndef distinctPrimeFactorCount (z : ℤ) : ℕ :=\n z.natAbs.primeFactors.card\n\n/-- The assertion of the problem: if integers `a` and `b` are both at least\n`3` and `a ^ b + 1` is a perfect square, then the number of distinct prime\nfactors of `a` is at least the number of distinct prime factors of `b` plus\ntwo.\n\nThe exponent in `a ^ b` is the natural-number representative `b.toNat` of the\ninteger `b`; under the hypothesis `3 ≤ b` this is the ordinary integer\nexponent. -/\ndef Target : Prop :=\n ∀ a b : ℤ, 3 ≤ a → 3 ≤ b →\n IsPerfectSquare (a ^ b.toNat + 1) →\n distinctPrimeFactorCount a ≥ distinctPrimeFactorCount b + 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11a6c33e-12e7-5a17-ae69-ffe858628cc3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "88803e45b738d494de8642b11befc158730a1f9a8bd79db8db7e1cb41315d6e4", "task_path": "tasks/nmp3_11a6c33e-12e7-5a17-ae69-ffe858628cc3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11a6c33e-12e7-5a17-ae69-ffe858628cc3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_11acaf25-dad8-5d59-8c86-edfb750bb6dd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with $a+b+c=3$ and $ab+bc+ca>0$. Prove that \n-- \\[\n-- \\frac{a^2}{b^2+bc+c^2}+\\frac{b^2}{c^2+ca+a^2}+\\frac{c^2}{a^2+ab+b^2}+6\\;\\ge\\;\\frac{5}{3}\\,(a^2+b^2+c^2)+2abc\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThis file states the inequality from `problem.md`. It records only the\nmathematical proposition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on real numbers `a`, `b`, and `c`:\nthey are nonnegative, have sum `3`, and satisfy `ab + bc + ca > 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a + b + c = 3 ∧ 0 < a * b + b * c + c * a\n\n/-- The asserted inequality, with real division, for a fixed admissible triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a ^ 2 / (b ^ 2 + b * c + c ^ 2) +\n b ^ 2 / (c ^ 2 + c * a + a ^ 2) +\n c ^ 2 / (a ^ 2 + a * b + b ^ 2) + 6 ≥\n (5 / 3 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2) + 2 * a * b * c\n\n/-- The full universally quantified statement of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11acaf25-dad8-5d59-8c86-edfb750bb6dd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f3ad98c3129d892eedcc4d3acd7bff391c0f0824bbd7f1d487cf0ae0faec621d", "task_path": "tasks/nmp3_11acaf25-dad8-5d59-8c86-edfb750bb6dd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11acaf25-dad8-5d59-8c86-edfb750bb6dd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_11b3d579-0105-536b-abbc-71eeb48bdfdc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge0$ be real numbers such that $x+y+z=3$. Prove that \n-- $$xyz\\bigl(xy^2+yz^2+zx^2\\bigr)\\;+\\;3\\bigl(x^2y+y^2z+z^2x\\bigr)\\le12.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\ndef lhs (x y z : ℝ) : ℝ :=\n (x * y * z) * (x * y ^ 2 + y * z ^ 2 + z * x ^ 2)\n + (3 : ℝ) * (x ^ 2 * y + y ^ 2 * z + z ^ 2 * x)\n\n/-- The three variables are nonnegative real numbers. -/\ndef Nonnegative (x y z : ℝ) : Prop :=\n 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z\n\n/-- The sum of the three real variables is `3`. -/\ndef SumEqualsThree (x y z : ℝ) : Prop :=\n x + y + z = (3 : ℝ)\n\n/-- The admissibility conditions on the real variables in the problem statement. -/\ndef Admissible (x y z : ℝ) : Prop :=\n Nonnegative x y z ∧ SumEqualsThree x y z\n\n/-- The assertion to be proved: for all nonnegative real `x`, `y`, and `z` with sum 3,\nthe displayed polynomial expression is at most 12. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → lhs x y z ≤ (12 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11b3d579-0105-536b-abbc-71eeb48bdfdc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f6ab63f3e3ec5860fa79827a3ba3dc7fbf52efe1f21b824a4167680c1916e463", "task_path": "tasks/nmp3_11b3d579-0105-536b-abbc-71eeb48bdfdc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11b3d579-0105-536b-abbc-71eeb48bdfdc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_11bee2be-8e0c-5a2b-8338-95c3b29d8008", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^{2}+b^{2}+c^{2}=3$. Prove that \n-- \\[\n-- \\frac1{a^{5}+1}+\\frac1{b^{5}+1}+\\frac1{c^{5}+1}\\ge\\frac32\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility conditions for triples `(a, b, c)` in the problem:\nthey are positive real numbers satisfying `a^2 + b^2 + c^2 = 3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 2 + b ^ 2 + c ^ 2 = 3\n\n/-- The inequality asserted in the problem for a triple `(a, b, c)`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n 1 / (a ^ 5 + 1) + 1 / (b ^ 5 + 1) + 1 / (c ^ 5 + 1) ≥ (3 : ℝ) / 2\n\n/-- The full statement: for every positive real triple `(a, b, c)` with\n`a^2 + b^2 + c^2 = 3`, the displayed sum of reciprocals is at least `3/2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11bee2be-8e0c-5a2b-8338-95c3b29d8008", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "730b99ff56675e1a5b3c47a288547fc0d387a62ba752edbdedb9362a765eea3b", "task_path": "tasks/nmp3_11bee2be-8e0c-5a2b-8338-95c3b29d8008", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11bee2be-8e0c-5a2b-8338-95c3b29d8008", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_11d54216-2f47-59d2-9127-5e8a8df1d744", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $\\displaystyle\\frac{1}{a}+\\frac{1}{b}+\\frac{1}{c}=a+b+c$. Prove that \n-- \\[\n-- \\frac{1}{2a+3b+4c}+\\frac{1}{2b+3c+4a}+\\frac{1}{2c+3a+4b}\\le\\frac13.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the given inequality problem\n\nThe original problem asks, for positive real numbers `a`, `b`, and `c` satisfying\n\n`1 / a + 1 / b + 1 / c = a + b + c`,\n\nto prove the cyclic inequality\n\n`1 / (2a + 3b + 4c) + 1 / (2b + 3c + 4a) + 1 / (2c + 3a + 4b) ≤ 1 / 3`.\n\nThe declaration below records the universally quantified proposition to be proved.\nIt contains no proof.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: every triple of positive real numbers satisfying\nthe reciprocal-sum condition obeys the stated cyclic inequality. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 1 / a + 1 / b + 1 / c = a + b + c →\n 1 / (2 * a + 3 * b + 4 * c) +\n 1 / (2 * b + 3 * c + 4 * a) +\n 1 / (2 * c + 3 * a + 4 * b) ≤\n (1 / 3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11d54216-2f47-59d2-9127-5e8a8df1d744", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b04f85d588dd81bd1a684f9d68c53cd5c008a19fb20a81119e938dd47f34c5ab", "task_path": "tasks/nmp3_11d54216-2f47-59d2-9127-5e8a8df1d744", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "11d54216-2f47-59d2-9127-5e8a8df1d744", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1206693c-2e1c-5e45-8f10-9e32bccd9752", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ and $q$ be two coprime positive integers. A frog hops along the integer line, moving either $p$ units to the right or $q$ units to the left on each hop. Assume the frog eventually returns to its starting point. Prove that for every positive integer $d$ with $d0\\). Prove that \n-- \\[\n-- \\frac34+\\frac{abc}{a^{2}b+b^{2}c+c^{2}a+abc}\\ge \\frac{3(ab+bc+ca)}{(a+b+c)^{2}}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of a three-variable positive-real inequality\n\nThe source problem asks, for all positive real numbers `a`, `b`, and `c`, to prove\nthe stated inequality. This file records that proposition; it does not provide a\nproof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (3 / 4 : ℝ) +\n (a * b * c) / (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a + a * b * c)\n\n/-- The right-hand side of the inequality in the source problem. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (3 * (a * b + b * c + c * a)) / (a + b + c) ^ 2\n\n/-- For all positive real numbers `a`, `b`, and `c`,\n`3/4 + abc/(a^2 b + b^2 c + c^2 a + abc) >= 3(ab + bc + ca)/(a+b+c)^2`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1270feab-69ce-5bc2-bb19-c253b4c65753", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "66215fa346c16f6ecd16c0f72dcb461d4d6b36d8187547c4e618e44696bfb435", "task_path": "tasks/nmp3_1270feab-69ce-5bc2-bb19-c253b4c65753", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1270feab-69ce-5bc2-bb19-c253b4c65753", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_127c4af8-860a-5b2f-b105-4c9f969edab8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,\\;y,\\;z\\ge0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\sqrt{(x+z)(x+y)}\\;\\ge\\;x+y+z\\;+\\;\\sqrt3\\,\\sqrt{xy+yz+zx},\n-- \\] \n-- where $\\displaystyle\\sum_{\\text{cyc}}$ denotes the cyclic sum \n-- $\\sqrt{(x+z)(x+y)}+\\sqrt{(y+x)(y+z)}+\\sqrt{(z+y)(z+x)}\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the cyclic square-root inequality\n\nThe source problem asks one to prove, for nonnegative real numbers `x`, `y`, and\n`z`, the inequality\n\n`sqrt ((x + z) * (x + y)) + sqrt ((y + x) * (y + z))\n + sqrt ((z + y) * (z + x))\n >= x + y + z + sqrt 3 * sqrt (x * y + y * z + z * x)`.\n\nThe declarations below only state the theorem; they do not prove it.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The three nonnegativity hypotheses from `x, y, z ≥ 0`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z\n\n/-- The cyclic left-hand side, with the terms written in the order displayed in\nthe source problem. -/\ndef CyclicSum (x y z : ℝ) : ℝ :=\n Real.sqrt ((x + z) * (x + y)) +\n Real.sqrt ((y + x) * (y + z)) +\n Real.sqrt ((z + y) * (z + x))\n\n/-- The right-hand side of the displayed inequality. -/\ndef RightHandSide (x y z : ℝ) : ℝ :=\n x + y + z + Real.sqrt 3 * Real.sqrt (x * y + y * z + z * x)\n\n/-- The displayed inequality for one fixed triple of nonnegative real numbers. -/\ndef Inequality (x y z : ℝ) : Prop :=\n CyclicSum x y z ≥ RightHandSide x y z\n\n/-- The complete universally quantified statement of the source problem:\nfor every triple of real numbers with `x ≥ 0`, `y ≥ 0`, and `z ≥ 0`, the\ndisplayed cyclic square-root inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "127c4af8-860a-5b2f-b105-4c9f969edab8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5bdc1cc1388c4fcf1930a70bf37601915d7c0a3e258bc5944688474de991a3c9", "task_path": "tasks/nmp3_127c4af8-860a-5b2f-b105-4c9f969edab8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "127c4af8-860a-5b2f-b105-4c9f969edab8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1289f795-7ec2-5936-9e6c-82b51e73e960", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for positive real numbers $a,b,c$ satisfying $abc=1$, the following inequality holds:\n-- \\[\n-- \\frac{a-1}{a^{2}(a^{4}+1)}+\\frac{b-1}{b^{2}(b^{4}+1)}+\\frac{c-1}{c^{2}(c^{4}+1)}\\le 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable real inequality\n\nThe source problem asks to prove an inequality for positive real numbers\n`a`, `b`, and `c` whose product is one. This file contains the statement\nonly; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- One summand of the left-hand side of the target inequality. -/\nnoncomputable def inequalityTerm (x : ℝ) : ℝ :=\n (x - 1) / (x ^ 2 * (x ^ 4 + 1))\n\n/-- The complete left-hand side of the target inequality. -/\nnoncomputable def inequalityLHS (a b c : ℝ) : ℝ :=\n inequalityTerm a + inequalityTerm b + inequalityTerm c\n\n/--\nFor all positive real numbers `a`, `b`, and `c` satisfying `a * b * c = 1`,\nthe sum of the three displayed fractions is at most zero.\n-/\ndef Target : Prop :=\n ∀ a : ℝ,\n ∀ b : ℝ,\n ∀ c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n inequalityLHS a b c ≤ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1289f795-7ec2-5936-9e6c-82b51e73e960", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8944e0655ac45943f595767fda2ffffdb28e6fb92dc0cd497b317fda4467bee7", "task_path": "tasks/nmp3_1289f795-7ec2-5936-9e6c-82b51e73e960", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1289f795-7ec2-5936-9e6c-82b51e73e960", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_128e14a5-7c88-5f8c-840e-6ea0862c5792", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exist functions $f,g:\\mathbb{R}\\to\\mathbb{R}$ such that the composition $f\\circ g$ is strictly decreasing on $\\mathbb{R}$ and the composition $g\\circ f$ is strictly increasing on $\\mathbb{R}$.\nimport Mathlib\n\nnamespace Problem\n\n/-- A real-valued function is strictly decreasing on all of `ℝ`. -/\ndef StrictlyDecreasingOnReal (h : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, x < y → h y < h x\n\n/-- A real-valued function is strictly increasing on all of `ℝ`. -/\ndef StrictlyIncreasingOnReal (h : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, x < y → h x < h y\n\n/-- There exist functions `f g : ℝ → ℝ` whose composition `f ∘ g` is strictly\ndecreasing on `ℝ` and whose composition `g ∘ f` is strictly increasing on `ℝ`. -/\ndef Target : Prop :=\n ∃ f g : ℝ → ℝ,\n StrictlyDecreasingOnReal (f ∘ g) ∧\n StrictlyIncreasingOnReal (g ∘ f)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "128e14a5-7c88-5f8c-840e-6ea0862c5792", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cf85c9ff14a91f44e82ad3be02706657668cc0e063229ade2574951086e7dfa4", "task_path": "tasks/nmp3_128e14a5-7c88-5f8c-840e-6ea0862c5792", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "128e14a5-7c88-5f8c-840e-6ea0862c5792", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_128f94af-258b-5c61-8ef3-299e589032b5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real positive numbers satisfying $a^2+b^2+c^2=1$. Prove that\n-- \\[\n-- \\sqrt{a+b}+\\sqrt{b+c}+\\sqrt{c+a}\\ge \\sqrt{7(a+b+c)-3}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the square-root inequality\n\nThe source problem asks to prove, for positive real numbers `a b c`\nwith `a^2 + b^2 + c^2 = 1`, the inequality\n`sqrt (a+b) + sqrt (b+c) + sqrt (c+a) >= sqrt (7*(a+b+c) - 3)`.\n-/\n\nnamespace Problem\n\n/--\nFor all real positive `a`, `b`, and `c` satisfying\n`a^2 + b^2 + c^2 = 1`, the sum of the square roots of the pairwise sums\nis at least the square root of `7 * (a + b + c) - 3`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = 1 →\n Real.sqrt (a + b) + Real.sqrt (b + c) + Real.sqrt (c + a) ≥\n Real.sqrt (7 * (a + b + c) - 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "128f94af-258b-5c61-8ef3-299e589032b5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e14223261362c1d7ed51f5f76fd332846570f747e70a8ad4baba957d8834473d", "task_path": "tasks/nmp3_128f94af-258b-5c61-8ef3-299e589032b5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "128f94af-258b-5c61-8ef3-299e589032b5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_12a799bf-de47-5e98-875a-c8ebde61c497", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{1}{a^3+2abc}+\\frac{1}{b^3+2abc}+\\frac{1}{c^3+2abc}\\ge\\frac{a^2+b^2+c^2}{3}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three variables are strictly positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The sum constraint on the three real variables. -/\ndef SumEqThree (a b c : ℝ) : Prop :=\n a + b + c = (3 : ℝ)\n\n/-- The admissibility assumptions for the real variables in the problem:\n`a`, `b`, and `c` are positive and have sum `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositiveTriple a b c ∧ SumEqThree a b c\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (1 : ℝ) / (a ^ 3 + 2 * a * b * c) +\n (1 : ℝ) / (b ^ 3 + 2 * a * b * c) +\n (1 : ℝ) / (c ^ 3 + 2 * a * b * c)\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) / (3 : ℝ)\n\n/-- The displayed non-strict inequality for a fixed admissible triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The proposition asserted in the problem: for all positive real numbers\n`a`, `b`, and `c` with `a + b + c = 3`, the displayed sum of reciprocal\ndenominators is at least `(a^2 + b^2 + c^2) / 3`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "12a799bf-de47-5e98-875a-c8ebde61c497", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dd9ad1e6ef1f445c329477ea29a1820dc19bdb88a11187f004fe48bde5f20966", "task_path": "tasks/nmp3_12a799bf-de47-5e98-875a-c8ebde61c497", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "12a799bf-de47-5e98-875a-c8ebde61c497", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_12d91e2a-4ad4-50b9-b3aa-8c6bf3be1ce4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 3$ be an integer and let $x_1,x_2,\\dots,x_n$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{x_{1}}{x_{2}+x_{3}}+\\frac{x_{2}}{x_{3}+x_{4}}+\\cdots+\\frac{x_{n-1}}{x_{n}+x_{1}}+\\frac{x_{n}}{x_{1}+x_{2}}>(\\sqrt2-1)\\,n,\n-- \\] \n-- where the indices are taken cyclically (i.e. $x_{n+1}=x_1$, $x_{n+2}=x_2$).\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The index obtained from `i : Fin n` by adding `k` and reducing modulo `n`.\nThe value `k = 1` gives the next cyclic index, and `k = 2` gives the\nnext-next cyclic index. -/\ndef cyclicIndex (n : ℕ) (hn : 0 < n) (i : Fin n) (k : ℕ) : Fin n :=\n ⟨(i.val + k) % n, Nat.mod_lt (i.val + k) hn⟩\n\n/-- The cyclic sum\n`x 0 / (x 1 + x 2) + x 1 / (x 2 + x 3) + ... + x (n-1) / (x 0 + x 1)`,\nwhere the elements of `Fin n` are identified with the indices `1, ..., n`. -/\nnoncomputable def cyclicSum (n : ℕ) (hn : 0 < n) (x : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n,\n x i / (x (cyclicIndex n hn i 1) + x (cyclicIndex n hn i 2))\n\n/-- All entries of the finite vector `x` are positive. -/\ndef PositiveVector (n : ℕ) (x : Fin n → ℝ) : Prop :=\n ∀ i : Fin n, 0 < x i\n\n/-- The assertion of the problem: for every integer `n ≥ 3` and every vector of\n`n` positive real numbers, the indicated cyclic sum is strictly greater than\n`(sqrt 2 - 1) * n`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (hn : 3 ≤ n),\n ∀ x : Fin n → ℝ,\n PositiveVector n x →\n cyclicSum n (Nat.lt_of_lt_of_le (by norm_num : 0 < 3) hn) x >\n (Real.sqrt 2 - 1) * (n : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "12d91e2a-4ad4-50b9-b3aa-8c6bf3be1ce4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4c51cfa799ee8a15f46ac86834db07994ae5452e0323f4a0d41d7c762decbc22", "task_path": "tasks/nmp3_12d91e2a-4ad4-50b9-b3aa-8c6bf3be1ce4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "12d91e2a-4ad4-50b9-b3aa-8c6bf3be1ce4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_12d9e644-5315-5705-bb64-54746739deed", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for any integer $n$ with $n \\not\\equiv 0 \\pmod{10}$ there exists a positive multiple of $n$ whose decimal expansion contains no digit $0$.\nimport Mathlib.Data.Int.ModEq\nimport Mathlib.Data.Nat.Digits.Defs\n\nnamespace Problem\n\n/-- A natural number has no zero digit in its usual base-10 expansion.\n`Nat.digits 10 m` is Mathlib's list of decimal digits of `m`, least-significant\ndigit first. Leading zeros are not part of the usual decimal expansion, and\n`Nat.digits 10 0 = []`; the target only applies this predicate to positive\nmultiples. -/\ndef HasNoZeroDecimalDigit (m : ℕ) : Prop :=\n ∀ d : ℕ, d ∈ Nat.digits 10 m → d ≠ 0\n\n/-- `m` is a positive multiple of the integer `n`. -/\ndef IsPositiveMultipleOf (n : ℤ) (m : ℕ) : Prop :=\n 0 < m ∧ n ∣ (m : ℤ)\n\n/-- There exists a positive multiple of `n` with no zero decimal digit. -/\ndef HasNoZeroDigitMultiple (n : ℤ) : Prop :=\n ∃ m : ℕ, IsPositiveMultipleOf n m ∧ HasNoZeroDecimalDigit m\n\n/-- For every integer `n` not divisible by 10, there exists a positive\nmultiple of `n` whose decimal expansion contains no digit `0`. -/\ndef Target : Prop :=\n ∀ n : ℤ, n % 10 ≠ 0 → HasNoZeroDigitMultiple n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "12d9e644-5315-5705-bb64-54746739deed", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "afda19b64d0e0f51f083cf276d8b3adfa375ca65a8057cc11c709b0242ab766f", "task_path": "tasks/nmp3_12d9e644-5315-5705-bb64-54746739deed", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "12d9e644-5315-5705-bb64-54746739deed", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_13376348-4479-54e1-81ed-37477a38f5b8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(f:\\mathbb{N}^{+}\\to\\mathbb{N}^{+}\\) be a non‑constant function such that for all distinct positive integers \\(a,b\\) the difference \\(a-b\\) divides \\(f(a)-f(b)\\). Prove that there exist infinitely many distinct primes \\(p\\) for which there is a positive integer \\(c\\) with \\(p\\mid f(c)\\).\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nThe problem concerns functions from the positive integers to themselves which are\nnon-constant and whose value differences are divisible by the corresponding\nargument differences. The conclusion is that infinitely many distinct primes\ndivide at least one value of the function.\n\nThe divisibility condition is interpreted in the integers: although `a` and `b`\nare positive natural numbers, `a - b` need not be a natural number, and the\nproblem uses the ordinary integer notion of divisibility for both differences.\n-/\n\nnamespace Problem\n\n/-- A function `f` is non-constant when it is not the case that all of its values\nare equal to one fixed value. Since the domain `ℕ+` is nonempty, this is the\nusual meaning of a non-constant function. -/\ndef Nonconstant (f : ℕ+ → ℕ+) : Prop :=\n ¬ ∃ y : ℕ+, ∀ x : ℕ+, f x = y\n\n/-- The difference-divisibility hypothesis of the problem.\n\nFor every ordered pair of distinct positive integers `a` and `b`, the integer\ndifference `(a : ℤ) - (b : ℤ)` divides the corresponding integer difference of\nvalues `(f a : ℤ) - (f b : ℤ)`. -/\ndef DifferenceDivisibility (f : ℕ+ → ℕ+) : Prop :=\n ∀ a b : ℕ+, a ≠ b →\n ((a : ℤ) - (b : ℤ)) ∣ ((f a : ℤ) - (f b : ℤ))\n\n/-- The set of primes which divide at least one value of `f`. The witness `c`\nis a positive integer, and divisibility is the natural-number divisibility\nrelation after coercing the positive natural number `f c` to `ℕ`. -/\ndef PrimeDivisorsOfValues (f : ℕ+ → ℕ+) : Set ℕ :=\n {p : ℕ | Nat.Prime p ∧ ∃ c : ℕ+, p ∣ (f c : ℕ)}\n\n/-- There are infinitely many distinct primes dividing at least one value of `f`. -/\ndef InfinitelyManyPrimeDivisors (f : ℕ+ → ℕ+) : Prop :=\n (PrimeDivisorsOfValues f).Infinite\n\n/-- The full universal assertion of the problem.\n\nFor every function `f : ℕ+ → ℕ+`, if `f` is non-constant and satisfies the\ndifference-divisibility condition for all distinct positive integers `a, b`,\nthen infinitely many distinct primes divide at least one value of `f`. -/\ndef Target : Prop :=\n ∀ f : ℕ+ → ℕ+,\n Nonconstant f →\n DifferenceDivisibility f →\n InfinitelyManyPrimeDivisors f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13376348-4479-54e1-81ed-37477a38f5b8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c155ccae06ef8f692249e036a2349ee2d14df4a3f0ff3bf2a53402060b6d1d1c", "task_path": "tasks/nmp3_13376348-4479-54e1-81ed-37477a38f5b8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13376348-4479-54e1-81ed-37477a38f5b8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_13631001-814e-5413-8da9-7855ba60d122", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy \n-- \\[\n-- a^{2}+b^{2}+c^{2}=ab+bc+ca+(abc-1)^{2}.\n-- \\] \n-- Prove that \n-- \\[\n-- ab+bc+ca+3\\;\\ge\\;2(a+b+c).\\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the target inequality\n\nThe problem asks to prove a real-variable inequality under a positivity and\nalgebraic constraint. The declarations below package the admissibility\nconditions and the asserted conclusion as propositions; no proof is supplied\nat this statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- The three variables are strictly positive. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The algebraic constraint imposed by the problem. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 =\n a * b + b * c + c * a + (a * b * c - 1) ^ 2\n\n/-- The admissibility predicate: positivity together with the constraint. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Positive a b c ∧ Constraint a b c\n\n/-- The inequality asserted as the conclusion of the problem. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n a * b + b * c + c * a + 3 ≥ 2 * (a + b + c)\n\n/-- The complete proposition to be proved: for every triple of real numbers\nsatisfying the positivity and algebraic constraints, the stated inequality\nholds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13631001-814e-5413-8da9-7855ba60d122", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f6dd300be9b1d47afeadc51fda475481e528633bf39d421718e9763c596109af", "task_path": "tasks/nmp3_13631001-814e-5413-8da9-7855ba60d122", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13631001-814e-5413-8da9-7855ba60d122", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_13758baf-d885-58dd-b64b-ccecc75794f8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let the numbers $1,2,\\dots,2021$ be placed in some order around a circle. For each $k=1,2,\\dots,2021$ perform the following operation: locate the position of the number $k$ in the current circular arrangement, and swap the two numbers that are adjacent to $k$ (i.e., the numbers immediately clockwise and counter‑clockwise from $k$). Prove that there exists at least one step $k$ for which the two swapped numbers $a$ and $b$ satisfy $a σ\n | t + 1, ht =>\n performStep (arrangementAfterAux σ t (Nat.le_of_succ_le ht))\n ⟨t, Nat.lt_of_lt_of_le (Nat.lt_succ_self t) ht⟩\n\n/-- The current arrangement immediately before the operation indexed by\nlabel `k`. There have been `k.val` previous operations, for labels\n`0, ..., k.val - 1`. -/\ndef arrangementBeforeStep (σ : Arrangement) (k : Label) : Arrangement :=\n arrangementAfterAux σ k.val (Nat.le_of_lt k.isLt)\n\n/-- The two actual numbers at the neighbours of `k` straddle `k`.\n\nThe disjunction records that the source does not assign a fixed\nclockwise/counter-clockwise name to `a` and `b`; it asserts that some naming\nof the two swapped numbers makes `a < k < b`. -/\ndef SwappedNumbersStraddle (k a b : Label) : Prop :=\n (actualNumber a < actualNumber k ∧ actualNumber k < actualNumber b) ∨\n (actualNumber b < actualNumber k ∧ actualNumber k < actualNumber a)\n\n/-- At the step for label `k`, the two labels swapped by the operation\nstraddle the actual number of `k`. -/\ndef StepHasStraddlingSwap (σ : Arrangement) (k : Label) : Prop :=\n let τ := arrangementBeforeStep σ k\n SwappedNumbersStraddle k\n (clockwiseAdjacentLabel τ k)\n (counterclockwiseAdjacentLabel τ k)\n\n/-- The complete mathematical assertion: for every circular arrangement of\nthe numbers `1, ..., 2021`, during the sequential operations for\n`k = 1, ..., 2021` there is at least one step at which the two swapped\nnumbers straddle `k`. -/\ndef Target : Prop :=\n ∀ σ : Arrangement, ∃ k : Label, StepHasStraddlingSwap σ k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13758baf-d885-58dd-b64b-ccecc75794f8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3060aa47ab4d343d4a3bdc42b5fc602633ccd6d5b177eb1d16541505707dc633", "task_path": "tasks/nmp3_13758baf-d885-58dd-b64b-ccecc75794f8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13758baf-d885-58dd-b64b-ccecc75794f8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_137805b8-17cf-5bf3-81a0-9b373ab32e38", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a convex quadrilateral. The diagonals $AC$ and $BD$ intersect at $E$, and the side lengths satisfy $AD+DB=AC+CB$. Prove that the internal bisectors of $\\angle DAC$, $\\angle DEC$, and $\\angle DBC$ are concurrent (i.e., they meet at a single point).\nimport Mathlib\n\n/-!\n# Formal statement of a condition for concurrence of three internal angle bisectors\n\nThis file records the statement of the problem, not a proof of it. The Euclidean plane is\nrepresented by the complex numbers, with its usual real metric and real inner product.\n-/\n\nnoncomputable section\n\nopen Set\n\nnamespace Problem\n\n/-- The signed area (cross product) of two planar vectors. -/\ndef cross (z : ℂ) (w : ℂ) : ℝ := z.re * w.im - z.im * w.re\n\n/-- The vertices `A`, `B`, `C`, `D` form a (strictly) convex quadrilateral in that cyclic\norder. Either orientation of the plane is allowed. Each consecutive triple is required to be\nnon-collinear; this is expressed by four strict turns all having the same sign (all positive\nfor counterclockwise order, all negative for clockwise order). -/\ndef ConvexQuadrilateral (A : ℂ) (B : ℂ) (C : ℂ) (D : ℂ) : Prop :=\n (0 < cross (B - A) (C - B) ∧\n 0 < cross (C - B) (D - C) ∧\n 0 < cross (D - C) (A - D) ∧\n 0 < cross (A - D) (B - A)) ∨\n (cross (B - A) (C - B) < 0 ∧\n cross (C - B) (D - C) < 0 ∧\n cross (D - C) (A - D) < 0 ∧\n cross (A - D) (B - A) < 0)\n\n/-- `E` is the intersection point of the diagonal segments `AC` and `BD`. The use of open\nsegments says that the intersection is in the interior of both diagonals, as for a convex\nquadrilateral in cyclic order. -/\ndef DiagonalIntersection (A : ℂ) (B : ℂ) (C : ℂ) (D : ℂ) (E : ℂ) : Prop :=\n E ∈ openSegment ℝ A C ∧ E ∈ openSegment ℝ B D\n\n/-- The length condition stated in the problem, read literally: the sum of the lengths of the\nsegments `AD` and `DB` equals the sum of the lengths of the segments `AC` and `CB`. -/\ndef LengthCondition (A : ℂ) (B : ℂ) (C : ℂ) (D : ℂ) : Prop :=\n dist A D + dist D B = dist A C + dist C B\n\n/-- The ray from `V` through `P` is the internal angle bisector of the nondegenerate angle\n`∠X V Y`. The direction of the ray through `P` is a positive linear combination of the two\nside directions, so it lies strictly inside the angle, and it makes equal unoriented angles\nwith the two sides. -/\ndef IsInternalAngleBisector (X : ℂ) (V : ℂ) (Y : ℂ) (P : ℂ) : Prop :=\n cross (X - V) (Y - V) ≠ 0 ∧\n P ≠ V ∧\n (∃ a b : ℝ, 0 < a ∧ 0 < b ∧\n P - V = a • (X - V) + b • (Y - V)) ∧\n EuclideanGeometry.angle X V P = EuclideanGeometry.angle P V Y\n\n/-- The proposition asserted by the problem: for every convex quadrilateral `ABCD`, with\ndiagonals `AC` and `BD` meeting at `E`, if `AD + DB = AC + CB`, then the internal angle\nbisectors of `∠DAC`, `∠DEC`, and `∠DBC` meet at one and only one point. -/\ndef Target : Prop :=\n ∀ A : ℂ, ∀ B : ℂ, ∀ C : ℂ, ∀ D : ℂ,\n ConvexQuadrilateral A B C D →\n ∀ E : ℂ,\n DiagonalIntersection A B C D E →\n LengthCondition A B C D →\n ∃! P : ℂ,\n IsInternalAngleBisector D A C P ∧\n IsInternalAngleBisector D E C P ∧\n IsInternalAngleBisector D B C P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "137805b8-17cf-5bf3-81a0-9b373ab32e38", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a847bc1260d8011d89af42f83e3433f65b524814cd4157f40721a61eb2d36422", "task_path": "tasks/nmp3_137805b8-17cf-5bf3-81a0-9b373ab32e38", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "137805b8-17cf-5bf3-81a0-9b373ab32e38", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_13a89771-a2ca-56ee-93a9-97359894c707", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a tangential (circumscribable) quadrilateral, i.e., a convex quadrilateral that has an incircle with center $I$. Let $M$ and $N$ be the midpoints of the diagonals $AC$ and $BD$, respectively. Prove that the points $M$, $N$, and $I$ are collinear.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.Convex.Between\nimport Mathlib.Geometry.Euclidean.Sphere.Tangent\n\n/-!\n# Formal statement: Newton's line for a tangential quadrilateral\n\nThe problem is stated for a convex quadrilateral `ABCD` in the Euclidean plane.\nThe vertices are represented by points of `EuclideanSpace ℝ (Fin 2)`. A point is\nstrictly between two vertices when `Sbtw` holds.\n\nThe vertices `A B C D` are in cyclic order precisely when the diagonals `AC` and\n`BD` meet at a common point lying strictly between both pairs of endpoints. We\nalso require that no three consecutive vertices are collinear, which excludes the\ndegenerate cases. This gives a fully explicit definition of a nondegenerate\nconvex quadrilateral in the plane.\n\nThe incircle is represented as a `EuclideanGeometry.Sphere` whose center is `I`.\nTangency to a side means that the side line is tangent to the circle at a point\nstrictly inside the corresponding side segment. The center is required to have\nstrictly positive barycentric coordinates with respect to the four vertices, so\nthat it lies in the interior of the quadrilateral rather than on an excircle.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\nopen scoped Affine RealInnerProductSpace\n\n/-- Points of the Euclidean plane used throughout the statement. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A convex quadrilateral `ABCD` with its vertices in the stated cyclic order.\n\nThe two diagonals `AC` and `BD` meet at a point `O` which is strictly between\neach pair of opposite endpoints. The four non-collinearity conditions rule out\ndegenerate quadrilaterals in which three vertices lie on one line. -/\ndef IsConvexQuadrilateral (A B C D : Point) : Prop :=\n (∃ O : Point, Sbtw ℝ A O C ∧ Sbtw ℝ B O D) ∧\n ¬ Collinear ℝ ({A, B, C} : Set Point) ∧\n ¬ Collinear ℝ ({B, C, D} : Set Point) ∧\n ¬ Collinear ℝ ({C, D, A} : Set Point) ∧\n ¬ Collinear ℝ ({D, A, B} : Set Point)\n\n/-- The point `P` lies strictly in the interior of the quadrilateral `ABCD`.\n\nFor the nondegenerate convex quadrilateral defined above, this is equivalent to\n`P` having four strictly positive barycentric coordinates summing to one. -/\ndef IsStrictlyInsideQuadrilateral (A B C D P : Point) : Prop :=\n ∃ α β γ δ : ℝ,\n 0 < α ∧ 0 < β ∧ 0 < γ ∧ 0 < δ ∧\n α + β + γ + δ = 1 ∧\n α • A + β • B + γ • C + δ • D = P\n\n/-- The circle with center `I` and radius `r` is tangent to the side `AB` at a\npoint strictly between `A` and `B`. Using the side line in `IsTangentAt` and\nrequiring the tangency point to be in the open side segment expresses tangency to\nthe side itself, not just to its supporting line. -/\ndef IsTangentToSide (I : Point) (r : ℝ) (A B : Point) : Prop :=\n ∃ T : Point,\n Sbtw ℝ A T B ∧\n EuclideanGeometry.Sphere.IsTangentAt (⟨I, r⟩ : EuclideanGeometry.Sphere Point) T\n (line[ℝ, A, B])\n\n/-- The quadrilateral `ABCD` has an incircle with center `I`.\n\nThere is a positive radius `r` such that the circle of center `I` and radius `r`\nis tangent to each of the four sides `AB`, `BC`, `CD`, and `DA`, and `I` lies in\nthe interior of the quadrilateral. -/\ndef HasIncircleWithCenter (A B C D I : Point) : Prop :=\n ∃ r : ℝ,\n 0 < r ∧\n IsStrictlyInsideQuadrilateral A B C D I ∧\n IsTangentToSide I r A B ∧\n IsTangentToSide I r B C ∧\n IsTangentToSide I r C D ∧\n IsTangentToSide I r D A\n\n/-- `ABCD` is a tangential quadrilateral with incircle center `I`: it is convex\nand has an incircle centered at `I`. -/\ndef IsTangentialQuadrilateral (A B C D I : Point) : Prop :=\n IsConvexQuadrilateral A B C D ∧ HasIncircleWithCenter A B C D I\n\n/-- The target assertion: if `ABCD` is a convex tangential quadrilateral with\nincircle center `I`, if `M` is the midpoint of diagonal `AC`, and if `N` is the\nmidpoint of diagonal `BD`, then `M`, `N`, and `I` are collinear.\n\nAll seven points are universally quantified and the midpoint conditions are\nequalities to `midpoint ℝ`. No existence of `M` or `N` is assumed separately;\nthey are supplied as the named midpoints. -/\ndef Target : Prop :=\n ∀ (A B C D I M N : Point),\n IsTangentialQuadrilateral A B C D I →\n M = midpoint ℝ A C →\n N = midpoint ℝ B D →\n Collinear ℝ ({M, N, I} : Set Point)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13a89771-a2ca-56ee-93a9-97359894c707", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4d033be90679860d7ac6388d700a85b0abe42f126e78397e97429538be51ccc4", "task_path": "tasks/nmp3_13a89771-a2ca-56ee-93a9-97359894c707", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13a89771-a2ca-56ee-93a9-97359894c707", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_13c29af5-0469-5df8-87ef-ccc0b030895d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f$ be a real‐valued function defined on $\\mathbb R$ with a continuous third derivative. Assume that $f(x)>0$, $f'(x)>0$, $f''(x)>0$, and $f'''(x)>0$ for every $x\\in\\mathbb R$, and that \n-- $$f'''(x)\\le f(x)\\qquad\\text{for all }x\\in\\mathbb R.$$\n-- Prove that \n-- $$f'(x)<2\\,f(x)\\qquad\\text{for all }x\\in\\mathbb R.$$\nimport Mathlib\n\n/-!\n# Formal statement of the problem in `problem.md`\n\nThe source problem asks for a proof of a global strict inequality for a\nthree-times continuously differentiable real-valued function on `ℝ`, under\npointwise positivity of the function and its first three derivatives together\nwith a pointwise upper bound on the third derivative.\n\nThis file only states the target proposition. It does not assert that the\nproposition is true by supplying a proof.\n-/\n\nnamespace Problem\n\n/-- The first ordinary derivative of a real-valued function on `ℝ`. -/\nnoncomputable def FirstDerivative (f : ℝ → ℝ) : ℝ → ℝ :=\n deriv f\n\n/-- The second ordinary derivative of a real-valued function on `ℝ`. -/\nnoncomputable def SecondDerivative (f : ℝ → ℝ) : ℝ → ℝ :=\n deriv (FirstDerivative f)\n\n/-- The third ordinary derivative of a real-valued function on `ℝ`. -/\nnoncomputable def ThirdDerivative (f : ℝ → ℝ) : ℝ → ℝ :=\n deriv (SecondDerivative f)\n\n/-- `f` has a continuous third derivative on all of `ℝ`. -/\ndef HasContinuousThirdDerivative (f : ℝ → ℝ) : Prop :=\n ContDiff ℝ 3 f\n\n/-- A real-valued function is strictly positive at every real point. -/\ndef StrictlyPositiveOnRealLine (g : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, 0 < g x\n\n/-- The third derivative of `f` is pointwise at most `f` on all of `ℝ`. -/\ndef ThirdDerivativeLeFunction (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, ThirdDerivative f x ≤ f x\n\n/-- The desired conclusion: the first derivative of `f` is pointwise strictly\nless than twice `f` on all of `ℝ`. -/\ndef FirstDerivativeLtTwiceFunction (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, FirstDerivative f x < 2 * f x\n\n/-- All hypotheses of the problem, bundled for a fixed real-valued function. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n HasContinuousThirdDerivative f ∧\n StrictlyPositiveOnRealLine f ∧\n StrictlyPositiveOnRealLine (FirstDerivative f) ∧\n StrictlyPositiveOnRealLine (SecondDerivative f) ∧\n StrictlyPositiveOnRealLine (ThirdDerivative f) ∧\n ThirdDerivativeLeFunction f\n\n/-- The target assertion of the problem: every admissible real-valued function\nsatisfies the required global strict inequality. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, Admissible f → FirstDerivativeLtTwiceFunction f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13c29af5-0469-5df8-87ef-ccc0b030895d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4b5e37609038f6b04269c215b7d28182b567f8af8ff363ef4b45e049b84d056e", "task_path": "tasks/nmp3_13c29af5-0469-5df8-87ef-ccc0b030895d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13c29af5-0469-5df8-87ef-ccc0b030895d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_13c3049c-e095-5827-a6ac-52bb07fb2b16", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exist infinitely many positive integers $n$ such that every odd prime divisor of the integer $3n^2+3n+2$ is congruent to $1$ modulo $3$ (i.e., is of the form $3k+1$).\nimport Mathlib\n\n/-!\n# Formal statement of an infinitude problem\n\nThe original problem asks one to prove that infinitely many positive integers\n`n` have the property that every odd prime divisor of `3 * n ^ 2 + 3 * n + 2`\nis congruent to `1` modulo `3`.\n-/\n\nnamespace Problem\n\n/-- The value `3 * n ^ 2 + 3 * n + 2`, represented as a natural number.\n\nFor positive `n`, this natural number is the positive integer appearing in the\nproblem. -/\ndef quadraticValue (n : ℕ) : ℕ :=\n 3 * n ^ 2 + 3 * n + 2\n\n/-- `p` is an odd prime divisor of `m`.\n\nThe prime is represented by a natural number. This is the standard\ninterpretation of a positive prime divisor. -/\ndef OddPrimeDivisor (m p : ℕ) : Prop :=\n Nat.Prime p ∧ Odd p ∧ p ∣ m\n\n/-- The natural number `p` is congruent to `1` modulo `3`. -/\ndef CongruentToOneModuloThree (p : ℕ) : Prop :=\n p % 3 = 1\n\n/-- Every odd prime divisor of `quadraticValue n` is congruent to `1` modulo\n`3`. -/\ndef HasRequiredOddPrimeDivisors (n : ℕ) : Prop :=\n ∀ p : ℕ, OddPrimeDivisor (quadraticValue n) p → CongruentToOneModuloThree p\n\n/-- A positive integer `n` is admissible when every odd prime divisor of\n`3 * n ^ 2 + 3 * n + 2` is congruent to `1` modulo `3`. -/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧ HasRequiredOddPrimeDivisors n\n\n/-- There exist infinitely many positive integers `n` such that every odd\nprime divisor of `3 * n ^ 2 + 3 * n + 2` is congruent to `1` modulo `3`. -/\ndef Target : Prop :=\n Set.Infinite {n : ℕ | Admissible n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13c3049c-e095-5827-a6ac-52bb07fb2b16", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3b24473febb484ea7af4ed288907c7fe52ec6bb5ef9b035e249d2cfaf7e40e5f", "task_path": "tasks/nmp3_13c3049c-e095-5827-a6ac-52bb07fb2b16", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13c3049c-e095-5827-a6ac-52bb07fb2b16", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_13d24ac0-b75d-55bd-982f-00d3cd4e0682", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that \n-- $$a^2b+b^2c+c^2a+abc=4.$$ \n-- Prove that \n-- $$a+b+c\\ge ab+bc+ca.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypotheses of the problem: `a`, `b`, and `c` are positive real numbers\nsatisfying `a^2 b + b^2 c + c^2 a + abc = 4`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a ^ 2 * b + b ^ 2 * c + c ^ 2 * a + a * b * c = 4\n\n/-- The inequality asserted in the problem. -/\ndef Consequence (a b c : ℝ) : Prop :=\n a + b + c ≥ a * b + b * c + c * a\n\n/-- The complete mathematical statement to be proved: for every three positive\nreal numbers satisfying the given constraint, the asserted inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Consequence a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13d24ac0-b75d-55bd-982f-00d3cd4e0682", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5048d22b7c46b97b50ffa180a0eefd862042ea0d9fb70bb4595a0694bc8d4a1f", "task_path": "tasks/nmp3_13d24ac0-b75d-55bd-982f-00d3cd4e0682", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13d24ac0-b75d-55bd-982f-00d3cd4e0682", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_13dcd319-9934-5d5b-a84e-086758245b43", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Construct a sequence of continuous functions $f_n:\\mathbb{R}\\to\\mathbb{R}$ such that for each $x\\in\\mathbb{Q}$ the sequence $(f_n(x))_{n\\ge1}$ is bounded, and for each $x\\in\\mathbb{R}\\setminus\\mathbb{Q}$ the sequence $(f_n(x))_{n\\ge1}$ is unbounded.\nimport Mathlib\n\n/-!\n# Constructing continuous functions with prescribed pointwise boundedness\n\nThe source problem asks for a sequence of continuous real-valued functions on `ℝ`\nwhose values are bounded at every rational point and unbounded at every irrational\npoint. The declarations below formalize that construction request as an\nexistential proposition, together with the admissibility predicate for a candidate\nsequence. No existence proof or concrete candidate is supplied here.\n-/\n\nnamespace Problem\n\n/-- A real number is rational when it is the image of a rational number under the\ncanonical embedding `ℚ → ℝ`. -/\ndef IsRational (x : ℝ) : Prop :=\n ∃ q : ℚ, x = (q : ℝ)\n\n/-- The irrational real numbers are the complement in `ℝ` of the rationals. -/\ndef IsIrrational (x : ℝ) : Prop :=\n ¬ IsRational x\n\n/-- A sequence indexed by the positive integers is bounded when its range is\nbounded both above and below. This is the standard two-sided notion of a bounded\nreal sequence. -/\ndef BoundedSequence (a : ℕ+ → ℝ) : Prop :=\n BddAbove (Set.range a) ∧ BddBelow (Set.range a)\n\n/-- A positive-indexed real sequence is unbounded when it is not bounded. -/\ndef UnboundedSequence (a : ℕ+ → ℝ) : Prop :=\n ¬ BoundedSequence a\n\n/-- A candidate sequence `f : ℕ+ → ℝ → ℝ` solves the problem when every function\n`f n` is continuous, the value sequence at every rational point is bounded, and\nthe value sequence at every irrational point is unbounded. -/\ndef IsSolution (f : ℕ+ → ℝ → ℝ) : Prop :=\n (∀ n : ℕ+, Continuous (f n)) ∧\n (∀ x : ℝ, IsRational x → BoundedSequence (fun n : ℕ+ => f n x)) ∧\n (∀ x : ℝ, IsIrrational x → UnboundedSequence (fun n : ℕ+ => f n x))\n\n/-- The source construction problem: there exists a positive-indexed sequence of\ncontinuous functions `ℝ → ℝ` that is pointwise bounded on `ℚ` and pointwise\nunbounded on the irrational reals. -/\ndef Target : Prop :=\n ∃ f : ℕ+ → ℝ → ℝ, IsSolution f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13dcd319-9934-5d5b-a84e-086758245b43", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "76e9de9912e07ad826c85a6659f42ea28c0c491a589539dbd86583cb11c17d6e", "task_path": "tasks/nmp3_13dcd319-9934-5d5b-a84e-086758245b43", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13dcd319-9934-5d5b-a84e-086758245b43", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_13dd922a-1777-56fd-bf33-b40956883984", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x_1,x_2,x_3,x_4\\ge0$. Prove that \n-- \\[\n-- \\bigl(x_1^2x_2+x_2^2x_3+x_3^2x_4+x_4^2x_1\\bigr)\n-- \\bigl(x_1x_2^2+x_2x_3^2+x_3x_4^2+x_4x_1^2\\bigr)\n-- \\ge x_1x_2x_3x_4\\,(x_1+x_2+x_3+x_4)^2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the four-variable cyclic inequality\n\nThe problem asks to prove, for nonnegative real numbers `x₁, x₂, x₃, x₄`,\nthe inequality\n\n`(x₁²x₂ + x₂²x₃ + x₃²x₄ + x₄²x₁) *\n (x₁x₂² + x₂x₃² + x₃x₄² + x₄x₁²)\n ≥ x₁x₂x₃x₄ * (x₁ + x₂ + x₃ + x₄)²`.\n\nThe target is represented as a proposition-valued definition; no proof of the\nassertion is supplied here.\n-/\n\nnamespace Problem\n\n/-- The first factor on the left-hand side:\n`x₁²x₂ + x₂²x₃ + x₃²x₄ + x₄²x₁`. -/\ndef FirstFactor (x1 x2 x3 x4 : ℝ) : ℝ :=\n x1 ^ 2 * x2 + x2 ^ 2 * x3 + x3 ^ 2 * x4 + x4 ^ 2 * x1\n\n/-- The second factor on the left-hand side:\n`x₁x₂² + x₂x₃² + x₃x₄² + x₄x₁²`. -/\ndef SecondFactor (x1 x2 x3 x4 : ℝ) : ℝ :=\n x1 * x2 ^ 2 + x2 * x3 ^ 2 + x3 * x4 ^ 2 + x4 * x1 ^ 2\n\n/-- The product `x₁x₂x₃x₄` on the right-hand side. -/\ndef QuadrupleProduct (x1 x2 x3 x4 : ℝ) : ℝ :=\n x1 * x2 * x3 * x4\n\n/-- The sum `x₁ + x₂ + x₃ + x₄` on the right-hand side. -/\ndef QuadrupleSum (x1 x2 x3 x4 : ℝ) : ℝ :=\n x1 + x2 + x3 + x4\n\n/-- A real number is nonnegative. -/\ndef Nonnegative (x : ℝ) : Prop :=\n 0 ≤ x\n\n/-- The four nonnegativity assumptions `x₁, x₂, x₃, x₄ ≥ 0`. -/\ndef NonnegativeQuadruple (x1 x2 x3 x4 : ℝ) : Prop :=\n Nonnegative x1 ∧ Nonnegative x2 ∧ Nonnegative x3 ∧ Nonnegative x4\n\n/-- The asserted inequality, with the nonnegativity hypotheses kept separate. -/\ndef Inequality (x1 x2 x3 x4 : ℝ) : Prop :=\n FirstFactor x1 x2 x3 x4 * SecondFactor x1 x2 x3 x4 ≥\n QuadrupleProduct x1 x2 x3 x4 * (QuadrupleSum x1 x2 x3 x4) ^ 2\n\n/-- The full formal target: for all nonnegative real `x₁, x₂, x₃, x₄`, the\ncyclic product inequality holds. -/\ndef Target : Prop :=\n ∀ x1 x2 x3 x4 : ℝ,\n NonnegativeQuadruple x1 x2 x3 x4 → Inequality x1 x2 x3 x4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13dd922a-1777-56fd-bf33-b40956883984", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "13539aaa06c1d468b5e3f5a1a01c935a5cf575ba4265f243b9a87b3a2f605535", "task_path": "tasks/nmp3_13dd922a-1777-56fd-bf33-b40956883984", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13dd922a-1777-56fd-bf33-b40956883984", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_13e50bb0-0f9b-5ee2-a078-3c0c0d998370", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In triangle $ABC$, let $\\omega$ be the circle with centre $A$ and radius $AC$. Let $D\\neq C$ be the second intersection of $\\omega$ with the circumcircle of $ABC$, and let $E\\neq C$ be the second intersection of $\\omega$ with the line through $C$ that is perpendicular to $AB$. Prove that the points $B$, $D$, and $E$ are collinear.\nimport Mathlib\n\n/-!\n# Formalization of a planar geometry statement\n\nThe statement is formalized in coordinates over the real Euclidean plane `ℝ × ℝ`.\nAll definitions are explicit so that the original geometric objects can be mapped\nclause by clause to Lean declarations.\n-/\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, represented by real Cartesian coordinates. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- The vector from `Q` to `P`, represented as an ordered pair. -/\ndef vsub (P Q : Point) : Point := (P.1 - Q.1, P.2 - Q.2)\n\n/-- The standard Euclidean dot product of two vectors in `ℝ × ℝ`. -/\ndef vdot (U V : Point) : ℝ := U.1 * V.1 + U.2 * V.2\n\n/-- The square of the Euclidean distance between two points. -/\ndef sqDist (P Q : Point) : ℝ := vdot (vsub P Q) (vsub P Q)\n\n/-- The (non-oriented) determinant of the vectors `P → Q` and `P → R`. -/\ndef det (P Q R : Point) : ℝ :=\n (Q.1 - P.1) * (R.2 - P.2) - (Q.2 - P.2) * (R.1 - P.1)\n\n/-- Three points are collinear when the determinant of two spanning vectors is zero. -/\ndef Collinear (P Q R : Point) : Prop := det P Q R = 0\n\n/-- A genuine triangle is a noncollinear triple of distinct points. -/\ndef IsTriangle (A B C : Point) : Prop := ¬ Collinear A B C\n\n/-- The circle with centre `A` and radius equal to the distance `AC`. -/\ndef Omega (A C : Point) : Set Point :=\n {X : Point | sqDist X A = sqDist C A}\n\n/--\nThe circumcentre of the noncollinear triple `(A,B,C)`. It is the intersection of\nthe perpendicular bisectors of `AB` and `AC`, written explicitly in coordinates.\nThe definition is total, but it has the intended geometric meaning on the\nnoncollinear domain enforced by `IsTriangle`.\n-/\nnoncomputable def Circumcenter (A B C : Point) : Point :=\n let U : Point := vsub B A\n let V : Point := vsub C A\n let delta : ℝ := 2 * (U.1 * V.2 - U.2 * V.1)\n let uu : ℝ := vdot U U\n let vv : ℝ := vdot V V\n let W : Point :=\n ((V.2 * uu - U.2 * vv) / delta, (-(V.1) * uu + U.1 * vv) / delta)\n (A.1 + W.1, A.2 + W.2)\n\n/-- The circumcircle of `A`, `B`, and `C`, with the explicit circumcentre above. -/\ndef Circumcircle (A B C : Point) : Set Point :=\n {X : Point | sqDist X (Circumcenter A B C) = sqDist A (Circumcenter A B C)}\n\n/-- The line through `C` perpendicular to `AB`, as a predicate on points. -/\ndef PerpendicularLineThrough (A B C X : Point) : Prop :=\n vdot (vsub X C) (vsub B A) = 0\n\n/--\n`D` is the second intersection of the circle `Omega A C` with the circumcircle of\n`ABC`: it is an intersection point other than `C`, and it is the unique such point.\n-/\ndef IsSecondIntersectionWithCircumcircle (A B C D : Point) : Prop :=\n D ≠ C ∧\n D ∈ Omega A C ∧\n D ∈ Circumcircle A B C ∧\n ∀ X : Point,\n X ≠ C →\n X ∈ Omega A C →\n X ∈ Circumcircle A B C →\n X = D\n\n/--\n`E` is the second intersection of the circle `Omega A C` with the line through `C`\nperpendicular to `AB`: it is an intersection point other than `C`, and it is the\nunique such point.\n-/\ndef IsSecondIntersectionWithPerpendicularLine (A B C E : Point) : Prop :=\n E ≠ C ∧\n E ∈ Omega A C ∧\n PerpendicularLineThrough A B C E ∧\n ∀ X : Point,\n X ≠ C →\n X ∈ Omega A C →\n PerpendicularLineThrough A B C X →\n X = E\n\n/--\nThe complete formal statement: for every noncollinear triangle `ABC`, and for\nevery point `D` which is the second intersection of the circle centred at `A`\nwith radius `AC` and the circumcircle of `ABC`, and every point `E` which is the\nsecond intersection of that circle with the line through `C` perpendicular to\n`AB`, the points `B`, `D`, and `E` are collinear.\n-/\ndef Target : Prop :=\n ∀ (A B C : Point),\n IsTriangle A B C →\n ∀ (D : Point),\n IsSecondIntersectionWithCircumcircle A B C D →\n ∀ (E : Point),\n IsSecondIntersectionWithPerpendicularLine A B C E →\n Collinear B D E\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13e50bb0-0f9b-5ee2-a078-3c0c0d998370", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7c28c2e4d4b0642ee6d79f7ba2bebe727f11c6665d3ee087895c75f486f517ea", "task_path": "tasks/nmp3_13e50bb0-0f9b-5ee2-a078-3c0c0d998370", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13e50bb0-0f9b-5ee2-a078-3c0c0d998370", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_13efef54-a3a0-5298-b631-89622ada370e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$, $q$, $r$ be prime numbers and let $n$ be a positive integer such that \n-- $$p^{\\,n}+q^{\\,n}=r^{2}.$$ \n-- Prove that $n=1$.\nimport Mathlib.Data.Nat.Prime.Basic\n\n/-!\n# Formal statement of the prime-power equation problem\n\nThe original problem asks: if `p`, `q`, and `r` are prime natural numbers and\n`n` is a positive natural number satisfying `p ^ n + q ^ n = r ^ 2`, then\n`n = 1`. This file records only that proposition; it does not provide a proof.\n-/\n\nnamespace Problem\n\n/-- The assertion that `p`, `q`, and `r` are all prime natural numbers. -/\ndef PrimeTriple (p q r : ℕ) : Prop :=\n Nat.Prime p ∧ Nat.Prime q ∧ Nat.Prime r\n\n/-- The Diophantine equation `p ^ n + q ^ n = r ^ 2`. -/\ndef PrimePowerEquation (p q r n : ℕ) : Prop :=\n p ^ n + q ^ n = r ^ 2\n\n/-- The complete statement to be proved: for every three prime natural numbers\n`p`, `q`, `r` and every positive natural number `n`, if\n`p ^ n + q ^ n = r ^ 2`, then `n = 1`. -/\ndef Target : Prop :=\n ∀ (p q r n : ℕ),\n PrimeTriple p q r →\n 0 < n →\n PrimePowerEquation p q r n →\n n = 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13efef54-a3a0-5298-b631-89622ada370e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "90d369ecda221f0335942ebe333513d3b3b46af96e1f9a108a3180d917458772", "task_path": "tasks/nmp3_13efef54-a3a0-5298-b631-89622ada370e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "13efef54-a3a0-5298-b631-89622ada370e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_140b72b6-839c-5316-b067-6f63fd2dd905", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a right triangle with $\\angle C=90^\\circ$, and let $H$ be the foot of the altitude from $C$ onto $AB$. Let $D$ be a point inside triangle $CBH$ such that the midpoint of $AD$ lies on $CH$. Let $P=BD\\cap CH$, and let $\\omega$ be the circle with diameter $BD$. Let $T$ be the second intersection of line $AD$ with $\\omega$ (the point distinct from $D$), and let $Q$ be the second intersection of line $CT$ with $\\omega$ (the point distinct from $T$). Prove that the line $PQ$ is tangent to $\\omega$ (at $Q$).\nimport Mathlib\n\nset_option autoImplicit false\n\nnamespace Problem\n\n/-- The Euclidean plane, represented by coordinates indexed by `Fin 2`. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The Euclidean dot product on the coordinate plane. -/\ndef dot (u v : Point) : ℝ := ∑ i : Fin 2, u i * v i\n\n/-- The signed two-dimensional cross product (oriented area determinant). -/\ndef cross (u v : Point) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- Three points are collinear. -/\ndef IsCollinear (A B X : Point) : Prop :=\n cross (B - A) (X - A) = 0\n\n/-- The line through two points, as a set of points. -/\ndef lineThrough (A B : Point) : Set Point :=\n {X : Point | IsCollinear A B X}\n\n/-- The closed segment with endpoints `A` and `B`. -/\ndef closedSegment (A B : Point) : Set Point :=\n {X : Point | ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧\n X = (1 - t) • A + t • B}\n\n/-- The midpoint of two points. -/\nnoncomputable def midpoint (A D : Point) : Point :=\n ((1 : ℝ) / 2) • (A + D)\n\n/-- A point is strictly inside a nondegenerate triangle. Both orientations are\nallowed, and all three strict same-side inequalities are required, so the\nboundary is excluded. -/\ndef strictlyInsideTriangle (A B C P : Point) : Prop :=\n (0 < cross (B - A) (P - A) ∧\n 0 < cross (C - B) (P - B) ∧\n 0 < cross (A - C) (P - C)) ∨\n (cross (B - A) (P - A) < 0 ∧\n cross (C - B) (P - B) < 0 ∧\n cross (A - C) (P - C) < 0)\n\n/-- The triangle has a right angle at `C`, with nonzero adjacent sides. -/\ndef RightTriangleAt (C A B : Point) : Prop :=\n A ≠ C ∧ B ≠ C ∧ dot (A - C) (B - C) = 0\n\n/-- `H` is the foot of the perpendicular from `C` to the line `AB`. -/\ndef IsAltitudeFoot (C A B H : Point) : Prop :=\n H ∈ lineThrough A B ∧ dot (C - H) (A - B) = 0\n\n/-- The circle with diameter `BD`, characterized by Thales' right-angle\ncondition. Its centre is `midpoint B D`. -/\ndef omega (B D : Point) : Set Point :=\n {X : Point | dot (X - B) (X - D) = 0}\n\n/-- `P` is the unique intersection point of the lines `XY` and `ZW`. -/\ndef isLineIntersection (P X Y Z W : Point) : Prop :=\n P ∈ lineThrough X Y ∧\n P ∈ lineThrough Z W ∧\n ∀ R : Point, R ∈ lineThrough X Y → R ∈ lineThrough Z W → R = P\n\n/-- `X` is the unique second intersection of the line through `L₁ L₂` with the\ncircle `omega B D`, the first intersection being `Y`. -/\ndef isSecondIntersection (L₁ L₂ B D Y X : Point) : Prop :=\n Y ∈ lineThrough L₁ L₂ ∧\n Y ∈ omega B D ∧\n X ∈ lineThrough L₁ L₂ ∧\n X ∈ omega B D ∧\n X ≠ Y ∧\n ∀ Z : Point,\n Z ∈ lineThrough L₁ L₂ → Z ∈ omega B D → Z ≠ Y → Z = X\n\n/-- The line through distinct points `P` and `Q` is tangent to `omega B D` at\n`Q`: it meets the circle only at `Q`. -/\ndef isTangentAt (P Q B D : Point) : Prop :=\n P ≠ Q ∧\n Q ∈ omega B D ∧\n ∀ X : Point, X ∈ lineThrough P Q → X ∈ omega B D → X = Q\n\n/-- The full universally quantified statement of the problem. The nested\nquantifiers follow the order in which the points are introduced in the source. -/\ndef Target : Prop :=\n ∀ A B C : Point,\n RightTriangleAt C A B →\n ∀ H : Point,\n IsAltitudeFoot C A B H →\n ∀ D : Point,\n strictlyInsideTriangle C B H D →\n closedSegment C H (midpoint A D) →\n ∀ P : Point,\n isLineIntersection P B D C H →\n ∀ T : Point,\n isSecondIntersection A D B D D T →\n ∀ Q : Point,\n isSecondIntersection C T B D T Q →\n isTangentAt P Q B D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "140b72b6-839c-5316-b067-6f63fd2dd905", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e2d6468cfdc6a40ceed3f5bd590e1e2b4fa33822f0160bc741506de1dec29323", "task_path": "tasks/nmp3_140b72b6-839c-5316-b067-6f63fd2dd905", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "140b72b6-839c-5316-b067-6f63fd2dd905", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_143d18e8-0b55-5694-aa1c-7fc8d83fa30c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m,n$ be positive integers such that $m > n^{\\,n-1}$. Prove that there exist distinct primes $p_1,p_2,\\dots,p_n$ with $p_k \\mid m+k$ for each $k=1,2,\\dots,n\\,. $\nimport Mathlib.Data.Nat.Prime.Basic\n\n/-!\n# Formalization of the target statement\n\nThe source problem asks, for positive integers `m` and `n` satisfying\n`n ^ (n - 1) < m`, to prove the existence of `n` pairwise distinct\nnatural-number primes whose `k`-th member divides `m + k` (with `k` running\nfrom `1` through `n`).\n\nThe proposition uses `Fin n` to index the family by exactly the numbers\n`1, ..., n`; `k.val + 1` is the corresponding one-based index.\n-/\n\nnamespace Problem\n\n/-- The complete assertion of the problem: for all positive natural numbers\n`m` and `n` with `n ^ (n - 1) < m`, there is a family of `n` pairwise\ndistinct primes `p k`, indexed by `k : Fin n`, such that `p k` divides\n`m + (k + 1)` for every one-based index `k + 1`. -/\ndef Target : Prop :=\n ∀ (m n : ℕ), 0 < m → 0 < n → n ^ (n - 1) < m →\n ∃ p : Fin n → ℕ,\n (∀ k : Fin n, Nat.Prime (p k)) ∧\n Function.Injective p ∧\n (∀ k : Fin n, p k ∣ m + (k.val + 1))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "143d18e8-0b55-5694-aa1c-7fc8d83fa30c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "aefd6f9b7c9b66d0235c48f9c73e55d54e0e104020f2e34b10205e01c4239b8c", "task_path": "tasks/nmp3_143d18e8-0b55-5694-aa1c-7fc8d83fa30c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "143d18e8-0b55-5694-aa1c-7fc8d83fa30c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1442fa52-3b0e-5f50-90c7-c55ca8db7bd7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p\\ge5$ be a prime. Prove that there exists an integer $a$ with $1\\le a\\le p-2$ such that neither $a^{\\,p-1}-1$ nor $(a+1)^{\\,p-1}-1$ is divisible by $p^{2}$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The numerical condition for a candidate integer `a` associated with a prime `p`:\n`a` lies between `1` and `p - 2`, and neither `a ^ (p - 1) - 1` nor\n`(a + 1) ^ (p - 1) - 1` is divisible by `p ^ 2` as an integer. -/\ndef Admissible (p : ℕ) (a : ℤ) : Prop :=\n 1 ≤ a ∧\n a ≤ (p : ℤ) - 2 ∧\n ¬ ((p : ℤ) ^ 2 ∣ a ^ (p - 1) - 1) ∧\n ¬ ((p : ℤ) ^ 2 ∣ (a + 1) ^ (p - 1) - 1)\n\n/-- For every prime `p ≥ 5`, there exists an integer `a` satisfying\n`1 ≤ a ≤ p - 2` for which both `a ^ (p - 1) - 1` and\n`(a + 1) ^ (p - 1) - 1` are nondivisible by `p ^ 2`. -/\ndef Target : Prop :=\n ∀ p : ℕ, Nat.Prime p → 5 ≤ p → ∃ a : ℤ, Admissible p a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1442fa52-3b0e-5f50-90c7-c55ca8db7bd7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c876a0d5391347ed55dbb244e3d8449292ab45228a88976a0252fd7e03204da4", "task_path": "tasks/nmp3_1442fa52-3b0e-5f50-90c7-c55ca8db7bd7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1442fa52-3b0e-5f50-90c7-c55ca8db7bd7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_14a3a514-9202-56ba-b432-5e5ce343abb5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{abc}{a^{3}+b^{3}+c^{3}}+\\frac{4}{9}\\Bigl(\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\Bigr)\\ge\\frac{5}{3}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion: for all positive real numbers `a`, `b`, and `c`,\n`abc / (a^3 + b^3 + c^3) + (4/9) * (a/b + b/c + c/a) ≥ 5/3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n (a * b * c) / (a ^ 3 + b ^ 3 + c ^ 3) +\n (4 / 9 : ℝ) * (a / b + b / c + c / a) ≥\n (5 / 3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "14a3a514-9202-56ba-b432-5e5ce343abb5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1670591cd307c04631b11e86351cf854a9116ed91c1a822e7abd7f6e8186a993", "task_path": "tasks/nmp3_14a3a514-9202-56ba-b432-5e5ce343abb5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "14a3a514-9202-56ba-b432-5e5ce343abb5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_14f83603-dc03-58dc-8e08-12988d2d79ad", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A tetrahedron is inscribed in a sphere of radius 1 (i.e., all four vertices lie on the sphere) and the center of the sphere lies inside the tetrahedron. Prove that the sum of the lengths of the six edges of the tetrahedron is greater than 6.\nimport Mathlib\n\n/-!\n# Tetrahedron inscribed in the unit sphere\n\nThis file formalizes the statement of the problem as a proposition. It does\nnot contain a proof of that proposition.\n-/\n\nnamespace Problem\n\n/-- The ambient Euclidean three-space. -/\nabbrev Space3 : Type := EuclideanSpace ℝ (Fin 3)\n\n/-- The unit sphere centered at `c`, as a subset of Euclidean three-space. -/\ndef unitSphere (c : Space3) : Set Space3 :=\n Metric.sphere c (1 : ℝ)\n\n/-- A tetrahedron with vertices indexed by `Fin 4`, represented by the convex\nhull of its four vertices. The hypothesis that a point is in its topological\ninterior ensures that this is a nondegenerate three-dimensional tetrahedron. -/\ndef tetrahedron (v : Fin 4 → Space3) : Set Space3 :=\n convexHull ℝ (Set.range v)\n\n/-- All four vertices lie on the unit sphere centered at `c`. -/\ndef InscribedInUnitSphere (v : Fin 4 → Space3) (c : Space3) : Prop :=\n ∀ i : Fin 4, v i ∈ unitSphere c\n\n/-- The center `c` of the sphere lies in the interior of the tetrahedron. -/\ndef CenterInsideTetrahedron (v : Fin 4 → Space3) (c : Space3) : Prop :=\n c ∈ interior (tetrahedron v)\n\n/-- The six unordered pairs of distinct vertices, represented as ordered pairs\n`(i, j)` with `i < j`. -/\ndef edgePairs : Finset (Fin 4 × Fin 4) :=\n Finset.univ.filter (fun p : Fin 4 × Fin 4 => p.1 < p.2)\n\n/-- The sum of the lengths of the six edges of the tetrahedron with vertices\n`v 0`, `v 1`, `v 2`, and `v 3`. -/\nnoncomputable def edgeSum (v : Fin 4 → Space3) : ℝ :=\n edgePairs.sum (fun p : Fin 4 × Fin 4 => dist (v p.1) (v p.2))\n\n/-- The target assertion: for every tetrahedron inscribed in a sphere of\nradius 1, if the center of the sphere lies inside the tetrahedron, then the\nsum of the lengths of the six edges of the tetrahedron is greater than 6. -/\ndef Target : Prop :=\n ∀ (v : Fin 4 → Space3) (c : Space3),\n InscribedInUnitSphere v c →\n CenterInsideTetrahedron v c →\n edgeSum v > 6\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "14f83603-dc03-58dc-8e08-12988d2d79ad", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f838815952097867736e9eb084c47480b11affb0d674d109ff8d8d27e38453b0", "task_path": "tasks/nmp3_14f83603-dc03-58dc-8e08-12988d2d79ad", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "14f83603-dc03-58dc-8e08-12988d2d79ad", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1525a62e-dddb-564b-b6b1-3477c06fd81b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that $abc=1$. Prove that \n-- $$\\sqrt[4]{6a^2+3bc}+\\sqrt[4]{6b^2+3ca}+\\sqrt[4]{6c^2+3ab}\\le (ab+bc+ca)\\sqrt{\\sqrt a+\\sqrt b+\\sqrt c}\\,. $$\nimport Mathlib\n\n/-!\n# Formal statement for a cyclic real inequality\n\nThe source problem asks one to prove, for positive real numbers `a`, `b`, and `c`\nwith `a * b * c = 1`, the inequality\n\n`fourthRoot (6 a^2 + 3 b c) + fourthRoot (6 b^2 + 3 c a) +\n fourthRoot (6 c^2 + 3 a b)\n ≤ (a b + b c + c a) * sqrt (sqrt a + sqrt b + sqrt c)`.\n\nThe nonnegative real fourth root is represented as `sqrt (sqrt x)`. The\nstatement is recorded as a proposition-valued definition; no proof of the\ntarget is supplied here.\n-/\n\nnamespace Problem\n\n/-- The nonnegative real fourth root of `x`, written `sqrt (sqrt x)`.\n\nFor the values used in `Problem.Target`, the radicands are positive, so this is\nthe usual real principal fourth root. -/\nnoncomputable def fourthRoot (x : ℝ) : ℝ :=\n Real.sqrt (Real.sqrt x)\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n fourthRoot (6 * a ^ 2 + 3 * b * c) +\n fourthRoot (6 * b ^ 2 + 3 * c * a) +\n fourthRoot (6 * c ^ 2 + 3 * a * b)\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a * b + b * c + c * a) *\n Real.sqrt (Real.sqrt a + Real.sqrt b + Real.sqrt c)\n\n/-- The exact inequality claimed in the source problem, for all positive real\n`a`, `b`, and `c` satisfying `a * b * c = 1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a * b * c = 1 →\n lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1525a62e-dddb-564b-b6b1-3477c06fd81b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9c9840e2dfef4987ae34f56e0fd78fff86abfabad9ebf1fe1d804b8a1ed4cc95", "task_path": "tasks/nmp3_1525a62e-dddb-564b-b6b1-3477c06fd81b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1525a62e-dddb-564b-b6b1-3477c06fd81b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_152d7df7-2ec3-5720-b6d0-eb8627d9dc51", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a_0,a_1,a_2,\\dots\\) be a sequence of positive integers such that for every \\(i\\ge 1\\),\n-- \n-- \\[\n-- \\gcd(a_i,\\;a_{i+1})>a_{i-1}.\n-- \\]\n-- \n-- Prove that \\(a_n\\ge 2^n\\) for all \\(n\\ge 0\\).\nimport Mathlib.Data.Nat.GCD.Basic\n\n/-!\n# Statement: a gcd lower-bound condition forces exponential growth\n\nSource problem: let `a₀, a₁, a₂, …` be a sequence of positive integers such that\n`gcd(aᵢ, aᵢ₊₁) > aᵢ₋₁` for every `i ≥ 1`. Prove that `aₙ ≥ 2ⁿ` for every `n ≥ 0`.\n\nThis file formalizes the statement only. `Problem.Target` is a proposition-valued\ndefinition and no proof of it is supplied.\n-/\n\nnamespace Problem\n\n/-- The sequence `a : ℕ → ℕ` has only positive terms: `0 < a i` for every index `i`.\nThe index type `ℕ` represents the indices `0, 1, 2, …` in the source problem. -/\ndef PositiveSequence (a : ℕ → ℕ) : Prop :=\n ∀ i : ℕ, 0 < a i\n\n/-- For every index `i` with `1 ≤ i`, the gcd of `a i` and `a (i + 1)` is strictly\ngreater than `a (i - 1)`.\n\nHere `i - 1` is natural-number subtraction. On the domain `1 ≤ i`, this is exactly\nthe predecessor `i - 1` occurring in the source statement. The source inequality\n`gcd(a_i, a_{i+1}) > a_{i-1}` is represented in the equivalent orientation\n`a (i - 1) < Nat.gcd (a i) (a (i + 1))`. -/\ndef GCDCondition (a : ℕ → ℕ) : Prop :=\n ∀ i : ℕ, 1 ≤ i → a (i - 1) < Nat.gcd (a i) (a (i + 1))\n\n/-- The hypotheses of the problem: the sequence is positive and satisfies the gcd\ncondition at every index `i ≥ 1`. -/\ndef Hypothesis (a : ℕ → ℕ) : Prop :=\n PositiveSequence a ∧ GCDCondition a\n\n/-- The conclusion of the problem for a fixed sequence: `a n ≥ 2 ^ n` for every\n`n ≥ 0`. Since the index type is `ℕ`, whose elements are all nonnegative, the\ncondition `n ≥ 0` is automatic and is represented by the unrestricted quantifier\n`∀ n : ℕ`. -/\ndef Claim (a : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, (2 : ℕ) ^ n ≤ a n\n\n/-- The full proposition to be proved: every sequence of positive integers satisfying\n`gcd(a i, a (i + 1)) > a (i - 1)` for every `i ≥ 1` satisfies `a n ≥ 2 ^ n` for every\n`n ≥ 0`. -/\ndef Target : Prop :=\n ∀ a : ℕ → ℕ, Hypothesis a → Claim a\n\n/-- The same target with the hypothesis and conclusion predicates unfolded, keeping\nthe conjunction of the two hypothesis clauses explicit. This is definitionally equal\nto `Problem.Target`. -/\ndef TargetExpanded : Prop :=\n ∀ a : ℕ → ℕ,\n ((∀ i : ℕ, 0 < a i) ∧\n (∀ i : ℕ, 1 ≤ i → a (i - 1) < Nat.gcd (a i) (a (i + 1)))) →\n ∀ n : ℕ, (2 : ℕ) ^ n ≤ a n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "152d7df7-2ec3-5720-b6d0-eb8627d9dc51", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cf74a55b0d36418ec7fe2c431f298fadf206860789f1b38d32dab7bf6bd555fe", "task_path": "tasks/nmp3_152d7df7-2ec3-5720-b6d0-eb8627d9dc51", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "152d7df7-2ec3-5720-b6d0-eb8627d9dc51", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1561ee78-990b-5c08-a48b-20fe831f5a71", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Consider a set of 2018 positive integers, not necessarily distinct, and none of which contain a prime factor greater than 23. Prove that there must exist four of them whose product is equal to the fourth power of an integer.\nimport Mathlib\n\n/-!\nThis file formalizes the statement of the problem only. It intentionally\ncontains no proof of `Problem.Target`.\n-/\n\nnamespace Problem\n\n/-- A natural number has no prime factor greater than `23`. -/\ndef NoPrimeFactorGreaterThan23 (n : ℕ) : Prop :=\n ∀ p : ℕ, Nat.Prime p → p ∣ n → p ≤ 23\n\n/-- The four indices are pairwise distinct. -/\ndef FourDistinctIndices (i j k l : Fin 2018) : Prop :=\n i ≠ j ∧ i ≠ k ∧ i ≠ l ∧ j ≠ k ∧ j ≠ l ∧ k ≠ l\n\n/-- A natural number is the fourth power of an integer. -/\ndef IsFourthPowerOfInteger (n : ℕ) : Prop :=\n ∃ z : ℤ, (n : ℤ) = z ^ 4\n\n/-- The indexed collection consists of positive integers, each with no prime\nfactor greater than `23`. The target type `Fin 2018 → ℕ` records that there\nare exactly `2018` entries and permits repeated values. -/\ndef AdmissibleCollection (a : Fin 2018 → ℕ) : Prop :=\n (∀ i : Fin 2018, 0 < a i) ∧\n (∀ i : Fin 2018, NoPrimeFactorGreaterThan23 (a i))\n\n/-- There are four pairwise distinct entries whose product is the fourth power\nof an integer. -/\ndef HasFourEntriesWithFourthPowerProduct (a : Fin 2018 → ℕ) : Prop :=\n ∃ i j k l : Fin 2018,\n FourDistinctIndices i j k l ∧\n IsFourthPowerOfInteger (a i * a j * a k * a l)\n\n/-- Problem statement: for every collection of `2018` positive integers, none\nhaving a prime factor greater than `23`, some four distinct entries have a\nproduct equal to the fourth power of an integer. -/\ndef Target : Prop :=\n ∀ a : Fin 2018 → ℕ,\n AdmissibleCollection a → HasFourEntriesWithFourthPowerProduct a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1561ee78-990b-5c08-a48b-20fe831f5a71", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f1ce98a2976b2afd1fd3ce3506247ab94613a0b8247b5037257a115bd0b1d684", "task_path": "tasks/nmp3_1561ee78-990b-5c08-a48b-20fe831f5a71", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1561ee78-990b-5c08-a48b-20fe831f5a71", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_15890a56-32fe-50fb-a4dd-6f00b0e65fce", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ with $abcd=1$. Prove that \n-- \\[\n-- a^{3}+b^{3}+c^{3}+d^{3}+8\\ge 3\\bigl(abc+abd+acd+bcd\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, `c`, and `d`\nwhose product is `1`, the inequality\n\n`a^3 + b^3 + c^3 + d^3 + 8 ≥ 3 * (abc + abd + acd + bcd)`.\n\nThe declarations below record the assumptions and the asserted inequality as\npropositions only; no proof of the target is supplied.\n-/\n\nnamespace Problem\n\n/-- The four variables are strictly positive real numbers. -/\ndef Positive (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d\n\n/-- The product of the four variables is the real number `1`. -/\ndef UnitProduct (a b c d : ℝ) : Prop :=\n a * b * c * d = 1\n\n/-- The admissibility conditions stated in the problem. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n Positive a b c d ∧ UnitProduct a b c d\n\n/-- The inequality asserted by the problem, with the four elementary\nsymmetric products written out explicitly. -/\ndef Inequality (a b c d : ℝ) : Prop :=\n a ^ 3 + b ^ 3 + c ^ 3 + d ^ 3 + (8 : ℝ) ≥\n (3 : ℝ) * (a * b * c + a * b * d + a * c * d + b * c * d)\n\n/-- The complete universal statement of the source problem. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Inequality a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "15890a56-32fe-50fb-a4dd-6f00b0e65fce", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8c38d428f9e1511ad4732bad374aea94cb20754753e1d2e5418ce7cd2e8c8275", "task_path": "tasks/nmp3_15890a56-32fe-50fb-a4dd-6f00b0e65fce", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "15890a56-32fe-50fb-a4dd-6f00b0e65fce", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_15d63c65-ad7b-55ae-8311-1520375612f8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Starting with the integer 2010, you may repeatedly apply either of the following operations: (i) replace the current number n by 2n (double it); or (ii) delete its last decimal digit, i.e. replace n by ⌊n/10⌋. Prove that after a finite number of such operations it is possible to obtain the number 2008.\n/-\nFormal statement for:\n\"Starting with the integer 2010, you may repeatedly apply either of the\nfollowing operations: (i) replace the current number n by 2n (double it);\nor (ii) delete its last decimal digit, i.e. replace n by ⌊n/10⌋.\nProve that after a finite number of such operations it is possible to obtain\nthe number 2008.\"\n-/\n\nimport Mathlib.Data.Int.DivMod\n\nnamespace Problem\n\n/-- Operation (i): replace the current integer `n` by `2 * n`. -/\ndef double (n : Int) : Int :=\n 2 * n\n\n/-- Operation (ii): delete the last decimal digit, i.e. floor-divide by 10.\n`Int.fdiv n 10` is the integer-valued floor of `n / 10`. -/\ndef deleteLastDecimalDigit (n : Int) : Int :=\n Int.fdiv n 10\n\n/-- One allowed operation step: the next integer is either the double of the\ncurrent integer or the current integer with its last decimal digit deleted. -/\ndef AllowedOperation (n next : Int) : Prop :=\n next = double n ∨ next = deleteLastDecimalDigit n\n\n/-- A finite operation sequence of exactly `steps` steps, beginning at `start`\nand ending at `finish`. The sequence is indexed by the finite type\n`Fin (steps + 1)`, so it has exactly `steps + 1` entries and exactly `steps`\nconsecutive operation steps. -/\ndef IsOperationSequence (steps : Nat) (start finish : Int) : Prop :=\n ∃ seq : Fin (steps + 1) → Int,\n seq ⟨0, Nat.succ_pos steps⟩ = start ∧\n seq ⟨steps, Nat.lt_succ_self steps⟩ = finish ∧\n ∀ i : Fin steps, AllowedOperation (seq i.castSucc) (seq i.succ)\n\n/-- `finish` is reachable from `start` by some finite number of allowed\noperations. -/\ndef Reachable (start finish : Int) : Prop :=\n ∃ steps : Nat, IsOperationSequence steps start finish\n\n/-- The target assertion: 2008 is reachable from 2010 by finitely many\napplications of the two allowed operations. -/\ndef Target : Prop :=\n Reachable (2010 : Int) 2008\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "15d63c65-ad7b-55ae-8311-1520375612f8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8af65f662cfe55e0ffadd1b2fd765df418e3f5f6036ad642915d2def872a7b5a", "task_path": "tasks/nmp3_15d63c65-ad7b-55ae-8311-1520375612f8", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "15d63c65-ad7b-55ae-8311-1520375612f8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_15e5ffeb-91cd-551e-8824-9917db595915", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x, y, z$ be positive real numbers such that $xyz = 1$. Prove that \n-- \\[\n-- \\frac{1}{(x+1)^3}+\\frac{1}{(y+1)^3}+\\frac{1}{(z+1)^3}\\ge\\frac{3}{8}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- For all positive real numbers `x`, `y`, and `z` satisfying `xyz = 1`, the sum\nof the reciprocals of `(x + 1)^3`, `(y + 1)^3`, and `(z + 1)^3` is at least `3 / 8`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x * y * z = (1 : ℝ) →\n ((1 / ((x + 1) ^ 3) + 1 / ((y + 1) ^ 3) + 1 / ((z + 1) ^ 3) : ℝ) ≥\n (3 / 8 : ℝ))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "15e5ffeb-91cd-551e-8824-9917db595915", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "83a06d19b65f76c9e121b40bacfe20716a59cd02517c04116c0ccb3171b4ca64", "task_path": "tasks/nmp3_15e5ffeb-91cd-551e-8824-9917db595915", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "15e5ffeb-91cd-551e-8824-9917db595915", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_166212d7-97c8-5de1-945f-e07251e9b6be", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p_1,p_2,\\dots,p_n$ be distinct primes greater than $3$. Prove that the integer $2^{p_1p_2\\cdots p_n}+1$ has at least $4^n$ positive divisors.\nimport Mathlib\n\nnamespace Problem\n\n/-- The product `p_1 p_2 ⋯ p_n` of a finite family of natural numbers. -/\ndef primeProduct (n : ℕ) (p : Fin n → ℕ) : ℕ :=\n Finset.prod (Finset.univ : Finset (Fin n)) p\n\n/-- The integer `2 ^ (p_1 p_2 ⋯ p_n) + 1` appearing in the problem. -/\ndef targetInteger (n : ℕ) (p : Fin n → ℕ) : ℕ :=\n (2 : ℕ) ^ primeProduct n p + 1\n\n/-- The number of positive divisors of a natural number, using `Nat.divisors`. -/\ndef positiveDivisorCount (m : ℕ) : ℕ :=\n Finset.card (Nat.divisors m)\n\n/-- The admissibility hypotheses on the finite tuple of primes. -/\ndef PrimeTuple (n : ℕ) (p : Fin n → ℕ) : Prop :=\n (∀ i : Fin n, Nat.Prime (p i)) ∧\n (∀ i : Fin n, (3 : ℕ) < p i) ∧\n Function.Injective p\n\n/-- The assertion: for every finite tuple of distinct primes greater than `3`,\n`2 ^ (p_1 p_2 ⋯ p_n) + 1` has at least `4 ^ n` positive divisors. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (p : Fin n → ℕ),\n Problem.PrimeTuple n p →\n (4 : ℕ) ^ n ≤ Problem.positiveDivisorCount (Problem.targetInteger n p)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "166212d7-97c8-5de1-945f-e07251e9b6be", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0d040a8eaf4204983dcf8879b73253d22c84d2997fcec09ececaff0c74645a2a", "task_path": "tasks/nmp3_166212d7-97c8-5de1-945f-e07251e9b6be", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "166212d7-97c8-5de1-945f-e07251e9b6be", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_168bbfbf-e448-5e4e-8c92-563d24c0bce3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a given positive integer. Prove that there exist infinitely many integer triples $(x,y,z)$ such that\n-- \\[\n-- n x^{2}+y^{3}=z^{4},\\qquad \\gcd(x,y)=\\gcd(y,z)=\\gcd(z,x)=1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the stated Diophantine infinitude problem\n\nThe source problem asks, for every positive integer `n`, for infinitely many\ninteger triples `(x, y, z)` satisfying\n`n * x ^ 2 + y ^ 3 = z ^ 4` and pairwise coprimality of `x`, `y`, and `z`.\n-/\n\nnamespace Problem\n\n/-- The Diophantine equation from the problem, for an integer coefficient `n`\nand an integer triple `(x, y, z)`. -/\ndef Equation (n x y z : ℤ) : Prop :=\n n * x ^ 2 + y ^ 3 = z ^ 4\n\n/-- The three pairwise coprimality conditions. `Int.gcd` is the standard\nnonnegative integer gcd, even when its arguments are negative. -/\ndef PairwiseCoprime (x y z : ℤ) : Prop :=\n Int.gcd x y = 1 ∧ Int.gcd y z = 1 ∧ Int.gcd z x = 1\n\n/-- Admissibility of an integer triple for a fixed integer coefficient `n`. -/\ndef Admissible (n x y z : ℤ) : Prop :=\n Equation n x y z ∧ PairwiseCoprime x y z\n\n/-- The set of integer triples satisfying the equation and the three pairwise\ncoprimality conditions for a fixed integer coefficient `n`. -/\ndef SolutionSet (n : ℤ) : Set (ℤ × ℤ × ℤ) :=\n {p | Admissible n p.1 p.2.1 p.2.2}\n\n/-- For every positive integer `n`, there are infinitely many admissible\ninteger triples `(x, y, z)`. -/\ndef Target : Prop :=\n ∀ n : ℤ, 0 < n → Set.Infinite (SolutionSet n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "168bbfbf-e448-5e4e-8c92-563d24c0bce3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "05502ff543dd5339f37308e90889c07a4dd6bb331f629510a6c5c6937cb63746", "task_path": "tasks/nmp3_168bbfbf-e448-5e4e-8c92-563d24c0bce3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "168bbfbf-e448-5e4e-8c92-563d24c0bce3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_169ec28c-884c-5094-b373-f1d6d760e80a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- At a party there are eight guests. Each guest is unable to talk with at most three other guests (i.e., each guest can converse with at least four of the others). Prove that the guests can be partitioned into four disjoint pairs so that the two people in each pair can converse with each other.\nimport Mathlib.Combinatorics.SimpleGraph.Basic\nimport Mathlib.Data.Set.Card\n\n/-!\n# Formal statement: four conversing pairs at a party\n\nWe model the eight guests by `Fin 8` and the converse relation by a simple graph on\nthat type. The assumption says that, for every guest, at most three of the other\nseven guests are not adjacent to that guest. The conclusion says that the guests\ncan be indexed by `Fin 4 × Fin 2`, so that for each `i : Fin 4 the two guests\nindexed by `(i, 0)` and `(i, 1)` can converse. An equivalence of types ensures\nthat this indexing is a partition into four disjoint two-element pairs and uses\nevery guest exactly once.\n-/\n\nnamespace Problem\n\n/-- The guests whom `v` is unable to talk to: the other vertices not adjacent to `v`. -/\ndef unableToConverseWith (G : SimpleGraph (Fin 8)) (v : Fin 8) : Set (Fin 8) :=\n {w : Fin 8 | w ≠ v ∧ ¬ G.Adj v w}\n\n/-- The guests with whom `v` can converse: the other vertices adjacent to `v`. -/\ndef ableToConverseWith (G : SimpleGraph (Fin 8)) (v : Fin 8) : Set (Fin 8) :=\n {w : Fin 8 | w ≠ v ∧ G.Adj v w}\n\n/-- Every guest is unable to talk to at most three other guests. -/\ndef EveryGuestUnableToTalkToAtMostThree (G : SimpleGraph (Fin 8)) : Prop :=\n ∀ v : Fin 8, (unableToConverseWith G v).ncard ≤ 3\n\n/-- The parenthetical restatement: every guest can converse with at least four of\nthe other guests. -/\ndef EveryGuestCanConverseWithAtLeastFour (G : SimpleGraph (Fin 8)) : Prop :=\n ∀ v : Fin 8, 4 ≤ (ableToConverseWith G v).ncard\n\n/-- A partition of the eight guests into four disjoint pairs in which the two guests\nin every pair can converse. The index `i : Fin 4` is the pair label and the second\ncoordinate (`0` or `1`) selects the two members of that pair. -/\ndef IsConversePairPartition (G : SimpleGraph (Fin 8)) : Prop :=\n ∃ assign : Fin 4 × Fin 2 ≃ Fin 8,\n ∀ i : Fin 4, G.Adj (assign (i, (0 : Fin 2))) (assign (i, (1 : Fin 2)))\n\n/-- At a party of eight guests, if every guest cannot converse with at most three\nother guests, then the guests can be partitioned into four disjoint pairs such that\nthe two guests in each pair can converse. -/\ndef Target : Prop :=\n ∀ G : SimpleGraph (Fin 8),\n EveryGuestUnableToTalkToAtMostThree G → IsConversePairPartition G\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "169ec28c-884c-5094-b373-f1d6d760e80a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b8c37dd1f2f958f27c7c534e1ca26e27c5e21028edb8020fddf92804cd36e233", "task_path": "tasks/nmp3_169ec28c-884c-5094-b373-f1d6d760e80a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "169ec28c-884c-5094-b373-f1d6d760e80a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_16a00d71-91f2-5160-b0b0-7f5510a29602", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Define a sequence of integers $(a_n)_{n\\ge0}$ by $a_0=a$, where $a$ is an integer $>1$, and $a_{n+1}=2^{\\,a_n}-1$ for $n\\ge0$. Let $A=\\{p\\text{ prime} : p\\mid a_n\\text{ for some }n\\ge0\\}$. Prove that $A$ contains infinitely many primes.\nimport Mathlib\n\nnamespace Problem\n\n/-- The one-step map `z ↦ 2 ^ z - 1`, written for an integer `z`.\n\nFor every integer `z` that occurs in the sequence below, `z` is positive, so\n`z.toNat` is exactly `z` as a natural-number exponent. The definition is total\non `ℤ`, but the hypothesis `1 < a` in `Target` keeps all iterates in the range\nwhere it agrees with the mathematical expression `2 ^ z - 1`. -/\ndef nextTerm (z : ℤ) : ℤ := (2 : ℤ) ^ z.toNat - 1\n\n/-- The sequence `(a_n)_{n ≥ 0}` determined by `a_0 = a` and\n`a_{n+1} = 2 ^ a_n - 1`. -/\ndef aSeq (a : ℤ) : ℕ → ℤ\n | 0 => a\n | n + 1 => nextTerm (aSeq a n)\n\n/-- The set `A` of prime natural numbers dividing at least one term of the\nsequence generated by the initial integer `a`. -/\ndef A (a : ℤ) : Set ℕ :=\n {p : ℕ | p.Prime ∧ ∃ n : ℕ, (p : ℤ) ∣ aSeq a n}\n\n/-- The assertion that for every integer `a > 1`, the set of primes dividing\nsome term of the recursively defined sequence is infinite. -/\ndef Target : Prop :=\n ∀ a : ℤ, 1 < a → (A a).Infinite\n\n/-- The initial term equation for the recursively defined sequence. -/\nlemma aSeq_zero (a : ℤ) : aSeq a 0 = a := rfl\n\n/-- The successor equation for the recursively defined sequence. -/\nlemma aSeq_succ (a : ℤ) (n : ℕ) :\n aSeq a (n + 1) = nextTerm (aSeq a n) := rfl\n\n/-- The recurrence written directly with the `toNat` exponent used by\n`nextTerm`. -/\nlemma aSeq_succ_eq (a : ℤ) (n : ℕ) :\n aSeq a (n + 1) = (2 : ℤ) ^ (aSeq a n).toNat - 1 := rfl\n\n/-- Under the stated hypothesis `1 < a`, every term is greater than one. In\nparticular every term is nonnegative, so `toNat` denotes its actual integer\nvalue when used as the exponent in `nextTerm`. -/\nlemma aSeq_gt_one (a : ℤ) (ha : 1 < a) :\n ∀ n : ℕ, 1 < aSeq a n := by\n intro n\n induction n with\n | zero =>\n simpa only [aSeq] using ha\n | succ n ih =>\n have hz0 : 0 ≤ aSeq a n := by omega\n have hzcast : ((aSeq a n).toNat : ℤ) = aSeq a n :=\n Int.toNat_of_nonneg hz0\n have hz2 : 2 ≤ (aSeq a n).toNat := by omega\n have hpow : (2 : ℤ) ^ 2 ≤ (2 : ℤ) ^ (aSeq a n).toNat := by\n exact pow_le_pow_right₀ (by norm_num) hz2\n have hnext : 1 < nextTerm (aSeq a n) := by\n unfold nextTerm\n norm_num at hpow ⊢\n omega\n simpa only [aSeq] using hnext\n\n/-- Under the problem hypothesis, the successor term is exactly obtained by\nraising `2` to the natural number equal to the preceding integer term and then\nsubtracting one. This makes the intended mathematical recurrence explicit\nwithout relying on the total `toNat` implementation outside the valid range. -/\nlemma aSeq_succ_math (a : ℤ) (ha : 1 < a) (n : ℕ) :\n ∃ e : ℕ, (e : ℤ) = aSeq a n ∧\n aSeq a (n + 1) = (2 : ℤ) ^ e - 1 := by\n refine ⟨(aSeq a n).toNat, ?_, ?_⟩\n · exact Int.toNat_of_nonneg (by\n have h := aSeq_gt_one a ha n\n omega)\n · rfl\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "16a00d71-91f2-5160-b0b0-7f5510a29602", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "92071abb2c925d46c10e272623944a104ddcdd4bc59a68cd46d1b716c410976b", "task_path": "tasks/nmp3_16a00d71-91f2-5160-b0b0-7f5510a29602", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "16a00d71-91f2-5160-b0b0-7f5510a29602", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_16b7a3ed-5eee-59db-9a3f-272611e42a8d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- abc\\,(a+2)(b+2)(c+2)\\le\\Bigl(1+\\frac{2}{3}(ab+bc+ca)\\Bigr)^3.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The inequality asserted by the problem for arbitrary positive real numbers\n`a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a * b * c * (a + 2) * (b + 2) * (c + 2) ≤\n (1 + (2 / 3 : ℝ) * (a * b + b * c + c * a)) ^ (3 : ℕ)\n\n/-- The full universal statement of the problem: for all positive real numbers\n`a`, `b`, and `c`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "16b7a3ed-5eee-59db-9a3f-272611e42a8d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e9f524a8b55b1d60026de1ca56f915001c7c4143d9bdd5ee524292fe35c088da", "task_path": "tasks/nmp3_16b7a3ed-5eee-59db-9a3f-272611e42a8d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "16b7a3ed-5eee-59db-9a3f-272611e42a8d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_16bbb26a-7230-5a45-912c-162c31484d16", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(G,\\cdot)$ be a group such that there exists an element $a\\in G$ with the property \n-- $$a\\cdot x^{\\,n}\\cdot a = x\\qquad\\text{for all }x\\in G.$$ \n-- Find all positive integers $n$ for which every group $G$ satisfying this property must be abelian.\nimport Mathlib\n\n/-!\n# Formalization of the group-power classification problem\n\nThe source problem asks for all positive integers `n` such that every group `G`\npossessing an element `a` with `a * x ^ n * a = x` for every `x ∈ G` is abelian.\n\nThe declaration `Problem.Target` states the candidate complete answer set\n`{2, 3}`. It is an unproved proposition: this file only formalizes the\nstatement and does not assert a proof of it.\n-/\n\nnamespace Problem\n\nuniverse u\n\n/--\nFor a fixed natural number `n` and a group `G`, this predicate says that there\nexists an element `a : G` such that left and right multiplication by `a`\nsends `x ^ n` to `x`, simultaneously for every `x : G`.\n-/\ndef HasWitnessProperty (n : ℕ) (G : Type u) [Group G] : Prop :=\n ∃ a : G, ∀ x : G, a * x ^ n * a = x\n\n/--\nFor a fixed natural number `n`, every group equipped with an element satisfying\nthe witness property is required to be abelian. Abelian-ness is expressed by\ncommutativity of every pair of elements rather than by assuming a `CommGroup`\ninstance.\n-/\ndef ForcesAbelian (n : ℕ) : Prop :=\n ∀ (G : Type u) [Group G],\n HasWitnessProperty n G → ∀ x y : G, x * y = y * x\n\n/--\nThe admissibility predicate from the source problem: `n` is a positive integer\nand the witness property forces every such group to be abelian.\n-/\ndef PositiveAdmissible (n : ℕ) : Prop :=\n 0 < n ∧ ForcesAbelian.{u} n\n\n/-- The proposed complete answer set for the source problem. -/\ndef ProposedAnswerSet : Set ℕ :=\n {n : ℕ | n = 2 ∨ n = 3}\n\n/--\nA proposed set of natural numbers is a complete answer exactly when it contains\nall, and only, the positive admissible integers. This gives both directions of\nthe `find all` classification.\n-/\ndef IsCompleteAnswer (S : Set ℕ) : Prop :=\n ∀ n : ℕ, n ∈ S ↔ PositiveAdmissible.{u} n\n\n/--\nThe formal target: the proposed answer set `{2, 3}` is the complete set of\npositive integers `n` for which the stated group-theoretic implication holds.\n-/\ndef Target : Prop :=\n IsCompleteAnswer.{u} ProposedAnswerSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "16bbb26a-7230-5a45-912c-162c31484d16", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a9ad0cc866ada8a288e84ae36f09400250c371c7dc3e7e05ce97aaae70cb2ed0", "task_path": "tasks/nmp3_16bbb26a-7230-5a45-912c-162c31484d16", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "16bbb26a-7230-5a45-912c-162c31484d16", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_16c72955-03d5-5e73-8730-ba0219ba282c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For every real number \\(x\\) with \\(0 IsAcuteTriangleSubset T)).card\n\n/-- The number of ways to choose three distinct points from `S`, hence the\ntotal number of triangles determined by `S`. -/\ndef TotalTriangleCount (S : Finset PlanePoint) : ℕ :=\n S.card.choose (3 : ℕ)\n\n/-- The problem assertion: for every set of exactly 100 points in the Euclidean\nplane with no three collinear, the number of acute triangles is at most 70\npercent of the total number of triangles determined by the points. -/\ndef Target : Prop :=\n ∀ S : Finset PlanePoint,\n S.card = (100 : ℕ) →\n NoThreeCollinear S →\n (AcuteTriangleCount S : ℝ) ≤\n (7 / 10 : ℝ) * (TotalTriangleCount S : ℝ)\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "17021bda-90f0-5b56-adfc-a4e0751ae389", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5d4ff511efa179825948cbe59c001106ab1b77102da940dd1ac2bd4dc6455f31", "task_path": "tasks/nmp3_17021bda-90f0-5b56-adfc-a4e0751ae389", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "17021bda-90f0-5b56-adfc-a4e0751ae389", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_171b3d89-1152-55d1-bded-7c19b66b3ba5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In the infinite sequence of fractional parts \\(\\{\\alpha\\},\\{\\alpha^{2}\\},\\{\\alpha^{3}\\},\\ldots\\) there are only finitely many distinct values. Prove that \\(\\alpha\\) is an integer. (Here \\(\\{x\\}=x-\\lfloor x\\rfloor\\) denotes the fractional part of \\(x\\.)\nimport Mathlib\n\n/-!\n# Fractional parts of powers of a real number\n\nThis file formalizes the statement of the problem: if the infinite sequence\nof fractional parts `{α}, {α²}, {α³}, ...` assumes only finitely many distinct\nvalues, then the real number `α` is an integer.\n\nThe problem is represented as an unproved proposition-valued definition,\n`Problem.Target`. No proof of the assertion is supplied here.\n-/\n\nnamespace Problem\n\n/-- The fractional part of a real number, defined by `{x} = x - ⌊x⌋`. -/\nnoncomputable def FractionalPart (x : ℝ) : ℝ :=\n x - (⌊x⌋ : ℝ)\n\n/-- The sequence whose `n`-th term (with zero-based indexing) is the fractional\npart of `α ^ (n + 1)`. Thus its terms are `{α}, {α²}, {α^3}, ...`. -/\nnoncomputable def FractionalPartSequence (α : ℝ) : ℕ → ℝ :=\n fun n => FractionalPart (α ^ (n + 1))\n\n/-- The set of distinct values occurring in the sequence\n`{α}, {α²}, {α³}, ...`. -/\ndef FractionalPartValues (α : ℝ) : Set ℝ :=\n Set.range (FractionalPartSequence α)\n\n/-- The sequence `{α}, {α²}, {α³}, ...` has only finitely many distinct\nvalues, expressed as finiteness of its set of values. -/\ndef HasFinitelyManyFractionalParts (α : ℝ) : Prop :=\n (FractionalPartValues α).Finite\n\n/-- The real number `α` is an integer, i.e. it is the image of some integer\nunder the canonical coercion `ℤ → ℝ`. -/\ndef IsIntegerReal (α : ℝ) : Prop :=\n ∃ z : ℤ, α = (z : ℝ)\n\n/-- The full assertion of the problem: for every real number `α`, if the\ninfinite sequence of fractional parts `{α}, {α²}, {α³}, ...` has only\nfinitely many distinct values, then `α` is an integer. -/\ndef Target : Prop :=\n ∀ α : ℝ, HasFinitelyManyFractionalParts α → IsIntegerReal α\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "171b3d89-1152-55d1-bded-7c19b66b3ba5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9b760b2779f8ae87b0d25ca1c7041670a60699da8e9a565834731ba9f8b66ad1", "task_path": "tasks/nmp3_171b3d89-1152-55d1-bded-7c19b66b3ba5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "171b3d89-1152-55d1-bded-7c19b66b3ba5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_17344602-c426-535d-94b7-a4d2a3a973d7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a\\ge b\\ge c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{b}{a}+\\frac{c}{b}+\\frac{a}{c}\\ge \\frac{2a}{\\,b+c\\,}+\\frac{2b}{\\,c+a\\,}+\\frac{2c}{\\,a+b\\,}.\n-- \\]\nimport Mathlib\n\n/-!\n# Ordered positive real inequality\n\nThis file formalizes the target inequality from the problem statement. It\nstates the assertion as a proposition-valued definition; no proof is supplied.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissibility conditions on the three real parameters: they are all\npositive and satisfy `a ≥ b ≥ c`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ≥ b ∧ b ≥ c\n\n/-- The left-hand side of the target inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n b / a + c / b + a / c\n\n/-- The right-hand side of the target inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (2 * a) / (b + c) + (2 * b) / (c + a) + (2 * c) / (a + b)\n\n/-- The assertion of the problem: for all positive real numbers\n`a ≥ b ≥ c`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ rhs a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "17344602-c426-535d-94b7-a4d2a3a973d7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2afe4a8c3a21ea2c6be30e6eaab99dc007c211092cfeba00cc8a9cddd3dc243b", "task_path": "tasks/nmp3_17344602-c426-535d-94b7-a4d2a3a973d7", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "17344602-c426-535d-94b7-a4d2a3a973d7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_176d78e8-e254-57af-82fa-80703d05a61a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a}{b+c}+\\frac{b}{c+a}+\\frac{c}{a+b}+\\frac{abc}{4\\,(a^3+b^3+c^3)}\\ge \\frac34\\sqrt[3]{\\frac{a^2+b^2+c^2}{ab+bc+ca}}+\\frac56\\,. \n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the inequality problem in `problem.md`.\n\nThe displayed real cube root is represented by the real power `x ^ (1 / 3 : ℝ)`.\nFor the nonnegative radicand appearing in the problem this is the usual\nnonnegative real cube root.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a / (b + c) + b / (c + a) + c / (a + b) +\n a * b * c / (4 * (a ^ 3 + b ^ 3 + c ^ 3))\n\n/-- The right-hand side of the displayed inequality.\n\nThe real cube root is encoded as the real power with exponent `1 / 3`. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n (3 / 4 : ℝ) * Real.rpow ((a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a)) (1 / 3 : ℝ) +\n (5 / 6 : ℝ)\n\n/-- The complete assertion: for all positive real numbers `a`, `b`, and `c`,\nthe displayed inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, (0 < a ∧ 0 < b ∧ 0 < c) → LHS a b c ≥ RHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "176d78e8-e254-57af-82fa-80703d05a61a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c4bb4258210c31839da03435db5f52f2d9c69491a53e7fc34ae0c8edfcf9244e", "task_path": "tasks/nmp3_176d78e8-e254-57af-82fa-80703d05a61a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "176d78e8-e254-57af-82fa-80703d05a61a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_179a5149-025c-5600-96d9-174647ca5c5f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $M$ be a set of $n\\ge 4$ points in the plane, no three of which are collinear. Initially the points are joined by $n$ segments so that each point of $M$ is the endpoint of exactly two segments. At each step one may choose two segments $AB$ and $CD$ that intersect in their interiors and replace them by the segments $AC$ and $BD$, provided that neither $AC$ nor $BD$ is already present as a segment. Prove that it is impossible to perform $\\frac{n^{3}}{4}$ or more such moves.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Basic\nimport Mathlib.Analysis.Convex.Segment\n\n/-!\n# Formalization of the planar graph move-count problem\n\nThe points are represented by finite subsets of the Euclidean plane\n`EuclideanSpace ℝ (Fin 2)`. A segment is a two-element finite set of\npoints. A position is a finite set of such (undirected) segments.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean plane. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A (nondegenerate, undirected) segment, represented by its two\nendpoints as a two-element finite set. -/\nabbrev Segment : Type := {s : Finset Plane // s.card = 2}\n\n/-- The undirected segment with endpoints `a` and `b`, where `a ≠ b`. -/\ndef pairSegment (a b : Plane) (h : a ≠ b) : Segment :=\n ⟨({a, b} : Finset Plane), Finset.card_pair h⟩\n\n/-- The four endpoints of a proposed move are distinct. -/\nstructure QuadDistinct (a b c d : Plane) : Prop where\n ab : a ≠ b\n ac : a ≠ c\n ad : a ≠ d\n bc : b ≠ c\n bd : b ≠ d\n cd : c ≠ d\n\n/-- The number of segments of a position that have `p` as an endpoint. -/\ndef EndpointCount (E : Finset Segment) (p : Plane) : ℕ :=\n (E.filter (fun s : Segment => p ∈ s.val)).card\n\n/-- A position has all its segment endpoints in `M` and uses exactly\n`M.card` segments, so the number of segments is the original number `n`\nof points. -/\ndef WellFormed (M : Finset Plane) (E : Finset Segment) : Prop :=\n (∀ s : Segment, s ∈ E → s.val ⊆ M) ∧ E.card = M.card\n\n/-- No three distinct points of `M` are collinear. -/\ndef NoThreeCollinear (M : Finset Plane) : Prop :=\n ∀ a : Plane, a ∈ M → ∀ b : Plane, b ∈ M → ∀ c : Plane, c ∈ M →\n a ≠ b → a ≠ c → b ≠ c →\n ¬ Collinear ℝ ({a, b, c} : Set Plane)\n\n/-- The initial condition of the problem. -/\ndef InitialPosition (M : Finset Plane) (E : Finset Segment) : Prop :=\n 4 ≤ M.card ∧\n NoThreeCollinear M ∧\n WellFormed M E ∧\n (∀ p : Plane, p ∈ M → EndpointCount E p = 2)\n\n/-- One legal move: replace two crossing segments `ab` and `cd` by the\nsegments `ac` and `bd`, provided that the latter two are not already in\nthe current position. -/\ndef Move (M : Finset Plane) (E E' : Finset Segment) : Prop :=\n ∃ (a b c d : Plane), ∃ (h : QuadDistinct a b c d),\n let sAB : Segment := pairSegment a b h.ab\n let sCD : Segment := pairSegment c d h.cd\n let sAC : Segment := pairSegment a c h.ac\n let sBD : Segment := pairSegment b d h.bd\n a ∈ M ∧ b ∈ M ∧ c ∈ M ∧ d ∈ M ∧\n sAB ∈ E ∧ sCD ∈ E ∧\n ((openSegment ℝ a b) ∩ (openSegment ℝ c d)).Nonempty ∧\n sAC ∉ E ∧ sBD ∉ E ∧\n E' = ((E.erase sAB).erase sCD) ∪ ({sAC, sBD} : Finset Segment)\n\n/-- `ReachableIn M E k E'` says that starting from position `E`, exactly\n`k` legal moves lead to position `E'`. -/\ninductive ReachableIn (M : Finset Plane) :\n Finset Segment → ℕ → Finset Segment → Prop where\n | refl (E : Finset Segment) : ReachableIn M E 0 E\n | step {E E' E'' : Finset Segment} {k : ℕ} :\n Move M E E' → ReachableIn M E' k E'' →\n ReachableIn M E (k + 1) E''\n\n/-- The assertion that no legal play can make `n ^ 3 / 4` or more moves,\nwhere `n` is the number of points in the initial set `M`. -/\ndef Target : Prop :=\n ∀ (M : Finset Plane) (E : Finset Segment),\n InitialPosition M E →\n ¬ ∃ (k : ℕ) (E' : Finset Segment),\n (((M.card : ℝ) ^ 3) / 4 ≤ (k : ℝ)) ∧\n ReachableIn M E k E'\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "179a5149-025c-5600-96d9-174647ca5c5f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7e26b3ad5e7a523a95340ec7f001732d6f0048e0a5bb4f4eab55689c67b64258", "task_path": "tasks/nmp3_179a5149-025c-5600-96d9-174647ca5c5f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "179a5149-025c-5600-96d9-174647ca5c5f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_17a38c0e-b60b-5e26-aec8-d468f677f02d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Two players $A$ and $B$ play the following game taking alternate moves. In each move a player writes one digit on the blackboard; the digit may be placed either to the right or to the left of the current sequence of digits. Initially the blackboard is empty and $A$ moves first. $B$ wins the game if, after some move of $B$, the sequence of digits on the blackboard represents a perfect square. Prove that $A$ can prevent $B$ from ever winning.\nimport Mathlib.Data.Fin.Basic\nimport Mathlib.Data.List.Basic\n\n/-!\n# The digit-placement square-avoidance game\n\nThis file formalizes the statement of the following game problem.\n\nTwo players, `A` and `B`, alternately write a decimal digit. Each newly\nwritten digit is put either to the left or to the right of the current finite\ndigit string. Initially the string is empty and `A` moves first. Player `B`\nwins as soon as, immediately after one of `B`'s moves, the displayed digit\nstring represents a perfect square. The target proposition states that `A`\nhas a strategy which prevents `B` from ever winning.\n\nThe formalization deliberately leaves the mathematical proposition unproved:\n`Problem.Target` is a `Prop`-valued definition.\n-/\n\nnamespace Problem\n\n/-- A decimal digit, represented by its value in `{0, ..., 9}`. -/\nabbrev Digit : Type := Fin 10\n\n/-- A finite string of decimal digits, displayed from left to right. -/\nabbrev DigitSequence : Type := List Digit\n\n/-- The side of the currently displayed digit string on which a digit is put. -/\ninductive Placement where\n | left\n | right\n\n/-- A complete move: a digit together with the side on which it is inserted. -/\nstructure Move where\n digit : Digit\n placement : Placement\n\n/-- Insert a new digit on the requested side of an existing digit string. -/\ndef insertDigit (s : DigitSequence) (m : Move) : DigitSequence :=\n match m.placement with\n | Placement.left => m.digit :: s\n | Placement.right => s ++ [m.digit]\n\n/-- The displayed digit string after a finite chronological list of moves. -/\ndef boardAfter (moves : List Move) : DigitSequence :=\n moves.foldl (fun s m => insertDigit s m) []\n\n/-- The natural number represented by a finite decimal digit string.\n\nLeading zeroes are evaluated in the usual decimal way; for example, `007`\nrepresents the natural number `7`. -/\ndef sequenceValue (s : DigitSequence) : ℕ :=\n s.foldl (fun n d => n * 10 + d.val) 0\n\n/-- A digit string represents a perfect square if its decimal value is a\nsquare of a natural number. In particular, the value zero is a square. -/\ndef RepresentsPerfectSquare (s : DigitSequence) : Prop :=\n ∃ n : ℕ, n * n = sequenceValue s\n\n/-- A strategy specifies a move after any finite list of previous moves. -/\nabbrev Strategy : Type := List Move → Move\n\n/-- The first `n` entries of an infinite move sequence. -/\ndef finitePrefix (n : ℕ) (moves : ℕ → Move) : List Move :=\n List.ofFn (fun i : Fin n => moves i)\n\n/-- The infinite play is consistent with `A`'s and `B`'s strategies. Entries\nwith even indices are moves of `A` (who starts), and entries with odd indices\nare moves of `B`. Each strategy observes precisely the chronological prefix of\nall previous moves. -/\ndef AlternatingPlay (a b : Strategy) (moves : ℕ → Move) : Prop :=\n ∀ k : ℕ,\n moves (2 * k) = a (finitePrefix (2 * k) moves) ∧\n moves (2 * k + 1) = b (finitePrefix (2 * k + 1) moves)\n\n/-- `B` wins a play if, after one of `B`'s moves, the displayed sequence\nrepresents a perfect square. The first check is after move number `2`, i.e.\nafter `B`'s first move. -/\ndef BWins (moves : ℕ → Move) : Prop :=\n ∃ k : ℕ,\n RepresentsPerfectSquare (boardAfter (finitePrefix (2 * k + 2) moves))\n\n/-- A strategy for `A` prevents `B` from winning if every infinite play that is\nconsistent with it, no matter which strategy `B` uses, avoids a winning position\nfor `B` at every one of `B`'s turns. -/\ndef APreventsBWinning (a : Strategy) : Prop :=\n ∀ (b : Strategy) (moves : ℕ → Move),\n AlternatingPlay a b moves → ¬ BWins moves\n\n/-- The assertion that player `A` has a strategy preventing `B` from ever\nwinning, under the rules formalized above. -/\ndef Target : Prop :=\n ∃ a : Strategy, APreventsBWinning a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "17a38c0e-b60b-5e26-aec8-d468f677f02d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "43c607be01c1756201a1468eafc18a6b597ba0c476b980bd62f36fc83f798178", "task_path": "tasks/nmp3_17a38c0e-b60b-5e26-aec8-d468f677f02d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "17a38c0e-b60b-5e26-aec8-d468f677f02d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_17bf0592-dae6-5bd1-8b31-c4c545ecbc2d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all real numbers \\(a,b,c\\)\n-- \\[\n-- (b^2+c^2-a^2)(c^2+a^2-b^2)(a^2+b^2-c^2)\\le (b+c-a)^2\\,(c+a-b)^2\\,(a+b-c)^2.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The inequality of the problem, stated for all real numbers a, b, and c. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n (b ^ 2 + c ^ 2 - a ^ 2) *\n (c ^ 2 + a ^ 2 - b ^ 2) *\n (a ^ 2 + b ^ 2 - c ^ 2) ≤\n (b + c - a) ^ 2 * (c + a - b) ^ 2 * (a + b - c) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "17bf0592-dae6-5bd1-8b31-c4c545ecbc2d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2e7adc89d2adb876d99e95e1f999ed5e90a0879298ed23e1b0ea302f8362a2e8", "task_path": "tasks/nmp3_17bf0592-dae6-5bd1-8b31-c4c545ecbc2d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "17bf0592-dae6-5bd1-8b31-c4c545ecbc2d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_17cb0634-01ff-5fcc-ace3-7d6614fdd48a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for a natural number $n$, the divisibility $n^2+1\\mid n!$ holds if and only if both of the following statements are false:\n-- \n-- 1. There exists a prime $p$ such that $n^2\\equiv-1\\pmod p$ and $0n$ of $n^2+1$).\n-- \n-- 2. There exists a prime $p$ such that $n^2+1=2p^2\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the divisibility criterion for `n^2 + 1 ∣ n!`\n\nThis file states, without proving it, the assertion from the source problem.\nThe proposition is packaged as a `def` returning `Prop`; no proof of the target\nis supplied.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the claimed equivalence: `n^2 + 1` divides `n!`. -/\ndef Admissible (n : ℕ) : Prop :=\n n ^ 2 + 1 ∣ Nat.factorial n\n\n/-- The first possible obstruction: a prime `p > n` for which\n`n^2 ≡ -1 (mod p)`, together with the explicitly stated requirement `0 < n`. -/\ndef FirstException (n : ℕ) : Prop :=\n ∃ p : ℕ,\n Nat.Prime p ∧\n (n : ℤ) ^ 2 ≡ (-1 : ℤ) [ZMOD (p : ℤ)] ∧\n 0 < n ∧ n < p\n\n/-- The second possible obstruction: `n^2 + 1 = 2 * p^2` for a prime `p`. -/\ndef SecondException (n : ℕ) : Prop :=\n ∃ p : ℕ, Nat.Prime p ∧ n ^ 2 + 1 = 2 * p ^ 2\n\n/-- Both listed exceptional statements are false. -/\ndef NoExceptions (n : ℕ) : Prop :=\n ¬ FirstException n ∧ ¬ SecondException n\n\n/-- The claimed divisibility criterion for a fixed natural number `n`. -/\ndef StatementAt (n : ℕ) : Prop :=\n Admissible n ↔ NoExceptions n\n\n/-- The full universally quantified assertion of the source problem. -/\ndef Target : Prop :=\n ∀ n : ℕ, StatementAt n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "17cb0634-01ff-5fcc-ace3-7d6614fdd48a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3e36b8fa8a9aadccfd1efc1554625f39bc3b52de297290f83dbade62761b4ea6", "task_path": "tasks/nmp3_17cb0634-01ff-5fcc-ace3-7d6614fdd48a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "17cb0634-01ff-5fcc-ace3-7d6614fdd48a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_180effe4-187b-5a8c-a4fc-a940f6afbee1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb N\\to\\mathbb N$ be a strictly increasing function such that $f(2)=2$ and \n-- $$f(mn)=f(m)\\,f(n)\\qquad\\text{whenever }\\gcd(m,n)=1.$$ \n-- Prove that $f(n)=n$ for every natural number $n$.\nimport Mathlib.Data.Nat.GCD.Basic\n\n/-!\n# Formal statement for a multiplicatively monotone function on the naturals\n\nThe source problem asks to prove that a strictly increasing function\n`f : ℕ → ℕ` with `f 2 = 2` and which is multiplicative on coprime\narguments is the identity.\n\nThe assertion is represented as a proposition-valued definition rather\nthan as a theorem with a proof.\n-/\n\nnamespace Problem\n\n/-- A function from the natural numbers to themselves is strictly increasing\nwhenever a smaller input always gives a smaller output. -/\ndef StrictlyIncreasingOnNat (f : ℕ → ℕ) : Prop :=\n ∀ m n : ℕ, m < n → f m < f n\n\n/-- A function from the natural numbers to themselves is multiplicative on\ncoprime arguments when `f (m * n) = f m * f n` for all `m` and `n` with\n`Nat.gcd m n = 1`. -/\ndef MultiplicativeOnCoprime (f : ℕ → ℕ) : Prop :=\n ∀ m n : ℕ, Nat.gcd m n = 1 → f (m * n) = f m * f n\n\n/-- The full assertion of the problem: every strictly increasing\n`f : ℕ → ℕ` satisfying `f 2 = 2` and multiplicativity on coprime arguments\nis pointwise the identity on `ℕ`.\n\nThe quantifier order follows the source: first the function `f`, then the\nthree hypotheses, and finally the pointwise conclusion for every natural\nnumber. -/\ndef Target : Prop :=\n ∀ f : ℕ → ℕ,\n StrictlyIncreasingOnNat f →\n f 2 = 2 →\n MultiplicativeOnCoprime f →\n ∀ n : ℕ, f n = n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "180effe4-187b-5a8c-a4fc-a940f6afbee1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "185974d6610e79f10e3ed1320832e6f0b3478149cbc63fadcd3c9bfe5f6f6ed4", "task_path": "tasks/nmp3_180effe4-187b-5a8c-a4fc-a940f6afbee1", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "180effe4-187b-5a8c-a4fc-a940f6afbee1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1830a621-0cbe-5a00-b416-fc6c2d11296c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$, $H$, $O$, $I$ be respectively the centroid, orthocenter, circumcenter, and incenter of an arbitrary triangle $ABC$. Prove that $OI + OG \\ge IH$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.MongePoint\nimport Mathlib.Geometry.Euclidean.Incenter.Basic\nimport Mathlib.LinearAlgebra.AffineSpace.Simplex.Centroid\n\n/-!\n# Statement formalization\n\nThe problem asks, for an arbitrary (nondegenerate) triangle in the Euclidean plane, to show\nthat `OI + OG ≥ IH`, where `O`, `I`, `G`, and `H` are respectively the circumcenter,\nincenter, centroid, and orthocenter of the triangle.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The Euclidean plane used to formalize the triangle. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Vertex `A` of a triangle, represented as the first indexed vertex. -/\ndef triangleVertexA (t : Affine.Triangle ℝ Plane) : Plane :=\n t.points 0\n\n/-- Vertex `B` of a triangle, represented as the second indexed vertex. -/\ndef triangleVertexB (t : Affine.Triangle ℝ Plane) : Plane :=\n t.points 1\n\n/-- Vertex `C` of a triangle, represented as the third indexed vertex. -/\ndef triangleVertexC (t : Affine.Triangle ℝ Plane) : Plane :=\n t.points 2\n\n/-- The centroid `G` of a triangle. -/\ndef triangleCentroid (t : Affine.Triangle ℝ Plane) : Plane :=\n t.centroid\n\n/-- The orthocenter `H` of a triangle. -/\ndef triangleOrthocenter (t : Affine.Triangle ℝ Plane) : Plane :=\n t.orthocenter\n\n/-- The circumcenter `O` of a triangle. -/\ndef triangleCircumcenter (t : Affine.Triangle ℝ Plane) : Plane :=\n t.circumcenter\n\n/-- The incenter `I` of a triangle. -/\ndef triangleIncenter (t : Affine.Triangle ℝ Plane) : Plane :=\n t.incenter\n\n/-- The assertion of the problem: for every nondegenerate triangle in the Euclidean plane,\nthe sum of the distances from the circumcenter to the incenter and from the circumcenter to\nthe centroid is at least the distance from the incenter to the orthocenter. -/\ndef Target : Prop :=\n ∀ t : Affine.Triangle ℝ Plane,\n dist (triangleCircumcenter t) (triangleIncenter t) +\n dist (triangleCircumcenter t) (triangleCentroid t) ≥\n dist (triangleIncenter t) (triangleOrthocenter t)\n\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1830a621-0cbe-5a00-b416-fc6c2d11296c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2a0ce6632bdbab79bdb431dbe139c953b980d2fcd259684922b61402c23d3046", "task_path": "tasks/nmp3_1830a621-0cbe-5a00-b416-fc6c2d11296c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1830a621-0cbe-5a00-b416-fc6c2d11296c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_183c1889-3321-5d97-9c9a-43523d77a7e9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $r_1,r_2,\\dots,r_n\\in\\mathbb{R}$ be given, where $n$ is a positive integer. Prove that there exists a subset $I\\subseteq\\{1,2,\\dots,n\\}$ such that for every $i=1,2,\\dots,n-2$ we have \n-- \\[\n-- 1\\le |I\\cap\\{i,i+1,i+2\\}|\\le 2,\n-- \\] \n-- and \n-- \\[\n-- \\Bigl|\\sum_{i\\in I} r_i\\Bigr|\\;\\ge\\;\\frac16\\sum_{i=1}^{n}|r_i|.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- A subset `I` of `{1, ..., n}` satisfies the three-consecutive-index window\ncondition if every block `{i, i+1, i+2}` with `i = 1, ..., n-2` contains either\none or two elements of `I`.\n\nThe set `{1, ..., n}` is represented by `Fin n`. Thus a window whose first\none-based index is `i` is represented by the zero-based index `i - 1`; in the\ndefinition below the natural number `i` ranges over possible zero-based window\nstarts and the hypothesis `i + 2 < n` says exactly that the three-element\nwindow lies inside `{0, ..., n-1}`. -/\ndef WindowAdmissible (n : ℕ) (I : Finset (Fin n)) : Prop :=\n ∀ i : ℕ, i + 2 < n →\n 1 ≤ (I.filter (fun j : Fin n => i ≤ j.val ∧ j.val ≤ i + 2)).card ∧\n (I.filter (fun j : Fin n => i ≤ j.val ∧ j.val ≤ i + 2)).card ≤ 2\n\n/-- The selected sum of `r` over the finite set `I` has absolute value at least\none sixth of the sum of the absolute values of all entries of `r`. -/\ndef WeightBound (n : ℕ) (r : Fin n → ℝ) (I : Finset (Fin n)) : Prop :=\n (1 / 6 : ℝ) * (∑ i : Fin n, |r i|) ≤ |∑ i ∈ I, r i|\n\n/-- The assertion stated in the problem: for every positive integer `n` and\nevery real tuple `r` indexed by `{1, ..., n}`, there exists a subset `I` of\n`{1, ..., n}` satisfying every three-consecutive-index window condition and\nwhose selected sum satisfies the stated one-sixth weight bound. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (_hn : 0 < n) (r : Fin n → ℝ),\n ∃ I : Finset (Fin n),\n WindowAdmissible n I ∧ WeightBound n r I\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "183c1889-3321-5d97-9c9a-43523d77a7e9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "af1e631d8afc1d9745ae5b708b3020116c7df3fff4bdbec2f728f77156141be2", "task_path": "tasks/nmp3_183c1889-3321-5d97-9c9a-43523d77a7e9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "183c1889-3321-5d97-9c9a-43523d77a7e9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_183c5f75-7d1b-5168-acf6-d22fad2b04d2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ (with $a+b>0,\\;b+c>0,\\;c+a>0$). Prove that \n-- \\[\n-- \\frac{a}{a+b}+\\frac{b}{b+c}+\\frac{c}{c+a}\\ge \\frac{(a^{3}+b^{3}+c^{3})^{3}}{6\\,(a^{9}+b^{9}+c^{9})}\\,. \n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The admissibility conditions in the problem: `a`, `b`, and `c` are\nnonnegative, and the three pairwise sums appearing in denominators are\nstrictly positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a + b ∧ 0 < b + c ∧ 0 < c + a\n\n/-- The left-hand side of the asserted inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a / (a + b) + b / (b + c) + c / (c + a)\n\n/-- The right-hand side of the asserted inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (a ^ 3 + b ^ 3 + c ^ 3) ^ 3 / (6 * (a ^ 9 + b ^ 9 + c ^ 9))\n\n/-- The pointwise inequality asserted by the problem. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full assertion of the problem: for all nonnegative real numbers\n`a`, `b`, and `c` satisfying the three strict pairwise-sum conditions,\nthe stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "183c5f75-7d1b-5168-acf6-d22fad2b04d2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c8d27a3dfeaf3466c04ea26a2fef830f0f8a28c4a451333c1195bcbd45b225bb", "task_path": "tasks/nmp3_183c5f75-7d1b-5168-acf6-d22fad2b04d2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "183c5f75-7d1b-5168-acf6-d22fad2b04d2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_18422c90-2e26-55c2-8e0e-1b31c8edf49b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$ and $n$ be positive integers with $a\\ge (n-1)!$. Prove that there exist distinct prime numbers $p_1,p_2,\\dots,p_n$ such that for each $i=1,2,\\dots,n$, the prime $p_i$ divides $a+i$.\nimport Mathlib.Data.Nat.Prime.Basic\nimport Mathlib.Data.Nat.Factorial.Basic\n\nnamespace Problem\n\n/-- The two integrality/positivity hypotheses on `a` and `n` are represented by\nthe fact that both are natural numbers together with `0 < a` and `0 < n`. -/\ndef PositiveIntegers (a n : ℕ) : Prop :=\n 0 < a ∧ 0 < n\n\n/-- The lower bound `a ≥ (n - 1)!`, with factorial and inequality in `ℕ`. -/\ndef FactorialLowerBound (a n : ℕ) : Prop :=\n a ≥ Nat.factorial (n - 1)\n\n/-- Every member of the length-`n` family `p` is a prime natural number. -/\ndef AllPrime (n : ℕ) (p : Fin n → ℕ) : Prop :=\n ∀ i : Fin n, Nat.Prime (p i)\n\n/-- The primes in the length-`n` family `p` are pairwise distinct. -/\ndef PairwiseDistinct (n : ℕ) (p : Fin n → ℕ) : Prop :=\n Function.Injective p\n\n/-- For each original index `i = 1, ..., n`, the corresponding entry divides `a + i`.\nHere `i : Fin n` is represented by `i.val + 1`. -/\ndef DividesShifted (a n : ℕ) (p : Fin n → ℕ) : Prop :=\n ∀ i : Fin n, p i ∣ a + (i.val + 1)\n\n/-- There is a length-`n` family of pairwise distinct primes whose `i`-th entry\ndivides `a + i` for each `i = 1, ..., n`. -/\ndef HasDistinctPrimeDivisors (a n : ℕ) : Prop :=\n ∃ p : Fin n → ℕ,\n AllPrime n p ∧ PairwiseDistinct n p ∧ DividesShifted a n p\n\n/-- For all positive integers `a` and `n` with `a ≥ (n - 1)!`, there exist\ndistinct prime numbers `p_1, ..., p_n` such that `p_i` divides `a + i` for every\n`i = 1, ..., n`. -/\ndef Target : Prop :=\n ∀ (a n : ℕ),\n PositiveIntegers a n →\n FactorialLowerBound a n →\n HasDistinctPrimeDivisors a n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "18422c90-2e26-55c2-8e0e-1b31c8edf49b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ac38ccb4b677a37efdb752bf8a035e4bcaff2e22342570961ab8ec99ac672f18", "task_path": "tasks/nmp3_18422c90-2e26-55c2-8e0e-1b31c8edf49b", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "18422c90-2e26-55c2-8e0e-1b31c8edf49b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1856dc51-1d1b-5406-8a65-c626b0ba8ca5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle with circumcircle $\\Gamma$. Let $P$ be an interior point of $\\triangle ABC$. Let $K$, $L$, $M$ be the second intersections of the lines $AP$, $BP$, $CP$ with $\\Gamma$ (i.e. $K\\neq A$, $L\\neq B$, $M\\neq C$). The tangent to $\\Gamma$ at $C$ meets the line $AB$ at $S$. Suppose $SC=SP$. Prove that $MK=ML$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.Convex.Hull\nimport Mathlib.Geometry.Euclidean.Sphere.Tangent\n\n/-!\n# Formal statement of a planar Euclidean geometry problem\n\nThe source problem concerns a nondegenerate triangle `ABC`, an interior point `P`,\nthe second intersections of `AP`, `BP`, `CP` with the circumcircle, and the\nintersection `S` of the tangent at `C` with the line `AB`. The claimed conclusion\nis `MK = ML`.\n\nThis file records the statement as a proposition. It does not prove it.\n-/\n\nopen Set\nopen scoped Affine RealInnerProductSpace\n\nnoncomputable section\n\nnamespace Problem\n\n/-- Points in the Euclidean plane, represented as real coordinate vectors with two\ncoordinates. The affine structure on this type is the standard one. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Circles (more generally spheres) in the plane. In dimension two this is the\ncircumcircle type used in the statement. -/\nabbrev Circle : Type := EuclideanGeometry.Sphere Point\n\n/-- `IsTriangle A B C` says that `A`, `B`, and `C` are not collinear. In particular\nthis includes that the three vertices are distinct. -/\ndef IsTriangle (A B C : Point) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Point)\n\n/-- `IsCircumcircle Γ A B C` says that `Γ` is the circumcircle of triangle `ABC`:\nall three vertices lie on it, its radius is positive, and it is the unique sphere\nthrough those three non-collinear points. -/\ndef IsCircumcircle (Γ : Circle) (A B C : Point) : Prop :=\n A ∈ Γ ∧ B ∈ Γ ∧ C ∈ Γ ∧ 0 < Γ.radius ∧\n ∀ Ω : Circle, A ∈ Ω → B ∈ Ω → C ∈ Ω → Ω = Γ\n\n/-- `P` is an interior point of triangle `ABC`, i.e. a point in the topological\ninterior of the convex hull of its three vertices. -/\ndef IsInteriorPoint (P A B C : Point) : Prop :=\n P ∈ interior (convexHull ℝ ({A, B, C} : Set Point))\n\n/-- `IsSecondIntersection Γ X Y Z` says that `Z` is the unique intersection of the\nfull affine line through `X` and `Y` with `Γ` other than `X`. This encodes \"the\nsecond intersection of line `XY` with `Γ` (with `Z ≠ X`)\". -/\ndef IsSecondIntersection (Γ : Circle) (X Y Z : Point) : Prop :=\n X ∈ Γ ∧ Z ∈ Γ ∧ Z ∈ line[ℝ, X, Y] ∧ Z ≠ X ∧\n ∀ W : Point, W ∈ Γ → W ∈ line[ℝ, X, Y] → W ≠ X → W = Z\n\n/-- `IsTangentMeet Γ C A B S` says that `S` is the unique intersection of the\ntangent line to `Γ` at `C` with the full affine line `AB`. In the plane\n`Γ.orthRadius C` is precisely the tangent line to `Γ` at `C`, and\n`Γ.IsTangentAt C (Γ.orthRadius C)` records the tangency condition. -/\ndef IsTangentMeet (Γ : Circle) (C A B S : Point) : Prop :=\n Γ.IsTangentAt C (Γ.orthRadius C) ∧\n S ∈ Γ.orthRadius C ∧ S ∈ line[ℝ, A, B] ∧\n ∀ T : Point, T ∈ Γ.orthRadius C → T ∈ line[ℝ, A, B] → T = S\n\n/-- The proposition asserted by the problem: for every nondegenerate triangle\n`ABC` with circumcircle `Γ`, every interior point `P`, every choice of the second\nintersections `K`, `L`, `M` of `AP`, `BP`, `CP` with `Γ`, and the tangent\nintersection `S` satisfying `SC = SP`, one has `MK = ML`. -/\ndef Target : Prop :=\n ∀ (A B C : Point),\n IsTriangle A B C →\n ∀ (Γ : Circle),\n IsCircumcircle Γ A B C →\n ∀ (P : Point),\n IsInteriorPoint P A B C →\n ∀ (K L M : Point),\n IsSecondIntersection Γ A P K →\n IsSecondIntersection Γ B P L →\n IsSecondIntersection Γ C P M →\n ∀ (S : Point),\n IsTangentMeet Γ C A B S →\n dist S C = dist S P →\n dist M K = dist M L\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1856dc51-1d1b-5406-8a65-c626b0ba8ca5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "72baf8e7fd5af2322b3aa325d404a9c523ba7c69048da7a3f2daa3b7a0d49a60", "task_path": "tasks/nmp3_1856dc51-1d1b-5406-8a65-c626b0ba8ca5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1856dc51-1d1b-5406-8a65-c626b0ba8ca5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_185821e3-ab13-5c83-8439-485b89f1b1d4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb{R}\\to\\mathbb{R}$ satisfy \n-- \\[f(x+y+xy)=f(x)+f(y)+f(xy)\\qquad\\forall\\,x,y\\in\\mathbb{R}.\\] \n-- Prove that $f$ also satisfies the Cauchy additive equation \n-- \\[f(x+y)=f(x)+f(y)\\qquad\\forall\\,x,y\\in\\mathbb{R}.\\]\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The functional equation assumed for a function `f : ℝ → ℝ` in the problem. -/\ndef FunctionalEquation (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x + y + x * y) = f x + f y + f (x * y)\n\n/-- The Cauchy additive equation asserted as the conclusion in the problem. -/\ndef CauchyAdditive (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x + y) = f x + f y\n\n/-- The complete assertion: every real-valued function on `ℝ` satisfying the\ngiven functional equation also satisfies the Cauchy additive equation. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, FunctionalEquation f → CauchyAdditive f\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "185821e3-ab13-5c83-8439-485b89f1b1d4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "50808958ed62de41a530e0ead3e17b1bebb2c531ae515608998063e849a3b4c9", "task_path": "tasks/nmp3_185821e3-ab13-5c83-8439-485b89f1b1d4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "185821e3-ab13-5c83-8439-485b89f1b1d4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_18587b46-e50a-5d4d-a2c1-57d70da14bc6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be an integer greater than $1$. Suppose $2n$ points are given in the plane, no three of which are collinear. Exactly $n$ of the points are colored blue and the other $n$ are colored red. A line in the plane is called a *balancing line* if it passes through one blue point and one red point and, for each of the two half‑planes determined by the line, the number of blue points in that half‑plane equals the number of red points in the same half‑plane. Prove that there exist at least two balancing lines.\nimport Mathlib\n\n/-!\n# Balancing lines\n\nThis file formalizes the statement of the balancing-lines problem. The target is a\nproposition; no proof of it is supplied. A point of the plane is represented by a pair\nof real numbers, and a line by a nondegenerate affine equation `a * x + b * y = c`.\n-/\n\nnamespace Problem\n\n/-- A point in the Euclidean plane, represented by its two real coordinates. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- The affine equation `a * x + b * y = c` is satisfied by `p`. -/\ndef OnLine (a b c : ℝ) (p : Point) : Prop :=\n a * p.1 + b * p.2 = c\n\n/-- The equation `a * x + b * y = c` is a genuine line equation. -/\ndef IsLineEquation (a b : ℝ) : Prop :=\n a ≠ 0 ∨ b ≠ 0\n\n/-- Two line equations represent the same geometric line when their zero sets are equal. -/\ndef SameLine (a b c a' b' c' : ℝ) : Prop :=\n {p : Point | OnLine a b c p} = {p : Point | OnLine a' b' c' p}\n\n/-- The determinant test for three points of the plane to be collinear. -/\ndef CollinearTriple (p q r : Point) : Prop :=\n (q.1 - p.1) * (r.2 - p.2) = (q.2 - p.2) * (r.1 - p.1)\n\n/-- No three distinct points of `S` are collinear. -/\ndef NoThreeCollinear (S : Finset Point) : Prop :=\n ∀ p : Point, p ∈ S →\n ∀ q : Point, q ∈ S →\n ∀ r : Point, r ∈ S →\n p ≠ q → p ≠ r → q ≠ r → ¬ CollinearTriple p q r\n\n/-- `(a, b, c)` satisfies the defining conditions of a balancing line for the two\nfinite colour classes `blue` and `red`.\n\nThe line is genuine (`a` and `b` are not both zero), it passes through at least one\nblue and at least one red given point, and each of its two open half-planes contains\nequally many blue and red points. A point on the line belongs to neither open\nhalf-plane, which is why the two filters use the strict inequalities `<` and `>`.\n-/\ndef IsBalancingLine (blue red : Finset Point) (a b c : ℝ) : Prop :=\n IsLineEquation a b ∧\n (∃ p : Point, p ∈ blue ∧\n ∃ q : Point, q ∈ red ∧\n p ≠ q ∧ OnLine a b c p ∧ OnLine a b c q) ∧\n (blue.filter (fun p : Point => c < a * p.1 + b * p.2)).card =\n (red.filter (fun p : Point => c < a * p.1 + b * p.2)).card ∧\n (blue.filter (fun p : Point => a * p.1 + b * p.2 < c)).card =\n (red.filter (fun p : Point => a * p.1 + b * p.2 < c)).card\n\n/-- The statement of the problem.\n\nFor every natural number `n` greater than `1`, for every finite set `points` of\ncardinality `2 * n`, and for every disjoint blue and red colour classes each of\ncardinality `n` whose union is `points`, if no three points of `points` are collinear,\nthen there exist two balancing lines that are geometrically distinct.\n-/\ndef Target : Prop :=\n ∀ n : ℕ, 1 < n →\n ∀ points : Finset Point,\n points.card = 2 * n →\n ∀ blue red : Finset Point,\n blue.card = n →\n red.card = n →\n Disjoint blue red →\n blue ∪ red = points →\n NoThreeCollinear points →\n ∃ a₁ b₁ c₁ a₂ b₂ c₂ : ℝ,\n IsBalancingLine blue red a₁ b₁ c₁ ∧\n IsBalancingLine blue red a₂ b₂ c₂ ∧\n ¬ SameLine a₁ b₁ c₁ a₂ b₂ c₂\n\nend Problem\n\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "18587b46-e50a-5d4d-a2c1-57d70da14bc6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6ec5e60942d1a56445aef7d7805a28bb9bdf41f0a26486da63725868a33aaf44", "task_path": "tasks/nmp3_18587b46-e50a-5d4d-a2c1-57d70da14bc6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "18587b46-e50a-5d4d-a2c1-57d70da14bc6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1871b74e-157d-50b6-ac2a-e91f6e775944", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every integer $n\\ge 2$ there exists a polynomial \n-- \\[\n-- f(x)=x^n+a_1x^{\\,n-1}+a_2x^{\\,n-2}+\\dots+a_{n-1}x+a_n\n-- \\]\n-- with integer coefficients satisfying \n-- \n-- 1. $a_1,a_2,\\dots ,a_n\\neq0$ (all coefficients are non‑zero); \n-- 2. $f(x)$ is irreducible over $\\mathbb Z$ (i.e. it cannot be written as a product of two non‑constant polynomials with integer coefficients); \n-- 3. for every integer $x$, the integer $|f(x)|$ is not a prime number.\nimport Mathlib\n\n/-!\n# Statement: integer polynomials with no prime values\n\nThis file formalizes the assertion from `problem.md`. It defines the\nadmissibility conditions on an integer polynomial of prescribed degree and the\ntarget existence proposition. No proof of the target is supplied.\n-/\n\nnamespace Problem\n\n/-- The polynomial has the displayed monic form\n`X^n + a_1 X^(n-1) + ... + a_(n-1) X + a_n`,\nwith exact natDegree `n` and all of the `n` lower coefficients nonzero.\n\nThe element `a i` of `Fin n → ℤ` is the original coefficient `a_(i+1)`;\nits corresponding exponent is `n - 1 - i`. -/\ndef HasPrescribedCoefficientForm (n : ℕ) (f : Polynomial ℤ) : Prop :=\n f.Monic ∧ f.natDegree = n ∧\n ∃ a : Fin n → ℤ,\n (∀ i : Fin n, a i ≠ 0) ∧\n f = Polynomial.X ^ n +\n ∑ i : Fin n,\n Polynomial.C (a i) * Polynomial.X ^ (n - 1 - i.val)\n\n/-- The literal nonfactorization condition stated parenthetically in the\nproblem: `f` is not the product of two nonconstant integer polynomials. -/\ndef HasNoNonconstantFactorization (f : Polynomial ℤ) : Prop :=\n ¬ ∃ g h : Polynomial ℤ,\n g.natDegree ≠ 0 ∧ h.natDegree ≠ 0 ∧ f = g * h\n\n/-- The polynomial is irreducible in the ring `ℤ[X]`.\n\nFor the monic polynomials considered here this is equivalent to\n`HasNoNonconstantFactorization`, the parenthetical description in the problem:\nit cannot be written as a product of two nonconstant polynomials with integer\ncoefficients. -/\ndef IrreducibleOverInt (f : Polynomial ℤ) : Prop :=\n Irreducible f\n\n/-- For every integer input, the absolute value of the integer value is not a\nprime number. The integer absolute value is represented by `Int.natAbs`, so\nthe primality predicate is `Nat.Prime`. -/\ndef NoPrimeAbsoluteValues (f : Polynomial ℤ) : Prop :=\n ∀ x : ℤ, ¬ Nat.Prime (Int.natAbs (Polynomial.eval x f))\n\n/-- Complete admissibility predicate for an integer polynomial of degree `n`. -/\ndef IsAdmissiblePolynomial (n : ℕ) (f : Polynomial ℤ) : Prop :=\n HasPrescribedCoefficientForm n f ∧\n IrreducibleOverInt f ∧\n NoPrimeAbsoluteValues f\n\n/-- For the given natural-number degree `n`, at least one admissible integer\npolynomial exists. -/\ndef ExistsAdmissiblePolynomial (n : ℕ) : Prop :=\n ∃ f : Polynomial ℤ, IsAdmissiblePolynomial n f\n\n/-- The assertion of the problem: for every integer `n ≥ 2`, there exists a\npolynomial of the displayed monic form with all lower coefficients nonzero,\nwhich is irreducible over `ℤ`, and whose absolute value is never prime at any\ninteger input. -/\ndef Target : Prop :=\n ∀ n : ℕ, 2 ≤ n → ExistsAdmissiblePolynomial n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1871b74e-157d-50b6-ac2a-e91f6e775944", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f14413c76ebbb8212b707d25995d43b030c729a4bf73651afae6d47a2c1b6c1d", "task_path": "tasks/nmp3_1871b74e-157d-50b6-ac2a-e91f6e775944", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1871b74e-157d-50b6-ac2a-e91f6e775944", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_18c32780-0009-5115-807e-7dbcf4a64e67", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let ← denote the left‑arrow key on a standard keyboard. When typing in a text editor, each ordinary character is inserted at the current cursor position and the cursor moves one step to the right; pressing ← moves the cursor one step to the left (without deleting any character). For a string A we may insert any number of left‑arrow symbols among its letters, obtaining an “input” sequence. Typing that input sequence produces a resulting string B. We say that B is **reachable** from A if there exists a placement of left‑arrow symbols in A such that typing the resulting sequence yields B. (For example, typing “ab←cd←←e←←f” produces “faecdb”, so “faecdb” is reachable from “abcdef”.) Prove that for any two strings A and B, \n-- \\[A\\text{ is reachable from }B\\iff B\\text{ is reachable from }A.\\]\nimport Mathlib.Data.List.Basic\nimport Mathlib.Data.String.Basic\n\n/-!\n# Reachability under text-editor typing with the left-arrow key\n\nThis file formalizes the statement by giving an operational model of typing.\nThe sequence supplied to the editor is a list of keystrokes: either an\nordinary character (which is inserted at the cursor) or a left-arrow key\n(which moves the cursor one place left when possible).\n\nThe editor state is represented by the text left of the cursor, stored in\nreverse order, together with the text right of the cursor. The cursor starts\nat the beginning of an empty document.\n-/\n\nnamespace Problem\n\nuniverse u\n\nvariable {α : Type u}\n\n/-- A single keystroke: either type an ordinary character `char a`, or press\nthe left-arrow key `left`. -/\ninductive Keystroke (α : Type u) : Type u where\n | char : α → Keystroke α\n | left : Keystroke α\nderiving Repr\n\n/-- An editor state. `left` is the text strictly to the left of the cursor,\nstored in reverse order; `right` is the text from the cursor onward. -/\nstructure State (α : Type u) : Type u where\n left : List α\n right : List α\nderiving Repr\n\n/-- The visible text represented by an editor state. -/\ndef State.text (s : State α) : List α :=\n s.left.reverse ++ s.right\n\n/-- The initial state: an empty document with the cursor at its beginning. -/\ndef State.initial : State α :=\n ⟨[], []⟩\n\n/-- Perform one keystroke. An ordinary character is inserted immediately at\nthe cursor and the cursor advances past it. A left-arrow moves one character\nto the left; at the beginning of the document it has no effect. -/\ndef State.step : State α → Keystroke α → State α\n | ⟨left, right⟩, .char a => ⟨a :: left, right⟩\n | ⟨[], right⟩, .left => ⟨[], right⟩\n | ⟨a :: left, right⟩, .left => ⟨left, a :: right⟩\n\n/-- Run a list of keystrokes from the initial empty-document state. -/\ndef State.run (actions : List (Keystroke α)) : State α :=\n actions.foldl State.step State.initial\n\n/-- The ordinary characters occurring in a keystroke sequence, in order.\nLeft-arrow keystrokes contribute no characters. -/\ndef Keystroke.characters : Keystroke α → List α\n | .char a => [a]\n | .left => []\n\n/-- The ordinary characters occurring in an entire input sequence, in order. -/\ndef inputCharacters : List (Keystroke α) → List α\n | [] => []\n | k :: ks => Keystroke.characters k ++ inputCharacters ks\n\n/-- `actions` is the input sequence obtained by inserting left-arrow symbols\namong the letters of `A`, with no other ordinary characters. -/\ndef IsArrowPlacement (A : List α) (actions : List (Keystroke α)) : Prop :=\n inputCharacters actions = A\n\n/-- `Reachable A B` means that, starting from an empty document with the\ncursor at the beginning, there is an input sequence containing exactly the\nordinary characters of `A` in that order (with arbitrarily many left arrows\ninserted anywhere) whose resulting visible text is exactly `B`. -/\ndef Reachable (A B : List α) : Prop :=\n ∃ actions : List (Keystroke α),\n IsArrowPlacement A actions ∧ (State.run actions).text = B\n\n/-- String-level reachability: both strings are viewed as lists of\ncharacters. -/\ndef StringReachable (A B : String) : Prop :=\n Reachable A.toList B.toList\n\n/-- The concrete input sequence displayed in the problem's example:\n`ab←cd←←e←←f`. -/\ndef ExampleInput : List (Keystroke Char) :=\n [.char 'a', .char 'b', .left, .char 'c', .char 'd', .left, .left,\n .char 'e', .left, .left, .char 'f']\n\n/-- The example's input is an insertion of left arrows among the letters of\n`abcdef`. -/\ndef ExamplePlacement : Prop :=\n IsArrowPlacement \"abcdef\".toList ExampleInput\n\n/-- The example's input sequence produces the visible text `faecdb`. -/\ndef ExampleOutput : Prop :=\n (State.run ExampleInput).text = \"faecdb\".toList\n\n/-- The concrete reachability assertion made by the problem's example. -/\ndef ExampleReachable : Prop :=\n StringReachable \"abcdef\" \"faecdb\"\n\n/-- The assertion from the problem: for any two strings `A` and `B`,\n`A` is reachable from `B` if and only if `B` is reachable from `A`. -/\ndef Target : Prop :=\n ∀ A B : String, StringReachable B A ↔ StringReachable A B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "18c32780-0009-5115-807e-7dbcf4a64e67", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c76a20c625d67d05e90f3f6040041cd318741c9dbd4bbe07cf0d4692a6917ad6", "task_path": "tasks/nmp3_18c32780-0009-5115-807e-7dbcf4a64e67", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "18c32780-0009-5115-807e-7dbcf4a64e67", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_18c3ede3-9241-5cba-b1fa-8a6badec3eb8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{a}{b^{2}(ca+1)}+\\frac{b}{c^{2}(ab+1)}+\\frac{c}{a^{2}(cb+1)}\\ge\\frac{9}{(1+abc)(ab+bc+ca)}.\n-- \\]\nimport Mathlib\n\n/-!\nFormal statement of the inequality problem in `problem.md`.\n\nThe original claim is an unproved proposition. It is therefore represented as a\n`Prop`-valued definition rather than as a theorem with a proof.\n-/\n\nnamespace Problem\n\n/-- A real number is positive. -/\ndef Positive (x : ℝ) : Prop :=\n 0 < x\n\n/-- The three parameters have sum equal to three. -/\ndef SumEqThree (a b c : ℝ) : Prop :=\n a + b + c = 3\n\n/-- The common admissibility condition for the parameters: `a`, `b`, and `c` are\nstrictly positive real numbers whose sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Positive a ∧ Positive b ∧ Positive c ∧ SumEqThree a b c\n\n/-- The left-hand side of the inequality. Juxtaposition in the source denotes\nmultiplication: `ca = c * a` and similarly for `ab` and `cb`. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / (b ^ 2 * (c * a + 1)) +\n b / (c ^ 2 * (a * b + 1)) +\n c / (a ^ 2 * (c * b + 1))\n\n/-- The right-hand side of the inequality. The product written `abc` in the\nsource is `a * b * c`. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 9 / ((1 + a * b * c) * (a * b + b * c + c * a))\n\n/-- The assertion to be proved: for all positive real `a`, `b`, `c` satisfying\n`a + b + c = 3`, the stated cyclic sum is at least the stated right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "18c3ede3-9241-5cba-b1fa-8a6badec3eb8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5dba19caf8d79c0647434350f7a7ae92a5012cd15a140e9b7e4e9436274277b4", "task_path": "tasks/nmp3_18c3ede3-9241-5cba-b1fa-8a6badec3eb8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "18c3ede3-9241-5cba-b1fa-8a6badec3eb8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_18e71e6c-ce93-5cf1-8deb-b5e5498f3b75", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that all continuous functions $f:(0,\\infty)\\to\\mathbb R$ satisfying \n-- \\[\n-- \\bigl(f(x)-f(y)\\bigr)\\,\\Bigl(f\\Bigl(\\frac{x+y}{2}\\Bigr)-f\\bigl(\\sqrt{xy}\\bigr)\\Bigr)=0\\qquad\\forall x,y>0\n-- \\]\n-- are constant functions.\nimport Mathlib\n\n/-!\n# Formal statement: continuous solutions of a midpoint–geometric-mean equation\n\nThe source problem asks to prove that every continuous real-valued function on\nthe positive reals which satisfies\n\n`(f x - f y) * (f ((x + y) / 2) - f (sqrt (x * y))) = 0`\n\nfor all positive `x` and `y` must be constant.\n\nWe represent a function on `(0, ∞)` by its total real extension `f : ℝ → ℝ`,\nwith continuity only required on the open positive interval. This does not add\nany condition outside the source domain. The target is a proposition; no proof\nis supplied at this statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- The source domain `(0, ∞)`, as the open half-line of positive real numbers. -/\ndef PositiveDomain : Set ℝ := Set.Ioi 0\n\n/-- `f` is continuous on the positive real half-line. -/\ndef ContinuousOnPositive (f : ℝ → ℝ) : Prop :=\n ContinuousOn f PositiveDomain\n\n/-- The functional equation, imposed only for positive `x` and `y`.\n\nThe expression `(x + y) / 2` is the arithmetic mean and `Real.sqrt (x * y)` is\nthe geometric mean. The product of the two displayed differences is zero. -/\ndef SatisfiesFunctionalEquation (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, 0 < x → 0 < y →\n (f x - f y) *\n (f ((x + y) / 2) - f (Real.sqrt (x * y))) = 0\n\n/-- Admissibility of a candidate function: continuity on `(0, ∞)` together with\nthe source functional equation for all positive pairs. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ContinuousOnPositive f ∧ SatisfiesFunctionalEquation f\n\n/-- `f` is constant on the positive real half-line. -/\ndef ConstantOnPositive (f : ℝ → ℝ) : Prop :=\n ∃ c : ℝ, ∀ x : ℝ, 0 < x → f x = c\n\n/-- The complete assertion of the source problem: every continuous function on\n`(0, ∞)` satisfying the displayed equation for all positive `x, y` is constant\non `(0, ∞)`. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, Admissible f → ConstantOnPositive f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "18e71e6c-ce93-5cf1-8deb-b5e5498f3b75", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1de775d93b20826465226665507e841c201f6baa29b7865e557615f43a19fbc2", "task_path": "tasks/nmp3_18e71e6c-ce93-5cf1-8deb-b5e5498f3b75", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "18e71e6c-ce93-5cf1-8deb-b5e5498f3b75", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_18f4b0bc-06ed-5091-968a-217b8427cc16", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there exists a natural number $N$ such that for every natural number $n>N$, there are $2n$ consecutive composite integers, all of which are less than $n!$.\nimport Mathlib\n\n/-!\n# Formalization of the consecutive-composite-number statement\n\nThe source problem asks for a threshold `N` such that, for every natural number\n`n > N`, there are `2 * n` consecutive composite natural numbers, all below\n`n!`.\n\nThis file formalizes that assertion as a proposition-valued definition. It does\nnot provide a proof.\n-/\n\nnamespace Problem\n\n/-- A natural number is composite when it has a factorization into two natural\nnumbers both strictly greater than one.\n\nThis is the standard meaning of a positive composite integer and excludes `0`\nand `1`. -/\ndef Composite (m : ℕ) : Prop :=\n ∃ a b : ℕ, 1 < a ∧ 1 < b ∧ m = a * b\n\n/-- A block of `length` consecutive natural numbers starting at `start` consists\nentirely of composite numbers. Its elements are\n`start, start + 1, ..., start + length - 1`. -/\ndef ConsecutiveCompositeBlock (length start : ℕ) : Prop :=\n ∀ k : ℕ, k < length → Composite (start + k)\n\n/-- A block of `length` consecutive composite natural numbers starting at\n`start`, with every element of the block strictly below `bound`. -/\ndef ConsecutiveCompositeBlockBelow (length start bound : ℕ) : Prop :=\n ConsecutiveCompositeBlock length start ∧\n ∀ k : ℕ, k < length → start + k < bound\n\n/-- For a natural number `n`, there is a block of `2 * n` consecutive composite\nnatural numbers, all strictly less than `n!`. -/\ndef HasBlockOfTwiceNCompositesBelowFactorial (n : ℕ) : Prop :=\n ∃ start : ℕ, ConsecutiveCompositeBlockBelow (2 * n) start n.factorial\n\n/-- The statement of the source problem: there exists a natural-number threshold\n`N` such that every natural number `n` greater than `N` has a block of `2 * n`\nconsecutive composite natural numbers, all strictly below `n!`. -/\ndef Target : Prop :=\n ∃ N : ℕ, ∀ n : ℕ, N < n → HasBlockOfTwiceNCompositesBelowFactorial n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "18f4b0bc-06ed-5091-968a-217b8427cc16", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "98979bb540fbdbae293a2254168b1958d9cf535ebcb04407c22f1aa734bd5551", "task_path": "tasks/nmp3_18f4b0bc-06ed-5091-968a-217b8427cc16", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "18f4b0bc-06ed-5091-968a-217b8427cc16", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_19108494-bc2e-51fe-848f-d05f573f0ba8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b$ be positive integers such that $a+b^3$ is divisible by $a^2+3ab+3b^2-1$. Prove that $a^2+3ab+3b^2-1$ is divisible by the cube of an integer greater than $1$.\nimport Mathlib\n\n/-!\nFormal statement of the divisibility problem.\n\nThe original problem quantifies over positive integers `a` and `b`. We model\nthem as integers together with the explicit hypotheses `0 < a` and `0 < b`.\nThis retains the exact integer divisibility relation and the exact final\nquantifier over an integer greater than one.\n-/\n\nnamespace Problem\n\n/-- The integer expression `a^2 + 3ab + 3b^2 - 1` appearing in the problem. -/\ndef polynomial (a b : ℤ) : ℤ :=\n a ^ 2 + 3 * a * b + 3 * b ^ 2 - 1\n\n/-- The hypotheses of the problem: `a` and `b` are positive, and\n`a + b^3` is divisible by `a^2 + 3ab + 3b^2 - 1`. -/\ndef Admissible (a b : ℤ) : Prop :=\n 0 < a ∧ 0 < b ∧ polynomial a b ∣ a + b ^ 3\n\n/-- `N` is divisible by the cube of an integer greater than `1`. -/\ndef HasCubeDivisorGreaterThanOne (N : ℤ) : Prop :=\n ∃ n : ℤ, 1 < n ∧ n ^ 3 ∣ N\n\n/-- The conclusion of the problem for fixed `a` and `b`. -/\ndef Conclusion (a b : ℤ) : Prop :=\n HasCubeDivisorGreaterThanOne (polynomial a b)\n\n/-- The complete assertion to be proved. -/\ndef Target : Prop :=\n ∀ a b : ℤ, Admissible a b → Conclusion a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "19108494-bc2e-51fe-848f-d05f573f0ba8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9ea490f2eaa4768b4b88e59bd43cfeee3f5a9297437ec70c6030de2dc90781e3", "task_path": "tasks/nmp3_19108494-bc2e-51fe-848f-d05f573f0ba8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "19108494-bc2e-51fe-848f-d05f573f0ba8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_192d5301-0b82-5613-9dd0-fc9f31192cd4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=1$. Prove that \n-- \\[\n-- \\frac{1}{a^{2}+bc+a}+\\frac{1}{b^{2}+ca+b}+\\frac{1}{c^{2}+ab+c}\\le\\frac{1}{abc\\,(27abc+4)}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose sum is `1`, the inequality\n\n`1 / (a^2 + b*c + a) + 1 / (b^2 + c*a + b) + 1 / (c^2 + a*b + c) ≤\n 1 / (a*b*c*(27*a*b*c + 4))`.\n\nThis file only states the proposition; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real `a`, `b`, `c` with\n`a + b + c = 1`, the displayed three-term reciprocal inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a + b + c = 1 →\n 1 / (a ^ 2 + b * c + a) +\n 1 / (b ^ 2 + c * a + b) +\n 1 / (c ^ 2 + a * b + c) ≤\n 1 / (a * b * c * (27 * a * b * c + 4))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "192d5301-0b82-5613-9dd0-fc9f31192cd4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c06b370dd4511eaa3fa60d04436ef5076d6407657213b5f88236dd38c4b22127", "task_path": "tasks/nmp3_192d5301-0b82-5613-9dd0-fc9f31192cd4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "192d5301-0b82-5613-9dd0-fc9f31192cd4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_194910b0-2092-5394-a7b7-42c03b8facd0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $2011$ digits, each between $1$ and $9$, and such that each of the digits $1,3,7,9$ appears at least once, prove that among the $2011$‑digit integers that can be formed by arranging these digits there is at least one integer that is not prime.\nimport Mathlib.Data.Nat.Prime.Basic\nimport Mathlib.Data.Set.Basic\nimport Mathlib.Data.Fintype.BigOperators\nimport Mathlib.Logic.Equiv.Basic\n\n/-!\n# Formal statement of the 2011-digit arrangement problem\n\nThe problem quantifies over a sequence of 2011 decimal digits. Every digit is\nbetween 1 and 9, and each of 1, 3, 7, and 9 occurs at least once. An integer\nis obtainable by arranging the digits precisely when its digit sequence is a\npermutation of the given sequence. The assertion is that at least one such\n2011-digit integer is not prime.\n-/\n\nnamespace Problem\n\n/-- A decimal digit allowed by the problem: an integer between 1 and 9. -/\ndef IsAllowedDigit (d : Nat) : Prop :=\n 1 ≤ d ∧ d ≤ 9\n\n/--\nThe digit sequence has one digit for each index of `Fin 2011` (hence exactly\n2011 digits), all digits lie between 1 and 9, and each of the digits\n1, 3, 7, and 9 occurs at least once.\n-/\ndef IsAdmissibleDigitSequence (digits : Fin 2011 → Nat) : Prop :=\n (∀ i : Fin 2011, IsAllowedDigit (digits i)) ∧\n (∃ i : Fin 2011, digits i = 1) ∧\n (∃ i : Fin 2011, digits i = 3) ∧\n (∃ i : Fin 2011, digits i = 7) ∧\n (∃ i : Fin 2011, digits i = 9)\n\n/--\nInterpret an indexed sequence of decimal digits as a natural number, with the\nvalue at index 0 as the most significant digit and the value at index 2010 as\nthe units digit.\n-/\ndef fromDigits (digits : Fin 2011 → Nat) : Nat :=\n Finset.univ.sum (fun i : Fin 2011 => digits i * 10 ^ (2010 - i.val))\n\n/-- `x` is a natural number with exactly 2011 decimal digits. -/\ndef Is2011DigitNumber (x : Nat) : Prop :=\n 10 ^ (2011 - 1) ≤ x ∧ x < 10 ^ 2011\n\n/--\nThe sequence `arrangement` is obtained by permuting the positions of the\nsequence `digits`. This is the formal notion of arranging the given digits.\n-/\ndef IsArrangementOf (digits arrangement : Fin 2011 → Nat) : Prop :=\n ∃ perm : Equiv.Perm (Fin 2011), arrangement = fun i : Fin 2011 => digits (perm i)\n\n/--\nThe set of natural numbers that can be written as a 2011-digit integer by\narranging the given digit sequence.\n-/\ndef FormedIntegers (digits : Fin 2011 → Nat) : Set Nat :=\n {x | ∃ arrangement : Fin 2011 → Nat,\n IsArrangementOf digits arrangement ∧\n x = fromDigits arrangement ∧\n Is2011DigitNumber x}\n\n/--\nFor every admissible sequence of 2011 digits, among the 2011-digit integers\nformed by arranging those digits there exists an integer that is not prime.\n-/\ndef Target : Prop :=\n ∀ digits : Fin 2011 → Nat,\n IsAdmissibleDigitSequence digits →\n ∃ x : Nat, x ∈ FormedIntegers digits ∧ ¬ Nat.Prime x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "194910b0-2092-5394-a7b7-42c03b8facd0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f983193d778cc218827735731961a0410ddae258b7e0c6e886bec24e00e39cef", "task_path": "tasks/nmp3_194910b0-2092-5394-a7b7-42c03b8facd0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "194910b0-2092-5394-a7b7-42c03b8facd0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1959d4b1-5ab6-5f61-9c29-cc9266cc2e2b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- 3\\!\\left(\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\right)\\ge 9+\\sum_{cyc}\\frac{(a-b)^{2}}{(a+c)(b+c)}\\,,\n-- \\] \n-- where \\(\\displaystyle\\sum_{cyc}\\frac{(a-b)^{2}}{(a+c)(b+c)}=\n-- \\frac{(a-b)^{2}}{(a+c)(b+c)}+\\frac{(b-c)^{2}}{(b+a)(c+a)}+\\frac{(c-a)^{2}}{(c+b)(a+b)}\\).\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the cyclic rational inequality\n\nThe source problem asks one to prove, for positive real numbers `a`, `b`, and `c`,\n\n`3 * (a / b + b / c + c / a) ≥ 9 + Σ_cyc (a - b)^2 / ((a + c) * (b + c))`,\n\nwhere the cyclic sum is expanded explicitly in the problem statement.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum appearing on the right-hand side of the inequality.\n\nFor `(a, b, c)`, the three terms are obtained by the cyclic substitutions\n`(a, b, c) → (b, c, a) → (c, a, b)`. The denominators are written in the same\norder as in the source's explicit expansion.\n-/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n (a - b) ^ 2 / ((a + c) * (b + c)) +\n (b - c) ^ 2 / ((b + a) * (c + a)) +\n (c - a) ^ 2 / ((c + b) * (a + b))\n\n/-- The proposition asserted by the problem: for all positive reals `a`, `b`,\nand `c`, the displayed inequality holds.\n\nThe `\\!` in the source's `3\\!\\left(...\\right)` is TeX negative spacing, so the\ncoefficient is the natural number `3`, not a factorial.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n 3 * (a / b + b / c + c / a) ≥ 9 + cyclicSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1959d4b1-5ab6-5f61-9c29-cc9266cc2e2b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e4dd898f251dd850370e79317589708f2a70bb818b3ed6379388d0176e772b08", "task_path": "tasks/nmp3_1959d4b1-5ab6-5f61-9c29-cc9266cc2e2b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1959d4b1-5ab6-5f61-9c29-cc9266cc2e2b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_195df64b-9989-51ee-aba3-c7ffddd0b748", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $a$, $b$, $c$,\n-- \\[\n-- \\left(\\frac{a}{a+b}\\right)^{3}+\\left(\\frac{b}{b+c}\\right)^{3}+\\left(\\frac{c}{c+a}\\right)^{3}\\ge\\frac{3}{8}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the sum of the cubes of\n`a / (a + b)`, `b / (b + c)`, and `c / (c + a)` is at least `3 / 8`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n (a / (a + b)) ^ 3 + (b / (b + c)) ^ 3 + (c / (c + a)) ^ 3 ≥\n (3 / 8 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "195df64b-9989-51ee-aba3-c7ffddd0b748", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2e2257e5cead97a533b360393eac76c716f79566ccb262742517c7275332bc2f", "task_path": "tasks/nmp3_195df64b-9989-51ee-aba3-c7ffddd0b748", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "195df64b-9989-51ee-aba3-c7ffddd0b748", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_19604ae2-fa7a-54d0-b97d-5fc924df08c8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there is no integer $n$ for which $n^{7}+7$ is a perfect square; equivalently, the Diophantine equation \n-- $$n^{7}+7=m^{2}$$ \n-- has no solutions in integers $n,m$.\nimport Mathlib\n\nnamespace Problem\n\n/-- An integer `z` is a perfect square when it is the square of an integer. -/\ndef IsPerfectSquare (z : Int) : Prop :=\n ∃ (m : Int), z = m ^ (2 : Nat)\n\n/-- The first formulation: no integer `n` makes `n ^ 7 + 7` a perfect square. -/\ndef NoIntegerWithSquareResult : Prop :=\n ∀ (n : Int), ¬ IsPerfectSquare (n ^ (7 : Nat) + (7 : Int))\n\n/-- The associated Diophantine equation has an integer solution. -/\ndef EquationHasIntegerSolution : Prop :=\n ∃ (n : Int) (m : Int),\n n ^ (7 : Nat) + (7 : Int) = m ^ (2 : Nat)\n\n/-- The second formulation: the Diophantine equation has no integer solutions. -/\ndef NoIntegerSolution : Prop :=\n ¬ EquationHasIntegerSolution\n\n/-- The equivalence asserted by the phrase \"equivalently\", stated as a proposition. -/\ndef FormulationsEquivalent : Prop :=\n NoIntegerWithSquareResult ↔ NoIntegerSolution\n\n/-- The two formulations in the source are equivalent, by unfolding the definitions. -/\ntheorem formulations_equivalent : FormulationsEquivalent := by\n unfold FormulationsEquivalent NoIntegerWithSquareResult NoIntegerSolution\n EquationHasIntegerSolution IsPerfectSquare\n constructor\n · rintro h ⟨n, m, hnm⟩\n exact h n ⟨m, hnm⟩\n · rintro h n ⟨m, hnm⟩\n exact h ⟨n, m, hnm⟩\n\n/-- The formal target, using the explicitly quantified Diophantine formulation. -/\ndef Target : Prop :=\n NoIntegerSolution\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "19604ae2-fa7a-54d0-b97d-5fc924df08c8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ea93263e46192b225dcb8575594fa9581acdea4bde029ee4bfd3f2a2ae0ff6de", "task_path": "tasks/nmp3_19604ae2-fa7a-54d0-b97d-5fc924df08c8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "19604ae2-fa7a-54d0-b97d-5fc924df08c8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_19995fb2-2e23-564c-822e-876d4483b2db", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x$ and $y$ be distinct positive integers with $\\gcd(x,y)=1$. Prove that there exist infinitely many primes $p$ such that the $p$‑adic valuation $v_p\\!\\bigl(x^{\\,p-1}-y^{\\,p-1}\\bigr)$ is odd.\nimport Mathlib.Data.Set.Finite.Basic\nimport Mathlib.NumberTheory.Padics.PadicVal.Basic\n\n/-!\n# Formal statement of the problem\n\nThe problem asks, for arbitrary distinct positive coprime integers `x` and `y`,\nfor infinitely many primes `p` for which the `p`-adic valuation of\n`x ^ (p - 1) - y ^ (p - 1)` is odd.\n\nThe difference is formed in `ℤ`, since the integer power difference can be\nnegative when `x < y`; natural-number subtraction would truncate at zero and\nwould not represent the displayed integer expression, whose `p`-adic\nvaluation is then taken.\n-/\n\nnamespace Problem\n\n/-- The integer `x ^ (p - 1) - y ^ (p - 1)` whose `p`-adic valuation is being\nconsidered. The bases are cast to `ℤ` before subtraction so that the\nsubtraction is the usual integer subtraction, with no truncation. -/\ndef powerDifference (x y p : ℕ) : ℤ :=\n (x : ℤ) ^ (p - 1) - (y : ℤ) ^ (p - 1)\n\n/-- A prime `p` is admissible for `x` and `y` when the `p`-adic valuation of\n`x ^ (p - 1) - y ^ (p - 1)` is odd.\n\nThe valuation used is `padicValInt`, the natural-number-valued `p`-adic\nvaluation of an integer. The definition of admissibility includes primality of\n`p`, matching the phrase \"primes `p` such that ...\". -/\ndef AdmissiblePrime (x y p : ℕ) : Prop :=\n Nat.Prime p ∧ Odd (padicValInt p (powerDifference x y p))\n\n/-- The assertion for a fixed pair of natural numbers `x` and `y`. The four\nhypotheses say that `x` and `y` are positive, distinct, and have gcd equal to\none. The conclusion says that the set of admissible primes is infinite. -/\ndef TargetFor (x y : ℕ) : Prop :=\n 0 < x →\n 0 < y →\n x ≠ y →\n Nat.gcd x y = 1 →\n Set.Infinite {p : ℕ | AdmissiblePrime x y p}\n\n/-- The full universally quantified statement: for every pair of distinct\npositive coprime integers `x` and `y`, there are infinitely many primes `p`\nwith `v_p (x ^ (p - 1) - y ^ (p - 1))` odd. -/\ndef Target : Prop :=\n ∀ x y : ℕ,\n 0 < x →\n 0 < y →\n x ≠ y →\n Nat.gcd x y = 1 →\n Set.Infinite {p : ℕ | AdmissiblePrime x y p}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "19995fb2-2e23-564c-822e-876d4483b2db", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9e5681e6867e633b7aba628954a0de6219661c4a0fc7a6262405e53bf7e1b523", "task_path": "tasks/nmp3_19995fb2-2e23-564c-822e-876d4483b2db", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "19995fb2-2e23-564c-822e-876d4483b2db", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_199a18ca-8cdd-5cb6-885c-9c6050df50fe", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ with $xyz=1$. Prove that \n-- \\[\n-- \\frac{1}{(1+x)^3}+\\frac{1}{(1+y)^3}+\\frac{1}{(1+z)^3}\\ge\\frac{3}{8}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the positive-variable inequality\n\nLet positive real numbers `x`, `y`, and `z` satisfy `x * y * z = 1`.\nThe claimed assertion is\n`1 / (1 + x)^3 + 1 / (1 + y)^3 + 1 / (1 + z)^3 ≥ 3 / 8`.\n\nThis file only records the proposition to be proved; it does not assert a proof.\n-/\n\nnamespace Problem\n\n/-- The assertion in the problem: for all positive reals `x`, `y`, `z`\nwhose product is `1`, the displayed sum is at least `3 / 8`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → x * y * z = 1 →\n (1 / (1 + x) ^ 3 + 1 / (1 + y) ^ 3 + 1 / (1 + z) ^ 3 : ℝ) ≥\n (3 : ℝ) / 8\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "199a18ca-8cdd-5cb6-885c-9c6050df50fe", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ea7d63c4755ae2e404c335700575b2869874e536292ba5880fa51c573746bb7d", "task_path": "tasks/nmp3_199a18ca-8cdd-5cb6-885c-9c6050df50fe", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "199a18ca-8cdd-5cb6-885c-9c6050df50fe", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_19b3df2b-a869-5625-8c86-99842e3d97f7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c>0$ prove that \n-- \\[\n-- \\frac{2a+bc}{a^{2}+2bc}+\\frac{2b+ca}{b^{2}+2ca}+\\frac{2c+ab}{c^{2}+2ab}\\le 1+\\frac{2}{3}\\Bigl(\\frac{a}{bc}+\\frac{b}{ca}+\\frac{c}{ab}\\Bigr).\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for a three-variable positive-real inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\na single rational inequality. We package the exact assertion as a proposition.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- First summand on the left-hand side of the source inequality. -/\ndef firstTerm (a b c : ℝ) : ℝ :=\n ((2 : ℝ) * a + b * c) / (a ^ 2 + (2 : ℝ) * b * c)\n\n/-- Second summand on the left-hand side of the source inequality. -/\ndef secondTerm (a b c : ℝ) : ℝ :=\n ((2 : ℝ) * b + c * a) / (b ^ 2 + (2 : ℝ) * c * a)\n\n/-- Third summand on the left-hand side of the source inequality. -/\ndef thirdTerm (a b c : ℝ) : ℝ :=\n ((2 : ℝ) * c + a * b) / (c ^ 2 + (2 : ℝ) * a * b)\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef lhs (a b c : ℝ) : ℝ :=\n firstTerm a b c + secondTerm a b c + thirdTerm a b c\n\n/-- The parenthesized reciprocal sum on the right-hand side of the source inequality. -/\ndef reciprocalSum (a b c : ℝ) : ℝ :=\n a / (b * c) + b / (c * a) + c / (a * b)\n\n/-- The right-hand side of the inequality in the source problem. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (1 : ℝ) + ((2 : ℝ) / 3) * reciprocalSum a b c\n\n/-- The inequality asserted by the source problem for fixed positive `a`, `b`, `c`. -/\ndef inequalityCondition (a b c : ℝ) : Prop :=\n lhs a b c ≤ rhs a b c\n\n/-- The full source problem: for all positive real numbers `a`, `b`, and `c`,\nthe displayed inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → inequalityCondition a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "19b3df2b-a869-5625-8c86-99842e3d97f7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1198b8195d997cf44cf42c07d8a5c06cd126a327460c7bb5e0059fdc78da967b", "task_path": "tasks/nmp3_19b3df2b-a869-5625-8c86-99842e3d97f7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "19b3df2b-a869-5625-8c86-99842e3d97f7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_19b632f7-a280-5378-8b6b-99b4b5b2a64c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $ab+bc+ca=1$. Prove that \n-- \\[\n-- \\sqrt{4a^2+bc}+\\sqrt{4b^2+ca}+\\sqrt{4c^2+ab}+\\frac{12abc}{a+b+c}\\ge5.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable inequality\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca = 1`, that a certain sum of square roots plus a\nrational term is at least `5`.\n\nThis file records the statement only; it does not assert or provide a proof.\n-/\n\nnamespace Problem\n\n/-- The three variables are nonnegative real numbers. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The constraint `ab + bc + ca = 1`. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a * b + b * c + c * a = 1\n\n/-- The admissibility hypotheses of the source problem, in the stated order. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ Constraint a b c\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n Real.sqrt (4 * a ^ 2 + b * c) +\n Real.sqrt (4 * b ^ 2 + c * a) +\n Real.sqrt (4 * c ^ 2 + a * b) +\n (12 * a * b * c) / (a + b + c)\n\n/-- The inequality conclusion for a fixed triple. -/\nnoncomputable def Conclusion (a b c : ℝ) : Prop :=\n LHS a b c ≥ 5\n\n/-- The universal proposition stated by the problem. -/\nnoncomputable def Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "19b632f7-a280-5378-8b6b-99b4b5b2a64c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b17b5ba30f17c90ae84a9445c02dd2d201bde9d7a6e2814e2c354922fe54e34c", "task_path": "tasks/nmp3_19b632f7-a280-5378-8b6b-99b4b5b2a64c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "19b632f7-a280-5378-8b6b-99b4b5b2a64c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_19bae6b0-4d1d-56fd-9c83-ab07018906d5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any positive integers $a,b,c$, the rational number \n-- \\[\n-- \\frac{a^2+b^2+c^2}{3(ab+bc+ca)}\n-- \\]\n-- is never an integer.\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nFor all positive integers `a`, `b`, and `c`, the rational number\n\n`(a^2 + b^2 + c^2) / (3 * (a*b + b*c + c*a))`\n\nis not an integer.\n-/\n\nnamespace Problem\n\n/-- The rational expression appearing in the problem, for natural-number inputs. -/\ndef ratio (a b c : ℕ) : ℚ :=\n ((a : ℚ) ^ 2 + (b : ℚ) ^ 2 + (c : ℚ) ^ 2) /\n (3 * ((a : ℚ) * (b : ℚ) + (b : ℚ) * (c : ℚ) + (c : ℚ) * (a : ℚ)))\n\n/-- A rational number is an integer when it is the canonical image of an integer. -/\ndef IsInteger (q : ℚ) : Prop :=\n ∃ z : ℤ, q = (z : ℚ)\n\n/-- The proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℕ, 0 < a → 0 < b → 0 < c →\n ¬ IsInteger (ratio a b c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "19bae6b0-4d1d-56fd-9c83-ab07018906d5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1258d7ab506954261d289c401ace0983171cf6308895385c1cfccb9395a6b834", "task_path": "tasks/nmp3_19bae6b0-4d1d-56fd-9c83-ab07018906d5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "19bae6b0-4d1d-56fd-9c83-ab07018906d5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1a010b6a-a70d-573f-807f-52dde9258b1f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c>0$ and $3bc-a^2>0$, $3ac-b^2>0$, $3ab-c^2>0$, prove that \n-- \\[\n-- \\frac{b^3+c}{3bc-a^2}+\\frac{c^3+a}{3ca-b^2}+\\frac{a^3+b}{3ab-c^2}\\ge 3.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the inequality problem in `problem.md`.\n\nThe original problem asks to prove, for positive real numbers `a`, `b`, and `c`\nsatisfying the three displayed strict denominator inequalities, the cyclic\ninequality\n\n`(b^3 + c)/(3bc - a^2) + (c^3 + a)/(3ca - b^2)\n + (a^3 + b)/(3ab - c^2) ≥ 3`.\n\nThe declarations below state the admissibility predicate, the asserted\ninequality, and the universally quantified target proposition. No proof of the\ntarget is supplied, as this task is formalization-only.\n-/\n\nnamespace Problem\n\n/-- The condition `a`, `b`, and `c` are all strictly positive. -/\ndef PositiveParameters (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The first displayed strict denominator condition `3bc - a^2 > 0`. -/\ndef FirstDenominatorPositive (a b c : ℝ) : Prop :=\n 0 < 3 * b * c - a ^ 2\n\n/-- The second displayed strict denominator condition `3ac - b^2 > 0`. -/\ndef SecondDenominatorPositive (a b c : ℝ) : Prop :=\n 0 < 3 * a * c - b ^ 2\n\n/-- The third displayed strict denominator condition `3ab - c^2 > 0`. -/\ndef ThirdDenominatorPositive (a b c : ℝ) : Prop :=\n 0 < 3 * a * b - c ^ 2\n\n/-- The full set of hypotheses from the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositiveParameters a b c ∧\n FirstDenominatorPositive a b c ∧\n SecondDenominatorPositive a b c ∧\n ThirdDenominatorPositive a b c\n\n/-- The asserted inequality of the problem. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (b ^ 3 + c) / (3 * b * c - a ^ 2) +\n (c ^ 3 + a) / (3 * c * a - b ^ 2) +\n (a ^ 3 + b) / (3 * a * b - c ^ 2) ≥ 3\n\n/-- The full universally quantified proposition to be proved. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1a010b6a-a70d-573f-807f-52dde9258b1f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "77f2dc1ce8d9979cbafc2621fc9f2ea1c5bdcb785d331dd16743ab8458c737eb", "task_path": "tasks/nmp3_1a010b6a-a70d-573f-807f-52dde9258b1f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1a010b6a-a70d-573f-807f-52dde9258b1f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1a0a738c-51e8-5e1b-b488-2d48be53eb16", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\ge 0\\) (with \\(abc>0\\) so that the fractions are defined). Prove that \n-- \\[\n-- \\frac{(a+b+c)^{3}}{abc}\\;+\\;\\sqrt[3]{\\frac{ab+bc+ca}{a^{2}+b^{2}+c^{2}}}\\;\\ge\\;28.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formal statement for the three-variable inequality\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, and `c`\nwith `a * b * c > 0`, the inequality\n\n`(a + b + c)^3 / (a * b * c) + ∛((a*b + b*c + c*a) / (a^2 + b^2 + c^2)) ≥ 28`.\n\nMathlib's real power `Real.rpow x (1 / 3)` supplies the principal real cube root\nfor the nonnegative radicand. This file only states the target; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The principal real cube root, written using Mathlib's real power. For the\nnonnegative arguments occurring in the target this agrees with the usual real cube\nroot. -/\nnoncomputable def realCubeRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 3 : ℝ)\n\n/-- The assertion from the problem: for all nonnegative real `a`, `b`, `c` whose\nproduct is positive,\n`(a+b+c)^3/(abc) + ∛((ab+bc+ca)/(a^2+b^2+c^2)) ≥ 28`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c → a * b * c > 0 →\n (a + b + c) ^ 3 / (a * b * c)\n + realCubeRoot ((a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2))\n ≥ 28\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1a0a738c-51e8-5e1b-b488-2d48be53eb16", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "22824c79513b880dfbf4df33c4c8f7b906928cfbcf71ef8770f01e807f2f186c", "task_path": "tasks/nmp3_1a0a738c-51e8-5e1b-b488-2d48be53eb16", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1a0a738c-51e8-5e1b-b488-2d48be53eb16", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1a302354-3e57-534c-aa3f-a072113244de", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle and let $S$ denote its area. Prove that \n-- \\[\n-- 2(ab+bc+ca)-a^2-b^2-c^2\\;\\ge\\;\n-- \\frac{2a^2(b+c-a)}{\\,b+c\\,}+\\frac{2b^2(c+a-b)}{\\,c+a\\,}+\\frac{2c^2(a+b-c)}{\\,a+b\\,}\\;\\ge\\;4\\sqrt3\\,S.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for a triangle-area inequality\n\nThe source problem asks to prove a two-sided inequality for the positive side\nlengths `a`, `b`, `c` of a (nondegenerate) triangle and its area `S`.\n\nWe use Heron's formula to express the area in terms of the three side lengths.\nThe formula is definitional here: for a triangle with side lengths `a`, `b`, `c`,\nthe value `triangleAreaBySides a b c` is the nonnegative square root of the\nHeron product. The predicate `IsTriangleWithArea` records both the usual strict\nside-length conditions for a nondegenerate triangle and the identification of\n`S` with that area.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The semiperimeter `(a + b + c) / 2` of a triangle with side lengths\n`a`, `b`, and `c`. -/\ndef semiperimeter (a b c : ℝ) : ℝ :=\n (a + b + c) / 2\n\n/-- Heron's product\n`s (s - a) (s - b) (s - c)`, where `s` is the semiperimeter. -/\ndef heronProduct (a b c : ℝ) : ℝ :=\n semiperimeter a b c *\n (semiperimeter a b c - a) *\n (semiperimeter a b c - b) *\n (semiperimeter a b c - c)\n\n/-- The area of a triangle with side lengths `a`, `b`, and `c`, expressed by\nHeron's formula as the principal real square root of `heronProduct a b c`. -/\nnoncomputable def triangleAreaBySides (a b c : ℝ) : ℝ :=\n Real.sqrt (heronProduct a b c)\n\n/-- The three side lengths are positive and satisfy the three strict triangle\ninequalities, so they are the side lengths of a nondegenerate triangle. -/\ndef IsNondegenerateTriangle (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a < b + c ∧ b < c + a ∧ c < a + b\n\n/-- `S` is the area associated to the side lengths `a`, `b`, and `c`, as given\nby Heron's formula. -/\ndef HasTriangleArea (a b c S : ℝ) : Prop :=\n S = triangleAreaBySides a b c\n\n/-- `S` is the area of a nondegenerate triangle whose side lengths are\n`a`, `b`, and `c`. Since the area is determined by the three side lengths,\nthis combines the side-length conditions with the Heron-formula area condition. -/\ndef IsTriangleWithArea (a b c S : ℝ) : Prop :=\n IsNondegenerateTriangle a b c ∧ HasTriangleArea a b c S\n\n/-- The left-hand expression\n`2(ab + bc + ca) - a^2 - b^2 - c^2`. -/\ndef leftExpression (a b c : ℝ) : ℝ :=\n 2 * (a * b + b * c + c * a) - a ^ 2 - b ^ 2 - c ^ 2\n\n/-- The first summand of the middle expression:\n`2a^2(b+c-a)/(b+c)`. -/\ndef firstMiddleTerm (a b c : ℝ) : ℝ :=\n (2 * a ^ 2 * (b + c - a)) / (b + c)\n\n/-- The second summand of the middle expression:\n`2b^2(c+a-b)/(c+a)`. -/\ndef secondMiddleTerm (a b c : ℝ) : ℝ :=\n (2 * b ^ 2 * (c + a - b)) / (c + a)\n\n/-- The third summand of the middle expression:\n`2c^2(a+b-c)/(a+b)`. -/\ndef thirdMiddleTerm (a b c : ℝ) : ℝ :=\n (2 * c ^ 2 * (a + b - c)) / (a + b)\n\n/-- The middle expression\n`2a^2(b+c-a)/(b+c) + 2b^2(c+a-b)/(c+a) + 2c^2(a+b-c)/(a+b)`. -/\ndef middleExpression (a b c : ℝ) : ℝ :=\n firstMiddleTerm a b c + secondMiddleTerm a b c + thirdMiddleTerm a b c\n\n/-- The constant factor `4 * sqrt 3` in the right-hand expression. -/\nnoncomputable def fourSqrtThree : ℝ :=\n 4 * Real.sqrt 3\n\n/-- The right-hand expression `4 * sqrt 3 * S`. -/\nnoncomputable def rightExpression (S : ℝ) : ℝ :=\n fourSqrtThree * S\n\n/-- The first (left-to-middle) inequality in the displayed chain. -/\ndef FirstInequality (a b c : ℝ) : Prop :=\n leftExpression a b c ≥ middleExpression a b c\n\n/-- The second (middle-to-right) inequality in the displayed chain. -/\ndef SecondInequality (a b c S : ℝ) : Prop :=\n middleExpression a b c ≥ rightExpression S\n\n/-- The displayed two-sided inequality, written as the conjunction of\n`leftExpression >= middleExpression` and `middleExpression >= rightExpression`. -/\ndef InequalityChain (a b c S : ℝ) : Prop :=\n FirstInequality a b c ∧ SecondInequality a b c S\n\n/-- The target assertion: for every nondegenerate triangle with side lengths\n`a`, `b`, `c` and area `S`, the displayed two-sided inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c S : ℝ), IsTriangleWithArea a b c S → InequalityChain a b c S\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1a302354-3e57-534c-aa3f-a072113244de", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fb0998170cee376399215a2d21c357e35ca50e952f7401282bc4b9639ab0836d", "task_path": "tasks/nmp3_1a302354-3e57-534c-aa3f-a072113244de", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1a302354-3e57-534c-aa3f-a072113244de", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1a75400c-c5c9-547b-b097-333fffb89e3d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\sqrt[5]{\\frac{a^4}{b^2+bc+c^2}}+\\sqrt[5]{\\frac{b^4}{c^2+ca+a^2}}+\\sqrt[5]{\\frac{c^4}{a^2+ab+b^2}}\n-- \\;\\ge\\;\n-- \\sqrt[5]{27\\,(ab+bc+ca)}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of a cyclic fifth-root inequality\n\nThis file states, but does not prove, the inequality from `problem.md`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The principal real fifth root of a real number, implemented as the real\npower with exponent `1 / 5`. -/\ndef fifthRoot (x : ℝ) : ℝ :=\n Real.rpow x ((1 : ℝ) / 5)\n\n/-- For all positive real numbers `a`, `b`, and `c`, the cyclic sum of the\nfifth roots of `a^4 / (b^2 + b*c + c^2)`, and its two cyclic analogues, is at\nleast the fifth root of `27 * (a*b + b*c + c*a)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n fifthRoot (a ^ 4 / (b ^ 2 + b * c + c ^ 2)) +\n fifthRoot (b ^ 4 / (c ^ 2 + c * a + a ^ 2)) +\n fifthRoot (c ^ 4 / (a ^ 2 + a * b + b ^ 2)) ≥\n fifthRoot (27 * (a * b + b * c + c * a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1a75400c-c5c9-547b-b097-333fffb89e3d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "13217de0e3d79cc302343fcde551918514fffcc77d5365c65a2ae873276eb8dc", "task_path": "tasks/nmp3_1a75400c-c5c9-547b-b097-333fffb89e3d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1a75400c-c5c9-547b-b097-333fffb89e3d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1a8160fc-42e5-5112-b64b-a4072ecf4098", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be pairwise distinct positive integers satisfying $a+b=c+d=p$, where $p$ is a prime number with $p>3$. Prove that $abcd$ cannot be a perfect square.\nimport Mathlib.Data.Nat.Prime.Basic\n\n/-!\n# Formalization of the problem statement\n\nThe source problem asks us to prove that, for four pairwise distinct positive\nintegers `a`, `b`, `c`, and `d` whose two pair-sums are the same prime `p > 3`,\nthe product `a * b * c * d` cannot be a perfect square.\n\nThis file contains only the formal statement. `Problem.Target` is a\nproposition (a definition whose body is a `Prop`), not a proof of that\nproposition.\n-/\n\nnamespace Problem\n\n/-- Four natural numbers are pairwise distinct when all six possible pairs\nconsist of unequal numbers. -/\ndef PairwiseDistinct4 (a : ℕ) (b : ℕ) (c : ℕ) (d : ℕ) : Prop :=\n a ≠ b ∧ a ≠ c ∧ a ≠ d ∧ b ≠ c ∧ b ≠ d ∧ c ≠ d\n\n/-- A natural number is a perfect square when it is the square of a natural\nnumber. Since `a * b * c * d` is positive under the problem's hypotheses,\nthis is equivalent to being the square of an integer. -/\ndef IsPerfectSquare (n : ℕ) : Prop :=\n ∃ (m : ℕ), n = m ^ 2\n\n/-- The statement of the problem: for all positive integers `a`, `b`, `c`,\n`d`, and all primes `p > 3`, if `a`, `b`, `c`, `d` are pairwise distinct and\n`a + b = c + d = p`, then `a * b * c * d` is not a perfect square. -/\ndef Target : Prop :=\n ∀ (a : ℕ) (b : ℕ) (c : ℕ) (d : ℕ) (p : ℕ),\n (0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d) →\n PairwiseDistinct4 a b c d →\n (Nat.Prime p ∧ 3 < p) →\n (a + b = p ∧ c + d = p) →\n ¬ IsPerfectSquare (a * b * c * d)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1a8160fc-42e5-5112-b64b-a4072ecf4098", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1d4390d59d1b5a3f896aacaa0fa6c372c6262aab8afa75aac18628efe841a0cd", "task_path": "tasks/nmp3_1a8160fc-42e5-5112-b64b-a4072ecf4098", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1a8160fc-42e5-5112-b64b-a4072ecf4098", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1a84399f-e952-5941-a55f-13fddbf8a72a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with $ab+bc+ca>0$. Prove that \n-- \\[\n-- \\sum_{cyc}\\frac{a(b+c)}{a^{2}+bc}\\ge 2\\,.\n-- \\] \n-- (The sum is taken cyclically over $(a,b,c)$.)\nimport Mathlib\n\n/-!\n# Formalization of a cyclic nonnegative-real inequality\n\nThe source problem asks to prove a lower bound for a cyclic sum under the\nassumptions that `a`, `b`, and `c` are nonnegative and that\n`ab + bc + ca` is positive.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum `∑_cyc a(b+c)/(a²+bc)` from the problem statement,\nwritten explicitly in the cycle `(a, b, c)`. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n a * (b + c) / (a ^ 2 + b * c) +\n b * (c + a) / (b ^ 2 + c * a) +\n c * (a + b) / (c ^ 2 + a * b)\n\n/-- The admissibility assumptions on the real parameters in the source\nproblem: all three are nonnegative and `ab + bc + ca` is positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a * b + b * c + c * a\n\n/-- The proposition asserted by the source problem: for all nonnegative real\n`a`, `b`, `c` with `ab + bc + ca > 0`, the cyclic sum is at least `2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → 2 ≤ CyclicSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1a84399f-e952-5941-a55f-13fddbf8a72a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d3bc0953bdda400a2fcfe09fb0aadf1792383c1efde1f9911c6f4d2f7b3b5ed5", "task_path": "tasks/nmp3_1a84399f-e952-5941-a55f-13fddbf8a72a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1a84399f-e952-5941-a55f-13fddbf8a72a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1a98b097-3042-53c6-b5b7-9b2755863c8f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle (i.e., $a,b,c>0$ and $a0$. Prove that \n-- \\[\n-- \\frac{a(a-b)}{a^2+b^2}+\\frac{b(b-c)}{b^2+c^2}+\\frac{c(c-a)}{c^2+a^2}\\ge 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic rational inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\nthe inequality\n`a (a - b) / (a^2 + b^2) + b (b - c) / (b^2 + c^2) + c (c - a) / (c^2 + a^2) ≥ 0`.\n\nThe declaration `Problem.Target` packages the stated assumptions and conclusion as\na proposition. It is a statement definition only; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the cyclic inequality, as a real-valued expression. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * (a - b) / (a ^ 2 + b ^ 2) +\n b * (b - c) / (b ^ 2 + c ^ 2) +\n c * (c - a) / (c ^ 2 + a ^ 2)\n\n/-- The three positivity assumptions imposed on the variables in the source. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The asserted non-strict inequality for fixed positive real variables. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ 0\n\n/-- The complete formal target: for all positive real `a`, `b`, and `c`,\nthe cyclic sum is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1abe8c9c-23bb-57c9-9208-45f09e43d90e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9950f61ca830c23f4bd777b77badece64092f1fbde9627fa1289a248ca96ec2f", "task_path": "tasks/nmp3_1abe8c9c-23bb-57c9-9208-45f09e43d90e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1abe8c9c-23bb-57c9-9208-45f09e43d90e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1ac07017-20b6-580a-9bcc-bece4307ff12", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all real numbers \\(x,\\;y\\) with \\(01$, let $P(n)$ denote the largest prime divisor of $n$. Prove that there exist infinitely many positive integers $n$ such that \n-- $$P(n) 1` and asks\nfor a proof that infinitely many positive integers `n` satisfy\n`P(n) < P(n+1) < P(n+2)`.\n\nMathlib's `Nat.maxPrimeFac` is the largest prime divisor for every natural number greater\nthan one. In particular, for `1 < n`, `Nat.maxPrimeFac n` is prime, divides `n`, and\ndominates every prime divisor of `n`.\n-/\n\nnamespace Problem\n\n/-- `P n` is the largest prime divisor of `n`. This is meaningful for `n > 1`; the\nunderlying Mathlib function has a specified total extension, but the target includes the\ndomain condition `1 < n`. -/\ndef P (n : ℕ) : ℕ := Nat.maxPrimeFac n\n\n/-- For every argument in the intended domain, `P n` really is the greatest prime divisor\nof `n`. -/\ntheorem P_isGreatest_primeDivisor {n : ℕ} (hn : 1 < n) :\n IsGreatest {p : ℕ | p.Prime ∧ p ∣ n} (P n) := by\n simpa [P] using Nat.isGreatest_maxPrimeFac hn\n\n/-- The admissibility condition from the problem: `n` is a positive integer greater than\none and the largest prime divisors of the three consecutive integers form a strictly\nincreasing chain. -/\ndef Admissible (n : ℕ) : Prop :=\n 1 < n ∧ P n < P (n + 1) ∧ P (n + 1) < P (n + 2)\n\n/-- There are infinitely many positive integers `n > 1` satisfying\n`P(n) < P(n+1) < P(n+2)`. -/\ndef Target : Prop :=\n Set.Infinite {n : ℕ | Admissible n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1ac1c3d0-5f15-55ca-a3c4-c5e45b7e9ac7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f6ba61b9f85c76b4711e598167758dc787570a038dedc5ff3a0d9651eb556c02", "task_path": "tasks/nmp3_1ac1c3d0-5f15-55ca-a3c4-c5e45b7e9ac7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1ac1c3d0-5f15-55ca-a3c4-c5e45b7e9ac7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1acd7dcc-35b7-5a42-af73-0e825ae6789c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- \\frac{bc(b+c)}{a^{2}+bc}+\\frac{ac(a+c)}{b^{2}+ac}+\\frac{ab(a+b)}{c^{2}+ab}\\ge a+b+c.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable positive-real inequality\n\nThe source problem asks to prove an inequality under the hypothesis that three\nvariables are positive. Its ambient domain is formalized here as the real\nnumbers. The inequality is recorded as a proposition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and\n`c`, the stated cyclic sum is at least `a + b + c`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a ∧ 0 < b ∧ 0 < c →\n (b * c * (b + c)) / (a ^ 2 + b * c)\n + (a * c * (a + c)) / (b ^ 2 + a * c)\n + (a * b * (a + b)) / (c ^ 2 + a * b)\n ≥ a + b + c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1acd7dcc-35b7-5a42-af73-0e825ae6789c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "796c37e3e4426b866bdadb0c2538ce0bfe62413f7b82c6c487624a7d5fa874a4", "task_path": "tasks/nmp3_1acd7dcc-35b7-5a42-af73-0e825ae6789c", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1acd7dcc-35b7-5a42-af73-0e825ae6789c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1ace2e2c-6391-5c3e-bf0f-3b43ad2add25", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all real numbers $x,\\;y,\\;z$ the inequality\n-- \\[\n-- \\frac{x\\,(y+z)^{3}}{(y+z)^{2}+1}\\;+\\;\\frac{y\\,(x+z)^{3}}{(x+z)^{2}+1}\\;+\\;\\frac{z\\,(x+y)^{3}}{(x+y)^{2}+1}\n-- \\;\\le\\;\n-- \\frac{(x+y+z)^{4}}{(x+y+z)^{2}+1}\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The common denominator `u ^ 2 + 1` occurring in the inequality. -/\nnoncomputable def Denominator (u : ℝ) : ℝ :=\n u ^ 2 + 1\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LeftHandSide (x y z : ℝ) : ℝ :=\n x * (y + z) ^ 3 / Denominator (y + z) +\n y * (x + z) ^ 3 / Denominator (x + z) +\n z * (x + y) ^ 3 / Denominator (x + y)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def RightHandSide (x y z : ℝ) : ℝ :=\n (x + y + z) ^ 4 / Denominator (x + y + z)\n\n/-- The inequality whose truth for every triple of real numbers is asserted. -/\ndef InequalityHolds (x y z : ℝ) : Prop :=\n LeftHandSide x y z ≤ RightHandSide x y z\n\n/-- The full assertion: for all real numbers `x`, `y`, and `z`, the displayed\ninequality holds. -/\ndef Target : Prop :=\n ∀ (x y z : ℝ), InequalityHolds x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1ace2e2c-6391-5c3e-bf0f-3b43ad2add25", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fcc91df6703cfb5160a829a4e6aa26cc724b63ec919174afde31c69a91a5e26e", "task_path": "tasks/nmp3_1ace2e2c-6391-5c3e-bf0f-3b43ad2add25", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1ace2e2c-6391-5c3e-bf0f-3b43ad2add25", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1ad55dd2-3b8e-505a-ae59-2ec428e01899", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$ satisfying $abc=1$, prove that \n-- \\[\n-- \\frac{a}{\\,b(a+c)\\,}+\\frac{b}{\\,c(b+a)\\,}+\\frac{c}{\\,a(c+b)\\,}\\ge\\frac32\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the inequality problem\n\nThe source problem asks: for positive real numbers `a`, `b`, `c` with\n`a * b * c = 1`, prove that\n\n`a / (b * (a + c)) + b / (c * (b + a)) + c / (a * (c + b)) ≥ 3 / 2`.\n\nThis file only records the proposition to be proved; it does not supply a proof.\n-/\n\nnamespace Problem\n\n/-- The proposition asserted by the source problem: for all positive real numbers\n`a`, `b`, and `c` with `a * b * c = 1`, the displayed cyclic sum is at least\n`3 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n a / (b * (a + c)) + b / (c * (b + a)) + c / (a * (c + b)) ≥\n (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1ad55dd2-3b8e-505a-ae59-2ec428e01899", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6e1e947891a3d6c9ad584864f1c9f1c8055e62f7ab44401027066b71cd249144", "task_path": "tasks/nmp3_1ad55dd2-3b8e-505a-ae59-2ec428e01899", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1ad55dd2-3b8e-505a-ae59-2ec428e01899", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1adefc62-e26f-5486-bd49-bde5dd6083f2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be a group and let $a,b\\in G$ satisfy \n-- \\[\n-- a^{-1}b^{2}a=b^{3},\\qquad b^{-1}a^{2}b=a^{3}.\n-- \\] \n-- Prove that $a$ and $b$ are the identity element of $G$, i.e. $a=1=b\\,. $\nimport Mathlib\n\n/-!\nFormal statement of the group-theoretic problem.\n\nLet `G` be a group and let `a b : G` satisfy\n`a⁻¹ * b ^ 2 * a = b ^ 3` and `b⁻¹ * a ^ 2 * b = a ^ 3`.\nThe claimed conclusion is that both `a` and `b` are the identity of `G`.\n-/\n\nnamespace Problem\n\n/-- The two relations imposed on the elements `a` and `b` of a group `G`.\nThe exponents `2` and `3` are natural-number powers in the group structure. -/\ndef Admissible {G : Type*} [Group G] (a b : G) : Prop :=\n a⁻¹ * b ^ (2 : ℕ) * a = b ^ (3 : ℕ) ∧\n b⁻¹ * a ^ (2 : ℕ) * b = a ^ (3 : ℕ)\n\n/-- The assertion of the problem: in every group, any pair of elements satisfying\nthe two displayed relations must both be the identity element. -/\ndef Target : Prop :=\n ∀ (G : Type*) [Group G] (a b : G),\n Admissible a b → a = (1 : G) ∧ b = (1 : G)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1adefc62-e26f-5486-bd49-bde5dd6083f2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b661e0880fd00cf9efad0f37188d3a306200e1c1ae0007462eba5ff8bc59da51", "task_path": "tasks/nmp3_1adefc62-e26f-5486-bd49-bde5dd6083f2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1adefc62-e26f-5486-bd49-bde5dd6083f2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1ae22f95-563b-590b-aa24-a50bef3d7af1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c>0$, prove that \n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}+\\sqrt{\\frac{3abc}{a^{3}+b^{3}+c^{3}}}\\ge 4.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nFor positive real numbers `a`, `b`, and `c`, the problem asks to prove\n\n`a / b + b / c + c / a +\n Real.sqrt (3 * a * b * c / (a ^ 3 + b ^ 3 + c ^ 3)) ≥ 4`.\n\nThis file states the assertion as a proposition; it does not prove it.\n-/\n\nnamespace Problem\n\n/--\nThe left-hand side of the inequality, as a real-valued expression in three\nreal variables.\n-/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / b + b / c + c / a +\n Real.sqrt (((3 : ℝ) * a * b * c) /\n (a ^ (3 : ℕ) + b ^ (3 : ℕ) + c ^ (3 : ℕ)))\n\n/--\nThe assertion of the problem: for all positive real numbers `a`, `b`, and `c`,\nthe displayed left-hand side is at least the real number `4`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ (4 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1ae22f95-563b-590b-aa24-a50bef3d7af1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "19f04faebd88f39682c54e77466ae8154e1e690d9068b2fa4b8e676c295f6b4e", "task_path": "tasks/nmp3_1ae22f95-563b-590b-aa24-a50bef3d7af1", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1ae22f95-563b-590b-aa24-a50bef3d7af1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1b32b5c3-5c3a-593d-8049-1dea0917bd8a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(a_n)_{n\\ge0}$ be a sequence of real numbers satisfying \n-- \\[\n-- a_n = |a_{n+1}-a_{n+2}|\\qquad\\text{for all }n\\ge0.\n-- \\] \n-- Define $f:\\mathbb N_0\\times\\mathbb N_0\\to\\mathbb R$ by \n-- \\[\n-- f(n,k)=a_n a_k\\,(a_n-a_k)\\qquad\\text{for all }n,k\\ge0.\n-- \\] \n-- Prove that the sequence $(a_n)$ is bounded if and only if $f$ is the zero (null) function, i.e. $f(n,k)=0$ for all $n,k\\ge0\\,. $\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the recurrence problem\n\nThe problem considers a real sequence `a : ℕ → ℝ` satisfying\n`a n = |a (n+1) - a (n+2)|` for every natural number `n`, and the\nfunction on pairs of natural numbers defined by\n`f a (n,k) = a n * a k * (a n - a k)`.\n\nThe main statement is merely declared as a proposition: no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The sequence satisfies the recurrence\n`a n = |a (n + 1) - a (n + 2)|` for every `n ≥ 0`. -/\ndef Admissible (a : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, a n = |a (n + 1) - a (n + 2)|\n\n/-- A real sequence is bounded when all of its terms have a common absolute bound. -/\ndef BoundedSequence (a : ℕ → ℝ) : Prop :=\n ∃ M : ℝ, ∀ n : ℕ, |a n| ≤ M\n\n/-- The function `f` from `ℕ₀ × ℕ₀` to `ℝ` associated to a sequence `a`,\nnamely `f (n,k) = a n * a k * (a n - a k)`. -/\ndef f (a : ℕ → ℝ) : ℕ × ℕ → ℝ :=\n fun (p : ℕ × ℕ) => a p.1 * a p.2 * (a p.1 - a p.2)\n\n/-- A function on pairs of natural numbers is identically zero. -/\ndef IsZeroFunction (g : ℕ × ℕ → ℝ) : Prop :=\n ∀ p : ℕ × ℕ, g p = (0 : ℝ)\n\n/-- The assertion that an admissible sequence is bounded if and only if its\nassociated function `f` is identically zero. -/\ndef Target : Prop :=\n ∀ a : ℕ → ℝ,\n Admissible a → (BoundedSequence a ↔ IsZeroFunction (f a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1b32b5c3-5c3a-593d-8049-1dea0917bd8a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "25d682983832dfd4d327138b64c430a27e3e1c768fe40dbada169691f4a63994", "task_path": "tasks/nmp3_1b32b5c3-5c3a-593d-8049-1dea0917bd8a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1b32b5c3-5c3a-593d-8049-1dea0917bd8a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1b3e19d5-ded8-52ba-9542-613a0ce40df3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ satisfy $xy+yz+zx+xyz=4$. Prove that \n-- $$3\\left(\\frac1{\\sqrt{x}}+\\frac1{\\sqrt{y}}+\\frac1{\\sqrt{z}}\\right)^2\\ge (x+2)(y+2)(z+2).$$\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nFor all positive real numbers `x`, `y`, and `z` satisfying\n`x*y + y*z + z*x + x*y*z = 4`, prove the displayed inequality.\n-/\n\nnamespace Problem\n\n/-- The three real variables are all strictly positive. -/\ndef PositiveTriple (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The equation constraint `xy + yz + zx + xyz = 4`, over the reals. -/\ndef Equation (x y z : ℝ) : Prop :=\n x * y + y * z + z * x + x * y * z = 4\n\n/-- The inequality claimed by the problem, over the reals. -/\ndef ClaimedInequality (x y z : ℝ) : Prop :=\n 3 * (1 / Real.sqrt x + 1 / Real.sqrt y + 1 / Real.sqrt z) ^ 2 ≥\n (x + 2) * (y + 2) * (z + 2)\n\n/-- The full universally quantified assertion stated by the problem. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, PositiveTriple x y z → Equation x y z → ClaimedInequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1b3e19d5-ded8-52ba-9542-613a0ce40df3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ce5edfa140c229dcaa3babb1bb3b150bc1ea42d92b98254f394d508c418f7c07", "task_path": "tasks/nmp3_1b3e19d5-ded8-52ba-9542-613a0ce40df3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1b3e19d5-ded8-52ba-9542-613a0ce40df3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1b3f1dad-8977-5002-b92b-3524dbe9856c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c>0$ and $a+b+c=1$, prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{a}{a+b^{2}}+\\frac{27abc+1}{3\\bigl(a^{2}+b^{2}+c^{2}+1\\bigr)}\\le\\frac{33}{4}\\bigl(a^{2}+b^{2}+c^{2}\\bigr)\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic inequality problem\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c` whose sum is\none, to prove the displayed cyclic inequality. The declarations below record the\nconstituent predicates and the full proposition without supplying a proof.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum appearing in the problem, expanded in the order\n`(a,b,c)`, `(b,c,a)`, `(c,a,b)`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n a / (a + b ^ 2) + b / (b + c ^ 2) + c / (c + a ^ 2)\n\n/-- The three strict positivity hypotheses on `a`, `b`, and `c`. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The normalization hypothesis that the three variables sum to one. -/\ndef SumOne (a b c : ℝ) : Prop :=\n a + b + c = 1\n\n/-- The full proposition asserted by the problem: for all positive real numbers\n`a`, `b`, and `c` with `a + b + c = 1`, the cyclic-sum inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n PositiveTriple a b c →\n SumOne a b c →\n cyclicSum a b c +\n (27 * a * b * c + 1) /\n (3 * (a ^ 2 + b ^ 2 + c ^ 2 + 1)) ≤\n (33 / 4 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1b3f1dad-8977-5002-b92b-3524dbe9856c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8f1afe890ea0519bc4b46f7a45548bbe5cc7e77dc7030899d220164bf7d364e7", "task_path": "tasks/nmp3_1b3f1dad-8977-5002-b92b-3524dbe9856c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1b3f1dad-8977-5002-b92b-3524dbe9856c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1b8aeca9-855b-50ee-b618-1a6fde12e65f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c,d\\ge0$ satisfy \n-- \\[\n-- \\frac1{3a+1}+\\frac1{3b+1}+\\frac1{3c+1}+\\frac1{3d+1}=1,\n-- \\]\n-- prove that \n-- \\[\n-- 2(a+b+c+d)+1\\;\\ge\\;9\\sqrt[3]{abcd}\\;\\ge\\;9\\sqrt[4]{abcd}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nFor nonnegative real numbers `a`, `b`, `c`, and `d` satisfying\n`1 / (3a + 1) + 1 / (3b + 1) + 1 / (3c + 1) + 1 / (3d + 1) = 1`,\nthe problem asks us to prove\n`2(a + b + c + d) + 1 ≥ 9 * (abcd)^(1/3) ≥ 9 * (abcd)^(1/4)`.\n\nThe real cube-root and fourth-root expressions are represented by `Real.rpow`\nwith exponents `1 / 3` and `1 / 4`. The hypotheses imply that `a * b * c * d`\nis nonnegative, which is the domain on which these real powers agree with the\nordinary real odd/even radical expressions.\n-/\n\nnamespace Problem\n\n/-- The hypotheses of the problem: all four variables are nonnegative and the\nsum of the four displayed reciprocal terms is equal to one. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 ≤ d ∧\n (1 : ℝ) / (3 * a + 1) + (1 : ℝ) / (3 * b + 1) +\n (1 : ℝ) / (3 * c + 1) + (1 : ℝ) / (3 * d + 1) = 1\n\n/-- The real cube root of a nonnegative real number, encoded as the real power\nwith exponent `1 / 3`. -/\nnoncomputable def CubeRoot (x : ℝ) : ℝ :=\n Real.rpow x ((1 : ℝ) / 3)\n\n/-- The real fourth root of a nonnegative real number, encoded as the real\npower with exponent `1 / 4`. -/\nnoncomputable def FourthRoot (x : ℝ) : ℝ :=\n Real.rpow x ((1 : ℝ) / 4)\n\n/-- The conclusion of the problem: the displayed two-term chain of\nnon-strict inequalities. Both radical expressions are roots of `a * b * c * d`. -/\ndef Conclusion (a b c d : ℝ) : Prop :=\n 2 * (a + b + c + d) + 1 ≥ 9 * CubeRoot (a * b * c * d) ∧\n 9 * CubeRoot (a * b * c * d) ≥ 9 * FourthRoot (a * b * c * d)\n\n/-- The complete statement to be proved. It quantifies over four real numbers\nin the displayed order, assumes the four nonnegativity conditions and the\nreciprocal-sum equation, and concludes the chain of inequalities. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Conclusion a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1b8aeca9-855b-50ee-b618-1a6fde12e65f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8963ff1ca5aac9214cefb2ed6a89b61ecdfd85bcec15c7bd03cfb81da04c086f", "task_path": "tasks/nmp3_1b8aeca9-855b-50ee-b618-1a6fde12e65f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1b8aeca9-855b-50ee-b618-1a6fde12e65f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1bace481-f89b-5360-affd-9fa2df5acea8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{ab+bc+ca}{abc}+3\\;\\ge\\;\\frac{(a+1)^2}{a+b}+\\frac{(b+1)^2}{b+c}+\\frac{(c+1)^2}{c+a}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of a three-variable real inequality\n\nThe source problem asks, for all positive real numbers `a`, `b`, and `c`\nwith `a + b + c = 3`, to prove the stated inequality.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, `c`\nsatisfying `a + b + c = 3`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a + b + c = 3 →\n (a * b + b * c + c * a) / (a * b * c) + 3 ≥\n (a + 1) ^ 2 / (a + b) +\n (b + 1) ^ 2 / (b + c) +\n (c + 1) ^ 2 / (c + a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1bace481-f89b-5360-affd-9fa2df5acea8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "65bd4a16954c757a87f0a4b0f2c7bfb8e08a50b69c8f60c4db2c85d9cc999357", "task_path": "tasks/nmp3_1bace481-f89b-5360-affd-9fa2df5acea8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1bace481-f89b-5360-affd-9fa2df5acea8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1bbe83d0-656a-5a06-ae2c-595ff180da83", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k\\in\\mathbb N$. Prove that there exist infinitely many positive integers $n$ such that the product of any $n$ consecutive integers is divisible by $(n+k)^2+1\\,. $\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The product of `n` consecutive integers beginning at the integer `a`. -/\ndef consecutiveProduct (n : ℕ) (a : ℤ) : ℤ :=\n ∏ i ∈ Finset.range n, (a + (i : ℤ))\n\n/-- The modulus `(n + k)^2 + 1`, regarded as an integer. -/\ndef targetModulus (k n : ℕ) : ℤ :=\n ((n + k : ℕ) ^ 2 + 1 : ℤ)\n\n/-- Every block of `n` consecutive integers has product divisible by\n`(n + k)^2 + 1`. -/\ndef allConsecutiveProductsDivisible (k n : ℕ) : Prop :=\n ∀ a : ℤ, targetModulus k n ∣ consecutiveProduct n a\n\n/-- The admissibility condition on the positive integer `n` for a fixed `k`. -/\ndef Admissible (k n : ℕ) : Prop :=\n 0 < n ∧ allConsecutiveProductsDivisible k n\n\n/-- For every natural number `k`, there are infinitely many positive integers `n`\nsuch that the product of any `n` consecutive integers is divisible by\n`(n + k)^2 + 1`. -/\ndef Target : Prop :=\n ∀ k : ℕ, Set.Infinite {n : ℕ | Admissible k n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1bbe83d0-656a-5a06-ae2c-595ff180da83", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6b17ca080cff968194a6c222cf2add2d50af2988e6cb94a574b9dc5bced3a804", "task_path": "tasks/nmp3_1bbe83d0-656a-5a06-ae2c-595ff180da83", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1bbe83d0-656a-5a06-ae2c-595ff180da83", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1c05c5e8-4a59-56e3-8785-803ed71ae633", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all non‑negative real numbers \\(a,b,c\\),\n-- \\[\n-- \\sum_{\\mathrm{sym}}\\!\\Bigl(a^4b^2+a^{\\,2+\\sqrt2}\\,b^2c^{\\,2-\\sqrt2}\\Bigr)\\;\\ge\\;\n-- \\sum_{\\mathrm{sym}}\\!\\Bigl(a^4bc+a^3b^3\\Bigr),\n-- \\]\n-- where \\(\\sum_{\\mathrm{sym}}\\) denotes the sum over all permutations of the variables \\(a,b,c\\).\nimport Mathlib\n\n/-!\n# Formal statement for the symmetric inequality problem\n\nThe source problem asks to prove an inequality for all non-negative real numbers\n`a`, `b`, and `c`. The notation `∑_sym` is interpreted literally as the sum over\nall six permutations of the three variables, as stated in the problem.\n\nThe declarations below only formalize the proposition. No proof of `Problem.Target`\nis supplied.\n-/\n\nnamespace Problem\n\n/-- The sum `∑_sym f` over all permutations of the three variables `a`, `b`, `c`.\n\nConcretely, `Equiv.Perm (Fin 3)` enumerates the six bijections of the three\npositions, and the vector `![a, b, c]` is permuted by each bijection. Thus all\nsix terms (including the identity permutation) occur exactly once. -/\nnoncomputable def symSum (f : ℝ → ℝ → ℝ → ℝ) (a b c : ℝ) : ℝ :=\n ∑ σ : Equiv.Perm (Fin 3),\n f (![a, b, c] (σ 0)) (![a, b, c] (σ 1)) (![a, b, c] (σ 2))\n\n/-- One summand on the left-hand side before applying the symmetric sum:\n`a^4 b^2 + a^(2 + sqrt 2) b^2 c^(2 - sqrt 2)`. -/\nnoncomputable def lhsSummand (a b c : ℝ) : ℝ :=\n a ^ (4 : ℕ) * b ^ (2 : ℕ) +\n a ^ (2 + Real.sqrt 2 : ℝ) * b ^ (2 : ℕ) *\n c ^ (2 - Real.sqrt 2 : ℝ)\n\n/-- One summand on the right-hand side before applying the symmetric sum:\n`a^4 b c + a^3 b^3`. -/\nnoncomputable def rhsSummand (a b c : ℝ) : ℝ :=\n a ^ (4 : ℕ) * b * c + a ^ (3 : ℕ) * b ^ (3 : ℕ)\n\n/-- The left-hand side of the target inequality:\n`∑_sym (a^4 b^2 + a^(2 + sqrt 2) b^2 c^(2 - sqrt 2))`. -/\nnoncomputable def SymLHS (a b c : ℝ) : ℝ :=\n symSum lhsSummand a b c\n\n/-- The right-hand side of the target inequality:\n`∑_sym (a^4 b c + a^3 b^3)`. -/\nnoncomputable def SymRHS (a b c : ℝ) : ℝ :=\n symSum rhsSummand a b c\n\n/-- The pointwise inequality asserted for a triple of non-negative reals. -/\ndef Inequality (a b c : ℝ) : Prop :=\n SymLHS a b c ≥ SymRHS a b c\n\n/-- The complete formal target: for all non-negative real numbers `a`, `b`, `c`,\nthe symmetric sum on the left is at least the symmetric sum on the right. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 ≤ a → 0 ≤ b → 0 ≤ c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c05c5e8-4a59-56e3-8785-803ed71ae633", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "be03c9dd096f951a8f239315001b1b5e53daa7f740873a6c5489f0fd3e2d3071", "task_path": "tasks/nmp3_1c05c5e8-4a59-56e3-8785-803ed71ae633", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c05c5e8-4a59-56e3-8785-803ed71ae633", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1c1426af-38b7-50a0-9d9b-fb2d130e8434", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any positive integer $n$ and any collection of $2n-1$ integers, there exists a subset of exactly $n$ of these integers whose sum is divisible by $n$.\nimport Mathlib.Algebra.BigOperators.Group.Finset.Basic\nimport Mathlib.Data.Int.Basic\n\n/-!\n# Formal statement of the subset-sum divisibility problem\n\nThe problem asks us to prove that, for every positive natural number `n` and\nevery collection of `2 * n - 1` integers, some subcollection of exactly `n`\nintegers has sum divisible by `n`.\n\nWe model a collection, together with its multiplicity/position data, as a\nfunction from the finite index type `Fin (2 * n - 1)` to `Int`. A subcollection\nof exactly `n` entries is a finite set of indices of cardinality `n`; its sum is\nthe corresponding finite sum of the indexed integers.\n-/\n\nnamespace Problem\n\n/-- A collection of `2 * n - 1` integers, indexed by its positions. -/\nabbrev IntegerCollection (n : ℕ) : Type :=\n Fin (2 * n - 1) → ℤ\n\n/--\n`IsNSubsetSumDivisible n a S` says that `S` is a subset of exactly `n`\npositions in the collection `a`, and the sum of the integers at those positions\nis divisible by `n` (as an integer).\n-/\ndef IsNSubsetSumDivisible (n : ℕ) (a : IntegerCollection n)\n (S : Finset (Fin (2 * n - 1))) : Prop :=\n S.card = n ∧ (n : ℤ) ∣ Finset.sum S (fun i => a i)\n\n/--\nThe target proposition: for every positive integer `n` and every collection of\n`2 * n - 1` integers, there exists a subset of exactly `n` of the collected\nintegers whose sum is divisible by `n`.\n-/\ndef Target : Prop :=\n ∀ (n : ℕ), 0 < n →\n ∀ (a : IntegerCollection n),\n ∃ S : Finset (Fin (2 * n - 1)),\n IsNSubsetSumDivisible n a S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c1426af-38b7-50a0-9d9b-fb2d130e8434", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9d440f6ac45e015b3d4dde96676c8abe63b874c3381426482cebb20ab5dd00e3", "task_path": "tasks/nmp3_1c1426af-38b7-50a0-9d9b-fb2d130e8434", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c1426af-38b7-50a0-9d9b-fb2d130e8434", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1c14872e-931b-536d-8bbc-d931a46938a2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers such that $xyz=1$. Prove that \n-- \\[\n-- \\frac{x^{5}}{x^{9}+2}+\\frac{y^{5}}{y^{9}+2}+\\frac{z^{5}}{z^{9}+2}\\le 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion: for all positive real numbers `x`, `y`, and `z` with\n`x * y * z = 1`, the stated sum of three rational expressions is at most `1`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x * y * z = 1 →\n x ^ 5 / (x ^ 9 + 2) + y ^ 5 / (y ^ 9 + 2) + z ^ 5 / (z ^ 9 + 2) ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c14872e-931b-536d-8bbc-d931a46938a2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5a67796365b72ab66bb44bf9d5b23dab5f1920c68ffb32a5d2364b4aef15d5f3", "task_path": "tasks/nmp3_1c14872e-931b-536d-8bbc-d931a46938a2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c14872e-931b-536d-8bbc-d931a46938a2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1c3a3487-05e8-5fc1-9883-12a5d9c9b8c0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\neq0$ be an integer. For every sequence of integers $A=(a_0,a_1,\\dots,a_n)$ satisfying $0\\le a_i\\le i$ for each $i=0,1,\\dots,n$, define the transformation $t$ by\n-- $$t(A)=\\bigl(t(a_0),t(a_1),\\dots,t(a_n)\\bigr),$$\n-- where $t(a_i)$ is the number of terms $a_j$ with $j\n ((Finset.univ.filter\n (fun j : EntryIndex n => j < i ∧ A j ≠ A i)).card : ℤ)\n\n/-- A sequence is fixed by the transformation `t`. -/\ndef FixedPoint (n : ℕ) (A : Entry n) : Prop :=\n transform n A = A\n\n/-- From `A`, one reaches a fixed point after some number `k` of applications\nof `t` with `k < n` (equivalently `k ≤ n - 1`). -/\ndef ReachesFixedPointWithin (n : ℕ) (A : Entry n) : Prop :=\n ∃ k : ℕ, k < n ∧\n ∃ B : Entry n, B = (transform n)^[k] A ∧ FixedPoint n B\n\n/-- For every nonzero `n`, every admissible sequence reaches a fixed point of\n`t` after fewer than `n` applications of `t`. -/\ndef Target : Prop :=\n ∀ n : ℕ, n ≠ 0 →\n ∀ A : Entry n, Admissible n A → ReachesFixedPointWithin n A\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c3a3487-05e8-5fc1-9883-12a5d9c9b8c0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f444a7a491c9984ba159acfda1a1d374f700d0d11c15e7075dffcfbaa28609c8", "task_path": "tasks/nmp3_1c3a3487-05e8-5fc1-9883-12a5d9c9b8c0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c3a3487-05e8-5fc1-9883-12a5d9c9b8c0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1c4f8a08-1bb0-562c-acb6-09a325ad5fbf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A triangle $ABC$ satisfies $\\angle ACB=60^\\circ$. Let $AA_1$ and $BB_1$ be the internal bisectors of $\\angle BAC$ and $\\angle ABC$, respectively, with $A_1\\in BC$ and $B_1\\in CA$. The line $A_1B_1$ meets the circumcircle of $ABC$ again at points $A_2$ and $B_2$. Let $R$ be the midpoint of the arc $AB$ of the circumcircle that does **not** contain $C$, and let $P$ and $Q$ be the midpoints of segments $A_1B_1$ and $A_2B_2$, respectively. Prove that $RP=RQ$.\n/-\nFormalization of the statement in `problem.md`.\n\nThe ambient plane is the real Euclidean plane `ℝ²`. We use explicit\nrelational definitions for the geometric constructions appearing in the\nproblem. In particular, a circumcircle is represented by its centre and\npositive radius, and an arc midpoint of the circumcircle is represented by\nthe corresponding point on the circle.\n-/\n\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The real Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The signed area (two-dimensional cross product) of two vectors. -/\ndef cross (u v : Plane) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- The points `A`, `B`, and `C` are collinear. -/\ndef Collinear (A B C : Plane) : Prop :=\n cross (B - A) (C - A) = 0\n\n/-- `X` lies on the closed segment with endpoints `A` and `B`. -/\ndef OnSegment (X A B : Plane) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ X = (1 - t) • A + t • B\n\n/-- `X` lies on the affine line through the distinct points `A` and `B`. -/\ndef OnLine (X A B : Plane) : Prop :=\n ∃ t : ℝ, X = A + t • (B - A)\n\n/-- `X` and `Y` lie strictly on opposite sides of the line through `A` and `B`. -/\ndef StrictlyOppositeSides (A B X Y : Plane) : Prop :=\n cross (B - A) (X - A) * cross (B - A) (Y - A) < 0\n\n/-- `X` lies on the circle with centre `O` and radius `r`. -/\ndef OnCircle (O : Plane) (r : ℝ) (X : Plane) : Prop :=\n dist O X = r\n\n/-- The circle with centre `O` and positive radius `r` passes through `A`, `B`,\nand `C`, hence is the circumcircle of the triangle `ABC`. Non-collinearity\nof `A`, `B`, and `C` makes this circle unique. -/\ndef IsCircumcircle (O : Plane) (r : ℝ) (A B C : Plane) : Prop :=\n 0 < r ∧ OnCircle O r A ∧ OnCircle O r B ∧ OnCircle O r C\n\n/-- `X` is the foot on the side `UW` of the internal angle bisector of\n`∠UVW`. The side condition selects the internal (not the external)\nbisector. -/\ndef IsInternalAngleBisectorFoot (V U W X : Plane) : Prop :=\n OnSegment X U W ∧\n EuclideanGeometry.angle U V X = EuclideanGeometry.angle X V W\n\n/-- The midpoint of the segment with endpoints `A` and `B`. -/\ndef segmentMidpoint (A B : Plane) : Plane :=\n (1 / 2 : ℝ) • A + (1 / 2 : ℝ) • B\n\n/-- `M` is the midpoint of the segment with endpoints `A` and `B`. -/\ndef IsSegmentMidpoint (M A B : Plane) : Prop :=\n M = segmentMidpoint A B\n\n/-- `R` is the midpoint of the arc `AB` of the circle with centre `O` and\nradius `r` which does not contain `C`. On a circle, the two arcs cut off by\n`A` and `B` lie in the two open half-planes determined by the chord `AB`;\ntherefore the arc not containing `C` is selected by requiring `R` to lie on\nthe side of `AB` opposite to `C`. The condition `dist R A = dist R B`\nsays that `R` is the midpoint of that arc. -/\ndef IsMidpointOfArcABNotContainingC\n (O : Plane) (r : ℝ) (A B C R : Plane) : Prop :=\n OnCircle O r R ∧ dist R A = dist R B ∧ StrictlyOppositeSides A B C R\n\n/-- `A2` and `B2` are exactly the two (distinct) intersection points of the\nline through `A1` and `B1` with the circle with centre `O` and radius `r`. -/\ndef IsLineCircleIntersectionPair\n (O : Plane) (r : ℝ) (A1 B1 A2 B2 : Plane) : Prop :=\n A2 ≠ B2 ∧\n OnLine A2 A1 B1 ∧\n OnLine B2 A1 B1 ∧\n OnCircle O r A2 ∧\n OnCircle O r B2 ∧\n ∀ X : Plane, OnLine X A1 B1 → OnCircle O r X → X = A2 ∨ X = B2\n\n/-- The complete statement: for every nondegenerate triangle `ABC` with\n`∠ACB = 60°`, with `A1` and `B1` the internal angle-bisector feet on `BC`\nand `CA`, with `A2` and `B2` the intersections of `A1B1` with the\ncircumcircle, with `R` the midpoint of the arc `AB` not containing `C`, and\nwith `P` and `Q` the midpoints of `A1B1` and `A2B2`, one has `RP = RQ`. -/\ndef Target : Prop :=\n ∀ (A B C : Plane),\n ¬ Collinear A B C →\n EuclideanGeometry.angle A C B = Real.pi / 3 →\n ∀ (A1 : Plane),\n IsInternalAngleBisectorFoot A B C A1 →\n ∀ (B1 : Plane),\n IsInternalAngleBisectorFoot B A C B1 →\n ∀ (O : Plane) (r : ℝ),\n IsCircumcircle O r A B C →\n ∀ (A2 B2 : Plane),\n IsLineCircleIntersectionPair O r A1 B1 A2 B2 →\n ∀ (R : Plane),\n IsMidpointOfArcABNotContainingC O r A B C R →\n ∀ (P : Plane),\n IsSegmentMidpoint P A1 B1 →\n ∀ (Q : Plane),\n IsSegmentMidpoint Q A2 B2 →\n dist R P = dist R Q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c4f8a08-1bb0-562c-acb6-09a325ad5fbf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cce15616c22d5ca8edb0f7fe82e25ac1ad394eb51e3d4187ca7cc6c5560396d1", "task_path": "tasks/nmp3_1c4f8a08-1bb0-562c-acb6-09a325ad5fbf", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c4f8a08-1bb0-562c-acb6-09a325ad5fbf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1c6cc3af-b47c-5c1e-9012-20df16ebfdc9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,n$ be positive integers with $n\\ge 2$, $x\\ge 3$, and $x^{2}+5=y^{n}$. Let $p$ be any prime divisor of $n$. Prove that $4\\mid(p-1)\\,.$\nimport Mathlib.Data.Nat.Prime.Basic\n\n/-!\n# Formal statement for the problem\n\nThe original problem asks, for positive integers `x`, `y`, `n` satisfying\n`2 ≤ n`, `3 ≤ x`, and `x^2 + 5 = y^n`, to prove that every prime divisor\n`p` of `n` satisfies `4 ∣ p - 1`.\n\nThe assertion is packaged as a proposition-valued definition; no proof is\nsupplied or required at this stage. All variables range over natural\nnumbers, matching the positive-integer domain and the natural-number\ndivisibility statement in the source.\n-/\n\nnamespace Problem\n\n/-- The complete proposition asserted by the problem.\n\nFor all natural numbers `x`, `y`, `n`, if `x`, `y`, and `n` are positive,\n`2 ≤ n`, `3 ≤ x`, and `x^2 + 5 = y^n`, then every natural number `p`\nthat is prime and divides `n` satisfies `4 ∣ p - 1`. The positivity of `x`\nis stated explicitly even though it follows from `3 ≤ x`, and the\npositivity of `n` is stated explicitly even though it follows from `2 ≤ n`,\nto preserve the source's \"positive integers\" clause. -/\ndef Target : Prop :=\n ∀ x y n : ℕ,\n 0 < x →\n 0 < y →\n 0 < n →\n 2 ≤ n →\n 3 ≤ x →\n x ^ 2 + 5 = y ^ n →\n ∀ p : ℕ,\n Nat.Prime p →\n p ∣ n →\n 4 ∣ p - 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c6cc3af-b47c-5c1e-9012-20df16ebfdc9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "75da61b955624ab63e551a85d0e70b61adb4cea591e6da2a404ac90cf2becfd7", "task_path": "tasks/nmp3_1c6cc3af-b47c-5c1e-9012-20df16ebfdc9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c6cc3af-b47c-5c1e-9012-20df16ebfdc9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1c729dc3-33f6-5b3e-bdd3-454914de805d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the lengths of the sides of a triangle (so $a,b,c>0$ and $a+b>c$, $b+c>a$, $c+a>b$). Prove that \n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\ge 1+\\frac{2(a^2+b^2+c^2)}{ab+bc+ca}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a triangle inequality\n\nThis file formalizes the statement of the problem. It does not supply a proof.\n-/\n\nnamespace Problem\n\n/-- The side-length conditions for a nondegenerate triangle with side lengths\n`a`, `b`, and `c`: all three lengths are positive and the three strict triangle\ninequalities hold. -/\ndef TriangleSides (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The universal assertion from the problem: for every real triple `a`, `b`, `c`\nsatisfying the side-length conditions of a triangle, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, TriangleSides a b c →\n (a / b + b / c + c / a ≥\n 1 + (2 * (a ^ 2 + b ^ 2 + c ^ 2)) / (a * b + b * c + c * a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c729dc3-33f6-5b3e-bdd3-454914de805d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6102c2e4f5ef35ed3dc48cd1d0e40bd92368470b3525be544da4b884c1e6d9d0", "task_path": "tasks/nmp3_1c729dc3-33f6-5b3e-bdd3-454914de805d", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c729dc3-33f6-5b3e-bdd3-454914de805d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1c861f1c-32de-5ba0-8308-8d954b095f61", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A_1,A_2,\\dots ,A_8$ be eight points in the plane, no three of which are collinear. Write the areas of all $\\binom{8}{3}=56$ triangles determined by these points in a row. Prove that one can insert the symbols “+’’ and “–’’ between consecutive areas so that the resulting signed sum equals $0$.\nimport Mathlib\n\n/-!\n# Formal statement: signed sums of the triangle areas of eight planar points\n\nThe problem concerns eight labelled points in the Euclidean plane, with no three\npoints collinear, and the 56 ordinary (non-oriented) areas of the triangles\ndetermined by their triples. We index each unordered triple exactly once by the\nstrictly increasing triple of its labels. The target says that for every\nordering of those 56 areas in a row, one can choose a sign for each of the 55\ngaps so that the resulting signed sum is zero.\n-/\n\nnoncomputable section\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The Euclidean plane, represented by two real coordinates. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Twice the oriented area of the triangle with vertices `p`, `q`, and `r`. -/\ndef twiceSignedArea (p q r : Plane) : ℝ :=\n (q 0 - p 0) * (r 1 - p 1) - (q 1 - p 1) * (r 0 - p 0)\n\n/-- The ordinary (non-oriented) area of the triangle with vertices `p`, `q`, `r`. -/\ndef triangleArea (p q r : Plane) : ℝ :=\n |twiceSignedArea p q r| / 2\n\n/-- No three of the eight labelled points are collinear. The three labels are\nrequired to be pairwise different. For eight points this condition also forces\nthe points attached to different labels to be distinct. -/\ndef NoThreeCollinear (A : Fin 8 → Plane) : Prop :=\n ∀ i j k : Fin 8,\n i ≠ j → j ≠ k → i ≠ k →\n ¬ Collinear ℝ ({A i, A j, A k} : Set Plane)\n\n/-- One representative of each unordered triple of labels: the strictly\nincreasing triples `(i, j, k)`. There are `Nat.choose 8 3 = 56` such triples. -/\nabbrev TriangleIndex : Type :=\n {t : Fin 8 × Fin 8 × Fin 8 // t.1 < t.2.1 ∧ t.2.1 < t.2.2}\n\nnamespace TriangleIndex\n\n/-- The first label of a triangle index. -/\ndef first (t : TriangleIndex) : Fin 8 :=\n t.1.1\n\n/-- The second label of a triangle index. -/\ndef second (t : TriangleIndex) : Fin 8 :=\n t.1.2.1\n\n/-- The third label of a triangle index. -/\ndef third (t : TriangleIndex) : Fin 8 :=\n t.1.2.2\n\nend TriangleIndex\n\n/-- The finite type of triangle indices. -/\ninstance instFintypeTriangleIndex : Fintype TriangleIndex := by\n dsimp [TriangleIndex]\n infer_instance\n\n/-- A concrete bijection showing that the triangle-index type has exactly 56\nelements. It is used to certify that `Fin 56` is the correct row length. -/\nnoncomputable def triangleIndexEquivFin56 : Fin 56 ≃ TriangleIndex :=\n (Fintype.equivFinOfCardEq\n (by decide : Fintype.card TriangleIndex = 56)).symm\n\n/-- The area of the triangle selected by a triangle index. -/\ndef areaAtIndex (A : Fin 8 → Plane) (t : TriangleIndex) : ℝ :=\n triangleArea (A t.first) (A t.second) (A t.third)\n\n/-- A row of the areas of all 56 triangles, in the order specified by the\nbijection `e`. -/\ndef areaRow (A : Fin 8 → Plane) (e : Fin 56 ≃ TriangleIndex) : Fin 56 → ℝ :=\n fun n : Fin 56 => areaAtIndex A (e n)\n\n/-- A row represents all 56 triangle areas exactly once when it is the area row\nassociated to some bijective ordering of the triangle indices. -/\ndef IsAreaRow (A : Fin 8 → Plane) (row : Fin 56 → ℝ) : Prop :=\n ∃ e : Fin 56 ≃ TriangleIndex, row = areaRow A e\n\n/-- A symbol inserted between two consecutive areas. -/\ninductive Sign : Type\n | plus\n | minus\n deriving DecidableEq, Repr\n\n/-- Interpret an inserted symbol as the real coefficient `+1` or `-1`. -/\ndef Sign.toReal : Sign → ℝ\n | Sign.plus => (1 : ℝ)\n | Sign.minus => (-1 : ℝ)\n\n/-- The signed sum obtained from a row of 56 areas by inserting the 55 symbols\n`signs 0, …, signs 54` between consecutive entries. The first area has the\nimplicit positive sign. -/\ndef insertionSum (row : Fin 56 → ℝ) (signs : Fin 55 → Sign) : ℝ :=\n row 0 + ∑ i : Fin 55, (signs i).toReal * row (Fin.succ i)\n\n/-- A choice of signs is correct for a row exactly when its signed sum is zero. -/\ndef InsertionCorrect (row : Fin 56 → ℝ) (signs : Fin 55 → Sign) : Prop :=\n insertionSum row signs = 0\n\n/-- There exists a valid insertion of `+` and `-` signs for the given row. -/\ndef HasSignedZeroInsertion (row : Fin 56 → ℝ) : Prop :=\n ∃ signs : Fin 55 → Sign, InsertionCorrect row signs\n\n/-- The formal target of the problem: for any eight planar points with no three\ncollinear, and for any row containing the areas of all 56 triangles exactly\nonce, signs can be inserted between consecutive areas so that the signed sum is\nzero. -/\ndef Target : Prop :=\n ∀ (A : Fin 8 → Plane),\n NoThreeCollinear A →\n ∀ row : Fin 56 → ℝ,\n IsAreaRow A row →\n HasSignedZeroInsertion row\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c861f1c-32de-5ba0-8308-8d954b095f61", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "acdb7c626b296384663edbbf85648affa5051b35959c0233ef362559101a0426", "task_path": "tasks/nmp3_1c861f1c-32de-5ba0-8308-8d954b095f61", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c861f1c-32de-5ba0-8308-8d954b095f61", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1c8d9fcf-e879-58b9-a0ec-6e307c15b9ad", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f(n)$ be the largest prime divisor of $n$, and let $a_1,a_2,\\dots$ be an increasing sequence of positive integers. Prove that the set of values $\\{\\,f(a_i+a_j)\\mid i\\neq j\\,\\}$ is unbounded.\nimport Mathlib.Data.Nat.MaxPrimeFac\nimport Mathlib.Data.PNat.Basic\n\n/-!\n# Unboundedness of largest prime divisors of pairwise sums\n\nThe source problem asks us to prove that, for every strictly increasing sequence\n`a₁, a₂, ...` of positive integers, the values of the largest prime divisor of\n`aᵢ + aⱼ` with `i ≠ j` are unbounded.\n\nThis file states that proposition. Mathlib's `Nat.maxPrimeFac` is the greatest\nprime factor of a natural number (and, for a number greater than one, it is\ncharacterized by `Nat.isGreatest_maxPrimeFac`). The indices are represented by\n`ℕ+`, so they are exactly the positive indices `1, 2, ...` used in the source.\n-/\n\nnamespace Problem\n\n/-- `n.maxPrimeFac` is Mathlib's computable greatest prime factor of `n`.\nFor each sum `a i + a j` below, this sum is greater than one, so it has the\nintended mathematical meaning of \"the largest prime divisor\". -/\nabbrev largestPrimeDivisor (n : ℕ) : ℕ := n.maxPrimeFac\n\n/-- The assertion that the set `{ f (a i + a j) | i ≠ j }` is unbounded above,\nfor a positive-indexed sequence `a`. Here `f` is `largestPrimeDivisor`.\n\nThe conclusion is phrased directly: for every natural bound `B`, there exist\ntwo distinct positive indices `i` and `j` for which `B` is exceeded. -/\ndef PairwiseSumPrimeDivisorValuesUnbounded (a : ℕ+ → ℕ) : Prop :=\n ∀ B : ℕ, ∃ i j : ℕ+, i ≠ j ∧ B < largestPrimeDivisor (a i + a j)\n\n/-- The formal target: every strictly increasing sequence of positive integers\nhas unbounded largest prime divisors of its pairwise sums at distinct indices. -/\ndef Target : Prop :=\n ∀ (a : ℕ+ → ℕ),\n StrictMono a →\n (∀ i : ℕ+, 0 < a i) →\n PairwiseSumPrimeDivisorValuesUnbounded a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c8d9fcf-e879-58b9-a0ec-6e307c15b9ad", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6b8edc010644d981b5ca788ce341f5f3d609d93f5a374950d8e6742d2b49e13f", "task_path": "tasks/nmp3_1c8d9fcf-e879-58b9-a0ec-6e307c15b9ad", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1c8d9fcf-e879-58b9-a0ec-6e307c15b9ad", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1cc60d1b-86d9-5091-9972-77f6eb78280e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a(b+c)}{\\sqrt{b^{2}+bc+c^{2}}}\\;+\\;\\frac{b(c+a)}{\\sqrt{c^{2}+ca+a^{2}}}\\;+\\;\\frac{c(a+b)}{\\sqrt{a^{2}+ab+b^{2}}}\\;\\ge\\;2\\sqrt{ab+bc+ca}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic square-root inequality\n\nThe problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe inequality\n\n`a (b + c) / sqrt (b^2 + b c + c^2)\n + b (c + a) / sqrt (c^2 + c a + a^2)\n + c (a + b) / sqrt (a^2 + a b + b^2)\n ≥ 2 sqrt (a b + b c + c a)`.\n\nThe declaration below records only the mathematical proposition; it does not\ncontain a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the cyclic inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a * (b + c) / Real.sqrt (b ^ 2 + b * c + c ^ 2) +\n b * (c + a) / Real.sqrt (c ^ 2 + c * a + a ^ 2) +\n c * (a + b) / Real.sqrt (a ^ 2 + a * b + b ^ 2)\n\n/-- The right-hand side of the cyclic inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 2 * Real.sqrt (a * b + b * c + c * a)\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the cyclic sum on the\nleft-hand side is at least `2 sqrt (ab + bc + ca)`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → LHS a b c ≥ RHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1cc60d1b-86d9-5091-9972-77f6eb78280e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dbccfd0f9316b5b9ff93a3f7bbde6e0e28b5be16e2ee7017fc50a9257a3a7c7a", "task_path": "tasks/nmp3_1cc60d1b-86d9-5091-9972-77f6eb78280e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1cc60d1b-86d9-5091-9972-77f6eb78280e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1cf97688-90e3-5821-85a7-b5fc6c12e2ea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{2}{3+ab+bc+ca}+\\sqrt[3]{\\frac{abc}{(a+1)(b+1)(c+1)}}\\le \\frac56\\,.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The real cube root of `x`, represented by the real power `x ^ (1 / 3)`.\n\nUnder the positivity assumptions in the problem, the radicand is positive, so this\nagrees with the usual real cube root. -/\ndef realCubeRoot (x : ℝ) : ℝ := x ^ ((1 : ℝ) / 3)\n\n/-- The admissibility conditions on the three real variables of the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (2 : ℝ) / (3 + a * b + b * c + c * a) +\n realCubeRoot (a * b * c / ((a + 1) * (b + 1) * (c + 1)))\n\n/-- The displayed inequality for one admissible triple. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n lhs a b c ≤ (5 : ℝ) / 6\n\n/-- The complete assertion of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → InequalityHolds a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1cf97688-90e3-5821-85a7-b5fc6c12e2ea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "efec8962ac8168c9803db1355100f0120a735fc11b844e8843cffaa92e2cd854", "task_path": "tasks/nmp3_1cf97688-90e3-5821-85a7-b5fc6c12e2ea", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1cf97688-90e3-5821-85a7-b5fc6c12e2ea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1d17839c-2f29-5149-97f8-6fdf88d443fa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{a^{2}b}{1+a+2b}+\\frac{b^{2}c}{1+b+2c}+\\frac{c^{2}a}{1+c+2a}\\le \n-- \\frac{3\\,(a^{2}+b^{2}+c^{2})}{4\\,(ab+bc+ca)}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, `c`\nwith `a + b + c = 3`, the inequality\n\n`a^2*b/(1+a+2*b) + b^2*c/(1+b+2*c) + c^2*a/(1+c+2*a)\n ≤ 3*(a^2+b^2+c^2)/(4*(a*b+b*c+c*a))`.\n\nThis file gives the statement as a proposition-valued definition. No proof\nof the target is included.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions for the three variables: they are strictly\npositive real numbers whose sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def leftSide (a b c : ℝ) : ℝ :=\n a ^ 2 * b / (1 + a + 2 * b) +\n b ^ 2 * c / (1 + b + 2 * c) +\n c ^ 2 * a / (1 + c + 2 * a)\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def rightSide (a b c : ℝ) : ℝ :=\n 3 * (a ^ 2 + b ^ 2 + c ^ 2) /\n (4 * (a * b + b * c + c * a))\n\n/-- The asserted inequality, for arbitrary real `a`, `b`, `c`. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n leftSide a b c ≤ rightSide a b c\n\n/-- The complete statement to be proved: for every triple of positive real\nnumbers with sum exactly `3`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1d17839c-2f29-5149-97f8-6fdf88d443fa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6ba67314d3932d6145e66c7e6deb0cc2893b403f8485ea37a7c7880845e46d5c", "task_path": "tasks/nmp3_1d17839c-2f29-5149-97f8-6fdf88d443fa", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1d17839c-2f29-5149-97f8-6fdf88d443fa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1d46bd74-3391-54b3-b2fb-52e210f171a5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A polynomial $P(x)$ is called **nice** if $P(0)=1$ and the nonzero coefficients of $P(x)$, when written in order of increasing degree, alternate between $1$ and $-1$. \n-- Suppose $P(x)$ is nice and $m,n$ are relatively prime positive integers. Prove that \n-- \\[\n-- Q(x)=P(x^{\\,n})\\;\\cdot\\;\\frac{(x^{mn}-1)(x-1)}{(x^{m}-1)(x^{n}-1)}\n-- \\]\n-- is also nice.\nimport Mathlib\n\n/-!\n# A formal statement of the \"nice polynomial\" problem\n\nThe source problem calls a polynomial *nice* when its constant coefficient is\none and its nonzero coefficients, read in increasing degree order, alternate\nbetween `1` and `-1`. The main declaration `Problem.Target` states the\nrequested implication. The cancellation factor in the statement is encoded\nusing monic polynomial division (see `Problem.Kernel`).\n-/\n\nnamespace Problem\n\n/-- A polynomial over the integers is *nice* if its value at zero is `1` and\nany two consecutive nonzero coefficients, in increasing degree order, are\n`1` and `-1` in that order or `-1` and `1` in that order. -/\ndef IsNice (P : Polynomial ℤ) : Prop :=\n P.eval 0 = 1 ∧\n ∀ (i j : ℕ), i < j →\n P.coeff i ≠ 0 →\n P.coeff j ≠ 0 →\n (∀ k : ℕ, i < k → k < j → P.coeff k = 0) →\n ((P.coeff i = 1 ∧ P.coeff j = -1) ∨\n (P.coeff i = -1 ∧ P.coeff j = 1))\n\n/-- The polynomial factor\n`(x^(m*n) - 1) * (x - 1) / ((x^m - 1) * (x^n - 1))`, represented as the\nquotient of the numerator by the monic denominator in `ℤ[x]`. Under the\ncoprimality hypothesis on `m` and `n`, the denominator divides the numerator,\nso `divByMonic` is the polynomial quotient appearing in the problem. -/\nnoncomputable def Kernel (m n : ℕ) : Polynomial ℤ :=\n Polynomial.divByMonic\n (((Polynomial.X : Polynomial ℤ) ^ (m * n) - 1) *\n ((Polynomial.X : Polynomial ℤ) - 1))\n (((Polynomial.X : Polynomial ℤ) ^ m - 1) *\n ((Polynomial.X : Polynomial ℤ) ^ n - 1))\n\n/-- The polynomial `Q`, namely `P(x^n)` multiplied by the cancellation factor. -/\nnoncomputable def Q (P : Polynomial ℤ) (m n : ℕ) : Polynomial ℤ :=\n P.comp ((Polynomial.X : Polynomial ℤ) ^ n) * Kernel m n\n\n/-- The assertion of the problem: if `P` is nice and `m`, `n` are relatively\nprime positive integers, then the polynomial `Q` is nice. -/\ndef Target : Prop :=\n ∀ (P : Polynomial ℤ), IsNice P →\n ∀ (m n : ℕ), 0 < m → 0 < n → Nat.Coprime m n →\n IsNice (Q P m n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1d46bd74-3391-54b3-b2fb-52e210f171a5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6de44f9518bd76f29bbe08ef448d611384cf02a36bb2e9a33507eb7f8f3a0204", "task_path": "tasks/nmp3_1d46bd74-3391-54b3-b2fb-52e210f171a5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1d46bd74-3391-54b3-b2fb-52e210f171a5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1da88064-ab75-5a71-93ea-4b8bc100aa7d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(x,y,z>0\\). Prove that \n-- \\[\n-- \\bigl(x+3y\\bigr)\\bigl(y+3z\\bigr)\\bigl(z+3x\\bigr)+\\frac{\\bigl(x^{2}+y^{2}+z^{2}-xy-yz-zx\\bigr)^{3}}{xyz}\\ge 2\\,(x+y+z)^{3}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a three-variable positive-real inequality\n\nThe source problem asks, for positive real numbers `x`, `y`, and `z`, to prove\n\\[\n (x+3y)(y+3z)(z+3x)\n + \\frac{(x^2+y^2+z^2-xy-yz-zx)^3}{xyz}\n \\ge 2(x+y+z)^3.\n\\]\n\nThis file records the assertion as a proposition. It does not provide a proof.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem, with all three variables universally quantified\nover the positive real numbers. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n (x + 3 * y) * (y + 3 * z) * (z + 3 * x)\n + (x ^ 2 + y ^ 2 + z ^ 2 - x * y - y * z - z * x) ^ 3\n / (x * y * z)\n ≥ 2 * (x + y + z) ^ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1da88064-ab75-5a71-93ea-4b8bc100aa7d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "367935952e10f44742f2c46fccc61a0c7d2b9b8dfe60019b4561fb225e78f272", "task_path": "tasks/nmp3_1da88064-ab75-5a71-93ea-4b8bc100aa7d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1da88064-ab75-5a71-93ea-4b8bc100aa7d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1db8989d-f40d-531b-8aba-6532718c2daa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{1}{a^{3}(a+b)^{2}}+\\frac{1}{b^{3}(a+c)^{2}}+\\frac{1}{c^{3}(b+c)^{2}}\n-- \\;\\ge\\;\n-- \\frac{3(a+b)(b+c)(c+a)}{8\\,a^{2}b^{2}c^{2}\\,(a+b+c)^{2}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthe displayed three-term reciprocal inequality. This file formalizes only the\nstatement; it does not provide a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / (a ^ 3 * (a + b) ^ 2)\n + 1 / (b ^ 3 * (a + c) ^ 2)\n + 1 / (c ^ 3 * (b + c) ^ 2)\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 3 * (a + b) * (b + c) * (c + a)\n / (8 * a ^ 2 * b ^ 2 * c ^ 2 * (a + b + c) ^ 2)\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the displayed three-term\nreciprocal expression is at least the displayed rational expression.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1db8989d-f40d-531b-8aba-6532718c2daa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "88ee3ada53b8d05c66b96a1bcf11b9cb7e75e243c033813f5b7965a6685f3f62", "task_path": "tasks/nmp3_1db8989d-f40d-531b-8aba-6532718c2daa", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1db8989d-f40d-531b-8aba-6532718c2daa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1deb3953-0a3e-5661-82b5-439004699647", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a circumscribed quadrilateral and let $P$ be the orthogonal projection of its incircle center onto diagonal $AC$. Prove that $\\angle APB = \\angle APD\\,. $\nimport Mathlib.Analysis.Convex.Hull\nimport Mathlib.Analysis.Convex.Segment\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Geometry.Euclidean.Sphere.Tangent\n\n/-!\n# Formal statement: a metric relation for a tangential quadrilateral\n\nThe source problem considers a circumscribed (that is, tangential) quadrilateral\n`ABCD`, the center of its incircle, and the orthogonal projection `P` of that\ncenter onto the line containing the diagonal `AC`. It asks to prove that the\nunoriented angles `∠APB` and `∠APD` are equal.\n\nThe declarations below encode the objects and hypotheses explicitly. In\nparticular, `ABCD` is taken to be a nondegenerate convex quadrilateral, and its\nincircle is represented by a positive-radius circle tangent to the four open\nside segments, with its center in the interior of the quadrilateral. The\nprojection is the orthogonal projection onto the whole line `AC`, as is usual\nfor \"projection onto a diagonal\" in this context.\n\nNo proof of the target is supplied here; `Target` is the proposition to be\nproved.\n-/\n\nnoncomputable section\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the formalization. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The signed two-dimensional cross product in coordinates. -/\ndef crossProduct (u v : Plane) : ℝ :=\n u 0 * v 1 - u 1 * v 0\n\n/--\nThe four points `A`, `B`, `C`, `D` are in strict convex position and are listed\nin cyclic order (either counterclockwise or clockwise). Equivalently, all four\nsuccessive turns of the polygon `A B C D` have the same strictly nonzero sign.\n-/\ndef IsStrictlyConvexQuadrilateral (A B C D : Plane) : Prop :=\n (0 < crossProduct (B - A) (C - B) ∧\n 0 < crossProduct (C - B) (D - C) ∧\n 0 < crossProduct (D - C) (A - D) ∧\n 0 < crossProduct (A - D) (B - A)) ∨\n (crossProduct (B - A) (C - B) < 0 ∧\n crossProduct (C - B) (D - C) < 0 ∧\n crossProduct (D - C) (A - D) < 0 ∧\n crossProduct (A - D) (B - A) < 0)\n\n/-- The Euclidean circle with the specified center and radius. -/\ndef circleWithCenterRadius (O : Plane) (r : ℝ) : EuclideanGeometry.Sphere Plane :=\n ⟨O, r⟩\n\n/--\n`O` is the center of an incircle of the quadrilateral `ABCD`.\n\nThere is a positive radius `r` and, on each of the four open side segments, a\npoint at which the circle of center `O` and radius `r` is tangent to the line\ncontaining that side. The center `O` lies in the interior of the convex hull\nof the four vertices. The strict convexity of the displayed quadrilateral is\nrecorded separately by `IsStrictlyConvexQuadrilateral`.\n-/\ndef IsIncircle (O : Plane) (A B C D : Plane) : Prop :=\n ∃ r : ℝ, 0 < r ∧\n ∃ E F G H : Plane,\n (circleWithCenterRadius O r).IsTangentAt E (line[ℝ, A, B]) ∧\n E ∈ openSegment ℝ A B ∧\n (circleWithCenterRadius O r).IsTangentAt F (line[ℝ, B, C]) ∧\n F ∈ openSegment ℝ B C ∧\n (circleWithCenterRadius O r).IsTangentAt G (line[ℝ, C, D]) ∧\n G ∈ openSegment ℝ C D ∧\n (circleWithCenterRadius O r).IsTangentAt H (line[ℝ, D, A]) ∧\n H ∈ openSegment ℝ D A ∧\n O ∈ interior (convexHull ℝ ({A, B, C, D} : Set Plane))\n\n/--\n`ABCD` is a circumscribed quadrilateral whose incircle has center `O`.\n-/\ndef IsCircumscribedQuadrilateralWithIncircleCenter\n (O : Plane) (A B C D : Plane) : Prop :=\n IsStrictlyConvexQuadrilateral A B C D ∧ IsIncircle O A B C D\n\n/--\n`P` is the orthogonal projection of `X` onto the affine line through `A` and\n`B`.\n-/\ndef IsOrthogonalProjectionOntoLine (P X A B : Plane) : Prop :=\n P = (EuclideanGeometry.orthogonalProjection (line[ℝ, A, B]) X : Plane)\n\n/--\nThe assertion of the source problem: if `ABCD` is a circumscribed quadrilateral\nwith incircle center `O`, and `P` is the orthogonal projection of `O` onto the\nline containing diagonal `AC`, then the unoriented angles `∠APB` and `∠APD`\nare equal.\n-/\ndef Target : Prop :=\n ∀ (A B C D O P : Plane),\n IsCircumscribedQuadrilateralWithIncircleCenter O A B C D →\n IsOrthogonalProjectionOntoLine P O A C →\n EuclideanGeometry.angle A P B = EuclideanGeometry.angle A P D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1deb3953-0a3e-5661-82b5-439004699647", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "452c7ed23bfabbf7c0db3dc2d64d78c8611ac5f99c69242339265a1c28b30972", "task_path": "tasks/nmp3_1deb3953-0a3e-5661-82b5-439004699647", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1deb3953-0a3e-5661-82b5-439004699647", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1dff6fac-ac22-549b-9098-4001d165730c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a+b+c=3abc$. Prove that \n-- \\[\n-- 9abc\\ge \\sqrt{7a^2+\\frac{4b}{b+c}}+\\sqrt{7b^2+\\frac{4c}{c+a}}+\\sqrt{7c^2+\\frac{4a}{a+b}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe source problem asks to prove an inequality for positive real numbers\n`a`, `b`, and `c` subject to the constraint `a + b + c = 3abc`.\nThis file states that assertion; it intentionally contains no proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real parameters. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3 * a * b * c\n\n/-- The left-hand side of the claimed inequality, `9abc`. -/\ndef lhs (a b c : ℝ) : ℝ :=\n 9 * a * b * c\n\n/-- The sum of the three principal real square roots on the right-hand side. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n Real.sqrt (7 * a ^ 2 + 4 * b / (b + c)) +\n Real.sqrt (7 * b ^ 2 + 4 * c / (c + a)) +\n Real.sqrt (7 * c ^ 2 + 4 * a / (a + b))\n\n/-- The full universal assertion stated by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1dff6fac-ac22-549b-9098-4001d165730c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8d7defcf48a8440d05081bf8812d80e6074d16450901b446354668d33c94ec92", "task_path": "tasks/nmp3_1dff6fac-ac22-549b-9098-4001d165730c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1dff6fac-ac22-549b-9098-4001d165730c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1e165393-3080-508f-8b0c-0b6a5793ceea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a, b, c\\) be the side‑lengths of a triangle such that \\(a^{2}+b^{2}+c^{2}=3\\). Prove that \n-- \\[\n-- \\frac{bc}{1+a^{2}}+\\frac{ca}{1+b^{2}}+\\frac{ab}{1+c^{2}}\\ge\\frac32\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThis file records the statement of the problem, not a proof of it.\n\nThe source asks for a proof of an inequality for the three side lengths of a\n(non-degenerate) triangle whose squared side lengths sum to three. The side\nlengths are represented as real numbers.\n-/\n\nnamespace Problem\n\n/-- The predicate that `a`, `b`, and `c` are the side lengths of a\n(non-degenerate) triangle.\n\nThe first three conjuncts record that side lengths are positive real numbers.\nThe last three conjuncts are the strict triangle inequalities. -/\ndef TriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a < b + c ∧ b < c + a ∧ c < a + b\n\n/-- The left-hand side appearing in the desired inequality. -/\nnoncomputable def TriangleExpression (a b c : ℝ) : ℝ :=\n b * c / ((1 : ℝ) + a ^ 2) +\n c * a / ((1 : ℝ) + b ^ 2) +\n a * b / ((1 : ℝ) + c ^ 2)\n\n/-- The assertion to be proved: for every triple of positive real numbers that\nare the side lengths of a non-degenerate triangle and satisfy\n`a^2 + b^2 + c^2 = 3`, the displayed expression is at least `3/2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n TriangleSideLengths a b c →\n a ^ 2 + b ^ 2 + c ^ 2 = (3 : ℝ) →\n TriangleExpression a b c ≥ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1e165393-3080-508f-8b0c-0b6a5793ceea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "03598e9867bb3574b9649c4c2687ceccd890749d308712f1eff26117f3970fb7", "task_path": "tasks/nmp3_1e165393-3080-508f-8b0c-0b6a5793ceea", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1e165393-3080-508f-8b0c-0b6a5793ceea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1e1b5f0e-c2eb-548d-8042-3b6cb7cc2efa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy \n-- \\[\n-- a+b+c+3=2\\Big(\\frac1a+\\frac1b+\\frac1c\\Big).\n-- \\] \n-- Prove that \n-- \\[\n-- \\sqrt a+\\sqrt b+\\sqrt c\\ge 3.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formalization of the positive-real inequality problem\n\nThe source problem quantifies over positive real numbers `a`, `b`, and `c`\nsatisfying the displayed equation, and asks for the inequality\n`sqrt a + sqrt b + sqrt c ≥ 3`.\n-/\n\nnamespace Problem\n\n/-- The hypotheses of the problem: all three variables are positive and satisfy\n`a + b + c + 3 = 2 * (1 / a + 1 / b + 1 / c)`. -/\ndef Hypothesis (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b + c + 3 = 2 * (1 / a + 1 / b + 1 / c)\n\n/-- The asserted conclusion of the problem. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n (3 : ℝ) ≤ Real.sqrt a + Real.sqrt b + Real.sqrt c\n\n/-- The complete assertion of the source problem: for every triple of positive\nreal numbers satisfying the displayed equation, the sum of square roots is at\nleast three. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Hypothesis a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1e1b5f0e-c2eb-548d-8042-3b6cb7cc2efa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b05623424b5ef675647925192587dba3f863e082d7cf9bd5cecb77e77d6ff0e3", "task_path": "tasks/nmp3_1e1b5f0e-c2eb-548d-8042-3b6cb7cc2efa", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1e1b5f0e-c2eb-548d-8042-3b6cb7cc2efa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1e2c1cf4-ea7c-5edc-963c-22b928210594", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be positive numbers such that $a+b+c+d=9$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a}{b+3}}+\\sqrt{\\frac{b}{c+3}}+\\sqrt{\\frac{c}{d+3}}+\\sqrt{\\frac{d}{a+3}}\\le 5\\sqrt{\\frac{2}{7}}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the claimed inequality. -/\nnoncomputable def LHS (a b c d : ℝ) : ℝ :=\n Real.sqrt (a / (b + 3)) +\n Real.sqrt (b / (c + 3)) +\n Real.sqrt (c / (d + 3)) +\n Real.sqrt (d / (a + 3))\n\n/-- The right-hand side of the claimed inequality. -/\nnoncomputable def RHS : ℝ :=\n (5 : ℝ) * Real.sqrt ((2 : ℝ) / 7)\n\n/-- The admissibility conditions for the four positive reals in the problem. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧ a + b + c + d = 9\n\n/-- The assertion in the problem: for all positive reals `a`, `b`, `c`, and `d`\nwhose sum is `9`, the stated cyclic square-root sum is at most\n`5 * sqrt (2 / 7)`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → LHS a b c d ≤ RHS\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1e2c1cf4-ea7c-5edc-963c-22b928210594", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "59cc54bf5c1edeeab10e9e8e5b4e2d839a100d1ff773ee8e100e64377e92a7e6", "task_path": "tasks/nmp3_1e2c1cf4-ea7c-5edc-963c-22b928210594", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1e2c1cf4-ea7c-5edc-963c-22b928210594", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1e3c72a7-0e79-556a-b126-831a014088ce", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb{R}$. Prove that \n-- $$3(a^2-ab+b^2)(b^2-bc+c^2)(c^2-ca+a^2)\\ge a^3b^3+b^3c^3+c^3a^3.$$\nimport Mathlib\n\n/-!\n# Formal statement of the real three-variable inequality\n\nThe source problem asks to prove, for all real numbers `a`, `b`, and `c`, that\n`3 (a² - ab + b²) (b² - bc + c²) (c² - ca + a²)`\nis at least `a³b³ + b³c³ + c³a³`.\n\nThis file states the quantified proposition only; it deliberately contains no\nproof of the proposition.\n-/\n\nnamespace Problem\n\n/-- The universal assertion stated in the problem:\nfor every triple of real numbers `a`, `b`, and `c`, the product of the three\nquadratic factors, multiplied by `3`, is at least\n`a³b³ + b³c³ + c³a³`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 3 * (a ^ 2 - a * b + b ^ 2) *\n (b ^ 2 - b * c + c ^ 2) *\n (c ^ 2 - c * a + a ^ 2)\n ≥ a ^ 3 * b ^ 3 + b ^ 3 * c ^ 3 + c ^ 3 * a ^ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1e3c72a7-0e79-556a-b126-831a014088ce", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "86d7fb2222013662df4139622c503ee1ef9eb361361ae6baaefb7b8715e30fa1", "task_path": "tasks/nmp3_1e3c72a7-0e79-556a-b126-831a014088ce", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1e3c72a7-0e79-556a-b126-831a014088ce", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1e4bb510-7c15-54de-b3c5-38df5a141ab7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ satisfy $x+y+z=xyz$. Prove that \n-- \\[\n-- \\sqrt{x^{2}+y^{2}}+\\sqrt{y^{2}+z^{2}}+\\sqrt{z^{2}+x^{2}}+3\\sqrt6\\le \\sqrt8\\,xyz.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for a three-variable real inequality\n\nThe source problem asks us to prove, for all positive real numbers `x`, `y`, and `z`\nsatisfying `x + y + z = x * y * z`, the inequality\n\n`sqrt (x^2 + y^2) + sqrt (y^2 + z^2) + sqrt (z^2 + x^2) + 3 * sqrt 6\n <= sqrt 8 * (x * y * z)`.\n\nNo proof of the assertion is included here; `Problem.Target` records the proposition.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions imposed on the real variables in the source problem. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = x * y * z\n\n/-- The asserted inequality, universally quantified over all admissible positive real triples. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n Admissible x y z →\n Real.sqrt (x ^ 2 + y ^ 2) + Real.sqrt (y ^ 2 + z ^ 2) +\n Real.sqrt (z ^ 2 + x ^ 2) + (3 : ℝ) * Real.sqrt (6 : ℝ) ≤\n Real.sqrt (8 : ℝ) * (x * y * z)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1e4bb510-7c15-54de-b3c5-38df5a141ab7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5d34da96bdb183442f4d7ab14f993ba3a9fb3015f32e23dadf4d39ed59489d2b", "task_path": "tasks/nmp3_1e4bb510-7c15-54de-b3c5-38df5a141ab7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1e4bb510-7c15-54de-b3c5-38df5a141ab7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1e9604f2-b439-50e7-8f10-ebd4ad0e1ca7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge2$ be an integer. For each unordered pair $1\\le i0\\) be real numbers such that \\(a^{3}+b^{3}+c^{3}=3\\). Prove that \n-- \\[\n-- \\frac{a^{4}}{a+b^{6}}+\\frac{b^{4}}{b+c^{6}}+\\frac{c^{4}}{c+a^{6}}\\ge \\frac{3}{2}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the stated cyclic rational inequality\n\nThe original problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose cubes sum to `3`, that\n\n`a^4 / (a + b^6) + b^4 / (b + c^6) + c^4 / (c + a^6) ≥ 3 / 2`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 4 / (a + b ^ 6) + b ^ 4 / (b + c ^ 6) + c ^ 4 / (c + a ^ 6)\n\n/-- The admissibility assumptions on the three real parameters. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 3 + b ^ 3 + c ^ 3 = 3\n\n/-- The assertion to be proved in the problem statement. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → (3 : ℝ) / 2 ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1eeade2d-f360-5914-9395-6f8470cc3591", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "07a737d19eefff359585ccd2a5623188cbbb1a8e799a4437d9d280e3c42dfecd", "task_path": "tasks/nmp3_1eeade2d-f360-5914-9395-6f8470cc3591", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1eeade2d-f360-5914-9395-6f8470cc3591", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1f26d56f-d7b8-5eed-92b5-3aa2643cf79e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}+\\frac{2(ab+bc+ca)}{a^{2}+b^{2}+c^{2}}\\ge 5.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the positive-real inequality problem\n\nThe source problem asks, for all positive real numbers `a`, `b`, and `c`, to prove\n\n`a / b + b / c + c / a + 2 * (a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2) ≥ 5`.\n\nThe declarations below record the proposition to be proved. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The inequality appearing in the problem, as a predicate of the three real\nnumbers `a`, `b`, and `c`. This definition deliberately does not impose the\npositivity assumptions; those are part of `Problem.Target`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a / b + b / c + c / a +\n 2 * (a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2) ≥ 5\n\n/-- The full assertion of the source problem: for every triple of positive real\nnumbers `a`, `b`, and `c`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1f26d56f-d7b8-5eed-92b5-3aa2643cf79e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bf53b14bb1e8359e1fe7dc75ff253c8aa48416211bcc20f7fc56a29433b21e1c", "task_path": "tasks/nmp3_1f26d56f-d7b8-5eed-92b5-3aa2643cf79e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1f26d56f-d7b8-5eed-92b5-3aa2643cf79e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1f33b58d-27e0-53ba-92be-64206860607d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For an integer $m$, let $t(m)$ denote the unique element of $\\{1,2,3\\}$ such that $m+t(m)$ is a multiple of $3$. \n-- A function $f:\\mathbb Z\\to\\mathbb Z$ satisfies \n-- \n-- \\[\n-- f(-1)=0,\\qquad f(0)=1,\\qquad f(1)=-1,\n-- \\]\n-- \n-- and \n-- \n-- \\[\n-- f\\!\\bigl(2^{\\,n}+m\\bigr)=f\\!\\bigl(2^{\\,n}-t(m)\\bigr)-f(m)\n-- \\qquad\\text{for all integers }m,\\ n\\ge0\\text{ with }2^{\\,n}>m .\n-- \\]\n-- \n-- Prove that $f(3p)\\ge0$ for every integer $p\\ge0\\,. $\nimport Mathlib.Data.Int.Basic\nimport Mathlib.Data.Finset.Basic\nimport Mathlib.Tactic\n\n/-!\n# Formal statement for the integer recurrence problem\n\nThe source problem defines a residue-dependent function `t : ℤ → ℤ`, then\nconstrains a function `f : ℤ → ℤ` by three initial values and a recurrence\nindexed by nonnegative integer values of `n`. The final assertion is that\n`f (3 * p)` is nonnegative for every nonnegative integer `p`.\n-/\n\nnamespace Problem\n\n/-- The set `{1, 2, 3}` appearing in the definition of `t`. -/\ndef ResidueSet : Finset ℤ := {1, 2, 3}\n\n/--\n`ResidueChoice m x` says that `x` is an element of `{1, 2, 3}` and that\n`m + x` is an integer multiple of `3`.\n-/\ndef ResidueChoice (m x : ℤ) : Prop :=\n x ∈ ResidueSet ∧ (3 : ℤ) ∣ m + x\n\n/--\nThe function `t` from the problem, defined explicitly as the unique\nrepresentative in `{1, 2, 3}` of the residue `-m` modulo `3`.\n-/\ndef t (m : ℤ) : ℤ := 3 - m % 3\n\n/-- The explicit definition of `t` lies in the required three-element set. -/\ntheorem t_mem_residueSet (m : ℤ) : t m ∈ ResidueSet := by\n unfold t ResidueSet\n have hnonneg : 0 ≤ m % 3 := Int.emod_nonneg m (by norm_num : (3 : ℤ) ≠ 0)\n have hlt : m % 3 < 3 := Int.emod_lt_of_pos m (by norm_num : (0 : ℤ) < 3)\n simp only [Finset.mem_insert, Finset.mem_singleton]\n omega\n\n/-- The explicit definition of `t` makes `m + t m` divisible by `3`. -/\ntheorem t_dvd_add (m : ℤ) : (3 : ℤ) ∣ m + t m := by\n unfold t\n rw [Int.emod_def]\n use m / 3 + 1\n ring\n\n/-- `t m` satisfies the defining residue condition from the problem. -/\ntheorem t_isResidueChoice (m : ℤ) : ResidueChoice m (t m) :=\n ⟨t_mem_residueSet m, t_dvd_add m⟩\n\n/-- For each integer `m` there is a unique element of `{1, 2, 3}` that works. -/\ntheorem t_unique (m : ℤ) : ∃! x : ℤ, ResidueChoice m x := by\n refine ⟨t m, t_isResidueChoice m, ?_⟩\n intro x hx\n have hx_cases : x = 1 ∨ x = 2 ∨ x = 3 := by\n simpa [ResidueSet] using hx.1\n have ht_cases : t m = 1 ∨ t m = 2 ∨ t m = 3 := by\n simpa [ResidueSet] using t_mem_residueSet m\n have hdiff : (3 : ℤ) ∣ x - t m := by\n have hsum : (3 : ℤ) ∣ (m + x) - (m + t m) :=\n dvd_sub hx.2 (t_dvd_add m)\n convert hsum using 1\n ring\n rcases hx_cases with rfl | rfl | rfl <;>\n rcases ht_cases with h | h | h <;>\n first\n | exact h.symm\n | exfalso; rw [h] at hdiff; norm_num at hdiff\n\n/--\nThe value of `2 ^ n`, where the source indexes by an integer `n ≥ 0`.\nFor such an `n`, `n.toNat` is its canonical natural-number representative.\n-/\ndef Pow2 (n : ℤ) : ℤ := (2 : ℤ) ^ n.toNat\n\n/-- On natural-number inputs, `Pow2` is the usual integer power with a natural exponent. -/\ntheorem Pow2_natCast (n : ℕ) : Pow2 (n : ℤ) = (2 : ℤ) ^ n := by\n unfold Pow2\n simp\n\n/-- The three prescribed values of an admissible function `f`. -/\ndef InitialValues (f : ℤ → ℤ) : Prop :=\n f (-1) = 0 ∧ f 0 = 1 ∧ f 1 = -1\n\n/--\nThe recurrence from the source, for all integers `m` and `n` with `n ≥ 0`\nand `2 ^ n > m`.\n-/\ndef Recurrence (f : ℤ → ℤ) : Prop :=\n ∀ (m n : ℤ), 0 ≤ n → Pow2 n > m →\n f (Pow2 n + m) = f (Pow2 n - t m) - f m\n\n/-- Admissibility of `f`: exactly the initial values and the recurrence. -/\ndef fAdmissible (f : ℤ → ℤ) : Prop :=\n InitialValues f ∧ Recurrence f\n\n/-- The desired conclusion for a fixed function `f`. -/\ndef NonnegativeOnMultiplesOfThree (f : ℤ → ℤ) : Prop :=\n ∀ (p : ℤ), 0 ≤ p → 0 ≤ f (3 * p)\n\n/--\nThe target assertion: every admissible `f : ℤ → ℤ` satisfies `f (3 * p) ≥ 0`\nfor every integer `p ≥ 0`.\n-/\ndef Target : Prop :=\n ∀ (f : ℤ → ℤ), fAdmissible f → NonnegativeOnMultiplesOfThree f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1f33b58d-27e0-53ba-92be-64206860607d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2c70d736a90fb439db9a9fb6760a4c26078f7e20cd9fb956f32b1612e23fc614", "task_path": "tasks/nmp3_1f33b58d-27e0-53ba-92be-64206860607d", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1f33b58d-27e0-53ba-92be-64206860607d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1f683616-2605-55b8-99ba-c90dcafd10c7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there are no ordered pairs \\((x,y)\\) of positive integers satisfying \n-- \\[\n-- (x+1)(x+2)\\cdots(x+2014)= (y+1)(y+2)\\cdots (y+4028).\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the problem statement in `problem.md`.\n\nThe problem asks to show that no ordered pair `(x, y)` of positive integers\nsatisfies the equality of the two consecutive products.\n-/\n\nnamespace Problem\n\n/-- The left-hand product `(x + 1) * (x + 2) * ... * (x + 2014)`, for an\ninteger `x`. -/\ndef leftProduct (x : ℤ) : ℤ :=\n ∏ k ∈ Finset.Icc (1 : ℤ) (2014 : ℤ), (x + k)\n\n/-- The right-hand product `(y + 1) * (y + 2) * ... * (y + 4028)`, for an\ninteger `y`. -/\ndef rightProduct (y : ℤ) : ℤ :=\n ∏ k ∈ Finset.Icc (1 : ℤ) (4028 : ℤ), (y + k)\n\n/-- There do not exist positive integers `x` and `y` for which the two\nconsecutive products are equal. -/\ndef Target : Prop :=\n ∀ (x y : ℤ), 0 < x → 0 < y → leftProduct x ≠ rightProduct y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1f683616-2605-55b8-99ba-c90dcafd10c7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2826cad78787760a9bc22b7cd58487d57816cfd4f7e2bb6743e097280af521ce", "task_path": "tasks/nmp3_1f683616-2605-55b8-99ba-c90dcafd10c7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1f683616-2605-55b8-99ba-c90dcafd10c7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1f754551-fbf2-578b-a702-d873533cdebc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy \n-- \\[\n-- ab+bc+ca=abc+2.\n-- \\]\n-- Prove that \n-- \\[\n-- \\frac{ab(2-c)}{a^{2}+abc+b^{2}}+\\frac{bc(2-a)}{b^{2}+abc+c^{2}}+\\frac{ca(2-b)}{c^{2}+abc+a^{2}}\\le 1.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The three parameters are nonnegative real numbers. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The constraint `ab + bc + ca = abc + 2`. -/\ndef ConstraintEquation (a b c : ℝ) : Prop :=\n a * b + b * c + c * a = a * b * c + 2\n\n/-- The admissibility predicate: nonnegative real parameters satisfying the constraint. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ ConstraintEquation a b c\n\n/-- The left-hand side of the asserted inequality, as a real-valued expression. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n a * b * (2 - c) / (a ^ 2 + a * b * c + b ^ 2) +\n b * c * (2 - a) / (b ^ 2 + a * b * c + c ^ 2) +\n c * a * (2 - b) / (c ^ 2 + a * b * c + a ^ 2)\n\n/-- The conclusion that the displayed left-hand side is at most `1`. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n LeftHandSide a b c ≤ 1\n\n/-- The assertion: for every nonnegative real triple satisfying\n`ab + bc + ca = abc + 2`, the displayed sum is at most `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1f754551-fbf2-578b-a702-d873533cdebc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "45389ca3de2d390a42ea7d87efec67ae44ca90999465eece8d59a59ab9fa615b", "task_path": "tasks/nmp3_1f754551-fbf2-578b-a702-d873533cdebc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1f754551-fbf2-578b-a702-d873533cdebc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1f851660-6537-596a-9fe3-727bed93f60e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{1}{a^2+ab+b^2}+\\frac{1}{b^2+bc+c^2}+\\frac{1}{c^2+ca+a^2}\\ge \\frac{9}{(a+b+c)^2}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility condition on the three variables: all are strictly positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / (a ^ 2 + a * b + b ^ 2) +\n 1 / (b ^ 2 + b * c + c ^ 2) +\n 1 / (c ^ 2 + c * a + a ^ 2)\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 9 / (a + b + c) ^ 2\n\n/-- The displayed inequality, for arbitrary real values of the variables. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full universally quantified assertion from the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1f851660-6537-596a-9fe3-727bed93f60e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d80bdb7ded4f5823af146cbb0c9a20bb4b49b3f274541c7ad918c7d664a22d98", "task_path": "tasks/nmp3_1f851660-6537-596a-9fe3-727bed93f60e", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1f851660-6537-596a-9fe3-727bed93f60e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1fa33315-68c4-50a5-b829-8f1c98ea7aec", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c,d>0$ with $a^2+b^2+c^2+d^2=4$, prove that \n-- \\[\n-- \\frac{a^3}{a^2+bc}+\\frac{b^3}{b^2+cd}+\\frac{c^3}{c^2+da}+\\frac{d^3}{d^2+ab}\\ge 2\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe problem asks, for positive real numbers `a b c d` whose squares sum to `4`,\nto prove a cyclic rational inequality.\n-/\n\nnamespace Problem\n\n/-- The admissibility assumptions of the problem: all four variables are\nstrictly positive and the sum of their squares is `4`. -/\ndef admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧\n a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = 4\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def cyclicSum (a b c d : ℝ) : ℝ :=\n a ^ 3 / (a ^ 2 + b * c) +\n b ^ 3 / (b ^ 2 + c * d) +\n c ^ 3 / (c ^ 2 + d * a) +\n d ^ 3 / (d ^ 2 + a * b)\n\n/-- The universally quantified assertion stated by the problem. -/\nnoncomputable def Target : Prop :=\n ∀ (a b c d : ℝ), admissible a b c d → cyclicSum a b c d ≥ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1fa33315-68c4-50a5-b829-8f1c98ea7aec", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2fc7809a99e4776298d3fb1c7eedc633ea18a340bf595871faacce0c09ea20c4", "task_path": "tasks/nmp3_1fa33315-68c4-50a5-b829-8f1c98ea7aec", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1fa33315-68c4-50a5-b829-8f1c98ea7aec", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1fa71f8d-fc24-5bf8-a99d-13f1d34a7f5c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $00$ with $a+b+c=3$. Prove that \n-- $$a^2+b^2+c^2+\\frac{ab+bc+ca}{a^2b+b^2c+c^2a}\\ge 4.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- With `a`, `b`, and `c` positive real numbers whose sum is `3`, the stated\nexpression is at least `4`. This declaration records the proposition to be\nproved; it does not assert the proof. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c → a + b + c = 3 →\n a ^ 2 + b ^ 2 + c ^ 2 +\n (a * b + b * c + c * a) /\n (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a) ≥ 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1ff133c2-3c67-5625-96c4-9de04759fc0b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "49b1b69a6d0359d65f4228029d7d352736d1a9d197deb31d73e8a81e94c29a9e", "task_path": "tasks/nmp3_1ff133c2-3c67-5625-96c4-9de04759fc0b", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1ff133c2-3c67-5625-96c4-9de04759fc0b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_1ffde4ee-3fde-5286-8f5b-b11db3b9261a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for an integer $n>1$ and real numbers $a_0,a_1,\\dots,a_n,k$ satisfying $a_1=a_{n-1}=0$, the following inequality holds:\n-- \\[\n-- |a_0|-|a_n|\\le \\sum_{i=0}^{\\,n-2}\\bigl|a_i - k a_{i+1} - a_{i+2}\\bigr|.\n-- \\]\nimport Mathlib.Basic.Real.Basic\nimport Mathlib.Algebra.BigOperators.Group.Finset.Basic\n\n/-!\n# Formal statement for the inequality problem\n\nThe source problem asks for a proof of a finite-sum inequality for a real\nsequence indexed from `0` to `n`. We represent the finite sequence by a\nfunction `a : ℕ → ℝ`; only `a 0, ..., a n` occur in the statement. The\ninteger index `n > 1` is represented as a natural number together with the\nhypothesis `1 < n`.\n-/\n\nnamespace Problem\n\n/-- For every natural number `n > 1`, every real sequence\n`a₀, a₁, ..., aₙ` with `a₁ = 0` and `aₙ₋₁ = 0`, and every real number `k`,\n\n`|a₀| - |aₙ| ≤ ∑_{i=0}^{n-2} |aᵢ - k aᵢ₊₁ - aᵢ₊₂|`.\n\nThis declaration is only the formal proposition; it contains no proof. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 1 < n → ∀ (a : ℕ → ℝ) (k : ℝ),\n a 1 = 0 →\n a (n - 1) = 0 →\n |a 0| - |a n| ≤\n ∑ i ∈ Finset.range (n - 1), |a i - k * a (i + 1) - a (i + 2)|\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1ffde4ee-3fde-5286-8f5b-b11db3b9261a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "308ebb3af9a1431943735bdcfc5df7e430cf350530b1121fc27e095d9ee395b9", "task_path": "tasks/nmp3_1ffde4ee-3fde-5286-8f5b-b11db3b9261a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "1ffde4ee-3fde-5286-8f5b-b11db3b9261a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_20077724-7483-5d90-b3c1-6da805b06e48", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an equilateral triangle and let $P$ be a point in its interior. Let $A_1$, $B_1$, $C_1$ be the intersections of the lines $AP$, $BP$, $CP$ with the sides $BC$, $CA$, $AB$, respectively. Prove that \n-- \\[\n-- A_1B_1\\cdot B_1C_1\\cdot C_1A_1 \\ge A_1B\\cdot B_1C\\cdot C_1A.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the equilateral-cevian inequality\n\nThe ambient plane is represented by the real Euclidean vector space of\ndimension two. Points are vectors, and lines and closed sides use Mathlib's\naffine line and segment notions. The statement is left as a proposition: no\nproof of it is supplied.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the formalization. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `A`, `B`, `C` are the vertices of a nondegenerate equilateral triangle. -/\ndef IsEquilateralTriangle (A B C : Plane) : Prop :=\n dist A B = dist B C ∧\n dist B C = dist C A ∧\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- `P` lies in the strict (topological) interior of the filled triangle\n`ABC`, i.e. of the convex hull of its three vertices. -/\ndef StrictlyInsideTriangle (A B C P : Plane) : Prop :=\n P ∈ interior (convexHull ℝ ({A, B, C} : Set Plane))\n\n/-- `I` lies on the closed side with endpoints `X` and `Y`. -/\ndef LiesOnSide (I X Y : Plane) : Prop :=\n I ∈ segment ℝ X Y\n\n/-- `I` lies on the line through `X` and `Y`. -/\ndef LiesOnLine (I X Y : Plane) : Prop :=\n I ∈ line[ℝ, X, Y]\n\n/-- `I` is the (unique) point in which the line through `V` and `P` meets\nthe side with endpoints `W` and `X`. -/\ndef IsCevianIntersection (V W X P I : Plane) : Prop :=\n LiesOnSide I W X ∧\n LiesOnLine I V P ∧\n ∀ J : Plane, LiesOnSide J W X → LiesOnLine J V P → J = I\n\n/-- The configuration hypotheses of the problem: an equilateral triangle\n`ABC`, an interior point `P`, and the three cevian intersections. -/\ndef AdmissibleConfiguration (A B C P A₁ B₁ C₁ : Plane) : Prop :=\n IsEquilateralTriangle A B C ∧\n StrictlyInsideTriangle A B C P ∧\n IsCevianIntersection A B C P A₁ ∧\n IsCevianIntersection B C A P B₁ ∧\n IsCevianIntersection C A B P C₁\n\n/-- The product inequality asserted in the problem, with all lengths\ninterpreted as Euclidean distances. -/\ndef DesiredInequality (A B C A₁ B₁ C₁ : Plane) : Prop :=\n dist A₁ B₁ * dist B₁ C₁ * dist C₁ A₁ ≥\n dist A₁ B * dist B₁ C * dist C₁ A\n\n/-- The full target statement: for every equilateral triangle `ABC`, every\ninterior point `P`, and every three intersections as described in the\nproblem, the asserted product inequality holds. -/\ndef Target : Prop :=\n ∀ A B C P A₁ B₁ C₁ : Plane,\n AdmissibleConfiguration A B C P A₁ B₁ C₁ →\n DesiredInequality A B C A₁ B₁ C₁\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20077724-7483-5d90-b3c1-6da805b06e48", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f96b9a7c213c82782db94de74f20be31d543a0b1ce51fd9bda28a248e3166a66", "task_path": "tasks/nmp3_20077724-7483-5d90-b3c1-6da805b06e48", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20077724-7483-5d90-b3c1-6da805b06e48", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_20172ad1-c99d-56fe-a77d-a09a7a549c12", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers. Prove that \n-- \\[\n-- (a^2+3)(b^2+3)(c^2+3)\\;\\ge\\;\\frac{4}{27}\\,\\bigl(3ab+3bc+3ca+abc\\bigr)^2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`, that\n\\[\n(a^2+3)(b^2+3)(c^2+3)\\ge \\frac{4}{27}(3ab+3bc+3ca+abc)^2.\n\\]\nThis file records that assertion as a proposition-valued definition; it does not\nprovide a proof.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`,\nthe stated inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n (a ^ 2 + 3) * (b ^ 2 + 3) * (c ^ 2 + 3) ≥\n (4 / 27 : ℝ) *\n (3 * a * b + 3 * b * c + 3 * c * a + a * b * c) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20172ad1-c99d-56fe-a77d-a09a7a549c12", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "40c6b4b0b1ea098c0a418ca2bc14ff4e74d05e9213d42f405f0f3ed85805ae36", "task_path": "tasks/nmp3_20172ad1-c99d-56fe-a77d-a09a7a549c12", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20172ad1-c99d-56fe-a77d-a09a7a549c12", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_203c6f58-bf58-54a2-bef2-530b9fdd53cc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{bc}{3a^{2}+b^{2}+c^{2}}+\\frac{ca}{3b^{2}+c^{2}+a^{2}}+\\frac{ab}{3c^{2}+a^{2}+b^{2}}\\le \\frac35.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The three variables range over positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the claimed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n b * c / ((3 : ℝ) * a ^ 2 + b ^ 2 + c ^ 2) +\n c * a / ((3 : ℝ) * b ^ 2 + c ^ 2 + a ^ 2) +\n a * b / ((3 : ℝ) * c ^ 2 + a ^ 2 + b ^ 2)\n\n/-- The inequality asserted for a fixed positive triple. -/\ndef inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ (3 : ℝ) / 5\n\n/-- The complete universally quantified claim of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "203c6f58-bf58-54a2-bef2-530b9fdd53cc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "232cada97df4c27c75d9922771b2fd49b3bc200794393ad3e6dd1d4672db0e53", "task_path": "tasks/nmp3_203c6f58-bf58-54a2-bef2-530b9fdd53cc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "203c6f58-bf58-54a2-bef2-530b9fdd53cc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_206b41d4-f4bb-575c-904a-de86b07a1e81", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The point \\(P\\) lies outside the circle \\(\\Omega\\). The two tangents from \\(P\\) to \\(\\Omega\\) touch the circle at \\(A\\) and \\(B\\). Let \\(M\\) be the midpoint of segment \\(PB\\) (so \\(AM\\) is the median from \\(A\\) in \\(\\triangle ABP\\)). The line \\(AM\\) meets \\(\\Omega\\) again at \\(C\\). The line \\(PC\\) meets \\(\\Omega\\) again at \\(D\\). Prove that the lines \\(AD\\) and \\(BP\\) are parallel.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Sphere.Tangent\nimport Mathlib.LinearAlgebra.AffineSpace.Midpoint\n\n/-!\n# Formal statement: tangent-secant configuration\n\nThis file formalizes the geometry problem in the Euclidean plane. The declarations\nbelow only state the problem; no proof of `Problem.Target` is provided.\n-/\n\nnoncomputable section\n\nopen scoped Affine\n\nnamespace Problem\n\n/-- The ambient Euclidean plane used for all the geometric objects. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A Euclidean circle is represented by a sphere with strictly positive radius. -/\ndef IsCircle (Ω : EuclideanGeometry.Sphere Plane) : Prop :=\n 0 < Ω.radius\n\n/-- A point is outside a circle exactly when it is strictly farther from the center\nthan the radius. -/\ndef IsOutside (Ω : EuclideanGeometry.Sphere Plane) (P : Plane) : Prop :=\n Ω.radius < dist P Ω.center\n\n/-- The line through `P` and `X` is tangent to `Ω` at `X`. -/\ndef IsTangentFrom (Ω : EuclideanGeometry.Sphere Plane) (P X : Plane) : Prop :=\n Ω.IsTangentAt X (line[ℝ, P, X])\n\n/-- The line through `X` and `Y` meets the circle `Ω` again at `Z`: both `X` and `Z`\nare on the circle, `Z` is different from the first intersection `X`, and `Z` lies on\nthe line through `X` and `Y`. -/\ndef IsSecondIntersection (Ω : EuclideanGeometry.Sphere Plane) (X Y Z : Plane) : Prop :=\n X ∈ Ω ∧ Z ∈ Ω ∧ Z ≠ X ∧ Z ∈ line[ℝ, X, Y]\n\n/-- The complete assertion of the problem. The ambient plane is the Euclidean plane.\n`Ω` is a genuine circle, `P` is outside it, `PA` and `PB` are the two tangents from\n`P`, `M` is the midpoint of `PB`, `C` is the second intersection of `AM` with `Ω`,\nand `D` is the second intersection of `PC` with `Ω`. The conclusion is `AD ∥ BP`. -/\ndef Target : Prop :=\n ∀ (Ω : EuclideanGeometry.Sphere Plane) (P A B M C D : Plane),\n IsCircle Ω →\n IsOutside Ω P →\n IsTangentFrom Ω P A →\n IsTangentFrom Ω P B →\n A ≠ B →\n M = midpoint ℝ P B →\n IsSecondIntersection Ω A M C →\n IsSecondIntersection Ω C P D →\n line[ℝ, A, D] ∥ line[ℝ, B, P]\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "206b41d4-f4bb-575c-904a-de86b07a1e81", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "97b4e2879699bc82886e4b2d5e796c7f02c789c121e9a600e647707aae634caa", "task_path": "tasks/nmp3_206b41d4-f4bb-575c-904a-de86b07a1e81", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "206b41d4-f4bb-575c-904a-de86b07a1e81", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2072c17f-3b2d-5c70-afbf-fbf9b80e2787", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,x,y,z$ be positive integers. Prove that \n-- \\[\n-- \\frac{bcx}{(x+y)(x+z)}+\\frac{acy}{(x+y)(y+z)}+\\frac{abz}{(x+z)(y+z)}\\le \\frac{(a+b+c)^2}{4(x+y+z)}.\n-- \\]\nimport Mathlib.Data.Rat.Defs\n\nnamespace Problem\n\n/-- A positive integer, represented as a natural number together with a proof\nthat it is strictly greater than zero. -/\ndef PositiveInteger (n : ℕ) : Prop :=\n 0 < n\n\n/-- The left-hand side of the target inequality. All integer inputs are\ncoerced to `ℚ` so that every division is exact rational division. -/\ndef lhs (a b c x y z : ℕ) : ℚ :=\n ((b : ℚ) * (c : ℚ) * (x : ℚ)) /\n (((x : ℚ) + (y : ℚ)) * ((x : ℚ) + (z : ℚ))) +\n ((a : ℚ) * (c : ℚ) * (y : ℚ)) /\n (((x : ℚ) + (y : ℚ)) * ((y : ℚ) + (z : ℚ))) +\n ((a : ℚ) * (b : ℚ) * (z : ℚ)) /\n (((x : ℚ) + (z : ℚ)) * ((y : ℚ) + (z : ℚ)))\n\n/-- The right-hand side of the target inequality. -/\ndef rhs (a b c x y z : ℕ) : ℚ :=\n (((a : ℚ) + (b : ℚ) + (c : ℚ)) ^ 2) /\n (4 * ((x : ℚ) + (y : ℚ) + (z : ℚ)))\n\n/-- The assertion stated in the problem: for all positive integers\n`a, b, c, x, y, z`, the displayed three-term expression is at most the\ndisplayed square divided by four times the sum `x + y + z`. -/\ndef Target : Prop :=\n ∀ a b c x y z : ℕ,\n PositiveInteger a → PositiveInteger b → PositiveInteger c →\n PositiveInteger x → PositiveInteger y → PositiveInteger z →\n lhs a b c x y z ≤ rhs a b c x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2072c17f-3b2d-5c70-afbf-fbf9b80e2787", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1150f0016215fde7210dce696841db90caf296ef97353ab6e8d224cb475de0d6", "task_path": "tasks/nmp3_2072c17f-3b2d-5c70-afbf-fbf9b80e2787", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2072c17f-3b2d-5c70-afbf-fbf9b80e2787", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_20833953-48bd-5ff8-ae6a-421a4bc8bcee", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\in\\mathbb{R}_{+}$ satisfy $xyz=1$, and let $p,q\\in\\mathbb{N}_{+}$. Prove that \n-- \\[\n-- \\frac{(x+y-1)^{p}}{z^{q}}+\\frac{(y+z-1)^{p}}{x^{q}}+\\frac{(z+x-1)^{p}}{y^{q}}\\ge x+y+z\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the inequality problem\n\nThe original problem uses `ℝ₊` for positive real numbers and `ℕ₊` for positive\nnatural numbers. The target below records the universally quantified assertion\nto be proved, rather than providing a proof of it.\n-/\n\nnamespace Problem\n\n/--\nFor all positive real numbers `x`, `y`, and `z` whose product is `1`, and all\npositive natural numbers `p` and `q`, the displayed sum of three quotient terms\nis at least `x + y + z`.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z → x * y * z = 1 →\n ∀ p q : ℕ,\n 0 < p → 0 < q →\n ((x + y - 1) ^ p / z ^ q +\n (y + z - 1) ^ p / x ^ q +\n (z + x - 1) ^ p / y ^ q) ≥ x + y + z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20833953-48bd-5ff8-ae6a-421a4bc8bcee", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5043d633de5ddf1504b3d9d738f9c93c1ef0654032adfd5bfccf59e6e06448f3", "task_path": "tasks/nmp3_20833953-48bd-5ff8-ae6a-421a4bc8bcee", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20833953-48bd-5ff8-ae6a-421a4bc8bcee", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_20904241-3f22-508b-b8d1-567ab7d5dbf6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $d$ be a positive divisor of $5+1998^{1998}$. Prove that $d$ can be expressed as $2x^{2}+2xy+3y^{2}$ with integers $x,y$ if and only if $d\\equiv3\\text{ or }7\\pmod{20}$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The fixed natural number `5 + 1998 ^ 1998`. -/\ndef N : Nat := 5 + 1998 ^ 1998\n\n/-- `d` is a positive divisor of `5 + 1998 ^ 1998`. -/\ndef IsPositiveDivisorOfN (d : Nat) : Prop :=\n 0 < d ∧ d ∣ N\n\n/-- `d` is represented by the integral binary quadratic form\n`2 * x ^ 2 + 2 * x * y + 3 * y ^ 2`. -/\ndef IsRepresentable (d : Nat) : Prop :=\n ∃ x y : Int, (d : Int) = 2 * x ^ 2 + 2 * x * y + 3 * y ^ 2\n\n/-- `d` is congruent to either `3` or `7` modulo `20`. -/\ndef HasRequiredResidue (d : Nat) : Prop :=\n d % 20 = 3 ∨ d % 20 = 7\n\n/-- For every positive divisor `d` of `5 + 1998 ^ 1998`, `d` is represented by\n`2 * x ^ 2 + 2 * x * y + 3 * y ^ 2` for integers `x, y` if and only if\n`d` is congruent to `3` or `7` modulo `20`. -/\ndef Target : Prop :=\n ∀ d : Nat, IsPositiveDivisorOfN d → (IsRepresentable d ↔ HasRequiredResidue d)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20904241-3f22-508b-b8d1-567ab7d5dbf6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "189a379cddc21a67feb878ea3dba2aafa586244484cad73f3f834c59fc0f230b", "task_path": "tasks/nmp3_20904241-3f22-508b-b8d1-567ab7d5dbf6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20904241-3f22-508b-b8d1-567ab7d5dbf6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2091efcc-2099-5505-b6b5-4efd696c7c66", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given non‑negative real numbers \\(a,b,c\\) with \\(ab+bc+ca>0\\), prove that \n-- \\[\n-- \\left(\\frac{a}{b+c}+\\frac{b}{c+a}\\right)\n-- \\left(\\frac{b}{c+a}+\\frac{c}{a+b}\\right)\n-- \\left(\\frac{c}{a+b}+\\frac{a}{b+c}\\right)\n-- +\\frac{8abc}{(a+b)(b+c)(c+a)}\\ge 2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the nonnegative-real inequality\n\nThe source problem asks for a proof that, for all nonnegative real numbers\n`a`, `b`, and `c` satisfying `ab + bc + ca > 0`, the displayed cyclic\ninequality holds.\n-/\n\nnamespace Problem\n\n/--\nFor all nonnegative real numbers `a`, `b`, and `c` with\n`ab + bc + ca > 0`, the product of the three cyclic sums of adjacent\nfractions, plus `8abc / ((a+b)(b+c)(c+a))`, is at least `2`.\n\nThe assumptions are exactly the source hypotheses. In particular,\n`ab + bc + ca > 0` implies that each of `a+b`, `b+c`, and `c+a` is\npositive, so all displayed fractions are the intended ordinary real\nfractions; no denominator-nonzero assumption is added to the statement.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n 0 < a * b + b * c + c * a →\n (a / (b + c) + b / (c + a)) *\n (b / (c + a) + c / (a + b)) *\n (c / (a + b) + a / (b + c)) +\n (8 * a * b * c) / ((a + b) * (b + c) * (c + a)) ≥\n (2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2091efcc-2099-5505-b6b5-4efd696c7c66", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "86ca33c91098d417f1fb8e7835b89a841ec2a7777400168705fe6a2105c520f7", "task_path": "tasks/nmp3_2091efcc-2099-5505-b6b5-4efd696c7c66", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2091efcc-2099-5505-b6b5-4efd696c7c66", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_209efccc-4124-5e80-9459-7c1037be6926", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $x,y,z>0$ and $x+y+z=3$, prove that \n-- $$3\\Big(\\frac1x+\\frac1y+\\frac1z\\Big)+8\\ge\\frac{17}{\\sqrt[3]{xyz}}\\,. $$\nimport Mathlib\n\n/-!\n# Formalization of an inequality problem\n\nThe source problem asks, for positive real numbers `x`, `y`, and `z` with\n`x + y + z = 3`, to prove\n\n`3 * (1 / x + 1 / y + 1 / z) + 8 ≥ 17 / cbrt (x * y * z)`.\n\nMathlib does not provide a dedicated real cube-root function in this version,\nso `Problem.CubeRoot` is defined as the real power with exponent `1 / 3`.\nFor nonnegative arguments this is the ordinary real cube root.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The real cube root, represented by the real power with exponent `1 / 3`. -/\ndef CubeRoot (a : ℝ) : ℝ :=\n Real.rpow a (1 / 3 : ℝ)\n\n/-- The assertion from the problem: for all positive reals `x y z` whose sum is `3`,\nthe stated inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z → x + y + z = 3 →\n 3 * (1 / x + 1 / y + 1 / z) + 8 ≥ 17 / CubeRoot (x * y * z)\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "209efccc-4124-5e80-9459-7c1037be6926", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d3d9e40329ec0fd434451b3fb453107487f41f095e50e9db2cba4edd2b40a913", "task_path": "tasks/nmp3_209efccc-4124-5e80-9459-7c1037be6926", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "209efccc-4124-5e80-9459-7c1037be6926", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_20a1c4a0-c026-5c87-80fa-d5283ea48e1b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>1$ be real numbers such that $a+b+c=9$. Prove that \n-- \\[\n-- \\sqrt{ab+bc+ca}\\;\\le\\;\\sqrt a+\\sqrt b+\\sqrt c\\;\\le\\;\\sqrt{a^{2}+b^{2}+c^{2}}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the stated inequality problem\n\nThe source problem fixes three real numbers `a`, `b`, and `c`, each strictly\ngreater than `1`, with sum `9`, and asks for the two-sided inequality\n\n`sqrt (a*b + b*c + c*a) ≤ sqrt a + sqrt b + sqrt c\n ≤ sqrt (a^2 + b^2 + c^2)`.\n\nThe declarations below state that problem as propositions. They intentionally\ncontain no proof of the inequality.\n-/\n\nnamespace Problem\n\n/-- The left-hand inequality in the stated chain. -/\ndef LeftInequality (a b c : ℝ) : Prop :=\n Real.sqrt (a * b + b * c + c * a) ≤\n Real.sqrt a + Real.sqrt b + Real.sqrt c\n\n/-- The right-hand inequality in the stated chain. -/\ndef RightInequality (a b c : ℝ) : Prop :=\n Real.sqrt a + Real.sqrt b + Real.sqrt c ≤\n Real.sqrt (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The complete two-sided inequality under the source problem's hypotheses. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 1 < a → 1 < b → 1 < c → a + b + c = 9 →\n LeftInequality a b c ∧ RightInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20a1c4a0-c026-5c87-80fa-d5283ea48e1b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1a42a5e485c7e27390d11fcb17bf9eebfbf849a48c38eb88586bdbb3ac352be1", "task_path": "tasks/nmp3_20a1c4a0-c026-5c87-80fa-d5283ea48e1b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20a1c4a0-c026-5c87-80fa-d5283ea48e1b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_20b94021-5208-57cd-8649-330bb4e3fba4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots,a_n>0$ with $n\\ge 2$. Prove that \n-- \\[\n-- \\sum_{i=1}^n \\max\\{a_1,a_2,\\dots,a_i\\}\\;\\cdot\\;\\min\\{a_i,a_{i+1},\\dots,a_n\\}\\;\\le\\;\\frac{n}{2\\sqrt{\\,n-1\\,}}\\sum_{i=1}^n a_i^2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe original problem asks, for integers `n ≥ 2` and positive real numbers\n`a₁, …, aₙ`, to prove an inequality involving prefix maxima and suffix minima.\n\nWe index the `n` numbers by `Fin n`; thus `a i` denotes the original\n`a_{i+1}`. The prefix maximum and suffix minimum are represented using the\nmaximum and minimum of the corresponding nonempty finite index sets.\n-/\n\nnamespace Problem\n\nopen scoped BigOperators\n\n/-- The maximum of the prefix `a₁, …, a_{i+1}`, expressed with zero-based\nindices: the maximum of `a j` for all `j ≤ i`. -/\ndef prefixMax {n : ℕ} (a : Fin n → ℝ) (i : Fin n) : ℝ :=\n (Finset.univ.filter (fun j : Fin n => j ≤ i)).sup' (by\n refine ⟨i, ?_⟩\n simp) a\n\n/-- The minimum of the suffix `a_{i+1}, …, aₙ`, expressed with zero-based\nindices: the minimum of `a j` for all `i ≤ j`. -/\ndef suffixMin {n : ℕ} (a : Fin n → ℝ) (i : Fin n) : ℝ :=\n (Finset.univ.filter (fun j : Fin n => i ≤ j)).inf' (by\n refine ⟨i, ?_⟩\n simp) a\n\n/-- The left-hand side of the target inequality. -/\ndef sumPrefixMaxMulSuffixMin {n : ℕ} (a : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, prefixMax a i * suffixMin a i\n\n/-- The sum of the squares on the right-hand side of the target inequality. -/\ndef sumSquares {n : ℕ} (a : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, (a i) ^ 2\n\n/-- The admissibility assumptions of the problem: `n ≥ 2` and every\n`a_i` is strictly positive. -/\ndef Admissible (n : ℕ) (a : Fin n → ℝ) : Prop :=\n 2 ≤ n ∧ ∀ i : Fin n, 0 < a i\n\n/-- The full assertion of the problem: for every `n ≥ 2` and every sequence\nof `n` positive real numbers, the prefix-maximum/suffix-minimum sum is at most\n`n / (2 * sqrt (n - 1))` times the sum of squares. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (a : Fin n → ℝ), Admissible n a →\n sumPrefixMaxMulSuffixMin a ≤\n (n : ℝ) / (2 * Real.sqrt ((n : ℝ) - 1)) * sumSquares a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20b94021-5208-57cd-8649-330bb4e3fba4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "76a9433c79237c9b225f76e040e6dad14d31b08ec2ee66e4066928f180c1393e", "task_path": "tasks/nmp3_20b94021-5208-57cd-8649-330bb4e3fba4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20b94021-5208-57cd-8649-330bb4e3fba4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_20c22041-3783-512e-bfb2-2a929a971181", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k$ be a positive integer. Prove that the number $(4k^{2}-1)^{2}$ has a positive divisor of the form $8kn-1$ for some positive integer $n$ if and only if $k$ is even.\nimport Mathlib\n\nnamespace Problem\n\n/-- The natural number of the form `8 * k * n - 1`. Under the hypotheses\n`0 < k` and `0 < n`, the subtraction is ordinary, non-truncated subtraction. -/\ndef ValueOfForm (k n : ℕ) : ℕ :=\n 8 * k * n - 1\n\n/-- A positive natural number `d` has the required form for the fixed positive\ninteger `k`, for some positive integer `n`. -/\ndef IsPositiveValueOfForm (k d : ℕ) : Prop :=\n 0 < d ∧ ∃ n : ℕ, 0 < n ∧ d = ValueOfForm k n\n\n/-- The square `(4 * k ^ 2 - 1) ^ 2` has a positive divisor `d` which is of\nthe form `8 * k * n - 1` for some positive integer `n`. -/\ndef HasPositiveDivisorOfForm (k : ℕ) : Prop :=\n ∃ d : ℕ, IsPositiveValueOfForm k d ∧ d ∣ (4 * k ^ 2 - 1) ^ 2\n\n/-- The statement of the problem: for every positive integer `k`, the square\n`(4 * k ^ 2 - 1) ^ 2` has a positive divisor of the form `8 * k * n - 1` for\nsome positive integer `n` if and only if `k` is even. -/\ndef Target : Prop :=\n ∀ k : ℕ, 0 < k → (HasPositiveDivisorOfForm k ↔ Even k)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20c22041-3783-512e-bfb2-2a929a971181", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9357b46bfff99fc46a84efc2087d2b3e7a6766823af0a3551da355bf00fbdc1c", "task_path": "tasks/nmp3_20c22041-3783-512e-bfb2-2a929a971181", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20c22041-3783-512e-bfb2-2a929a971181", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_20ed9826-ebb3-5a78-97bb-bb552118e2a7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for every natural number $n>1$, there exist $n$ distinct natural numbers $a_1,a_2,\\dots,a_n$ such that for any two distinct indices $i\\neq j$, the sum $a_i+a_j$ is divisible by their difference $a_i-a_j$ (i.e., $a_i-a_j\\mid a_i+a_j$).\nimport Mathlib\n\nnamespace Problem\n\n/-- The pairwise divisibility condition for an `n`-indexed family of natural\nnumbers. The entries are cast to integers before forming the difference and\nthe sum, so that subtraction is the usual signed difference rather than\ntruncated natural subtraction. -/\ndef PairwiseDifferenceDividesSum (n : ℕ) (a : Fin n → ℕ) : Prop :=\n ∀ i j : Fin n, i ≠ j →\n ((a i : ℤ) - (a j : ℤ)) ∣ ((a i : ℤ) + (a j : ℤ))\n\n/-- A family of `n` natural numbers is admissible for the problem when its\nentries are pairwise distinct and its pairwise signed differences divide the\ncorresponding sums. -/\ndef Admissible (n : ℕ) (a : Fin n → ℕ) : Prop :=\n Function.Injective a ∧ PairwiseDifferenceDividesSum n a\n\n/-- For every natural number `n > 1`, there exist `n` distinct natural numbers\nsuch that the difference of any two of them divides their sum. -/\ndef Target : Prop :=\n ∀ n : ℕ, 1 < n → ∃ a : Fin n → ℕ, Admissible n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20ed9826-ebb3-5a78-97bb-bb552118e2a7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "359fc16016c1d578c8c10729e63d2478fc4e08f3561b329c8563412964d682dc", "task_path": "tasks/nmp3_20ed9826-ebb3-5a78-97bb-bb552118e2a7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20ed9826-ebb3-5a78-97bb-bb552118e2a7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_20f87087-0de3-5369-ad46-f5bc7abe80c1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c$ positive real numbers, prove that \n-- \\[\n-- \\sqrt{\\frac{a}{\\,b+c\\,}}+\\sqrt{\\frac{b}{\\,a+c\\,}}+\\sqrt{\\frac{c}{\\,a+b\\,}}\n-- \\;\\ge\\;\n-- \\frac{(a+b+c)^{2}}{\\sqrt{2\\,(ab+bc+ca)\\,(a^{2}+b^{2}+c^{2})}}\\,.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the claimed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a / (b + c)) + Real.sqrt (b / (a + c)) + Real.sqrt (c / (a + b))\n\n/-- The right-hand side of the claimed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (a + b + c) ^ 2 /\n Real.sqrt (2 * (a * b + b * c + c * a) * (a ^ 2 + b ^ 2 + c ^ 2))\n\n/-- For every triple of positive real numbers `a`, `b`, `c`, the sum of the\nthree square-root ratios is at least the displayed quotient. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20f87087-0de3-5369-ad46-f5bc7abe80c1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a7fea5ce9ae2525c8b803826021ec66f46624a592f4b9294d3f9e7ef362d6de3", "task_path": "tasks/nmp3_20f87087-0de3-5369-ad46-f5bc7abe80c1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "20f87087-0de3-5369-ad46-f5bc7abe80c1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_210ea03a-1670-5124-8837-fe50806c0351", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers \\(a,b,c\\), prove that \n-- \\[\n-- \\frac{1}{a}+\\frac{1}{b}+\\frac{1}{c}\\;\\ge\\;\\frac{3a}{a^{2}+2bc}+\\frac{3b}{b^{2}+2ca}+\\frac{3c}{c^{2}+2ab}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality\n\nFor positive real numbers `a`, `b`, and `c`, the problem asks to prove\n`1 / a + 1 / b + 1 / c ≥ 3*a / (a^2 + 2*b*c) + ...`.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / a + 1 / b + 1 / c\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 3 * a / (a ^ 2 + 2 * b * c) +\n 3 * b / (b ^ 2 + 2 * c * a) +\n 3 * c / (c ^ 2 + 2 * a * b)\n\n/-- The inequality asserted for a particular triple of real numbers. -/\nnoncomputable def InequalityHolds (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full statement: the inequality holds for every triple of positive reals. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → InequalityHolds a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "210ea03a-1670-5124-8837-fe50806c0351", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "48347c09c6111dbfe324e6eb2365b3eba0e8c3feda7ef605e5209b96eea92522", "task_path": "tasks/nmp3_210ea03a-1670-5124-8837-fe50806c0351", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "210ea03a-1670-5124-8837-fe50806c0351", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_212b1a7b-c8f3-5c5b-a398-ccda7e77c230", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle. Extend side $BC$ beyond $C$ to a point $D$, side $CA$ beyond $A$ to a point $E$, and side $AB$ beyond $B$ to a point $F$ such that \n-- $$CD = AE = BF.$$ \n-- Prove that if $\\triangle DEF$ is equilateral then $\\triangle ABC$ is also equilateral.\nmodule\n\npublic import Mathlib.Analysis.Convex.Between\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\n/-!\n# Formal statement of the triangle-extension problem\n\nWe work in the real Euclidean plane. Points on a side are extended beyond\nthe indicated endpoint, and all segment lengths are Euclidean distances.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- Points of the two-dimensional real Euclidean plane. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Three points form a (nondegenerate) triangle when they are not collinear. -/\ndef Triangle (A B C : Point) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Point)\n\n/-- `X`, `Y`, and `Z` are in this order on a line: `Y` lies strictly between\n`X` and `Z`. -/\ndef Beyond (X Y Z : Point) : Prop :=\n Sbtw ℝ X Y Z\n\n/-- The three side lengths of `ABC` are equal. -/\ndef EqualSideLengths (A B C : Point) : Prop :=\n dist A B = dist B C ∧ dist B C = dist C A\n\n/-- `ABC` is an equilateral triangle: it is a triangle and all its side\nlengths are equal. -/\ndef EquilateralTriangle (A B C : Point) : Prop :=\n Triangle A B C ∧ EqualSideLengths A B C\n\n/-- The three extension points are beyond the prescribed vertices and the\nthree newly added segment lengths are all equal. -/\ndef ExtensionData (A B C D E F : Point) : Prop :=\n Beyond B C D ∧ Beyond C A E ∧ Beyond A B F ∧\n dist C D = dist A E ∧ dist A E = dist B F\n\n/-- The target statement: for every triangle `ABC` and every extensions\n`D`, `E`, `F` with `CD = AE = BF`, if `DEF` is equilateral then `ABC` is\nequilateral. -/\ndef Target : Prop :=\n ∀ A B C D E F : Point,\n Triangle A B C →\n ExtensionData A B C D E F →\n EquilateralTriangle D E F → EquilateralTriangle A B C\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "212b1a7b-c8f3-5c5b-a398-ccda7e77c230", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cd28fb89f8370f4607a23b3c2b41e95921eb325fc56a526fa384814e8a031a19", "task_path": "tasks/nmp3_212b1a7b-c8f3-5c5b-a398-ccda7e77c230", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "212b1a7b-c8f3-5c5b-a398-ccda7e77c230", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_215f801a-eb8f-5970-b198-899ec8b96e2e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exists a positive integer N such that for any coloring of the cells of an N × N board with two colors (red and blue), one can find four cells of the same color whose centers are the vertices of a (non‑degenerate) geometric square.\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the board-coloring square theorem\n\nWe model an `N × N` board by pairs of cells indexed by `Fin N × Fin N`.\nEach cell is represented geometrically by its center, placed at the\nhalf-integer point `(i + 1/2, j + 1/2)` in the real plane. Since all\nboard centers are translated by the same vector, this choice of\ncoordinates does not restrict the possible geometric squares.\n\nA coloring with two colors is represented by a function to `Bool`.\nThe main assertion is unproved: `Problem.Target` is a proposition-valued\ndefinition whose body is the statement of the problem.\n-/\n\nnamespace Problem\n\n/-- A point in the Euclidean plane, represented by its Cartesian coordinates. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- The cells of an `N × N` board. -/\nabbrev Board (N : ℕ) : Type := Fin N × Fin N\n\n/-- The center of a board cell, with the standard half-integer placement. -/\nnoncomputable def CellCenter {N : ℕ} (cell : Board N) : Point :=\n (((cell.1 : ℕ) : ℝ) + (1 / 2 : ℝ),\n ((cell.2 : ℕ) : ℝ) + (1 / 2 : ℝ))\n\n/-- Coordinatewise addition of planar points. -/\ndef VecAdd (p q : Point) : Point :=\n (p.1 + q.1, p.2 + q.2)\n\n/-- Coordinatewise subtraction of planar points. -/\ndef VecSub (p q : Point) : Point :=\n (p.1 - q.1, p.2 - q.2)\n\n/-- The Euclidean dot product of two planar vectors. -/\ndef Dot (u v : Point) : ℝ :=\n u.1 * v.1 + u.2 * v.2\n\n/-- The square of the Euclidean norm of a planar vector. -/\ndef NormSq (u : Point) : ℝ :=\n u.1 * u.1 + u.2 * u.2\n\n/--\nFour planar points `p₀ p₁ p₂ p₃`, in cyclic order, are the vertices of a\nnon-degenerate square.\n\nConcretely, writing `u = p₁ - p₀` and `v = p₃ - p₀`, the two adjacent\nside vectors from `p₀` must have positive equal lengths and be perpendicular,\nand `p₂` must be the fourth vertex `p₀ + u + v`. This permits squares of\narbitrary orientation, and the positivity condition excludes degeneracy.\n-/\ndef IsNondegenerateSquareCyclic (p₀ p₁ p₂ p₃ : Point) : Prop :=\n let u : Point := VecSub p₁ p₀\n let v : Point := VecSub p₃ p₀\n (0 : ℝ) < NormSq u ∧\n Dot u v = (0 : ℝ) ∧\n NormSq u = NormSq v ∧\n p₂ = VecAdd (VecAdd p₀ u) v\n\n/--\nA two-coloring of an `N × N` board contains four pairwise distinct cells,\nall of the same color, whose centers are the vertices of a non-degenerate\ngeometric square.\n-/\ndef HasMonochromaticSquare {N : ℕ} (coloring : Board N → Bool) : Prop :=\n ∃ cells : Fin 4 ↪ Board N,\n (∀ i : Fin 4, coloring (cells i) = coloring (cells 0)) ∧\n IsNondegenerateSquareCyclic\n (CellCenter (cells 0))\n (CellCenter (cells 1))\n (CellCenter (cells 2))\n (CellCenter (cells 3))\n\n/--\nThe asserted theorem: there exists a positive integer `N` such that every\ntwo-coloring of the cells of an `N × N` board has a monochromatic\nnon-degenerate geometric square formed by four cell centers.\n-/\ndef Target : Prop :=\n ∃ N : ℕ, 0 < N ∧\n ∀ coloring : Board N → Bool, HasMonochromaticSquare coloring\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "215f801a-eb8f-5970-b198-899ec8b96e2e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0cc2c2454b0b24a2e0a9c55cdfaf71d8180aec7ba89f8b64cf0b3234bcb6475f", "task_path": "tasks/nmp3_215f801a-eb8f-5970-b198-899ec8b96e2e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "215f801a-eb8f-5970-b198-899ec8b96e2e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_217d85d7-de75-5fdd-ab0b-899265032421", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb R$. Prove that \n-- \\[\n-- \\sqrt[3]{a}\\,(a+b-c)\\;+\\;\\sqrt[3]{b}\\,(b+c-a)\\;+\\;\\sqrt[3]{c}\\,(c+a-b)\\;\\ge\\;0.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formal statement for the real cube-root inequality\n\nThe source problem quantifies over three arbitrary real numbers and asks for the\nnonnegativity of a cyclic sum involving real cube roots. Mathlib has no bundled\nreal cube-root function, so `Problem.realCubeRoot` below makes the standard odd\nreal cube-root interpretation explicit. For positive `x` this is the real\npower `x ^ (1 / 3)`; at `x = 0` it is zero; for negative `x` it is the negative\nof the cube root of `-x`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The real (odd) cube root of a real number.\n\nFor `x > 0` this is `x ^ (1 / 3 : ℝ)`, and at `x = 0` it is `0`.\nFor `x < 0` it is `-((-x) ^ (1 / 3 : ℝ))`, so that the result is negative and\nits cube is `x`. -/\ndef realCubeRoot (x : ℝ) : ℝ :=\n if x = 0 then\n 0\n else if 0 < x then\n Real.rpow x (1 / 3 : ℝ)\n else\n -Real.rpow (-x) (1 / 3 : ℝ)\n\n/-- The cyclic sum appearing on the left-hand side of the problem. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n realCubeRoot a * (a + b - c) +\n realCubeRoot b * (b + c - a) +\n realCubeRoot c * (c + a - b)\n\n/-- The proposition asserted by the problem: for every triple of real numbers,\nthe cyclic sum is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ cyclicSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "217d85d7-de75-5fdd-ab0b-899265032421", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "446a9bd71d82510c8565c409da52813d10b2758b2dd7563f0c93357f742ab6c1", "task_path": "tasks/nmp3_217d85d7-de75-5fdd-ab0b-899265032421", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "217d85d7-de75-5fdd-ab0b-899265032421", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_21af659a-4dcb-54ca-8122-7d8588a8cc66", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- We consider all functions $f:\\mathbb N\\to\\mathbb N$ such that \n-- $$f(f(n)+n)=n$$ \n-- and \n-- $$f(a+b-1)\\le f(a)+f(b)$$ \n-- for all positive integers $a,b,n$. Prove that there are at most two possible values for $f(2022)\\,.$\nimport Mathlib.Data.Set.Card\n\nnamespace Problem\n\n/-- The first functional equation of the problem, restricted to positive inputs,\nfor functions from nonnegative integers to nonnegative integers. -/\ndef FirstEquation (f : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, 0 < n → f (f n + n) = n\n\n/-- The second functional inequality of the problem, restricted to positive\narguments, for functions from nonnegative integers to nonnegative integers. -/\ndef SecondInequality (f : ℕ → ℕ) : Prop :=\n ∀ a b : ℕ, 0 < a → 0 < b → f (a + b - 1) ≤ f a + f b\n\n/-- Admissibility of a function: it satisfies both displayed conditions. -/\ndef Admissible (f : ℕ → ℕ) : Prop :=\n FirstEquation f ∧ SecondInequality f\n\n/-- The set of all values attained by `f 2022` as `f` ranges over admissible functions. -/\ndef PossibleValuesAt2022 : Set ℕ :=\n {y : ℕ | ∃ f : ℕ → ℕ, Admissible f ∧ f 2022 = y}\n\n/-- A set has at most two elements, expressed using extended cardinality. -/\ndef AtMostTwo (s : Set ℕ) : Prop :=\n s.encard ≤ (2 : ℕ∞)\n\n/-- The proposition requested by the problem: among all admissible functions,\n`f 2022` has at most two possible values. -/\ndef Target : Prop :=\n AtMostTwo PossibleValuesAt2022\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "21af659a-4dcb-54ca-8122-7d8588a8cc66", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "63ce26f36b94e3ee46dac28d1c0e995c0ae82c0662dc5aca81a00b079140b030", "task_path": "tasks/nmp3_21af659a-4dcb-54ca-8122-7d8588a8cc66", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "21af659a-4dcb-54ca-8122-7d8588a8cc66", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_21bf3409-0ebf-5afe-941d-58c4e715e7b1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let c > 2, and let a(1), a(2), … be a sequence of non‑negative real numbers satisfying \n-- \n-- \\[\n-- a(m+n)\\;\\le\\;2\\,a(m)+2\\,a(n)\\qquad\\text{for all integers }m,n\\ge1,\n-- \\]\n-- \n-- and \n-- \n-- \\[\n-- a(2^{k})\\;\\le\\;\\frac{1}{(k+1)^{c}}\\qquad\\text{for all integers }k\\ge0.\n-- \\]\n-- \n-- Prove that the sequence \\{a(n)\\} is bounded; i.e. there exists a constant M (independent of n) such that a(n) ≤ M for every positive integer n.\nimport Mathlib\n\n/-!\nFormalization of the statement in `problem.md`.\n\nThe original sequence is indexed by the positive integers. We use Mathlib's\ntype `ℕ+` (notation for `PNat`) as that index type, so every index is\nautomatically positive and no irrelevant value at index zero is introduced.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The sequence is non-negative at every positive index. -/\ndef NonnegativeOnPositive (a : ℕ+ → ℝ) : Prop :=\n ∀ n : ℕ+, (0 : ℝ) ≤ a n\n\n/-- The two-term growth inequality, stated for all positive indices. -/\ndef GrowthInequality (a : ℕ+ → ℝ) : Prop :=\n ∀ m n : ℕ+, a (m + n) ≤ (2 : ℝ) * a m + (2 : ℝ) * a n\n\n/-- The dyadic upper bound, with the real power `(k + 1) ^ c`. -/\ndef DyadicBound (c : ℝ) (a : ℕ+ → ℝ) : Prop :=\n ∀ k : ℕ,\n a ((2 : ℕ+) ^ k) ≤ (1 : ℝ) / Real.rpow ((k : ℝ) + 1) c\n\n/-- The conclusion: the positive-indexed sequence has an upper bound. -/\ndef BoundedOnPositive (a : ℕ+ → ℝ) : Prop :=\n ∃ M : ℝ, ∀ n : ℕ+, a n ≤ M\n\n/-- The full universally quantified mathematical assertion from the problem. -/\ndef Target : Prop :=\n ∀ c : ℝ, 2 < c →\n ∀ a : ℕ+ → ℝ,\n NonnegativeOnPositive a →\n GrowthInequality a →\n DyadicBound c a →\n BoundedOnPositive a\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "21bf3409-0ebf-5afe-941d-58c4e715e7b1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0ce1397a5d2c763aefa12f449f57bce26d014c8b863616823c80277d186a89aa", "task_path": "tasks/nmp3_21bf3409-0ebf-5afe-941d-58c4e715e7b1", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "21bf3409-0ebf-5afe-941d-58c4e715e7b1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_21f1c5a4-30c0-52df-a895-7dbc57e91009", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be an integer with $n>3$. Prove that there exists a prime divisor $q$ of $2^n+1$ such that $q \\equiv 1 \\pmod{n}$.\nimport Mathlib\n\n/-!\n# Statement: a prime divisor of `2^n + 1` congruent to one modulo `n`\n\nThe source problem quantifies over an integer `n` with `n > 3`. This file records the\nassertion as a proposition-valued declaration; no proof of the assertion is supplied.\n-/\n\nnamespace Problem\n\n/-- The integer `2^n + 1`. Under the hypothesis `n > 3`, the natural number `n.toNat`\nis exactly the positive integer exponent `n`. -/\ndef twoPowPlusOne (n : ℤ) : ℤ :=\n (2 : ℤ) ^ n.toNat + 1\n\n/-- A natural number `q` is a prime divisor of `2^n + 1`. -/\ndef IsPrimeDivisorOfTwoPowPlusOne (n : ℤ) (q : ℕ) : Prop :=\n Nat.Prime q ∧ (q : ℤ) ∣ twoPowPlusOne n\n\n/-- The integer `q` is congruent to `1` modulo the integer `n`. -/\ndef IsCongruentOneMod (n : ℤ) (q : ℕ) : Prop :=\n (q : ℤ) ≡ 1 [ZMOD n]\n\n/-- For every integer `n > 3`, there exists a prime divisor `q` of `2^n + 1`\nsuch that `q ≡ 1 (mod n)`. -/\ndef Target : Prop :=\n ∀ n : ℤ, 3 < n →\n ∃ q : ℕ, IsPrimeDivisorOfTwoPowPlusOne n q ∧ IsCongruentOneMod n q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "21f1c5a4-30c0-52df-a895-7dbc57e91009", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8ecdc8a37a84d2accb5990b59f0329841d57a97387ff5c90c97d59a87ade6884", "task_path": "tasks/nmp3_21f1c5a4-30c0-52df-a895-7dbc57e91009", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "21f1c5a4-30c0-52df-a895-7dbc57e91009", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_22138888-d248-5e49-9cce-b6694729496e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any set of $2000$ distinct real numbers there exist two ordered pairs $(a,b)$ and $(c,d)$ with $a>b$, $c>d$, and $(a,b)\\neq(c,d)$ (i.e., $a\\neq c$ or $b\\neq d$) such that \n-- \\[\n-- \\left|\\frac{a-b}{c-d}-1\\right|<\\frac1{100000}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- For every set of `2000` distinct real numbers, there exist two distinct ordered\npairs `(a, b)` and `(c, d)` of elements of the set, each with larger first coordinate,\nwhose positive difference quotient is within `1 / 100000` of `1`. -/\ndef Target : Prop :=\n ∀ S : Finset ℝ, S.card = (2000 : ℕ) →\n ∃ a b c d : ℝ,\n a ∈ S ∧ b ∈ S ∧ c ∈ S ∧ d ∈ S ∧\n a > b ∧ c > d ∧ (a ≠ c ∨ b ≠ d) ∧\n |(a - b) / (c - d) - 1| < (1 : ℝ) / (100000 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "22138888-d248-5e49-9cce-b6694729496e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a51783cc87c280682b4f24ed31b0f8d997f94aa53d8bbda55b0794a6cb905e44", "task_path": "tasks/nmp3_22138888-d248-5e49-9cce-b6694729496e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "22138888-d248-5e49-9cce-b6694729496e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2217c80c-eaa7-55c3-9f61-8c137ec7fe8d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a$, $b$, $c$ are the sides of a triangle (i.e. $a,b,c>0$ and $a0$. Prove that \n-- \\[\n-- \\frac{b^{2}+ac}{\\,b^{2}+bc\\,}+\\frac{c^{2}+ba}{\\,c^{2}+ca\\,}+\\frac{a^{2}+cb}{\\,a^{2}+ab\\,}\\ge 3.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem, as a real-valued\nfunction of the three positive variables. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (b ^ 2 + a * c) / (b ^ 2 + b * c) +\n (c ^ 2 + b * a) / (c ^ 2 + c * a) +\n (a ^ 2 + c * b) / (a ^ 2 + a * b)\n\n/-- The statement to be proved: for every triple of positive real numbers\n`a`, `b`, and `c`, the displayed left-hand side is at least `3`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → 3 ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "224db9ea-c68f-5363-b5ec-99cabe5717f0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1abb779377c790760250ecd41546af36f10fb75fd5f51bba2850a0a22de9e29f", "task_path": "tasks/nmp3_224db9ea-c68f-5363-b5ec-99cabe5717f0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "224db9ea-c68f-5363-b5ec-99cabe5717f0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_225fd9be-7e2c-55ae-a3ba-3a3420231d52", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that $a+b+c=1$. Prove that \n-- \\[\n-- \\frac{a-b^{2}-c^{3}}{(b+c)(c+a)}+\\frac{b-c^{2}-a^{3}}{(c+a)(a+b)}+\\frac{c-a^{2}-b^{3}}{(a+b)(b+c)}\\le\\frac54\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the target inequality, for real numbers `a`, `b`, and `c`. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a - b ^ 2 - c ^ 3) / ((b + c) * (c + a)) +\n (b - c ^ 2 - a ^ 3) / ((c + a) * (a + b)) +\n (c - a ^ 2 - b ^ 3) / ((a + b) * (b + c))\n\n/-- The asserted upper bound for `Problem.lhs a b c`. -/\ndef inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ (5 : ℝ) / 4\n\n/-- The full statement: for all positive real `a`, `b`, `c` with sum `1`, the displayed\nleft-hand side is at most `5 / 4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → a + b + c = 1 → inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "225fd9be-7e2c-55ae-a3ba-3a3420231d52", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "aa51fda9d57b8b384c901c48bcd5cf20af5442295110d1c76b3c9c2c8277455c", "task_path": "tasks/nmp3_225fd9be-7e2c-55ae-a3ba-3a3420231d52", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "225fd9be-7e2c-55ae-a3ba-3a3420231d52", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_226fb337-93c6-5353-9f2f-e3c7b5d4ceef", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$. Prove that \n-- \\[\n-- (a^{2}+2)(b^{2}+2)(c^{2}+2)\\ge 3\\,(a+b+c)^{2}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nFor all nonnegative real numbers `a`, `b`, and `c`,\n`(a ^ 2 + 2) * (b ^ 2 + 2) * (c ^ 2 + 2) ≥ 3 * (a + b + c) ^ 2`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 ≤ a → 0 ≤ b → 0 ≤ c →\n (a ^ 2 + 2) * (b ^ 2 + 2) * (c ^ 2 + 2) ≥ 3 * (a + b + c) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "226fb337-93c6-5353-9f2f-e3c7b5d4ceef", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "00b43b38e414c3b5deb57548ec95324e5dd646f2235533d5a706a98ef9b74f20", "task_path": "tasks/nmp3_226fb337-93c6-5353-9f2f-e3c7b5d4ceef", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "226fb337-93c6-5353-9f2f-e3c7b5d4ceef", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_22a889cc-7394-5d17-83f3-002eeecd6992", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle with an obtuse angle at $A$. Let $E$ and $F$ be the intersections of the external bisector of $\\angle A$ with the altitudes of $ABC$ through $B$ and $C$, respectively. Let $M$ be a point on the segment $EC$ such that $\\angle EMA=\\angle BCA$, and let $N$ be a point on the segment $FB$ such that $\\angle ANF=\\angle ABC$. Prove that the four points $E,\\;F,\\;M,\\;N$ lie on a common circle.\n/-\nFormalization of the geometry problem:\n\nLet ABC be a triangle with an obtuse angle at A. Let E and F be the\nintersections of the external bisector of angle A with the altitudes through B\nand C, respectively. Let M lie on segment EC with angle EMA equal to angle\nBCA, and let N lie on segment FB with angle ANF equal to angle ABC. Prove that\nE, F, M and N lie on a common circle.\n\nThis file contains the definitions needed to state the problem and the target\nproposition. No proof of the target is supplied.\n-/\n\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.Convex.Between\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\nnoncomputable section\n\nopen scoped EuclideanGeometry RealInnerProductSpace\nopen EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The three points `A`, `B`, `C` are non-collinear, i.e. they form a genuine\ntriangle. -/\ndef IsTriangle (A B C : Point) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Point)\n\n/-- The angle at `A` in the triangle `ABC` is obtuse. -/\ndef HasObtuseAngleAtA (A B C : Point) : Prop :=\n Real.pi / 2 < EuclideanGeometry.angle B A C\n\n/-- `ABC` is a genuine triangle and its angle at `A` is obtuse. -/\ndef TriangleWithObtuseAngleAtA (A B C : Point) : Prop :=\n IsTriangle A B C ∧ HasObtuseAngleAtA A B C\n\n/-- A line through `A` that is perpendicular to the internal angle bisector of\n`∠BAC`.\n\nEquivalently, its direction is\n`(B - A) / ‖B - A‖ - (C - A) / ‖C - A‖`. We represent the full external\nbisector line as the set of points `X` for which `X - A` has zero inner product\nwith the internal-bisector direction\n`(B - A) / ‖B - A‖ + (C - A) / ‖C - A‖`. The definition is intended for\nnondegenerate angles, where the two norms are nonzero; this is supplied by\n`IsTriangle` in the target. -/\ndef ExternalAngleBisectorLine (A B C : Point) : Set Point :=\n {X : Point |\n ⟪X -ᵥ A,\n ((‖B -ᵥ A‖ : ℝ)⁻¹) • (B -ᵥ A) +\n ((‖C -ᵥ A‖ : ℝ)⁻¹) • (C -ᵥ A)⟫ = 0}\n\n/-- The altitude line through `B`, i.e. the line through `B` perpendicular to\nthe side `AC`. -/\ndef AltitudeThroughBLine (A B C : Point) : Set Point :=\n {X : Point | ⟪X -ᵥ B, C -ᵥ A⟫ = 0}\n\n/-- The altitude line through `C`, i.e. the line through `C` perpendicular to\nthe side `AB`. -/\ndef AltitudeThroughCLine (A B C : Point) : Set Point :=\n {X : Point | ⟪X -ᵥ C, B -ᵥ A⟫ = 0}\n\n/-- `X` is the unique intersection point of two lines (represented as sets of\npoints). -/\ndef IsUniqueIntersection (L₁ L₂ : Set Point) (X : Point) : Prop :=\n X ∈ L₁ ∧ X ∈ L₂ ∧ ∀ Y : Point, Y ∈ L₁ → Y ∈ L₂ → Y = X\n\n/-- `M` lies on segment `EC` and satisfies `∠EMA = ∠BCA`. -/\ndef IsPointM (A B C E M : Point) : Prop :=\n Wbtw ℝ E M C ∧ EuclideanGeometry.angle E M A = EuclideanGeometry.angle B C A\n\n/-- `N` lies on segment `FB` and satisfies `∠ANF = ∠ABC`. -/\ndef IsPointN (A B C F N : Point) : Prop :=\n Wbtw ℝ F N B ∧ EuclideanGeometry.angle A N F = EuclideanGeometry.angle A B C\n\n/-- The points `E`, `F`, `M`, and `N` lie on a common (nondegenerate) circle.\nBecause the ambient space is the Euclidean plane, this is equivalent to being\ncospherical and coplanar. The explicit positive-radius formulation avoids\ntreating a radius-zero degenerate sphere as a circle. -/\ndef FourPointsConcyclic (E F M N : Point) : Prop :=\n ∃ center : Point, ∃ radius : ℝ,\n 0 < radius ∧\n dist center E = radius ∧\n dist center F = radius ∧\n dist center M = radius ∧\n dist center N = radius\n\n/-- The full formal target of the problem.\n\nFor every genuine triangle `ABC` with an obtuse angle at `A`, every unique\nintersection `E` of the external angle bisector at `A` with the altitude through\n`B`, every unique intersection `F` of that same bisector with the altitude\nthrough `C`, every point `M` on segment `EC` with `∠EMA = ∠BCA`, and every\npoint `N` on segment `FB` with `∠ANF = ∠ABC`, the four points `E`, `F`, `M`, and\n`N` are concyclic. -/\ndef Target : Prop :=\n ∀ A B C E F M N : Point,\n TriangleWithObtuseAngleAtA A B C →\n IsUniqueIntersection\n (ExternalAngleBisectorLine A B C)\n (AltitudeThroughBLine A B C) E →\n IsUniqueIntersection\n (ExternalAngleBisectorLine A B C)\n (AltitudeThroughCLine A B C) F →\n IsPointM A B C E M →\n IsPointN A B C F N →\n FourPointsConcyclic E F M N\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "22a889cc-7394-5d17-83f3-002eeecd6992", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d45ef762d65bfc41488a8b1e504b3e176394d40af1dc19297cab29b50a09441c", "task_path": "tasks/nmp3_22a889cc-7394-5d17-83f3-002eeecd6992", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "22a889cc-7394-5d17-83f3-002eeecd6992", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_22e2fbee-4e3a-5dc8-8235-81a40a3ec400", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. Prove that \n-- \\[\n-- \\frac{20\\cdot5^{\\,n}-2}{3^{\\,n}+47}\n-- \\] \n-- is not an integer.\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe problem asks us to prove that, for every positive integer `n`, the number\n`(20 * 5^n - 2) / (3^n + 47)` is not an integer.\n\nThe displayed quotient is represented using exact division in `ℚ`. An integer\nvalue of that quotient is represented as equality (in `ℚ`) with the cast of an\ninteger.\n-/\n\nnamespace Problem\n\n/-- The numerator `20 * 5^n - 2`, as an integer. -/\ndef numerator (n : ℕ) : ℤ :=\n (20 : ℤ) * (5 : ℤ) ^ n - 2\n\n/-- The denominator `3^n + 47`, as an integer. -/\ndef denominator (n : ℕ) : ℤ :=\n (3 : ℤ) ^ n + 47\n\n/-- The displayed expression, evaluated by exact division in `ℚ`. -/\ndef value (n : ℕ) : ℚ :=\n (numerator n : ℚ) / (denominator n : ℚ)\n\n/-- The displayed value is an integer if it equals the cast of some integer. -/\ndef IsIntegerValue (n : ℕ) : Prop :=\n ∃ z : ℤ, value n = (z : ℚ)\n\n/--\nFor every positive integer `n`, `(20 * 5^n - 2) / (3^n + 47)` is not an\ninteger.\n-/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ¬ IsIntegerValue n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "22e2fbee-4e3a-5dc8-8235-81a40a3ec400", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1cfe8d5c027659070f526be1a751e1f04aba95f29cb1c9693c9fdd5c4a1037f5", "task_path": "tasks/nmp3_22e2fbee-4e3a-5dc8-8235-81a40a3ec400", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "22e2fbee-4e3a-5dc8-8235-81a40a3ec400", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_22eaff4d-4fb9-5098-9357-e6a8d935ba2d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{3(a^{2}+b^{2}+c^{2})}{ab+bc+ca}+\\frac{ab^{3}+bc^{3}+ca^{3}}{a^{3}b+b^{3}c+c^{3}a}\\ge 4.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks one to prove that, for every triple of positive real\nnumbers `a`, `b`, and `c`, the sum of the two displayed fractions is at least\n`4`. The definitions below record that proposition without providing a proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition from the phrase `a, b, c > 0`: all three\nvariables are positive real numbers. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The first fraction in the displayed inequality:\n`3 (a^2 + b^2 + c^2) / (ab + bc + ca)`. -/\nnoncomputable def firstTerm (a b c : ℝ) : ℝ :=\n (3 * (a ^ 2 + b ^ 2 + c ^ 2)) / (a * b + b * c + c * a)\n\n/-- The second fraction in the displayed inequality:\n`(ab^3 + bc^3 + ca^3) / (a^3 b + b^3 c + c^3 a)`. -/\nnoncomputable def secondTerm (a b c : ℝ) : ℝ :=\n (a * b ^ 3 + b * c ^ 3 + c * a ^ 3) /\n (a ^ 3 * b + b ^ 3 * c + c ^ 3 * a)\n\n/-- The complete left-hand side of the displayed inequality, namely the sum of\nthe two fractions. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n firstTerm a b c + secondTerm a b c\n\n/-- The non-strict inequality requested by the problem, for a fixed triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n 4 ≤ lhs a b c\n\n/-- The universally quantified assertion of the problem: for all positive real\nnumbers `a`, `b`, and `c`, the displayed left-hand side is at least `4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "22eaff4d-4fb9-5098-9357-e6a8d935ba2d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2f2e243754c4aabce30dd50eb52762f8c8bc224b7b158412060dd9570e9b9255", "task_path": "tasks/nmp3_22eaff4d-4fb9-5098-9357-e6a8d935ba2d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "22eaff4d-4fb9-5098-9357-e6a8d935ba2d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_232d1d9d-3bf3-5c14-9687-ac2420142d5d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(a_n)$ be a sequence defined by \n-- \\[\n-- a_{n+2}=\\frac{2}{a_n+a_{n+1}}\\qquad\\text{for all }n\\ge1,\n-- \\] \n-- with initial terms $a_1,a_2>0$. Prove that \\(\\displaystyle\\lim_{n\\to\\infty}a_n=1\\) for every choice of $a_1$ and $a_2$.\nimport Mathlib\n\n/-!\n# Formal statement for the recurrence sequence problem\n\nThe source problem uses one-based indices. We represent the sequence as a\nfunction `a : ℕ → ℝ`; the first two relevant terms are `a 1` and `a 2`, and\nthe value at the unused index `0` is irrelevant.\n-/\n\nnamespace Problem\n\n/-- The recurrence `a (n + 2) = 2 / (a n + a (n + 1))` for every `n ≥ 1`. -/\ndef SatisfiesRecurrence (a : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, 1 ≤ n → a (n + 2) = 2 / (a n + a (n + 1))\n\n/-- The prescribed initial terms are `a 1 = a₁` and `a 2 = a₂`. -/\ndef HasInitialTerms (a : ℕ → ℝ) (a₁ a₂ : ℝ) : Prop :=\n a 1 = a₁ ∧ a 2 = a₂\n\n/--\nFor every choice of positive initial terms, every real sequence satisfying\nthe given initial conditions and recurrence tends to `1`.\n-/\ndef Target : Prop :=\n ∀ (a₁ a₂ : ℝ), 0 < a₁ → 0 < a₂ →\n ∀ a : ℕ → ℝ,\n HasInitialTerms a a₁ a₂ →\n SatisfiesRecurrence a →\n Filter.Tendsto a Filter.atTop (nhds (1 : ℝ))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "232d1d9d-3bf3-5c14-9687-ac2420142d5d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d9638d9fcc58b3aba14beb1e09ac72507cca2bf9a1400e206c07834079be8fa7", "task_path": "tasks/nmp3_232d1d9d-3bf3-5c14-9687-ac2420142d5d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "232d1d9d-3bf3-5c14-9687-ac2420142d5d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2387a7d3-4a40-5c33-bbf0-fa3d9130f6c6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a+b^2+c^3}{ab+c^2}+\\frac{b+c^2+a^3}{bc+a^2}+\\frac{c+a^2+b^3}{ca+b^2}\\ge\\frac92\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the inequality in `problem.md`\n\nThe source asks to prove, for positive real numbers `a`, `b`, and `c`, that\n\n`(a + b^2 + c^3) / (a*b + c^2)\n + (b + c^2 + a^3) / (b*c + a^2)\n + (c + a^2 + b^3) / (c*a + b^2) ≥ 9/2`.\n\nThe assertion is represented as a `Prop`-valued definition, not as a theorem\nwith a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality for real `a`, `b`, and `c`. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a + b ^ 2 + c ^ 3) / (a * b + c ^ 2) +\n (b + c ^ 2 + a ^ 3) / (b * c + a ^ 2) +\n (c + a ^ 2 + b ^ 3) / (c * a + b ^ 2)\n\n/--\nFor all positive reals `a`, `b`, and `c`, the left-hand side is at least `9/2`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n lhs a b c ≥ (9 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2387a7d3-4a40-5c33-bbf0-fa3d9130f6c6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7b2e796f38b1e1d913f4a34b36be11a7144e26df881da3ada5d417b37dd1c378", "task_path": "tasks/nmp3_2387a7d3-4a40-5c33-bbf0-fa3d9130f6c6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2387a7d3-4a40-5c33-bbf0-fa3d9130f6c6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_23b78c38-14f7-5b95-a8c2-025e32b4512a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- $$a^2(a-b)+b^2(b-c)+c^2(c-a)+3abc\\ge 3.$$\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality\n\nThe original problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose sum is `3`, the inequality\n\n`a^2 * (a - b) + b^2 * (b - c) + c^2 * (c - a) + 3 * a * b * c >= 3`.\n\nThe declaration below records the exact proposition to be proved. It is a\n`Prop`-valued definition, not a proof.\n-/\n\nnamespace Problem\n\n/-- The inequality statement from the problem, including all hypotheses and\nquantifier dependencies. The variables are real numbers and the hypotheses\nare `a > 0`, `b > 0`, `c > 0`, and `a + b + c = 3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = (3 : ℝ) →\n a ^ 2 * (a - b) + b ^ 2 * (b - c) + c ^ 2 * (c - a) +\n 3 * a * b * c ≥ (3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "23b78c38-14f7-5b95-a8c2-025e32b4512a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "71902deca70b6059793429ea3cae9cb3ae9b46d40ccbd85395392ca61823e965", "task_path": "tasks/nmp3_23b78c38-14f7-5b95-a8c2-025e32b4512a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "23b78c38-14f7-5b95-a8c2-025e32b4512a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_23cd76ac-80c8-5edd-95bf-372d44514f44", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Denote by 𝓗 a set of sequences $S=\\{s_n\\}_{n=1}^{\\infty}$ of real numbers satisfying \n-- \n-- (i) If $S\\in\\mathcal H$ then the tail $S'=\\{s_n\\}_{n=2}^{\\infty}$ also belongs to $\\mathcal H$; \n-- \n-- (ii) If $S,T\\in\\mathcal H$ then $S+T=\\{s_n+t_n\\}_{n=1}^{\\infty}$ and $ST=\\{s_nt_n\\}_{n=1}^{\\infty}$ are in $\\mathcal H$; \n-- \n-- (iii) The constant sequence $(-1,-1,\\dots)$ is in $\\mathcal H$. \n-- \n-- A real‑valued function $f$ defined on $\\mathcal H$ is called a **quasi‑limit** if it satisfies \n-- \n-- * If $S=\\{c,c,\\dots\\}$ (constant) then $f(S)=c$; \n-- * If $s_i\\ge0$ for all $i$ then $f(S)\\ge0$; \n-- * $f(S+T)=f(S)+f(T)$ for all $S,T\\in\\mathcal H$; \n-- * $f(ST)=f(S)f(T)$ for all $S,T\\in\\mathcal H$; \n-- * $f(S')=f(S)$ for all $S\\in\\mathcal H$. \n-- \n-- **Prove that for every $S\\in\\mathcal H$, the quasi‑limit $f(S)$ is an accumulation point of the sequence $S$** (i.e., for every $\\varepsilon>0$ there are infinitely many indices $n$ with $|s_n-f(S)|<\\varepsilon$).\nimport Mathlib\n\n/-!\n# Formalization of the quasi-limit accumulation-point problem\n\nThe original problem indexes sequences by `n = 1, 2, ...`. We represent the\nindex set by `ℕ+`, the type of positive natural numbers. A sequence is a\nfunction `S : ℕ+ → ℝ`, and its tail is obtained by sending `n` to `S (n + 1)`.\n\n`Problem.Target` is the asserted universal statement, not a proof of it.\n-/\n\nnamespace Problem\n\n/-- Sequences indexed by the positive natural numbers, corresponding to\n`s = (s_1, s_2, ...)`. -/\nabbrev RealSequence : Type := ℕ+ → ℝ\n\n/-- The tail `S'` of a sequence `S`, with `S' n = S (n + 1)`; in one-based\nnotation this is the tail beginning at `s_2`. -/\ndef tail (S : RealSequence) : RealSequence :=\n fun n : ℕ+ => S (n + 1)\n\n/-- The constant sequence with every term equal to `c`. -/\ndef constSeq (c : ℝ) : RealSequence :=\n fun _ : ℕ+ => c\n\n/-- Pointwise addition of sequences. -/\ndef seqAdd (S T : RealSequence) : RealSequence :=\n fun n : ℕ+ => S n + T n\n\n/-- Pointwise multiplication of sequences. -/\ndef seqMul (S T : RealSequence) : RealSequence :=\n fun n : ℕ+ => S n * T n\n\n/-- Condition (i): the family `H` is closed under taking tails. -/\ndef IsTailClosed (H : Set RealSequence) : Prop :=\n ∀ S : RealSequence, S ∈ H → tail S ∈ H\n\n/-- The addition half of condition (ii). -/\ndef IsAddClosed (H : Set RealSequence) : Prop :=\n ∀ S : RealSequence, S ∈ H →\n ∀ T : RealSequence, T ∈ H → seqAdd S T ∈ H\n\n/-- The multiplication half of condition (ii). -/\ndef IsMulClosed (H : Set RealSequence) : Prop :=\n ∀ S : RealSequence, S ∈ H →\n ∀ T : RealSequence, T ∈ H → seqMul S T ∈ H\n\n/-- Condition (ii): `H` is closed under both pointwise addition and\npointwise multiplication of sequences. -/\ndef IsAddMulClosed (H : Set RealSequence) : Prop :=\n IsAddClosed H ∧ IsMulClosed H\n\n/-- The three conditions (i), (ii), and (iii) imposed on `H` in the problem. -/\nstructure AdmissibleFamily (H : Set RealSequence) : Prop where\n tail_closed : IsTailClosed H\n add_mul_closed : IsAddMulClosed H\n neg_one_constant_mem : constSeq (-1 : ℝ) ∈ H\n\n/-- First quasi-limit axiom: every constant sequence that belongs to `H` is\nevaluated to its constant value. The membership hypothesis is needed because\n`f` is defined only on the subtype `H`. -/\ndef PreservesConstants (H : Set RealSequence)\n (f : {S : RealSequence // S ∈ H} → ℝ) : Prop :=\n ∀ (c : ℝ) (hc : constSeq c ∈ H), f ⟨constSeq c, hc⟩ = c\n\n/-- Second quasi-limit axiom: `f` preserves nonnegativity of sequences. -/\ndef PreservesNonnegativity (H : Set RealSequence)\n (f : {S : RealSequence // S ∈ H} → ℝ) : Prop :=\n ∀ (S : RealSequence) (hS : S ∈ H),\n (∀ n : ℕ+, 0 ≤ S n) → 0 ≤ f ⟨S, hS⟩\n\n/-- Third quasi-limit axiom: `f` is additive on pointwise sums of members of\n`H`. -/\ndef IsAdditive (H : Set RealSequence) (hAdd : IsAddClosed H)\n (f : {S : RealSequence // S ∈ H} → ℝ) : Prop :=\n ∀ (S : RealSequence) (hS : S ∈ H)\n (T : RealSequence) (hT : T ∈ H),\n f ⟨seqAdd S T, hAdd S hS T hT⟩ = f ⟨S, hS⟩ + f ⟨T, hT⟩\n\n/-- Fourth quasi-limit axiom: `f` is multiplicative on pointwise products of\nmembers of `H`. -/\ndef IsMultiplicative (H : Set RealSequence) (hMul : IsMulClosed H)\n (f : {S : RealSequence // S ∈ H} → ℝ) : Prop :=\n ∀ (S : RealSequence) (hS : S ∈ H)\n (T : RealSequence) (hT : T ∈ H),\n f ⟨seqMul S T, hMul S hS T hT⟩ = f ⟨S, hS⟩ * f ⟨T, hT⟩\n\n/-- Fifth quasi-limit axiom: `f` is invariant under taking tails of members of\n`H`. -/\ndef IsTailInvariant (H : Set RealSequence) (hTail : IsTailClosed H)\n (f : {S : RealSequence // S ∈ H} → ℝ) : Prop :=\n ∀ (S : RealSequence) (hS : S ∈ H),\n f ⟨tail S, hTail S hS⟩ = f ⟨S, hS⟩\n\n/-- A quasi-limit on `H`: a real-valued function on the subtype of sequences\nbelonging to `H`, satisfying all five displayed quasi-limit axioms. The\naddition, multiplication, and tail clauses receive the corresponding closure\nwitnesses from the admissibility structure `hH`. -/\ndef IsQuasiLimit (H : Set RealSequence) (hH : AdmissibleFamily H)\n (f : {S : RealSequence // S ∈ H} → ℝ) : Prop :=\n PreservesConstants H f ∧\n PreservesNonnegativity H f ∧\n IsAdditive H hH.add_mul_closed.1 f ∧\n IsMultiplicative H hH.add_mul_closed.2 f ∧\n IsTailInvariant H hH.tail_closed f\n\n/-- The parenthetical definition: `a` is an accumulation point of `S` if for\nevery positive real `ε`, there are infinitely many positive indices `n` for\nwhich `|S n - a| < ε`. -/\ndef IsAccumulationPoint (S : RealSequence) (a : ℝ) : Prop :=\n ∀ ε : ℝ, 0 < ε → {n : ℕ+ | |S n - a| < ε}.Infinite\n\n/-- The full assertion to be proved: for every admissible family `H`, every\nquasi-limit `f` on `H`, and every `S ∈ H`, the value `f S` is an accumulation\npoint of `S`. -/\ndef Target : Prop :=\n ∀ (H : Set RealSequence) (hH : AdmissibleFamily H)\n (f : {S : RealSequence // S ∈ H} → ℝ),\n IsQuasiLimit H hH f →\n ∀ S : {S : RealSequence // S ∈ H},\n IsAccumulationPoint S.1 (f S)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "23cd76ac-80c8-5edd-95bf-372d44514f44", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c405e7b735e6db4bd44b9b6e67d6ff4c059adb8112373e70fb353ceea5d713e4", "task_path": "tasks/nmp3_23cd76ac-80c8-5edd-95bf-372d44514f44", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "23cd76ac-80c8-5edd-95bf-372d44514f44", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_23dbf689-4304-5c4a-913a-2155936ecb09", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exists a natural number $n$ such that the decimal representation of $n!$ begins with the digits $2001$; i.e., there is an integer $k\\ge0$ with $2001\\cdot10^{k}\\le n!<2002\\cdot10^{k}$.\nimport Mathlib.Data.Nat.Factorial.Basic\n\n/-!\n# Formalization of the factorial-leading-digits problem\n\nThe source problem asks for a natural number `n` whose factorial has leading\ndecimal digits `2001`, and explicitly gives the equivalent inequality\n\n`2001 * 10^k ≤ n! < 2002 * 10^k`\n\nfor some integer `k ≥ 0`. Lean's `ℕ` is the canonical type of nonnegative\nintegers, so the exponent `k` is represented by a natural number.\n-/\n\nnamespace Problem\n\n/-- The factorial of `n` begins with the decimal digits `2001`.\n\nThe witness `k` is the number of trailing decimal digits after the prefix, so\nthat `2001 * 10^k ≤ n! < 2002 * 10^k`. -/\ndef HasLeadingDigits2001 (n : ℕ) : Prop :=\n ∃ k : ℕ,\n (2001 : ℕ) * (10 : ℕ) ^ k ≤ Nat.factorial n ∧\n Nat.factorial n < (2002 : ℕ) * (10 : ℕ) ^ k\n\n/-- There exists a natural number `n` such that `n!` begins with `2001`. -/\ndef Target : Prop :=\n ∃ n : ℕ, HasLeadingDigits2001 n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "23dbf689-4304-5c4a-913a-2155936ecb09", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "249b6aa115312dd7080ce4787282813c9d3ff12b5eee28ba25998807e7668da6", "task_path": "tasks/nmp3_23dbf689-4304-5c4a-913a-2155936ecb09", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "23dbf689-4304-5c4a-913a-2155936ecb09", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_240671fb-2f2a-51d1-86bb-bb2537af6377", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $x,y,z$ are non‑negative real numbers such that $x+y+z=3$, prove that \n-- \\[\n-- 4\\bigl(x^{2}y+y^{2}z+z^{2}x\\bigr)\\;+\\;xyz\\bigl(x^{2}+y^{2}+z^{2}+1\\bigr)\\;\\le\\;16.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef LHS (x y z : ℝ) : ℝ :=\n 4 * (x ^ 2 * y + y ^ 2 * z + z ^ 2 * x) +\n x * y * z * (x ^ 2 + y ^ 2 + z ^ 2 + 1)\n\n/-- The admissibility conditions on the real variables: each is non-negative and\ntheir sum is three. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z ∧ x + y + z = 3\n\n/-- The complete assertion to be proved: for all non-negative real numbers whose\nsum is three, the given expression is at most sixteen. -/\ndef Target : Prop :=\n ∀ (x y z : ℝ), Admissible x y z → LHS x y z ≤ 16\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "240671fb-2f2a-51d1-86bb-bb2537af6377", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9f3a36b2f56de85e1a15833fc894b4e6192d70c5b7ff1b0cd62648bd73d2dcf8", "task_path": "tasks/nmp3_240671fb-2f2a-51d1-86bb-bb2537af6377", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "240671fb-2f2a-51d1-86bb-bb2537af6377", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_240deb22-a3f3-5307-b03b-2ef2d62916a7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that if the integers $a_{1},a_{2},\\dots ,a_{n}$ are all distinct, then the polynomial \n-- \\[\n-- P(x)=\\prod_{i=1}^{n}(x-a_{i})^{2}+1\n-- \\]\n-- cannot be expressed as the product of two non‑constant polynomials with integer coefficients (i.e., $P$ is irreducible in $\\mathbb Z[x]$).\nimport Mathlib\n\n/-!\n# Formal statement: irreducibility of a squared-root polynomial over `ℤ[x]`\n\nThe source problem asserts that, for pairwise distinct integers\n`a₁, ..., aₙ`, the polynomial\n`P(x) = ∏ᵢ (x - aᵢ)^2 + 1` has no factorization as a product of two\nnonconstant polynomials in `ℤ[x]`.\n-/\n\nnamespace Problem\n\n/-- The polynomial\n`P(x) = ∏ᵢ (x - aᵢ)^2 + 1`, as an element of `ℤ[x]`.\n\nThe index type `Fin n` represents the indices `1, ..., n` (up to the usual\nzero-based relabeling used by `Fin`). -/\nnoncomputable def P (n : ℕ) (a : Fin n → ℤ) : Polynomial ℤ :=\n (∏ i : Fin n, (Polynomial.X - Polynomial.C (a i)) ^ 2) +\n (1 : Polynomial ℤ)\n\n/-- The entries of the indexed family `a : Fin n → ℤ` are pairwise distinct. -/\ndef AllDistinct (n : ℕ) (a : Fin n → ℤ) : Prop :=\n Function.Injective a\n\n/-- An integer polynomial is nonconstant when its natural degree is positive. -/\ndef Nonconstant (p : Polynomial ℤ) : Prop :=\n 0 < Polynomial.natDegree p\n\n/-- `p` is the product of two nonconstant integer polynomials. -/\ndef IsProductOfTwoNonconstantIntegerPolynomials (p : Polynomial ℤ) : Prop :=\n ∃ (q r : Polynomial ℤ),\n Nonconstant q ∧ Nonconstant r ∧ p = q * r\n\n/-- The assertion of the source problem: for every indexed family of pairwise\ndistinct integers, the polynomial `P` cannot be written as a product of two\nnonconstant polynomials in `ℤ[x]`.\n\nFollowing the indexed-list notation in the source, `Fin n` encodes the indices\n`1, ..., n`; the empty-index case `n = 0` is included as the harmless degenerate\ncase (then `P = 2`, which also has no nonconstant factorization). -/\nnoncomputable def Target : Prop :=\n ∀ (n : ℕ) (a : Fin n → ℤ),\n AllDistinct n a → ¬ IsProductOfTwoNonconstantIntegerPolynomials (P n a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "240deb22-a3f3-5307-b03b-2ef2d62916a7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a14975eb2e9131bd1feee85dfdf209d008fbc775976b84ab28bc6790b11b16de", "task_path": "tasks/nmp3_240deb22-a3f3-5307-b03b-2ef2d62916a7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "240deb22-a3f3-5307-b03b-2ef2d62916a7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2441b34f-fd38-5d51-aff5-54bf39d36ead", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $N$ be a positive integer. Grobber secretly chooses an integer $M$ with $1\\le M primeAnswer M n\n\n/-- The Boolean oracle answer is true exactly when the queried integer is prime. -/\ntheorem primeAnswer_eq_true_iff (M : ℤ) (n : ℕ) :\n primeAnswer M n = true ↔ IsPrimeInteger (M + (n : ℤ)) := by\n simp [primeAnswer]\n\n/--\nA finite adaptive strategy. At a node with `fuel + 1` questions remaining,\nHarazi asks the natural-number query `n` and then follows one of the two\nsubtrees according to Grobber's Boolean answer. The `guess` constructor may be\nused at any remaining fuel, so strategies may stop early.\n-/\ninductive DecisionTree : ℕ → Type where\n | guess {fuel : ℕ} (value : ℤ) : DecisionTree fuel\n | ask {fuel : ℕ} (n : ℕ) (next : Bool → DecisionTree fuel) :\n DecisionTree (fuel + 1)\n\nnamespace DecisionTree\n\n/-- The maximum number of questions asked along any branch of a tree. -/\ndef maxQuestions : {fuel : ℕ} → DecisionTree fuel → ℕ\n | _, guess _ => 0\n | _, ask _ next =>\n 1 + max (maxQuestions (next true)) (maxQuestions (next false))\n\n/-- A tree whose type index is `fuel` asks at most `fuel` questions. -/\ntheorem maxQuestions_le_fuel : {fuel : ℕ} → (tree : DecisionTree fuel) →\n tree.maxQuestions ≤ fuel := by\n intro fuel tree\n induction tree with\n | guess value =>\n simp [maxQuestions]\n | @ask fuel n next ih =>\n simp only [maxQuestions]\n have h1 : maxQuestions (next true) ≤ fuel := ih true\n have h2 : maxQuestions (next false) ≤ fuel := ih false\n have h3 : max (maxQuestions (next true)) (maxQuestions (next false)) ≤ fuel :=\n max_le h1 h2\n omega\n\n/-- Run a strategy on a truthful answer oracle and return its final guess. -/\ndef run {fuel : ℕ} (tree : DecisionTree fuel) (oracle : ℕ → Bool) : ℤ :=\n match tree with\n | guess value => value\n | ask n next => run (next (oracle n)) oracle\n\nend DecisionTree\n\n/-- `tree` identifies every secret value allowed by `N`, using the truth oracle. -/\ndef Determines (N : ℕ) (tree : DecisionTree N) : Prop :=\n ∀ M : ℤ, HiddenValue N M →\n DecisionTree.run tree (truthOracle M) = M\n\n/--\nThe original assertion: for every positive `N`, Harazi has an adaptive strategy\nthat asks at most `N` prime-membership questions and always determines the value\nof every permitted secret `M`.\n-/\ndef Target : Prop :=\n ∀ N : ℕ, 0 < N →\n ∃ tree : DecisionTree N, Determines N tree\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2441b34f-fd38-5d51-aff5-54bf39d36ead", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0b5486b899f8ef6845289b84f552d5f7e4c6bb3d5e29d0c259842c44b8019b61", "task_path": "tasks/nmp3_2441b34f-fd38-5d51-aff5-54bf39d36ead", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2441b34f-fd38-5d51-aff5-54bf39d36ead", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_24b1bb87-9af1-5b2c-993d-4080accf687e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb{R}\\to\\mathbb{R}$ satisfy \n-- $$f(x+y+2xy)=f(x)+f(y)+2f(xy)$$ \n-- for all real numbers $x,y$. Prove that for every real $x$,\n-- $$f(2000x)=2000\\,f(x).$$\nimport Mathlib\n\n/-!\n# Formal statement for a real functional-equation problem\n\nThe original problem fixes an arbitrary function `f : ℝ → ℝ` satisfying a\nfunctional equation and asks to prove a scaling identity for every real\nnumber. The declarations below record the equation, the claimed scaling\nconclusion, and the full universally quantified target proposition. No\nproof of the target is supplied.\n-/\n\nnamespace Problem\n\n/-- The functional equation assumed in the problem:\n`f (x + y + 2xy) = f x + f y + 2 f (xy)` for all real `x` and `y`. -/\ndef FunctionalEquation (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ,\n f (x + y + (2 : ℝ) * (x * y)) =\n f x + f y + (2 : ℝ) * f (x * y)\n\n/-- The scaling conclusion of the problem, at a specified real point `x`. -/\ndef ScalingConclusion (f : ℝ → ℝ) (x : ℝ) : Prop :=\n f ((2000 : ℝ) * x) = (2000 : ℝ) * f x\n\n/-- The full statement: every function `f : ℝ → ℝ` satisfying the functional\nequation also satisfies `f (2000 x) = 2000 f x` for every real `f`-input `x`. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, FunctionalEquation f → ∀ x : ℝ, ScalingConclusion f x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "24b1bb87-9af1-5b2c-993d-4080accf687e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0f6eab413f6960713e2b425a8e0d31065aa503e31ad35692cdbb12b2dbe571df", "task_path": "tasks/nmp3_24b1bb87-9af1-5b2c-993d-4080accf687e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "24b1bb87-9af1-5b2c-993d-4080accf687e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_24c2035a-715c-5879-b60f-0228b784e25f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove \n-- \\[\n-- \\sum_{cyc}\\sqrt{\\frac{a^{3}}{a^{2}+ab+b^{2}}}\\ge\\frac{\\sqrt a+\\sqrt b+\\sqrt c}{\\sqrt3}\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- One cyclic summand `sqrt (x^3 / (x^2 + x*y + y^2))`. -/\nnoncomputable def cyclicTerm (x y : ℝ) : ℝ :=\n Real.sqrt (x ^ 3 / (x ^ 2 + x * y + y ^ 2))\n\n/-- The cyclic sum over `(a,b)`, `(b,c)`, and `(c,a)`. -/\nnoncomputable def cyclicSqrtSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b + cyclicTerm b c + cyclicTerm c a\n\n/-- The admissibility conditions on the variables: `a`, `b`, and `c` are positive reals. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The assertion stated in the problem:\nfor all positive reals `a`, `b`, `c`, the cyclic square-root sum is at least\n`(sqrt a + sqrt b + sqrt c) / sqrt 3`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c →\n cyclicSqrtSum a b c ≥\n (Real.sqrt a + Real.sqrt b + Real.sqrt c) / Real.sqrt 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "24c2035a-715c-5879-b60f-0228b784e25f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a5f0dcd6f47a3c10d3a586b7a7c1da0d4f391f8e0fdb839952e48daae8e7c50e", "task_path": "tasks/nmp3_24c2035a-715c-5879-b60f-0228b784e25f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "24c2035a-715c-5879-b60f-0228b784e25f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_24fd9293-7a67-5f45-85c5-3ffe0da63562", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that\n-- \\[\n-- \\frac{a^{3}}{c\\,(2a^{2}+b^{2}+c^{2})}+\\frac{b^{3}}{a\\,(2b^{2}+c^{2}+a^{2})}+\\frac{c^{3}}{b\\,(2c^{2}+a^{2}+b^{2})}\\ge\\frac34.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the proposed cyclic rational inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe stated lower bound for the cyclic sum.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The cyclic left-hand side in the source inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a ^ 3 / (c * (2 * a ^ 2 + b ^ 2 + c ^ 2))\n + b ^ 3 / (a * (2 * b ^ 2 + c ^ 2 + a ^ 2))\n + c ^ 3 / (b * (2 * c ^ 2 + a ^ 2 + b ^ 2))\n\n/-- The hypothesis that all three real variables are positive. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The complete assertion of the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → lhs a b c ≥ (3 / 4 : ℝ)\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "24fd9293-7a67-5f45-85c5-3ffe0da63562", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "985b541cf92be9a6441f05243a09af4cf657a86019cb045254e23ea7ef297aa1", "task_path": "tasks/nmp3_24fd9293-7a67-5f45-85c5-3ffe0da63562", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "24fd9293-7a67-5f45-85c5-3ffe0da63562", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_252291e6-05a5-5ab2-9d0c-8a0221757866", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,\\;b,\\;c,\\;d\\) be positive real numbers. Prove that \n-- \\[\n-- \\frac{a^{2}-bd}{\\,b+2c+d\\,}+\\frac{b^{2}-ca}{\\,c+2d+a\\,}+\\frac{c^{2}-db}{\\,d+2a+b\\,}+\\frac{d^{2}-ac}{\\,a+2b+c\\,}\\ge 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the four-variable rational inequality\n\nThe original problem asks to prove, for positive real numbers `a b c d`, that\n\n`(a^2 - b*d)/(b + 2*c + d) + (b^2 - c*a)/(c + 2*d + a)\n + (c^2 - d*b)/(d + 2*a + b) + (d^2 - a*c)/(a + 2*b + c) ≥ 0`.\n\nThis file records that assertion as a proposition. No proof is supplied.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the requested inequality. -/\ndef LHS (a b c d : ℝ) : ℝ :=\n (a ^ 2 - b * d) / (b + 2 * c + d) +\n (b ^ 2 - c * a) / (c + 2 * d + a) +\n (c ^ 2 - d * b) / (d + 2 * a + b) +\n (d ^ 2 - a * c) / (a + 2 * b + c)\n\n/-- For positive real `a, b, c, d`, the sum of the four given fractions is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d → LHS a b c d ≥ 0\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "252291e6-05a5-5ab2-9d0c-8a0221757866", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b2ae935655fd536fb329e9b713d88ec190f3985beacc3d9ec549ccc936445e8e", "task_path": "tasks/nmp3_252291e6-05a5-5ab2-9d0c-8a0221757866", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "252291e6-05a5-5ab2-9d0c-8a0221757866", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2553d830-0eee-533e-802f-7a58c56b0db3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers \\(a,b,c\\),\n-- \\[\n-- \\frac{(1+a^{2})(1+b^{2})(1+c^{2})}{(1+a)(1+b)(1+c)}\\ge \\frac12\\,(1+abc).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe inequality\n\n`((1 + a^2) * (1 + b^2) * (1 + c^2)) / ((1 + a) * (1 + b) * (1 + c))\n ≥ (1 / 2) * (1 + a * b * c)`.\n\nThis file records the unproved proposition as a definition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: every triple of positive real numbers satisfies\nthe stated rational inequality. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n ((1 + a ^ 2) * (1 + b ^ 2) * (1 + c ^ 2)) /\n ((1 + a) * (1 + b) * (1 + c)) ≥\n (1 / 2 : ℝ) * (1 + a * b * c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2553d830-0eee-533e-802f-7a58c56b0db3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cacf8270b572f87e05da65c053c636215f0a948cc004f065baf62c5c0d2f863a", "task_path": "tasks/nmp3_2553d830-0eee-533e-802f-7a58c56b0db3", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2553d830-0eee-533e-802f-7a58c56b0db3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_256d5c46-b5e1-5180-9487-3183d125db16", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every triangle $ABC$,\n-- \\[\n-- \\frac{3\\sqrt{3}}{2\\cos\\frac{A}{2}\\cos\\frac{B}{2}\\cos\\frac{C}{2}}+8\\sin\\frac{A}{2}\\sin\\frac{B}{2}\\sin\\frac{C}{2}\\ge5.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe original problem asks to prove an inequality involving the three\ninterior angles of a triangle. We represent a triangle by its angle\nmeasures in radians: three positive real numbers whose sum is `π`.\nEvery such triple occurs as the angle triple of a (nondegenerate) Euclidean\ntriangle, so this captures the intended domain exactly.\n-/\n\nnamespace Problem\n\n/-- The angle measures (in radians) of a nondegenerate Euclidean triangle:\nall three interior angles are positive and their sum is `Real.pi`. -/\ndef IsTriangleAngles (A B C : ℝ) : Prop :=\n 0 < A ∧ 0 < B ∧ 0 < C ∧ A + B + C = Real.pi\n\n/-- The expression on the left-hand side of the proposed inequality. -/\nnoncomputable def triangleExpression (A B C : ℝ) : ℝ :=\n (3 * Real.sqrt 3) /\n (2 * Real.cos (A / 2) * Real.cos (B / 2) * Real.cos (C / 2)) +\n 8 * Real.sin (A / 2) * Real.sin (B / 2) * Real.sin (C / 2)\n\n/-- For every triangle `ABC`, the stated expression is at least `5`. -/\nnoncomputable def Target : Prop :=\n ∀ (A B C : ℝ), IsTriangleAngles A B C → triangleExpression A B C ≥ 5\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "256d5c46-b5e1-5180-9487-3183d125db16", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4ba9b1501fa5369ec7ca185f327403fc5c033930f86ab15ac8308dda3754cae7", "task_path": "tasks/nmp3_256d5c46-b5e1-5180-9487-3183d125db16", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "256d5c46-b5e1-5180-9487-3183d125db16", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_258e482a-8722-51a3-89e9-bad07f161511", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge 0$ be real numbers satisfying \n-- \\[\n-- x^{2}+y^{2}+z^{2}=2(xy+yz+zx).\n-- \\] \n-- Prove that \n-- \\[\n-- \\sqrt{x+y}+\\sqrt{y+z}+\\sqrt{z+x}\\;\\ge\\;4\\sqrt{\\frac{x+y+z}{3}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\nFormal statement of the inequality problem.\n\nFor nonnegative real numbers `x`, `y`, and `z` satisfying\n`x ^ 2 + y ^ 2 + z ^ 2 = 2 * (x * y + y * z + z * x)`, prove that\n`sqrt (x + y) + sqrt (y + z) + sqrt (z + x)` is at least\n`4 * sqrt ((x + y + z) / 3)`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n Real.sqrt (x + y) + Real.sqrt (y + z) + Real.sqrt (z + x)\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def rhs (x y z : ℝ) : ℝ :=\n 4 * Real.sqrt ((x + y + z) / 3)\n\n/-- The complete assertion to be proved: for every triple of nonnegative real numbers\nsatisfying the given quadratic relation, the square-root sum is at least the stated\nright-hand side. -/\ndef Target : Prop :=\n ∀ (x y z : ℝ),\n 0 ≤ x → 0 ≤ y → 0 ≤ z →\n x ^ 2 + y ^ 2 + z ^ 2 = 2 * (x * y + y * z + z * x) →\n lhs x y z ≥ rhs x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "258e482a-8722-51a3-89e9-bad07f161511", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e7c32e4db35541ce13cd03f19b38c559a85db6a51c4221e58b689740ef10adcb", "task_path": "tasks/nmp3_258e482a-8722-51a3-89e9-bad07f161511", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "258e482a-8722-51a3-89e9-bad07f161511", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_259696c3-b43c-50e4-9784-25da07d10776", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P(x)\\in\\mathbb Z[x]$ be a polynomial satisfying $P(n)>n$ for every positive integer $n$. Define a sequence by $x_1=1$ and $x_{k+1}=P(x_k)$ for $k\\ge1$. Assume that for each positive integer $N$ there exists an index $m$ such that $N\\mid x_m$. Prove that $P(x)=x+1$ for all $x$.\nimport Mathlib\n\n/-!\n# Formal statement of the polynomial-orbit problem\n\nWe formalize the following problem:\n\nLet `P` be a polynomial with integer coefficients such that `P(n) > n` for\nevery positive integer `n`. Let `x` be the sequence defined by `x₁ = 1` and\n`x_{k+1} = P(x_k)` for `k ≥ 1`. Suppose that for every positive integer `N`\nthere is an index `m` such that `N ∣ x_m`. Prove that `P(X) = X + 1`.\n\nThe sequence is encoded in zero-based form: `orbit P k` is the original term\n`x_{k+1}`. This shift is only a change of indexing, and the divisibility\ncondition is correspondingly stated as `N ∣ orbit P k`.\n-/\n\nopen Polynomial\n\nnamespace Problem\n\n/-- The polynomial orbit encoded with zero-based indexing:\n`orbit P 0 = 1` and `orbit P (k+1) = P (orbit P k)`.\nThus `orbit P k` is the original term `x_{k+1}`. -/\ndef orbit (P : ℤ[X]) : ℕ → ℤ\n | 0 => 1\n | k + 1 => P.eval (orbit P k)\n\n/-- The assumed inequality: `P(n) > n` for every positive integer `n`. -/\ndef GrowthAssumption (P : ℤ[X]) : Prop :=\n ∀ n : ℕ, 0 < n → (n : ℤ) < P.eval (n : ℤ)\n\n/-- The assumed divisibility/hitting condition: every positive integer modulus\n`N` divides some term of the orbit. Since `orbit P k` is the original\n`x_{k+1}`, the original positive index `m` is represented by `k = m - 1`. -/\ndef HitsEveryPositiveModulus (P : ℤ[X]) : Prop :=\n ∀ N : ℕ, 0 < N → ∃ k : ℕ, (N : ℤ) ∣ orbit P k\n\n/-- The complete formal statement to be proved: for every integer polynomial\n`P`, if `P(n) > n` for all positive integers `n` and its orbit starting at\n`1` hits every positive modulus, then `P(X) = X + 1` as a polynomial over\n`ℤ`. The source's conclusion `P(x) = x + 1` for all `x` is formalized as\nthis polynomial identity; for polynomials over `ℤ` this is the standard\nmeaning and is equivalent to equality at every integer evaluation point. -/\ndef Target : Prop :=\n ∀ P : ℤ[X],\n GrowthAssumption P →\n HitsEveryPositiveModulus P →\n P = X + C (1 : ℤ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "259696c3-b43c-50e4-9784-25da07d10776", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "44ec123f5a93414a2bc63f532705f5fafa7de5341305bcaa6b545406d613c46d", "task_path": "tasks/nmp3_259696c3-b43c-50e4-9784-25da07d10776", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "259696c3-b43c-50e4-9784-25da07d10776", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_25c4fbd6-ac00-5c17-b083-b50eefa2ef50", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle with $\\angle B>\\angle C$. Let $P$ and $Q$ be distinct points on line $AC$ such that $\\angle PBA=\\angle QBA=\\angle ACB$ and $A$ lies between $P$ and $C$. Suppose there exists a point $D$ interior to segment $BQ$ with $PD=PB$. Let the ray $AD$ intersect the circumcircle of $\\triangle ABC$ again at $R\\neq A$. Prove that $QB=QR$.\n/-\nFormalization of the geometry problem in `problem.md`.\n\nThe plane is represented by `EuclideanSpace ℝ (Fin 2)`. All geometric\nnotions used in the statement (line, strict betweenness, ray, circumcircle,\nand the second intersection of a ray with a circumcircle) are defined\nexplicitly below. The original assertion is packaged as the proposition\n`Problem.Target`; no proof of it is supplied here.\n-/\n\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The Euclidean plane used for the problem. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The undirected angle `∠ X Y Z`, measured in radians. -/\ndef Angle (X Y Z : Point) : ℝ :=\n InnerProductGeometry.angle (X - Y) (Z - Y)\n\n/-- `X` lies on the (unoriented, infinite) line through `A` and `C`. -/\ndef OnLine (A C X : Point) : Prop :=\n ∃ t : ℝ, X = (1 - t) • A + t • C\n\n/-- `X` is strictly between the distinct endpoints `A` and `B`. -/\ndef InteriorOfSegment (X A B : Point) : Prop :=\n A ≠ B ∧ ∃ t : ℝ, 0 < t ∧ t < 1 ∧ X = (1 - t) • A + t • B\n\n/-- `X` lies on the ray starting at `A` and passing through `D`. -/\ndef OnRay (A D X : Point) : Prop :=\n A ≠ D ∧ ∃ t : ℝ, 0 ≤ t ∧ X = (1 - t) • A + t • D\n\n/-- `X` lies on the circumcircle of the triangle with vertices `A`, `B`, `C`.\nThe predicate says explicitly that some positive-radius circle passes through\n`A`, `B`, `C`, and `X`. -/\ndef OnCircumcircle (A B C X : Point) : Prop :=\n ∃ O : Point, ∃ r : ℝ,\n 0 < r ∧ dist O A = r ∧ dist O B = r ∧ dist O C = r ∧ dist O X = r\n\n/-- The points form a genuine (non-collinear) triangle. -/\ndef IsNondegenerateTriangle (A B C : Point) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Point)\n\n/-- `R` is the second intersection of the ray `AD` with the circumcircle of\n`ABC`: it is on both, it is not `A`, and every circle/ray intersection on the\nray is either `A` or `R`. -/\ndef IsSecondIntersection (A B C D R : Point) : Prop :=\n OnRay A D R ∧\n R ≠ A ∧\n OnCircumcircle A B C R ∧\n ∀ X : Point, OnRay A D X → OnCircumcircle A B C X → X = A ∨ X = R\n\n/-- The hypothesis that some point `D` is strictly inside segment `BQ` and\nsatisfies `PD = PB`. -/\ndef ExistsInteriorPointWithDistance (B Q P : Point) : Prop :=\n ∃ D : Point, InteriorOfSegment D B Q ∧ dist P D = dist P B\n\n/-- The complete target proposition.\n\nAfter the data `A B C` of a non-collinear triangle, the hypothesis\n`∠ABC > ∠ACB`, and the points `P Q` satisfying all the stated line, angle,\nand betweenness conditions, assume that a point `D` strictly inside `BQ`\nsatisfies `PD = PB`. For every such witness `D`, and for the second\nintersection `R` of ray `AD` with the circumcircle of `ABC`, the conclusion is\n`QB = QR`. -/\ndef Target : Prop :=\n ∀ A B C : Point,\n IsNondegenerateTriangle A B C →\n Angle A B C > Angle A C B →\n ∀ P Q : Point,\n P ≠ Q →\n OnLine A C P →\n OnLine A C Q →\n Angle P B A = Angle Q B A →\n Angle Q B A = Angle A C B →\n InteriorOfSegment A P C →\n ExistsInteriorPointWithDistance B Q P →\n ∀ D R : Point,\n InteriorOfSegment D B Q →\n dist P D = dist P B →\n IsSecondIntersection A B C D R →\n dist Q B = dist Q R\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "25c4fbd6-ac00-5c17-b083-b50eefa2ef50", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6530d05ef2bc6c831224d9875ec32679c7095716ea12341d6901f2920ef707f5", "task_path": "tasks/nmp3_25c4fbd6-ac00-5c17-b083-b50eefa2ef50", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "25c4fbd6-ac00-5c17-b083-b50eefa2ef50", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_25d51d1d-3988-5900-82ab-930b6a83cb19", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that\n-- \\[\n-- \\sum_{\\text{cyc}}\\sqrt{\\frac{5a^{2}+5b^{2}+6c^{2}}{4ab}}\n-- \\;\\ge\\;\n-- 3\\sqrt[9]{\\frac{8\\,(a+b)^{2}(b+c)^{2}(c+a)^{2}}{a^{2}b^{2}c^{2}}}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a cyclic inequality with a ninth root\n\nThis file states, but does not prove, the inequality in `problem.md`.\nThe variables range over the real numbers and are assumed positive.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The three-term cyclic summand, indexed by the cyclic permutation `(a, b, c)`. -/\ndef cyclicTerm (a b c : ℝ) : ℝ :=\n Real.sqrt ((5 * a ^ 2 + 5 * b ^ 2 + 6 * c ^ 2) / (4 * a * b))\n\n/-- The three-term cyclic sum appearing on the left-hand side. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The expression under the ninth root on the right-hand side. -/\ndef rhsRadicand (a b c : ℝ) : ℝ :=\n 8 * (a + b) ^ 2 * (b + c) ^ 2 * (c + a) ^ 2 /\n (a ^ 2 * b ^ 2 * c ^ 2)\n\n/--\nFor nonnegative `x`, this is the principal real ninth root of `x`, represented\nusing the real power with exponent `1 / 9`. In the problem the radicand is\npositive, so this is the intended ninth root.\n-/\ndef ninthRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 9 : ℝ)\n\n/-- The right-hand side of the stated inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 3 * ninthRoot (rhsRadicand a b c)\n\n/-- The simultaneous positivity assumption on the three variables. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The assertion that the displayed inequality holds for fixed `a`, `b`, and `c`. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n cyclicSum a b c ≥ rhs a b c\n\n/-- The complete universal statement from the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → InequalityHolds a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "25d51d1d-3988-5900-82ab-930b6a83cb19", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "152cc0eba39ee5e17233637fe048b80640d82e10eeb6ac0eec0d036c75bc4443", "task_path": "tasks/nmp3_25d51d1d-3988-5900-82ab-930b6a83cb19", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "25d51d1d-3988-5900-82ab-930b6a83cb19", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_25de773e-0f87-5ffd-a5e0-84cba8bc8cb0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k$ be a given even positive integer. Sarah first picks a positive integer $N>1$ and then repeatedly performs the following operation: at each step she chooses a prime divisor $p$ of the current $N$ and replaces $N$ by $N\\cdot\\bigl(p^k-p^{-1}\\bigr)$. Prove that there exist infinitely many even positive integers $k$ such that, no matter how Sarah chooses the primes at each step, her number $N$ will eventually be divisible by $2018\\;(=2\\cdot1009)\\,.$\nmodule\n\npublic import Mathlib\n\n/-!\n# Formal statement of the prime-replacement problem\n\nThis file formalizes the statement only. `Problem.Target` is a proposition-valued\ndefinition; no proof of the problem is supplied here.\n-/\n\nnamespace Problem\n\npublic section\n\n/-- The modulus `2018` from the problem, explicitly written as `2 * 1009`. -/\ndef targetModulus : ℕ := 2 * 1009\n\n/-- The rational value `p ^ k - p⁻¹` by which Sarah's current number is multiplied. -/\ndef multiplier (k p : ℕ) : ℚ :=\n (p : ℚ) ^ k - ((p : ℚ))⁻¹\n\n/-- A single legal step. Sarah chooses a prime divisor `p` of the current natural\nnumber `N`, and the next natural number is `N * (p ^ k - p⁻¹)`. The equality is\nstated in `ℚ` so that it records the reciprocal exactly; since `p ∣ N`, the value on\nthe right is an integer. -/\ndef Step (k N N' : ℕ) : Prop :=\n ∃ p : ℕ,\n Nat.Prime p ∧ p ∣ N ∧\n (N' : ℚ) = (N : ℚ) * multiplier k p\n\n/-- An infinite sequence of iterates is legal for exponent `k` and initial value\n`N` if it starts at `N` and every consecutive pair is a legal step. -/\ndef LegalSequence (k N : ℕ) (x : ℕ → ℕ) : Prop :=\n x 0 = N ∧ ∀ t : ℕ, Step k (x t) (x (t + 1))\n\n/-- The sequence reaches a multiple of `2018` at some finite stage. Stage zero is\npermitted, so an initially divisible value already satisfies this predicate. -/\ndef EventuallyDivisibleBy2018 (x : ℕ → ℕ) : Prop :=\n ∃ t : ℕ, targetModulus ∣ x t\n\n/-- For a fixed exponent `k`, every initial integer `N > 1` and every legal infinite\nsequence of choices eventually reaches a multiple of `2018`. -/\ndef UnavoidableForEveryStart (k : ℕ) : Prop :=\n ∀ N : ℕ, 1 < N →\n ∀ x : ℕ → ℕ,\n LegalSequence k N x → EventuallyDivisibleBy2018 x\n\n/-- The admissible exponents from the problem: positive even natural numbers. -/\ndef AdmissibleK (k : ℕ) : Prop :=\n Even k ∧ 0 < k\n\n/-- The set of admissible exponents having the asserted unavoidable-divisibility\nproperty. -/\ndef GoodEvenK : Set ℕ :=\n {k : ℕ | AdmissibleK k ∧ UnavoidableForEveryStart k}\n\n/-- The problem's assertion: infinitely many positive even integers `k` have the\nproperty that, for every starting value and all prime choices, a multiple of `2018`\nis eventually reached. -/\ndef Target : Prop :=\n Set.Infinite GoodEvenK\n\nend\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "25de773e-0f87-5ffd-a5e0-84cba8bc8cb0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ff9d162478814220b5ecb880e1f3cb7ed2395b27a2c6d98cbf60ca4e3eb79fca", "task_path": "tasks/nmp3_25de773e-0f87-5ffd-a5e0-84cba8bc8cb0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "25de773e-0f87-5ffd-a5e0-84cba8bc8cb0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_25deea4d-3e99-57a1-bf39-4309e754e7ab", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a^2+bc}{a^3+b^2c}+\\frac{b^2+ca}{b^3+c^2a}+\\frac{c^2+ab}{c^3+a^2b}\\le\\frac1a+\\frac1b+\\frac1c\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the positive-real inequality problem\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe cyclic inequality\n\n`LHS a b c ≤ RHS a b c`.\n\nThe target is represented as a closed proposition. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The hypotheses that the three real variables are positive. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (a ^ 2 + b * c) / (a ^ 3 + b ^ 2 * c) +\n (b ^ 2 + c * a) / (b ^ 3 + c ^ 2 * a) +\n (c ^ 2 + a * b) / (c ^ 3 + a ^ 2 * b)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 1 / a + 1 / b + 1 / c\n\n/--\nFor every triple of positive real numbers, the cyclic sum on the left is at most\nthe sum of reciprocals on the right.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, Positive a b c → LHS a b c ≤ RHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "25deea4d-3e99-57a1-bf39-4309e754e7ab", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "417a6d3f89ded3be1952c5c3f6fd1f8f2fc37231fc22a96cd521f355f6a5da65", "task_path": "tasks/nmp3_25deea4d-3e99-57a1-bf39-4309e754e7ab", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "25deea4d-3e99-57a1-bf39-4309e754e7ab", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_25fb40f8-53ca-538b-a670-fc666bec345f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Assume you have $2n+1$ real numbers $a_1,a_2,\\dots,a_{2n+1}$ with the following property: for any index $i$ ($1\\le i\\le 2n+1$), after removing $a_i$ the remaining $2n$ numbers can be divided into two groups of $n$ numbers each whose sums are equal. Prove that all $2n+1$ numbers are equal; i.e., there exists a constant $t$ such that $a_1=a_2=\\dots =a_{2n+1}=t$.\nimport Mathlib\n\n/-!\n# Formalization of the equal-sum removal problem\n\nThe problem concerns `2 * n + 1` real numbers indexed by\n`Fin (2 * n + 1)`. For every index `i`, deleting that entry leaves `2 * n`\nentries. Those entries are required to have a partition into two subsets of\ncardinality `n` with equal sums.\n\nThe final assertion says that every such indexed family is constant. The\ndeclarations below only state the proposition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The entries remaining after deleting index `i` can be split into two\ndisjoint groups, each of cardinality `n`, whose sums are equal.\n\nThe first group is represented by a finset `s` not containing `i`; the second\ngroup is its complement in all indices other than `i`. Both cardinality\nequalities are stated explicitly. -/\ndef BalancedAfterRemoval (n : ℕ) (a : Fin (2 * n + 1) → ℝ)\n (i : Fin (2 * n + 1)) : Prop :=\n ∃ s : Finset (Fin (2 * n + 1)),\n i ∉ s ∧\n s.card = n ∧\n ((Finset.univ.erase i) \\ s).card = n ∧\n ∑ j ∈ s, a j = ∑ j ∈ (Finset.univ.erase i) \\ s, a j\n\n/-- For every index `i`, deleting `a i` leaves entries that can be partitioned\ninto two groups of `n` entries with equal sums. -/\ndef Admissible (n : ℕ) (a : Fin (2 * n + 1) → ℝ) : Prop :=\n ∀ i : Fin (2 * n + 1), BalancedAfterRemoval n a i\n\n/-- The indexed family is constant: there is one real number `t` equal to every\nentry. -/\ndef AllEqual (n : ℕ) (a : Fin (2 * n + 1) → ℝ) : Prop :=\n ∃ t : ℝ, ∀ i : Fin (2 * n + 1), a i = t\n\n/-- The full target assertion: for every natural number `n` and every family of\n`2 * n + 1` real numbers, if deleting any one entry leaves two groups of `n`\nentries with equal sums, then all entries are equal. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (a : Fin (2 * n + 1) → ℝ),\n Admissible n a → AllEqual n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "25fb40f8-53ca-538b-a670-fc666bec345f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "de0c48754de5a341eea8dc91b44e91ab1412916f27918684c06d6f7872c741b9", "task_path": "tasks/nmp3_25fb40f8-53ca-538b-a670-fc666bec345f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "25fb40f8-53ca-538b-a670-fc666bec345f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_25fc0aeb-3e90-58b2-8908-6f63f106a2b8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers such that $x+y+z=3$. Prove that \n-- \\[\n-- 2\\sqrt{x+\\sqrt{y}}+2\\sqrt{y+\\sqrt{z}}+2\\sqrt{z+\\sqrt{x}}\n-- \\le \\sqrt{8+x-y}+\\sqrt{8+y-z}+\\sqrt{8+z-x}.\n-- \\]\nimport Mathlib\n\n/-!\nThis file formalizes the statement of the problem.\n\nThe original problem asks to prove, for positive real numbers `x`, `y`, and `z`\nwith `x + y + z = 3`, the inequality\n`2√(x + √y) + 2√(y + √z) + 2√(z + √x)`\n` ≤ √(8 + x - y) + √(8 + y - z) + √(8 + z - x)`.\n\nThe proposition is packaged as a `Prop`-valued definition so that this file\nrecords the target without asserting or proving it.\n-/\n\nnamespace Problem\n\n/-- The inequality asserted in the problem, with its positivity and sum\nconstraints. All square roots are the principal real square roots. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x + y + z = 3 →\n 2 * Real.sqrt (x + Real.sqrt y) +\n 2 * Real.sqrt (y + Real.sqrt z) +\n 2 * Real.sqrt (z + Real.sqrt x)\n ≤\n Real.sqrt (8 + x - y) +\n Real.sqrt (8 + y - z) +\n Real.sqrt (8 + z - x)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "25fc0aeb-3e90-58b2-8908-6f63f106a2b8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2a9ffcdca1f16d555144645849807ec26981fb3d7fec364dc7ccc637b5690f5f", "task_path": "tasks/nmp3_25fc0aeb-3e90-58b2-8908-6f63f106a2b8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "25fc0aeb-3e90-58b2-8908-6f63f106a2b8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2603500d-4cf3-55bf-8c19-b96dd42f49bc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are positive real numbers, prove that \n-- \\[\n-- \\frac{1}{a+4b}+\\frac{1}{b+4c}+\\frac{1}{c+4a}\\ge\n-- \\frac{1}{a+2b+2c}+\\frac{1}{b+2c+2a}+\\frac{1}{c+2a+2b}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\nthe inequality\n\n`1 / (a + 4*b) + 1 / (b + 4*c) + 1 / (c + 4*a)`\n`≥ 1 / (a + 2*b + 2*c) + 1 / (b + 2*c + 2*a) + 1 / (c + 2*a + 2*b)`.\n\nThe declarations below formalize the two sides and the full universally\nquantified proposition. No proof of the proposition is asserted here.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality:\n`1/(a + 4b) + 1/(b + 4c) + 1/(c + 4a)`. -/\nnoncomputable def leftSide (a b c : ℝ) : ℝ :=\n 1 / (a + 4 * b) + 1 / (b + 4 * c) + 1 / (c + 4 * a)\n\n/-- The right-hand side of the inequality:\n`1/(a + 2b + 2c) + 1/(b + 2c + 2a) + 1/(c + 2a + 2b)`. -/\nnoncomputable def rightSide (a b c : ℝ) : ℝ :=\n 1 / (a + 2 * b + 2 * c) +\n 1 / (b + 2 * c + 2 * a) +\n 1 / (c + 2 * a + 2 * b)\n\n/-- The full target assertion: for every triple of strictly positive real\nnumbers `a`, `b`, and `c`, the left-hand side is at least the right-hand side. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n leftSide a b c ≥ rightSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2603500d-4cf3-55bf-8c19-b96dd42f49bc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "608df2d81f3af236a608efc0493dc0fd6bdcd95c218b1c1e68d535e618ed6c1d", "task_path": "tasks/nmp3_2603500d-4cf3-55bf-8c19-b96dd42f49bc", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2603500d-4cf3-55bf-8c19-b96dd42f49bc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2606169b-6fe9-554b-839f-b641fd619867", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{bc^2-a^2b}{a^3+b^2c}+\\frac{ca^2-b^2c}{b^3+c^2a}+\\frac{ab^2-c^2a}{c^3+a^2b}\\ge0.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nThe assertion from the problem: for all positive real numbers `a`, `b`, and `c`,\nthe cyclic sum\n`(b*c^2 - a^2*b)/(a^3 + b^2*c) +\n (c*a^2 - b^2*c)/(b^3 + c^2*a) +\n (a*b^2 - c^2*a)/(c^3 + a^2*b)`\nis nonnegative.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a ∧ 0 < b ∧ 0 < c →\n (b * c ^ 2 - a ^ 2 * b) / (a ^ 3 + b ^ 2 * c) +\n (c * a ^ 2 - b ^ 2 * c) / (b ^ 3 + c ^ 2 * a) +\n (a * b ^ 2 - c ^ 2 * a) / (c ^ 3 + a ^ 2 * b) ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2606169b-6fe9-554b-839f-b641fd619867", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d537bf655ad26eddf890f9c45c253136321d50761b506ba3b55f66d299f95fa3", "task_path": "tasks/nmp3_2606169b-6fe9-554b-839f-b641fd619867", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2606169b-6fe9-554b-839f-b641fd619867", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_26133447-3a22-5dc0-83bb-59e1682db0c8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}\\;\\ge\\;\\frac{ab}{a^{2}+bc+ca}\\;+\\;\\frac{bc}{b^{2}+ca+ab}\\;+\\;\\frac{ca}{c^{2}+ab+bc}.\n-- \\] \n-- Equality holds if and only if $a=b=c$.\nimport Mathlib\n\n/-!\n# Formal statement: cyclic inequality for positive reals\n\nThis file gives a proposition-valued statement of the problem. No proof of the\nmathematical claim is supplied here; `Target` is a definition whose body is the\nassertion to be proved.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the claimed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a)\n\n/-- The right-hand side of the claimed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (a * b) / (a ^ 2 + b * c + c * a) +\n (b * c) / (b ^ 2 + c * a + a * b) +\n (c * a) / (c ^ 2 + a * b + b * c)\n\n/-- The hypothesis that the three real parameters are positive. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The asserted weak inequality for a particular triple. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The asserted equality characterization for a particular triple. -/\ndef EqualityCharacterization (a b c : ℝ) : Prop :=\n (lhs a b c = rhs a b c ↔ a = b ∧ b = c)\n\n/-- The component assertion that the weak inequality holds for every positive\nreal triple. -/\ndef InequalityTarget : Prop :=\n ∀ a b c : ℝ,\n PositiveTriple a b c →\n InequalityHolds a b c\n\n/-- The component assertion that, for every positive real triple, equality in\nthe displayed inequality is equivalent to `a = b = c`. -/\ndef EqualityTarget : Prop :=\n ∀ a b c : ℝ,\n PositiveTriple a b c →\n EqualityCharacterization a b c\n\n/-- The full propositional content of the problem, keeping each quantified\ncomponent together: for every positive real triple, the weak inequality holds\nand equality holds if and only if `a = b = c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n PositiveTriple a b c →\n InequalityHolds a b c ∧ EqualityCharacterization a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "26133447-3a22-5dc0-83bb-59e1682db0c8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d655a97badc614ac25f0077feb5bef2525bcd33321a7bc63b76ff774b3204ad6", "task_path": "tasks/nmp3_26133447-3a22-5dc0-83bb-59e1682db0c8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "26133447-3a22-5dc0-83bb-59e1682db0c8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_261addf8-1d92-598b-9df7-8156e837203f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m$ be a positive integer. Prove that there exist infinitely many positive integers $n$ such that $m\\mid 3\\cdot2^{n}+n$.\nimport Mathlib\n\n/-!\nFormalization of the problem:\n\nLet `m` be a positive integer. Prove that there exist infinitely many positive\nintegers `n` such that `m ∣ 3 * 2 ^ n + n`.\n\nThe target is stated as a proposition-valued definition, as requested; no proof\nof the target is supplied here.\n-/\n\nnamespace Problem\n\n/-- The condition on the pair `(m, n)`: `n` is a positive integer and\n`m` divides `3 * 2 ^ n + n`. Both `m` and `n` are represented as natural\nnumbers, with positivity made explicit by `0 < n` (and the positivity of `m`\nis an explicit hypothesis in `Target`). -/\ndef Admissible (m n : ℕ) : Prop :=\n 0 < n ∧ m ∣ 3 * 2 ^ n + n\n\n/-- The set of positive integers `n` satisfying the divisibility condition for\na fixed positive integer `m`. -/\ndef SolutionSet (m : ℕ) : Set ℕ :=\n {n : ℕ | Admissible m n}\n\n/-- For every positive integer `m`, there are infinitely many positive integers\n`n` with `m ∣ 3 * 2 ^ n + n`. -/\ndef Target : Prop :=\n ∀ m : ℕ, 0 < m → (SolutionSet m).Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "261addf8-1d92-598b-9df7-8156e837203f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2336939bd093b72f3113fd2a451e25a7b31a9ddbf5f5e158d6fb4c3cb67d805f", "task_path": "tasks/nmp3_261addf8-1d92-598b-9df7-8156e837203f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "261addf8-1d92-598b-9df7-8156e837203f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_264d36c1-27e7-5952-8185-f5c2b21255e6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $2n+2$ points in the plane, no three of which are collinear, prove that there exist two of the points whose connecting line leaves exactly $n$ of the remaining points on each side of the line.\nimport Mathlib\n\n/-!\n# A halving line among `2 * n + 2` planar points\n\nThis file formalizes the statement of the problem but does not prove the\nexistence theorem; the target is only a proposition-valued declaration.\n-/\n\nnamespace Problem\n\n/-- A point of the real Euclidean plane, represented by its two coordinates. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Twice the oriented area of the triangle with vertices `p`, `q`, and `r`.\nIts sign records on which side of the oriented line from `p` to `q` the point\n`r` lies. -/\ndef cross (p q r : Point) : ℝ :=\n (q 0 - p 0) * (r 1 - p 1) - (q 1 - p 1) * (r 0 - p 0)\n\n/-- The finite point set `S` is in general position with respect to\ncollinearity: no three distinct points of `S` are collinear. -/\ndef NoThreeCollinear (S : Finset Point) : Prop :=\n ∀ p ∈ S, ∀ q ∈ S, ∀ r ∈ S,\n p ≠ q → p ≠ r → q ≠ r → cross p q r ≠ 0\n\n/-- The number of points of `S`, other than `p` and `q`, lying strictly to the\nleft of the oriented line through `p` and `q`. -/\nnoncomputable def leftCount (S : Finset Point) (p q : Point) : ℕ :=\n (((S.erase p).erase q).filter (fun r => 0 < cross p q r)).card\n\n/-- The number of points of `S`, other than `p` and `q`, lying strictly to the\nright of the oriented line through `p` and `q`. -/\nnoncomputable def rightCount (S : Finset Point) (p q : Point) : ℕ :=\n (((S.erase p).erase q).filter (fun r => cross p q r < 0)).card\n\n/-- A finite point set has a halving pair at level `n` when some two distinct\npoints of the set determine a line with exactly `n` other points on either\nstrict side. -/\ndef HasHalvingPair (n : ℕ) (S : Finset Point) : Prop :=\n ∃ p ∈ S, ∃ q ∈ S,\n p ≠ q ∧ leftCount S p q = n ∧ rightCount S p q = n\n\n/-- The assertion for a fixed `n`: every finite set of `2 * n + 2` planar\npoints with no three collinear has a halving pair at level `n`. -/\ndef TargetFor (n : ℕ) : Prop :=\n ∀ S : Finset Point,\n S.card = 2 * n + 2 →\n NoThreeCollinear S →\n HasHalvingPair n S\n\n/-- The complete target assertion, universally quantified over the natural\nnumber `n` as in the source statement. -/\ndef Target : Prop :=\n ∀ n : ℕ, TargetFor n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "264d36c1-27e7-5952-8185-f5c2b21255e6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0a644018279a314759dee71e1fb1c7a88345c7a9993909038b71a2c4c08cc12c", "task_path": "tasks/nmp3_264d36c1-27e7-5952-8185-f5c2b21255e6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "264d36c1-27e7-5952-8185-f5c2b21255e6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_26616afe-6b27-5002-b32b-8186953a0a62", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be the side lengths of a non‑degenerate triangle, let $s=\\frac{a+b+c}{2}$ be its semiperimeter and let $P$ denote its area. Prove that \n-- \\[\n-- \\frac{s(s-a)}{(s-a)^2+P}+\\frac{s(s-b)}{(s-b)^2+P}+\\frac{s(s-c)}{(s-c)^2+P}\\ge 3\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the triangle semiperimeter-area inequality\n\nThe source problem asks for a proof of an inequality for the side lengths of a\nnon-degenerate triangle, where the semiperimeter and the area are denoted by\n`s` and `P`, respectively. Below, the area is represented by Heron's formula\nin terms of the three side lengths.\n-/\n\nnamespace Problem\n\n/-- The three side lengths are positive real numbers. -/\ndef PositiveSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The three side lengths satisfy the strict triangle inequalities. -/\ndef StrictTriangleInequalities (a b c : ℝ) : Prop :=\n a + b > c ∧ a + c > b ∧ b + c > a\n\n/-- Positive side lengths satisfying the three strict triangle inequalities are\nexactly the side lengths of a non-degenerate Euclidean triangle. -/\ndef IsNondegenerateTriangle (a b c : ℝ) : Prop :=\n PositiveSideLengths a b c ∧ StrictTriangleInequalities a b c\n\n/-- The semiperimeter `s = (a + b + c) / (2 : ℝ)`. -/\nnoncomputable def semiperimeter (a b c : ℝ) : ℝ :=\n (a + b + c) / (2 : ℝ)\n\n/-- The area `P` of a triangle with side lengths `a`, `b`, `c`, written using\nHeron's formula:\n`P = sqrt (s * (s - a) * (s - b) * (s - c))`. -/\nnoncomputable def triangleArea (a b c : ℝ) : ℝ :=\n Real.sqrt <|\n semiperimeter a b c * (semiperimeter a b c - a) *\n (semiperimeter a b c - b) * (semiperimeter a b c - c)\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def targetExpression (a b c : ℝ) : ℝ :=\n let s := semiperimeter a b c\n let P := triangleArea a b c\n s * (s - a) / ((s - a) ^ 2 + P) +\n s * (s - b) / ((s - b) ^ 2 + P) +\n s * (s - c) / ((s - c) ^ 2 + P)\n\n/-- The asserted inequality for every non-degenerate triangle. -/\nnoncomputable def Target : Prop :=\n ∀ (a b c : ℝ), IsNondegenerateTriangle a b c →\n targetExpression a b c ≥ (3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "26616afe-6b27-5002-b32b-8186953a0a62", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2298567ffa26878be27899dd02ba4cafe4800a8cea18e801db9ee1954028eba3", "task_path": "tasks/nmp3_26616afe-6b27-5002-b32b-8186953a0a62", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "26616afe-6b27-5002-b32b-8186953a0a62", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_26b75803-d174-5f9a-97f2-3f0a27e25fb6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a^{2}}{b^{3}+c^{3}}+\\frac{b^{2}}{a^{3}+c^{3}}+\\frac{c^{2}}{a^{3}+b^{3}}\n-- \\;\\ge\\;\n-- \\frac{3(a+b+c)}{2\\,(a^{2}+b^{2}+c^{2})}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`,\nthe cyclic sum `a^2 / (b^3 + c^3) + b^2 / (a^3 + c^3) + c^2 / (a^3 + b^3)`\nis at least `3 * (a + b + c) / (2 * (a^2 + b^2 + c^2))`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (a ^ 2 / (b ^ 3 + c ^ 3) +\n b ^ 2 / (a ^ 3 + c ^ 3) +\n c ^ 2 / (a ^ 3 + b ^ 3)) ≥\n (3 * (a + b + c)) / (2 * (a ^ 2 + b ^ 2 + c ^ 2))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "26b75803-d174-5f9a-97f2-3f0a27e25fb6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8982df3444e8f61cab80bbbed8d28ac722a3a98de420fd6afd167371ae1d08bd", "task_path": "tasks/nmp3_26b75803-d174-5f9a-97f2-3f0a27e25fb6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "26b75803-d174-5f9a-97f2-3f0a27e25fb6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_26d2988f-428b-5a9c-83ed-e2b26788578e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any triangle \\(ABC\\) (i.e. \\(A,B,C>0\\) and \\(A+B+C=\\pi\\)) the following inequality holds \n-- \\[\n-- \\sin A+\\sin B+\\sin C\\;\\ge\\;\\sin^{3}A+\\sin^{3}B+\\sin^{3}C+\\sin A\\sin B\\sin C\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the triangle sine inequality\n\nThis file states the problem assertion as a proposition-valued definition. No\nproof of the assertion is supplied at this formalization stage.\n-/\n\nnamespace Problem\n\n/-- The admissible triples in the problem: three positive real numbers whose\nsum is `π`. These are the three angles of a (nondegenerate) triangle. -/\ndef IsTriangleAngleTriple (A B C : ℝ) : Prop :=\n 0 < A ∧ 0 < B ∧ 0 < C ∧ A + B + C = Real.pi\n\n/-- The inequality asserted in the problem for a triple of angles. -/\ndef TriangleSineInequality (A B C : ℝ) : Prop :=\n Real.sin A + Real.sin B + Real.sin C ≥\n Real.sin A ^ 3 + Real.sin B ^ 3 + Real.sin C ^ 3\n + Real.sin A * Real.sin B * Real.sin C\n\n/-- For every triangle `ABC`, the sum of the sines of its angles is at least\nthe sum of their cubes plus the product of the three sines. -/\ndef Target : Prop :=\n ∀ A B C : ℝ, IsTriangleAngleTriple A B C → TriangleSineInequality A B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "26d2988f-428b-5a9c-83ed-e2b26788578e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "79bef0fd141f7dc59d693cea3bac4ccf63d2efe9f9225ecf2adb0737da2a24a8", "task_path": "tasks/nmp3_26d2988f-428b-5a9c-83ed-e2b26788578e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "26d2988f-428b-5a9c-83ed-e2b26788578e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_27689448-9048-5e08-b95f-ba7758995fb5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all non‑negative real numbers $a,\\;b,\\;c$, prove that \n-- \\[\n-- 2\\,(a^2+1)(b^2+1)(c^2+1)\\;\\ge\\;(a+1)(b+1)(c+1)(abc+1)\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the non-negative real inequality\n\nThe source problem asks to prove, for all non-negative real numbers `a`, `b`, `c`,\nthat\n\n`2 * (a^2 + 1) * (b^2 + 1) * (c^2 + 1)\n ≥ (a + 1) * (b + 1) * (c + 1) * (a * b * c + 1)`.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all non-negative real numbers `a`, `b`, and `c`,\nthe stated product inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n 2 * (a ^ 2 + 1) * (b ^ 2 + 1) * (c ^ 2 + 1) ≥\n (a + 1) * (b + 1) * (c + 1) * (a * b * c + 1)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "27689448-9048-5e08-b95f-ba7758995fb5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "afe0261476e0f36beada2d5f171decc3ab9eaee0b383bda99a937db106527233", "task_path": "tasks/nmp3_27689448-9048-5e08-b95f-ba7758995fb5", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "27689448-9048-5e08-b95f-ba7758995fb5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_27882a59-f210-50df-8a2e-6e9ff9bcfc77", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that \n-- \\[\n-- x^{4}y+y^{4}z+z^{4}x+xyz\\bigl(x^{3}+y^{3}+z^{3}\\bigr)\\ge (x+y+z)\\bigl(3xyz-1\\bigr)\n-- \\] \n-- holds for all positive real numbers \\(x,\\;y,\\;z\\).\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe original problem asks to prove, for all positive real numbers `x`, `y`, and\n`z`, that\n\n`x^4*y + y^4*z + z^4*x + x*y*z*(x^3 + y^3 + z^3)\n ≥ (x + y + z)*(3*x*y*z - 1)`.\n\nThe proposition below is the target statement only; it is not proved here.\n-/\n\nnamespace Problem\n\n/-- The target assertion: for all positive real numbers `x`, `y`, and `z`,\nthe stated inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x ^ 4 * y + y ^ 4 * z + z ^ 4 * x +\n x * y * z * (x ^ 3 + y ^ 3 + z ^ 3) ≥\n (x + y + z) * (3 * x * y * z - 1)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "27882a59-f210-50df-8a2e-6e9ff9bcfc77", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f93bba7ab76c4df40ea1a8d73d3a7c1866498440e78147577008e11dd720b6e0", "task_path": "tasks/nmp3_27882a59-f210-50df-8a2e-6e9ff9bcfc77", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "27882a59-f210-50df-8a2e-6e9ff9bcfc77", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_27e7d978-5a13-54e1-9f41-b777f037d7e2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ with $abcd=1$. Prove that \n-- \\[\n-- (a+b)(b+c)(c+d)(d+a)\\ge (a+1)(b+1)(c+1)(d+1)\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem. -/\ndef lhs (a b c d : ℝ) : ℝ :=\n (a + b) * (b + c) * (c + d) * (d + a)\n\n/-- The right-hand side of the inequality in the problem. -/\ndef rhs (a b c d : ℝ) : ℝ :=\n (a + 1) * (b + 1) * (c + 1) * (d + 1)\n\n/-- The conclusion of the problem, for arbitrary real numbers `a`, `b`, `c`, `d`. -/\ndef inequality (a b c d : ℝ) : Prop :=\n lhs a b c d ≥ rhs a b c d\n\n/-- The full mathematical assertion of the problem: for all positive real numbers\n`a`, `b`, `c`, `d` whose product is `1`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c d : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n 0 < d →\n a * b * c * d = 1 →\n inequality a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "27e7d978-5a13-54e1-9f41-b777f037d7e2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bf2228d609ece74eb6e3e773be1cafe2e78d4cde8dba9152643681d43ccce0ae", "task_path": "tasks/nmp3_27e7d978-5a13-54e1-9f41-b777f037d7e2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "27e7d978-5a13-54e1-9f41-b777f037d7e2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_28096a30-ce86-5321-b5a3-92f81bbb5cc3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,\\;b,\\;c$ be the side lengths of a triangle satisfying \n-- \\[\n-- \\frac{a^{3}}{b+c}+\\frac{b^{3}}{c+a}+\\frac{c^{3}}{a+b}\n-- =\\frac14\\Bigl(\\frac1{a^{2}+b^{2}}+\\frac1{b^{2}+c^{2}}+\\frac1{c^{2}+a^{2}}\\Bigr).\n-- \\] \n-- Prove that \n-- \\[\n-- \\frac1{a(b+c-a)}+\\frac1{b(c+a-b)}+\\frac1{c(a+b-c)}\\ge 6.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of a triangle inequality problem\n\nThe source problem quantifies over the three side lengths of a (nondegenerate)\nEuclidean triangle, assumes a cubic/rational identity, and asks for a lower\nbound involving the identity's variables. The declarations below state the\nproblem without supplying a proof.\n-/\n\nnamespace Problem\n\n/-- `a`, `b`, and `c` are the side lengths of a nondegenerate triangle. -/\ndef IsTriangleSide (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a < b + c ∧ b < c + a ∧ c < a + b\n\n/-- The cubic/rational identity assumed in the source problem. -/\ndef TriangleEquation (a b c : ℝ) : Prop :=\n a ^ 3 / (b + c) + b ^ 3 / (c + a) + c ^ 3 / (a + b) =\n (1 / 4 : ℝ) *\n (1 / (a ^ 2 + b ^ 2) + 1 / (b ^ 2 + c ^ 2) +\n 1 / (c ^ 2 + a ^ 2))\n\n/-- The lower bound required in the source problem. -/\ndef TargetInequality (a b c : ℝ) : Prop :=\n (6 : ℝ) ≤\n 1 / (a * (b + c - a)) + 1 / (b * (c + a - b)) +\n 1 / (c * (a + b - c))\n\n/-- The complete universally quantified assertion of the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n IsTriangleSide a b c → TriangleEquation a b c → TargetInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28096a30-ce86-5321-b5a3-92f81bbb5cc3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f799fb59ea11e435cc9a9e9f6335a3d41d384692ea13142e2606dbc52ca0ea32", "task_path": "tasks/nmp3_28096a30-ce86-5321-b5a3-92f81bbb5cc3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28096a30-ce86-5321-b5a3-92f81bbb5cc3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_280b4cb6-0408-5175-8518-573f9a8d58eb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ such that $a+b+c=3$. Prove that \n-- \\[\n-- (a^{6}+a^{3}+1)(b^{6}+b^{3}+1)(c^{6}+c^{3}+1)\\ge 27.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target problem\n\nLet `a b c ≥ 0` with `a + b + c = 3`. Prove that\n\n`(a^6 + a^3 + 1) * (b^6 + b^3 + 1) * (c^6 + c^3 + 1) ≥ 27`.\n\nThe declarations below encode the admissibility predicate and the asserted\nproposition. No proof of the proposition is included.\n-/\n\nnamespace Problem\n\n/-- The one-variable factor `x^6 + x^3 + 1` occurring in the product. -/\ndef Factor (x : ℝ) : ℝ :=\n x ^ 6 + x ^ 3 + (1 : ℝ)\n\n/-- The product `(a^6 + a^3 + 1) * (b^6 + b^3 + 1) * (c^6 + c^3 + 1)`. -/\ndef Product (a b c : ℝ) : ℝ :=\n Factor a * Factor b * Factor c\n\n/--\nThe admissibility conditions in the problem: the three real numbers are\nnonnegative and their sum is `3`.\n-/\ndef Admissible (a b c : ℝ) : Prop :=\n (0 : ℝ) ≤ a ∧ (0 : ℝ) ≤ b ∧ (0 : ℝ) ≤ c ∧ a + b + c = (3 : ℝ)\n\n/-- The asserted lower bound `27 ≤ Product a b c` at a fixed triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (27 : ℝ) ≤ Product a b c\n\n/--\nThe full statement to be proved: for every triple of nonnegative real numbers\nwhose sum is `3`, the product of the three factors is at least `27`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "280b4cb6-0408-5175-8518-573f9a8d58eb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6afbb5a331a101781574d09b101a8b2e375ec41ebf8af4e81ce6483251dbb633", "task_path": "tasks/nmp3_280b4cb6-0408-5175-8518-573f9a8d58eb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "280b4cb6-0408-5175-8518-573f9a8d58eb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_281956f0-abc6-5f4e-ba4e-15a75f8d262a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a cyclic quadrilateral. Let $E=AC\\cap BD$. Let $F$ be the intersection of the extensions of $AD$ and $BC$ beyond $A$ and $B$. Let $G$ be the point such that $ECGD$ is a parallelogram. Let $H$ be the reflection of $E$ across line $AD$. Prove that the four points $D,\\;H,\\;F,\\;G$ are concyclic.\nimport Mathlib\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\nopen EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Four pairwise distinct vertices lying on one common Euclidean circle. The order in which\nthe vertices are named is then constrained by the diagonal-intersection and side-extension\nclauses that follow in `Setup`. -/\ndef IsCyclicQuadrilateral (A B C D : Point) : Prop :=\n A ≠ B ∧ B ≠ C ∧ C ≠ D ∧ D ≠ A ∧ A ≠ C ∧ B ≠ D ∧\n EuclideanGeometry.Concyclic ({A, B, C, D} : Set Point)\n\n/-- `E` is the unique common point of the closed diagonal segments `AC` and `BD`. -/\ndef IsDiagonalIntersection (A B C D E : Point) : Prop :=\n Wbtw ℝ A E C ∧ Wbtw ℝ B E D ∧\n ∀ X : Point, Wbtw ℝ A X C → Wbtw ℝ B X D → X = E\n\n/-- `X` lies strictly beyond `B` on the ray starting at `A` and passing through `B`. -/\ndef OnExtensionBeyond (A B X : Point) : Prop :=\n ∃ t : ℝ, 1 < t ∧ X = AffineMap.lineMap A B t\n\n/-- `F` is the unique common point of the extensions of `AD` beyond `A` and `BC` beyond `B`. -/\ndef IsSideExtensionIntersection (A B C D F : Point) : Prop :=\n OnExtensionBeyond D A F ∧ OnExtensionBeyond C B F ∧\n ∀ X : Point, OnExtensionBeyond D A X → OnExtensionBeyond C B X → X = F\n\n/-- The ordered vertices `p, q, r, s` form a parallelogram. -/\ndef IsParallelogram (p q r s : Point) : Prop :=\n midpoint ℝ p r = midpoint ℝ q s\n\n/-- `H` is the reflection of `E` across the line through `A` and `D`. -/\ndef IsReflectionAcrossLine (A D E H : Point) : Prop :=\n A ≠ D ∧ midpoint ℝ E H ∈ line[ℝ, A, D] ∧ inner ℝ (A -ᵥ D) (H -ᵥ E) = 0\n\n/-- All hypotheses and construction properties in the problem. -/\ndef Setup (A B C D E F G H : Point) : Prop :=\n IsCyclicQuadrilateral A B C D ∧\n IsDiagonalIntersection A B C D E ∧\n IsSideExtensionIntersection A B C D F ∧\n IsParallelogram E C G D ∧\n IsReflectionAcrossLine A D E H\n\n/-- The required conclusion: `D`, `H`, `F`, and `G` are concyclic. -/\ndef Conclusion (D H F G : Point) : Prop :=\n EuclideanGeometry.Concyclic ({D, H, F, G} : Set Point)\n\n/-- The full assertion of the problem. -/\ndef Target : Prop :=\n ∀ A B C D E F G H : Point, Setup A B C D E F G H → Conclusion D H F G\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "281956f0-abc6-5f4e-ba4e-15a75f8d262a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fadbd2350f8aac5cb175e4ff7b601cdb31a743da4597400b6299fec7e7f7698b", "task_path": "tasks/nmp3_281956f0-abc6-5f4e-ba4e-15a75f8d262a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "281956f0-abc6-5f4e-ba4e-15a75f8d262a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_28238576-2c00-526c-96bf-8a74dbde2ff4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a^{2}+b^{2}}{a^{2}+ab}+\\frac{b^{2}+c^{2}}{b^{2}+bc}+\\frac{c^{2}+a^{2}}{c^{2}+ca}\\ge \\frac{9\\,(a^{2}+b^{2}+c^{2})}{(a+b+c)^{2}}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\nthe inequality\n\n`(a² + b²)/(a² + ab) + (b² + c²)/(b² + bc) + (c² + a²)/(c² + ca)\n ≥ 9(a² + b² + c²)/(a + b + c)²`.\n\nWe record the assertion as a `Prop`-valued definition. No proof of it is\nincluded, as required by the statement-formalization task.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2) / (a ^ 2 + a * b) +\n (b ^ 2 + c ^ 2) / (b ^ 2 + b * c) +\n (c ^ 2 + a ^ 2) / (c ^ 2 + c * a)\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n ((9 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2)) / (a + b + c) ^ 2\n\n/-- For all positive real numbers `a`, `b`, and `c`, the displayed inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n rightHandSide a b c ≤ leftHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28238576-2c00-526c-96bf-8a74dbde2ff4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c52af0fb6df49fd30a1ea0cf79b70aaec225b45d3e829d6a1dd21cdd822d4fac", "task_path": "tasks/nmp3_28238576-2c00-526c-96bf-8a74dbde2ff4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28238576-2c00-526c-96bf-8a74dbde2ff4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_285449c3-2daf-55a8-b0b0-0547dac548af", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $a+b+c=2$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a+b}{2}-ab}+\\sqrt{\\frac{b+c}{2}-bc}+\\sqrt{\\frac{c+a}{2}-ca}\\ge\\sqrt2\\,.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real variables in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a + b + c = 2\n\n/-- One summand of the left-hand side, with its real square root. -/\nnoncomputable def term (x y : ℝ) : ℝ :=\n Real.sqrt ((x + y) / 2 - x * y)\n\n/-- The complete left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n term a b + term b c + term c a\n\n/-- The inequality asserted in the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ Real.sqrt 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "285449c3-2daf-55a8-b0b0-0547dac548af", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "df5ec7ee8d01fc0a9ae875f79a2bba43e1eec009aafd30786e1e7e70b217d3d2", "task_path": "tasks/nmp3_285449c3-2daf-55a8-b0b0-0547dac548af", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "285449c3-2daf-55a8-b0b0-0547dac548af", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2876f43c-b3ec-52c4-b584-0442305fbb3e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ satisfy $ab+bc+ca=1$. Prove that \n-- \\[\n-- \\frac{1}{(4a+2b+c)^2}+\\frac{1}{(4b+2c+a)^2}+\\frac{1}{(4c+2a+b)^2}\\le\\frac{9}{49}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n 1 / (4 * a + 2 * b + c) ^ 2 +\n 1 / (4 * b + 2 * c + a) ^ 2 +\n 1 / (4 * c + 2 * a + b) ^ 2\n\n/-- The admissibility conditions imposed on the real variables in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + b * c + c * a = 1\n\n/-- The inequality asserted in the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≤ (9 : ℝ) / 49\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2876f43c-b3ec-52c4-b584-0442305fbb3e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a98ddba2217bd899849ca2025b519f54008be48aff2731b94a0dc939b435271c", "task_path": "tasks/nmp3_2876f43c-b3ec-52c4-b584-0442305fbb3e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2876f43c-b3ec-52c4-b584-0442305fbb3e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_28841381-bcf6-567b-95e4-92c258690a66", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- We call a set of integers **special** if it contains exactly four elements and can be partitioned into two disjoint subsets \\(\\{a,b\\}\\) and \\(\\{c,d\\}\\) such that \\(ab - cd = 1\\). Prove that for every positive integer \\(n\\), the set \\(\\{1,2,\\dots,4n\\}\\) cannot be partitioned into \\(n\\) disjoint special sets.\nimport Mathlib.Data.Int.Interval\nimport Mathlib.Data.Finset.Union\n/-!\n# Formal statement: partitioning `{1, ..., 4n}` into special four-element sets\n\nWe formalize the problem statement from `problem.md`. A special set is a\nfour-element finite set of integers which is the disjoint union of two\ntwo-element sets `{a,b}` and `{c,d}` satisfying `a*b - c*d = 1`.\n\nThe main proposition says that for every positive natural number `n`, the\ninteger interval `{1, ..., 4n}` admits no partition into `n` special sets.\nThis file only states the proposition; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The finite integer interval `{1, 2, ..., 4n}`. -/\ndef InitialInterval (n : ℕ) : Finset ℤ :=\n Finset.Icc (1 : ℤ) (4 * (n : ℤ))\n\n/--\nA finite set of integers is *special* if it has exactly four elements and can\nbe written as the disjoint union of two two-element sets `{a,b}` and `{c,d}`\nsuch that `a*b - c*d = 1`.\n-/\ndef IsSpecial (S : Finset ℤ) : Prop :=\n S.card = 4 ∧\n ∃ a b c d : ℤ,\n a ≠ b ∧\n c ≠ d ∧\n Disjoint ({a, b} : Finset ℤ) ({c, d} : Finset ℤ) ∧\n S = ({a, b} : Finset ℤ) ∪ ({c, d} : Finset ℤ) ∧\n a * b - c * d = 1\n\n/--\n`parts` is a partition of `{1, ..., 4n}` into exactly `n` pairwise disjoint\nspecial sets. The finite set `parts` is a set of finite sets of integers, so\n`parts.card = n` says that there are exactly `n` distinct pieces; the union of\nall pieces is required to be `{1, ..., 4n}`.\n-/\ndef PartitionedBySpecialSets (n : ℕ) (parts : Finset (Finset ℤ)) : Prop :=\n parts.card = n ∧\n (∀ S : Finset ℤ, S ∈ parts → IsSpecial S) ∧\n (∀ S : Finset ℤ, S ∈ parts → ∀ T : Finset ℤ, T ∈ parts → S ≠ T → Disjoint S T) ∧\n parts.biUnion (fun S : Finset ℤ => S) = InitialInterval n\n\n/--\nFor every positive integer `n`, the set `{1, 2, ..., 4n}` cannot be partitioned\ninto `n` pairwise disjoint special sets.\n-/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ¬ ∃ parts : Finset (Finset ℤ),\n PartitionedBySpecialSets n parts\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28841381-bcf6-567b-95e4-92c258690a66", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b9ccfe4d1f6035b1c1a670f3fc202ff0ed8eaf893b138c110b2781a00569807b", "task_path": "tasks/nmp3_28841381-bcf6-567b-95e4-92c258690a66", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28841381-bcf6-567b-95e4-92c258690a66", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_28941e6e-5402-537f-a17b-16c315782ba7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A subgraph $H$ of the complete graph $K_n$ is chosen such that the number of its edges is a multiple of $3$ and the degree of each vertex in $H$ is even. Prove that there exists an assignment of **integer** weights $w_T$ to each triangle $T$ of $K_n$ such that for every edge $e$ of $K_n$,\n-- \\[\n-- \\sum_{\\substack{T\\text{ triangle}\\\\ e\\subseteq T}} w_T \\;=\\;\n-- \\begin{cases}\n-- 1 &\\text{if } e\\in E(H),\\\\[4pt]\n-- 0 &\\text{if } e\\notin E(H).\n-- \\end{cases}\n-- \\]\nimport Mathlib\n\n/-!\n# Triangle weights realizing a subgraph of the complete graph\n\nThis file formalizes the statement of the source problem. The assertion is packaged\nas the proposition `Problem.Target`; it is intentionally not proved here.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- A triangle of the complete graph on `Fin n` is a three-element subset of vertices.\nSince the ambient graph is complete, every such subset spans a triangle. -/\nabbrev Triangle (n : ℕ) : Type :=\n {T : Finset (Fin n) // T.card = 3}\n\n/-- The edge-sum condition for integer weights `w` on the triangles of `K_n`.\nFor every unordered edge `e` of `K_n`, the sum of the weights of all triangles\ncontaining `e` equals `1` when `e` belongs to `H` and `0` otherwise. -/\ndef TriangleEdgeSums (n : ℕ) (H : SimpleGraph (Fin n)) (w : Triangle n → ℤ) : Prop :=\n letI : DecidableRel H.Adj := Classical.decRel H.Adj\n ∀ e : Sym2 (Fin n), e ∈ (SimpleGraph.completeGraph (Fin n)).edgeSet →\n (∑ T : Triangle n, if e.toFinset ⊆ T.1 then w T else 0) =\n (if e ∈ H.edgeSet then (1 : ℤ) else 0)\n\n/-- The hypothesis on `H`: its number of edges is divisible by three, and every\nvertex has even degree in `H`. A subgraph whose vertex set omits some vertices is\nrepresented by the same edge relation on `Fin n`, with the omitted vertices present\nas isolated vertices; their degree is zero and therefore even. -/\ndef Admissible (n : ℕ) (H : SimpleGraph (Fin n)) : Prop :=\n letI : DecidableRel H.Adj := Classical.decRel H.Adj\n 3 ∣ H.edgeFinset.card ∧ ∀ v : Fin n, Even (H.degree v)\n\n/-- There exists an integer weight for every triangle of `K_n` satisfying the\nprescribed sums over the edges of `K_n`. -/\ndef HasTriangleWeights (n : ℕ) (H : SimpleGraph (Fin n)) : Prop :=\n ∃ w : Triangle n → ℤ, TriangleEdgeSums n H w\n\n/-- The asserted statement: for every `n` and every subgraph `H` of the complete\ngraph on `Fin n`, if `H` has a number of edges divisible by three and every vertex\nof `H` has even degree, then there is an integer weighting of the triangles of\n`K_n` whose sums over triangles containing an edge are `1` exactly on the edges of\n`H` and `0` on all other edges of `K_n`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (H : SimpleGraph (Fin n)),\n Admissible n H → HasTriangleWeights n H\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28941e6e-5402-537f-a17b-16c315782ba7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d2a36f4d7ca39983f5997782cc75b9684d27a61e80308bce73cdb13bdc05ab6b", "task_path": "tasks/nmp3_28941e6e-5402-537f-a17b-16c315782ba7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28941e6e-5402-537f-a17b-16c315782ba7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_28c72901-4098-58da-80d3-efa12e4f5938", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\ge0$ satisfy $a+b+c+d=4$. Prove that \n-- \\[\n-- \\frac{a}{1+a^{2}}+\\frac{b}{1+b^{2}}+\\frac{c}{1+c^{2}}+\\frac{d}{1+d^{2}}\n-- +\\frac1{1+a}+\\frac1{1+b}+\\frac1{1+c}+\\frac1{1+d}\\le4\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the four-variable nonnegative inequality\n\nThe problem asks, for nonnegative real numbers `a`, `b`, `c`, and `d` whose sum\nis `4`, to prove the displayed upper bound by `4`. The target below records the\nuniversally quantified assertion without supplying a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c d : ℝ) : ℝ :=\n a / (1 + a ^ 2) + b / (1 + b ^ 2) + c / (1 + c ^ 2) + d / (1 + d ^ 2)\n + 1 / (1 + a) + 1 / (1 + b) + 1 / (1 + c) + 1 / (1 + d)\n\n/-- The assertion of the problem statement. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c → 0 ≤ d →\n a + b + c + d = 4 →\n lhs a b c d ≤ 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28c72901-4098-58da-80d3-efa12e4f5938", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f2dc78223872553aeb9f6ed55d7ee4df886a089b768498148952dda0d43fbfb0", "task_path": "tasks/nmp3_28c72901-4098-58da-80d3-efa12e4f5938", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28c72901-4098-58da-80d3-efa12e4f5938", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_28dbf159-cfb1-5c13-8210-57d78db7fb61", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers \\(a,b,c\\) prove that \n-- \\[\n-- \\frac{3a^{3}+b^{3}+2c^{3}}{3b^{2}c+5c^{2}a}+\\frac{3b^{3}+c^{3}+2a^{3}}{3c^{2}a+5a^{2}b}+\\frac{3c^{3}+a^{3}+2b^{3}}{3a^{2}b+5b^{2}c}\\ge\\frac{9}{4}\\, .\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the positive-real inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe displayed sum of three rational expressions is at least `9 / 4`.\n-/\n\nnamespace Problem\n\n/-- The first summand in the displayed inequality. -/\nnoncomputable def term1 (a b c : ℝ) : ℝ :=\n (3 * a ^ 3 + b ^ 3 + 2 * c ^ 3) /\n (3 * b ^ 2 * c + 5 * c ^ 2 * a)\n\n/-- The second summand in the displayed inequality. -/\nnoncomputable def term2 (a b c : ℝ) : ℝ :=\n (3 * b ^ 3 + c ^ 3 + 2 * a ^ 3) /\n (3 * c ^ 2 * a + 5 * a ^ 2 * b)\n\n/-- The third summand in the displayed inequality. -/\nnoncomputable def term3 (a b c : ℝ) : ℝ :=\n (3 * c ^ 3 + a ^ 3 + 2 * b ^ 3) /\n (3 * a ^ 2 * b + 5 * b ^ 2 * c)\n\n/-- The complete left-hand side of the displayed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n term1 a b c + term2 a b c + term3 a b c\n\n/--\nFor every triple of positive real numbers `a`, `b`, and `c`, the displayed\nleft-hand side is at least the real number `9 / 4`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → (9 : ℝ) / 4 ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28dbf159-cfb1-5c13-8210-57d78db7fb61", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "860b9ddea3a3bcdb624d1cd3e6f12b7d8234be35064f613b45c550be65ec1f0a", "task_path": "tasks/nmp3_28dbf159-cfb1-5c13-8210-57d78db7fb61", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28dbf159-cfb1-5c13-8210-57d78db7fb61", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_28e416c8-3d8a-5dca-bb06-574d9d2387ce", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given positive integers $m$ and $n$, prove that there is a positive integer $c$ such that the numbers $cm$ and $cn$ have the same number of occurrences of each non‑zero digit when written in base ten.\nmodule\n\npublic import Mathlib.Data.Nat.Digits.Defs\n\n/-!\n# Formal statement of the decimal digit-count problem\n\nFor positive integers `m` and `n`, there is a positive integer `c` such that\n`c * m` and `c * n` have the same number of occurrences of every non-zero\ndecimal digit.\n-/\n\npublic section\n\nnamespace Problem\n\n/-- The number of occurrences of the digit `d` in the standard base-ten\nrepresentation of the natural number `n`.\n\n`Nat.digits 10 n` is the little-endian list of decimal digits of `n`, with no\nleading zero, so its list count records exactly the occurrences in the usual\ndecimal writing of `n`. Digits outside the range `1, ..., 9` are normally\nfiltered out by the statements that use this definition. -/\ndef decimalDigitCount (d n : ℕ) : ℕ :=\n (Nat.digits 10 n).countP (fun x => decide (x = d))\n\n/-- Two natural numbers have the same number of occurrences of each non-zero\ndecimal digit if and only if every digit `d` in `{1, ..., 9}` occurs equally\noften in their standard base-ten representations. -/\ndef SameNonzeroDigitCounts (a b : ℕ) : Prop :=\n ∀ d : ℕ, 1 ≤ d → d ≤ 9 → decimalDigitCount d a = decimalDigitCount d b\n\n/-- For every pair of positive natural numbers `m` and `n`, there exists a\npositive natural number `c` such that `c * m` and `c * n` have the same number\nof occurrences of every non-zero decimal digit. -/\ndef Target : Prop :=\n ∀ m n : ℕ, 0 < m → 0 < n →\n ∃ c : ℕ, 0 < c ∧ SameNonzeroDigitCounts (c * m) (c * n)\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28e416c8-3d8a-5dca-bb06-574d9d2387ce", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "552f762682421c270ee6c53a190bd9a78d4901ca7d6af3779138f1b55ce3ae4b", "task_path": "tasks/nmp3_28e416c8-3d8a-5dca-bb06-574d9d2387ce", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28e416c8-3d8a-5dca-bb06-574d9d2387ce", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_28ecb11d-3a1d-50d1-82bf-f8332b90d647", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any positive real numbers \\(a,b,c,d\\),\n-- \n-- \\[\n-- \\frac{a}{\\sqrt{a^{2}+b^{2}}}+\\frac{b}{\\sqrt{b^{2}+c^{2}}}+\\frac{c}{\\sqrt{c^{2}+d^{2}}}+\\frac{d}{\\sqrt{d^{2}+a^{2}}}\\le 3.\n-- \\]\nimport Mathlib\n\n/-!\nFormal statement of the inequality problem for positive real numbers.\n\nThe target is intentionally stated as a `Prop`-valued definition rather than\nas a theorem: this file records the mathematical assertion to be proved.\n-/\n\nnamespace Problem\n\n/-- For all strictly positive real numbers `a`, `b`, `c`, and `d`,\n\n`a / sqrt (a^2 + b^2) + b / sqrt (b^2 + c^2) +\n c / sqrt (c^2 + d^2) + d / sqrt (d^2 + a^2) ≤ 3`. -/\ndef Target : Prop :=\n ∀ (a b c d : ℝ),\n 0 < a → 0 < b → 0 < c → 0 < d →\n a / Real.sqrt (a ^ 2 + b ^ 2) +\n b / Real.sqrt (b ^ 2 + c ^ 2) +\n c / Real.sqrt (c ^ 2 + d ^ 2) +\n d / Real.sqrt (d ^ 2 + a ^ 2) ≤ (3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28ecb11d-3a1d-50d1-82bf-f8332b90d647", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "12b9111dc12e6f78afb78b4da7d3ee0b73abf4da53dcf6506d248ee4245e1b43", "task_path": "tasks/nmp3_28ecb11d-3a1d-50d1-82bf-f8332b90d647", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28ecb11d-3a1d-50d1-82bf-f8332b90d647", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_28f952ca-77a1-5f90-ad69-7b3e7563d6ef", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are positive real numbers such that $abc=1$, prove that \n-- \\[\n-- \\sqrt{\\frac{a}{\\,b+3\\,}}+\\sqrt{\\frac{b}{\\,c+3\\,}}+\\sqrt{\\frac{c}{\\,a+3\\,}}\\ge\\frac{3}{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nIf `a`, `b`, and `c` are positive real numbers with `abc = 1`, then\n`sqrt (a / (b + 3)) + sqrt (b / (c + 3)) + sqrt (c / (a + 3)) ≥ 3 / 2`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a / (b + 3)) +\n Real.sqrt (b / (c + 3)) +\n Real.sqrt (c / (a + 3))\n\n/-- The assertion stated in the problem: for all positive real `a`, `b`, `c`\nwith `abc = 1`, the indicated sum of square roots is at least `3 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n lhs a b c ≥ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28f952ca-77a1-5f90-ad69-7b3e7563d6ef", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "97300b7865fb9de8b4405559a510213b306fc9ebfc6c3db6afdcc18b53627416", "task_path": "tasks/nmp3_28f952ca-77a1-5f90-ad69-7b3e7563d6ef", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "28f952ca-77a1-5f90-ad69-7b3e7563d6ef", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2901b467-e579-547e-8df9-33890cc8cebc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for non‑negative real numbers $a,b,c$ satisfying $ab+bc+ca=3$, the inequality\n-- \\[\n-- 37(a+b+c)\\;\\ge\\;3abc\\;+\\;12\\Bigl(\\sqrt{4a^{2}+5}+\\sqrt{4b^{2}+5}+\\sqrt{4c^{2}+5}\\Bigr)\n-- \\]\n-- holds.\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe problem asks to prove, for all non-negative real numbers `a`, `b`, and `c`\nsatisfying `a*b + b*c + c*a = 3`, the inequality\n\n`37*(a+b+c) ≥ 3*a*b*c + 12*(sqrt(4*a^2+5) + sqrt(4*b^2+5) + sqrt(4*c^2+5))`.\n\nThe declaration below records the proposition to be proved. It is a definition\nreturning a `Prop`, not a proof of that proposition.\n-/\n\nnamespace Problem\n\n/--\nFor all non-negative real numbers `a`, `b`, and `c` with\n`a*b + b*c + c*a = 3`, the stated inequality holds, where `Real.sqrt` denotes\nthe principal non-negative real square root.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a * b + b * c + c * a = 3 →\n 37 * (a + b + c) ≥\n 3 * a * b * c +\n 12 * (Real.sqrt (4 * a ^ 2 + 5) +\n Real.sqrt (4 * b ^ 2 + 5) +\n Real.sqrt (4 * c ^ 2 + 5))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2901b467-e579-547e-8df9-33890cc8cebc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9831b02a58341202a27f4b60cb531801757d97e3676c115c900a1d207a21c665", "task_path": "tasks/nmp3_2901b467-e579-547e-8df9-33890cc8cebc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2901b467-e579-547e-8df9-33890cc8cebc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_29633f08-8b01-5f57-a921-71742fd9525a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a^{4}+b^{4}+c^{4}}{a^{3}b+b^{3}c+c^{3}a}\n-- +\\frac{3(ab+bc+ca)}{(a+b+c)^{2}}\n-- \\;\\ge\\;\n-- \\frac{16\\,(a+b+c)(ab+bc+ca)}{9\\,(a+b)(b+c)(c+a)}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the proposed positive-real inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthe displayed inequality. This file records the statement as a proposition; it\ndoes not contain a proof.\n-/\n\nnamespace Problem\n\n/-- The source assumption that `a`, `b`, and `c` are positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (a ^ 4 + b ^ 4 + c ^ 4) / (a ^ 3 * b + b ^ 3 * c + c ^ 3 * a) +\n (3 * (a * b + b * c + c * a)) / (a + b + c) ^ 2\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n (16 * (a + b + c) * (a * b + b * c + c * a)) /\n (9 * (a + b) * (b + c) * (c + a))\n\n/-- For a positive triple, the displayed inequality holds. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n LHS a b c ≥ RHS a b c\n\n/--\nFor every triple of positive real numbers `a`, `b`, and `c`, the first\nfraction plus the second fraction is at least the third fraction, exactly as\ndisplayed in the source problem.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "29633f08-8b01-5f57-a921-71742fd9525a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dddf1fdb0c3c87b6d481e1cd2be511be554a0b37c443232ff6699379d9922f59", "task_path": "tasks/nmp3_29633f08-8b01-5f57-a921-71742fd9525a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "29633f08-8b01-5f57-a921-71742fd9525a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2984950c-5b6b-580d-871d-8d61c4a2ceec", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A$ be a set of $n\\ge 2$ positive integers and define $f(x)=\\sum_{a\\in A}x^{a}$. Prove that there exists a complex number $z$ with $|z|=1$ such that $|f(z)|=\\sqrt{\\,n-2\\,}$.\nimport Mathlib\n\n/-!\n# Formalization of the unit-circle modulus problem\n\nThe source problem asks, for a finite set `A` of `A.card = n ≥ 2` positive\nintegers, to prove that the polynomial with one monomial `x ^ a` for each\n`a ∈ A` assumes a modulus equal to `sqrt (n - 2)` somewhere on the unit\ncircle.\n-/\n\nnamespace Problem\n\n/-- The polynomial attached to a finite set `A` of natural-number exponents:\n`f(x) = ∑_{a ∈ A} x ^ a`, viewed as a complex-valued function. -/\nnoncomputable def f (A : Finset ℕ) (x : ℂ) : ℂ :=\n ∑ a ∈ A, x ^ a\n\n/--\nThe assertion of the problem.\n\nFor every natural number `n`, every finite set `A` of positive natural-number\nexponents with `A.card = n`, and every assumption `2 ≤ n`, there is a complex\nnumber `z` on the unit circle such that the modulus of\n`f(A, z) = ∑_{a ∈ A} z ^ a` equals `sqrt (n - 2)`.\n-/\nnoncomputable def Target : Prop :=\n ∀ (n : ℕ) (A : Finset ℕ),\n 2 ≤ n →\n A.card = n →\n (∀ a ∈ A, 0 < a) →\n ∃ z : ℂ,\n ‖z‖ = 1 ∧\n ‖f A z‖ = Real.sqrt ((n : ℝ) - 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2984950c-5b6b-580d-871d-8d61c4a2ceec", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "605a9efcd9187a05c7a4de090f4c1a6b38cc6ecf8bcaf8ceb710d6cf2d79ba6a", "task_path": "tasks/nmp3_2984950c-5b6b-580d-871d-8d61c4a2ceec", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2984950c-5b6b-580d-871d-8d61c4a2ceec", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_29da8db1-0bca-573d-bf9f-a84bc6d2df5c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{bc}{a^{2}+3}+\\frac{ca}{b^{2}+3}+\\frac{ab}{c^{2}+3}\\le\\frac{9}{4\\,(ab+bc+ca)}\\,.\n-- \\]\nimport Mathlib.Data.Real.Basic\n\n/-!\n# Formalization of the inequality problem\n\nThe source problem asks to prove a real-variable inequality for positive\n`a`, `b`, and `c` whose sum is `3`. The declaration `Problem.Target`\nbelow records exactly that assertion as a proposition; it is not supplied\nwith a proof here.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real variables: all are\nstrictly positive and their sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = (3 : ℝ)\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n b * c / (a ^ 2 + (3 : ℝ)) +\n c * a / (b ^ 2 + (3 : ℝ)) +\n a * b / (c ^ 2 + (3 : ℝ))\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n (9 : ℝ) / ((4 : ℝ) * (a * b + b * c + c * a))\n\n/-- The inequality asserted for an arbitrary admissible triple. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n leftHandSide a b c ≤ rightHandSide a b c\n\n/-- The complete proposition asserted by the problem: for every triple of\npositive real numbers `a`, `b`, and `c` with `a+b+c=3`, the stated\ninequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "29da8db1-0bca-573d-bf9f-a84bc6d2df5c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f0c791772dd429d951c06d9d59758a192365f342d45d7da73e9920cb45f732a4", "task_path": "tasks/nmp3_29da8db1-0bca-573d-bf9f-a84bc6d2df5c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "29da8db1-0bca-573d-bf9f-a84bc6d2df5c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_29ecfe42-0b06-5af6-8e5a-a73b305db10a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every integer $n$, the number $n^{7}+7$ is never a perfect square.\nimport Mathlib\n\n/-!\n# Formal statement for: `n^7 + 7` is never a perfect square\n\nThe source problem asks to prove that for every integer `n`, the integer\n`n^7 + 7` is not a perfect square. This file only records the proposition to\nbe proved; it deliberately contains no proof of that proposition.\n-/\n\nnamespace Problem\n\n/-- An integer `z` is a perfect square of an integer when there exists an\ninteger `m` whose square is `z`. -/\ndef IntIsPerfectSquare (z : ℤ) : Prop :=\n ∃ m : ℤ, m ^ 2 = z\n\n/-- For every integer `n`, the integer `n ^ 7 + 7` is never a perfect square. -/\ndef Target : Prop :=\n ∀ n : ℤ, ¬ IntIsPerfectSquare (n ^ 7 + 7)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "29ecfe42-0b06-5af6-8e5a-a73b305db10a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6a3bdcfd7f0318a8c25762d7c86ab74e8a6cae6fc3f314f3abc5894172745bb1", "task_path": "tasks/nmp3_29ecfe42-0b06-5af6-8e5a-a73b305db10a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "29ecfe42-0b06-5af6-8e5a-a73b305db10a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2a02a7ca-9b0c-5847-8060-c1a185761937", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=1$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{a\\bigl(a^{2}-b^{2}c^{2}-7abc^{2}\\bigr)}{bc+7ca}\\ge\\frac{1}{72}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwith `a + b + c = 1`, a lower bound for a cyclic sum of three real terms.\n\nThis file records the statement only; it intentionally contains no proof.\n-/\n\nnamespace Problem\n\n/-- One summand of the cyclic sum, with variables in the displayed order. -/\nnoncomputable def cyclicTerm (a b c : ℝ) : ℝ :=\n a * (a ^ 2 - b ^ 2 * c ^ 2 - (7 : ℝ) * a * b * c ^ 2) /\n (b * c + (7 : ℝ) * c * a)\n\n/-- The cyclic sum over `(a,b,c)`, `(b,c,a)`, and `(c,a,b)`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The assertion from the problem: for all positive real `a`, `b`, `c` with\n`a + b + c = 1`, the displayed cyclic sum is at least `1 / 72`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 1 →\n cyclicSum a b c ≥ (1 : ℝ) / 72\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2a02a7ca-9b0c-5847-8060-c1a185761937", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "586f80062461fd0702895ceb012465e4eb2862278100232d131ee025a3d17ffd", "task_path": "tasks/nmp3_2a02a7ca-9b0c-5847-8060-c1a185761937", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2a02a7ca-9b0c-5847-8060-c1a185761937", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2a02d6f9-c79a-56dc-81c7-48b521b287d1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers such that $xyz=1$. Prove that \n-- \n-- \\[\n-- \\frac{x^{3}+1}{\\sqrt{x^{4}+y+z}}+\\frac{y^{3}+1}{\\sqrt{y^{4}+z+x}}+\\frac{z^{3}+1}{\\sqrt{z^{4}+x+y}}\\ge2\\sqrt{xy+yz+zx}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks one to prove an inequality for positive real numbers\n`x`, `y`, and `z` satisfying `x * y * z = 1`.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition in the problem: `x`, `y`, and `z` are positive\nreal numbers whose product is one. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x * y * z = 1\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LHS (x y z : ℝ) : ℝ :=\n (x ^ 3 + 1) / Real.sqrt (x ^ 4 + y + z) +\n (y ^ 3 + 1) / Real.sqrt (y ^ 4 + z + x) +\n (z ^ 3 + 1) / Real.sqrt (z ^ 4 + x + y)\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def RHS (x y z : ℝ) : ℝ :=\n 2 * Real.sqrt (x * y + y * z + z * x)\n\n/-- The inequality asserted in the problem, for arbitrary real `x`, `y`, `z`. -/\nnoncomputable def Inequality (x y z : ℝ) : Prop :=\n LHS x y z ≥ RHS x y z\n\n/-- The full proposition asserted by the problem: for every positive real\ntriple with product one, the stated inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2a02d6f9-c79a-56dc-81c7-48b521b287d1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d4041c8512ac4425b286b2e27111ef0c0378218b3582e54589f2c750ef542c14", "task_path": "tasks/nmp3_2a02d6f9-c79a-56dc-81c7-48b521b287d1", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2a02d6f9-c79a-56dc-81c7-48b521b287d1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2a1c1506-b263-518a-a7ef-c13b5d5b5b30", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle with side lengths $a=BC$, $b=CA$, $c=AB$, and let $X$ be an arbitrary point in the plane. Denote $x=AX$, $y=BX$, $z=CX$. Prove that \n-- $$a y z + b z x + c x y \\;\\ge\\; a b c.$$\nimport Mathlib\n\n/-!\n# Formal statement: a geometric length inequality\n\nThe Euclidean plane is represented by `EuclideanSpace ℝ (Fin 2)`.\nFor points `A`, `B`, `C`, `X`, the side lengths and the distances from\n`X` to the vertices are defined using the ambient Euclidean distance.\n-/\n\nnamespace Problem\n\n/-- A point in the Euclidean plane. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The Euclidean distance between two points, used for every length in the\nproblem. -/\nnoncomputable def SideLength (P Q : Point) : ℝ := dist P Q\n\n/-- The points `A`, `B`, and `C` form a nondegenerate Euclidean triangle. -/\ndef IsTriangle (A B C : Point) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Point)\n\n/-- The displayed algebraic inequality, stated in terms of its six real\nlength variables. -/\ndef LengthInequality (a b c x y z : ℝ) : Prop :=\n a * y * z + b * z * x + c * x * y ≥ a * b * c\n\n/-- The inequality of the problem for four plane points, with the six lengths\nexpanded as Euclidean distances. -/\ndef DistanceInequality (A B C X : Point) : Prop :=\n let a : ℝ := SideLength B C\n let b : ℝ := SideLength C A\n let c : ℝ := SideLength A B\n let x : ℝ := SideLength A X\n let y : ℝ := SideLength B X\n let z : ℝ := SideLength C X\n LengthInequality a b c x y z\n\n/-- The complete formal statement: for every triangle `ABC` in the Euclidean\nplane and every point `X` in that plane, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ (A B C : Point), IsTriangle A B C →\n ∀ X : Point, DistanceInequality A B C X\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2a1c1506-b263-518a-a7ef-c13b5d5b5b30", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7d7fc516592ae2a4b8359b889136e0163855112ced571e9d3e40b6a405b933bb", "task_path": "tasks/nmp3_2a1c1506-b263-518a-a7ef-c13b5d5b5b30", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2a1c1506-b263-518a-a7ef-c13b5d5b5b30", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2a2d875f-1f40-5f8f-a270-b1d056bef0c7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find (prove the existence of) a convergent sequence $(z_n)_{n\\ge1}$ in $\\mathbb{R}^2$ such that the open disks with center $z_n$ and radius $1/n$ are pairwise disjoint.\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe problem asks for a convergent sequence in the Euclidean plane whose open\nballs, with radii `1 / n`, are pairwise disjoint. The statement is recorded as\nan existence proposition; no proof of it is supplied here.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- Positive natural numbers, used to index sequences by `n ≥ 1`. -/\nabbrev PositiveNat : Type := { n : ℕ // 1 ≤ n }\n\n/-- The Euclidean plane `ℝ²`, represented as `EuclideanSpace ℝ (Fin 2)`. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The radius of the open disk at index `n`, namely the real number `1 / n`. -/\ndef radius (n : PositiveNat) : ℝ := (1 : ℝ) / ((n : ℕ) : ℝ)\n\n/-- The open disk (open metric ball) with center `z` and radius `r`. -/\ndef openDisk (z : Plane) (r : ℝ) : Set Plane :=\n { w : Plane | dist w z < r }\n\n/-- A sequence of points in the plane is convergent if it has a limit in the plane. -/\ndef ConvergentSequence (z : PositiveNat → Plane) : Prop :=\n ∃ L : Plane, Filter.Tendsto z Filter.atTop (nhds L)\n\n/-- The open disks centered at `z n` with radius `1 / n` are pairwise disjoint. -/\ndef PairwiseDisjointDisks (z : PositiveNat → Plane) : Prop :=\n Pairwise fun m n : PositiveNat =>\n Disjoint (openDisk (z m) (radius m)) (openDisk (z n) (radius n))\n\n/-- The sequence is admissible when it converges and its associated open disks are\npairwise disjoint. -/\ndef AdmissibleSequence (z : PositiveNat → Plane) : Prop :=\n ConvergentSequence z ∧ PairwiseDisjointDisks z\n\n/-- There exists a convergent sequence `(z_n)_{n ≥ 1}` in `ℝ²` such that the open\ndisks with center `z_n` and radius `1 / n` are pairwise disjoint. -/\ndef Target : Prop :=\n ∃ z : PositiveNat → Plane, AdmissibleSequence z\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2a2d875f-1f40-5f8f-a270-b1d056bef0c7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5a3809c11969bce9b3f76f4cefcad7425cb25c35f14ec1550872090446b93726", "task_path": "tasks/nmp3_2a2d875f-1f40-5f8f-a270-b1d056bef0c7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2a2d875f-1f40-5f8f-a270-b1d056bef0c7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2a5c9c37-b7bb-56a2-9563-6abe6e498f3e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are positive real numbers, prove that \n-- \\[\n-- \\frac{a^{2}+2bc}{b^{2}+c^{2}}+\\frac{b^{2}+2ac}{c^{2}+a^{2}}+\\frac{c^{2}+2ab}{a^{2}+b^{2}}\\ge 3.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable real inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthat the cyclic sum of three explicitly given rational expressions is at least\n`3`. The target below records that proof obligation as a proposition-valued\ndefinition; no proof of it is supplied here.\n-/\n\nnamespace Problem\n\n/-- The first summand\n`(a ^ 2 + 2 * b * c) / (b ^ 2 + c ^ 2)` of the cyclic sum. -/\nnoncomputable def firstTerm (a b c : ℝ) : ℝ :=\n (a ^ 2 + 2 * b * c) / (b ^ 2 + c ^ 2)\n\n/-- The second summand\n`(b ^ 2 + 2 * a * c) / (c ^ 2 + a ^ 2)` of the cyclic sum. -/\nnoncomputable def secondTerm (a b c : ℝ) : ℝ :=\n (b ^ 2 + 2 * a * c) / (c ^ 2 + a ^ 2)\n\n/-- The third summand\n`(c ^ 2 + 2 * a * b) / (a ^ 2 + b ^ 2)` of the cyclic sum. -/\nnoncomputable def thirdTerm (a b c : ℝ) : ℝ :=\n (c ^ 2 + 2 * a * b) / (a ^ 2 + b ^ 2)\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n firstTerm a b c + secondTerm a b c + thirdTerm a b c\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the cyclic sum\n`(a² + 2bc)/(b² + c²) + (b² + 2ac)/(c² + a²) + (c² + 2ab)/(a² + b²)`\nis at least `3`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2a5c9c37-b7bb-56a2-9563-6abe6e498f3e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "011916d1ee67500d01f95d9be8a91258a2126bb0396ca84f27ba3b11c75d0e66", "task_path": "tasks/nmp3_2a5c9c37-b7bb-56a2-9563-6abe6e498f3e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2a5c9c37-b7bb-56a2-9563-6abe6e498f3e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2a964c48-6a79-5ca1-a1ab-060e24726d52", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$. Prove that \n-- \\[\n-- (1+a+b+c)(1+ab+ac+bc)\\ge4\\sqrt{2(a+bc)(b+ac)(c+ab)}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissible triples are exactly the nonnegative real triples requested\nby the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The left-hand side of the displayed inequality. -/\ndef leftSide (a b c : ℝ) : ℝ :=\n (1 + a + b + c) * (1 + a * b + a * c + b * c)\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def rightSide (a b c : ℝ) : ℝ :=\n 4 * Real.sqrt (2 * (a + b * c) * (b + a * c) * (c + a * b))\n\n/-- The asserted inequality for a fixed nonnegative triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n leftSide a b c ≥ rightSide a b c\n\n/-- The full statement to be proved: for every nonnegative real triple `(a,b,c)`,\nthe displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2a964c48-6a79-5ca1-a1ab-060e24726d52", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ff9b85acbd54666763117d5ff71eb24cf72fc7b922f16bbe9a579054c884150d", "task_path": "tasks/nmp3_2a964c48-6a79-5ca1-a1ab-060e24726d52", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2a964c48-6a79-5ca1-a1ab-060e24726d52", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2ac16889-1096-521f-8aa0-596566f87b9c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given positive real numbers $a,b,c$ satisfying $a+b+c=3abc$, prove that \n-- \\[\n-- \\frac{1}{a^2+b^2}+\\frac{1}{b^2+c^2}+\\frac{1}{c^2+a^2}+\\frac{3}{2}\\ge 2\\Bigg(\\frac{1}{a^2+bc}+\\frac{1}{b^2+ca}+\\frac{1}{c^2+ab}\\Bigg).\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The three strict positivity assumptions on the variables. -/\ndef PositivityCondition (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The constraint `a + b + c = 3abc` from the problem. -/\ndef SumProductConstraint (a b c : ℝ) : Prop :=\n a + b + c = 3 * a * b * c\n\n/-- Admissibility of a triple: positive real entries satisfying the constraint. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositivityCondition a b c ∧ SumProductConstraint a b c\n\n/-- The inequality asserted in the problem for real `a`, `b`, and `c`.\nAll occurrences of `/` are real division; all squares are natural powers. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (1 : ℝ) / (a ^ 2 + b ^ 2) +\n (1 : ℝ) / (b ^ 2 + c ^ 2) +\n (1 : ℝ) / (c ^ 2 + a ^ 2) + (3 : ℝ) / 2\n ≥ (2 : ℝ) * ((1 : ℝ) / (a ^ 2 + b * c) +\n (1 : ℝ) / (b ^ 2 + c * a) +\n (1 : ℝ) / (c ^ 2 + a * b))\n\n/-- The full formal target. The universally quantified real triple is required\nto satisfy precisely the positivity and sum-product hypotheses, and then must\nsatisfy the displayed inequality. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ac16889-1096-521f-8aa0-596566f87b9c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f8bfa32ffcbbf7afc3825d12323e9d0d98cde75d09d3801856c5af20863956ca", "task_path": "tasks/nmp3_2ac16889-1096-521f-8aa0-596566f87b9c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ac16889-1096-521f-8aa0-596566f87b9c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2ac84e8d-d95d-5eb9-be62-7589f46de158", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\mathcal F$ be a family of subsets of a given finite set $X$ such that $\\mathcal F$ is closed under taking subsets; i.e. for every $E\\in\\mathcal F$ and every $E'\\subseteq E$ we have $E'\\in\\mathcal F$. Prove that there exists a permutation (bijection) $\\sigma:\\mathcal F\\to\\mathcal F$ satisfying \n-- \\[\n-- \\sigma(E)\\cap E=\\varnothing\\qquad\\text{for all }E\\in\\mathcal F\\,.\n-- \\]\nimport Mathlib\n\nuniverse u\n\nnamespace Problem\n\n/-- A family `F` of subsets of `X` is downward closed under taking subsets. -/\ndef IsDownwardClosed {X : Type u} (F : Set (Set X)) : Prop :=\n ∀ E : Set X, E ∈ F → ∀ E' : Set X, E' ⊆ E → E' ∈ F\n\n/--\nFor a finite set `X` and a downward-closed family `F` of subsets of `X`,\nthere is a permutation of the elements of `F` which sends every member of `F`\nto a disjoint member of `F`.\n-/\ndef Target : Prop :=\n ∀ (X : Type u) [Fintype X] (F : Set (Set X)),\n IsDownwardClosed F →\n ∃ σ : Equiv.Perm {A : Set X // A ∈ F},\n ∀ E : {A : Set X // A ∈ F},\n (((σ E : {A : Set X // A ∈ F}) : Set X) ∩\n ((E : {A : Set X // A ∈ F}) : Set X)) = ∅\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ac84e8d-d95d-5eb9-be62-7589f46de158", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e44e233a4b0d988ca7e84e6c81c237673516b009d72f750d32fb00ebeef0f5a6", "task_path": "tasks/nmp3_2ac84e8d-d95d-5eb9-be62-7589f46de158", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ac84e8d-d95d-5eb9-be62-7589f46de158", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2b091d74-58f2-527a-a603-b080d11ffe81", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $abc=1$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{1}{a\\,(a+b)}\\ge \\frac32\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the cyclic inequality problem\n\nThe source problem asks to prove, for positive real numbers `a b c` with\n`abc = 1`, that the cyclic sum\n`1 / (a * (a + b)) + 1 / (b * (b + c)) + 1 / (c * (c + a))`\nis at least `3 / 2`.\n\nThis file only records the mathematical statement. It does not assert a\nproof.\n-/\n\nnamespace Problem\n\n/-- One summand in the cyclic sum, indexed by consecutive variables `x` and `y`. -/\nnoncomputable def CyclicSummand (x y : ℝ) : ℝ :=\n 1 / (x * (x + y))\n\n/-- The cyclic sum from the statement:\n`Σ_cyc 1 / (a * (a + b))`, with the cyclic order `a → b → c → a`. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n CyclicSummand a b + CyclicSummand b c + CyclicSummand c a\n\n/-- The hypotheses of the problem: `a`, `b`, and `c` are positive reals and\ntheir product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The proposition to be proved in the source problem. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c →\n CyclicSum a b c ≥ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2b091d74-58f2-527a-a603-b080d11ffe81", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1907c6dd54fc0653fd70c6b9e8eea79409eb74da9ba8316aa346d742bac81da7", "task_path": "tasks/nmp3_2b091d74-58f2-527a-a603-b080d11ffe81", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2b091d74-58f2-527a-a603-b080d11ffe81", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2b59f05c-084b-55bb-b41f-746ca4a7d546", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a^3+abc+b^3}{c^3+abc}}+\\sqrt{\\frac{b^3+abc+c^3}{a^3+abc}}+\\sqrt{\\frac{c^3+abc+a^3}{b^3+abc}}\\ge 3\\sqrt{\\frac32}\\,.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement of the radical inequality\n\nThe problem asks, for all positive real numbers `a`, `b`, and `c`, to prove\nthe stated lower bound for a sum of three real square roots.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n Real.sqrt ((a ^ 3 + a * b * c + b ^ 3) / (c ^ 3 + a * b * c))\n + Real.sqrt ((b ^ 3 + a * b * c + c ^ 3) / (a ^ 3 + a * b * c))\n + Real.sqrt ((c ^ 3 + a * b * c + a ^ 3) / (b ^ 3 + a * b * c))\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def RHS : ℝ :=\n 3 * Real.sqrt ((3 : ℝ) / 2)\n\n/-- The full proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → LHS a b c ≥ RHS\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2b59f05c-084b-55bb-b41f-746ca4a7d546", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4b9f0038b83d0fb5f87a90046b43b5162e067a8af1e0497aac8f6da07c401ed6", "task_path": "tasks/nmp3_2b59f05c-084b-55bb-b41f-746ca4a7d546", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2b59f05c-084b-55bb-b41f-746ca4a7d546", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2b9efab1-f201-51c5-8721-66b4417fa893", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle. Suppose there exists an interior point $F$ such that \n-- \\[\n-- \\angle AFB=\\angle BFC=\\angle CFA.\n-- \\] \n-- Let $D$ be the intersection of $BF$ with side $AC$ and let $E$ be the intersection of $CF$ with side $AB$. Prove that \n-- \\[\n-- AB+AC\\ge 4\\,DE.\n-- \\]\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Basic\n\n/-!\n# Formalization of the planar geometry statement\n\nThis file records the exact proposition of the problem, but does not prove it.\nThe ambient plane is the real Euclidean vector space of dimension two.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane used for all points in the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Three points are collinear when the third lies on the affine line through\nthe first two. -/\ndef Collinear (A B C : Plane) : Prop :=\n ∃ t : ℝ, C - A = t • (B - A)\n\n/-- A nondegenerate triangle: its vertices are pairwise distinct and are not\ncollinear. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n A ≠ B ∧ B ≠ C ∧ C ≠ A ∧ ¬ Collinear A B C\n\n/-- `F` is a strict interior point of the triangle `ABC`, expressed using\npositive barycentric coordinates summing to one. -/\ndef StrictlyInsideTriangle (A B C F : Plane) : Prop :=\n ∃ x y z : ℝ,\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = 1 ∧\n F = x • A + y • B + z • C\n\n/-- The closed segment with endpoints `P` and `Q`. -/\ndef InSegment (P Q X : Plane) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ X = (1 - t) • P + t • Q\n\n/-- `X` is the (not-yet-asserted unique) intersection of the affine line\nthrough `P` and `Q` with the closed segment with endpoints `U` and `V`. -/\ndef IsLineSegmentIntersection\n (P Q U V X : Plane) : Prop :=\n Collinear P Q X ∧ InSegment U V X\n\n/-- `X` is the unique intersection of the affine line through `P` and `Q`\nwith the closed segment with endpoints `U` and `V`. -/\ndef IsUniqueLineSegmentIntersection\n (P Q U V X : Plane) : Prop :=\n IsLineSegmentIntersection P Q U V X ∧\n ∀ Y : Plane, IsLineSegmentIntersection P Q U V Y → Y = X\n\n/-- The three angles at `F` prescribed in the problem are equal. -/\ndef AngleCondition (A B C F : Plane) : Prop :=\n InnerProductGeometry.angle (A - F) (B - F) =\n InnerProductGeometry.angle (B - F) (C - F) ∧\n InnerProductGeometry.angle (B - F) (C - F) =\n InnerProductGeometry.angle (C - F) (A - F)\n\n/-- The existential hypothesis in the problem: there is a strict interior\npoint of the triangle at which the three prescribed angles are equal. -/\ndef HasEqualAngleInteriorPoint (A B C : Plane) : Prop :=\n ∃ F : Plane,\n StrictlyInsideTriangle A B C F ∧ AngleCondition A B C F\n\n/-- The data of the problem for a chosen interior point `F`: the strict\ninterior condition, the angle condition, and the intersections `D` and `E`\nof the corresponding lines with the opposite sides. -/\ndef IsConfiguration (A B C F D E : Plane) : Prop :=\n StrictlyInsideTriangle A B C F ∧\n AngleCondition A B C F ∧\n IsUniqueLineSegmentIntersection B F A C D ∧\n IsUniqueLineSegmentIntersection C F A B E\n\n/-- The complete proposition to be proved.\n\nFor every triangle `ABC`, if there exists a strict interior point at which the\nthree prescribed angles are equal, then for any such chosen point `F`, and the\nintersections `D` of line `BF` with side `AC` and `E` of line `CF` with side\n`AB`, one has `AB + AC ≥ 4 * DE`. -/\ndef Target : Prop :=\n ∀ A B C : Plane,\n IsTriangle A B C →\n HasEqualAngleInteriorPoint A B C →\n ∀ F D E : Plane,\n IsConfiguration A B C F D E →\n dist A B + dist A C ≥ 4 * dist D E\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2b9efab1-f201-51c5-8721-66b4417fa893", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4e177adee2f6afedbd074642344cb74cf3053ae188efbf3b23a477a89fd38970", "task_path": "tasks/nmp3_2b9efab1-f201-51c5-8721-66b4417fa893", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2b9efab1-f201-51c5-8721-66b4417fa893", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2be613bc-a41f-5261-8afc-5e0b11b8c7fb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive numbers with $a+b+c=3$. Prove that \n-- \\[\n-- \\sqrt[3]{a}+\\sqrt[3]{b}+\\sqrt[3]{c}\\ge ab+bc+ca\\,.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formal statement for the positive-variable cube-root inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose sum is `3`, that the sum of their cube roots is at least\n`ab + bc + ca`.\n\nMathlib does not provide a dedicated real cube-root function. On positive\nreals the cube root is represented by the real power `x ^ (1 / 3 : ℝ)`;\nthe positivity hypotheses below ensure that this is the intended branch of\nthe real power operation.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem:\n\nFor all positive real numbers `a`, `b`, and `c` with `a + b + c = 3`,\nthe sum of their real cube roots is at least `a * b + b * c + c * a`.\n\nThe real cube root is expressed as `Real.rpow x (1 / 3 : ℝ)`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 3 →\n Real.rpow a (1 / 3 : ℝ) +\n Real.rpow b (1 / 3 : ℝ) +\n Real.rpow c (1 / 3 : ℝ) ≥\n a * b + b * c + c * a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2be613bc-a41f-5261-8afc-5e0b11b8c7fb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0fe96f874c77c8d2a5b74d97bf2039f0617b57b16b788c356ba13886aa3f6246", "task_path": "tasks/nmp3_2be613bc-a41f-5261-8afc-5e0b11b8c7fb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2be613bc-a41f-5261-8afc-5e0b11b8c7fb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2c142f38-ac2b-5e51-9f63-0aa8d974c54c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The fibboican sequence $(a_n)_{n\\ge1}$ is defined by $a_1=a_2=1$ and for each integer $k\\ge3$ \n-- \\[\n-- \\begin{cases}\n-- a_k = a_{k-1}+a_{k-2}, &\\text{if }k\\text{ is odd},\\\\[4pt]\n-- \\displaystyle\\frac1{a_k}= \\frac1{a_{k-1}}+\\frac1{a_{k-2}}, &\\text{if }k\\text{ is even}.\n-- \\end{cases}\n-- \\] \n-- Prove that for every integer $m\\ge1$, when $a_m$ is written in lowest terms $a_m=\\frac{p}{q}$ with $\\gcd(p,q)=1$, the numerator $p$ is a power of $2$ (i.e. $p=2^t$ for some $t\\ge0$).\nimport Mathlib\n\n/-!\n# Formal statement of the fibboican-sequence problem\n\nThe original problem defines a rational sequence by a pair of initial values and\nan odd/even recurrence, and asks for a property of the numerator of each term in\nlowest terms. The declarations below formalize the sequence through its defining\npredicate and then state the requested assertion as `Problem.Target`.\n-/\n\nnamespace Problem\n\n/-- The two initial values of the fibboican sequence. -/\ndef HasFibboicanInitialValues (a : ℤ → ℚ) : Prop :=\n a (1 : ℤ) = (1 : ℚ) ∧ a (2 : ℤ) = (1 : ℚ)\n\n/-- The additive recurrence clause for odd integers `k ≥ 3`. -/\ndef HasFibboicanOddStep (a : ℤ → ℚ) : Prop :=\n ∀ k : ℤ, (3 : ℤ) ≤ k → Odd k →\n a k = a (k - 1) + a (k - 2)\n\n/-- The reciprocal recurrence clause for even integers `k ≥ 3`. -/\ndef HasFibboicanEvenStep (a : ℤ → ℚ) : Prop :=\n ∀ k : ℤ, (3 : ℤ) ≤ k → Even k →\n (1 : ℚ) / a k =\n (1 : ℚ) / a (k - 1) + (1 : ℚ) / a (k - 2)\n\n/-- A sequence satisfying the two initial conditions and both recurrence\nclauses of the fibboican sequence. Since the original sequence is indexed by\nintegers `n ≥ 1`, values at nonpositive indices are deliberately unconstrained;\nthey are never used by the recurrence or by the target. -/\ndef IsFibboicanSequence (a : ℤ → ℚ) : Prop :=\n HasFibboicanInitialValues a ∧\n HasFibboicanOddStep a ∧\n HasFibboicanEvenStep a\n\n/-- `x` is written as `p / q` in lowest terms, with positive denominator. -/\ndef IsFractionInLowestTerms (x : ℚ) (p q : ℤ) : Prop :=\n (0 : ℤ) < q ∧ x = (p : ℚ) / (q : ℚ) ∧ Int.gcd p q = 1\n\n/-- Main formal target: for every integer `m ≥ 1`, whenever the fibboican term\n`a_m` is written in lowest terms as `p / q`, the numerator `p` is a power of two\n`2 ^ t` for some nonnegative integer exponent `t`. -/\ndef Target : Prop :=\n ∀ (a : ℤ → ℚ),\n IsFibboicanSequence a →\n ∀ (m : ℤ), (1 : ℤ) ≤ m →\n ∀ (p q : ℤ),\n IsFractionInLowestTerms (a m) p q →\n ∃ t : ℕ, p = (2 : ℤ) ^ t\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c142f38-ac2b-5e51-9f63-0aa8d974c54c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "67524843b5f78207cdce43f001a398aa248c4dac66d1142c0a594bd848700364", "task_path": "tasks/nmp3_2c142f38-ac2b-5e51-9f63-0aa8d974c54c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c142f38-ac2b-5e51-9f63-0aa8d974c54c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2c1c8847-e98c-5f64-8fdf-7c92f6de4526", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(x,\\;y,\\;z\\) be positive real numbers such that \n-- \\[\n-- x^4y^4+y^4z^4+z^4x^4\\;\\ge\\;3.\n-- \\] \n-- Prove that \n-- \\[\n-- x^3+y^3+z^3\\;\\ge\\;3.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a real-variable inequality\n\nThis module states (but does not prove) the assertion in `problem.md`.\n-/\n\nnamespace Problem\n\n/-- The complete universal implication stated in the problem.\n\nFor all positive real numbers `x`, `y`, and `z`, if\n`x^4 * y^4 + y^4 * z^4 + z^4 * x^4 ≥ 3`, then\n`x^3 + y^3 + z^3 ≥ 3`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n 3 ≤ x ^ 4 * y ^ 4 + y ^ 4 * z ^ 4 + z ^ 4 * x ^ 4 →\n 3 ≤ x ^ 3 + y ^ 3 + z ^ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c1c8847-e98c-5f64-8fdf-7c92f6de4526", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "11cc9a485cd73a130fe1e789ec48163fdab397204fabd2d61325c6f9d22d2e82", "task_path": "tasks/nmp3_2c1c8847-e98c-5f64-8fdf-7c92f6de4526", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c1c8847-e98c-5f64-8fdf-7c92f6de4526", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2c25dccf-8bba-50df-9a75-f7ac14100fc2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $d(n)$ denote the number of positive divisors of a positive integer $n$. Prove that for any given odd integer $k$ there exists an increasing arithmetic progression of positive integers $(a_1,a_2,\\dots,a_{2019})$ such that \n-- \\[\n-- \\gcd\\!\\bigl(k,\\;d(a_1)d(a_2)\\cdots d(a_{2019})\\bigr)=1.\n-- \\]\nimport Mathlib.Data.Int.GCD\nimport Mathlib.NumberTheory.Divisors\n\n/-!\n# Formal statement for the divisor-count arithmetic-progression problem\n\nThe source problem asks, for every odd integer `k`, for the existence of an\nincreasing arithmetic progression of `2019` positive integers whose divisor\ncounts have product coprime to `k`.\n\nThis file only states the assertion; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The number of positive divisors of a positive integer `n`.\n\nMathlib's `Nat.divisors n` is the finite set of positive divisors of `n`\n(and is empty by convention at `n = 0`); the sequence in the target has\npositive terms, so this is exactly the divisor-count function from the\nproblem on its intended domain. -/\ndef divisorCount (n : ℕ) : ℕ :=\n (Nat.divisors n).card\n\n/-- An increasing arithmetic progression of `2019` positive integers.\n\nThe sequence `a : Fin 2019 → ℕ` is indexed from `0` to `2018`, so `a i`\nrepresents the term numbered `i + 1` in the problem. The progression has a\npositive first term `first` and a strictly positive common difference\n`commonDifference`. The final conjunct also states explicitly that every\nterm is a positive integer. -/\ndef IsIncreasingArithmeticProgressionOfPositiveIntegers\n (a : Fin 2019 → ℕ) : Prop :=\n ∃ first commonDifference : ℕ,\n 0 < first ∧\n 0 < commonDifference ∧\n (∀ i : Fin 2019,\n a i = first + (i : ℕ) * commonDifference) ∧\n ∀ i : Fin 2019, 0 < a i\n\n/-- The product `d(a_1) d(a_2) ⋯ d(a_2019)` of the divisor counts of the\nterms of a finite sequence. -/\ndef divisorCountProduct (a : Fin 2019 → ℕ) : ℕ :=\n ∏ i : Fin 2019, divisorCount (a i)\n\n/-- Admissibility of a proposed progression for a fixed odd integer `k`.\n\nIt consists of the progression conditions together with the required gcd\ncondition `gcd(k, d(a_1) ⋯ d(a_2019)) = 1`. The integer gcd is Mathlib's\n`Int.gcd k (product : ℤ)`, whose value is a natural number and which handles\nnegative values of `k` by taking absolute values. -/\ndef Admissible (k : ℤ) (a : Fin 2019 → ℕ) : Prop :=\n IsIncreasingArithmeticProgressionOfPositiveIntegers a ∧\n Int.gcd k (divisorCountProduct a : ℤ) = 1\n\n/-- The full assertion of the problem: for every odd integer `k`, there\nexists an increasing arithmetic progression `(a_1, ..., a_2019)` of positive\nintegers such that the product of their divisor counts is coprime to `k`. -/\ndef Target : Prop :=\n ∀ k : ℤ, Odd k → ∃ a : Fin 2019 → ℕ, Admissible k a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c25dccf-8bba-50df-9a75-f7ac14100fc2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "eb929d1497ccd563818d873d277f8a4c5c4681835b9538559fce543545ca9edf", "task_path": "tasks/nmp3_2c25dccf-8bba-50df-9a75-f7ac14100fc2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c25dccf-8bba-50df-9a75-f7ac14100fc2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2c340c1b-f98d-58fa-afc8-6081ce099473", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c,d,e$ are positive real numbers such that $a+b+c+d+e=5$, prove that \n-- \\[\n-- \\frac{1}{a}+\\frac{1}{b}+\\frac{1}{c}+\\frac{1}{d}+\\frac{1}{e}+\\frac{20}{a^{2}+b^{2}+c^{2}+d^{2}+e^{2}}\\ge 9.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the five-variable reciprocal-square inequality\n\nThe source problem asks us to prove that, for positive real numbers\n`a, b, c, d, e` whose sum is `5`, the quantity\n`1/a + 1/b + 1/c + 1/d + 1/e + 20/(a^2 + b^2 + c^2 + d^2 + e^2)`\nis at least `9`.\n\nThis file records the statement only; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissible values of the five variables in the source problem:\nthey are positive real numbers with sum exactly `5`. -/\ndef Admissible (a b c d e : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧ 0 < e ∧\n a + b + c + d + e = 5\n\n/-- The sum of the five reciprocals appearing on the left-hand side. -/\nnoncomputable def reciprocalSum (a b c d e : ℝ) : ℝ :=\n 1 / a + 1 / b + 1 / c + 1 / d + 1 / e\n\n/-- The sum of the five squares appearing under the final fraction. -/\nnoncomputable def squareSum (a b c d e : ℝ) : ℝ :=\n a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 + e ^ 2\n\n/-- The full left-hand side of the asserted inequality. -/\nnoncomputable def leftHandSide (a b c d e : ℝ) : ℝ :=\n reciprocalSum a b c d e + 20 / squareSum a b c d e\n\n/-- The complete universally quantified statement of the source problem:\nfor every tuple of positive real numbers with sum `5`, the displayed\nleft-hand side is at least `9`. -/\ndef Target : Prop :=\n ∀ a b c d e : ℝ,\n Admissible a b c d e → leftHandSide a b c d e ≥ 9\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c340c1b-f98d-58fa-afc8-6081ce099473", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e5bb8480623563ec7b3809fd93108af1b9ed81be7d348b205eb1edb8f70fc33d", "task_path": "tasks/nmp3_2c340c1b-f98d-58fa-afc8-6081ce099473", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c340c1b-f98d-58fa-afc8-6081ce099473", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2c469dcf-43a9-5b9e-b15f-3d462e5eac2d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$, prove that\n-- \\[\n-- \\frac{1}{a(a+b)}+\\frac{1}{b(b+c)}+\\frac{1}{c(c+a)}\\ge\\frac{27}{2\\,(a+b+c)^2}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three variables range over positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the stated inequality. -/\nnoncomputable def leftSide (a b c : ℝ) : ℝ :=\n 1 / (a * (a + b)) + 1 / (b * (b + c)) + 1 / (c * (c + a))\n\n/-- The right-hand side of the stated inequality. -/\nnoncomputable def rightSide (a b c : ℝ) : ℝ :=\n (27 : ℝ) / (2 * (a + b + c) ^ 2)\n\n/-- The stated non-strict inequality for a fixed triple of real numbers. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n leftSide a b c ≥ rightSide a b c\n\n/-- For all positive real numbers `a`, `b`, and `c`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c469dcf-43a9-5b9e-b15f-3d462e5eac2d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6c41fd837db6f1830d2a9f175d87de3ac0160b6309b7417c26411c341ab0c885", "task_path": "tasks/nmp3_2c469dcf-43a9-5b9e-b15f-3d462e5eac2d", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c469dcf-43a9-5b9e-b15f-3d462e5eac2d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2c64f34e-43da-5c83-bed1-d4b53ae78ebf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given positive real numbers $a,b,c$ that are the side lengths of a triangle (i.e. $a,b,c>0$ and $a+b>c$, $b+c>a$, $c+a>b$), prove that \n-- \\[\n-- a^{2}+b^{2}+c^{2}+a+b+c\\;\\ge\\;3\\sqrt[3]{\\,abc\\bigl(a^{2}+b^{2}+c^{2}+abc+1\\bigr)+a^{2}b^{2}+b^{2}c^{2}+c^{2}a^{2}\\,}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThis file states the problem: for positive real numbers `a`, `b`, and `c` that\nsatisfy the three strict triangle inequalities, the displayed inequality holds.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The three numbers `a`, `b`, and `c` are positive and are the side lengths of\na (nondegenerate) triangle. The side-length condition is stated by the three\nstrict triangle inequalities, exactly as in the problem. -/\ndef IsTriangleSideLength (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The left-hand side\n`a ^ 2 + b ^ 2 + c ^ 2 + a + b + c` of the displayed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a ^ (2 : ℕ) + b ^ (2 : ℕ) + c ^ (2 : ℕ) + a + b + c\n\n/-- The expression under the cube root:\n`abc (a^2 + b^2 + c^2 + abc + 1) + a^2 b^2 + b^2 c^2 + c^2 a^2`. -/\ndef radicand (a b c : ℝ) : ℝ :=\n a * b * c * (a ^ (2 : ℕ) + b ^ (2 : ℕ) + c ^ (2 : ℕ) + a * b * c + 1)\n + a ^ (2 : ℕ) * b ^ (2 : ℕ)\n + b ^ (2 : ℕ) * c ^ (2 : ℕ)\n + c ^ (2 : ℕ) * a ^ (2 : ℕ)\n\n/-- The real cube root. On nonnegative inputs this is the nonnegative real\nnumber whose cube is the input; for negative inputs the sign is made explicit. -/\ndef realCubeRoot (x : ℝ) : ℝ :=\n if 0 ≤ x then x ^ ((1 : ℝ) / 3) else -((-x) ^ ((1 : ℝ) / 3))\n\n/-- The right-hand side `3 * cbrt (radicand a b c)`. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (3 : ℝ) * realCubeRoot (radicand a b c)\n\n/-- The complete proposition asserted by the problem: for all positive real\nnumbers `a`, `b`, and `c` satisfying the three strict triangle inequalities,\n`lhs a b c ≥ rhs a b c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsTriangleSideLength a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c64f34e-43da-5c83-bed1-d4b53ae78ebf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2be3122faa296c375edcaaf8522fbf49d4f387c3ecd495f29a18b5206e68ea29", "task_path": "tasks/nmp3_2c64f34e-43da-5c83-bed1-d4b53ae78ebf", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c64f34e-43da-5c83-bed1-d4b53ae78ebf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2c97f6d2-2b1e-5d2e-8e21-877b70ba07e0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>1$ be an integer. Call an integer $a$ **beautiful** if the remainder of $a^2$ upon division by $n$ is odd. Prove that any run of consecutive beautiful numbers has length at most $1+\\lfloor\\sqrt{3n}\\rfloor\\,.\nimport Mathlib\n\n/-!\n# Formal statement of a bound on runs of \"beautiful\" integers\n\nAn integer `a` is beautiful for a modulus `n` when the canonical nonnegative\nremainder of `a ^ 2` modulo `n` is odd. A beautiful run is a nonempty finite\nblock of consecutive integers, all of which are beautiful. The target says\nthat every such run has length at most `1 + floor (sqrt (3 * n))`.\n-/\n\nnamespace Problem\n\n/-- The canonical integer remainder of `a ^ 2` upon division by `n` is odd. -/\ndef Beautiful (n a : ℤ) : Prop :=\n Odd (Int.emod (a ^ 2) n)\n\n/-- The numerical bound `1 + floor(sqrt(3n))`, with the floor represented in\nthe integers, exactly as in the source formula. -/\nnoncomputable def RunLengthBound (n : ℤ) : ℤ :=\n 1 + Int.floor (Real.sqrt ((3 : ℝ) * (n : ℝ)))\n\n/-- A nonempty run of `length` consecutive beautiful numbers beginning at\n`start`, namely `start, start + 1, ..., start + length - 1`. -/\ndef IsBeautifulRun (n start : ℤ) (length : ℕ) : Prop :=\n 0 < length ∧\n ∀ (i : ℕ), i < length → Beautiful n (start + (i : ℤ))\n\n/-- For every integer `n > 1`, any nonempty finite block of consecutive\nbeautiful integers has length at most `1 + floor(sqrt(3n))`. -/\ndef Target : Prop :=\n ∀ (n : ℤ), 1 < n →\n ∀ (start : ℤ) (length : ℕ),\n IsBeautifulRun n start length →\n (length : ℤ) ≤ RunLengthBound n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c97f6d2-2b1e-5d2e-8e21-877b70ba07e0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9f12d9b4c1cbbf74b89d65d07600501ae7f89d00c66eb09746d628da14dd0541", "task_path": "tasks/nmp3_2c97f6d2-2b1e-5d2e-8e21-877b70ba07e0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2c97f6d2-2b1e-5d2e-8e21-877b70ba07e0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2ccdfd27-e72b-54ab-bde2-6d9fd27ba8f6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ and $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{a(a+c-2b)}{ab+1}+\\frac{b(b+a-2c)}{bc+1}+\\frac{c(c+b-2a)}{ca+1}\\ge 0.\n-- \\]\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement: nonnegativity of a cyclic rational expression\n\nThe original problem asks to prove, for nonnegative real numbers `a`, `b`, and\n`c` whose sum is `3`, that a certain cyclic sum of three rational expressions\nis nonnegative.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * (a + c - 2 * b) / (a * b + 1) + b * (b + a - 2 * c) / (b * c + 1) +\n c * (c + b - 2 * a) / (c * a + 1)\n\n/-- The assertion to be proved: for all nonnegative real numbers `a`, `b`,\nand `c` with `a + b + c = 3`, the cyclic rational expression `lhs a b c` is\nnonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → a + b + c = 3 → lhs a b c ≥ 0\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ccdfd27-e72b-54ab-bde2-6d9fd27ba8f6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "03a7ea64f4c5803414bc97fea92cc4c45c1dfd44824ad9c18f2b59dd566241c1", "task_path": "tasks/nmp3_2ccdfd27-e72b-54ab-bde2-6d9fd27ba8f6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ccdfd27-e72b-54ab-bde2-6d9fd27ba8f6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2cdf26ed-fab6-5ac7-97a4-4dba0829d56b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- 3+\\frac{a(c+a)}{b(b+c)}+\\frac{b(a+b)}{c(c+a)}+\\frac{c(b+c)}{a(a+b)}\\ge 4\\Bigl(\\frac{a}{b+c}+\\frac{b}{c+a}+\\frac{c}{a+b}\\Bigr)\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The inequality stated in the problem, quantified over all positive real `a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 3 + a * (c + a) / (b * (b + c))\n + b * (a + b) / (c * (c + a))\n + c * (b + c) / (a * (a + b))\n ≥ 4 * (a / (b + c) + b / (c + a) + c / (a + b))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2cdf26ed-fab6-5ac7-97a4-4dba0829d56b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1c8ccfedf5cb7f7af607975013fe300d09994a06e36bf90f88f69ecbf27e2194", "task_path": "tasks/nmp3_2cdf26ed-fab6-5ac7-97a4-4dba0829d56b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2cdf26ed-fab6-5ac7-97a4-4dba0829d56b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2ce27232-9be6-5b46-9707-35ad9205181d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p\\ge 3$ be a prime and let $a_1,a_2,\\dots,a_{p-2}$ be natural numbers such that for every $k$ with $1\\le k\\le p-2$ we have $p\\nmid a_k$ and $a_k^{\\,k}\\not\\equiv1\\pmod p$. Prove that for each integer $n$ with $2\\le n\\le p-1$ there exists a non‑empty subset $S\\subseteq\\{1,2,\\dots,p-2\\}$ for which \n-- \\[\n-- \\prod_{i\\in S}a_i\\equiv n\\pmod p.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the prime-subset-product problem\n\nThe source problem asks, for a prime `p ≥ 3` and natural numbers\n`a_1, ..., a_{p-2}` satisfying two congruences for each index, to prove that\nevery integer `n` with `2 ≤ n ≤ p - 1` is congruent modulo `p` to the product\n`∏_{i ∈ S} a_i` over some nonempty subset `S` of the index set.\n\nWe encode residue classes modulo `p` using `ZMod p`. The index `Fin (p - 2)`\nwith value `k.val` represents the source index `k + 1`, so the source\ncondition `a_k^k ≠ 1 (mod p)` becomes\n`(a k : ZMod p) ^ (k.val + 1) ≠ 1`.\n-/\n\nnamespace Problem\n\n/-- The hypotheses imposed on the family `a` indexed by `1, ..., p - 2`.\n\nFor each source index `k + 1` (where `k : Fin (p - 2)`), we require that `p`\ndoes not divide `a (k)` and that the `(k + 1)`-st power of `a (k)` is not\ncongruent to `1` modulo `p`. -/\ndef AdmissibleData (p : ℕ) (a : Fin (p - 2) → ℕ) : Prop :=\n ∀ k : Fin (p - 2),\n (¬ p ∣ a k) ∧ ((a k : ZMod p) ^ (k.val + 1) ≠ 1)\n\n/-- A residue class `n` modulo `p` is realized by a nonempty subset product of\nthe family `a`. -/\ndef SubsetProductRealized (p : ℕ) (a : Fin (p - 2) → ℕ) (n : ℤ) : Prop :=\n ∃ S : Finset (Fin (p - 2)),\n S.Nonempty ∧ (∏ i ∈ S, (a i : ZMod p)) = (n : ZMod p)\n\n/-- The complete assertion of the source problem.\n\n`p` ranges over natural numbers that are prime and at least `3`; `a` is any\nnatural-valued family indexed by `Fin (p - 2)`. Assuming every term satisfies\nthe stated divisibility and noncongruence conditions, every integer `n` from\n`2` through `p - 1` is the residue of a product over a nonempty subset of the\nindices. -/\ndef Target : Prop :=\n ∀ (p : ℕ), Nat.Prime p → 3 ≤ p →\n ∀ (a : Fin (p - 2) → ℕ), AdmissibleData p a →\n ∀ (n : ℤ), 2 ≤ n → n ≤ (p : ℤ) - 1 →\n SubsetProductRealized p a n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ce27232-9be6-5b46-9707-35ad9205181d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4071bba32f95cd1020cced092e08472b368412b9f41698887847f19bb1cc16e6", "task_path": "tasks/nmp3_2ce27232-9be6-5b46-9707-35ad9205181d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ce27232-9be6-5b46-9707-35ad9205181d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2d07641c-a418-5be4-9699-d454edd8ceea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every integer $n>1$, the integer $2^n-1$ does not divide $3^n-1$; i.e. $(2^n-1)\\nmid(3^n-1)$ for all $n>1$.\nimport Mathlib\n\n/-!\n# Formal statement for: divisibility of `3^n - 1` by `2^n - 1`\n\nThe source problem asks to prove that for every integer `n > 1`, the integer\n`2^n - 1` does not divide `3^n - 1`.\n\nSince `n > 1` is positive, the exponent `n` is represented by its natural-number\nvalue `n.toNat` in the integer powers below.\n-/\n\nnamespace Problem\n\n/--\nFor every integer `n > 1`, the integer `2 ^ n - 1` does not divide\n`3 ^ n - 1`.\n-/\ndef Target : Prop :=\n ∀ n : ℤ, 1 < n →\n ¬ (((2 : ℤ) ^ n.toNat - 1) ∣ ((3 : ℤ) ^ n.toNat - 1))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2d07641c-a418-5be4-9699-d454edd8ceea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cda3689c338df41f50c65702018679b6b0278ce4be5f37b3d5bb6df88ad97919", "task_path": "tasks/nmp3_2d07641c-a418-5be4-9699-d454edd8ceea", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2d07641c-a418-5be4-9699-d454edd8ceea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2d1415f7-f0aa-5aa5-ae19-d4d1d00bc111", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ be real numbers satisfying $abc=1$. Prove that \n-- \\[\n-- (a+b)(b+c)(c+a)+7\\ge5(a+b+c)\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion: for all nonnegative real numbers `a`, `b`, `c` with\n`a * b * c = 1`, the product `(a + b) * (b + c) * (c + a)` plus `7` is at least\n`5 * (a + b + c)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → a * b * c = 1 →\n (a + b) * (b + c) * (c + a) + 7 ≥ 5 * (a + b + c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2d1415f7-f0aa-5aa5-ae19-d4d1d00bc111", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "428c191f0184fbb3a66b9795ca85a764291720d8772747bc3760efbf1aaa9602", "task_path": "tasks/nmp3_2d1415f7-f0aa-5aa5-ae19-d4d1d00bc111", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2d1415f7-f0aa-5aa5-ae19-d4d1d00bc111", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2d1d7b35-9186-5552-8b8b-e754d6de7a4b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=1$. Prove that \n-- \\[\n-- \\frac{1}{bc+a+\\dfrac1a}+\\frac{1}{ac+b+\\dfrac1b}+\\frac{1}{ab+c+\\dfrac1c}\\le\\frac{27}{31}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable cyclic inequality\n\nThe source problem asks one to prove an inequality for positive real numbers\n`a`, `b`, and `c` whose sum is `1`. This file declares the admissibility\npredicate, the left-hand side, and the target proposition. It intentionally\ncontains no proof of the target.\n-/\n\nnamespace Problem\n\n/-- The admissible triples in the source problem: all three variables are\npositive real numbers and their sum is `1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 1\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / (b * c + a + 1 / a) +\n 1 / (a * c + b + 1 / b) +\n 1 / (a * b + c + 1 / c)\n\n/-- The proposition to be proved: for every positive real triple with sum `1`,\nthe cyclic sum is at most `27 / 31`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≤ (27 : ℝ) / 31\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2d1d7b35-9186-5552-8b8b-e754d6de7a4b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4d9720027dd7e3172e2a0878c920864ed05e51ef993d8f2195b4efa323e3bd39", "task_path": "tasks/nmp3_2d1d7b35-9186-5552-8b8b-e754d6de7a4b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2d1d7b35-9186-5552-8b8b-e754d6de7a4b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2d221f15-edea-549a-a2ad-d3343c4fe9cb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The numbers $1,2,\\dots,2000$ are placed, one per vertex, on the vertices of a regular $2000$‑gon. The placement satisfies the condition that for any four integers $A [6]\n | n + 1 => alternatingDigits n ++ [if n % 2 = 0 then 9 else 6]\n\n/-- Interpret a nonempty list of decimal digits as the natural number obtained by\nwriting the digits from left to right. For example, `[6, 9, 6]` is interpreted as\n`696`. -/\ndef ofDecimalDigits (digits : List ℕ) : ℕ :=\n digits.foldl (fun value digit => value * 10 + digit) 0\n\n/-- The `n`-th term of the infinite sequence `6, 69, 696, 6969, 69696, ...`,\nwith zero-based indexing. -/\ndef alternatingNumber (n : ℕ) : ℕ :=\n ofDecimalDigits (alternatingDigits n)\n\n/-- Folding a positive initial value through decimal-digit appends keeps the value\npositive. -/\nlemma foldl_decimalDigits_pos :\n ∀ (digits : List ℕ) (value : ℕ), 0 < value →\n 0 < digits.foldl (fun acc digit => acc * 10 + digit) value\n | [], value, hvalue => hvalue\n | digit :: digits, value, hvalue => by\n apply foldl_decimalDigits_pos digits (value * 10 + digit)\n omega\n\n/-- A decimal digit list beginning with a positive digit has a positive value. -/\nlemma ofDecimalDigits_cons_pos (d : ℕ) (ds : List ℕ) (hd : 0 < d) :\n 0 < ofDecimalDigits (d :: ds) := by\n simpa [ofDecimalDigits] using foldl_decimalDigits_pos ds d hd\n\n/-- Every digit list of the alternating sequence begins with the digit 6. -/\nlemma alternatingDigits_has_head_six : ∀ n : ℕ,\n ∃ ds : List ℕ, alternatingDigits n = 6 :: ds\n | 0 => ⟨[], rfl⟩\n | n + 1 => by\n rcases alternatingDigits_has_head_six n with ⟨ds, hds⟩\n refine ⟨ds ++ [if n % 2 = 0 then 9 else 6], ?_⟩\n simp [alternatingDigits, hds]\n\n/-- Every term of the constructed sequence is a positive integer. -/\ntheorem alternatingNumber_pos (n : ℕ) : 0 < alternatingNumber n := by\n rcases alternatingDigits_has_head_six n with ⟨ds, hds⟩\n rw [alternatingNumber, hds]\n exact ofDecimalDigits_cons_pos 6 ds (by norm_num)\n\n/-- A natural number is a perfect square when it is the square of a natural number. -/\ndef IsPerfectSquare (n : ℕ) : Prop :=\n ∃ m : ℕ, m ^ 2 = n\n\n/--\nThe assertion from the problem: the sequence has `69696 = 264^2` as a term, and\n`69696` is the only value occurring in the sequence that is a perfect square.\n-/\ndef Target : Prop :=\n alternatingNumber 4 = 69696 ∧\n 69696 = 264 ^ 2 ∧\n IsPerfectSquare (alternatingNumber 4) ∧\n (∀ n : ℕ, IsPerfectSquare (alternatingNumber n) →\n alternatingNumber n = 69696)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2d880312-1278-50e1-9be5-e5b485775a91", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "17ab70dbbb2468b766a7d0c14745e73bcc10fcefd57d3a163c6ab4f33660ba03", "task_path": "tasks/nmp3_2d880312-1278-50e1-9be5-e5b485775a91", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2d880312-1278-50e1-9be5-e5b485775a91", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2d9f1979-a943-5072-ae6c-ddb206aa12fa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $21ab+2bc+8ca\\le 12$. Prove that \n-- \\[\n-- \\frac1a+\\frac2b+\\frac3c\\ge\\frac{15}{2}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of a real-variable inequality problem\n\nThe source problem asks, for all positive real numbers `a`, `b`, and `c`\nsatisfying `21ab + 2bc + 8ca ≤ 12`, to prove\n`1/a + 2/b + 3/c ≥ 15/2`.\n\nThis file records the statement as a proposition-valued definition. No proof\nof the proposition is supplied here.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition from the problem: `a`, `b`, and `c` are\npositive and satisfy the linear-in-products constraint. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n 21 * a * b + 2 * b * c + 8 * c * a ≤ (12 : ℝ)\n\n/-- The desired lower bound on the expression `1/a + 2/b + 3/c`. -/\ndef Claim (a b c : ℝ) : Prop :=\n (1 : ℝ) / a + (2 : ℝ) / b + (3 : ℝ) / c ≥ (15 : ℝ) / 2\n\n/-- The full universally quantified assertion of the source problem: every\npositive real triple satisfying the constraint also satisfies the stated lower\nbound. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Claim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2d9f1979-a943-5072-ae6c-ddb206aa12fa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0de8600cff8b0289f09b425b1dd0c36b2c7bc2f26438d8a8acc5937c4cc385ba", "task_path": "tasks/nmp3_2d9f1979-a943-5072-ae6c-ddb206aa12fa", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2d9f1979-a943-5072-ae6c-ddb206aa12fa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2da9d9ff-9fef-5b2a-ac3a-6a9dc37275b3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In a convex quadrilateral $ABCD$, the diagonal $BD$ bisects neither $\\angle ABC$ nor $\\angle CDA$. Let $P$ be a point inside $ABCD$ such that \n-- \\[\n-- \\angle PBC=\\angle DBA\\quad\\text{and}\\quad\\angle PDC=\\angle BDA.\n-- \\]\n-- Prove that $ABCD$ is cyclic if and only if $AP=CP$.\n/-\nFormal statement of the geometry problem.\n\nThe ambient Euclidean plane is represented by the complex plane `ℂ`, with its\nstandard real inner-product-space structure and Euclidean metric. The file\ncontains definitions only; in particular, `Problem.Target` is the proposition\nasserted by the problem and no proof of it is supplied.\n-/\n\nimport Mathlib.Analysis.Complex.Basic\nimport Mathlib.Analysis.Convex.Topology\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Geometry.Euclidean.Sphere.Basic\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, encoded as the complex plane equipped with its usual\nreal two-dimensional Euclidean structure. -/\nabbrev Plane : Type := ℂ\n\n/-- The signed planar cross product (twice the signed area) of two vectors, with respect\nto the standard orientation of the complex plane. -/\ndef cross (u v : Plane) : ℝ :=\n u.re * v.im - u.im * v.re\n\n/-- The signed turn from the directed side `a → b` to the directed side `b → c`. Its\nsign is the orientation of the ordered triple `(a, b, c)`. -/\ndef turn (a b c : Plane) : ℝ :=\n cross (b - a) (c - b)\n\n/-- `A`, `B`, `C`, `D` are the vertices, in boundary order, of a strictly convex\nquadrilateral. The four successive turns must have one common nonzero sign: positive\nfor counterclockwise order and negative for clockwise order. This also excludes\nrepeated vertices and any three collinear vertices. -/\ndef IsConvexQuadrilateral (A B C D : Plane) : Prop :=\n (turn A B C > 0 ∧ turn B C D > 0 ∧ turn C D A > 0 ∧ turn D A B > 0) ∨\n (turn A B C < 0 ∧ turn B C D < 0 ∧ turn C D A < 0 ∧ turn D A B < 0)\n\n/-- `P` lies strictly inside the convex quadrilateral with vertices `A`, `B`, `C`, `D`;\nthat is, `P` is in the topological interior of their convex hull. -/\ndef InsideQuadrilateral (A B C D P : Plane) : Prop :=\n P ∈ interior (convexHull ℝ ({A, B, C, D} : Set Plane))\n\n/-- The quadrilateral `A B C D` is cyclic, i.e. its four vertices are concyclic. In the\ncomplex plane, viewed as a two-dimensional real Euclidean affine space, every set is\ncoplanar, so `EuclideanGeometry.Concyclic` is exactly the usual condition that the four\nvertices lie on one circle. -/\ndef CyclicQuadrilateral (A B C D : Plane) : Prop :=\n EuclideanGeometry.Concyclic ({A, B, C, D} : Set Plane)\n\n/-- The point `T` lies on the internal angle bisector of the angle `X Y Z`, expressed by\nequality of the two unoriented subangles at the common vertex `Y`. In `Target` this\npredicate is used only for a diagonal of a convex quadrilateral. Convexity makes the\nrelevant vertices distinct and puts the diagonal ray strictly inside the relevant\ninterior angle, so this equality is exactly the internal-bisector condition. -/\ndef BisectsAngle (X Y Z T : Plane) : Prop :=\n EuclideanGeometry.angle X Y T = EuclideanGeometry.angle T Y Z\n\n/-- The ray `BD` bisects the angle `ABC`. -/\ndef DiagonalBDBisectsAngleABC (A B C D : Plane) : Prop :=\n BisectsAngle A B C D\n\n/-- The ray `DB` bisects the angle `CDA`. -/\ndef DiagonalBDBisectsAngleCDA (A B C D : Plane) : Prop :=\n BisectsAngle C D A B\n\n/-- The claimed equivalence: the quadrilateral is cyclic if and only if the two segment\nlengths `AP` and `CP` are equal. -/\ndef Claim (A B C D P : Plane) : Prop :=\n CyclicQuadrilateral A B C D ↔ dist A P = dist C P\n\n/-- The complete assertion of the problem. For every convex quadrilateral `ABCD` whose\ndiagonal `BD` bisects neither of the angles at `B` and `D`, and for every point `P`\nstrictly inside `ABCD` satisfying the two stated angle equalities, `ABCD` is cyclic if\nand only if `AP = CP`. -/\ndef Target : Prop :=\n ∀ (A B C D : Plane),\n IsConvexQuadrilateral A B C D →\n ¬ DiagonalBDBisectsAngleABC A B C D →\n ¬ DiagonalBDBisectsAngleCDA A B C D →\n ∀ (P : Plane),\n InsideQuadrilateral A B C D P →\n EuclideanGeometry.angle P B C = EuclideanGeometry.angle D B A →\n EuclideanGeometry.angle P D C = EuclideanGeometry.angle B D A →\n (CyclicQuadrilateral A B C D ↔ dist A P = dist C P)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2da9d9ff-9fef-5b2a-ac3a-6a9dc37275b3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6fa1a5a8293d55abd6b7947fa765e6547c0c08a84a532eebc05f8258a1465346", "task_path": "tasks/nmp3_2da9d9ff-9fef-5b2a-ac3a-6a9dc37275b3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2da9d9ff-9fef-5b2a-ac3a-6a9dc37275b3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2dc80436-89ef-5d81-a3e8-bb07797dadb5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb N\\to\\mathbb N$ satisfy $f(n+1)>f(f(n))$ for every $n\\in\\mathbb N$. Prove that $f(n)=n$ for all $n\\in\\mathbb N$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypothesis that a function `f : ℕ → ℕ` satisfies\n`f (n + 1) > f (f n)` for every natural number `n`. -/\ndef Admissible (f : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, f (n + 1) > f (f n)\n\n/-- The asserted pointwise fixed-point conclusion for a function `f : ℕ → ℕ`. -/\ndef FixedPointProperty (f : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, f n = n\n\n/-- The full assertion from the problem: every function `f : ℕ → ℕ` satisfying\n`f (n + 1) > f (f n)` for all `n : ℕ` must be the identity function. -/\ndef Target : Prop :=\n ∀ f : ℕ → ℕ, Admissible f → FixedPointProperty f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2dc80436-89ef-5d81-a3e8-bb07797dadb5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5779ecaba197aa6cbdefc9962a9929e24032f76498dc2670a016c5e597aad3e2", "task_path": "tasks/nmp3_2dc80436-89ef-5d81-a3e8-bb07797dadb5", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2dc80436-89ef-5d81-a3e8-bb07797dadb5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2de74190-54f0-5242-9b14-d1862b21744c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for positive real numbers $a,b,c$,\n-- \\[\n-- \\Bigl(\\frac1a+\\frac1b+\\frac1c\\Bigr)\\Bigl(\\frac1{1+a}+\\frac1{1+b}+\\frac1{1+c}\\Bigr)\\ge\\frac9{1+abc}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove that, for all positive real numbers `a`, `b`, and `c`,\n\\[\n \\left(\\frac1a+\\frac1b+\\frac1c\\right)\n \\left(\\frac1{1+a}+\\frac1{1+b}+\\frac1{1+c}\\right)\n \\ge \\frac{9}{1+abc}.\n\\]\nThe declaration below records that assertion as a proposition. It does not assert or\nprovide a proof.\n-/\n\nnamespace Problem\n\n/--\nFor all positive real numbers `a`, `b`, and `c`,\n`(1/a + 1/b + 1/c) * (1/(1+a) + 1/(1+b) + 1/(1+c))`\nis at least `9/(1 + a*b*c)`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (1 / a + 1 / b + 1 / c) *\n (1 / (1 + a) + 1 / (1 + b) + 1 / (1 + c)) ≥\n (9 : ℝ) / (1 + a * b * c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2de74190-54f0-5242-9b14-d1862b21744c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e1a181f24c408ce9579e4401947ea47eb3d06e59ebcb9ea89debf59bead06973", "task_path": "tasks/nmp3_2de74190-54f0-5242-9b14-d1862b21744c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2de74190-54f0-5242-9b14-d1862b21744c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2debf8bc-f4dc-5363-8ee6-fff76e0f17c0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $a+b+c=ab+bc+ca>0$. Prove that \n-- \\[\n-- \\sqrt{ab}+\\sqrt{bc}+\\sqrt{ca}-\\sqrt{abc}\\ge 2\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility conditions on the real numbers `a`, `b`, and `c`:\nthey are nonnegative, their sum equals the sum of their pairwise products,\nand their sum is positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧\n a + b + c = a * b + b * c + c * a ∧\n 0 < a + b + c\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a * b) + Real.sqrt (b * c) + Real.sqrt (c * a) -\n Real.sqrt (a * b * c)\n\n/-- The assertion to be proved: for every nonnegative real triple whose sum\nequals its sum of pairwise products and is positive, the stated square-root\nexpression is at least `2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2debf8bc-f4dc-5363-8ee6-fff76e0f17c0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2d546024ba8d3ad9d9cdbdebeac24649927d3ddbce178e6175e600aeba9a04e3", "task_path": "tasks/nmp3_2debf8bc-f4dc-5363-8ee6-fff76e0f17c0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2debf8bc-f4dc-5363-8ee6-fff76e0f17c0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2e4d24ee-2e0d-5263-bdd8-1df28ed612e3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given the sequence of positive integers $a_n=\\left\\lfloor n^{\\frac{2018}{2017}}\\right\\rfloor$ for $n=1,2,3,\\dots$, prove that there exists a positive integer $N$ such that every set of $N$ consecutive terms of the sequence contains at least one term whose decimal representation includes the digit $5$.\nimport Mathlib\n\n/-!\n# Formalization of the decimal-digit problem for ⌊n^(2018/2017)⌋\n\nThis file states the problem without proving it. The sequence is indexed by\npositive natural numbers, and `Nat.digits 10` is the usual base-ten digit list\nwithout leading zeroes.\n-/\n\nnamespace Problem\n\n/-- The real exponent `2018 / 2017` occurring in the problem. -/\nnoncomputable def exponent : ℝ := (2018 : ℝ) / (2017 : ℝ)\n\n/-- The sequence `a_n = ⌊n^(2018/2017)⌋`, for natural `n`. -/\nnoncomputable def a (n : ℕ) : ℕ := ⌊(n : ℝ) ^ exponent⌋₊\n\n/-- A natural number contains the decimal digit `5` iff `5` occurs in its\nbase-ten digit list. Mathlib's `Nat.digits 10` uses no leading zeroes and\nreturns `[]` for zero, agreeing with the usual decimal representation. -/\ndef ContainsDecimalDigitFive (n : ℕ) : Prop := 5 ∈ Nat.digits 10 n\n\n/-- The desired assertion: there is a positive block length `N` such that\nevery block of `N` consecutive terms of `a`, starting at any positive index,\ncontains a term whose decimal representation includes the digit `5`. -/\ndef Target : Prop :=\n ∃ N : ℕ, 0 < N ∧\n ∀ k : ℕ, 0 < k →\n ∃ j : ℕ, j < N ∧ ContainsDecimalDigitFive (a (k + j))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2e4d24ee-2e0d-5263-bdd8-1df28ed612e3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "166b8582adf6798ba2193dcbb375d30a1d6d7cae6812e0d2c6e34680b6690d4c", "task_path": "tasks/nmp3_2e4d24ee-2e0d-5263-bdd8-1df28ed612e3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2e4d24ee-2e0d-5263-bdd8-1df28ed612e3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2e7edc00-764f-5a45-942e-308b4b1fc940", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer and let $S\\subseteq\\{1,2,\\dots,n\\}$ be the set of numbers colored red. The coloring satisfies the property that for any (not necessarily distinct) red numbers $a,b,c\\in S$, if $n\\mid a(b-c)$ then $b=c$. Prove that \n-- \\[\n-- |S|\\le \\varphi(n)\\,,\n-- \\] \n-- where $\\varphi$ denotes Euler’s totient function.\nimport Mathlib\n\n/-!\nFormalization of the statement:\n\nLet `n` be a positive integer and let `S ⊆ {1, 2, ..., n}` be the set of red\nnumbers. Suppose that for all (not necessarily distinct) `a, b, c ∈ S`,\n`n ∣ a * (b - c)` implies `b = c`. Then `|S| ≤ φ(n)`, where `φ` is Euler's\ntotient function.\n\nThe subtraction in `a * (b - c)` is integer subtraction, so the natural\nnumbers `a`, `b`, `c`, and `n` are cast to `ℤ` in the divisibility condition.\n-/\n\nnamespace Problem\n\n/-- The red numbers form a subset of `{1, 2, ..., n}`. -/\ndef RedNumbersInRange (n : ℕ) (S : Finset ℕ) : Prop :=\n S ⊆ Finset.Icc 1 n\n\n/--\nThe required coloring condition: for any red numbers `a`, `b`, and `c`,\n`n ∣ a * (b - c)` forces `b = c`. The variables are not required to be\ndistinct. The subtraction is the subtraction in `ℤ`.\n-/\ndef ColoringCondition (n : ℕ) (S : Finset ℕ) : Prop :=\n ∀ a : ℕ, a ∈ S → ∀ b : ℕ, b ∈ S → ∀ c : ℕ, c ∈ S →\n (n : ℤ) ∣ (a : ℤ) * ((b : ℤ) - (c : ℤ)) → b = c\n\n/-- A subset of `{1, 2, ..., n}` satisfying the stated coloring condition. -/\ndef AdmissibleRedSet (n : ℕ) (S : Finset ℕ) : Prop :=\n RedNumbersInRange n S ∧ ColoringCondition n S\n\n/--\nThe assertion to be proved: for every positive integer `n`, every admissible\nred set `S ⊆ {1, 2, ..., n}` has cardinality at most `Nat.totient n`, Euler's\ntotient function evaluated at `n`.\n-/\ndef Target : Prop :=\n ∀ (n : ℕ), 0 < n → ∀ (S : Finset ℕ),\n AdmissibleRedSet n S → S.card ≤ Nat.totient n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2e7edc00-764f-5a45-942e-308b4b1fc940", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d183aaf614d46bd9831618b8dd6f7cfd795c7f8ab224397751938db24b5debf1", "task_path": "tasks/nmp3_2e7edc00-764f-5a45-942e-308b4b1fc940", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2e7edc00-764f-5a45-942e-308b4b1fc940", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2e81e527-ee82-57e3-883e-f6617cdfc198", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P$ be a point inside triangle $ABC$ such that $\\angle PAC=\\angle PBC$. Let $L$ and $M$ be the feet of the perpendiculars from $P$ to $BC$ and $CA$, respectively. Let $D$ be the midpoint of $AB$. Prove that $DL = DM$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Analysis.Convex.Topology\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used to formalize the problem. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `A`, `B`, and `C` are the vertices of a nondegenerate triangle. -/\ndef NondegenerateTriangle (A B C : Plane) : Prop :=\n AffineIndependent ℝ ![A, B, C]\n\n/-- The point `P` lies in the strict interior of triangle `ABC`. -/\ndef InsideTriangle (A B C P : Plane) : Prop :=\n P ∈ interior (convexHull ℝ ({A, B, C} : Set Plane))\n\n/-- `L` is the foot of the perpendicular from `P` to the line through `B` and `C`. -/\ndef FootOfPerpendicular (P L B C : Plane) : Prop :=\n L ∈ line[ℝ, B, C] ∧ inner ℝ (P -ᵥ L) (C -ᵥ B) = 0\n\n/-- The midpoint of the segment with endpoints `A` and `B`. -/\ndef SegmentMidpoint (A B : Plane) : Plane :=\n midpoint ℝ A B\n\n/-- The angle condition from the problem: `∠PAC = ∠PBC`. -/\ndef AngleCondition (A B C P : Plane) : Prop :=\n EuclideanGeometry.angle P A C = EuclideanGeometry.angle P B C\n\n/--\nThe complete assertion of the problem: for every nondegenerate triangle `ABC`,\nevery point `P` in its strict interior satisfying `∠PAC = ∠PBC`, and every\nchoice of the perpendicular feet `L` on `BC` and `M` on `CA`, the midpoint\n`D` of `AB` satisfies `DL = DM`.\n-/\ndef Target : Prop :=\n ∀ (A B C P L M : Plane),\n NondegenerateTriangle A B C →\n InsideTriangle A B C P →\n AngleCondition A B C P →\n FootOfPerpendicular P L B C →\n FootOfPerpendicular P M C A →\n dist (SegmentMidpoint A B) L = dist (SegmentMidpoint A B) M\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2e81e527-ee82-57e3-883e-f6617cdfc198", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f42bf1dca474da6daed37eddf851d044ba49a891a44cab9cb27405246b1227df", "task_path": "tasks/nmp3_2e81e527-ee82-57e3-883e-f6617cdfc198", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2e81e527-ee82-57e3-883e-f6617cdfc198", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2e8adac9-7575-5cc2-8f9e-d534140b212f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In triangle $ABC$, let the incircle touch $AC$ at $E$ and $AB$ at $F$. Let the $A$‑excircle have center $I_A$ and touch $BC$ at $K$. Define points $P$ and $Q$ so that $BFPI_A$ and $CEQI_A$ are parallelograms. Let $X = AI_A\\cap PQ$. Prove that $KX\\perp PQ$.\nimport Mathlib\n\nsection NMP3BundledGeometry\n\n/-!\n# Elementary planar Euclidean geometry for the statement of the problem\n\nWe work in the real affine plane represented by `ℝ × ℝ`. This file supplies only\nthe elementary predicates needed to state the problem, not a proof of the target.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- Points of the real Euclidean plane, represented by their Cartesian coordinates. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- The scalar cross product of two planar vectors. -/\ndef cross (u v : Point) : ℝ := u.1 * v.2 - u.2 * v.1\n\n/-- The Euclidean scalar product of two planar vectors. -/\ndef dot (u v : Point) : ℝ := u.1 * v.1 + u.2 * v.2\n\n/-- The square of the Euclidean norm of a planar vector. -/\ndef normSq (u : Point) : ℝ := dot u u\n\n/-- The squared distance between two points. -/\ndef distSq (P Q : Point) : ℝ := normSq (Q - P)\n\n/-- Three points are collinear when the vectors from the first point to the other\ntwo are linearly dependent. -/\ndef Collinear (A B C : Point) : Prop :=\n cross (B - A) (C - A) = 0\n\n/-- A nondegenerate triangle is an ordered triple of pairwise distinct noncollinear\npoints. -/\ndef NondegenerateTriangle (A B C : Point) : Prop :=\n A ≠ B ∧ B ≠ C ∧ C ≠ A ∧ cross (B - A) (C - A) ≠ 0\n\n/-- `P` lies on the (undirected) line through `A` and `B`. -/\ndef OnLine (P A B : Point) : Prop :=\n cross (B - A) (P - A) = 0\n\n/-- `P` lies on the closed segment joining `A` and `B`. -/\ndef OnClosedSegment (P A B : Point) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ P = A + t • (B - A)\n\n/-- `P` lies in the relative interior of the segment joining `A` and `B`. -/\ndef OnOpenSegment (P A B : Point) : Prop :=\n ∃ t : ℝ, 0 < t ∧ t < 1 ∧ P = A + t • (B - A)\n\n/-- The unsigned side of a directed line: the cross product used in the line test. -/\ndef sideValue (A B P : Point) : ℝ :=\n cross (B - A) (P - A)\n\n/-- Two points lie on opposite (open) sides of the line through `A` and `B`. -/\ndef OppositeSidesOfLine (A B P Q : Point) : Prop :=\n sideValue A B P * sideValue A B Q < 0\n\n/-- `P` is strictly inside the triangle with vertices `A`, `B`, and `C`, expressed\nby positive barycentric coordinates. -/\ndef InsideTriangle (P A B C : Point) : Prop :=\n ∃ α β γ : ℝ,\n 0 < α ∧ 0 < β ∧ 0 < γ ∧ α + β + γ = 1 ∧\n P = α • A + β • B + γ • C\n\n/-- Squared distance from `P` to the line through `A` and `B`. -/\ndef lineDistanceSq (P A B : Point) : ℝ :=\n (cross (B - A) (P - A)) ^ 2 / dot (B - A) (B - A)\n\n/-- The two direction vectors `B - A` and `D - C` are perpendicular. -/\ndef LinePerp (A B C D : Point) : Prop :=\n dot (B - A) (D - C) = 0\n\n/-- The ordered quadruple `A B C D` is a parallelogram, expressed by the standard\ndiagonal-midpoint identity `A + C = B + D`. -/\ndef IsParallelogram (A B C D : Point) : Prop :=\n A + C = B + D\n\n/-- `X` is the unique intersection point of the lines `AB` and `CD`. -/\ndef IsUniqueLineIntersection (X A B C D : Point) : Prop :=\n OnLine X A B ∧ OnLine X C D ∧\n ∀ Y : Point, OnLine Y A B → OnLine Y C D → Y = X\n\n/-- `I` is the incenter of triangle `A B C`: it lies strictly inside the triangle\nand has equal positive distances to all three side lines. -/\ndef IsIncenter (A B C I : Point) : Prop :=\n InsideTriangle I A B C ∧\n 0 < lineDistanceSq I A B ∧\n lineDistanceSq I A B = lineDistanceSq I A C ∧\n lineDistanceSq I A B = lineDistanceSq I B C\n\n/-- The incircle of triangle `A B C` has center `I` and touches side `AC` at `E`\nand side `AB` at `F`. -/\ndef IsIncircleContact (A B C I E F : Point) : Prop :=\n IsIncenter A B C I ∧\n OnOpenSegment E A C ∧\n OnOpenSegment F A B ∧\n LinePerp I E A C ∧\n LinePerp I F A B ∧\n distSq I E = lineDistanceSq I A B ∧\n distSq I F = lineDistanceSq I A B\n\n/-- `I_A` is the `A`-excenter of triangle `A B C`: it has equal positive distances\nto all three side lines and lies on the side of `BC` opposite to `A`. -/\ndef IsAExcenter (A B C IA : Point) : Prop :=\n OppositeSidesOfLine B C IA A ∧\n 0 < lineDistanceSq IA A B ∧\n lineDistanceSq IA A B = lineDistanceSq IA A C ∧\n lineDistanceSq IA A B = lineDistanceSq IA B C\n\n/-- The `A`-excircle of triangle `A B C` has center `I_A` and touches side `BC`\nat `K`. -/\ndef IsAExcircleContact (A B C IA K : Point) : Prop :=\n IsAExcenter A B C IA ∧\n OnOpenSegment K B C ∧\n LinePerp IA K B C ∧\n distSq IA K = lineDistanceSq IA A B\n\nend Problem\n\nend -- helper noncomputable section\nend NMP3BundledGeometry\n\n\n/-!\n# Formal statement\n\nThe elementary geometric predicates used below are defined in\n`Statement.Geometry`. The target is the implication corresponding to the original\nproblem statement; its body is a proposition, not a proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The formal target. A nondegenerate triangle is introduced first. Then the\nincircle data (`I`, `E`, `F`), the `A`-excircle data (`IA`, `K`), the two\nparallelogram fourth vertices (`P`, `Q`), and finally the intersection point `X`\nare introduced in the order and with the dependencies of the source statement.\nThe conclusion is the perpendicularity `KX ⟂ PQ`. -/\ndef Target : Prop :=\n ∀ A B C : Point,\n NondegenerateTriangle A B C →\n ∀ I E F : Point,\n IsIncircleContact A B C I E F →\n ∀ IA K : Point,\n IsAExcircleContact A B C IA K →\n ∀ P Q : Point,\n IsParallelogram B F P IA →\n IsParallelogram C E Q IA →\n ∀ X : Point,\n IsUniqueLineIntersection X A IA P Q →\n LinePerp K X P Q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2e8adac9-7575-5cc2-8f9e-d534140b212f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a17390690a6cfe91dc8419998072fa65e613b80e29f73a8f0718246ac45a4f85", "task_path": "tasks/nmp3_2e8adac9-7575-5cc2-8f9e-d534140b212f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2e8adac9-7575-5cc2-8f9e-d534140b212f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2ea391ac-a394-52fb-b9da-569f1661f3ad", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$, $k$, and $m$ be positive integers with $n>2k$. Let $S$ be a non‑empty collection of $k$‑element subsets of $\\{1,2,\\dots,n\\}$ such that every $(k+1)$‑element subset of $\\{1,2,\\dots,n\\}$ contains exactly $m$ members of $S$. Prove that $S$ must contain every $k$‑element subset of $\\{1,2,\\dots,n\\}$; i.e. $S=\\{A\\subseteq\\{1,\\dots,n\\}:|A|=k\\}$.\nimport Mathlib\n\n/-!\n# Formalization of the problem statement\n\nThe problem concerns a family `S` of `k`-element subsets of the initial\ninterval `{1, ..., n}` of the natural numbers. Every `(k+1)`-element subset\nof that interval is assumed to contain exactly `m` members of `S`. The\ndeclaration `Problem.Target` records the resulting proposition; no proof of\nit is supplied here.\n-/\n\nnamespace Problem\n\n/-- The ground set `{1, 2, ..., n}`, represented as a finite set of naturals. -/\ndef GroundSet (n : ℕ) : Finset ℕ :=\n Finset.Icc 1 n\n\n/-- `A` is a `k`-element subset of `{1, 2, ..., n}`. -/\ndef IsKSubset (n k : ℕ) (A : Finset ℕ) : Prop :=\n A.card = k ∧ A ⊆ GroundSet n\n\n/-- The set of all `k`-element subsets of `{1, 2, ..., n}`. -/\ndef AllKSubsets (n k : ℕ) : Set (Finset ℕ) :=\n {A | IsKSubset n k A}\n\n/--\nThe members of the family `S` that are contained in a given block `B`,\nrepresented as a finite set. Since every subset of `B` occurs in `B.powerset`,\nfiltering that finite powerset by membership in `S` counts exactly the distinct\nmembers of `S` that are contained in `B`.\n-/\nnoncomputable def MembersContainedIn (S : Set (Finset ℕ)) (B : Finset ℕ) : Finset (Finset ℕ) :=\n letI := Classical.propDecidable\n B.powerset.filter (fun A => A ∈ S)\n\n/--\nEvery `(k+1)`-element subset `B` of the ground set contains exactly `m`\nmembers of the family `S`. Here `B` contains `A` exactly when `A ⊆ B`, and\nthe members are counted without multiplicity because `S` is a set of subsets.\n-/\ndef EveryBlockHasExactly (n k m : ℕ) (S : Set (Finset ℕ)) : Prop :=\n ∀ B : Finset ℕ,\n B.card = k + 1 →\n B ⊆ GroundSet n →\n (MembersContainedIn S B).card = m\n\n/--\nThe admissibility predicate for a proposed family `S`: it is non-empty, all\nof its members are `k`-subsets of the ground set, and every `(k+1)`-subset\nof the ground set contains exactly `m` members of `S`.\n-/\ndef Admissible (n k m : ℕ) (S : Set (Finset ℕ)) : Prop :=\n S.Nonempty ∧\n (∀ A : Finset ℕ, A ∈ S → IsKSubset n k A) ∧\n EveryBlockHasExactly n k m S\n\n/--\nThe assertion to be proved: for all positive integers `n`, `k`, and `m` with\n`n > 2k`, every admissible non-empty family `S` is in fact the family of all\n`k`-element subsets of `{1, 2, ..., n}`.\n-/\ndef Target : Prop :=\n ∀ n k m : ℕ,\n 0 < n →\n 0 < k →\n 0 < m →\n 2 * k < n →\n ∀ S : Set (Finset ℕ),\n Admissible n k m S →\n S = AllKSubsets n k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ea391ac-a394-52fb-b9da-569f1661f3ad", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2422db0dee19aeab31a82e5b82c1d8db7e55e2c4bfc46d026655c35d41781ea5", "task_path": "tasks/nmp3_2ea391ac-a394-52fb-b9da-569f1661f3ad", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ea391ac-a394-52fb-b9da-569f1661f3ad", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2ec11b69-5fa9-5730-b632-b842b12f4b2b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given non‑negative real numbers $a,b,c$ with $ab+bc+ca>0$, prove that \n-- \\[\n-- \\frac{a(b+c)}{a^{2}+bc}+\\frac{b(c+a)}{b^{2}+ca}+\\frac{c(a+b)}{c^{2}+ab}\\ge \n-- \\frac{(a+b+c)^{2}}{a^{2}+b^{2}+c^{2}}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the three-variable homogeneous inequality\n\nThe source problem asks to prove an inequality for non-negative real numbers\n`a`, `b`, and `c` satisfying `a * b + b * c + c * a > 0`.\nThis file only records the proposition; it does not provide a proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypotheses from the problem: `a`, `b`, and `c` are\nnon-negative real numbers and satisfy `ab + bc + ca > 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a * b + b * c + c * a\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * (b + c) / (a ^ 2 + b * c)\n + b * (c + a) / (b ^ 2 + c * a)\n + c * (a + b) / (c ^ 2 + a * b)\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a + b + c) ^ 2 / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The displayed inequality relating the left- and right-hand sides. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete assertion of the source problem: for every triple of\nnon-negative real numbers satisfying `ab + bc + ca > 0`, the displayed\nleft-hand side is at least the displayed right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ec11b69-5fa9-5730-b632-b842b12f4b2b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7e25e47716ba38c6d3ba79c824405aaccbaf68f410f6bbed50b4b5058a2a9a2d", "task_path": "tasks/nmp3_2ec11b69-5fa9-5730-b632-b842b12f4b2b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ec11b69-5fa9-5730-b632-b842b12f4b2b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2ee542d8-e9e6-55f1-8987-b6986dceab77", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be non‑negative real numbers, no two of which are zero. Prove that \n-- \\[\n-- \\frac{b^3+c^3}{a^2+bc}+\\frac{c^3+a^3}{b^2+ca}+\\frac{a^3+b^3}{c^2+ab}\\ge\n-- 2\\Bigl(\\frac{a^2}{b+c}+\\frac{b^2}{c+a}+\\frac{c^2}{a+b}\\Bigr).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The three real variables are non-negative. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- No two of the three real variables are simultaneously zero. -/\ndef NoTwoZero (a b c : ℝ) : Prop :=\n ¬ (a = 0 ∧ b = 0) ∧ ¬ (b = 0 ∧ c = 0) ∧ ¬ (c = 0 ∧ a = 0)\n\n/-- The domain condition of the problem: `a`, `b`, and `c` are non-negative\nreal numbers, and no two of them are simultaneously zero. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ NoTwoZero a b c\n\n/-- The left-hand side of the inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (b ^ 3 + c ^ 3) / (a ^ 2 + b * c) +\n (c ^ 3 + a ^ 3) / (b ^ 2 + c * a) +\n (a ^ 3 + b ^ 3) / (c ^ 2 + a * b)\n\n/-- The right-hand side of the inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 2 * (a ^ 2 / (b + c) + b ^ 2 / (c + a) + c ^ 2 / (a + b))\n\n/-- The pointwise inequality asserted by the problem. -/\ndef inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full universally quantified statement of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ee542d8-e9e6-55f1-8987-b6986dceab77", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "55714b2a959cd9d0fb4bd98c7f580b118501eb76134bf750f118f3d8ea82e7e4", "task_path": "tasks/nmp3_2ee542d8-e9e6-55f1-8987-b6986dceab77", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ee542d8-e9e6-55f1-8987-b6986dceab77", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2ef26a61-69d4-576f-92d8-6a52423be447", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c\\ge0$ and $ab+bc+ca=4$, prove that \n-- \\[\n-- \\sqrt{a^{2}+9bc}+\\sqrt{b^{2}+9ca}+\\sqrt{c^{2}+9ab}\\ge10.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the square-root inequality\n\nThe source problem asks, for nonnegative real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca = 4`, to prove the inequality\n\n`sqrt (a^2 + 9*b*c) + sqrt (b^2 + 9*c*a) + sqrt (c^2 + 9*a*b) ≥ 10`.\n\nThis file only formalizes the proposition. No proof of it is supplied.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved: for all nonnegative reals `a`, `b`, `c` with\n`a*b + b*c + c*a = 4`, the displayed sum of real square roots is at least\n`10`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a * b + b * c + c * a = 4 →\n Real.sqrt (a ^ 2 + 9 * b * c) +\n Real.sqrt (b ^ 2 + 9 * c * a) +\n Real.sqrt (c ^ 2 + 9 * a * b) ≥\n 10\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ef26a61-69d4-576f-92d8-6a52423be447", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a4afca97a3c72522a3e23cc7ba29d8ac5e50ba446110e12da76eb72745967968", "task_path": "tasks/nmp3_2ef26a61-69d4-576f-92d8-6a52423be447", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2ef26a61-69d4-576f-92d8-6a52423be447", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2f18188c-9c23-5490-a916-0c53819d09a3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let S be a set of 25 distinct integers. Prove that there exist two distinct elements a,b∈S with a>b such that neither the sum a+b nor the difference a−b belongs to the other 23 elements of S (i.e., a+b∉S\\{a,b} and a−b∉S\\{a,b}).\nimport Mathlib\n\nnamespace Problem\n\n/-- The elements of `S` other than `a` and `b`, i.e. `S \\ {a, b}`. -/\ndef OtherElements (S : Finset ℤ) (a b : ℤ) : Finset ℤ :=\n (S.erase a).erase b\n\n/-- A pair `(a, b)` is admissible for a finite set `S` of integers when both\nelements belong to `S`, they are distinct, `a > b`, and neither `a + b` nor\n`a - b` belongs to `S \\ {a, b}`. -/\ndef GoodPair (S : Finset ℤ) (a b : ℤ) : Prop :=\n a ∈ S ∧ b ∈ S ∧ a ≠ b ∧ a > b ∧\n a + b ∉ OtherElements S a b ∧ a - b ∉ OtherElements S a b\n\n/-- The assertion of the problem: every finite set `S` of `25` distinct integers\ncontains a pair `(a, b)` satisfying the admissibility conditions. -/\ndef Target : Prop :=\n ∀ S : Finset ℤ, S.card = 25 → ∃ a b : ℤ, GoodPair S a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2f18188c-9c23-5490-a916-0c53819d09a3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "12e49319189c1fd2aa0552fc4ee8050ddb13a7bc9b69ac38d0024bcd97b5da4b", "task_path": "tasks/nmp3_2f18188c-9c23-5490-a916-0c53819d09a3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2f18188c-9c23-5490-a916-0c53819d09a3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2f1d8f6d-dbb1-5213-ba75-68ed7820ca15", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every positive integer $n$, the number of integer partitions of $n$ in which the smallest part occurs exactly once and the largest part is at most twice the smallest part equals the number of integer partitions of $n$ in which the largest part is odd and the smallest part is greater than one half of the largest part.\nimport Mathlib.Combinatorics.Enumerative.Partition.Basic\n\n/-!\n# A partition identity\n\nThis file formalizes the statement of the partition identity in `problem.md`.\nIt records the two admissible classes of partitions and the assertion that their\ncardinalities agree for every positive integer `n`. No proof of the identity is\nprovided here.\n-/\n\nnamespace Problem\n\n/-- `s` is a smallest part of the partition `p`. -/\ndef IsSmallestPart {n : ℕ} (p : Nat.Partition n) (s : ℕ) : Prop :=\n s ∈ p.parts ∧ ∀ t : ℕ, t ∈ p.parts → s ≤ t\n\n/-- `l` is a largest part of the partition `p`. -/\ndef IsLargestPart {n : ℕ} (p : Nat.Partition n) (l : ℕ) : Prop :=\n l ∈ p.parts ∧ ∀ t : ℕ, t ∈ p.parts → t ≤ l\n\n/-- The smallest part of `p` occurs with multiplicity exactly one. -/\ndef SmallestPartOccursExactlyOnce {n : ℕ} (p : Nat.Partition n) : Prop :=\n ∃ s : ℕ, IsSmallestPart p s ∧ p.parts.count s = 1\n\n/-- The largest part of `p` is at most twice the supplied smallest part `s`. -/\ndef LargestPartAtMostTwice {n : ℕ} (p : Nat.Partition n) (s : ℕ) : Prop :=\n ∃ l : ℕ, IsLargestPart p l ∧ l ≤ 2 * s\n\n/-- The largest part of `p` is at most twice a smallest part of `p`. -/\ndef LargestPartAtMostTwiceSmallest {n : ℕ} (p : Nat.Partition n) : Prop :=\n ∃ s : ℕ, IsSmallestPart p s ∧ LargestPartAtMostTwice p s\n\n/-- The first class of partitions: the smallest part occurs exactly once, and the\nlargest part is at most twice that same smallest part. -/\ndef FirstAdmissible {n : ℕ} (p : Nat.Partition n) : Prop :=\n ∃ s : ℕ, IsSmallestPart p s ∧ p.parts.count s = 1 ∧ LargestPartAtMostTwice p s\n\n/-- The largest part of `p` is odd. -/\ndef LargestPartOdd {n : ℕ} (p : Nat.Partition n) : Prop :=\n ∃ l : ℕ, IsLargestPart p l ∧ Odd l\n\n/-- The smallest part of `p` is greater than one half of the supplied largest part `l`. -/\ndef SmallestPartGreaterThanHalf {n : ℕ} (p : Nat.Partition n) (l : ℕ) : Prop :=\n ∃ s : ℕ, IsSmallestPart p s ∧ l < 2 * s\n\n/-- The smallest part of `p` is greater than one half of a largest part of `p`. -/\ndef SmallestPartGreaterThanHalfLargest {n : ℕ} (p : Nat.Partition n) : Prop :=\n ∃ l : ℕ, IsLargestPart p l ∧ SmallestPartGreaterThanHalf p l\n\n/-- The second class of partitions: the largest part is odd, and the smallest part\nis greater than one half of that same largest part. -/\ndef SecondAdmissible {n : ℕ} (p : Nat.Partition n) : Prop :=\n ∃ l : ℕ, IsLargestPart p l ∧ Odd l ∧ SmallestPartGreaterThanHalf p l\n\n/-- The partitions of `n` in the first class, as a finite set of partitions. -/\nnoncomputable def firstPartitions (n : ℕ) : Finset (Nat.Partition n) := by\n classical\n exact Finset.univ.filter (fun p : Nat.Partition n => FirstAdmissible p)\n\n/-- The partitions of `n` in the second class, as a finite set of partitions. -/\nnoncomputable def secondPartitions (n : ℕ) : Finset (Nat.Partition n) := by\n classical\n exact Finset.univ.filter (fun p : Nat.Partition n => SecondAdmissible p)\n\n/-- For every positive integer `n`, the two classes of partitions of `n` have the\nsame cardinality. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → (firstPartitions n).card = (secondPartitions n).card\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2f1d8f6d-dbb1-5213-ba75-68ed7820ca15", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "01abea284038b83e14820898d51f2afdf7a30d7537de1fe28bc7f8d4a2bc5065", "task_path": "tasks/nmp3_2f1d8f6d-dbb1-5213-ba75-68ed7820ca15", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2f1d8f6d-dbb1-5213-ba75-68ed7820ca15", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2f35a5a1-f0d1-571a-b627-89a2c737e247", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- An integer $n>101$ is divisible by $101$. Suppose that every divisor $d$ of $n$ with $1 101` that is\ndivisible by `101` and has the stated difference property for all of its\nnontrivial proper divisors is divisible by `100`. -/\ndef Target : Prop :=\n ∀ n : ℤ,\n 101 < n →\n 101 ∣ n →\n (∀ d : ℤ,\n 1 < d →\n d < n →\n d ∣ n →\n DifferenceOfPositiveDivisors n d) →\n 100 ∣ n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2f35a5a1-f0d1-571a-b627-89a2c737e247", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "43955bbe54596fd27315a24ab9e3e580712dfaa1285e6392d3106a5bc9affc24", "task_path": "tasks/nmp3_2f35a5a1-f0d1-571a-b627-89a2c737e247", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2f35a5a1-f0d1-571a-b627-89a2c737e247", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2fa56305-b895-5016-a1ef-a477bd477f03", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there exists a partition of the positive integers into two subsets $A$ and $B$ such that \n-- (i) for any three consecutive positive integers, at least one of them belongs to $A$ and at least one belongs to $B$ (i.e., no three consecutive integers are all in the same subset), and \n-- (ii) neither $A$ nor $B$ contains an infinite arithmetic progression.\nimport Mathlib.Data.Set.Basic\n\n/-!\n# Partition of the positive integers with no monochromatic three-term block\nand no infinite arithmetic progression in either part\n\nThis file contains the formal statement of the problem. The positive\nintegers are represented as the subset `{n : ℕ | 0 < n}` of `ℕ`.\n-/\n\nnamespace Problem\n\n/-- The positive integers, represented as a subset of `ℕ`. -/\ndef PositiveIntegers : Set ℕ :=\n {n : ℕ | 0 < n}\n\n/-- `A` and `B` form a partition of the positive integers: their union is\nexactly the set of positive integers and they are disjoint. -/\ndef IsPartitionOfPositiveIntegers (A : Set ℕ) (B : Set ℕ) : Prop :=\n A ∪ B = PositiveIntegers ∧ A ∩ B = ∅\n\n/-- Every block of three consecutive positive integers has a member in `A`\nand a member in `B`. Equivalently, no such block is contained entirely in\neither part. -/\ndef NoMonochromaticThreeConsecutive (A : Set ℕ) (B : Set ℕ) : Prop :=\n ∀ n : ℕ, 0 < n →\n (n ∈ A ∨ n + 1 ∈ A ∨ n + 2 ∈ A) ∧\n (n ∈ B ∨ n + 1 ∈ B ∨ n + 2 ∈ B)\n\n/-- A subset `S` of `ℕ` contains an infinite arithmetic progression when\nthere are a positive starting term `a` and a positive common difference `d`\nsuch that all terms `a + k * d`, for `k : ℕ`, belong to `S`. -/\ndef ContainsInfiniteArithmeticProgression (S : Set ℕ) : Prop :=\n ∃ a : ℕ, ∃ d : ℕ,\n 0 < a ∧ 0 < d ∧ ∀ k : ℕ, a + k * d ∈ S\n\n/-- A partition of the positive integers is admissible when it satisfies\nboth clauses of the problem. -/\ndef AdmissiblePartition (A : Set ℕ) (B : Set ℕ) : Prop :=\n IsPartitionOfPositiveIntegers A B ∧\n NoMonochromaticThreeConsecutive A B ∧\n ¬ ContainsInfiniteArithmeticProgression A ∧\n ¬ ContainsInfiniteArithmeticProgression B\n\n/-- The asserted existence of a suitable partition of the positive integers. -/\ndef Target : Prop :=\n ∃ A : Set ℕ, ∃ B : Set ℕ, AdmissiblePartition A B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2fa56305-b895-5016-a1ef-a477bd477f03", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "33c141735e8f2d7f2ba8e15dbfafae7ef1fd1096a26958d4cd4dd03370cb4572", "task_path": "tasks/nmp3_2fa56305-b895-5016-a1ef-a477bd477f03", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "2fa56305-b895-5016-a1ef-a477bd477f03", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_2ff7b2dc-4a50-5104-8987-974d6157a993", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $10$ satisfy $xy+yz+zx=3$. Prove that \n-- \\[\n-- \\frac1{\\sqrt{x^3+1}}+\\frac1{\\sqrt{y^3+1}}+\\frac1{\\sqrt{z^3+1}}\\le \\frac{3}{\\sqrt{2xyz}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a positive-variable square-root inequality\n\nThe source problem asks to prove an inequality for positive real numbers\n`x`, `y`, and `z` satisfying `xy + yz + zx = 3`.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `x`, `y`,\nand `z` with `x * y + y * z + z * x = 3`, the sum of the reciprocal square\nroots of `x^3 + 1`, `y^3 + 1`, and `z^3 + 1` is at most\n`3 / sqrt (2 * x * y * z)`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x * y + y * z + z * x = (3 : ℝ) →\n (1 : ℝ) / Real.sqrt (x ^ (3 : ℕ) + (1 : ℝ)) +\n (1 : ℝ) / Real.sqrt (y ^ (3 : ℕ) + (1 : ℝ)) +\n (1 : ℝ) / Real.sqrt (z ^ (3 : ℕ) + (1 : ℝ)) ≤\n (3 : ℝ) / Real.sqrt ((2 : ℝ) * x * y * z)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "303041c8-d046-51b0-a000-555c0899f3e7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b5840493c8fb4d796e06e7576545cf451084b93ebffa41952580235b751aa108", "task_path": "tasks/nmp3_303041c8-d046-51b0-a000-555c0899f3e7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "303041c8-d046-51b0-a000-555c0899f3e7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3061566c-cf21-5dc0-93dd-22ca1c564c42", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers such that $a+b+c=0$. Prove that \n-- \\[\n-- \\sqrt{a^{2}+4}+\\sqrt{b^{2}+4}+\\sqrt{c^{2}+4}\n-- -\\bigl(a+\\sqrt{a^{2}+4}\\bigr)\\bigl(b+\\sqrt{b^{2}+4}\\bigr)\\bigl(c+\\sqrt{c^{2}+4}\\bigr)\\ge -2.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\nnamespace Problem\n\n/--\nThe left-hand side of the inequality in the problem, as a function of real\nnumbers `a`, `b`, and `c`.\n-/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n (Real.sqrt (a ^ 2 + 4) + Real.sqrt (b ^ 2 + 4) + Real.sqrt (c ^ 2 + 4))\n - ((a + Real.sqrt (a ^ 2 + 4)) *\n (b + Real.sqrt (b ^ 2 + 4)) *\n (c + Real.sqrt (c ^ 2 + 4)))\n\n/-- The hypothesis that the three real numbers have sum zero. -/\ndef IsZeroSum (a b c : ℝ) : Prop :=\n a + b + c = 0\n\n/-- The asserted lower bound for the displayed expression. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n LeftHandSide a b c ≥ -2\n\n/--\nFor all real numbers `a`, `b`, and `c` satisfying `a + b + c = 0`, the\nspecified expression is at least `-2`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ), IsZeroSum a b c → InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3061566c-cf21-5dc0-93dd-22ca1c564c42", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "636e1cdc4fe3839573fd6b631c04669346ec8e4c89a4625b054dd72f12ac9f82", "task_path": "tasks/nmp3_3061566c-cf21-5dc0-93dd-22ca1c564c42", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3061566c-cf21-5dc0-93dd-22ca1c564c42", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_307ce8da-9e28-5258-acf7-fb3afc240f0a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{1}{5a^{2}-4a+11}+\\frac{1}{5b^{2}-4b+11}+\\frac{1}{5c^{2}-4c+11}\\le\\frac14\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the given inequality problem\n\nThe original problem asks to prove, for all real numbers `a`, `b`, and `c`\nsatisfying `a + b + c = 3`, that a certain sum of three rational expressions\nis at most `1 / 4`.\n-/\n\nnamespace Problem\n\n/-- The denominator occurring in each summand. -/\ndef denominator (x : ℝ) : ℝ :=\n 5 * x ^ 2 - 4 * x + 11\n\n/-- One summand of the left-hand side. -/\nnoncomputable def summand (x : ℝ) : ℝ :=\n (1 : ℝ) / denominator x\n\n/-- The complete left-hand side of the asserted inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n summand a + summand b + summand c\n\n/-- The admissibility condition on the real triple in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n a + b + c = 3\n\n/-- The inequality asserted for a real triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n leftHandSide a b c ≤ (1 : ℝ) / 4\n\n/-- The complete universally quantified assertion of the problem.\n\nFor all real numbers `a`, `b`, and `c` with `a + b + c = 3`, the sum\n`1 / (5a² - 4a + 11) + 1 / (5b² - 4b + 11) + 1 / (5c² - 4c + 11)`\nis at most `1 / 4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "307ce8da-9e28-5258-acf7-fb3afc240f0a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1c7be47abe9bbc1364bffbca438cb4477142f06e37cf0d8f7a8a2224a277b36a", "task_path": "tasks/nmp3_307ce8da-9e28-5258-acf7-fb3afc240f0a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "307ce8da-9e28-5258-acf7-fb3afc240f0a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_30815136-771f-5b8a-9aa9-ff05b8cae206", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $R_n$ denote the $n$‑digit repunit in base 10, i.e. \n-- $$R_n=\\underbrace{11\\ldots1}_{n\\text{ digits}}=\\frac{10^n-1}{9}.$$\n-- Prove that for every integer $n\\ge 2$ there exists a prime $p$ dividing $R_n$ such that $p$ does not divide any earlier repunit $R_m$ with $1\\le m (0 : ℝ)\n\n/-- The identity function on the reals. -/\npublic def identityFunction : ℝ → ℝ :=\n fun (x : ℝ) => x\n\n/-- The candidate answer set consisting of exactly the zero function and the\nidentity function. -/\npublic def canonicalAnswer : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | f = Problem.zeroFunction ∨ f = Problem.identityFunction}\n\n/-- The complete-answer assertion for the original problem: the zero function\nand the identity function are precisely all the admissible functions. -/\npublic def Target : Prop :=\n Problem.AnswerCorrect Problem.canonicalAnswer\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "308bc602-5b37-5d78-b3d7-1436a6db2aaf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f8d2a9429a604662327d4a3e855975c318ba949471d10c08b40e9735af3bc717", "task_path": "tasks/nmp3_308bc602-5b37-5d78-b3d7-1436a6db2aaf", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "308bc602-5b37-5d78-b3d7-1436a6db2aaf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_30967373-660d-5f1d-8bfd-c4639fae09e6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be non‑negative real numbers, with no two of them equal to zero, such that $a^{2}+b^{2}+c^{2}=2$. Prove that \n-- \\[\n-- \\frac{a^{4}}{a^{2}-ab+b^{2}}+\\frac{b^{4}}{b^{2}-bc+c^{2}}+\\frac{c^{4}}{c^{2}-ca+a^{2}}\n-- \\;\\ge\\;\n-- 1+\\frac{2abc\\,(a+b+c)}{(a^{3}+b^{3}+c^{3})^{2}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe problem asks to prove an inequality for non-negative real numbers `a`, `b`, `c`\nsatisfying a normalization condition, with the additional hypothesis that no two\nof the numbers are both zero.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypotheses from the problem: `a`, `b`, and `c` are\nnon-negative, no two of them are equal to zero, and their squared sum is `2`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧\n 0 ≤ b ∧\n 0 ≤ c ∧\n ¬ (a = 0 ∧ b = 0) ∧\n ¬ (a = 0 ∧ c = 0) ∧\n ¬ (b = 0 ∧ c = 0) ∧\n a ^ 2 + b ^ 2 + c ^ 2 = 2\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 4 / (a ^ 2 - a * b + b ^ 2) +\n b ^ 4 / (b ^ 2 - b * c + c ^ 2) +\n c ^ 4 / (c ^ 2 - c * a + a ^ 2)\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 1 + 2 * a * b * c * (a + b + c) /\n (a ^ 3 + b ^ 3 + c ^ 3) ^ 2\n\n/-- The complete assertion to be proved: for every admissible triple, the\nleft-hand side is at least the right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "30967373-660d-5f1d-8bfd-c4639fae09e6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "17ac09b182d03b2a41b394834c40756cc0977cd5d2a89d1b6ced0cdf14b4af29", "task_path": "tasks/nmp3_30967373-660d-5f1d-8bfd-c4639fae09e6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "30967373-660d-5f1d-8bfd-c4639fae09e6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_309b0269-ac0f-543f-bec4-9af7492a2495", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $S$ be a set of $n$ points in the coordinate plane. A pair of points is called *aligned* if the two points have the same $x$‑coordinate or the same $y$‑coordinate. Prove that $S$ can be partitioned into disjoint subsets, each of which is a collinear set of points, such that the number of unordered pairs of distinct points that are aligned but belong to different subsets is at most $n^{3/2}\\,.$\nimport Mathlib\n\n/-!\n# Partitioning a finite planar point set into collinear parts\n\nThis file formalizes the statement of the problem, not a proof of it.\nA point of the coordinate plane is represented by a pair of real numbers.\n-/\n\nnamespace Problem\n\n/-- A point in the coordinate plane, represented by its x- and y-coordinates. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- Two distinct points are aligned when they share their x-coordinate or their\ny-coordinate. (Distinctness is imposed where unordered aligned pairs are counted;\nthe relation itself is meaningful for any two points.) -/\ndef Aligned (p q : Point) : Prop :=\n p.1 = q.1 ∨ p.2 = q.2\n\n/-- A finite set of points is collinear when all its points lie on one affine\nline. The line is represented by two distinct points `p` and `q` through which\nit passes; the final determinant condition says that every point `r` of the set\nis on the line `pq`. -/\ndef Collinear (A : Finset Point) : Prop :=\n ∃ p q : Point,\n p ≠ q ∧\n ∀ r ∈ A,\n (q.1 - p.1) * (r.2 - p.2) = (q.2 - p.2) * (r.1 - p.1)\n\n/-- `parts` is a partition of the finite set `S`: every part is nonempty and is\ncontained in `S`, and every point of `S` lies in exactly one part. The unique\nmembership condition for every point of `S` also says that distinct parts are\ndisjoint. -/\ndef IsPartitionOf (S : Finset Point) (parts : Finset (Finset Point)) : Prop :=\n (∀ A ∈ parts, A.Nonempty ∧ A ⊆ S) ∧\n (∀ p : Point, p ∈ S ↔ ∃! A : Finset Point, A ∈ parts ∧ p ∈ A)\n\n/-- Two points belong to different members of a family `parts`. -/\ndef InDifferentParts (parts : Finset (Finset Point)) (p q : Point) : Prop :=\n ∃ A ∈ parts, ∃ B ∈ parts, A ≠ B ∧ p ∈ A ∧ q ∈ B\n\n/-- An unordered pair of points, represented by a two-element `Finset`, is an\naligned crossing pair for a partition when its two distinct points are aligned\nand lie in different parts. -/\ndef IsAlignedCrossingPair (parts : Finset (Finset Point))\n (pair : Finset Point) : Prop :=\n pair.card = 2 ∧\n ∃ p ∈ pair, ∃ q ∈ pair, p ≠ q ∧ Aligned p q ∧ InDifferentParts parts p q\n\n/-- The number of unordered pairs of distinct points of `S` that are aligned\nbut belong to different members of the partition `parts`. -/\nnoncomputable def AlignedCrossingPairCount\n (S : Finset Point) (parts : Finset (Finset Point)) : ℕ := by\n classical\n exact ((S.powersetCard 2).filter fun pair => IsAlignedCrossingPair parts pair).card\n\n/-- The formal target: for every finite set `S` of `n` coordinate-plane points,\nthere is a partition of `S` into nonempty collinear subsets such that at most\n`n^(3/2)` unordered aligned pairs lie in different subsets. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (S : Finset Point),\n S.card = n →\n ∃ parts : Finset (Finset Point),\n IsPartitionOf S parts ∧\n (∀ A ∈ parts, Collinear A) ∧\n (AlignedCrossingPairCount S parts : ℝ) ≤\n Real.rpow (n : ℝ) (3 / 2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "309b0269-ac0f-543f-bec4-9af7492a2495", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1a89af9de54a629c87804ff93032a30b54afcbacb56ab7792cfc99da07f62a3c", "task_path": "tasks/nmp3_309b0269-ac0f-543f-bec4-9af7492a2495", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "309b0269-ac0f-543f-bec4-9af7492a2495", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_30adf8a0-484c-5c4e-a957-6162b9f19778", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers. Prove that \n-- \n-- \\[\n-- (xy+yz+zx)\\Bigl(\\frac{1}{x^2+y^2}+\\frac{1}{x^2+z^2}+\\frac{1}{y^2+z^2}\\Bigr)>\\frac52.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe problem asks to prove a strict inequality for all positive real numbers\n`x`, `y`, and `z`. This file records the target proposition only; it does not\nprovide a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def leftSide (x y z : ℝ) : ℝ :=\n (x * y + y * z + z * x) *\n (1 / (x ^ 2 + y ^ 2) + 1 / (x ^ 2 + z ^ 2) + 1 / (y ^ 2 + z ^ 2))\n\n/-- The assertion to be proved: for all positive real numbers `x`, `y`, and `z`,\nthe displayed expression is strictly greater than `5 / 2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → leftSide x y z > (5 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "30adf8a0-484c-5c4e-a957-6162b9f19778", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f210eb5b656058b3f0ae2f2b64504ba8ca2fa3daf26d30022d5933b8e1fb63e9", "task_path": "tasks/nmp3_30adf8a0-484c-5c4e-a957-6162b9f19778", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "30adf8a0-484c-5c4e-a957-6162b9f19778", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_30bbc72c-13f5-5d74-96ce-e98223bfa3b4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Consider a set of points $\\mathcal{S}$ in the plane in general position (no three collinear) with $|\\mathcal{S}|\\ge 3$. The set has the property that for any three points $A,B,C\\in\\mathcal{S}$, the circumcenter of $\\triangle ABC$ also belongs to $\\mathcal{S}$. Prove that $\\mathcal{S}$ cannot be finite.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Circumcenter\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\nimport Mathlib.Data.Set.Card\n\n/-!\n# A circumcenter-closed planar point set is infinite\n\nThis file formalizes the statement of the problem. The ambient plane is the\ncomplete real Euclidean plane `EuclideanSpace ℝ (Fin 2)`. A point set is\nrepresented as a `Set` of plane points. Its possible finiteness is stated with\n`Set.Finite`; its cardinality is the extended natural cardinality `Set.encard`\nso that the condition `|S| ≥ 3` also makes sense for infinite sets.\n-/\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, the real Euclidean space of dimension two. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/--\nA set of plane points is in general position when no three pairwise distinct\npoints of the set are collinear.\n-/\ndef GeneralPosition (S : Set Plane) : Prop :=\n ∀ ⦃A B C : Plane⦄,\n A ∈ S → B ∈ S → C ∈ S →\n A ≠ B → A ≠ C → B ≠ C →\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/--\nBuild the nondegenerate triangle with vertices `A`, `B`, and `C` from the\nnon-collinearity of the three vertices.\n-/\ndef TriangleOfPoints (A B C : Plane)\n (hABC : ¬ Collinear ℝ ({A, B, C} : Set Plane)) : Affine.Triangle ℝ Plane :=\n ⟨![A, B, C], affineIndependent_iff_not_collinear_set.mpr hABC⟩\n\n/--\nThe circumcenter-closure property: for every three pairwise distinct points\n`A`, `B`, `C` of `S`, the circumcenter of triangle `ABC` belongs to `S`.\nThe argument `hS` is the general-position hypothesis needed to know that the\nthree distinct points determine a nondegenerate triangle.\n-/\ndef CircumcenterClosed (S : Set Plane) (hS : GeneralPosition S) : Prop :=\n ∀ ⦃A B C : Plane⦄,\n (hA : A ∈ S) → (hB : B ∈ S) → (hC : C ∈ S) →\n (hAB : A ≠ B) → (hAC : A ≠ C) → (hBC : B ≠ C) →\n (TriangleOfPoints A B C (hS hA hB hC hAB hAC hBC)).circumcenter ∈ S\n\n/--\nThe admissible sets of the problem: at least three points, in general\nposition, and closed under taking circumcenters of triangles with vertices in\nthe set.\n-/\ndef AdmissibleSet (S : Set Plane) : Prop :=\n ∃ hS : GeneralPosition S,\n (3 : ℕ∞) ≤ S.encard ∧ CircumcenterClosed S hS\n\n/-- The assertion to be proved: every admissible planar point set is infinite. -/\ndef Target : Prop :=\n ∀ S : Set Plane, AdmissibleSet S → ¬ S.Finite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "30bbc72c-13f5-5d74-96ce-e98223bfa3b4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6b4ff01f6083f5a90660b5b18a1c121dbca96fa960294d283221ac8a9d4bddf8", "task_path": "tasks/nmp3_30bbc72c-13f5-5d74-96ce-e98223bfa3b4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "30bbc72c-13f5-5d74-96ce-e98223bfa3b4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_30da491f-076d-5d06-ac3d-3e4d37db52ea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- \\[\n-- \\frac{1}{xy+xz+yz}\\ge \\frac{1}{(y+2z)(2x+y)}+\\frac{1}{(2y+z)(z+2x)}+\\frac{1}{(2z+x)(x+2y)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the positive-variable inequality\n\nThe source problem asks, for all real numbers `x`, `y`, and `z` that are\nstrictly positive, to prove the displayed inequality. This file records the\nprecise proposition; it deliberately contains no proof of it.\n-/\n\nnamespace Problem\n\n/-- The inequality asserted in the problem, quantified over all real `x`, `y`,\nand `z`, subject to the three strict positivity assumptions. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n (1 : ℝ) / (x * y + x * z + y * z) ≥\n (1 : ℝ) / ((y + (2 : ℝ) * z) * ((2 : ℝ) * x + y)) +\n (1 : ℝ) / (((2 : ℝ) * y + z) * (z + (2 : ℝ) * x)) +\n (1 : ℝ) / (((2 : ℝ) * z + x) * (x + (2 : ℝ) * y))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "30da491f-076d-5d06-ac3d-3e4d37db52ea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dcff3ce6ebf10a7c99ee315693e3135530358553eca21ac2ca3b5700a4750a48", "task_path": "tasks/nmp3_30da491f-076d-5d06-ac3d-3e4d37db52ea", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "30da491f-076d-5d06-ac3d-3e4d37db52ea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3134ca50-9695-5b5b-af54-67d5122a9741", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^2+b^2+c^2=3abc$. Prove that \n-- \\[\n-- \\frac{1}{33a+32b+31c}+\\frac{1}{33b+32c+31a}+\\frac{1}{33c+32a+31b}\\le\\frac{1}{32}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the cyclic inequality problem\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nsatisfying `a^2 + b^2 + c^2 = 3abc`, the cyclic inequality\n`1/(33a+32b+31c) + 1/(33b+32c+31a) + 1/(33c+32a+31b) ≤ 1/32`.\n\nWe record the assumptions and conclusion as predicates and state the universal\nimplication as `Problem.Target`. No proof of `Problem.Target` is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition from the source problem:\n`a`, `b`, and `c` are positive and satisfy `a^2 + b^2 + c^2 = 3abc`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a ^ 2 + b ^ 2 + c ^ 2 = 3 * a * b * c\n\n/-- The left-hand side of the cyclic inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / ((33 : ℝ) * a + (32 : ℝ) * b + (31 : ℝ) * c) +\n 1 / ((33 : ℝ) * b + (32 : ℝ) * c + (31 : ℝ) * a) +\n 1 / ((33 : ℝ) * c + (32 : ℝ) * a + (31 : ℝ) * b)\n\n/-- The asserted upper bound for the left-hand side. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ (1 : ℝ) / 32\n\n/-- The full universally quantified statement: every positive real triple satisfying\n`a^2 + b^2 + c^2 = 3abc` obeys the cyclic upper bound. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3134ca50-9695-5b5b-af54-67d5122a9741", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8b806219134a986df748b0b7df293b3dbd7869a7eca53a0dde4daef7b2735ccc", "task_path": "tasks/nmp3_3134ca50-9695-5b5b-af54-67d5122a9741", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3134ca50-9695-5b5b-af54-67d5122a9741", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3194b82c-61f9-5048-88d4-bb43227a95b6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots,a_n>0$ with $n\\ge2$ and $a_1a_2\\cdots a_n=1$. For any real $\\lambda\\ge0$, prove that \n-- \\[\n-- \\Bigl(\\frac1{a_1}+\\frac1{a_2}+\\cdots+\\frac1{a_n}\\Bigr)\\Bigl(\\frac1{a_1+\\lambda}+\\frac1{a_2+\\lambda}+\\cdots+\\frac1{a_n+\\lambda}\\Bigr)\\ge\\frac{n^2}{\\lambda+1}\\,.\n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The assertion from the problem: for positive reals `a` over `Fin n` with product one\nand for every nonnegative real `λ`, the stated product of sums is at least\n`n^2 / (lam + 1)`. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 2 ≤ n →\n ∀ (a : Fin n → ℝ),\n (∀ i : Fin n, 0 < a i) →\n (∏ i : Fin n, a i = 1) →\n ∀ (lam : ℝ), 0 ≤ lam →\n (∑ i : Fin n, (1 : ℝ) / a i) *\n (∑ i : Fin n, (1 : ℝ) / (a i + lam)) ≥\n ((n : ℝ) ^ 2) / (lam + 1)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3194b82c-61f9-5048-88d4-bb43227a95b6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "257f45f84f95f6455c2264714f6abd312da287681ded209022bd58b37fd12a13", "task_path": "tasks/nmp3_3194b82c-61f9-5048-88d4-bb43227a95b6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3194b82c-61f9-5048-88d4-bb43227a95b6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_31acbdd1-3520-50e5-9b21-f8209b30cff0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given an ordered list of $3N$ real numbers, we can trim it to form a list of $N$ numbers as follows: divide the list into $N$ groups of three consecutive numbers, and within each group discard the highest and lowest numbers, keeping only the median. \n-- \n-- Start with a list of $3^{2021}$ numbers drawn independently and uniformly at random from the interval $[0,1]$. Trim the list repeatedly as defined above until only one number remains; call this random number $X$. \n-- \n-- Let $\\displaystyle\\mu = \\mathbb{E}\\Bigl[\\Bigl|X-\\frac12\\Bigr|\\Bigr]$. Prove that \n-- \n-- \\[\n-- \\mu \\;\\ge\\; \\frac14\\Bigl(\\frac23\\Bigr)^{2021}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the iterated-median problem\n\nThis file fixes an ordered finite list of i.i.d. uniform `[0,1]` random variables,\ndefines the deterministic repeated median-trimming map, and states the requested\nlower bound on the expected distance of the final value from `1/2`.\n\nThe list positions are represented by `Fin (3 ^ 2021)`, in increasing index order.\n-/\n\nopen MeasureTheory\nopen Filter\n\nnamespace Problem\n\n/-- The median (middle order statistic) of three real numbers.\n\nFor ties this returns a middle value; the numerical value retained is the middle\nvalue of the triple as a multiset. -/\nnoncomputable def median3 (a b c : ℝ) : ℝ :=\n if a ≤ b then\n if b ≤ c then b\n else if a ≤ c then c\n else a\n else\n if a ≤ c then a\n else if b ≤ c then c\n else b\n\n/-- Perform one trimming round on a list of length `3 * N`.\n\nThe `i`-th output entry is the median of the three consecutive input entries\n`3*i`, `3*i+1`, and `3*i+2`. -/\nnoncomputable def trimStep (N : ℕ) (f : Fin (3 * N) → ℝ) : Fin N → ℝ :=\n fun i =>\n median3\n (f ⟨3 * i.val, by omega⟩)\n (f ⟨3 * i.val + 1, by omega⟩)\n (f ⟨3 * i.val + 2, by omega⟩)\n\n/-- Apply the trimming operation repeatedly to a list whose length is a power of 3.\n\nStarting from length `3 ^ n`, this performs exactly `n` rounds and returns the\nunique remaining number. -/\nnoncomputable def reducePow : (n : ℕ) → (Fin (3 ^ n) → ℝ) → ℝ\n | 0, f => f ⟨0, by omega⟩\n | n + 1, f =>\n reducePow n\n (trimStep (3 ^ n)\n (fun i => f (Fin.cast (pow_succ' (3 : ℕ) n).symm i)))\n\n/-- `X`: the final random number after all `2021` trimming rounds. -/\nnoncomputable def X : (Fin (3 ^ 2021) → ℝ) → ℝ :=\n reducePow 2021\n\n/-- Uniform probability measure on the interval `[0,1]`. -/\nnoncomputable def uniformIntervalMeasure : Measure ℝ :=\n volume.restrict (Set.Icc (0 : ℝ) 1)\n\n/-- The restriction of Lebesgue measure to `[0,1]` is a probability measure. -/\ninstance instIsProbabilityMeasureUniformIntervalMeasure :\n MeasureTheory.IsProbabilityMeasure uniformIntervalMeasure :=\n ⟨by\n rw [uniformIntervalMeasure, Measure.restrict_apply_univ, Real.volume_Icc]\n norm_num⟩\n\n/-- Joint law of the `3 ^ 2021` independent uniform draws from `[0,1]`. -/\nnoncomputable def sampleMeasure : Measure (Fin (3 ^ 2021) → ℝ) :=\n Measure.pi (fun _ : Fin (3 ^ 2021) => uniformIntervalMeasure)\n\n/-- The product measure describing the random initial list is a probability measure. -/\ninstance instIsProbabilityMeasureSampleMeasure :\n MeasureTheory.IsProbabilityMeasure sampleMeasure := by\n rw [sampleMeasure]\n infer_instance\n\n/-- `mu`: the expectation of `|X - 1/2|` under the product law of the initial list. -/\nnoncomputable def mu : ℝ :=\n ∫ sample, |X sample - (1 / 2 : ℝ)| ∂sampleMeasure\n\nlemma median3_eq_minmax (a b c : ℝ) :\n median3 a b c = max (min a b) (min (max a b) c) := by\n unfold median3\n by_cases hab : a ≤ b\n · simp only [hab, ite_true]\n by_cases hbc : b ≤ c\n · have hmed : (if b ≤ c then b else if a ≤ c then c else a) = b := by\n simp [hbc]\n rw [hmed]\n rw [min_eq_left hab, max_eq_right hab, min_eq_left hbc, max_eq_right hab]\n · have hcb : c < b := not_le.mp hbc\n by_cases hac : a ≤ c\n · have hmed : (if b ≤ c then b else if a ≤ c then c else a) = c := by\n simp [hbc, hac]\n rw [hmed]\n rw [min_eq_left hab, max_eq_right hab, min_eq_right (le_of_lt hcb),\n max_eq_right hac]\n · have hca : c < a := not_le.mp hac\n have hmed : (if b ≤ c then b else if a ≤ c then c else a) = a := by\n simp [hbc, hac]\n rw [hmed]\n rw [min_eq_left hab, max_eq_right hab, min_eq_right (le_of_lt hcb),\n max_eq_left (le_of_lt hca)]\n · have hba : b < a := not_le.mp hab\n simp only [hab, ite_false]\n by_cases hac : a ≤ c\n · have hmed : (if a ≤ c then a else if b ≤ c then c else b) = a := by\n simp [hac]\n rw [hmed]\n rw [min_eq_right (le_of_lt hba), max_eq_left (le_of_lt hba),\n min_eq_left hac, max_eq_right (le_of_lt hba)]\n · have hca : c < a := not_le.mp hac\n by_cases hbc : b ≤ c\n · have hmed : (if a ≤ c then a else if b ≤ c then c else b) = c := by\n simp [hac, hbc]\n rw [hmed]\n rw [min_eq_right (le_of_lt hba), max_eq_left (le_of_lt hba),\n min_eq_right (le_of_lt hca), max_eq_right hbc]\n · have hcb : c < b := not_le.mp hbc\n have hmed : (if a ≤ c then a else if b ≤ c then c else b) = b := by\n simp [hac, hbc]\n rw [hmed]\n rw [min_eq_right (le_of_lt hba), max_eq_left (le_of_lt hba),\n min_eq_right (le_of_lt hca), max_eq_left (le_of_lt hcb)]\n\nlemma continuous_median3 :\n Continuous (fun p : ℝ × ℝ × ℝ => median3 p.1 p.2.1 p.2.2) := by\n have h : (fun p : ℝ × ℝ × ℝ => median3 p.1 p.2.1 p.2.2) =\n (fun p : ℝ × ℝ × ℝ =>\n max (min p.1 p.2.1) (min (max p.1 p.2.1) p.2.2)) := by\n funext p\n exact median3_eq_minmax p.1 p.2.1 p.2.2\n rw [h]\n fun_prop\n\nlemma measurable_median3_comp {α : Type*} [MeasurableSpace α]\n {u v w : α → ℝ} (hu : Measurable u) (hv : Measurable v) (hw : Measurable w) :\n Measurable (fun x : α => median3 (u x) (v x) (w x)) := by\n have hF : Measurable (fun p : ℝ × ℝ × ℝ => median3 p.1 p.2.1 p.2.2) :=\n continuous_median3.measurable\n have htuple : Measurable (fun x : α => (u x, v x, w x)) := by\n apply Measurable.prod\n · exact hu\n · apply Measurable.prod\n · exact hv\n · exact hw\n exact hF.comp htuple\n\nlemma measurable_trimStep_apply (N : ℕ) (i : Fin N) :\n Measurable (fun f : Fin (3 * N) → ℝ => trimStep N f i) := by\n unfold trimStep\n exact measurable_median3_comp\n (measurable_pi_apply (⟨3 * i.val, by omega⟩ : Fin (3 * N)))\n (measurable_pi_apply (⟨3 * i.val + 1, by omega⟩ : Fin (3 * N)))\n (measurable_pi_apply (⟨3 * i.val + 2, by omega⟩ : Fin (3 * N)))\n\nlemma measurable_trimStep (N : ℕ) :\n Measurable (fun f : Fin (3 * N) → ℝ => trimStep N f) := by\n rw [measurable_pi_iff]\n intro i\n exact measurable_trimStep_apply N i\n\nlemma measurable_reducePow (n : ℕ) : Measurable (reducePow n) := by\n induction n with\n | zero =>\n change Measurable (fun f : Fin 1 → ℝ => f ⟨0, by omega⟩)\n exact measurable_pi_apply (⟨0, by omega⟩ : Fin 1)\n | succ n ih =>\n rw [show reducePow (n + 1) =\n (fun f : Fin (3 ^ (n + 1)) → ℝ =>\n reducePow n (trimStep (3 ^ n)\n (fun i : Fin (3 * 3 ^ n) =>\n f (Fin.cast (pow_succ' (3 : ℕ) n).symm i)))) by rfl]\n have hinner : Measurable\n (fun f : Fin (3 ^ (n + 1)) → ℝ =>\n (fun i : Fin (3 * 3 ^ n) =>\n f (Fin.cast (pow_succ' (3 : ℕ) n).symm i))) := by\n rw [measurable_pi_iff]\n intro i\n exact measurable_pi_apply\n ((Fin.cast (pow_succ' (3 : ℕ) n).symm i : Fin (3 ^ (n + 1))))\n exact ih.comp ((measurable_trimStep (3 ^ n)).comp hinner)\n\nlemma measurable_X : Measurable X := by\n change Measurable (reducePow 2021)\n exact measurable_reducePow 2021\n\nlemma measurable_abs_X_sub_half :\n Measurable (fun sample : Fin (3 ^ 2021) → ℝ => |X sample - (1 / 2 : ℝ)|) := by\n exact (measurable_X.sub measurable_const).abs\n\nlemma median3_mem_Icc {a b c : ℝ}\n (ha : a ∈ Set.Icc (0 : ℝ) 1)\n (hb : b ∈ Set.Icc (0 : ℝ) 1)\n (hc : c ∈ Set.Icc (0 : ℝ) 1) :\n median3 a b c ∈ Set.Icc (0 : ℝ) 1 := by\n rcases ha with ⟨ha0, ha1⟩\n rcases hb with ⟨hb0, hb1⟩\n rcases hc with ⟨hc0, hc1⟩\n simp only [Set.mem_Icc]\n unfold median3\n split_ifs <;> constructor <;> linarith\n\nlemma trimStep_mem_Icc (N : ℕ) (f : Fin (3 * N) → ℝ)\n (hf : ∀ i : Fin (3 * N), f i ∈ Set.Icc (0 : ℝ) 1) :\n ∀ i : Fin N, trimStep N f i ∈ Set.Icc (0 : ℝ) 1 := by\n intro i\n exact median3_mem_Icc (hf _) (hf _) (hf _)\n\nlemma reducePow_mem_Icc {n : ℕ} (f : Fin (3 ^ n) → ℝ)\n (hf : ∀ i : Fin (3 ^ n), f i ∈ Set.Icc (0 : ℝ) 1) :\n reducePow n f ∈ Set.Icc (0 : ℝ) 1 := by\n induction n with\n | zero =>\n simpa [reducePow] using hf ⟨0, by omega⟩\n | succ n ih =>\n apply ih\n intro i\n exact trimStep_mem_Icc (3 ^ n)\n (fun j => f (Fin.cast (pow_succ' (3 : ℕ) n).symm j))\n (by intro j; exact hf (Fin.cast (pow_succ' (3 : ℕ) n).symm j)) i\n\nlemma abs_X_sub_half_le_half (sample : Fin (3 ^ 2021) → ℝ)\n (hs : ∀ i : Fin (3 ^ 2021), sample i ∈ Set.Icc (0 : ℝ) 1) :\n |X sample - (1 / 2 : ℝ)| ≤ (1 / 2 : ℝ) := by\n have hx : reducePow 2021 sample ∈ Set.Icc (0 : ℝ) 1 := reducePow_mem_Icc sample hs\n change |reducePow 2021 sample - (1 / 2 : ℝ)| ≤ (1 / 2 : ℝ)\n rw [Set.mem_Icc] at hx\n rw [abs_le]\n constructor <;> linarith\n\nlemma ae_sample_mem_Icc :\n ∀ᵐ sample ∂sampleMeasure, ∀ i : Fin (3 ^ 2021), sample i ∈ Set.Icc (0 : ℝ) 1 := by\n rw [sampleMeasure]\n rw [eventually_all]\n intro i\n exact (MeasureTheory.Measure.tendsto_eval_ae_ae.eventually\n (ae_restrict_mem (measurableSet_Icc : MeasurableSet (Set.Icc (0 : ℝ) 1))))\n\nlemma ae_abs_X_sub_half_le_half :\n ∀ᵐ sample ∂sampleMeasure,\n ‖|X sample - (1 / 2 : ℝ)|‖ ≤ (1 / 2 : ℝ) := by\n filter_upwards [ae_sample_mem_Icc] with sample hs\n rw [Real.norm_eq_abs, abs_abs]\n exact abs_X_sub_half_le_half sample hs\n\ntheorem integrable_abs_X_sub_half :\n Integrable (fun sample : Fin (3 ^ 2021) → ℝ => |X sample - (1 / 2 : ℝ)|)\n sampleMeasure := by\n exact Integrable.of_bound measurable_abs_X_sub_half.aestronglyMeasurable (1 / 2 : ℝ)\n ae_abs_X_sub_half_le_half\n\n/-- The assertion requested by the problem: `mu` is at least\n`(1/4) * (2/3)^2021`. This declaration only states the proposition; no proof\nof it is supplied. -/\ndef Target : Prop :=\n (1 / 4 : ℝ) * ((2 / 3 : ℝ) ^ 2021) ≤ mu\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "31acbdd1-3520-50e5-9b21-f8209b30cff0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "76fe0a14a7e997d6d4cf59a280c07d1a0d374e3f8196b42f099cc1a560548463", "task_path": "tasks/nmp3_31acbdd1-3520-50e5-9b21-f8209b30cff0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "31acbdd1-3520-50e5-9b21-f8209b30cff0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_31f45981-b179-52bb-8f7d-799970e6ed48", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that if the points of the plane are coloured with three colours, there will always exist two points of the same colour which are one unit apart.\nimport Mathlib\n\n/-!\n# Three-colour unit-distance statement for the Euclidean plane\n\nThis file contains only the formal statement, not a proof. The Euclidean plane\nis represented by `EuclideanSpace ℝ (Fin 2)`, and \"three colours\" means an\narbitrary assignment of one of the three labels `Fin 3` to each point.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as a two-dimensional real Euclidean space. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The three available colours. -/\nabbrev Colour : Type := Fin 3\n\n/-- A three-colouring of the plane assigns one of the three colours to each point. -/\nabbrev ThreeColouring : Type := Plane → Colour\n\n/-- Two points have the same colour under a given colouring. -/\ndef SameColour (colouring : ThreeColouring) (p q : Plane) : Prop :=\n colouring p = colouring q\n\n/-- Two plane points are one unit apart, using the standard Euclidean metric. -/\ndef UnitApart (p q : Plane) : Prop :=\n dist p q = 1\n\n/--\nFor every colouring of the points of the plane by three colours, there exist\ntwo points of the same colour whose Euclidean distance is exactly one.\n-/\ndef Target : Prop :=\n ∀ (colouring : ThreeColouring),\n ∃ (p q : Plane), SameColour colouring p q ∧ UnitApart p q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "31f45981-b179-52bb-8f7d-799970e6ed48", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0fe7f5b7b77a795c1c67c66c3d139163478b18f415f6e7b3e14b0cf4ea4a6f88", "task_path": "tasks/nmp3_31f45981-b179-52bb-8f7d-799970e6ed48", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "31f45981-b179-52bb-8f7d-799970e6ed48", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_320d2228-e5a8-559a-a82a-5bc541bc4286", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be a prime and let $a\\in\\mathbb Z$ satisfy $p\\nmid a$ (equivalently $a\\neq0$ modulo $p$). Prove that the polynomial \n-- $$f(x)=x^{p}-x-a$$ \n-- is irreducible over $\\mathbb Q$ (i.e., in $\\mathbb Q[x]$).\nimport Mathlib\n\n/-!\n# Irreducibility of `X ^ p - X - a` over `ℚ`\n\nThis file formalizes the statement of the target problem. It contains only\ndefinitions of the mathematical objects and a proposition-valued target; it\ndoes not assert or prove the target.\n-/\n\nopen Polynomial\n\nnamespace Problem\n\n/-- The polynomial `x ^ p - x - a`, regarded as an element of `ℚ[x]`. -/\nnoncomputable def f (p : ℕ) (a : ℤ) : Polynomial ℚ :=\n X ^ p - X - C (a : ℚ)\n\n/-- The assertion from the problem: for every prime `p` and every integer `a`\nthat is not divisible by `p`, the polynomial `x ^ p - x - a` is irreducible\nover `ℚ`. -/\nnoncomputable def Target : Prop :=\n ∀ (p : ℕ), Nat.Prime p → ∀ (a : ℤ), ¬ ((p : ℤ) ∣ a) → Irreducible (f p a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "320d2228-e5a8-559a-a82a-5bc541bc4286", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "104f49316c63e7ebaaa1c55b08d8ca7a869f9c4145d843758e421340cc032e7e", "task_path": "tasks/nmp3_320d2228-e5a8-559a-a82a-5bc541bc4286", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "320d2228-e5a8-559a-a82a-5bc541bc4286", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_321b2c78-1467-507e-8372-f79b2e6bff46", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{1}{4a^2+ab+4b^2}+\\frac{1}{4b^2+bc+4c^2}+\\frac{1}{4c^2+ca+4a^2}\\ge \\frac{1}{\\sqrt{3\\bigl(a^2b^2+b^2c^2+c^2a^2\\bigr)}}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion in the problem: for all positive real numbers `a`, `b`, and `c`,\nthe displayed sum of reciprocal quadratic forms is at least\n`1 / Real.sqrt (3 * (a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2))`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 1 / (4 * a ^ 2 + a * b + 4 * b ^ 2) +\n 1 / (4 * b ^ 2 + b * c + 4 * c ^ 2) +\n 1 / (4 * c ^ 2 + c * a + 4 * a ^ 2) ≥\n 1 / Real.sqrt (3 * (a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "321b2c78-1467-507e-8372-f79b2e6bff46", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "173cd3575365c330b442d0434f2831b9793d6732b923c9bfeed4efcd62bcca0a", "task_path": "tasks/nmp3_321b2c78-1467-507e-8372-f79b2e6bff46", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "321b2c78-1467-507e-8372-f79b2e6bff46", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_323977dd-e030-53d3-b229-11932b96724c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all non‑negative real numbers $a,b,c$,\n-- \\[\n-- a^3+b^3+c^3+3abc\\;\\ge\\;ab\\sqrt{2(a^2+b^2)}+bc\\sqrt{2(b^2+c^2)}+ca\\sqrt{2(c^2+a^2)}.\n-- \\]\n-- (The sums $\\sum a^3$ and $\\sum ab\\sqrt{2(a^2+b^2)}$ are cyclic sums over $(a,b,c)$.)\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic inequality\n\nThis file records the statement of the problem, without proving it. The\ntarget is the proposition `Problem.Target` below.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum of a two-variable expression `f` over `(a, b, c)`:\n`f a b + f b c + f c a`. -/\ndef cyclicSum (f : ℝ → ℝ → ℝ) (a b c : ℝ) : ℝ :=\n f a b + f b c + f c a\n\n/-- The cyclic cubic sum `a^3 + b^3 + c^3`. -/\ndef sumCubes (a b c : ℝ) : ℝ :=\n cyclicSum (fun x _y => x ^ 3) a b c\n\n/-- The term `3abc`. -/\ndef tripleProduct (a b c : ℝ) : ℝ :=\n 3 * a * b * c\n\n/-- The cyclic summand `ab * sqrt (2 * (a^2 + b^2))`. -/\nnoncomputable def mixedSqrtTerm (a b : ℝ) : ℝ :=\n a * b * Real.sqrt (2 * (a ^ 2 + b ^ 2))\n\n/-- The left-hand side\n`a^3 + b^3 + c^3 + 3abc` of the stated inequality. -/\ndef leftHandSide (a b c : ℝ) : ℝ :=\n sumCubes a b c + tripleProduct a b c\n\n/-- The right-hand side\n`ab sqrt(2(a^2+b^2)) + bc sqrt(2(b^2+c^2)) + ca sqrt(2(c^2+a^2))`. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n cyclicSum mixedSqrtTerm a b c\n\n/-- The proposition asserted by the problem: for every triple of nonnegative\nreal numbers `a`, `b`, and `c`, the left-hand side is at least the\nright-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n leftHandSide a b c ≥ rightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "323977dd-e030-53d3-b229-11932b96724c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "11e44bb138c2b37144700c0c725accfda08767ac399110130870b393cfd4bddf", "task_path": "tasks/nmp3_323977dd-e030-53d3-b229-11932b96724c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "323977dd-e030-53d3-b229-11932b96724c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_328cf068-5155-53ee-9aa9-030304841e66", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for positive real numbers \\(a,b,c\\) satisfying \n-- \\[\n-- abc\\ge (a-c)(c-b)(b-a),\n-- \\]\n-- the inequality \n-- \\[\n-- a^3+b^3+c^3+3abc\\;\\ge\\;2\\bigl(a^2b+b^2c+c^2a\\bigr)\n-- \\]\n-- holds.\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe original problem asks us to prove the following assertion: for every triple of\npositive real numbers `a`, `b`, `c` satisfying the stated product inequality, the\ndisplayed cubic inequality holds. The declarations below formalize the source\nhypotheses and conclusion without asserting or proving the result.\n-/\n\nnamespace Problem\n\n/-- A real number is positive in the sense required by the problem. -/\ndef Positive (x : ℝ) : Prop :=\n 0 < x\n\n/-- The admissibility condition on the triple is exactly the source inequality. -/\ndef SourceInequality (a b c : ℝ) : Prop :=\n a * b * c ≥ (a - c) * (c - b) * (b - a)\n\n/-- The displayed conclusion of the problem. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n a ^ 3 + b ^ 3 + c ^ 3 + 3 * a * b * c ≥\n 2 * (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a)\n\n/-- The full universal assertion claimed by the problem.\n\nThe quantifier order is: one arbitrary real triple `a`, `b`, `c`; positivity of\neach component in the order `a`, `b`, `c`; the source product inequality; then the\ndisplayed cubic inequality. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Positive a →\n Positive b →\n Positive c →\n SourceInequality a b c →\n Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "328cf068-5155-53ee-9aa9-030304841e66", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "487745949b3357ebad1ed864488f7d215a511fed17ebefbf44b2a80b004ec2af", "task_path": "tasks/nmp3_328cf068-5155-53ee-9aa9-030304841e66", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "328cf068-5155-53ee-9aa9-030304841e66", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_32953e43-b88c-54b1-be09-931cbc5162e0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{1}{5a^{2}+5b^{2}-ab}+\\frac{1}{5b^{2}+5c^{2}-bc}+\\frac{1}{5c^{2}+5a^{2}-ca}\\ge\\frac{1}{a^{2}+b^{2}+c^{2}}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement\n\nOriginal problem: for all positive real numbers `a`, `b`, and `c`,\n\\[\n\\frac{1}{5a^2+5b^2-ab}+\\frac{1}{5b^2+5c^2-bc}+\\frac{1}{5c^2+5a^2-ca}\n\\ge \\frac{1}{a^2+b^2+c^2}.\n\\]\n-/\n\nnamespace Problem\n\n/-- The quadratic expression in the denominators of the cyclic terms. -/\ndef quadraticDenom (x y : ℝ) : ℝ :=\n 5 * x ^ 2 + 5 * y ^ 2 - x * y\n\n/-- The left-hand side of the claimed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / quadraticDenom a b + 1 / quadraticDenom b c + 1 / quadraticDenom c a\n\n/-- The right-hand side of the claimed inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 1 / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The assertion to be proved: the cyclic sum of reciprocals is at least the\nreciprocal of the sum of squares, whenever `a`, `b`, and `c` are positive reals. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "32953e43-b88c-54b1-be09-931cbc5162e0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ec2b795b94c404fcf7028ddab8eef9352032c4a45fd7acb42b69e2ec06e2befb", "task_path": "tasks/nmp3_32953e43-b88c-54b1-be09-931cbc5162e0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "32953e43-b88c-54b1-be09-931cbc5162e0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_32a3a7a7-9f7e-574c-bd1a-9d9b093bec7c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A positive integer is written on the board. At each step Maxim may add to the current number one of its positive divisors (including the number itself) and replace the current number with the sum. He may not add the same divisor in two consecutive steps. Prove that there exists a sequence of moves that eventually yields a perfect square.\nimport Mathlib\n\nnamespace Problem\n\n/-- A natural number `d` is a positive divisor of `n` (so `d ∣ n` and `d > 0`).\nThe case `d = n` is included automatically when `n > 0`. -/\ndef PositiveDivisor (n d : ℕ) : Prop :=\n d ∣ n ∧ 0 < d\n\n/-- A natural number is a perfect square when it is the square of a natural number. -/\ndef IsPerfectSquare (n : ℕ) : Prop :=\n ∃ q : ℕ, n = q ^ 2\n\n/-- A legal play of exactly `k` moves, beginning at `n`.\n\n`state i` is the number on the board after `i` moves, and `divisor i` is the\npositive divisor added during the `i`-th move. Thus `state 0 = n`; for every\nmove `i < k`, the added `divisor i` divides `state i` and the next state is\n`state i + divisor i`; equal divisor values are forbidden in consecutive\nmoves; and the final state `state k` is a perfect square. -/\ndef LegalPlay (n k : ℕ) (state divisor : ℕ → ℕ) : Prop :=\n state 0 = n ∧\n (∀ i : ℕ, i < k →\n PositiveDivisor (state i) (divisor i) ∧\n state (i + 1) = state i + divisor i) ∧\n (∀ i : ℕ, i + 1 < k → divisor i ≠ divisor (i + 1)) ∧\n IsPerfectSquare (state k)\n\n/-- From `n` there is some finite legal play whose final number is a perfect square. -/\ndef ReachableSquare (n : ℕ) : Prop :=\n ∃ k : ℕ, ∃ state divisor : ℕ → ℕ, LegalPlay n k state divisor\n\n/-- The assertion of the problem: for every positive integer initially written on\nthe board, there is a finite sequence of legal moves that eventually reaches a\nperfect square. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ReachableSquare n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "32a3a7a7-9f7e-574c-bd1a-9d9b093bec7c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "af650e417881fd23a64fd71b89a980223dec485dfc0efb8f6851bd99f0f00b22", "task_path": "tasks/nmp3_32a3a7a7-9f7e-574c-bd1a-9d9b093bec7c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "32a3a7a7-9f7e-574c-bd1a-9d9b093bec7c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_32c41c20-0ef6-5eec-b0c8-be0d4fbada59", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exists a natural number $n$ such that the decimal representation of $2^n$ begins with the three digits $111$ (i.e. there is an integer $k\\ge0$ with $111\\cdot10^{k}\\le 2^{n}<112\\cdot10^{k}$).\nimport Mathlib\n\nnamespace Problem\n\n/--\n`BeginsWith111 m` expresses that the decimal representation of the natural number\n`m` begins with the three digits `111`, using the equivalent integer inequality\nsupplied in the problem: for some nonnegative integer `k`,\n`111 * 10^k ≤ m < 112 * 10^k`.\n-/\ndef BeginsWith111 (m : ℕ) : Prop :=\n ∃ k : ℤ,\n 0 ≤ k ∧\n (111 : ℤ) * (10 : ℤ) ^ k.toNat ≤ (m : ℤ) ∧\n (m : ℤ) < (112 : ℤ) * (10 : ℤ) ^ k.toNat\n\n/--\nThere exists a natural number `n` such that the decimal representation of `2^n`\nbegins with the three digits `111`.\n-/\ndef Target : Prop :=\n ∃ n : ℕ, BeginsWith111 (2 ^ n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "32c41c20-0ef6-5eec-b0c8-be0d4fbada59", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "521262ee35b3c1161bbae53e4ddb422df16e660de013a6f5f7e01c64745991c2", "task_path": "tasks/nmp3_32c41c20-0ef6-5eec-b0c8-be0d4fbada59", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "32c41c20-0ef6-5eec-b0c8-be0d4fbada59", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_32feac5f-2d00-5c11-b8c0-a38ef3142768", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\mathbb{N}^2$ denote the set of ordered pairs of positive integers. A finite subset $S\\subset\\mathbb{N}^2$ is called **stable** if whenever $(x,y)\\in S$, then every $(x',y')\\in\\mathbb{N}^2$ with $x'\\le x$ and $y'\\le y$ also belongs to $S$. Prove that for any stable set $S$, among all stable subsets of $S$ (including $\\emptyset$ and $S$ itself) at least half have an even number of elements.\nimport Mathlib.Data.PNat.Basic\nimport Mathlib.Data.Finset.Powerset\nimport Mathlib.Data.Finset.Card\n\n/-!\n# Formalization of the stable-subset parity problem\n\nThe source problem uses `ℕ²` for ordered pairs of *positive* integers. We\nrepresent that ambient set as `ℕ+ × ℕ+`. A finite set is represented by a\n`Finset`, and downward closure is expressed literally in terms of the two\ncoordinate inequalities.\n-/\n\nnamespace Problem\n\n/-- The ambient set `ℕ²` of ordered pairs of positive integers. -/\nabbrev Point : Type := ℕ+ × ℕ+\n\n/-- A finite subset `S` of `Point` is stable when it is downward closed\ncoordinatewise: whenever `p ∈ S`, every positive-integer pair whose two\ncoordinates are at most the corresponding coordinates of `p` lies in `S`. -/\ndef Stable (S : Finset Point) : Prop :=\n ∀ p ∈ S, ∀ q : Point, q.1 ≤ p.1 → q.2 ≤ p.2 → q ∈ S\n\n/-- The admissibility predicate for a stable subset of `S`: `T` is a subset of\n`S` and is itself stable. -/\ndef StableSubset (S T : Finset Point) : Prop :=\n T ⊆ S ∧ Stable T\n\n/-- The finite family of all stable subsets of `S`. Taking the powerset cuts\nthe ambient type down to the finite family of all subsets of `S`; filtering by\n`Stable` then keeps exactly the stable ones. -/\nnoncomputable def stableSubsets (S : Finset Point) : Finset (Finset Point) := by\n classical\n exact S.powerset.filter (fun T => Stable T)\n\n/-- The subfamily of stable subsets of `S` having an even number of elements. -/\nnoncomputable def evenStableSubsets (S : Finset Point) : Finset (Finset Point) := by\n classical\n exact (stableSubsets S).filter (fun T => Even T.card)\n\n/-- The statement to be proved: for every stable finite subset `S` of\n`ℕ+ × ℕ+`, at least half of its stable subsets have even cardinality.\n\nThe inequality `#(stableSubsets S) ≤ 2 * #(evenStableSubsets S)` is the\nnatural-number formulation of \"at least half\"; it says that the number of\neven-cardinality stable subsets is at least the number of odd-cardinality\nstable subsets. -/\ndef Target : Prop :=\n ∀ S : Finset Point,\n Stable S → (stableSubsets S).card ≤ 2 * (evenStableSubsets S).card\n\n\n/-- Membership in the family of stable subsets is exactly the admissibility\npredicate: being a subset of `S` and being stable. -/\ntheorem mem_stableSubsets_iff {S T : Finset Point} :\n T ∈ stableSubsets S ↔ StableSubset S T := by\n classical\n simp [stableSubsets, StableSubset]\n\n/-- The empty set is one of the stable subsets counted for any underlying `S`\n(and it has even cardinality). -/\ntheorem empty_mem_stableSubsets (S : Finset Point) :\n (∅ : Finset Point) ∈ stableSubsets S := by\n classical\n rw [mem_stableSubsets_iff]\n constructor\n · exact Finset.empty_subset S\n · intro p hp\n simp at hp\n\n/-- The empty stable subset has even cardinality, so it is counted among the\neven-cardinality stable subsets. -/\ntheorem empty_mem_evenStableSubsets (S : Finset Point) :\n (∅ : Finset Point) ∈ evenStableSubsets S := by\n classical\n simp [evenStableSubsets, empty_mem_stableSubsets S]\n\n/-- If `S` is stable, then `S` itself is one of the stable subsets counted. -/\ntheorem self_mem_stableSubsets {S : Finset Point} (hS : Stable S) :\n S ∈ stableSubsets S := by\n classical\n rw [mem_stableSubsets_iff]\n exact ⟨Finset.Subset.refl S, hS⟩\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "32feac5f-2d00-5c11-b8c0-a38ef3142768", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c1d747ae8642beca930de030234319601d1b78ef49d2cc0124aa023645b6f891", "task_path": "tasks/nmp3_32feac5f-2d00-5c11-b8c0-a38ef3142768", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "32feac5f-2d00-5c11-b8c0-a38ef3142768", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_331df96a-504d-5fd6-b756-4371edec99a3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ and $a_1,\\dots,a_k$ be positive integers with \n-- $$n>a_1>a_2>\\cdots>a_k.$$ \n-- Assume that for every pair $i,j$ we have \n-- $$\\operatorname{lcm}(a_i,a_j)\\le n.$$ \n-- Prove that for each $i=1,2,\\dots,k$ \n-- $$i\\,a_i\\le n.$$\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe problem asks us to prove the following statement.\n\nLet `n` and `a_1, ..., a_k` be positive integers with\n`n > a_1 > a_2 > ... > a_k`, and suppose that\n`lcm (a_i) (a_j) ≤ n` for every pair `i, j`. Then\n`i * a_i ≤ n` for every `i = 1, ..., k`.\n\nWe use `Fin k` for the index set `{1, ..., k}`. The zero-based `Fin`\nindex `i` corresponds to the problem's one-based index `i.val + 1`.\nThe statement is recorded as a proposition rather than proved.\n-/\n\nnamespace Problem\n\n/-- The length `k` of the nonempty sequence `a_1, ..., a_k`. -/\ndef HasPositiveLength (k : ℕ) : Prop :=\n 0 < k\n\n/-- Every term of the sequence is a positive integer. -/\ndef HasPositiveTerms (k : ℕ) (a : Fin k → ℕ) : Prop :=\n ∀ i : Fin k, 0 < a i\n\n/-- The sequence is strictly decreasing in the source order\n`a_1 > a_2 > ... > a_k`. -/\ndef StrictlyDescending (k : ℕ) (a : Fin k → ℕ) : Prop :=\n ∀ i j : Fin k, i < j → a j < a i\n\n/-- Every term is below `n`; together with `StrictlyDescending`, this\nrepresents `n > a_1 > a_2 > ... > a_k`. -/\ndef AllTermsBelow (n k : ℕ) (a : Fin k → ℕ) : Prop :=\n ∀ i : Fin k, a i < n\n\n/-- The pairwise least-common-multiple bound. -/\ndef PairwiseLcmBound (n k : ℕ) (a : Fin k → ℕ) : Prop :=\n ∀ i j : Fin k, Nat.lcm (a i) (a j) ≤ n\n\n/-- The admissibility conditions on `n`, `k`, and the sequence\n`a : Fin k → ℕ`.\n\nThe sequence has positive length, `n` is a positive integer, every term is\npositive, the terms are strictly decreasing in the stated order, every term\nis less than `n` (in particular `n > a_1`), and every pairwise least common\nmultiple is at most `n`. -/\ndef IsAdmissible (n k : ℕ) (a : Fin k → ℕ) : Prop :=\n HasPositiveLength k ∧\n 0 < n ∧\n HasPositiveTerms k a ∧\n StrictlyDescending k a ∧\n AllTermsBelow n k a ∧\n PairwiseLcmBound n k a\n\n/-- The asserted conclusion: for each one-based index `i = 1, ..., k`,\nthe product `i * a_i` is at most `n`. -/\ndef Claim (n k : ℕ) (a : Fin k → ℕ) : Prop :=\n ∀ i : Fin k, (i.val + 1) * a i ≤ n\n\n/-- The theorem statement for a fixed `n`, `k`, and sequence `a`: from the\nadmissibility hypotheses, the claimed one-based product bound follows. -/\ndef TargetAt (n k : ℕ) (a : Fin k → ℕ) : Prop :=\n IsAdmissible n k a → Claim n k a\n\n/-- The full universal proposition stated by the problem: for all positive\nintegers `n` and `k` and all sequences `a_1, ..., a_k` satisfying the\nadmissibility hypotheses, the conclusion `i * a_i ≤ n` holds for every\n`i = 1, ..., k`. -/\ndef Target : Prop :=\n ∀ (n k : ℕ) (a : Fin k → ℕ), TargetAt n k a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "331df96a-504d-5fd6-b756-4371edec99a3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a0748a258de6742057e338f81f5f9cc3d04a544d16accfec483f77eb10516fbe", "task_path": "tasks/nmp3_331df96a-504d-5fd6-b756-4371edec99a3", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "331df96a-504d-5fd6-b756-4371edec99a3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_333d1045-cf30-581e-b926-4627c05a2f7e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a regular tetrahedron. Let $M$ be an arbitrary point in space and let $G_{a},G_{b},G_{c},G_{d}$ denote the centroids of the faces $BCD,\\;ACD,\\;ABD,\\;ABC$, respectively. Prove that \n-- \\[\n-- MG_{a}+MG_{b}+MG_{c}+MG_{d}\\;\\ge\\;\\frac13\\bigl(MA+MB+MC+MD\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the tetrahedron centroid-distance inequality\n\nThe ambient space is the three-dimensional Euclidean space. A regular\ntetrahedron is represented by four affinely independent vertices with all six\nmutual distances equal to a positive number. Face centroids are the arithmetic means of the\nthree vertices of the corresponding face.\n-/\n\nnamespace Problem\n\n/-- The centroid (arithmetic mean) of three points in three-dimensional\nEuclidean space. -/\nnoncomputable def faceCentroid\n (X Y Z : EuclideanSpace ℝ (Fin 3)) : EuclideanSpace ℝ (Fin 3) :=\n (1 / 3 : ℝ) • (X + Y + Z)\n\n/-- `A`, `B`, `C`, `D` are the vertices of a nondegenerate regular tetrahedron:\nthe four points are affinely independent, all six pairwise distances are equal,\nand that common distance is positive. -/\ndef RegularTetrahedron\n (A B C D : EuclideanSpace ℝ (Fin 3)) : Prop :=\n AffineIndependent ℝ ![A, B, C, D] ∧\n 0 < dist A B ∧\n dist A B = dist A C ∧\n dist A B = dist A D ∧\n dist A B = dist B C ∧\n dist A B = dist B D ∧\n dist A B = dist C D\n\n/-- The assertion that for every regular tetrahedron `ABCD` and every point\n`M` in three-dimensional Euclidean space, the sum of the four distances from\n`M` to the face centroids is at least one third of the sum of the four\ndistances from `M` to the vertices. -/\ndef Target : Prop :=\n ∀ A B C D : EuclideanSpace ℝ (Fin 3),\n RegularTetrahedron A B C D →\n ∀ M : EuclideanSpace ℝ (Fin 3),\n (dist M (faceCentroid B C D) +\n dist M (faceCentroid A C D) +\n dist M (faceCentroid A B D) +\n dist M (faceCentroid A B C)) ≥\n (1 / 3 : ℝ) * (dist M A + dist M B + dist M C + dist M D)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "333d1045-cf30-581e-b926-4627c05a2f7e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1d6368dd5637f517a40121c948fce697de0cd8ecdd47681be16f859fac547b60", "task_path": "tasks/nmp3_333d1045-cf30-581e-b926-4627c05a2f7e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "333d1045-cf30-581e-b926-4627c05a2f7e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_334e6809-8fcf-58dd-ba06-1a134e80bd10", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=8$. Prove that \n-- \\[\n-- \\frac{a^2}{\\sqrt{(1+a^3)(1+b^3)}}+\\frac{b^2}{\\sqrt{(1+b^3)(1+c^3)}}+\\frac{c^2}{\\sqrt{(1+c^3)(1+a^3)}}\\ge\\frac{4}{3}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the positive-real inequality\n\nThis file records the target statement of the problem. It does not contain a\nproof of the inequality.\n-/\n\nnamespace Problem\n\n/-- The first summand, with denominator involving the square roots of\n`1 + a^3` and `1 + b^3`. -/\nnoncomputable def firstTerm (a b : ℝ) : ℝ :=\n a ^ 2 / Real.sqrt ((1 + a ^ 3) * (1 + b ^ 3))\n\n/-- The second summand, with denominator involving the square roots of\n`1 + b^3` and `1 + c^3`. -/\nnoncomputable def secondTerm (b c : ℝ) : ℝ :=\n b ^ 2 / Real.sqrt ((1 + b ^ 3) * (1 + c ^ 3))\n\n/-- The third summand, with denominator involving the square roots of\n`1 + c^3` and `1 + a^3`. -/\nnoncomputable def thirdTerm (c a : ℝ) : ℝ :=\n c ^ 2 / Real.sqrt ((1 + c ^ 3) * (1 + a ^ 3))\n\n/-- The complete left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n firstTerm a b + secondTerm b c + thirdTerm c a\n\n/-- The assertion stated in the problem: for all positive real numbers\n`a`, `b`, and `c` whose product is `8`, the displayed sum is at least `4/3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 8 →\n lhs a b c ≥ (4 : ℝ) / 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "334e6809-8fcf-58dd-ba06-1a134e80bd10", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9fab2018fbcfacc9790b9e16fcb747375bb86ee26f7b9b03c8aada11b39f4547", "task_path": "tasks/nmp3_334e6809-8fcf-58dd-ba06-1a134e80bd10", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "334e6809-8fcf-58dd-ba06-1a134e80bd10", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_33661391-c762-5548-8943-de76e24b75f7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) with \\(a+b+c=3\\). Prove that\n-- \\[\n-- \\frac{a}{1+(b+c)^2}+\\frac{b}{1+(c+a)^2}+\\frac{c}{1+(a+b)^2}\\le\\frac{3(a^2+b^2+c^2)}{a^2+b^2+c^2+12abc}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the given inequality problem\n\nThe problem asks to prove a single inequality under the conditions\n`a > 0`, `b > 0`, `c > 0`, and `a + b + c = 3`.\n\nThe source does not spell out the ambient number system; the standard\nreal-valued interpretation is used, so the variables have type `ℝ`.\nNo separate nonzero-denominator hypothesis is added: the stated positivity\nconditions imply that the right-hand denominator is positive.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n a / (1 + (b + c) ^ 2) + b / (1 + (c + a) ^ 2) + c / (1 + (a + b) ^ 2)\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n 3 * (a ^ 2 + b ^ 2 + c ^ 2) / (a ^ 2 + b ^ 2 + c ^ 2 + 12 * a * b * c)\n\n/-- The admissibility conditions stated in the problem. -/\ndef admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The complete proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, admissible a b c → leftHandSide a b c ≤ rightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "33661391-c762-5548-8943-de76e24b75f7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "58c3eb298b96853f57b167ebec2bb408142e587687c0c9c1494c42bafcf33f1d", "task_path": "tasks/nmp3_33661391-c762-5548-8943-de76e24b75f7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "33661391-c762-5548-8943-de76e24b75f7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_337ddb40-1a07-531d-925b-dcbe21dbfeb9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a}{a+b}+\\frac{b}{b+c}+\\frac{c}{c+a}\\;\\ge\\;\\frac32\\;\\sqrt[6]{\\frac{ab+bc+ca}{\\,a^{2}+b^{2}+c^{2}\\,}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThis file formalizes the assertion in `problem.md` without proving it. The\nnotation `Real.rpow x (1 / 6)` is the principal real sixth root; on the\npositive radicand appearing below it coincides with the usual real sixth root.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality:\n`a / (a + b) + b / (b + c) + c / (c + a)`. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / (a + b) + b / (b + c) + c / (c + a)\n\n/-- The radicand `(ab + bc + ca) / (a^2 + b^2 + c^2)`. -/\nnoncomputable def radicand (a b c : ℝ) : ℝ :=\n (a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The principal real sixth root of a nonnegative real number. -/\nnoncomputable def sixthRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 6 : ℝ)\n\n/-- The right-hand side of the inequality:\n`(3 / 2) * ((ab + bc + ca) / (a^2 + b^2 + c^2))^(1/6)`. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (3 / 2 : ℝ) * sixthRoot (radicand a b c)\n\n/-- The admissibility condition `a > 0`, `b > 0`, and `c > 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The full universally quantified statement from the problem: for all\npositive real numbers `a`, `b`, and `c`, the left-hand side is at least the\nright-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "337ddb40-1a07-531d-925b-dcbe21dbfeb9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9aee19696eb4f61e229f49c36d962db69466c50b2c41438b9c3463756a993974", "task_path": "tasks/nmp3_337ddb40-1a07-531d-925b-dcbe21dbfeb9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "337ddb40-1a07-531d-925b-dcbe21dbfeb9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_338384d3-f8f4-5d59-a667-f88ed6d65541", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all real numbers $a$, $b$, and $c$, prove that \n-- \\[\n-- 4(a+b+c)^2(ab+ac+bc)^2+81a^2b^2c^2\\ge 15\\,abc\\,(a+b+c)^3.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the real inequality problem\n\nThe source problem asks to prove, for all real numbers `a`, `b`, and `c`, the\ninequality\n`4 (a+b+c)^2 (ab+ac+bc)^2 + 81 a^2 b^2 c^2 ≥ 15 abc (a+b+c)^3`.\n\nThis file only records the mathematical statement. It contains no proof of it.\n-/\n\nnamespace Problem\n\n/-- The scalar inequality whose universal closure is the problem's target. -/\ndef Inequality (a b c : ℝ) : Prop :=\n 4 * (a + b + c) ^ 2 * (a * b + a * c + b * c) ^ 2\n + 81 * (a ^ 2 * b ^ 2 * c ^ 2)\n ≥ 15 * (a * b * c) * (a + b + c) ^ 3\n\n/-- The assertion stated by the problem: the inequality holds for all real\n`a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "338384d3-f8f4-5d59-a667-f88ed6d65541", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fe1fab8637da31bb6f6f244265569b4263e71b74be503cd92ad2663657b4733d", "task_path": "tasks/nmp3_338384d3-f8f4-5d59-a667-f88ed6d65541", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "338384d3-f8f4-5d59-a667-f88ed6d65541", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_339d4899-2da6-592b-a5f3-9ac1aa809f1e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\mathbb{R}_0$ denote the set of nonnegative real numbers. Prove that for all $x,y,z\\in\\mathbb{R}_0$ satisfying $x^2+y^2+z^2=3$, the inequality \n-- \\[\n-- \\frac{1}{1+x^2}+\\frac{1}{1+y^2}+\\frac{1}{1+z^2}\\le \\frac{27}{2(x+y+z)^2}\n-- \\]\n-- holds.\nimport Mathlib\n\n/-!\n# Formalization of the nonnegative-real inequality problem\n\nThe source problem defines `R₀` to be the set of nonnegative real numbers and\nasks for a proof of the given inequality for all `x, y, z ∈ R₀` whose squares\nsum to `3`.\n-/\n\nnamespace Problem\n\n/-- The source notation `ℝ₀`: the set of nonnegative real numbers. -/\ndef R0 : Set ℝ := {x : ℝ | 0 ≤ x}\n\n/--\nFor all nonnegative real numbers `x`, `y`, and `z` satisfying\n`x^2 + y^2 + z^2 = 3`, the stated inequality holds.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n x ∈ R0 →\n y ∈ R0 →\n z ∈ R0 →\n x ^ 2 + y ^ 2 + z ^ 2 = 3 →\n 1 / (1 + x ^ 2) + 1 / (1 + y ^ 2) + 1 / (1 + z ^ 2) ≤\n (27 : ℝ) / (2 * (x + y + z) ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "339d4899-2da6-592b-a5f3-9ac1aa809f1e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1f825f51e89e8bdbd9589d0636d2ddf2bedc71b27a51a086b0fe367c7f4ce522", "task_path": "tasks/nmp3_339d4899-2da6-592b-a5f3-9ac1aa809f1e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "339d4899-2da6-592b-a5f3-9ac1aa809f1e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_33adb138-0b5e-50f1-9f14-2d2a8a31bec5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{(a+b+c)^3}{8abc}\\ge\\frac{(a^2+ab+bc)(b^2+bc+ca)(c^2+ca+ab)}{(a^2+bc)(b^2+ca)(c^2+ab)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable inequality\n\nThe original problem asks to prove an inequality for positive real numbers\n`a`, `b`, and `c`. We encode the assertion as a proposition rather than\nproving it.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a + b + c) ^ 3 / (8 * a * b * c)\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n ((a ^ 2 + a * b + b * c) *\n (b ^ 2 + b * c + c * a) *\n (c ^ 2 + c * a + a * b)) /\n ((a ^ 2 + b * c) * (b ^ 2 + c * a) * (c ^ 2 + a * b))\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the quotient\n`(a + b + c)^3 / (8abc)` is at least the quotient displayed in the problem.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "33adb138-0b5e-50f1-9f14-2d2a8a31bec5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "74783de306efb690613c1df7191a5400f97133eb37e5af61691a3d95f7d5072d", "task_path": "tasks/nmp3_33adb138-0b5e-50f1-9f14-2d2a8a31bec5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "33adb138-0b5e-50f1-9f14-2d2a8a31bec5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_33ee6c1e-6177-50b1-8112-a0529e27fb5a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ satisfy $xyz=1$. Prove that \n-- \\[\n-- \\sqrt{\\frac{x^2y+x^2z}{(y+z+1)^2}}+\\sqrt{\\frac{y^2z+y^2x}{(z+x+1)^2}}+\\sqrt{\\frac{z^2x+z^2y}{(x+y+1)^2}}\\ge\\sqrt2.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\n/-!\n# Formalization of the target inequality\n\nThe original problem asks to prove an inequality for positive real numbers\n`x`, `y`, and `z` whose product is one. This file only states the target;\nit does not provide a proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The admissibility assumptions from the problem: `x`, `y`, and `z` are\npositive and their product is `1`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x * y * z = 1\n\n/-- The left-hand side of the desired inequality. -/\ndef LHS (x y z : ℝ) : ℝ :=\n Real.sqrt ((x ^ 2 * y + x ^ 2 * z) / (y + z + 1) ^ 2) +\n Real.sqrt ((y ^ 2 * z + y ^ 2 * x) / (z + x + 1) ^ 2) +\n Real.sqrt ((z ^ 2 * x + z ^ 2 * y) / (x + y + 1) ^ 2)\n\n/-- The right-hand side of the desired inequality. -/\ndef RHS : ℝ :=\n Real.sqrt 2\n\n/-- The complete statement of the problem: for every triple of positive real\nnumbers with product one, the prescribed sum of square roots is at least\n`Real.sqrt 2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → LHS x y z ≥ RHS\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "33ee6c1e-6177-50b1-8112-a0529e27fb5a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "34140357feb4d42dd96b48a0c2008c76862682755197d5727aefcf686dc1d603", "task_path": "tasks/nmp3_33ee6c1e-6177-50b1-8112-a0529e27fb5a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "33ee6c1e-6177-50b1-8112-a0529e27fb5a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_340b18cd-9eed-5179-9b93-f44d7bad5440", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x, y, z$ be positive real numbers. Prove that \n-- $$\\frac{(2x+4y+3)(2y+4z+3)(2z+4x+3)}{xy+yz+zx}\\ge 243.$$\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement\n\nThis module formalizes the inequality stated in `problem.md`. It only defines the\nmathematical assertion as a `Prop`; no proof of the assertion is supplied.\n-/\n\nnamespace Problem\n\n/--\nFor all positive real numbers `x`, `y`, and `z`, the product\n`(2x + 4y + 3)(2y + 4z + 3)(2z + 4x + 3)`, divided by `xy + yz + zx`,\nis at least `243`.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n 243 ≤\n ((2 * x + 4 * y + 3) * (2 * y + 4 * z + 3) * (2 * z + 4 * x + 3)) /\n (x * y + y * z + z * x)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "340b18cd-9eed-5179-9b93-f44d7bad5440", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "200dbffa1c2eafc2375b78abcc06476cb62be447930cfbf8d62f7e52a9ef8176", "task_path": "tasks/nmp3_340b18cd-9eed-5179-9b93-f44d7bad5440", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "340b18cd-9eed-5179-9b93-f44d7bad5440", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_342767ec-db2f-57cd-895c-b204ee0df134", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle. Prove that \n-- \\[\n-- (a^2b+b^2c+c^2a)^2 \\ge abc\\,(a+b+c)(a^2+b^2+c^2).\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Triangle side-length inequality\n\nThis file formalizes the statement of the problem. A triple of real numbers is\nregarded as the side lengths of a (nondegenerate) triangle exactly when all three\nlengths are positive and the three strict triangle inequalities hold.\n-/\n\nnamespace Problem\n\n/-- `TriangleSideLengths a b c` says that `a`, `b`, and `c` are the side lengths\nof a nondegenerate triangle: the lengths are positive and each side is strictly\nless than the sum of the other two. -/\ndef TriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a < b + c ∧ b < c + a ∧ c < a + b\n\n/-- The inequality asserted in the problem, for all real side lengths `a`, `b`,\nand `c` of a triangle. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, TriangleSideLengths a b c →\n (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a) ^ 2 ≥\n a * b * c * (a + b + c) * (a ^ 2 + b ^ 2 + c ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "342767ec-db2f-57cd-895c-b204ee0df134", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "48cc188980af202328a941d912019808cfa2d157099142c7bb1f0482cbf10e63", "task_path": "tasks/nmp3_342767ec-db2f-57cd-895c-b204ee0df134", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "342767ec-db2f-57cd-895c-b204ee0df134", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_342c149b-7807-5727-b007-826d82e7c415", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that for all real numbers $x,y,z$ the identity\n-- \\[\n-- (f(x)+1)\\bigl(f(y)+f(z)\\bigr)=f(xy+z)+f(xz-y)\n-- \\]\n-- holds.\nimport Mathlib\n\n/-!\n# Formal statement for the real functional equation\n\nThe source problem asks for all functions `f : ℝ → ℝ` satisfying\n\n`(f x + 1) * (f y + f z) = f (x * y + z) + f (x * z - y)`\n\nfor every `x y z : ℝ`.\n\nThe declarations below separate:\n\n* `Admissible`: the original defining predicate on a function;\n* `SoundAnswer` and `CompleteAnswer`: the two directions of a complete\n classification for a proposed solution set;\n* `CompleteAnswerCorrect`: both directions together;\n* `CandidateSolutionSet` and `Target`: the concrete complete-answer claim\n that the admissible functions are exactly the zero function and `x ↦ x^2`.\n-/\n\nnamespace Problem\n\n/-- A function `f : ℝ → ℝ` satisfies the functional equation of the problem. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ x y z : ℝ,\n (f x + 1) * (f y + f z) = f (x * y + z) + f (x * z - y)\n\n/-- The soundness direction of a proposed answer: every function in the\nproposed answer set is admissible. -/\ndef SoundAnswer (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, f ∈ S → Admissible f\n\n/-- The completeness direction of a proposed answer: every admissible\nfunction belongs to the proposed answer set. -/\ndef CompleteAnswer (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, Admissible f → f ∈ S\n\n/-- A proposed set of functions is a correct complete answer exactly when it\nhas both the soundness and completeness directions. -/\ndef CompleteAnswerCorrect (S : Set (ℝ → ℝ)) : Prop :=\n SoundAnswer S ∧ CompleteAnswer S\n\n/-- The generic correctness predicate for a proposed answer set, stated as\nthe usual biconditional characterization. -/\ndef AnswerCorrect (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, f ∈ S ↔ Admissible f\n\n/-- The concrete candidate answer: either the identically zero function or\nthe squaring function. -/\ndef CandidateSolutionSet : Set (ℝ → ℝ) :=\n {f | f = (fun _ : ℝ => (0 : ℝ)) ∨ f = (fun x : ℝ => x ^ 2)}\n\n/-- The parameterized target: a proposed set `S` is a complete answer to the\nproblem. -/\ndef TargetFor (S : Set (ℝ → ℝ)) : Prop :=\n CompleteAnswerCorrect S\n\n/-- The closed target for the concrete candidate answer. -/\ndef Target : Prop :=\n CompleteAnswerCorrect CandidateSolutionSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "342c149b-7807-5727-b007-826d82e7c415", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b27c3d3a88d07d206277fc908465142481b809fe0ddcc29a864f1180fa7dbab9", "task_path": "tasks/nmp3_342c149b-7807-5727-b007-826d82e7c415", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "342c149b-7807-5727-b007-826d82e7c415", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_343291f6-9f3f-563d-aa7e-996b738c2666", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be real numbers satisfying $0\\sin2x+\\sin2y+\\sin2z\\,.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\nimport Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic\n\n/-!\n# Formal statement for the trigonometric inequality problem\n\nThe source problem asks, for real numbers `x`, `y`, and `z` in the interval\n`(0, π/2)` with `x < y < z`, to prove a strict inequality involving\n`Real.sqrt 2`, sines, and cosines.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/--\nFor all real numbers `x`, `y`, and `z` satisfying\n`0 < x < y < z < π/2`, the inequality\n\n`sqrt 2 + 2 sin x cos y + 2 sin y cos z\n > sin (2 x) + sin (2 y) + sin (2 z)`\n\nholds.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n x < y →\n y < z →\n z < Real.pi / 2 →\n (Real.sqrt 2 + 2 * Real.sin x * Real.cos y +\n 2 * Real.sin y * Real.cos z) >\n (Real.sin (2 * x) + Real.sin (2 * y) + Real.sin (2 * z))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "343291f6-9f3f-563d-aa7e-996b738c2666", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f40a7bd5b7f5a66568fa7818379a018fe65738a673199f18a382a3b4fa3b20f2", "task_path": "tasks/nmp3_343291f6-9f3f-563d-aa7e-996b738c2666", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "343291f6-9f3f-563d-aa7e-996b738c2666", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_34bb763b-7a5d-566a-973c-49786697bc7a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $b\\ge 2$ be a fixed integer and let $s_b(n)$ denote the sum of the base‑$b$ digits of a positive integer $n$. Prove that there are infinitely many positive integers that cannot be written in the form $n+s_b(n)$ for any positive integer $n\\,. $\nimport Mathlib.Data.Nat.Digits.Lemmas\nimport Mathlib.Data.Set.Finite.Basic\n\n/-!\n# Base-`b` digit-sum nonrepresentability\n\nThis file formalizes the statement of the problem. It does not prove the\nassertion: `Problem.Target` is a proposition-valued definition.\n-/\n\nnamespace Problem\n\n/-- `digitSum b n` is the sum of the base-`b` digits of `n`.\n\nFor the intended values `2 ≤ b` and `0 < n`, `Nat.digits b n` is the usual\nfinite little-endian list of base-`b` digits of `n`. Its order is irrelevant\nto the sum. -/\ndef digitSum (b n : ℕ) : ℕ :=\n (Nat.digits b n).sum\n\n/-- A natural number `m` is written as `n + s_b(n)` for some positive input\n`n`. The base is an explicit natural-number parameter. -/\ndef IsDigitSumValue (b m : ℕ) : Prop :=\n ∃ n : ℕ, 0 < n ∧ m = n + digitSum b n\n\n/-- A positive integer that is not of the form `n + s_b(n)` for any positive\ninteger `n`. -/\ndef NonDigitSumValue (b m : ℕ) : Prop :=\n 0 < m ∧ ¬ IsDigitSumValue b m\n\n/-- For every integer `b ≥ 2`, infinitely many positive integers are not of\nthe form `n + s_b(n)` for a positive integer `n`.\n\nThe universal quantifier over `b` formalizes the phrase \"let `b ≥ 2` be a\nfixed integer\": the assertion is to hold for an arbitrary admissible base. -/\ndef Target : Prop :=\n ∀ b : ℕ, 2 ≤ b →\n Set.Infinite {m : ℕ | NonDigitSumValue b m}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "34bb763b-7a5d-566a-973c-49786697bc7a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c0444b6c5c7fd78ce4c0a2c8ae893cf4855e61825f45fc39c13f12b238753bea", "task_path": "tasks/nmp3_34bb763b-7a5d-566a-973c-49786697bc7a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "34bb763b-7a5d-566a-973c-49786697bc7a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_34eec1db-9afa-543e-9aba-2a5afcfe253f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f(x)$ be a polynomial with integer coefficients and degree at least $1$. Prove that there exist infinitely many prime numbers $p$ for which there is an integer $n$ such that $f(n)\\neq0$ and $p\\mid f(n)$ (equivalently, $|f(n)|$ is a multiple of $p$).\nimport Mathlib\n\n/-!\n# Infinitely many primes dividing values of an integer polynomial\n\nThis file formalizes the statement of the problem without proving it.\n-/\n\nnamespace Problem\n\n/-- A prime `p` is admissible for an integer polynomial `f` when some integer\ninput gives a nonzero value of `f` divisible by `p`. The divisibility is\ntaken in `ℤ`, after coercing the natural-number prime to an integer. -/\ndef AdmissiblePrime (f : Polynomial ℤ) (p : ℕ) : Prop :=\n Nat.Prime p ∧ ∃ n : ℤ, f.eval n ≠ 0 ∧ (p : ℤ) ∣ f.eval n\n\n/-- The assertion of the problem: for every integer polynomial of degree at\nleast one, infinitely many primes are admissible in the sense above. -/\ndef Target : Prop :=\n ∀ f : Polynomial ℤ, 1 ≤ f.natDegree → Set.Infinite {p : ℕ | AdmissiblePrime f p}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "34eec1db-9afa-543e-9aba-2a5afcfe253f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "030a0ce1a227bb901ebd51c78d31d0920f8141f60abadaca624f9942b927fb00", "task_path": "tasks/nmp3_34eec1db-9afa-543e-9aba-2a5afcfe253f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "34eec1db-9afa-543e-9aba-2a5afcfe253f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_353d8ae2-b41b-5ebc-af9f-e3f60445789b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ satisfy $xy+yz+zx=1$. Prove that\n-- \\[\n-- \\frac1{1+x^2}+\\frac1{1+y^2}+\\frac1{1+z^2}\\;\\ge\\;\\frac23\\Bigg(\\frac{x}{\\sqrt{1+x^2}}+\\frac{y}{\\sqrt{1+y^2}}+\\frac{z}{\\sqrt{1+z^2}}\\Bigg)^3.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the stated inequality\n\nThe problem asks to prove, for all positive real numbers `x`, `y`, and `z`\nsatisfying `xy + yz + zx = 1`, the inequality\n\n`∑ 1 / (1 + x²) ≥ (2 / 3) * (∑ x / sqrt (1 + x²))³`.\n\nThe propositions below are declarations only; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real variables in the problem:\nall three are positive and their pairwise cyclic products satisfy\n`xy + yz + zx = 1`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x * y + y * z + z * x = 1\n\n/-- The left-hand side of the required inequality. -/\nnoncomputable def leftHandSide (x y z : ℝ) : ℝ :=\n 1 / (1 + x ^ 2) + 1 / (1 + y ^ 2) + 1 / (1 + z ^ 2)\n\n/-- The right-hand side of the required inequality. -/\nnoncomputable def rightHandSide (x y z : ℝ) : ℝ :=\n (2 / 3 : ℝ) *\n (x / Real.sqrt (1 + x ^ 2) +\n y / Real.sqrt (1 + y ^ 2) +\n z / Real.sqrt (1 + z ^ 2)) ^ 3\n\n/-- The inequality claimed under the admissibility conditions. -/\nnoncomputable def Inequality (x y z : ℝ) : Prop :=\n leftHandSide x y z ≥ rightHandSide x y z\n\n/-- The full universally quantified statement of the problem. -/\nnoncomputable def Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "353d8ae2-b41b-5ebc-af9f-e3f60445789b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ea42a30050ad17bee8b14b55b4c0c6a26875d49a4e45ff7249d93fab381e3e62", "task_path": "tasks/nmp3_353d8ae2-b41b-5ebc-af9f-e3f60445789b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "353d8ae2-b41b-5ebc-af9f-e3f60445789b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_353de6e1-4e39-590e-96f3-58776e5fea58", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that it is possible to colour the lattice points of the plane with two colours so that no axis‑parallel rectangle whose vertices are lattice points and whose area equals a power of 2 (i.e. $2^n$ for some non‑negative integer $n$) has all four vertices the same colour.\nimport Mathlib\n\n/-!\n# Formal statement of the two-colouring problem for lattice rectangles\n\nThe problem asks whether the lattice points of the plane can be given a two-colouring\nwith no monochromatic axis-parallel rectangle of area `2 ^ n` for a natural\nnumber `n`.\n\nThe plane lattice is represented by the type `ℤ × ℤ`. An axis-parallel\nnondegenerate rectangle is represented by its lower-left and upper-right corner\ncoordinates `(x₁, y₁)` and `(x₂, y₂)`, with `x₁ < x₂` and `y₁ < y₂`. Its area is\nthe product of its two positive integer side lengths.\n-/\n\nnamespace Problem\n\n/-- The lattice points of the plane, represented by pairs of integer coordinates. -/\nabbrev LatticePoint : Type := ℤ × ℤ\n\n/-- The oriented area of the axis-parallel rectangle determined by integer\ncoordinates `x₁`, `x₂`, `y₁`, `y₂`, using the product of the two coordinate\ndifferences. For the rectangles quantified in `AdmissibleColoring`, the\ndifferences are positive and hence this is their ordinary geometric area. -/\ndef RectangleArea (x₁ x₂ y₁ y₂ : ℤ) : ℤ :=\n (x₂ - x₁) * (y₂ - y₁)\n\n/-- The area of the rectangle determined by `x₁`, `x₂`, `y₁`, `y₂` is a power\nof two, with a non-negative integer exponent. -/\ndef HasPowerOfTwoArea (x₁ x₂ y₁ y₂ : ℤ) : Prop :=\n ∃ n : ℕ, RectangleArea x₁ x₂ y₁ y₂ = (2 : ℤ) ^ n\n\n/-- The four lattice points `(x₁, y₁)`, `(x₂, y₁)`, `(x₁, y₂)`, and\n`(x₂, y₂)` all have the same colour under `c`. -/\ndef RectangleAllSameColor (c : LatticePoint → Fin 2)\n (x₁ x₂ y₁ y₂ : ℤ) : Prop :=\n c (x₁, y₁) = c (x₂, y₁) ∧\n c (x₁, y₁) = c (x₁, y₂) ∧\n c (x₁, y₁) = c (x₂, y₂)\n\n/-- A two-colouring is admissible when every nondegenerate axis-parallel\nrectangle whose vertices are lattice points and whose area is a power of two is\nnot monochromatic. -/\ndef AdmissibleColoring (c : LatticePoint → Fin 2) : Prop :=\n ∀ (x₁ x₂ y₁ y₂ : ℤ),\n x₁ < x₂ →\n y₁ < y₂ →\n HasPowerOfTwoArea x₁ x₂ y₁ y₂ →\n ¬ RectangleAllSameColor c x₁ x₂ y₁ y₂\n\n/-- The assertion of the problem: there exists a two-colouring of all lattice\npoints of the plane for which no axis-parallel rectangle of power-of-two area\nhas all four vertices the same colour. -/\ndef Target : Prop :=\n ∃ c : LatticePoint → Fin 2, AdmissibleColoring c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "353de6e1-4e39-590e-96f3-58776e5fea58", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "331d44639760cb0784ad9c3e605e91453c35886703b3aa0e403922989dc6ba8c", "task_path": "tasks/nmp3_353de6e1-4e39-590e-96f3-58776e5fea58", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "353de6e1-4e39-590e-96f3-58776e5fea58", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_35539978-1a55-5e97-9fa8-2906bd56d193", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there is no function \\(f:(0,\\infty)\\to(0,\\infty)\\) satisfying \n-- \\[\n-- f(x+y)\\ge f(x)+y\\cdot f\\!\\bigl(f(x)\\bigr)\n-- \\]\n-- for all \\(x>0,\\;y>0\\).\nimport Mathlib\n\n/-!\n# Nonexistence of a positive-real self-map with the prescribed inequality\n\nThis file gives a statement-only formalization of the problem. The target is\nthe proposition asserting nonexistence of such a function; no proof of the\ntarget is supplied.\n-/\n\nnamespace Problem\n\n/-- The domain and codomain `(0, ∞)` of the problem, represented as the subtype\nof real numbers that are strictly positive. -/\ndef PositiveReal : Type := {x : ℝ // 0 < x}\n\nnamespace PositiveReal\n\n/-- Addition on positive reals, inherited from addition of the underlying real\nnumbers. -/\ndef add (x y : PositiveReal) : PositiveReal :=\n ⟨x.1 + y.1, add_pos x.2 y.2⟩\n\nend PositiveReal\n\n/-- The functional inequality from the problem. The function is a self-map of\nthe positive reals, so both `f x` and `f (f x)` are automatically positive.\nThe displayed arguments to `f` are the positive-real sums, and the comparison\nis the usual order on the underlying real numbers. -/\ndef Inequality (f : PositiveReal → PositiveReal) : Prop :=\n ∀ x y : PositiveReal,\n (f (PositiveReal.add x y)).1 ≥ (f x).1 + y.1 * (f (f x)).1\n\n/-- Admissibility of a candidate function: it maps the positive reals to the\npositive reals and satisfies the problem's inequality for every pair of\npositive `x` and `y`. -/\ndef Admissible (f : PositiveReal → PositiveReal) : Prop :=\n Inequality f\n\n/-- The formal target: there does not exist a function from `(0, ∞)` to\n`(0, ∞)` satisfying the stated inequality for all positive `x` and `y`. -/\ndef Target : Prop :=\n ¬ ∃ f : PositiveReal → PositiveReal, Admissible f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "35539978-1a55-5e97-9fa8-2906bd56d193", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b02f45b149b2f60e390caacf2e151d8e91e94da21f49a662df00ae00f1438645", "task_path": "tasks/nmp3_35539978-1a55-5e97-9fa8-2906bd56d193", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "35539978-1a55-5e97-9fa8-2906bd56d193", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_35816b9a-59fd-5b32-9329-6f7688a9f4e5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, and $c$ be positive real numbers such that \n-- $$a+b+c=\\frac1a+\\frac1b+\\frac1c.$$ \n-- Prove that \n-- $$\\sqrt{1+(a-b)^2}+\\sqrt{1+(b-c)^2}+\\sqrt{1+(c-a)^2}\\ge a+b+c.$$\nimport Mathlib\n\n/-!\n# Formal statement for source problem 35816b9a-59fd-5b32-9329-6f7688a9f4e5\n\nThe source asks to prove an inequality for positive real numbers whose sum\nequals the sum of their reciprocals. The declarations below record the\nadmissible data, the claimed inequality, and the universally quantified target\nproposition. No proof of `Problem.Target` is supplied.\n-/\n\nnamespace Problem\n\n/-- The hypotheses of the source problem: `a`, `b`, and `c` are positive real\nnumbers and satisfy `a + b + c = 1 / a + 1 / b + 1 / c`. -/\ndef Hypothesis (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b + c = 1 / a + 1 / b + 1 / c\n\n/-- The inequality asserted in the source problem. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n Real.sqrt (1 + (a - b) ^ 2) +\n Real.sqrt (1 + (b - c) ^ 2) +\n Real.sqrt (1 + (c - a) ^ 2) ≥\n a + b + c\n\n/-- The complete proposition requested by the source problem: for every triple\nof positive real numbers satisfying the reciprocal-sum condition, the stated\nsum of square roots is at least `a + b + c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Hypothesis a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "35816b9a-59fd-5b32-9329-6f7688a9f4e5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2aa9339b453d41bd040fefa495e7fee1b0019da9e35220678d6db836fa7d6007", "task_path": "tasks/nmp3_35816b9a-59fd-5b32-9329-6f7688a9f4e5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "35816b9a-59fd-5b32-9329-6f7688a9f4e5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_35a47aa8-c15a-5b6d-ac82-d0de97dad8c9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,\\dots,a_n$ be arbitrary real numbers and $n$ a positive integer. Prove that there exists a universal constant $c>0$, independent of $n$ and of the $a_j$, such that \n-- \\[\n-- \\max_{0\\le x\\le 2}\\;\\prod_{j=1}^{n}|x-a_j|\\;\\le\\;c^{\\,n}\\;\\max_{0\\le x\\le 1}\\;\\prod_{j=1}^{n}|x-a_j|.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The product of the absolute values of the differences between a point `x`\nand the points `a j`, for `j : Fin n`. -/\ndef productAbs (n : ℕ) (a : Fin n → ℝ) (x : ℝ) : ℝ :=\n ∏ j : Fin n, |x - a j|\n\n/-- The supremum of the product `∏ j, |x - a j|` as `x` ranges over the\nclosed interval `[l, u]`. Since the interval is compact and the product is\ncontinuous, this supremum is the maximum written in the problem. -/\ndef intervalMax (l u : ℝ) (n : ℕ) (a : Fin n → ℝ) : ℝ :=\n sSup (productAbs n a '' Set.Icc l u)\n\n/-- The assertion of the problem: there is a positive universal constant `c`,\nindependent of the positive integer `n` and of the real numbers `a_j`, such\nthat the maximum of the product on `[0,2]` is at most `c ^ n` times the\nmaximum of the product on `[0,1]`. -/\ndef Target : Prop :=\n ∃ c : ℝ, 0 < c ∧\n ∀ (n : ℕ), 0 < n → ∀ a : Fin n → ℝ,\n intervalMax (0 : ℝ) (2 : ℝ) n a ≤\n c ^ n * intervalMax (0 : ℝ) (1 : ℝ) n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "35a47aa8-c15a-5b6d-ac82-d0de97dad8c9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0d457a8347b6ad373c2ed796d58d5f0be34bf07fce9fa5528cc0d430da3b6afd", "task_path": "tasks/nmp3_35a47aa8-c15a-5b6d-ac82-d0de97dad8c9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "35a47aa8-c15a-5b6d-ac82-d0de97dad8c9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_36057a20-2fd7-5442-91f1-2b6bc3239dbc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given non‑negative real numbers \\(a,b,c\\) with \\(ab+bc+ca>0\\), prove that \n-- \\[\n-- \\frac{a^{3}+abc}{b^{2}+bc+c^{2}}+\\frac{b^{3}+abc}{c^{2}+ca+a^{2}}+\\frac{c^{3}+abc}{a^{2}+ab+b^{2}}\n-- \\;\\ge\\;\n-- \\frac{2\\,(a^{3}+b^{3}+c^{3})}{a^{2}+b^{2}+c^{2}}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility assumptions from the problem: `a`, `b`, and `c` are\nnon-negative real numbers, and `a*b + b*c + c*a` is strictly positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a * b + b * c + c * a\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (a ^ 3 + a * b * c) / (b ^ 2 + b * c + c ^ 2) +\n (b ^ 3 + a * b * c) / (c ^ 2 + c * a + a ^ 2) +\n (c ^ 3 + a * b * c) / (a ^ 2 + a * b + b ^ 2)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 2 * (a ^ 3 + b ^ 3 + c ^ 3) / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The inequality asserted in the problem, for fixed real numbers `a`, `b`,\nand `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ RHS a b c\n\n/-- The full universally quantified statement of the problem: for every triple\nof real numbers satisfying the stated non-negativity and positivity\nassumptions, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36057a20-2fd7-5442-91f1-2b6bc3239dbc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "50f56ba962094186651483da2bdbae2f1e33ad3c98a6b208543d9782531e9932", "task_path": "tasks/nmp3_36057a20-2fd7-5442-91f1-2b6bc3239dbc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36057a20-2fd7-5442-91f1-2b6bc3239dbc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3607edce-9e3a-5a59-b457-1cf556f3d9f2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c>0$ such that $a^3+b^3+c^3\\ge a^2+b^2+c^2$, prove that \n-- \\[\n-- \\frac{a^3}{b(a+2b)}+\\frac{b^3}{c(b+2c)}+\\frac{c^3}{a(c+2a)}\\ge 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic rational inequality\n\nThe source problem asks for a proof of a real-variable inequality under positive\nlower bounds on the variables and an additional cubic-versus-quadratic condition.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypotheses of the problem: `a`, `b`, and `c` are positive\nand satisfy `a^3 + b^3 + c^3 ≥ a^2 + b^2 + c^2`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a ^ 3 + b ^ 3 + c ^ 3 ≥ a ^ 2 + b ^ 2 + c ^ 2\n\n/-- The desired cyclic rational inequality, as a predicate of real `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a ^ 3 / (b * (a + 2 * b)) +\n b ^ 3 / (c * (b + 2 * c)) +\n c ^ 3 / (a * (c + 2 * a)) ≥ 1\n\n/-- The full proposition asserted by the source problem: for all positive real\nnumbers `a`, `b`, and `c` satisfying the cubic-versus-quadratic hypothesis, the\ndisplayed cyclic sum is at least `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3607edce-9e3a-5a59-b457-1cf556f3d9f2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9302ea3ef008821aa7d676e606a962260aa72ec4723d63c39905d93242b4fb0c", "task_path": "tasks/nmp3_3607edce-9e3a-5a59-b457-1cf556f3d9f2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3607edce-9e3a-5a59-b457-1cf556f3d9f2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_360a035f-ecfc-5fec-9b6f-d042c3221780", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(n\\ge 3\\) be an integer. For positive real numbers \\(a_1,a_2,\\dots ,a_n\\) satisfying \n-- \\[\n-- a_1a_2\\cdots a_n=1,\n-- \\]\n-- prove that \n-- \\[\n-- \\frac{a_1+3}{(a_1+1)^2}+ \\frac{a_2+3}{(a_2+1)^2}+ \\cdots +\\frac{a_n+3}{(a_n+1)^2}\\ge 3.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThis file records the mathematical statement of the problem. It does not\ncontain a proof of the inequality.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the desired inequality, for a finite sequence\n`a : Fin n → ℝ`. -/\nnoncomputable def lhs (n : ℕ) (a : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, (a i + 3) / (a i + 1) ^ 2\n\n/-- Every term of the sequence is strictly positive. -/\ndef IsPositive (n : ℕ) (a : Fin n → ℝ) : Prop :=\n ∀ i : Fin n, 0 < a i\n\n/-- The product of all terms of the sequence is `1`. -/\ndef ProductEqualsOne (n : ℕ) (a : Fin n → ℝ) : Prop :=\n (∏ i : Fin n, a i) = 1\n\n/-- The admissibility condition on the sequence: every term is a positive real\nnumber and the product of all `n` terms is `1`. -/\ndef IsPositiveProductOne (n : ℕ) (a : Fin n → ℝ) : Prop :=\n IsPositive n a ∧ ProductEqualsOne n a\n\n/-- The full assertion: for every integer `n ≥ 3`, every positive real sequence\n`a_1, ..., a_n` with product `1` satisfies the stated lower bound. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 3 ≤ n → ∀ a : Fin n → ℝ,\n IsPositiveProductOne n a → 3 ≤ lhs n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "360a035f-ecfc-5fec-9b6f-d042c3221780", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9d2e32c5df19fd3cf1c704a061c7559ac8d99054aa33c12a06e8ca559478c05c", "task_path": "tasks/nmp3_360a035f-ecfc-5fec-9b6f-d042c3221780", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "360a035f-ecfc-5fec-9b6f-d042c3221780", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_360c0933-0bde-5877-bd9d-49187409a420", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge 0$. Prove that \n-- \\[\n-- 49(x+y+z)^{4}-475(x+y+z)^{2}(xy+yz+zx)-408(x+y+z)xyz+288(x+y+z)(x^{2}y+y^{2}z+z^{2}x)+832(xy+yz+zx)^{2}\\ge 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a nonnegative-variable polynomial inequality\n\nThe original problem asks to prove a single polynomial inequality under the\nassumption that the three real variables are nonnegative. The proposition is\nrepresented as a `Prop`-valued definition; no proof of it is supplied here.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition `x ≥ 0`, `y ≥ 0`, and `z ≥ 0` for a triple\nof real variables. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z\n\n/-- The left-hand side of the polynomial inequality from the problem. -/\ndef InequalityLHS (x y z : ℝ) : ℝ :=\n let s : ℝ := x + y + z\n let q : ℝ := x * y + y * z + z * x\n 49 * s ^ 4 - 475 * s ^ 2 * q - 408 * s * x * y * z\n + 288 * s * (x ^ 2 * y + y ^ 2 * z + z ^ 2 * x) + 832 * q ^ 2\n\n/-- The complete assertion: for every triple of nonnegative real numbers, the\ndisplayed polynomial is nonnegative. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → 0 ≤ InequalityLHS x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "360c0933-0bde-5877-bd9d-49187409a420", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d74d1ecb8d6be8b753de14a137f51fc5bc7d1512bee88238c4e38c722319fb26", "task_path": "tasks/nmp3_360c0933-0bde-5877-bd9d-49187409a420", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "360c0933-0bde-5877-bd9d-49187409a420", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_360dea3f-ac23-5d0a-98d0-b67cb09070bd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{1}{2a^{2}+bc}+\\frac{1}{2b^{2}+ca}+\\frac{1}{2c^{2}+ab}\\le\\frac{a+b+c}{3abc}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a three-variable positive-real inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\n\n`1 / (2*a^2 + b*c) + 1 / (2*b^2 + c*a) + 1 / (2*c^2 + a*b)\n ≤ (a + b + c) / (3*a*b*c)`.\n\nThe declaration below records that proposition without asserting or proving it.\n-/\n\nnamespace Problem\n\n/-- The proposition to be proved in the source problem. The quantification is over\npositive real numbers only; all divisions are divisions in `ℝ`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n (1 : ℝ) / (2 * a ^ 2 + b * c) +\n (1 : ℝ) / (2 * b ^ 2 + c * a) +\n (1 : ℝ) / (2 * c ^ 2 + a * b) ≤\n (a + b + c) / (3 * a * b * c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "360dea3f-ac23-5d0a-98d0-b67cb09070bd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f8b45e1739f4eb0e2d839255636ea15cafc27bdfc098a61cd1667c06a9acb20b", "task_path": "tasks/nmp3_360dea3f-ac23-5d0a-98d0-b67cb09070bd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "360dea3f-ac23-5d0a-98d0-b67cb09070bd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_36129f31-cc0c-5f41-be6b-67596b4c775e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ with $ab+bc+ca>0$. Prove that \n-- \\[\n-- \\sqrt[3]{\\frac{a}{b+c}}+\\sqrt[3]{\\frac{b}{c+a}}+\\sqrt[3]{\\frac{c}{a+b}}\\ge 2\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The real cube root, with the principal (nonnegative) branch used on\nnonnegative inputs and the odd extension used on negative inputs. -/\nnoncomputable def CubeRoot (x : ℝ) : ℝ :=\n if 0 ≤ x then Real.rpow x (1 / 3 : ℝ)\n else -Real.rpow (-x) (1 / 3 : ℝ)\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n CubeRoot (a / (b + c)) +\n CubeRoot (b / (c + a)) +\n CubeRoot (c / (a + b))\n\n/-- The admissibility hypotheses on the triple `(a, b, c)`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a * b + b * c + c * a\n\n/-- The assertion to be proved: for all admissible nonnegative real triples,\nthe sum of the three real cube roots is at least `2`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → 2 ≤ LeftHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36129f31-cc0c-5f41-be6b-67596b4c775e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cad5a89e583868b33d63cf59fe4ec4cf95ef300d49f4c0e113c855b0e2376bef", "task_path": "tasks/nmp3_36129f31-cc0c-5f41-be6b-67596b4c775e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36129f31-cc0c-5f41-be6b-67596b4c775e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_362cbfde-446f-5b04-8039-ad573267807c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a convex quadrilateral whose diagonals $AC$ and $BD$ intersect at $O$. Suppose the four triangles $OAB,\\;OBC,\\;OCD,$ and $ODA$ have equal perimeters. Prove that $ABCD$ is a rhombus (i.e. $AB=BC=CD=DA$).\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane, represented by coordinates indexed by `Fin 2`. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Twice the signed area (equivalently, the two-dimensional cross product) of\nthe oriented triangle `A B C`. Its sign records the orientation of the ordered\ntriple `(A, B, C)`. -/\ndef orientedArea2 (A B C : Point) : ℝ :=\n (B 0 - A 0) * (C 1 - A 1) - (B 1 - A 1) * (C 0 - A 0)\n\n/-- The perimeter of the triangle with vertices `X`, `Y`, and `Z`, namely\n`XY + YZ + ZX`. -/\ndef trianglePerimeter (X Y Z : Point) : ℝ :=\n dist X Y + dist Y Z + dist Z X\n\n/-- The vertices `A`, `B`, `C`, `D`, in this order, form a (strictly) convex\nquadrilateral. The disjunction permits either cyclic orientation. In the\npositive orientation every edge has the other two vertices strictly on its\nleft; in the negative orientation they are strictly on its right. -/\ndef IsConvexQuadrilateral (A B C D : Point) : Prop :=\n (orientedArea2 A B C > 0 ∧\n orientedArea2 A B D > 0 ∧\n orientedArea2 B C A > 0 ∧\n orientedArea2 B C D > 0 ∧\n orientedArea2 C D A > 0 ∧\n orientedArea2 C D B > 0 ∧\n orientedArea2 D A B > 0 ∧\n orientedArea2 D A C > 0) ∨\n (orientedArea2 A B C < 0 ∧\n orientedArea2 A B D < 0 ∧\n orientedArea2 B C A < 0 ∧\n orientedArea2 B C D < 0 ∧\n orientedArea2 C D A < 0 ∧\n orientedArea2 C D B < 0 ∧\n orientedArea2 D A B < 0 ∧\n orientedArea2 D A C < 0)\n\n/-- The diagonals `AC` and `BD` intersect exactly at the point `O`. Both\nclosed diagonal segments contain `O`, and `O` is their unique common point. -/\ndef DiagonalsIntersectAt (A B C D O : Point) : Prop :=\n O ∈ segment ℝ A C ∧\n O ∈ segment ℝ B D ∧\n ∀ X : Point, X ∈ segment ℝ A C → X ∈ segment ℝ B D → X = O\n\n/-- The four triangles `OAB`, `OBC`, `OCD`, and `ODA` all have the same\nperimeter. The conjunction of the three successive equalities expresses that\nall four perimeters are equal. -/\ndef EqualTrianglePerimeters (A B C D O : Point) : Prop :=\n trianglePerimeter O A B = trianglePerimeter O B C ∧\n trianglePerimeter O B C = trianglePerimeter O C D ∧\n trianglePerimeter O C D = trianglePerimeter O D A\n\n/-- The quadrilateral `ABCD` is a rhombus, in the sense stated in the problem:\n`AB = BC = CD = DA`. -/\ndef IsRhombus (A B C D : Point) : Prop :=\n dist A B = dist B C ∧\n dist B C = dist C D ∧\n dist C D = dist D A\n\n/-- The assertion of the problem: for every Euclidean-plane quadrilateral\n`ABCD` and point `O`, if `ABCD` is convex, its diagonals `AC` and `BD`\nintersect uniquely at `O`, and the four triangles `OAB`, `OBC`, `OCD`, `ODA`\nhave equal perimeters, then all four sides of `ABCD` are equal. -/\ndef Target : Prop :=\n ∀ (A B C D O : Point),\n IsConvexQuadrilateral A B C D →\n DiagonalsIntersectAt A B C D O →\n EqualTrianglePerimeters A B C D O →\n IsRhombus A B C D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "362cbfde-446f-5b04-8039-ad573267807c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b6fafe563ec220f565830a61728428d4f3c8d290695e6d927bdf74a81da4b48d", "task_path": "tasks/nmp3_362cbfde-446f-5b04-8039-ad573267807c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "362cbfde-446f-5b04-8039-ad573267807c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_364cc798-a858-5884-82c7-04b52236c1cc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The point $P$ lies inside triangle $ABC$ so that $\\angle ABP = \\angle PCA$. Let $Q$ be the point for which $PBQC$ is a parallelogram. Prove that $\\displaystyle \\angle QAB = \\angle CAP\\,.\nmodule\n\npublic import Mathlib.Analysis.Convex.Hull\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\n/-!\n# Formalization of the geometry statement\n\nThe ambient plane is the real Euclidean plane `EuclideanSpace ℝ (Fin 2)`. Points are\nidentified with their position vectors; in particular, the fourth vertex of an ordered\nparallelogram can be written using vector addition and subtraction.\n-/\n\nnoncomputable section\n\n@[expose] public section\n\nopen Set\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The ambient Euclidean plane. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The point `P` lies in the (open) interior of triangle `ABC`. -/\ndef InsideTriangle (A B C P : Plane) : Prop :=\n P ∈ interior (convexHull ℝ ({A, B, C} : Set Plane))\n\n/-- The ordered quadrilateral with vertices `P`, `B`, `Q`, `C` is a parallelogram.\n\nFor points represented by their position vectors, the two diagonals `PQ` and `BC`\nhave the same midpoint, which is expressed by `P + Q = B + C`. -/\ndef IsParallelogram (P B Q C : Plane) : Prop :=\n P + Q = B + C\n\n/-- The fourth vertex `Q` determined by the ordered parallelogram `PBQC`. -/\ndef parallelogramFourthVertex (P B C : Plane) : Plane :=\n B + C - P\n\n/-- For any three vertices `P`, `B`, `C`, there is a unique point `Q` for which the\nordered quadrilateral `PBQC` is a parallelogram. This makes explicit the meaning of\n\"the point `Q`\" in the source statement. -/\ntheorem existsUnique_parallelogramFourthVertex (P B C : Plane) :\n ∃! Q : Plane, IsParallelogram P B Q C := by\n refine ⟨parallelogramFourthVertex P B C, ?_, ?_⟩\n · unfold IsParallelogram parallelogramFourthVertex\n abel\n · intro Q hQ\n unfold IsParallelogram at hQ\n unfold parallelogramFourthVertex\n rw [← hQ]\n abel\n\n/-- The target assertion: if `P` lies inside triangle `ABC` and\n`∠ABP = ∠PCA`, and if `PBQC` is a parallelogram, then `∠QAB = ∠CAP`. -/\ndef Target : Prop :=\n ∀ A B C P : Plane,\n InsideTriangle A B C P →\n EuclideanGeometry.angle A B P = EuclideanGeometry.angle P C A →\n ∀ Q : Plane,\n IsParallelogram P B Q C →\n EuclideanGeometry.angle Q A B = EuclideanGeometry.angle C A P\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "364cc798-a858-5884-82c7-04b52236c1cc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "87e55f84163637658498516cd5738a10eb4582cf3bb173068bcc6606a1c64599", "task_path": "tasks/nmp3_364cc798-a858-5884-82c7-04b52236c1cc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "364cc798-a858-5884-82c7-04b52236c1cc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_364d80ed-bff5-5969-b525-9b2aa2866028", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $a^{2}+b^{2}+c^{2}=3$. Prove that \n-- \\[\n-- \\frac{a}{b+2}+\\frac{b}{c+2}+\\frac{c}{a+2}\\le1\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the nonnegative-real inequality problem\n\nThe supplied problem asks, for nonnegative real numbers `a`, `b`, and `c`\nwith `a^2 + b^2 + c^2 = 3`, to prove the cyclic inequality\n`a / (b + 2) + b / (c + 2) + c / (a + 2) ≤ 1`.\n\nThe target is represented as a `Prop`-valued definition; this file does not\nassert or prove it.\n-/\n\nnamespace Problem\n\n/--\n**Target statement.** For all nonnegative real numbers `a`, `b`, and `c`\nsatisfying `a ^ 2 + b ^ 2 + c ^ 2 = 3`, the cyclic sum\n`a / (b + 2) + b / (c + 2) + c / (a + 2)` is at most `1`.\n\nAll additions, squarings, divisions, and comparisons here are over `ℝ`, so\nthis encodes real division and the usual linear order on the reals. The\nnonnegativity assumptions ensure that all three denominators are positive.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a ^ 2 + b ^ 2 + c ^ 2 = 3 →\n a / (b + 2) + b / (c + 2) + c / (a + 2) ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "364d80ed-bff5-5969-b525-9b2aa2866028", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f7e2367bc0fae7581e14484d397b24c4f83c4a22dc51902c37cf449a0f281aa8", "task_path": "tasks/nmp3_364d80ed-bff5-5969-b525-9b2aa2866028", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "364d80ed-bff5-5969-b525-9b2aa2866028", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_366999d1-8174-5f0f-aaa2-43e7ff2541ba", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers such that $xyz=1$. Prove that \n-- \\[\n-- \\bigl(x^{4}+y^{4}+z^{4}\\bigr)^{2}\\ge 3\\bigl(x^{5}+y^{5}+z^{5}\\bigr)\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility condition on a positive real triple `(x, y, z)`:\nall three coordinates are positive and their product is one. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x * y * z = 1\n\n/-- The inequality asserted by the problem for a real triple `(x, y, z)`. -/\ndef Inequality (x y z : ℝ) : Prop :=\n (x ^ 4 + y ^ 4 + z ^ 4) ^ 2 ≥ 3 * (x ^ 5 + y ^ 5 + z ^ 5)\n\n/-- The full target statement: for every triple of positive real numbers whose\nproduct is one, the square of the sum of fourth powers is at least three times\nthe sum of fifth powers. -/\ndef Target : Prop :=\n ∀ (x y z : ℝ), Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "366999d1-8174-5f0f-aaa2-43e7ff2541ba", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f6c1802cb0004efe133057863dc22ef5bca6a47fa3b2a748203aa637a0c6ea37", "task_path": "tasks/nmp3_366999d1-8174-5f0f-aaa2-43e7ff2541ba", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "366999d1-8174-5f0f-aaa2-43e7ff2541ba", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_36758e1c-b137-5d9d-9308-0fe8c8d79881", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- \\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}\\, .\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\nFormalization of the statement:\n\nLet `a b c > 0`. Prove that\n`ab / (c * (c + a)) + bc / (a * (a + b)) + ca / (b * (b + c))\n ≥ a / (c + a) + b / (a + b) + c / (b + c)`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality.\nThe three summands are kept in the same order as in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * b / (c * (c + a)) +\n b * c / (a * (a + b)) +\n c * a / (b * (b + c))\n\n/-- The right-hand side of the inequality.\nThe three summands are kept in the same order as in the source problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n a / (c + a) + b / (a + b) + c / (b + c)\n\n/-- The universally quantified proposition asserted by the problem:\nfor all positive real numbers `a`, `b`, and `c`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36758e1c-b137-5d9d-9308-0fe8c8d79881", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6a1d3a1f9a690cc14fd4c9d7a6c93955422beedd4aa1f9c18743395c7748ad83", "task_path": "tasks/nmp3_36758e1c-b137-5d9d-9308-0fe8c8d79881", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36758e1c-b137-5d9d-9308-0fe8c8d79881", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_36a1c7ef-482e-54ab-98e2-4978cbb2bf25", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that \n-- \\[\n-- f\\bigl(x+yf(x)\\bigr)+f\\bigl(xf(y)-y\\bigr)=f(x)-f(y)+2xy\n-- \\] \n-- for all real numbers $x$ and $y$.\nimport Mathlib\n\n/-!\n# Functional equation: `f (x + y * f x) + f (x * f y - y) = f x - f y + 2xy`\n\nThis file formalizes the statement of the problem. In particular, it records the\nadmissibility predicate, a complete-answer predicate for a proposed set of\nfunctions, and the concrete two-element candidate answer for the problem.\nNo proof of the target is supplied here.\n-/\n\nnamespace Problem\n\n/-- A function `f : ℝ → ℝ` is admissible when it satisfies the functional\nequation for every pair of real numbers `x` and `y`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ,\n f (x + y * f x) + f (x * f y - y) = f x - f y + 2 * x * y\n\n/-- Soundness of a proposed answer set `S`: every function in `S` is admissible. -/\ndef AnswerSound (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, f ∈ S → Admissible f\n\n/-- Completeness of a proposed answer set `S`: every admissible function lies in `S`. -/\ndef AnswerComplete (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, Admissible f → f ∈ S\n\n/-- A proposed set `S` is a complete answer precisely when it consists exactly of\nthe admissible functions. The conjunction records both classification directions. -/\ndef AnswerCorrect (S : Set (ℝ → ℝ)) : Prop :=\n AnswerSound S ∧ AnswerComplete S\n\n/-- The function `x ↦ x`, one of the two solutions. -/\ndef identitySolution : ℝ → ℝ :=\n fun x : ℝ => x\n\n/-- The function `x ↦ -x`, the other solution. -/\ndef negativeIdentitySolution : ℝ → ℝ :=\n fun x : ℝ => -x\n\n/-- The candidate solution set `{x ↦ x, x ↦ -x}`. -/\ndef CandidateSolutions : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | f = identitySolution ∨ f = negativeIdentitySolution}\n\n/-- The problem's target: the admissible functions are exactly the identity and\nthe negative identity. This is a proposition to be proved, not a proof of it. -/\ndef Target : Prop :=\n AnswerCorrect CandidateSolutions\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36a1c7ef-482e-54ab-98e2-4978cbb2bf25", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "85124c090dcb34cb83b734e3fe2e84f0e7ad9bfde11d4f3402975d40736ddba5", "task_path": "tasks/nmp3_36a1c7ef-482e-54ab-98e2-4978cbb2bf25", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36a1c7ef-482e-54ab-98e2-4978cbb2bf25", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_36c432b0-d479-599e-be9c-d7b4ff71643b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For an integer $n\\ge5$ and positive real numbers $a_1,\\dots,a_n$, prove that \n-- \\[\n-- \\frac{(n-1)\\bigl(a_1^2+\\dots +a_n^2\\bigr)}{a_1+\\dots +a_n}\n-- +\\sqrt{\\frac{a_1+\\dots +a_n}{\\frac1{a_1}+\\dots +\\frac1{a_n}}}\n-- \\;\\ge\\;a_1+\\dots +a_n\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the problem in `problem.md`\n\nThe problem asks, for an integer `n ≥ 5` and positive real numbers\n`a_1, ..., a_n`, to prove the inequality\n\n (n - 1) * (∑ a_i^2) / (∑ a_i)\n + sqrt ((∑ a_i) / (∑ a_i⁻¹))\n ≥ ∑ a_i.\n\nThe declaration below is a proposition-valued definition: its body records the\nprecise universally quantified assertion, and no proof is supplied.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The assertion of the problem for all integers `n ≥ 5` and all positive\nreal `n`-tuples. The tuple is represented by a function `a : Fin n → ℝ`; all\nsums range over `Fin n`. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 5 ≤ n →\n ∀ (a : Fin n → ℝ),\n (∀ i : Fin n, 0 < a i) →\n ((n : ℝ) - 1) * (∑ i : Fin n, (a i) ^ 2) / (∑ i : Fin n, a i)\n + Real.sqrt ((∑ i : Fin n, a i) / (∑ i : Fin n, (a i)⁻¹))\n ≥ ∑ i : Fin n, a i\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36c432b0-d479-599e-be9c-d7b4ff71643b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c010e6fc47b10a00ac99ff003e675e928fcf211c9f33fd451a367fdf85a29282", "task_path": "tasks/nmp3_36c432b0-d479-599e-be9c-d7b4ff71643b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36c432b0-d479-599e-be9c-d7b4ff71643b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_36d36137-7c2b-5cb1-8421-76d4352fa42b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$ and $b$ be fixed positive integers. A prime $p$ is called **fun** if there exists a positive integer $n$ such that \n-- \n-- 1. $p\\mid a^{n!}+b$, \n-- 2. $p\\mid a^{(n+1)!}+b$, \n-- 3. $p<2n^{2}+1$. \n-- \n-- Prove that there are only finitely many fun primes.\nimport Mathlib\n\n/-!\n# Fun primes\n\nFormalization of the statement: for fixed positive integers `a` and `b`, only\nfinitely many primes `p` for which there is a positive integer `n` such that\n`p ∣ a ^ n! + b`, `p ∣ a ^ (n + 1)! + b`, and `p < 2 n^2 + 1`.\n-/\n\nnamespace Problem\n\n/-- A natural number `p` is a fun prime for fixed natural numbers `a` and `b` if\n`p` is prime and there is a positive natural `n` satisfying the three stated\nconditions. -/\ndef FunPrime (a b p : ℕ) : Prop :=\n Nat.Prime p ∧\n ∃ n : ℕ,\n 0 < n ∧\n p ∣ a ^ n.factorial + b ∧\n p ∣ a ^ (n + 1).factorial + b ∧\n p < 2 * n ^ 2 + 1\n\n/-- The set of fun primes associated with fixed natural numbers `a` and `b`. -/\ndef FunPrimes (a b : ℕ) : Set ℕ :=\n {p : ℕ | FunPrime a b p}\n\n/-- For every pair of fixed positive integers `a` and `b`, the set of fun\nprimes is finite. -/\ndef Target : Prop :=\n ∀ (a b : ℕ), 0 < a → 0 < b → Set.Finite (FunPrimes a b)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36d36137-7c2b-5cb1-8421-76d4352fa42b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ab8cc37cb2a88711ce5986bfc1383c9cf55d2c4f79923c649313a81d6a15ef89", "task_path": "tasks/nmp3_36d36137-7c2b-5cb1-8421-76d4352fa42b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36d36137-7c2b-5cb1-8421-76d4352fa42b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_36d533dd-ab48-5d24-8497-b7f05e0150ae", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a tetrahedron (triangular pyramid) such that none of its faces is a right triangle and the orthocenters of the three faces $ABC$, $ABD$, and $ACD$ are collinear. Prove that the center $O$ of the sphere circumscribed to $ABCD$ lies on the plane determined by the midpoints of edges $AB$, $AC$, and $AD$.\n/-\n# Formal statement: circumcenter of a tetrahedron with collinear face orthocenters\n\nThis file formalizes the statement of the geometric problem. No proof of the\ntarget assertion is supplied: `Problem.Target` is a proposition-valued\ndefinition, as requested.\n\nThe ambient space is three-dimensional Euclidean space. Vertices are indexed\nby `Fin 4`, with `0, 1, 2, 3` corresponding respectively to `A, B, C, D`.\n-/\n\nimport Mathlib.Geometry.Euclidean.MongePoint\nimport Mathlib.LinearAlgebra.AffineSpace.Simplex.Basic\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.LinearAlgebra.AffineSpace.Midpoint\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\nnoncomputable section\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- Points of the three-dimensional Euclidean space in which the tetrahedron\nreferenced in the problem lives. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 3)\n\n/-- A (nondegenerate, ordered) tetrahedron is Mathlib's three-dimensional\nsimplex. Its four vertices have indices `0, 1, 2, 3`. -/\nabbrev Tetrahedron : Type := Affine.Simplex ℝ Point 3\n\n/-- A triangle is Mathlib's two-dimensional simplex. -/\nabbrev Triangle : Type := Affine.Simplex ℝ Point 2\n\n/-- The four points `A, B, C, D` are affinely independent, i.e. they are not\ncoplanar and form a nondegenerate tetrahedron. -/\ndef IsTetrahedron (A B C D : Point) : Prop :=\n AffineIndependent ℝ ![A, B, C, D]\n\n/-- Package four points and a proof of affine independence as a Mathlib\nsimplex. This lets the face and orthocenter constructions below use the\nsimplex API directly. -/\ndef tetrahedronOf (A B C D : Point) (h : IsTetrahedron A B C D) : Tetrahedron :=\n ⟨![A, B, C, D], h⟩\n\nnamespace Tetrahedron\n\n/-- Vertex `A` of an ordered tetrahedron, namely the vertex of index `0`. -/\ndef A (s : Tetrahedron) : Point := s.points 0\n\n/-- Vertex `B` of an ordered tetrahedron, namely the vertex of index `1`. -/\ndef B (s : Tetrahedron) : Point := s.points 1\n\n/-- Vertex `C` of an ordered tetrahedron, namely the vertex of index `2`. -/\ndef C (s : Tetrahedron) : Point := s.points 2\n\n/-- Vertex `D` of an ordered tetrahedron, namely the vertex of index `3`. -/\ndef D (s : Tetrahedron) : Point := s.points 3\n\nend Tetrahedron\n\n/-- The face through the vertices of indices `0, 1, 2`, i.e. `ABC`.\nIt is the face opposite vertex `D`, which has index `3`. -/\ndef faceABC (s : Tetrahedron) : Triangle := s.faceOpposite 3\n\n/-- The face through the vertices of indices `0, 1, 3`, i.e. `ABD`.\nIt is the face opposite vertex `C`, which has index `2`. -/\ndef faceABD (s : Tetrahedron) : Triangle := s.faceOpposite 2\n\n/-- The face through the vertices of indices `0, 2, 3`, i.e. `ACD`.\nIt is the face opposite vertex `B`, which has index `1`. -/\ndef faceACD (s : Tetrahedron) : Triangle := s.faceOpposite 1\n\n/-- The face through the vertices of indices `1, 2, 3`, i.e. `BCD`.\nIt is the face opposite vertex `A`, which has index `0`. -/\ndef faceBCD (s : Tetrahedron) : Triangle := s.faceOpposite 0\n\n/-- The angle at `P` in the triangle with vertices `P, Q, R` is a right angle.\nThis is expressed by the vanishing of the inner product of the two side\nvectors emanating from `P`. -/\ndef RightAngleAt (P Q R : Point) : Prop :=\n inner ℝ (Q -ᵥ P) (R -ᵥ P) = 0\n\n/-- A (nondegenerate) triangle is a right triangle if at least one of its\nthree angles is a right angle. -/\ndef IsRightTriangle (t : Triangle) : Prop :=\n RightAngleAt (t.points 0) (t.points 1) (t.points 2) ∨\n RightAngleAt (t.points 1) (t.points 0) (t.points 2) ∨\n RightAngleAt (t.points 2) (t.points 0) (t.points 1)\n\n/-- None of the four triangular faces of the tetrahedron is a right\ntriangle. The faces are `ABC`, `ABD`, `ACD`, and `BCD`. -/\ndef NoRightFaces (s : Tetrahedron) : Prop :=\n ¬ IsRightTriangle (faceABC s) ∧\n ¬ IsRightTriangle (faceABD s) ∧\n ¬ IsRightTriangle (faceACD s) ∧\n ¬ IsRightTriangle (faceBCD s)\n\n/-- The affine plane determined by the midpoints of the edges `AB`, `AC`,\nand `AD`. It is the affine span of those three midpoint points. -/\ndef MidpointPlane (A B C D : Point) : AffineSubspace ℝ Point :=\n affineSpan ℝ ({midpoint ℝ A B, midpoint ℝ A C, midpoint ℝ A D} : Set Point)\n\n/-- The orthocenters of the three faces `ABC`, `ABD`, and `ACD` are\ncollinear. The orthocenter of a triangle is Mathlib's\n`Affine.Triangle.orthocenter`, i.e. the common point of its three altitudes\n(equivalently, its Monge point). -/\ndef OrthocentersCollinear (s : Tetrahedron) : Prop :=\n Collinear ℝ ({Affine.Triangle.orthocenter (faceABC s),\n Affine.Triangle.orthocenter (faceABD s),\n Affine.Triangle.orthocenter (faceACD s)} : Set Point)\n\n/-- A sphere of positive radius `r` centered at `O` passes through all four\nvertices of the tetrahedron. -/\ndef IsCircumsphere (s : Tetrahedron) (O : Point) (r : ℝ) : Prop :=\n 0 < r ∧ ∀ i : Fin 4, dist O (s.points i) = r\n\n/-- `O` is the center of a sphere passing through all four vertices, i.e. a\ncircumcenter of the tetrahedron. The radius is existentially quantified. -/\ndef IsCircumcenter (s : Tetrahedron) (O : Point) : Prop :=\n ∃ r : ℝ, IsCircumsphere s O r\n\n/-- The formal statement of the problem.\n\nFor every nondegenerate tetrahedron `ABCD`, if none of its four faces is a\nright triangle and the orthocenters of the faces `ABC`, `ABD`, and `ACD` are\ncollinear, then every circumcenter `O` of the tetrahedron lies in the affine\nplane determined by the midpoints of `AB`, `AC`, and `AD`. -/\ndef Target : Prop :=\n ∀ (A B C D : Point) (hTet : IsTetrahedron A B C D),\n NoRightFaces (tetrahedronOf A B C D hTet) →\n OrthocentersCollinear (tetrahedronOf A B C D hTet) →\n ∀ (O : Point),\n IsCircumcenter (tetrahedronOf A B C D hTet) O →\n O ∈ MidpointPlane A B C D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36d533dd-ab48-5d24-8497-b7f05e0150ae", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8ad99eff475d0a92661dd7a9d78826bcbd36df57c01e26d77a0011c76b6c5c5f", "task_path": "tasks/nmp3_36d533dd-ab48-5d24-8497-b7f05e0150ae", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "36d533dd-ab48-5d24-8497-b7f05e0150ae", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_372144d7-db14-5e76-a83a-9d5d45c0d733", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be a simple (undirected) graph with $n$ vertices and $mn$ edges, where $m$ is a positive integer and $n>2m$. Prove that $G$ contains a path on $m+1$ vertices (i.e., a path of length $m$).\nimport Mathlib.Combinatorics.SimpleGraph.Paths\nimport Mathlib.Combinatorics.SimpleGraph.Finite\n\n/-!\n# Formal statement of an extremal path problem\n\nThe source problem is a graph-theoretic existence assertion. We state it as a\n`Prop`-valued definition; no proof is supplied here.\n-/\n\nnamespace Problem\n\nuniverse u v\n\n/-- A graph `G` contains a simple path with exactly `k` edges, equivalently a\npath on exactly `k + 1` vertices. The latter is made explicit through the\nlength of the walk's vertex support (which, for `IsPath`, is its set of\ndistinct vertices). -/\ndef HasPathOfLength {V : Type v} (G : SimpleGraph V) (k : ℕ) : Prop :=\n ∃ (start finish : V) (p : G.Walk start finish),\n p.IsPath ∧ p.length = k ∧ p.support.length = k + 1\n\n/-- The target assertion: if `G` is a finite simple graph on `n` vertices with\n`m * n` edges, where `m` is positive and `n > 2 * m`, then `G` contains a simple\npath on `m + 1` vertices (a path of length `m`). -/\ndef Target : Prop :=\n ∀ (V : Type u) [Fintype V] (G : SimpleGraph V) (m n : ℕ),\n 0 < m →\n 2 * m < n →\n Fintype.card V = n →\n G.edgeSet.ncard = m * n →\n HasPathOfLength G m\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "372144d7-db14-5e76-a83a-9d5d45c0d733", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "76d0c7022ac655ddc3e8483848a6586e5216d5bf7b659000b59f35b58c28e413", "task_path": "tasks/nmp3_372144d7-db14-5e76-a83a-9d5d45c0d733", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "372144d7-db14-5e76-a83a-9d5d45c0d733", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_372a4908-f3c1-52d5-87d7-a82cbe49051b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any acute triangle with angles $A$, $B$, $C$, the inequality \n-- \\[\n-- \\left(\\frac{\\cos A}{\\cos B}\\right)^2+\\left(\\frac{\\cos B}{\\cos C}\\right)^2+\\left(\\frac{\\cos C}{\\cos A}\\right)^2+8\\cos A\\cos B\\cos C\\ge 4\n-- \\] \n-- holds.\nimport Mathlib\n\n/-!\n# Formal statement: an inequality for acute triangles\n\nThe source problem states an inequality involving the cosines of the three\nangles of an acute triangle. We represent an acute triangle by its three\nangle measures in radians. A triple of angles determines a (nondegenerate)\ntriangle exactly when the angles are positive and sum to `π`; acuteness means\nthat each angle is strictly less than `π / 2`.\n-/\n\nnamespace Problem\n\n/-- The three positive angle measures `A`, `B`, and `C` sum to `π`, so they are\nthe angles of a nondegenerate Euclidean triangle. -/\ndef TriangleAngles (A B C : ℝ) : Prop :=\n 0 < A ∧ 0 < B ∧ 0 < C ∧ A + B + C = Real.pi\n\n/-- The angle measures `A`, `B`, and `C` are those of an acute Euclidean\ntriangle. In particular, all angles are strictly positive and strictly less\nthan `π / 2. -/\ndef AcuteTriangleAngles (A B C : ℝ) : Prop :=\n TriangleAngles A B C ∧\n A < Real.pi / 2 ∧ B < Real.pi / 2 ∧ C < Real.pi / 2\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def AcuteTriangleInequalityLHS (A B C : ℝ) : ℝ :=\n (Real.cos A / Real.cos B) ^ (2 : ℕ) +\n (Real.cos B / Real.cos C) ^ (2 : ℕ) +\n (Real.cos C / Real.cos A) ^ (2 : ℕ) +\n 8 * Real.cos A * Real.cos B * Real.cos C\n\n/-- For every acute triangle with angles `A`, `B`, and `C`, the stated\ninequality holds. Angles are measured in radians, and the `cos` function is\nthe real cosine. -/\ndef Target : Prop :=\n ∀ A B C : ℝ,\n AcuteTriangleAngles A B C → AcuteTriangleInequalityLHS A B C ≥ 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "372a4908-f3c1-52d5-87d7-a82cbe49051b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2c35e0c4f2d31695bfcc9c38591efe8590f2d07c9f385fe188983115ba1261f7", "task_path": "tasks/nmp3_372a4908-f3c1-52d5-87d7-a82cbe49051b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "372a4908-f3c1-52d5-87d7-a82cbe49051b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_37374c40-b29b-527e-bae0-2dabc18f61ac", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d,k$ be positive real numbers. Prove that\n-- \\[\n-- \\frac{a+b+c+d}{2}\\Bigg[\\frac{a}{(b+c)^k}+\\frac{b}{(c+d)^k}+\\frac{c}{(d+a)^k}+\\frac{d}{(a+b)^k}\\Bigg]\\ge\n-- \\frac{a}{(b+c)^{k-1}}+\\frac{b}{(c+d)^{k-1}}+\\frac{c}{(d+a)^{k-1}}+\\frac{d}{(a+b)^{k-1}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a cyclic real-power inequality\n\nThe source problem asks one to prove an inequality for five positive real\nparameters `a`, `b`, `c`, `d`, and `k`. Because `k` is a real number, the\npowers occurring below are real powers (`Real.rpow`). Their bases are sums of\npositive numbers, so they are positive throughout the intended domain.\n\nThis file only states the target; it deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c d k : ℝ) : ℝ :=\n ((a + b + c + d) / 2) *\n (a / Real.rpow (b + c) k +\n b / Real.rpow (c + d) k +\n c / Real.rpow (d + a) k +\n d / Real.rpow (a + b) k)\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def rhs (a b c d k : ℝ) : ℝ :=\n a / Real.rpow (b + c) (k - 1) +\n b / Real.rpow (c + d) (k - 1) +\n c / Real.rpow (d + a) (k - 1) +\n d / Real.rpow (a + b) (k - 1)\n\n/-- For all positive real numbers `a`, `b`, `c`, `d`, and `k`, the cyclic\nweighted inequality stated in the problem holds. -/\ndef Target : Prop :=\n ∀ a b c d k : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d → 0 < k →\n lhs a b c d k ≥ rhs a b c d k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37374c40-b29b-527e-bae0-2dabc18f61ac", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c6ad81b4cd000c8025ae1a51d5ba5273beb9f7f270195f2908c4ef85487ef048", "task_path": "tasks/nmp3_37374c40-b29b-527e-bae0-2dabc18f61ac", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37374c40-b29b-527e-bae0-2dabc18f61ac", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_37542999-7851-5306-aa57-daf9e2b50682", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $M$ and $N$ be two points inside triangle $ABC$ such that $\\angle MAB = \\angle NAC$ and $\\angle MBA = \\angle NBC$. Prove that \n-- \\[\n-- \\frac{AM\\cdot AN}{AB\\cdot AC} + \\frac{BM\\cdot BN}{BA\\cdot BC} + \\frac{CM\\cdot CN}{CA\\cdot CB}=1.\n-- \\]\n/-\nFormalization of the statement in `problem.md`.\n\nThe source problem is a planar Euclidean geometry assertion. We take the\nambient plane to be `EuclideanSpace ℝ (Fin 2)`. Lengths are represented by\nthe metric distance `dist`, and ordinary (unoriented) angles are represented\nby `EuclideanGeometry.angle`.\n\nNo proof of the target assertion is included: `Problem.Target` is a\ndefinition whose value is the proposition asserting the claimed identity for\nevery admissible configuration.\n-/\n\nimport Mathlib\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The ambient Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `IsTriangle A B C` says that the three points `A`, `B`, and `C` are\naffinely independent, i.e. they are not collinear and hence form a\nnondegenerate triangle in the plane. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n AffineIndependent ℝ ![A, B, C]\n\n/-- A point `M` lies strictly inside the triangle with vertices `A`, `B`,\nand `C`. The first condition places it in the closed convex hull; the three\nremaining conditions exclude the three closed sides. For a nondegenerate\ntriangle this is exactly the usual strict interior. -/\ndef StrictlyInsideTriangle (A B C M : Plane) : Prop :=\n M ∈ convexHull ℝ ({A, B, C} : Set Plane) ∧\n M ∉ segment ℝ A B ∧\n M ∉ segment ℝ B C ∧\n M ∉ segment ℝ C A\n\n/-- The two angle hypotheses of the problem:\n`∠MAB = ∠NAC` and `∠MBA = ∠NBC`. Angles are ordinary unoriented\nEuclidean angles in the plane. -/\ndef AngleCondition (A B C M N : Plane) : Prop :=\n EuclideanGeometry.angle M A B = EuclideanGeometry.angle N A C ∧\n EuclideanGeometry.angle M B A = EuclideanGeometry.angle N B C\n\n/-- The conclusion asserted by the problem, with all segment lengths written\nas metric distances and all arithmetic in `ℝ`:\n`AM * AN / (AB * AC) + BM * BN / (BA * BC) + CM * CN / (CA * CB) = 1`. -/\ndef CevianProductIdentity (A B C M N : Plane) : Prop :=\n dist A M * dist A N / (dist A B * dist A C) +\n dist B M * dist B N / (dist B A * dist B C) +\n dist C M * dist C N / (dist C A * dist C B) = 1\n\n/-- The complete proposition of the problem: for every nondegenerate triangle\n`ABC` and every pair of points `M`, `N` strictly inside it satisfying the two\nstated angle equalities, the displayed length identity holds. -/\ndef Target : Prop :=\n ∀ (A B C M N : Plane),\n IsTriangle A B C →\n StrictlyInsideTriangle A B C M →\n StrictlyInsideTriangle A B C N →\n AngleCondition A B C M N →\n CevianProductIdentity A B C M N\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37542999-7851-5306-aa57-daf9e2b50682", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "896f5ff6bef6365666969cc0819d14bcbb5d40e4ea8a1e04409e556b717cb204", "task_path": "tasks/nmp3_37542999-7851-5306-aa57-daf9e2b50682", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37542999-7851-5306-aa57-daf9e2b50682", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3778089e-cc1f-5769-87c3-cb5b7996289a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $a$, $b$, $c$ satisfying $abc=1$, the inequality \n-- \\[\n-- \\frac{1}{(a+1)^3}+\\frac{1}{(b+1)^3}+\\frac{1}{(c+1)^3}\\ge\\frac{3}{8}\n-- \\] \n-- holds.\nimport Mathlib\n\n/-!\n# Formal statement: reciprocal cubic inequality under `abc = 1`\n\nThe original problem asks to prove that for all positive real numbers\n`a`, `b`, `c` with `abc = 1`,\n`1 / (a + 1)^3 + 1 / (b + 1)^3 + 1 / (c + 1)^3 ≥ 3 / 8`.\n\nThe proposition below is the unproved target statement. The division is\nreal division, the powers are natural powers, and the inequality is\nnon-strict.\n-/\n\nnamespace Problem\n\n/-- The target inequality, universally quantified over positive reals with\nproduct equal to one. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n (3 : ℝ) / 8 ≤\n 1 / ((a + 1) ^ 3) + 1 / ((b + 1) ^ 3) + 1 / ((c + 1) ^ 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3778089e-cc1f-5769-87c3-cb5b7996289a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3d3aa1256537525a98833986b8c467069e70ad12cc0b40a7ad981a6f64fad8b8", "task_path": "tasks/nmp3_3778089e-cc1f-5769-87c3-cb5b7996289a", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3778089e-cc1f-5769-87c3-cb5b7996289a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_377877e2-939e-5075-8976-ce1f48eaebb3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a=\\sqrt{2003}$ (an irrational number). Prove that for any integer $N\\ge 1$ and any real $\\lambda>0$ there exist integers $0\\lambda\\,. $\nimport Mathlib\n\n/-!\n# Formal statement of the floor-geometric-progression problem\n\nThe problem fixes `a = sqrt 2003` and asks, for every positive integer `N` and\nthat every positive real `lam`, for a positive strictly increasing integer tuple\n`n_1, ..., n_N` whose floored multiples `⌊n_k * a⌋` form a geometric progression\nwith a real common ratio `μ > λ`.\n-/\n\nnamespace Problem\n\n/-- The fixed real number `a = sqrt 2003` from the problem. -/\nnoncomputable def a : ℝ := Real.sqrt 2003\n\n/-- The `k`-th term of the floor sequence associated to an integer `n`. -/\nnoncomputable def floorMultiple (n : ℤ) : ℤ :=\n ⌊(n : ℝ) * a⌋\n\n/-- A finite sequence, indexed by `Fin N`, is strictly increasing. -/\ndef StrictlyIncreasing {N : ℕ} (n : Fin N → ℤ) : Prop :=\n ∀ i j : Fin N, i < j → n i < n j\n\n/-- The finite integer sequence has positive entries. Together with\n`StrictlyIncreasing`, this encodes `0 < n_1 < n_2 < ... < n_N`. -/\ndef PositiveEntries {N : ℕ} (n : Fin N → ℤ) : Prop :=\n ∀ i : Fin N, 0 < n i\n\n/-- The finite integer sequence has adjacent ratios all equal to the real\nnumber `μ`. Thus its terms form a geometric progression with common ratio\n`μ`. For `N = 1` the adjacency condition is vacuous. -/\ndef IsGeometricWithRatio {N : ℕ} (x : Fin N → ℤ) (μ : ℝ) : Prop :=\n ∀ (i : Fin N) (h : i.val + 1 < N),\n (x ⟨i.val + 1, h⟩ : ℝ) = μ * (x i : ℝ)\n\n/-- The assertion to be proved: for every integer `N ≥ 1` and every real\n`lam > 0`, there are positive strictly increasing integers `n_1, ..., n_N` and a\nreal `μ > lam` such that `⌊n_1 a⌋, ..., ⌊n_N a⌋` is a geometric progression with\ncommon ratio `μ`, where `a = sqrt 2003`. -/\ndef Target : Prop :=\n ∀ (N : ℕ), 1 ≤ N → ∀ (lam : ℝ), 0 < lam →\n ∃ (n : Fin N → ℤ) (μ : ℝ),\n PositiveEntries n ∧\n StrictlyIncreasing n ∧\n lam < μ ∧\n IsGeometricWithRatio (fun i : Fin N => floorMultiple (n i)) μ\n\nend Problem\n\nnamespace Problem\n\n/-- The parenthetical fact that the fixed `a = sqrt 2003` is irrational. This\nis a proved background fact about the concrete number, not an extra hypothesis\nof `Problem.Target`. -/\ntheorem a_irrational : Irrational a := by\n unfold a\n simpa using (show Nat.Prime 2003 by norm_num).irrational_sqrt\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "377877e2-939e-5075-8976-ce1f48eaebb3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "38f96ce3f5423dda240b119d2adeea27d8a5922b547d486bf22ed59ede499f57", "task_path": "tasks/nmp3_377877e2-939e-5075-8976-ce1f48eaebb3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "377877e2-939e-5075-8976-ce1f48eaebb3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_37a14aed-99a4-5f76-a4c3-3b8c71d4961d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be non‑negative real numbers such that $ab+bc+ca>0$. Prove that \n-- \\[\n-- \\sqrt{\\frac{8a}{\\,b+c\\,}+\\Bigl(\\frac{b-c}{\\,b+c\\,}\\Bigr)^{2}}\n-- +\\sqrt{\\frac{8b}{\\,c+a\\,}+\\Bigl(\\frac{c-a}{\\,c+a\\,}\\Bigr)^{2}}\n-- +\\sqrt{\\frac{8c}{\\,a+b\\,}+\\Bigl(\\frac{a-b}{\\,a+b\\,}\\Bigr)^{2}}\n-- \\;\\ge\\;6 .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a cyclic radical inequality\n\nThis module records the proposition stated in `problem.md`. It only defines\nthe expressions occurring in the problem and the target proposition; no proof\nof the target is supplied.\n-/\n\nnamespace Problem\n\n/-- The radical summand with variables arranged as in the source statement:\nfor the first summand this is `summand a b c`, and the other two summands are\nobtained by cyclic permutation. -/\nnoncomputable def summand (x y z : ℝ) : ℝ :=\n Real.sqrt (8 * x / (y + z) + ((y - z) / (y + z)) ^ 2)\n\n/-- The inequality asserted in the source problem, for all nonnegative real\nnumbers `a`, `b`, and `c` with `a*b + b*c + c*a > 0`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a * b + b * c + c * a > 0 →\n summand a b c + summand b c a + summand c a b ≥ 6\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37a14aed-99a4-5f76-a4c3-3b8c71d4961d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "49bb76f0c22a98debe6ccb3fc9b29611e90a69e5213f0075532ed003d08091a9", "task_path": "tasks/nmp3_37a14aed-99a4-5f76-a4c3-3b8c71d4961d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37a14aed-99a4-5f76-a4c3-3b8c71d4961d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_37cb15ba-5072-5129-bd76-8e78556fc0b8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. Prove that the numbers \n-- \\[\n-- \\binom{2^{\\,n}-1}{0},\\;\\binom{2^{\\,n}-1}{1},\\;\\binom{2^{\\,n}-1}{2},\\;\\dots,\\;\\binom{2^{\\,n}-1}{2^{\\,n-1}-1}\n-- \\]\n-- are congruent modulo $2^{\\,n}$ to the odd integers $1,3,5,\\dots,2^{\\,n}-1$ in some order; i.e. the set of residues $\\{\\binom{2^{\\,n}-1}{k}\\bmod 2^{\\,n}\\mid0\\le k\\le2^{\\,n-1}-1\\}$ equals $\\{1,3,5,\\dots,2^{\\,n}-1\\}$.\nimport Mathlib\n\n/-!\n# Formalization of the binomial-residue problem\n\nFor every positive natural number `n`, the canonical residues modulo `2 ^ n`\nof the binomial coefficients\n`Nat.choose (2 ^ n - 1) k`, for `0 ≤ k ≤ 2 ^ (n - 1) - 1`,\nform exactly the set of odd integers from `1` through `2 ^ n - 1`.\n\nThe finite residue range and finite target set are represented by `Finset`s;\ntheir underlying sets are then compared in `Problem.Claim`. The complete\nassertion is packaged as the proposition-valued definition `Problem.Target`.\n-/\n\nnamespace Problem\n\n/-- The finite set of canonical residues modulo `2 ^ n` of the binomial\ncoefficients `Nat.choose (2 ^ n - 1) k`, where `k` ranges over the inclusive\ninterval `0 ≤ k ≤ 2 ^ (n - 1) - 1`. -/\ndef binomialResidueFinset (n : ℕ) : Finset ℕ :=\n (Finset.Icc 0 (2 ^ (n - 1) - 1)).image\n (fun k : ℕ => (Nat.choose (2 ^ n - 1) k) % (2 ^ n))\n\n/-- The finite set of odd natural numbers in the inclusive interval from `1`\nthrough `2 ^ n - 1`. -/\ndef oddIntegerFinset (n : ℕ) : Finset ℕ :=\n (Finset.Icc 1 (2 ^ n - 1)).filter (fun r : ℕ => Odd r)\n\n/-- The underlying set of binomial residues modulo `2 ^ n`. -/\ndef binomialResidueSet (n : ℕ) : Set ℕ :=\n (binomialResidueFinset n : Set ℕ)\n\n/-- The underlying set of odd integers from `1` through `2 ^ n - 1`. -/\ndef oddIntegerSet (n : ℕ) : Set ℕ :=\n (oddIntegerFinset n : Set ℕ)\n\n/-- The pointwise set-equality asserted by the problem for a fixed exponent `n`. -/\ndef Claim (n : ℕ) : Prop :=\n binomialResidueSet n = oddIntegerSet n\n\n/-- The full problem statement: for every positive integer `n`, the set of\nbinomial residues modulo `2 ^ n` is equal to the set of odd integers from `1`\nthrough `2 ^ n - 1`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → Claim n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37cb15ba-5072-5129-bd76-8e78556fc0b8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c29d461e01334a7b6c5d05992dc441bcddf0e1a1b44a117ee18c6dc94780d36c", "task_path": "tasks/nmp3_37cb15ba-5072-5129-bd76-8e78556fc0b8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37cb15ba-5072-5129-bd76-8e78556fc0b8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_37cda861-dfd4-5ddc-b5cd-91e4e310079e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $z\\ge 1$ be a real number and define \n-- $$f(t)=\\frac{1}{(t+1)^{1/z}},\\qquad t\\ge0.$$ \n-- Let $n\\in\\mathbb N$ and $m>0$ be given. For positive real numbers $x_1,\\dots,x_n$ satisfying \n-- $$x_1x_2\\cdots x_n=m^n,$$ \n-- prove that \n-- \\[\n-- \\sum_{i=1}^{n}f(x_i)\\;\\ge\\;\\min\\!\\Bigl\\{\\,1,\\;n\\,f(m)\\Bigr\\},\n-- \\]\n-- i.e. \n-- \\[\n-- \\sum_{i=1}^{n}\\frac{1}{(x_i+1)^{1/z}}\\ge \\min\\Bigl\\{1,\\;\\frac{n}{(m+1)^{1/z}}\\Bigr\\}.\n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- For a real parameter `z`, the function from the nonnegative reals to the reals\ngiven by `t ↦ 1 / (t + 1) ^ (1 / z)`. The subtype records the source domain\n`t ≥ 0` explicitly. -/\nnoncomputable def f (z : ℝ) (t : {t : ℝ // 0 ≤ t}) : ℝ :=\n 1 / Real.rpow ((t : ℝ) + 1) (1 / z)\n\n/-- The assertion stated in the problem: for every real `z ≥ 1`, every natural\nnumber `n`, every positive real `m`, and every family of positive reals `x i`\nindexed by `Fin n` whose product is `m ^ n`, the sum of `f z (x i)` is at least\n`min 1 (n * f z m)`. -/\ndef Target : Prop :=\n ∀ (z : ℝ) (_hz : 1 ≤ z),\n ∀ (n : ℕ),\n ∀ (m : ℝ) (hm : 0 < m),\n ∀ (x : Fin n → ℝ) (hx : ∀ i : Fin n, 0 < x i),\n (∏ i : Fin n, x i = m ^ n) →\n (∑ i : Fin n, f z ⟨x i, le_of_lt (hx i)⟩) ≥\n min (1 : ℝ) ((n : ℝ) * f z ⟨m, le_of_lt hm⟩)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37cda861-dfd4-5ddc-b5cd-91e4e310079e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d29e13786007816bc2854e5117584406e0330383623c05c9a48d775ad7f8a935", "task_path": "tasks/nmp3_37cda861-dfd4-5ddc-b5cd-91e4e310079e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37cda861-dfd4-5ddc-b5cd-91e4e310079e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_37d02948-9b52-585f-87d2-538f4431f3ee", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer relatively prime to $6$. The vertices of a regular $n$‑gon are coloured with three colours so that each colour is used on an odd number of vertices. Prove that there exists an isosceles triangle formed by three vertices of the polygon whose three vertices have three distinct colours.\nimport Mathlib\n\n/-!\n# Formalization of the regular-polygon three-colouring problem\n\nWe model the vertices of the regular `n`-gon by the `n`-th roots of unity in the\ncomplex plane. Since any two regular `n`-gons are similar, this canonical model\npreserves the property that a triangle formed by vertices is isosceles.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The vertices of a regular `n`-gon, indexed by `Fin n`, placed on the unit\ncircle. The `k`-th vertex is `exp (2 * pi * I * k / n)`. -/\ndef RegularPolygonVertex (n : ℕ) (k : Fin n) : ℂ :=\n Complex.exp (Complex.I * ((2 * Real.pi * (k : ℝ)) / (n : ℝ)))\n\n/-- A triple of vertices of the regular `n`-gon forms an isosceles triangle.\nThis says that the three vertices are distinct and that at least one pair of\nsides has equal length. (In the convention used here, an equilateral triangle\nhas three pairs of equal sides and is therefore isosceles.) -/\ndef IsoscelesTriangle (n : ℕ) (i j k : Fin n) : Prop :=\n i ≠ j ∧ i ≠ k ∧ j ≠ k ∧\n (dist (RegularPolygonVertex n i) (RegularPolygonVertex n j) =\n dist (RegularPolygonVertex n i) (RegularPolygonVertex n k) ∨\n dist (RegularPolygonVertex n j) (RegularPolygonVertex n i) =\n dist (RegularPolygonVertex n j) (RegularPolygonVertex n k) ∨\n dist (RegularPolygonVertex n k) (RegularPolygonVertex n i) =\n dist (RegularPolygonVertex n k) (RegularPolygonVertex n j))\n\n/-- The three vertices of the triangle have three pairwise distinct colours,\nwhere the three available colours are represented by `Fin 3`. -/\ndef ThreeDistinctColours {n : ℕ} (colour : Fin n → Fin 3) (i j k : Fin n) : Prop :=\n colour i ≠ colour j ∧ colour i ≠ colour k ∧ colour j ≠ colour k\n\n/-- Every one of the three colours is used on an odd number of vertices. -/\ndef EveryColourUsedOddly {n : ℕ} (colour : Fin n → Fin 3) : Prop :=\n ∀ c : Fin 3, Odd ((Finset.univ.filter (fun i : Fin n => colour i = c)).card)\n\n/-- The assertion of the problem: for every positive integer `n` coprime to `6`,\nand every colouring of the vertices of a regular `n`-gon with three colours in\nwhich each colour occurs an odd number of times, there exist three vertices\nforming an isosceles triangle whose colours are pairwise distinct. -/\ndef Target : Prop :=\n ∀ (n : ℕ),\n 0 < n →\n Nat.Coprime n 6 →\n ∀ (colour : Fin n → Fin 3),\n EveryColourUsedOddly colour →\n ∃ i j k : Fin n,\n IsoscelesTriangle n i j k ∧ ThreeDistinctColours colour i j k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37d02948-9b52-585f-87d2-538f4431f3ee", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a4fd52c5388674d2d45732a67908d839e8fd8f8b68d3045175a149ee287f4d6e", "task_path": "tasks/nmp3_37d02948-9b52-585f-87d2-538f4431f3ee", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37d02948-9b52-585f-87d2-538f4431f3ee", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_37d97daf-3671-5d7f-89d7-ff3217619d72", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f(x)=\\dfrac{2x}{1+e^x}$. Prove that for every non‑negative integer $n$, the $n$th derivative at the origin $f^{(n)}(0)$ is an integer.\n/-\nStatement of the problem:\n\nLet f(x) = 2x / (1 + e^x). Prove that for every non-negative integer n,\nthe nth derivative at the origin f^(n)(0) is an integer.\n\nThis file contains only the formal statement (a proposition-valued\ndefinition); it does not contain a proof.\n-/\n\nimport Mathlib.Analysis.Calculus.IteratedDeriv.Defs\nimport Mathlib.Analysis.SpecialFunctions.ExpDeriv\n\nnoncomputable section\n\nopen Real\n\nnamespace Problem\n\n/-- The function of the problem: `f(x) = 2 * x / (1 + exp x)`, defined on all of `ℝ`. -/\ndef f (x : ℝ) : ℝ := 2 * x / (1 + Real.exp x)\n\n/-- A real number is an integer when it is the image of some integer under the canonical\nembedding `ℤ → ℝ`. -/\ndef IsIntegerValued (y : ℝ) : Prop := ∃ k : ℤ, y = (k : ℝ)\n\n/-- The `n`-th derivative of `f` at the origin, in the sense of the iterated derivative\n`iteratedDeriv n f 0`. -/\ndef nthDerivAtZero (n : ℕ) : ℝ := iteratedDeriv n f 0\n\n/-- The assertion of the problem: for every non-negative integer `n`, the `n`-th derivative\nof `f` at the origin is an integer. The outer quantifier is over `ℕ` (non-negative integers),\nand for each `n` there exists an integer `k : ℤ` whose real coercion is `f^{(n)}(0)`. -/\ndef Target : Prop := ∀ n : ℕ, ∃ k : ℤ, iteratedDeriv n f 0 = (k : ℝ)\n\n/-- `Target` expressed using the auxiliary predicates `nthDerivAtZero` and\n`IsIntegerValued`. -/\ntheorem target_iff :\n Target ↔ ∀ n : ℕ, IsIntegerValued (nthDerivAtZero n) := Iff.rfl\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37d97daf-3671-5d7f-89d7-ff3217619d72", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b063b800bcd71d2468ad655bb75960335ef333067bf8935a676c9c474c6c9937", "task_path": "tasks/nmp3_37d97daf-3671-5d7f-89d7-ff3217619d72", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37d97daf-3671-5d7f-89d7-ff3217619d72", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_37e92ec8-d59e-56af-93eb-4dab0cb8bcfb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Consider a finite set of points $\\Phi\\subset\\mathbb{R}^2$ satisfying the following properties:\n-- 1. $\\Phi$ does not contain the origin $(0,0)$ and not all points of $\\Phi$ are collinear.\n-- 2. If $\\alpha\\in\\Phi$, then $-\\alpha\\in\\Phi$, and for any real scalar $c\\neq\\pm1$, $c\\alpha\\notin\\Phi$.\n-- 3. If $\\alpha,\\beta\\in\\Phi$, then the reflection of $\\beta$ across the line through the origin that is perpendicular to the line through the origin and $\\alpha$ also belongs to $\\Phi$.\n-- 4. For any $\\alpha=(a,b),\\;\\beta=(c,d)$ in $\\Phi$, the quantity $\\displaystyle\\frac{2(ac+bd)}{c^2+d^2}$ is an integer.\n-- \n-- Prove that $\\Phi$ cannot contain five collinear points.\nimport Mathlib\n\n/-!\n# Formal statement: five collinear points in an admissible planar point set\n\nThe source problem concerns finite subsets of the real plane which are centrally\nsymmetric about the origin, contain no other real multiples of their points, are\nclosed under reflection in the line through the origin perpendicular to each\npoint's radial line, and whose pairwise normalized inner products are integers.\nThe target says that such a set cannot contain five collinear points.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, represented as the real Euclidean space on `Fin 2`. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A set of points is collinear when all points lie on one affine line.\nThe line is specified by two distinct points (not necessarily belonging to the set). -/\ndef Collinear (S : Set Plane) : Prop :=\n ∃ p q : Plane, p ≠ q ∧ ∀ x : Plane, x ∈ S → ∃ t : ℝ, x = p + t • (q - p)\n\n/-- Reflection of `β` across the line through the origin perpendicular to the\nline through the origin and `α`.\n\nIf `α ≠ 0`, this is the reflection across `αᗮ`, with the familiar formula\n`β - 2 (⟪β, α⟫ / ⟪α, α⟫) α`. -/\ndef reflectAcrossPerpendicular (α β : Plane) : Plane :=\n β - (2 * (inner ℝ β α / inner ℝ α α)) • α\n\n/-- Property 1: `Φ` is finite, does not contain the origin, and is not contained\nin a single affine line. -/\ndef Property1 (Φ : Set Plane) : Prop :=\n Φ.Finite ∧ (0 : Plane) ∉ Φ ∧ ¬ Collinear Φ\n\n/-- Property 2: `Φ` is closed under negation, and scalar multiples by any real\nscalar other than `1` and `-1` are not in `Φ`. -/\ndef Property2 (Φ : Set Plane) : Prop :=\n ∀ α : Plane, α ∈ Φ →\n (-α ∈ Φ ∧ ∀ c : ℝ, c ≠ 1 → c ≠ -1 → c • α ∉ Φ)\n\n/-- Property 3: `Φ` is closed under reflection across the line through the origin\nperpendicular to the line through the origin and any member `α`. -/\ndef Property3 (Φ : Set Plane) : Prop :=\n ∀ α : Plane, α ∈ Φ → ∀ β : Plane, β ∈ Φ →\n reflectAcrossPerpendicular α β ∈ Φ\n\n/-- Property 4: for every ordered pair `α, β` of points of `Φ`, the real number\n`2 * ⟪α, β⟫ / ⟪β, β⟫` is an integer. -/\ndef Property4 (Φ : Set Plane) : Prop :=\n ∀ α : Plane, α ∈ Φ → ∀ β : Plane, β ∈ Φ → ∃ n : ℤ,\n (2 * (inner ℝ α β) / inner ℝ β β) = (n : ℝ)\n\n/-- The four hypotheses imposed on the finite point set in the source problem. -/\ndef Admissible (Φ : Set Plane) : Prop :=\n Property1 Φ ∧ Property2 Φ ∧ Property3 Φ ∧ Property4 Φ\n\n/-- `Φ` contains five distinct collinear points, i.e. a five-element subset of\n`Φ` all of whose points lie on one affine line. -/\ndef ContainsFiveCollinear (Φ : Set Plane) : Prop :=\n ∃ T : Finset Plane, (T : Set Plane) ⊆ Φ ∧ T.card = 5 ∧ Collinear (T : Set Plane)\n\n/-- The assertion to be proved: no admissible set `Φ` contains five collinear points. -/\ndef Target : Prop :=\n ∀ Φ : Set Plane, Admissible Φ → ¬ ContainsFiveCollinear Φ\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37e92ec8-d59e-56af-93eb-4dab0cb8bcfb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d4bf99b7a313b78710d8461a6aea2cf6e1b7a0c88224f5eebbee9d9dd20661bb", "task_path": "tasks/nmp3_37e92ec8-d59e-56af-93eb-4dab0cb8bcfb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "37e92ec8-d59e-56af-93eb-4dab0cb8bcfb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_38326500-2485-5ce0-a528-f7e6641a5b85", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(A,B,C,D\\in M_n(\\mathbb{C})\\) with \\(A\\) and \\(C\\) invertible. Suppose that \n-- \\[\n-- A^{k}B=C^{k}D\\qquad\\text{for all integers }k\\ge 1.\n-- \\]\n-- Prove that \\(B=D\\).\nimport Mathlib.Basic.Complex.Basic\nimport Mathlib.Data.Matrix.Basic\n\n/-!\n# Statement formalization\n\nThe original problem asks to prove that two complex square matrices `B` and `D`\nare equal, given that `A` and `C` are invertible and that\n`A ^ k * B = C ^ k * D` for every positive integer `k`.\n\nThe matrices are represented as `Matrix (Fin n) (Fin n) ℂ`. The phrase\n\"for all integers `k ≥ 1`\" is represented by a universal quantifier over\n`k : ℕ` together with the hypothesis `1 ≤ k`.\n-/\n\nnamespace Problem\n\n/--\nFor every natural matrix size `n` and all complex `n × n` matrices `A`, `B`,\n`C`, and `D`, if `A` and `C` are invertible and `A ^ k * B = C ^ k * D`\nfor every positive integer `k`, then `B = D`.\n-/\ndef Target : Prop :=\n ∀ (n : ℕ) (A B C D : Matrix (Fin n) (Fin n) ℂ),\n IsUnit A →\n IsUnit C →\n (∀ k : ℕ, 1 ≤ k → A ^ k * B = C ^ k * D) →\n B = D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "38326500-2485-5ce0-a528-f7e6641a5b85", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "eb49132d1b8434237b64ecfd3db8bc5267a6d7a9a2bf69ffdf6c9367ba9b02dc", "task_path": "tasks/nmp3_38326500-2485-5ce0-a528-f7e6641a5b85", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "38326500-2485-5ce0-a528-f7e6641a5b85", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3846a5c3-ab73-5a11-a4ee-bd6cae7103d4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ be real numbers such that $8+abc\\le3(a+b+c)$. Prove that \n-- \\[\n-- \\sqrt{a^2+3}+\\sqrt{b^2+3}+\\sqrt{c^2+3}\\ge6.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the nonnegative-real square-root inequality\n\nThe source problem asks one universal inequality statement: for all nonnegative\nreal numbers `a`, `b`, and `c` satisfying `8 + a*b*c ≤ 3*(a+b+c)`, prove that\n`sqrt(a^2+3) + sqrt(b^2+3) + sqrt(c^2+3) ≥ 6`.\n\nThe assertion is represented as a proposition-valued definition, not as a\nproved theorem.\n-/\n\nnamespace Problem\n\n/-- The source problem's nonnegativity hypothesis for the three real parameters. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The source problem's algebraic side condition on the three real parameters. -/\ndef Constraint (a b c : ℝ) : Prop :=\n 8 + a * b * c ≤ 3 * (a + b + c)\n\n/-- The admissibility conditions imposed on the three real parameters in the\nsource problem: all are nonnegative and `8 + a*b*c ≤ 3*(a+b+c)`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ Constraint a b c\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n Real.sqrt (a ^ 2 + 3) + Real.sqrt (b ^ 2 + 3) + Real.sqrt (c ^ 2 + 3)\n\n/-- The desired conclusion for a fixed admissible triple. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n 6 ≤ LHS a b c\n\n/-- The complete universally quantified assertion of the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3846a5c3-ab73-5a11-a4ee-bd6cae7103d4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7b03b08e524d35651ebd5af9decd2690505d9b40c89c308cc324ba822ba5a428", "task_path": "tasks/nmp3_3846a5c3-ab73-5a11-a4ee-bd6cae7103d4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3846a5c3-ab73-5a11-a4ee-bd6cae7103d4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_38589f07-053a-5ca3-9e88-bdfb7e43ecd6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{\\sqrt{a^{2}+bc}}{b+c}+\\frac{\\sqrt{b^{2}+ca}}{c+a}+\\frac{\\sqrt{c^{2}+ab}}{a+b}\\ge\n-- \\sqrt{\\frac{a}{\\,b+c\\,}}+\\sqrt{\\frac{b}{\\,c+a\\,}}+\\sqrt{\\frac{c}{\\,a+b\\,}}.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the inequality stated in `problem.md`.\n\nThe original problem asks to prove, for positive real numbers `a`, `b`, and `c`, that\n\n sqrt(a^2 + b*c)/(b+c) + sqrt(b^2 + c*a)/(c+a) + sqrt(c^2 + a*b)/(a+b)\n ≥ sqrt(a/(b+c)) + sqrt(b/(c+a)) + sqrt(c/(a+b)).\n\nWe record the complete universally quantified proposition as `Problem.Target`.\nNo proof is supplied at this stage.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a ^ 2 + b * c) / (b + c) +\n Real.sqrt (b ^ 2 + c * a) / (c + a) +\n Real.sqrt (c ^ 2 + a * b) / (a + b)\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a / (b + c)) +\n Real.sqrt (b / (c + a)) +\n Real.sqrt (c / (a + b))\n\n/-- The assertion from the problem: for all positive real numbers `a`, `b`, and `c`,\nthe left-hand side is at least the right-hand side. -/\nnoncomputable def Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "38589f07-053a-5ca3-9e88-bdfb7e43ecd6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2daf5b0abc8715d890f6fd22f5b1920320195ea579eca5b27eb755b35a55b998", "task_path": "tasks/nmp3_38589f07-053a-5ca3-9e88-bdfb7e43ecd6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "38589f07-053a-5ca3-9e88-bdfb7e43ecd6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_385b9747-f1f4-5fe7-b257-4f9133e1590b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{1}{a^{2}+b^{2}+ab}+\\frac{1}{b^{2}+c^{2}+bc}+\\frac{1}{c^{2}+a^{2}+ca}\\ge\\frac{9}{(a+b+c)^{2}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nFor positive real numbers `a`, `b`, and `c`, prove\n\n`1 / (a^2 + b^2 + a*b) + 1 / (b^2 + c^2 + b*c)\n + 1 / (c^2 + a^2 + c*a) ≥ 9 / (a + b + c)^2`.\n\nThe target is represented as a proposition-valued definition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The denominator appearing with two consecutive variables `x` and `y`. -/\ndef denom (x y : ℝ) : ℝ := x ^ 2 + y ^ 2 + x * y\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / denom a b + 1 / denom b c + 1 / denom c a\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ := 9 / (a + b + c) ^ 2\n\n/-- The complete theorem statement: for all positive real `a`, `b`, and `c`, the\ncyclic sum of reciprocal quadratic denominators is at least `9 / (a+b+c)^2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "385b9747-f1f4-5fe7-b257-4f9133e1590b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "66bf8fad6d2a1eb6b8d79823c2ce4181afd0b30080ab0b97e88dc296ef79288b", "task_path": "tasks/nmp3_385b9747-f1f4-5fe7-b257-4f9133e1590b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "385b9747-f1f4-5fe7-b257-4f9133e1590b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_386ab162-9886-5ddf-8ba2-85c526627025", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P(x)=a_n x^n + a_{n-1}x^{n-1} + \\dots + a_0$ be a polynomial with integer coefficients, $a_n>0$, and degree $n\\ge 2$. Prove that there exists a positive integer $m$ such that $P(m!)$ is a composite integer.\nimport Mathlib\n\nnamespace Problem\n\n/-- An integer is composite when it is positive and admits a factorization into two\nnatural numbers both strictly greater than one. This is the usual meaning of a\ncomposite (positive) integer. -/\ndef IsCompositeInteger (z : ℤ) : Prop :=\n ∃ a b : ℕ, 1 < a ∧ 1 < b ∧ z = ((a * b : ℕ) : ℤ)\n\n/-- The assertion of the problem: every integer-coefficient polynomial of degree at\nleast two with positive leading coefficient assumes a composite integer value at\n`m!` for some positive integer `m`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (P : Polynomial ℤ),\n 2 ≤ n →\n P.natDegree = n →\n 0 < P.coeff n →\n ∃ m : ℕ, 0 < m ∧ IsCompositeInteger (P.eval ((Nat.factorial m : ℕ) : ℤ))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "386ab162-9886-5ddf-8ba2-85c526627025", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ec6cfd619b5ef97f2d25391b5560d97a84fd147f36e9bd2beb7c211de8797416", "task_path": "tasks/nmp3_386ab162-9886-5ddf-8ba2-85c526627025", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "386ab162-9886-5ddf-8ba2-85c526627025", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3888dad3-8b3f-5b31-aabd-275cfb70d496", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}(a+b-c)^4+4(a-b)(b-c)(c-a)(a+b+c)\\ge\\sum_{\\text{cyc}}a^4.\n-- \\] \n-- Here $\\sum_{\\text{cyc}}$ denotes the cyclic sum over $(a,b,c)$, i.e. $\\sum_{\\text{cyc}}(a+b-c)^4=(a+b-c)^4+(b+c-a)^4+(c+a-b)^4$ and $\\sum_{\\text{cyc}}a^4=a^4+b^4+c^4$.\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic fourth-power inequality\n\nThe source problem asks to prove, for real numbers `a`, `b`, and `c`, that\n\n`sum_cyc (a + b - c)^4 + 4 * (a - b) * (b - c) * (c - a) * (a + b + c)\n >= sum_cyc a^4`.\n\nThe cyclic sums are expanded in the order specified by the problem:\n`(a,b,c)`, `(b,c,a)`, and `(c,a,b)`.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum, in the order `(a,b,c)`, `(b,c,a)`, `(c,a,b)`. -/\ndef cyclicSum (f : ℝ → ℝ → ℝ → ℝ) (a b c : ℝ) : ℝ :=\n f a b c + f b c a + f c a b\n\n/-- The cyclic sum `Σ_cyc (a+b-c)^4` from the problem statement. -/\ndef cyclicShiftedFourthPowerSum (a b c : ℝ) : ℝ :=\n cyclicSum (fun x y z : ℝ => (x + y - z) ^ 4) a b c\n\n/-- The cyclic sum `Σ_cyc a^4`, i.e. `a^4 + b^4 + c^4`. -/\ndef cyclicFourthPowerSum (a b c : ℝ) : ℝ :=\n cyclicSum (fun x _ _ : ℝ => x ^ 4) a b c\n\n/-- The left-hand side of the source inequality. -/\ndef inequalityLeftHandSide (a b c : ℝ) : ℝ :=\n cyclicShiftedFourthPowerSum a b c +\n (4 : ℝ) * (a - b) * (b - c) * (c - a) * (a + b + c)\n\n/-- The right-hand side of the source inequality. -/\ndef inequalityRightHandSide (a b c : ℝ) : ℝ :=\n cyclicFourthPowerSum a b c\n\n/-- The pointwise assertion that the source inequality holds for `a`, `b`, and `c`. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n inequalityLeftHandSide a b c ≥ inequalityRightHandSide a b c\n\n/-- The full universally quantified proposition stated by the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3888dad3-8b3f-5b31-aabd-275cfb70d496", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9c86d4397ddfccfc387d73c89efc3a483050de4d6f5f01d8c2b3edd4f692de98", "task_path": "tasks/nmp3_3888dad3-8b3f-5b31-aabd-275cfb70d496", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3888dad3-8b3f-5b31-aabd-275cfb70d496", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_38d4104f-fda3-5b0e-a05c-03b431eca2d7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\{a_n\\}$ be a sequence defined by $a_1=\\tfrac12$ and \n-- $$a_{k+1}=-a_k+\\frac{1}{2-a_k}\\qquad(k=1,2,\\dots).$$ \n-- Prove that for every positive integer $n$\n-- \\[\n-- \\Biggl(\\frac{n}{2(a_1+a_2+\\cdots+a_n)}-1\\Biggr)^n\\le \n-- \\Biggl(\\frac{a_1+a_2+\\cdots+a_n}{n}\\Biggr)^n\n-- \\prod_{k=1}^n\\Bigl(\\frac1{a_k}-1\\Bigr)\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the recursive-sequence inequality\n\nThe source problem indexes its sequence by positive integers. To keep the\nrecursion structural in Lean, `Problem.a k` denotes the source term `a_{k+1}`.\nThus `Problem.a 0` is the source value `a_1`, and the source recurrence for\n`a_{k+1}` is represented by the defining equation for `Problem.a (k+1)`.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- Zero-based encoding of the sequence: `Problem.a k` represents the source\nterm `a_{k+1}`. Hence the initial condition is `Problem.a 0 = 1 / 2`. -/\ndef a : ℕ → ℝ\n | 0 => (1 : ℝ) / 2\n | k + 1 => -a k + (1 : ℝ) / ((2 : ℝ) - a k)\n\n/-- The sum of the first `n` source terms, in the zero-based encoding. -/\ndef partialSum (n : ℕ) : ℝ :=\n (Finset.range n).sum (fun k => a k)\n\n/-- The product of `1 / a_k - 1` over the first `n` source terms. -/\ndef partialProduct (n : ℕ) : ℝ :=\n (Finset.range n).prod (fun k => (1 : ℝ) / a k - 1)\n\n/-- Every term of the recursively defined sequence lies strictly between\n`0` and `1`. This is recorded to make explicit that the divisions occurring\nin the recurrence and in the displayed inequality are divisions by nonzero\nreal numbers on the actual sequence. -/\nlemma a_pos_and_lt_one : ∀ k : ℕ, 0 < a k ∧ a k < 1\n | 0 => by\n norm_num [a]\n | k + 1 => by\n have hk := a_pos_and_lt_one k\n have hxpos : 0 < a k := hk.1\n have hxlt : a k < 1 := hk.2\n have hden : 0 < (2 : ℝ) - a k := by linarith\n have hdenne : (2 : ℝ) - a k ≠ 0 := ne_of_gt hden\n have hrewrite : a (k + 1) = (1 - a k) ^ 2 / ((2 : ℝ) - a k) := by\n rw [a]\n field_simp [hdenne]\n ring\n rw [hrewrite]\n constructor\n · have hnumpos : 0 < (1 - a k) ^ 2 := sq_pos_of_ne_zero (by linarith)\n positivity\n · rw [div_lt_one hden]\n nlinarith [sq_nonneg (1 - a k)]\n\n/-- Every term of the sequence is nonzero, so the factors `1 / a_k` are\nwell-defined under the ordinary partial interpretation of division. -/\nlemma a_ne_zero (k : ℕ) : a k ≠ 0 :=\n ne_of_gt (a_pos_and_lt_one k).1\n\n/-- The recurrence denominator `2 - a_k` is nonzero for every `k`. -/\nlemma two_sub_a_ne_zero (k : ℕ) : (2 : ℝ) - a k ≠ 0 := by\n have h : 0 < (2 : ℝ) - a k := by\n linarith [(a_pos_and_lt_one k).2]\n exact ne_of_gt h\n\n/-- For every positive `n`, the partial sum used in the displayed inequality\nis nonzero (indeed positive). -/\nlemma partialSum_pos {n : ℕ} (hn : 0 < n) : 0 < partialSum n := by\n unfold partialSum\n apply Finset.sum_pos\n · intro k _\n exact (a_pos_and_lt_one k).1\n · rw [Finset.nonempty_range_iff]\n omega\n\n/-- For positive `n`, the partial sum in the first denominator is nonzero. -/\nlemma partialSum_ne_zero {n : ℕ} (hn : 0 < n) : partialSum n ≠ 0 :=\n ne_of_gt (partialSum_pos hn)\n\n/-- The inequality asserted by the source problem at a fixed positive `n`. -/\ndef InequalityAt (n : ℕ) : Prop :=\n ((n : ℝ) / (2 * partialSum n) - 1) ^ n ≤\n (partialSum n / (n : ℝ)) ^ n * partialProduct n\n\n/-- The full assertion: for every positive integer `n`, the displayed\ninequality holds for the recursively defined sequence. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → InequalityAt n\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "38d4104f-fda3-5b0e-a05c-03b431eca2d7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2fb26ff241e02630a64dd72ff537934c3d2619ef1f2cb282b32099850d440d61", "task_path": "tasks/nmp3_38d4104f-fda3-5b0e-a05c-03b431eca2d7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "38d4104f-fda3-5b0e-a05c-03b431eca2d7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_38e9e416-40af-523c-92e1-d66c6fc727a7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Viktor and Natalia have 2020 distinct ice‑cream buckets. They schedule 2020 rounds; in each round each of them tries one ice‑cream, and the two ice‑creams tried in the same round must be different. Over the 2020 rounds each ice‑cream is tried exactly once by each person. A schedule is called fair if the number of ice‑creams that Viktor tries before Natalia equals the number of ice‑creams that Natalia tries before Viktor. Prove that the number of fair schedules is strictly larger than \n-- \\[\n-- 2020!\\,\\Bigl(2^{1010}+(1010!)^2\\Bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Fair ice-cream schedules\n\nThis file formalizes the statement of the problem. A schedule assigns to every\none of the 2020 rounds a distinct ice cream for each person; each person uses\nevery ice cream exactly once. A schedule is fair when Viktor precedes Natalia\non exactly as many ice creams as Natalia precedes Viktor. The target asserts\nthe strict lower bound from the problem statement. No proof of the target is\nincluded here.\n-/\n\nnamespace Problem\n\n/-- The 2020 distinct ice creams, for the purpose of counting labeled schedules. -/\nabbrev IceCream : Type := Fin 2020\n\n/-- The 2020 chronologically ordered rounds. -/\nabbrev Round : Type := Fin 2020\n\n/-- A schedule consists of the two people's orders of trying the ice creams,\nsubject to the requirement that in every round the two chosen ice creams differ.\nBecause both order maps are equivalences, each person tries every ice cream\nexactly once over the 2020 rounds. -/\nstructure Schedule where\n viktor : Round ≃ IceCream\n natalia : Round ≃ IceCream\n round_different : ∀ r : Round, viktor r ≠ natalia r\n\n/-- The finite dummy is obtained by injecting a schedule into the finite product\nof its two order permutations. The proof field is irrelevant because it is a\nproposition. -/\nnoncomputable instance instFintypeSchedule : Fintype Schedule :=\n Fintype.ofInjective (fun s : Schedule => (s.viktor, s.natalia)) (by\n intro s t h\n cases s with\n | mk v n hne =>\n cases t with\n | mk v' n' hne' =>\n simp only [Prod.mk.injEq] at h\n rcases h with ⟨rfl, rfl⟩\n have hproof : hne = hne' := Subsingleton.elim hne hne'\n exact congrArg (Schedule.mk v n) hproof)\n\n/-- Viktor tries ice cream `i` in an earlier round than Natalia does. Since the\nfields are equivalences from rounds to ice creams, `s.viktor.symm i` is the\nround in which Viktor tries ice cream `i`. -/\nabbrev ViktorBeforeNatalia (s : Schedule) (i : IceCream) : Prop :=\n s.viktor.symm i < s.natalia.symm i\n\n/-- Natalia tries ice cream `i` in an earlier round than Viktor does. -/\nabbrev NataliaBeforeViktor (s : Schedule) (i : IceCream) : Prop :=\n s.natalia.symm i < s.viktor.symm i\n\n/-- The ice creams on which Viktor is first. -/\ndef ViktorBeforeNataliaSet (s : Schedule) : Finset IceCream :=\n Finset.univ.filter (fun i : IceCream => ViktorBeforeNatalia s i)\n\n/-- The ice creams on which Natalia is first. -/\ndef NataliaBeforeViktorSet (s : Schedule) : Finset IceCream :=\n Finset.univ.filter (fun i : IceCream => NataliaBeforeViktor s i)\n\n/-- The number of ice creams that Viktor tries before Natalia. -/\ndef ViktorBeforeNataliaCount (s : Schedule) : ℕ :=\n (ViktorBeforeNataliaSet s).card\n\n/-- The number of ice creams that Natalia tries before Viktor. -/\ndef NataliaBeforeViktorCount (s : Schedule) : ℕ :=\n (NataliaBeforeViktorSet s).card\n\n/-- A schedule is fair when the two chronological precedence counts are equal. -/\nabbrev Fair (s : Schedule) : Prop :=\n ViktorBeforeNataliaCount s = NataliaBeforeViktorCount s\n\n/-- The set of all fair schedules. -/\ndef FairSchedules : Set Schedule := {s : Schedule | Fair s}\n\n/-- The number of fair schedules, as the finite cardinality of `FairSchedules`. -/\nnoncomputable def NumberOfFairSchedules : ℕ := by\n classical\n exact Fintype.card FairSchedules\n\n/-- The numerical lower bound appearing in the problem statement. -/\ndef Bound : ℕ :=\n (Nat.factorial 2020) * (2 ^ 1010 + (Nat.factorial 1010) ^ 2)\n\n/-- The assertion to be proved: the number of fair schedules is strictly larger\nthan `2020! * (2 ^ 1010 + (1010!)^2)`. -/\ndef Target : Prop :=\n Bound < NumberOfFairSchedules\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "38e9e416-40af-523c-92e1-d66c6fc727a7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e3ca3c3aae42f698f647d3a3e62212d84c1991589c95dc87498dc2f47eea4403", "task_path": "tasks/nmp3_38e9e416-40af-523c-92e1-d66c6fc727a7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "38e9e416-40af-523c-92e1-d66c6fc727a7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3905499c-4355-58a6-94f5-4ec033a6af73", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P(x)$ be a real‑coefficient polynomial. Assume that for every irrational real number $\\alpha$, the value $P(\\alpha)$ is irrational. Prove that $\\displaystyle\\deg P\\le 1\\,$.\nimport Mathlib\n\n/-!\n# Formal statement of the real-polynomial irrational-values problem\n\nThe problem asks to prove that a real-coefficient polynomial taking irrational\nvalues at every irrational real argument must have degree at most one.\n-/\n\nnamespace Problem\n\n/-- The hypothesis that a real-coefficient polynomial maps every irrational real\nnumber to an irrational real number. -/\ndef IrrationalValueHypothesis (P : Polynomial ℝ) : Prop :=\n ∀ α : ℝ, Irrational α → Irrational (P.eval α)\n\n/-- The conclusion that the degree of a real-coefficient polynomial is at most\none. Mathlib's `Polynomial.degree` takes values in `WithBot ℕ`, with the zero\npolynomial having degree `⊥`. -/\ndef DegreeAtMostOne (P : Polynomial ℝ) : Prop :=\n P.degree ≤ (1 : WithBot ℕ)\n\n/-- The complete target: for every real-coefficient polynomial `P`, if `P(α)` is\nirrational for every irrational real `α`, then `deg P ≤ 1`. -/\ndef Target : Prop :=\n ∀ P : Polynomial ℝ, IrrationalValueHypothesis P → DegreeAtMostOne P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3905499c-4355-58a6-94f5-4ec033a6af73", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fb6347767d6d33caa85e432a0682c188eaa1bd0800cdd955f552b5842de94bed", "task_path": "tasks/nmp3_3905499c-4355-58a6-94f5-4ec033a6af73", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3905499c-4355-58a6-94f5-4ec033a6af73", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3914eb10-adc5-5af6-b3fd-a13179e531b0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for every positive integer $n$, the set $\\{1,2,\\dots,2n\\}$ can be partitioned into $n$ unordered pairs $\\{a_i,b_i\\}$ such that $a_i+b_i$ is a prime number for each $i$.\nimport Mathlib\n\n/-!\n# Prime-sum pairings of an initial interval\n\nThis file states the problem without proving it. The proposition is that,\nfor every positive integer `n`, the numbers `1, 2, ..., 2 * n` admit a\npartition into `n` unordered two-element pairs, each of whose sums is prime.\n-/\n\nnamespace Problem\n\n/-- `PrimePairPartition n` asserts that the set `{1, 2, ..., 2 * n}` can be\npartitioned into `n` unordered pairs, each with prime sum.\n\nThe two maps `a` and `b` list the two endpoints of the `i`-th unordered\npair as `{a i, b i}`. The absence of any condition comparing `a i` and\n`b i` reflects that the pairs are unordered. The last condition says that\nevery element of `{1, ..., 2 * n}` occurs in exactly one of these unordered\npairs, which is precisely the assertion that the pairs form a partition. -/\ndef PrimePairPartition (n : ℕ) : Prop :=\n ∃ a b : Fin n → ℕ,\n (∀ i : Fin n, a i ∈ Finset.Icc 1 (2 * n) ∧\n b i ∈ Finset.Icc 1 (2 * n)) ∧\n (∀ i : Fin n, a i ≠ b i) ∧\n (∀ i : Fin n, Nat.Prime (a i + b i)) ∧\n (∀ x : ℕ, x ∈ Finset.Icc 1 (2 * n) ↔\n ∃! i : Fin n, a i = x ∨ b i = x)\n\n/-- For every positive integer `n`, the set `{1, 2, ..., 2 * n}` can be\npartitioned into `n` unordered pairs such that the two entries of every pair\nhave prime sum. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → PrimePairPartition n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3914eb10-adc5-5af6-b3fd-a13179e531b0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4915fb1b04532dc5f05f36aabb0079a98d916890c1ec19bf654fc9d9db0f56d6", "task_path": "tasks/nmp3_3914eb10-adc5-5af6-b3fd-a13179e531b0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3914eb10-adc5-5af6-b3fd-a13179e531b0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_392a8cf8-a434-5950-b1c7-9da23a2b8fc2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c,x,y,z\\) be non‑negative real numbers satisfying \\(a+b+c = x+y+z\\). Prove that \n-- \\[\n-- ax(a+x)+by(b+y)+cz(c+z)\\;\\ge\\;3\\bigl(abc+xyz\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove the following assertion for six non-negative real\nnumbers whose two three-term sums agree.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem. The six variables are universally quantified\nreal numbers, required to be non-negative and to satisfy\n`a + b + c = x + y + z`. The conclusion is the stated inequality. -/\ndef Target : Prop :=\n ∀ a b c x y z : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n 0 ≤ x →\n 0 ≤ y →\n 0 ≤ z →\n a + b + c = x + y + z →\n a * x * (a + x) + b * y * (b + y) + c * z * (c + z) ≥ 3 * (a * b * c + x * y * z)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "392a8cf8-a434-5950-b1c7-9da23a2b8fc2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "450c76cfea58bb9f9493e80260f67118daa6271e69cf5b9b17ecd3e4f9e563d3", "task_path": "tasks/nmp3_392a8cf8-a434-5950-b1c7-9da23a2b8fc2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "392a8cf8-a434-5950-b1c7-9da23a2b8fc2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_392ddfa1-55ac-56f1-9960-768f9683c971", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A set S of n ≥ 2 distinct points is given in the plane. Prove that there exist two points A, B ∈ S such that the closed disk having segment AB as its diameter contains at least ⌈n/3⌉ (i.e. at least n⁄3) of the points of S.\nimport Mathlib\n\n/-!\n# A diameter disk containing a third of a finite planar point set\n\nThe problem states: given a set `S` of `n ≥ 2` distinct points in the plane,\nthere are two points `A, B ∈ S` such that the closed disk having segment `AB`\nas diameter contains at least `⌈n/3⌉` points of `S`.\n\nThis file formalizes the statement only; no proof of `Problem.Target` is\nprovided. Points of the plane are represented by `EuclideanSpace ℝ (Fin 2)`,\nand the closed disk with diameter `AB` is `Metric.closedBall (midpoint ℝ A B)\n(dist A B / 2)`.\n-/\n\nnamespace Problem\n\n/-- The ambient Euclidean plane. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The closed disk having the segment with endpoints `A` and `B` as a diameter.\n\nIt is the closed ball centered at the midpoint of `A` and `B` with radius half\nthe distance between `A` and `B`. The use of `Metric.closedBall` includes the\nboundary circle, as required by \"closed disk\". -/\ndef diameterDisk (A B : Point) : Set Point :=\n Metric.closedBall (midpoint ℝ A B) (dist A B / 2)\n\n/-- `P` belongs to the closed disk whose diameter is the segment `AB`. -/\ndef LiesInDiameterDisk (A B P : Point) : Prop :=\n P ∈ diameterDisk A B\n\n/-- The number of points of the finite point set `S` that lie in the closed\ndisk having segment `AB` as diameter. This is a classical (noncomputable)\ncardinality, since membership in a closed disk is a proposition over the reals. -/\nnoncomputable\ndef countInDiameterDisk (S : Finset Point) (A B : Point) : ℕ := by\n classical\n exact (S.filter fun P => LiesInDiameterDisk A B P).card\n\n/-- The formal statement of the problem.\n\nFor every natural number `n ≥ 2` and every finite set `S` of exactly `n`\ndistinct points in the Euclidean plane, there exist two distinct points\n`A, B ∈ S` such that the closed disk whose diameter is the segment `AB`\ncontains at least `⌈n/3⌉` points of `S` (counting `A` and `B` themselves,\nsince both lie on the boundary of that disk). -/\ndef Target : Prop :=\n ∀ (n : ℕ), 2 ≤ n → ∀ (S : Finset Point), S.card = n →\n ∃ A ∈ S, ∃ B ∈ S, A ≠ B ∧\n Nat.ceil ((n : ℝ) / 3) ≤ countInDiameterDisk S A B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "392ddfa1-55ac-56f1-9960-768f9683c971", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "eebcc25ff3f57eb403934c8d00d73ca2389a0a027c8634dbcec22159449edbbe", "task_path": "tasks/nmp3_392ddfa1-55ac-56f1-9960-768f9683c971", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "392ddfa1-55ac-56f1-9960-768f9683c971", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_394e37a6-b3d6-5813-a42c-fb35240d2486", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb{R}\\to\\mathbb{R}$ be a function such that for any four distinct real numbers $a,b,c,d$ with $b\\neq c$ and $d\\neq c$ satisfying \n-- \\[\n-- \\frac{a-b}{\\,b-c\\,}+\\frac{a-d}{\\,d-c\\,}=0,\n-- \\]\n-- the numbers $f(a),f(b),f(c),f(d)$ are also distinct and satisfy \n-- \\[\n-- \\frac{f(a)-f(b)}{\\,f(b)-f(c)\\,}+\\frac{f(a)-f(d)}{\\,f(d)-f(c)\\,}=0.\n-- \\]\n-- Prove that $f$ is linear; i.e., there exist constants $m\\neq0$ and $b\\in\\mathbb{R}$ such that $f(x)=mx+b$ for all $x\\in\\mathbb{R}$.\nimport Mathlib\n\n/-!\n# Formal statement for the four-point cross-ratio functional condition\n\nThe source problem asks to prove that every real-valued function satisfying a\nfour-point cross-ratio preservation property is a nonconstant affine function.\nThe declarations below formalize the hypotheses, the admissibility condition on\nthe four input points, and the final implication. They are statement\ndefinitions only; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The four real numbers `a`, `b`, `c`, and `d` are pairwise distinct. -/\ndef PairwiseDistinct4 (a b c d : ℝ) : Prop :=\n a ≠ b ∧ a ≠ c ∧ a ≠ d ∧\n b ≠ c ∧ b ≠ d ∧ c ≠ d\n\n/-- The cross-ratio-type equation appearing in the source problem:\n`(a - b) / (b - c) + (a - d) / (d - c) = 0`. -/\ndef CrossRatioEquation (a b c d : ℝ) : Prop :=\n (a - b) / (b - c) + (a - d) / (d - c) = 0\n\n/--\nThe hypotheses imposed on a quadruple `(a, b, c, d)` before the function\ncondition is applied. Pairwise distinctness already entails `b ≠ c` and\n`d ≠ c`; the latter two inequalities are retained explicitly because the source\nproblem lists them explicitly.\n-/\ndef QuadrupleAdmissible (a b c d : ℝ) : Prop :=\n PairwiseDistinct4 a b c d ∧\n b ≠ c ∧\n d ≠ c ∧\n CrossRatioEquation a b c d\n\n/--\nA function satisfies the source problem's four-point hypothesis when, for every\nadmissible quadruple `(a, b, c, d)`, its four images are pairwise distinct and\nsatisfy the same cross-ratio-type equation.\n-/\ndef FourPointCrossRatioProperty (f : ℝ → ℝ) : Prop :=\n ∀ a b c d : ℝ,\n PairwiseDistinct4 a b c d →\n b ≠ c →\n d ≠ c →\n CrossRatioEquation a b c d →\n PairwiseDistinct4 (f a) (f b) (f c) (f d) ∧\n CrossRatioEquation (f a) (f b) (f c) (f d)\n\n/-- The conclusion requested in the source problem: `f` is affine with nonzero\nslope, namely `f x = m * x + b` for all real `x`, for some `m ≠ 0`. -/\ndef IsNonconstantAffine (f : ℝ → ℝ) : Prop :=\n ∃ m : ℝ, m ≠ 0 ∧ ∃ b : ℝ, ∀ x : ℝ, f x = m * x + b\n\n/--\nThe complete assertion of the source problem: every function satisfying the\nfour-point cross-ratio property is a nonconstant affine function.\n-/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, FourPointCrossRatioProperty f → IsNonconstantAffine f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "394e37a6-b3d6-5813-a42c-fb35240d2486", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "157cbc8a8e97a8619cb4fc86f1919166d8b4891d0a702f64f6bc34cb651ce66f", "task_path": "tasks/nmp3_394e37a6-b3d6-5813-a42c-fb35240d2486", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "394e37a6-b3d6-5813-a42c-fb35240d2486", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_39640829-d113-5c4d-ae84-b9a9ed483f3b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be the side lengths of a triangle and $m_a,m_b,m_c$ the lengths of its medians (the median $m_a$ is opposite side $a$, etc.). Prove that \n-- \\[\n-- m_a^{3}+m_b^{3}+m_c^{3}\\ge \\frac{3}{8}\\,(a+b+c)\\,\\sqrt{a^{4}+b^{4}+c^{4}}\\,,\n-- \\] \n-- with equality if and only if $a=b=c$ (the equilateral triangle).\nimport Mathlib\n\n/-!\n# Formal statement: a median inequality for triangle side lengths\n\nThe problem concerns a nondegenerate Euclidean triangle with side lengths\n`a`, `b`, `c` and medians `m_a`, `m_b`, `m_c`. By Apollonius's theorem,\n\n`m_a = (1 / 2) * sqrt (2 * b ^ 2 + 2 * c ^ 2 - a ^ 2)`,\n\nand similarly for the other medians. We take these standard median-length\nformulas as the meaning of `m_a`, `m_b`, and `m_c` in terms of the side lengths.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- A triple `(a, b, c)` consists of the side lengths of a nondegenerate\ntriangle exactly when all three are positive and satisfy the three strict\ntriangle inequalities. -/\ndef IsTriangleSides (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a < b + c ∧ b < a + c ∧ c < a + b\n\n/-- The length of the median opposite side `a`, expressed in terms of the\nthree side lengths by Apollonius's theorem. -/\ndef MedianA (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * (b ^ 2) + 2 * (c ^ 2) - a ^ 2)\n\n/-- The length of the median opposite side `b`. -/\ndef MedianB (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * (a ^ 2) + 2 * (c ^ 2) - b ^ 2)\n\n/-- The length of the median opposite side `c`. -/\ndef MedianC (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * (a ^ 2) + 2 * (b ^ 2) - c ^ 2)\n\n/-- The left-hand side of the claimed inequality. -/\ndef MedianCubeSum (a b c : ℝ) : ℝ :=\n (MedianA a b c) ^ 3 + (MedianB a b c) ^ 3 + (MedianC a b c) ^ 3\n\n/-- The right-hand side of the claimed inequality. -/\ndef SideFourthPowerRoot (a b c : ℝ) : ℝ :=\n Real.sqrt (a ^ 4 + b ^ 4 + c ^ 4)\n\n/-- The right-hand side of the claimed inequality, including its coefficient. -/\ndef InequalityRightHandSide (a b c : ℝ) : ℝ :=\n (3 / 8 : ℝ) * (a + b + c) * SideFourthPowerRoot a b c\n\n/-- The non-strict inequality asserted by the problem. -/\ndef MedianInequality (a b c : ℝ) : Prop :=\n MedianCubeSum a b c ≥ InequalityRightHandSide a b c\n\n/-- The equality case appearing in the problem. -/\ndef MedianEquality (a b c : ℝ) : Prop :=\n MedianCubeSum a b c = InequalityRightHandSide a b c\n\n/-- The three side lengths are all equal (`a = b = c`, i.e. the triangle is\nequilateral). -/\ndef EquilateralSides (a b c : ℝ) : Prop :=\n a = b ∧ b = c\n\n/-- The complete assertion of the problem: for every positive triple of side\nlengths satisfying the strict triangle inequalities, the median cube sum is at\nleast the stated right-hand side, and equality holds exactly in the equilateral\ncase. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n IsTriangleSides a b c →\n MedianInequality a b c ∧\n (MedianEquality a b c ↔ EquilateralSides a b c)\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "39640829-d113-5c4d-ae84-b9a9ed483f3b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "618b3547be8813c0946f98618107d3b220bced6ef41ba1d767da68c9915912ef", "task_path": "tasks/nmp3_39640829-d113-5c4d-ae84-b9a9ed483f3b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "39640829-d113-5c4d-ae84-b9a9ed483f3b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_396cae44-b7a4-53bb-b632-0d89f6c1f632", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute triangle and let $D$ be the point on its circumcircle such that $AD$ is a diameter. Points $K$ and $L$ lie on the sides $AB$ and $AC$, respectively, and the segments $DK$ and $DL$ are tangent to the circumcircle of $\\triangle AKL$. Prove that the line $KL$ passes through the orthocenter of $\\triangle ABC$.\nimport Mathlib\n\n/-!\n# Formal statement of the triangle tangency problem\n\nThe plane is the real Euclidean plane `EuclideanSpace ℝ (Fin 2)`. The\ndefinitions below spell out the elementary incidence, perpendicularity,\ncircle, segment, and tangency conditions used in the problem. The final\ndeclaration `Problem.Target` is the proposition to be proved; it is a\ndefinition of type `Prop`, not a proof.\n-/\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- Points of the real Euclidean plane. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The determinant of two plane vectors, with coordinates indexed by `Fin 2`. -/\ndef det2 (u v : Point) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- Three plane points are collinear exactly when two side vectors are parallel. -/\ndef Collinear3 (A B C : Point) : Prop := det2 (B - A) (C - A) = 0\n\n/-- `ABC` is a nondegenerate triangle all three of whose angles are acute. -/\ndef AcuteTriangle (A B C : Point) : Prop :=\n ¬ Collinear3 A B C ∧\n 0 < ⟪B - A, C - A⟫ ∧\n 0 < ⟪A - B, C - B⟫ ∧\n 0 < ⟪A - C, B - C⟫\n\n/-- `P` lies on the closed side segment from `A` to `B`. -/\ndef OnClosedSegment (A B P : Point) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ P = A + t • (B - A)\n\n/-- `P` lies on the circle with center `O` and radius `r`. -/\ndef OnCircle (P O : Point) (r : ℝ) : Prop := dist O P = r\n\n/-- `O` and `r` are a circumcircle of the nondegenerate triangle `ABC`. -/\ndef IsCircumcircle (A B C O : Point) (r : ℝ) : Prop :=\n ¬ Collinear3 A B C ∧\n 0 < r ∧\n OnCircle A O r ∧ OnCircle B O r ∧ OnCircle C O r\n\n/-- `D` is on the circumcircle of `ABC`, and `AD` is a diameter of that circle. -/\ndef ADIsDiameterOfCircumcircle (A B C D : Point) : Prop :=\n ∃ O : Point, ∃ r : ℝ,\n IsCircumcircle A B C O r ∧\n OnCircle D O r ∧\n O = midpoint ℝ A D\n\n/-- The line through `D` and `K` is tangent to the circle centered at `O`\nwith radius `r` at the point `K`. The nonzero segment condition `D ≠ K`\nis included because a tangent segment must have two distinct endpoints. -/\ndef IsTangentAt (D K O : Point) (r : ℝ) : Prop :=\n D ≠ K ∧\n OnCircle K O r ∧\n ⟪D - K, K - O⟫ = 0\n\n/-- The segments `DK` and `DL` are both tangent to the circumcircle of\ntriangle `AKL`, at `K` and at `L`, respectively. -/\ndef SegmentsDKAndDLTangentToCircumcircleAKL (A K L D : Point) : Prop :=\n ∃ O : Point, ∃ r : ℝ,\n IsCircumcircle A K L O r ∧\n IsTangentAt D K O r ∧\n IsTangentAt D L O r\n\n/-- `H` lies on all three altitude lines of the nondegenerate triangle `ABC`. -/\ndef IsAltitudePoint (A B C H : Point) : Prop :=\n ⟪H - A, B - C⟫ = 0 ∧\n ⟪H - B, A - C⟫ = 0 ∧\n ⟪H - C, A - B⟫ = 0\n\n/-- `H` is the orthocenter of `ABC`: the unique common point of the three\naltitude lines. -/\ndef IsOrthocenter (A B C H : Point) : Prop :=\n ¬ Collinear3 A B C ∧\n IsAltitudePoint A B C H ∧\n ∀ H' : Point, IsAltitudePoint A B C H' → H' = H\n\n/-- The line through `K` and `L` passes through the orthocenter of `ABC`. -/\ndef LineKLPassesThroughOrthocenter (A B C K L : Point) : Prop :=\n ∃ H : Point,\n IsOrthocenter A B C H ∧\n Collinear3 K L H\n\n/-- The complete statement: for every acute triangle `ABC`, every antipode\n`D` of `A` on its circumcircle, and every points `K` and `L` on the closed\nsides `AB` and `AC` for which `DK` and `DL` are tangent to the circumcircle\nof `AKL`, the line `KL` contains the orthocenter of `ABC`. -/\ndef Target : Prop :=\n ∀ A B C D K L : Point,\n AcuteTriangle A B C →\n ADIsDiameterOfCircumcircle A B C D →\n OnClosedSegment A B K →\n OnClosedSegment A C L →\n SegmentsDKAndDLTangentToCircumcircleAKL A K L D →\n LineKLPassesThroughOrthocenter A B C K L\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "396cae44-b7a4-53bb-b632-0d89f6c1f632", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a6755c0dc99e22c081e47024f75fa690e041d84274af52caed53c31a1c8fbccf", "task_path": "tasks/nmp3_396cae44-b7a4-53bb-b632-0d89f6c1f632", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "396cae44-b7a4-53bb-b632-0d89f6c1f632", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_39a5195c-ca92-5c07-aaff-e4549c054358", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Each lattice (grid) point of the Cartesian plane is colored with one of three colors, and all three colors are used somewhere. Prove that there always exist three lattice points forming a right‑angled triangle whose three vertices have pairwise different colors.\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The lattice points of the Cartesian plane, represented by integer coordinate pairs. -/\nabbrev LatticePoint : Type := ℤ × ℤ\n\n/-- The three available colors. -/\nabbrev Color : Type := Fin 3\n\n/-- A point of the Cartesian plane with real coordinates. -/\nabbrev PlanePoint : Type := ℝ × ℝ\n\n/-- Embed a lattice point into the Cartesian plane with real coordinates. -/\ndef toPlane (p : LatticePoint) : PlanePoint :=\n ((p.1 : ℝ), (p.2 : ℝ))\n\n/-- The displacement vector from one plane point to another. -/\ndef displacement (a b : PlanePoint) : PlanePoint :=\n (b.1 - a.1, b.2 - a.2)\n\n/-- The Euclidean dot product of two plane vectors. -/\ndef planeDot (u v : PlanePoint) : ℝ :=\n u.1 * v.1 + u.2 * v.2\n\n/-- The side vector from lattice point `a` to lattice point `b`. -/\ndef sideVector (a b : LatticePoint) : PlanePoint :=\n displacement (toPlane a) (toPlane b)\n\n/-- The angle at `a` in the ordered triple `(a,b,c)` is a right angle. -/\ndef RightAngleAt (a b c : LatticePoint) : Prop :=\n sideVector a b ≠ ((0 : ℝ), (0 : ℝ)) ∧\n sideVector a c ≠ ((0 : ℝ), (0 : ℝ)) ∧\n planeDot (sideVector a b) (sideVector a c) = 0\n\n/-- The three lattice points are pairwise distinct. -/\ndef PairwiseDistinct (a b c : LatticePoint) : Prop :=\n a ≠ b ∧ a ≠ c ∧ b ≠ c\n\n/-- The three lattice points form a (nondegenerate) right-angled triangle. -/\ndef IsRightAngledTriangle (a b c : LatticePoint) : Prop :=\n PairwiseDistinct a b c ∧\n (RightAngleAt a b c ∨ RightAngleAt b a c ∨ RightAngleAt c a b)\n\n/-- The colors of `a`, `b`, and `c` are pairwise different. -/\ndef PairwiseDifferentColors\n (coloring : LatticePoint → Color) (a b c : LatticePoint) : Prop :=\n coloring a ≠ coloring b ∧\n coloring a ≠ coloring c ∧\n coloring b ≠ coloring c\n\n/-- Every one of the three colors occurs at some lattice point. -/\ndef UsesAllThreeColors (coloring : LatticePoint → Color) : Prop :=\n ∀ color : Color, ∃ point : LatticePoint, coloring point = color\n\n/-- There is a right-angled lattice triangle whose vertices have three distinct colors. -/\ndef HasRainbowRightTriangle (coloring : LatticePoint → Color) : Prop :=\n ∃ a b c : LatticePoint,\n PairwiseDifferentColors coloring a b c ∧ IsRightAngledTriangle a b c\n\n/-- The assertion of the problem: every surjective three-coloring of the lattice\npoints contains a right-angled lattice triangle with pairwise different vertex colors. -/\ndef Target : Prop :=\n ∀ coloring : LatticePoint → Color,\n UsesAllThreeColors coloring → HasRainbowRightTriangle coloring\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "39a5195c-ca92-5c07-aaff-e4549c054358", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4dff726deb4e7fe13579af90b50aa2a2cfec8e279b936981eb34a6e9606d5569", "task_path": "tasks/nmp3_39a5195c-ca92-5c07-aaff-e4549c054358", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "39a5195c-ca92-5c07-aaff-e4549c054358", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_39a95964-7bb0-5491-bfef-c2c9d49151bd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ satisfy $ab+bc+ca=1$. Prove that \n-- \\[\n-- \\frac{(1+a^2)^2}{b^2+c^2}+\\frac{(1+b^2)^2}{c^2+a^2}+\\frac{(1+c^2)^2}{a^2+b^2}\\ge 8.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe original problem asks one to prove, for nonnegative real numbers `a`, `b`,\nand `c` satisfying `a*b + b*c + c*a = 1`, that a certain sum of three\nfractions is at least `8`.\n\nAs requested for statement formalization, `Problem.Target` is a proposition\nwhose body is the asserted inequality implication; no proof of it is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on `a`, `b`, and `c`: all three are\nnonnegative and satisfy `a*b + b*c + c*a = 1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + b * c + c * a = 1\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (1 + a ^ 2) ^ 2 / (b ^ 2 + c ^ 2) +\n (1 + b ^ 2) ^ 2 / (c ^ 2 + a ^ 2) +\n (1 + c ^ 2) ^ 2 / (a ^ 2 + b ^ 2)\n\n/-- The complete universal statement of the problem: for every real triple\nsatisfying the admissibility conditions, the left-hand side is at least `8`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → LHS a b c ≥ 8\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "39a95964-7bb0-5491-bfef-c2c9d49151bd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bcfd677666e68c9e4639b2b80623b5e36d47e077fa2d9d7c141d0fddd258a7be", "task_path": "tasks/nmp3_39a95964-7bb0-5491-bfef-c2c9d49151bd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "39a95964-7bb0-5491-bfef-c2c9d49151bd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_39d172b5-36cc-52ec-bab3-2f481f272467", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any positive real numbers $a$, $b$ and $c$, prove that \n-- \\[\n-- \\frac{a\\bigl(b^{3}+c^{3}\\bigr)}{a^{2}+bc}+\n-- \\frac{b\\bigl(c^{3}+a^{3}\\bigr)}{b^{2}+ca}+\n-- \\frac{c\\bigl(a^{3}+b^{3}\\bigr)}{c^{2}+ab}\n-- \\ge a^{2}+b^{2}+c^{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of a cyclic rational inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe inequality\n\n`a (b^3 + c^3) / (a^2 + b c) +\n b (c^3 + a^3) / (b^2 + c a) +\n c (a^3 + b^3) / (c^2 + a b)\n ≥ a^2 + b^2 + c^2`.\n\nThis file records the proposition only; it contains no proof of it.\n-/\n\nnamespace Problem\n\n/-- The first summand on the left-hand side of the target inequality. -/\nnoncomputable def termA (a b c : ℝ) : ℝ :=\n a * (b ^ 3 + c ^ 3) / (a ^ 2 + b * c)\n\n/-- The second summand on the left-hand side of the target inequality. -/\nnoncomputable def termB (a b c : ℝ) : ℝ :=\n b * (c ^ 3 + a ^ 3) / (b ^ 2 + c * a)\n\n/-- The third summand on the left-hand side of the target inequality. -/\nnoncomputable def termC (a b c : ℝ) : ℝ :=\n c * (a ^ 3 + b ^ 3) / (c ^ 2 + a * b)\n\n/-- The complete left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n termA a b c + termB a b c + termC a b c\n\n/-- The complete right-hand side of the target inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n a ^ 2 + b ^ 2 + c ^ 2\n\n/--\nThe assertion to be proved: for every triple of positive real numbers `a`, `b`, `c`,\nthe cyclic sum on the left is at least `a^2 + b^2 + c^2`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "39d172b5-36cc-52ec-bab3-2f481f272467", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "08ff72e8a8457fcdbff66893495609cb185b9cf6e92ee076aa792efece634d29", "task_path": "tasks/nmp3_39d172b5-36cc-52ec-bab3-2f481f272467", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "39d172b5-36cc-52ec-bab3-2f481f272467", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_39f0b63d-0955-5b7a-bf0d-b9d99914b96e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $ab+bc+ca+abc=4$. Prove that \n-- \\[\n-- \\sqrt{24ab+25}+\\sqrt{24bc+25}+\\sqrt{24ca+25}\\ge21\\,.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\n/-!\n# Formal statement of the target inequality\n\nProblem source: let `a b c ≥ 0` be real numbers satisfying\n`a * b + b * c + c * a + a * b * c = 4`. Prove that\n`√(24 * a * b + 25) + √(24 * b * c + 25) + √(24 * c * a + 25) ≥ 21`.\n\nThe declarations below only state the problem. In particular `Problem.Target`\nis a proposition-valued definition, not a theorem and not a proof.\n-/\n\nnamespace Problem\n\n/-- The sum appearing on the left-hand side of the target inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n Real.sqrt (24 * a * b + 25) + Real.sqrt (24 * b * c + 25) +\n Real.sqrt (24 * c * a + 25)\n\n/-- Admissibility of a triple `(a, b, c)` for the problem: all three numbers are\nnonnegative and satisfy the constraint `ab + bc + ca + abc = 4`. -/\ndef admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + b * c + c * a + a * b * c = 4\n\n/-- The conclusion of the problem for a fixed triple `(a, b, c)`: the sum of the\nthree square roots is at least `21`. -/\nnoncomputable def inequality (a b c : ℝ) : Prop :=\n 21 ≤ leftHandSide a b c\n\n/-- The full statement to be proved: for every real triple `(a, b, c)` satisfying\nthe nonnegativity and constraint assumptions, the square-root inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, admissible a b c → inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "39f0b63d-0955-5b7a-bf0d-b9d99914b96e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e059ea3e09bc60f11af1e65375377f2876d323c3f65babd85e4c0b35a625f6e6", "task_path": "tasks/nmp3_39f0b63d-0955-5b7a-bf0d-b9d99914b96e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "39f0b63d-0955-5b7a-bf0d-b9d99914b96e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_39f9a4f7-e5d0-54f9-9fb8-0fafd7faa498", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, $c$ be positive real numbers such that $ab+bc+ca\\le 3abc$. Prove that\n-- \\[\n-- \\sqrt{\\frac{a^{2}+b^{2}}{a+b}}+\\sqrt{\\frac{b^{2}+c^{2}}{b+c}}+\\sqrt{\\frac{c^{2}+a^{2}}{c+a}}+3\\le \\sqrt{2}\\bigl(\\sqrt{a+b}+\\sqrt{b+c}+\\sqrt{c+a}\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable inequality problem\n\nThe source problem asks to prove an inequality for positive real numbers\n`a`, `b`, and `c` satisfying `ab + bc + ca ≤ 3abc`.\nThis file formalizes the admissibility predicate, the two sides of the\ninequality, and the universally quantified target proposition. No proof of\nthe target is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypothesis from the problem: `a`, `b`, and `c` are\npositive real numbers and satisfy `ab + bc + ca ≤ 3abc`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a ≤ 3 * a * b * c\n\n/-- The left-hand side of the desired inequality, including the additive\nconstant `3`. -/\nnoncomputable def leftSide (a b c : ℝ) : ℝ :=\n Real.sqrt ((a ^ 2 + b ^ 2) / (a + b)) +\n Real.sqrt ((b ^ 2 + c ^ 2) / (b + c)) +\n Real.sqrt ((c ^ 2 + a ^ 2) / (c + a)) + 3\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def rightSide (a b c : ℝ) : ℝ :=\n Real.sqrt 2 *\n (Real.sqrt (a + b) + Real.sqrt (b + c) + Real.sqrt (c + a))\n\n/-- The inequality asserted in the source problem, without its hypotheses. -/\ndef Inequality (a b c : ℝ) : Prop :=\n leftSide a b c ≤ rightSide a b c\n\n/-- The complete statement to be proved: for every triple of positive real\nnumbers satisfying `ab + bc + ca ≤ 3abc`, the asserted inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "39f9a4f7-e5d0-54f9-9fb8-0fafd7faa498", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6c14bba014df639b5ab4e93bcca0a67a24e2b05ab05867712157171c531c0d93", "task_path": "tasks/nmp3_39f9a4f7-e5d0-54f9-9fb8-0fafd7faa498", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "39f9a4f7-e5d0-54f9-9fb8-0fafd7faa498", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3a026830-47d3-5ae5-b457-a3bb6bb65547", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ with $ab+bc+ca\\neq0$. Prove that \n-- \\[\n-- \\frac{a^2\\bigl(a^2+2bc\\bigr)}{a^3+(b+c)^3}+\\frac{b^2\\bigl(b^2+2ca\\bigr)}{b^3+(c+a)^3}+\\frac{c^2\\bigl(c^2+2ab\\bigr)}{c^3+(a+b)^3}\\ge\\frac{a^4+b^4+c^4}{a^3+b^3+c^3}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable nonnegative real inequality\n\nThe source problem asks to prove an inequality for nonnegative real numbers\n`a`, `b`, and `c` satisfying `a*b + b*c + c*a ≠ 0`.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissibility assumptions from the problem, bundled together. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + b * c + c * a ≠ 0\n\n/-- The left-hand side of the asserted inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 * (a ^ 2 + 2 * b * c)) / (a ^ 3 + (b + c) ^ 3) +\n (b ^ 2 * (b ^ 2 + 2 * c * a)) / (b ^ 3 + (c + a) ^ 3) +\n (c ^ 2 * (c ^ 2 + 2 * a * b)) / (c ^ 3 + (a + b) ^ 3)\n\n/-- The right-hand side of the asserted inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (a ^ 4 + b ^ 4 + c ^ 4) / (a ^ 3 + b ^ 3 + c ^ 3)\n\n/-- The asserted pointwise inequality, on the problem's domain. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full assertion: for every triple of nonnegative real numbers whose\npairwise-product sum is nonzero, the required inequality holds. -/\ndef Target : Prop :=\n ∀ a b c\n (_ha : 0 ≤ a)\n (_hb : 0 ≤ b)\n (_hc : 0 ≤ c)\n (_hpair : a * b + b * c + c * a ≠ 0),\n Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a026830-47d3-5ae5-b457-a3bb6bb65547", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fa98b3f8434eb8f81223e7d346220288c1038b63c106bbf6d339f7e40b4417bd", "task_path": "tasks/nmp3_3a026830-47d3-5ae5-b457-a3bb6bb65547", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a026830-47d3-5ae5-b457-a3bb6bb65547", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3a1da863-dc6f-5324-9f0e-f5f52a6489f7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all real numbers $x,y>0$,\n-- \\[\n-- (1+x^2)\\log\\!\\bigl(1+y^2\\bigr)+(1+y^2)\\log\\!\\bigl(1+x^2\\bigr)\\ge2\\bigl(1+xy\\bigr)\\log\\!\\bigl(1+xy\\bigr).\n-- \\]\n-- (The logarithm is the natural logarithm.)\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe problem asks to prove a real-variable logarithmic inequality for all\npositive real numbers `x` and `y`. The logarithm of a real number in Mathlib\nis `Real.log`, the natural logarithm. The assertion is represented as a\nproposition-valued definition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The asserted inequality for all strictly positive real numbers `x` and `y`. -/\ndef Target : Prop :=\n ∀ x y : ℝ, (0 : ℝ) < x → (0 : ℝ) < y →\n (1 + x ^ 2) * Real.log (1 + y ^ 2) +\n (1 + y ^ 2) * Real.log (1 + x ^ 2) ≥\n 2 * (1 + x * y) * Real.log (1 + x * y)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a1da863-dc6f-5324-9f0e-f5f52a6489f7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7f7425c935d51d4d088f08035adaf61890f7eac466acc44e5fd5e15dd94d87df", "task_path": "tasks/nmp3_3a1da863-dc6f-5324-9f0e-f5f52a6489f7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a1da863-dc6f-5324-9f0e-f5f52a6489f7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3a244ee9-dbc6-5fba-bce6-59d1f0ba2404", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f_X(k)$ denote the $k^{\\text{th}}$ smallest positive integer not belonging to a finite set $X\\subset\\mathbb Z^+$. Define \n-- $$X*Y:=X\\cup\\{\\,f_X(y):y\\in Y\\,\\}.$$\n-- If $A$ and $B$ are finite non‑empty sets of positive integers with $|A|=a$ and $|B|=b$, prove that \n-- $$A*B=B*A\\qquad\\Longrightarrow\\qquad \n-- \\underbrace{A*(A*\\cdots(A*(A*A))\\cdots)}_{\\text{$b$ copies of $A$}}\n-- =\n-- \\underbrace{B*(B*\\cdots(B*(B*B))\\cdots)}_{\\text{$a$ copies of $B$}}.$$\n-- (Repeated $*$ is denoted $A^{*b}$ and $B^{*a}$.)\nimport Mathlib\n\n/-!\n# Formalization of the problem on finite sets of positive integers and the star operation\n\nThe positive integers are represented by the subtype `ℕ+ = {n : ℕ // 0 < n}`.\nA finite set of positive integers is therefore a `Finset ℕ+`.\n-/\n\nnamespace Problem\n\n/-- A positive natural number is a candidate for the `k`-th smallest positive\ninteger outside a finite set `X` when it is positive and its natural-number\nvalue is not in the image of `X` in `ℕ`. -/\ndef MissingNatCandidate (X : Finset ℕ+) (n : ℕ) : Prop :=\n 0 < n ∧ n ∉ X.image (fun x : ℕ+ => (x : ℕ))\n\n/-- For a finite set `X` of positive integers, infinitely many positive naturals\nare outside `X`. -/\nlemma infinite_missingNatCandidate (X : Finset ℕ+) :\n {n : ℕ | MissingNatCandidate X n}.Infinite := by\n let S : Finset ℕ := X.image (fun x : ℕ+ => (x : ℕ))\n have hsubset : Set.Ioi (S.sup id) ⊆ {n : ℕ | MissingNatCandidate X n} := by\n intro n hn\n change 0 < n ∧ n ∉ S\n constructor\n · exact Nat.lt_of_le_of_lt (Nat.zero_le (S.sup id)) hn\n · intro hmem\n exact (not_lt_of_ge (Finset.le_sup (s := S) (f := id) hmem)) hn\n exact (Set.Ioi_infinite (S.sup id)).mono hsubset\n\n/-- The `k`-th smallest positive integer not belonging to the finite set `X`.\nThe index `k` belongs to `ℕ+`, so it is a positive integer; `k.natPred = k - 1`\nis the corresponding zero-based index for `Nat.nth`. -/\nnoncomputable def kthMissing (X : Finset ℕ+) (k : ℕ+) : ℕ+ :=\n ⟨Nat.nth (MissingNatCandidate X) k.natPred, by\n exact (Nat.nth_mem_of_infinite (infinite_missingNatCandidate X) k.natPred).1⟩\n\n/-- The underlying natural number of `kthMissing X k` is `Nat.nth` of the\nmissing-positive-integers predicate at the zero-based index `k - 1`. -/\n@[simp]\ntheorem kthMissing_val (X : Finset ℕ+) (k : ℕ+) :\n (kthMissing X k : ℕ) = Nat.nth (MissingNatCandidate X) k.natPred :=\n rfl\n\n/-- `kthMissing X k` is positive and is not in `X`. -/\ntheorem kthMissing_mem (X : Finset ℕ+) (k : ℕ+) :\n MissingNatCandidate X (kthMissing X k : ℕ) := by\n rw [kthMissing_val]\n exact Nat.nth_mem_of_infinite (infinite_missingNatCandidate X) k.natPred\n\n/-- The binary operation `X * Y = X ∪ {f_X(y) | y ∈ Y}` from the problem. -/\nnoncomputable def star (X Y : Finset ℕ+) : Finset ℕ+ :=\n X ∪ Y.image (kthMissing X)\n\n/-- `X * ∅ = X`. -/\n@[simp]\ntheorem star_empty (X : Finset ℕ+) : star X ∅ = X := by\n simp [star]\n\n/-- The right-nested repeated star `X * (X * (... * (X * X)))`.\nThe argument `n` is the number of copies of `X`; for every intended use `n ≥ 1`\n(in particular `repeatedStar X 1 = X` and `repeatedStar X 2 = star X X`).\nThe value at `n = 0` is the empty set and is not used by the problem. -/\nnoncomputable def repeatedStar (X : Finset ℕ+) (n : ℕ) : Finset ℕ+ :=\n Nat.rec ∅ (fun _ acc => star X acc) n\n\n/-- One copy of `X`. -/\n@[simp]\ntheorem repeatedStar_one (X : Finset ℕ+) : repeatedStar X 1 = X := by\n simp [repeatedStar, star]\n\n/-- Two copies of `X`, matching the displayed `X * X`. -/\ntheorem repeatedStar_two (X : Finset ℕ+) : repeatedStar X 2 = star X X := by\n change star X (repeatedStar X 1) = star X X\n rw [repeatedStar_one]\n\n/-- The assertion from the problem: if `A` and `B` are finite nonempty sets of\npositive integers, and if `|A| = a` and `|B| = b`, then\n`A * B = B * A` implies that the right-nested `b`-fold star of `A` equals the\nright-nested `a`-fold star of `B`. -/\ndef Target : Prop :=\n ∀ (A B : Finset ℕ+) (a b : ℕ),\n A.Nonempty →\n B.Nonempty →\n A.card = a →\n B.card = b →\n star A B = star B A →\n repeatedStar A b = repeatedStar B a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a244ee9-dbc6-5fba-bce6-59d1f0ba2404", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "07866e76d190d9f3b88734bfa98d6f9c307f57fe974b1a2adc5d9a1972f19497", "task_path": "tasks/nmp3_3a244ee9-dbc6-5fba-bce6-59d1f0ba2404", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a244ee9-dbc6-5fba-bce6-59d1f0ba2404", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3a304fb4-8188-5ea9-af46-6e4e1dc5e4a1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that\n-- \\[\n-- \\frac{a^{2}+b^{2}}{c^{2}+a+b}\\;+\\;\\frac{b^{2}+c^{2}}{a^{2}+b+c}\\;+\\;\\frac{c^{2}+a^{2}}{b^{2}+c+a}\\;\\ge\\;2.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the cyclic inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and\n`c` whose product is `1`, the cyclic inequality displayed in `problem.md`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2) / (c ^ 2 + a + b)\n + (b ^ 2 + c ^ 2) / (a ^ 2 + b + c)\n + (c ^ 2 + a ^ 2) / (b ^ 2 + c + a)\n\n/-- The asserted inequality, for fixed real numbers `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n 2 ≤ CyclicSum a b c\n\n/--\nFor all positive reals `a b c` with `a * b * c = 1`, the cyclic sum\n`(a^2 + b^2) / (c^2 + a + b) +\n (b^2 + c^2) / (a^2 + b + c) +\n (c^2 + a^2) / (b^2 + c + a)`\nis at least `2`.\n\nThis is a statement-only definition; it is not proved here.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a304fb4-8188-5ea9-af46-6e4e1dc5e4a1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "95096cb876830700b39bd6fb04943737ba9b0f820c70e3fccc32ff7f31ade960", "task_path": "tasks/nmp3_3a304fb4-8188-5ea9-af46-6e4e1dc5e4a1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a304fb4-8188-5ea9-af46-6e4e1dc5e4a1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3a7f353a-9d89-5135-b531-55d385916336", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $x$, $y$, $z$, prove that \n-- \n-- $$18\\Biggl(\\frac{x^2+2y^2}{(x+y+2z)^2}+\\frac{y^2+2z^2}{(y+z+2x)^2}+\\frac{z^2+2x^2}{(z+x+2y)^2}\\Biggr)+\\sqrt{3}\\,\\sqrt[3]{9x^3+9y^3+9z^3}>12\\sqrt[4]{\\frac16\\Bigl(\\sqrt{5x^2+y^2+5z^2}+\\sqrt{5y^2+z^2+5x^2}+\\sqrt{5z^2+x^2+5y^2}\\Bigr)}.$$\nimport Mathlib\n\n/-!\n# Formalization of the inequality from the problem statement\n\nThis file records the target assertion as a proposition-valued definition. It\ndoes not contain a proof of the assertion.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The real cube root, expressed using the real power with exponent `1 / 3`.\nFor the nonnegative radicands occurring in the target this is the usual\nprincipal cube root. -/\ndef cubeRoot (a : ℝ) : ℝ :=\n Real.rpow a (1 / 3 : ℝ)\n\n/-- The real fourth root, expressed as the iterated square root. For\nnonnegative `a` this is the usual principal fourth root. -/\ndef fourthRoot (a : ℝ) : ℝ :=\n Real.sqrt (Real.sqrt a)\n\n/-- The left-hand side of the target inequality. -/\ndef lhs (x y z : ℝ) : ℝ :=\n 18 * (\n (x ^ 2 + 2 * y ^ 2) / (x + y + 2 * z) ^ 2\n + (y ^ 2 + 2 * z ^ 2) / (y + z + 2 * x) ^ 2\n + (z ^ 2 + 2 * x ^ 2) / (z + x + 2 * y) ^ 2)\n + Real.sqrt 3 * cubeRoot (9 * x ^ 3 + 9 * y ^ 3 + 9 * z ^ 3)\n\n/-- The right-hand side of the target inequality. -/\ndef rhs (x y z : ℝ) : ℝ :=\n 12 * fourthRoot (\n (1 / 6 : ℝ) *\n (Real.sqrt (5 * x ^ 2 + y ^ 2 + 5 * z ^ 2)\n + Real.sqrt (5 * y ^ 2 + z ^ 2 + 5 * x ^ 2)\n + Real.sqrt (5 * z ^ 2 + x ^ 2 + 5 * y ^ 2)))\n\n/-- The assertion in the problem: for all positive real numbers `x`, `y`, and\n`z`, the stated left-hand side is strictly greater than the stated right-hand\nside. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → lhs x y z > rhs x y z\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a7f353a-9d89-5135-b531-55d385916336", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ae841848e7c600a901504e89b9d8b05fb5028ebf5965dcefa1c82dd69d011815", "task_path": "tasks/nmp3_3a7f353a-9d89-5135-b531-55d385916336", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a7f353a-9d89-5135-b531-55d385916336", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3a81a6f2-9927-586f-8583-474ef2b388bf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a}{\\sqrt[3]{a^{3}+26abc}}+\\frac{b}{\\sqrt[3]{b^{3}+26abc}}+\\frac{c}{\\sqrt[3]{c^{3}+26abc}}\\ge 1.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/--\nThe real cube-root factor used in the problem. On the nonnegative arguments used\nhere, `x ^ (1 / 3 : ℝ)` is the real cube root of `x`; every radicand in the target\nis positive under the stated positivity assumptions on `a`, `b`, and `c`.\n-/\ndef cubeRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 3 : ℝ)\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a / cubeRoot (a ^ 3 + 26 * a * b * c) +\n b / cubeRoot (b ^ 3 + 26 * a * b * c) +\n c / cubeRoot (c ^ 3 + 26 * a * b * c)\n\n/--\nThe assertion of the problem: for all positive real numbers `a`, `b`, and `c`,\nthe displayed sum of the three cube-root fractions is at least `1`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → 1 ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a81a6f2-9927-586f-8583-474ef2b388bf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cce7b0be6473d87a642c9de89113970b7531d4c5836489d89ac5f9c4917f2cb9", "task_path": "tasks/nmp3_3a81a6f2-9927-586f-8583-474ef2b388bf", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a81a6f2-9927-586f-8583-474ef2b388bf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3a8d28db-2b03-5d48-97b5-bcf580a0c51c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m,n\\ge 2$ be integers. Start with a tiling of an $m\\times n$ rectangle by $1\\times2$ dominoes. Write the number $0$ at each of the $(m-1)(n-1)$ interior grid points (the vertices that are not on the boundary). A move consists of one of the following:\n-- \n-- 1. Replace a $2\\times2$ block that is tiled by two horizontal dominoes with the $2\\times2$ block tiled by two vertical dominoes, and increase the number at the centre vertex of that block by $1$.\n-- \n-- 2. Replace a $2\\times2$ block that is tiled by two vertical dominoes with the $2\\times2$ block tiled by two horizontal dominoes, and decrease the number at the centre vertex of that block by $1$.\n-- \n-- After a finite sequence of moves the domino tiling is exactly the original tiling again. Prove that at that moment all $(m-1)(n-1)$ interior numbers are again $0$.\nimport Mathlib\n\n/-!\n# Domino tilings with signed counts at interior grid vertices\n\nThis file formalises the statement of the problem. A tiling is represented by\nthe involution pairing each unit cell with the cell covered by the other half of\nits domino. The two local moves are represented as relations on states. The\nfinal declaration `Problem.Target` is the proposition to be proved; it is a\n`def`, not a theorem with a proof.\n-/\n\nnamespace Problem\n\n/-- The unit cells of an `m × n` rectangle, indexed by their top-left grid point. -/\nabbrev Cell (m n : ℕ) : Type := Fin m × Fin n\n\n/-- The grid points (vertices) of an `m × n` rectangle. -/\nabbrev GridVertex (m n : ℕ) : Type := Fin (m + 1) × Fin (n + 1)\n\n/-- The possible top-left cells of a `2 × 2` block. -/\nabbrev Block (m n : ℕ) : Type := Fin (m - 1) × Fin (n - 1)\n\n/-- The interior grid points of an `m × n` rectangle, i.e. the grid points that\nare not on the boundary. For `m,n ≥ 2` there are `(m-1)*(n-1)` of them. -/\nabbrev InteriorVertex (m n : ℕ) : Type :=\n {v : GridVertex m n // 0 < v.1.val ∧ v.1.val < m ∧ 0 < v.2.val ∧ v.2.val < n}\n\nnamespace Block\n\n/-- Top-left cell of the `2 × 2` block. -/\ndef topLeft {m n : ℕ} (b : Block m n) : Cell m n :=\n (⟨b.1.val, by have h := b.1.isLt; omega⟩,\n ⟨b.2.val, by have h := b.2.isLt; omega⟩)\n\n/-- Top-right cell of the `2 × 2` block. -/\ndef topRight {m n : ℕ} (b : Block m n) : Cell m n :=\n (⟨b.1.val, by have h := b.1.isLt; omega⟩,\n ⟨b.2.val + 1, by have h := b.2.isLt; omega⟩)\n\n/-- Bottom-left cell of the `2 × 2` block. -/\ndef bottomLeft {m n : ℕ} (b : Block m n) : Cell m n :=\n (⟨b.1.val + 1, by have h := b.1.isLt; omega⟩,\n ⟨b.2.val, by have h := b.2.isLt; omega⟩)\n\n/-- Bottom-right cell of the `2 × 2` block. -/\ndef bottomRight {m n : ℕ} (b : Block m n) : Cell m n :=\n (⟨b.1.val + 1, by have h := b.1.isLt; omega⟩,\n ⟨b.2.val + 1, by have h := b.2.isLt; omega⟩)\n\n/-- The centre vertex of the `2 × 2` block, as an interior grid point. -/\ndef center {m n : ℕ} (b : Block m n) : InteriorVertex m n :=\n ⟨(⟨b.1.val + 1, by have h := b.1.isLt; omega⟩,\n ⟨b.2.val + 1, by have h := b.2.isLt; omega⟩), by\n have h1 := b.1.isLt\n have h2 := b.2.isLt\n dsimp\n omega⟩\n\nend Block\n\n/-- Two cells are horizontally adjacent. -/\ndef HorizAdjacent {m n : ℕ} (x y : Cell m n) : Prop :=\n x.1 = y.1 ∧ (x.2.val + 1 = y.2.val ∨ y.2.val + 1 = x.2.val)\n\n/-- Two cells are vertically adjacent. -/\ndef VertAdjacent {m n : ℕ} (x y : Cell m n) : Prop :=\n x.2 = y.2 ∧ (x.1.val + 1 = y.1.val ∨ y.1.val + 1 = x.1.val)\n\n/-- Two distinct cells share a side. -/\ndef Adjacent {m n : ℕ} (x y : Cell m n) : Prop :=\n HorizAdjacent x y ∨ VertAdjacent x y\n\n/-- A domino tiling, represented as a fixed-point-free involution pairing every\ncell with its adjacent partner. Such an involution is exactly a partition of\nthe cells into adjacent two-element dominoes. -/\nstructure Tiling (m n : ℕ) where\n partner : Cell m n → Cell m n\n partner_symm : ∀ x : Cell m n, partner (partner x) = x\n partner_ne_self : ∀ x : Cell m n, partner x ≠ x\n partner_adjacent : ∀ x : Cell m n, Adjacent x (partner x)\n\n/-- Two tilings are the same when their domino pairings agree at every cell. -/\ndef SameTiling {m n : ℕ} (t u : Tiling m n) : Prop :=\n ∀ x : Cell m n, t.partner x = u.partner x\n\n/-- The four cells of a `2 × 2` block are paired as two horizontal dominoes. -/\ndef IsHorizontalBlock {m n : ℕ} (t : Tiling m n) (b : Block m n) : Prop :=\n t.partner (Block.topLeft b) = Block.topRight b ∧\n t.partner (Block.topRight b) = Block.topLeft b ∧\n t.partner (Block.bottomLeft b) = Block.bottomRight b ∧\n t.partner (Block.bottomRight b) = Block.bottomLeft b\n\n/-- The four cells of a `2 × 2` block are paired as two vertical dominoes. -/\ndef IsVerticalBlock {m n : ℕ} (t : Tiling m n) (b : Block m n) : Prop :=\n t.partner (Block.topLeft b) = Block.bottomLeft b ∧\n t.partner (Block.bottomLeft b) = Block.topLeft b ∧\n t.partner (Block.topRight b) = Block.bottomRight b ∧\n t.partner (Block.bottomRight b) = Block.topRight b\n\n/-- The pairing function obtained by replacing the two horizontal dominoes in a\n`2 × 2` block by the two vertical dominoes. Outside the four cells of the block\nthe old partner function is unchanged. -/\ndef flipToVertical {m n : ℕ} (t : Tiling m n) (b : Block m n) : Cell m n → Cell m n :=\n fun x =>\n if x = Block.topLeft b then Block.bottomLeft b\n else if x = Block.bottomLeft b then Block.topLeft b\n else if x = Block.topRight b then Block.bottomRight b\n else if x = Block.bottomRight b then Block.topRight b\n else t.partner x\n\n/-- The pairing function obtained by replacing the two vertical dominoes in a\n`2 × 2` block by the two horizontal dominoes. Outside the four cells of the\nblock the old partner function is unchanged. -/\ndef flipToHorizontal {m n : ℕ} (t : Tiling m n) (b : Block m n) : Cell m n → Cell m n :=\n fun x =>\n if x = Block.topLeft b then Block.topRight b\n else if x = Block.topRight b then Block.topLeft b\n else if x = Block.bottomLeft b then Block.bottomRight b\n else if x = Block.bottomRight b then Block.bottomLeft b\n else t.partner x\n\n/-- A tiling together with the integer currently written at every interior\ngrid vertex. -/\nabbrev State (m n : ℕ) : Type := Tiling m n × (InteriorVertex m n → ℤ)\n\n/-- Increase by one the number at the specified interior vertex. -/\ndef incrementCounter {m n : ℕ} (f : InteriorVertex m n → ℤ)\n (v : InteriorVertex m n) : InteriorVertex m n → ℤ :=\n fun w => if w = v then f w + 1 else f w\n\n/-- Decrease by one the number at the specified interior vertex. -/\ndef decrementCounter {m n : ℕ} (f : InteriorVertex m n → ℤ)\n (v : InteriorVertex m n) : InteriorVertex m n → ℤ :=\n fun w => if w = v then f w - 1 else f w\n\n/-- Move 1: replace a `2 × 2` block tiled by two horizontal dominoes by the\nsame block tiled by two vertical dominoes, and increase the centre number by 1. -/\ndef MoveOne (m n : ℕ) (s t : State m n) : Prop :=\n ∃ b : Block m n,\n IsHorizontalBlock s.1 b ∧\n t.1.partner = flipToVertical s.1 b ∧\n t.2 = incrementCounter s.2 (Block.center b)\n\n/-- Move 2: replace a `2 × 2` block tiled by two vertical dominoes by the same\nblock tiled by two horizontal dominoes, and decrease the centre number by 1. -/\ndef MoveTwo (m n : ℕ) (s t : State m n) : Prop :=\n ∃ b : Block m n,\n IsVerticalBlock s.1 b ∧\n t.1.partner = flipToHorizontal s.1 b ∧\n t.2 = decrementCounter s.2 (Block.center b)\n\n/-- A single legal move is either move 1 or move 2. -/\ndef Move (m n : ℕ) (s t : State m n) : Prop :=\n MoveOne m n s t ∨ MoveTwo m n s t\n\n/-- The initial state: the given tiling and the number `0` at every interior\ngrid vertex. -/\ndef initialState (m n : ℕ) (t : Tiling m n) : State m n :=\n (t, fun _ => 0)\n\n/-- Every interior number is zero. -/\ndef AllCountersZero {m n : ℕ} (s : State m n) : Prop :=\n ∀ v : InteriorVertex m n, s.2 v = 0\n\n/-- The formal statement of the problem.\n\nFor all integers `m,n ≥ 2`, for every domino tiling of the `m × n` rectangle,\nand for every finite sequence of legal moves beginning with all interior\nnumbers zero: if the final domino tiling is exactly the initial tiling, then\nthe final number at every one of the `(m-1)(n-1)` interior grid vertices is\nzero. -/\ndef Target : Prop :=\n ∀ (m n : ℕ), 2 ≤ m → 2 ≤ n →\n ∀ (t : Tiling m n) (final : State m n),\n Relation.ReflTransGen (Move m n) (initialState m n t) final →\n SameTiling final.1 t →\n AllCountersZero final\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a8d28db-2b03-5d48-97b5-bcf580a0c51c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dfa94e9ac47e7b45fb25c9319e143b27c4fba4fb8b18de5a229fd37b3d85e575", "task_path": "tasks/nmp3_3a8d28db-2b03-5d48-97b5-bcf580a0c51c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3a8d28db-2b03-5d48-97b5-bcf580a0c51c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3aa28284-f2a5-538f-a412-6695a4bbfa0d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that\n-- \\[\n-- \\frac{a^{3}+b^{3}+c^{3}}{3abc}+\\frac{24abc}{(a+b)(b+c)(c+a)}\\ge 4.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the proposed inequality\n\nThe source problem asks to prove an inequality for all positive real numbers\n`a`, `b`, and `c`. This file records the target proposition only; it does\nnot contain a proof of that proposition.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (a ^ 3 + b ^ 3 + c ^ 3) / ((3 : ℝ) * a * b * c)\n + ((24 : ℝ) * a * b * c) / ((a + b) * (b + c) * (c + a))\n\n/-- The complete assertion to be proved: for all positive real numbers `a`,\n`b`, and `c`, the displayed expression is at least `4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → LHS a b c ≥ (4 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3aa28284-f2a5-538f-a412-6695a4bbfa0d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9c8804e45a8a258400363400f8f04a8088e6c103940e1c23c593e0772fddee2a", "task_path": "tasks/nmp3_3aa28284-f2a5-538f-a412-6695a4bbfa0d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3aa28284-f2a5-538f-a412-6695a4bbfa0d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3aad3622-2a74-5beb-b26c-5d42399ec810", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The function $f:\\mathbb{R}_{\\ge0}\\to\\mathbb{R}_{\\ge0}$ satisfies for all $a,b\\ge0$ \n-- (a) $f(a)=0\\iff a=0$, \n-- (b) $f(ab)=f(a)f(b)$, \n-- (c) $f(a+b)\\le2\\max\\{f(a),f(b)\\}$. \n-- \n-- Prove that for all $a,b\\ge0$,\n-- \\[\n-- f(a+b)\\le f(a)+f(b).\n-- \\]\nimport Mathlib.Basic.NNReal.Basic\n\n/-!\n# Formal statement of the functional inequality problem\n\nThe original problem concerns a function `f : ℝ≥0 → ℝ≥0` satisfying three\npointwise conditions. The declarations below record the hypotheses and the\ndesired conclusion as propositions; no proof of the target is supplied.\n-/\n\nnamespace Problem\n\n/-- The domain and codomain of the function are the nonnegative real numbers. -/\nabbrev NonnegativeRealFunction : Type := NNReal → NNReal\n\n/-- Condition (a): `f` vanishes exactly at zero. -/\ndef ZeroExactlyAtZero (f : NonnegativeRealFunction) : Prop :=\n ∀ a : NNReal, f a = 0 ↔ a = 0\n\n/-- Condition (b): `f` is multiplicative on the nonnegative reals. -/\ndef MultiplicativeOnNonnegative (f : NonnegativeRealFunction) : Prop :=\n ∀ a b : NNReal, f (a * b) = f a * f b\n\n/-- Condition (c): `f (a + b)` is at most twice the larger of `f a` and `f b`. -/\ndef TwoTimesMaxSubadditive (f : NonnegativeRealFunction) : Prop :=\n ∀ a b : NNReal, f (a + b) ≤ 2 * max (f a) (f b)\n\n/-- The complete hypothesis package assumed about `f` in the problem. -/\ndef Admissible (f : NonnegativeRealFunction) : Prop :=\n ZeroExactlyAtZero f ∧ MultiplicativeOnNonnegative f ∧ TwoTimesMaxSubadditive f\n\n/-- The desired conclusion: `f` is subadditive on the nonnegative reals. -/\ndef SubadditiveOnNonnegative (f : NonnegativeRealFunction) : Prop :=\n ∀ a b : NNReal, f (a + b) ≤ f a + f b\n\n/--\nThe proposition asserted by the problem: every function\n`f : ℝ≥0 → ℝ≥0` satisfying (a), (b), and (c) is subadditive.\n-/\ndef Target : Prop :=\n ∀ f : NonnegativeRealFunction, Admissible f → SubadditiveOnNonnegative f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3aad3622-2a74-5beb-b26c-5d42399ec810", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1000ae4428f47216343bad93cb826ccf548cb540a80c52c96d0402c85e56e656", "task_path": "tasks/nmp3_3aad3622-2a74-5beb-b26c-5d42399ec810", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3aad3622-2a74-5beb-b26c-5d42399ec810", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3ac5a373-ee5d-53ec-9f5c-dd113e98fa93", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{a}{3a+b^{2}}+\\frac{b}{3b+c^{2}}+\\frac{c}{3c+a^{2}}\\le\\frac34.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the source inequality\n\nThe source problem asks: for positive real numbers `a`, `b`, and `c` with\n`a + b + c = 3`, prove\n`a / (3a + b^2) + b / (3b + c^2) + c / (3c + a^2) ≤ 3/4`.\n\nThe target is recorded as a proposition. No proof of the proposition is\nincluded in this formalization.\n-/\n\nnamespace Problem\n\n/-- The three variables are admissible exactly when they are all strictly\npositive and their sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a / (3 * a + b ^ 2) + b / (3 * b + c ^ 2) + c / (3 * c + a ^ 2)\n\n/-- The complete proposition asserted by the source problem, universally\nquantified over all admissible positive real triples. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n LHS a b c ≤ (3 : ℝ) / 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ac5a373-ee5d-53ec-9f5c-dd113e98fa93", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cd93a12367a9204d6e58bdc336c08ddaaa4bce0f23ff468549b3b4e367e8f6eb", "task_path": "tasks/nmp3_3ac5a373-ee5d-53ec-9f5c-dd113e98fa93", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ac5a373-ee5d-53ec-9f5c-dd113e98fa93", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3af86520-974a-5686-8755-3e5f4c3a3b96", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a>1$ be a positive integer. Prove that there exists a non‑negative integer $n$ such that the number $2^{2^n}+a$ is not prime.\nimport Mathlib.Data.Nat.Prime.Defs\n\n/-!\n# Statement of the target problem\n\nLet `a > 1` be a positive integer. The problem asks to prove that there is a\nnon-negative integer `n` for which `2 ^ (2 ^ n) + a` is not prime.\n-/\n\nnamespace Problem\n\n/-- The statement of the problem: for every natural number `a` with `1 < a`,\nthere exists a natural number `n` such that `2 ^ (2 ^ n) + a` is not prime. -/\ndef Target : Prop :=\n ∀ (a : ℕ), 1 < a → ∃ (n : ℕ), ¬ Nat.Prime ((2 : ℕ) ^ ((2 : ℕ) ^ n) + a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3af86520-974a-5686-8755-3e5f4c3a3b96", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "194c13ab131f7ec45b6383eee9b6e67751efd9e1c79144ede81c080a21a29104", "task_path": "tasks/nmp3_3af86520-974a-5686-8755-3e5f4c3a3b96", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3af86520-974a-5686-8755-3e5f4c3a3b96", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3b0965aa-89b6-5d78-84c3-951703813d55", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=1$. Prove that \n-- \\[\n-- \\frac{a^{2}+b^{2}c}{\\,b+c\\,}+\\frac{b^{2}+c^{2}a}{\\,c+a\\,}+\\frac{c^{2}+a^{2}b}{\\,a+b\\,}\\ge \\frac{2}{3}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the algebraic inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose sum is `1`, the lower bound\n\n`(a^2 + b^2 c)/(b + c) + (b^2 + c^2 a)/(c + a)\n + (c^2 + a^2 b)/(a + b) ≥ 2/3`.\n\nThis file only records the statement; it does not supply a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 * c) / (b + c) +\n (b ^ 2 + c ^ 2 * a) / (c + a) +\n (c ^ 2 + a ^ 2 * b) / (a + b)\n\n/-- The assertion to be proved: for all positive reals `a`, `b`, `c` with sum `1`,\nthe displayed left-hand side is at least `2/3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → a + b + c = 1 →\n lhs a b c ≥ (2 : ℝ) / 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3b0965aa-89b6-5d78-84c3-951703813d55", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "390ed9992183b2333271bf59a29d30f1bd76d309ab2ea98d3b3ae179970dd2f8", "task_path": "tasks/nmp3_3b0965aa-89b6-5d78-84c3-951703813d55", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3b0965aa-89b6-5d78-84c3-951703813d55", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3b58fb4c-7795-588a-ab06-609ccb585b72", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. Let $a_1,\\dots,a_{2n-1}$ be $2n-1$ distinct positive real numbers with total sum $S=\\sum_{i=1}^{2n-1}a_i$. Prove that there are at least $\\displaystyle\\binom{2n-2}{\\,n-1\\,}$ subsets of size $n$ whose sum is at least $\\frac{S}{2}\\,.$\nimport Mathlib\n\nnamespace Problem\n\n/-- The total sum `S` of the indexed family `a`. -/\ndef totalSum {n : ℕ} (a : Fin (2 * n - 1) → ℝ) : ℝ :=\n ∑ i, a i\n\n/-- A subset of the index set has size `n` and sum at least `S / 2`. -/\ndef IsLargeNSubset {n : ℕ} (a : Fin (2 * n - 1) → ℝ)\n (t : Finset (Fin (2 * n - 1))) : Prop :=\n t.card = n ∧ totalSum a / 2 ≤ ∑ i ∈ t, a i\n\n/-- The finite set of all `n`-element index subsets whose sum is at least `S / 2`. -/\nnoncomputable def largeNSubsets {n : ℕ} (a : Fin (2 * n - 1) → ℝ) :\n Finset (Finset (Fin (2 * n - 1))) := by\n classical\n exact (Finset.univ : Finset (Finset (Fin (2 * n - 1)))).filter\n (fun t => IsLargeNSubset a t)\n\n/-- The assertion of the problem: for every positive integer `n` and every injective\nfamily of positive reals indexed by `Fin (2*n-1)`, at least `choose (2*n-2) (n-1)`\nsubsets of size `n` have sum at least `S/2`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (a : Fin (2 * n - 1) → ℝ),\n 0 < n →\n (∀ i : Fin (2 * n - 1), 0 < a i) →\n Function.Injective a →\n Nat.choose (2 * n - 2) (n - 1) ≤ (largeNSubsets a).card\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3b58fb4c-7795-588a-ab06-609ccb585b72", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "70de5fc912536a615fce09cb36fa1a97d7e42e33cea6e160e0e2497b63f71e1d", "task_path": "tasks/nmp3_3b58fb4c-7795-588a-ab06-609ccb585b72", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3b58fb4c-7795-588a-ab06-609ccb585b72", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3b62235a-e2d4-5e3b-aa4a-f3450e467e98", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,\\;b,\\;c$ be positive real numbers. Prove that \n-- \\[\n-- \\sum_{cyc}\\sqrt{\\frac{b+c}{a}}\\;\\ge\\;\\sqrt6\\,\\frac{a+b+c}{\\sqrt{ab+bc+ca}}\\,.\n-- \\] \n-- Here $\\displaystyle\\sum_{cyc}$ denotes the cyclic sum over $(a,b,c)$.\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic square-root inequality\n\nThe source problem asks us to prove, for positive real numbers `a`, `b`, and\n`c`, that the cyclic sum of `sqrt ((b + c) / a)` is at least\n`sqrt 6 * (a + b + c) / sqrt (a*b + b*c + c*a)`.\n\nThis file only introduces the mathematical objects and states the target\nproposition. No proof of the target is provided.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The cyclic sum of a three-variable function over `(a, b, c)`.\n\nExplicitly, `cyclicSum f a b c` is\n`f a b c + f b c a + f c a b`. -/\ndef cyclicSum (f : ℝ → ℝ → ℝ → ℝ) (a b c : ℝ) : ℝ :=\n f a b c + f b c a + f c a b\n\n/-- The left-hand side of the source inequality:\n`∑_cyc sqrt ((b+c)/a) = sqrt ((b+c)/a) + sqrt ((c+a)/b) + sqrt ((a+b)/c)`. -/\ndef leftHandSide (a b c : ℝ) : ℝ :=\n cyclicSum (fun x y z : ℝ => Real.sqrt ((y + z) / x)) a b c\n\n/-- The right-hand side of the source inequality. -/\ndef rightHandSide (a b c : ℝ) : ℝ :=\n Real.sqrt 6 * ((a + b + c) / Real.sqrt (a * b + b * c + c * a))\n\n/-- The assertion to be proved: for all positive real numbers `a`, `b`, `c`,\nthe cyclic square-root sum is at least the displayed right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n rightHandSide a b c ≤ leftHandSide a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3b62235a-e2d4-5e3b-aa4a-f3450e467e98", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a3b73c30fb0031f2905336a8e20088fdd881ed5e6763c88c4179e100a16b6be6", "task_path": "tasks/nmp3_3b62235a-e2d4-5e3b-aa4a-f3450e467e98", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3b62235a-e2d4-5e3b-aa4a-f3450e467e98", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3b62a7c5-aa92-5e34-b0c0-ab4b0fe61bee", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer and let $S\\subseteq\\{0,1\\}^n$ be a set of binary strings of length $n$. For an odd integer $2k+1$, define the **majority** of $x_1,\\dots,x_{2k+1}\\in S$ (repetitions allowed) to be the binary string $y\\in\\{0,1\\}^n$ whose $i^{\\text{th}}$ bit is the most common among the $i^{\\text{th}}$ bits of $x_1,\\dots,x_{2k+1}$. \n-- \n-- Suppose that for some positive integer $k$, $S$ has the property $P_k$: the majority of any $2k+1$ strings from $S$ (with possible repetitions) also belongs to $S$. Prove that $S$ then has property $P_k$ for **all** positive integers $k$.\nimport Mathlib\n\nnamespace Problem\n\n/-- A binary string of length `n`, with the `n` coordinates indexed by `Fin n`. -/\nabbrev BitString (n : ℕ) : Type := Fin n → Bool\n\n/-- The number of `1` bits in coordinate `i` among the `2 * k + 1` input strings. -/\ndef countOnes {n k : ℕ} (x : Fin (2 * k + 1) → BitString n) (i : Fin n) : ℕ :=\n (Finset.univ.filter (fun j : Fin (2 * k + 1) => x j i = true)).card\n\n/--\nThe coordinatewise majority of `2 * k + 1` binary strings of length `n`.\n\nIn coordinate `i`, this is `true` exactly when more than `k` of the\n`2 * k + 1` strings have a `true` bit in that coordinate. Since\n`2 * k + 1` is odd, this is exactly the most common bit (there is no tie).\n-/\ndef majority (n k : ℕ) (x : Fin (2 * k + 1) → BitString n) : BitString n :=\n fun i : Fin n => decide (k < countOnes x i)\n\n/--\n`MajorityClosed n k S` is property `P_k`: the majority of any\n`2 * k + 1` strings from `S` (repetitions allowed) again lies in `S`.\n-/\ndef MajorityClosed (n k : ℕ) (S : Set (BitString n)) : Prop :=\n ∀ x : Fin (2 * k + 1) → BitString n,\n (∀ j : Fin (2 * k + 1), x j ∈ S) → majority n k x ∈ S\n\n/--\nIf a set `S` of binary strings of positive length `n` has property `P_k`\nfor some positive integer `k`, then it has property `P_k` for every\npositive integer `k`.\n-/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n →\n ∀ S : Set (BitString n),\n (∃ k : ℕ, 0 < k ∧ MajorityClosed n k S) →\n ∀ k : ℕ, 0 < k → MajorityClosed n k S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3b62a7c5-aa92-5e34-b0c0-ab4b0fe61bee", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "098797e58faacca633da4f065b8949dc9d4bffd79012de10fde2709e0cee257f", "task_path": "tasks/nmp3_3b62a7c5-aa92-5e34-b0c0-ab4b0fe61bee", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3b62a7c5-aa92-5e34-b0c0-ab4b0fe61bee", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3b916c98-ff36-53a5-82ff-4041e5cdb75e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 3$ be a positive integer. Given a set $S$ of $n$ points in the plane, with no three collinear, a subset $K\\subseteq S$ is called **good** if the points of $K$ are the vertices of a convex polygon and no other point of $S$ lies in the interior of that polygon. For each integer $k$ with $3\\le k\\le n$, let $c_k$ denote the number of good subsets of $S$ of size $k$. Prove that the alternating sum \n-- \\[\n-- \\sum_{k=3}^{n}(-1)^k\\,c_k\n-- \\]\n-- depends only on $n$ (i.e., is independent of the particular configuration of $S$).\nimport Mathlib.Analysis.Convex.Topology\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\n/-!\n# Formal statement: alternating count of empty convex subsets\n\nThis file formalizes the statement of the problem only. In particular,\n`Problem.Target` is a proposition-valued definition; no proof of it is supplied.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real two-dimensional Euclidean space. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A finite point set has no three collinear points when every three pairwise\ndistinct points in it are not collinear. -/\ndef NoThreeCollinear (S : Finset Plane) : Prop :=\n ∀ p : Plane, p ∈ S → ∀ q : Plane, q ∈ S → ∀ r : Plane, r ∈ S →\n p ≠ q → p ≠ r → q ≠ r →\n ¬ Collinear ℝ ({p, q, r} : Set Plane)\n\n/-- The points of `K` are the vertices of a convex polygon. Since the ambient\nplane is two-dimensional, this is expressed by requiring at least three points\nand requiring that every point of `K` be extreme for the convex hull of `K`\n(equivalently, it is not in the convex hull of the other points of `K`). -/\ndef IsConvexPolygonVertexSet (K : Finset Plane) : Prop :=\n 3 ≤ K.card ∧\n ∀ p : Plane, p ∈ K →\n p ∉ convexHull ℝ (((K : Set Plane) \\ {p}))\n\n/-- `K` is a good subset of `S`: it is a subset of `S`, its points are the\nvertices of a convex polygon, and no point of `S \\ K` lies in the interior of\nthe convex hull of `K`. -/\ndef Good (S K : Finset Plane) : Prop :=\n K ⊆ S ∧\n IsConvexPolygonVertexSet K ∧\n ∀ p : Plane, p ∈ S → p ∉ K →\n p ∉ interior (convexHull ℝ (K : Set Plane))\n\n/-- The finite set of all good subsets of `S`. -/\ndef goodSubsets (S : Finset Plane) : Finset (Finset Plane) := by\n classical\n exact S.powerset.filter (fun K : Finset Plane => Good S K)\n\n/-- The value `c_k` for the point set `S`: the number of good subsets of `S`\nhaving exactly `k` points. -/\ndef goodSubsetCount (S : Finset Plane) (k : ℕ) : ℕ := by\n classical\n exact ((goodSubsets S).filter (fun K : Finset Plane => K.card = k)).card\n\n/-- The alternating sum `∑_{k=3}^{S.card} (-1)^k c_k`, evaluated in `ℤ`. -/\ndef alternatingGoodSum (S : Finset Plane) : ℤ :=\n (Finset.Icc 3 S.card).sum\n (fun k : ℕ => (-1 : ℤ) ^ k * (goodSubsetCount S k : ℤ))\n\n/-- The alternating sum depends only on the cardinality `n` of the point set,\nnot on the particular configuration. This is formalized as equality of the\nalternating sums for any two admissible configurations with the same cardinality. -/\ndef Target : Prop :=\n ∀ n : ℕ, 3 ≤ n →\n ∀ S : Finset Plane, S.card = n → NoThreeCollinear S →\n ∀ T : Finset Plane, T.card = n → NoThreeCollinear T →\n alternatingGoodSum S = alternatingGoodSum T\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3b916c98-ff36-53a5-82ff-4041e5cdb75e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "78eb8f3b16687ebc12444a9069c744b8193d5b3464e71085f7f6de46da61dbc4", "task_path": "tasks/nmp3_3b916c98-ff36-53a5-82ff-4041e5cdb75e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3b916c98-ff36-53a5-82ff-4041e5cdb75e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3b924488-7186-5af9-9d9d-9ea15094c266", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(x_n)_{n\\ge1}$ be a sequence of positive real numbers such that the series $\\displaystyle\\sum_{n=1}^{\\infty}x_n$ converges. Define \n-- \\[\n-- y_n=\\frac{n}{\\displaystyle\\sum_{i=1}^{n}\\frac1{x_i}}\\; .\n-- \\] \n-- Prove that the series $\\displaystyle\\sum_{n=1}^{\\infty}y_n$ also converges.\nimport Mathlib\n\nnamespace Problem\n\n/-- The sequence is positive at every original index `n ≥ 1`, represented as\n`x (n + 1)` with a zero-based `ℕ` index. -/\ndef PositiveFromOne (x : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, 0 < x (n + 1)\n\n/-- The finite reciprocal sum `∑_{i=1}^n 1 / x_i`, for the sequence indexed from 1. -/\nnoncomputable def reciprocalPartialSum (x : ℕ → ℝ) (n : ℕ) : ℝ :=\n ∑ i ∈ Finset.Icc 1 n, (1 : ℝ) / x i\n\n/-- The term `y_n = n / (∑_{i=1}^n 1 / x_i)` of the problem. -/\nnoncomputable def y (x : ℕ → ℝ) (n : ℕ) : ℝ :=\n (n : ℝ) / reciprocalPartialSum x n\n\n/-- The series `∑_{n=1}^∞ a_n` converges: its partial sums from index 1 have a\nfinite real limit. -/\nnoncomputable def SeriesFromOneConverges (a : ℕ → ℝ) : Prop :=\n ∃ L : ℝ,\n Filter.Tendsto\n (fun N : ℕ => ∑ n ∈ Finset.range N, a (n + 1))\n Filter.atTop (nhds L)\n\n/-- The assertion of the problem: for every positive real sequence whose series\nfrom index 1 converges, the series of the associated terms `y_n` from index 1\nalso converges. -/\nnoncomputable def Target : Prop :=\n ∀ x : ℕ → ℝ,\n PositiveFromOne x →\n SeriesFromOneConverges x →\n SeriesFromOneConverges (fun n : ℕ => y x n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3b924488-7186-5af9-9d9d-9ea15094c266", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0d102de03654b4c6e5227fdf787f84b83f7d2b79e6347241ec11701200dc5042", "task_path": "tasks/nmp3_3b924488-7186-5af9-9d9d-9ea15094c266", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3b924488-7186-5af9-9d9d-9ea15094c266", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3ba3a557-8ae1-5940-aa02-0ee676f42dd3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb R\\to\\mathbb R$ be a real function whose third derivative $f'''$ is continuous on $\\mathbb R$. Prove that there exists a point $a\\in\\mathbb R$ such that \n-- \\[\n-- f(a)\\,f'(a)\\,f''(a)\\,f'''(a)\\ge 0.\n-- \\]\nimport Mathlib.Analysis.Calculus.ContDiff.Basic\n\n/-!\n# Formal statement\n\nThe original problem asks to prove that for every real function `f` whose third\nderivative is continuous on `ℝ`, there is a point `a` at which\n`f a * f' a * f'' a * f''' a` is nonnegative.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The derivative of `f` is denoted by `deriv f`; the third derivative is the\nthird iterate of `deriv`. -/\ndef thirdDerivative (f : ℝ → ℝ) : ℝ → ℝ :=\n deriv (deriv (deriv f))\n\n/-- `HasContinuousThirdDerivative f` says that `f` is three times continuously\ndifferentiable on `ℝ`. This is the standard formal reading of the hypothesis\nthat `f'''` exists and is continuous on `ℝ`. -/\ndef HasContinuousThirdDerivative (f : ℝ → ℝ) : Prop :=\n ContDiff ℝ 3 f\n\n/-- **Target statement.** For every real function `f` with continuous third\nderivative on `ℝ`, there exists `a : ℝ` such that the product\n`f a * f' a * f'' a * f''' a` is nonnegative. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ,\n HasContinuousThirdDerivative f →\n ∃ a : ℝ,\n f a * deriv f a * deriv (deriv f) a * thirdDerivative f a ≥ 0\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ba3a557-8ae1-5940-aa02-0ee676f42dd3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ba79a493291672fe88b00985a89c3f8a427a68c597341863bb4c892f80edbb32", "task_path": "tasks/nmp3_3ba3a557-8ae1-5940-aa02-0ee676f42dd3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ba3a557-8ae1-5940-aa02-0ee676f42dd3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3ba56587-29de-5082-a80a-6f2125a4c61e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a^{2}}{b}+\\frac{b^{2}}{c}+\\frac{c^{2}}{a}\\;\\ge\\;\\frac12\\Bigl(\\sqrt{3a^{2}+b^{2}}+\\sqrt{3b^{2}+c^{2}}+\\sqrt{3c^{2}+a^{2}}\\Bigr)\\, .\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\nnamespace Problem\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n a ^ 2 / b + b ^ 2 / c + c ^ 2 / a\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) *\n (Real.sqrt (3 * a ^ 2 + b ^ 2) +\n Real.sqrt (3 * b ^ 2 + c ^ 2) +\n Real.sqrt (3 * c ^ 2 + a ^ 2))\n\n/-- The inequality asserted in the problem for a fixed triple of real numbers. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n leftHandSide a b c ≥ rightHandSide a b c\n\n/-- The complete proposition stated by the problem. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ba56587-29de-5082-a80a-6f2125a4c61e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "71ffa367fdbee908c897f8e344d9f003df3992815bdff26e5104ff49f31790d7", "task_path": "tasks/nmp3_3ba56587-29de-5082-a80a-6f2125a4c61e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ba56587-29de-5082-a80a-6f2125a4c61e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3bb26e8c-0ef9-572a-b379-3d303f646153", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Incircle of triangle $ABC$ touches sides $AB$, $AC$, $BC$ at $D$, $E$, $F$ respectively. Let $N$ be the midpoint of $DE$. Prove that $\\angle NFE = \\angle AFD$.\nimport Mathlib.Analysis.Convex.Segment\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.LinearAlgebra.AffineSpace.Midpoint\n\n/-!\n# Formal statement of an incircle angle theorem\n\nThe original problem is stated in the Euclidean plane. We use the concrete\nreal Euclidean plane `EuclideanSpace ℝ (Fin 2)` and mathlib's unoriented\nEuclidean angle. The definition `Problem.IncircleTouchesAt` spells out what it\nmeans for a circle to be the incircle of a triangle and to touch its three\nsides at prescribed points. `Problem.Target` is the assertion to be proved;\nit is a proposition, not a proof.\n-/\n\nnoncomputable section\n\nopen scoped EuclideanGeometry RealInnerProductSpace\n\nnamespace Problem\n\n/-- A point of the Euclidean plane. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `P` lies strictly between `X` and `Y` on the affine segment joining them. -/\ndef StrictlyBetween (P X Y : Point) : Prop :=\n ∃ t : ℝ, 0 < t ∧ t < 1 ∧ P = (1 - t) • X + t • Y\n\n/-- `P` lies strictly inside the triangle with vertices `A`, `B`, and `C`. -/\ndef StrictlyInsideTriangle (P A B C : Point) : Prop :=\n ∃ x y z : ℝ,\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = 1 ∧\n P = x • A + y • B + z • C\n\n/-- The three points `A`, `B`, and `C` are vertices of a nondegenerate triangle. -/\ndef NondegenerateTriangle (A B C : Point) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Point)\n\n/--\nThe circle with center `I` and radius `r` touches the side with endpoints `X`\nand `Y` at the point `P`.\n\nThe contact point `P` lies strictly between `X` and `Y`, it lies on the circle\n(`dist I P = r`), and the radius `I P` is perpendicular to the side direction\n`Y - X`.\n-/\ndef TouchesSideAt (I : Point) (r : ℝ) (P X Y : Point) : Prop :=\n StrictlyBetween P X Y ∧\n dist I P = r ∧\n inner ℝ (P - I) (Y - X) = 0\n\n/--\nThe circle with center `I` and radius `r` is the incircle of triangle `ABC`,\nand it touches the sides `AB`, `AC`, and `BC` at `D`, `E`, and `F`,\nrespectively.\n\nThe conditions say that `I` is strictly inside the triangle, that the radius is\npositive, and that each of `D`, `E`, and `F` is the tangency point on the\ncorresponding side. These are exactly the defining properties of the three\nside tangencies of the incircle.\n-/\ndef IncircleTouchesAt (A B C D E F : Point) : Prop :=\n ∃ I : Point, ∃ r : ℝ,\n 0 < r ∧\n StrictlyInsideTriangle I A B C ∧\n TouchesSideAt I r D A B ∧\n TouchesSideAt I r E A C ∧\n TouchesSideAt I r F B C\n\n/--\nTarget assertion: if the incircle of a nondegenerate triangle `ABC` touches\nthe sides `AB`, `AC`, and `BC` at `D`, `E`, and `F`, respectively, and `N` is\nthe midpoint of `DE`, then the (unoriented) angles `NFE` and `AFD` are equal.\n-/\ndef Target : Prop :=\n ∀ A B C : Point,\n NondegenerateTriangle A B C →\n ∀ D E F : Point,\n IncircleTouchesAt A B C D E F →\n ∀ N : Point,\n N = midpoint ℝ D E →\n EuclideanGeometry.angle N F E = EuclideanGeometry.angle A F D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3bb26e8c-0ef9-572a-b379-3d303f646153", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1192ba2302096300750960428881af85d4d9648e194054015f161fbbaa2777d1", "task_path": "tasks/nmp3_3bb26e8c-0ef9-572a-b379-3d303f646153", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3bb26e8c-0ef9-572a-b379-3d303f646153", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3bd22efe-6a11-523e-b2e5-5e803f5fd400", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- 1+\\frac{8}{a+b+c}\\ge \\frac{11}{ab+bc+ca}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of a positive-real inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, `c`\nsatisfying `a * b * c = 1`, that\n`1 + 8 / (a + b + c) ≥ 11 / (a * b + b * c + c * a)`.\n\nThis file states the target proposition `Problem.Target`; it does not provide\na proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypotheses of the problem: `a`, `b`, `c` are positive\nreal numbers whose product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The full universally quantified assertion of the problem: for every triple\nof positive real numbers `a`, `b`, `c` with `a * b * c = 1`, the stated\nnon-strict real inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c →\n 1 + 8 / (a + b + c) ≥ 11 / (a * b + b * c + c * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3bd22efe-6a11-523e-b2e5-5e803f5fd400", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f76bc02ff1f070e3011f7f633e5bbd64f9790bd4a8a3c83ed04e2d59e45d2ff9", "task_path": "tasks/nmp3_3bd22efe-6a11-523e-b2e5-5e803f5fd400", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3bd22efe-6a11-523e-b2e5-5e803f5fd400", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3c1f0632-c6dc-5449-b711-840cd3504f11", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ satisfy $a^{2}+b^{2}+c^{2}+d^{2}=1$. Prove that \n-- \\[\n-- \\frac{a^{2}}{\\,b+c\\,}+\\frac{b^{2}}{\\,c+d\\,}+\\frac{c^{2}}{\\,d+a\\,}+\\frac{d^{2}}{\\,a+b\\,}\\ge 1\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a cyclic denominator inequality\n\nThe source problem asks to prove, for positive real numbers `a b c d` whose\nsquared sum is `1`, the cyclic inequality\n\n`a^2 / (b + c) + b^2 / (c + d) + c^2 / (d + a) + d^2 / (a + b) ≥ 1`.\n\nNo proof is supplied here: `Problem.Target` is the proposition to be proved.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real `a`, `b`, `c`, `d`\nwith `a^2 + b^2 + c^2 + d^2 = 1`, the displayed cyclic sum is at least `1`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 0 < d →\n a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = 1 →\n 1 ≤ a ^ 2 / (b + c) + b ^ 2 / (c + d) +\n c ^ 2 / (d + a) + d ^ 2 / (a + b)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3c1f0632-c6dc-5449-b711-840cd3504f11", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c16c72cddd4b8b05ee64fb9f0efeae9c39891d3f01ad223275ce4f19ec46a84e", "task_path": "tasks/nmp3_3c1f0632-c6dc-5449-b711-840cd3504f11", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3c1f0632-c6dc-5449-b711-840cd3504f11", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3c3baaab-ee12-5e10-9805-a0f62d31a07d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that $\\sqrt a,\\sqrt b,\\sqrt c$ are the side lengths of a (non‑degenerate) triangle; i.e. $\\sqrt a<\\sqrt b+\\sqrt c$, $\\sqrt b<\\sqrt a+\\sqrt c$, $\\sqrt c<\\sqrt a+\\sqrt b$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a(b+c)}{a^{2}+bc}}+\\sqrt{\\frac{b(a+c)}{b^{2}+ac}}+\\sqrt{\\frac{c(a+b)}{c^{2}+ab}}\\le 3.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The three strict triangle inequalities for the side lengths\n`Real.sqrt a`, `Real.sqrt b`, and `Real.sqrt c`. -/\ndef IsNondegenerateSqrtTriangle (a b c : ℝ) : Prop :=\n Real.sqrt a < Real.sqrt b + Real.sqrt c ∧\n Real.sqrt b < Real.sqrt a + Real.sqrt c ∧\n Real.sqrt c < Real.sqrt a + Real.sqrt b\n\n/-- The `x`-cyclic summand\n`sqrt (x * (y + z) / (x ^ 2 + y * z))`. -/\ndef Summand (x y z : ℝ) : ℝ :=\n Real.sqrt (x * (y + z) / (x ^ 2 + y * z))\n\n/-- The left-hand side of the desired inequality. -/\ndef LHS (a b c : ℝ) : ℝ :=\n Summand a b c + Summand b a c + Summand c a b\n\n/-- The assertion of the problem: for every positive triple `a`, `b`, `c`\nwhose square roots form a non-degenerate triangle, the stated cyclic sum is\nat most `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n IsNondegenerateSqrtTriangle a b c →\n LHS a b c ≤ 3\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3c3baaab-ee12-5e10-9805-a0f62d31a07d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a63e4be30d2fed6260d2a07f97c6f0677f7cf4360786b3cf95e380795a4d7b8e", "task_path": "tasks/nmp3_3c3baaab-ee12-5e10-9805-a0f62d31a07d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3c3baaab-ee12-5e10-9805-a0f62d31a07d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3c589f0f-2b31-51a4-8ae2-1e6f87b5bb46", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exist infinitely many positive integers $n$ such that the equation \n-- \\[\n-- (x+y+z)^3 = n^2\\,xyz\n-- \\]\n-- has a solution $(x,y,z)$ in $\\mathbb{N}^3$ (i.e., with $x,y,z$ positive integers).\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe original problem asks for a proof that infinitely many positive integers `n`\nhave a solution in positive integers `x, y, z` of\n\n`(x + y + z)^3 = n^2 * x * y * z`.\n\nThe declarations below record the admissibility predicate, the solution predicate,\nand the proposition to be proved. No proof is supplied at this formalization stage.\n-/\n\nnamespace Problem\n\n/-- A positive-integer solution `(x, y, z)` of the displayed equation for a fixed\nnatural number `n`. The positivity requirements on `x`, `y`, and `z` are explicit,\nsince Lean's `ℕ` contains zero while the statement says that `x`, `y`, and `z` are\npositive integers. -/\ndef IsSolution (n x y z : ℕ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧\n (x + y + z) ^ 3 = n ^ 2 * x * y * z\n\n/-- The positive integers `n` for which the displayed equation has a solution in\npositive integers `x`, `y`, and `z`. -/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧ ∃ x y z : ℕ, IsSolution n x y z\n\n/-- The set of all positive integers `n` for which the displayed equation has a\npositive-integer solution. -/\ndef AdmissibleSet : Set ℕ :=\n {n : ℕ | Admissible n}\n\n/-- The target proposition: there are infinitely many positive integers `n` for\nwhich the equation admits a positive-integer solution. -/\ndef Target : Prop :=\n Set.Infinite AdmissibleSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3c589f0f-2b31-51a4-8ae2-1e6f87b5bb46", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6de71166e1a326a4df68562d270f5ee71743d7419fdf49165566a26b36bc45f3", "task_path": "tasks/nmp3_3c589f0f-2b31-51a4-8ae2-1e6f87b5bb46", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3c589f0f-2b31-51a4-8ae2-1e6f87b5bb46", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3cb131af-5e20-5090-928a-813a626f77d5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\triangle ABC$ have incircle tangent to $AB$, $BC$, $CA$ at $D$, $E$, $F$, respectively. Let $P$ be the foot of the perpendicular from $D$ to line $EF$. Prove that $\\angle CAP = \\angle CBP$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Incenter.Basic\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Analysis.Convex.Between\nimport Mathlib.Geometry.Euclidean.Sphere.Tangent\n\n/-!\n# Formalization of the incircle orthogonality angle problem\n\nThe problem is stated for a nondegenerate triangle in the Euclidean plane. Its\nincircle touches the three sides at `D`, `E`, and `F`; the point `P` is the\nperpendicular projection of `D` onto the line `EF`. The claimed conclusion is\nthe equality of the two (unoriented) Euclidean angles `∠CAP` and `∠CBP`.\n-/\n\nnoncomputable section\n\nopen scoped EuclideanGeometry RealInnerProductSpace Affine\nopen EuclideanGeometry\n\nnamespace Problem\n\n/-- The ambient Euclidean plane used for the problem. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The three vertices form a nondegenerate (noncollinear) triangle. -/\ndef IsNondegenerateTriangle (A B C : Point) : Prop :=\n AffineIndependent ℝ ![A, B, C]\n\n/-- A circle, described by its center and radius, is tangent to each of the three\nsidelines at the prescribed points, and those points lie strictly on the\ncorresponding sides of triangle `ABC`. Thus the circle is the incircle of the\ntriangle, not one of its excircles. -/\ndef HasIncircleTouching (A B C D E F : Point) : Prop :=\n ∃ (I : Point) (r : ℝ),\n 0 < r ∧\n (⟨I, r⟩ : EuclideanGeometry.Sphere Point).IsTangentAt D (line[ℝ, A, B]) ∧\n (⟨I, r⟩ : EuclideanGeometry.Sphere Point).IsTangentAt E (line[ℝ, B, C]) ∧\n (⟨I, r⟩ : EuclideanGeometry.Sphere Point).IsTangentAt F (line[ℝ, C, A]) ∧\n Sbtw ℝ A D B ∧ Sbtw ℝ B E C ∧ Sbtw ℝ C F A\n\n/-- The complete hypothesis that `ABC` is a nondegenerate triangle with the\nincircle touching `AB`, `BC`, and `CA` at `D`, `E`, and `F`, respectively. -/\ndef IncircleConfiguration (A B C D E F : Point) : Prop :=\n IsNondegenerateTriangle A B C ∧ HasIncircleTouching A B C D E F\n\n/-- `P` is the foot of the perpendicular from `D` to the line through `E` and\n`F`: it lies on that line and the vector `D - P` is orthogonal to the direction\n`E - F` of the line. -/\ndef IsPerpendicularFoot (D E F P : Point) : Prop :=\n P ∈ line[ℝ, E, F] ∧ inner ℝ (D -ᵥ P) (E -ᵥ F) = 0\n\n/-- The formal statement of the problem: for every nondegenerate triangle `ABC`\nwith incircle touching `AB`, `BC`, and `CA` at `D`, `E`, and `F`, respectively,\nand for every foot `P` of the perpendicular from `D` to line `EF`, the\nunoriented angles at `A` and `B` subtended respectively by `C`, `P` and `C`, `P`\nare equal. -/\ndef Target : Prop :=\n ∀ (A B C D E F : Point),\n IncircleConfiguration A B C D E F →\n ∀ (P : Point),\n IsPerpendicularFoot D E F P →\n EuclideanGeometry.angle C A P = EuclideanGeometry.angle C B P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3cb131af-5e20-5090-928a-813a626f77d5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e3c106af9bd0b83848ced5fdb5929c2c14a2346c0a7a3f26bc99bc49491c846c", "task_path": "tasks/nmp3_3cb131af-5e20-5090-928a-813a626f77d5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3cb131af-5e20-5090-928a-813a626f77d5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3cb7280c-442a-512a-bd72-a7c30624f15f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any positive real numbers $a,b,c$ satisfying $ab+bc+ca=abc$, prove that \n-- \\[\n-- \\frac{ab}{a^{2}b+1}+\\frac{bc}{b^{2}c+1}+\\frac{ca}{c^{2}a+1}\\le\\frac{ab+bc+ca}{28}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility condition for the three positive real parameters:\n`a`, `b`, and `c` are positive and satisfy `ab + bc + ca = abc`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = a * b * c\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * b / (a ^ 2 * b + 1) +\n b * c / (b ^ 2 * c + 1) +\n c * a / (c ^ 2 * a + 1)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a * b + b * c + c * a) / 28\n\n/-- The complete universal implication claimed by the problem: for all positive\nreal numbers `a`, `b`, and `c` satisfying `ab + bc + ca = abc`, the displayed\nsum is at most `(ab + bc + ca)`, divided by `28`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3cb7280c-442a-512a-bd72-a7c30624f15f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "82815faf39ee4400382cc328a530b38a28077b4fb7183bce77837b39d18e4566", "task_path": "tasks/nmp3_3cb7280c-442a-512a-bd72-a7c30624f15f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3cb7280c-442a-512a-bd72-a7c30624f15f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3cb8f571-811a-5708-b4b8-17f6415fd5de", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x_1,x_2,\\dots ,x_{13}$ be positive integers with $x_i\\le 93$ for every $i$, and let $y_1,y_2,\\dots ,y_{93}$ be positive integers with $y_j\\le 13$ for every $j$. Prove that there exist non‑empty subsequences (i.e. non‑empty subsets of indices) $I\\subseteq\\{1,\\dots ,13\\}$ and $J\\subseteq\\{1,\\dots ,93\\}$ such that \n-- \n-- \\[\n-- \\sum_{i\\in I}x_i=\\sum_{j\\in J}y_j .\n-- \\]\nimport Mathlib\n\n/-!\n# Statement for the subsequence-sum problem\n\nThe original problem asks to prove that, for every length-13 sequence of\npositive integers bounded by 93 and every length-93 sequence of positive\nintegers bounded by 13, there are nonempty subsets of the two index sets\nwhose sums agree.\n\nNatural numbers are used for the positive integer entries. The finite index\nsets are represented by `Fin 13` and `Fin 93`, and nonempty subsets by\nnonempty `Finset`s thereof.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem:\n\nFor all `x : Fin 13 → ℕ` with every `x i` positive and at most `93`, and all\n`y : Fin 93 → ℕ` with every `y j` positive and at most `13`, there exist a\nnonempty finite subset `I` of the `x`-indices and a nonempty finite subset\n`J` of the `y`-indices such that the corresponding sums are equal.\n\nThis is a proposition-valued declaration; no proof of it is supplied here. -/\ndef Target : Prop :=\n ∀ (x : Fin 13 → ℕ) (y : Fin 93 → ℕ),\n (∀ i : Fin 13, 0 < x i) →\n (∀ i : Fin 13, x i ≤ 93) →\n (∀ j : Fin 93, 0 < y j) →\n (∀ j : Fin 93, y j ≤ 13) →\n ∃ I : Finset (Fin 13), ∃ J : Finset (Fin 93),\n I.Nonempty ∧ J.Nonempty ∧\n (∑ i ∈ I, x i) = (∑ j ∈ J, y j)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3cb8f571-811a-5708-b4b8-17f6415fd5de", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5eec0ce1d067ce795b73968ca355c313afc9575fca6a59d72c6947c111841847", "task_path": "tasks/nmp3_3cb8f571-811a-5708-b4b8-17f6415fd5de", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3cb8f571-811a-5708-b4b8-17f6415fd5de", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3cc0259c-f7d4-56c4-aa99-897fe0447842", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all real numbers $x,y,z$,\n-- \\[\n-- (x^2+3)^2\\,(y^2+3)^2\\,(z^2+3)^2\\;\\ge\\;\\frac{4^6}{3^6}\\,xyz\\,(xy+yz+zx)^3.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- For all real numbers `x`, `y`, and `z`, the product\n`(x^2 + 3)^2 (y^2 + 3)^2 (z^2 + 3)^2` is at least\n`(4^6 / 3^6) x y z (x y + y z + z x)^3`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n (x ^ 2 + 3) ^ 2 * (y ^ 2 + 3) ^ 2 * (z ^ 2 + 3) ^ 2 ≥\n ((4 : ℝ) ^ 6 / (3 : ℝ) ^ 6) * x * y * z * (x * y + y * z + z * x) ^ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3cc0259c-f7d4-56c4-aa99-897fe0447842", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dde745d60e799f3ec1d31c8f524c4af7f06ffde6a23e8182d810c22c286375c9", "task_path": "tasks/nmp3_3cc0259c-f7d4-56c4-aa99-897fe0447842", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3cc0259c-f7d4-56c4-aa99-897fe0447842", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3ccc4db2-b7cf-56ee-bc43-64dd87e99858", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b\\ge 0$ be real numbers such that $a^6+b^6=2$. Prove that \n-- \\[a+b\\le a^5+b^5.\\]\nimport Mathlib\n\n/-!\n# Formalization of the statement\n\nThe source problem asks, for nonnegative real numbers `a` and `b` satisfying\n`a ^ 6 + b ^ 6 = 2`, to prove `a + b ≤ a ^ 5 + b ^ 5`.\n\nThis file only states the proposition. No proof is supplied or assumed.\n-/\n\nnamespace Problem\n\n/-- The two nonnegativity hypotheses imposed on the real numbers `a` and `b`. -/\ndef NonnegativeDomain (a b : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b\n\n/-- The prescribed sixth-power constraint `a ^ 6 + b ^ 6 = 2`. -/\ndef SixthPowerConstraint (a b : ℝ) : Prop :=\n a ^ 6 + b ^ 6 = 2\n\n/-- The full admissibility condition on the pair `(a, b)` from the source problem. -/\ndef Admissible (a b : ℝ) : Prop :=\n NonnegativeDomain a b ∧ SixthPowerConstraint a b\n\n/-- The inequality `a + b ≤ a ^ 5 + b ^ 5` whose proof is requested. -/\ndef LinearPowerInequality (a b : ℝ) : Prop :=\n a + b ≤ a ^ 5 + b ^ 5\n\n/-- The complete universal statement of the source problem.\n\nBoth `a` and `b` range over the real numbers. The nonnegativity assumptions\nand the constraint `a ^ 6 + b ^ 6 = 2` are hypotheses, and the conclusion is\n`a + b ≤ a ^ 5 + b ^ 5`. -/\ndef Target : Prop :=\n ∀ a b : ℝ, Admissible a b → LinearPowerInequality a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ccc4db2-b7cf-56ee-bc43-64dd87e99858", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "89d7efde4c2dee9a0ab4d8c69a49a95795ba53027ca4f4705211db2c187b90a7", "task_path": "tasks/nmp3_3ccc4db2-b7cf-56ee-bc43-64dd87e99858", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ccc4db2-b7cf-56ee-bc43-64dd87e99858", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3d0c801c-862d-5182-8a0a-569372f262d6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle whose angles are all less than $120^\\circ$ so that the interior Fermat (Torricelli) point $T$ exists. Let $AT$, $BT$, $CT$ meet the opposite sides $BC$, $CA$, $AB$ at $A_1$, $B_1$, $C_1$, respectively. Let $T_1$, $T_2$, $T_3$ be the reflections of $T$ across $BC$, $CA$, $AB$, respectively. Prove that the three lines $A_1T_1$, $B_1T_2$, $C_1T_3$ are concurrent.\nimport Mathlib.Geometry.Euclidean.Triangle\nimport Mathlib.Analysis.Convex.Segment\n\nnoncomputable section\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The ambient Euclidean plane. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The three vertices form a genuine (non-collinear) triangle. -/\ndef NondegenerateTriangle (A B C : Plane) : Prop :=\n AffineIndependent ℝ ![A, B, C]\n\n/-- All three interior angles of the triangle are strictly less than\n`120°`, represented by `2 * π / 3`. -/\ndef TriangleAnglesLt120 (A B C : Plane) : Prop :=\n EuclideanGeometry.angle A B C < 2 * Real.pi / 3 ∧\n EuclideanGeometry.angle B C A < 2 * Real.pi / 3 ∧\n EuclideanGeometry.angle C A B < 2 * Real.pi / 3\n\n/-- `T` lies in the strict interior of the triangle `ABC`, expressed by\nstrictly positive barycentric coordinates with sum `1`. -/\ndef StrictlyInsideTriangle (A B C T : Plane) : Prop :=\n ∃ x y z : ℝ,\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = 1 ∧\n T = x • A + y • B + z • C\n\n/-- The sum of the distances from `X` to the three vertices. -/\ndef FermatDistanceSum (A B C X : Plane) : ℝ :=\n dist X A + dist X B + dist X C\n\n/-- `T` is a Fermat point: it minimizes the sum of the distances to the\nthree vertices over the whole plane. -/\ndef IsFermatPoint (A B C T : Plane) : Prop :=\n ∀ X : Plane, FermatDistanceSum A B C T ≤ FermatDistanceSum A B C X\n\n/-- `T` is the interior Fermat (Torricelli) point of `ABC`: it is a\nFermat minimizer and lies strictly inside the triangle. -/\ndef IsInteriorFermatPoint (A B C T : Plane) : Prop :=\n StrictlyInsideTriangle A B C T ∧ IsFermatPoint A B C T\n\n/-- The full line through two points. -/\ndef sideLine (X Y : Plane) : AffineSubspace ℝ Plane :=\n affineSpan ℝ ({X, Y} : Set Plane)\n\n/-- `A₁` is the trace of the cevian from `A` through `T` on the opposite\nside `BC`: it lies both on line `AT` and on the open side segment `BC`. -/\ndef IsCevianTrace (A B C T A₁ : Plane) : Prop :=\n A₁ ∈ sideLine A T ∧ A₁ ∈ sideLine B C ∧ A₁ ∈ openSegment ℝ B C\n\n/-- `T'` is the reflection of `T` across the line through `X` and `Y`.\nThe condition says that the midpoint of `TT'` lies on the mirror line and\nthat `TT'` is perpendicular to the mirror line. -/\ndef IsReflectionAcrossSide (X Y T T' : Plane) : Prop :=\n (2⁻¹ : ℝ) • (T + T') ∈ sideLine X Y ∧\n inner ℝ (T' - T) (Y - X) = 0\n\n/-- Three affine lines are concurrent when they have a common point. -/\ndef ConcurrentLines (l₁ l₂ l₃ : AffineSubspace ℝ Plane) : Prop :=\n ∃ X : Plane, X ∈ l₁ ∧ X ∈ l₂ ∧ X ∈ l₃\n\n/-- The complete statement of the problem: for every nondegenerate triangle\nwith all angles below `120°`, for an interior Fermat point `T`, and for the\ncevian traces and reflections constructed as in the statement, the three\nlines `A₁T₁`, `B₁T₂`, and `C₁T₃` are concurrent. -/\ndef Target : Prop :=\n ∀ (A B C T : Plane),\n NondegenerateTriangle A B C →\n TriangleAnglesLt120 A B C →\n IsInteriorFermatPoint A B C T →\n ∀ (A₁ B₁ C₁ T₁ T₂ T₃ : Plane),\n IsCevianTrace A B C T A₁ →\n IsCevianTrace B C A T B₁ →\n IsCevianTrace C A B T C₁ →\n IsReflectionAcrossSide B C T T₁ →\n IsReflectionAcrossSide C A T T₂ →\n IsReflectionAcrossSide A B T T₃ →\n ConcurrentLines (sideLine A₁ T₁) (sideLine B₁ T₂) (sideLine C₁ T₃)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3d0c801c-862d-5182-8a0a-569372f262d6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "29ee996845e81b487f0439102da73efe68cd40a0c6939202b611a7e412879691", "task_path": "tasks/nmp3_3d0c801c-862d-5182-8a0a-569372f262d6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3d0c801c-862d-5182-8a0a-569372f262d6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3d2da0fe-a220-5ff2-a9b7-9b9fe81e0717", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that $a^3+b^3+c^3=10abc$. Prove that \n-- \\[\n-- (a+b+c)\\Bigl(\\frac1a+\\frac1b+\\frac1c\\Bigr)\\ge \\frac{7}{3}\\Bigl(\\frac ab+\\frac bc+\\frac ca\\Bigr).\\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The positivity hypotheses on the three variables of the problem. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The cubic constraint on the three variables of the problem. -/\ndef CubicConstraint (a b c : ℝ) : Prop :=\n a ^ 3 + b ^ 3 + c ^ 3 = (10 : ℝ) * a * b * c\n\n/-- The inequality asserted by the problem, for arbitrary real `a`, `b`, `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (a + b + c) * (1 / a + 1 / b + 1 / c) ≥\n ((7 : ℝ) / 3) * (a / b + b / c + c / a)\n\n/-- The full universal statement of the problem: for every positive real\ntriple `(a, b, c)` satisfying `a^3 + b^3 + c^3 = 10abc`, the displayed\ninequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n Positive a b c →\n CubicConstraint a b c →\n Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3d2da0fe-a220-5ff2-a9b7-9b9fe81e0717", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "be7e2e1ad5c567c2470a1abfc108e3be10a35f335bef48ca1a57309a51ee04be", "task_path": "tasks/nmp3_3d2da0fe-a220-5ff2-a9b7-9b9fe81e0717", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3d2da0fe-a220-5ff2-a9b7-9b9fe81e0717", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3d6e5626-9da6-5823-9453-3762eadeaef6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $a,b,c$,\n-- \\[\n-- \\sum_{\\text{cyc}} \\frac{a^{2}+2ab}{\\bigl(a+\\sqrt{bc}+c\\bigr)^{2}}\\ge 1.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Statement formalization\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and\n`c`, the cyclic inequality\n\n`∑_cyc (a^2 + 2ab)/(a + sqrt(b*c) + c)^2 ≥ 1`.\n\nThis file only records the mathematical statement as a proposition-valued\ndefinition. It does not assert that the proposition is true.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- One cyclic summand, with the distinguished variable first. For the input\n`(a, b, c)` this is\n`(a^2 + 2*a*b) / (a + sqrt(b*c) + c)^2`. -/\ndef cyclicTerm (a b c : ℝ) : ℝ :=\n (a ^ 2 + 2 * a * b) / (a + Real.sqrt (b * c) + c) ^ 2\n\n/-- The left-hand side of the source inequality:\n`cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b`. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The complete statement of the source problem: for all positive real numbers\n`a`, `b`, and `c`, the cyclic sum displayed above is at least `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → 1 ≤ cyclicSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3d6e5626-9da6-5823-9453-3762eadeaef6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "54917c346119d894653fb33b698795dd28f5c715f020c51e986607eba97a3ecf", "task_path": "tasks/nmp3_3d6e5626-9da6-5823-9453-3762eadeaef6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3d6e5626-9da6-5823-9453-3762eadeaef6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3d721de9-548a-5299-8777-665840a84586", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=1$ and denote $q=ab+bc+ca$. Prove that \n-- \\[\n-- \\frac{a^{2}}{b}+\\frac{b^{2}}{c}+\\frac{c^{2}}{a}\\ge\n-- \\frac{2\\bigl(27q^{4}-27q^{3}+27q^{2}-9q+1\\bigr)}{(1-2q)\\,\\bigl(9q^{2}-2q+(1-2q)\\sqrt{(1-3q)^{3}}\\bigr)}+\\frac{q^{2}-5q+1}{\\,q-2q^{2}}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic rational inequality\n\nThe original problem asks to prove an inequality for positive real numbers\n`a`, `b`, and `c` whose sum is one. The expression `q` is defined from them\nas `a*b + b*c + c*a`; it is not an additional assumption.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The symmetric quantity `q = ab + bc + ca`. -/\ndef q (a b c : ℝ) : ℝ :=\n a * b + b * c + c * a\n\n/-- The left-hand side of the proposed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a ^ 2 / b + b ^ 2 / c + c ^ 2 / a\n\n/-- The polynomial numerator `27q^4 - 27q^3 + 27q^2 - 9q + 1`. -/\ndef rhsNumerator (q : ℝ) : ℝ :=\n 27 * q ^ 4 - 27 * q ^ 3 + 27 * q ^ 2 - 9 * q + 1\n\n/-- The denominator of the first term on the right-hand side. -/\ndef rhsDenominator (q : ℝ) : ℝ :=\n (1 - 2 * q) *\n (9 * q ^ 2 - 2 * q + (1 - 2 * q) * Real.sqrt ((1 - 3 * q) ^ 3))\n\n/-- The first term on the right-hand side. -/\ndef rhsFirstTerm (q : ℝ) : ℝ :=\n 2 * rhsNumerator q / rhsDenominator q\n\n/-- The second term on the right-hand side. -/\ndef rhsSecondTerm (q : ℝ) : ℝ :=\n (q ^ 2 - 5 * q + 1) / (q - 2 * q ^ 2)\n\n/-- The complete right-hand side. -/\ndef rhs (q : ℝ) : ℝ :=\n rhsFirstTerm q + rhsSecondTerm q\n\n/-- The admissibility assumptions on `a`, `b`, and `c` from the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 1\n\n/-- The full assertion to be proved: for every positive real triple with sum one,\nthe stated inequality holds with `q = ab + bc + ca`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ rhs (q a b c)\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3d721de9-548a-5299-8777-665840a84586", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "581ac2b1436030f8ca833683b9d097a31ef2e69c79f4fde83d419aa4fa856cb3", "task_path": "tasks/nmp3_3d721de9-548a-5299-8777-665840a84586", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3d721de9-548a-5299-8777-665840a84586", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3d85ee88-58a8-5a20-a06a-1452edb80ad2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for positive integers $a,b,c$, the rational number \n-- \\[\n-- \\frac{a^2+b^2+c^2}{3(ab+bc+ca)}\n-- \\]\n-- can never be an integer.\nimport Mathlib.Data.Rat.Defs\n\n/-!\n# Formal statement for the three-variable rational expression problem\n\nFor positive integers `a`, `b`, and `c`, the rational number\n\n`(a^2 + b^2 + c^2) / (3 * (a*b + b*c + c*a))`\n\nis never an integer.\n-/\n\nnamespace Problem\n\n/-- The rational number appearing in the problem, viewed in `ℚ`.\n\nThe inputs `a`, `b`, and `c` are natural numbers. The products and sums\ninside the numerator and denominator are evaluated as rational numbers; this\nis mathematically the same as evaluating them over the integers and then\ncoercing, but keeps the displayed expression literally rational. -/\ndef ratio (a b c : ℕ) : ℚ :=\n ((a : ℚ) ^ 2 + (b : ℚ) ^ 2 + (c : ℚ) ^ 2) /\n (3 * ((a : ℚ) * (b : ℚ) + (b : ℚ) * (c : ℚ) + (c : ℚ) * (a : ℚ)))\n\n/-- A rational number is an integer when it is the image of some integer. -/\ndef IsInteger (q : ℚ) : Prop :=\n ∃ z : ℤ, q = (z : ℚ)\n\n/-- The assertion to be proved: for every triple of positive natural numbers,\nthe displayed rational number is not an integer. -/\ndef Target : Prop :=\n ∀ a b c : ℕ, 0 < a → 0 < b → 0 < c →\n ¬ IsInteger (ratio a b c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3d85ee88-58a8-5a20-a06a-1452edb80ad2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f23187a61c7cb5e55b76851da99d59ec4485d024149166fa2715ed0604b48304", "task_path": "tasks/nmp3_3d85ee88-58a8-5a20-a06a-1452edb80ad2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3d85ee88-58a8-5a20-a06a-1452edb80ad2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3da66417-436b-562e-97f7-0bb846f2df76", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Each integer is colored with one of three colors. Prove that there exist two distinct integers of the same color whose difference is a perfect square (i.e., a positive integer of the form $n^2$ for some $n\\in\\mathbb Z$).\nimport Mathlib\n\n/-!\n# Three-colorings of the integers and monochromatic square differences\n\nThis file formalizes the statement of the problem. It deliberately contains no\nproof of the target proposition.\n-/\n\nnamespace Problem\n\n/-- A coloring of every integer with one of three colors.\n\nThe codomain `Fin 3` supplies exactly three labeled colors. No surjectivity\ncondition is imposed: a coloring need not use all three colors. -/\ndef ThreeColoring : Type := ℤ → Fin 3\n\n/-- An integer `d` is a positive perfect square when it is the square of some\ninteger and is positive. The positivity condition excludes the square `0`. -/\ndef IsPositiveSquare (d : ℤ) : Prop :=\n ∃ n : ℤ, 0 < n ^ 2 ∧ d = n ^ 2\n\n/-- A coloring has a monochromatic pair whose (oriented) difference is a\npositive perfect square.\n\nThe pair is ordered, so `x - y` being a positive square is the same as saying\nthat the larger of the two distinct integers minus the smaller one is a\npositive perfect square. -/\ndef HasMonochromeSquareDifference (c : ThreeColoring) : Prop :=\n ∃ x : ℤ, ∃ y : ℤ,\n x ≠ y ∧ c x = c y ∧ IsPositiveSquare (x - y)\n\n/-- Every three-coloring of the integers has two distinct integers of the same\ncolor whose difference is a positive perfect square. -/\ndef Target : Prop :=\n ∀ c : ThreeColoring, HasMonochromeSquareDifference c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3da66417-436b-562e-97f7-0bb846f2df76", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "992503fb52dc3d1679389fa755cd06c35bfb68f9526188d8736ddaccdae87346", "task_path": "tasks/nmp3_3da66417-436b-562e-97f7-0bb846f2df76", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3da66417-436b-562e-97f7-0bb846f2df76", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3dc15faa-c83b-5861-88f0-30cb35b87944", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exist infinitely many positive integers $n$ such that $\\displaystyle\\frac{4^n+2^n+1}{\\,n^2+n+1\\,}$ is a positive integer.\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nThere exist infinitely many positive integers `n` such that\n`(4 ^ n + 2 ^ n + 1) / (n ^ 2 + n + 1)` is a positive integer.\n\nThe quotient being a positive integer is expressed as the existence of a\npositive natural number `k` with\n`4 ^ n + 2 ^ n + 1 = k * (n ^ 2 + n + 1)`.\nThis is exact integrality, not Lean's truncating natural-number division.\nFor positive `n` the denominator is positive, so the equation is equivalent\nto the displayed rational quotient equaling `k`.\n-/\n\nnamespace Problem\n\n/-- The numerator `4 ^ n + 2 ^ n + 1` of the displayed fraction. -/\ndef numerator (n : ℕ) : ℕ :=\n 4 ^ n + 2 ^ n + 1\n\n/-- The denominator `n ^ 2 + n + 1` of the displayed fraction. -/\ndef denominator (n : ℕ) : ℕ :=\n n ^ 2 + n + 1\n\n/--\n`n` is an admissible value precisely when `n` is a positive integer and the\ndisplayed fraction is a positive integer. Since all quantities are natural\nnumbers, the latter is represented by an exact quotient with a positive\nnatural-number witness.\n-/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧ ∃ k : ℕ, 0 < k ∧ numerator n = k * denominator n\n\n/--\nThe problem assertion: the set of admissible positive integers is infinite.\n-/\ndef Target : Prop :=\n Set.Infinite {n : ℕ | Admissible n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3dc15faa-c83b-5861-88f0-30cb35b87944", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e30aa59928804de82b837163467345d528fe89dedb64e47b1e4b90e343f02be3", "task_path": "tasks/nmp3_3dc15faa-c83b-5861-88f0-30cb35b87944", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3dc15faa-c83b-5861-88f0-30cb35b87944", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3df2cfdb-270e-5d56-a0c1-799e9145ff9d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for any convex quadrilateral $Q$ with area $1$, there exists a rectangle $R$ of area $2$ that contains $Q$ (i.e., $Q$ can be drawn inside $R$).\nimport Mathlib.Analysis.Convex.Hull\nimport Mathlib.MeasureTheory.Measure.Lebesgue.Basic\n\n/-!\n# A convex quadrilateral of area one fits in a rectangle of area two\n\nThis file formally states the problem. The Euclidean plane is represented by\n`ℝ × ℝ`, equipped with the product Lebesgue measure. Areas are two-dimensional\nLebesgue measures. A\nrectangle is represented by its four vertices generated from a centre and two\nnon-zero perpendicular half-side vectors. A convex quadrilateral is the convex\nhull of four distinct vertices appearing in a strictly convex cyclic order.\n-/\n\nnoncomputable section\n\nopen Set\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- The Euclidean dot product of two planar vectors. -/\ndef dot (u v : Point) : ℝ :=\n u.1 * v.1 + u.2 * v.2\n\n/-- The signed two-dimensional cross product (or determinant) of two vectors. -/\ndef cross (u v : Point) : ℝ :=\n u.1 * v.2 - u.2 * v.1\n\n/-- The area (two-dimensional Lebesgue measure) of a planar set equals `A`. -/\ndef HasArea (S : Set Point) (A : ℝ) : Prop :=\n MeasureTheory.volume S = ENNReal.ofReal A\n\n/-- Four distinct points occur as the successive vertices of a strictly convex\nquadrilateral, with a consistent orientation around the boundary. -/\ndef IsStrictlyConvexVertexCycle (p : Fin 4 → Point) : Prop :=\n Function.Injective p ∧\n ((∀ i : Fin 4,\n 0 < cross (p (i + 1) - p i) (p (i + 2) - p (i + 1))) ∨\n (∀ i : Fin 4,\n cross (p (i + 1) - p i) (p (i + 2) - p (i + 1)) < 0))\n\n/-- A convex quadrilateral is a convex planar region that is the convex hull of\nfour vertices in strict cyclic convex position. -/\ndef IsConvexQuadrilateral (Q : Set Point) : Prop :=\n Convex ℝ Q ∧\n ∃ p : Fin 4 → Point,\n IsStrictlyConvexVertexCycle p ∧ Q = convexHull ℝ (Set.range p)\n\n/-- A rectangle is the convex hull of four corners `c + u + v`, `c - u + v`,\n`c - u - v`, and `c + u - v`, where `u` and `v` are non-zero perpendicular\nhalf-side vectors. -/\ndef IsRectangle (R : Set Point) : Prop :=\n ∃ c u v : Point,\n u ≠ 0 ∧ v ≠ 0 ∧ dot u v = 0 ∧\n R = convexHull ℝ\n ({c + u + v, c - u + v, c - u - v, c + u - v} : Set Point)\n\n/-- The assertion of the problem: every convex quadrilateral of area `1` is\ncontained in a rectangle of area `2`. -/\ndef Target : Prop :=\n ∀ Q : Set Point,\n IsConvexQuadrilateral Q →\n HasArea Q 1 →\n ∃ R : Set Point,\n IsRectangle R ∧ HasArea R 2 ∧ Q ⊆ R\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3df2cfdb-270e-5d56-a0c1-799e9145ff9d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3c3f4b25b01ac170a6ccc5d1ea5c64669b3ed3301a69398b78d0a26fb0a6f805", "task_path": "tasks/nmp3_3df2cfdb-270e-5d56-a0c1-799e9145ff9d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3df2cfdb-270e-5d56-a0c1-799e9145ff9d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3e4d8d52-e319-5b4c-9f09-1593833485ef", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ satisfy \n-- \\[\n-- \\frac1{a+1}+\\frac1{b+1}+\\frac1{c+1}+\\frac1{d+1}=3.\n-- \\] \n-- Prove that \n-- \\[\n-- \\sqrt[3]{abc}+\\sqrt[3]{bcd}+\\sqrt[3]{cda}+\\sqrt[3]{dab}\\le\\frac43.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the four-variable inequality problem\n\nThe original problem asks to prove an inequality for four positive real numbers\nsatisfying a reciprocal-sum constraint. The statement below records that\nuniversally quantified implication as a `Prop`-valued definition; no proof of\nthe inequality is supplied.\n-/\n\nnamespace Problem\n\n/-- The real cube-root expression used in the problem.\n\nFor the nonnegative arguments occurring in `Problem.Target`, this is the usual\nnonnegative real cube root, represented here by the real power with exponent\n`1 / 3`. -/\nnoncomputable def CubeRoot (x : ℝ) : ℝ :=\n x ^ (1 / 3 : ℝ)\n\n/-- The reciprocal-sum hypothesis. -/\ndef Constraint (a b c d : ℝ) : Prop :=\n 1 / (a + 1) + 1 / (b + 1) + 1 / (c + 1) + 1 / (d + 1) = 3\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def LHS (a b c d : ℝ) : ℝ :=\n CubeRoot (a * b * c) +\n CubeRoot (b * c * d) +\n CubeRoot (c * d * a) +\n CubeRoot (d * a * b)\n\n/-- The assertion to be proved: for all positive real `a`, `b`, `c`, and `d`\nsatisfying the reciprocal-sum constraint, the sum of the four cube roots is at\nmost `4 / 3`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d →\n Constraint a b c d →\n LHS a b c d ≤ 4 / 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3e4d8d52-e319-5b4c-9f09-1593833485ef", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "927f5cf83c60097c9cfebe138bd9809bfb93c933a70469a8db0599004bce9866", "task_path": "tasks/nmp3_3e4d8d52-e319-5b4c-9f09-1593833485ef", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3e4d8d52-e319-5b4c-9f09-1593833485ef", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3e7945d0-552b-5b90-802f-c0c8bd94c69a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In triangle $ABC$, the incircle touches $AB$ at $F$ and $AC$ at $E$. Let $D=BE\\cap CF$. Let $P$ be the midpoint of $EF$. Let $Q$ be the point on the extension of $FB$ beyond $B$ such that $QB=FB$, and let $R$ be the point on the extension of $EC$ beyond $C$ such that $RC=EC$. Prove that $PD\\perp QR\\,$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Incenter.Basic\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- A point of the Euclidean plane. -/\nabbrev PlanePoint : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A nondegenerate ordered triangle in the Euclidean plane. -/\nabbrev Triangle : Type := Affine.Triangle ℝ PlanePoint\n\n/-- The vertex `A` of a triangle. -/\ndef vertexA (t : Triangle) : PlanePoint :=\n t.points 0\n\n/-- The vertex `B` of a triangle. -/\ndef vertexB (t : Triangle) : PlanePoint :=\n t.points 1\n\n/-- The vertex `C` of a triangle. -/\ndef vertexC (t : Triangle) : PlanePoint :=\n t.points 2\n\n/-- The incircle of the triangle, represented by the insphere of its two-simplex. -/\ndef incircle (t : Triangle) : EuclideanGeometry.Sphere PlanePoint :=\n t.insphere\n\n/-- The incenter of the triangle, the center of its incircle. -/\ndef incenter (t : Triangle) : PlanePoint :=\n (incircle t).center\n\n/-- The affine line through the vertices `A` and `B`. -/\ndef lineAB (t : Triangle) : AffineSubspace ℝ PlanePoint :=\n line[ℝ, vertexA t, vertexB t]\n\n/-- The affine line through the vertices `A` and `C`. -/\ndef lineAC (t : Triangle) : AffineSubspace ℝ PlanePoint :=\n line[ℝ, vertexA t, vertexC t]\n\ninstance lineAB_nonempty (t : Triangle) : Nonempty (lineAB t) :=\n ⟨⟨vertexA t, left_mem_affineSpan_pair ℝ (vertexA t) (vertexB t)⟩⟩\n\ninstance lineAC_nonempty (t : Triangle) : Nonempty (lineAC t) :=\n ⟨⟨vertexA t, left_mem_affineSpan_pair ℝ (vertexA t) (vertexC t)⟩⟩\n\n/-- The touchpoint of the incircle on the side `AC`, obtained as the orthogonal projection of\nthe incircle's center onto the line `AC`. -/\ndef touchpointAC (t : Triangle) : PlanePoint :=\n (EuclideanGeometry.orthogonalProjection (lineAC t) (incenter t) : PlanePoint)\n\n/-- The touchpoint of the incircle on the side `AB`, obtained as the orthogonal projection of\nthe incircle's center onto the line `AB`. -/\ndef touchpointAB (t : Triangle) : PlanePoint :=\n (EuclideanGeometry.orthogonalProjection (lineAB t) (incenter t) : PlanePoint)\n\n/-- The midpoint of the two incircle touchpoints `E` and `F`. -/\ndef midpointEF (t : Triangle) : PlanePoint :=\n midpoint ℝ (touchpointAC t) (touchpointAB t)\n\n/-- `D` lies on both of the lines `BE` and `CF`. -/\ndef IsIntersectionBE_CF (t : Triangle) (D : PlanePoint) : Prop :=\n D ∈ line[ℝ, vertexB t, touchpointAC t] ∧\n D ∈ line[ℝ, vertexC t, touchpointAB t]\n\n/-- `Q` lies on the extension of `FB` beyond `B` and satisfies `QB = FB`. -/\ndef IsExtensionFB (t : Triangle) (Q : PlanePoint) : Prop :=\n Sbtw ℝ (touchpointAB t) (vertexB t) Q ∧\n dist Q (vertexB t) = dist (touchpointAB t) (vertexB t)\n\n/-- `R` lies on the extension of `EC` beyond `C` and satisfies `RC = EC`. -/\ndef IsExtensionEC (t : Triangle) (R : PlanePoint) : Prop :=\n Sbtw ℝ (touchpointAC t) (vertexC t) R ∧\n dist R (vertexC t) = dist (touchpointAC t) (vertexC t)\n\n/-- The line through the first two points is perpendicular to the line through the last two.\nThe distinctness conditions make explicit that each pair determines a genuine line; the final\ncondition is that their direction vectors have zero inner product. -/\ndef LinePerpendicular (a b c d : PlanePoint) : Prop :=\n a ≠ b ∧ c ≠ d ∧ ⟪b -ᵥ a, d -ᵥ c⟫ = 0\n\n/-- The main statement: in any triangle, with `D` the intersection of `BE` and `CF`,\n`Q` the point beyond `B` on `FB` with `QB = FB`, and `R` the point beyond `C` on `EC`\nwith `RC = EC`, the line `PD` is perpendicular to `QR`, where `P` is the midpoint of `EF`. -/\ndef Target : Prop :=\n ∀ t : Triangle,\n (∃! D : PlanePoint, IsIntersectionBE_CF t D) ∧\n (∃! Q : PlanePoint, IsExtensionFB t Q) ∧\n (∃! R : PlanePoint, IsExtensionEC t R) ∧\n ∀ D Q R : PlanePoint,\n IsIntersectionBE_CF t D →\n IsExtensionFB t Q →\n IsExtensionEC t R →\n LinePerpendicular (midpointEF t) D Q R\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3e7945d0-552b-5b90-802f-c0c8bd94c69a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7c0893a66c3d473281c51be5c7d92dbaef19d4e848ed18663595fed27c14ea16", "task_path": "tasks/nmp3_3e7945d0-552b-5b90-802f-c0c8bd94c69a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3e7945d0-552b-5b90-802f-c0c8bd94c69a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3e799ea6-4908-5ebf-8f8f-361224bc85ea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a rhombus with $\\angle BAD = 60^\\circ$. Points $S$ and $R$ are chosen inside triangles $ABD$ and $DBC$, respectively, such that $\\angle SBR = \\angle RDS = 60^\\circ$. Prove that \n-- $$SR^2 \\ge AS\\cdot CR.$$\nimport Mathlib.Analysis.Convex.Hull\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used for all points in the problem. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The ordered quadrilateral `A B C D` is a nondegenerate rhombus.\n\nConcretely, `A + C = B + D` expresses that the diagonals bisect one another,\nso the vertices form a parallelogram in the order `A, B, C, D`. The chain of\nequalities says that all four sides have the same length, and `0 < dist A B`\nexcludes the degenerate case of zero side length. The angle condition from\nthe problem is stated separately in `Target`. -/\ndef IsRhombus (A B C D : Plane) : Prop :=\n A + C = B + D ∧\n dist A B = dist B C ∧\n dist B C = dist C D ∧\n dist C D = dist D A ∧\n 0 < dist A B\n\n/-- `P` lies strictly inside the triangle with vertices `X`, `Y`, and `Z`.\n\nThe interior is the topological interior in the ambient Euclidean plane, hence\npoints on the three sides of the triangle are not included. -/\ndef IsStrictlyInsideTriangle (P X Y Z : Plane) : Prop :=\n P ∈ interior (convexHull ℝ ({X, Y, Z} : Set Plane))\n\n/-- The (unoriented) angle `∠ P Q R` is `60°`, represented in radians. -/\ndef AngleIsSixtyDegrees (P Q R : Plane) : Prop :=\n EuclideanGeometry.angle P Q R = Real.pi / 3\n\n/-- The assertion to be proved.\n\nFor every nondegenerate rhombus `ABCD` with `∠ BAD = 60°`, and every `S` and\n`R` chosen strictly inside triangles `ABD` and `DBC`, respectively, if both\n`∠ SBR` and `∠ RDS` are `60°`, then `SR² ≥ AS * CR`. Here distances are\nEuclidean lengths, so `SR²` is the square of the distance from `S` to `R`, and\n`AS * CR` is the product of the two side lengths. -/\ndef Target : Prop :=\n ∀ A B C D : Plane,\n IsRhombus A B C D →\n AngleIsSixtyDegrees B A D →\n ∀ S R : Plane,\n IsStrictlyInsideTriangle S A B D →\n IsStrictlyInsideTriangle R D B C →\n AngleIsSixtyDegrees S B R →\n AngleIsSixtyDegrees R D S →\n dist S R ^ 2 ≥ dist A S * dist C R\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3e799ea6-4908-5ebf-8f8f-361224bc85ea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a800f4502a3ef926353d4b9df9b0cddfb81ea4fbe27f2fc42c511944cc88f743", "task_path": "tasks/nmp3_3e799ea6-4908-5ebf-8f8f-361224bc85ea", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3e799ea6-4908-5ebf-8f8f-361224bc85ea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3e8e9f39-9ada-5adf-9342-edf418ee570a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a^3+b^3+c^3=3$. Prove that \n-- \\[\n-- \\frac{1}{a+b}+\\frac{1}{b+c}+\\frac{1}{c+a}+\\frac{abc}{3}\\ge\\frac{11}{6}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe source problem asks us to prove the following implication for all positive\nreal numbers `a`, `b`, and `c`: if `a^3 + b^3 + c^3 = 3`, then\n`1/(a+b) + 1/(b+c) + 1/(c+a) + abc/3 >= 11/6`.\n\nThis file declares the statement only. In particular, `Problem.Target` is a\nproposition, not a proof of that proposition.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypotheses in the source problem, for real numbers\n`a`, `b`, and `c`: all three are positive and their cubes sum to `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 3 + b ^ 3 + c ^ 3 = (3 : ℝ)\n\n/-- The left-hand side of the required inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (1 : ℝ) / (a + b) + (1 : ℝ) / (b + c) + (1 : ℝ) / (c + a) +\n (a * b * c) / (3 : ℝ)\n\n/-- The assertion to be proved: for every triple of positive real numbers with\ncube sum `3`, the left-hand side is at least `11/6`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → LHS a b c ≥ (11 : ℝ) / (6 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3e8e9f39-9ada-5adf-9342-edf418ee570a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c27ab1ad31f8b986d1aaebd1f69a454f9348586566152a34ff68651295b482c6", "task_path": "tasks/nmp3_3e8e9f39-9ada-5adf-9342-edf418ee570a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3e8e9f39-9ada-5adf-9342-edf418ee570a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3e9e9a90-11ab-5d6d-b6be-60713b54399a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer and let $x_1,x_2,\\dots,x_n>0$ satisfy $x_1x_2\\cdots x_n=1$. Prove that \n-- \\[\n-- \\sum_{k=1}^n\\frac{1}{\\,n-1+x_k\\,}\\le 1.\n-- \\]\nimport Mathlib\n\n/-!\n# A formal statement of the finite-product reciprocal inequality\n\nThe source problem asks us to prove the following assertion. Let `n` be a\npositive integer and let `x₁, …, xₙ` be positive real numbers whose product\nis one. Then\n`∑_{k=1}^n 1 / (n - 1 + xₖ) ≤ 1`.\n\nThe index `k = 1, …, n` is represented by `Fin n`, whose elements are\n`0, …, n-1`. This is only a zero-based reindexing of the same finite sum\nand finite product.\n-/\n\nnamespace Problem\n\nopen scoped BigOperators\n\n/-- The assertion that the natural-number index `n` is positive. -/\ndef PositiveIndex (n : ℕ) : Prop :=\n 0 < n\n\n/-- Every entry in the family indexed by `Fin n` is strictly positive. -/\ndef PositiveEntries (n : ℕ) (x : Fin n → ℝ) : Prop :=\n ∀ k : Fin n, 0 < x k\n\n/-- The product of all entries in the family indexed by `Fin n` is one. -/\ndef ProductOne (n : ℕ) (x : Fin n → ℝ) : Prop :=\n (∏ k : Fin n, x k) = 1\n\n/-- The left-hand side of the asserted inequality. The division is real\ndivision, and the denominator `n - 1 + xₖ` is viewed in the reals. -/\nnoncomputable def lhs (n : ℕ) (x : Fin n → ℝ) : ℝ :=\n ∑ k : Fin n, (1 : ℝ) / ((n : ℝ) - 1 + x k)\n\n/-- The inequality that is the conclusion of the source problem. -/\ndef Claim (n : ℕ) (x : Fin n → ℝ) : Prop :=\n lhs n x ≤ 1\n\n/-- The exact universal proposition to be proved, with the hypotheses in the\nsame order as in the source: first `n` is positive, then the entries are\npositive, and then their product is one. -/\ndef Target : Prop :=\n ∀ (n : ℕ), PositiveIndex n → ∀ (x : Fin n → ℝ),\n PositiveEntries n x → ProductOne n x → Claim n x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3e9e9a90-11ab-5d6d-b6be-60713b54399a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "93be1d12014f6c323f9bb1890e04c6cd9a97ccb00fc4a18e966abddb25633ae1", "task_path": "tasks/nmp3_3e9e9a90-11ab-5d6d-b6be-60713b54399a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3e9e9a90-11ab-5d6d-b6be-60713b54399a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3eb71c2b-245b-5cfb-95db-52c41bc2b741", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $x,y,z>0$ satisfy $x^{5}+y^{5}+z^{5}=3$. Prove that \n-- \\[\n-- \\frac{x^{4}}{y^{3}}+\\frac{y^{4}}{z^{3}}+\\frac{z^{4}}{x^{3}}\\ge 3.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the cyclic inequality\n\nThe source problem asks to prove, in the positive real numbers, that\n`x ^ 5 + y ^ 5 + z ^ 5 = 3` implies\n`x ^ 4 / y ^ 3 + y ^ 4 / z ^ 3 + z ^ 4 / x ^ 3 ≥ 3`.\n-/\n\nnamespace Problem\n\n/-- The three variables are strictly positive. -/\ndef PositiveTriple (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The fifth powers of the three variables sum to the real number `3`. -/\ndef FifthPowerSumEqThree (x y z : ℝ) : Prop :=\n x ^ (5 : ℕ) + y ^ (5 : ℕ) + z ^ (5 : ℕ) = (3 : ℝ)\n\n/-- The hypotheses of the problem, specialized to the real numbers.\n\nThe components state, in order, that `x`, `y`, and `z` are positive and\nthat the sum of their fifth powers is `3`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n PositiveTriple x y z ∧ FifthPowerSumEqThree x y z\n\n/-- The left-hand side of the desired cyclic inequality. -/\nnoncomputable def CyclicRatioSum (x y z : ℝ) : ℝ :=\n x ^ (4 : ℕ) / y ^ (3 : ℕ) +\n y ^ (4 : ℕ) / z ^ (3 : ℕ) +\n z ^ (4 : ℕ) / x ^ (3 : ℕ)\n\n/-- The desired non-strict lower bound, stated as a predicate on a triple. -/\ndef InequalityHolds (x y z : ℝ) : Prop :=\n (3 : ℝ) ≤ CyclicRatioSum x y z\n\n/-- The proposition requested by the problem: for every triple of positive\nreal numbers whose fifth powers sum to `3`, the cyclic ratio sum is at least\n`3`. -/\ndef Target : Prop :=\n ∀ (x y z : ℝ), Admissible x y z → InequalityHolds x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3eb71c2b-245b-5cfb-95db-52c41bc2b741", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e91e796a3178efebc4c0d71af0fb83a9d74c762805ad3a606183839b53ae0266", "task_path": "tasks/nmp3_3eb71c2b-245b-5cfb-95db-52c41bc2b741", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3eb71c2b-245b-5cfb-95db-52c41bc2b741", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3ebfb1ca-c882-583f-af42-7cb5407ca541", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ and $(a+b)(b+c)(c+a)=10$. Prove that \n-- \\[\n-- (a^2+b^2)(b^2+c^2)(c^2+a^2)+12a^2b^2c^2\\ge 30\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a positive-real inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nsuitable for the displayed expressions, that\n\n`(a²+b²)(b²+c²)(c²+a²) + 12a²b²c² ≥ 30`\n\nwhenever `(a+b)(b+c)(c+a) = 10`.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions in the source problem: `a`, `b`, and `c` are\npositive real numbers and satisfy `(a+b)(b+c)(c+a) = 10`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n (a + b) * (b + c) * (c + a) = 10\n\n/-- The expression on the left-hand side of the source inequality. -/\ndef InequalityLHS (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2) * (b ^ 2 + c ^ 2) * (c ^ 2 + a ^ 2) +\n 12 * a ^ 2 * b ^ 2 * c ^ 2\n\n/-- The conclusion asserted for every admissible triple. -/\ndef InequalityClaim (a b c : ℝ) : Prop :=\n 30 ≤ InequalityLHS a b c\n\n/-- The complete quantified assertion of the source problem: for every triple\nof positive real numbers satisfying `(a+b)(b+c)(c+a) = 10`, the displayed\ninequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → InequalityClaim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ebfb1ca-c882-583f-af42-7cb5407ca541", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "84702aaac58b754ce5c065f0e5f82fd08a2745c63b2fc721a14a2a827863ce63", "task_path": "tasks/nmp3_3ebfb1ca-c882-583f-af42-7cb5407ca541", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ebfb1ca-c882-583f-af42-7cb5407ca541", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3ec6baff-9835-5a63-bea8-5e513f7250f6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb N\\to\\mathbb N$ be a bijection. Prove that there exist positive integers $a$ and $d$ such that \n-- $$a c x ≠ c y, by\n intro x y\n exact propext ne_comm⟩\n\n/-- The remaining segments whose endpoints receive different colors. -/\nnoncomputable def bichromaticSegments (G : SimpleGraph PolygonVertex)\n (c : TwoColoring) : Finset (Sym2 PolygonVertex) := by\n classical\n exact (remainingSegments G).filter (EdgeBichromatic c)\n\n/-- The number of remaining segments whose endpoints receive different\ncolors. -/\nnoncomputable def bichromaticCount (G : SimpleGraph PolygonVertex)\n (c : TwoColoring) : ℕ :=\n (bichromaticSegments G c).card\n\n/-- A coloring has at least 3/5 of the remaining segments bichromatic. The\nfraction is expressed by the equivalent natural-number inequality\n`3 * remainingCount G ≤ 5 * bichromaticCount G c`. -/\ndef AtLeastThreeFifthsBichromatic (G : SimpleGraph PolygonVertex)\n (c : TwoColoring) : Prop :=\n 3 * remainingCount G ≤ 5 * bichromaticCount G c\n\n/-- There exists a two-coloring of the vertices for which at least 3/5 of the\nremaining segments have endpoints of different colors. -/\ndef HasGoodTwoColoring (G : SimpleGraph PolygonVertex) : Prop :=\n ∃ c : TwoColoring, AtLeastThreeFifthsBichromatic G c\n\n/-- The complete proposition stated by the problem. For every graph obtained\nby removing sides and diagonals from the fully drawn regular 2004-gon, if\nevery vertex has remaining degree at most five, then there is a two-coloring\nwith at least 3/5 of the remaining segments having differently colored\nendpoints. -/\ndef Target : Prop :=\n ∀ G : SimpleGraph PolygonVertex,\n ObtainedByRemovingDrawnSegments G →\n AtMostFiveRemainingIncident G →\n HasGoodTwoColoring G\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3f173bac-a293-57f4-a784-f684860e8f96", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1b50f506d9db6496555c4029e0dcd7e21ead1b12d84d63ae65d273777c510468", "task_path": "tasks/nmp3_3f173bac-a293-57f4-a784-f684860e8f96", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3f173bac-a293-57f4-a784-f684860e8f96", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3f26c630-50c4-5520-a150-1eb7b070074a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_0$ be an integer greater than $1$ and define the sequence recursively by $a_{n+1}=2^{a_n}-1$ for $n\\ge0$. Prove that the set of prime numbers that divide at least one term of the sequence $\\{a_n\\}_{n\\ge0}$ is infinite.\nimport Mathlib\n\n/-!\n# Formalization of the prime-divisor statement\n\nThe source says that `a₀` is an integer greater than `1`, and that the\ninteger sequence is defined recursively by `aₙ₊₁ = 2^(aₙ) - 1`.\n\nThe terms are expected to be nonnegative integers. Since Lean's exponent\nnotation for integers takes a natural exponent, the supporting definition\nbelow uses `Int.toNat` for the exponent. Under the stated initial condition\nthe terms are positive, so this is exactly the source recurrence wherever\nthat recurrence is used.\n-/\n\nnamespace Problem\n\n/-- One step of the recursive sequence, as a map on integers. -/\ndef nextTerm (x : ℤ) : ℤ :=\n (2 : ℤ) ^ x.toNat - 1\n\n/-- The recursively defined sequence with initial value `a₀`. -/\ndef sequence (a₀ : ℤ) : ℕ → ℤ\n | 0 => a₀\n | n + 1 => nextTerm (sequence a₀ n)\n\n@[simp] lemma sequence_zero (a₀ : ℤ) :\n sequence a₀ 0 = a₀ := rfl\n\n@[simp] lemma sequence_succ (a₀ : ℤ) (n : ℕ) :\n sequence a₀ (n + 1) = nextTerm (sequence a₀ n) := rfl\n\n/-- Under the source condition `1 < a₀`, every term is greater than one.\nThis justifies representing the integer exponent by its natural value. -/\nlemma one_lt_sequence {a₀ : ℤ} (ha₀ : 1 < a₀) (n : ℕ) :\n 1 < sequence a₀ n := by\n induction n with\n | zero => simpa using ha₀\n | succ n ih =>\n rw [sequence_succ]\n unfold nextTerm\n have hpos : 0 ≤ sequence a₀ n := by omega\n have htwo : 2 ≤ (sequence a₀ n).toNat := by omega\n have hpow : (2 : ℤ) ^ 2 ≤ (2 : ℤ) ^ (sequence a₀ n).toNat := by\n exact pow_le_pow_right₀ (by norm_num) htwo\n norm_num at hpow\n omega\n\n/-- For an admissible initial value, the natural representative used as the\nLean exponent is exactly the corresponding positive integer term. -/\nlemma sequence_toNat_cast_eq {a₀ : ℤ} (ha₀ : 1 < a₀) (n : ℕ) :\n ((sequence a₀ n).toNat : ℤ) = sequence a₀ n := by\n exact Int.toNat_of_nonneg (by\n have h := one_lt_sequence ha₀ n\n omega)\n\n/-- A prime number divides at least one term of the sequence. -/\ndef DividesSomeTerm (a₀ : ℤ) (p : ℕ) : Prop :=\n p.Prime ∧ ∃ n : ℕ, (p : ℤ) ∣ sequence a₀ n\n\n/-- The set of prime numbers that divide at least one term of the sequence. -/\ndef PrimeDivisorsOfSequence (a₀ : ℤ) : Set ℕ :=\n {p : ℕ | DividesSomeTerm a₀ p}\n\n/--\nFor every integer initial value `a₀ > 1`, the set of prime numbers dividing\nat least one term of the recursively defined sequence is infinite.\n-/\ndef Target : Prop :=\n ∀ a₀ : ℤ, 1 < a₀ → (PrimeDivisorsOfSequence a₀).Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3f26c630-50c4-5520-a150-1eb7b070074a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "71fa5efd4391b65c5075744294aa1344c10fd1b4af049a383e94bc223997f4f2", "task_path": "tasks/nmp3_3f26c630-50c4-5520-a150-1eb7b070074a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3f26c630-50c4-5520-a150-1eb7b070074a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3f5c9741-eca7-536f-a476-1bc326aa51dd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute triangle with orthocenter $H$ and circumcenter $O$. Let $S$ and $T$ be the feet of the altitudes from $B$ onto $AC$ and from $C$ onto $AB$, respectively. Let $M$ be the midpoint of $ST$ and let $N$ be the midpoint of $AH$. Draw the line through $O$ parallel to $BC$; it meets $AC$ at $F$ and $AB$ at $G$. Let $K$ be the second intersection of line $NG$ with the circumcircle of $BGO$, and let $L$ be the second intersection of line $NF$ with the circumcircle of $CFO$. Prove that $\\triangle BCM\\sim\\triangle KLN$.\nimport Mathlib\n\n/-!\n# Formalization of the problem in `problem.md`\n\nThe ambient plane is represented by `ℝ × ℝ` with its usual Euclidean\ninner product. All geometric objects in the problem are points of this\nplane. The declarations below give the hypotheses of the construction\nand the proposition to be proved; no proof of the target is supplied.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A point of the Euclidean plane. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- Difference of two points, regarded as a displacement vector. -/\ndef sub (P Q : Point) : Point :=\n (P.1 - Q.1, P.2 - Q.2)\n\n/-- The Euclidean dot product of two displacement vectors. -/\ndef dot (u v : Point) : ℝ :=\n u.1 * v.1 + u.2 * v.2\n\n/-- The two-dimensional scalar cross product. -/\ndef cross (u v : Point) : ℝ :=\n u.1 * v.2 - u.2 * v.1\n\n/-- Squared Euclidean distance between two points. -/\ndef sqDist (P Q : Point) : ℝ :=\n dot (sub P Q) (sub P Q)\n\n/-- Euclidean distance between two points. -/\ndef dist (P Q : Point) : ℝ :=\n Real.sqrt (sqDist P Q)\n\n/-- The midpoint of two points. -/\ndef midpoint (P Q : Point) : Point :=\n ((P.1 + Q.1) / 2, (P.2 + Q.2) / 2)\n\n/-- Three points are collinear. -/\ndef Collinear (P Q R : Point) : Prop :=\n cross (sub Q P) (sub R P) = 0\n\n/-- Three points are not collinear. -/\ndef Noncollinear (P Q R : Point) : Prop :=\n ¬ Collinear P Q R\n\n/-- `X` lies on the line determined by `P` and `Q`. -/\ndef OnLine (P Q X : Point) : Prop :=\n Collinear P Q X\n\n/-- The line through `P` and `Q` is parallel to the line through `R` and `S`. -/\ndef ParallelLines (P Q R S : Point) : Prop :=\n cross (sub Q P) (sub S R) = 0\n\n/-- The line through `P` and `Q` is perpendicular to the line through `R` and `S`. -/\ndef PerpendicularLines (P Q R S : Point) : Prop :=\n dot (sub Q P) (sub S R) = 0\n\n/-- `A`, `B`, `C` form a nondegenerate acute triangle. -/\ndef IsAcuteTriangle (A B C : Point) : Prop :=\n Noncollinear A B C ∧\n 0 < dot (sub B A) (sub C A) ∧\n 0 < dot (sub A B) (sub C B) ∧\n 0 < dot (sub A C) (sub B C)\n\n/-- `H` is the orthocenter of triangle `ABC`. -/\ndef IsOrthocenter (A B C H : Point) : Prop :=\n PerpendicularLines A H B C ∧\n PerpendicularLines B H C A ∧\n PerpendicularLines C H A B\n\n/-- `O` is the circumcenter of triangle `ABC`. -/\ndef IsCircumcenter (O A B C : Point) : Prop :=\n sqDist O A = sqDist O B ∧ sqDist O B = sqDist O C\n\n/-- `S` is the foot of the perpendicular from `P` to the line through `X` and `Y`. -/\ndef IsFoot (P X Y S : Point) : Prop :=\n OnLine X Y S ∧ PerpendicularLines P S X Y\n\n/-- `M` is the midpoint of `P` and `Q`. -/\ndef IsMidpoint (M P Q : Point) : Prop :=\n M = midpoint P Q\n\n/-- Four points lie on one (genuine) circle. This is used to express membership\nin the circumcircle of three noncollinear points without choosing its center. -/\ndef OnCircumcircle (X P Q R : Point) : Prop :=\n ∃ center : Point, ∃ radius : ℝ,\n 0 < radius ∧\n sqDist center P = radius ^ 2 ∧\n sqDist center Q = radius ^ 2 ∧\n sqDist center R = radius ^ 2 ∧\n sqDist center X = radius ^ 2\n\n/-- `Second` is the second intersection of the line through `X` and `Y` with\nthe circumcircle of the noncollinear points `P`, `Q`, `R`, the first\nintersection being `First`. The final conjunct records that these are the\nonly two intersection points. -/\ndef IsSecondIntersectionLineCircumcircle\n (X Y First Second P Q R : Point) : Prop :=\n X ≠ Y ∧\n Noncollinear P Q R ∧\n OnLine X Y First ∧\n OnCircumcircle First P Q R ∧\n OnLine X Y Second ∧\n OnCircumcircle Second P Q R ∧\n Second ≠ First ∧\n ∀ Z : Point,\n OnLine X Y Z → OnCircumcircle Z P Q R → Z = First ∨ Z = Second\n\n/-- The complete configuration stated in the problem. The thirteen point\nvariables are, in order, `A B C H O S T M N F G K L`. -/\ndef Configuration\n (A B C H O S T M N F G K L : Point) : Prop :=\n IsAcuteTriangle A B C ∧\n IsOrthocenter A B C H ∧\n IsCircumcenter O A B C ∧\n IsFoot B A C S ∧\n IsFoot C A B T ∧\n IsMidpoint M S T ∧\n IsMidpoint N A H ∧\n OnLine A C F ∧\n ParallelLines O F B C ∧\n OnLine A B G ∧\n ParallelLines O G B C ∧\n IsSecondIntersectionLineCircumcircle N G G K B G O ∧\n IsSecondIntersectionLineCircumcircle N F F L C F O\n\n/-- Two ordered triangles are similar: they are nondegenerate and their\ncorresponding side lengths have a common positive ratio. For\n`SimilarTriangles A B C D E F`, the correspondence is `A ↔ D`, `B ↔ E`,\nand `C ↔ F`. -/\ndef SimilarTriangles (A B C D E F : Point) : Prop :=\n Noncollinear A B C ∧\n Noncollinear D E F ∧\n ∃ scale : ℝ,\n 0 < scale ∧\n dist A B = scale * dist D E ∧\n dist B C = scale * dist E F ∧\n dist C A = scale * dist F D\n\n/-- The assertion to be proved: for every acute triangle and every choice of\nthe points specified by the construction, triangles `BCM` and `KLN` are\nsimilar, with the correspondence `B ↔ K`, `C ↔ L`, and `M ↔ N`. -/\ndef Target : Prop :=\n ∀ A B C H O S T M N F G K L : Point,\n Configuration A B C H O S T M N F G K L →\n SimilarTriangles B C M K L N\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3f5c9741-eca7-536f-a476-1bc326aa51dd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3a6fa306c85e085e184128423bcb81fa2b6b7ee886320378a3d545d56208f7e5", "task_path": "tasks/nmp3_3f5c9741-eca7-536f-a476-1bc326aa51dd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3f5c9741-eca7-536f-a476-1bc326aa51dd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3f7237d7-7e22-5674-88b8-b09e15353f45", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) with \\(a+b+c=1\\). Prove that \n-- \\[\n-- \\frac{1}{ab+bc+ca}+\\frac{4abc}{a^{3}b+b^{3}c+c^{3}a+3abc}\\ge 4.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The denominator `ab + bc + ca` of the first summand. -/\ndef firstDenominator (a b c : ℝ) : ℝ :=\n a * b + b * c + c * a\n\n/-- The denominator `a^3 b + b^3 c + c^3 a + 3abc` of the second summand. -/\ndef secondDenominator (a b c : ℝ) : ℝ :=\n a ^ 3 * b + b ^ 3 * c + c ^ 3 * a + 3 * a * b * c\n\n/-- The left-hand side of the inequality in the problem. -/\ndef lhs (a b c : ℝ) : ℝ :=\n 1 / firstDenominator a b c + 4 * a * b * c / secondDenominator a b c\n\n/--\nThe assertion to be proved: for all positive real numbers `a`, `b`, and `c`\nwhose sum is `1`, the left-hand side is at least `4`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 1 →\n lhs a b c ≥ 4\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3f7237d7-7e22-5674-88b8-b09e15353f45", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2caff152bb0d04cb372c0ebe3d41ed61bdbb14cea2f8fb0580facfe8041511c2", "task_path": "tasks/nmp3_3f7237d7-7e22-5674-88b8-b09e15353f45", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3f7237d7-7e22-5674-88b8-b09e15353f45", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3f7ad15b-4d13-558f-a43c-9f52b88195bc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^{2}+b^{2}+c^{2}+abc\\le 4$. Prove that \n-- \\[\n-- a^{2}b+b^{2}c+c^{2}a\\le a^{2}+b^{2}+c^{2}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypotheses of the source problem: all variables are positive and satisfy\nthe normalized constraint `a^2 + b^2 + c^2 + a*b*c ≤ 4`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a ^ 2 + b ^ 2 + c ^ 2 + a * b * c ≤ 4\n\n/-- The inequality to be established from the admissibility hypotheses. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n a ^ 2 * b + b ^ 2 * c + c ^ 2 * a ≤\n a ^ 2 + b ^ 2 + c ^ 2\n\n/-- The complete universally quantified assertion of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3f7ad15b-4d13-558f-a43c-9f52b88195bc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cbeac93f9062a380f79f4b9f8ff32bddf040e7f616e86730d7bf99d2f1fd197c", "task_path": "tasks/nmp3_3f7ad15b-4d13-558f-a43c-9f52b88195bc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3f7ad15b-4d13-558f-a43c-9f52b88195bc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3f80cc29-5589-5ad7-a3ef-919a6b204bd8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that \n-- \\[\n-- \\frac{4}{3}\\Bigg(\\frac{a}{b+c}+\\frac{b}{c+a}+\\frac{c}{a+b}\\Bigg)+\\sqrt[3]{\\frac{abc}{(a+b)(b+c)(c+a)}}\\ge\\frac{5}{2},\n-- \\] \n-- for all real numbers \\(a,b,c\\ge 0\\) (with \\(a+b,\\;b+c,\\;c+a>0\\)).\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The assertion that the three real variables are nonnegative. -/\ndef NonnegativeTriple (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The assertion that the three pairwise sums are strictly positive. -/\ndef PairwiseSumsPositive (a b c : ℝ) : Prop :=\n 0 < a + b ∧ 0 < b + c ∧ 0 < c + a\n\n/-- The full domain hypothesis from the problem: nonnegative variables whose\nthree pairwise sums are strictly positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n NonnegativeTriple a b c ∧ PairwiseSumsPositive a b c\n\n/-- The radicand `abc / ((a+b)(b+c)(c+a))` appearing under the cube root. -/\ndef radicand (a b c : ℝ) : ℝ :=\n (a * b * c) / ((a + b) * (b + c) * (c + a))\n\n/-- Real cube root, represented on nonnegative inputs by the real power with\nexponent `1 / 3`. Under `Admissible a b c`, `radicand a b c` is nonnegative,\nso this is the ordinary real cube root of the radicand. -/\ndef realCubeRoot (x : ℝ) : ℝ :=\n Real.rpow x ((1 : ℝ) / 3)\n\n/-- The complete left-hand side of the displayed inequality. -/\ndef LHS (a b c : ℝ) : ℝ :=\n (4 / 3 : ℝ) * (a / (b + c) + b / (c + a) + c / (a+b)) +\n realCubeRoot (radicand a b c)\n\n/-- The proposition to be proved: for every admissible triple of real numbers,\nthe displayed left-hand side is at least `5 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ (5 / 2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3f80cc29-5589-5ad7-a3ef-919a6b204bd8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f48d591fc1a5a09d4cf5fa151f3618deae606b2204827343bf7573375b22d2a6", "task_path": "tasks/nmp3_3f80cc29-5589-5ad7-a3ef-919a6b204bd8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3f80cc29-5589-5ad7-a3ef-919a6b204bd8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3fb771ba-a433-5ae7-aaec-95b96bacad4f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $ab+bc+ca=3$. Prove that \n-- \\[\n-- \\frac{1}{a^2+1}+\\frac{1}{b^2+1}+\\frac{1}{c^2+1}\\ge \\frac{3}{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a three-variable real inequality\n\nThe source problem asks for a proof that, for every triple of positive real\nnumbers satisfying `ab + bc + ca = 3`, a certain sum of three reciprocals is at\nleast `3 / 2`. This file records the proposition; it does not supply a proof.\n-/\n\nnamespace Problem\n\n/-- The proposition asserted by the problem.\n\nFor all real numbers `a`, `b`, and `c`, if each is strictly positive and if\n`a * b + b * c + c * a = 3`, then\n`1 / (a^2 + 1) + 1 / (b^2 + 1) + 1 / (c^2 + 1) ≥ 3 / 2`.\nAll arithmetic is in the real numbers, and the final inequality is non-strict. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b + b * c + c * a = (3 : ℝ) →\n (1 : ℝ) / (a ^ (2 : ℕ) + 1) +\n (1 : ℝ) / (b ^ (2 : ℕ) + 1) +\n (1 : ℝ) / (c ^ (2 : ℕ) + 1) ≥\n (3 : ℝ) / (2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3fb771ba-a433-5ae7-aaec-95b96bacad4f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "97f10174a13b3c0dd3ae711692b7ea199bdd6935368188d8768c18d6f7091194", "task_path": "tasks/nmp3_3fb771ba-a433-5ae7-aaec-95b96bacad4f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3fb771ba-a433-5ae7-aaec-95b96bacad4f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3fd831ee-5098-5aa7-914b-f0be4df3dabb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Initially, each unit square of an $n\\times n$ grid is colored red, yellow, or blue. In each round the following operation is performed simultaneously for every unit square:\n-- - If a square is red and has a neighboring (edge‑adjacent) yellow square, it becomes yellow.\n-- - If a square is yellow and has a neighboring blue square, it becomes blue.\n-- - If a square is blue and has a neighboring red square, it becomes red.\n-- \n-- Assume that after a finite number of rounds the grid becomes monochromatic (all squares have the same color). Prove that the grid must become monochromatic no later than the end of the $(2n-2)$‑th round.\nimport Mathlib.Data.Fin.Basic\nimport Mathlib.Logic.Function.Iterate\n\n/-!\n# Formalization of the grid-coloring problem\n\nWe model the `n × n` grid by `Fin n × Fin n`, the three colors by an\ninductive type, and the simultaneous round update by a function on colorings.\n-/\n\nnamespace Problem\n\n/-- The three colors appearing in the problem. -/\ninductive Color : Type\n | red\n | yellow\n | blue\n deriving DecidableEq, Repr\n\n/-- A cell of an `n × n` grid. -/\nabbrev Cell (n : ℕ) : Type := Fin n × Fin n\n\n/-- A coloring of an `n × n` grid. -/\nabbrev State (n : ℕ) : Type := Cell n → Color\n\n/-- Two grid cells are edge-adjacent when they have the same row and their\ncolumns differ by one, or they have the same column and their rows differ by\none. -/\ndef Adjacent {n : ℕ} (p q : Cell n) : Prop :=\n (p.1 = q.1 ∧ (p.2.val + 1 = q.2.val ∨ q.2.val + 1 = p.2.val)) ∨\n (p.2 = q.2 ∧ (p.1.val + 1 = q.1.val ∨ q.1.val + 1 = p.1.val))\n\n/-- A cell has a neighboring square of the given color in state `s`. -/\ndef HasNeighbor {n : ℕ} (s : State n) (p : Cell n) (c : Color) : Prop :=\n ∃ q : Cell n, Adjacent p q ∧ s q = c\n\n/-- The simultaneous one-round update. A red cell turns yellow exactly when it\nhas a yellow neighbor; a yellow cell turns blue exactly when it has a blue\nneighbor; a blue cell turns red exactly when it has a red neighbor. In every\nother case the cell keeps its color. -/\nnoncomputable def step {n : ℕ} (s : State n) : State n := by\n classical\n exact fun p =>\n match s p with\n | Color.red =>\n if HasNeighbor s p Color.yellow then Color.yellow else Color.red\n | Color.yellow =>\n if HasNeighbor s p Color.blue then Color.blue else Color.yellow\n | Color.blue =>\n if HasNeighbor s p Color.red then Color.red else Color.blue\n\n/-- A coloring is monochromatic when all cells have the same color. -/\ndef Monochromatic {n : ℕ} (s : State n) : Prop :=\n ∃ c : Color, ∀ p : Cell n, s p = c\n\n/-- The state obtained after `k` rounds. The initial state is round `0`. -/\nnoncomputable def stateAfter {n : ℕ} (s : State n) (k : ℕ) : State n :=\n Nat.iterate step k s\n\n/-- The coloring becomes monochromatic at some time in the first `bound`\nrounds. -/\ndef MonochromaticBy {n : ℕ} (s : State n) (bound : ℕ) : Prop :=\n ∃ k : ℕ, k ≤ bound ∧ Monochromatic (stateAfter s k)\n\n/-- The grid is eventually monochromatic, i.e. monochromatic after finitely\nmany rounds. -/\ndef EventuallyMonochromatic {n : ℕ} (s : State n) : Prop :=\n ∃ k : ℕ, Monochromatic (stateAfter s k)\n\n/-- The upper bound `2 * n - 2` on the number of rounds. With the intended\npositive `n`, this is the usual natural-number value. -/\ndef roundBound (n : ℕ) : ℕ :=\n 2 * n - 2\n\n/-- The stated theorem: for every positive grid size `n` and every initial\ncoloring, if the coloring eventually becomes monochromatic, then it is\nmonochromatic at some round no later than `2 * n - 2`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ∀ s : State n,\n EventuallyMonochromatic s → MonochromaticBy s (roundBound n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3fd831ee-5098-5aa7-914b-f0be4df3dabb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9145dc12478d53d0dc68f2d1fb324423f7c399c4bcf1833bf98106651e987c5a", "task_path": "tasks/nmp3_3fd831ee-5098-5aa7-914b-f0be4df3dabb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3fd831ee-5098-5aa7-914b-f0be4df3dabb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3ff17788-2c71-518d-864f-0f5ee56754a0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, $c$ be the side lengths of an acute triangle. Prove that \n-- \\[\n-- \\frac{1}{a^{2}+b^{2}-c^{2}}+\\frac{1}{b^{2}+c^{2}-a^{2}}+\\frac{1}{c^{2}+a^{2}-b^{2}}\n-- \\;\\ge\\;\n-- \\frac{a+b+c}{(a+b-c)(a+c-b)(b+c-a)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the acute-triangle inequality\n\nThis file records the proposition stated in `problem.md`. The predicate\n`Problem.IsAcuteTriangleSideLengths` expands \"side lengths of an acute\ntriangle\" into positive side lengths, the three strict triangle inequalities,\nand the three side-based characterizations of acute angles. The target is a\nproposition; no proof is provided at this statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- `a`, `b`, and `c` are the side lengths of a nondegenerate acute triangle.\n\nThe first three conjuncts say that the three side lengths are positive. The\nnext three are the strict triangle inequalities. The final three express that\neach angle is acute: by the law of cosines, the angle opposite a side of\nlength `c` is acute exactly when `a ^ 2 + b ^ 2 > c ^ 2`, and similarly for the\nother two sides. -/\ndef IsAcuteTriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧\n 0 < b ∧\n 0 < c ∧\n a + b > c ∧\n b + c > a ∧\n c + a > b ∧\n a ^ 2 + b ^ 2 > c ^ 2 ∧\n b ^ 2 + c ^ 2 > a ^ 2 ∧\n c ^ 2 + a ^ 2 > b ^ 2\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / (a ^ 2 + b ^ 2 - c ^ 2) +\n 1 / (b ^ 2 + c ^ 2 - a ^ 2) +\n 1 / (c ^ 2 + a ^ 2 - b ^ 2)\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a + b + c) / ((a + b - c) * (a + c - b) * (b + c - a))\n\n/-- The complete universally quantified assertion from the source problem:\nfor every triple of side lengths of an acute triangle, the stated inequality\nholds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n IsAcuteTriangleSideLengths a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ff17788-2c71-518d-864f-0f5ee56754a0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bc1004e8718be08303404f9ccfc5e54f0ca9f80cdf187894e3c74c6f9c42ae91", "task_path": "tasks/nmp3_3ff17788-2c71-518d-864f-0f5ee56754a0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ff17788-2c71-518d-864f-0f5ee56754a0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_3ffc41ed-9393-5b78-9054-c91b496be6f9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be distinct real numbers such that \n-- $$a^4+b^4+c^4+ab^3+bc^3+ca^3=2\\bigl(a^3b+b^3c+c^3a\\bigr).$$ \n-- Prove that \n-- $$\\frac1a+\\frac1b+\\frac1c=0.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The three real numbers `a`, `b`, and `c` are pairwise distinct. -/\ndef Distinct (a b c : ℝ) : Prop :=\n a ≠ b ∧ b ≠ c ∧ c ≠ a\n\n/-- The polynomial equation assumed in the problem. -/\ndef Equation (a b c : ℝ) : Prop :=\n a ^ 4 + b ^ 4 + c ^ 4 + a * b ^ 3 + b * c ^ 3 + c * a ^ 3 =\n 2 * (a ^ 3 * b + b ^ 3 * c + c ^ 3 * a)\n\n/-- The reciprocal-sum conclusion asserted by the problem. -/\ndef ReciprocalSumZero (a b c : ℝ) : Prop :=\n (1 : ℝ) / a + 1 / b + 1 / c = 0\n\n/-- The full statement: for every pairwise-distinct real triple satisfying the\ndisplayed polynomial equation, the sum of the reciprocals is zero. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Distinct a b c → Equation a b c → ReciprocalSumZero a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ffc41ed-9393-5b78-9054-c91b496be6f9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "aeece8fba221124cb1fe298d8c5f14a66b5f9943dcbc19b0a0c2811b9a14bf3e", "task_path": "tasks/nmp3_3ffc41ed-9393-5b78-9054-c91b496be6f9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "3ffc41ed-9393-5b78-9054-c91b496be6f9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4016fe51-ab9e-5cc3-8f7a-bb424d873333", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a\\,(b^2+c^2)}{(b+c)\\,(2a^2+b^2+c^2)}+\\frac{b\\,(c^2+a^2)}{(c+a)\\,(2b^2+c^2+a^2)}+\\frac{c\\,(a^2+b^2)}{(a+b)\\,(2c^2+a^2+b^2)}\\le\\frac34\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a cyclic three-variable real inequality\n\nThe source problem asks one to prove, for all positive real numbers `a`, `b`, `c`,\nthe inequality whose three summands and right-hand side are formalized below.\nThis file states the assertion as a proposition; it does not prove it.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The first summand in the cyclic inequality. -/\ndef firstTerm (a b c : ℝ) : ℝ :=\n a * (b ^ 2 + c ^ 2) /\n ((b + c) * (2 * a ^ 2 + b ^ 2 + c ^ 2))\n\n/-- The second summand in the cyclic inequality. -/\ndef secondTerm (a b c : ℝ) : ℝ :=\n b * (c ^ 2 + a ^ 2) /\n ((c + a) * (2 * b ^ 2 + c ^ 2 + a ^ 2))\n\n/-- The third summand in the cyclic inequality. -/\ndef thirdTerm (a b c : ℝ) : ℝ :=\n c * (a ^ 2 + b ^ 2) /\n ((a + b) * (2 * c ^ 2 + a ^ 2 + b ^ 2))\n\n/-- The left-hand side of the inequality, namely the sum of the three cyclic summands. -/\ndef lhs (a b c : ℝ) : ℝ :=\n firstTerm a b c + secondTerm a b c + thirdTerm a b c\n\n/-- The right-hand side of the inequality, namely `3 / 4`. -/\ndef rhs : ℝ :=\n (3 : ℝ) / 4\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the sum of the three displayed\nfractions is at most `3 / 4`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≤ rhs\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4016fe51-ab9e-5cc3-8f7a-bb424d873333", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5b605c561b6418bcfc2a286be52b4f441f37821634fec99204bf5f0fdd96725d", "task_path": "tasks/nmp3_4016fe51-ab9e-5cc3-8f7a-bb424d873333", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4016fe51-ab9e-5cc3-8f7a-bb424d873333", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_40346e16-1b3c-5877-861d-aa67cad00271", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $d_1,d_2,\\dots,d_9$ be nine distinct integers and define \n-- \\[P(x)=\\prod_{j=1}^{9}(x+d_j).\\] \n-- Prove that there exists an integer $N$ such that for every integer $x\\ge N$ the number $P(x)$ has a prime divisor greater than $20$ (i.e. a prime $\\ge 23$).\nimport Mathlib\n\n/-!\n# Formal statement of the nine-factor prime-divisor problem\n\nThe source problem concerns nine distinct integers `d₁, …, d₉`, the product\n`P(x) = ∏ⱼ (x + dⱼ)`, and the eventual existence of a prime divisor greater\nthan `20` for every sufficiently large integer `x`.\n-/\n\nnamespace Problem\n\n/-- A function on `Fin 9` represents the ordered list of the nine integers\n`d₁, …, d₉` from the problem. The index `j : Fin 9` is zero-based in Lean,\nwhich is immaterial because the product ranges over all nine indices. -/\nabbrev NineIntegers : Type := Fin 9 → ℤ\n\n/-- The nine integers are distinct. -/\ndef NineDistinct (d : NineIntegers) : Prop :=\n Function.Injective d\n\n/-- The product `P(x) = ∏_{j=1}^{9} (x + d_j)`. -/\ndef P (d : NineIntegers) (x : ℤ) : ℤ :=\n ∏ j : Fin 9, (x + d j)\n\n/-- An integer `n` has a prime divisor greater than `20` (equivalently, a\nprime divisor at least `23`). The prime is represented as a natural number\nand is embedded into `ℤ` for the divisibility relation. -/\ndef HasPrimeDivisorGreaterThanTwenty (n : ℤ) : Prop :=\n ∃ p : ℕ, Nat.Prime p ∧ 20 < p ∧ (p : ℤ) ∣ n\n\n/-- The assertion to be proved: for every nine distinct integers `d₁, …, d₉`,\nthere is an integer `N` such that for every integer `x ≥ N`, the product\n`P(x) = ∏_{j=1}^{9} (x + d_j)` has a prime divisor greater than `20`. -/\ndef Target : Prop :=\n ∀ d : NineIntegers,\n NineDistinct d →\n ∃ N : ℤ,\n ∀ x : ℤ,\n N ≤ x → HasPrimeDivisorGreaterThanTwenty (P d x)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "40346e16-1b3c-5877-861d-aa67cad00271", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b6d6b251c65edada38d6e01ee3cd13356d48ac27d13baf161229c13f1bd3a46a", "task_path": "tasks/nmp3_40346e16-1b3c-5877-861d-aa67cad00271", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "40346e16-1b3c-5877-861d-aa67cad00271", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_40364125-c95c-50fb-84c3-088d534284f5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,\\;y,\\;z\\ge 0$ satisfy $x^{2}+y^{2}+z^{2}+xyz=4$. Prove that \n-- \\[\n-- \\sqrt{x+y}\\;+\\;\\sqrt[3]{\\,y+z\\,}\\;+\\;\\sqrt[4]{\\,z+x\\,}<4\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the nonnegative real-variable inequality\n\nThe source problem asks one to prove a strict inequality under a symmetric\nconstraint. The three root expressions are interpreted as the principal real\nroots of the respective nonnegative radicands. The square root is Mathlib's\n`Real.sqrt`; the cube and fourth roots are represented by real powers with\nexponents `1/3` and `1/4`, respectively. These definitions are aliases for\nthe usual principal roots on `ℝ≥0`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The principal real cube root, represented by the real power `a ^ (1/3)`.\n\nOnly nonnegative arguments are used in the target statement, on which this\nagrees with the unique nonnegative real root of `r ^ 3 = a`. -/\ndef cubeRoot (a : ℝ) : ℝ := Real.rpow a ((1 : ℝ) / 3)\n\n/-- The principal nonnegative real fourth root, represented by `a ^ (1/4)`.\n\nOnly nonnegative arguments are used in the target statement, on which this\nagrees with the unique nonnegative real root of `r ^ 4 = a`. -/\ndef fourthRoot (a : ℝ) : ℝ := Real.rpow a ((1 : ℝ) / 4)\n\n/-- The assertion to be proved: every triple of nonnegative real numbers\nsatisfying `x^2 + y^2 + z^2 + xyz = 4` satisfies\n`√(x+y) + ∛(y+z) + ∜(z+x) < 4`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 ≤ x →\n 0 ≤ y →\n 0 ≤ z →\n x ^ 2 + y ^ 2 + z ^ 2 + x * y * z = (4 : ℝ) →\n Real.sqrt (x + y) + cubeRoot (y + z) + fourthRoot (z + x) < (4 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "40364125-c95c-50fb-84c3-088d534284f5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "93527eb4a86155e9e1c8add50960542b98e34ca9984dd55adcb662240b79a44c", "task_path": "tasks/nmp3_40364125-c95c-50fb-84c3-088d534284f5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "40364125-c95c-50fb-84c3-088d534284f5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4042f845-739f-5af3-bd63-852cd7813412", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all $a,b,c>0$,\n-- \\[\n-- \\frac{b+c}{a}+\\frac{c+a}{b}+\\frac{a+b}{c}\\ge2\\sqrt{\\frac{(a^2+b^2+c^2)(a+b+c)}{abc}}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The statement: for all positive real numbers `a`, `b`, and `c`,\nthe cyclic sum `(b+c)/a + (c+a)/b + (a+b)/c` is at least\n`2 * sqrt (((a^2+b^2+c^2) * (a+b+c)) / (a*b*c))`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (b + c) / a + (c + a) / b + (a + b) / c ≥\n 2 * Real.sqrt (((a ^ 2 + b ^ 2 + c ^ 2) * (a + b + c)) / (a * b * c))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4042f845-739f-5af3-bd63-852cd7813412", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "51f0ec731e6d9adabf0b7ffa7594d81613eaa08036235812c3fb64dfe2cef27b", "task_path": "tasks/nmp3_4042f845-739f-5af3-bd63-852cd7813412", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4042f845-739f-5af3-bd63-852cd7813412", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_40616685-3c26-5f63-8273-d7fa45b53503", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,x,y,z>0$ satisfy $a+b+c=4$ and $ax+by+cz=xyz$. Prove that \n-- $$x+y+z>\\sqrt{a+b}+\\sqrt{b+c}+\\sqrt{c+a}\\,. $$\nimport Mathlib\n\n/-!\nFormal statement of the inequality problem.\n\nNo proof of the target is provided: `Problem.Target` is a proposition-valued\ndefinition whose body is the complete universally quantified statement.\n-/\n\nnamespace Problem\n\n/-- The hypotheses of the problem for positive reals `a, b, c, x, y, z`. -/\ndef Hypotheses (a b c x y z : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < x ∧ 0 < y ∧ 0 < z ∧\n a + b + c = 4 ∧ a * x + b * y + c * z = x * y * z\n\n/-- The asserted strict inequality. -/\ndef Conclusion (a b c x y z : ℝ) : Prop :=\n x + y + z > Real.sqrt (a + b) + Real.sqrt (b + c) + Real.sqrt (c + a)\n\n/-- The full statement: for all positive reals satisfying the two supplied\nequalities, the asserted strict inequality holds. -/\ndef Target : Prop :=\n ∀ a b c x y z : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < x → 0 < y → 0 < z →\n a + b + c = 4 →\n a * x + b * y + c * z = x * y * z →\n x + y + z > Real.sqrt (a + b) + Real.sqrt (b + c) + Real.sqrt (c + a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "40616685-3c26-5f63-8273-d7fa45b53503", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9838241ef2f0833929b43810ffc151f03fdcc9b261a5c2834b9da9a326a0daf6", "task_path": "tasks/nmp3_40616685-3c26-5f63-8273-d7fa45b53503", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "40616685-3c26-5f63-8273-d7fa45b53503", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_40694c05-c72d-54cb-b19d-d15baee99551", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given non‑negative real numbers $a,b,c$ such that $a+b$, $b+c$, $c+a$ are non‑zero, prove that \n-- \\[\n-- \\frac{a^{3}+b^{3}}{(a+b)^{3}}+\\frac{b^{3}+c^{3}}{(b+c)^{3}}+\\frac{c^{3}+a^{3}}{(c+a)^{3}}+\\frac{27}{4}\\cdot\\frac{abc}{a^{3}+b^{3}+c^{3}}\\le 3.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the inequality problem\n\nThe source problem asks to prove a real-variable inequality under nonnegativity\nand nonzero pair-sum assumptions. The target is represented as a proposition\n(`Prop`) rather than proved here.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The pair-sum denominators occurring in the first three summands are nonzero. -/\ndef PairSumsNonzero (a b c : ℝ) : Prop :=\n a + b ≠ 0 ∧ b + c ≠ 0 ∧ c + a ≠ 0\n\n/-- The full admissibility condition stated in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ PairSumsNonzero a b c\n\n/-- The summand `(a^3 + b^3) / (a + b)^3`. -/\ndef termAB (a b : ℝ) : ℝ :=\n (a ^ 3 + b ^ 3) / (a + b) ^ 3\n\n/-- The summand `(b^3 + c^3) / (b + c)^3`. -/\ndef termBC (b c : ℝ) : ℝ :=\n (b ^ 3 + c ^ 3) / (b + c) ^ 3\n\n/-- The summand `(c^3 + a^3) / (c + a)^3`. -/\ndef termCA (c a : ℝ) : ℝ :=\n (c ^ 3 + a ^ 3) / (c + a) ^ 3\n\n/-- The summand `(27/4) * (abc / (a^3 + b^3 + c^3))`. -/\ndef termABC (a b c : ℝ) : ℝ :=\n (27 / 4 : ℝ) * ((a * b * c) / (a ^ 3 + b ^ 3 + c ^ 3))\n\n/-- The left-hand side of the inequality in the problem. -/\ndef lhs (a b c : ℝ) : ℝ :=\n termAB a b + termBC b c + termCA c a + termABC a b c\n\n/-- The proposition asserted by the problem: for every triple of nonnegative real\nnumbers whose three pairwise sums are nonzero, the displayed left-hand side is at\nmost `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≤ 3\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "40694c05-c72d-54cb-b19d-d15baee99551", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c43fe7d5d812f4d6554c9f23d06bfb033f67acca3bea08dbba85256cac1aa183", "task_path": "tasks/nmp3_40694c05-c72d-54cb-b19d-d15baee99551", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "40694c05-c72d-54cb-b19d-d15baee99551", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_40a64dd2-9a71-549a-afea-ae6b3cebc2d3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are non‑negative real numbers with $ab+bc+ca\\neq0$, prove that \n-- \\[\n-- \\frac{1}{a^{3}+b^{3}}+\\frac{1}{b^{3}+c^{3}}+\\frac{1}{c^{3}+a^{3}}\\ge \\frac{20}{(a+b+c)^{3}}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three variables are non-negative real numbers. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The sum of the pairwise products of `a`, `b`, and `c` is nonzero. -/\ndef PairwiseProductSumNonzero (a b c : ℝ) : Prop :=\n a * b + b * c + c * a ≠ 0\n\n/-- The admissibility hypotheses stated in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ PairwiseProductSumNonzero a b c\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def Lhs (a b c : ℝ) : ℝ :=\n 1 / (a ^ 3 + b ^ 3) + 1 / (b ^ 3 + c ^ 3) + 1 / (c ^ 3 + a ^ 3)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def Rhs (a b c : ℝ) : ℝ :=\n 20 / (a + b + c) ^ 3\n\n/--\nFor non-negative real numbers `a`, `b`, and `c` satisfying\n`a * b + b * c + c * a ≠ 0`, the sum of the reciprocals of the pairwise sums\nof cubes is at least `20 / (a + b + c) ^ 3`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Lhs a b c ≥ Rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "40a64dd2-9a71-549a-afea-ae6b3cebc2d3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "25a5426f7ad852ba5f8497ab1bc3600070c7074203e7346b0930354c62930baa", "task_path": "tasks/nmp3_40a64dd2-9a71-549a-afea-ae6b3cebc2d3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "40a64dd2-9a71-549a-afea-ae6b3cebc2d3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_40ee6585-9972-5803-b006-5064d46e23a8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sqrt{\\frac{2a}{b+c}}+\\sqrt{\\frac{2b}{c+a}}+\\sqrt{\\frac{2c}{a+b}}\\le\\sqrt{3\\Big(\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\Big)}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove a real-variable inequality under the\nassumption that all three variables are strictly positive.\n-/\n\nnamespace Problem\n\n/-- The assertion from the problem: for all positive real numbers `a`, `b`, and `c`,\nthe sum of the three indicated square roots is at most the square root of three\ntimes the cyclic sum `a / b + b / c + c / a`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b →\n 0 < c →\n Real.sqrt ((2 * a) / (b + c)) +\n Real.sqrt ((2 * b) / (c + a)) +\n Real.sqrt ((2 * c) / (a + b)) ≤\n Real.sqrt (3 * (a / b + b / c + c / a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "40ee6585-9972-5803-b006-5064d46e23a8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6576ac12e6405f716f73f4e7840f9dc3b08cde15d2484b676bccc368016fb042", "task_path": "tasks/nmp3_40ee6585-9972-5803-b006-5064d46e23a8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "40ee6585-9972-5803-b006-5064d46e23a8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_412b8db1-6bc1-5af1-8aa4-c4ebd01db397", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $ab+bc+ca=3$. Prove that \n-- \\[\n-- \\frac{a}{bc+1}+\\frac{b}{ca+1}+\\frac{c}{ab+1}\\le\\frac{a^{2}+b^{2}+c^{2}}{2abc}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the inequality problem\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c` with\n`ab + bc + ca = 3`, to prove the displayed inequality. This file records the\nprecise mathematical assertion as a proposition; it deliberately contains no\nproof of that assertion.\n-/\n\nnamespace Problem\n\n/-- The numerical inequality asserted in the problem, for arbitrary real\nnumbers `a`, `b`, and `c`.\n\nThe occurrences of `/` are real division in Lean, as fixed by the explicit\nambient type `ℝ`. Powers are natural-number powers.\n-/\ndef Inequality (a b c : ℝ) : Prop :=\n a / (b * c + 1) + b / (c * a + 1) + c / (a * b + 1) ≤\n (a ^ 2 + b ^ 2 + c ^ 2) / (2 * a * b * c)\n\n/-- The complete assertion of the source problem: for every triple of positive\nreal numbers satisfying `ab + bc + ca = 3`, the displayed inequality holds.\n\nAll three variables are universally quantified with domain `ℝ`, and the three\nstrict positivity assumptions and the symmetric quadratic condition are\nhypotheses for that same universally quantified triple. The conclusion is\nexactly `Problem.Inequality a b c`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b + b * c + c * a = 3 →\n Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "412b8db1-6bc1-5af1-8aa4-c4ebd01db397", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9fc0ed690e525755360b44dcf2bff635f6add3cb31472f97ae0b3cf53bb6f887", "task_path": "tasks/nmp3_412b8db1-6bc1-5af1-8aa4-c4ebd01db397", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "412b8db1-6bc1-5af1-8aa4-c4ebd01db397", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_41814c9b-edf5-5674-925f-9e7a064a225c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x, y, z$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{x^2+yz}{x(y+z)}+\\frac{y^2+zx}{y(z+x)}+\\frac{z^2+xy}{z(x+y)}\n-- \\;\\ge\\;\n-- \\frac{(\\sqrt{x}+\\sqrt{y}+\\sqrt{z})^2}{\\sqrt{xy}+\\sqrt{yz}+\\sqrt{zx}}.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formalization of the cyclic square-root inequality\n\nThe original problem asks to prove, for all positive real numbers `x`, `y`, and `z`,\nthe inequality\n`(x^2 + y z)/(x (y + z)) + (y^2 + z x)/(y (z + x)) + (z^2 + x y)/(z (x + y))\n ≥ (sqrt x + sqrt y + sqrt z)^2 / (sqrt (x y) + sqrt (y z) + sqrt (z x))`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def inequalityLHS (x y z : ℝ) : ℝ :=\n (x ^ 2 + y * z) / (x * (y + z)) +\n (y ^ 2 + z * x) / (y * (z + x)) +\n (z ^ 2 + x * y) / (z * (x + y))\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def inequalityRHS (x y z : ℝ) : ℝ :=\n (Real.sqrt x + Real.sqrt y + Real.sqrt z) ^ 2 /\n (Real.sqrt (x * y) + Real.sqrt (y * z) + Real.sqrt (z * x))\n\n/-- The assertion to be proved: for all positive real `x`, `y`, and `z`, the\nstated cyclic inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z →\n inequalityLHS x y z ≥ inequalityRHS x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "41814c9b-edf5-5674-925f-9e7a064a225c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "480fda32473aaf39f33ad1b88086aa1eedaf0667726885d1e747696b7019c6c5", "task_path": "tasks/nmp3_41814c9b-edf5-5674-925f-9e7a064a225c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "41814c9b-edf5-5674-925f-9e7a064a225c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_41afddee-3c1f-5f7d-862b-99a5172c0798", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be natural numbers such that $a Nat.Coprime k n)).card\n\n/--\nThe set of positive natural numbers `n` satisfying the equation\n`eulerPhi n = m`.\n-/\ndef solutionSet (m : ℕ) : Set ℕ :=\n {n : ℕ | 0 < n ∧ eulerPhi n = m}\n\n/--\nThere exists a positive integer `m` for which the equation `eulerPhi n = m`\nhas at least `2015` distinct positive-integer solutions in `n`.\n\nThe extended cardinality `Set.encard` is used so that the assertion \"at least\n2015 distinct solutions\" remains correct whether or not the solution set is\nfinite (although for a fixed totient value it is in fact finite).\n-/\ndef Target : Prop :=\n ∃ m : ℕ, 0 < m ∧ (2015 : ℕ∞) ≤ Set.encard (solutionSet m)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "41c1ac57-e875-5b1c-80ec-5a89ca0f83be", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "77536c52176ba0466c92e37ed94c271c6c4d7d460ae0e8f8d90b55c9b1a337d0", "task_path": "tasks/nmp3_41c1ac57-e875-5b1c-80ec-5a89ca0f83be", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "41c1ac57-e875-5b1c-80ec-5a89ca0f83be", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_41c74a73-50be-5807-9433-a24cc3966f2b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- There are 2015 distinct circles of radius 1 in the plane. Prove that one can select 27 of them such that either every two selected circles intersect (i.e. have at least one point in common, including tangency) or every two selected circles are disjoint (i.e. have no point in common).\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Sphere.Basic\nimport Mathlib.Data.Finset.Card\n\n/-!\n# Formal statement of the unit-circle Ramsey-type problem\n\nThe plane is represented by the real Euclidean vector space of dimension two.\nA circle is represented by `EuclideanGeometry.Sphere`, whose coercion to a set is\nthe usual circumference, and a unit circle is a sphere whose radius is `1`.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane, coordinatized as a two-dimensional real inner-product space. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A circle of radius one in the plane. The subtype records the radius condition,\nwhile the center remains part of the bundled sphere. -/\nabbrev UnitCircle : Type := { c : EuclideanGeometry.Sphere Plane // c.radius = 1 }\n\n/-- The set of points lying on a unit circle. -/\ndef UnitCircle.carrier (c : UnitCircle) : Set Plane :=\n (c.1 : Set Plane)\n\n/-- Two circles intersect when they have at least one point in common. -/\ndef CirclesIntersect (c d : UnitCircle) : Prop :=\n ∃ p : Plane, p ∈ c.carrier ∧ p ∈ d.carrier\n\n/-- Two circles are disjoint when they have no point in common. -/\ndef CirclesDisjoint (c d : UnitCircle) : Prop :=\n ∀ p : Plane, p ∈ c.carrier → p ∈ d.carrier → False\n\n/-- Every two distinct circles in a finite family intersect. -/\ndef PairwiseIntersecting (C : Finset UnitCircle) : Prop :=\n ∀ c ∈ C, ∀ d ∈ C, c ≠ d → CirclesIntersect c d\n\n/-- Every two distinct circles in a finite family are disjoint. -/\ndef PairwiseDisjoint (C : Finset UnitCircle) : Prop :=\n ∀ c ∈ C, ∀ d ∈ C, c ≠ d → CirclesDisjoint c d\n\n/-- The assertion of the problem: from any 2015 distinct unit circles in the plane,\none can select 27 which are either pairwise intersecting or pairwise disjoint. -/\ndef Target : Prop :=\n ∀ C : Finset UnitCircle,\n C.card = 2015 →\n ∃ S : Finset UnitCircle,\n S ⊆ C ∧ S.card = 27 ∧ (PairwiseIntersecting S ∨ PairwiseDisjoint S)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "41c74a73-50be-5807-9433-a24cc3966f2b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "622b1d19427d5a966bbd4a59c6a050b003700edeec5d3560f5fedd2650f70434", "task_path": "tasks/nmp3_41c74a73-50be-5807-9433-a24cc3966f2b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "41c74a73-50be-5807-9433-a24cc3966f2b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_41cea814-c745-53f8-9e27-788e66c95f5c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \n-- \\[\n-- 1+\\frac12+\\frac13+\\dots+\\frac1n=\\frac{a_n}{b_n},\n-- \\]\n-- where $\\gcd(a_n,b_n)=1$. Prove that there exist infinitely many integers $n$ such that the denominator of the reduced harmonic sum strictly decreases, i.e. $b_{n+1}0$ satisfy $abcd=1$ and\n-- \\[\n-- a+b+c+d>\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{d}+\\frac{d}{a}.\n-- \\]\n-- Prove that\n-- \\[\n-- a+b+c+d<\\frac{b}{a}+\\frac{c}{b}+\\frac{d}{c}+\\frac{a}{d}.\n-- \\]\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the cyclic inequality problem\n\nThe original problem asks to prove a strict inequality for four positive real\nnumbers whose product is one, under a hypothesis relating two cyclic sums.\n\nFollowing the statement-formalization task, the assertion is represented as a\n`Prop`-valued definition. No proof of `Problem.Target` is supplied here.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The four numbers are all strictly positive real numbers. -/\ndef Positive (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d\n\n/-- The product condition `a b c d = 1`. -/\ndef ProductOne (a b c d : ℝ) : Prop :=\n a * b * c * d = 1\n\n/-- The assumed strict cyclic inequality. -/\ndef FirstInequality (a b c d : ℝ) : Prop :=\n a + b + c + d > a / b + b / c + c / d + d / a\n\n/-- The strict cyclic inequality required as the conclusion. -/\ndef SecondInequality (a b c d : ℝ) : Prop :=\n a + b + c + d < b / a + c / b + d / c + a / d\n\n/--\nThe complete assertion to be proved: for all positive real `a`, `b`, `c`, and\n`d`, if their product is `1` and the first cyclic inequality holds, then the\nsecond cyclic inequality holds.\n-/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n Positive a b c d →\n ProductOne a b c d →\n FirstInequality a b c d →\n SecondInequality a b c d\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "42821dde-41a1-5860-8877-bea72d6b8800", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e2115a8ab061bd6922934c8f1520b378a341f013cbe6635e7e74df8db292ee6d", "task_path": "tasks/nmp3_42821dde-41a1-5860-8877-bea72d6b8800", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "42821dde-41a1-5860-8877-bea72d6b8800", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_428ff2b3-e814-53d6-bf1c-4bd525e6e8df", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there are no ordered pairs $(a,k)$ of positive integers greater than $1$ satisfying \n-- $$3a^{3}=k^{2}+k+1.$$\nimport Mathlib\n\n/-!\n# No integer pairs satisfying a cubic Diophantine equation\n\nThis file formalizes the statement of the problem. It does not contain a proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition for an ordered pair `(a, k)` of positive integers\ngreater than `1`: the pair satisfies `3 a^3 = k^2 + k + 1`. -/\ndef Admissible (a k : ℕ) : Prop :=\n 1 < a ∧ 1 < k ∧ 3 * a ^ 3 = k ^ 2 + k + 1\n\n/-- There are no ordered pairs `(a, k)` of natural numbers greater than `1`\nsatisfying `3 a^3 = k^2 + k + 1`. -/\ndef Target : Prop :=\n ¬ ∃ a k : ℕ, Admissible a k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "428ff2b3-e814-53d6-bf1c-4bd525e6e8df", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c389f8f970e28dc12b786b004e4c51dcad5debe93374a1b7d01577ecf77edfca", "task_path": "tasks/nmp3_428ff2b3-e814-53d6-bf1c-4bd525e6e8df", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "428ff2b3-e814-53d6-bf1c-4bd525e6e8df", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_42c2dda9-83a8-5afe-b28f-b1b93f98fe2f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y>0$. Prove that \n-- \\[\n-- \\frac{(x+y+3)\\bigl(5x+5y+3xy+3\\bigr)}{\\sqrt{5xy\\,(x^2+y^2+3)}}\\;\\ge\\;16.\n-- \\]\nmodule\n\npublic import Mathlib.Analysis.Real.Sqrt\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem, as a function of the positive\nreal variables `x` and `y`. -/\nnoncomputable def lhs (x y : ℝ) : ℝ :=\n ((x + y + 3) * (5 * x + 5 * y + 3 * x * y + 3)) /\n Real.sqrt (5 * x * y * (x ^ 2 + y ^ 2 + 3))\n\n/-- The assertion in the problem: for all positive real numbers `x` and `y`, the given\nexpression is at least `16`. -/\nnoncomputable def Target : Prop :=\n ∀ x y : ℝ, 0 < x → 0 < y → 16 ≤ lhs x y\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "42c2dda9-83a8-5afe-b28f-b1b93f98fe2f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "073d9360d5685ff0caf8ea80495aa7c97a4394df326f10341ce88690ca2e6009", "task_path": "tasks/nmp3_42c2dda9-83a8-5afe-b28f-b1b93f98fe2f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "42c2dda9-83a8-5afe-b28f-b1b93f98fe2f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_42c9d135-60f7-5749-a25f-6e65a02ca9c9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k\\ge 2$, $n\\ge 1$, and let $a_1,a_2,\\dots ,a_k$ and $b_1,b_2,\\dots ,b_n$ be integers satisfying \n-- $$1\\; b_1+b_2+\\dots +b_n,$$ \n-- then \n-- $$a_1\\cdot a_2\\cdot \\ldots \\cdot a_k \\;>\\; b_1\\cdot b_2 \\cdot \\ldots \\cdot b_n.$$\nimport Mathlib\n\n/-!\n# Formalization of the monotone integer-sequence inequality\n\nThe source problem considers integers\n`1 < a_1 < ⋯ < a_k < b_1 < ⋯ < b_n`, with `k ≥ 2` and `n ≥ 1`.\nIf the sum of the `a_i` exceeds the sum of the `b_j`, then the product of the\n`a_i` exceeds the product of the `b_j`.\n\nThe finite sequences are represented by functions on `Fin k` and `Fin n`.\nThus the source's one-based entry `a_i` is `a ⟨i - 1, _⟩` in Lean; in\nparticular, `a_1` is `a 0` and `a_k` is the entry whose value is `k - 1`.\n-/\n\nnamespace Problem\n\n/-- The order and range assumptions on the finite integer sequences.\n\nThe four order components say, respectively:\n* the first `a`-entry is greater than `1`;\n* consecutive `a`-entries are strictly increasing;\n* the last `a`-entry is strictly less than the first `b`-entry;\n* consecutive `b`-entries are strictly increasing.\n\nThe hypotheses `k ≥ 2` and `n ≥ 1` ensure the indexed sequences are nonempty.\nThe conditions are indexed by the values of `Fin` elements, so no dependent\n`k - 1` indexing or proof term is needed in this definition. -/\ndef ChainConditions (k n : ℕ) (a : Fin k → ℤ) (b : Fin n → ℤ) : Prop :=\n 2 ≤ k ∧\n 1 ≤ n ∧\n (∀ i : Fin k, i.val = 0 → (1 : ℤ) < a i) ∧\n (∀ i j : Fin k, i.val + 1 = j.val → a i < a j) ∧\n (∀ i : Fin k, ∀ j : Fin n,\n i.val + 1 = k → j.val = 0 → a i < b j) ∧\n (∀ i j : Fin n, i.val + 1 = j.val → b i < b j)\n\n/-- The source hypothesis that the sum of the `a_i` is greater than the sum\nof the `b_j`. -/\ndef SumGreater (k n : ℕ) (a : Fin k → ℤ) (b : Fin n → ℤ) : Prop :=\n (∑ i : Fin k, a i) > (∑ j : Fin n, b j)\n\n/-- The asserted conclusion that the product of the `a_i` is greater than the\nproduct of the `b_j`. -/\ndef ProductGreater (k n : ℕ) (a : Fin k → ℤ) (b : Fin n → ℤ) : Prop :=\n (∏ i : Fin k, a i) > (∏ j : Fin n, b j)\n\n/-- The complete implication stated by the problem, with all objects and\nquantifiers in the source order: first `k`, then `n`, then the two finite\ninteger sequences, followed by the order assumptions, the sum hypothesis, and\nthe product conclusion. -/\ndef Target : Prop :=\n ∀ (k n : ℕ) (a : Fin k → ℤ) (b : Fin n → ℤ),\n ChainConditions k n a b →\n SumGreater k n a b →\n ProductGreater k n a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "42c9d135-60f7-5749-a25f-6e65a02ca9c9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3865aee32402a1e02e43a282a0f665f3db3c40ebe024a96b6c5594e425dd848a", "task_path": "tasks/nmp3_42c9d135-60f7-5749-a25f-6e65a02ca9c9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "42c9d135-60f7-5749-a25f-6e65a02ca9c9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4342f142-4b30-5da3-814a-929420407568", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A natural number $m$ is called **ziba** if every integer $n$ with $1\\le n\\le m$ can be expressed as a sum of distinct positive divisors of $m$. Prove that there exist infinitely many natural numbers of the form $k^2+k+2022$ that are ziba.\nimport Mathlib\n\n/-!\n# Ziba numbers\n\nThe source problem defines a natural number `m` to be *ziba* when every integer\n`n` with `1 ≤ n ≤ m` is a sum of distinct positive divisors of `m`, and then\nclaims that infinitely many natural numbers of the form `k^2 + k + 2022` are\nziba.\n\nThis file records the definitions and the target proposition. No proof of the\ntarget is supplied.\n-/\n\nnamespace Problem\n\n/-- A natural number `m` is ziba if every integer `n` satisfying\n`1 ≤ n ≤ m` can be written as a sum of distinct positive divisors of `m`.\n\nThe witness `s` is a finset of natural numbers. Its elements are therefore\ndistinct by construction; membership in `s` explicitly requires each element to\nbe positive and to divide `m`. The sum is taken in `ℤ`, matching the integer\nquantification over `n`. -/\ndef IsZiba (m : ℕ) : Prop :=\n ∀ n : ℤ, 1 ≤ n → n ≤ (m : ℤ) →\n ∃ s : Finset ℕ,\n (∀ d : ℕ, d ∈ s → 0 < d ∧ d ∣ m) ∧\n s.sum (fun d : ℕ => (d : ℤ)) = n\n\n/-- A natural number has the required polynomial form for some natural\nparameter `k`. -/\ndef IsOfForm (m : ℕ) : Prop :=\n ∃ k : ℕ, m = k ^ 2 + k + 2022\n\n/-- The set of natural numbers that are both ziba and of the form\n`k^2 + k + 2022`. -/\ndef candidates : Set ℕ :=\n {m : ℕ | IsZiba m ∧ IsOfForm m}\n\n/-- The assertion of the problem: there are infinitely many ziba natural\nnumbers of the form `k^2 + k + 2022`. -/\ndef Target : Prop :=\n candidates.Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4342f142-4b30-5da3-814a-929420407568", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "48ab3f5105f4960d20b018b0df6e4c967cb8dc87e301cb0964a89b208b69e423", "task_path": "tasks/nmp3_4342f142-4b30-5da3-814a-929420407568", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4342f142-4b30-5da3-814a-929420407568", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_43442941-05cb-513c-b62a-91c78dfe6c4d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ such that $a+b+c=2$. Prove that \n-- \\[\n-- \\sqrt{4a^{2}+bc}+\\sqrt{4b^{2}+ca}+\\sqrt{4c^{2}+ab}\\le 5.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable radical inequality\n\nThe source problem asks one to prove an inequality for all nonnegative real\ntriples `(a, b, c)` whose sum is `2`. The proposition below records exactly\nthat assertion; no proof is supplied in this file.\n-/\n\nnamespace Problem\n\n/-- The full assertion from the problem: for every real triple `a b c` with\n`a ≥ 0`, `b ≥ 0`, `c ≥ 0`, and `a + b + c = 2`, the sum of the three real\nsquare roots is at most `5`.\n\nThe order of the quantifiers and hypotheses follows the source text. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a + b + c = 2 →\n Real.sqrt (4 * a ^ 2 + b * c) +\n Real.sqrt (4 * b ^ 2 + c * a) +\n Real.sqrt (4 * c ^ 2 + a * b) ≤\n 5\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "43442941-05cb-513c-b62a-91c78dfe6c4d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5a524bf743b21bd944b9c9978b01e1cfe5c246b3b51f35b2119c9d8d5f79b198", "task_path": "tasks/nmp3_43442941-05cb-513c-b62a-91c78dfe6c4d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "43442941-05cb-513c-b62a-91c78dfe6c4d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_434bb305-7e92-593c-b9a3-b1ecbb788e20", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{1}{a^{3}+b^{3}+1}+\\frac{1}{b^{3}+c^{3}+1}+\\frac{1}{c^{3}+a^{3}+1}\\le \\frac{3}{abc+2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose sum is `3`, the inequality\n\n`1 / (a^3 + b^3 + 1) + 1 / (b^3 + c^3 + 1) + 1 / (c^3 + a^3 + 1)\n ≤ 3 / (a * b * c + 2)`.\n\nThis file only states the problem; it does not assert a proof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissibility conditions for the variables in the source problem:\n`a`, `b`, and `c` are positive and have sum `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The left-hand side of the target inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n 1 / (a ^ 3 + b ^ 3 + 1) +\n 1 / (b ^ 3 + c ^ 3 + 1) +\n 1 / (c ^ 3 + a ^ 3 + 1)\n\n/-- The right-hand side of the target inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 3 / (a * b * c + 2)\n\n/-- The inequality asserted in the source, at fixed values of the variables. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n lhs a b c ≤ rhs a b c\n\n/-- The complete proposition requested by the source problem: for every triple of\npositive real numbers with sum `3`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → InequalityHolds a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "434bb305-7e92-593c-b9a3-b1ecbb788e20", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7187993e30cc4092431018eecb0fe4c963784f9c54b2adf2ae45cc6ff52b292e", "task_path": "tasks/nmp3_434bb305-7e92-593c-b9a3-b1ecbb788e20", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "434bb305-7e92-593c-b9a3-b1ecbb788e20", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4351c1ee-f42a-5265-8c2d-51fa5562bb0e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=1$. Prove that \n-- \\[\n-- \\sum_{cyc}\\sqrt{\\frac{a}{\\,b+1\\,}}\\le \\frac32\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The cyclic sum `∑_cyc sqrt (a / (b + 1))`, expanded in the order\n`a ↦ b ↦ c ↦ a`. -/\nnoncomputable def CyclicSumSqrt (a b c : ℝ) : ℝ :=\n Real.sqrt (a / (b + 1)) + Real.sqrt (b / (c + 1)) + Real.sqrt (c / (a + 1))\n\n/-- For positive real `a`, `b`, `c` with `a + b + c = 1`, the cyclic sum\n`sqrt (a / (b + 1)) + sqrt (b / (c + 1)) + sqrt (c / (a + 1))` is at most `3/2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a + b + c = (1 : ℝ) →\n CyclicSumSqrt a b c ≤ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4351c1ee-f42a-5265-8c2d-51fa5562bb0e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9dc7b5b78b0d5ba0495fe54af5b6589537a6e75609312040f74f9f2fc2fdab00", "task_path": "tasks/nmp3_4351c1ee-f42a-5265-8c2d-51fa5562bb0e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4351c1ee-f42a-5265-8c2d-51fa5562bb0e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4362f4a3-7208-575c-a7d9-f84b9c773077", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\frac1{a^2}+\\frac1{b^2}+\\frac1{c^2}\\ge a^2+b^2+c^2\\, .\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement\n\nThe source problem asks, for all positive real numbers `a`, `b`, and `c`\nwhose sum is `3`, to prove the inequality\n\n`1 / a ^ 2 + 1 / b ^ 2 + 1 / c ^ 2 ≥ a ^ 2 + b ^ 2 + c ^ 2`.\n-/\n\nnamespace Problem\n\n/-- The complete proposition asserted by the problem.\n\nThe three strict positivity hypotheses and the sum constraint are antecedent\nhypotheses whose scope includes the displayed real inequality. All variables\nrange over `ℝ`, and all powers have natural exponent `2`. Division is real\ndivision by the squared denominator.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 3 →\n ((1 : ℝ) / (a ^ (2 : ℕ)) +\n (1 : ℝ) / (b ^ (2 : ℕ)) +\n (1 : ℝ) / (c ^ (2 : ℕ)) : ℝ) ≥\n a ^ (2 : ℕ) + b ^ (2 : ℕ) + c ^ (2 : ℕ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4362f4a3-7208-575c-a7d9-f84b9c773077", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "27c6c5ece429c81751c5f5acf59731db25f5fad0f39cefcdc707a7f1f21609e8", "task_path": "tasks/nmp3_4362f4a3-7208-575c-a7d9-f84b9c773077", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4362f4a3-7208-575c-a7d9-f84b9c773077", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_43850936-ac86-536a-a774-f1df31f8268f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $a,b,c$,\n-- \\[\n-- \\sqrt{\\frac{11a}{5a+6b}}+\\sqrt{\\frac{11b}{5b+6c}}+\\sqrt{\\frac{11c}{5c+6a}}\\le 3.\n-- \\]\nmodule\n\npublic import Mathlib.Analysis.Real.Sqrt\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The cyclic radical term `√(11x / (5x + 6y))`. The expression is total on `ℝ`\n(as is `Real.sqrt` in Mathlib); the target applies it only under positivity hypotheses. -/\nnoncomputable def term (x y : ℝ) : ℝ :=\n Real.sqrt ((11 : ℝ) * x / ((5 : ℝ) * x + (6 : ℝ) * y))\n\n/-- For all positive real numbers `a`, `b`, and `c`,\n`√(11a/(5a+6b)) + √(11b/(5b+6c)) + √(11c/(5c+6a)) ≤ 3`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n term a b + term b c + term c a ≤ (3 : ℝ)\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "43850936-ac86-536a-a774-f1df31f8268f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4ee40cebab15f295bb924284649492b250396033feedc250539c4580caf09114", "task_path": "tasks/nmp3_43850936-ac86-536a-a774-f1df31f8268f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "43850936-ac86-536a-a774-f1df31f8268f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_438beb75-b022-5ed0-9975-1d0c77ba2247", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge0$ be real numbers satisfying $x+y+z=3$. Prove that \n-- \\[\n-- \\bigl(x^{3}+y^{3}+z^{3}\\bigr)\\bigl(x^{3}y^{3}+y^{3}z^{3}+z^{3}x^{3}\\bigr)\\le 36\\,(xy+yz+zx)\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the inequality problem\n\nThe source problem asks to prove the following statement: for all nonnegative\nreal numbers `x`, `y`, and `z` whose sum is `3`, the displayed inequality holds.\nNo answer is asserted here; `Target` is the proposition to be proved.\n-/\n\nnamespace Problem\n\n/-- The proposition asserted by the problem. It quantifies over all real\n`x`, `y`, and `z` subject to the nonnegativity and sum constraints, and states\nthe displayed product inequality. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 ≤ x →\n 0 ≤ y →\n 0 ≤ z →\n x + y + z = 3 →\n (x ^ 3 + y ^ 3 + z ^ 3) *\n (x ^ 3 * y ^ 3 + y ^ 3 * z ^ 3 + z ^ 3 * x ^ 3) ≤\n 36 * (x * y + y * z + z * x)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "438beb75-b022-5ed0-9975-1d0c77ba2247", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a6f6c9c37f7a530094b9560cd747d4dd2ba24289df1a38909d7c80a83acfdb38", "task_path": "tasks/nmp3_438beb75-b022-5ed0-9975-1d0c77ba2247", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "438beb75-b022-5ed0-9975-1d0c77ba2247", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_43e4e19a-8d2a-5c34-accd-188081202f85", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $a,b,c$,\n-- \\[\n-- \\frac{a^2+ac}{b^2+bc}+\\frac{b^2+ba}{c^2+ca}+\\frac{c^2+cb}{a^2+ab}\\ge 2\\Big(\\frac{a}{b+c}+\\frac{b}{a+c}+\\frac{c}{a+b}\\Big).\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the target inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe inequality\n\n\\[\n\\frac{a^2+ac}{b^2+bc}+\\frac{b^2+ba}{c^2+ca}\n +\\frac{c^2+cb}{a^2+ab}\n\\ge 2\\left(\\frac{a}{b+c}+\\frac{b}{a+c}+\\frac{c}{a+b}\\right).\n\\]\n\nThis file records the mathematical assertion as a proposition. It deliberately\ncontains no proof of the assertion.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the target inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + a * c) / (b ^ 2 + b * c)\n + (b ^ 2 + b * a) / (c ^ 2 + c * a)\n + (c ^ 2 + c * b) / (a ^ 2 + a * b)\n\n/-- The right-hand side of the target inequality, without the explicit\nmultiplication by `2`. -/\ndef rhsBase (a b c : ℝ) : ℝ :=\n a / (b + c) + b / (a + c) + c / (a + b)\n\n/-- The right-hand side of the target inequality, including the explicit\nmultiplication by `2`. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 2 * rhsBase a b c\n\n/-- For all positive real numbers `a`, `b`, and `c`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → rhs a b c ≤ lhs a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "43e4e19a-8d2a-5c34-accd-188081202f85", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "62cfc1035619a77513620e4eed6594938a402f587e0b2c54217b6b16d83b98dd", "task_path": "tasks/nmp3_43e4e19a-8d2a-5c34-accd-188081202f85", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "43e4e19a-8d2a-5c34-accd-188081202f85", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_44091c02-e5b6-51a3-b24b-b77c400cf317", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb R$ satisfy $a^{2}+b^{2}+c^{2}=1$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}a\\arctan a\\;\\ge\\;\\frac{\\pi}{6\\sqrt{a^{4}+b^{4}+c^{4}}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic arctangent inequality\n\nThis file records the statement of the problem. It intentionally contains no\nproof of the target proposition.\n-/\n\nnamespace Problem\n\n/-- The admissible triples are the real triples on the unit Euclidean sphere. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 = 1\n\n/-- The cyclic sum `a * arctan a + b * arctan b + c * arctan c`. -/\nnoncomputable def CyclicArctanSum (a b c : ℝ) : ℝ :=\n a * Real.arctan a + b * Real.arctan b + c * Real.arctan c\n\n/-- The sum of fourth powers occurring under the square root. -/\ndef FourthPowerSum (a b c : ℝ) : ℝ :=\n a ^ 4 + b ^ 4 + c ^ 4\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def InequalityRHS (a b c : ℝ) : ℝ :=\n Real.pi / (6 * Real.sqrt (FourthPowerSum a b c))\n\n/-- The asserted inequality for a fixed triple. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n CyclicArctanSum a b c ≥ InequalityRHS a b c\n\n/-- The complete universal statement of the problem.\n\nFor every real triple `(a, b, c)` satisfying `a^2 + b^2 + c^2 = 1`, the cyclic\nsum of `x * arctan x` is at least `pi / (6 * sqrt (a^4 + b^4 + c^4))`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Constraint a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "44091c02-e5b6-51a3-b24b-b77c400cf317", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "60cdb91b5e1401f16d62ab19f0cbdbe4ebca8d5ed22e487dab52e232ec1b2fdb", "task_path": "tasks/nmp3_44091c02-e5b6-51a3-b24b-b77c400cf317", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "44091c02-e5b6-51a3-b24b-b77c400cf317", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_444c0b8d-7dd1-597f-94fc-036600d7d571", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Consider a $50\\times50$ grid of squares, each containing an integer. Let $G$ be the configuration of eight squares obtained by taking a $3\\times3$ block and removing its central square (i.e., a $3\\times3$ “donut”). It is given that for every placement of $G$ inside the $50\\times50$ grid the sum of the integers in its eight squares is positive. Prove that there exists a $2\\times2$ block of four adjacent squares whose sum is also positive.\nimport Mathlib\n\n/-!\n# Formalization of the 50 by 50 donut-sum problem\n\nThe grid is represented by a function assigning an integer to every pair of\nrow and column indices in `Fin 50`. A `3 × 3` donut placement is anchored at\nits upper-left corner. Its eight-square sum omits the central cell. A\n`2 × 2` block is likewise anchored at its upper-left corner.\n-/\n\nnamespace Problem\n\n/-- The integer entries of a 50 by 50 grid. -/\nabbrev Grid : Type := Fin 50 → Fin 50 → ℤ\n\n/-- The row (or column) obtained by shifting an anchored `3 × 3` block\nby an offset in `Fin 3`. -/\ndef shift3 (i : Fin 48) (d : Fin 3) : Fin 50 :=\n ⟨i.val + d.val, by omega⟩\n\n/-- The row (or column) obtained by shifting an anchored `2 × 2` block\nby an offset in `Fin 2`. -/\ndef shift2 (i : Fin 49) (d : Fin 2) : Fin 50 :=\n ⟨i.val + d.val, by omega⟩\n\n/-- The eight relative positions in a `3 × 3` donut: every position in a\n`3 × 3` block except the central position `(1, 1)`. -/\ndef donutOffsets : Finset (Fin 3 × Fin 3) :=\n Finset.univ.erase ((1 : Fin 3), (1 : Fin 3))\n\n/-- Sum of the eight entries in the donut whose upper-left square is at\nrow `i` and column `j`. -/\ndef donutSum (a : Grid) (i j : Fin 48) : ℤ :=\n donutOffsets.sum (fun p => a (shift3 i p.1) (shift3 j p.2))\n\n/-- Sum of the four entries in the `2 × 2` block whose upper-left square is\nat row `i` and column `j`. -/\ndef squareSum (a : Grid) (i j : Fin 49) : ℤ :=\n ∑ dr : Fin 2, ∑ dc : Fin 2, a (shift2 i dr) (shift2 j dc)\n\n/-- Every donut placement has a positive sum. -/\ndef AllDonutsPositive (a : Grid) : Prop :=\n ∀ i : Fin 48, ∀ j : Fin 48, 0 < donutSum a i j\n\n/-- Some `2 × 2` block has a positive sum. -/\ndef HasPositiveSquare (a : Grid) : Prop :=\n ∃ i : Fin 49, ∃ j : Fin 49, 0 < squareSum a i j\n\n/-- The assertion of the problem: for every integer-filled `50 × 50` grid,\nif every placed `3 × 3` donut has positive sum, then some `2 × 2` block has\npositive sum. -/\ndef Target : Prop :=\n ∀ a : Grid, AllDonutsPositive a → HasPositiveSquare a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "444c0b8d-7dd1-597f-94fc-036600d7d571", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "528ffd889e3053e91693d6bfc10c8f4e7f1a3b953102932d62797777990100c5", "task_path": "tasks/nmp3_444c0b8d-7dd1-597f-94fc-036600d7d571", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "444c0b8d-7dd1-597f-94fc-036600d7d571", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_44a764e1-aeba-5d87-a54b-695c11c267d6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle and let $P$ be a point inside it such that $\\angle PAC = \\angle PBC$. Let $L$ be the foot of the perpendicular from $P$ to $BC$, and let $M$ be the foot of the perpendicular from $P$ to $CA$. Let $D$ be the midpoint of $AB$. Prove that $DL = DM$.\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Geometry.Euclidean.Projection\nimport Mathlib.Analysis.Convex.Topology\nimport Mathlib.Analysis.InnerProductSpace.PiL2\n\nnoncomputable section\n\nopen scoped EuclideanGeometry RealInnerProductSpace\nopen Set\n\nnamespace Problem\n\n/-- The ambient Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Three points form a nondegenerate triangle precisely when they are not collinear. -/\ndef NondegenerateTriangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- A point lies strictly inside the triangle with vertices `A`, `B`, and `C`. -/\ndef InsideTriangle (P A B C : Plane) : Prop :=\n P ∈ interior (convexHull ℝ ({A, B, C} : Set Plane))\n\n/-- The supporting affine line through two points. -/\ndef LineThrough (B C : Plane) : AffineSubspace ℝ Plane :=\n affineSpan ℝ ({B, C} : Set Plane)\n\n/-- The perpendicular foot from `P` to the line through `B` and `C`, defined as the\northogonal projection of `P` onto that line. -/\nnoncomputable def PerpendicularFoot (P B C : Plane) : Plane :=\n let s : AffineSubspace ℝ Plane := LineThrough B C\n letI : Nonempty s :=\n ⟨⟨B, subset_affineSpan ℝ ({B, C} : Set Plane) (by simp)⟩⟩\n (EuclideanGeometry.orthogonalProjection s P : Plane)\n\n/-- The midpoint of the segment from `A` to `B`. -/\ndef MidpointOf (A B : Plane) : Plane :=\n midpoint ℝ A B\n\n/-- The full assertion of the problem: if `ABC` is a triangle, `P` is strictly inside, and\n`∠PAC = ∠PBC`, then the perpendicular feet from `P` to `BC` and `CA`, together with the\nmidpoint of `AB`, satisfy `DL = DM`. -/\ndef Target : Prop :=\n ∀ (A B C P : Plane),\n NondegenerateTriangle A B C →\n InsideTriangle P A B C →\n EuclideanGeometry.angle P A C = EuclideanGeometry.angle P B C →\n dist (MidpointOf A B) (PerpendicularFoot P B C) =\n dist (MidpointOf A B) (PerpendicularFoot P C A)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "44a764e1-aeba-5d87-a54b-695c11c267d6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fb7a24d1b5701edbc5090f7dbc9d1db8d9b7a0470a8fedb6360af6c60d4d5db9", "task_path": "tasks/nmp3_44a764e1-aeba-5d87-a54b-695c11c267d6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "44a764e1-aeba-5d87-a54b-695c11c267d6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_44b3b23a-df85-57cc-a84e-854b8b404016", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{a\\sqrt{2a+b+c}}+\\frac{1}{b\\sqrt{2b+c+a}}+\\frac{1}{c\\sqrt{2c+a+b}}\\ge\\frac32.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The strict positivity assumptions on the three variables. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The product-one constraint on the three variables. -/\ndef ProductOne (a b c : ℝ) : Prop :=\n a * b * c = 1\n\n/-- The admissible triples in the problem: three positive real numbers whose\nproduct is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Positive a b c ∧ ProductOne a b c\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n 1 / (a * Real.sqrt (2 * a + b + c)) +\n 1 / (b * Real.sqrt (2 * b + c + a)) +\n 1 / (c * Real.sqrt (2 * c + a + b))\n\n/-- The inequality stated in the problem, universally quantified over all\nadmissible real triples. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ (3 : ℝ) / 2\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "44b3b23a-df85-57cc-a84e-854b8b404016", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "565f5b4886afe2a6eba9657c5e6f05eaf4e44e0905946f332841ef7352ec19af", "task_path": "tasks/nmp3_44b3b23a-df85-57cc-a84e-854b8b404016", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "44b3b23a-df85-57cc-a84e-854b8b404016", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_44b94a75-a22e-506e-8f1a-d3ee61f9131d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers. Prove that \n-- \\[\n-- \\sqrt{a^2+3b^2}+\\sqrt{b^2+3c^2}+\\sqrt{c^2+3a^2}\\ge \\sqrt{7(a^2+b^2+c^2)+5(ab+bc+ca)}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the three-term square-root inequality\n\nThe original problem asks one to prove, for every real triple `(a, b, c)`, an\ninequality involving the principal real square roots. The statement is\npackaged as a proposition-valued definition; no proof is asserted here.\n-/\n\nnamespace Problem\n\n/-- For all real numbers `a`, `b`, and `c`,\n`√(a² + 3b²) + √(b² + 3c²) + √(c² + 3a²)` is at least\n`√(7(a² + b² + c²) + 5(ab + bc + ca))`, where `√` denotes the\ninequality-correct principal real square root. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n Real.sqrt (a ^ 2 + 3 * b ^ 2) +\n Real.sqrt (b ^ 2 + 3 * c ^ 2) +\n Real.sqrt (c ^ 2 + 3 * a ^ 2)\n ≥ Real.sqrt (7 * (a ^ 2 + b ^ 2 + c ^ 2) +\n 5 * (a * b + b * c + c * a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "44b94a75-a22e-506e-8f1a-d3ee61f9131d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f2ce3219e6cf52e4ee1bfce71eada66b49f8a70b4997522184c4538cebc68260", "task_path": "tasks/nmp3_44b94a75-a22e-506e-8f1a-d3ee61f9131d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "44b94a75-a22e-506e-8f1a-d3ee61f9131d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_44bc5808-8703-5c0b-af09-da411353343d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be the side lengths of a triangle (so \\(a,b,c>0\\) and \\(a1$ be a real number such that \n-- \\[\n-- \\lim_{n\\to\\infty}x^{\\,n}\\{x^{\\,n}\\}=0,\n-- \\] \n-- where $\\{y\\}=y-\\lfloor y\\rfloor$ denotes the fractional part of $y$. Prove that $x$ is an integer.\nimport Mathlib\n\n/-!\n# Formalization of the fractional-part limit problem\n\nThe source problem asks to prove that any real number `x > 1` for which\n`x ^ n * {x ^ n}` tends to zero as `n` tends to infinity must be an integer.\n\nThis file only states the problem. It deliberately contains no proof of the\ntarget proposition.\n-/\n\nnamespace Problem\n\n/-- The fractional part of a real number, explicitly defined as in the\nstatement: `{y} = y - floor y`. -/\nnoncomputable def fractionalPart (y : ℝ) : ℝ :=\n y - (⌊y⌋ : ℝ)\n\n/-- The sequence term `x ^ n * {x ^ n}` from the problem, as a function of\nthe natural-number index `n`. -/\nnoncomputable def fractionalPartTerm (x : ℝ) (n : ℕ) : ℝ :=\n x ^ n * fractionalPart (x ^ n)\n\n/-- The limit condition appearing in the problem. It is a limit along the\nnatural numbers, so `Filter.atTop` is the filter `n → ∞`. -/\nnoncomputable def FractionalPartLimitCondition (x : ℝ) : Prop :=\n Filter.Tendsto (fractionalPartTerm x) Filter.atTop (nhds (0 : ℝ))\n\n/-- A real number is an integer when it is the image of an integer under the\ncanonical coercion `ℤ → ℝ`. -/\ndef IsIntegerReal (x : ℝ) : Prop :=\n ∃ z : ℤ, x = (z : ℝ)\n\n/-- The two hypotheses of the problem for a fixed real number `x`, kept as a\npredicate for purposes of alignment and classification. -/\ndef Admissible (x : ℝ) : Prop :=\n (1 : ℝ) < x ∧ FractionalPartLimitCondition x\n\n/-- The full statement to be proved: for every real number `x` satisfying\n`1 < x` and the stated fractional-part limit, `x` is an integer.\n\nThe two hypotheses are written explicitly in the implication rather than\nhidden in a separate admissibility assumption. -/\ndef Target : Prop :=\n ∀ (x : ℝ),\n (1 : ℝ) < x →\n FractionalPartLimitCondition x →\n IsIntegerReal x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "453b8f89-5069-50be-985d-ef54bb6e7283", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "862737e45b21cb8b5392ab8c0323294fdb4d14eac0942b07a53fe41fb1c5008b", "task_path": "tasks/nmp3_453b8f89-5069-50be-985d-ef54bb6e7283", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "453b8f89-5069-50be-985d-ef54bb6e7283", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4556cc93-bc25-5020-ac27-19ea1211fd93", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x$ and $y$ be elements of an arbitrary group such that \n-- \\[\n-- x^{-1}y^{2}x = y^{3}\\qquad\\text{and}\\qquad y^{-1}x^{2}y = x^{3}.\n-- \\]\n-- Prove that $x$ and $y$ are the identity element (i.e. $x=y=e$).\nimport Mathlib\n\nnamespace Problem\n\nuniverse u\n\n/-- The assertion of the problem: in every group, if elements `x` and `y` satisfy\n`x⁻¹ * y ^ 2 * x = y ^ 3` and `y⁻¹ * x ^ 2 * y = x ^ 3`, then both are the\nidentity element. This declaration records the proposition to be proved; it does\nnot assert a proof. -/\ndef Target : Prop :=\n ∀ (G : Type u) [Group G] (x y : G),\n x⁻¹ * y ^ 2 * x = y ^ 3 →\n y⁻¹ * x ^ 2 * y = x ^ 3 →\n x = (1 : G) ∧ y = (1 : G)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4556cc93-bc25-5020-ac27-19ea1211fd93", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b9876d0ed60794bdf3091b2af39c75800e1209d224d28082654d88ecbb47f0c2", "task_path": "tasks/nmp3_4556cc93-bc25-5020-ac27-19ea1211fd93", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4556cc93-bc25-5020-ac27-19ea1211fd93", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_45b6fec5-cca8-53ff-b2c1-00a5b4c65469", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let M be a real number with M > 2. Prove that there exists an infinite increasing sequence of positive integers \n-- \\(a_{1}M^{i}\\) for every integer \\(i\\ge 1\\); \n-- \n-- 2. For every non‑zero integer \\(n\\) there exist a positive integer \\(m\\) and signs \\(\\varepsilon_{1},\\dots ,\\varepsilon_{m}\\in\\{-1,1\\}\\) with \n-- \\[\n-- n=\\varepsilon_{1}a_{1}+\\varepsilon_{2}a_{2}+\\cdots+\\varepsilon_{m}a_{m},\n-- \\] \n-- while no such representation exists for \\(n=0\\).\nimport Mathlib\n\nnamespace Problem\n\n/-- The signed sum of the initial segment `a₁, …, aₘ`, where the sign at\nposition `j` is `ε j`. The sequence is indexed by `ℕ`; index `0` is not part\nof the original sequence, so position `j : Fin m` uses `a (j.val + 1)`. -/\ndef SignedSum (a : ℕ → ℕ) (m : ℕ) (ε : Fin m → ℤ) : ℤ :=\n ∑ j : Fin m, ε j * (a (j.val + 1) : ℤ)\n\n/-- There are a positive number `m` of terms and signs `ε₁, …, εₘ ∈ {-1, 1}`\nsuch that `n` is the signed sum of the initial segment `a₁, …, aₘ`. -/\ndef HasSignedRepresentation (a : ℕ → ℕ) (n : ℤ) : Prop :=\n ∃ m : ℕ, 0 < m ∧ ∃ ε : Fin m → ℤ,\n (∀ j : Fin m, ε j = 1 ∨ ε j = -1) ∧\n n = SignedSum a m ε\n\n/-- Every term whose source index is a positive integer is positive. -/\ndef PositiveOnPositiveIndices (a : ℕ → ℕ) : Prop :=\n ∀ i : ℕ, 0 < i → 0 < a i\n\n/-- Consecutive source terms are strictly increasing, expressing\n`a₁ < a₂ < a₃ < …`. -/\ndef StrictlyIncreasingOnPositiveIndices (a : ℕ → ℕ) : Prop :=\n ∀ i : ℕ, 0 < i → a i < a (i + 1)\n\n/-- The growth condition `aᵢ > Mⁱ` for every source index `i ≥ 1`. -/\ndef GrowthBound (M : ℝ) (a : ℕ → ℕ) : Prop :=\n ∀ i : ℕ, 0 < i → (a i : ℝ) > M ^ i\n\n/-- Every nonzero integer has a signed representation by an initial segment\n`a₁, …, aₘ` with all signs equal to `1` or `-1`. -/\ndef RepresentsEveryNonzeroInteger (a : ℕ → ℕ) : Prop :=\n ∀ n : ℤ, n ≠ 0 → HasSignedRepresentation a n\n\n/-- No initial segment of the sequence has a signed sum equal to zero. -/\ndef NoZeroSignedRepresentation (a : ℕ → ℕ) : Prop :=\n ¬ HasSignedRepresentation a 0\n\n/-- The full admissibility predicate for a sequence `a` relative to `M`. -/\ndef IsAdmissibleSequence (M : ℝ) (a : ℕ → ℕ) : Prop :=\n PositiveOnPositiveIndices a ∧\n StrictlyIncreasingOnPositiveIndices a ∧\n GrowthBound M a ∧\n RepresentsEveryNonzeroInteger a ∧\n NoZeroSignedRepresentation a\n\n/-- The whole assertion: for every real `M > 2`, there exists an infinite\nstrictly increasing sequence `a₁, a₂, …` of positive integers satisfying the\ngrowth condition and the signed-representation condition, with no signed\nrepresentation of `0`. -/\ndef Target : Prop :=\n ∀ M : ℝ, M > 2 → ∃ a : ℕ → ℕ, IsAdmissibleSequence M a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "45b6fec5-cca8-53ff-b2c1-00a5b4c65469", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0ddb5bfdb7dbba1f2ae6a37f1b60bc49c672cf2f167e4161228875c6f847a92e", "task_path": "tasks/nmp3_45b6fec5-cca8-53ff-b2c1-00a5b4c65469", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "45b6fec5-cca8-53ff-b2c1-00a5b4c65469", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_45c8402b-44c8-5e5b-a638-08b3ed30087c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c>0$ with $a^2+b^2+c^2=1$, prove that \n-- \\[\n-- \\frac{a}{1+a\\sqrt{1+a^2}}+\\frac{b}{1+b\\sqrt{1+b^2}}+\\frac{c}{1+c\\sqrt{1+c^2}}\\le\\frac{3\\sqrt{3}}{5}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable real inequality\n\nThe source problem asks for a proof of an inequality for positive real numbers\n`a`, `b`, and `c` satisfying `a^2 + b^2 + c^2 = 1`.\n-/\n\nnamespace Problem\n\n/-- The summand `x / (1 + x * sqrt (1 + x^2))`. -/\nnoncomputable def term (x : ℝ) : ℝ :=\n x / (1 + x * Real.sqrt (1 + x ^ 2))\n\n/-- The left-hand side of the inequality, as a function of the three variables. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n term a + term b + term c\n\n/-- The right-hand side `3 * sqrt 3 / 5` of the inequality. -/\nnoncomputable def rhs : ℝ :=\n (3 * Real.sqrt 3) / 5\n\n/-- The three variables are all strictly positive. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The squared-sum constraint `a^2 + b^2 + c^2 = 1`. -/\ndef SquaredSumOne (a b c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 = 1\n\n/-- The assertion to be proved: for all positive real `a`, `b`, and `c` with\n`a^2 + b^2 + c^2 = 1`, the stated sum is at most `3 * sqrt 3 / 5`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Positive a b c →\n SquaredSumOne a b c →\n lhs a b c ≤ rhs\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "45c8402b-44c8-5e5b-a638-08b3ed30087c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "06b644e5a43cc01a17bf4748a855624133e12c057f2236123d874ef9be29f3f2", "task_path": "tasks/nmp3_45c8402b-44c8-5e5b-a638-08b3ed30087c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "45c8402b-44c8-5e5b-a638-08b3ed30087c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_45d03c3e-5d94-55c0-88ed-23efe2e61be6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that $\\displaystyle\\frac1a+\\frac1b+\\frac1c=1$. Prove that \n-- \\[\n-- \\frac{\\sqrt a}{a^{2}+3bc}+\\frac{\\sqrt b}{b^{2}+3ac}+\\frac{\\sqrt c}{c^{2}+3ab}\\le \\frac{3}{4\\bigl(\\sqrt a+\\sqrt b+\\sqrt c\\bigr)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable radical inequality\n\nFor positive real `a`, `b`, and `c` satisfying\n`1 / a + 1 / b + 1 / c = 1`, the problem asserts\n\n`sqrt a / (a^2 + 3 b c) + sqrt b / (b^2 + 3 a c)\n + sqrt c / (c^2 + 3 a b) ≤ 3 / (4 (sqrt a + sqrt b + sqrt c))`.\n\nThe declarations below separately record the admissibility conditions, the\nthree summands, the two sides of the inequality, and the quantified target\nproposition. No proof of the target is supplied here.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The three positivity hypotheses on the variables. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The reciprocal-sum constraint on the variables. -/\ndef ReciprocalSumOne (a b c : ℝ) : Prop :=\n 1 / a + 1 / b + 1 / c = 1\n\n/-- The complete admissibility condition from the problem: positive real\nvariables whose reciprocals sum to one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositiveTriple a b c ∧ ReciprocalSumOne a b c\n\n/-- The summand corresponding to `a`, namely `sqrt a / (a^2 + 3 b c)`. -/\ndef leftTermA (a b c : ℝ) : ℝ :=\n Real.sqrt a / (a ^ 2 + 3 * (b * c))\n\n/-- The summand corresponding to `b`, namely `sqrt b / (b^2 + 3 a c)`. -/\ndef leftTermB (a b c : ℝ) : ℝ :=\n Real.sqrt b / (b ^ 2 + 3 * (a * c))\n\n/-- The summand corresponding to `c`, namely `sqrt c / (c^2 + 3 a b)`. -/\ndef leftTermC (a b c : ℝ) : ℝ :=\n Real.sqrt c / (c ^ 2 + 3 * (a * b))\n\n/-- The left-hand side of the asserted inequality. -/\ndef LHS (a b c : ℝ) : ℝ :=\n leftTermA a b c + leftTermB a b c + leftTermC a b c\n\n/-- The right-hand side of the asserted inequality. -/\ndef RHS (a b c : ℝ) : ℝ :=\n 3 / (4 * (Real.sqrt a + Real.sqrt b + Real.sqrt c))\n\n/-- The inequality asserted for a fixed triple `(a, b, c)`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≤ RHS a b c\n\n/-- The complete proposition asserted by the problem: for every triple of\npositive real numbers satisfying the reciprocal-sum condition, the displayed\nleft-hand side is at most the displayed right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n Inequality a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "45d03c3e-5d94-55c0-88ed-23efe2e61be6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bd2221852b4525d873af1d5a98bfb2bd2689de407058d0085bf2c5552d1d37b3", "task_path": "tasks/nmp3_45d03c3e-5d94-55c0-88ed-23efe2e61be6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "45d03c3e-5d94-55c0-88ed-23efe2e61be6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_45d7f2f6-ff65-566d-a51c-d2aa5802cdea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exists exactly one infinite sequence of positive integers \\((a_n)_{n\\ge1}\\) satisfying \n-- \n-- \\[\n-- a_1=1,\\qquad a_2>1,\\qquad a_{n+1}^3+1=a_n\\,a_{n+2}\\ \\text{ for all }n\\ge1 .\n-- \\]\n-- \n-- In other words, determine the unique integer sequence with \\(a_1=1\\) and the recurrence \\(a_{n+2}=\\frac{a_{n+1}^3+1}{a_n}\\).\nimport Mathlib.Data.PNat.Basic\n\n/-!\n# Formal statement: a uniquely determined positive-integer recurrence sequence\n\nThe source problem asks for unique existence of an infinite sequence of positive\nintegers indexed by `n ≥ 1`, with `a₁ = 1`, `a₂ > 1`, and\n`aₙ₊₁³ + 1 = aₙ * aₙ₊₂` for every `n ≥ 1`.\n\nWe represent an index `n ≥ 1` by `ℕ+`, so the original index and the Lean index\nagree literally. The sequence values are natural numbers, and positivity is an\nexplicit hypothesis in `Admissible`; thus the codomain is not silently restricted.\n-/\n\nnamespace Problem\n\n/-- The recurrence sequence is admissible if it is an infinite sequence of\npositive integers, starts with `a 1 = 1` and `a 2 > 1`, and satisfies the\nmultiplicative form of the recurrence for every positive index. -/\ndef Admissible (a : ℕ+ → ℕ) : Prop :=\n (∀ n : ℕ+, 0 < a n) ∧\n a 1 = 1 ∧\n 1 < a 2 ∧\n ∀ n : ℕ+, (a (n + 1)) ^ 3 + 1 = a n * a (n + 2)\n\n/-- The assertion from the problem: there exists exactly one positive-integer\nsequence satisfying the three stated conditions. -/\ndef Target : Prop :=\n ∃! a : ℕ+ → ℕ, Admissible a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "45d7f2f6-ff65-566d-a51c-d2aa5802cdea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2ec949fd65aa4e5ca9a2539d90902647fe1ed8787890d9f7381e38c6b9794f19", "task_path": "tasks/nmp3_45d7f2f6-ff65-566d-a51c-d2aa5802cdea", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "45d7f2f6-ff65-566d-a51c-d2aa5802cdea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_45e03ac8-3d89-5f97-8a50-c2edce7e1973", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\in\\mathbb{R}^+$ satisfy $xy+yz+zx+2xyz=1$. Prove that \n-- \\[\n-- \\sqrt{\\frac{x}{\\,y+z+2yz\\,}}+\\sqrt{\\frac{y}{\\,z+x+2zx\\,}}+\\sqrt{\\frac{z}{\\,x+y+2xy\\,}}\\ge\\sqrt{3}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of an inequality in three positive real variables\n\nSource problem: for positive real numbers `x`, `y`, `z` satisfying\n`x*y + y*z + z*x + 2*x*y*z = 1`, prove that\n\n`sqrt (x / (y + z + 2*y*z)) + sqrt (y / (z + x + 2*z*x))\n + sqrt (z / (x + y + 2*x*y)) ≥ sqrt 3`.\n\nThis file only states the assertion; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The three variables are strictly positive real numbers.\n\nThe source writes `x,y,z ∈ ℝ⁺`; here `ℝ⁺` is interpreted as the strictly\npositive reals, i.e. `0 < x`, `0 < y`, and `0 < z`. -/\ndef PositiveTriple (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The constraint `xy + yz + zx + 2xyz = 1`. -/\ndef Constraint (x y z : ℝ) : Prop :=\n x * y + y * z + z * x + 2 * x * y * z = 1\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def LeftHandSide (x y z : ℝ) : ℝ :=\n Real.sqrt (x / (y + z + 2 * y * z)) +\n Real.sqrt (y / (z + x + 2 * z * x)) +\n Real.sqrt (z / (x + y + 2 * x * y))\n\n/-- The formal target: for all strictly positive real `x`, `y`, `z` satisfying\n`xy + yz + zx + 2xyz = 1`, the displayed square-root sum is at least `sqrt 3`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, PositiveTriple x y z → Constraint x y z →\n LeftHandSide x y z ≥ Real.sqrt 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "45e03ac8-3d89-5f97-8a50-c2edce7e1973", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "83565aa28a227666b13fd66332bf0b94ec8287f70a0136f8226bc836f3fab6b1", "task_path": "tasks/nmp3_45e03ac8-3d89-5f97-8a50-c2edce7e1973", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "45e03ac8-3d89-5f97-8a50-c2edce7e1973", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_466793f3-45b4-52d8-99d7-8662150104a0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $C$ is a positive integer and $\\{a_n\\}_{n\\ge1}$ is an infinite sequence of positive integers satisfying \n-- \\[\n-- a_{n+1}=\\sqrt{a_n^{\\,3}-C a_n}\\qquad\\text{for all }n\\in\\mathbb Z^+ .\n-- \\] \n-- Prove that the sequence $\\{a_n\\}$ must be eventually constant; i.e. there exists $N\\in\\mathbb Z^+$ such that \n-- \\[\n-- a_N=a_{N+1}=a_{N+2}=\\dots .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of an eventually-constant sequence problem\n\nThe problem concerns a positive integer `C` and an infinite sequence of\npositive integers indexed by `ℤ⁺`. We model the index set by `ℕ+`\n(`PNat`), the subtype of positive natural numbers.\n\nThe square root is the usual nonnegative real square root; the integer\nequality is represented by equality after coercion to `ℝ`.\n-/\n\nnamespace Problem\n\n/-- The sequence consists only of positive integers. -/\ndef PositiveSequence (a : ℕ+ → ℕ) : Prop :=\n ∀ n : ℕ+, 0 < a n\n\n/-- The recurrence `a (n + 1) = sqrt (a n ^ 3 - C * a n)` for every\npositive integer index `n`. The values on the right are regarded in `ℝ`,\nas is standard for the real square-root operation. -/\ndef Recurrence (C : ℕ) (a : ℕ+ → ℕ) : Prop :=\n ∀ n : ℕ+,\n (a (n + 1) : ℝ) =\n Real.sqrt ((a n : ℝ) ^ 3 - (C : ℝ) * (a n : ℝ))\n\n/-- The sequence is eventually constant: from some positive index `N`\nonward, every term equals `a N`. -/\ndef EventuallyConstant (a : ℕ+ → ℕ) : Prop :=\n ∃ N : ℕ+, ∀ n : ℕ+, N ≤ n → a n = a N\n\n/-- The hypotheses of the problem: `C` is positive, the sequence has\npositive integer terms, and the recurrence holds at every positive index. -/\ndef Admissible (C : ℕ) (a : ℕ+ → ℕ) : Prop :=\n 0 < C ∧ PositiveSequence a ∧ Recurrence C a\n\n/-- The full assertion: for every positive integer `C` and every infinite\nsequence of positive integers satisfying the recurrence, the sequence is\neventually constant. -/\ndef Target : Prop :=\n ∀ (C : ℕ) (a : ℕ+ → ℕ), Admissible C a → EventuallyConstant a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "466793f3-45b4-52d8-99d7-8662150104a0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "af5d672d71ad05c99aa32a773b9539a71f0255e1e93252a9552cc5e327a703fd", "task_path": "tasks/nmp3_466793f3-45b4-52d8-99d7-8662150104a0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "466793f3-45b4-52d8-99d7-8662150104a0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_467501a9-927e-5c09-939d-6ec37cae9aee", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there does not exist a function $f:\\mathbb{R}\\to\\mathbb{R}$ such that $f(f(x)) = x^2 - 2$ for all real $x$.\nimport Mathlib\n\nnamespace Problem\n\n/-- A function `f : ℝ → ℝ` satisfies the equation from the problem when\n`f (f x) = x ^ 2 - 2` for every real number `x`. -/\ndef SatisfiesEquation (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, f (f x) = x ^ 2 - (2 : ℝ)\n\n/-- There is no function `f : ℝ → ℝ` whose second iterate is\n`x ↦ x ^ 2 - 2` at every real input. -/\ndef Target : Prop :=\n ¬ ∃ f : ℝ → ℝ, SatisfiesEquation f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "467501a9-927e-5c09-939d-6ec37cae9aee", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "59e275c7497287097778c3a7d6121a4774216c69690396320b05e8f6ba949b75", "task_path": "tasks/nmp3_467501a9-927e-5c09-939d-6ec37cae9aee", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "467501a9-927e-5c09-939d-6ec37cae9aee", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_46756cfb-98fe-5d1f-8144-9e99ca155e9d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{ab}{a^{2}+3b^{2}}+\\frac{bc}{b^{2}+3c^{2}}+\\frac{ac}{c^{2}+3a^{2}}\\le \\frac34\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a * b) / (a ^ 2 + 3 * b ^ 2) +\n (b * c) / (b ^ 2 + 3 * c ^ 2) +\n (a * c) / (c ^ 2 + 3 * a ^ 2)\n\n/-- The assertion: for all positive real numbers `a`, `b`, and `c`, the given\nsum is at most `3 / 4`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n lhs a b c ≤ (3 : ℝ) / 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "46756cfb-98fe-5d1f-8144-9e99ca155e9d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "68d49528b1b22ef61e56c3a711b778857bc2c7683f9c6a15c98df393e921ebaa", "task_path": "tasks/nmp3_46756cfb-98fe-5d1f-8144-9e99ca155e9d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "46756cfb-98fe-5d1f-8144-9e99ca155e9d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_46bd16b0-ba57-5695-bddc-5d4e90ea043a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle with incenter $I$. Let $D$, $E$, $F$ be the feet of the perpendiculars from $I$ to $BC$, $CA$, and $AB$, respectively. Choose a point $H$ on line $EF$ such that $DH\\perp EF$. Let $M\\neq H$ be the second intersection of line $HB$ with the circumcircle of $\\triangle HAE$, and let $N\\neq H$ be the second intersection of line $HC$ with the circumcircle of $\\triangle HAF$. Prove that the midpoints of $BC$, $MN$, and $AH$ lie on a common straight line.\nimport Mathlib\n\n/-!\n# Formal statement: feet of the incenter and a line through midpoints\n\nThis file gives a coordinate formalization of the statement in `problem.md`.\nAll objects are points of the real Euclidean plane, represented by pairs of\nreal coordinates. The target is a proposition; no proof of it is supplied.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- A point of the Euclidean plane with coordinates `(x, y)`. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- The vector from `P` to `Q`. -/\ndef vsub (Q P : Point) : Point := (Q.1 - P.1, Q.2 - P.2)\n\n/-- The sum of two vectors (or, with a choice of origin, of two points). -/\ndef vadd (P Q : Point) : Point := (P.1 + Q.1, P.2 + Q.2)\n\n/-- Scalar multiplication of a vector. -/\ndef smul (c : ℝ) (P : Point) : Point := (c * P.1, c * P.2)\n\n/-- The dot product of two vectors. -/\ndef dot (P Q : Point) : ℝ := P.1 * Q.1 + P.2 * Q.2\n\n/-- The two-dimensional scalar cross product. -/\ndef cross (P Q : Point) : ℝ := P.1 * Q.2 - P.2 * Q.1\n\n/-- The square of the Euclidean distance between two points. -/\ndef distSq (P Q : Point) : ℝ := (P.1 - Q.1) ^ 2 + (P.2 - Q.2) ^ 2\n\n/-- The midpoint of two points. -/\ndef midpoint (P Q : Point) : Point := ((P.1 + Q.1) / 2, (P.2 + Q.2) / 2)\n\n/-- Three points are collinear when the two vectors from the first point to the\nother two are linearly dependent. This includes the cases where points\ncoincide. -/\ndef Collinear (P Q R : Point) : Prop := cross (vsub Q P) (vsub R P) = 0\n\n/-- `X` lies on the (nondegenerate) line through `P` and `Q`. -/\ndef OnLine (P Q X : Point) : Prop := P ≠ Q ∧ Collinear P Q X\n\n/-- The segments `PQ` and `UV` are perpendicular, with each segment having\ndistinct endpoints. -/\ndef PerpendicularSegments (P Q U V : Point) : Prop :=\n P ≠ Q ∧ U ≠ V ∧ dot (vsub Q P) (vsub V U) = 0\n\n/-- `X` is the foot of the perpendicular from `P` to the line through `U` and\n`V`. -/\ndef IsFoot (X P U V : Point) : Prop :=\n U ≠ V ∧ Collinear U V X ∧ dot (vsub P X) (vsub V U) = 0\n\n/-- The affine combination `x • P + y • Q + z • R`, written in coordinates. -/\ndef affineCombination (x y z : ℝ) (P Q R : Point) : Point :=\n (x * P.1 + y * Q.1 + z * R.1, x * P.2 + y * Q.2 + z * R.2)\n\n/-- The point is strictly inside the triangle with vertices `P`, `Q`, and `R`.\nStrict interior is expressed by all three barycentric coordinates being\nstrictly positive; the triangle itself is required to be nondegenerate. -/\ndef StrictlyInsideTriangle (P Q R X : Point) : Prop :=\n ¬ Collinear P Q R ∧\n ∃ x y z : ℝ,\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = 1 ∧\n X = affineCombination x y z P Q R\n\n/-- The square of the distance from `X` to the line through `U` and `V`. -/\ndef distSqToLine (X U V : Point) : ℝ :=\n (cross (vsub V U) (vsub X U)) ^ 2 / distSq U V\n\n/-- `I` is the incenter of the triangle `ABC`: it is strictly inside the\nnondegenerate triangle and its squared distances to the three side lines\n`BC`, `CA`, and `AB` are equal. -/\ndef IsIncenter (A B C I : Point) : Prop :=\n ¬ Collinear A B C ∧\n StrictlyInsideTriangle A B C I ∧\n distSqToLine I B C = distSqToLine I C A ∧\n distSqToLine I C A = distSqToLine I A B\n\n/-- `X` lies on the circumcircle of the nondegenerate triangle `PQR`. A\ncircle is represented by its center, and this predicate says that the four\npoints have a common center, equivalently a common squared radius. -/\ndef OnCircumcircle (X P Q R : Point) : Prop :=\n ¬ Collinear P Q R ∧\n ∃ O : Point,\n distSq O X = distSq O P ∧\n distSq O P = distSq O Q ∧ distSq O Q = distSq O R\n\n/-- `X` is the second intersection of the line through `P` and `Q` with the\ncircumcircle of the triangle `PRS`. The point `P` is common to the line and\nthe circle, and `X` is required to be different from it. -/\ndef IsSecondIntersectionLineCircle (X P Q R S : Point) : Prop :=\n P ≠ Q ∧ X ≠ P ∧ OnLine P Q X ∧ OnCircumcircle X P R S\n\n/-- All of the hypotheses in the problem for a configuration consisting of the\ntriangle, its incenter, the three feet, the point `H`, and the two second\nintersections `M` and `N`. -/\ndef Configuration (A B C I D E F H M N : Point) : Prop :=\n IsIncenter A B C I ∧\n IsFoot D I B C ∧\n IsFoot E I C A ∧\n IsFoot F I A B ∧\n OnLine E F H ∧\n PerpendicularSegments D H E F ∧\n IsSecondIntersectionLineCircle M H B A E ∧\n IsSecondIntersectionLineCircle N H C A F\n\n/-- The midpoints of `BC`, `MN`, and `AH` are collinear. -/\ndef MidpointsCollinear (A B C H M N : Point) : Prop :=\n Collinear (midpoint B C) (midpoint M N) (midpoint A H)\n\n/-- The complete assertion of the problem: for every configuration of the\nspecified form, the three midpoints are collinear. -/\ndef Target : Prop :=\n ∀ A B C I D E F H M N : Point,\n Configuration A B C I D E F H M N → MidpointsCollinear A B C H M N\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "46bd16b0-ba57-5695-bddc-5d4e90ea043a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "85e775662680b718af717fe6004f40531081ee28ec8f69cfee3a74ec59091961", "task_path": "tasks/nmp3_46bd16b0-ba57-5695-bddc-5d4e90ea043a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "46bd16b0-ba57-5695-bddc-5d4e90ea043a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_46d32210-133a-5af6-b29f-7ed578e7e5b2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x$, $y$, $z$ be positive real numbers. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\sqrt{(x-y)^2+\\frac{4x^2y^2}{(x+z)(y+z)}}\\;\\ge\\;x+y+z.\n-- \\]\nimport Mathlib\n\n/-!\n# Cyclic square-root inequality\n\nThe source problem asks for a proof of an inequality in three positive real\nvariables. This file records the statement only: `Problem.Target` is a\ndefinition whose value is the proposition to be proved, rather than a theorem\nproof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The radicand in one cyclic summand:\n`(x - y)^2 + 4*x^2*y^2 / ((x + z) * (y + z))`. -/\ndef cyclicRadicand (x y z : ℝ) : ℝ :=\n (x - y) ^ 2 + 4 * x ^ 2 * y ^ 2 / ((x + z) * (y + z))\n\n/-- One cyclic summand, the real square root of `cyclicRadicand x y z`. -/\ndef cyclicTerm (x y z : ℝ) : ℝ :=\n Real.sqrt (cyclicRadicand x y z)\n\n/-- The cyclic sum of `cyclicTerm` over the three cyclic permutations\n`(x,y,z)`, `(y,z,x)`, and `(z,x,y)`. -/\ndef cyclicSum (x y z : ℝ) : ℝ :=\n cyclicTerm x y z + cyclicTerm y z x + cyclicTerm z x y\n\n/-- The statement to prove: for all positive real numbers `x`, `y`, and `z`,\nthe cyclic sum is at least `x + y + z`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → cyclicSum x y z ≥ x + y + z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "46d32210-133a-5af6-b29f-7ed578e7e5b2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "de29d2c7def2dd8ca5c95761883162b776148230f14401def6d67ed3072d34f4", "task_path": "tasks/nmp3_46d32210-133a-5af6-b29f-7ed578e7e5b2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "46d32210-133a-5af6-b29f-7ed578e7e5b2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_46ec86d1-a3f4-5fca-a20f-ded57427ce90", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge 0$ with $x+y+z=1$. Prove that \n-- \\[\n-- \\sqrt{x+\\frac{(y-z)^2}{3}}+\\sqrt y+\\sqrt z\\le\\sqrt3.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The standing nonnegativity condition on each variable. -/\ndef Nonnegative (x : ℝ) : Prop :=\n 0 ≤ x\n\n/-- The standing normalization condition `x + y + z = 1`. -/\ndef SumToOne (x y z : ℝ) : Prop :=\n x + y + z = 1\n\n/-- The admissible domain of the problem: nonnegative real variables summing to one. -/\ndef Admissible (x y z : ℝ) : Prop :=\n Nonnegative x ∧ Nonnegative y ∧ Nonnegative z ∧ SumToOne x y z\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n Real.sqrt (x + (y - z) ^ 2 / 3) + Real.sqrt y + Real.sqrt z\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs : ℝ :=\n Real.sqrt 3\n\n/-- The full assertion: for all nonnegative real `x`, `y`, `z` with `x + y + z = 1`,\n`sqrt (x + (y - z)^2 / 3) + sqrt y + sqrt z ≤ sqrt 3`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → lhs x y z ≤ rhs\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "46ec86d1-a3f4-5fca-a20f-ded57427ce90", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "471638f301ac480fae058e3d07c1033635918ff8694128de891f3e305537325c", "task_path": "tasks/nmp3_46ec86d1-a3f4-5fca-a20f-ded57427ce90", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "46ec86d1-a3f4-5fca-a20f-ded57427ce90", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_46fab08c-4ae4-50bb-9ed2-4dab6c47eddf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(p,q,r\\) be distinct prime numbers. Prove that the Diophantine equation \n-- \\[\n-- z^{\\,r}+x^{\\,p}=2\\,y^{\\,q}\n-- \\]\n-- has infinitely many integer solutions with \\(x>1,\\;y>1,\\;z>1\\) and \\(z^{\\,r}\\neq x^{\\,p}\\).\nimport Mathlib\n\n/-!\n# Formal statement: infinitely many solutions to a three-prime exponential Diophantine equation\n\nThe original problem fixes pairwise distinct prime numbers `p`, `q`, and `r` and asks\nfor a proof that the integer equation `z ^ r + x ^ p = 2 * y ^ q` has infinitely many\ninteger solutions satisfying `x > 1`, `y > 1`, `z > 1`, and `z ^ r ≠ x ^ p`.\n\nThis file only states the proposition. It deliberately contains no proof of it.\n-/\n\nnamespace Problem\n\n/-- The admissibility predicate for one integer solution `(x, y, z)`, with the three\nprime exponents as parameters. -/\ndef IsIntegerSolution (p q r : ℕ) (x y z : ℤ) : Prop :=\n z ^ r + x ^ p = (2 : ℤ) * y ^ q ∧\n (1 : ℤ) < x ∧ (1 : ℤ) < y ∧ (1 : ℤ) < z ∧ z ^ r ≠ x ^ p\n\n/-- The set of admissible integer solutions `(x, y, z)` for fixed exponents `p`, `q`,\nand `r`. The tuple is ordered as `(x, y, z)`. -/\ndef IntegerSolutionSet (p q r : ℕ) : Set (ℤ × ℤ × ℤ) :=\n {v | IsIntegerSolution p q r v.1 v.2.1 v.2.2}\n\n/-- The full assertion of the problem: for every ordered triple of pairwise distinct\nprime exponents `p`, `q`, and `r`, the admissible integer solution set is infinite. -/\ndef Target : Prop :=\n ∀ p q r : ℕ,\n Nat.Prime p → Nat.Prime q → Nat.Prime r →\n p ≠ q → p ≠ r → q ≠ r →\n (IntegerSolutionSet p q r).Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "46fab08c-4ae4-50bb-9ed2-4dab6c47eddf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d42a2cdd2fcd5e6c63de29a1b7c5cce0a76e8cc93a2979f6734cfa8df14d829e", "task_path": "tasks/nmp3_46fab08c-4ae4-50bb-9ed2-4dab6c47eddf", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "46fab08c-4ae4-50bb-9ed2-4dab6c47eddf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_472ed96e-be33-5b01-94f6-4450e261bfc8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- $$a^{2}+b^{2}+c^{2}+3\\ge ab+bc+ca+a+b+c.$$\nimport Mathlib\n\nnamespace Problem\n\n/--\nLet `a`, `b`, and `c` be positive real numbers satisfying `a * b * c = 1`.\nThen `a ^ 2 + b ^ 2 + c ^ 2 + 3` is at least\n`a * b + b * c + c * a + a + b + c`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a * b * c = 1 →\n a ^ 2 + b ^ 2 + c ^ 2 + 3 ≥\n a * b + b * c + c * a + a + b + c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "472ed96e-be33-5b01-94f6-4450e261bfc8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f84ae6266520c18114db70a15ad9123a9ee7bef32a623041dccfb3c47ca7313a", "task_path": "tasks/nmp3_472ed96e-be33-5b01-94f6-4450e261bfc8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "472ed96e-be33-5b01-94f6-4450e261bfc8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_47367ac1-cfdd-51c8-902b-d62a5086e4a4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be real numbers such that $a^{2}+b^{2}+c^{2}+d^{2}=4$. Prove that \n-- \\[\n-- \\frac{ab}{5-ab}+\\frac{bc}{5-bc}+\\frac{cd}{5-cd}+\\frac{da}{5-da}\\le 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion from the problem: for all real numbers `a`, `b`, `c`, and `d`\nwhose squares sum to `4`, the cyclic sum of the given fractions is at most `1`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = 4 →\n a * b / (5 - a * b) +\n b * c / (5 - b * c) +\n c * d / (5 - c * d) +\n d * a / (5 - d * a) ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "47367ac1-cfdd-51c8-902b-d62a5086e4a4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5888328bcfd93b0d8d749fabde264993fb13a3a593edd52763863fc7b6d578ed", "task_path": "tasks/nmp3_47367ac1-cfdd-51c8-902b-d62a5086e4a4", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "47367ac1-cfdd-51c8-902b-d62a5086e4a4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_476a4fee-f9b4-5252-9917-d604719d8114", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c>0$ with $a^2+b^2+c^2=3$, prove that \n-- \\[\n-- \\frac{a^2-b}{b+c}+\\frac{b^2-c}{c+a}+\\frac{c^2-a}{a+b}\\ge\\frac{(a-b)^2+(b-c)^2+(c-a)^2}{24}.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the problem statement:\n\nGiven `a b c > 0` with `a^2 + b^2 + c^2 = 3`, prove that\n`(a^2 - b) / (b + c) + (b^2 - c) / (c + a) + (c^2 - a) / (a + b)`\nis at least\n`((a - b)^2 + (b - c)^2 + (c - a)^2) / 24`.\n\nThis file only states the target; it does not contain a proof.\n-/\n\nnamespace Problem\n\n/-- The hypothesis that all three variables are positive. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The normalization hypothesis `a^2 + b^2 + c^2 = 3`. -/\ndef Normalized (a b c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 = 3\n\n/-- The asserted inequality, with the terms and parentheses exactly as in the\nproblem statement. It is stated for arbitrary real `a`, `b`, `c`; the target\nbelow adds the hypotheses under which the problem asserts it. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (a ^ 2 - b) / (b + c) + (b ^ 2 - c) / (c + a) + (c ^ 2 - a) / (a + b)\n ≥ ((a - b) ^ 2 + (b - c) ^ 2 + (c - a) ^ 2) / 24\n\n/-- The full mathematical claim of the problem: for all real numbers\n`a`, `b`, `c` that are positive and satisfy `a^2 + b^2 + c^2 = 3`, the\ninequality `Inequality a b c` holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Positive a b c → Normalized a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "476a4fee-f9b4-5252-9917-d604719d8114", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dafa044cd0e672c68db082cf96b75543ce3de44828c79cf6138572c32b31587b", "task_path": "tasks/nmp3_476a4fee-f9b4-5252-9917-d604719d8114", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "476a4fee-f9b4-5252-9917-d604719d8114", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_47c27c84-4c6f-5570-9872-b8c49326a364", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $ab+bc+ca=3$. Prove that \n-- \\[\n-- \\frac{a}{\\sqrt{a^{3}+5}}+\\frac{b}{\\sqrt{b^{3}+5}}+\\frac{c}{\\sqrt{c^{3}+5}}\\le \\frac{\\sqrt6}{2}\\,.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The admissibility conditions for the variables in the problem:\n`a`, `b`, and `c` are positive real numbers satisfying `ab + bc + ca = 3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n (0 < a ∧ 0 < b ∧ 0 < c) ∧ a * b + b * c + c * a = 3\n\n/-- The left-hand side of the desired inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a / Real.sqrt (a ^ 3 + 5) +\n b / Real.sqrt (b ^ 3 + 5) +\n c / Real.sqrt (c ^ 3 + 5)\n\n/-- The right-hand side of the desired inequality. -/\ndef rhs : ℝ :=\n Real.sqrt 6 / 2\n\n/-- The statement to be proved: for all positive real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca = 3`, the given sum is at most `sqrt 6 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≤ rhs\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "47c27c84-4c6f-5570-9872-b8c49326a364", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8ae8f286c4e0fb164267d2eca0fedb46deddd4feb78a43300eb41cd09a4a9219", "task_path": "tasks/nmp3_47c27c84-4c6f-5570-9872-b8c49326a364", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "47c27c84-4c6f-5570-9872-b8c49326a364", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_47d1b379-8a17-569e-b836-542be1cdfa77", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that the cyclic sum \n-- \n-- \\[\n-- S=\\frac{(x+y)(y+z)}{2y^{2}+(z+x)^{2}}+\\frac{(y+z)(z+x)}{2z^{2}+(x+y)^{2}}+\\frac{(z+x)(x+y)}{2x^{2}+(y+z)^{2}}\n-- \\]\n-- \n-- satisfies \n-- \n-- \\[\n-- \\frac12\\le S\\le 2\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a cyclic rational inequality\n\nThe source problem asks to prove, for all positive real numbers `x`, `y`, and\n`z`, that the explicitly displayed cyclic sum `S` lies between `1/2` and `2`.\nThe declarations below record that assertion without proving it.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum displayed in the problem statement. -/\nnoncomputable def S (x y z : ℝ) : ℝ :=\n ((x + y) * (y + z)) / ((2 : ℝ) * y ^ 2 + (z + x) ^ 2) +\n ((y + z) * (z + x)) / ((2 : ℝ) * z ^ 2 + (x + y) ^ 2) +\n ((z + x) * (x + y)) / ((2 : ℝ) * x ^ 2 + (y + z) ^ 2)\n\n/-- For all positive real `x`, `y`, and `z`, the cyclic sum `S` satisfies\n`1/2 ≤ S ≤ 2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n (1 / 2 : ℝ) ≤ S x y z ∧ S x y z ≤ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "47d1b379-8a17-569e-b836-542be1cdfa77", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9793b14722826febe77ebad6c86909d15aca4bd21146f5d167ca53d0613ec87b", "task_path": "tasks/nmp3_47d1b379-8a17-569e-b836-542be1cdfa77", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "47d1b379-8a17-569e-b836-542be1cdfa77", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_47f44a12-5c1d-5e0c-a7d4-a54ebf2d196b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge0$. Prove that \n-- \\[\n-- -3\\,(x+y^2)(y+z^2)(z+x^2)+2\\,(x+y^3)(x^2+z^3)+2\\,(y+z^3)(x^3+y^2)+2\\,(z+x^3)(y^3+z^2)\\ge0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the nonnegative-variable polynomial inequality\n\nThe source problem asks to prove a single polynomial inequality for nonnegative\nreal variables. We isolate the left-hand side and state the universal target.\nNo proof of the target is supplied here.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality\n`-3 (x + y^2)(y + z^2)(z + x^2)\n + 2 (x + y^3)(x^2 + z^3)\n + 2 (y + z^3)(x^3 + y^2)\n + 2 (z + x^3)(y^3 + z^2)`. -/\ndef lhs (x y z : ℝ) : ℝ :=\n -3 * (x + y ^ 2) * (y + z ^ 2) * (z + x ^ 2)\n + 2 * (x + y ^ 3) * (x ^ 2 + z ^ 3)\n + 2 * (y + z ^ 3) * (x ^ 3 + y ^ 2)\n + 2 * (z + x ^ 3) * (y ^ 3 + z ^ 2)\n\n/-- The assertion that the left-hand side is nonnegative, for fixed variables. -/\ndef inequalityHolds (x y z : ℝ) : Prop :=\n 0 ≤ lhs x y z\n\n/-- The source assertion: for all nonnegative real `x`, `y`, and `z`, the stated\nleft-hand side is nonnegative. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 ≤ x → 0 ≤ y → 0 ≤ z → inequalityHolds x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "47f44a12-5c1d-5e0c-a7d4-a54ebf2d196b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7ae5637e278008a15bbc88f0532440ab1870b1c883174ad93ffe0cb808248a99", "task_path": "tasks/nmp3_47f44a12-5c1d-5e0c-a7d4-a54ebf2d196b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "47f44a12-5c1d-5e0c-a7d4-a54ebf2d196b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_48059303-fe60-5d84-8311-bcedc9feff06", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(A,+,\\cdot)$ be a ring with $1+1\\neq0$. Let $U(A)=\\{a_1,a_2,\\dots,a_n\\}$ be the set of all units of $A$. Suppose there exists a bijection $\\sigma:\\{1,2,\\dots,n\\}\\to\\{1,2,\\dots,n\\}$ such that \n-- $$a_{\\sigma(1)}\\cdot a_{\\sigma(2)}\\cdots a_{\\sigma(n)}=1.$$ \n-- Prove that $4\\mid n$.\nimport Mathlib\n\n/-!\n# Formal statement of the unit-enumeration divisibility problem\n\nThe problem concerns a unital ring `A`. The units of `A` are represented by\nMathlib's unit group `Aˣ`. Since the problem does not assume multiplication to\nbe commutative, the displayed product is formalized as an explicitly ordered\nlist product rather than as a commutative `Finset.prod`.\n-/\n\nuniverse u\n\nnamespace Problem\n\n/-- An enumeration of all units of a monoid `A`, indexed by `Fin n`, is a\nbijection from `Fin n` to the unit group `Aˣ`. In particular, all listed\nelements are distinct units and every unit occurs exactly once. -/\ndef UnitEnumeration {A : Type u} [Monoid A] (n : ℕ) (a : Fin n → Units A) : Prop :=\n Function.Bijective a\n\n/-- The ordered product\n`a_{σ(0)} * a_{σ(1)} * ... * a_{σ(n-1)}`, regarded as an element of `A`.\nThis is the product displayed in the problem, with the indices `1, ..., n`\nrepresented by `Fin n` and with the order supplied by `List.ofFn`. -/\ndef PermutedUnitProduct {A : Type u} [Monoid A] (n : ℕ) (a : Fin n → Units A)\n (σ : Equiv.Perm (Fin n)) : A :=\n (List.ofFn fun i : Fin n => (a (σ i) : A)).prod\n\n/-- The hypothesis that some permutation of the enumeration has product one. -/\ndef HasUnitPermutationProductOne {A : Type u} [Monoid A] (n : ℕ)\n (a : Fin n → Units A) : Prop :=\n ∃ σ : Equiv.Perm (Fin n), PermutedUnitProduct n a σ = 1\n\n/-- The complete assertion of the problem: for every unital ring `A` with\n`1 + 1 ≠ 0`, every finite enumeration `a_1, ..., a_n` of all units of `A`\n(indexed by `Fin n`), if some permutation of that enumeration has product one,\nthen `4` divides `n`. -/\ndef Target : Prop :=\n ∀ (A : Type u) [Ring A], (1 + 1 : A) ≠ 0 →\n ∀ (n : ℕ) (a : Fin n → Units A),\n UnitEnumeration n a →\n HasUnitPermutationProductOne n a →\n (4 : ℕ) ∣ n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "48059303-fe60-5d84-8311-bcedc9feff06", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8a97d97351205fa152202e3715d89b6d53a1b8059d2c7d9df6b5edd1c2b56d82", "task_path": "tasks/nmp3_48059303-fe60-5d84-8311-bcedc9feff06", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "48059303-fe60-5d84-8311-bcedc9feff06", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_48174d16-0171-5981-9f74-a66be775db72", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in[-1,1]$ satisfy $a^{2}+b^{2}+c^{2}\\le 1+2abc$. Prove that for every positive integer $n$,\n-- \\[\n-- a^{2n}+b^{2n}+c^{2n}\\le 1+2(abc)^{\\,n}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nThe problem asks, for real numbers `a`, `b`, and `c` in `[-1, 1]` satisfying\n`a^2 + b^2 + c^2 ≤ 1 + 2abc`, to prove that for every positive integer `n`,\n`a^(2n) + b^(2n) + c^(2n) ≤ 1 + 2(abc)^n`.\n-/\n\nnamespace Problem\n\n/-- The closed real interval `[-1, 1]`. -/\ndef InUnitInterval (x : ℝ) : Prop :=\n x ∈ Set.Icc (-1 : ℝ) 1\n\n/-- The hypotheses of the problem: `a`, `b`, and `c` lie in `[-1, 1]` and\nsatisfy `a^2 + b^2 + c^2 ≤ 1 + 2abc`. -/\ndef Hypothesis (a b c : ℝ) : Prop :=\n InUnitInterval a ∧\n InUnitInterval b ∧\n InUnitInterval c ∧\n a ^ 2 + b ^ 2 + c ^ 2 ≤ 1 + 2 * (a * b * c)\n\n/-- The conclusion asserted for a positive integer `n`. -/\ndef Conclusion (a b c : ℝ) (n : ℕ) : Prop :=\n a ^ (2 * n) + b ^ (2 * n) + c ^ (2 * n) ≤\n 1 + 2 * (a * b * c) ^ n\n\n/-- The complete statement to be proved.\n\nThe real parameters `a`, `b`, and `c` are universally quantified, followed by\nthe hypotheses and then by the universally quantified positive natural number\n`n`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n Hypothesis a b c →\n ∀ n : ℕ, 0 < n → Conclusion a b c n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "48174d16-0171-5981-9f74-a66be775db72", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "170c99d9b15e14f31ae78f67abb82b3c30a36248ad03c4fc6d15926fe3b7c76e", "task_path": "tasks/nmp3_48174d16-0171-5981-9f74-a66be775db72", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "48174d16-0171-5981-9f74-a66be775db72", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_481b791a-eee4-55b1-8462-5fa1307c989c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers \\(a,b,c\\), prove that\n-- \\[\n-- \\frac{bc}{a^{2}+bc}+\\frac{ca}{b^{2}+ca}+\\frac{ab}{c^{2}+ab}\n-- \\le\n-- \\frac{1}{2k+1}\\Bigl(3k+\\frac{a}{b+c}+\\frac{b}{c+a}+\\frac{c}{a+b}\\Bigr),\n-- \\]\n-- where \\(k=\\tfrac12\\).\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The parameter value appearing in the inequality: k = 1/2. -/\ndef k : ℝ := 1 / 2\n\n/-- The full inequality asserted for every positive real triple (a, b, c). -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n (b * c) / (a ^ 2 + b * c)\n + (c * a) / (b ^ 2 + c * a)\n + (a * b) / (c ^ 2 + a * b)\n ≤ (1 / (2 * k + 1)) *\n (3 * k + a / (b + c) + b / (c + a) + c / (a + b))\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "481b791a-eee4-55b1-8462-5fa1307c989c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0e400bb561ddeed8f0a71a084f4bb96e6a4a80958ca1854378bec666d1c5e8e7", "task_path": "tasks/nmp3_481b791a-eee4-55b1-8462-5fa1307c989c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "481b791a-eee4-55b1-8462-5fa1307c989c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_48325142-29ed-5874-842a-8906d91e46ca", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an arbitrary triangle with side lengths $a=BC$, $b=CA$, $c=AB$, and let $m_a$, $m_b$, $m_c$ denote the lengths of the medians from vertices $A$, $B$, $C$, respectively. Prove that \n-- $$m_a(bc-a^2)+m_b(ac-b^2)+m_c(ab-c^2)\\ge0.$$\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Simplex\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used to represent a geometric triangle. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A nondegenerate Euclidean triangle, represented by three affinely independent points. -/\nabbrev Triangle : Type := Affine.Triangle ℝ Plane\n\n/-- The length `a = BC`. -/\ndef sideA (t : Triangle) : ℝ :=\n dist (t.points 1) (t.points 2)\n\n/-- The length `b = CA`. -/\ndef sideB (t : Triangle) : ℝ :=\n dist (t.points 2) (t.points 0)\n\n/-- The length `c = AB`. -/\ndef sideC (t : Triangle) : ℝ :=\n dist (t.points 0) (t.points 1)\n\n/-- The length `m_a` of the median from `A` to the midpoint of `BC`. -/\ndef medianA (t : Triangle) : ℝ :=\n dist (t.points 0) (midpoint ℝ (t.points 1) (t.points 2))\n\n/-- The length `m_b` of the median from `B` to the midpoint of `CA`. -/\ndef medianB (t : Triangle) : ℝ :=\n dist (t.points 1) (midpoint ℝ (t.points 2) (t.points 0))\n\n/-- The length `m_c` of the median from `C` to the midpoint of `AB`. -/\ndef medianC (t : Triangle) : ℝ :=\n dist (t.points 2) (midpoint ℝ (t.points 0) (t.points 1))\n\n/-- The left-hand side of the required inequality. -/\ndef lhs (t : Triangle) : ℝ :=\n medianA t * (sideB t * sideC t - (sideA t) ^ 2) +\n medianB t * (sideA t * sideC t - (sideB t) ^ 2) +\n medianC t * (sideA t * sideB t - (sideC t) ^ 2)\n\n/-- For every nondegenerate triangle `ABC` in the Euclidean plane, with\n`a = BC`, `b = CA`, `c = AB` and `m_a`, `m_b`, `m_c` the lengths of the\nmedians from `A`, `B`, `C`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ t : Triangle, 0 ≤ lhs t\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "48325142-29ed-5874-842a-8906d91e46ca", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f4ab07c6e84996c86ef8fd16f665556607d5158d3cc276fe316d9a37e033799d", "task_path": "tasks/nmp3_48325142-29ed-5874-842a-8906d91e46ca", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "48325142-29ed-5874-842a-8906d91e46ca", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_48465fc3-917b-5d06-874c-acfbc6e5ffec", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots ,a_n$ ($n\\ge 2$) be positive real numbers satisfying $a_1\\le a_2\\le\\cdots\\le a_n$. Prove that \n-- \\[\n-- \\sum_{1\\le i0$ be real numbers such that $a^{2}+b^{2}+c^{2}=1$. Prove that \n-- \\[\n-- a\\sqrt[4]{\\frac{b^{2}+1}{c^{2}+1}}+b\\sqrt[4]{\\frac{c^{2}+1}{a^{2}+1}}+c\\sqrt[4]{\\frac{a^{2}+1}{b^{2}+1}}\\le\n-- \\sqrt[4]{3\\left(\\frac{a^{2}}{b^{2}}+\\frac{b^{2}}{c^{2}}+\\frac{c^{2}}{a^{2}}\\right)}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the fourth-root inequality\n\nThis file contains only the formalization of the problem statement. In\nparticular, `Problem.Target` is a proposition-valued definition; no proof of\nthe target inequality is supplied here.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The principal real fourth root of a nonnegative real number, represented\nusing the real power with exponent `1 / 4`. In this problem every argument\nof a fourth root is positive under the stated hypotheses. -/\ndef fourthRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 4 : ℝ)\n\n/-- The left-hand side of the target inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a * fourthRoot ((b ^ 2 + 1) / (c ^ 2 + 1)) +\n b * fourthRoot ((c ^ 2 + 1) / (a ^ 2 + 1)) +\n c * fourthRoot ((a ^ 2 + 1) / (b ^ 2 + 1))\n\n/-- The right-hand side of the target inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n fourthRoot (3 * (a ^ 2 / b ^ 2 + b ^ 2 / c ^ 2 + c ^ 2 / a ^ 2))\n\n/-- The complete proposition asserted in the problem: for all positive real\nnumbers `a`, `b`, and `c` satisfying `a^2 + b^2 + c^2 = 1`, the stated\nfourth-root inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = 1 →\n lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "48dafa08-194c-54af-b005-f6cbfc0b77d6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4b296940fa6005920322b6b612903cb37beed2db6ab75698aa5cd28cea02e39b", "task_path": "tasks/nmp3_48dafa08-194c-54af-b005-f6cbfc0b77d6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "48dafa08-194c-54af-b005-f6cbfc0b77d6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4936fc80-8cfd-54d8-96b0-20fb3fda266e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A$ be an infinite set of distinct positive integers. Prove that for any constant $C$ (e.g. any positive integer) there exist distinct $a,b\\in A$ and a prime $p>C$ such that $p\\mid (a+b)\\,$.\nimport Mathlib\n\n/-!\n# Formal statement: large prime divisors of pairwise sums from an infinite set\n\nThe source problem asks us to prove that, for every infinite set `A` of positive\nintegers and every constant `C`, there are distinct `a, b ∈ A` and a prime\n`p > C` with `p ∣ a + b`.\n\nThis file contains only the formal statement (as a `Prop`-valued definition);\nno proof of the mathematical assertion is supplied.\n-/\n\nnamespace Problem\n\n/--\n`HasLargePrimePairSum A C` says that among the elements of `A` there are two\ndistinct elements `a` and `b` whose sum is divisible by some prime larger than\nthe real constant `C`.\n-/\ndef HasLargePrimePairSum (A : Set ℕ) (C : ℝ) : Prop :=\n ∃ a : ℕ, a ∈ A ∧ ∃ b : ℕ, b ∈ A ∧ a ≠ b ∧\n ∃ p : ℕ, p.Prime ∧ C < (p : ℝ) ∧ p ∣ a + b\n\n/--\nThe target assertion: for every infinite set `A` of positive integers and every\nreal constant `C`, there exist distinct `a, b ∈ A` and a prime `p > C` such that\n`p ∣ a + b`.\n\nThe set `A` is a `Set ℕ`, so its elements are automatically distinct, and the\npositivity hypothesis excludes `0` from `A`.\n-/\ndef Target : Prop :=\n ∀ A : Set ℕ, A.Infinite → (∀ a : ℕ, a ∈ A → 0 < a) →\n ∀ C : ℝ, HasLargePrimePairSum A C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4936fc80-8cfd-54d8-96b0-20fb3fda266e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f8e1485aa65a33e739169bb773e2acc1b42284e23fd1839540df71a4753509ea", "task_path": "tasks/nmp3_4936fc80-8cfd-54d8-96b0-20fb3fda266e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4936fc80-8cfd-54d8-96b0-20fb3fda266e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_49376b31-f556-5acb-b81d-780d3da3f132", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that\n-- \\[\n-- a^{3}+b^{3}+c^{3}+3abc\\;\\ge\\;ab\\sqrt{2\\!\\left(a^{2}+b^{2}\\right)}\\;+\\;bc\\sqrt{2\\!\\left(b^{2}+c^{2}\\right)}\\;+\\;ca\\sqrt{2\\!\\left(c^{2}+a^{2}\\right)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable cyclic inequality\n\nThe original problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\n\n`a^3 + b^3 + c^3 + 3abc ≥\n ab * sqrt (2(a^2+b^2)) + bc * sqrt (2(b^2+c^2)) + ca * sqrt (2(c^2+a^2))`.\n\nThe assertion is represented as a proposition-valued definition, not as a proof.\n-/\n\nnamespace Problem\n\n/-- The three strict positivity assumptions stated in the problem. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The inequality asserted in the problem, with `Real.sqrt` as the principal\nnonnegative real square root. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a ^ 3 + b ^ 3 + c ^ 3 + 3 * a * b * c ≥\n a * b * Real.sqrt (2 * (a ^ 2 + b ^ 2)) +\n b * c * Real.sqrt (2 * (b ^ 2 + c ^ 2)) +\n c * a * Real.sqrt (2 * (c ^ 2 + a ^ 2))\n\n/-- The complete statement of the problem: for every triple of positive real\nnumbers `a`, `b`, and `c`, the displayed cyclic inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "49376b31-f556-5acb-b81d-780d3da3f132", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "40c7e6992eaebc1036c756c160364ef1f24fdb83e2ee29894e986229c4dfbf8f", "task_path": "tasks/nmp3_49376b31-f556-5acb-b81d-780d3da3f132", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "49376b31-f556-5acb-b81d-780d3da3f132", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_496343ed-4898-5bc2-bd7e-d324b5557135", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that the Diophantine equation \\(6x^2 + 12x + 8 = y^3\\) has no solutions in positive integers.\nimport Mathlib\n\n/-!\n Formalization of the statement:\n\n \"Prove that the Diophantine equation\n \\(6x^2 + 12x + 8 = y^3\\) has no solutions in positive integers.\"\n\n This file only declares the target proposition. It intentionally contains no\n proof of the proposition.\n-/\n\nnamespace Problem\n\n/-- The Diophantine equation `6x^2 + 12x + 8 = y^3`, over natural numbers. -/\ndef Equation (x y : ℕ) : Prop :=\n 6 * x ^ 2 + 12 * x + 8 = y ^ 3\n\n/-- A pair `(x, y)` is a positive-integer solution precisely when both\ncoordinates are positive and satisfy `Equation`. -/\ndef IsPositiveSolution (x y : ℕ) : Prop :=\n 0 < x ∧ 0 < y ∧ Equation x y\n\n/-- The assertion that the given Diophantine equation has no positive-integer\nsolutions. -/\ndef Target : Prop :=\n ¬ ∃ x y : ℕ, IsPositiveSolution x y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "496343ed-4898-5bc2-bd7e-d324b5557135", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3eb2ed5a8ee65d34b9a768807415b5d04fe48fdafa48c2df473299f30eb6f6e8", "task_path": "tasks/nmp3_496343ed-4898-5bc2-bd7e-d324b5557135", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "496343ed-4898-5bc2-bd7e-d324b5557135", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_498594bb-7f9b-5827-9a0e-ed02bb276f62", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge -3$, $a+b+c=3$, and $a,b,c\\neq0$. Prove that \n-- \\[\n-- \\frac1{a^2}+\\frac1{b^2}+\\frac1{c^2}\\ge \\frac1{a}+\\frac1{b}+\\frac1{c}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nFor all real numbers `a`, `b`, and `c`, if each is at least `-3`, their sum is\n`3`, and none of them is zero, then\n`1 / a ^ 2 + 1 / b ^ 2 + 1 / c ^ 2 ≥ 1 / a + 1 / b + 1 / c`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n -3 ≤ a →\n -3 ≤ b →\n -3 ≤ c →\n a + b + c = 3 →\n a ≠ 0 →\n b ≠ 0 →\n c ≠ 0 →\n (1 : ℝ) / (a ^ 2) + (1 : ℝ) / (b ^ 2) + (1 : ℝ) / (c ^ 2) ≥\n (1 : ℝ) / a + (1 : ℝ) / b + (1 : ℝ) / c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "498594bb-7f9b-5827-9a0e-ed02bb276f62", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "41b26410491266872da0f2cfa998d7dd083383c262f900448567505c4a1fb725", "task_path": "tasks/nmp3_498594bb-7f9b-5827-9a0e-ed02bb276f62", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "498594bb-7f9b-5827-9a0e-ed02bb276f62", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_49920467-8880-5bf6-bc30-414dfbff918b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$ and $b$ be non‑negative integers and let $c$ be an integer such that $ab\\ge c^{2}$. Prove that there exist a non‑negative integer $n$ and integers $x_{1},\\dots,x_{n},\\;y_{1},\\dots,y_{n}$ satisfying \n-- \\[\n-- \\sum_{i=1}^{n}x_{i}^{2}=a,\\qquad \n-- \\sum_{i=1}^{n}y_{i}^{2}=b,\\qquad \n-- \\sum_{i=1}^{n}x_{i}y_{i}=c.\n-- \\]\nmodule\n\npublic import Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem: for all non-negative integers `a` and `b` and all\nintegers `c` satisfying `a * b ≥ c ^ 2`, there are a non-negative integer `n` and\ninteger families `x` and `y` indexed by `Fin n` whose coordinatewise sums of squares\nand dot product are `a`, `b`, and `c`, respectively. -/\npublic def Target : Prop :=\n ∀ (a b : ℕ) (c : ℤ),\n (a : ℤ) * (b : ℤ) ≥ c ^ 2 →\n ∃ (n : ℕ) (x y : Fin n → ℤ),\n (∑ i : Fin n, x i ^ 2) = (a : ℤ) ∧\n (∑ i : Fin n, y i ^ 2) = (b : ℤ) ∧\n (∑ i : Fin n, x i * y i) = c\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "49920467-8880-5bf6-bc30-414dfbff918b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8f653b7a2ca5e36b0047da8414c1d7abbdc0f8738201e570d60a76345a7fe1bd", "task_path": "tasks/nmp3_49920467-8880-5bf6-bc30-414dfbff918b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "49920467-8880-5bf6-bc30-414dfbff918b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_49bfe0df-b178-5aef-8cbf-b0c2ae82edff", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that $\\ln 2$ is irrational.\n/-\nFormal statement of the problem “Prove that ln 2 is irrational.”\n-/\n\nimport Mathlib.Analysis.SpecialFunctions.Log.Basic\nimport Mathlib.NumberTheory.Real.Irrational\n\nnamespace Problem\n\n/-- `Real.log 2` is irrational, where `Real.log` is the natural logarithm on `ℝ`.\n\nThe proposition is left as an unproved definition: this file only formalizes the\nmathematical assertion to be proved. -/\ndef Target : Prop :=\n Irrational (Real.log (2 : ℝ))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "49bfe0df-b178-5aef-8cbf-b0c2ae82edff", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0e51c66c8b1fe7c9a0d2555ec7eaab7a6c9b50863bc67f055390e4023643f701", "task_path": "tasks/nmp3_49bfe0df-b178-5aef-8cbf-b0c2ae82edff", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "49bfe0df-b178-5aef-8cbf-b0c2ae82edff", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_49dcebbf-edf8-5db7-9a43-5ed58b1d5a53", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $a_1,\\dots,a_n$ are integers whose greatest common divisor is $1$. Let $S$ be a set of integers satisfying the following properties: \n-- \n-- (a) $a_i\\in S$ for each $i=1,\\dots,n$; \n-- \n-- (b) $a_i-a_j\\in S$ for all $i,j\\in\\{1,\\dots,n\\}$ (not necessarily distinct); \n-- \n-- (c) For any $x,y\\in S$, if $x+y\\in S$ then $x-y\\in S$. \n-- \n-- Prove that $S$ must be equal to the set of all integers, i.e. $S=\\mathbb Z$.\nimport Mathlib.Algebra.GCDMonoid.Finset\nimport Mathlib.Data.Fin.Basic\nimport Mathlib.Data.Fintype.Fin\nimport Mathlib.Data.Set.Basic\n\n/-!\n# Formalization of the integer-set problem\n\nThe original problem fixes integers `a_1, ..., a_n` with gcd `1` and a set\n`S : Set ℤ` satisfying the three stated closure properties, and asks to prove\nthat `S` is all of `ℤ`.\n\nWe separate the three hypotheses into predicates so that the final target\nclosely mirrors the clauses of the problem. The indices are represented by\n`Fin n`, giving a zero-based indexing of the displayed list `a_1, ..., a_n`.\n-/\n\nnamespace Problem\n\n/-- The listed integers have greatest common divisor one.\n\n`Finset.univ.gcd a` is the normalized (nonnegative) gcd in `ℤ`, so this says\nthat the gcd of all values `a i` is exactly the integer `1`. -/\ndef GcdOne (n : ℕ) (a : Fin n → ℤ) : Prop :=\n (Finset.univ : Finset (Fin n)).gcd a = (1 : ℤ)\n\n/-- Clause (a): every listed integer belongs to `S`. -/\ndef PropertyA (n : ℕ) (a : Fin n → ℤ) (S : Set ℤ) : Prop :=\n ∀ i : Fin n, a i ∈ S\n\n/-- Clause (b): every difference `a_i - a_j` belongs to `S`, including when\nthe indices are equal. -/\ndef PropertyB (n : ℕ) (a : Fin n → ℤ) (S : Set ℤ) : Prop :=\n ∀ i j : Fin n, a i - a j ∈ S\n\n/-- Clause (c): whenever `x, y ∈ S` and `x + y ∈ S`, the difference\n`x - y` also belongs to `S`. -/\ndef PropertyC (S : Set ℤ) : Prop :=\n ∀ x y : ℤ, x ∈ S → y ∈ S → x + y ∈ S → x - y ∈ S\n\n/-- The conjunction of the three properties (a), (b), and (c). -/\ndef SatisfiesClauses (n : ℕ) (a : Fin n → ℤ) (S : Set ℤ) : Prop :=\n PropertyA n a S ∧ PropertyB n a S ∧ PropertyC S\n\n/-- The full assertion of the problem: for every finite listed family of\nintegers whose gcd is `1`, every integer set satisfying clauses (a)--(c) is\nthe set of all integers. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (a : Fin n → ℤ), GcdOne n a →\n ∀ S : Set ℤ, SatisfiesClauses n a S → S = (Set.univ : Set ℤ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "49dcebbf-edf8-5db7-9a43-5ed58b1d5a53", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "48af0fc69bade8c7fbac555557051edb2a8e44942185a70befe3ac7177f82e17", "task_path": "tasks/nmp3_49dcebbf-edf8-5db7-9a43-5ed58b1d5a53", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "49dcebbf-edf8-5db7-9a43-5ed58b1d5a53", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_49df0c2a-3909-57b0-ba06-6379ba8fb8c3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $g:[0,1]\\to\\mathbb{R}$ satisfy the following property: \n-- \n-- For every partition of $[0,1]$ into two non‑empty subsets $A$ and $B$ (i.e. $A\\cup B=[0,1]$, $A\\cap B=\\varnothing$, $A\\neq\\varnothing$, $B\\neq\\varnothing$) we have either \n-- \\[\n-- \\exists\\,x\\in A\\text{ such that }g(x)\\in B\\qquad\\text{or}\\qquad\\exists\\,x\\in B\\text{ such that }g(x)\\in A.\n-- \\] \n-- \n-- In addition, $g(x)>x$ for all $x\\in[0,1]$. \n-- \n-- Prove that there are infinitely many points $x\\in[0,1]$ with $g(x)=1\\,.\nimport Mathlib\n\nnamespace Problem\n\n/-- The domain `[0, 1]` of the function `g`, represented as a subtype of `ℝ`. -/\nabbrev UnitInterval : Type := Set.Icc (0 : ℝ) 1\n\n/-- A set of points in `[0, 1]`, viewed as a set of real numbers. -/\ndef toRealSet (S : Set UnitInterval) : Set ℝ :=\n Subtype.val '' S\n\n/-- `A` and `B` form a partition of `[0, 1]` into two non-empty subsets. -/\ndef IsTwoNonemptyPartition (A B : Set UnitInterval) : Prop :=\n A ∪ B = Set.univ ∧ A ∩ B = ∅ ∧ A.Nonempty ∧ B.Nonempty\n\n/-- The partition-crossing property imposed on `g`. Namely, for every partition\nof `[0, 1]` into two non-empty subsets `A` and `B`, either some `x ∈ A` has\n`g x ∈ B`, or some `x ∈ B` has `g x ∈ A`. -/\ndef PartitionProperty (g : UnitInterval → ℝ) : Prop :=\n ∀ A B : Set UnitInterval,\n IsTwoNonemptyPartition A B →\n (∃ x : UnitInterval, x ∈ A ∧ g x ∈ toRealSet B) ∨\n (∃ x : UnitInterval, x ∈ B ∧ g x ∈ toRealSet A)\n\n/-- The strict pointwise inequality `g x > x` for every `x ∈ [0, 1]`. -/\ndef StrictlyAboveIdentityOnUnitInterval (g : UnitInterval → ℝ) : Prop :=\n ∀ x : UnitInterval, g x > (x : ℝ)\n\n/-- The set of points of `[0, 1]` at which `g` takes the value `1`. -/\ndef SolutionSet (g : UnitInterval → ℝ) : Set UnitInterval :=\n {x : UnitInterval | g x = 1}\n\n/-- The complete assertion to be proved: any function on `[0, 1]` satisfying the\npartition-crossing property and lying strictly above the identity has infinitely\nmany points where it equals `1`. -/\ndef Target : Prop :=\n ∀ g : UnitInterval → ℝ,\n PartitionProperty g →\n StrictlyAboveIdentityOnUnitInterval g →\n (SolutionSet g).Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "49df0c2a-3909-57b0-ba06-6379ba8fb8c3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1e9fa15d23308cafc5122ca834727d8e4a03e17f0ea56462186d52ad086906ba", "task_path": "tasks/nmp3_49df0c2a-3909-57b0-ba06-6379ba8fb8c3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "49df0c2a-3909-57b0-ba06-6379ba8fb8c3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_49ea51fd-0851-5343-9ab1-7f31ebd36c22", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A,B,C$ be real numbers in the interval $\\displaystyle\\Bigl(0,\\frac{\\pi}{2}\\Bigr)$. Define \n-- \\[\n-- X=\\frac{\\sin A\\,\\sin(A-B)\\,\\sin(A-C)}{\\sin(B+C)},\\qquad\n-- Y=\\frac{\\sin B\\,\\sin(B-C)\\,\\sin(B-A)}{\\sin(C+A)},\\qquad\n-- Z=\\frac{\\sin C\\,\\sin(C-A)\\,\\sin(C-B)}{\\sin(A+B)}.\n-- \\] \n-- Prove that $X+Y+Z\\ge 0$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The real number denoted by `X` in the problem. -/\nnoncomputable def X (A B C : ℝ) : ℝ :=\n Real.sin A * Real.sin (A - B) * Real.sin (A - C) / Real.sin (B + C)\n\n/-- The real number denoted by `Y` in the problem. -/\nnoncomputable def Y (A B C : ℝ) : ℝ :=\n Real.sin B * Real.sin (B - C) * Real.sin (B - A) / Real.sin (C + A)\n\n/-- The real number denoted by `Z` in the problem. -/\nnoncomputable def Z (A B C : ℝ) : ℝ :=\n Real.sin C * Real.sin (C - A) * Real.sin (C - B) / Real.sin (A + B)\n\n/-- The assertion that for all real `A`, `B`, and `C` in the open interval\n`(0, π/2)`, the sum `X + Y + Z` is nonnegative. -/\ndef Target : Prop :=\n ∀ A B C : ℝ,\n A ∈ Set.Ioo 0 (Real.pi / 2) →\n B ∈ Set.Ioo 0 (Real.pi / 2) →\n C ∈ Set.Ioo 0 (Real.pi / 2) →\n X A B C + Y A B C + Z A B C ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "49ea51fd-0851-5343-9ab1-7f31ebd36c22", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c5374b2914a20ebcc0e7366da764b276c09b70ab1b80fa819c4afd28939f629e", "task_path": "tasks/nmp3_49ea51fd-0851-5343-9ab1-7f31ebd36c22", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "49ea51fd-0851-5343-9ab1-7f31ebd36c22", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4a0f8103-4335-5686-a481-d3df7e744253", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any positive real numbers $a,b,c$, \n-- \\[\n-- \\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}\\;\\ge\\;1+\\frac13\\sum_{\\text{cyc}}\\left(\\frac{a}{a+b}-\\frac{b}{b+c}\\right)^{2}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The summand of the cyclic sum, evaluated at `(a, b, c)`. -/\ndef cycSummand (a b c : ℝ) : ℝ :=\n (a / (a + b) - b / (b + c)) ^ 2\n\n/-- The cyclic sum over `(a, b, c)`, `(b, c, a)`, and `(c, a, b)`. -/\ndef cycSum (a b c : ℝ) : ℝ :=\n cycSummand a b c + cycSummand b c a + cycSummand c a b\n\n/-- For every triple of positive real numbers `a`, `b`, and `c`, the claimed\ninequality holds. The cyclic sum is expanded in `cycSum`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a) ≥\n 1 + (1 / 3 : ℝ) * cycSum a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4a0f8103-4335-5686-a481-d3df7e744253", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "009bc93da8784c1922ccb1dae4317d2278d3a027b53782ea4a66dcb8ac2d95ac", "task_path": "tasks/nmp3_4a0f8103-4335-5686-a481-d3df7e744253", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4a0f8103-4335-5686-a481-d3df7e744253", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4a0fcdc6-a124-5838-9989-1efc3f6bb2b6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $ab+bc+ca=1$. Prove that \n-- \\[\n-- \\frac{b+c}{a+bc}+\\frac{c+a}{b+ca}+\\frac{a+b}{c+ab}\\ge 2+a+b+c.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a cyclic inequality\n\nThe original problem asks to prove, for nonnegative real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca = 1`, the inequality\n\n`(b+c)/(a+bc) + (c+a)/(b+ca) + (a+b)/(c+ab) ≥ 2+a+b+c`.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition stated in the problem:\n`a`, `b`, and `c` are nonnegative real numbers with `ab + bc + ca = 1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + b * c + c * a = 1\n\n/-- The asserted inequality, under the stated admissibility condition. -/\ndef Inequality (a b c : ℝ) : Prop :=\n Admissible a b c →\n (b + c) / (a + b * c) +\n (c + a) / (b + c * a) +\n (a + b) / (c + a * b) ≥\n 2 + a + b + c\n\n/-- The complete proposition requested by the problem: for every triple of real\nnumbers satisfying the stated nonnegativity and normalization conditions, the\ndisplayed cyclic inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4a0fcdc6-a124-5838-9989-1efc3f6bb2b6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bba0c50736fbf9fa6218c83ae5624a4cf080c11a412f4254c59495f2a9419d26", "task_path": "tasks/nmp3_4a0fcdc6-a124-5838-9989-1efc3f6bb2b6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4a0fcdc6-a124-5838-9989-1efc3f6bb2b6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4a217281-fd59-528c-9e58-e148ee4b0769", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a}{2a^{2}+b^{2}+3}+\\frac{b}{2b^{2}+c^{2}+3}+\\frac{c}{2c^{2}+a^{2}+3}\\le\\frac12,\n-- \\] \n-- where the sum is cyclic over $a,b,c$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The cyclic inequality stated in the problem: for all positive real numbers\n`a`, `b`, and `c`, the specified cyclic sum is at most `1 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n a / (2 * a ^ 2 + b ^ 2 + 3) +\n b / (2 * b ^ 2 + c ^ 2 + 3) +\n c / (2 * c ^ 2 + a ^ 2 + 3) ≤ (1 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4a217281-fd59-528c-9e58-e148ee4b0769", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b123b95c1c7454ba7140c6c467da167e8644579c6cd0d8cb614f8a8c4b572de4", "task_path": "tasks/nmp3_4a217281-fd59-528c-9e58-e148ee4b0769", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4a217281-fd59-528c-9e58-e148ee4b0769", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4a249087-66e0-52ef-ac8a-9c6e3f812c0b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c\\ge0$, prove that \n-- \\[\n-- a\\sqrt{4a^{2}+5bc}+b\\sqrt{4b^{2}+5ac}+c\\sqrt{4c^{2}+5ab}\\ge (a+b+c)^{2}\\,. \n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formalization of the nonnegative-real radical inequality\n\nThe source problem asks to prove, for all nonnegative real numbers `a`, `b`, and\n`c`, the inequality\n\n`a * sqrt (4*a^2 + 5*b*c) + b * sqrt (4*b^2 + 5*a*c)\n + c * sqrt (4*c^2 + 5*a*b) >= (a+b+c)^2`.\n\nThe principal real square root is `Real.sqrt`. The unproved target is packaged\nas the proposition `Problem.Target`; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility assumptions of the source problem: all three variables are\nnonnegative real numbers. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * Real.sqrt (4 * a ^ 2 + 5 * b * c) +\n b * Real.sqrt (4 * b ^ 2 + 5 * a * c) +\n c * Real.sqrt (4 * c ^ 2 + 5 * a * b)\n\n/-- The right-hand side of the asserted inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (a + b + c) ^ 2\n\n/-- The asserted inequality for a fixed triple of real numbers. The hypotheses\n`a,b,c >= 0` are deliberately kept separate in `Admissible`; this predicate by\nitself does not assume the inequality. -/\nnoncomputable def Claim (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full universal statement of the source problem. -/\nnoncomputable def Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Claim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4a249087-66e0-52ef-ac8a-9c6e3f812c0b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6f70cf2f61b576f3d31b2d9667fc5b5b0de3b47028960130798ea34166a25e47", "task_path": "tasks/nmp3_4a249087-66e0-52ef-ac8a-9c6e3f812c0b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4a249087-66e0-52ef-ac8a-9c6e3f812c0b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4a25fe04-8680-5cad-9607-9c88a5fc7de9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for positive real numbers \\(a,b,c,d\\) satisfying \\(abcd=1\\),\n-- \\[\n-- \\frac{1+ab}{1+a}+\\frac{1+bc}{1+b}+\\frac{1+cd}{1+c}+\\frac{1+da}{1+d}\\ge 4\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- For positive real numbers `a`, `b`, `c`, and `d` satisfying `a*b*c*d = 1`,\nthe displayed cyclic sum is at least `4`. -/\ndef Target : Prop :=\n ∀ (a b c d : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n 0 < d →\n a * b * c * d = 1 →\n (1 + a * b) / (1 + a) +\n (1 + b * c) / (1 + b) +\n (1 + c * d) / (1 + c) +\n (1 + d * a) / (1 + d) ≥ 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4a25fe04-8680-5cad-9607-9c88a5fc7de9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9ae7fb36d8a5805bee3da5e1a837fd09c3df3ffaaebc43e2da7253c0ec186f97", "task_path": "tasks/nmp3_4a25fe04-8680-5cad-9607-9c88a5fc7de9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4a25fe04-8680-5cad-9607-9c88a5fc7de9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4a369a87-2bca-5742-9684-913e66b9cc71", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ and $a+b+c=\\sqrt2$. Prove that \n-- \\[\n-- \\frac1{\\sqrt{1+a^2}}+\\frac1{\\sqrt{1+b^2}}+\\frac1{\\sqrt{1+c^2}} \\ge 2+\\frac1{\\sqrt3}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissible triples of nonnegative real numbers whose sum is `Real.sqrt 2`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a + b + c = Real.sqrt 2\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n 1 / Real.sqrt (1 + a ^ 2) + 1 / Real.sqrt (1 + b ^ 2) +\n 1 / Real.sqrt (1 + c ^ 2)\n\n/-- The numerical lower bound appearing on the right-hand side. -/\nnoncomputable def Bound : ℝ :=\n 2 + 1 / Real.sqrt 3\n\n/-- The proposition asserted by the problem: for all nonnegative real `a`, `b`, and `c`\nwith `a + b + c = Real.sqrt 2`, the stated sum is at least `2 + 1 / Real.sqrt 3`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ Bound\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4a369a87-2bca-5742-9684-913e66b9cc71", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "003c57822391adf8e31e00b0248b9cb2c0a4bc846f7e1a31ed10327fac1e78c9", "task_path": "tasks/nmp3_4a369a87-2bca-5742-9684-913e66b9cc71", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4a369a87-2bca-5742-9684-913e66b9cc71", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4aaa1dcf-694a-581e-b2c6-44c73bb63d17", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all $a,b,c>0$,\n-- \\[\n-- (a^2+b^2)\\Bigl(\\frac{2ab}{a+c}-c\\Bigr)+(b^2+c^2)\\Bigl(\\frac{2bc}{a+b}-a\\Bigr)+(c^2+a^2)\\Bigl(\\frac{2ca}{b+c}-b\\Bigr)\\ge0.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The first summand of the left-hand side of the stated inequality. -/\nnoncomputable def firstTerm (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2) * ((2 * a * b) / (a + c) - c)\n\n/-- The second summand of the left-hand side of the stated inequality. -/\nnoncomputable def secondTerm (a b c : ℝ) : ℝ :=\n (b ^ 2 + c ^ 2) * ((2 * b * c) / (a + b) - a)\n\n/-- The third summand of the left-hand side of the stated inequality. -/\nnoncomputable def thirdTerm (a b c : ℝ) : ℝ :=\n (c ^ 2 + a ^ 2) * ((2 * c * a) / (b + c) - b)\n\n/-- The complete left-hand side of the stated inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n firstTerm a b c + secondTerm a b c + thirdTerm a b c\n\n/-- The assertion that the inequality holds for every triple of positive real numbers. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4aaa1dcf-694a-581e-b2c6-44c73bb63d17", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c5bf2d03927e4977f74951031f4564a4cfe75fb45dc6cd8be8c2eb1b4877f578", "task_path": "tasks/nmp3_4aaa1dcf-694a-581e-b2c6-44c73bb63d17", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4aaa1dcf-694a-581e-b2c6-44c73bb63d17", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4ac35a1b-7ee9-5f6c-ad35-73f84eeabb87", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,k,l$ be positive real numbers with $a+b+c=3$ and $k\\ge l\\ge 1$. Prove that \n-- \\[\n-- \\sum_{cyc}\\sqrt{\\frac{a}{\\,l(b+c)+kbc\\,}}\\ge \\frac{3}{\\sqrt{k+2l}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: cyclic radical inequality\n\nThis file formalizes the statement of the problem only. It does not contain a\nproof of the inequality.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum over the three cyclic permutations of `a`, `b`, and `c`. -/\ndef cyclicSum (a b c : ℝ) (f : ℝ → ℝ → ℝ → ℝ) : ℝ :=\n f a b c + f b c a + f c a b\n\n/-- The left-hand side of the cyclic radical inequality. -/\nnoncomputable def lhs (a b c k l : ℝ) : ℝ :=\n cyclicSum a b c\n (fun x y z => Real.sqrt (x / (l * (y + z) + k * y * z)))\n\n/-- The right-hand side of the cyclic radical inequality. -/\nnoncomputable def rhs (k l : ℝ) : ℝ :=\n 3 / Real.sqrt (k + 2 * l)\n\n/-- The admissibility conditions on the five real parameters. -/\ndef admissible (a b c k l : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < k ∧ 0 < l ∧\n a + b + c = 3 ∧ 1 ≤ l ∧ l ≤ k\n\n/-- The asserted inequality, under the stated admissibility conditions. -/\ndef inequality (a b c k l : ℝ) : Prop :=\n lhs a b c k l ≥ rhs k l\n\n/-- The full universally quantified assertion of the problem. -/\ndef Target : Prop :=\n ∀ a b c k l : ℝ, admissible a b c k l → inequality a b c k l\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4ac35a1b-7ee9-5f6c-ad35-73f84eeabb87", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f8d22daae7b582cb9abefc312fa992d8f91448998eee5bd8efbadf6f0da05551", "task_path": "tasks/nmp3_4ac35a1b-7ee9-5f6c-ad35-73f84eeabb87", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4ac35a1b-7ee9-5f6c-ad35-73f84eeabb87", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4afab31b-a1bc-54bc-829b-81cdbedbf577", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The point $O$ is situated inside the parallelogram $ABCD$ such that $\\angle AOB + \\angle COD = 180^{\\circ}$. Prove that $\\displaystyle \\angle OBC = \\angle ODC$.\nimport Mathlib.Analysis.Convex.Topology\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, represented as the real inner product space with two\ncoordinates. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The ordered quadruple `A, B, C, D` is a parallelogram. In the plane this is\nencoded by the vector equality `AB = DC`, equivalently by saying that the diagonals\n`AC` and `BD` have the same midpoint. -/\ndef IsParallelogram (A B C D : Plane) : Prop :=\n B - A = C - D\n\n/-- `O` lies strictly inside the (closed) convex hull of the four vertices of the\nparallelogram. Thus boundary points are excluded. -/\ndef InsideParallelogram (A B C D O : Plane) : Prop :=\n O ∈ interior (convexHull ℝ ({A, B, C, D} : Set Plane))\n\n/-- The two angles `∠AOB` and `∠COD` are supplementary. Angles are measured in\nradians, so `180°` is represented by `Real.pi`. -/\ndef SupplementaryOppositeAngles (A B C D O : Plane) : Prop :=\n EuclideanGeometry.angle A O B + EuclideanGeometry.angle C O D = Real.pi\n\n/-- The angle equality required by the problem. -/\ndef DesiredAngleEquality (_A B C D O : Plane) : Prop :=\n EuclideanGeometry.angle O B C = EuclideanGeometry.angle O D C\n\n/-- The full assertion of the problem. First the four vertices of the parallelogram\nare chosen, then a point `O` is chosen inside it, and the supplementary-angle\nhypothesis is imposed before concluding the required angle equality. -/\ndef Target : Prop :=\n ∀ A B C D : Plane,\n IsParallelogram A B C D →\n ∀ O : Plane,\n InsideParallelogram A B C D O →\n SupplementaryOppositeAngles A B C D O →\n DesiredAngleEquality A B C D O\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4afab31b-a1bc-54bc-829b-81cdbedbf577", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1e5547a2b452a92ccd9358483083ab7ff6683c9261ea28143b52dfbecb53700a", "task_path": "tasks/nmp3_4afab31b-a1bc-54bc-829b-81cdbedbf577", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4afab31b-a1bc-54bc-829b-81cdbedbf577", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4b1576b3-b6c4-58ad-84f8-179bc6f583df", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- We call a positive integer $q$ a **convenient denominator** for a real number $\\alpha$ if there exists an integer $p$ such that \n-- \\[\n-- \\Bigl|\\alpha-\\frac{p}{q}\\Bigr|<\\frac{1}{10q}.\n-- \\] \n-- Prove that if two irrational numbers $\\alpha$ and $\\beta$ have the same set of convenient denominators, then either $\\alpha+\\beta$ or $\\alpha-\\beta$ is an integer.\nimport Mathlib\n\n/-!\n# Convenient denominators and sums/differences of irrational reals\n\nThis file formalizes the statement of the problem. A convenient denominator\n`q` is a positive natural number for which some integer numerator `p` gives\n`|α - p / q| < 1 / (10 * q)`. The target asserts that two irrational real\nnumbers with exactly the same convenient denominators have either integer sum\nor integer difference.\n-/\n\nnamespace Problem\n\n/-- A positive integer `q` is a convenient denominator for a real number `α`\nif there is an integer `p` such that\n`|α - p / q| < 1 / (10 * q)`.\n\nThe parameter `q` is represented by a natural number together with the explicit\ncondition `0 < q`. The numerator `p` ranges over all integers, with no\ncoprimality or reduced-fraction requirement. -/\ndef ConvenientDenominator (α : ℝ) (q : ℕ) : Prop :=\n 0 < q ∧\n ∃ p : ℤ,\n |α - (p : ℝ) / (q : ℝ)| < (1 : ℝ) / ((10 : ℝ) * (q : ℝ))\n\n/-- Two real numbers have the same set of convenient denominators. -/\ndef SameConvenientDenominators (α β : ℝ) : Prop :=\n {q : ℕ | ConvenientDenominator α q} = {q : ℕ | ConvenientDenominator β q}\n\n/-- A real number is an integer when it is the real coercion of some integer. -/\ndef IsInteger (x : ℝ) : Prop :=\n ∃ z : ℤ, x = (z : ℝ)\n\n/-- The statement to be proved: if two irrational real numbers have the same\nset of convenient denominators, then either their sum or their difference is\nan integer. -/\ndef Target : Prop :=\n ∀ α β : ℝ,\n Irrational α →\n Irrational β →\n SameConvenientDenominators α β →\n IsInteger (α + β) ∨ IsInteger (α - β)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4b1576b3-b6c4-58ad-84f8-179bc6f583df", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "20b1591068e205bbb13589253da267260c7289c25d89b9c407c06859227a4380", "task_path": "tasks/nmp3_4b1576b3-b6c4-58ad-84f8-179bc6f583df", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4b1576b3-b6c4-58ad-84f8-179bc6f583df", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4b4e6fa2-7fa6-584c-9d46-3f5655cb7878", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ such that $xyz=1$. Prove that \n-- \\[\n-- \\frac{1}{(1+x)^{3}}+\\frac{1}{(1+y)^{3}}+\\frac{1}{(1+z)^{3}}\n-- \\ge\n-- \\frac{xy(x+y)+yz(y+z)+zx(z+x)}{2\\,(x+y)(y+z)(z+x)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem states an inequality for positive real numbers `x`, `y`, and `z`\nsatisfying `x * y * z = 1`. The declarations below separate the admissibility\nconditions, the inequality itself, and the universally quantified target.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The hypotheses of the problem: `x`, `y`, and `z` are positive and have product one. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x * y * z = 1\n\n/-- The left-hand side of the requested inequality. -/\ndef leftHandSide (x y z : ℝ) : ℝ :=\n 1 / ((1 + x) ^ 3) + 1 / ((1 + y) ^ 3) + 1 / ((1 + z) ^ 3)\n\n/-- The right-hand side of the requested inequality. -/\ndef rightHandSide (x y z : ℝ) : ℝ :=\n (x * y * (x + y) + y * z * (y + z) + z * x * (z + x)) /\n (2 * (x + y) * (y + z) * (z + x))\n\n/-- The claimed inequality for arbitrary real `x`, `y`, and `z`. -/\ndef Inequality (x y z : ℝ) : Prop :=\n leftHandSide x y z ≥ rightHandSide x y z\n\n/-- The complete statement: for all positive real `x`, `y`, and `z` with\n`x * y * z = 1`, the requested inequality holds. -/\ndef Target : Prop :=\n ∀ (x y z : ℝ), Admissible x y z → Inequality x y z\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4b4e6fa2-7fa6-584c-9d46-3f5655cb7878", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4343c8a41bf1422d02c480c173af0c0b3481a06303618db4d7bd0fdd575c8784", "task_path": "tasks/nmp3_4b4e6fa2-7fa6-584c-9d46-3f5655cb7878", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4b4e6fa2-7fa6-584c-9d46-3f5655cb7878", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4b696132-2fcc-5355-a25f-75656dc24668", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a(a+b)}{(2a+b+c)(b+c)}+\\frac{b(b+c)}{(2b+c+a)(c+a)}+\\frac{c(c+a)}{(2c+a+b)(a+b)}\\ge\\frac34\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a three-variable rational inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\na cyclic rational inequality. This file records the statement only; it does\nnot provide a proof.\n-/\n\nnamespace Problem\n\n/-- The hypothesis `a > 0`, `b > 0`, and `c > 0` from the source problem. -/\ndef PositiveInputs (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The cyclic sum on the left-hand side of the source inequality. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n a * (a + b) / ((2 * a + b + c) * (b + c)) +\n b * (b + c) / ((2 * b + c + a) * (c + a)) +\n c * (c + a) / ((2 * c + a + b) * (a + b))\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the cyclic sum\n`CyclicSum a b c` is at least `3/4`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveInputs a b c → (3 : ℝ) / 4 ≤ CyclicSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4b696132-2fcc-5355-a25f-75656dc24668", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d3b69d797fc5f7c599fa14fca5acb400c1de1aafc5b2a424bc0fdc637a7d4c63", "task_path": "tasks/nmp3_4b696132-2fcc-5355-a25f-75656dc24668", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4b696132-2fcc-5355-a25f-75656dc24668", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4b6b073a-ceb8-5d4b-b5e5-9887a041bf6d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\frac{4(a+b+c)(bc+ca+ab)}{(b+c)^{2}+(c+a)^{2}+(a+b)^{2}}\\le\\Big((2a+b)(2b+c)(2c+a)\\Big)^{\\frac13}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for an inequality in three positive real numbers\n\nThis file records the mathematical assertion from `problem.md`. It is a\nstatement formalization only: `Problem.Target` is a proposition, not a proof.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`,\n`4 (a + b + c) (bc + ca + ab) / ((b+c)^2 + (c+a)^2 + (a+b)^2)` is at most\nthe real cube root of `(2a+b)(2b+c)(2c+a)`.\n\nThe cube root is represented by `Real.rpow` with exponent `1 / 3`. On the\npositive product occurring here `Real.rpow _ (1 / 3)` is the ordinary real\ncube root. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (4 * (a + b + c) * (b * c + c * a + a * b)) /\n ((b + c) ^ (2 : ℕ) + (c + a) ^ (2 : ℕ) +\n (a + b) ^ (2 : ℕ))\n ≤ Real.rpow ((2 * a + b) * (2 * b + c) * (2 * c + a))\n (1 / 3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4b6b073a-ceb8-5d4b-b5e5-9887a041bf6d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3c060ee5e82b2d07240ae2d5bcd879ae5329436e1873b68a04cd8339dc0b0b15", "task_path": "tasks/nmp3_4b6b073a-ceb8-5d4b-b5e5-9887a041bf6d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4b6b073a-ceb8-5d4b-b5e5-9887a041bf6d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4bb537b0-3a4d-5a5e-92ea-2d98bd92c908", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be positive integers such that $ad\\neq bc$ and $\\gcd(a,b,c,d)=1$. Define \n-- \\[S=\\{\\gcd(an+b,\\;cn+d)\\mid n\\in\\mathbb{Z}_{>0}\\}.\\] \n-- Prove that there exists a positive integer $M$ such that $S$ is exactly the set of all positive divisors of $M$.\nimport Mathlib\n\n/-!\nFormalization of the problem statement.\n\nWe model the positive integers as natural numbers together with strict\npositivity hypotheses. The set `S` consists of the positive gcd values\nobtained from positive `n`; since the arguments `a * n + b` and `c * n + d`\nare positive under the hypotheses, these gcds are positive natural numbers.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypotheses imposed on the four positive integers\n`a`, `b`, `c`, and `d` in the problem statement. -/\ndef Admissible (a b c d : ℕ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧\n a * d ≠ b * c ∧\n Nat.gcd (Nat.gcd a b) (Nat.gcd c d) = 1\n\n/-- The set `S = {gcd(a n + b, c n + d) | n ∈ ℤ_{>0}}`, represented as a\nset of natural numbers using positive natural indices `n`. -/\ndef S (a b c d : ℕ) : Set ℕ :=\n {m : ℕ | ∃ n : ℕ, 0 < n ∧\n Nat.gcd (a * n + b) (c * n + d) = m}\n\n/-- The set of all positive divisors of `M`. -/\ndef PositiveDivisors (M : ℕ) : Set ℕ :=\n {m : ℕ | 0 < m ∧ m ∣ M}\n\n/-- The full universally quantified assertion of the problem: for every\nadmissible quadruple of positive integers, there is a positive integer `M`\nwhose positive divisors are precisely the members of `S`. -/\ndef Target : Prop :=\n ∀ a b c d : ℕ, Admissible a b c d →\n ∃ M : ℕ, 0 < M ∧ S a b c d = PositiveDivisors M\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4bb537b0-3a4d-5a5e-92ea-2d98bd92c908", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "643606c3f36ee236c1d5e756522840a861e1b4c2965c91631385d4402640c592", "task_path": "tasks/nmp3_4bb537b0-3a4d-5a5e-92ea-2d98bd92c908", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4bb537b0-3a4d-5a5e-92ea-2d98bd92c908", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4bf4c9d8-a8bf-50f2-b45d-424a6c45dc61", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with $a+b+c\\neq0$. Prove that \n-- \\[\n-- \\sqrt{a^{2}-ab+b^{2}}+\\sqrt{b^{2}-bc+c^{2}}+\\sqrt{c^{2}-ca+a^{2}}\n-- \\le\\frac{10(a^{2}+b^{2}+c^{2})-ab-ac-bc}{3(a+b+c)}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks, for nonnegative real numbers `a`, `b`, and `c` whose\nsum is nonzero, to prove\n\n`sqrt (a^2 - a*b + b^2) + sqrt (b^2 - b*c + c^2)\n + sqrt (c^2 - c*a + a^2)\n ≤ (10*(a^2 + b^2 + c^2) - a*b - a*c - b*c) / (3*(a + b + c))`.\n\nHere `sqrt` is interpreted as the principal real square root `Real.sqrt`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The first radicand `a^2 - ab + b^2`. -/\ndef firstRadicand (a b : ℝ) : ℝ :=\n a ^ 2 - a * b + b ^ 2\n\n/-- The second radicand `b^2 - bc + c^2`. -/\ndef secondRadicand (b c : ℝ) : ℝ :=\n b ^ 2 - b * c + c ^ 2\n\n/-- The third radicand `c^2 - ca + a^2`. -/\ndef thirdRadicand (c a : ℝ) : ℝ :=\n c ^ 2 - c * a + a ^ 2\n\n/-- The sum of the three principal square roots on the left-hand side. -/\ndef leftHandSide (a b c : ℝ) : ℝ :=\n Real.sqrt (firstRadicand a b)\n + Real.sqrt (secondRadicand b c)\n + Real.sqrt (thirdRadicand c a)\n\n/-- The fraction on the right-hand side of the claimed inequality. -/\ndef rightHandSide (a b c : ℝ) : ℝ :=\n (10 * (a ^ 2 + b ^ 2 + c ^ 2) - a * b - a * c - b * c)\n / (3 * (a + b + c))\n\n/-- The displayed inequality, without its hypotheses on `a`, `b`, and `c`. -/\ndef inequality (a b c : ℝ) : Prop :=\n leftHandSide a b c ≤ rightHandSide a b c\n\n/-- The complete assertion of the source problem: for all nonnegative real\nnumbers `a`, `b`, and `c` with `a + b + c ≠ 0`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a + b + c ≠ 0 →\n inequality a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4bf4c9d8-a8bf-50f2-b45d-424a6c45dc61", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ca5d03065331f5fcb6f10fab32d174ad5ad89628fe78098c2b93a30f6d33a0d7", "task_path": "tasks/nmp3_4bf4c9d8-a8bf-50f2-b45d-424a6c45dc61", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4bf4c9d8-a8bf-50f2-b45d-424a6c45dc61", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4c2712af-f0b8-5b04-bc3e-bba21bf30cc9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any set of nine distinct real numbers, one can select four distinct numbers \\(a,b,c,d\\) from the set such that \n-- \\[\n-- (ac+bd)^2 \\ge \\frac{9}{10}\\,(a^2+b^2)(c^2+d^2)\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: four numbers selected from any nine-element set of reals\n\nThis file gives a statement-level formalization of the problem in\n`problem.md`. The target is represented as a proposition-valued\ndefinition; no proof of the target is supplied or assumed here.\n-/\n\nnamespace Problem\n\n/-- The numerical inequality required in the problem. -/\ndef Inequality (a b c d : ℝ) : Prop :=\n (a * c + b * d) ^ 2 ≥\n (9 / 10 : ℝ) * (a ^ 2 + b ^ 2) * (c ^ 2 + d ^ 2)\n\n/-- The four selected real numbers are pairwise distinct. -/\ndef PairwiseDistinctFour (a b c d : ℝ) : Prop :=\n a ≠ b ∧ a ≠ c ∧ a ≠ d ∧ b ≠ c ∧ b ≠ d ∧ c ≠ d\n\n/-- The assertion that `S` contains a suitable ordered choice of four members. -/\ndef HasFourMemberSelection (S : Finset ℝ) : Prop :=\n ∃ a ∈ S, ∃ b ∈ S, ∃ c ∈ S, ∃ d ∈ S,\n PairwiseDistinctFour a b c d ∧ Inequality a b c d\n\n/-- For every set of nine distinct real numbers, one can select four distinct\nnumbers `a`, `b`, `c`, `d` from the set satisfying the stated inequality. -/\ndef Target : Prop :=\n ∀ S : Finset ℝ, S.card = 9 → HasFourMemberSelection S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4c2712af-f0b8-5b04-bc3e-bba21bf30cc9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a51f7ee0f6afbd4f8599fdd4abaff8bbd4264bc1ff6fd339854c94f5288ae8ad", "task_path": "tasks/nmp3_4c2712af-f0b8-5b04-bc3e-bba21bf30cc9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4c2712af-f0b8-5b04-bc3e-bba21bf30cc9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4c2a3cdd-a817-5f20-a41b-ba7e9e8a65c0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose there are $2019$ distinct points in the plane and the distances between all pairs of points take on exactly $k$ distinct values. Prove that $k\\ge 44\\,$.\nimport Mathlib\n\n/-!\n# Formal statement: pairwise distances among 2019 planar points\n\nThe problem asks for a lower bound on the number of distinct distances\ndetermined by a set of 2019 distinct points in the Euclidean plane.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real Euclidean space of dimension two. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/--\nThe set of all distances between two distinct points of `points`.\n\nOnly unordered pairs matter for the *set* of values. Using `points.offDiag`\nand then taking an image is therefore equivalent to choosing one representative\nfrom each unordered pair of distinct points.\n-/\ndef PairwiseDistanceValues (points : Finset Plane) : Finset ℝ :=\n points.offDiag.image (fun (pair : Plane × Plane) => dist pair.1 pair.2)\n\n/--\n`points` determines exactly `k` distinct pairwise distances.\n-/\ndef HasExactlyKDistinctDistances (points : Finset Plane) (k : ℕ) : Prop :=\n (PairwiseDistanceValues points).card = k\n\n/--\nFor every finite set of 2019 distinct planar points, if the distances between\nall pairs of distinct points take exactly `k` distinct values, then `k ≥ 44`.\n-/\ndef Target : Prop :=\n ∀ (points : Finset Plane) (k : ℕ),\n points.card = 2019 →\n HasExactlyKDistinctDistances points k →\n 44 ≤ k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4c2a3cdd-a817-5f20-a41b-ba7e9e8a65c0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b566a4c87922a79eae76261ae60006cae5100d927504dfe5dcffa0e52efdf7de", "task_path": "tasks/nmp3_4c2a3cdd-a817-5f20-a41b-ba7e9e8a65c0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4c2a3cdd-a817-5f20-a41b-ba7e9e8a65c0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4c3bbf29-0b26-5dbe-b15a-94fc092a7acb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a nonnegative integer $k$, prove that there exist infinitely many positive integers $n$ such that $(n+k)^2+1$ divides $n!$.\nimport Mathlib\n\n/-! # Formal statement\n\nGiven a nonnegative integer `k`, prove that there are infinitely many positive\nintegers `n` for which `(n + k)^2 + 1` divides `n!`.\n-/\n\nnamespace Problem\n\n/-- For a fixed nonnegative integer `k`, a natural number `n` is admissible when\n`n` is positive and `(n + k)^2 + 1` divides `n!`. -/\ndef Admissible (k n : ℕ) : Prop :=\n 0 < n ∧ ((n + k) ^ 2 + 1) ∣ Nat.factorial n\n\n/-- The set of positive natural numbers satisfying the divisibility condition for\na fixed nonnegative integer `k`. -/\ndef SolutionSet (k : ℕ) : Set ℕ :=\n {n : ℕ | Admissible k n}\n\n/-- For a fixed nonnegative integer `k`, there are infinitely many positive\nintegers `n` such that `(n + k)^2 + 1` divides `n!`. -/\ndef InfinitelyManySolutions (k : ℕ) : Prop :=\n Set.Infinite (SolutionSet k)\n\n/-- The assertion for a fixed nonnegative integer `k`: there exist infinitely\nmany positive integers `n` such that `(n + k)^2 + 1` divides `n!`. -/\ndef TargetFor (k : ℕ) : Prop :=\n InfinitelyManySolutions k\n\n/-- The full assertion: for every nonnegative integer `k`, there exist infinitely\nmany positive integers `n` such that `(n + k)^2 + 1` divides `n!`. -/\ndef Target : Prop :=\n ∀ k : ℕ, TargetFor k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4c3bbf29-0b26-5dbe-b15a-94fc092a7acb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e83de8e19b943fb9296ea702d7757f20d3198b7039272abf367cd1ff86def579", "task_path": "tasks/nmp3_4c3bbf29-0b26-5dbe-b15a-94fc092a7acb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4c3bbf29-0b26-5dbe-b15a-94fc092a7acb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4c548f3e-2f5f-5d92-b650-e4f416f9ba4e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A polynomial $p$ with real coefficients satisfies $p(x+1)-p(x)=x^{100}$ for all real $x$. Prove that $p(1-t)\\ge p(t)$ for every $t$ with $0\\le t\\le\\frac12$.\nimport Mathlib\n\n/-!\n# Formalization of a polynomial inequality problem\n\nThe source problem considers a real polynomial `p` satisfying\n`p (x + 1) - p x = x ^ 100` for all real `x`, and asks to prove\n`p (1 - t) ≥ p t` for all `t` in `[0, 1/2]`.\n-/\n\nnamespace Problem\n\n/-- A real polynomial satisfies the prescribed finite-difference identity. -/\ndef IsAdmissible (p : Polynomial ℝ) : Prop :=\n ∀ x : ℝ, Polynomial.eval (x + 1) p - Polynomial.eval x p = x ^ 100\n\n/-- The inequality required by the problem, for a real polynomial. -/\ndef HasRequiredInequality (p : Polynomial ℝ) : Prop :=\n ∀ t : ℝ, 0 ≤ t → t ≤ 1 / 2 →\n Polynomial.eval (1 - t) p ≥ Polynomial.eval t p\n\n/-- The complete assertion: every real polynomial satisfying the finite-difference\nidentity has the required inequality on the interval `[0, 1/2]`. -/\ndef Target : Prop :=\n ∀ p : Polynomial ℝ, IsAdmissible p → HasRequiredInequality p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4c548f3e-2f5f-5d92-b650-e4f416f9ba4e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b6247bc756ba275a25c1641811cdc9559faee8a83f0d94974c2484157ff2e522", "task_path": "tasks/nmp3_4c548f3e-2f5f-5d92-b650-e4f416f9ba4e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4c548f3e-2f5f-5d92-b650-e4f416f9ba4e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4caa74e3-7916-58d4-9812-ac4ed780bb8d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a>1$ be a positive integer. Prove that the infinite set of integers \n-- \\[\\{a^2+a-1,\\;a^3+a^2-1,\\;a^4+a^3-1,\\;\\ldots,\\;a^{n+1}+a^n-1,\\;\\ldots\\}\\] \n-- contains an infinite subset of pairwise coprime numbers.\nimport Mathlib\n\n/-!\n# Formalization of the pairwise-coprime subsequence problem\n\nFor an integer `a > 1`, the source problem considers the set\n\n`{a ^ 2 + a - 1, a ^ 3 + a ^ 2 - 1, ..., a ^ (n + 1) + a ^ n - 1, ...}`.\n\nThe declarations below state that this set contains an infinite subset whose\nelements are pairwise coprime. No proof of the source statement is supplied.\n-/\n\nnamespace Problem\n\n/-- The term `a ^ (n + 1) + a ^ n - 1` of the source sequence, where the\nsource index `n` ranges over the positive integers. -/\ndef Term (a : ℤ) (n : ℕ+) : ℤ :=\n a ^ ((n : ℕ) + 1) + a ^ (n : ℕ) - 1\n\n/-- The infinite set of integers displayed in the source problem. -/\ndef TermSet (a : ℤ) : Set ℤ :=\n Set.range (Term a)\n\n/-- A set of integers is pairwise coprime when the gcd of every two distinct\nelements of the set is one. -/\ndef PairwiseCoprime (S : Set ℤ) : Prop :=\n S.Pairwise (fun x y : ℤ => Int.gcd x y = 1)\n\n/-- For a fixed parameter `a`, the stated set contains an infinite subset of\npairwise coprime integers. -/\ndef ContainsInfinitePairwiseCoprimeSubset (a : ℤ) : Prop :=\n ∃ S : Set ℤ,\n S ⊆ TermSet a ∧ S.Infinite ∧ PairwiseCoprime S\n\n/-- The target proposition: for every integer `a > 1`, the set of sequence\nterms contains an infinite subset whose elements are pairwise coprime. -/\ndef Target : Prop :=\n ∀ a : ℤ, 1 < a → ContainsInfinitePairwiseCoprimeSubset a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4caa74e3-7916-58d4-9812-ac4ed780bb8d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9928432dbbe6cac4e4de26d50cdec3ea248aa079c1a606f3d302c53848801e72", "task_path": "tasks/nmp3_4caa74e3-7916-58d4-9812-ac4ed780bb8d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4caa74e3-7916-58d4-9812-ac4ed780bb8d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4d1c71cc-6838-52d0-aa8d-f8247d757a72", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{2a^{2}-9ab+7b^{2}}{2a^{2}+9ab+b^{2}}+\\frac{2b^{2}-9bc+7c^{2}}{2b^{2}+9bc+c^{2}}+\\frac{2c^{2}-9ca+7a^{2}}{2c^{2}+9ca+a^{2}}\\ge0\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a cyclic rational inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\nthat a cyclic sum of three rational expressions is nonnegative.\n-/\n\nnamespace Problem\n\n/-- The complete left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (2 * a ^ 2 - 9 * a * b + 7 * b ^ 2) /\n (2 * a ^ 2 + 9 * a * b + b ^ 2) +\n (2 * b ^ 2 - 9 * b * c + 7 * c ^ 2) /\n (2 * b ^ 2 + 9 * b * c + c ^ 2) +\n (2 * c ^ 2 - 9 * c * a + 7 * a ^ 2) /\n (2 * c ^ 2 + 9 * c * a + a ^ 2)\n\n/-- For all positive real numbers `a`, `b`, and `c`, the cyclic sum displayed\nin the source problem is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, a > 0 → b > 0 → c > 0 → lhs a b c ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4d1c71cc-6838-52d0-aa8d-f8247d757a72", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4c8e46e268b62d31e4f25d95ed500406de1c61a334e5de9ecc0e57d01200b8ce", "task_path": "tasks/nmp3_4d1c71cc-6838-52d0-aa8d-f8247d757a72", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4d1c71cc-6838-52d0-aa8d-f8247d757a72", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4d33c6b0-a283-585c-a2d1-ba3d9336929d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that\n-- \\[\n-- \\frac{a^{2}}{\\sqrt[3]{a^{6}+26\\,b^{3}c^{3}}}+\\frac{b^{2}}{\\sqrt[3]{b^{6}+26\\,c^{3}a^{3}}}+\\frac{c^{2}}{\\sqrt[3]{c^{6}+26\\,a^{3}b^{3}}}\\ge1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a cyclic three-variable real inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\n\n`a^2 / cbrt (a^6 + 26*b^3*c^3) +\n b^2 / cbrt (b^6 + 26*c^3*a^3) +\n c^2 / cbrt (c^6 + 26*a^3*b^3) >= 1`.\n\nThe real cube root is implemented as the real `1/3` power. In the target every\nradicand is positive, so this is the usual positive real cube root. The target\nis a proposition; no proof of it is supplied here.\n-/\n\nnamespace Problem\n\n/-- The real cube root, represented by the real power with exponent `1 / 3`. -/\nnoncomputable def cubeRoot (x : ℝ) : ℝ :=\n Real.rpow x ((1 : ℝ) / 3)\n\n/-- The cyclic left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ (2 : ℕ) / cubeRoot (a ^ (6 : ℕ) + (26 : ℝ) * b ^ (3 : ℕ) * c ^ (3 : ℕ)) +\n b ^ (2 : ℕ) / cubeRoot (b ^ (6 : ℕ) + (26 : ℝ) * c ^ (3 : ℕ) * a ^ (3 : ℕ)) +\n c ^ (2 : ℕ) / cubeRoot (c ^ (6 : ℕ) + (26 : ℝ) * a ^ (3 : ℕ) * b ^ (3 : ℕ))\n\n/-- The assertion asked to be proved: for all positive real `a`, `b`, and `c`,\nthe cyclic sum on the left is at least one. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4d33c6b0-a283-585c-a2d1-ba3d9336929d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2033b1ba15bfae0a8b88ef37de70b7025771c92ec99f8866c0eb58c492b8b225", "task_path": "tasks/nmp3_4d33c6b0-a283-585c-a2d1-ba3d9336929d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4d33c6b0-a283-585c-a2d1-ba3d9336929d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4d4aabeb-375e-5f78-b365-c062a36cd1fc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A positive integer $n>2$ is given. Each integer $1,2,\\dots,n$ is colored either red or blue. Prove that there exists a coloring of every subset of $\\{1,2,\\dots,n\\}$ with the colors red or blue such that each red element belongs to more red subsets than blue subsets, and each blue element belongs to more blue subsets than red subsets.\n/-\nFormalization of the statement in `problem.md`.\n\nThe source colors the integer interval `{1, 2, ..., n}` and then asks for a\nred/blue coloring of all of its subsets with prescribed strict imbalances at\neach original element.\n-/\n\nimport Mathlib.Order.Interval.Finset.Nat\nimport Mathlib.Data.Finset.Interval\nimport Mathlib.Data.Fintype.Sets\n\nnamespace Problem\n\n/-- The two available colors. Having exactly these two constructors makes a\ncoloring a total assignment of exactly one of red and blue to every object. -/\ninductive Color where\n | red\n | blue\n deriving DecidableEq, Repr\n\n/-- The integer interval `{1, 2, ..., n}`, represented as a finite set of\nnatural numbers. -/\ndef Segment (n : ℕ) : Finset ℕ := Finset.Icc (1 : ℕ) n\n\n/-- The elements that are colored in the first coloring: exactly the integers\n`1, 2, ..., n`. -/\nabbrev Element (n : ℕ) : Type := {i : ℕ // i ∈ Segment n}\n\n/-- The objects colored in the second coloring: exactly all subsets of\n`{1, 2, ..., n}`. A subset is represented by its finite-set of elements, and\nthe powerset condition records that it is contained in `Segment n`. -/\nabbrev SubsetOfSegment (n : ℕ) : Type :=\n {S : Finset ℕ // S ∈ (Segment n).powerset}\n\n/-- Among all subsets of `{1, 2, ..., n}`, those that are colored red and\ncontain the element `i`. -/\ndef redSubsetsContaining (n : ℕ) (subsetColor : SubsetOfSegment n → Color)\n (i : Element n) : Finset (SubsetOfSegment n) :=\n Finset.univ.filter\n (fun S : SubsetOfSegment n => subsetColor S = Color.red ∧ i.1 ∈ S.1)\n\n/-- Among all subsets of `{1, 2, ..., n}`, those that are colored blue and\ncontain the element `i`. -/\ndef blueSubsetsContaining (n : ℕ) (subsetColor : SubsetOfSegment n → Color)\n (i : Element n) : Finset (SubsetOfSegment n) :=\n Finset.univ.filter\n (fun S : SubsetOfSegment n => subsetColor S = Color.blue ∧ i.1 ∈ S.1)\n\n/-- The number of red-colored subsets that contain `i`. -/\ndef redSubsetCount (n : ℕ) (subsetColor : SubsetOfSegment n → Color)\n (i : Element n) : ℕ :=\n (redSubsetsContaining n subsetColor i).card\n\n/-- The number of blue-colored subsets that contain `i`. -/\ndef blueSubsetCount (n : ℕ) (subsetColor : SubsetOfSegment n → Color)\n (i : Element n) : ℕ :=\n (blueSubsetsContaining n subsetColor i).card\n\n/-- The required admissibility condition for a coloring of all subsets,\nrelative to a given coloring of the elements.\n\nThe first conjunct says every element that is red in the element coloring\nbelongs to strictly more red subsets than blue subsets. The second conjunct\nsays every element that is blue in the element coloring belongs to strictly\nmore blue subsets than red subsets. -/\ndef admissibleSubsetColoring (n : ℕ) (elementColor : Element n → Color)\n (subsetColor : SubsetOfSegment n → Color) : Prop :=\n (∀ i : Element n, elementColor i = Color.red →\n redSubsetCount n subsetColor i > blueSubsetCount n subsetColor i) ∧\n (∀ i : Element n, elementColor i = Color.blue →\n blueSubsetCount n subsetColor i > redSubsetCount n subsetColor i)\n\n/-- The complete statement: for every positive integer `n` with `n > 2`, and\nfor every red/blue coloring of the integers `1, 2, ..., n`, there is a red/blue\ncoloring of every subset of `{1, 2, ..., n}` satisfying the two strict\nimbalance requirements from the problem. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → 2 < n → ∀ elementColor : Element n → Color,\n ∃ subsetColor : SubsetOfSegment n → Color,\n admissibleSubsetColoring n elementColor subsetColor\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4d4aabeb-375e-5f78-b365-c062a36cd1fc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "645517661f915b397b0bdc6264155ba98f55c9847e5e3c2392a76702c9a048ba", "task_path": "tasks/nmp3_4d4aabeb-375e-5f78-b365-c062a36cd1fc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4d4aabeb-375e-5f78-b365-c062a36cd1fc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4d6b8db8-2c88-51cd-8601-2b0323b2f874", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{4abc}{\\,a^{2}b+b^{2}c+c^{2}a+abc\\,}+\\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}\\ge 2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a three-variable positive-real inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\n\n`4abc / (a^2 b + b^2 c + c^2 a + abc)\n + (a^2 + b^2 + c^2) / (ab + bc + ca) ≥ 2`.\n\nThe declaration below records the complete universally quantified statement.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`,\nthe displayed sum is at least `2`. All divisions are divisions in `ℝ`, and `≥` is\nthe non-strict order on `ℝ`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n ((4 : ℝ) * a * b * c) /\n (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a + a * b * c) +\n (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a) ≥ (2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4d6b8db8-2c88-51cd-8601-2b0323b2f874", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "75e0d760ede122cb1b8abb4c96278f4fa396c54f4329d753d7740be38364a056", "task_path": "tasks/nmp3_4d6b8db8-2c88-51cd-8601-2b0323b2f874", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4d6b8db8-2c88-51cd-8601-2b0323b2f874", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4da48e4a-2ebf-590b-a2cb-81cd63ad6c2a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=1$. Prove that \n-- \\[\n-- \\frac{a}{b+c}+\\frac{b}{c+a}+\\frac{c}{a+b}\\ge \\frac{3}{2}+(a-b)^2+(b-c)^2+(c-a)^2\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion from the problem: for all positive real numbers `a`, `b`, and `c`\nwhose sum is `1`, the displayed cyclic inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = (1 : ℝ) →\n (3 : ℝ) / 2 + (a - b) ^ 2 + (b - c) ^ 2 + (c - a) ^ 2 ≤\n a / (b + c) + b / (c + a) + c / (a + b)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4da48e4a-2ebf-590b-a2cb-81cd63ad6c2a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3ff8bef6a10cbb8078d1bd354496d0297e42aaee5638f5175026ed50a4d8f2c2", "task_path": "tasks/nmp3_4da48e4a-2ebf-590b-a2cb-81cd63ad6c2a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4da48e4a-2ebf-590b-a2cb-81cd63ad6c2a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4deec1eb-1c64-54b2-a816-4cbd0339b1db", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p=4k+1$ be a prime number. Prove that there exist infinitely many natural numbers $n$ such that $\\displaystyle\\big\\lfloor n\\sqrt{p}\\big\\rfloor$ is a perfect square.\nimport Mathlib\n\n/-!\n# Formalization of the statement: good values of `⌊n√p⌋` for primes `p = 4k + 1`\n\nThe source problem asks, for a prime `p` of the form `4k + 1`, to prove that\ninfinitely many natural numbers `n` make `⌊n√p⌋` a perfect square.\n\nThis file only records the mathematical statement as a proposition. In\nparticular, `Problem.Target` is a definition whose body is the proposition to\nbe proved; it is not a proof of that proposition.\n-/\n\nnamespace Problem\n\n/-- A natural number is a perfect square when it is the square of a natural\nnumber. This is the sense in which the value of the floor is to be a perfect\nsquare in the problem. -/\ndef PerfectSquareNat (n : ℕ) : Prop :=\n ∃ m : ℕ, n = m ^ 2\n\n/-- The value `⌊n√p⌋`. The square root is taken in `ℝ`, and the floor is the\nnatural floor `⌊·⌋₊`. -/\nnoncomputable def floorNMulSqrt (n p : ℕ) : ℕ :=\n ⌊(n : ℝ) * Real.sqrt (p : ℝ)⌋₊\n\n/-- The admissibility predicate from the problem: `n` is good for the prime\n`p` exactly when `⌊n√p⌋` is a perfect square. -/\nnoncomputable def Good (p n : ℕ) : Prop :=\n PerfectSquareNat (floorNMulSqrt n p)\n\n/-- The prime parameter is a prime natural number which has the stated form\n`4k + 1` for some natural number `k`. -/\ndef IsPrimeOfFormFourKPlusOne (p : ℕ) : Prop :=\n Nat.Prime p ∧ ∃ k : ℕ, p = 4 * k + 1\n\n/-- The formalized target: for every prime `p = 4k + 1`, the set of natural\nnumbers `n` for which `⌊n√p⌋` is a perfect square is infinite. -/\nnoncomputable def Target : Prop :=\n ∀ p : ℕ, IsPrimeOfFormFourKPlusOne p → Set.Infinite {n : ℕ | Good p n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4deec1eb-1c64-54b2-a816-4cbd0339b1db", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b01f60f3a49ac3b192d95f1d0eb1b52ec15ccaa322c9c491293f848fc153dacb", "task_path": "tasks/nmp3_4deec1eb-1c64-54b2-a816-4cbd0339b1db", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4deec1eb-1c64-54b2-a816-4cbd0339b1db", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4e27c0f0-7dfe-59c9-9d2c-37d0afb00aae", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Consider the matrices \n-- \\[\n-- A=\\begin{pmatrix}1&2\\\\0&1\\end{pmatrix},\\qquad \n-- B=\\begin{pmatrix}1&0\\\\2&1\\end{pmatrix}.\n-- \\] \n-- Prove that for any integer $n>1$ there do not exist integers \n-- $a_{1},a_{2},\\ldots,a_{n}$ and $b_{1},b_{2},\\ldots,b_{n}$ with \n-- $a_{2},a_{3},\\ldots,a_{n}$ and $b_{1},b_{2},\\ldots,b_{n-1}$ nonzero such that \n-- \\[\n-- A^{a_{1}}B^{b_{1}}A^{a_{2}}B^{b_{2}}\\cdots A^{a_{n}}B^{b_{n}}=I_{2},\n-- \\] \n-- where $I_{2}$ denotes the $2\\times2$ identity matrix.\nimport Mathlib\n\n/-!\n# Formalization of the matrix word problem\n\nThe source problem concerns the two integer matrices\n`A = !![1, 2; 0, 1]` and `B = !![1, 0; 2, 1]`. Integer powers are the\nusual integer powers in the group of invertible matrices; in Mathlib this is\nprovided by the `DivInvMonoid` instance on square matrices over a commutative\nring (with the nonsingular inverse). Since both displayed matrices have\ndeterminant one, this agrees with the usual powers of invertible matrices.\n-/\n\nopen Matrix\n\nnamespace Problem\n\n/-- The matrix `A` from the problem. -/\ndef A : Matrix (Fin 2) (Fin 2) ℤ := !![1, 2; 0, 1]\n\n/-- The matrix `B` from the problem. -/\ndef B : Matrix (Fin 2) (Fin 2) ℤ := !![1, 0; 2, 1]\n\n/-- The left-to-right matrix word\n`A ^ a₁ * B ^ b₁ * A ^ a₂ * B ^ b₂ * ... * A ^ aₙ * B ^ bₙ`.\nThe indexing is zero-based in Lean, so `a i` and `b i` correspond to the\nsource entries indexed by `i + 1`. -/\nnoncomputable def word (n : ℕ) (a b : Fin n → ℤ) : Matrix (Fin 2) (Fin 2) ℤ :=\n (List.ofFn fun i : Fin n => A ^ a i * B ^ b i).prod\n\n/-- The source condition that `a₂, ..., aₙ` are all nonzero. In zero-based\nindexing these are precisely the entries whose index is at least one. -/\ndef AEntriesAfterFirstNonzero {n : ℕ} (a : Fin n → ℤ) : Prop :=\n ∀ i : Fin n, 1 ≤ i.val → a i ≠ 0\n\n/-- The source condition that `b₁, ..., bₙ₋₁` are all nonzero. In zero-based\nindexing these are precisely the entries whose index `i` satisfies\n`i + 1 < n`, i.e. all entries except the last one. -/\ndef BEntriesBeforeLastNonzero {n : ℕ} (b : Fin n → ℤ) : Prop :=\n ∀ i : Fin n, i.val + 1 < n → b i ≠ 0\n\n/-- The assertion from the problem: for every integer `n > 1`, there do not\nexist integer lists `a₁, ..., aₙ` and `b₁, ..., bₙ` satisfying the stated\nnonzero restrictions and making the alternating matrix word equal to the\n`2 × 2` identity matrix. The source's integer `n` is a length, so it is\nformalized as a natural number `n : ℕ`; the hypothesis `1 < n` is exactly the\nstated lower bound. -/\ndef Target : Prop :=\n ∀ n : ℕ, 1 < n →\n ¬ ∃ (a b : Fin n → ℤ),\n AEntriesAfterFirstNonzero a ∧\n BEntriesBeforeLastNonzero b ∧\n word n a b = 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e27c0f0-7dfe-59c9-9d2c-37d0afb00aae", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "67a3df6901073eaab6a255acbdcd80c5ddd5d1c42c081a40474ed7b2b8141fe8", "task_path": "tasks/nmp3_4e27c0f0-7dfe-59c9-9d2c-37d0afb00aae", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e27c0f0-7dfe-59c9-9d2c-37d0afb00aae", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4e2c544e-720c-5057-a21c-c251a0cebbf5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\Bigl(\\frac{a^{2}}{b}+\\frac{b^{2}}{c}+\\frac{c^{2}}{a}\\Bigr)^{2}\\ge \n-- 3\\Bigl(\\frac{a^{3}}{b}+\\frac{b^{3}}{c}+\\frac{c^{3}}{a}\\Bigr)\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`,\n`(a^2 / b + b^2 / c + c^2 / a)^2` is at least\n`3 * (a^3 / b + b^3 / c + c^3 / a)`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n (a ^ 2 / b + b ^ 2 / c + c ^ 2 / a) ^ 2 ≥\n 3 * (a ^ 3 / b + b ^ 3 / c + c ^ 3 / a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e2c544e-720c-5057-a21c-c251a0cebbf5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "844fb40aaa36650443acc317cee29cd226f4681b525cf5b7a9930979246ba542", "task_path": "tasks/nmp3_4e2c544e-720c-5057-a21c-c251a0cebbf5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e2c544e-720c-5057-a21c-c251a0cebbf5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4e348453-cc43-517a-8efe-3e8b2f89c77a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m>1$ be an integer. Let $D=\\{d:d\\mid m,\\ d>0\\}$ be the set of positive divisors of $m$, and let $H\\subseteq D$. Prove that if $|H|>\\dfrac{|D|}{2}$, then there exist three numbers (not necessarily distinct) in $H$ whose product is a perfect square.\nimport Mathlib\n\n/-!\n# Formalization of the positive-divisors square-product problem\n\nThe source problem asks us to prove that any subset `H` of the positive\ndivisors of an integer `m > 1` which contains more than half of those\ndivisors has three (not necessarily distinct) elements whose product is a\nperfect square.\n-/\n\nnamespace Problem\n\n/-- The set `D` from the problem: the positive divisors of the integer `m`.\n\n`Int.divisors m` is finite and, for `m ≠ 0`, consists of all positive and\nnegative divisors. Filtering by positivity therefore gives exactly the\npositive divisors occurring in the source statement. -/\ndef positiveDivisors (m : ℤ) : Finset ℤ :=\n (Int.divisors m).filter (fun d => 0 < d)\n\n/-- An integer `n` is a perfect square if it is the square of an integer. -/\ndef IsPerfectSquare (n : ℤ) : Prop :=\n ∃ k : ℤ, n = k ^ 2\n\n/-- `H` contains three elements, possibly repeated, whose product is a perfect\nsquare. The three existential witnesses are independent, so they are allowed\nto be equal; the product order is symmetric. -/\ndef HasThreeWithSquareProduct (H : Finset ℤ) : Prop :=\n ∃ a ∈ H, ∃ b ∈ H, ∃ c ∈ H, IsPerfectSquare (a * b * c)\n\n/-- The full assertion of the source problem.\n\nFor every integer `m > 1` and every finite `H` contained in the positive\ndivisors of `m`, if `|H| > |D| / 2`, then `H` has three (not necessarily\ndistinct) elements whose product is an integer square. Cardinalities are\ncoerced to `ℝ` so that the displayed half is literal division by `2`, rather\nthan natural-number floor division. -/\ndef Target : Prop :=\n ∀ (m : ℤ) (H : Finset ℤ),\n 1 < m →\n H ⊆ positiveDivisors m →\n (H.card : ℝ) > ((positiveDivisors m).card : ℝ) / 2 →\n HasThreeWithSquareProduct H\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e348453-cc43-517a-8efe-3e8b2f89c77a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c926ea4eed103e4c8a8551c5a03fbd6889204f75e01a425bee19cef00cb5d452", "task_path": "tasks/nmp3_4e348453-cc43-517a-8efe-3e8b2f89c77a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e348453-cc43-517a-8efe-3e8b2f89c77a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4e37e401-00e3-5716-8f68-e5cda1e06a49", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge 0$. Prove that \n-- \\[\n-- \\frac{1}{3\\sqrt{3}}\\,(x+y+z)^{3/2}\\,(\\sqrt{x}+\\sqrt{y}+\\sqrt{z})\\;\\ge\\;xy+yz+zx\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypothesis that the three real variables are nonnegative. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z\n\n/-- The inequality asserted in the problem, for a fixed nonnegative triple. -/\nnoncomputable def Inequality (x y z : ℝ) : Prop :=\n (1 / (3 * Real.sqrt 3)) * (x + y + z) ^ (3 / 2 : ℝ) *\n (Real.sqrt x + Real.sqrt y + Real.sqrt z) ≥\n x * y + y * z + z * x\n\n/-- The full universal statement of the problem:\nfor all nonnegative reals `x`, `y`, and `z`, the displayed inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e37e401-00e3-5716-8f68-e5cda1e06a49", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8d78da40d0a957188013d004ac5574430136526b51ef19f5bd3a901c60b90bee", "task_path": "tasks/nmp3_4e37e401-00e3-5716-8f68-e5cda1e06a49", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e37e401-00e3-5716-8f68-e5cda1e06a49", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4e3ad08a-a13a-5930-b8a8-13d360aa8dd1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $c>0$ be a real number. Suppose that for every positive integer $n$, at least one percent of the numbers $2^c,3^c,\\dots ,n^c$ are integers. Prove that $c$ is an integer.\nimport Mathlib\n\n/-!\n# Formalization of the statement\n\nLet `c > 0` be a real number. Suppose that, for every positive integer `n`,\nat least one percent of the numbers `2^c, 3^c, ..., n^c` are integers.\nThe conclusion is that `c` is an integer.\n\nThis file states the proposition only; it deliberately contains no proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A real number `x` is an integer if it is the image of an integer under the\ncanonical embedding `ℤ → ℝ`. -/\ndef IsIntegerReal (x : ℝ) : Prop :=\n ∃ z : ℤ, x = (z : ℝ)\n\n/-- The set of indices in the displayed list `2^c, 3^c, ..., n^c`. Thus it is\nthe finite set `{2, 3, ..., n}` of natural numbers. -/\ndef powerIndexSet (n : ℕ) : Finset ℕ :=\n Finset.Icc 2 n\n\n/-- The assertion that the real power `k ^ c` is an integer. The exponent is a\nreal exponent, represented by `Real.rpow` through the notation `(k : ℝ) ^ c`. -/\ndef PowerIsInteger (c : ℝ) (k : ℕ) : Prop :=\n ∃ z : ℤ, (k : ℝ) ^ c = (z : ℝ)\n\n/-- The number of integers among `2 ^ c, 3 ^ c, ..., n ^ c`. The term `k ^ c`\nis counted exactly when it is an integer. -/\nnoncomputable def integerPowerCount (c : ℝ) (n : ℕ) : ℕ := by\n classical\n exact ((powerIndexSet n).filter (fun k : ℕ => PowerIsInteger c k)).card\n\n/-- The one-percent condition at a fixed integer `n`: the count of integer\nvalues among `2 ^ c, ..., n ^ c` is at least one hundredth of the number of\nterms in that displayed list. The number of displayed terms is\n`(powerIndexSet n).card`, which is `n - 1` for positive `n`. -/\ndef OnePercentAt (c : ℝ) (n : ℕ) : Prop :=\n (((powerIndexSet n).card : ℝ) / 100) ≤ (integerPowerCount c n : ℝ)\n\n/-- The hypothesis that the one-percent condition holds for every positive\ninteger `n`. -/\ndef OnePercentIntegerPowers (c : ℝ) : Prop :=\n ∀ n : ℕ, 0 < n → OnePercentAt c n\n\n/-- The full assertion of the problem: for every real `c > 0`, if at least one\npercent of the numbers `2^c, 3^c, ..., n^c` are integers for every positive\ninteger `n`, then `c` is an integer. -/\ndef Target : Prop :=\n ∀ c : ℝ, 0 < c → OnePercentIntegerPowers c → IsIntegerReal c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e3ad08a-a13a-5930-b8a8-13d360aa8dd1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1227d8a92257d183040916f8afff605bbe7bec83f427337c18bda34c014f3645", "task_path": "tasks/nmp3_4e3ad08a-a13a-5930-b8a8-13d360aa8dd1", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e3ad08a-a13a-5930-b8a8-13d360aa8dd1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4e4efe5c-238e-5e7b-9843-98dce483ed18", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $\\sqrt a+\\sqrt b+\\sqrt c=1$. Prove that \n-- \\[\n-- \\frac{a^2+bc}{a\\sqrt{b+c}}+\\frac{b^2+ca}{b\\sqrt{c+a}}+\\frac{c^2+ab}{c\\sqrt{a+b}}\\ge \\sqrt2\\,. \n-- \\]\nimport Mathlib\n\nset_option autoImplicit false\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b * c) / (a * Real.sqrt (b + c)) +\n (b ^ 2 + c * a) / (b * Real.sqrt (c + a)) +\n (c ^ 2 + a * b) / (c * Real.sqrt (a + b))\n\n/-- The assertion: for every positive real triple `a, b, c` satisfying\n`sqrt a + sqrt b + sqrt c = 1`, the stated cyclic sum is at least `sqrt 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n Real.sqrt a + Real.sqrt b + Real.sqrt c = (1 : ℝ) →\n lhs a b c ≥ Real.sqrt (2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e4efe5c-238e-5e7b-9843-98dce483ed18", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f7c40cacbf53049e6eb40ea3d2f4b722f4e69dc1b3ab8000f293c1c4a7b390c6", "task_path": "tasks/nmp3_4e4efe5c-238e-5e7b-9843-98dce483ed18", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e4efe5c-238e-5e7b-9843-98dce483ed18", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4e598042-967d-5dd4-9ea5-85d171f3c38b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle. Prove that \n-- \\[\n-- \\frac{1}{8abc+(a+b-c)^{3}}+\\frac{1}{8abc+(b+c-a)^{3}}+\\frac{1}{8abc+(c+a-b)^{3}}\\le \\frac{1}{3abc}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the triangle side-length inequality\n\nThe source problem asks, for the side lengths `a`, `b`, and `c` of a\n(nondegenerate) triangle, to prove the inequality\n\n`1 / (8abc + (a+b-c)^3) + 1 / (8abc + (b+c-a)^3)\n + 1 / (8abc + (c+a-b)^3) ≤ 1 / (3abc)`.\n\nThe declarations below record the assertion without supplying a proof.\n-/\n\nnamespace Problem\n\n/-- `a`, `b`, and `c` are the side lengths of a nondegenerate Euclidean\ntriangle. Thus they are positive and satisfy the three strict triangle\ninequalities. -/\ndef TriangleSides (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n 1 / (8 * a * b * c + (a + b - c) ^ 3) +\n 1 / (8 * a * b * c + (b + c - a) ^ 3) +\n 1 / (8 * a * b * c + (c + a - b) ^ 3)\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 1 / (3 * a * b * c)\n\n/-- The assertion for a fixed triple of triangle side lengths. -/\ndef TargetFor (a b c : ℝ) : Prop :=\n TriangleSides a b c → LHS a b c ≤ RHS a b c\n\n/-- The complete universally quantified assertion from the source problem:\nfor every real triple that can be the side lengths of a triangle, the stated\nsum of reciprocal cubic-type terms is at most `1 / (3abc)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, TargetFor a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e598042-967d-5dd4-9ea5-85d171f3c38b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2b44e604ac435d60d6569289b92c4c4224d836d9985d8b8624ca85ab63404ba5", "task_path": "tasks/nmp3_4e598042-967d-5dd4-9ea5-85d171f3c38b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e598042-967d-5dd4-9ea5-85d171f3c38b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4e6897dc-4f60-5354-83b7-c2772b07ca9d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy \n-- \\[\n-- 2a^3b+2b^3c+2c^3a=a^2b^2+b^2c^2+c^2a^2.\n-- \\] \n-- Prove that \n-- \\[\n-- 2ab(a-b)^2+2bc(b-c)^2+2ca(c-a)^2\\ge (ab+bc+ca)^2.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The strict positivity hypotheses for the three real variables. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The displayed cubic equation from the problem hypotheses. -/\ndef CubicEquation (a b c : ℝ) : Prop :=\n 2 * a ^ 3 * b + 2 * b ^ 3 * c + 2 * c ^ 3 * a =\n a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2\n\n/-- The complete admissibility condition: strict positivity and the displayed\ncubic equation. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositiveTriple a b c ∧ CubicEquation a b c\n\n/-- The displayed inequality to be proved under the problem hypotheses. -/\ndef MainInequality (a b c : ℝ) : Prop :=\n 2 * a * b * (a - b) ^ 2 +\n 2 * b * c * (b - c) ^ 2 +\n 2 * c * a * (c - a) ^ 2\n ≥ (a * b + b * c + c * a) ^ 2\n\n/-- The complete universal implication asserted by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → MainInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e6897dc-4f60-5354-83b7-c2772b07ca9d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "30d9a83cac7be2e82dfcdf59aaf808e4ab7f9e2d4bb50f8ad44e54a05bfd8992", "task_path": "tasks/nmp3_4e6897dc-4f60-5354-83b7-c2772b07ca9d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e6897dc-4f60-5354-83b7-c2772b07ca9d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4e769079-35e7-53e9-b370-0ae3e9eb0b72", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{a+1}{a^{4}}+\\frac{b+1}{b^{4}}+\\frac{c+1}{c^{4}}\\ge\\frac34\\,(a+1)(b+1)(c+1)\\,. \n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The positivity assumptions `a > 0`, `b > 0`, and `c > 0`. -/\ndef PositiveABC (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The product assumption `abc = 1`. -/\ndef ABCProductOne (a b c : ℝ) : Prop :=\n a * b * c = 1\n\n/-- The full admissibility assumption: `a, b, c > 0` and `abc = 1`. -/\ndef AdmissibleABC (a b c : ℝ) : Prop :=\n PositiveABC a b c ∧ ABCProductOne a b c\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n (a + 1) / a ^ 4 + (b + 1) / b ^ 4 + (c + 1) / c ^ 4\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def RightHandSide (a b c : ℝ) : ℝ :=\n (3 / 4 : ℝ) * (a + 1) * (b + 1) * (c + 1)\n\n/-- The displayed inequality for fixed values of `a`, `b`, and `c`. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n LeftHandSide a b c ≥ RightHandSide a b c\n\n/-- The complete assertion: for all real `a`, `b`, and `c` satisfying\n`a > 0`, `b > 0`, `c > 0`, and `abc = 1`, the displayed inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, AdmissibleABC a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e769079-35e7-53e9-b370-0ae3e9eb0b72", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "42e764cc7ec7971896de880c64f84002b857129674128ca98e9d199a15cf78a9", "task_path": "tasks/nmp3_4e769079-35e7-53e9-b370-0ae3e9eb0b72", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e769079-35e7-53e9-b370-0ae3e9eb0b72", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4e84c10e-ef71-5ee8-a718-f3e2051fb28b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, $c$ be positive numbers such that $a+b+c=ab+bc+ca$. Prove that \n-- \\[\n-- \\frac{a}{a^{2}+2bc}+\\frac{b}{b^{2}+2ca}+\\frac{c}{c^{2}+2ab}\\le 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the source inequality problem\n\nThe source asks: for positive real numbers `a`, `b`, and `c` satisfying\n`a + b + c = ab + bc + ca`, prove\n`a / (a^2 + 2bc) + b / (b^2 + 2ca) + c / (c^2 + 2ab) ≤ 1`.\n\nThis file states the assertion only; it does not contain a proof.\n-/\n\nnamespace Problem\n\n/-- The three variables are positive real numbers. -/\ndef IsPositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The constraint `a + b + c = ab + bc + ca`, with multiplication and\naddition read in the real numbers. -/\ndef SumProductEquation (a b c : ℝ) : Prop :=\n a + b + c = a * b + b * c + c * a\n\n/-- The complete hypotheses of the source problem. -/\ndef Hypotheses (a b c : ℝ) : Prop :=\n IsPositiveTriple a b c ∧ SumProductEquation a b c\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / (a ^ 2 + 2 * b * c) +\n b / (b ^ 2 + 2 * c * a) +\n c / (c ^ 2 + 2 * a * b)\n\n/-- The inequality to be proved, for arbitrary real `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ 1\n\n/-- The full universally quantified statement of the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Hypotheses a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e84c10e-ef71-5ee8-a718-f3e2051fb28b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0805049984d21e30db32ab0097d5a9d2c59125d61a95f85852c61cb8a4924022", "task_path": "tasks/nmp3_4e84c10e-ef71-5ee8-a718-f3e2051fb28b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e84c10e-ef71-5ee8-a718-f3e2051fb28b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4e97fab2-c385-5b03-b46f-e513c72c5086", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy \n-- \\[\n-- \\sqrt{a^2-ab+b^2}+\\sqrt{b^2-bc+c^2}+\\sqrt{c^2-ca+a^2}=1.\n-- \\] \n-- Prove that \n-- \\[\n-- \\frac{a}{1+\\sqrt{bc}}+\\frac{b}{1+\\sqrt{ca}}+\\frac{c}{1+\\sqrt{ab}}\\le\\frac34.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-variables problem\n\nThe source problem asks to prove, for all positive reals `a`, `b`, `c`\nsatisfying the displayed square-root identity, the displayed bound on the\nsum of three fractions. The declarations below merely state that problem;\nthey do not assert that it has been proved.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The three-term square-root constraint from the problem. -/\ndef Constraint (a b c : ℝ) : Prop :=\n Real.sqrt (a ^ 2 - a * b + b ^ 2) +\n Real.sqrt (b ^ 2 - b * c + c ^ 2) +\n Real.sqrt (c ^ 2 - c * a + a ^ 2) = 1\n\n/-- The left-hand side of the asserted inequality. -/\ndef InequalityLHS (a b c : ℝ) : ℝ :=\n a / (1 + Real.sqrt (b * c)) +\n b / (1 + Real.sqrt (c * a)) +\n c / (1 + Real.sqrt (a * b))\n\n/-- The assertion to be proved: for all positive reals `a`, `b`, `c`, the\nsquare-root constraint implies the stated upper bound. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n Constraint a b c →\n InequalityLHS a b c ≤ (3 : ℝ) / 4\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e97fab2-c385-5b03-b46f-e513c72c5086", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f589519cc9ac2d293bb85b1e76ff9d0bbcea891e693114d4613d3626a8193e85", "task_path": "tasks/nmp3_4e97fab2-c385-5b03-b46f-e513c72c5086", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4e97fab2-c385-5b03-b46f-e513c72c5086", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4eabc38a-f32e-55e1-b395-3f5a1d42a37c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f,g:\\mathbb{R}\\to\\mathbb{R}$ such that for all real numbers $x$ and $y$,\n-- $$f(x^{3}+2y)+f(x+y)=g(x+2y).$$\nimport Mathlib\n\n/-!\n# Formal statement: real functions satisfying a functional equation\n\nThe problem asks for all pairs of functions `f g : ℝ → ℝ` such that\n`f (x^3 + 2*y) + f (x + y) = g (x + 2*y)` for every pair of reals `x, y`.\n\nWe formalize the admissibility predicate, the proposed complete solution\nfamily, and the predicate saying that a set of function pairs is the complete\nanswer. The target proposition is stated but not proved here.\n-/\n\nnamespace Problem\n\n/-- A pair of real-valued functions of one real variable. -/\nabbrev FunctionPair : Type := (ℝ → ℝ) × (ℝ → ℝ)\n\n/-- The admissibility predicate from the problem: the displayed functional\nequation holds for every pair of real numbers `x` and `y`. -/\ndef Admissible (p : FunctionPair) : Prop :=\n ∀ x y : ℝ,\n p.1 (x ^ 3 + 2 * y) + p.1 (x + y) = p.2 (x + 2 * y)\n\n/-- The proposed solution family: `f` is a constant function `c`, and `g` is\nthe constant function `2 * c`. -/\ndef IsProposedSolution (p : FunctionPair) : Prop :=\n ∃ c : ℝ,\n p.1 = (fun _ : ℝ => c) ∧\n p.2 = (fun _ : ℝ => 2 * c)\n\n/-- The proposed answer, as a set of function pairs. -/\ndef ProposedSolutionSet : Set FunctionPair :=\n {p : FunctionPair | IsProposedSolution p}\n\n/-- A set `S` is a complete answer when it contains exactly the admissible\nfunction pairs: soundness and completeness are both required. -/\ndef IsCompleteAnswer (S : Set FunctionPair) : Prop :=\n (∀ p : FunctionPair, p ∈ S → Admissible p) ∧\n (∀ p : FunctionPair, Admissible p → p ∈ S)\n\n/-- The formal target: the explicitly proposed constant family is the\ncomplete set of all solutions to the functional equation. -/\ndef Target : Prop :=\n IsCompleteAnswer ProposedSolutionSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4eabc38a-f32e-55e1-b395-3f5a1d42a37c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dedb1b6119221032ed57e1399b92d0a64b477a9e15dbfb4ec213e4a71c0831f1", "task_path": "tasks/nmp3_4eabc38a-f32e-55e1-b395-3f5a1d42a37c", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4eabc38a-f32e-55e1-b395-3f5a1d42a37c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4eb69aa1-77fd-5129-a58b-15feb3e19b14", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:[0,2015]\\to\\mathbb R$ be a continuous function with $f(0)=f(2015)$. Prove that there exist at least $2015$ distinct pairs $(x,y)$ with $x,y\\in[0,2015]$, $x>y$, $x-y\\in\\mathbb N$, and $f(x)=f(y)\\,.\nimport Mathlib\n\n/-!\n# Formalization of a continuous-function pair-counting problem\n\nThe source problem asks to prove that every continuous real-valued function on\n`[0, 2015]` whose endpoint values agree has at least `2015` distinct ordered\npairs `(x, y)` satisfying `x > y`, with natural-number difference and equal\nvalues.\n\nThe declarations below state the target as a proposition. No proof of the\ntarget is supplied.\n-/\n\nnamespace Problem\n\n/-- The closed real interval `[0, 2015]`. -/\nabbrev Interval : Type := Set.Icc (0 : ℝ) (2015 : ℝ)\n\n/-- The left endpoint `0` of the interval `[0, 2015]`. -/\ndef intervalLeft : Interval :=\n ⟨(0 : ℝ), by norm_num⟩\n\n/-- The right endpoint `2015` of the interval `[0, 2015]`. -/\ndef intervalRight : Interval :=\n ⟨(2015 : ℝ), by norm_num⟩\n\n/-- A real number has a natural-number difference representation when it is the\ncoercion of some natural number. -/\ndef IsNaturalDifference (d : ℝ) : Prop :=\n ∃ n : ℕ, d = (n : ℝ)\n\n/-- The admissibility condition on an ordered pair `(x, y)` for a function\n`f : [0, 2015] → ℝ`: `x > y`, the real difference `x - y` is a natural number,\nand `f x = f y`. Membership of `x` and `y` in `[0, 2015]` is enforced by their\ntypes. -/\ndef AdmissiblePair (f : Interval → ℝ) (x y : Interval) : Prop :=\n (x : ℝ) > (y : ℝ) ∧\n IsNaturalDifference ((x : ℝ) - (y : ℝ)) ∧\n f x = f y\n\n/-- There are at least `2015` distinct admissible ordered pairs. This is\nexpressed by the existence of a finite set whose cardinality is at least `2015`\nand all of whose members are admissible pairs; `Finset` carries distinctness as\npart of its data. -/\ndef HasAtLeast2015Pairs (f : Interval → ℝ) : Prop :=\n ∃ pairs : Finset (Interval × Interval),\n (2015 : ℕ) ≤ pairs.card ∧\n ∀ p ∈ pairs, AdmissiblePair f p.1 p.2\n\n/-- The formal target: for every continuous function `f : [0, 2015] → ℝ` with\n`f 0 = f 2015`, there exist at least `2015` distinct admissible ordered pairs.\n-/\ndef Target : Prop :=\n ∀ f : Interval → ℝ,\n Continuous f →\n f intervalLeft = f intervalRight →\n HasAtLeast2015Pairs f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4eb69aa1-77fd-5129-a58b-15feb3e19b14", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3550be46b74964dd158fd6e492f92b705f17c1546888ad38e7a25f9503a1e6c2", "task_path": "tasks/nmp3_4eb69aa1-77fd-5129-a58b-15feb3e19b14", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4eb69aa1-77fd-5129-a58b-15feb3e19b14", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4eda79e6-1cf5-5294-9bb1-51a7795e3e07", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $f:[0,2\\pi]\\rightarrow\\mathbb{R}$ is a convex function. Prove that for every integer $k\\ge 1$,\n-- \\[\n-- \\int_{0}^{2\\pi} f(x)\\,\\cos(kx)\\,dx\\;\\ge\\;0.\n-- \\]\nimport Mathlib\n\nopen scoped Interval\n\nnamespace Problem\n\n/-- The closed interval `[0, 2π]`. -/\ndef interval : Set ℝ := Set.Icc 0 (2 * Real.pi)\n\n/-- The cosine moment of order `k` on `[0, 2π]`. -/\nnoncomputable def CosineMoment (f : ℝ → ℝ) (k : ℤ) : ℝ :=\n ∫ x in (0 : ℝ)..(2 * Real.pi), f x * Real.cos ((k : ℝ) * x)\n\n/-- Admissibility: a real-valued function is convex on `[0, 2π]`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ConvexOn ℝ interval f\n\n/-- The problem's assertion: for every function that is convex on `[0, 2π]`\nand every integer `k ≥ 1`, the `k`-th cosine moment is nonnegative. -/\ndef Target : Prop :=\n ∀ (f : ℝ → ℝ), Admissible f → ∀ k : ℤ, 1 ≤ k → 0 ≤ CosineMoment f k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4eda79e6-1cf5-5294-9bb1-51a7795e3e07", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0b7cb982467b94a54c5bc72bbc42c2351ebe920ba8f58d4f18f6ec0b19782c7f", "task_path": "tasks/nmp3_4eda79e6-1cf5-5294-9bb1-51a7795e3e07", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4eda79e6-1cf5-5294-9bb1-51a7795e3e07", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4ede1435-f068-507a-b220-e66a4e0f0d54", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 110 teams participate in a round‑robin volleyball tournament (each pair of teams plays exactly once, with no ties). It is known that in any set of 55 teams there is a team that has lost to at most 4 of the other 54 teams in that set. Prove that in the whole tournament there exists a team that has lost to at most 4 of the other 109 teams.\nimport Mathlib\n\n/-!\n# Formal statement: a finite tournament with a local low-loss condition\n\nThe problem concerns a round-robin volleyball tournament on exactly 110 teams.\nEvery pair of distinct teams plays exactly once, and there are no ties. Thus,\nfor each two distinct teams, exactly one of them loses to the other.\n\nThe supplied hypothesis says that every set of 55 teams contains a team that\nhas lost to at most 4 of the other 54 teams in that set. The conclusion is\nthat some team in the whole tournament has lost to at most 4 of the other 109\nteams.\n-/\n\nnamespace Problem\n\n/-- The universe of teams: a finite type with exactly 110 elements. -/\nabbrev Team : Type := Fin 110\n\n/--\n`IsRoundRobinTournament losesTo` records the tournament format.\n\nThe relation `losesTo a b` means that team `a` lost to team `b`. No team\nloses to itself, and between any two distinct teams exactly one loss direction\noccurs. In particular, every pair plays exactly once and there are no ties.\n-/\ndef IsRoundRobinTournament (losesTo : Team → Team → Prop) : Prop :=\n (∀ (a : Team), ¬ losesTo a a) ∧\n (∀ (a b : Team), a ≠ b →\n ((losesTo a b ∧ ¬ losesTo b a) ∨\n (¬ losesTo a b ∧ losesTo b a)))\n\n/--\n`LossCountIn losesTo S t` is the number of teams in the finite set `S` to which\nteam `t` lost. The condition `s ≠ t` explicitly excludes `t` itself, so this\nis a count among the *other* teams of `S`.\n-/\nnoncomputable def LossCountIn (losesTo : Team → Team → Prop)\n (S : Finset Team) (t : Team) : ℕ := by\n classical\n exact (S.filter (fun (s : Team) => s ≠ t ∧ losesTo t s)).card\n\n/--\n`LossCount losesTo t` is team `t`'s number of losses against the other 109\nteams in the whole 110-team tournament.\n-/\nnoncomputable def LossCount (losesTo : Team → Team → Prop) (t : Team) : ℕ :=\n LossCountIn losesTo Finset.univ t\n\n/--\nThe problem's hypothesis: every set of 55 teams contains a team with at most\n4 losses to the other teams of that set.\n-/\ndef FiftyFiveTeamCondition (losesTo : Team → Team → Prop) : Prop :=\n ∀ (S : Finset Team), S.card = 55 →\n ∃ (t : Team), t ∈ S ∧ LossCountIn losesTo S t ≤ 4\n\n/--\nThe problem's conclusion: in the whole tournament, there exists a team with\nat most 4 losses among the other 109 teams.\n-/\ndef WholeTournamentConclusion (losesTo : Team → Team → Prop) : Prop :=\n ∃ (t : Team), LossCount losesTo t ≤ 4\n\n/--\nThe full statement to be proved, universally over all tournaments on the\n110-team universe satisfying the supplied local condition.\n-/\ndef Target : Prop :=\n ∀ (losesTo : Team → Team → Prop),\n IsRoundRobinTournament losesTo →\n FiftyFiveTeamCondition losesTo →\n WholeTournamentConclusion losesTo\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4ede1435-f068-507a-b220-e66a4e0f0d54", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "06a00a2f8021678d9600b01aa94661b4aa9024e2b45d89ad6162fa5df24e9478", "task_path": "tasks/nmp3_4ede1435-f068-507a-b220-e66a4e0f0d54", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4ede1435-f068-507a-b220-e66a4e0f0d54", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4ee526ed-146f-5c35-abc8-afc5b3a355d1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ satisfy $xyz=1$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{x}{1+x^{4}}\\le\\frac32\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion: for all positive real numbers `x`, `y`, and `z` whose\nproduct is `1`, the cyclic sum `x / (1 + x^4)` is at most `3 / 2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x * y * z = 1 →\n x / (1 + x ^ 4) + y / (1 + y ^ 4) + z / (1 + z ^ 4) ≤ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4ee526ed-146f-5c35-abc8-afc5b3a355d1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d10a24e643d023000667c6422148dbd14e91ff2b9aca70726ca412cbbf2ffe59", "task_path": "tasks/nmp3_4ee526ed-146f-5c35-abc8-afc5b3a355d1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4ee526ed-146f-5c35-abc8-afc5b3a355d1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4efe4ffd-68c8-5572-89a8-214359f768ec", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(f:\\mathbb{R}\\to\\mathbb{R}\\) be a function such that for every real series \\(\\sum a_n\\) that converges, the series \\(\\sum f(a_n)\\) also converges. Prove that there exist a real constant \\(k\\) and a neighborhood of \\(0\\) on which \\(f(x)=kx\\) for all \\(x\\) in that neighborhood.\nimport Mathlib\n\n/-!\n# Formalization of the statement\n\nThe source problem concerns ordinary (not unconditional) convergence of real series.\nTherefore `RealSeriesConverges` is stated explicitly in terms of convergence of the\nsequence of finite partial sums, rather than using Mathlib's default `Summable`,\nwhich means unconditional summability.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A real series `∑ n, a n` converges in the ordinary sense: its sequence of\npartial sums over `Finset.range n` converges to some real number. -/\ndef RealSeriesConverges (a : ℕ → ℝ) : Prop :=\n ∃ s : ℝ,\n Filter.Tendsto (fun n : ℕ => ∑ i ∈ Finset.range n, a i)\n Filter.atTop (nhds s)\n\n/-- The hypothesis of the problem: applying `f` termwise preserves ordinary\nconvergence of every real series. -/\ndef PreservesConvergentRealSeries (f : ℝ → ℝ) : Prop :=\n ∀ a : ℕ → ℝ, RealSeriesConverges a →\n RealSeriesConverges (fun n : ℕ => f (a n))\n\n/-- The conclusion of the problem: `f` agrees with multiplication by a fixed real\nconstant on an open neighborhood of zero. The neighborhood is represented by the\nstrict interval `{x : ℝ | |x| < ε}` for some `ε > 0`. -/\ndef LinearOnNeighborhoodOfZero (f : ℝ → ℝ) : Prop :=\n ∃ k : ℝ, ∃ ε : ℝ, 0 < ε ∧ ∀ x : ℝ, |x| < ε → f x = k * x\n\n/-- The full formal statement of the source problem. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, PreservesConvergentRealSeries f → LinearOnNeighborhoodOfZero f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4efe4ffd-68c8-5572-89a8-214359f768ec", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c61efd72ecb3322b83a291603ca3fa0527d49fc5df990dbe1c1e1e657ffa62e9", "task_path": "tasks/nmp3_4efe4ffd-68c8-5572-89a8-214359f768ec", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4efe4ffd-68c8-5572-89a8-214359f768ec", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4f1c57bc-7e15-5cde-9142-1922fba8cc44", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Color each point in the plane with one of two colors. Let $n\\ge 3$ be a positive integer. Prove that there exist $n$ points of the same color such that their centroid is also that color.\nimport Mathlib\n\n/-!\n# Formalization of the two-coloring and centroid problem\n\nThe plane is represented by `ℝ × ℝ`. A two-coloring is represented by a\nfunction from the plane to `Fin 2`. A finite set of points is represented by\na `Finset`, so its members are distinct. The centroid of a nonempty finite set\nis the scalar multiple of the sum of its points by the reciprocal of its\ncardinality.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane, represented by pairs of real numbers. -/\nabbrev Plane : Type := ℝ × ℝ\n\n/-- The two available colors. -/\nabbrev Color : Type := Fin 2\n\n/-- The centroid of a finite set of points in the plane. For an empty set this\nis defined as zero via the inverse of zero, but all uses in the target have\ncardinality at least three. -/\nnoncomputable def centroid (s : Finset Plane) : Plane :=\n ((s.card : ℝ)⁻¹) • s.sum (fun p => p)\n\n/-- The complete assertion: for every integer `n ≥ 3` and every two-coloring\nof the plane, there is a set of exactly `n` distinct points all having one\ncolor, whose centroid has that same color. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 3 ≤ n →\n ∀ color : Plane → Color,\n ∃ (s : Finset Plane) (c : Color),\n s.card = n ∧\n (∀ p ∈ s, color p = c) ∧\n color (centroid s) = c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f1c57bc-7e15-5cde-9142-1922fba8cc44", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cbb35b8b0cfdcfaa61acf51917627a430c05a0a9414fab1e99d6fe2bac2b622d", "task_path": "tasks/nmp3_4f1c57bc-7e15-5cde-9142-1922fba8cc44", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f1c57bc-7e15-5cde-9142-1922fba8cc44", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4f2067fe-5936-5fd1-b983-8b7fafe34d9b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any three positive real numbers $a$, $b$, $c$, prove that \n-- \\[\n-- (a+b)(b+c)(c+a)\\,\\bigl(a^{2}+b^{2}+c^{2}\\bigr)^{3}\\;\\ge\\;(a^{2}+b^{2})(b^{2}+c^{2})(c^{2}+a^{2})\\,(a+b+c)^{3}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion that for every triple of strictly positive real numbers\n`a`, `b`, `c`, the stated non-strict inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n (a + b) * (b + c) * (c + a) * (a ^ 2 + b ^ 2 + c ^ 2) ^ 3 ≥\n (a ^ 2 + b ^ 2) * (b ^ 2 + c ^ 2) * (c ^ 2 + a ^ 2) *\n (a + b + c) ^ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f2067fe-5936-5fd1-b983-8b7fafe34d9b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8a9af30c5dbe7f9f9f333e0650fcfdab92c76b6634c21ede5b747d9bb210acab", "task_path": "tasks/nmp3_4f2067fe-5936-5fd1-b983-8b7fafe34d9b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f2067fe-5936-5fd1-b983-8b7fafe34d9b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4f284448-b769-5e6e-9cfb-9c59f41b3a52", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f(x)$ be a non‑constant polynomial with integer coefficients such that $f(1)\\neq 1$. For a positive integer $n$, denote by $\\operatorname{divs}(n)$ the set of positive divisors of $n$. \n-- A positive integer $m$ is called *$f$‑cool* if there exists a positive integer $n$ satisfying \n-- \\[\n-- f\\big[\\operatorname{divs}(m)\\big]=\\operatorname{divs}(n),\n-- \\] \n-- where $f[S]=\\{f(s):s\\in S\\}$. \n-- Prove that for any such polynomial $f$ there are only finitely many $f$‑cool integers.\nimport Mathlib\n\n/-!\n# Formalization of the statement of the \"f-cool integers\" problem\n\nThe source problem asks to prove that, for every nonconstant integer polynomial\n`f` with `f(1) ≠ 1`, the positive integers `m` for which the image of the\npositive divisors of `m` under `f` is again the set of positive divisors of some\npositive integer `n` are finite.\n\nThe declarations below only state the problem. In particular, `Target` is a\n`Prop` whose body is the proposition asserted in the problem; no proof is\nprovided.\n-/\n\nnamespace Problem\n\n/-- The set of positive divisors of a natural number, regarded as a set of\nintegers so that it can be compared with values of an integer polynomial.\n\nFor a positive `n`, this is exactly the source notation `divs(n)`. We define\nit for every natural `n` by the set-builder formula, so no separate finite-set\nencoding is needed. -/\ndef positiveDivisors (n : ℕ) : Set ℤ :=\n {z : ℤ | ∃ d : ℕ, 0 < d ∧ d ∣ n ∧ (d : ℤ) = z}\n\n/-- The image `f[divs(m)] = {f(s) : s ∈ divs(m)}`, with the positive divisors\nof `m` identified with their coercions to integers. -/\ndef polynomialImageOnPositiveDivisors (f : Polynomial ℤ) (m : ℕ) : Set ℤ :=\n (fun z : ℤ => Polynomial.eval z f) '' positiveDivisors m\n\n/-- A natural number `m` is `f`-cool according to the source definition: `m` is\npositive and there is a positive natural number `n` for which\n`f[divs(m)] = divs(n)`. -/\ndef IsFCool (f : Polynomial ℤ) (m : ℕ) : Prop :=\n 0 < m ∧\n ∃ n : ℕ,\n 0 < n ∧\n polynomialImageOnPositiveDivisors f m = positiveDivisors n\n\n/-- A positive integer `m`, represented as an integer, is `f`-cool when its\ncorresponding positive natural number is `f`-cool. -/\ndef IsFCoolInteger (f : Polynomial ℤ) (m : ℤ) : Prop :=\n 0 < m ∧ IsFCool f m.toNat\n\n/-- The set of `f`-cool integers. -/\ndef FCoolIntegers (f : Polynomial ℤ) : Set ℤ :=\n {m : ℤ | IsFCoolInteger f m}\n\n/-- An integer-coefficient polynomial is nonconstant when it is not equal to a\nconstant polynomial. -/\ndef IsNonconstantIntegerPolynomial (f : Polynomial ℤ) : Prop :=\n ¬ ∃ c : ℤ, f = Polynomial.C c\n\n/-- The admissibility assumptions on the polynomial in the source problem:\nit has integer coefficients (built into the type), is nonconstant, and\nsatisfies `f(1) ≠ 1`. -/\ndef AdmissiblePolynomial (f : Polynomial ℤ) : Prop :=\n IsNonconstantIntegerPolynomial f ∧ (Polynomial.eval (1 : ℤ) f ≠ (1 : ℤ))\n\n/-- The complete assertion of the source problem: for every nonconstant\ninteger polynomial `f` with `f(1) ≠ 1`, there are only finitely many `f`-cool\nintegers. -/\ndef Target : Prop :=\n ∀ f : Polynomial ℤ, AdmissiblePolynomial f → (FCoolIntegers f).Finite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f284448-b769-5e6e-9cfb-9c59f41b3a52", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "940bafc987208048284438cf3b634d22d4584593f37f49fc789361d4b27820a4", "task_path": "tasks/nmp3_4f284448-b769-5e6e-9cfb-9c59f41b3a52", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f284448-b769-5e6e-9cfb-9c59f41b3a52", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4f295999-5199-5973-a85c-c5302848ce45", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac12+\\frac{2abc}{(a+b)(b+c)(c+a)}\\ge \n-- \\frac{ab}{a^{2}+b^{2}+2c^{2}}+\\frac{bc}{2a^{2}+b^{2}+c^{2}}+\\frac{ca}{a^{2}+2b^{2}+c^{2}}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the proposed inequality\n\nThe original problem asks to prove, for all positive real numbers `a`, `b`, and\n`c`, the displayed inequality. This file records the proposition only; it does\nnot supply a proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the inequality for a real triple `(a, b, c)`. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) + (2 * a * b * c) / ((a + b) * (b + c) * (c + a))\n\n/-- The right-hand side of the inequality for a real triple `(a, b, c)`. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (a * b) / (a ^ 2 + b ^ 2 + 2 * c ^ 2) +\n (b * c) / (2 * a ^ 2 + b ^ 2 + c ^ 2) +\n (c * a) / (a ^ 2 + 2 * b ^ 2 + c ^ 2)\n\n/-- The displayed inequality, for a fixed real triple `(a, b, c)`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The three variables are positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The complete assertion from the problem: for every triple of positive real\nnumbers `a`, `b`, and `c`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → Inequality a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f295999-5199-5973-a85c-c5302848ce45", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a9e1282860838da3779785add92327c77049115d94023546883f0040a6ce8af9", "task_path": "tasks/nmp3_4f295999-5199-5973-a85c-c5302848ce45", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f295999-5199-5973-a85c-c5302848ce45", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4f3dcbf3-1955-5da4-b54e-b0cb1b17e62f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $ABCD$ is a convex quadrilateral with $\\angle ADC = 30^\\circ$ and $BD = AB + BC + CA$, prove that $BD$ bisects $\\angle ABC$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\nnoncomputable section\n\nopen scoped EuclideanGeometry RealInnerProductSpace\n\nnamespace Problem\n\n/-- The Euclidean plane, with points represented by two real coordinates. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Twice the oriented area of the triangle with vertices `A`, `B`, `C`.\nEquivalently, the two-dimensional cross product of the vectors `AB` and `AC`. -/\ndef orientedArea2 (A B C : Point) : ℝ :=\n (B 0 - A 0) * (C 1 - A 1) - (B 1 - A 1) * (C 0 - A 0)\n\n/-- `ABCD` is a strictly convex quadrilateral with its vertices in the cyclic order\n`A`, `B`, `C`, `D`. The four consecutive turns are nonzero and have one common sign,\nso either the counterclockwise or the clockwise boundary orientation is allowed. -/\ndef IsConvexQuadrilateral (A B C D : Point) : Prop :=\n orientedArea2 A B C * orientedArea2 B C D > 0 ∧\n orientedArea2 B C D * orientedArea2 C D A > 0 ∧\n orientedArea2 C D A * orientedArea2 D A B > 0\n\n/-- The interior angle `ADC` measures `30°`, expressed in radians. -/\ndef AngleADCIsThirtyDegrees (A C D : Point) : Prop :=\n EuclideanGeometry.angle A D C = Real.pi / 6\n\n/-- The Euclidean segment lengths satisfy `BD = AB + BC + CA`. -/\ndef DistanceCondition (A B C D : Point) : Prop :=\n dist B D = dist A B + dist B C + dist C A\n\n/-- The ray `BD` bisects the angle `ABC`, in the sense that the two nonoriented\nsubangles `∠ABD` and `∠DBC` are equal. Under the convex-quadrilateral hypothesis,\nthe diagonal `BD` lies inside `∠ABC`, so this is the internal angle bisector. -/\ndef BisectsAngleABC (A B C D : Point) : Prop :=\n EuclideanGeometry.angle A B D = EuclideanGeometry.angle D B C\n\n/-- The complete statement of the problem: for every strictly convex quadrilateral\n`ABCD` in the Euclidean plane, if `∠ADC = 30°` and `BD = AB + BC + CA`, then\n`BD` bisects `∠ABC`. -/\ndef Target : Prop :=\n ∀ A B C D : Point,\n IsConvexQuadrilateral A B C D →\n AngleADCIsThirtyDegrees A C D →\n DistanceCondition A B C D →\n BisectsAngleABC A B C D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f3dcbf3-1955-5da4-b54e-b0cb1b17e62f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "409b62a5366aaa89ca527e65bfd9db9d03e7a1f2c2062a52eb329a513f697f3e", "task_path": "tasks/nmp3_4f3dcbf3-1955-5da4-b54e-b0cb1b17e62f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f3dcbf3-1955-5da4-b54e-b0cb1b17e62f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4f64d08b-0815-5cec-bb07-3b792bc57447", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P(x),Q(x)\\in\\mathbb Z[x]$ be non‑constant polynomials (i.e. $\\deg P,\\deg Q\\ge1$) whose coefficients are all non‑negative integers. Define a sequence $(x_n)$ by \n-- \\[\n-- x_n=2000^{\\,P(n)}+Q(n)\\qquad\\text{for every integer }n\\ge1 .\n-- \\] \n-- Prove that there exist infinitely many distinct prime numbers $p$ such that $p$ divides $x_n$ for some $n\\ge1\\,.\nimport Mathlib\n\n/-!\n# Formalization of the prime-divisor problem for a polynomial sequence\n\nThe original problem considers nonconstant integer polynomials `P` and `Q` all of\nwhose coefficients are nonnegative, and the integer sequence\n\n`x_n = 2000 ^ (P n) + Q n` for positive integers `n`.\n\nIt asserts that infinitely many distinct prime numbers divide at least one term of\nthis sequence.\n-/\n\nnamespace Problem\n\n/-- A polynomial over the integers has all coefficients nonnegative. -/\ndef HasNonnegativeCoefficients (P : Polynomial ℤ) : Prop :=\n ∀ i : ℕ, 0 ≤ P.coeff i\n\n/-- An integer polynomial is nonconstant and has all coefficients nonnegative.\nThe condition `1 ≤ P.natDegree` is the formal version of `deg P ≥ 1`. -/\ndef IsNonconstantWithNonnegativeCoefficients (P : Polynomial ℤ) : Prop :=\n 1 ≤ P.natDegree ∧ HasNonnegativeCoefficients P\n\n/-- The `n`-th term of the sequence, with integer index `n`, evaluated in `P` and `Q` as an integer. For the indices\nused below (`1 ≤ n`), the nonnegativity hypotheses imply that `P.eval n` is\nnonnegative, so `Int.toNat` is the intended integer exponent. -/\nnoncomputable def sequenceTerm (P Q : Polynomial ℤ) (n : ℤ) : ℤ :=\n (2000 : ℤ) ^ (P.eval n).toNat + Q.eval n\n\n/-- The set of prime numbers that divide at least one term `x_n` with `n ≥ 1`. -/\ndef primeDivisorsOfSequence (P Q : Polynomial ℤ) : Set ℕ :=\n {p : ℕ | Nat.Prime p ∧ ∃ n : ℤ, 1 ≤ n ∧ (p : ℤ) ∣ sequenceTerm P Q n}\n\n/-- The assertion of the problem: for every pair of nonconstant integer polynomials\nwith nonnegative coefficients, infinitely many distinct primes divide some term of\nthe associated sequence. Infinitude of the set automatically expresses that the\nprimes are distinct. -/\ndef Target : Prop :=\n ∀ P Q : Polynomial ℤ,\n IsNonconstantWithNonnegativeCoefficients P →\n IsNonconstantWithNonnegativeCoefficients Q →\n (primeDivisorsOfSequence P Q).Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f64d08b-0815-5cec-bb07-3b792bc57447", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9c71634151416bbcb1bccfdc3d81d8a310260532d8a9cd034623ac8cb371f1b6", "task_path": "tasks/nmp3_4f64d08b-0815-5cec-bb07-3b792bc57447", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f64d08b-0815-5cec-bb07-3b792bc57447", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4f6842d1-f6c8-5c76-ad2a-be1c70ea71f4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a prime $p\\ge 5$, prove that there exist at least two distinct primes $q$ and $r$ with $2\\le q,r\\le p-2$ such that \n-- $$q^{\\,p-1}\\not\\equiv1\\pmod{p^{2}}\\qquad\\text{and}\\qquad r^{\\,p-1}\\not\\equiv1\\pmod{p^{2}}.$$\nmodule\n\npublic import Mathlib.Data.Nat.Prime.Basic\npublic import Mathlib.Data.Nat.ModEq\n\nnamespace Problem\n\npublic section\n\n/-- A prime `q` is in the range prescribed by the problem for a given prime `p`,\nand its `(p - 1)`-st power is not congruent to `1` modulo `p ^ 2`. -/\ndef SuitablePrime (p q : ℕ) : Prop :=\n Nat.Prime q ∧\n 2 ≤ q ∧\n q ≤ p - 2 ∧\n ¬ (q ^ (p - 1) ≡ 1 [MOD p ^ 2])\n\n/-- The conclusion of the problem for a fixed natural number `p`: there are two\ndistinct suitable primes in `[2, p - 2]`. The prime and lower-bound hypotheses\non `p` are intentionally kept outside this predicate. -/\ndef HasTwoSuitablePrimes (p : ℕ) : Prop :=\n ∃ q r : ℕ, q ≠ r ∧ SuitablePrime p q ∧ SuitablePrime p r\n\n/-- Given a prime `p ≥ 5`, there exist at least two distinct primes `q` and `r`\nwith `2 ≤ q, r ≤ p - 2` such that neither `q ^ (p - 1)` nor `r ^ (p - 1)`\nis congruent to `1` modulo `p ^ 2`. -/\ndef Target : Prop :=\n ∀ p : ℕ, Nat.Prime p → 5 ≤ p → HasTwoSuitablePrimes p\n\nend\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f6842d1-f6c8-5c76-ad2a-be1c70ea71f4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "105fa1b0c10bb765036e7d41e02709b069b52aa52bf2a724b5ebb48ffe0a8b06", "task_path": "tasks/nmp3_4f6842d1-f6c8-5c76-ad2a-be1c70ea71f4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f6842d1-f6c8-5c76-ad2a-be1c70ea71f4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4f6fa7e1-09d5-55b2-a08b-7a22d57270a2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\alpha,\\beta,\\gamma\\ge0$ satisfy $\\alpha\\beta+\\beta\\gamma+\\gamma\\alpha=1$. Determine the greatest lower bound of \n-- \\[\n-- (\\alpha^2+\\beta^2+\\gamma^2)\\Big(\\sqrt{\\alpha\\beta(1+\\gamma^2)}+\\sqrt{\\beta\\gamma(1+\\alpha^2)}+\\sqrt{\\gamma\\alpha(1+\\beta^2)}\\Big)\n-- \\]\n-- and prove that this bound equals $2$.\nimport Mathlib.Analysis.Real.Sqrt\nimport Mathlib.Order.Bounds.Defs\n\n/-!\n# Formalization of a greatest-lower-bound problem\n\nThe source problem asks for the greatest lower bound of a certain real-valued\nexpression over all nonnegative real triples `(α, β, γ)` satisfying\n`αβ + βγ + γα = 1`, and asks to prove that this greatest lower bound is `2`.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition on the triple of real variables. -/\ndef Admissible (alpha beta gamma : ℝ) : Prop :=\n 0 ≤ alpha ∧\n 0 ≤ beta ∧\n 0 ≤ gamma ∧\n alpha * beta + beta * gamma + gamma * alpha = 1\n\n/-- The real-valued expression whose greatest lower bound is requested. -/\nnoncomputable def Objective (alpha beta gamma : ℝ) : ℝ :=\n (alpha ^ 2 + beta ^ 2 + gamma ^ 2) *\n (Real.sqrt (alpha * beta * (1 + gamma ^ 2)) +\n Real.sqrt (beta * gamma * (1 + alpha ^ 2)) +\n Real.sqrt (gamma * alpha * (1 + beta ^ 2)))\n\n/-- The set of all values attained by the objective over admissible triples. -/\ndef ObjectiveValues : Set ℝ :=\n {x : ℝ | ∃ alpha beta gamma : ℝ,\n Admissible alpha beta gamma ∧ Objective alpha beta gamma = x}\n\n/-- A real number `L` is a lower bound for all values of the objective. -/\ndef IsLowerBoundForObjective (L : ℝ) : Prop :=\n ∀ alpha beta gamma : ℝ, Admissible alpha beta gamma → L ≤ Objective alpha beta gamma\n\n/-- A real number `L` is the greatest lower bound of the objective values. -/\ndef IsGreatestLowerBoundOfObjective (L : ℝ) : Prop :=\n IsGLB ObjectiveValues L\n\n/-- The target assertion: the greatest lower bound of the objective values is `2`. -/\ndef Target : Prop :=\n IsGreatestLowerBoundOfObjective 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f6fa7e1-09d5-55b2-a08b-7a22d57270a2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4ae7121b0b566db6a1cdb78718e23b71fe2318090af13db6e97daaa89929df68", "task_path": "tasks/nmp3_4f6fa7e1-09d5-55b2-a08b-7a22d57270a2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4f6fa7e1-09d5-55b2-a08b-7a22d57270a2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4fdd1fcc-a233-5a71-a8c3-ab941cebf9ee", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be nonnegative real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\sqrt[3]{3a^2+2ab+3b^2}+\\sqrt[3]{3b^2+2bc+3c^2}+\\sqrt[3]{3c^2+2ca+3a^2}\\ge 6.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\nimport Mathlib.Tactic.NormNum\n\nset_option autoImplicit false\n\n/-!\n# Formal statement: a cyclic cube-root inequality\n\nSource problem: for all nonnegative real numbers `a`, `b`, `c` with `a + b + c = 3`,\nprove\n`cbrt (3a^2 + 2ab + 3b^2) + cbrt (3b^2 + 2bc + 3c^2) + cbrt (3c^2 + 2ca + 3a^2) ≥ 6`.\n\nMathlib has no dedicated real cube-root function, so we introduce `Problem.cbrt x`\nas the real power `x ^ (1 / 3)`. Since every radicand in the problem is nonnegative,\nthis is the usual (unique) nonnegative real cube root; the supporting lemmas\n`Problem.cbrt_pow_three`, `Problem.cbrt_nonneg`, and\n`Problem.cbrt_eq_of_isNonnegCubeRoot` record precisely this interpretation.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The principal real cube root of a real number `x`, realised as the real power\n`x ^ (1 / 3 : ℝ)`. On nonnegative inputs this is the unique nonnegative `y` with\n`y ^ 3 = x` (see `Problem.cbrt_isNonnegCubeRoot` and\n`Problem.IsNonnegCubeRoot.unique`). -/\ndef cbrt (x : ℝ) : ℝ := x ^ (1 / 3 : ℝ)\n\n/-- `IsNonnegCubeRoot r y` says that `y` is a nonnegative real cube root of `r`,\ni.e. `0 ≤ y` and `y ^ 3 = r`. For `r ≥ 0` such a `y` exists and is unique. -/\ndef IsNonnegCubeRoot (r y : ℝ) : Prop := 0 ≤ y ∧ y ^ 3 = r\n\nlemma cbrt_nonneg {x : ℝ} (hx : 0 ≤ x) : 0 ≤ cbrt x := by\n unfold cbrt\n exact Real.rpow_nonneg hx _\n\nlemma cbrt_pow_three {x : ℝ} (hx : 0 ≤ x) : cbrt x ^ 3 = x := by\n unfold cbrt\n rw [← Real.rpow_mul_natCast hx (1 / 3 : ℝ) 3]\n norm_num\n\nlemma cbrt_isNonnegCubeRoot {x : ℝ} (hx : 0 ≤ x) : IsNonnegCubeRoot x (cbrt x) :=\n ⟨cbrt_nonneg hx, cbrt_pow_three hx⟩\n\n/-- Nonnegative real cube roots are unique. -/\nlemma IsNonnegCubeRoot.unique {r y z : ℝ}\n (hy : IsNonnegCubeRoot r y) (hz : IsNonnegCubeRoot r z) : y = z := by\n exact (pow_left_inj₀ hy.1 hz.1 (by norm_num : (3 : ℕ) ≠ 0)).mp (by rw [hy.2, hz.2])\n\n/-- Characterisation of `Problem.cbrt` on nonnegative inputs: it is the unique\nnonnegative cube root. -/\nlemma cbrt_eq_of_isNonnegCubeRoot {x y : ℝ} (hy : IsNonnegCubeRoot x y) :\n cbrt x = y := by\n have hx : 0 ≤ x := by\n rw [← hy.2]\n exact pow_nonneg hy.1 3\n exact IsNonnegCubeRoot.unique (cbrt_isNonnegCubeRoot hx) hy\n\n/-- The cyclic quadratic form `3x^2 + 2xy + 3y^2` appearing inside each cube root. -/\ndef radicand (x y : ℝ) : ℝ := 3 * x ^ 2 + 2 * x * y + 3 * y ^ 2\n\nlemma radicand_nonneg (x y : ℝ) : 0 ≤ radicand x y := by\n unfold radicand\n nlinarith [sq_nonneg (x - y), sq_nonneg (x + y), sq_nonneg x, sq_nonneg y]\n\nlemma radicand_cbrt_pow_three (x y : ℝ) : cbrt (radicand x y) ^ 3 = radicand x y :=\n cbrt_pow_three (radicand_nonneg x y)\n\n/-- The first radicand `3a^2 + 2ab + 3b^2`. -/\ndef radicandAB (a b : ℝ) : ℝ := radicand a b\n\n/-- The second radicand `3b^2 + 2bc + 3c^2`. -/\ndef radicandBC (b c : ℝ) : ℝ := radicand b c\n\n/-- The third radicand `3c^2 + 2ca + 3a^2`. -/\ndef radicandCA (c a : ℝ) : ℝ := radicand c a\n\nlemma radicandAB_nonneg (a b : ℝ) : 0 ≤ radicandAB a b := radicand_nonneg a b\n\nlemma radicandBC_nonneg (b c : ℝ) : 0 ≤ radicandBC b c := radicand_nonneg b c\n\nlemma radicandCA_nonneg (c a : ℝ) : 0 ≤ radicandCA c a := radicand_nonneg c a\n\n/-- The left-hand side of the asserted inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n cbrt (radicandAB a b) + cbrt (radicandBC b c) + cbrt (radicandCA c a)\n\n/-- The admissibility predicate on the variables: `a`, `b`, `c` are nonnegative real\nnumbers whose sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a + b + c = 3\n\n/-- The conclusion asserted for an admissible triple: the left-hand side is at least\n`6` (a non-strict inequality). -/\ndef Claim (a b c : ℝ) : Prop := lhs a b c ≥ 6\n\n/-- The full assertion of the problem: for all nonnegative real `a`, `b`, `c` with\n`a + b + c = 3`, the cyclic sum of cube roots is at least `6`. -/\ndef Target : Prop := ∀ a b c : ℝ, Admissible a b c → Claim a b c\n\n/-- The target written with the hypotheses as a chain of implications, exactly\nmatching the source's `nonnegative` and sum conditions; this is a definitional\nunfolding of `Problem.Admissible`, not an additional assumption. -/\nlemma Target_iff_direct :\n Target ↔\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → a + b + c = 3 →\n cbrt (radicandAB a b) + cbrt (radicandBC b c) + cbrt (radicandCA c a) ≥ 6 := by\n simp [Target, Admissible, Claim, lhs]\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4fdd1fcc-a233-5a71-a8c3-ab941cebf9ee", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cae6fca4982483e3516b2849f2c10b7eacab198031e676b5d4b50e13beba33a6", "task_path": "tasks/nmp3_4fdd1fcc-a233-5a71-a8c3-ab941cebf9ee", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4fdd1fcc-a233-5a71-a8c3-ab941cebf9ee", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_4fe06fdf-ffb8-519c-958a-beeb989a173a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^{2}-bc}{\\sqrt{8a^{2}+(b+c)^{2}}}\\;+\\;\\frac{b^{2}-ca}{\\sqrt{8b^{2}+(c+a)^{2}}}\\;+\\;\\frac{c^{2}-ab}{\\sqrt{8c^{2}+(a+b)^{2}}}\\;\\ge\\;0.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\nnamespace Problem\n\n/-- The first summand of the left-hand side. -/\nnoncomputable def termA (a b c : ℝ) : ℝ :=\n (a ^ 2 - b * c) / Real.sqrt ((8 : ℝ) * (a ^ 2) + (b + c) ^ 2)\n\n/-- The second summand of the left-hand side. -/\nnoncomputable def termB (a b c : ℝ) : ℝ :=\n (b ^ 2 - c * a) / Real.sqrt ((8 : ℝ) * (b ^ 2) + (c + a) ^ 2)\n\n/-- The third summand of the left-hand side. -/\nnoncomputable def termC (a b c : ℝ) : ℝ :=\n (c ^ 2 - a * b) / Real.sqrt ((8 : ℝ) * (c ^ 2) + (a + b) ^ 2)\n\n/-- The full left-hand side of the displayed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n termA a b c + termB a b c + termC a b c\n\n/-- The assertion of the problem: for all positive real `a`, `b`, and `c`,\nthe displayed cyclic sum is nonnegative. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → 0 ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4fe06fdf-ffb8-519c-958a-beeb989a173a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "acd11dc7e6b56b6e3c1cf07f3e90f0063da31045aa154286cfab2f979e26b04a", "task_path": "tasks/nmp3_4fe06fdf-ffb8-519c-958a-beeb989a173a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "4fe06fdf-ffb8-519c-958a-beeb989a173a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5011dd6e-2e10-5129-9e6c-a3145cded645", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $x,y,z>0$ satisfy $xy+yz+zx+xyz=4$ and $\\lambda\\ge 2$, prove the double inequality \n-- \\[\n-- \\frac{4\\lambda+1}{(\\lambda+1)^2}\\,(x+y+z)-\\frac{9\\lambda}{(\\lambda+1)^2}\\;\\le\\;\\sum_{cyc}\\frac{x^{2}}{\\lambda+x}\\;\\le\\;x+y+z-\\frac{3\\lambda}{\\lambda+1}\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The cyclic sum appearing in the problem:\n`x² / (lam + x) + y² / (lam + y) + z² / (lam + z)`. -/\ndef cyclicSum (x y z lam : ℝ) : ℝ :=\n x ^ 2 / (lam + x) + y ^ 2 / (lam + y) + z ^ 2 / (lam + z)\n\n/-- The left-hand side of the asserted double inequality. -/\ndef lowerBound (x y z lam : ℝ) : ℝ :=\n ((4 * lam + 1) / (lam + 1) ^ 2) * (x + y + z)\n - (9 * lam) / (lam + 1) ^ 2\n\n/-- The right-hand side of the asserted double inequality. -/\ndef upperBound (x y z lam : ℝ) : ℝ :=\n x + y + z - (3 * lam) / (lam + 1)\n\n/-- The assumptions under which the asserted double inequality is to be proved. -/\ndef Admissible (x y z lam : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧\n x * y + y * z + z * x + x * y * z = 4 ∧\n 2 ≤ lam\n\n/-- The asserted double inequality for fixed `x`, `y`, `z`, and `lam`. -/\ndef DoubleInequality (x y z lam : ℝ) : Prop :=\n lowerBound x y z lam ≤ cyclicSum x y z lam ∧\n cyclicSum x y z lam ≤ upperBound x y z lam\n\n/-- The complete statement: for all positive real `x`, `y`, `z` satisfying\n`xy + yz + zx + xyz = 4` and for every real `lam ≥ 2`, the specified double\ninequality holds. -/\ndef Target : Prop :=\n ∀ x y z lam : ℝ, Admissible x y z lam → DoubleInequality x y z lam\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5011dd6e-2e10-5129-9e6c-a3145cded645", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e6bc8ad12df10a96bed12cd97d39828106ac62a969927831d9e08720d4618196", "task_path": "tasks/nmp3_5011dd6e-2e10-5129-9e6c-a3145cded645", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5011dd6e-2e10-5129-9e6c-a3145cded645", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_501933d3-30a6-5da2-823e-f34f13c209a9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are positive real numbers such that $abc=1$, prove that \n-- \\[\n-- \\frac{7-6a}{2+a^{2}}+\\frac{7-6b}{2+b^{2}}+\\frac{7-6c}{2+c^{2}}\\ge 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nThe admissibility conditions on the three real parameters: each number is\npositive and their product is `1`.\n-/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/--\nThe left-hand side of the displayed inequality. All operations are those of\nthe real numbers, and `a ^ 2` means the natural-number power `a` squared.\n-/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (7 - 6 * a) / (2 + a ^ 2) +\n (7 - 6 * b) / (2 + b ^ 2) +\n (7 - 6 * c) / (2 + c ^ 2)\n\n/--\nFor every triple of positive real numbers whose product is `1`, the\nleft-hand side of the displayed inequality is at least `1`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Problem.Admissible a b c → Problem.lhs a b c ≥ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "501933d3-30a6-5da2-823e-f34f13c209a9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ab70959e0ff8491950c4cadd0256f6f4c3289075987341039869cca0004714b3", "task_path": "tasks/nmp3_501933d3-30a6-5da2-823e-f34f13c209a9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "501933d3-30a6-5da2-823e-f34f13c209a9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_50208589-112b-5c88-86ff-1d82ad228b86", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\bigl(ab+bc+ca\\bigr)\\Biggl[\\frac1{(2b+c)^2}+\\frac1{(2c+a)^2}+\\frac1{(2a+b)^2}\\Biggr]\\ge\n-- 1+6\\Biggl[\\frac{(b-c)(c-a)(a-b)}{(2b+c)(2c+a)(2a+b)}\\Biggr]^2\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the inequality, before imposing positivity of `a`, `b`, `c`. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a * b + b * c + c * a) *\n (1 / ((2 * b + c) ^ 2) +\n 1 / ((2 * c + a) ^ 2) +\n 1 / ((2 * a + b) ^ 2))\n\n/-- The right-hand side of the inequality, before imposing positivity of `a`, `b`, `c`. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 1 + 6 * ((((b - c) * (c - a) * (a - b)) /\n ((2 * b + c) * (2 * c + a) * (2 * a + b))) ^ 2)\n\n/-- For all positive real numbers `a`, `b`, and `c`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → rhs a b c ≤ lhs a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "50208589-112b-5c88-86ff-1d82ad228b86", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fba159713cc4b8d0da8023c6764baa51f638e3791af425bf4c728dddb027d60d", "task_path": "tasks/nmp3_50208589-112b-5c88-86ff-1d82ad228b86", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "50208589-112b-5c88-86ff-1d82ad228b86", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_50209655-8fd3-5c13-bfae-b1ee23e9968b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb{N}\\to\\mathbb{N}$ be a strictly increasing multiplicative function, i.e. $f(pq)=f(p)\\,f(q)$ whenever $\\gcd(p,q)=1$, with $f(1)=1$ and $f(2)=2$. Prove that $f(n)=n$ for every positive integer $n$.\nimport Mathlib.Data.Nat.GCD.Basic\n\n/-!\n# Formalization of the stated problem\n\nThe source problem asks to prove that every strictly increasing multiplicative\nfunction `f : ℕ → ℕ` with `f 1 = 1` and `f 2 = 2` is the identity on positive\nnatural numbers.\n\nThis file only states the proposition. It contains no proof of the target.\n-/\n\nnamespace Problem\n\n/-- A function on the natural numbers is strictly increasing when every strict\ninequality between arguments gives a strict inequality between values. -/\ndef StrictlyIncreasing (f : ℕ → ℕ) : Prop :=\n ∀ m n : ℕ, m < n → f m < f n\n\n/-- Multiplicativity on coprime arguments: `f (p * q) = f p * f q`\nwhenever `p` and `q` are coprime. -/\ndef CoprimeMultiplicative (f : ℕ → ℕ) : Prop :=\n ∀ p q : ℕ, Nat.gcd p q = 1 → f (p * q) = f p * f q\n\n/-- The complete hypothesis on `f` from the problem: strictly increasing,\nmultiplicative on coprime arguments, `f 1 = 1`, and `f 2 = 2`. -/\ndef Admissible (f : ℕ → ℕ) : Prop :=\n Problem.StrictlyIncreasing f ∧ Problem.CoprimeMultiplicative f ∧ f 1 = 1 ∧ f 2 = 2\n\n/-- The assertion to be proved: every admissible `f` agrees with the identity\nfunction at every positive natural number. -/\ndef Target : Prop :=\n ∀ f : ℕ → ℕ, Problem.Admissible f → ∀ n : ℕ, 0 < n → f n = n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "50209655-8fd3-5c13-bfae-b1ee23e9968b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5462c29682984a416a9b28bcbe84d98faf5f5e941cb5a1647085718e2799b576", "task_path": "tasks/nmp3_50209655-8fd3-5c13-bfae-b1ee23e9968b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "50209655-8fd3-5c13-bfae-b1ee23e9968b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_503dbc9b-9219-5ab0-89a6-85b2fe2f1017", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m,n$ be positive integers with $\\gcd(m,n)=1$. Prove that \n-- \\[\n-- \\Phi(5^m-1)\\neq 5^n-1,\n-- \\] \n-- where $\\Phi$ denotes Euler's totient function.\nimport Mathlib.Data.Nat.Totient\n\n/-!\n# Formal statement of the problem `Φ(5^m - 1) ≠ 5^n - 1`\n\nThe source problem asks, for all positive coprime natural numbers `m` and `n`,\nfor a proof that Euler's totient of `5 ^ m - 1` is not equal to `5 ^ n - 1`.\nThis file records the mathematical assertion as a proposition-valued\ndefinition; it does not supply a proof.\n-/\n\nnamespace Problem\n\n/--\nFor every pair of positive natural numbers `m` and `n` with `gcd m n = 1`,\nthe Euler totient of `5 ^ m - 1` is different from `5 ^ n - 1`.\n-/\ndef Target : Prop :=\n ∀ (m n : ℕ),\n 0 < m →\n 0 < n →\n Nat.gcd m n = 1 →\n Nat.totient (5 ^ m - 1) ≠ 5 ^ n - 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "503dbc9b-9219-5ab0-89a6-85b2fe2f1017", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "59686f31ea29c4296023408a56ee03cc2af66f71a10e51daac132a8ee262e8f3", "task_path": "tasks/nmp3_503dbc9b-9219-5ab0-89a6-85b2fe2f1017", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "503dbc9b-9219-5ab0-89a6-85b2fe2f1017", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_507926ca-919c-5dc7-a705-f83c8071dc6b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find the smallest real number $k$ such that for all non‑negative real numbers $a,b,c$,\n-- \\[\n-- (kb-c)(a-b)^2+(kc-a)(b-c)^2+(ka-b)(c-a)^2\\ge 0.\n-- \\]\n-- holds.\nimport Mathlib\n\nnamespace Problem\n\n/-- The candidate real number `k` is admissible when the displayed inequality\nholds for every ordered triple `(a, b, c)` of nonnegative real numbers. -/\ndef Admissible (k : ℝ) : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c →\n (k * b - c) * (a - b) ^ 2 +\n (k * c - a) * (b - c) ^ 2 +\n (k * a - b) * (c - a) ^ 2 ≥ 0\n\n/-- Correctness of a proposed real answer `k`: it is admissible and is no\nlarger than every admissible real number. The first conjunct requires\nattainment of the minimum, and the second requires optimality. -/\ndef AnswerCorrect (k : ℝ) : Prop :=\n Admissible k ∧ ∀ l : ℝ, Admissible l → k ≤ l\n\n/-- The problem's assertion that a least admissible real number exists. -/\ndef Target : Prop :=\n ∃ k : ℝ, AnswerCorrect k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "507926ca-919c-5dc7-a705-f83c8071dc6b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "db1d25934f9eeed293faf34e1c4e29110ec845d89f3aaa400c7460e21f063bba", "task_path": "tasks/nmp3_507926ca-919c-5dc7-a705-f83c8071dc6b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "507926ca-919c-5dc7-a705-f83c8071dc6b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5082c4b2-c7e6-5bcf-bc53-2ed4bb72656a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c>0$ prove that \n-- \\[\n-- \\frac{a}{c^4-c^3a+a^4}+\\frac{b}{a^4-a^3b+b^4}+\\frac{c}{b^4-b^3c+c^4}\\le\\frac{(a+b+c)^6}{243a^3b^3c^3}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the cyclic real inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthe displayed three-term cyclic inequality. The declarations below separate\nthe terms and the two sides of that inequality, and package the complete\nuniversally quantified implication as `Problem.Target`.\n\nNo proof of the inequality is included; `Problem.Target` is a proposition.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The first summand on the left-hand side:\n`a / (c^4 - c^3 * a + a^4)`. -/\ndef firstTerm (a b c : ℝ) : ℝ :=\n a / (c ^ 4 - c ^ 3 * a + a ^ 4)\n\n/-- The second summand on the left-hand side:\n`b / (a^4 - a^3 * b + b^4)`. -/\ndef secondTerm (a b c : ℝ) : ℝ :=\n b / (a ^ 4 - a ^ 3 * b + b ^ 4)\n\n/-- The third summand on the left-hand side:\n`c / (b^4 - b^3 * c + c^4)`. -/\ndef thirdTerm (a b c : ℝ) : ℝ :=\n c / (b ^ 4 - b ^ 3 * c + c ^ 4)\n\n/-- The complete left-hand side of the displayed inequality. -/\ndef leftSide (a b c : ℝ) : ℝ :=\n firstTerm a b c +\n secondTerm a b c +\n thirdTerm a b c\n\n/-- The right-hand side of the displayed inequality:\n`(a + b + c)^6 / (243 * a^3 * b^3 * c^3)`. -/\ndef rightSide (a b c : ℝ) : ℝ :=\n (a + b + c) ^ 6 / ((243 : ℝ) * a ^ 3 * b ^ 3 * c ^ 3)\n\n/-- The positivity hypothesis stated in the source problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The full assertion of the source problem: for every positive real triple\n`(a, b, c)`, the displayed three-term cyclic sum is at most the displayed\nright-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → leftSide a b c ≤ rightSide a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5082c4b2-c7e6-5bcf-bc53-2ed4bb72656a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "73bffb2d0f0f4827378e800c50281fd4df14be574ce90be764ed283d982a3d75", "task_path": "tasks/nmp3_5082c4b2-c7e6-5bcf-bc53-2ed4bb72656a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5082c4b2-c7e6-5bcf-bc53-2ed4bb72656a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_508e3570-9413-5b7e-a666-63f8d6de3b84", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{a}{a^{2}+2b+2c+bc}+\\frac{b}{b^{2}+2a+2c+ca}+\\frac{c}{c^{2}+2a+2b+ab}\\le\\frac12.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`\nsatisfying `abc = 1`, the displayed cyclic rational sum is at most `1 / 2`.\nThe second denominator contains `ca` and the third contains `ab`, exactly as in\nthe source. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n a / (a ^ 2 + 2 * b + 2 * c + b * c) +\n b / (b ^ 2 + 2 * a + 2 * c + c * a) +\n c / (c ^ 2 + 2 * a + 2 * b + a * b) ≤\n (1 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "508e3570-9413-5b7e-a666-63f8d6de3b84", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "217ccf99ea67ba261641955f230e94d5c84e73ab24bcf9c716378f834600def8", "task_path": "tasks/nmp3_508e3570-9413-5b7e-a666-63f8d6de3b84", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "508e3570-9413-5b7e-a666-63f8d6de3b84", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_509ca7f8-e640-53a2-af2c-dd3075b26f31", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with $ab+bc+ca\\neq0$. Prove that\n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{bc}{b^{2}+bc+c^{2}}\\ge \\frac{7}{3}-\\frac{4\\,(a^{2}+b^{2}+c^{2})}{(a+b+c)^{2}}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The cyclic sum of a three-variable real function over the cycle `(a,b,c)`. -/\ndef cyclicSum (f : ℝ → ℝ → ℝ → ℝ) (a b c : ℝ) : ℝ :=\n f a b c + f b c a + f c a b\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n cyclicSum (fun _x y z : ℝ => y * z / (y ^ 2 + y * z + z ^ 2)) a b c\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (7 : ℝ) / (3 : ℝ) -\n ((4 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2)) / (a + b + c) ^ 2\n\n/-- The hypotheses imposed on the real numbers `a`, `b`, and `c`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + b * c + c * a ≠ 0\n\n/-- The assertion to be proved. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "509ca7f8-e640-53a2-af2c-dd3075b26f31", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "20a5ea7456ae130d8e8282a6cfa82fce9eb60a6e06081b8f7b3cccac20d484f5", "task_path": "tasks/nmp3_509ca7f8-e640-53a2-af2c-dd3075b26f31", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "509ca7f8-e640-53a2-af2c-dd3075b26f31", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_50e69cf2-53a4-5868-b5bb-94fe3d38bb7f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(A\\) be a non‑empty set of positive integers. Let \\(b_{1},b_{2},\\dots ,b_{n}\\) and \\(c_{1},c_{2},\\dots ,c_{n}\\) be positive integers such that for each \\(i\\) ( \\(1\\le i\\le n\\) ) the set \n-- \\[\n-- b_{i}A+c_{i}= \\{\\,b_{i}a+c_{i}\\;:\\;a\\in A\\,\\}\n-- \\]\n-- is a subset of \\(A\\), and the \\(n\\) sets \\(b_{i}A+c_{i}\\) are pairwise disjoint. Prove that \n-- \n-- \\[\n-- \\frac1{b_{1}}+\\frac1{b_{2}}+\\cdots+\\frac1{b_{n}}\\le 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the integer dilation-cover disjointness problem\n\nThis file records the mathematical assertion from `problem.md` as a proposition.\nIt does not contain a proof of the assertion.\n-/\n\nnamespace Problem\n\n/-- `PositiveIntegerSet A` says that `A` is a nonempty set of positive integers,\nwhere positive integers are represented by natural numbers satisfying `0 < a`. -/\ndef PositiveIntegerSet (A : Set ℕ) : Prop :=\n A.Nonempty ∧ ∀ a : ℕ, a ∈ A → (0 : ℕ) < a\n\n/-- The image `b A + c = {b * a + c | a ∈ A}`. -/\ndef DilateTranslate (A : Set ℕ) (b c : ℕ) : Set ℕ :=\n (fun a : ℕ => b * a + c) '' A\n\n/-- The sum of reciprocals `1 / b_1 + ... + 1 / b_n`, interpreted in `ℝ`. -/\nnoncomputable def SumInverses (n : ℕ) (b : Fin n → ℕ) : ℝ :=\n ∑ i : Fin n, (1 : ℝ) / (b i : ℝ)\n\n/-- The asserted inequality `1 / b_1 + ... + 1 / b_n ≤ 1`. -/\ndef Conclusion (n : ℕ) (b : Fin n → ℕ) : Prop :=\n SumInverses n b ≤ 1\n\n/-- The admissibility assumptions in the problem: `A` is a nonempty set of\npositive integers, all `b_i` and `c_i` are positive, every translated dilation\n`b_i A + c_i` is contained in `A`, and these `n` translated dilations are\npairwise disjoint. -/\ndef Admissible (n : ℕ) (A : Set ℕ) (b c : Fin n → ℕ) : Prop :=\n PositiveIntegerSet A ∧\n (∀ i : Fin n, 0 < b i ∧ 0 < c i) ∧\n (∀ i : Fin n, DilateTranslate A (b i) (c i) ⊆ A) ∧\n (∀ i j : Fin n, i ≠ j →\n Disjoint (DilateTranslate A (b i) (c i))\n (DilateTranslate A (b j) (c j)))\n\n/-- The full statement to be proved: for every nonempty set `A` of positive\nintegers, every length `n`, and every pair of positive integer sequences `b` and\n`c` satisfying the containment and pairwise-disjointness hypotheses, the sum of\nthe reciprocals of the `b_i` is at most `1`. The index type `Fin n` represents\n`i = 1, ..., n`. -/\ndef Target : Prop :=\n ∀ (A : Set ℕ) (n : ℕ) (b c : Fin n → ℕ),\n Admissible n A b c → Conclusion n b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "50e69cf2-53a4-5868-b5bb-94fe3d38bb7f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "af2af4791a6e7c64c12727234582d0f251b0b8a004d4d2ab3a45197319e6eef0", "task_path": "tasks/nmp3_50e69cf2-53a4-5868-b5bb-94fe3d38bb7f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "50e69cf2-53a4-5868-b5bb-94fe3d38bb7f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_510c1d7d-161f-55a2-85c2-ea74ff61f75f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A_1,A_2,\\dots ,A_{2004}$ be points in the plane and let $P$ be another point such that no three of the $2005$ points are collinear. Let $F$ denote the number of triangles $A_iA_jA_k$ that contain $P$ in their interior. Prove that $F$ is even.\nimport Mathlib\n\n/-!\n# Formalization of the parity of triangles containing a point\n\nThe source problem concerns 2004 points `A₁, ..., A₂₀₀₄` in the plane and a\nfurther point `P`, with no three of the resulting 2005 points collinear. The\ntarget asserts that the number of (unordered) triangles with vertices among\nthe `Aᵢ` whose strict interior contains `P` is even.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the formalization. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- All the points `A i` are distinct, and `P` is distinct from every `A i`. -/\ndef PointsDistinct (A : Fin 2004 → Plane) (P : Plane) : Prop :=\n Function.Injective A ∧ ∀ i : Fin 2004, A i ≠ P\n\n/-- No three of the 2005 indexed points `A i` and `P` are collinear.\n\nConcretely, every triple of distinct indices `i, j, k` gives a noncollinear\ntriple of `A`-points, and every pair of distinct indices together with `P`\ngives a noncollinear triple. -/\ndef NoThreeCollinear (A : Fin 2004 → Plane) (P : Plane) : Prop :=\n (∀ i j k : Fin 2004,\n i ≠ j → i ≠ k → j ≠ k →\n ¬ Collinear ℝ ({A i, A j, A k} : Set Plane)) ∧\n ∀ i j : Fin 2004,\n i ≠ j → ¬ Collinear ℝ ({P, A i, A j} : Set Plane)\n\n/-- The intended general-position hypothesis on the 2005 points. -/\ndef GeneralPosition (A : Fin 2004 → Plane) (P : Plane) : Prop :=\n PointsDistinct A P ∧ NoThreeCollinear A P\n\n/-- The strict interior of the triangle whose vertices are the `A i` for\n`i ∈ s`. If `s` has cardinality three and the vertices are noncollinear,\nthis is the usual open triangular region. For other `s`, the definition is\nstill meaningful but is not used by the count below. -/\nnoncomputable def TriangleInterior\n (A : Fin 2004 → Plane) (s : Finset (Fin 2004)) : Set Plane :=\n interior (convexHull ℝ (A '' (s : Set (Fin 2004))))\n\n/-- The number `F` of unordered triangles `A i A j A k` that contain `P` in\ntheir strict interior. A triangle is represented by its three-element set of\nindices, so each unordered geometric triangle is counted exactly once. -/\nnoncomputable def F (A : Fin 2004 → Plane) (P : Plane) : ℕ := by\n classical\n exact (((Finset.univ : Finset (Fin 2004)).powerset.filter\n (fun s : Finset (Fin 2004) =>\n s.card = 3 ∧ P ∈ TriangleInterior A s)).card)\n\n/-- The assertion to be proved: under the general-position hypothesis, the\nnumber of triangles `A i A j A k` containing `P` in their interior is even. -/\ndef Target : Prop :=\n ∀ (A : Fin 2004 → Plane) (P : Plane),\n GeneralPosition A P → Even (F A P)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "510c1d7d-161f-55a2-85c2-ea74ff61f75f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "884a34e5545e2c34262bde312866e57abbcd865cdd4e4a833cd9534e4befd0d6", "task_path": "tasks/nmp3_510c1d7d-161f-55a2-85c2-ea74ff61f75f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "510c1d7d-161f-55a2-85c2-ea74ff61f75f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_51284cae-ba6d-5864-a3f6-5bdc0b80e67f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be non‑negative real numbers such that \\(ab+bc+ca>0\\). Prove that \n-- \\[\n-- \\frac{ab(a+b)}{c^{2}+ab}+\\frac{bc(b+c)}{a^{2}+bc}+\\frac{ca(c+a)}{b^{2}+ca}\\ge a+b+c\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nThe assertion in the problem: for all non-negative real numbers `a`, `b`, and `c`\nwhose pairwise products satisfy `ab + bc + ca > 0`, the stated cyclic sum is at\nleast `a + b + c`.\n\nThe division is ordinary division in `ℝ`. Under the stated hypothesis the three\ndenominators are positive, so the fractions are well-defined in the usual\nmathematical sense as well.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n 0 < a * b + b * c + c * a →\n (a * b * (a + b)) / (c ^ 2 + a * b) +\n (b * c * (b + c)) / (a ^ 2 + b * c) +\n (c * a * (c + a)) / (b ^ 2 + c * a)\n ≥ a + b + c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "51284cae-ba6d-5864-a3f6-5bdc0b80e67f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "94ec19462574efa271043d461f76d45121e3b289ac3da6f5aba1b26fe2dfa5d1", "task_path": "tasks/nmp3_51284cae-ba6d-5864-a3f6-5bdc0b80e67f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "51284cae-ba6d-5864-a3f6-5bdc0b80e67f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_512ee7dc-66f1-555c-be49-7cc762952818", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a}{8b+c}}+\\sqrt{\\frac{b}{8c+a}}+\\sqrt{\\frac{c}{8a+b}}\\ge 1\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nThe assertion from the problem: for all positive real numbers `a`, `b`, and `c`,\nthe sum of the three principal real square roots is at least `1`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n Real.sqrt (a / ((8 : ℝ) * b + c)) +\n Real.sqrt (b / ((8 : ℝ) * c + a)) +\n Real.sqrt (c / ((8 : ℝ) * a + b)) ≥ (1 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "512ee7dc-66f1-555c-be49-7cc762952818", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2e0652bfc77540ebb29e0dc64289a4d36d565713a14df3d310d22135ae823b4f", "task_path": "tasks/nmp3_512ee7dc-66f1-555c-be49-7cc762952818", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "512ee7dc-66f1-555c-be49-7cc762952818", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_512ef2c0-2495-5ea0-8116-143280a1c75e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all non‑negative real numbers $a$, $b$, $c$, with no two of them equal to $0$ (so that all denominators are defined), prove that \n-- \\[\n-- \\frac{a}{(b+c)(a^{2}+bc)}+\\frac{b}{(c+a)(b^{2}+ca)}+\\frac{c}{(a+b)(c^{2}+ab)}\\le\\frac{9}{4\\,(ab+bc+ca)}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three real variables are non-negative. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- At most one of the three variables is equal to zero. -/\ndef NoTwoZero (a b c : ℝ) : Prop :=\n ¬ (a = 0 ∧ b = 0) ∧ ¬ (b = 0 ∧ c = 0) ∧ ¬ (c = 0 ∧ a = 0)\n\n/-- Every denominator appearing in the displayed inequality is nonzero. -/\ndef DenominatorsDefined (a b c : ℝ) : Prop :=\n b + c ≠ 0 ∧\n a ^ 2 + b * c ≠ 0 ∧\n c + a ≠ 0 ∧\n b ^ 2 + c * a ≠ 0 ∧\n a + b ≠ 0 ∧\n c ^ 2 + a * b ≠ 0 ∧\n a * b + b * c + c * a ≠ 0\n\n/-- The admissibility assumptions of the problem on `a`, `b`, and `c`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ NoTwoZero a b c\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a / ((b + c) * (a ^ 2 + b * c)) +\n b / ((c + a) * (b ^ 2 + c * a)) +\n c / ((a + b) * (c ^ 2 + a * b))\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n (9 : ℝ) / (4 * (a * b + b * c + c * a))\n\n/-- The displayed inequality for a fixed admissible triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≤ RHS a b c\n\n/-- The full universally quantified assertion of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\nnamespace Problem\n\n/-- The admissibility assumptions ensure that every displayed denominator is nonzero. -/\ntheorem denominatorsDefined_of_admissible {a b c : ℝ}\n (h : Admissible a b c) : DenominatorsDefined a b c := by\n rcases h with ⟨⟨ha, hb, hc⟩, hab, hbc, hca⟩\n refine ⟨?_, ?_, ?_, ?_, ?_, ?_, ?_⟩\n · intro hsum\n have hb0 : b = 0 := by nlinarith\n have hc0 : c = 0 := by nlinarith\n exact hbc ⟨hb0, hc0⟩\n · intro hzero\n have ha2 : a ^ 2 = 0 := by\n nlinarith [sq_nonneg a, mul_nonneg hb hc]\n have hbc0 : b * c = 0 := by\n nlinarith [sq_nonneg a, mul_nonneg hb hc]\n have ha0 : a = 0 := sq_eq_zero_iff.mp ha2\n rcases mul_eq_zero.mp hbc0 with hb0 | hc0\n · exact hab ⟨ha0, hb0⟩\n · exact hca ⟨hc0, ha0⟩\n · intro hsum\n have hc0 : c = 0 := by nlinarith\n have ha0 : a = 0 := by nlinarith\n exact hca ⟨hc0, ha0⟩\n · intro hzero\n have hb2 : b ^ 2 = 0 := by\n nlinarith [sq_nonneg b, mul_nonneg hc ha]\n have hca0 : c * a = 0 := by\n nlinarith [sq_nonneg b, mul_nonneg hc ha]\n have hb0 : b = 0 := sq_eq_zero_iff.mp hb2\n rcases mul_eq_zero.mp hca0 with hc0 | ha0\n · exact hbc ⟨hb0, hc0⟩\n · exact hab ⟨ha0, hb0⟩\n · intro hsum\n have ha0 : a = 0 := by nlinarith\n have hb0 : b = 0 := by nlinarith\n exact hab ⟨ha0, hb0⟩\n · intro hzero\n have hc2 : c ^ 2 = 0 := by\n nlinarith [sq_nonneg c, mul_nonneg ha hb]\n have hab0 : a * b = 0 := by\n nlinarith [sq_nonneg c, mul_nonneg ha hb]\n have hc0 : c = 0 := sq_eq_zero_iff.mp hc2\n rcases mul_eq_zero.mp hab0 with ha0 | hb0\n · exact hca ⟨hc0, ha0⟩\n · exact hbc ⟨hb0, hc0⟩\n · intro hsum\n have hab0 : a * b = 0 := by\n nlinarith [mul_nonneg ha hb, mul_nonneg hb hc, mul_nonneg hc ha]\n have hca0 : c * a = 0 := by\n nlinarith [mul_nonneg ha hb, mul_nonneg hb hc, mul_nonneg hc ha]\n by_cases ha0 : a = 0\n · have hbc0 : b * c = 0 := by\n nlinarith [mul_nonneg hb hc]\n rcases mul_eq_zero.mp hbc0 with hb0 | hc0\n · exact hab ⟨ha0, hb0⟩\n · exact hca ⟨hc0, ha0⟩\n · have hb0 : b = 0 := by\n rcases mul_eq_zero.mp hab0 with ha0' | hb0\n · exact False.elim (ha0 ha0')\n · exact hb0\n have hc0 : c = 0 := by\n rcases mul_eq_zero.mp hca0 with hc0 | ha0'\n · exact hc0\n · exact False.elim (ha0 ha0')\n exact hbc ⟨hb0, hc0⟩\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "512ef2c0-2495-5ea0-8116-143280a1c75e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c170bf0d0978a1b45f7bd0cf991e72c2e6558769750d1daa00b1120b1db010fa", "task_path": "tasks/nmp3_512ef2c0-2495-5ea0-8116-143280a1c75e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "512ef2c0-2495-5ea0-8116-143280a1c75e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5134e349-eef4-52b2-9af2-7949e3253031", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(u_n)$ be a bounded real sequence such that \n-- $$u_{n+1}-u_n^2-u_n\\longrightarrow0\\qquad(n\\to\\infty).$$ \n-- Prove that $\\displaystyle\\lim_{n\\to\\infty}u_n=0\\,.$\nimport Mathlib\n\n/-!\n# Formalization of a bounded real sequence limit problem\n\nThe source problem asks to prove that every bounded real sequence `u` satisfying\n`u (n + 1) - (u n)^2 - u n → 0` must itself converge to `0`.\n-/\n\nnamespace Problem\n\n/-- A real sequence is bounded when all of its values lie in some interval\n`[-M, M]` with `M ≥ 0`. -/\ndef BoundedRealSequence (u : ℕ → ℝ) : Prop :=\n ∃ M : ℝ, 0 ≤ M ∧ ∀ n : ℕ, |u n| ≤ M\n\n/-- The residual sequence appearing in the hypothesis:\n`u (n + 1) - (u n)^2 - u n`. -/\ndef sequenceResidual (u : ℕ → ℝ) : ℕ → ℝ :=\n fun n : ℕ => u (n + 1) - (u n) ^ 2 - u n\n\n/-- The full assertion of the problem: if a real sequence is bounded and its\nresidual sequence tends to `0`, then the sequence itself tends to `0`. -/\ndef Target : Prop :=\n ∀ u : ℕ → ℝ,\n BoundedRealSequence u →\n Filter.Tendsto (sequenceResidual u) Filter.atTop (nhds (0 : ℝ)) →\n Filter.Tendsto u Filter.atTop (nhds (0 : ℝ))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5134e349-eef4-52b2-9af2-7949e3253031", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "87b5980ae5de9b01b91243f9485ee00e71f03c76c064c8b228206b710511115b", "task_path": "tasks/nmp3_5134e349-eef4-52b2-9af2-7949e3253031", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5134e349-eef4-52b2-9af2-7949e3253031", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_515493cb-1e1a-5c61-b5ef-8dabb1cce5e9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exists an integer $n\\ge 2002$ and $n$ distinct positive integers $a_1,a_2,\\dots,a_n$ such that the number \n-- $$N = a_1^2a_2^2\\cdots a_n^2 - 4\\bigl(a_1^2 + a_2^2 + \\cdots + a_n^2\\bigr)$$ \n-- is a perfect square.\nimport Mathlib\n\n/-!\n# Formal statement of the existence problem\n\nThe original problem asks for the existence of an integer `n ≥ 2002` and\n`n` distinct positive integers for which a specified expression is a perfect\nsquare. The declarations below formalize the statement only; they do not\nassert or prove its truth, since `Problem.Target` is a proposition-valued\ndefinition and no proof of it is supplied.\n-/\n\nnamespace Problem\n\n/-- The expression\n`a_1^2 * a_2^2 * ... * a_n^2 - 4 * (a_1^2 + a_2^2 + ... + a_n^2)`\nfor a tuple `a` indexed by `Fin n`. -/\ndef NValue {n : ℕ} (a : Fin n → ℤ) : ℤ :=\n (∏ i : Fin n, (a i) ^ 2) - 4 * (∑ i : Fin n, (a i) ^ 2)\n\n/-- An integer is a perfect square when it is the square of an integer. -/\ndef IsPerfectSquare (N : ℤ) : Prop :=\n ∃ m : ℤ, N = m ^ 2\n\n/-- A tuple of integers of length `n` consists of positive and pairwise\ndistinct integers. -/\ndef Admissible (n : ℕ) (a : Fin n → ℤ) : Prop :=\n (∀ i : Fin n, 0 < a i) ∧ Function.Injective a\n\n/-- There is an admissible tuple of length `n` for which `NValue` is a\nperfect square. -/\ndef HasGoodTuple (n : ℕ) : Prop :=\n ∃ a : Fin n → ℤ, Admissible n a ∧ IsPerfectSquare (NValue a)\n\n/-- The full assertion: there exists an integer `n ≥ 2002` and `n` distinct\npositive integers `a_1, ..., a_n` such that\n`a_1^2 * ... * a_n^2 - 4 * (a_1^2 + ... + a_n^2)` is a perfect square.\n\nHere the count `n` is represented as a natural number, as required by the\nfinite index type `Fin n`; the condition `2002 ≤ n` is the same nonnegative\ninteger lower bound. -/\ndef Target : Prop :=\n ∃ n : ℕ, 2002 ≤ n ∧ HasGoodTuple n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "515493cb-1e1a-5c61-b5ef-8dabb1cce5e9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7b213f558a5d92af3b0d238a71e65c72452fd67f109564f7ea6dc1e13c2e765d", "task_path": "tasks/nmp3_515493cb-1e1a-5c61-b5ef-8dabb1cce5e9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "515493cb-1e1a-5c61-b5ef-8dabb1cce5e9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5160fa00-4f2d-52e5-b4c6-d1fef1c873b1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a^2(a^2+bc)}{b^2+c^2}}+\\sqrt{\\frac{b^2(b^2+ca)}{c^2+a^2}}+\\sqrt{\\frac{c^2(c^2+ab)}{a^2+b^2}}\\ge a+b+c\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThis file formalizes the inequality from `problem.md`. It states the\nproposition only; it does not provide a proof.\n-/\n\nnamespace Problem\n\n/-- The first radical summand:\n`sqrt (a^2 * (a^2 + b*c) / (b^2 + c^2))`. -/\nnoncomputable def firstTerm (a b c : ℝ) : ℝ :=\n Real.sqrt (a ^ 2 * (a ^ 2 + b * c) / (b ^ 2 + c ^ 2))\n\n/-- The second radical summand, obtained by the cyclic permutation\n`a ↦ b ↦ c ↦ a`. -/\nnoncomputable def secondTerm (a b c : ℝ) : ℝ :=\n Real.sqrt (b ^ 2 * (b ^ 2 + c * a) / (c ^ 2 + a ^ 2))\n\n/-- The third radical summand, obtained by applying the cyclic permutation\n`a ↦ b ↦ c ↦ a` once more to the second summand. -/\nnoncomputable def thirdTerm (a b c : ℝ) : ℝ :=\n Real.sqrt (c ^ 2 * (c ^ 2 + a * b) / (a ^ 2 + b ^ 2))\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n firstTerm a b c + secondTerm a b c + thirdTerm a b c\n\n/-- The right-hand side of the desired inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n a + b + c\n\n/-- The positivity hypothesis in the problem: `a`, `b`, and `c` are all\nstrictly positive real numbers. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The complete assertion to be proved: for all positive real `a`, `b`, and\n`c`, the sum of the three square roots is at least `a + b + c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5160fa00-4f2d-52e5-b4c6-d1fef1c873b1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1124a3d2293f226917fa1f395fd84b15ff0ee81ef564b9f5906a866ff958e36e", "task_path": "tasks/nmp3_5160fa00-4f2d-52e5-b4c6-d1fef1c873b1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5160fa00-4f2d-52e5-b4c6-d1fef1c873b1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5163a659-6ab8-5e4c-a1d1-8f3216307915", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $ab+bc+ca=1$. Prove that \n-- \\[\n-- \\frac{a}{bc+a^{2}}+\\frac{b}{ac+b^{2}}+\\frac{c}{ab+c^{2}}\\;\\le\\;\\frac32\\,(a+b+c)\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks to prove a cyclic inequality for positive real numbers\n`a`, `b`, and `c` satisfying `ab + bc + ca = 1`.\n-/\n\nnamespace Problem\n\n/-- The target assertion of the problem: for all positive reals `a`, `b`, `c`\nsatisfying `ab + bc + ca = 1`, the displayed cyclic sum is at most\n`(3 / 2) * (a + b + c)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b + b * c + c * a = 1 →\n a / (b * c + a ^ 2) +\n b / (a * c + b ^ 2) +\n c / (a * b + c ^ 2) ≤\n (3 / 2 : ℝ) * (a + b + c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5163a659-6ab8-5e4c-a1d1-8f3216307915", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "faba736930defb6b151bc9804afde8f856fa6fe7896cd0a0084486a83f04e8c7", "task_path": "tasks/nmp3_5163a659-6ab8-5e4c-a1d1-8f3216307915", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5163a659-6ab8-5e4c-a1d1-8f3216307915", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_516bda1f-cbcf-5b45-b326-37b22310cc3c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Consider a row of 203 cells numbered from left to right. Initially the leftmost cell (cell 1) contains 203 tokens and all other cells are empty. In one move you may either \n-- \n-- 1. take a single token from a cell and move it to an adjacent cell (left or right), or \n-- 2. take exactly 20 tokens from a cell and move all of them together to an adjacent cell (left or right). \n-- \n-- After exactly 2023 moves the configuration is such that each of the 203 cells contains precisely one token. Prove that there must be at least one token that has been moved leftward at least nine times during the whole process.\nimport Mathlib\n\n/-!\n# Formalization of the 203-cell, 2023-move token problem\n\nCells are indexed by `Fin 203`, with `0` representing cell 1 and `202`\nrepresenting cell 203. The 203 individual tokens are indexed by `Fin 203`.\nA trajectory records the cell occupied by each token after each of the 2023\nmoves: `pos 0` is the initial configuration and `pos 2023` the final one.\nAt every move a `Finset` of token indices records exactly which tokens are\nmoved. The set has cardinality 1 or 20, all its elements have the same\nsource cell and the same adjacent destination cell, and every token outside\nthe set stays where it was.\n-/\n\nnamespace Problem\n\n/-- The cells of the row, numbered from left to right (`0` denotes cell 1). -/\nabbrev Cell : Type := Fin 203\n\n/-- The individual tokens. -/\nabbrev Token : Type := Fin 203\n\n/-- `LeftStep a b` says that moving from cell `a` to cell `b` is one step left. -/\ndef LeftStep (a b : Cell) : Prop :=\n b.val + 1 = a.val\n\n/-- `RightStep a b` says that moving from cell `a` to cell `b` is one step right. -/\ndef RightStep (a b : Cell) : Prop :=\n a.val + 1 = b.val\n\n/-- Two cells are adjacent when moving from `a` to `b` is one step left or one\nstep right. -/\ndef Adjacent (a b : Cell) : Prop :=\n LeftStep a b ∨ RightStep a b\n\n/-- The number of tokens in cell `c` at the configuration after `n` moves. -/\ndef occupancy (pos : Fin 2024 → Token → Cell) (n : Fin 2024) (c : Cell) : ℕ :=\n (Finset.univ.filter (fun i : Token => pos n i = c)).card\n\n/-- The initial configuration: cell 1 contains exactly 203 tokens and every\nother cell is empty. -/\ndef InitialConfiguration (pos : Fin 2024 → Token → Cell) : Prop :=\n occupancy pos 0 (0 : Cell) = 203 ∧\n (∀ c : Cell, c ≠ (0 : Cell) → occupancy pos 0 c = 0)\n\n/-- A valid `t`-th move of a trajectory.\n\nThere is a set of tokens moved on that move. It has exactly one element or\nexactly twenty elements. All moved tokens have one common source cell and one\ncommon adjacent destination cell; all other tokens are unchanged. -/\ndef IsValidMove (pos : Fin 2024 → Token → Cell)\n (moved : Fin 2023 → Finset Token) (t : Fin 2023) : Prop :=\n ((moved t).card = 1 ∨ (moved t).card = 20) ∧\n ∃ src dst : Cell,\n Adjacent src dst ∧\n (∀ i : Token,\n i ∈ moved t ↔\n pos (Fin.castSucc t) i = src ∧ pos (Fin.succ t) i = dst) ∧\n (∀ i : Token,\n i ∉ moved t → pos (Fin.succ t) i = pos (Fin.castSucc t) i)\n\n/-- The final configuration is the one after exactly 2023 moves, and every one\nof the 203 cells contains precisely one token. -/\ndef FinalConfiguration (pos : Fin 2024 → Token → Cell) : Prop :=\n ∀ c : Cell, occupancy pos (Fin.last 2023) c = 1\n\n/-- A token is moved one cell left by the move at time `t` if its position after\nthe move is one cell to the left of its position before the move. This applies\nto a token in either a one-token move or a twenty-token group move. -/\ndef LeftMoveAt (pos : Fin 2024 → Token → Cell) (t : Fin 2023)\n (i : Token) : Prop :=\n LeftStep (pos (Fin.castSucc t) i) (pos (Fin.succ t) i)\n\n/-- The number of times token `i` is moved leftward during the 2023 moves. -/\nnoncomputable def leftMoveCount (pos : Fin 2024 → Token → Cell)\n (i : Token) : ℕ := by\n classical\n exact (Finset.univ.filter (fun t : Fin 2023 => LeftMoveAt pos t i)).card\n\n/-- The assertion of the problem: for every valid process consisting of exactly\n2023 moves, starting with all 203 tokens in cell 1 and ending with exactly one\ntoken in each of the 203 cells, some token is moved leftward at least 9 times. -/\ndef Target : Prop :=\n ∀ (pos : Fin 2024 → Token → Cell) (moved : Fin 2023 → Finset Token),\n InitialConfiguration pos →\n (∀ t : Fin 2023, IsValidMove pos moved t) →\n FinalConfiguration pos →\n ∃ i : Token, 9 ≤ leftMoveCount pos i\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "516bda1f-cbcf-5b45-b326-37b22310cc3c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1152f35793d04f4dfc6313dc6cbf0718f7d7652d6998d0f5953de1f3e2645825", "task_path": "tasks/nmp3_516bda1f-cbcf-5b45-b326-37b22310cc3c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "516bda1f-cbcf-5b45-b326-37b22310cc3c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5176c952-0f6a-596a-b8a2-b937bfc19a1f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p(x)\\in\\mathbb Z[x]$ be a polynomial with integer coefficients such that $p(n)>n$ for every positive integer $n$. Define a sequence by $x_1=1$ and $x_{k+1}=p(x_k)$ for $k\\ge1$. Assume that for every positive integer $N$ there exists some term of the sequence that is divisible by $N$ (i.e. $\\exists\\,k\\ge1$ with $N\\mid x_k$). Prove that $p(x)=x+1$ for all $x$.\nimport Mathlib\n\n/-!\n# Formal statement of the polynomial iteration problem\n\nThe source problem uses a sequence indexed by positive integers. The type\n`ℕ+` is Mathlib's type of positive natural numbers, so all sequence and\nquantifier indices below have exactly the positivity constraint from the\nproblem rather than an additional hypothesis.\n\nThe sequence is defined recursively from `x_1 = 1` and\n`x_{k+1} = p(x_k)` for positive `k`.\n-/\n\nnamespace Problem\n\n/-- The sequence `x_k` associated to an integer polynomial `p`, indexed by\npositive integers and defined by `x_1 = 1` and `x_{k+1} = p(x_k)`. -/\ndef sequence (p : Polynomial ℤ) (k : ℕ+) : ℤ :=\n k.recOn (p := fun _ => ℤ) 1 (fun _ ih => Polynomial.eval ih p)\n\n/-- The defining equation `x_1 = 1`. -/\n@[simp]\ntheorem sequence_one (p : Polynomial ℤ) : sequence p 1 = 1 := by\n simp [sequence]\n\n/-- The defining recurrence `x_{k+1} = p(x_k)` for every positive integer `k`. -/\n@[simp]\ntheorem sequence_succ (p : Polynomial ℤ) (k : ℕ+) :\n sequence p (k + 1) = Polynomial.eval (sequence p k) p := by\n simp [sequence]\n\n/-- The assumption `p(n) > n` for every positive integer `n`. -/\ndef growthCondition (p : Polynomial ℤ) : Prop :=\n ∀ n : ℕ+, (n : ℤ) < Polynomial.eval (n : ℤ) p\n\n/-- The assumption that every positive integer `N` divides at least one term\n`x_k` of the sequence, with `k` positive. -/\ndef hitsEveryPositiveInteger (p : Polynomial ℤ) : Prop :=\n ∀ N : ℕ+, ∃ k : ℕ+, (N : ℤ) ∣ sequence p k\n\n/-- The conclusion that the polynomial is the identity polynomial `x + 1`. -/\ndef conclusion (p : Polynomial ℤ) : Prop :=\n p = (Polynomial.X : Polynomial ℤ) + 1\n\n/-- The complete assertion from the source problem. -/\ndef Target : Prop :=\n ∀ p : Polynomial ℤ,\n growthCondition p →\n hitsEveryPositiveInteger p →\n conclusion p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5176c952-0f6a-596a-b8a2-b937bfc19a1f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9e40c11747e040c4567b9f2e5b2dc20d4d8b876becb85b4054436f493c56c34b", "task_path": "tasks/nmp3_5176c952-0f6a-596a-b8a2-b937bfc19a1f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5176c952-0f6a-596a-b8a2-b937bfc19a1f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5178012b-4164-5be8-8043-e103173adab2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^{2}+2bc}{(b+c)^{2}}+\\frac{b^{2}+2ca}{(c+a)^{2}}+\\frac{c^{2}+2ab}{(a+b)^{2}}\\ge \\frac94\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the positive-real inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, `c`,\nthat\n`(a^2 + 2bc)/(b+c)^2 + (b^2 + 2ca)/(c+a)^2 + (c^2 + 2ab)/(a+b)^2 ≥ 9/4`.\n\nThe target is represented as a proposition-valued definition. No proof is\nsupplied at this statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + 2 * b * c) / (b + c) ^ 2\n + (b ^ 2 + 2 * c * a) / (c + a) ^ 2\n + (c ^ 2 + 2 * a * b) / (a + b) ^ 2\n\n/-- The assertion to be proved: for all positive reals `a`, `b`, and `c`,\nthe displayed cyclic sum is at least `9/4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n lhs a b c ≥ (9 : ℝ) / 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5178012b-4164-5be8-8043-e103173adab2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0e6f8c1223c5f5475c1f5e3c246a0d007dc65135abad8faf45e13e96ccc675d0", "task_path": "tasks/nmp3_5178012b-4164-5be8-8043-e103173adab2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5178012b-4164-5be8-8043-e103173adab2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_51947b64-1beb-5b00-a932-dc12be008425", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A convex quadrilateral $ABCD$ satisfies $AD=CD$ and $\\angle DAB=\\angle ABC$. Let $M$ be the midpoint of side $BC$, and let $E$ be the intersection of line $AB$ with the line through $D$ and $M$. Prove that $\\displaystyle \\angle BEC=\\angle DAC\\,$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\n/-!\n# Formalization of the convex-quadrilateral angle problem\n\nThe problem is stated in the Euclidean plane. We use coordinates in\n`EuclideanSpace ℝ (Fin 2)` so that convexity in a prescribed cyclic order can be\nexpressed by the signs of the four consecutive turns of the polygon.\n-/\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane used to interpret the geometry problem. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The scalar two-dimensional cross product of two displacement vectors. -/\ndef cross2 (u v : Plane) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- The signed turn from the directed segment `AB` to the directed segment `AC`.\nIts sign is the orientation of the ordered triple `(A, B, C)`. -/\ndef turn (A B C : Plane) : ℝ := cross2 (B - A) (C - A)\n\n/--\n`A`, `B`, `C`, `D` are the consecutive vertices of a nondegenerate convex\nquadrilateral in the displayed order. Convexity is expressed by requiring all\nfour consecutive turns to be nonzero and to have the same sign (all positive\nfor counterclockwise orientation, or all negative for clockwise orientation).\n-/\ndef IsConvexQuadrilateral (A B C D : Plane) : Prop :=\n (0 < turn A B C ∧ 0 < turn B C D ∧ 0 < turn C D A ∧ 0 < turn D A B) ∨\n (turn A B C < 0 ∧ turn B C D < 0 ∧ turn C D A < 0 ∧ turn D A B < 0)\n\n/-- The affine line through two points of the Euclidean plane. -/\ndef lineThrough (A B : Plane) : AffineSubspace ℝ Plane :=\n affineSpan ℝ ({A, B} : Set Plane)\n\n/--\n`E` is the unique common point of the two affine lines `l₁` and `l₂`.\nThis records the meaning of \"the intersection\" in the source statement.\n-/\ndef IsIntersectionOfLines (E : Plane)\n (l₁ l₂ : AffineSubspace ℝ Plane) : Prop :=\n E ∈ l₁ ∧ E ∈ l₂ ∧ ∀ E' : Plane, E' ∈ l₁ → E' ∈ l₂ → E' = E\n\n/--\nThe assertion of the problem: for every convex quadrilateral `ABCD` satisfying\n`AD = CD` and `∠DAB = ∠ABC`, if `M` is the midpoint of `BC` and `E` is the\nintersection of line `AB` with line `DM`, then `∠BEC = ∠DAC`.\n-/\ndef Target : Prop :=\n ∀ A B C D : Plane,\n IsConvexQuadrilateral A B C D →\n dist A D = dist C D →\n EuclideanGeometry.angle D A B = EuclideanGeometry.angle A B C →\n ∀ M : Plane,\n M = midpoint ℝ B C →\n ∀ E : Plane,\n IsIntersectionOfLines E (lineThrough A B) (lineThrough D M) →\n EuclideanGeometry.angle B E C = EuclideanGeometry.angle D A C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "51947b64-1beb-5b00-a932-dc12be008425", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f7f6f6ac92386ab7e18d6064e9f2134bd4d79e63bb054c646c4e40913c0f80b9", "task_path": "tasks/nmp3_51947b64-1beb-5b00-a932-dc12be008425", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "51947b64-1beb-5b00-a932-dc12be008425", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_51a2c318-93ef-5fb9-98f4-cb264aea1463", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 2$ and $A,B\\in M_n(\\mathbb{C})$ satisfy $A^2+B^2=2AB$ with $A\\neq B$. Prove that $A$ has at least one eigenvalue of algebraic multiplicity greater than 1 (i.e., $A$ possesses a multiple eigenvalue).\nimport Mathlib.Basic.Complex.Basic\nimport Mathlib.LinearAlgebra.Matrix.Charpoly.Basic\nimport Mathlib.Algebra.Polynomial.RingDivision\n\n/-!\n# Formalization of the matrix multiple-eigenvalue problem\n\nThe source problem asks: for every `n ≥ 2` and complex `n × n` matrices\n`A` and `B` satisfying `A^2 + B^2 = 2AB` and `A ≠ B`, the matrix `A` has\nan eigenvalue whose algebraic multiplicity is greater than one.\n\nThis file states the assertion as a proposition. No proof of the assertion\nis included.\n-/\n\nnamespace Problem\n\n/-- An eigenvalue of a complex matrix, expressed using the usual eigenvector\nequation `A x = a • x` with `x` nonzero. -/\ndef IsEigenvalue {n : ℕ} (A : Matrix (Fin n) (Fin n) ℂ) (a : ℂ) : Prop :=\n ∃ x : Fin n → ℂ, x ≠ 0 ∧ A.mulVec x = a • x\n\n/-- The algebraic multiplicity of a complex number as a possible eigenvalue\nof `A`, defined as its multiplicity as a root of the characteristic polynomial\nof `A`. -/\nnoncomputable def AlgebraicMultiplicity {n : ℕ}\n (A : Matrix (Fin n) (Fin n) ℂ) (a : ℂ) : ℕ :=\n Polynomial.rootMultiplicity a (Matrix.charpoly A)\n\n/-- `A` has a multiple eigenvalue: there is an eigenvalue of `A` whose\nalgebraic multiplicity is strictly greater than one. -/\ndef HasMultipleEigenvalue {n : ℕ} (A : Matrix (Fin n) (Fin n) ℂ) : Prop :=\n ∃ a : ℂ, Problem.IsEigenvalue A a ∧ 1 < Problem.AlgebraicMultiplicity A a\n\n/-- The matrix equation `A^2 + B^2 = 2AB`, with `2AB` interpreted as the\ncomplex scalar `2` times the matrix product `AB`. -/\ndef MatrixEquation {n : ℕ} (A B : Matrix (Fin n) (Fin n) ℂ) : Prop :=\n A ^ 2 + B ^ 2 = (2 : ℂ) • (A * B)\n\n/-- The complete assertion: for every natural number `n ≥ 2` and all complex\n`n × n` matrices `A` and `B`, `A^2 + B^2 = 2AB` together with `A ≠ B`\nimplies that `A` has an eigenvalue of algebraic multiplicity greater than one. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 2 ≤ n →\n ∀ A B : Matrix (Fin n) (Fin n) ℂ,\n Problem.MatrixEquation A B → A ≠ B → Problem.HasMultipleEigenvalue A\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "51a2c318-93ef-5fb9-98f4-cb264aea1463", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "988316d47ada8fe5eea531de62132c0c2122d1de366317a9634226f362a229f0", "task_path": "tasks/nmp3_51a2c318-93ef-5fb9-98f4-cb264aea1463", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "51a2c318-93ef-5fb9-98f4-cb264aea1463", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_51cdd905-b588-59a3-8bea-a0e6fc97a2ab", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c>0$, prove that \n-- \\[\n-- \\frac{2\\sqrt{3}\\,(a^{2}+b^{2}+c^{2})}{ab+bc+ca}\n-- +\\frac{a+2b}{\\sqrt{a^{2}+2b^{2}}}\n-- +\\frac{b+2c}{\\sqrt{b^{2}+2c^{2}}}\n-- +\\frac{c+2a}{\\sqrt{c^{2}+2a^{2}}}\n-- \\ge 5\\sqrt{3}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable cyclic inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\nthe cyclic inequality recorded in `Problem.Target`. This file only states the\nproblem; it does not provide a proof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The first (symmetric rational) summand. -/\ndef firstTerm (a b c : ℝ) : ℝ :=\n (2 * Real.sqrt 3 * (a ^ 2 + b ^ 2 + c ^ 2)) /\n (a * b + b * c + c * a)\n\n/-- The second cyclic summand. -/\ndef secondTerm (a b c : ℝ) : ℝ :=\n (a + 2 * b) / Real.sqrt (a ^ 2 + 2 * b ^ 2)\n\n/-- The third cyclic summand. -/\ndef thirdTerm (a b c : ℝ) : ℝ :=\n (b + 2 * c) / Real.sqrt (b ^ 2 + 2 * c ^ 2)\n\n/-- The fourth cyclic summand. -/\ndef fourthTerm (a b c : ℝ) : ℝ :=\n (c + 2 * a) / Real.sqrt (c ^ 2 + 2 * a ^ 2)\n\n/-- The complete left-hand side of the claimed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n firstTerm a b c + secondTerm a b c + thirdTerm a b c + fourthTerm a b c\n\n/-- The right-hand side of the claimed inequality. -/\ndef rhs : ℝ :=\n 5 * Real.sqrt 3\n\n/-- The positivity assumptions on the three variables. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The assertion to be proved: for all positive reals `a`, `b`, and `c`,\nthe cyclic left-hand side is at least `5 * sqrt 3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → rhs ≤ lhs a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "51cdd905-b588-59a3-8bea-a0e6fc97a2ab", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b2f5b0f8a133736acdb58f9732cc07392d87d84be1602a5891c4db52434c38b0", "task_path": "tasks/nmp3_51cdd905-b588-59a3-8bea-a0e6fc97a2ab", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "51cdd905-b588-59a3-8bea-a0e6fc97a2ab", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_51e36118-f38f-5c44-bc23-104a50b72215", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- a, b, c ≥ 0 and ab + bc + ca = 3. Prove that \n-- \\[a\\bigl(a+b^{3}\\bigr)+b\\bigl(b+c^{3}\\bigr)+c\\bigl(c+a^{3}\\bigr)+2abc\\,(a+b+c)\\ge 12.\\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the inequality statement\n\nThe problem asks to prove a non-strict inequality for nonnegative real numbers\n`a`, `b`, and `c` satisfying `ab + bc + ca = 3`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the asserted inequality. -/\ndef leftSide (a b c : ℝ) : ℝ :=\n a * (a + b ^ 3) + b * (b + c ^ 3) + c * (c + a ^ 3)\n + 2 * a * b * c * (a + b + c)\n\n/-- The hypotheses `a, b, c ≥ 0` and `ab + bc + ca = 3` from the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + b * c + c * a = 3\n\n/-- The asserted inequality, for fixed nonnegative reals satisfying the constraint. -/\ndef Inequality (a b c : ℝ) : Prop :=\n leftSide a b c ≥ 12\n\n/-- The complete quantified statement to be proved. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "51e36118-f38f-5c44-bc23-104a50b72215", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7c3b13ea542b79b47b3c850d60ed648fb30336e9e087d8460af0b10c83f203a6", "task_path": "tasks/nmp3_51e36118-f38f-5c44-bc23-104a50b72215", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "51e36118-f38f-5c44-bc23-104a50b72215", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_51eb08c3-2484-5113-ac09-f4d6594e0701", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In an acute triangle $ABC$, prove that \n-- \\[\n-- \\frac{\\cos B\\,\\cos C}{1+\\cos A}+ \\frac{\\cos C\\,\\cos A}{1+\\cos B}+ \\frac{\\cos A\\,\\cos B}{1+\\cos C}\\le\\frac12.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic\n\nset_option autoImplicit false\n\nnoncomputable section\n\nnamespace Problem\n\n/--\nThe three real numbers `A`, `B`, and `C` are angle measures (in radians) of an\nacute triangle: each is strictly positive, their sum is `π`, and each is strictly\nless than `π / 2`. This predicate supplies the standard angle description of an\nacute triangle; only its angles are needed because the target inequality involves\nonly the cosines of the three angles.\n-/\ndef IsAcuteTriangleAngles (A B C : ℝ) : Prop :=\n 0 < A ∧ 0 < B ∧ 0 < C ∧\n A + B + C = Real.pi ∧\n A < Real.pi / 2 ∧ B < Real.pi / 2 ∧ C < Real.pi / 2\n\n/-- The left-hand side of the inequality in the problem statement. -/\ndef InequalityLHS (A B C : ℝ) : ℝ :=\n Real.cos B * Real.cos C / (1 + Real.cos A) +\n Real.cos C * Real.cos A / (1 + Real.cos B) +\n Real.cos A * Real.cos B / (1 + Real.cos C)\n\n/--\nThe assertion to be proved: for every acute triangle with angle measures\n`A`, `B`, and `C`, the stated cyclic sum of products of cosines is at most\n`1 / 2`.\n-/\ndef Target : Prop :=\n ∀ A B C : ℝ, IsAcuteTriangleAngles A B C → InequalityLHS A B C ≤ (1 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "51eb08c3-2484-5113-ac09-f4d6594e0701", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2dc7fc7c933485b82fa2c8f13b489319c61f0d5eaa913ec2187a09ee4287293f", "task_path": "tasks/nmp3_51eb08c3-2484-5113-ac09-f4d6594e0701", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "51eb08c3-2484-5113-ac09-f4d6594e0701", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_521d9403-cc83-599f-9d9c-78d2a37fea4a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(a_n)_{n\\ge1}$ be a sequence of non‑negative integers such that for every pair of positive integers $m,n$,\n-- \\[\n-- \\sum_{i=1}^{2m} a_{i n}\\le m.\n-- \\]\n-- Prove that there exist positive integers $k$ and $d$ for which\n-- \\[\n-- \\sum_{i=1}^{2k} a_{i d}=k-2014.\n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The positive integers, used for the indices of the sequence and for `m`, `n`, `k`, `d`. -/\nabbrev Index : Type := ℕ+\n\n/-- A sequence indexed by the positive integers and taking non-negative integer values. -/\nabbrev Sequence : Type := Index → ℕ\n\n/-- The admissibility hypothesis: for every pair of positive integers `m, n`, the sum of\n`a (i * n)` for `1 ≤ i ≤ 2 * m` is at most `m`. -/\ndef Admissible (a : Sequence) : Prop :=\n ∀ m n : Index,\n (∑ i ∈ Finset.Icc (1 : Index) (2 * m), a (i * n)) ≤ (m : ℕ)\n\n/-- The desired conclusion for fixed positive integers `k` and `d`, with the equation\ninterpreted in the integers so that `k - 2014` is honest subtraction (not truncated\nnatural-number subtraction). -/\ndef DesiredSum (a : Sequence) (k d : Index) : Prop :=\n ((∑ i ∈ Finset.Icc (1 : Index) (2 * k), a (i * d)) : ℤ) =\n (k : ℤ) - 2014\n\n/-- The full assertion of the problem: every admissible sequence has positive integers\n`k` and `d` for which the stated sum is `k - 2014`. -/\ndef Target : Prop :=\n ∀ a : Sequence, Admissible a → ∃ k d : Index, DesiredSum a k d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "521d9403-cc83-599f-9d9c-78d2a37fea4a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4636bd2133f57d4757d1c1580f7ad2127718ce13127a6abe8c5941791821a270", "task_path": "tasks/nmp3_521d9403-cc83-599f-9d9c-78d2a37fea4a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "521d9403-cc83-599f-9d9c-78d2a37fea4a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5247eaeb-7b5f-58e4-ac28-9c08547fe24f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $x,y,z$, prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{x^3}{\\sqrt{y^2-yz+z^2}}\\ge x^2+y^2+z^2.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Cyclic square-root inequality\n\nThis file formalizes the statement of the problem. The target is exposed as a\n`Prop`; no proof of it is asserted in this formalization.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The quadratic radicand appearing in a cyclic term, with the two variables\nin the order indicated by `y² - y*z + z²`. -/\ndef cyclicRadicand (a b : ℝ) : ℝ :=\n a ^ 2 - a * b + b ^ 2\n\n/-- One summand of the cyclic sum, namely\n`x³ / sqrt (y² - y*z + z²)`. -/\ndef cyclicTerm (x y z : ℝ) : ℝ :=\n x ^ 3 / Real.sqrt (cyclicRadicand y z)\n\n/-- The cyclic sum\n`x³/sqrt(y²-yz+z²) + y³/sqrt(z²-zx+x²) + z³/sqrt(x²-xy+y²)`. -/\ndef cyclicSum (x y z : ℝ) : ℝ :=\n cyclicTerm x y z + cyclicTerm y z x + cyclicTerm z x y\n\n/-- The assertion to be proved: for all positive real numbers `x`, `y`, and\n`z`, the cyclic sum is at least `x² + y² + z²`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z →\n cyclicSum x y z ≥ x ^ 2 + y ^ 2 + z ^ 2\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5247eaeb-7b5f-58e4-ac28-9c08547fe24f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6944974adae7d4946041e9b355092077af105abff15a2e2a6c01b25f01f78dd9", "task_path": "tasks/nmp3_5247eaeb-7b5f-58e4-ac28-9c08547fe24f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5247eaeb-7b5f-58e4-ac28-9c08547fe24f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5289a7ed-94ec-5322-a5a4-4f66432cbf65", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be a finite group. Let $H_1,\\;H_2,\\;H_3$ be proper subgroups (i.e. $H_i\\neq G$) whose union equals $G$ (so $G=H_1\\cup H_2\\cup H_3$). Prove that for every $x\\in G$, $x^{2}\\in H_1\\cap H_2\\cap H_3$.\nimport Mathlib\n\n/-!\n# Formal statement: finite groups covered by three proper subgroups\n\nThis file records the statement of the source problem. It does not contain a\nproof of the statement.\n-/\n\nuniverse u\n\nnamespace Problem\n\n/-- A subgroup `H` of `G` is proper, in the sense used in the problem: H ≠ G. -/\ndef IsProperSubgroup {G : Type u} [Group G] (H : Subgroup G) : Prop :=\n H ≠ ⊤\n\n/-- The three subgroups `H₁`, `H₂`, `H₃` cover `G`. -/\ndef IsThreeSubgroupCover {G : Type u} [Group G]\n (H₁ H₂ H₃ : Subgroup G) : Prop :=\n (H₁ : Set G) ∪ (H₂ : Set G) ∪ (H₃ : Set G) = Set.univ\n\n/-- The assertion from the source problem.\n\nFor every finite group `G` and every three proper subgroups `H₁`, `H₂`, `H₃`\nwhose union is all of `G`, every square `x ^ 2` lies in the intersection\n`H₁ ∩ H₂ ∩ H₃`.\n-/\ndef Target : Prop :=\n ∀ (G : Type u) [Group G] [Fintype G]\n (H₁ H₂ H₃ : Subgroup G),\n IsProperSubgroup H₁ →\n IsProperSubgroup H₂ →\n IsProperSubgroup H₃ →\n IsThreeSubgroupCover H₁ H₂ H₃ →\n ∀ x : G, x ^ 2 ∈ H₁ ⊓ H₂ ⊓ H₃\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5289a7ed-94ec-5322-a5a4-4f66432cbf65", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "46678f06947941a7caba5ac2a0cb7d81160231c0bef39ef414089178ece67da9", "task_path": "tasks/nmp3_5289a7ed-94ec-5322-a5a4-4f66432cbf65", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5289a7ed-94ec-5322-a5a4-4f66432cbf65", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_528b7ef5-c8cc-5bc5-ab18-73f77b27af87", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If a function $f:\\mathbb R\\to\\mathbb R$ satisfies \n-- $$f'(x)\\le f'\\!\\Bigl(x+\\frac1n\\Bigr)$$ \n-- for every real $x$ and every natural number $n\\in\\mathbb N$, prove that $f$ is continuously differentiable; i.e., $f'$ is continuous on $\\mathbb R$.\nimport Mathlib.Analysis.Calculus.Deriv.Basic\n\n/-!\n# Statement: derivative shift inequality implies continuous differentiability\n\nThis file formalizes the assertion in `problem.md`. It does not prove the\nassertion; `Problem.Target` is a proposition-valued definition.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The one-sided condition appearing in the problem:\nfor every real `x` and every positive natural number `n`, the derivative at\n`x` is at most the derivative at `x + 1 / n`.\n\nThe original expression `1 / n` only makes sense for nonzero `n`; accordingly\nthe natural-number quantifier is restricted to positive `n`.\n-/\ndef DerivativeShiftCondition (f : ℝ → ℝ) : Prop :=\n ∀ (x : ℝ) (n : ℕ), 0 < n →\n deriv f x ≤ deriv f (x + (n : ℝ)⁻¹)\n\n/-- A real-valued function is continuously differentiable when it is\ndifferentiable everywhere and its derivative is continuous on `ℝ`.\n\nThe problem's gloss says that \"continuously differentiable\" means precisely\nthat `f'` is continuous on `ℝ`; differentiability is made explicit because\nthe notation `f'` in the hypothesis already presupposes the existence of the\nderivative at every point. -/\ndef ContinuouslyDifferentiable (f : ℝ → ℝ) : Prop :=\n Differentiable ℝ f ∧ Continuous (deriv f)\n\n/-- The full assertion of the problem.\n\nFor every function `f : ℝ → ℝ` that is differentiable on `ℝ` and satisfies\n`f'(x) ≤ f'(x + 1/n)` for every real `x` and every positive natural number\n`n`, the derivative `f'` is continuous on `ℝ` (equivalently here, `f` is\ncontinuously differentiable).\n-/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ,\n Differentiable ℝ f →\n DerivativeShiftCondition f →\n ContinuouslyDifferentiable f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "528b7ef5-c8cc-5bc5-ab18-73f77b27af87", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "205f8155d1c3d2d2db9d47da0e93d1387cb90164a6f44538fe867fbb1fb33399", "task_path": "tasks/nmp3_528b7ef5-c8cc-5bc5-ab18-73f77b27af87", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "528b7ef5-c8cc-5bc5-ab18-73f77b27af87", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_528e97c4-d56e-5fa6-9846-a08b5aa68413", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ satisfy $a^{2}+b^{2}+c^{2}+d^{2}=1$. Prove that \n-- \\[\n-- \\sqrt{\\,1-ab\\,}+\\sqrt{\\,1-bc\\,}+\\sqrt{\\,1-cd\\,}+\\sqrt{\\,1-da\\,}\\ge 2\\sqrt3\\,.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The admissibility conditions for the four positive real numbers in the problem:\neach is positive, and their squared sum is one. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧\n a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = 1\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c d : ℝ) : ℝ :=\n Real.sqrt (1 - a * b) + Real.sqrt (1 - b * c) +\n Real.sqrt (1 - c * d) + Real.sqrt (1 - d * a)\n\n/-- The right-hand side of the asserted inequality. -/\ndef rhs : ℝ :=\n (2 : ℝ) * Real.sqrt (3 : ℝ)\n\n/-- The full proposition stated in the problem: for every quadruple of positive\nreal numbers whose squared sum is one, the specified sum of square roots is at\nleast `2 * sqrt 3`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n Admissible a b c d →\n lhs a b c d ≥ rhs\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "528e97c4-d56e-5fa6-9846-a08b5aa68413", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "98460c1a2adfdcad5b6e8f8cb6a017909a38a9eb587ab342e1172300b2e9719b", "task_path": "tasks/nmp3_528e97c4-d56e-5fa6-9846-a08b5aa68413", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "528e97c4-d56e-5fa6-9846-a08b5aa68413", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_52a59e7a-37d7-5d0e-80c8-609454667085", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all non‑negative real numbers \\(a,b,c\\),\n-- \\[\n-- \\sum_{\\text{cyc}} a^{2}b^{4}+\\sum_{\\text{cyc}} a^{3}bc^{2}\\ge 2\\sum_{\\text{cyc}} a^{3}b^{2}c,\n-- \\]\n-- i.e.\n-- \\[\n-- a^{2}b^{4}+b^{2}c^{4}+c^{2}a^{4}+a^{3}bc^{2}+b^{3}ca^{2}+c^{3}ab^{2}\n-- \\;\\ge\\;\n-- 2\\bigl(a^{3}b^{2}c+b^{3}c^{2}a+c^{3}a^{2}b\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic non-negative real inequality\n\nThe problem asks to prove, for all non-negative real numbers `a`, `b`, and `c`,\nthe cyclic inequality displayed in `problem.md`. This file records only the\nmathematical proposition; it does not include a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality:\n`a^2*b^4 + b^2*c^4 + c^2*a^4 + a^3*b*c^2 + b^3*c*a^2 + c^3*a*b^2`. -/\ndef inequalityLeftSide (a b c : ℝ) : ℝ :=\n a ^ 2 * b ^ 4 + b ^ 2 * c ^ 4 + c ^ 2 * a ^ 4 +\n a ^ 3 * b * c ^ 2 + b ^ 3 * c * a ^ 2 + c ^ 3 * a * b ^ 2\n\n/-- The cyclic sum on the right-hand side of the target inequality (without\nits factor of `2`):\n`a^3*b^2*c + b^3*c^2*a + c^3*a^2*b`. -/\ndef inequalityCyclicSum (a b c : ℝ) : ℝ :=\n a ^ 3 * b ^ 2 * c + b ^ 3 * c ^ 2 * a + c ^ 3 * a ^ 2 * b\n\n/-- The complete proposition requested by the problem: for every triple of\nnon-negative real numbers `a`, `b`, and `c`, the displayed cyclic inequality\nholds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 ≤ a → 0 ≤ b → 0 ≤ c →\n inequalityLeftSide a b c ≥ 2 * inequalityCyclicSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "52a59e7a-37d7-5d0e-80c8-609454667085", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "34907d7c7de1716ff12b2b609c07ae6a8a55f3c129ac5d246b9484cb94aeb55e", "task_path": "tasks/nmp3_52a59e7a-37d7-5d0e-80c8-609454667085", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "52a59e7a-37d7-5d0e-80c8-609454667085", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_52a5f73d-7cbb-5e09-93ff-3484180ff3d7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\ge 0\\) satisfy \\(a+b+c=3\\). Prove that \n-- \\[\n-- \\frac{1}{2+a^{5}b^{5}}+\\frac{1}{2+b^{5}c^{5}}+\\frac{1}{2+c^{5}a^{5}}\\ge 1.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/--\nFor all nonnegative real numbers `a`, `b`, and `c` whose sum is `3`, the sum\n`1 / (2 + a^5 b^5) + 1 / (2 + b^5 c^5) + 1 / (2 + c^5 a^5)` is at least `1`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a + b + c = 3 →\n 1 / (2 + a ^ 5 * b ^ 5) +\n 1 / (2 + b ^ 5 * c ^ 5) +\n 1 / (2 + c ^ 5 * a ^ 5) ≥ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "52a5f73d-7cbb-5e09-93ff-3484180ff3d7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d817743072896bf7f1387eb884bb51fbc2f1779019ed34405d7e886a8b5ba446", "task_path": "tasks/nmp3_52a5f73d-7cbb-5e09-93ff-3484180ff3d7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "52a5f73d-7cbb-5e09-93ff-3484180ff3d7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_52f708c7-d82b-5c66-91a4-d93ebc62a12d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b$ be positive real numbers such that $a+b=a^4+b^4$. Prove that \n-- \\[\n-- a^a b^b \\le 1 \\le a^{a^3}b^{b^3}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the problem statement\n\nThe source problem asks: for positive real numbers `a` and `b` satisfying\n`a + b = a ^ 4 + b ^ 4`, prove the two-sided inequality\n`a ^ a * b ^ b ≤ 1 ≤ a ^ (a ^ 3) * b ^ (b ^ 3)`.\n\nThe real-valued power `x ^ y` for real `x` and `y` is Mathlib's\n`Real.rpow x y` (which is also available through the `^` notation once the\ninstance in `Mathlib.Analysis.SpecialFunctions.Pow.Real` is in scope). This\nfile only states the proposition; it supplies no proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility assumptions on the two real numbers: both are strictly\npositive and they satisfy `a + b = a ^ 4 + b ^ 4`.\n\nThe powers `a ^ 4` and `b ^ 4` use the natural-number exponent `4`. -/\ndef Admissible (a b : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ a + b = a ^ (4 : ℕ) + b ^ (4 : ℕ)\n\n/-- The left-hand inequality from the problem. -/\ndef LowerBound (a b : ℝ) : Prop :=\n Real.rpow a a * Real.rpow b b ≤ 1\n\n/-- The right-hand inequality from the problem. Here the exponents are the\nreal numbers `a ^ 3` and `b ^ 3`, with the inner powers using exponent `3`. -/\ndef UpperBound (a b : ℝ) : Prop :=\n 1 ≤ Real.rpow a (a ^ (3 : ℕ)) * Real.rpow b (b ^ (3 : ℕ))\n\n/-- The complete assertion of the source problem, universally quantified over\npositive real numbers satisfying the given equation. Both inequalities are\nrequired, and they share the same admissibility assumptions. -/\ndef Target : Prop :=\n ∀ a b : ℝ, Admissible a b → LowerBound a b ∧ UpperBound a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "52f708c7-d82b-5c66-91a4-d93ebc62a12d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c16e164a21e20c0d5c2c1264d524a7a7615aa4d0469884c8dec17bb748f259e6", "task_path": "tasks/nmp3_52f708c7-d82b-5c66-91a4-d93ebc62a12d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "52f708c7-d82b-5c66-91a4-d93ebc62a12d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_52f7ead4-853a-50aa-8a44-50766fc50e40", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let the citizens of a city be represented by the vertices of a simple undirected graph $G$, where an edge between two vertices means the two citizens are friends. The city has $2\\,000\\,000$ citizens. Assume that every set of $2000$ vertices of $G$ contains three vertices that are pairwise adjacent (i.e., a triangle). Prove that $G$ contains four vertices that are pairwise adjacent (i.e., a $K_4$).\nimport Mathlib.Combinatorics.SimpleGraph.Clique\nimport Mathlib.Data.Set.Card\n\n/-!\n# Formal statement of the graph-theoretic problem\n\nThe city's citizens are the vertices of a finite simple graph. The problem\nasserts that if the graph has exactly 2,000,000 vertices and every\n2,000-element vertex set contains a triangle, then the graph contains a\nfour-vertex clique.\n-/\n\nnamespace Problem\n\nuniverse u\n\nvariable {V : Type u}\n\n/-- A vertex set contains a triangle when it contains a three-element set\nwhose vertices are pairwise adjacent. -/\ndef HasTriangleInside (G : SimpleGraph V) (s : Set V) : Prop :=\n ∃ t : Set V, t ⊆ s ∧ t.ncard = 3 ∧ G.IsClique t\n\n/-- Every 2,000-element set of vertices contains a triangle. -/\ndef Every2000SetHasTriangle (G : SimpleGraph V) : Prop :=\n ∀ s : Set V, s.ncard = 2000 → HasTriangleInside G s\n\n/-- The graph contains a four-vertex clique (a `K₄`). -/\ndef HasK4 (G : SimpleGraph V) : Prop :=\n ∃ t : Set V, t.ncard = 4 ∧ G.IsClique t\n\n/-- The formalized target: every finite simple graph with exactly 2,000,000\nvertices in which every 2,000-vertex subset contains a triangle also contains\na four-vertex clique. -/\ndef Target : Prop :=\n ∀ (V : Type u) (G : SimpleGraph V),\n Nat.card V = 2000000 →\n Every2000SetHasTriangle G →\n HasK4 G\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "52f7ead4-853a-50aa-8a44-50766fc50e40", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7c8fe76ffb9ba42d01100c2c3e26d3651f7b441dee06a6ca9947f17fc3e7a20e", "task_path": "tasks/nmp3_52f7ead4-853a-50aa-8a44-50766fc50e40", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "52f7ead4-853a-50aa-8a44-50766fc50e40", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_53849ce9-9f90-50f9-bac6-51d230edcd68", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\ge 0\\) be real numbers such that at most one of them is zero (i.e. no two of \\(a,b,c\\) are simultaneously zero). Prove that \n-- \\[\n-- \\sqrt{\\frac{a^{2}+bc}{\\,b^{2}+c^{2}\\,}}+\\sqrt{\\frac{b^{2}+ca}{\\,c^{2}+a^{2}\\,}}+\\sqrt{\\frac{c^{2}+ab}{\\,a^{2}+b^{2}\\,}}\\ge 2+\\frac{1}{\\sqrt2}\\;.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- No two of the three real numbers `a`, `b`, and `c` are simultaneously zero.\nEquivalently, at most one of them is zero. -/\ndef AtMostOneZero (a b c : ℝ) : Prop :=\n ¬ (a = 0 ∧ b = 0) ∧\n ¬ (a = 0 ∧ c = 0) ∧\n ¬ (b = 0 ∧ c = 0)\n\n/-- The admissibility hypotheses of the problem: `a`, `b`, and `c` are\nnonnegative real numbers, and at most one of them is zero. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ AtMostOneZero a b c\n\n/-- The left-hand side of the desired inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n Real.sqrt ((a ^ 2 + b * c) / (b ^ 2 + c ^ 2)) +\n Real.sqrt ((b ^ 2 + c * a) / (c ^ 2 + a ^ 2)) +\n Real.sqrt ((c ^ 2 + a * b) / (a ^ 2 + b ^ 2))\n\n/-- The assertion to be proved: for all admissible nonnegative real triples\n`(a, b, c)`, the sum of the three square roots is at least\n`2 + 1 / sqrt 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n lhs a b c ≥ (2 : ℝ) + (1 : ℝ) / Real.sqrt (2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "53849ce9-9f90-50f9-bac6-51d230edcd68", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cd178f664ea24e4df32dc5bf85c31dc6f8e358d886b80e618405219c1c5b08b6", "task_path": "tasks/nmp3_53849ce9-9f90-50f9-bac6-51d230edcd68", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "53849ce9-9f90-50f9-bac6-51d230edcd68", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_53de94fd-0a63-52ec-89a2-7e47dadeb02c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) with \\(a+b+c=2\\). Prove that \n-- \n-- \\[\n-- \\frac{2a^{3}+abc+2}{b^{2}+c^{2}}+\\frac{2b^{3}+abc+2}{c^{2}+a^{2}}+\\frac{2c^{3}+abc+2}{a^{2}+b^{2}}\\ge 8.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic inequality problem\n\nThe original problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose sum is `2`, that a certain cyclic sum of rational expressions is at least\n`8`. The assertion is packaged as a proposition rather than proved here.\n-/\n\nnamespace Problem\n\n/-- The cyclic left-hand side appearing in the inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (2 * a ^ 3 + a * b * c + 2) / (b ^ 2 + c ^ 2) +\n (2 * b ^ 3 + a * b * c + 2) / (c ^ 2 + a ^ 2) +\n (2 * c ^ 3 + a * b * c + 2) / (a ^ 2 + b ^ 2)\n\n/-- The admissibility conditions on the real variables in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 2\n\n/-- The universal statement of the problem: for all positive reals `a`, `b`, `c`\nwith `a + b + c = 2`, the cyclic left-hand side is at least `8`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → (8 : ℝ) ≤ LHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "53de94fd-0a63-52ec-89a2-7e47dadeb02c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b293cec2295bc2ecdd6da2dbda84ec7f914161013746fb5cbe675c9ef75d0b78", "task_path": "tasks/nmp3_53de94fd-0a63-52ec-89a2-7e47dadeb02c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "53de94fd-0a63-52ec-89a2-7e47dadeb02c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_54056e1e-a73f-5f45-b060-2be55972bbd1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^{2}}{b}+\\frac{b^{2}}{c}+\\frac{c^{2}}{a}+a+b+c\\ge \\frac{6\\,(a^{2}+b^{2}+c^{2})}{a+b+c}\\,.\n-- \\]\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n@[expose] public section\n\nnamespace Problem\n\n/--\nThe assertion from the problem: for all positive real numbers `a`, `b`, and `c`,\nthe given left-hand side is at least the given right-hand side.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n (a ^ 2) / b + (b ^ 2) / c + (c ^ 2) / a + a + b + c ≥\n (6 * (a ^ 2 + b ^ 2 + c ^ 2)) / (a + b + c)\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54056e1e-a73f-5f45-b060-2be55972bbd1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9c60c9f0d8359cdf3f8a02a68ed47f7afbac8b2c0edebe6a63451bb8e2be9f34", "task_path": "tasks/nmp3_54056e1e-a73f-5f45-b060-2be55972bbd1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54056e1e-a73f-5f45-b060-2be55972bbd1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_541c4081-e8ef-56d2-b400-d12abb84af38", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, $c\\ge0$ satisfy $ab+ac+bc\\le3$. Prove that \n-- \\[\n-- \\frac{1}{1+a+b}+\\frac{1}{1+a+c}+\\frac{1}{1+b+c}\\le\\frac{9}{\\,3+2\\sqrt{3(ab+ac+bc)}\\,}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The inequality asserted in the problem, for all nonnegative real numbers\n`a`, `b`, and `c` whose pairwise-product sum is at most `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a * b + a * c + b * c ≤ 3 →\n (1 : ℝ) / (1 + a + b) +\n (1 : ℝ) / (1 + a + c) +\n (1 : ℝ) / (1 + b + c) ≤\n (9 : ℝ) /\n (3 + 2 * Real.sqrt (3 * (a * b + a * c + b * c)))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "541c4081-e8ef-56d2-b400-d12abb84af38", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b9a0b3e25fc578b9c3ce44fe64738747d27d4e5e2c8abcdaeb99db658566668f", "task_path": "tasks/nmp3_541c4081-e8ef-56d2-b400-d12abb84af38", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "541c4081-e8ef-56d2-b400-d12abb84af38", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5431b554-ebd4-5074-838b-cf6c2a17b527", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be a finite non‑abelian group. Prove that there exist elements $x,g\\in G$ such that $x^g\\neq x$ and $[x,x^g]=1$ (i.e. $x$ commutes with its conjugate $x^g$, where $x^g=g^{-1}xg$).\n/-\nFormal statement for the problem:\n\nLet `G` be a finite non-abelian group. Prove that there exist elements\n`x, g ∈ G` such that `x^g ≠ x` and `[x, x^g] = 1`, where `x^g = g⁻¹ * x * g`.\n\nThis file only states the target proposition; it does not prove it.\n-/\n\nmodule\n\npublic import Mathlib.Data.Fintype.Basic\npublic import Mathlib.GroupTheory.Commutator.Basic\n\npublic section\n\nopen scoped commutatorElement\n\nnamespace Problem\n\nuniverse u\n\n/-- The conjugate of `x` by `g`, in the convention fixed by the problem:\n`x^g = g⁻¹ * x * g`. -/\ndef conjugateBy {G : Type u} [Group G] (x g : G) : G :=\n g⁻¹ * x * g\n\n/-- The assertion `[x, y] = 1`, using Mathlib's group commutator\n`⁅x, y⁆ = x * y * x⁻¹ * y⁻¹`. -/\ndef commutatorEqOne {G : Type u} [Group G] (x y : G) : Prop :=\n ⁅x, y⁆ = 1\n\n/-- The conclusion of the problem for a fixed group: there are elements `x` and `g`\nsuch that `x^g` is not equal to `x`, and `x` commutes with `x^g`. -/\ndef HasRequiredWitnesses (G : Type u) [Group G] : Prop :=\n ∃ x g : G, conjugateBy x g ≠ x ∧ commutatorEqOne x (conjugateBy x g)\n\n/-- The full target proposition: for every group `G`, if `G` is finite and non-abelian,\nthen `G` has elements `x` and `g` with `x^g ≠ x` and `[x, x^g] = 1`. -/\ndef Target : Prop :=\n ∀ (G : Type u) [Group G] [Finite G],\n (¬ IsMulCommutative G) → HasRequiredWitnesses G\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5431b554-ebd4-5074-838b-cf6c2a17b527", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "70ba7ba20f4f69abb0719f6397e7101a07674850eeea16210d8bcb1f3834a68b", "task_path": "tasks/nmp3_5431b554-ebd4-5074-838b-cf6c2a17b527", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5431b554-ebd4-5074-838b-cf6c2a17b527", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_54460aef-153e-5ba4-a39a-6eb4d5a29d45", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there exists a positive integer n such that the first 2018 decimal digits of n! are all 9.\nimport Mathlib.Data.Nat.Digits.Lemmas\n\n/-!\n# Formal statement for the leading-digit factorial problem\n\nThe source problem asks for the existence of a positive integer `n` whose\nfactorial begins with 2018 consecutive decimal digits equal to `9`.\n\nWe use `Nat.digits 10 x`, Mathlib's little-endian list of decimal digits of a\nnonzero natural number `x`. Reversing that list puts the digits in the usual\nleft-to-right order, and `List.take 2018` selects the leading 2018 digits.\nThe explicit length condition records that those leading digits exist.\n-/\n\nnamespace Problem\n\n/-- The canonical decimal digits of `n`, written most significant first. -/\ndef decimalDigitsMostSignificantFirst (n : ℕ) : List ℕ :=\n (Nat.digits 10 n).reverse\n\n/-- The first `k` decimal digits of `n`, written from most significant to least\nsignificant. For `n = 0` this is the empty list. -/\ndef firstDecimalDigits (k n : ℕ) : List ℕ :=\n (decimalDigitsMostSignificantFirst n).take k\n\n/-- `n` has at least `k` decimal digits in its canonical decimal expansion. -/\ndef hasAtLeastDecimalDigits (k n : ℕ) : Prop :=\n k ≤ (Nat.digits 10 n).length\n\n/-- The first `k` decimal digits of `n` all equal `9`, and there are at least\n`k` such digits. -/\ndef firstDecimalDigitsAllNine (k n : ℕ) : Prop :=\n hasAtLeastDecimalDigits k n ∧\n firstDecimalDigits k n = List.replicate k 9\n\n/-- There exists a positive integer `n` such that the first 2018 decimal digits\nof `n!` are all `9`. -/\ndef Target : Prop :=\n ∃ n : ℕ, 0 < n ∧ firstDecimalDigitsAllNine 2018 n.factorial\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54460aef-153e-5ba4-a39a-6eb4d5a29d45", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e8fa3160e4225d937c9194640e0d3a9e85e689bdab5d4b386888c92666092014", "task_path": "tasks/nmp3_54460aef-153e-5ba4-a39a-6eb4d5a29d45", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54460aef-153e-5ba4-a39a-6eb4d5a29d45", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_547bff0e-92e8-5c6b-acc8-92e84a730f42", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Define the Fibonacci sequence $\\{F_n\\}_{n\\ge 0}$ by $F_0=0$, $F_1=1$, and $F_n=F_{n-1}+F_{n-2}$ for $n\\ge2$. Define the Stirling numbers of the second kind $S(n,k)$ as the number of ways to partition a set of $n\\ge1$ distinguishable elements into $k\\ge1$ indistinguishable non‑empty subsets. For each positive integer $n$ let \n-- \\[\n-- t_n=\\sum_{k=1}^{n} S(n,k)\\,F_k.\n-- \\]\n-- Let $p\\ge7$ be a prime. Prove that \n-- \\[\n-- t_{\\,n+p^{\\,2p}-1}\\equiv t_n \\pmod p\\qquad\\text{for all }n\\ge1.\n-- \\]\nimport Mathlib.Combinatorics.Enumerative.Stirling\nimport Mathlib.Data.Nat.Fib.Basic\nimport Mathlib.Data.Nat.ModEq\nimport Mathlib.Data.Nat.Prime.Basic\nimport Mathlib.Order.Interval.Finset.Nat\n\n/-!\n# Formal statement of the Fibonacci--Stirling congruence problem\n\nThe source problem defines the Fibonacci numbers by the usual initial values and\nrecurrence, defines the Stirling numbers of the second kind combinatorially, and\nasks to prove a congruence for `t n` for every prime `p ≥ 7` and every `n ≥ 1`.\nThis file only states that assertion; it contains no proof of it.\n-/\n\nnamespace Problem\n\n/-- The Fibonacci sequence `F n`, defined by `F 0 = 0`, `F 1 = 1`, and\n`F (n + 2) = F n + F (n + 1)`. This is Mathlib's standard Fibonacci sequence. -/\ndef Fibonacci (n : ℕ) : ℕ :=\n Nat.fib n\n\n/-- The Stirling number of the second kind `S(n, k)`, the number of partitions of\na set with `n` distinguishable elements into `k` nonempty indistinguishable subsets.\nThis is Mathlib's standard Stirling number of the second kind. -/\ndef StirlingSecond (n k : ℕ) : ℕ :=\n Nat.stirlingSecond n k\n\n/-- The integer sequence `t n = ∑_{k=1}^n S(n,k) F_k`. -/\ndef t (n : ℕ) : ℕ :=\n ∑ k ∈ Finset.Icc 1 n, StirlingSecond n k * Fibonacci k\n\n/-- The index `n + p^(2p) - 1` occurring in the claimed congruence, with the\nexponent read as `2 * p`. -/\ndef congruenceIndex (p n : ℕ) : ℕ :=\n n + p ^ (2 * p) - 1\n\n/-- The proposition to be proved: for every prime `p ≥ 7` and every natural number\n`n ≥ 1`, one has `t (n + p^(2p) - 1) ≡ t n (mod p)`. -/\ndef Target : Prop :=\n ∀ (p : ℕ), Nat.Prime p → 7 ≤ p → ∀ (n : ℕ), 1 ≤ n →\n Nat.ModEq p (t (congruenceIndex p n)) (t n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "547bff0e-92e8-5c6b-acc8-92e84a730f42", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "73c01c1d77a67b5f7d7bada9330e669587e863d528fc259fdae64e6cba400a4c", "task_path": "tasks/nmp3_547bff0e-92e8-5c6b-acc8-92e84a730f42", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "547bff0e-92e8-5c6b-acc8-92e84a730f42", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_548ac3d8-44a2-52e3-a8ad-284809f92412", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a convex quadrilateral such that $AB + CD = \\sqrt{2}\\,AC$ and $BC + DA = \\sqrt{2}\\,BD$. Prove that $ABCD$ is a parallelogram.\n/-\nFormal statement of the following problem:\n\nLet `ABCD` be a convex quadrilateral such that\n`AB + CD = sqrt(2) * AC` and `BC + DA = sqrt(2) * BD`.\nProve that `ABCD` is a parallelogram.\n-/\n\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\n/-!\n# Statement of the quadrilateral problem\n\nWe model the Euclidean plane as `EuclideanSpace ℝ (Fin 2)`. A point of this\nspace is simultaneously a vector, so the midpoint condition `A + C = B + D`\nexpresses that the diagonals of the ordered quadrilateral `ABCD` bisect each\nother, which is the usual algebraic characterization of a parallelogram.\n\n\"Convex quadrilateral `ABCD`\" is interpreted as the standard strict\nnondegenerate notion, with the vertices in the order indicated by the name:\nthe four consecutive turns have the same nonzero sign (all positive for one\norientation, all negative for the other). This allows either orientation of\nthe plane.\n-/\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, with its usual Euclidean metric. -/\nabbrev EuclideanPlane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The oriented area (two-dimensional cross product) of vectors `u` and `v`,\nexpressed in the standard coordinates of `EuclideanPlane`. -/\ndef cross (u v : EuclideanPlane) : ℝ :=\n u 0 * v 1 - u 1 * v 0\n\n/-- The ordered quadruple `A, B, C, D` is a convex quadrilateral in that cyclic\norder. For an ordered quadrilateral this is equivalent to requiring the four\nconsecutive turns to have the same nonzero orientation. In particular the\ncondition excludes collinear adjacent triples and self-intersection. Both\ncounterclockwise and clockwise cyclic orderings are allowed, so the definition\ndoes not impose a choice of orientation on the plane. -/\ndef IsConvexQuadrilateral (A B C D : EuclideanPlane) : Prop :=\n (0 < cross (B - A) (C - B) ∧\n 0 < cross (C - B) (D - C) ∧\n 0 < cross (D - C) (A - D) ∧\n 0 < cross (A - D) (B - A)) ∨\n (cross (B - A) (C - B) < 0 ∧\n cross (C - B) (D - C) < 0 ∧\n cross (D - C) (A - D) < 0 ∧\n cross (A - D) (B - A) < 0)\n\n/-- The ordered quadrilateral `ABCD` is a parallelogram, encoded by the\nequality of the midpoints of its diagonals: `A + C = B + D`. -/\ndef IsParallelogram (A B C D : EuclideanPlane) : Prop :=\n A + C = B + D\n\n/-- The first metric hypothesis: `AB + CD = sqrt(2) * AC`. -/\ndef FirstLengthCondition (A B C D : EuclideanPlane) : Prop :=\n dist A B + dist C D = Real.sqrt 2 * dist A C\n\n/-- The second metric hypothesis: `BC + DA = sqrt(2) * BD`. -/\ndef SecondLengthCondition (A B C D : EuclideanPlane) : Prop :=\n dist B C + dist D A = Real.sqrt 2 * dist B D\n\n/-- The full assertion of the problem. For every ordered quadruple of points\nof the Euclidean plane, if it is a convex quadrilateral satisfying the two\ngiven side-length identities, then it is a parallelogram. -/\ndef Target : Prop :=\n ∀ A B C D : EuclideanPlane,\n IsConvexQuadrilateral A B C D →\n FirstLengthCondition A B C D →\n SecondLengthCondition A B C D →\n IsParallelogram A B C D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "548ac3d8-44a2-52e3-a8ad-284809f92412", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "166eb01084dc584ec9e447d39165da5ebc97e6763f45a3fd9fcbed108c112302", "task_path": "tasks/nmp3_548ac3d8-44a2-52e3-a8ad-284809f92412", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "548ac3d8-44a2-52e3-a8ad-284809f92412", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5494089a-cbf0-5512-a5aa-1fcdc30770f8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers such that $ab+bc+ca=1$. Prove that \n-- \\[\n-- \\sum_{cyc}\\frac{(a^2+1)^2}{\\,b^2+c^2\\,}\\ge 8\\,,\n-- \\] \n-- where the sum is taken cyclically over $(a,b,c)$.\nimport Mathlib\n\n/-!\n# Formalization of a cyclic inequality\n\nThe original problem asks to prove, for all positive real numbers `a`, `b`, and\n`c` satisfying `ab + bc + ca = 1`, a lower bound for a cyclic sum of rational\nexpressions.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissibility conditions imposed on the real numbers in the problem:\nall three are positive and `ab + bc + ca = 1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = 1\n\n/-- The cyclic sum appearing on the left-hand side of the inequality. The term\nwith numerator `(a^2 + 1)^2` has denominator `b^2 + c^2`, and the other two\nterms are obtained by the cyclic permutation `a ↦ b ↦ c ↦ a`. -/\ndef CyclicSum (a b c : ℝ) : ℝ :=\n (a ^ 2 + 1) ^ 2 / (b ^ 2 + c ^ 2) +\n (b ^ 2 + 1) ^ 2 / (c ^ 2 + a ^ 2) +\n (c ^ 2 + 1) ^ 2 / (a ^ 2 + b ^ 2)\n\n/-- The assertion to be proved: for every positive real triple satisfying\n`ab + bc + ca = 1`, the displayed cyclic sum is at least `8`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → 8 ≤ CyclicSum a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5494089a-cbf0-5512-a5aa-1fcdc30770f8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d40f40262e8976b1d59d4e08cf026d2354ebf7bbea4b94218779da98ab457de1", "task_path": "tasks/nmp3_5494089a-cbf0-5512-a5aa-1fcdc30770f8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5494089a-cbf0-5512-a5aa-1fcdc30770f8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_54b1ea7a-f8ba-5c0a-8aa1-f285f1f3fae1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there are infinitely many positive integers \\(n\\) such that \\(n^{2}+1\\) has a prime divisor \\(p\\) satisfying \\(p>2n+\\sqrt{2n}\\).\nmodule\n\npublic import Mathlib.Analysis.Real.Sqrt\npublic import Mathlib.Data.Nat.Prime.Defs\npublic import Mathlib.Data.Set.Finite.Basic\n\n/-!\n# Infinitely many positive `n` with a large prime divisor of `n ^ 2 + 1`\n\nThis file formalizes the statement of the problem (but does not prove it).\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- `n` has a prime divisor `p` of `n ^ 2 + 1` whose real value is larger than\n`2 * n + Real.sqrt (2 * n)`. -/\ndef HasLargePrimeDivisor (n : ℕ) : Prop :=\n ∃ p : ℕ,\n p.Prime ∧ p ∣ n ^ 2 + 1 ∧\n (p : ℝ) > 2 * (n : ℝ) + Real.sqrt (2 * (n : ℝ))\n\n/-- There are infinitely many positive integers `n` for which `n ^ 2 + 1` has a\nprime divisor `p` satisfying `p > 2 * n + sqrt (2 * n)`. -/\ndef Target : Prop :=\n Set.Infinite {n : ℕ | 0 < n ∧ HasLargePrimeDivisor n}\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54b1ea7a-f8ba-5c0a-8aa1-f285f1f3fae1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "057c5459e8033a8581947b89733e206ed854f4385a8561ac3aac1a40efaea112", "task_path": "tasks/nmp3_54b1ea7a-f8ba-5c0a-8aa1-f285f1f3fae1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54b1ea7a-f8ba-5c0a-8aa1-f285f1f3fae1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_54cc84af-b6c4-5b1d-a12c-58b5611d0c19", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be positive real numbers. Prove that \n-- \\[\n-- \\frac{1}{b+c}+\\frac{1}{c+a}+\\frac{1}{a+b}\\ge \n-- \\frac{2a}{3a^{2}+bc}+\\frac{2b}{3b^{2}+ca}+\\frac{2c}{3c^{2}+ab},\n-- \\] \n-- or equivalently \\(\\displaystyle\\sum_{\\text{cyc}}\\frac1{b+c}\\ge\\sum_{\\text{cyc}}\\frac{2a}{3a^{2}+bc}\\).\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic inequality problem\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and\n`c`, the inequality\n\n`1 / (b + c) + 1 / (c + a) + 1 / (a + b) ≥\n 2a / (3a^2 + bc) + 2b / (3b^2 + ca) + 2c / (3c^2 + ab)`.\n\nThis file records that assertion as a proposition-valued definition. No proof\nof the proposition is supplied.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the stated inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n 1 / (b + c) + 1 / (c + a) + 1 / (a + b)\n\n/-- The right-hand side of the stated inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 2 * a / (3 * a ^ 2 + b * c) +\n 2 * b / (3 * b ^ 2 + c * a) +\n 2 * c / (3 * c ^ 2 + a * b)\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the cyclic sum of the\nreciprocals is at least the cyclic sum of `2a / (3a^2 + bc)` and its cyclic\npermutations.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → LHS a b c ≥ RHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54cc84af-b6c4-5b1d-a12c-58b5611d0c19", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c0c565899956d5a517df41d219efa9e4468652b5b43f987bf896689b29a6dd77", "task_path": "tasks/nmp3_54cc84af-b6c4-5b1d-a12c-58b5611d0c19", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54cc84af-b6c4-5b1d-a12c-58b5611d0c19", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_54d86715-5ff2-52a9-ae4c-aa4764532a51", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a$, $b$, $c$ are positive real numbers such that $a+b+c=1$, prove that \n-- \\[\n-- \\frac{1+a}{1-a}+\\frac{1+b}{1-b}+\\frac{1+c}{1-c}\\le 2\\left(\\frac{b}{a}+\\frac{c}{b}+\\frac{a}{c}\\right).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable real inequality\n\nThe source problem asks to prove an inequality for positive real numbers\n`a`, `b`, and `c` whose sum is `1`.\n-/\n\nnamespace Problem\n\n/-- A real number is positive in the sense required by the source problem. -/\ndef PositiveReal (x : ℝ) : Prop :=\n 0 < x\n\n/-- The normalization condition `a + b + c = 1` for the three real variables. -/\ndef HasUnitSum (a b c : ℝ) : Prop :=\n a + b + c = (1 : ℝ)\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n ((1 : ℝ) + a) / ((1 : ℝ) - a) +\n ((1 : ℝ) + b) / ((1 : ℝ) - b) +\n ((1 : ℝ) + c) / ((1 : ℝ) - c)\n\n/-- The parenthesized sum on the right-hand side of the source problem. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n b / a + c / b + a / c\n\n/-- The assertion requested by the problem: for all positive real numbers `a`, `b`,\nand `c` with `a + b + c = 1`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n PositiveReal a →\n PositiveReal b →\n PositiveReal c →\n HasUnitSum a b c →\n leftHandSide a b c ≤ (2 : ℝ) * rightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54d86715-5ff2-52a9-ae4c-aa4764532a51", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "265382a9bb7c07fcffa8677a9b9be935a5b4944c10b3f7cce4ae2352e9b22b07", "task_path": "tasks/nmp3_54d86715-5ff2-52a9-ae4c-aa4764532a51", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54d86715-5ff2-52a9-ae4c-aa4764532a51", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_54e3ee0a-822c-54af-abe6-5fc3ce062548", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,\\;b,\\;c\\) be non‑negative real numbers such that \\(a+b+c\\neq0\\). Prove that \n-- \\[\n-- \\sqrt{a^{2}-ab+b^{2}}+\\sqrt{a^{2}-ac+c^{2}}+\\sqrt{b^{2}-bc+c^{2}}\n-- \\le\\frac{10\\,(a^{2}+b^{2}+c^{2})-ab-ac-bc}{3\\,(a+b+c)}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion in the problem: for all nonnegative real numbers `a`, `b`, `c`\nwith `a + b + c ≠ 0`, the displayed inequality holds, where square roots are\nthe nonnegative real square roots and division is real division. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a + b + c ≠ 0 →\n Real.sqrt (a ^ 2 - a * b + b ^ 2) +\n Real.sqrt (a ^ 2 - a * c + c ^ 2) +\n Real.sqrt (b ^ 2 - b * c + c ^ 2) ≤\n (10 * (a ^ 2 + b ^ 2 + c ^ 2) - a * b - a * c - b * c) /\n (3 * (a + b + c))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54e3ee0a-822c-54af-abe6-5fc3ce062548", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f88cc5354860561e131107550a65da5ee9e5916148840c066038ff8e9fca36fe", "task_path": "tasks/nmp3_54e3ee0a-822c-54af-abe6-5fc3ce062548", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54e3ee0a-822c-54af-abe6-5fc3ce062548", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_54f1309f-22a8-5321-9f93-bbcec8aa91aa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For a positive integer $n$, let $a_1,a_2,\\dots,a_k$ be all positive integers not exceeding $n$ that are relatively prime to $n$, with no repetitions. If $k>8$, prove that \n-- \\[\n-- \\sum_{i=1}^k\\Bigl|a_i-\\frac{n}{2}\\Bigr|<\\frac{n(k-4)}{2}\\,. \n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The finite set of positive integers at most `n` that are relatively prime to `n`. -/\ndef reducedResidues (n : ℕ) : Finset ℕ :=\n (Finset.Icc 1 n).filter (fun a : ℕ => Nat.Coprime a n)\n\n/-- The number of positive integers at most `n` and coprime to `n`. -/\ndef reducedResidueCount (n : ℕ) : ℕ :=\n (reducedResidues n).card\n\n/-- The sequence `a : Fin k → ℕ` lists every reduced residue of `n` exactly once,\nand its length `k` is the number of reduced residues. -/\ndef IsReducedResidueEnumeration (n k : ℕ) (a : Fin k → ℕ) : Prop :=\n k = reducedResidueCount n ∧\n Function.Injective a ∧\n (∀ i : Fin k, a i ∈ reducedResidues n) ∧\n (∀ m : ℕ, m ∈ reducedResidues n → ∃ i : Fin k, a i = m)\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def residueDistanceSum (n k : ℕ) (a : Fin k → ℕ) : ℝ :=\n ∑ i : Fin k, |(a i : ℝ) - (n : ℝ) / 2|\n\n/-- The target assertion: for every positive integer `n`, every repetition-free\nenumeration `a_1, …, a_k` of the positive integers at most `n` and coprime to `n`,\nif `k > 8`, then the stated strict inequality holds. -/\ndef Target : Prop :=\n ∀ (n k : ℕ) (a : Fin k → ℕ),\n 0 < n →\n IsReducedResidueEnumeration n k a →\n 8 < k →\n residueDistanceSum n k a < (n : ℝ) * ((k : ℝ) - 4) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54f1309f-22a8-5321-9f93-bbcec8aa91aa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e2ba1c8683ecf8904b8f1ab01f99478cb09aa5a43b908c768e253d9231253187", "task_path": "tasks/nmp3_54f1309f-22a8-5321-9f93-bbcec8aa91aa", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "54f1309f-22a8-5321-9f93-bbcec8aa91aa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_552cd061-0dbd-5bb3-9bdc-c90227ba4d66", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- \\[\n-- \\frac{x^{2}}{x^{2}+yz}+\\frac{y^{2}}{y^{2}+zx}+\\frac{z^{2}}{z^{2}+xy}\\le \\frac{3\\,(x^{2}+y^{2}+z^{2})}{2\\,(xy+yz+zx)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks to prove, for positive real numbers `x`, `y`, and `z`,\n\n`x^2 / (x^2 + y*z) + y^2 / (y^2 + z*x) + z^2 / (z^2 + x*y)\n ≤ 3 * (x^2 + y^2 + z^2) / (2 * (x*y + y*z + z*x))`.\n\nThis file only records the proposition; it does not assert or prove it.\n-/\n\nnamespace Problem\n\n/-- The assertion of the source problem, universally quantified over positive reals. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n x ^ 2 / (x ^ 2 + y * z) +\n y ^ 2 / (y ^ 2 + z * x) +\n z ^ 2 / (z ^ 2 + x * y) ≤\n 3 * (x ^ 2 + y ^ 2 + z ^ 2) / (2 * (x * y + y * z + z * x))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "552cd061-0dbd-5bb3-9bdc-c90227ba4d66", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2e5a51ab887b0bbe7e0fe15b8582ebcea0214627a7217cd6ea43d81934bca629", "task_path": "tasks/nmp3_552cd061-0dbd-5bb3-9bdc-c90227ba4d66", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "552cd061-0dbd-5bb3-9bdc-c90227ba4d66", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_555802ab-6774-5b2f-9e14-563008a9778a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c,d$, prove that \n-- \\[\n-- (a+b)(b+c)(c+d)(d+a)\\,\\bigl(1+\\sqrt[4]{abcd}\\bigr)^{4}\\;\\ge\\;16\\,abcd\\,(1+a)(1+b)(1+c)(1+d).\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formalization of the positive-real four-variable inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, `c`, `d`, that\n`(a + b) * (b + c) * (c + d) * (d + a) * (1 + abcd^(1/4))^4`\nis at least\n`16 * a * b * c * d * (1 + a) * (1 + b) * (1 + c) * (1 + d)`.\n\nBecause the radicand `a * b * c * d` is positive under the hypotheses, the real\nprincipal fourth root is represented by `Real.rpow (a * b * c * d) (1 / 4)`.\n-/\n\nnamespace Problem\n\n/-- The real power `x ^ (1/4 : ℝ)`. On nonnegative `x`, and in particular on the\npositive radicand used in `Target`, this is the principal real fourth root. -/\nnoncomputable def FourthRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 4 : ℝ)\n\n/-- The assertion from the problem: for all positive real `a`, `b`, `c`, `d`,\nthe stated four-factor inequality holds. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d →\n (a + b) * (b + c) * (c + d) * (d + a) *\n (1 + FourthRoot (a * b * c * d)) ^ 4\n ≥ 16 * (a * b * c * d) * (1 + a) * (1 + b) * (1 + c) * (1 + d)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "555802ab-6774-5b2f-9e14-563008a9778a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e120f1a9cf42925559f55ba3bb5b401fe0fb1c72ee9fe19db835773937cf744c", "task_path": "tasks/nmp3_555802ab-6774-5b2f-9e14-563008a9778a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "555802ab-6774-5b2f-9e14-563008a9778a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_556b5a38-eb7e-5669-93b2-504c0d4f2c43", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that\n-- \\[\n-- \\sqrt{\\frac{a^{2}\\bigl(a^{2}+bc\\bigr)}{b^{2}+c^{2}}}+\n-- \\sqrt{\\frac{b^{2}\\bigl(b^{2}+ca\\bigr)}{c^{2}+a^{2}}}+\n-- \\sqrt{\\frac{c^{2}\\bigl(c^{2}+ab\\bigr)}{a^{2}+b^{2}}}\\ge a+b+c\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Statement of the three-variable square-root inequality\n\nFor positive real numbers `a`, `b`, and `c`, the sum of the three displayed\nsquare-root terms is at least `a + b + c`.\n-/\n\nnamespace Problem\n\n/-- The radicand of the first summand. -/\nnoncomputable def radicandA (a b c : ℝ) : ℝ :=\n (a ^ 2 * (a ^ 2 + b * c)) / (b ^ 2 + c ^ 2)\n\n/-- The radicand of the second summand. -/\nnoncomputable def radicandB (a b c : ℝ) : ℝ :=\n (b ^ 2 * (b ^ 2 + c * a)) / (c ^ 2 + a ^ 2)\n\n/-- The radicand of the third summand. -/\nnoncomputable def radicandC (a b c : ℝ) : ℝ :=\n (c ^ 2 * (c ^ 2 + a * b)) / (a ^ 2 + b ^ 2)\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (radicandA a b c) +\n Real.sqrt (radicandB a b c) +\n Real.sqrt (radicandC a b c)\n\n/-- The positivity hypothesis `a > 0`, `b > 0`, and `c > 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the sum of the three\nsquare-root expressions is at least `a + b + c`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ a + b + c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "556b5a38-eb7e-5669-93b2-504c0d4f2c43", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8dbd31ee52bc5d708557143bba5cb8fad899d81cba8a17efbf0e610f87c9de7c", "task_path": "tasks/nmp3_556b5a38-eb7e-5669-93b2-504c0d4f2c43", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "556b5a38-eb7e-5669-93b2-504c0d4f2c43", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_55a262d0-3d0a-53d3-bff0-47fd1e86c8b7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x_1,x_2,\\dots,x_{11}$ be non‑negative real numbers satisfying $x_1+x_2+\\cdots+x_{11}=1$. \n-- For $i=1,2,\\dots,11$ define \n-- \n-- \\[\n-- y_i=\\begin{cases}\n-- x_i+x_{i+1}, & i\\text{ odd},\\\\[4pt]\n-- x_i+x_{i+1}+x_{i+2}, & i\\text{ even},\n-- \\end{cases}\n-- \\]\n-- \n-- where the indices are taken modulo $11$ (so $x_{12}=x_1$, $x_{13}=x_2$, etc.). \n-- Let \n-- \n-- \\[\n-- F(x_1,\\dots,x_{11})=\\prod_{i=1}^{11} y_i .\n-- \\]\n-- \n-- Prove that whenever $F$ attains its maximum under the given constraints, one has \n-- \\[\n-- x_60$ satisfy $6(a^2+b^2+c^2)+10(ab+bc+ca)=3$. Prove that \n-- \\[\n-- \\frac{a}{(b+c)(b+2c)^2}+\\frac{b}{(c+a)(c+2a)^2}+\\frac{c}{(a+b)(a+2b)^2}\\ge\\frac{8}{3}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The constraint on the positive real parameters in the problem. -/\ndef Constraint (a b c : ℝ) : Prop :=\n 6 * (a ^ 2 + b ^ 2 + c ^ 2) + 10 * (a * b + b * c + c * a) = 3\n\n/-- The cyclic sum on the left-hand side of the required inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a / ((b + c) * (b + 2 * c) ^ 2) +\n b / ((c + a) * (c + 2 * a) ^ 2) +\n c / ((a + b) * (a + 2 * b) ^ 2)\n\n/-- The right-hand side of the required inequality. -/\nnoncomputable def RHS : ℝ := 8 / 3\n\n/-- The complete assertion of the problem: for all positive real `a`, `b`, `c`\nsatisfying the given quadratic constraint, the stated cyclic sum is at least `8/3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n Constraint a b c →\n LHS a b c ≥ RHS\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "55a6cef3-cf9d-544f-821e-986503f02b49", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b801d4b9822f011c3d3c924f37e87204a645d00813075f5918e8acc555dc89e3", "task_path": "tasks/nmp3_55a6cef3-cf9d-544f-821e-986503f02b49", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "55a6cef3-cf9d-544f-821e-986503f02b49", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_55b4a314-6563-5bba-b3f7-e5dbd136c2d9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- There are $a+b$ bowls arranged in a row, numbered $1$ through $a+b$, where $a$ and $b$ are given positive integers. Initially, each of the first $a$ bowls contains an apple and each of the last $b$ bowls contains a pear. A legal move consists of moving an apple from bowl $i$ to bowl $i+1$ and simultaneously moving a pear from bowl $j$ to bowl $j-1$, provided that $i-j$ is even. Multiple fruits may occupy the same bowl at any time. Show that it is possible to end with the first $b$ bowls each containing a pear and the last $a$ bowls each containing an apple if and only if the product $ab$ is even.\nimport Mathlib\n\n/-!\n# Apples and pears in a row\n\nThis file formalizes the statement of the problem. A configuration records,\nfor every bowl, how many apples and how many pears it contains. Fruits of the\nsame kind are indistinguishable, which is sufficient because a move only asks\nwhether at least one fruit of the required kind is present at the chosen source\nbowl. A legal move is a single simultaneous apple move and pear move satisfying\nthe parity condition. Reachability is the reflexive-transitive closure of that\none-step relation.\n\nThe final condition is stated literally as a lower-bound condition: every one\nof the first `b` bowls contains a pear, and every one of the last `a` bowls\ncontains an apple. Since legal moves preserve the numbers of apples and pears,\nand those two ranges partition the `a+b` bowls, this condition in fact forces\nthe intended one-fruit-per-bowl final configuration. The statement does not\nseparately need to assume that fact.\n-/\n\nnamespace Problem\n\n/-- A configuration of apples and pears in `n` bowls. Bowls are represented by\n`Fin n`; the corresponding one-based bowl number is `i.val + 1`. -/\nstructure Config (n : ℕ) where\n apples : Fin n → ℕ\n pears : Fin n → ℕ\n\n/-- The ordinary (one-based) number of a bowl represented by `i : Fin n`. -/\ndef bowlNumber {n : ℕ} (i : Fin n) : ℕ :=\n i.val + 1\n\n/-- The initial configuration: the first `a` bowls each contain one apple and\nzero pears, while the last `b` bowls each contain one pear and zero apples. -/\ndef initialConfig (a b : ℕ) : Config (a + b) where\n apples k := if bowlNumber k ≤ a then 1 else 0\n pears k := if a < bowlNumber k then 1 else 0\n\n/-- The condition in the conclusion: each of the first `b` bowls contains at\nleast one pear, and each of the last `a` bowls contains at least one apple.\nA bowl is among the first `b` exactly when its one-based number is at most `b`;\nsince there are `a+b` bowls, the bowls with one-based number greater than `b`\nare exactly the last `a` bowls. -/\ndef finalCondition (a b : ℕ) (s : Config (a + b)) : Prop :=\n (∀ k : Fin (a + b), bowlNumber k ≤ b → 0 < s.pears k) ∧\n (∀ k : Fin (a + b), b < bowlNumber k → 0 < s.apples k)\n\n/-- The configuration obtained by moving one apple from bowl `i` to bowl `i+1`\nand one pear from bowl `j` to bowl `j-1`. The bounds, availability of the\nfruits, and the parity condition are separate hypotheses in `LegalStep`.\nWhen those hypotheses hold, the source counts are positive and the two updated\nindices are distinct from the corresponding destinations. -/\ndef moveConfig {n : ℕ} (s : Config n) (i j : Fin n) : Config n where\n apples k :=\n s.apples k - (if k = i then 1 else 0) +\n (if bowlNumber k = bowlNumber i + 1 then 1 else 0)\n pears k :=\n s.pears k - (if k = j then 1 else 0) +\n (if bowlNumber k + 1 = bowlNumber j then 1 else 0)\n\n/-- One legal move. There are bowls `i` and `j` such that the apple move\n`i → i+1` and the pear move `j → j-1` both stay in the row, both source bowls\ncontain the required fruit, `i-j` is even, and the next configuration is the\nsimultaneous update described by `moveConfig`. -/\ndef LegalStep {n : ℕ} (s t : Config n) : Prop :=\n ∃ i j : Fin n,\n bowlNumber i < n ∧\n 1 < bowlNumber j ∧\n 0 < s.apples i ∧\n 0 < s.pears j ∧\n Even ((bowlNumber i : ℤ) - (bowlNumber j : ℤ)) ∧\n t = moveConfig s i j\n\n/-- A configuration `t` is reachable from `s` by a finite sequence (possibly\nempty) of legal moves. -/\ndef Reachable {n : ℕ} (s t : Config n) : Prop :=\n Relation.ReflTransGen (LegalStep (n := n)) s t\n\n/-- It is possible to end with the required final arrangement: there exists a\nconfiguration reachable from the initial configuration in which every one of\nthe first `b` bowls contains a pear and every one of the last `a` bowls\ncontains an apple. -/\ndef Possible (a b : ℕ) : Prop :=\n ∃ t : Config (a + b),\n Reachable (initialConfig a b) t ∧ finalCondition a b t\n\n/-- The problem statement: for all positive integers `a` and `b`, it is\npossible to end with the first `b` bowls containing pears and the last `a`\nbowls containing apples if and only if `a * b` is even. -/\ndef Target : Prop :=\n ∀ a b : ℕ, 0 < a → 0 < b → (Possible a b ↔ Even (a * b))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "55b4a314-6563-5bba-b3f7-e5dbd136c2d9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f3a338da8325b6e03bc2828ba986d883fab62dd880dfea831e5d8e3d78f29017", "task_path": "tasks/nmp3_55b4a314-6563-5bba-b3f7-e5dbd136c2d9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "55b4a314-6563-5bba-b3f7-e5dbd136c2d9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_55dfc592-4a35-5b72-9066-21b1bcfd0747", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\((x_n)_{n\\ge 0}\\) be a real sequence satisfying \n-- \\(x_0>0,\\;x_1>0\\) and \n-- \\[\n-- x_{n+2}=\\frac{2+x_{n+1}}{2+x_n}\\qquad\\text{for all }n\\ge0 .\n-- \\] \n-- Prove that \\((x_n)_{n\\ge0}\\) is convergent.\nimport Mathlib\n\n/-!\n# Formalization of the problem\n\nLet `x : ℕ → ℝ` satisfy `x 0 > 0`, `x 1 > 0`, and\n`x (n + 2) = (2 + x (n + 1)) / (2 + x n)` for every `n : ℕ`.\nThe target proposition asserts that such a sequence converges to a finite real limit.\n-/\n\nnamespace Problem\n\n/-- The second-order recurrence from the problem, for every natural index `n`. -/\ndef Recurrence (x : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, x (n + 2) = (2 + x (n + 1)) / (2 + x n)\n\n/-- Convergence of a real sequence to some finite real limit. -/\ndef Convergent (x : ℕ → ℝ) : Prop :=\n ∃ l : ℝ, Filter.Tendsto x Filter.atTop (nhds l)\n\n/--\nThe formal target: every real sequence satisfying the two positive initial\nconditions and the recurrence converges.\n-/\ndef Target : Prop :=\n ∀ (x : ℕ → ℝ),\n x 0 > 0 → x 1 > 0 → Recurrence x → Convergent x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "55dfc592-4a35-5b72-9066-21b1bcfd0747", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "418f300f291b01c1ee01fd78f8c728a9e632f1ce9877bc2424e6dbc1e3e80661", "task_path": "tasks/nmp3_55dfc592-4a35-5b72-9066-21b1bcfd0747", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "55dfc592-4a35-5b72-9066-21b1bcfd0747", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_55f492c3-29a7-5e75-82e2-5176515ca78f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for non‑negative real numbers \\(a,b,c\\) (with \\(ab+bc+ca>0\\)) the following chain of inequalities holds:\n-- \\[\n-- 1+\\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}\\;\\ge\\;\n-- \\sum_{cyc}\\frac{a(b+c)}{a^{2}+2bc}\\;\\ge\\;\n-- 1+\\frac{ab+bc+ca}{a^{2}+b^{2}+c^{2}}.\n-- \\]\n-- (The sum \\(\\displaystyle\\sum_{cyc}\\) denotes the cyclic sum over \\(a,b,c\\).)\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the cyclic inequality chain\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, `c`\nwith `ab + bc + ca > 0`, the chain\n\n`1 + (a^2 + b^2 + c^2)/(ab + bc + ca) ≥\n Σ_cyc a(b+c)/(a^2 + 2bc) ≥\n 1 + (ab + bc + ca)/(a^2 + b^2 + c^2)`.\n\nThis file only states the assertion; it contains no proof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The pairwise sum `ab + bc + ca`. -/\ndef pairwiseSum (a b c : ℝ) : ℝ :=\n a * b + b * c + c * a\n\n/-- The sum of squares `a^2 + b^2 + c^2`. -/\ndef sumSquares (a b c : ℝ) : ℝ :=\n a ^ 2 + b ^ 2 + c ^ 2\n\n/--\nThe cyclic sum\n`a(b+c)/(a^2+2bc) + b(c+a)/(b^2+2ca) + c(a+b)/(c^2+2ab)`.\n-/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n a * (b + c) / (a ^ 2 + 2 * b * c) +\n b * (c + a) / (b ^ 2 + 2 * c * a) +\n c * (a + b) / (c ^ 2 + 2 * a * b)\n\n/-- The left-hand expression of the stated chain. -/\ndef leftSide (a b c : ℝ) : ℝ :=\n 1 + sumSquares a b c / pairwiseSum a b c\n\n/-- The right-hand expression of the stated chain. -/\ndef rightSide (a b c : ℝ) : ℝ :=\n 1 + pairwiseSum a b c / sumSquares a b c\n\n/-- The domain condition from the problem: `a`, `b`, and `c` are nonnegative\nand `ab + bc + ca` is positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < pairwiseSum a b c\n\n/--\nThe complete inequality chain to be proved: both comparisons hold for every\nadmissible triple of real numbers.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c →\n leftSide a b c ≥ cyclicSum a b c ∧\n cyclicSum a b c ≥ rightSide a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "55f492c3-29a7-5e75-82e2-5176515ca78f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3b62e1a58cf8360ebe31f9d9629958463ded047dae426eaf80038619df2ce770", "task_path": "tasks/nmp3_55f492c3-29a7-5e75-82e2-5176515ca78f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "55f492c3-29a7-5e75-82e2-5176515ca78f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_55ffbb72-89d2-5adc-ae58-e8ac085284fd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $0<a,b,c<1$, prove that \n-- \\[\n-- \\frac{a}{b+c+1}+\\frac{b}{c+a+1}+\\frac{c}{a+b+1}+(1-a)(1-b)(1-c)\\ge\\frac78.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThis file states the inequality from the problem. The target is packaged as a\n`Prop`-valued definition; no proof of the inequality is asserted here.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The open unit-box condition `0 < a, b, c < 1`, stated as strict\ninequalities for real `a`, `b`, and `c`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ a < 1 ∧ 0 < b ∧ b < 1 ∧ 0 < c ∧ c < 1\n\n/-- The left-hand side of the inequality in the problem. -/\ndef LHS (a b c : ℝ) : ℝ :=\n a / (b + c + 1) + b / (c + a + 1) + c / (a + b + 1) +\n (1 - a) * (1 - b) * (1 - c)\n\n/-- The right-hand side of the inequality in the problem. -/\ndef RHS : ℝ :=\n (7 : ℝ) / 8\n\n/--\nFor real numbers `a`, `b`, and `c` satisfying `0 < a < 1`, `0 < b < 1`, and\n`0 < c < 1`, the expression\n`a / (b + c + 1) + b / (c + a + 1) + c / (a + b + 1)`\nplus `(1 - a) * (1 - b) * (1 - c)` is at least `7 / 8`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ RHS\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "55ffbb72-89d2-5adc-ae58-e8ac085284fd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f598b05203cdf67c285e075f768a53d28bc52eea93e33545dca1b70736424046", "task_path": "tasks/nmp3_55ffbb72-89d2-5adc-ae58-e8ac085284fd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "55ffbb72-89d2-5adc-ae58-e8ac085284fd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_56428d0f-4f86-5655-af8e-5935e429f0f4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a convex quadrilateral. Points $E$ on $AB$ and $F$ on $CD$ satisfy \n-- \\[\n-- \\frac{AB}{AE}=\\frac{CD}{DF}=n,\n-- \\] \n-- with $n>1$. If $S$ denotes the area of quadrilateral $AEFD$, prove that \n-- \\[\n-- S\\;\\le\\;\\frac{AB\\cdot CD\\;+\\;n(n-1)\\,AD^{2}\\;+\\;n\\,AD\\cdot BC}{2n^{2}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the quadrilateral area inequality\n\nThe plane is modeled by `EuclideanSpace ℝ (Fin 2)`. Lengths are Euclidean\ndistances, and the area of a quadrilateral is the absolute value of its\nshoelace (signed) area.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane, represented by two real coordinates. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The Euclidean length of the segment joining two points. -/\nnoncomputable def segmentLength (A B : Point) : ℝ :=\n dist A B\n\n/-- `E` lies on the closed segment from `A` to `B`. -/\ndef OnSegment (A B E : Point) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ E = A + t • (B - A)\n\n/-- The scalar two-dimensional cross product of two coordinate vectors. -/\ndef cross (u v : Point) : ℝ :=\n u 0 * v 1 - u 1 * v 0\n\n/-- The four successive turns of the ordered quadrilateral `A,B,C,D` are all\nstrictly counterclockwise. -/\ndef StrictlyConvexOriented (A B C D : Point) : Prop :=\n 0 < cross (B - A) (C - B) ∧\n 0 < cross (C - B) (D - C) ∧\n 0 < cross (D - C) (A - D) ∧\n 0 < cross (A - D) (B - A)\n\n/-- The four points form a nondegenerate convex quadrilateral in the cyclic\norder `A,B,C,D` (clockwise or counterclockwise). -/\ndef ConvexQuadrilateral (A B C D : Point) : Prop :=\n StrictlyConvexOriented A B C D ∨ StrictlyConvexOriented D C B A\n\n/-- The signed shoelace area of the ordered quadrilateral `A,B,C,D`. -/\nnoncomputable def signedQuadrilateralArea (A B C D : Point) : ℝ :=\n (cross A B + cross B C + cross C D + cross D A) / 2\n\n/-- The (nonnegative) area of the ordered quadrilateral `A,B,C,D`. -/\nnoncomputable def quadrilateralArea (A B C D : Point) : ℝ :=\n |signedQuadrilateralArea A B C D|\n\n/-- The complete mathematical assertion of the problem: for every convex\nquadrilateral `ABCD`, points `E` on segment `AB` and `F` on segment `CD`\nwhose length ratios are both `n`, with `n > 1`, the area `S` of `AEFD`\nsatisfies the displayed upper bound. -/\nnoncomputable def Target : Prop :=\n ∀ (A B C D E F : Point) (n : ℝ),\n ConvexQuadrilateral A B C D →\n OnSegment A B E →\n OnSegment C D F →\n segmentLength A B / segmentLength A E = n →\n segmentLength C D / segmentLength D F = n →\n 1 < n →\n quadrilateralArea A E F D ≤\n (segmentLength A B * segmentLength C D +\n n * (n - 1) * (segmentLength A D) ^ 2 +\n n * segmentLength A D * segmentLength B C) / (2 * n ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "56428d0f-4f86-5655-af8e-5935e429f0f4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "978ce866decdc5891108108275b28269f86e550302917a907c84dd10edf1126e", "task_path": "tasks/nmp3_56428d0f-4f86-5655-af8e-5935e429f0f4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "56428d0f-4f86-5655-af8e-5935e429f0f4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5642ad73-17b1-58e6-8ad3-299df9665961", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^2+b^2+c^2=3$. Prove that \n-- \\[\n-- \\frac{bc+3}{a^2+3}+\\frac{ca+3}{b^2+3}+\\frac{ab+3}{c^2+3}\\le 3.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The inequality from the problem: for all positive real numbers `a`, `b`, and `c`\nwhose squares sum to `3`, the stated cyclic expression is at most `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = 3 →\n (b * c + 3) / (a ^ 2 + 3) +\n (c * a + 3) / (b ^ 2 + 3) +\n (a * b + 3) / (c ^ 2 + 3) ≤ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5642ad73-17b1-58e6-8ad3-299df9665961", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e8ad1c72bbf2218ca942a3af0c1ca22af4b3fcce4590fbc853c5e76cf956f82b", "task_path": "tasks/nmp3_5642ad73-17b1-58e6-8ad3-299df9665961", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5642ad73-17b1-58e6-8ad3-299df9665961", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_566b7dd0-616a-5e62-87a3-3000159a4ae2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) be the side lengths of an arbitrary triangle \\(ABC\\). Prove that \n-- \\[\n-- 3\\Big(\\frac{a^{2}}{b^{2}}+\\frac{b^{2}}{c^{2}}+\\frac{c^{2}}{a^{2}}\\Big)\\;-\\;(a^{2}+b^{2}+c^{2})\\Big(\\frac{1}{a^{2}}+\\frac{1}{b^{2}}+\\frac{1}{c^{2}}\\Big)\\;\\ge\\;0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: cyclic triangle-side inequality\n\nThe original problem asks to prove, for every triangle with positive side lengths\n`a`, `b`, and `c`, that\n\n`3 (a^2 / b^2 + b^2 / c^2 + c^2 / a^2)\n - (a^2 + b^2 + c^2) (1 / a^2 + 1 / b^2 + 1 / c^2) ≥ 0`.\n\nThe declarations below state this assertion without supplying a proof. A\nEuclidean triangle is represented by its three side lengths, so the triangle\ncondition is expressed by the three strict triangle inequalities.\n-/\n\nnamespace Problem\n\n/-- The three lengths are positive real numbers. -/\ndef PositiveSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The three strict triangle inequalities for side lengths `a`, `b`, and `c`. -/\ndef StrictTriangleInequalities (a b c : ℝ) : Prop :=\n a < b + c ∧ b < a + c ∧ c < a + b\n\n/-- `a`, `b`, and `c` are the side lengths of a nondegenerate triangle: they are\npositive and satisfy all three strict triangle inequalities. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n PositiveSideLengths a b c ∧ StrictTriangleInequalities a b c\n\n/-- The left-hand side of the inequality in the problem, using real arithmetic\nand real division. -/\nnoncomputable def InequalityLHS (a b c : ℝ) : ℝ :=\n 3 * ((a ^ 2) / (b ^ 2) + (b ^ 2) / (c ^ 2) + (c ^ 2) / (a ^ 2)) -\n (a ^ 2 + b ^ 2 + c ^ 2) *\n (1 / (a ^ 2) + 1 / (b ^ 2) + 1 / (c ^ 2))\n\n/-- The statement to be proved: for all positive real side lengths `a`, `b`, `c`\nof a triangle, the left-hand side of the displayed inequality is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsTriangleSideLengths a b c → 0 ≤ InequalityLHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "566b7dd0-616a-5e62-87a3-3000159a4ae2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1e89ba6b77895704dd8ded5a691203481057aab4f5eb8d1730fe1309a48f0774", "task_path": "tasks/nmp3_566b7dd0-616a-5e62-87a3-3000159a4ae2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "566b7dd0-616a-5e62-87a3-3000159a4ae2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5676c952-ed75-5a5b-a805-58ef11240b8c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$. Prove that \n-- \\[\n-- \\frac{a-b}{a+2b+c}+\\frac{b-c}{b+2c+d}+\\frac{c-d}{c+2d+a}+\\frac{d-a}{d+2a+b}\\ge 0.\n-- \\]\nimport Mathlib.Data.Real.Basic\n\n/-!\n# Formal statement for the four-variable cyclic inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, `c`, and `d`, to prove\nthat the displayed cyclic sum is nonnegative.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c d : ℝ) : ℝ :=\n (a - b) / (a + 2 * b + c) +\n (b - c) / (b + 2 * c + d) +\n (c - d) / (c + 2 * d + a) +\n (d - a) / (d + 2 * a + b)\n\n/-- The admissibility condition: all four variables are positive. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d\n\n/-- The proposition asserted by the source problem: for every positive real\n`a`, `b`, `c`, `d`, the cyclic sum is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → 0 ≤ lhs a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5676c952-ed75-5a5b-a805-58ef11240b8c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a880a8866467e88e08be9ac75aba83ea1479bee7cfd7e387cffa3e6910ab3515", "task_path": "tasks/nmp3_5676c952-ed75-5a5b-a805-58ef11240b8c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5676c952-ed75-5a5b-a805-58ef11240b8c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_567e8469-9a02-5184-adf4-2cf4f8a9d822", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be real numbers, not all zero. Prove that \n-- \\[\n-- -\\frac{\\sqrt7}{8}\\;\\le\\;\\frac{a^{3}b+b^{3}c+c^{3}a}{\\bigl(a^{2}+b^{2}+c^{2}\\bigr)^{2}}\\;\\le\\;\\frac13\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic cubic rational inequality\n\nThe original problem asks to prove, for all real triples `(a,b,c)` that are not\nall zero,\n\n`-(sqrt 7)/8 ≤ (a^3*b + b^3*c + c^3*a) / (a^2 + b^2 + c^2)^2 ≤ 1/3`.\n\nThis file records that assertion as a proposition-valued definition. No proof\nof the proposition is supplied here.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition from the problem: the real triple `(a,b,c)` is\nnot the zero triple. -/\ndef Admissible (a b c : ℝ) : Prop :=\n (a, b, c) ≠ (0, 0, 0)\n\n/-- The numerator `a^3 b + b^3 c + c^3 a`. -/\ndef numerator (a b c : ℝ) : ℝ :=\n a ^ 3 * b + b ^ 3 * c + c ^ 3 * a\n\n/-- The denominator `(a^2 + b^2 + c^2)^2`. -/\ndef denominator (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) ^ 2\n\n/-- The rational expression in the problem. -/\nnoncomputable def ratio (a b c : ℝ) : ℝ :=\n numerator a b c / denominator a b c\n\n/-- The lower bound `-sqrt(7)/8`. -/\nnoncomputable def lowerBound : ℝ :=\n - Real.sqrt (7 : ℝ) / 8\n\n/-- The upper bound `1/3`. -/\nnoncomputable def upperBound : ℝ :=\n (1 : ℝ) / 3\n\n/-- The complete assertion of the problem: for every real triple that is not\nall zero, the rational expression lies between `-sqrt(7)/8` and `1/3`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lowerBound ≤ ratio a b c ∧ ratio a b c ≤ upperBound\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "567e8469-9a02-5184-adf4-2cf4f8a9d822", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c92ae9b5c0194fe9c0edb94696f3ce475d9e4b8765d796111a6e8143150e875d", "task_path": "tasks/nmp3_567e8469-9a02-5184-adf4-2cf4f8a9d822", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "567e8469-9a02-5184-adf4-2cf4f8a9d822", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_568b5c0d-3ef9-5709-b8b6-4efa80c3d6d3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $ab+bc+ca=1$. Prove that \n-- \\[\n-- 2(a+b+c)(ab^2+bc^2+ca^2)+9(abc)^2\\;\\ge\\;7abc(a+b+c)\\, .\n-- \\]\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the positive-real inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca = 1`, the inequality\n\n`2 (a + b + c) (a b^2 + b c^2 + c a^2) + 9 (a b c)^2\n ≥ 7 (a b c) (a + b + c)`.\n\nThroughout, juxtaposition denotes multiplication and exponentiation binds\nbefore multiplication, so `a b^2` is `a * b ^ 2`.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- A real number is positive in the strict sense used by the source problem. -/\ndef Positive (x : ℝ) : Prop :=\n 0 < x\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef LHS (a b c : ℝ) : ℝ :=\n 2 * (a + b + c) * (a * b ^ 2 + b * c ^ 2 + c * a ^ 2)\n + 9 * (a * b * c) ^ 2\n\n/-- The right-hand side of the inequality in the source problem. -/\ndef RHS (a b c : ℝ) : ℝ :=\n 7 * (a * b * c) * (a + b + c)\n\n/-- The pairwise-product constraint `ab + bc + ca = 1` from the source problem. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a * b + b * c + c * a = 1\n\n/-- The complete assertion requested by the source problem. The universal\nquantifiers range over all triples of real numbers. They are followed, in\norder, by the positivity of `a`, `b`, and `c` and by the constraint\n`ab + bc + ca = 1`; the consequent is the required non-strict inequality. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Positive a → Positive b → Positive c → Constraint a b c →\n LHS a b c ≥ RHS a b c\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "568b5c0d-3ef9-5709-b8b6-4efa80c3d6d3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9abbf1886d6b4d6fa0eb4a323c0e3332540f0f6d4a1dd7116d4863eaadce7019", "task_path": "tasks/nmp3_568b5c0d-3ef9-5709-b8b6-4efa80c3d6d3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "568b5c0d-3ef9-5709-b8b6-4efa80c3d6d3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_56ab68b5-305e-5322-ae56-91cee6a8ba08", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{a(a+b)}+\\frac{1}{b(b+c)}+\\frac{1}{c(c+a)}\\ge \\frac{3}{2}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three strict positivity hypotheses stated in the problem. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The product normalization stated in the problem. -/\ndef ProductOne (a b c : ℝ) : Prop :=\n a * b * c = 1\n\n/-- The combined admissibility hypothesis for the variables in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Positive a b c ∧ ProductOne a b c\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (1 : ℝ) / (a * (a + b)) + (1 : ℝ) / (b * (b + c)) +\n (1 : ℝ) / (c * (c + a))\n\n/-- The displayed lower bound, for fixed real numbers `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ (3 : ℝ) / 2\n\n/-- The pointwise implication: admissibility implies the displayed inequality. -/\ndef TargetAt (a b c : ℝ) : Prop :=\n Admissible a b c → Inequality a b c\n\n/-- The full universally quantified statement requested by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, TargetAt a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "56ab68b5-305e-5322-ae56-91cee6a8ba08", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "599c3ce01a86b1495b1a58ec48a88011e61b2b63f3804628c8290f72e8c5e527", "task_path": "tasks/nmp3_56ab68b5-305e-5322-ae56-91cee6a8ba08", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "56ab68b5-305e-5322-ae56-91cee6a8ba08", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_56b45620-b7a2-5581-ab7a-8013f12d310a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(k\\) be a positive integer. Prove that if there exists a sequence of integers \\((a_n)_{n\\ge 0}\\) satisfying \n-- \\[\n-- a_n=\\frac{a_{n-1}+n^{\\,k}}{n}\\qquad\\text{for all }n\\ge 1,\n-- \\] \n-- then \\(k-2\\) is divisible by \\(3\\) (i.e. \\(k\\equiv2\\pmod3\\)).\nimport Mathlib\n\n/-!\n# Formalization of the integer recurrence problem\n\nThe original problem asks to prove that a positive integer `k` is congruent to\n`2` modulo `3` whenever there is an integer-valued sequence `a₀, a₁, ...`\nsatisfying\n\n`aₙ = (aₙ₋₁ + n^k) / n` for every positive `n`.\n\nThe quotient is interpreted as an equality in `ℚ`: every integer term is\ncoerced to `ℚ`, and the recurrence is only required for `n ≥ 1`, so its\ndenominator is nonzero. For such `n`, this is equivalent to the integral\nidentity `n * aₙ = aₙ₋₁ + n^k`.\n-/\n\nnamespace Problem\n\n/-- The recurrence condition for a fixed natural-number exponent `k` and an\ninteger-valued sequence `a : ℕ → ℤ`, with indices `a₀, a₁, ...`.\n\nThe equality is stated in `ℚ`. The quantifier covers precisely the positive\nnatural numbers `n`, including `n = 1`; consequently `a (n - 1)` is the\nprevious term and `(n : ℚ)` is nonzero. -/\ndef IntegerRecurrence (k : ℕ) (a : ℕ → ℤ) : Prop :=\n ∀ n : ℕ, 1 ≤ n →\n (a n : ℚ) = ((a (n - 1) : ℚ) + (n : ℚ) ^ k) / (n : ℚ)\n\n/-- There exists an integer-valued sequence satisfying the recurrence for the\nfixed natural-number exponent `k`. -/\ndef Admissible (k : ℕ) : Prop :=\n ∃ a : ℕ → ℤ, IntegerRecurrence k a\n\n/-- The conclusion `k - 2` is divisible by `3`, equivalently `k ≡ 2 (mod 3)`.\n\nThe subtraction is performed in `ℤ`, so this is the ordinary non-truncated\n`k - 2` rather than natural-number subtraction. -/\ndef Congruence (k : ℕ) : Prop :=\n (3 : ℤ) ∣ ((k : ℤ) - 2)\n\n/-- The full assertion of the problem: for every positive integer `k`, if an\ninteger-valued sequence satisfies the recurrence, then `k - 2` is divisible by\n`3`. -/\ndef Target : Prop :=\n ∀ k : ℕ, 0 < k → Admissible k → Congruence k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "56b45620-b7a2-5581-ab7a-8013f12d310a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ea981c9040af476c0e8ca1a521694c2b2dfebf1fb8f8630b0908253ca57c6333", "task_path": "tasks/nmp3_56b45620-b7a2-5581-ab7a-8013f12d310a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "56b45620-b7a2-5581-ab7a-8013f12d310a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_56bfbe7b-5315-53e4-8044-823ae9796946", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that \n-- $$f(xy+f(x^2))=f(x)f(y)+xf(x)$$ \n-- for all real numbers $x$ and $y$.\nimport Mathlib\n\n/-!\n# Functional equation: `f (x*y + f (x^2)) = f x * f y + x * f x`\n\nThis file formalizes the statement of the problem. The predicate\n`Problem.Admissible` records the original functional equation. The predicate\n`Problem.IsCompleteAnswer` records both directions of a complete classification\nfor a proposed solution set. The declaration `Problem.AnswerCorrect` applies\nthat predicate to the candidate solution set consisting of the zero function and\nthe identity function. No proof of the classification is included, as this task\nonly asks for statement formalization.\n-/\n\nnamespace Problem\n\n/-- A function `f : ℝ → ℝ` is admissible (is a solution of the functional\nequation) if it satisfies\n`f (x*y + f (x^2)) = f x * f y + x * f x` for every pair of real numbers\n`x` and `y`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x * y + f (x ^ 2)) = f x * f y + x * f x\n\n/-- A proposed set `S` of real functions is a complete answer exactly when each\nmember of `S` is admissible and every admissible function belongs to `S`. -/\ndef IsCompleteAnswer (S : Set (ℝ → ℝ)) : Prop :=\n (∀ f : ℝ → ℝ, f ∈ S → Admissible f) ∧\n (∀ f : ℝ → ℝ, Admissible f → f ∈ S)\n\n/-- The identically zero function from `ℝ` to `ℝ`. -/\ndef zeroFunction : ℝ → ℝ :=\n fun (_ : ℝ) => 0\n\n/-- The identity function on `ℝ`. -/\ndef identityFunction : ℝ → ℝ :=\n fun x : ℝ => x\n\n/-- The candidate solution set `{f | f = 0 or f = identity}`. -/\ndef CandidateAnswer : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | f = zeroFunction ∨ f = identityFunction}\n\n/-- The assertion that the candidate set is precisely the set of all\nadmissible functions. This is the answer-correctness proposition for the\n\"find all functions\" problem. -/\ndef AnswerCorrect : Prop :=\n IsCompleteAnswer CandidateAnswer\n\n/-- A closed target name for the complete answer assertion. -/\ndef Target : Prop :=\n AnswerCorrect\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "56bfbe7b-5315-53e4-8044-823ae9796946", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c9ebf3cf6b1b3e8c268a7ee76b3864c44b416f9bc553714fadbddb18e090351a", "task_path": "tasks/nmp3_56bfbe7b-5315-53e4-8044-823ae9796946", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "56bfbe7b-5315-53e4-8044-823ae9796946", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_56d1cfaf-df8f-5fa3-a0c4-78712fb3ed3a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- There are more than three airports. For any two airports $A$ and $B$, if there is a flight from $A$ to $B$, then there is also a flight from $B$ to $A$. \n-- A **route** is a sequence of distinct airports $A_0,A_1,\\dots ,A_n$ such that for each $i=0,\\dots ,n-1$ there is a flight from $A_i$ to $A_{i+1}$; the length of the route is $n$ (the number of flights). \n-- Assume that for any three distinct airports $A,B,C$ there exists a route $P$ that starts at $A$, ends at $B$, and does **not** contain $C$. \n-- Let $M\\ge 2$ be the length of the longest existing route. Prove that any two routes of length $M$ share at least two common airports (i.e. their vertex sets intersect in at least two airports).\nimport Mathlib\n\n/-!\n# Formal statement of the airport-route problem\n\nThis file fixes the vocabulary of the problem: airports, flights, routes,\navoiding a prescribed airport, a longest route length, and the conclusion\nthat two maximum routes have at least two airports in common.\n-/\n\nuniverse u\n\nnamespace Problem\n\nvariable {V : Type u}\n\n/-- The flight relation is symmetric: a flight from `A` to `B` gives a\nflight from `B` to `A`. (This is stated separately rather than building it\ninto the flight relation, so that it remains an explicit hypothesis.) -/\ndef FlightsSymmetric (Flight : V → V → Prop) : Prop :=\n ∀ A B : V, Flight A B → Flight B A\n\n/-- The assertion that there are more than three airports, expressed\nwithout a finiteness assumption: four pairwise distinct airports exist. -/\ndef MoreThanThreeAirports (V : Type u) : Prop :=\n ∃ A B C D : V,\n A ≠ B ∧ A ≠ C ∧ A ≠ D ∧ B ≠ C ∧ B ≠ D ∧ C ≠ D\n\n/-- A route of length `n` is a sequence of `n + 1` pairwise distinct\nairports in which every consecutive pair is joined by a flight. The\nsequence is represented by its indexing function\n`vertex : Fin (n + 1) → V`. -/\nstructure Route (Flight : V → V → Prop) where\n /-- The number of flights in the route. -/\n length : ℕ\n /-- The airports in the route, indexed from `0` through `length`. -/\n vertex : Fin (length + 1) → V\n /-- All airports occurring in the route are distinct. -/\n distinct : Function.Injective vertex\n /-- Consecutive airports in the route are joined by a flight. -/\n adjacent : ∀ i : Fin length, Flight (vertex i.castSucc) (vertex i.succ)\n\nnamespace Route\n\nvariable {Flight : V → V → Prop} (r : Route Flight)\n\n/-- The starting airport of a route. -/\ndef start : V :=\n r.vertex 0\n\n/-- The ending airport of a route. -/\ndef finish : V :=\n r.vertex (Fin.last r.length)\n\n/-- The set of airports occurring in the route. -/\ndef vertexSet : Set V :=\n Set.range r.vertex\n\n/-- An airport occurs in the route. -/\ndef Contains (A : V) : Prop :=\n A ∈ r.vertexSet\n\n/-- The route avoids an airport if that airport occurs nowhere in it. -/\ndef Avoids (A : V) : Prop :=\n ¬ r.Contains A\n\nend Route\n\n/-- For every three distinct airports `A`, `B`, and `C`, there is a route\nfrom `A` to `B` which does not contain `C`. -/\ndef ThreeDistinctAirportsRouteAvoidingThird (Flight : V → V → Prop) : Prop :=\n ∀ A B C : V,\n A ≠ B → A ≠ C → B ≠ C →\n ∃ r : Route Flight, r.start = A ∧ r.finish = B ∧ r.Avoids C\n\n/-- `M` is at least two and is the length of a longest existing route:\nsome route has length exactly `M`, and no route has length greater than\n`M`. -/\ndef IsLongestRouteLength (Flight : V → V → Prop) (M : ℕ) : Prop :=\n 2 ≤ M ∧\n (∃ r : Route Flight, r.length = M) ∧\n ∀ r : Route Flight, r.length ≤ M\n\n/-- Two routes have at least two common airports, i.e. there exist two\ndistinct airports each belonging to the vertex set of both routes. -/\ndef RoutesShareAtLeastTwoAirports (Flight : V → V → Prop)\n (r s : Route Flight) : Prop :=\n ∃ A B : V,\n A ≠ B ∧\n A ∈ r.vertexSet ∧ A ∈ s.vertexSet ∧\n B ∈ r.vertexSet ∧ B ∈ s.vertexSet\n\n/-- The complete assertion of the problem: for any symmetric flight\nrelation on more than three airports, if paths between any two vertices can\navoid any prescribed third vertex, and `M ≥ 2` is a longest route length,\nthen any two routes of length `M` have at least two common airports. -/\ndef Target : Prop :=\n ∀ (V : Type u),\n MoreThanThreeAirports V →\n ∀ (Flight : V → V → Prop),\n FlightsSymmetric Flight →\n ThreeDistinctAirportsRouteAvoidingThird Flight →\n ∀ (M : ℕ),\n IsLongestRouteLength Flight M →\n ∀ r s : Route Flight,\n r.length = M → s.length = M →\n RoutesShareAtLeastTwoAirports Flight r s\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "56d1cfaf-df8f-5fa3-a0c4-78712fb3ed3a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1747a7f9844ffd2466390836bcb713f72739a57930b5067e68225fc39b08300c", "task_path": "tasks/nmp3_56d1cfaf-df8f-5fa3-a0c4-78712fb3ed3a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "56d1cfaf-df8f-5fa3-a0c4-78712fb3ed3a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_570e135f-34f7-54ce-97a7-535f5d58ec75", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- a,b,c\\ge 0. Prove that \n-- \\[\n-- \\sqrt{a^2+4bc}+\\sqrt{b^2+4ca}+\\sqrt{c^2+4ab}\\ge \\sqrt{(a+b+c)^2+12(ab+bc+ca)}.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The real inequality from the problem, with the nonnegativity assumptions\non `a`, `b`, and `c` included in the quantified statement. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n Real.sqrt (a ^ 2 + 4 * b * c) +\n Real.sqrt (b ^ 2 + 4 * c * a) +\n Real.sqrt (c ^ 2 + 4 * a * b) ≥\n Real.sqrt ((a + b + c) ^ 2 + 12 * (a * b + b * c + c * a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "570e135f-34f7-54ce-97a7-535f5d58ec75", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2ca272efeef49ceeb5d58a315addf24199281ff040b94a77cf97c820b51adf31", "task_path": "tasks/nmp3_570e135f-34f7-54ce-97a7-535f5d58ec75", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "570e135f-34f7-54ce-97a7-535f5d58ec75", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_57195bd2-564d-5590-ae02-634fbf2da14e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given positive integers $m$ and $n$. Let $a_{i,j}\\;(1\\le i\\le m,\\;1\\le j\\le n)$ be non‑negative real numbers satisfying \n-- \\[\n-- a_{i,1}\\ge a_{i,2}\\ge\\cdots\\ge a_{i,n}\\qquad\\text{and}\\qquad a_{1,j}\\ge a_{2,j}\\ge\\cdots\\ge a_{m,j}\n-- \\]\n-- for all $i$ and $j$. Define \n-- \\[\n-- X_{i,j}=a_{1,j}+a_{2,j}+\\cdots+a_{i-1,j}+a_{i,j}+a_{i,j-1}+a_{i,j-2}+\\cdots+a_{i,1},\n-- \\]\n-- \\[\n-- Y_{i,j}=a_{m,j}+a_{m-1,j}+\\cdots+a_{i+1,j}+a_{i,j}+a_{i,j+1}+a_{i,j+2}+\\cdots+a_{i,n}.\n-- \\] \n-- Prove that \n-- \\[\n-- \\prod_{i=1}^{m}\\prod_{j=1}^{n} X_{i,j}\\;\\ge\\;\\prod_{i=1}^{m}\\prod_{j=1}^{n} Y_{i,j}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a two-dimensional monotone matrix product inequality\n\nThe original problem fixes positive natural numbers `m` and `n` and a non-negative\nreal matrix whose rows and columns are non-increasing. For each entry it defines\ntwo partial row/column sums, `X` and `Y`, and asks for the product inequality\n`∏ i, ∏ j, X i j ≥ ∏ i, ∏ j, Y i j`.\n\nThe declaration `Problem.Target` below is the proposition to be proved. It is a\ndefinition of a `Prop`; no proof is supplied.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- A real matrix, indexed by `Fin m` and `Fin n`, all of whose entries are\nnon-negative. The indices `0, …, m-1` and `0, …, n-1` represent the original\nindices `1, …, m` and `1, …, n`, respectively. -/\ndef IsNonnegativeMatrix {m n : ℕ} (a : Fin m → Fin n → ℝ) : Prop :=\n ∀ (i : Fin m) (j : Fin n), 0 ≤ a i j\n\n/-- The rows of the matrix are non-increasing from left to right. -/\ndef RowsNonincreasing {m n : ℕ} (a : Fin m → Fin n → ℝ) : Prop :=\n ∀ (i : Fin m) (j j' : Fin n), j ≤ j' → a i j' ≤ a i j\n\n/-- The columns of the matrix are non-increasing from top to bottom. -/\ndef ColsNonincreasing {m n : ℕ} (a : Fin m → Fin n → ℝ) : Prop :=\n ∀ (i i' : Fin m) (j : Fin n), i ≤ i' → a i' j ≤ a i j\n\n/-- The matrix satisfies all three hypotheses of the problem: non-negativity,\nrow monotonicity, and column monotonicity. -/\ndef Admissible {m n : ℕ} (a : Fin m → Fin n → ℝ) : Prop :=\n IsNonnegativeMatrix a ∧ RowsNonincreasing a ∧ ColsNonincreasing a\n\n/-- The quantity `X_{i,j}` from the problem:\n`a_{1,j} + ⋯ + a_{i,j} + a_{i,j-1} + ⋯ + a_{i,1}`.\n\nWith zero-based `Fin` indices, the first sum consists of the column entries in\nrows `k ≤ i`, and the second sum consists of the row entries in columns `l < j`.\nThus `a i j` occurs exactly once in the first sum and not in the second sum. -/\ndef X {m n : ℕ} (a : Fin m → Fin n → ℝ) (i : Fin m) (j : Fin n) : ℝ :=\n (∑ k : Fin m, if k ≤ i then a k j else 0) +\n (∑ l : Fin n, if l < j then a i l else 0)\n\n/-- The quantity `Y_{i,j}` from the problem:\n`a_{m,j} + ⋯ + a_{i,j} + a_{i,j+1} + ⋯ + a_{i,n}`.\n\nWith zero-based `Fin` indices, the first sum consists of the column entries in\nrows `k ≥ i`, and the second sum consists of the row entries in columns `l > j`.\nThus `a i j` occurs exactly once in the first sum and not in the second sum. -/\ndef Y {m n : ℕ} (a : Fin m → Fin n → ℝ) (i : Fin m) (j : Fin n) : ℝ :=\n (∑ k : Fin m, if i ≤ k then a k j else 0) +\n (∑ l : Fin n, if j < l then a i l else 0)\n\n/-- The left-hand product `∏_{i=1}^m ∏_{j=1}^n X_{i,j}`. -/\ndef LHS {m n : ℕ} (a : Fin m → Fin n → ℝ) : ℝ :=\n ∏ i : Fin m, ∏ j : Fin n, X a i j\n\n/-- The right-hand product `∏_{i=1}^m ∏_{j=1}^n Y_{i,j}`. -/\ndef RHS {m n : ℕ} (a : Fin m → Fin n → ℝ) : ℝ :=\n ∏ i : Fin m, ∏ j : Fin n, Y a i j\n\n/-- The complete proposition stated by the problem.\n\nFor every pair of positive integers `m` and `n`, and every non-negative real\nmatrix `a` whose rows and columns are non-increasing, the product of the\n`X_{i,j}` over all `i,j` is at least the product of the `Y_{i,j}` over all\n`i,j`. -/\ndef Target : Prop :=\n ∀ (m n : ℕ), 0 < m → 0 < n →\n ∀ a : Fin m → Fin n → ℝ, Admissible a → LHS a ≥ RHS a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "57195bd2-564d-5590-ae02-634fbf2da14e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fb67cbc96499197619fcef0a40674a9b5c5c9514855a49df9eeace83c2017247", "task_path": "tasks/nmp3_57195bd2-564d-5590-ae02-634fbf2da14e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "57195bd2-564d-5590-ae02-634fbf2da14e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_574a5b06-799e-5131-9031-4d422f53b284", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $f,g,h:\\mathbb{R}\\to\\mathbb{R}$ satisfy \n-- \\[\n-- f(xy+g(x))=x\\,f(y)+h(x)\\qquad\\text{for all real }x,y.\n-- \\] \n-- Prove that $f$ is a linear function; i.e. there exist constants $a,b\\in\\mathbb{R}$ such that $f(x)=ax+b$ for every $x\\in\\mathbb{R}.$\nimport Mathlib\n\n/-!\n# Formalization of the functional equation problem\n\nThe statement concerns real-valued functions on the real line and asks whether\nthe first function in a solution of the displayed functional equation must be\naffine.\n-/\n\nnamespace Problem\n\n/-- The functional equation\n`f (x * y + g x) = x * f y + h x` for all real `x` and `y`. -/\ndef Admissible (f g h : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x * y + g x) = x * f y + h x\n\n/-- A real-valued function is affine when it has the form `x ↦ a * x + b`. -/\ndef IsAffine (f : ℝ → ℝ) : Prop :=\n ∃ a b : ℝ, ∀ x : ℝ, f x = a * x + b\n\n/-- The asserted problem: every triple of real-valued functions satisfying the\nfunctional equation has an affine first component. -/\ndef Target : Prop :=\n ∀ f g h : ℝ → ℝ, Admissible f g h → IsAffine f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "574a5b06-799e-5131-9031-4d422f53b284", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d9a018cb39f096160318033a61490d2bf96cc8e93f1a3a8b1ed1494495e12c3a", "task_path": "tasks/nmp3_574a5b06-799e-5131-9031-4d422f53b284", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "574a5b06-799e-5131-9031-4d422f53b284", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_578b366d-88dd-5cba-88dd-7e25e9ccbc6d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of triangle $ABC$ and let $S$ be its area. Prove that for any positive integer $n$,\n-- \\[\n-- a^{2n}+b^{2n}+c^{2n}\\;\\ge\\;3\\left(\\frac{4}{\\sqrt3}\\,S\\right)^{n}+(b-c)^{2n}+(c-a)^{2n}+(a-b)^{2n}\\, .\n-- \\]\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formalization of a triangle power inequality\n\nThe original problem concerns a (nondegenerate) triangle `ABC` with side lengths\n`a`, `b`, `c` and area `S`, and asserts a power inequality for every positive\ninteger `n`.\n\nWe represent the plane as `EuclideanSpace ℝ (Fin 2)`. The area is twice the\nusual signed area of the parallelogram spanned by `B - A` and `C - A`, in\nabsolute value.\n-/\n\nnamespace Problem\n\n/-- The area of the triangle with vertices `A`, `B`, and `C` in the Euclidean plane. -/\nnoncomputable def triangleArea\n (A B C : EuclideanSpace ℝ (Fin 2)) : ℝ :=\n |(B 0 - A 0) * (C 1 - A 1) - (B 1 - A 1) * (C 0 - A 0)| / 2\n\n/--\nThe triangle power inequality: for every nondegenerate triangle `ABC` in the\nEuclidean plane, with side lengths `a = |BC|`, `b = |CA|`, `c = |AB|` and area\n`S`, and for every positive integer `n`, the claimed inequality holds.\n-/\ndef Target : Prop :=\n ∀ (A B C : EuclideanSpace ℝ (Fin 2)),\n 0 < triangleArea A B C →\n ∀ n : ℕ, 0 < n →\n let a : ℝ := dist B C\n let b : ℝ := dist C A\n let c : ℝ := dist A B\n let S : ℝ := triangleArea A B C\n a ^ (2 * n) + b ^ (2 * n) + c ^ (2 * n) ≥\n 3 * ((4 / Real.sqrt 3) * S) ^ n +\n (b - c) ^ (2 * n) + (c - a) ^ (2 * n) + (a - b) ^ (2 * n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "578b366d-88dd-5cba-88dd-7e25e9ccbc6d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "693097007880dbb597f9d1e1e0f7786f6af2ab988ac4681867d6ac7c87f1acde", "task_path": "tasks/nmp3_578b366d-88dd-5cba-88dd-7e25e9ccbc6d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "578b366d-88dd-5cba-88dd-7e25e9ccbc6d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_57b09750-46d2-5b91-8698-9ef75772b265", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(n\\ge 3\\) be an integer. Prove that there exists a set \\(S\\) of \\(2n\\) distinct positive integers such that for every integer \\(m\\) with \\(2\\le m\\le n\\) the set \\(S\\) can be partitioned into two subsets of equal sum, one of which contains exactly \\(m\\) elements.\nimport Mathlib\n\nnamespace Problem\n\n/-- Two finite subsets `A` and `B` form a partition of a finite set `S` and have\nequal sums when their elements are added as natural numbers. -/\ndef EqualSumPartition (S A B : Finset ℕ) : Prop :=\n A ∪ B = S ∧\n A ∩ B = ∅ ∧\n A.sum (fun x : ℕ => x) = B.sum (fun x : ℕ => x)\n\n/-- An admissible set for a given integer `n`: it has exactly `2n` distinct\nexplicitly represented positive integers, and for every integer `m` in the\ninterval `[2, n]` it admits an equal-sum partition with one side of size `m`. -/\ndef Admissible (n : ℤ) (S : Finset ℕ) : Prop :=\n (S.card : ℤ) = 2 * n ∧\n (∀ x : ℕ, x ∈ S → 0 < x) ∧\n (∀ m : ℤ, 2 ≤ m → m ≤ n →\n ∃ A B : Finset ℕ,\n EqualSumPartition S A B ∧ (A.card : ℤ) = m)\n\n/-- The assertion of the problem: for every integer `n ≥ 3`, there exists a\nfinite set of `2n` distinct positive integers such that, for every integer `m`\nwith `2 ≤ m ≤ n`, the set has an equal-sum partition in which one part has\nexactly `m` elements. -/\ndef Target : Prop :=\n ∀ n : ℤ, 3 ≤ n →\n ∃ S : Finset ℕ, Admissible n S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "57b09750-46d2-5b91-8698-9ef75772b265", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "aa01b5ab2b2accfc9fd153786f3f65f28210ceffc9e5f393e95d007b2a35c2b9", "task_path": "tasks/nmp3_57b09750-46d2-5b91-8698-9ef75772b265", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "57b09750-46d2-5b91-8698-9ef75772b265", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_57b65fb1-d4e3-508f-832e-0a836fda076c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be nonnegative real numbers such that $(a+b)(b+c)(c+a)=8$. Prove that \n-- \\[\n-- \\sqrt a+\\sqrt b+\\sqrt c \\ge ab+bc+ca.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the nonnegative-real inequality problem\n\nThe source problem asks us to prove, for all nonnegative real numbers `a`, `b`, and `c`\nsatisfying `(a + b) * (b + c) * (c + a) = 8`, that\n`Real.sqrt a + Real.sqrt b + Real.sqrt c ≥ a * b + b * c + c * a`.\n\nThis file states the unproved assertion as a proposition-valued definition.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real numbers from the problem:\nthey are all nonnegative and satisfy the product constraint. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ (a + b) * (b + c) * (c + a) = 8\n\n/-- The asserted inequality, for arbitrary real inputs. The square roots are the usual\n(principal) real square roots. -/\ndef Inequality (a b c : ℝ) : Prop :=\n Real.sqrt a + Real.sqrt b + Real.sqrt c ≥ a * b + b * c + c * a\n\n/-- The complete statement to be proved: for every triple of nonnegative real numbers\nsatisfying `(a + b)(b + c)(c + a) = 8`, the square-root sum is at least the sum of\nthe pairwise products. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "57b65fb1-d4e3-508f-832e-0a836fda076c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f70855409402b399d11b6099ace5f3e3ec17de23b848ef2028103adaba745b19", "task_path": "tasks/nmp3_57b65fb1-d4e3-508f-832e-0a836fda076c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "57b65fb1-d4e3-508f-832e-0a836fda076c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_57ec1e74-8343-5988-91a4-73db67099f6e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that $abc=1$. Prove that \n-- $$\\sum_{\\text{cyc}}\\frac{a\\sqrt{b+c}}{b+c+1}\\ge\\sqrt2.$$\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\n/-!\n# Formalization target: a cyclic radical inequality\n\nThe source problem asks, for positive real `a`, `b`, and `c` with `a * b * c = 1`,\nto prove the cyclic sum inequality\n`a * sqrt (b + c) / (b + c + 1) + ... ≥ sqrt 2`.\n\nThis file states the assertion as a `Prop`-valued definition. It does not\nprovide a proof.\n-/\n\nnamespace Problem\n\n/-- The three-term cyclic sum appearing in the source statement.\n\nThe cyclic order used is `(a,b,c)`, `(b,c,a)`, `(c,a,b)`. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n a * Real.sqrt (b + c) / (b + c + 1) +\n b * Real.sqrt (c + a) / (c + a + 1) +\n c * Real.sqrt (a + b) / (a + b + 1)\n\n/-- The admissibility conditions on the real parameters in the source problem:\n`a > 0`, `b > 0`, `c > 0`, and `a * b * c = 1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The full universally quantified inequality asserted by the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Real.sqrt 2 ≤ CyclicSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "57ec1e74-8343-5988-91a4-73db67099f6e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "22f15b533c48f0ed26a63635cdef804a3f0b5087de5335f95e54b3543cd83323", "task_path": "tasks/nmp3_57ec1e74-8343-5988-91a4-73db67099f6e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "57ec1e74-8343-5988-91a4-73db67099f6e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5800c31a-28d7-5e37-89b7-62b558464365", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots ,a_{48}$ be natural numbers whose total product $a_1a_2\\cdots a_{48}$ contains exactly $10$ distinct prime divisors. Prove that there exist four (distinct) indices $i,j,k,\\ell$ such that $a_i\\,a_j\\,a_k\\,a_\\ell$ is a perfect square.\nimport Mathlib\n\n/-!\n# Formal statement for a combinatorial number theory problem\n\nThe original problem asks: if 48 natural numbers have a total product with\nexactly 10 distinct prime divisors, then some four of the numbers, with\ndistinct indices, have a square product.\n-/\n\nnamespace Problem\n\n/-- The total product of a sequence of 48 natural numbers. -/\ndef totalProduct (a : Fin 48 → ℕ) : ℕ :=\n ∏ i : Fin 48, a i\n\n/-- `n` has exactly `k` distinct prime divisors.\n\nThe witness `s` is a finite set whose elements are precisely the primes that\ndivide `n`. In particular, multiplicities are ignored. This formulation also\nmakes explicit that for `n = 0` there is no finite set containing every prime\ndivisor, since every prime divides zero. -/\ndef HasExactlyNDistinctPrimeDivisors (n k : ℕ) : Prop :=\n ∃ s : Finset ℕ, s.card = k ∧ ∀ p : ℕ, p ∈ s ↔ Nat.Prime p ∧ p ∣ n\n\n/-- `n` is a perfect square of a natural number. -/\ndef IsPerfectSquare (n : ℕ) : Prop :=\n ∃ m : ℕ, n = m * m\n\n/-- There are four pairwise distinct indices whose corresponding entries have\na perfect-square product. -/\ndef HasFourDistinctIndicesWithSquareProduct (a : Fin 48 → ℕ) : Prop :=\n ∃ i j k l : Fin 48,\n i ≠ j ∧ i ≠ k ∧ i ≠ l ∧ j ≠ k ∧ j ≠ l ∧ k ≠ l ∧\n IsPerfectSquare (a i * a j * a k * a l)\n\n/-- The assertion to be proved: for every sequence of 48 natural numbers whose\ntotal product has exactly 10 distinct prime divisors, four pairwise distinct\nentries have a product which is a perfect square. -/\ndef Target : Prop :=\n ∀ a : Fin 48 → ℕ,\n HasExactlyNDistinctPrimeDivisors (totalProduct a) 10 →\n HasFourDistinctIndicesWithSquareProduct a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5800c31a-28d7-5e37-89b7-62b558464365", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8dab758999f875c447fdba2153d16b9086a083ec3ddedfce3e592f1f2ceab4a8", "task_path": "tasks/nmp3_5800c31a-28d7-5e37-89b7-62b558464365", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5800c31a-28d7-5e37-89b7-62b558464365", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_581377c6-0d20-5129-ba99-f219c094918f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P(x)\\in\\mathbb Z[x]$ be a polynomial with integer coefficients. For each odd integer $2i-1$ with $i=1,2,\\dots,512$, define $r(2i-1)$ to be the (non‑negative) remainder when $P(2i-1)$ is divided by $1024$; i.e. $0\\le r(2i-1)<1024$ and $P(2i-1)\\equiv r(2i-1)\\pmod{1024}$. \n-- The sequence \n-- \\[\n-- \\bigl(r(1),\\,r(3),\\,\\dots,\\,r(1023)\\bigr)\n-- \\]\n-- is called the **remainder sequence** of $P(x)$. \n-- A remainder sequence is said to be **complete** if it is a permutation of the odd residues modulo $1024$, namely $(1,3,5,\\dots,1023)$. \n-- \n-- Prove that there are at most $2^{35}$ distinct complete remainder sequences.\nimport Mathlib\n\n/-!\n# Complete remainder sequences modulo `1024`\n\nThis file formalizes the statement of the problem. It deliberately does not\nprove `Problem.Target`: `Problem.Target` is a proposition recording the target\nclaim itself.\n\nThe polynomial `P` is an element of `Polynomial ℤ`, and it is evaluated at the\nodd integers `1, 3, ..., 1023`. A sequence is indexed by `Fin 512`, so its\nentry at zero-based index `i` is the remainder of `P (2*i + 1)` modulo `1024`.\n-/\n\nnamespace Problem\n\n/-- The non-negative remainder of an integer upon division by `1024`,\nrepresented as an element of `Fin 1024`.\n\n`Int.emod` is Lean's Euclidean remainder for integers. For the positive\ndivisor `1024`, `Int.emod_nonneg` and `Int.emod_lt_of_pos` show that the\ninteger remainder lies in `[0, 1024)`, so taking its `Nat` value gives a\nwell-defined element of `Fin 1024`. -/\ndef nonnegativeRemainder1024 (z : ℤ) : Fin 1024 :=\n ⟨(z % 1024).toNat, by\n rw [Int.toNat_lt (Int.emod_nonneg z (by norm_num : (1024 : ℤ) ≠ 0))]\n exact Int.emod_lt_of_pos z (by norm_num : (0 : ℤ) < 1024)⟩\n\n/-- Characterization of an integer `r` as the non-negative remainder of `z`\nupon division by `1024`, using exactly the conditions in the source:\n`0 ≤ r`, `r < 1024`, and `z ≡ r (mod 1024)`. -/\ndef IsNonnegativeRemainder1024 (z r : ℤ) : Prop :=\n 0 ≤ r ∧ r < 1024 ∧ z ≡ r [ZMOD (1024 : ℤ)]\n\n/-- The chosen integer remainder satisfies the source's remainder conditions. -/\ntheorem nonnegativeRemainder1024_isRemainder (z : ℤ) :\n IsNonnegativeRemainder1024 z ((nonnegativeRemainder1024 z).val : ℤ) := by\n refine ⟨by positivity, by exact_mod_cast (nonnegativeRemainder1024 z).isLt, ?_⟩\n rw [Int.ModEq]\n simp only [nonnegativeRemainder1024, Fin.val_mk]\n have hnonneg : 0 ≤ z % 1024 :=\n Int.emod_nonneg z (by norm_num : (1024 : ℤ) ≠ 0)\n have hlt : z % 1024 < 1024 :=\n Int.emod_lt_of_pos z (by norm_num : (0 : ℤ) < 1024)\n rw [Int.toNat_of_nonneg hnonneg]\n exact (Int.emod_eq_of_lt hnonneg hlt).symm\n\n/-- The non-negative remainder in the interval `[0, 1024)` is unique. -/\ntheorem nonnegativeRemainder1024_unique (z r : ℤ)\n (hr : IsNonnegativeRemainder1024 z r) :\n r = ((nonnegativeRemainder1024 z).val : ℤ) := by\n rcases hr with ⟨hr0, hrlt, hrz⟩\n rcases nonnegativeRemainder1024_isRemainder z with ⟨hq0, hqlt, hqz⟩\n have hqr : r ≡ ((nonnegativeRemainder1024 z).val : ℤ) [ZMOD (1024 : ℤ)] :=\n hrz.symm.trans hqz\n have heq := Int.ModEq.eq hqr\n rw [Int.emod_eq_of_lt hr0 hrlt, Int.emod_eq_of_lt hq0 hqlt] at heq\n exact heq\n\n/-- The odd input at zero-based position `i : Fin 512`: `2*i + 1`.\n\nFor `i.val = 0, ..., 511`, this is `1, 3, ..., 1023`, the same list as\n`2*i - 1` for the source's one-based indices `i = 1, ..., 512`. -/\ndef oddInput (i : Fin 512) : ℤ :=\n 2 * (i.val : ℤ) + 1\n\n/-- The remainder sequence of `P : ℤ[x]`: its `i`-th entry is the\nnon-negative remainder of `P (2*i + 1)` modulo `1024`. -/\ndef remainderSequence (P : Polynomial ℤ) : Fin 512 → Fin 1024 :=\n fun i => nonnegativeRemainder1024 (P.eval (oddInput i))\n\n/-- Every entry of a remainder sequence satisfies the source remainder\nconditions (`0 ≤ r < 1024` and the congruence modulo `1024`). -/\ntheorem remainderSequence_isRemainder (P : Polynomial ℤ) (i : Fin 512) :\n IsNonnegativeRemainder1024 (P.eval (oddInput i))\n ((remainderSequence P i).val : ℤ) := by\n simpa [remainderSequence] using\n nonnegativeRemainder1024_isRemainder (P.eval (oddInput i))\n\n/-- The odd residue `2*i + 1` at position `i : Fin 512`.\n\nAs `i` runs from `0` to `511`, these are exactly `(1, 3, ..., 1023)`. -/\ndef oddResidueAt (i : Fin 512) : Fin 1024 :=\n ⟨2 * i.val + 1, by omega⟩\n\n/-- The set `{1, 3, 5, ..., 1023}` of odd residues modulo `1024`. -/\ndef oddResiduesModulo1024 : Set (Fin 1024) :=\n Set.range oddResidueAt\n\n/-- The enumeration `oddResidueAt` has no repetitions. -/\ntheorem oddResidueAt_injective : Function.Injective oddResidueAt := by\n intro i j h\n simp only [oddResidueAt, Fin.mk.injEq] at h\n apply Fin.ext\n omega\n\n/-- Membership in `oddResiduesModulo1024` is exactly being an odd residue. -/\ntheorem mem_oddResiduesModulo1024_iff (r : Fin 1024) :\n r ∈ oddResiduesModulo1024 ↔ Odd r.val := by\n constructor\n · rintro ⟨i, rfl⟩\n exact ⟨i.val, rfl⟩\n · rintro ⟨k, hk⟩\n have hklt : k < 512 := by omega\n refine ⟨⟨k, hklt⟩, ?_⟩\n ext\n simp [oddResidueAt, hk]\n\n/-- A sequence is complete when it is a permutation of the fixed odd-residue\nsequence `(1, 3, ..., 1023)`: there is a permutation `e` of the `512`\npositions such that the `i`-th entry is `oddResidueAt (e i)`. -/\ndef IsCompleteRemainderSequence (s : Fin 512 → Fin 1024) : Prop :=\n ∃ e : Equiv.Perm (Fin 512), s = fun i => oddResidueAt (e i)\n\n/-- The permutation formulation of completeness is equivalent to saying that\nthe range of the sequence is exactly the set of odd residues. -/\ntheorem isCompleteRemainderSequence_iff_range (s : Fin 512 → Fin 1024) :\n IsCompleteRemainderSequence s ↔ Set.range s = oddResiduesModulo1024 := by\n constructor\n · rintro ⟨e, rfl⟩\n ext r\n constructor\n · rintro ⟨i, rfl⟩\n exact ⟨e i, rfl⟩\n · rintro ⟨j, rfl⟩\n obtain ⟨i, rfl⟩ := e.surjective j\n exact ⟨i, rfl⟩\n · intro hrange\n classical\n have hmem : ∀ i : Fin 512, ∃ j : Fin 512, oddResidueAt j = s i := by\n intro i\n have : s i ∈ oddResiduesModulo1024 := by\n rw [← hrange]\n exact ⟨i, rfl⟩\n simpa [oddResiduesModulo1024] using this\n let eFun : Fin 512 → Fin 512 := fun i => Classical.choose (hmem i)\n have heFun_spec : ∀ i : Fin 512, oddResidueAt (eFun i) = s i := by\n intro i\n exact Classical.choose_spec (hmem i)\n have heFun_surj : Function.Surjective eFun := by\n intro j\n have hj : oddResidueAt j ∈ Set.range s := by\n rw [hrange]\n exact ⟨j, rfl⟩\n rcases hj with ⟨i, hi⟩\n refine ⟨i, ?_⟩\n apply oddResidueAt_injective\n rw [heFun_spec i, hi]\n have heFun_bij : Function.Bijective eFun :=\n ⟨(Finite.injective_iff_surjective).mpr heFun_surj, heFun_surj⟩\n let e : Fin 512 ≃ Fin 512 := Equiv.ofBijective eFun heFun_bij\n refine ⟨e, ?_⟩\n funext i\n exact (heFun_spec i).symm\n\n/-- The set of all distinct remainder sequences obtainable from\ninteger-coefficient polynomials. Taking `Set.range` removes duplicates\ncaused by different polynomials giving the same sequence. -/\ndef allRemainderSequences : Set (Fin 512 → Fin 1024) :=\n Set.range remainderSequence\n\n/-- The set of all distinct complete remainder sequences: those sequences\nthat both arise from some `P : ℤ[x]` and are complete. -/\ndef completeRemainderSequenceSet : Set (Fin 512 → Fin 1024) :=\n allRemainderSequences ∩ {s : Fin 512 → Fin 1024 |\n IsCompleteRemainderSequence s}\n\n/-- Membership in the set of complete remainder sequences, written out in\nterms of the polynomial quantifier and the completeness predicate. -/\ntheorem mem_completeRemainderSequenceSet_iff\n (s : Fin 512 → Fin 1024) :\n s ∈ completeRemainderSequenceSet ↔\n (∃ P : Polynomial ℤ, s = remainderSequence P) ∧\n IsCompleteRemainderSequence s := by\n simp only [completeRemainderSequenceSet, allRemainderSequences,\n Set.mem_inter_iff, Set.mem_range, Set.mem_ofPred_eq]\n constructor\n · rintro ⟨⟨P, hP⟩, hc⟩\n exact ⟨⟨P, hP.symm⟩, hc⟩\n · rintro ⟨⟨P, hP⟩, hc⟩\n exact ⟨⟨P, hP.symm⟩, hc⟩\n\n/-- There are at most `N` distinct complete remainder sequences. The\nfiniteness conjunct makes the cardinality bound unambiguous; it is part of\nthe \"at most\" assertion, not an extra assumption. -/\ndef AtMostDistinctCompleteRemainderSequences (N : ℕ) : Prop :=\n completeRemainderSequenceSet.Finite ∧\n completeRemainderSequenceSet.ncard ≤ N\n\n/-- The target proposition: there are at most `2^35` distinct complete\nremainder sequences. -/\ndef Target : Prop :=\n AtMostDistinctCompleteRemainderSequences (2 ^ 35)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "581377c6-0d20-5129-ba99-f219c094918f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "408a1e4716ff8b1bb17ac5285c68e019cec160e8c7c5b01f8226203e8470e004", "task_path": "tasks/nmp3_581377c6-0d20-5129-ba99-f219c094918f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "581377c6-0d20-5129-ba99-f219c094918f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5833d96e-ce6b-502b-aca0-a7ca64015881", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(K\\subset\\mathbb R^2\\) be a compact set. Assume that for every three points \\(a,b,c\\in K\\) at least one pair is at Chebyshev distance (the \\(\\infty\\)-norm) less than 1, i.e. \n-- \\[\n-- \\min\\bigl(\\,\\|a-b\\|_\\infty,\\;\\|a-c\\|_\\infty,\\;\\|b-c\\|_\\infty\\,\\bigr)<1,\n-- \\qquad\\text{where }\\|x\\|_\\infty=\\max(|x_1|,|x_2|).\n-- \\] \n-- Prove that the Lebesgue measure (area) \\(\\lambda(K)\\) satisfies \\(\\lambda(K)\\le 2\\).\nimport Mathlib\n\n/-!\nFormalization of the statement in `problem.md`.\n\nA point of the plane is represented as an element of `ℝ × ℝ`, with its two\ncoordinates written as `x.1` and `x.2`. The Chebyshev (supremum) norm is\ndefined explicitly by `max (|x.1|) (|x.2|)`, and Lebesgue area is\n`MeasureTheory.volume` on the product `ℝ × ℝ`.\n-/\n\nnamespace Problem\n\n/-- The Chebyshev (supremum) norm on the plane: `‖x‖∞ = max (|x₁|) (|x₂|)`. -/\ndef chebyshevNorm (x : ℝ × ℝ) : ℝ := max |x.1| |x.2|\n\n/-- The Chebyshev distance between two points of the plane. -/\ndef chebyshevDist (x y : ℝ × ℝ) : ℝ := chebyshevNorm (x - y)\n\n/--\n`ThreePointCondition K` says that among every three points `a`, `b`, `c` of\n`K`, at least one of the three pairwise Chebyshev distances is strictly less\nthan `1`, equivalently the minimum of those distances is strictly less than\n`1`.\n-/\ndef ThreePointCondition (K : Set (ℝ × ℝ)) : Prop :=\n ∀ a : ℝ × ℝ, a ∈ K → ∀ b : ℝ × ℝ, b ∈ K → ∀ c : ℝ × ℝ, c ∈ K →\n min (chebyshevDist a b) (min (chebyshevDist a c) (chebyshevDist b c)) < 1\n\n/--\nThe target assertion: every compact `K ⊆ ℝ²` satisfying the three-point\nChebyshev condition has Lebesgue area (plane measure) at most `2`.\n-/\ndef Target : Prop :=\n ∀ K : Set (ℝ × ℝ),\n IsCompact K →\n ThreePointCondition K →\n MeasureTheory.volume K ≤ ENNReal.ofReal 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5833d96e-ce6b-502b-aca0-a7ca64015881", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ceae94e8c536f47d6ee82f7caf4839c1308e9a0fcb1bd945b187c1944540b8c3", "task_path": "tasks/nmp3_5833d96e-ce6b-502b-aca0-a7ca64015881", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5833d96e-ce6b-502b-aca0-a7ca64015881", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_58780328-4467-5360-99da-2ecfa054189e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f,g:(0,\\infty)\\to(0,\\infty)$ such that for all $x,y>0$\n-- \\[\n-- f(x+g(y))=f(x+y)+g(y)\\qquad\\text{and}\\qquad g(x+f(y))=g(x+y)+f(y).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the two-function functional equation problem\n\nThe original problem asks for all functions `f g : (0,∞) → (0,∞)` satisfying\n\n`f (x + g y) = f (x + y) + g y` and\n`g (x + f y) = g (x + y) + f y\nfor all `x y > 0`.\n\nThe positive domain is represented by the subtype `Problem.Pos`. Since the\ncodomain is also the positive reals, the functions are bundled as maps\n`Problem.Pos → Problem.Pos`. The candidate answer below is the complete\ntwo-parameter linear family `f x = a x`, `g x = b x` with `1 < a`, `1 < b`\nand `a * b = a + b` (equivalently `(a - 1) * (b - 1) = 1`).\n-/\n\nnamespace Problem\n\n/-- The positive real domain `(0, ∞)`, used as the domain and codomain. -/\nabbrev Pos : Type := {x : ℝ // 0 < x}\n\n/-- The original admissibility conditions for a pair of positive functions.\n\nBoth equations are required for all positive `x` and `y`. The arguments\n`x + g y`, `x + y`, `x + f y` are positive, and their positivity proofs are\nsupplied explicitly when constructing the corresponding elements of `Pos`.\nThe equalities are stated on the underlying real values. -/\ndef Admissible (f g : Pos → Pos) : Prop :=\n ∀ x y : Pos,\n (f ⟨x.1 + (g y).1, add_pos x.2 (g y).2⟩).1 =\n (f ⟨x.1 + y.1, add_pos x.2 y.2⟩).1 + (g y).1 ∧\n (g ⟨x.1 + (f y).1, add_pos x.2 (f y).2⟩).1 =\n (g ⟨x.1 + y.1, add_pos x.2 y.2⟩).1 + (f y).1\n\n/-- The proposed complete answer family: the pair is linear on the positive\nreals, with multipliers `a` and `b` satisfying `a * b = a + b`. The\nconditions `1 < a` and `1 < b` encode the positivity and the fact that the\nmultipliers are greater than one. -/\ndef Candidate (f g : Pos → Pos) : Prop :=\n ∃ a b : ℝ,\n 1 < a ∧ 1 < b ∧ a * b = a + b ∧\n (∀ x : Pos, (f x).1 = a * x.1) ∧\n (∀ y : Pos, (g y).1 = b * y.1)\n\n/-- For a proposed pair, correctness of the classification means that the\noriginal admissibility predicate holds exactly when the candidate family\npredicate holds. Both directions are included. -/\ndef CompleteAnswer (f g : Pos → Pos) : Prop :=\n Admissible f g ↔ Candidate f g\n\n/-- A predicate on function pairs is a complete answer precisely when it is\nsound (every pair it lists is admissible) and complete (every admissible pair\nis listed). This is the answer-correctness schema for the original \"find all\"\nrequest, parameterized by the proposed answer predicate. -/\ndef IsCompleteAnswer (Answer : (Pos → Pos) → (Pos → Pos) → Prop) : Prop :=\n (∀ f g : Pos → Pos, Answer f g → Admissible f g) ∧\n (∀ f g : Pos → Pos, Admissible f g → Answer f g)\n\n/-- The complete \"find all\" statement: the concrete linear candidate predicate\nis a complete answer, in both the soundness and completeness directions. -/\ndef Target : Prop :=\n IsCompleteAnswer Candidate\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "58780328-4467-5360-99da-2ecfa054189e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c08ffc45586f15ce3079a0a8aca8a03be8c56f9503cb7f0198946baa9a32cc86", "task_path": "tasks/nmp3_58780328-4467-5360-99da-2ecfa054189e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "58780328-4467-5360-99da-2ecfa054189e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_587c7b56-5ccd-50f6-814e-aa72e5211ed2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be non‑negative real numbers satisfying $a\\ge b\\ge c\\ge d$ and $a^4+b^4+c^4+d^4=4$. Prove that \n-- $$1-\\sqrt{abcd}\\ge\\frac12\\,(ac-bd)^2.$$\nimport Mathlib\n\n/-!\n# Formal statement for the nonnegative real inequality\n\nThis file records the proposition from the problem, but does not prove it.\n-/\n\nnamespace Problem\n\n/-- All four variables are nonnegative real numbers. The inequalities are\nnon-strict, so zero is allowed. -/\ndef NonnegativeQuadruple (a b c d : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 ≤ d\n\n/-- The variables occur in non-increasing order. -/\ndef OrderedQuadruple (a b c d : ℝ) : Prop :=\n a ≥ b ∧ b ≥ c ∧ c ≥ d\n\n/-- The sum of the fourth powers is exactly four. -/\ndef FourthPowerSumEqFour (a b c d : ℝ) : Prop :=\n a ^ 4 + b ^ 4 + c ^ 4 + d ^ 4 = 4\n\n/-- The full hypothesis predicate from the problem. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n NonnegativeQuadruple a b c d ∧\n OrderedQuadruple a b c d ∧\n FourthPowerSumEqFour a b c d\n\n/-- The asserted inequality for an admissible quadruple. -/\ndef Conclusion (a b c d : ℝ) : Prop :=\n 1 - Real.sqrt (a * b * c * d) ≥\n (1 / 2 : ℝ) * (a * c - b * d) ^ 2\n\n/-- The complete universally quantified assertion to be proved. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Conclusion a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "587c7b56-5ccd-50f6-814e-aa72e5211ed2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ed88d8cb290fad45f18fdbbd329028883bc2dae200fc4142f2b9bd293273d460", "task_path": "tasks/nmp3_587c7b56-5ccd-50f6-814e-aa72e5211ed2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "587c7b56-5ccd-50f6-814e-aa72e5211ed2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5884b20e-df6d-5b8e-bf66-665f6b45ce59", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c>0$ prove that \n-- \\[\n-- \\frac{2a}{a+b}+\\frac{a+b}{a+c}+\\frac{6a+2c}{3b+c}+\\frac{4a+3b+c}{b+c}\\ge\\frac{32a}{2a+b+c}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (2 * a) / (a + b) +\n (a + b) / (a + c) +\n (6 * a + 2 * c) / (3 * b + c) +\n (4 * a + 3 * b + c) / (b + c)\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (32 * a) / (2 * a + b + c)\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`,\nthe stated non-strict rational inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5884b20e-df6d-5b8e-bf66-665f6b45ce59", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "db0cca7f572ece336144fe79e288930d7922c553521d84971d63fb172f0c63bc", "task_path": "tasks/nmp3_5884b20e-df6d-5b8e-bf66-665f6b45ce59", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5884b20e-df6d-5b8e-bf66-665f6b45ce59", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_58a0e0ff-77e0-5d08-a8a6-85efc9873bb7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge0$ with $x+y+z=1$. Prove that \n-- \\[\n-- \\sqrt{x+y^{2}}+\\sqrt{y+z^{2}}+\\sqrt{z+x^{2}}\\ge 2.\n-- \\]\nmodule\n\npublic import Mathlib.Analysis.Real.Sqrt\n\n@[expose] public section\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The three variables are all nonnegative. -/\ndef Nonnegative (x y z : ℝ) : Prop :=\n 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z\n\n/-- The three variables have sum one. -/\ndef SumToOne (x y z : ℝ) : Prop :=\n x + y + z = 1\n\n/-- The left-hand side of the inequality in the problem. -/\ndef LHS (x y z : ℝ) : ℝ :=\n Real.sqrt (x + y ^ (2 : ℕ)) + Real.sqrt (y + z ^ (2 : ℕ)) +\n Real.sqrt (z + x ^ (2 : ℕ))\n\n/-- The complete assertion to prove: for all real `x`, `y`, and `z`, if each is\nnonnegative and their sum is one, then the stated sum of square roots is at least\ntwo. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n Nonnegative x y z → SumToOne x y z → LHS x y z ≥ (2 : ℝ)\n\nend\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "58a0e0ff-77e0-5d08-a8a6-85efc9873bb7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a28909af0c9abae16e671fa9c0a197efbeea56268cdfdce10229e4da8e6927cf", "task_path": "tasks/nmp3_58a0e0ff-77e0-5d08-a8a6-85efc9873bb7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "58a0e0ff-77e0-5d08-a8a6-85efc9873bb7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_58f3c5bd-c3c1-517d-a340-7ba6d82c8dd8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P(x)=x^4-4x^3+7x^2-8x+16$. Prove that $P(a)\\,P(b)\\,P(c)\\ge 144\\,(ab+bc+ca)$ for any real numbers $a,b,c$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The polynomial appearing in the problem, regarded as a real-valued function. -/\ndef P (x : ℝ) : ℝ :=\n x ^ 4 - 4 * x ^ 3 + 7 * x ^ 2 - 8 * x + 16\n\n/-- For all real numbers `a`, `b`, and `c`,\n`P(a) P(b) P(c) ≥ 144 (ab + bc + ca)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, P a * P b * P c ≥ 144 * (a * b + b * c + c * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "58f3c5bd-c3c1-517d-a340-7ba6d82c8dd8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c4d65f43f2212ae35c09ad6b1db4ca556d6337ed003363e3cf07f79d1dd72e75", "task_path": "tasks/nmp3_58f3c5bd-c3c1-517d-a340-7ba6d82c8dd8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "58f3c5bd-c3c1-517d-a340-7ba6d82c8dd8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_59583401-116a-5ce4-bd76-ec5cb4f76b20", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 4$ be an integer. Suppose $a_1,a_2,\\dots,a_n$ are distinct positive integers each satisfying $a_i<2n$. Prove that there exists a non‑empty subset of $\\{a_1,\\dots,a_n\\}$ whose sum is divisible by $2n$.\nimport Mathlib\n\n/-!\n# Formalization of the nonempty zero-sum subsequence problem\n\nThe original problem asks, for an integer `n ≥ 4` and `n` distinct positive\nintegers `a_i < 2n`, for a proof that some nonempty subcollection has sum\ndivisible by `2n`.\n\nThe integer `n` is represented by a natural number, which is equivalent under\nthe explicit hypothesis `4 ≤ n` because `n` then indexes `a : Fin n → ℤ`.\nSubsets of the indexed family are represented by nonempty `Finset`s of\nindices. Injectivity of `a` makes this the same as a subset of the set of\nvalues `{a_1, ..., a_n}`.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The hypotheses on `n` and the indexed family `a`.\n\n`Fin n` indexes the entries `a_1, ..., a_n` (using zero-based indices).\nThe four conjuncts respectively encode `n ≥ 4`, positivity of every entry,\nthe strict upper bound `a_i < 2n`, and pairwise distinctness. -/\ndef IsAdmissible (n : ℕ) (a : Fin n → ℤ) : Prop :=\n (4 : ℕ) ≤ n ∧\n (∀ i : Fin n, (0 : ℤ) < a i) ∧\n (∀ i : Fin n, a i < 2 * (n : ℤ)) ∧\n Function.Injective a\n\n/-- There is a nonempty subset of the indexed entries whose sum is divisible\nby `2n`. A subset is represented by a nonempty finite set of indices; since\n`a` is injective under `IsAdmissible`, this corresponds exactly to a nonempty\nsubset of the set `{a_1, ..., a_n}`. -/\ndef HasNonemptySubsetWithSumDivisibleBy (n : ℕ) (a : Fin n → ℤ) : Prop :=\n ∃ s : Finset (Fin n),\n s.Nonempty ∧ (2 * (n : ℤ)) ∣ ∑ i ∈ s, a i\n\n/-- The complete assertion of the problem: for every integer `n ≥ 4` and\nevery admissible family of `n` distinct positive integers below `2n`, there\nis a nonempty subcollection whose sum is divisible by `2n`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (a : Fin n → ℤ),\n IsAdmissible n a → HasNonemptySubsetWithSumDivisibleBy n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59583401-116a-5ce4-bd76-ec5cb4f76b20", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4ee5138a0c6534e3e873965c44b1d0fd00b7883e3deb2a4790a9396e54edf41e", "task_path": "tasks/nmp3_59583401-116a-5ce4-bd76-ec5cb4f76b20", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59583401-116a-5ce4-bd76-ec5cb4f76b20", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_59606c62-0a59-58ed-904f-967e0c0dee8c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,x,y,z$ be positive numbers such that $a+x=b+y=c+z=1$. Prove that \n-- \\[\n-- \\bigl(abc+xyz\\bigr)\\Bigl(\\frac1{ay}+\\frac1{bz}+\\frac1{cx}\\Bigr)\\ge 3.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the problem\n\nLet `a, b, c, x, y, z` be positive real numbers satisfying\n`a + x = b + y = c + z = 1`. Prove that\n`(a*b*c + x*y*z) * (1/(a*y) + 1/(b*z) + 1/(c*x)) ≥ 3`.\n\nThis file only states the assertion; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for every six positive real numbers whose\npairwise sums `a + x`, `b + y`, and `c + z` all equal one, the indicated\nexpression is at least three. -/\ndef Target : Prop :=\n ∀ a b c x y z : ℝ,\n 0 < a → 0 < b → 0 < c →\n 0 < x → 0 < y → 0 < z →\n a + x = 1 → b + y = 1 → c + z = 1 →\n (a * b * c + x * y * z) *\n (1 / (a * y) + 1 / (b * z) + 1 / (c * x)) ≥ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59606c62-0a59-58ed-904f-967e0c0dee8c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "97a8ea598e82eea880e56c0e9ab882224ea53fadfa67e42563d35b0d0ff1f207", "task_path": "tasks/nmp3_59606c62-0a59-58ed-904f-967e0c0dee8c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59606c62-0a59-58ed-904f-967e0c0dee8c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_59bd984e-0040-547e-8799-288ab2e4c808", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{1}{a^{2}+bc}+\\frac{1}{b^{2}+ca}+\\frac{1}{c^{2}+ab}\\le \\frac{3\\,(a+b+c)^{2}}{2\\,(ab+bc+ca)^{2}}\\,,\n-- \\] \n-- with equality if and only if $a=b=c$.\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of a three-variable real inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, for the\ndisplayed reciprocal inequality together with its equality characterization.\nThis file records the statement only; it contains no proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n 1 / (a ^ 2 + b * c) + 1 / (b ^ 2 + c * a) + 1 / (c ^ 2 + a * b)\n\n/-- The right-hand side of the displayed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 3 * (a + b + c) ^ 2 / (2 * (a * b + b * c + c * a) ^ 2)\n\n/-- The non-strict inequality asserted in the source problem. -/\ndef inequalityHolds (a b c : ℝ) : Prop :=\n lhs a b c ≤ rhs a b c\n\n/-- Equality in the displayed inequality. -/\ndef equalityHolds (a b c : ℝ) : Prop :=\n lhs a b c = rhs a b c\n\n/-- The chain equality `a = b = c`, represented as pairwise equality. -/\ndef variablesEqual (a b c : ℝ) : Prop :=\n a = b ∧ b = c\n\n/-- The complete assertion of the source problem for positive real `a`, `b`, `c`:\nthe displayed inequality holds, and equality holds exactly when `a = b = c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n inequalityHolds a b c ∧ (equalityHolds a b c ↔ variablesEqual a b c)\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59bd984e-0040-547e-8799-288ab2e4c808", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "10abfc4a0725290aad6488b28d30651973d1a4135792806fd0a1743b964a2d04", "task_path": "tasks/nmp3_59bd984e-0040-547e-8799-288ab2e4c808", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59bd984e-0040-547e-8799-288ab2e4c808", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_59c2b1c2-15bb-5db8-ab4b-fb520948fbbb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\nu_2(k)$ denote the maximal non‑negative integer $t$ such that $2^t\\mid k$ for a nonzero integer $k$. \n-- Let $n\\ge2$ and let $a_1,a_2,\\dots,a_n$ be pairwise distinct integers. Prove that there exists an integer $x$, with $x\\neq a_i$ for all $i$, such that among the $n$ numbers \n-- \\[\n-- \\nu_2(x-a_1),\\;\\nu_2(x-a_2),\\;\\dots,\\;\\nu_2(x-a_n)\n-- \\]\n-- at least $n/4$ of them are odd and at least $n/4$ of them are even.\nimport Mathlib.NumberTheory.Padics.PadicVal.Basic\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement: odd and even 2-adic valuations\n\nThis module gives a Lean 4/Mathlib formalization of the problem statement. It declares the\nassertion as a proposition-valued definition; it does not prove the assertion.\n-/\n\nnamespace Problem\n\n/-- The function `ν₂` from the problem: for a nonzero integer `k`, `nu2 k` is the maximal\nnonnegative integer `t` such that `2 ^ t ∣ k`.\n\nMathlib's `padicValInt 2` has exactly this interpretation for nonzero integers (it is defined as\nthe multiplicity of the prime `2` in `k`). We define a problem-local name so that the statement\nbelow is independent of the particular Mathlib spelling of the p-adic valuation. -/\ndef nu2 (k : ℤ) : ℕ :=\n padicValInt 2 k\n\n/-- A predicate spelling out the defining property of `ν₂` on its intended domain: `t` is the\nmaximal nonnegative exponent such that `2 ^ t` divides `k`, where `k` is nonzero. -/\ndef IsNu2 (k : ℤ) (t : ℕ) : Prop :=\n k ≠ 0 ∧ (2 : ℤ) ^ t ∣ k ∧ ∀ s : ℕ, (2 : ℤ) ^ s ∣ k → s ≤ t\n\n/-- For every nonzero integer `k`, `nu2 k` satisfies the defining maximal-divisibility property\nof `ν₂`. -/\ntheorem nu2_isNu2 {k : ℤ} (hk : k ≠ 0) : IsNu2 k (nu2 k) := by\n refine ⟨hk, ?_, ?_⟩\n · simpa [nu2] using padicValInt_dvd (p := 2) k\n · intro s hs\n rcases (padicValInt_dvd_iff (p := 2) s k).mp hs with hzero | hle\n · exact False.elim (hk hzero)\n · simpa [nu2] using hle\n\n/-- The defining property of `ν₂` determines its value uniquely on the nonzero integers. -/\ntheorem isNu2_unique {k : ℤ} {t u : ℕ} (ht : IsNu2 k t) (hu : IsNu2 k u) : t = u := by\n exact le_antisymm (hu.2.2 t ht.2.1) (ht.2.2 u hu.2.1)\n\n/-- The number of indices `i : Fin n` for which `ν₂ (x - a i)` is odd. -/\ndef oddCount (n : ℕ) (a : Fin n → ℤ) (x : ℤ) : ℕ :=\n (Finset.univ.filter (fun i : Fin n => Odd (Problem.nu2 (x - a i)))).card\n\n/-- The number of indices `i : Fin n` for which `ν₂ (x - a i)` is even. -/\ndef evenCount (n : ℕ) (a : Fin n → ℤ) (x : ℤ) : ℕ :=\n (Finset.univ.filter (fun i : Fin n => Even (Problem.nu2 (x - a i)))).card\n\n/-- The admissibility predicate for a candidate integer `x`.\n\nIt says that `x` is different from every `a i`. Under that condition every difference\n`x - a i` is nonzero, so `Problem.nu2 (x - a i)` has its intended maximal-divisibility meaning.\nIt also requires that at least one quarter of the `n` valuations are odd and at least one\nquarter are even. The comparison with `n / 4` is made in the real numbers. -/\ndef Admissible (n : ℕ) (a : Fin n → ℤ) (x : ℤ) : Prop :=\n (∀ i : Fin n, x ≠ a i) ∧\n ((Problem.oddCount n a x : ℝ) ≥ (n : ℝ) / 4) ∧\n ((Problem.evenCount n a x : ℝ) ≥ (n : ℝ) / 4)\n\n/-- The full proposition stated by the problem.\n\nFor every natural number `n ≥ 2`, and for every pairwise distinct integer tuple\n`a : Fin n → ℤ`, there exists an integer `x` which is not equal to any `a i` and for which\nat least `n / 4` of the `n` values `ν₂ (x - a i)` are odd and at least `n / 4` are even. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (_hn : 2 ≤ n) (a : Fin n → ℤ) (_ha : Function.Injective a),\n ∃ x : ℤ, Problem.Admissible n a x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59c2b1c2-15bb-5db8-ab4b-fb520948fbbb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8a0e5fc1b0e39ec6f5f54844ba47337a04b36e8f688da4d95b628f41a2f83555", "task_path": "tasks/nmp3_59c2b1c2-15bb-5db8-ab4b-fb520948fbbb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59c2b1c2-15bb-5db8-ab4b-fb520948fbbb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_59c3e7ca-2b93-516e-9e64-f471c2aa8596", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- We consider a prism whose top and bottom faces are pentagons with vertices $A_1,A_2,A_3,A_4,A_5$ and $B_1,B_2,B_3,B_4,B_5$, respectively. Every edge of the two pentagonal faces (the ten edges $A_iA_{i+1}$ and $B_iB_{i+1}$, indices taken modulo $5$) and every segment $A_iB_j$ for $i,j\\in\\{1,\\dots,5\\}$ is colored either red or blue. Assume that for every triangle whose three sides are among these colored segments, the triangle contains at least one red side and at least one blue side (i.e., no triangle is monochromatic). Prove that all ten edges of the two pentagonal bases are colored with the same color.\nimport Mathlib.Data.Fin.Basic\n\nnamespace Problem\n\n/-- The ten vertices of the pentagonal prism. `PrismVertex.A i` is the\ntop vertex `A_i` and `PrismVertex.B i` is the bottom vertex `B_i`. Indices\nlive in `Fin 5`, so the cyclic successor of the last index is represented by\naddition in `Fin 5`. -/\ninductive PrismVertex : Type\n | A : Fin 5 → PrismVertex\n | B : Fin 5 → PrismVertex\nderiving DecidableEq, Repr\n\n/-- The two colors specified by the problem. -/\ninductive PrismColor : Type\n | red : PrismColor\n | blue : PrismColor\nderiving DecidableEq, Repr\n\n/-- The precisely 35 segments that the problem colors. `top i` is the\npentagon edge `A_i A_{i+1}`, `bottom i` is `B_i B_{i+1}`, and `cross i j`\nis the segment `A_i B_j`. The cyclic sum `i + 1` is taken in `Fin 5`. -/\ninductive PrismSegment : Type\n | top : Fin 5 → PrismSegment\n | bottom : Fin 5 → PrismSegment\n | cross : Fin 5 → Fin 5 → PrismSegment\nderiving DecidableEq, Repr\n\n/-- The first (canonically named) endpoint of each listed segment. -/\ndef PrismSegmentLeft : PrismSegment → PrismVertex\n | PrismSegment.top i => PrismVertex.A i\n | PrismSegment.bottom i => PrismVertex.B i\n | PrismSegment.cross i _ => PrismVertex.A i\n\n/-- The second (canonically named) endpoint of each listed segment. -/\ndef PrismSegmentRight : PrismSegment → PrismVertex\n | PrismSegment.top i => PrismVertex.A (i + (1 : Fin 5))\n | PrismSegment.bottom i => PrismVertex.B (i + (1 : Fin 5))\n | PrismSegment.cross _ j => PrismVertex.B j\n\n/-- A segment joins two vertices, without regard to the order in which those\nvertices are written. -/\ndef SegmentConnects (e : PrismSegment) (u v : PrismVertex) : Prop :=\n (PrismSegmentLeft e = u ∧ PrismSegmentRight e = v) ∨\n (PrismSegmentLeft e = v ∧ PrismSegmentRight e = u)\n\n/-- Three distinct listed segments form a triangle when their endpoints are\nthree distinct vertices, one segment being the side between each pair of\nthose vertices. -/\ndef PrismTriangle (e1 e2 e3 : PrismSegment) : Prop :=\n e1 ≠ e2 ∧ e2 ≠ e3 ∧ e3 ≠ e1 ∧\n ∃ (a b c : PrismVertex),\n a ≠ b ∧ b ≠ c ∧ c ≠ a ∧\n SegmentConnects e1 a b ∧\n SegmentConnects e2 b c ∧\n SegmentConnects e3 c a\n\n/-- A red/blue coloring of every one of the 35 listed segments. A structure\nis used so that only those segments are colored; there is no color assigned\nto any unlisted segment. -/\nstructure PrismColoring where\n color : PrismSegment → PrismColor\n\n/-- Three colors contain at least one red and at least one blue. -/\ndef HasBothColors (x y z : PrismColor) : Prop :=\n (x = PrismColor.red ∨ y = PrismColor.red ∨ z = PrismColor.red) ∧\n (x = PrismColor.blue ∨ y = PrismColor.blue ∨ z = PrismColor.blue)\n\n/-- The no-monochromatic-triangle hypothesis: every triangle whose three\nsides are among the listed segments has at least one red and at least one\nblue side. -/\ndef NoMonochromaticTriangle (coloring : PrismColoring) : Prop :=\n ∀ (e1 e2 e3 : PrismSegment),\n PrismTriangle e1 e2 e3 →\n HasBothColors (coloring.color e1) (coloring.color e2) (coloring.color e3)\n\n/-- All five top base edges and all five bottom base edges have one common\ncolor. -/\ndef AllBaseEdgesSameColor (coloring : PrismColoring) : Prop :=\n ∃ (baseColor : PrismColor),\n (∀ (i : Fin 5), coloring.color (PrismSegment.top i) = baseColor) ∧\n (∀ (i : Fin 5), coloring.color (PrismSegment.bottom i) = baseColor)\n\n/-- The hypothesis of the problem, packaged as admissibility of a coloring. -/\ndef AdmissibleColoring (coloring : PrismColoring) : Prop :=\n NoMonochromaticTriangle coloring\n\n/-- The proposition asserted by the problem: every red/blue coloring of the\nlisted prism segments with no monochromatic triangle has one and the same\ncolor on all ten pentagonal-base edges. -/\ndef Target : Prop :=\n ∀ (coloring : PrismColoring),\n AdmissibleColoring coloring → AllBaseEdgesSameColor coloring\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59c3e7ca-2b93-516e-9e64-f471c2aa8596", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "237ab572e9f9e3a9837d77cd3802d30a066e0fa420dcccfaf9017d79a5217e79", "task_path": "tasks/nmp3_59c3e7ca-2b93-516e-9e64-f471c2aa8596", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59c3e7ca-2b93-516e-9e64-f471c2aa8596", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_59caa34e-b842-573e-bd4a-b3b14b40b195", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{1+a+b^2}+\\frac{1}{1+b+c^2}+\\frac{1}{1+c+a^2}\\le 1.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the source problem:\n\nLet `a`, `b`, `c` be positive real numbers such that `a * b * c = 1`.\nProve that\n`1 / (1 + a + b^2) + 1 / (1 + b + c^2) + 1 / (1 + c + a^2) ≤ 1`.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved: for all positive real numbers `a`, `b`, `c`\nwith `a * b * c = 1`, the indicated cyclic sum is at most one. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n 1 / (1 + a + b ^ 2) +\n 1 / (1 + b + c ^ 2) +\n 1 / (1 + c + a ^ 2) ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59caa34e-b842-573e-bd4a-b3b14b40b195", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "baf796b24fad9a9cb66e8999855895319b6fea7b9ba1e7f1c977a813dfbb8774", "task_path": "tasks/nmp3_59caa34e-b842-573e-bd4a-b3b14b40b195", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59caa34e-b842-573e-bd4a-b3b14b40b195", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_59df93ae-8823-57cb-8221-f1161442478d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $ab+bc+ca=a+b+c$. Prove that \n-- \\[\n-- \\sqrt{a+\\frac{b}{c}}+\\sqrt{b+\\frac{c}{a}}+\\sqrt{c+\\frac{a}{b}}\n-- \\le \\sqrt{2}\\,\\min\\Bigl\\{\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a},\n-- \\ \\frac{b}{a}+\\frac{c}{b}+\\frac{a}{c}\\Bigr\\}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, `c` satisfying\n`a*b + b*c + c*a = a + b + c`, to prove the stated square-root inequality.\n\nThis file only records the mathematical statement as a proposition. No proof\nof the target is supplied.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissibility condition on the three variables:\nall are positive and `ab + bc + ca = a + b + c`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = a + b + c\n\n/-- The left-hand side of the asserted inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a + b / c) + Real.sqrt (b + c / a) + Real.sqrt (c + a / b)\n\n/-- The first cyclic sum appearing in the minimum on the right-hand side. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n a / b + b / c + c / a\n\n/-- The second (reverse-cyclic) sum appearing in the minimum. -/\ndef reverseCyclicSum (a b c : ℝ) : ℝ :=\n b / a + c / b + a / c\n\n/-- The right-hand side of the asserted inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n Real.sqrt 2 * min (cyclicSum a b c) (reverseCyclicSum a b c)\n\n/-- The complete target statement of the problem: for every three positive\nreal numbers satisfying `ab + bc + ca = a + b + c`, the square-root sum is at\nmost `sqrt 2` times the minimum of the two displayed cyclic sums. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n lhs a b c ≤ rhs a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59df93ae-8823-57cb-8221-f1161442478d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "302e85f7563db4cbaebb23da1c8dc9c610a934804f1779ffb73f8b0ee2cd724c", "task_path": "tasks/nmp3_59df93ae-8823-57cb-8221-f1161442478d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "59df93ae-8823-57cb-8221-f1161442478d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5a7a660f-7e2e-560c-a76f-85f6b0d671c4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- There are $4n$ pebbles with distinct weights $1,2,\\dots,4n$. Each pebble is coloured with one of $n$ colours, and exactly four pebbles have each colour. Prove that the pebbles can be divided into two piles such that \n-- \n-- 1. the total weight of the two piles is the same, and \n-- 2. each pile contains exactly two pebbles of each colour. \n-- (Equivalently, each pile must have total weight $n(4n+1)$ and contain two pebbles of every colour.)\nimport Mathlib\n\n/-!\n# Equal-weight, colour-balanced division of a coloured set of weighted pebbles\n\nThe problem concerns the pebbles of weights `1, 2, ..., 4 * n`, each assigned one\nof `n` colours so that every colour occurs exactly four times. We identify a\npebble with its index `i : Fin (4 * n)` and give it weight `i.val + 1`. Thus the\nweights are automatically distinct and are exactly the desired weights.\n\nA division into two piles is represented by a finite subset `P` of all pebbles;\nthe other pile is its complement in `Finset.univ`. The target says that, for\nevery admissible colouring, one can choose such a `P` for which both piles have\nequal total weight and both contain exactly two pebbles of every colour.\n-/\n\nnamespace Problem\n\n/-- The weight of the pebble indexed by `i : Fin (4 * n)` is `i.val + 1`.\nThis realizes the weights `1, 2, ..., 4 * n` without a separate distinctness\nhypothesis. -/\ndef pebbleWeight (n : ℕ) (i : Fin (4 * n)) : ℕ :=\n i.val + 1\n\n/-- The total weight of a pile represented by a finite set of pebbles. -/\ndef pileWeight (n : ℕ) (P : Finset (Fin (4 * n))) : ℕ :=\n P.sum (fun i : Fin (4 * n) => pebbleWeight n i)\n\n/-- The cardinality of the colour class of `k` among all pebbles. -/\ndef colorClassCard (n : ℕ) (c : Fin (4 * n) → Fin n) (k : Fin n) : ℕ :=\n (Finset.univ.filter (fun i : Fin (4 * n) => c i = k)).card\n\n/-- The colouring uses one of `n` colours for each pebble, and every colour\noccurs exactly four times. -/\ndef HasFourOfEachColor (n : ℕ) (c : Fin (4 * n) → Fin n) : Prop :=\n ∀ k : Fin n, colorClassCard n c k = 4\n\n/-- The cardinality of the colour class of `k` inside the pile `P`. -/\ndef pileColorClassCard\n (n : ℕ) (c : Fin (4 * n) → Fin n)\n (P : Finset (Fin (4 * n))) (k : Fin n) : ℕ :=\n (P.filter (fun i : Fin (4 * n) => c i = k)).card\n\n/-- The pile `P` contains exactly two pebbles of every colour. -/\ndef HasTwoOfEachColor\n (n : ℕ) (c : Fin (4 * n) → Fin n)\n (P : Finset (Fin (4 * n))) : Prop :=\n ∀ k : Fin n, pileColorClassCard n c P k = 2\n\n/-- The total weight of all `4 * n` pebbles. -/\ndef totalPebbleWeight (n : ℕ) : ℕ :=\n (Finset.univ : Finset (Fin (4 * n))).sum\n (fun i : Fin (4 * n) => pebbleWeight n i)\n\n/-- The explicit expected weight `n * (4 * n + 1)` of each of the two equal\npiles. -/\ndef expectedPileWeight (n : ℕ) : ℕ :=\n n * (4 * n + 1)\n\n/-- The two piles represented by `P` and its complement have the same total\nweight. -/\ndef PileWeightsEqual (n : ℕ) (P : Finset (Fin (4 * n))) : Prop :=\n pileWeight n P = pileWeight n (Finset.univ \\ P)\n\n/-- The equivalent formulation in which each pile is required to have the\nexplicit weight `n * (4 * n + 1)`. -/\ndef bothPilesHaveExpectedWeight\n (n : ℕ) (P : Finset (Fin (4 * n))) : Prop :=\n pileWeight n P = expectedPileWeight n ∧\n pileWeight n (Finset.univ \\ P) = expectedPileWeight n\n\n/-- The complete assertion of the problem: for every natural number `n` and\nevery colouring of the `4 * n` pebbles with `n` colours, four per colour, the\npebbles can be divided into two piles that have equal total weight and each\ncontain exactly two pebbles of every colour. The same pile `P` is required to\nsatisfy the weight condition and both colour-count conditions. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (c : Fin (4 * n) → Fin n),\n HasFourOfEachColor n c →\n ∃ P : Finset (Fin (4 * n)),\n PileWeightsEqual n P ∧\n HasTwoOfEachColor n c P ∧\n HasTwoOfEachColor n c (Finset.univ \\ P)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5a7a660f-7e2e-560c-a76f-85f6b0d671c4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6ade196b996042ad08d9101d7bf8d8d7e46d9e2dbc3d3dcd81cadcee9fd03853", "task_path": "tasks/nmp3_5a7a660f-7e2e-560c-a76f-85f6b0d671c4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5a7a660f-7e2e-560c-a76f-85f6b0d671c4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5a7a6f0e-ae65-5cb5-a2f0-7b9328e8187c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 2$ be an integer and $a_1,a_2,\\dots ,a_n$ be real numbers. Prove that \n-- \\[\n-- \\prod_{i=1}^{n}\\bigl(a_i^{2}+n-1\\bigr)\\;\\ge\\;n^{\\,n-2}\\Bigl(\\sum_{i=1}^{n}a_i\\Bigr)^{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe source problem asks, for every integer `n ≥ 2` and every finite list of\nreal numbers `a₁, …, aₙ`, to prove the stated product-sum inequality.\n-/\n\nnamespace Problem\n\n/-- The statement of the source problem.\n\nFor every natural number `n ≥ 2` and every function `a : Fin n → ℝ`, the\nproduct over `i : Fin n` of `a i ^ 2 + (n : ℝ) - 1` is at least\n`(n : ℝ) ^ (n - 2)` times the square of the sum of all `a i`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 2 ≤ n →\n ∀ a : Fin n → ℝ,\n (Finset.univ.prod (fun i : Fin n => a i ^ 2 + (n : ℝ) - 1)) ≥\n (n : ℝ) ^ (n - 2) *\n (Finset.univ.sum (fun i : Fin n => a i)) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5a7a6f0e-ae65-5cb5-a2f0-7b9328e8187c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "105467fbda34108ccf47317bd193663c4346fb7ae59e713f5c6fef1c50d29653", "task_path": "tasks/nmp3_5a7a6f0e-ae65-5cb5-a2f0-7b9328e8187c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5a7a6f0e-ae65-5cb5-a2f0-7b9328e8187c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5a92fcf3-d030-59ec-8efb-43aba5923557", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $x,\\;y,\\;z$, prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{x(x+y)}{(y+z)(2x+y+z)}\\ge\\frac34.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic inequality problem\n\nThe problem asks to prove that for all positive real numbers `x`, `y`, and `z`,\n\n`∑_cyc x(x+y)/((y+z)(2x+y+z)) ≥ 3/4`.\n\nNo proof of the inequality is included here: `Problem.Target` is the proposition\nwhose body is the original assertion.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The cyclic sum appearing in the problem, written out for `x`, `y`, and `z`. -/\ndef cyclicSum (x y z : ℝ) : ℝ :=\n x * (x + y) / ((y + z) * ((2 : ℝ) * x + y + z)) +\n y * (y + z) / ((z + x) * ((2 : ℝ) * y + z + x)) +\n z * (z + x) / ((x + y) * ((2 : ℝ) * z + x + y))\n\n/-- The assertion of the problem: for all positive reals `x`, `y`, `z`, the cyclic\nsum is at least `3/4`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n (3 : ℝ) / 4 ≤ cyclicSum x y z\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5a92fcf3-d030-59ec-8efb-43aba5923557", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a0fdad9b00e4bed58eb21288bdeeeed9c3f9008a57b24724f4679a665e49708d", "task_path": "tasks/nmp3_5a92fcf3-d030-59ec-8efb-43aba5923557", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5a92fcf3-d030-59ec-8efb-43aba5923557", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5ab7a6f1-a3a9-5c15-b8bd-69c18be50733", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be a simple graph with $99$ vertices such that every vertex has degree belonging to the set $\\{81,82,\\dots,90\\}$. Prove that there exist ten vertices of $G$ that all have the same degree and share a common neighbor (i.e., there is a vertex adjacent to each of those ten vertices).\nimport Mathlib.Combinatorics.SimpleGraph.Finite\nimport Mathlib.Order.Interval.Finset.Nat\n\n/-!\n# Formalization of the graph-theoretic problem\n\nThe source problem asks for a proof that every simple graph on exactly 99\nvertices whose vertex degrees all lie in `{81, 82, ..., 90}` contains ten\nvertices of equal degree which have a common neighbor.\n\nThe main assertion is packaged as the proposition `Problem.Target`; it is not\nproved here. The auxiliary definitions expose each hypothesis and conclusion\nof the problem without requiring a local finiteness typeclass, since the vertex\ntype is assumed finite.\n-/\n\nuniverse u\n\nnamespace Problem\n\n/-- The degree of a vertex, using the finiteness of the vertex type to obtain\nfiniteness of its neighbor set. This is the usual `SimpleGraph.degree` for the\nselected finite neighbor-set structure. -/\nnoncomputable def vertexDegree {V : Type u} [Fintype V]\n (G : SimpleGraph V) (v : V) : ℕ := by\n letI : Fintype (G.neighborSet v) := Fintype.ofFinite (G.neighborSet v)\n exact G.degree v\n\n/-- The graph has exactly 99 vertices. -/\ndef HasExactly99Vertices {V : Type u} [Fintype V] : Prop :=\n Fintype.card V = 99\n\n/-- A natural number lies in the allowed degree set `{81, 82, ..., 90}`. -/\ndef AllowedDegree (d : ℕ) : Prop :=\n d ∈ Finset.Icc 81 90\n\n/-- Every vertex of `G` has degree in the allowed range. -/\nnoncomputable def DegreesInRange {V : Type u} [Fintype V]\n (G : SimpleGraph V) : Prop :=\n ∀ v : V, AllowedDegree (vertexDegree G v)\n\n/-- All vertices in the finite set `S` have one and the same degree. -/\nnoncomputable def SameDegreeOn {V : Type u} [Fintype V]\n (G : SimpleGraph V) (S : Finset V) : Prop :=\n ∃ d : ℕ, ∀ v : V, v ∈ S → vertexDegree G v = d\n\n/-- The finite set `S` has a common neighbor: one vertex adjacent to every\nmember of `S`. -/\ndef HasCommonNeighbor {V : Type u} (G : SimpleGraph V) (S : Finset V) : Prop :=\n ∃ x : V, ∀ v : V, v ∈ S → G.Adj x v\n\n/-- The conclusion: there are ten distinct vertices, all of the same degree,\nand there is a vertex adjacent to every one of them. -/\nnoncomputable def TenVerticesSameDegreeWithCommonNeighbor {V : Type u} [Fintype V]\n (G : SimpleGraph V) : Prop :=\n ∃ S : Finset V,\n S.card = 10 ∧ SameDegreeOn G S ∧ HasCommonNeighbor G S\n\n/-- The complete statement of the problem: for every simple graph on exactly\n99 vertices, if every vertex has degree in `{81, 82, ..., 90}`, then there are\nten vertices of equal degree with a common neighbor. -/\ndef Target : Prop :=\n ∀ (V : Type u) [Fintype V] (G : SimpleGraph V),\n HasExactly99Vertices (V := V) →\n DegreesInRange G →\n TenVerticesSameDegreeWithCommonNeighbor G\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ab7a6f1-a3a9-5c15-b8bd-69c18be50733", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fdfe3ffbe13b15f3e9f608825326f155d80b934cb9ceba354cd0e6eafe2544cc", "task_path": "tasks/nmp3_5ab7a6f1-a3a9-5c15-b8bd-69c18be50733", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ab7a6f1-a3a9-5c15-b8bd-69c18be50733", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5ac02650-c909-5026-8f97-799170ee1ffa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ be real numbers such that $a+b+c+d=3$. Prove that for every integer $n\\ge 2$ \n-- \\[\n-- \\frac{1}{a^{n}}+\\frac{1}{b^{n}}+\\frac{1}{c^{n}}+\\frac{1}{d^{n}}\\;\\le\\;\\frac{1}{a^{n}b^{n}c^{n}d^{n}}\\,. \n-- \\] \n-- (For $n=2$ and $n=3$ this corresponds to the Grade 9 and Grade 11 problems of the 2016 All‑Russian Olympiad.)\nimport Mathlib\n\n/-!\n# Formal statement for the 2016 All-Russian Olympiad power-sum inequality\n\nThe original problem asks to prove, for positive real `a b c d` with sum `3`, that\nfor every integer `n ≥ 2`,\n`1 / a^n + 1 / b^n + 1 / c^n + 1 / d^n ≤ 1 / (a^n b^n c^n d^n)`.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem.\n\nThe four variables are real, strictly positive, and have sum `3`. The universally\nquantified exponent `n` is an integer restricted by `2 ≤ n`; consequently all powers\nin the displayed inequality are integer powers. -/\ndef Target : Prop :=\n ∀ (a b c d : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n 0 < d →\n a + b + c + d = 3 →\n ∀ n : ℤ,\n 2 ≤ n →\n (1 / (a ^ n) + 1 / (b ^ n) + 1 / (c ^ n) + 1 / (d ^ n)) ≤\n 1 / ((a ^ n) * (b ^ n) * (c ^ n) * (d ^ n))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ac02650-c909-5026-8f97-799170ee1ffa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3bfb137243ac1e730e421f50c5ce4cd7eee113892c16bbde79c4370431ea5b3e", "task_path": "tasks/nmp3_5ac02650-c909-5026-8f97-799170ee1ffa", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ac02650-c909-5026-8f97-799170ee1ffa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5add4e38-0d10-567f-b850-903a17f973a8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ be real numbers such that $a^{2}+b^{2}+c^{2}=3$. Prove \n-- \\[\n-- 2\\bigl(a^{2}b+b^{2}c+c^{2}a\\bigr)\\le abc\\,(a+b+c-1)+4.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the nonnegative real inequality\n\nThe source problem asks to prove, for all real numbers `a`, `b`, and `c`\nsatisfying `a ≥ 0`, `b ≥ 0`, `c ≥ 0`, and `a² + b² + c² = 3`, the inequality\n\n`2 (a² b + b² c + c² a) ≤ a b c (a + b + c - 1) + 4`.\n\nThis file records the proposition only; it does not assert a proof.\n-/\n\nnamespace Problem\n\n/-- The universal proposition stated by the problem.\n\nThe variables range over all real numbers. The hypotheses are exactly the\nnonnegativity of `a`, `b`, and `c`, together with the constraint\n`a ^ 2 + b ^ 2 + c ^ 2 = 3`. The conclusion is the displayed inequality,\nwith juxtaposition interpreted as multiplication. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a ^ 2 + b ^ 2 + c ^ 2 = 3 →\n 2 * (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a) ≤\n a * b * c * (a + b + c - 1) + 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5add4e38-0d10-567f-b850-903a17f973a8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1db441c2e0b5d81b5620e928893e81110da9e88371d23dc5a37f69a7504023e8", "task_path": "tasks/nmp3_5add4e38-0d10-567f-b850-903a17f973a8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5add4e38-0d10-567f-b850-903a17f973a8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5ade8749-0300-5cd9-b4c3-bad05af295ee", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that\n-- \\[\n-- \\frac{\\sqrt[3]{b+c}}{a}+\\frac{\\sqrt[3]{c+a}}{b}+\\frac{\\sqrt[3]{a+b}}{c}\n-- \\ge (a+b+c)\\sqrt[3]{\\frac{6(a+b+c)}{(ab+bc+ca)(a^{2}b^{2}+b^{2}c^{2}+c^{2}a^{2})}}.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the inequality in `problem.md`.\n\nThe source uses the real cube root. Since Mathlib has no dedicated `Real.cbrt`\nfunction, we define `Problem.cbrt` using the real power `x ^ (1 / 3)` on\nnonnegative inputs and oddness on negative inputs. In the target proposition\nthe function is only applied to positive quantities (`b + c`, `c + a`, `a + b`,\nand the positive radicand on the right), so the nonnegative branch is used.\n-/\n\nnamespace Problem\n\n/-- The real cube root. On nonnegative inputs this is the real power with\nexponent `1/3`; on negative inputs oddness gives the negative of the cube root\nof the absolute value. -/\nnoncomputable def cbrt (x : ℝ) : ℝ :=\n if x < 0 then -Real.rpow (-x) (1 / 3 : ℝ) else Real.rpow x (1 / 3 : ℝ)\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n cbrt (b + c) / a + cbrt (c + a) / b + cbrt (a + b) / c\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a + b + c) *\n cbrt (6 * (a + b + c) /\n ((a * b + b * c + c * a) *\n (a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2)))\n\n/-- The statement to be proved: for all positive real `a`, `b`, and `c`, the\nleft-hand side is at least the right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ade8749-0300-5cd9-b4c3-bad05af295ee", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b7a7d002c3d63451843204b855030c95786d63745dc6f32c09107b8de3d50a2c", "task_path": "tasks/nmp3_5ade8749-0300-5cd9-b4c3-bad05af295ee", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ade8749-0300-5cd9-b4c3-bad05af295ee", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5aef08c6-c802-5905-aa4f-3f0086e29142", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a(b+c)^2}{2a+b+c}+\\frac{b(a+c)^2}{2b+a+c}+\\frac{c(a+b)^2}{2c+a+b}\\ge \\sqrt{3abc(a+b+c)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthe inequality\n`a (b+c)^2 / (2a+b+c) + b (a+c)^2 / (2b+a+c) + c (a+b)^2 / (2c+a+b)\n ≥ sqrt (3abc(a+b+c))`.\n\nThis file states the problem; it deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The sum on the left-hand side of the target inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a * (b + c) ^ 2 / (2 * a + b + c) +\n b * (a + c) ^ 2 / (2 * b + a + c) +\n c * (a + b) ^ 2 / (2 * c + a + b)\n\n/-- The square-root term on the right-hand side of the target inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n Real.sqrt (3 * a * b * c * (a + b + c))\n\n/-- The source's hypothesis that all three variables are positive. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The assertion to be proved: for all positive real `a`, `b`, and `c`,\nthe stated left-hand side is at least the stated square-root right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → LHS a b c ≥ RHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5aef08c6-c802-5905-aa4f-3f0086e29142", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "06a7e09a4ce921468b0049d7581b75a2cef6bb158ba518f31b37c40cf2b1b823", "task_path": "tasks/nmp3_5aef08c6-c802-5905-aa4f-3f0086e29142", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5aef08c6-c802-5905-aa4f-3f0086e29142", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5b18505e-2455-5cd8-ad75-6ff0bfcf2aa5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all $x,y,z>0$ with $\\displaystyle\\frac1x+\\frac1y+\\frac1z=1$ and $0\\le a,b,c<1$, the inequality \n-- \\[\n-- \\frac{x^{2}+y^{2}}{1-a^{z}}+\\frac{y^{2}+z^{2}}{1-b^{x}}+\\frac{z^{2}+x^{2}}{1-c^{y}}\\;\\ge\\;\\frac{6(x+y+z)}{1-abc}\n-- \\] \n-- holds.\nimport Mathlib\n\n/-!\n# Formal statement: a cyclic inequality with variable real exponents\n\nThe source problem asks to prove a real inequality for positive real variables\n`x y z`, nonnegative real parameters `a b c < 1`, under the reciprocal-sum\ncondition `1 / x + 1 / y + 1 / z = 1`.\n\nThe powers `a ^ z`, `b ^ x`, and `c ^ y` have variable real exponents, so they\nare represented by `Real.rpow` (Lean's real-valued power operation). Ordinary\nsquares such as `x ^ 2` use the natural-number power operation.\n-/\n\nnamespace Problem\n\n/-- The three variables `x`, `y`, and `z` are strictly positive. -/\ndef PositiveVariables (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The reciprocal-sum hypothesis `1 / x + 1 / y + 1 / z = 1`. -/\ndef ReciprocalSumCondition (x y z : ℝ) : Prop :=\n 1 / x + 1 / y + 1 / z = 1\n\n/-- A real parameter lies in the interval `[0, 1)`. -/\ndef NonnegativeBelowOne (t : ℝ) : Prop :=\n 0 ≤ t ∧ t < 1\n\n/-- All three parameters `a`, `b`, and `c` lie in `[0, 1)`. -/\ndef UnitIntervalBounds (a b c : ℝ) : Prop :=\n NonnegativeBelowOne a ∧ NonnegativeBelowOne b ∧ NonnegativeBelowOne c\n\n/-- The complete hypotheses of the problem. -/\ndef Admissible (x y z a b c : ℝ) : Prop :=\n PositiveVariables x y z ∧\n ReciprocalSumCondition x y z ∧\n UnitIntervalBounds a b c\n\n/-- The left-hand side of the stated inequality:\n`(x^2+y^2)/(1-a^z) + (y^2+z^2)/(1-b^x) + (z^2+x^2)/(1-c^y)`. -/\nnoncomputable def LHS (x y z a b c : ℝ) : ℝ :=\n (x ^ 2 + y ^ 2) / (1 - Real.rpow a z) +\n (y ^ 2 + z ^ 2) / (1 - Real.rpow b x) +\n (z ^ 2 + x ^ 2) / (1 - Real.rpow c y)\n\n/-- The right-hand side of the stated inequality:\n`6 * (x+y+z) / (1-a*b*c)`. -/\nnoncomputable def RHS (x y z a b c : ℝ) : ℝ :=\n 6 * (x + y + z) / (1 - a * b * c)\n\n/-- The proposition asserted by the problem.\n\nFor all real `x y z a b c`, if `x y z` are positive, the reciprocal-sum\ncondition holds, and `0 ≤ a, b, c < 1`, then the three-term left-hand side is\nat least the right-hand side. -/\ndef Target : Prop :=\n ∀ x y z a b c : ℝ,\n Admissible x y z a b c → LHS x y z a b c ≥ RHS x y z a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5b18505e-2455-5cd8-ad75-6ff0bfcf2aa5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "12536e0b4f1df1b893007d931dcbdda96136e490ac89608a4fbdbfadfd79ae4f", "task_path": "tasks/nmp3_5b18505e-2455-5cd8-ad75-6ff0bfcf2aa5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5b18505e-2455-5cd8-ad75-6ff0bfcf2aa5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5b2bd709-41c9-5576-9d8c-9f747e332d2b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \n-- \\[\n-- f(n)=1+2n+3n^{2}+\\cdots+2016\\,n^{2015}=\\sum_{k=0}^{2015}(k+1)n^{k}.\n-- \\]\n-- Let \\((t_{0},t_{1},\\dots ,t_{2016})\\) and \\((s_{0},s_{1},\\dots ,s_{2016})\\) be two permutations of the set \\(\\{0,1,\\dots ,2016\\}\\).\n-- Prove that the set \n-- \\[\n-- \\mathcal A=\\{\\,s_{i}\\,f(t_{i})\\mid i=0,1,\\dots ,2016\\,\\}\n-- \\]\n-- contains two distinct elements whose difference is divisible by \\(2017\\).\nimport Mathlib\n\nnamespace Problem\n\n/-- The polynomial from the statement, evaluated at an integer point:\n`f(n) = 1 + 2 n + 3 n^2 + ... + 2016 n^2015`. -/\ndef f (n : ℤ) : ℤ :=\n ∑ k ∈ Finset.range 2016, ((k : ℤ) + 1) * n ^ k\n\n/-- The set `A = {s_i f(t_i) | i = 0, 1, ..., 2016}` associated with two\npermutations `t` and `s` of `{0, 1, ..., 2016}`. -/\ndef A (t s : Fin 2017 ≃ Fin 2017) : Set ℤ :=\n Set.range fun i : Fin 2017 => ((s i).val : ℤ) * f ((t i).val : ℤ)\n\n/-- The assertion of the problem: for every pair of permutations `t` and `s`\nof `{0, 1, ..., 2016}`, the associated set `A` has two distinct elements\nwhose difference is divisible by `2017`. -/\ndef Target : Prop :=\n ∀ t s : Fin 2017 ≃ Fin 2017,\n ∃ x ∈ A t s, ∃ y ∈ A t s,\n x ≠ y ∧ (2017 : ℤ) ∣ x - y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5b2bd709-41c9-5576-9d8c-9f747e332d2b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8e8228f89e8fcd9795baa6e975f37eecf22cae61283cedad0aee23f89f916187", "task_path": "tasks/nmp3_5b2bd709-41c9-5576-9d8c-9f747e332d2b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5b2bd709-41c9-5576-9d8c-9f747e332d2b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5ba9cf35-29dc-5c65-bd58-5a19bb606be5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any triangle $ABC$ with $\\angle C\\ge55^{\\circ}$ (where $a,b,c$ denote the side lengths opposite $A,B,C$ respectively) the inequality\n-- \\[\n-- (a+b)\\Bigl(\\frac1a+\\frac1b+\\frac1c\\Bigr)\\;\\ge\\;4+\\frac{1}{\\sin\\frac{C}{2}}\n-- \\]\n-- holds.\nimport Mathlib\n\n/-!\n# Formal statement of the triangle inequality problem\n\nThe source problem asks to prove an inequality for every nondegenerate Euclidean\ntriangle whose angle at `C` is at least `55` degrees. We model the ambient\nEuclidean plane as `EuclideanSpace ℝ (Fin 2)`. All angles produced by\n`EuclideanGeometry.angle` are measured in radians, so the degree threshold\n`55°` is represented by `Problem.degrees 55 = 55 * (Real.pi / 180)`.\n\nThe side names follow the usual convention: `a = |BC|`, `b = |CA|`, and\n`c = |AB|`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used to state the triangle problem. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Convert an angle measured in degrees to the radian measure used by\n`EuclideanGeometry.angle`. -/\ndef degrees (x : ℝ) : ℝ := x * (Real.pi / 180)\n\n/-- The angle at vertex `C` of the ordered triangle with vertices `A`, `B`, `C`. -/\ndef angleC (A B C : Plane) : ℝ := EuclideanGeometry.angle A C B\n\n/-- The side length opposite vertex `A`, namely the length of `BC`. -/\ndef sideA (A B C : Plane) : ℝ := dist B C\n\n/-- The side length opposite vertex `B`, namely the length of `CA`. -/\ndef sideB (A B C : Plane) : ℝ := dist A C\n\n/-- The side length opposite vertex `C`, namely the length of `AB`. -/\ndef sideC (A B C : Plane) : ℝ := dist A B\n\n/-- A triple of points is the vertex triple of a nondegenerate triangle exactly\nwhen it is not collinear. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- The assertion to be proved.\n\nFor every nondegenerate triangle `ABC`, if its angle at `C` is at least\n`55°`, then\n`(a + b) * (1 / a + 1 / b + 1 / c) ≥ 4 + 1 / sin(C / 2)`,\nwhere `a`, `b`, and `c` are the side lengths opposite `A`, `B`, and `C`. -/\ndef Target : Prop :=\n ∀ A B C : Plane,\n IsTriangle A B C →\n degrees 55 ≤ angleC A B C →\n (sideA A B C + sideB A B C) *\n (1 / sideA A B C + 1 / sideB A B C + 1 / sideC A B C) ≥\n 4 + 1 / Real.sin (angleC A B C / 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ba9cf35-29dc-5c65-bd58-5a19bb606be5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "58b474ae41168ca1a02ecf483f53596d5cdf1fadd31aa69f54e35cc55a942ef7", "task_path": "tasks/nmp3_5ba9cf35-29dc-5c65-bd58-5a19bb606be5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ba9cf35-29dc-5c65-bd58-5a19bb606be5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5bbfe553-e36d-5751-8f63-56affc5f1366", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with $ab+bc+ca>0$. Prove that \n-- \\[\n-- \\frac{a(b+c)}{a^{2}+bc}+\\frac{b(a+c)}{b^{2}+ac}+\\frac{c(a+b)}{c^{2}+ab}\\ge 1+\\frac{16abc}{(a+b)(b+c)(c+a)}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a cyclic three-variable inequality\n\nThe source problem asks to prove a real inequality under the assumptions that\n`a`, `b`, and `c` are nonnegative and `ab + bc + ca > 0`.\n\nThis file contains the object-level definitions and a proposition-valued\ndeclaration for the target. No proof of the target is supplied.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the inequality in the problem. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a * (b + c) / (a ^ 2 + b * c) +\n b * (a + c) / (b ^ 2 + a * c) +\n c * (a + b) / (c ^ 2 + a * b)\n\n/-- The right-hand side of the inequality in the problem. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 1 + 16 * a * b * c / ((a + b) * (b + c) * (c + a))\n\n/-- The inequality claimed for fixed real numbers `a`, `b`, and `c`. -/\ndef inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full proposition asserted by the problem: for all nonnegative real\n`a`, `b`, and `c` satisfying `ab + bc + ca > 0`, the displayed inequality\nholds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c →\n a * b + b * c + c * a > 0 →\n inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5bbfe553-e36d-5751-8f63-56affc5f1366", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e02d2cb7e08f404508716333eedd9d36319cc177b626d40d8768b2b5a032e1cb", "task_path": "tasks/nmp3_5bbfe553-e36d-5751-8f63-56affc5f1366", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5bbfe553-e36d-5751-8f63-56affc5f1366", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5bd2ae71-a821-5e07-9ca2-fc1cc1804f8b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all real numbers $x,y,z$,\n-- \\[\n-- 3\\bigl(x^2-x+1\\bigr)\\bigl(y^2-y+1\\bigr)\\bigl(z^2-z+1\\bigr)\\ge (xyz)^2+xyz+1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The pointwise inequality asserted by the problem for real numbers `x`, `y`, and `z`. -/\ndef Inequality (x y z : ℝ) : Prop :=\n 3 * (x ^ 2 - x + 1) * (y ^ 2 - y + 1) * (z ^ 2 - z + 1) ≥\n (x * y * z) ^ 2 + x * y * z + 1\n\n/-- The full universally quantified assertion:\nfor all real numbers `x`, `y`, and `z`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5bd2ae71-a821-5e07-9ca2-fc1cc1804f8b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "25b777a6f4950e36bb183c20e21d6be913dd4b0ddcdc9c338bb80bd46650a325", "task_path": "tasks/nmp3_5bd2ae71-a821-5e07-9ca2-fc1cc1804f8b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5bd2ae71-a821-5e07-9ca2-fc1cc1804f8b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5bd8d3a1-70cd-58e9-bf96-c1205b7ccc2b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{a}{b}\\;\\ge\\;\\sum_{\\text{cyc}}\\frac{a+b}{a+c},\n-- \\] \n-- i.e. \\(\\displaystyle\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\ge\\frac{a+b}{a+c}+\\frac{b+c}{b+a}+\\frac{c+a}{c+b}\\).\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n\n/-!\n# Formalization of a cyclic inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`, that\n\n`a / b + b / c + c / a ≥ (a + b) / (a + c) + (b + c) / (b + a) + (c + a) / (c + b)`.\n\nThe displayed definition below is the target proposition itself, not a proof of it.\n-/\n\nnamespace Problem\n\n@[expose] public section\n\n/-- The assertion of the cyclic inequality for a fixed triple of real numbers. -/\ndef CyclicInequality (a b c : ℝ) : Prop :=\n a / b + b / c + c / a ≥\n (a + b) / (a + c) + (b + c) / (b + a) + (c + a) / (c + b)\n\n/-- The full problem statement: the cyclic inequality holds for all positive real\nnumbers `a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → CyclicInequality a b c\n\nend\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5bd8d3a1-70cd-58e9-bf96-c1205b7ccc2b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ad57f042925c03f86070a6a774f493625687f5bccf1cf59d9807dc56ee097153", "task_path": "tasks/nmp3_5bd8d3a1-70cd-58e9-bf96-c1205b7ccc2b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5bd8d3a1-70cd-58e9-bf96-c1205b7ccc2b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5bec9fe5-7582-53a5-be1c-75599f091d73", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ be real numbers satisfying $ab+bc+ca=2$. Prove that \n-- \\[\n-- \\sqrt{a+ab}+\\sqrt{b+bc}+\\sqrt{c+ca}\\ge3.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the nonnegative-real inequality problem\n\nThe source problem asks to prove, for all nonnegative real numbers `a`, `b`, and\n`c` with `a * b + b * c + c * a = 2`, the inequality\n\n`Real.sqrt (a + a * b) + Real.sqrt (b + b * c) + Real.sqrt (c + c * a) ≥ 3`.\n\nNo proof of the assertion is included at this statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- The three nonnegativity hypotheses from the source problem. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The symmetric product-sum constraint `ab + bc + ca = 2`. -/\ndef ProductSumEqTwo (a b c : ℝ) : Prop :=\n a * b + b * c + c * a = 2\n\n/-- The admissibility conditions for a triple `(a, b, c)`: all three numbers are\nnonnegative and `ab + bc + ca = 2`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ ProductSumEqTwo a b c\n\n/-- The asserted inequality for a fixed triple of real numbers. -/\ndef Inequality (a b c : ℝ) : Prop :=\n Real.sqrt (a + a * b) + Real.sqrt (b + b * c) + Real.sqrt (c + c * a) ≥ 3\n\n/-- The full universally quantified statement of the problem: every nonnegative\nreal triple satisfying `ab + bc + ca = 2` satisfies the displayed inequality. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5bec9fe5-7582-53a5-be1c-75599f091d73", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "22ae76d0d6aa09679cb9cba185d1f0351d7eefbe273f007184dfbe270171cf49", "task_path": "tasks/nmp3_5bec9fe5-7582-53a5-be1c-75599f091d73", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5bec9fe5-7582-53a5-be1c-75599f091d73", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5bf239f4-5228-5ab4-a0f0-4ea659c4c34e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for positive real numbers $x,\\;y,\\;z$, \n-- \\[\n-- \\sum_{\\text{cyc}} x\\bigl(4x^{2}+5yz\\bigr)^{3}\\ge (x+y+z)^{7}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The positivity condition on the three real variables in the problem. -/\ndef PositiveTriple (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The cyclic sum `Σ_cyc x (4 x^2 + 5 y z)^3`, expanded over the three\ncyclic relabellings of the variables. -/\ndef CyclicSum (x y z : ℝ) : ℝ :=\n x * (4 * x ^ 2 + 5 * y * z) ^ 3 +\n y * (4 * y ^ 2 + 5 * z * x) ^ 3 +\n z * (4 * z ^ 2 + 5 * x * y) ^ 3\n\n/-- For all positive real numbers `x`, `y`, and `z`, the cyclic sum\n`Σ_cyc x (4 x^2 + 5 y z)^3` is at least `(x + y + z)^7`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, PositiveTriple x y z →\n CyclicSum x y z ≥ (x + y + z) ^ 7\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5bf239f4-5228-5ab4-a0f0-4ea659c4c34e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c6fc85b33eb558451ffbb51f41ab025ef6b887f5158fe780045b79eca8e36cdb", "task_path": "tasks/nmp3_5bf239f4-5228-5ab4-a0f0-4ea659c4c34e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5bf239f4-5228-5ab4-a0f0-4ea659c4c34e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5bfba906-75ff-5aed-b322-95b1330cf16a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$ with $a+b+c=3$, prove that\n-- \\[\n-- \\frac{a}{b^{3}+1}+\\frac{b}{c^{3}+1}+\\frac{c}{a^{3}+1}\\ge \\frac32\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissible triples from the problem: three positive real numbers whose sum is 3. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The cyclic inequality asserted for an admissible triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (a / (b ^ 3 + 1) + b / (c ^ 3 + 1) + c / (a ^ 3 + 1) : ℝ) ≥ (3 : ℝ) / 2\n\n/-- The complete statement: for every triple of positive real numbers with sum 3,\nthe cyclic sum is at least 3/2. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5bfba906-75ff-5aed-b322-95b1330cf16a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "167e96db717045f51a26e959fe129698eaa3f4059b5fc014c8a2aff1f8257c87", "task_path": "tasks/nmp3_5bfba906-75ff-5aed-b322-95b1330cf16a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5bfba906-75ff-5aed-b322-95b1330cf16a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5c199a4f-0831-5f56-9aac-13459a21ff98", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be a prime number and let $k$ be an integer with $0\\le k 0`, this is the usual statement that the positive\ninteger `n` is prime. -/\ndef Target : Prop :=\n ∀ (p : ℕ), Nat.Prime p →\n ∀ (k : ℤ), 0 ≤ k → k < (p : ℤ) →\n ¬ (nInt p k ∣ ((2 : ℤ) ^ k.toNat - 1)) →\n nInt p k ∣ ((2 : ℤ) ^ ((nInt p k - 1).toNat) - 1) →\n Nat.Prime (nInt p k).natAbs\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c199a4f-0831-5f56-9aac-13459a21ff98", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dd56ec45c7a7e412265a6b0344209ae4773ed8cadbc63b32bdfc627858a24a18", "task_path": "tasks/nmp3_5c199a4f-0831-5f56-9aac-13459a21ff98", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c199a4f-0831-5f56-9aac-13459a21ff98", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5c3c5f2b-662b-5859-b67e-1839507b9ee5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x_1,x_2,\\dots,x_n$ be positive real numbers (with the cyclic convention $x_{n+1}=x_1$). Prove that \n-- \\[\n-- \\sum_{i=1}^{n}\\frac{x_i^{5}}{\\,x_i^{4}+x_i^{2}x_{i+1}^{2}+4x_{i+1}^{4}\\,}\\;\\ge\\;\\frac{x_1+x_2+\\cdots+x_n}{6}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of a cyclic inequality\n\nThe source problem asks to prove, for positive real numbers `x₁, …, xₙ` indexed\ncyclically, the inequality\n\n`∑ i, xᵢ^5 / (xᵢ^4 + xᵢ^2 xᵢ₊₁^2 + 4 xᵢ₊₁^4) ≥ (∑ i, xᵢ) / 6`.\n\nThe declarations below only state the problem. In particular, `Target` is a\n`Prop`-valued definition and is not proved here.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The cyclic successor of an index in `Fin n`, for `n > 0`. The last index\n`⟨n - 1, _⟩` is sent to `⟨0, _⟩`, implementing the convention `x (n+1) = x 1`. -/\ndef cyclicSucc {n : ℕ} (hn : 0 < n) (i : Fin n) : Fin n :=\n ⟨(i.val + 1) % n, Nat.mod_lt _ hn⟩\n\n/-- The assertion that all coordinates of a finite real sequence are positive. -/\ndef IsPositive {n : ℕ} (x : Fin n → ℝ) : Prop :=\n ∀ i : Fin n, 0 < x i\n\n/-- The `i`-th summand on the left-hand side of the cyclic inequality. -/\ndef summand {n : ℕ} (hn : 0 < n) (x : Fin n → ℝ) (i : Fin n) : ℝ :=\n x i ^ 5 /\n (x i ^ 4 + x i ^ 2 * x (cyclicSucc hn i) ^ 2 +\n 4 * x (cyclicSucc hn i) ^ 4)\n\n/-- The left-hand side of the cyclic inequality. -/\ndef lhs {n : ℕ} (hn : 0 < n) (x : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, summand hn x i\n\n/-- The right-hand side of the cyclic inequality. -/\ndef rhs {n : ℕ} (x : Fin n → ℝ) : ℝ :=\n (∑ i : Fin n, x i) / 6\n\n/-- The complete statement of the source problem: for every positive length `n`\nand every positive real cyclic sequence `x`, the stated sum inequality holds. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (hn : 0 < n) (x : Fin n → ℝ),\n IsPositive x → lhs hn x ≥ rhs x\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c3c5f2b-662b-5859-b67e-1839507b9ee5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "655c0bbaa8521877b6fe49a4f796de0beea7c728fad07f305f4f45ec960b880a", "task_path": "tasks/nmp3_5c3c5f2b-662b-5859-b67e-1839507b9ee5", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c3c5f2b-662b-5859-b67e-1839507b9ee5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5c3eed31-8ea8-55a3-9c30-d217e475edec", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that $ab+bc+ca=3$. Prove that \n-- \\[\n-- \\frac{a+3}{b^2+1}+\\frac{b+3}{c^2+1}+\\frac{c+3}{a^2+1}\\ge 6.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/--\nThe left-hand side of the inequality in the problem:\n`(a + 3) / (b ^ 2 + 1) + (b + 3) / (c ^ 2 + 1) +\n (c + 3) / (a ^ 2 + 1)`.\n-/\ndef LHS (a b c : ℝ) : ℝ :=\n (a + 3) / (b ^ 2 + 1) +\n (b + 3) / (c ^ 2 + 1) +\n (c + 3) / (a ^ 2 + 1)\n\n/--\nThe assertion in the problem: for all positive real numbers `a`, `b`, and `c`\nsatisfying `a * b + b * c + c * a = 3`, the left-hand side is at least six.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b + b * c + c * a = (3 : ℝ) →\n LHS a b c ≥ (6 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c3eed31-8ea8-55a3-9c30-d217e475edec", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cba584cd046404f155a6558c056b807884342dbcbc5e29356eb697b8b9c790fb", "task_path": "tasks/nmp3_5c3eed31-8ea8-55a3-9c30-d217e475edec", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c3eed31-8ea8-55a3-9c30-d217e475edec", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5c519186-c422-5090-9bd4-c29c43744b1c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- (a+b+c)^2\\Bigg(\\frac{1}{a^2+ab+b^2}+\\frac{1}{b^2+bc+c^2}+\\frac{1}{c^2+ca+a^2}\\Bigg)\\ge 9\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for a positive-real cyclic inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthat\n`(a + b + c)^2 * (1/(a^2 + ab + b^2) + 1/(b^2 + bc + c^2)\n + 1/(c^2 + ca + a^2)) ≥ 9`.\n\nThe assertion is recorded as a proposition-valued definition. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The complete assertion of the source problem.\n\nThe three variables range over `ℝ` and are all assumed strictly positive. The\ndenominators use ordinary real multiplication and real division, and `ab`, `bc`,\nand `ca` are represented by `a * b`, `b * c`, and `c * a`, respectively. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n (9 : ℝ) ≤ (a + b + c) ^ 2 *\n (1 / (a ^ 2 + a * b + b ^ 2) +\n 1 / (b ^ 2 + b * c + c ^ 2) +\n 1 / (c ^ 2 + c * a + a ^ 2))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c519186-c422-5090-9bd4-c29c43744b1c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4377c98bc4fa46c3fa235e0c6c51b1bf4031a27913b45ac42b3c867c45c4f129", "task_path": "tasks/nmp3_5c519186-c422-5090-9bd4-c29c43744b1c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c519186-c422-5090-9bd4-c29c43744b1c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5c64905a-cfd7-591a-8bc0-5298461e675d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c>0$, prove that \n-- \\[\n-- \\frac{a^{3}+b^{3}}{b^{2}+c^{2}}+\\frac{b^{3}+c^{3}}{c^{2}+a^{2}}+\\frac{c^{3}+a^{3}}{a^{2}+b^{2}}\\ge a+b+c\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side and right-hand side comparison from the problem, for\narbitrary real numbers `a`, `b`, and `c`.\n\nThe division here is division in `ℝ`; no hypothesis on the denominators is\nbuilt into this predicate. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (a ^ 3 + b ^ 3) / (b ^ 2 + c ^ 2) +\n (b ^ 3 + c ^ 3) / (c ^ 2 + a ^ 2) +\n (c ^ 3 + a ^ 3) / (a ^ 2 + b ^ 2) ≥\n a + b + c\n\n/-- The complete assertion: for all positive real numbers `a`, `b`, and `c`,\nthe cyclic sum of the three displayed fractions is at least `a + b + c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c64905a-cfd7-591a-8bc0-5298461e675d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0b16446e689f93218f02952e16473ccd47d374c6642d95f620ad3443b36e5b4a", "task_path": "tasks/nmp3_5c64905a-cfd7-591a-8bc0-5298461e675d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c64905a-cfd7-591a-8bc0-5298461e675d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5c67ba1e-e3f0-51fd-9f4c-cacd1ae7d393", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a+b+c=3$. Prove that\n-- $$6\\Bigl(\\frac a b+\\frac b c+\\frac c a\\Bigr)+3\\ge 7\\bigl(a^2+b^2+c^2\\bigr).$$\nimport Mathlib\n\n/-!\n# Formal statement for the given inequality problem\n\nThe supplied problem asks to prove that, for all positive real numbers `a`, `b`,\nand `c` whose sum is `3`, a particular numerical inequality holds. This file\nonly states that assertion as a proposition; it does not assert or prove it.\n-/\n\nnamespace Problem\n\n/-- The admissibility side conditions on the three real variables from the\nproblem: all are positive and their sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The asserted inequality, with all divisions interpreted as division in `ℝ`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n 6 * (a / b + b / c + c / a) + 3 ≥\n 7 * (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The complete statement to be proved: for every triple of positive real\nnumbers with sum `3`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c67ba1e-e3f0-51fd-9f4c-cacd1ae7d393", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0ad07ec0cd6518dfe2d219d192b8b3fb0d0109e689c5f8dd73287cbf827855a0", "task_path": "tasks/nmp3_5c67ba1e-e3f0-51fd-9f4c-cacd1ae7d393", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c67ba1e-e3f0-51fd-9f4c-cacd1ae7d393", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5c71e49c-6612-5190-93fb-e8f8a17d1040", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ and define three sequences $\\{a_k\\},\\{b_k\\},\\{c_k\\}$ by \n-- \\[\n-- a_{k+1}=a_k+\\frac{2}{b_k+c_k},\\qquad \n-- b_{k+1}=b_k+\\frac{2}{c_k+a_k},\\qquad \n-- c_{k+1}=c_k+\\frac{2}{a_k+b_k},\n-- \\] \n-- for all integers $k\\ge0$ (with $a_0=a,\\;b_0=b,\\;c_0=c$). Prove that \n-- \\[\n-- \\lim_{k\\to\\infty}a_k=\\lim_{k\\to\\infty}b_k=\\lim_{k\\to\\infty}c_k=+\\infty.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a_{k+1} = a_k + 2 / (b_k + c_k), etc.\n\nThe problem concerns three real sequences indexed by nonnegative integers. We\nencode the sequences by a recursively defined state, so the recurrence and the\ninitial-value conditions are definitional. The conclusion uses the order\nfilter `atTop` on `ℝ`, which is the standard filter formulation of divergence\nto `+∞` for real-valued sequences.\n-/\n\nopen Filter\nopen scoped Topology\n\nnamespace Problem\n\n/-- A state consisting of the three current terms of the sequences. -/\nstructure State where\n a : ℝ\n b : ℝ\n c : ℝ\n\n/-- One simultaneous update of the three sequences. -/\nnoncomputable def step (s : State) : State :=\n { a := s.a + (2 : ℝ) / (s.b + s.c)\n b := s.b + (2 : ℝ) / (s.c + s.a)\n c := s.c + (2 : ℝ) / (s.a + s.b) }\n\n/-- The orbit of an initial state under the simultaneous update. -/\nnoncomputable def orbit (s : State) : ℕ → State\n | 0 => s\n | n + 1 => step (orbit s n)\n\n/-- The first coordinate sequence, with initial values `a`, `b`, `c`. -/\nnoncomputable def seqA (a b c : ℝ) (n : ℕ) : ℝ :=\n (orbit ⟨a, b, c⟩ n).a\n\n/-- The second coordinate sequence, with initial values `a`, `b`, `c`. -/\nnoncomputable def seqB (a b c : ℝ) (n : ℕ) : ℝ :=\n (orbit ⟨a, b, c⟩ n).b\n\n/-- The third coordinate sequence, with initial values `a`, `b`, `c`. -/\nnoncomputable def seqC (a b c : ℝ) (n : ℕ) : ℝ :=\n (orbit ⟨a, b, c⟩ n).c\n\n@[simp]\ntheorem seqA_zero (a b c : ℝ) : seqA a b c 0 = a := rfl\n\n@[simp]\ntheorem seqB_zero (a b c : ℝ) : seqB a b c 0 = b := rfl\n\n@[simp]\ntheorem seqC_zero (a b c : ℝ) : seqC a b c 0 = c := rfl\n\n@[simp]\ntheorem seqA_succ (a b c : ℝ) (n : ℕ) :\n seqA a b c (n + 1) =\n seqA a b c n + (2 : ℝ) / (seqB a b c n + seqC a b c n) := rfl\n\n@[simp]\ntheorem seqB_succ (a b c : ℝ) (n : ℕ) :\n seqB a b c (n + 1) =\n seqB a b c n + (2 : ℝ) / (seqC a b c n + seqA a b c n) := rfl\n\n@[simp]\ntheorem seqC_succ (a b c : ℝ) (n : ℕ) :\n seqC a b c (n + 1) =\n seqC a b c n + (2 : ℝ) / (seqA a b c n + seqB a b c n) := rfl\n\n/-- The three initial terms are all strictly positive. -/\ndef PositiveInitial (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/--\nFor every strictly positive initial triple, the three sequences generated by\nthe recurrence tend to `+∞`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n PositiveInitial a b c →\n Tendsto (seqA a b c) atTop atTop ∧\n Tendsto (seqB a b c) atTop atTop ∧\n Tendsto (seqC a b c) atTop atTop\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c71e49c-6612-5190-93fb-e8f8a17d1040", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fd3849676755b58f3afd5c0b595cde30646d03bb79ecce4478df71295d1229ba", "task_path": "tasks/nmp3_5c71e49c-6612-5190-93fb-e8f8a17d1040", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c71e49c-6612-5190-93fb-e8f8a17d1040", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5c9539a7-a933-52e5-995b-5d1f7a2c2ad7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that in every pre‑Hilbert space (a vector space equipped with an inner product) the following inequality holds for all vectors \\(a,b,c,d\\):\n-- \\[\n-- \\|a-b\\|\\,\\|c-d\\| \\;+\\; \\|b-c\\|\\,\\|a-d\\| \\;\\ge\\; \\|a-c\\|\\,\\|b-d\\|,\n-- \\]\n-- where \\(\\|\\cdot\\|\\) denotes the norm induced by the inner product.\n/-\nFormal statement of the four-point (Ptolemy) inequality in a pre-Hilbert space.\n\nA pre-Hilbert space is represented by Mathlib's `InnerProductSpace` typeclass over\nan `RCLike` scalar field (so the field is either `ℝ` or `ℂ`), together with a\n`NormedAddCommGroup` structure. The typeclass contains the compatibility axiom\nthat the norm is the one induced by the inner product. Completeness is *not*\nassumed, which is exactly the distinction between a pre-Hilbert and a Hilbert\nspace.\n-/\n\nimport Mathlib.Analysis.InnerProductSpace.Basic\n\nnoncomputable section\n\nnamespace Problem\n\nuniverse u v\n\n/-- In every pre-Hilbert space, for all vectors `a`, `b`, `c`, `d`, the norm\nsatisfies\n`‖a - b‖ * ‖c - d‖ + ‖b - c‖ * ‖a - d‖ ≥ ‖a - c‖ * ‖b - d‖`.\n-/\ndef Target : Prop :=\n ∀ (𝕜 : Type u) (E : Type v) [RCLike 𝕜] [NormedAddCommGroup E]\n [InnerProductSpace 𝕜 E], ∀ a b c d : E,\n ‖a - b‖ * ‖c - d‖ + ‖b - c‖ * ‖a - d‖ ≥\n ‖a - c‖ * ‖b - d‖\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c9539a7-a933-52e5-995b-5d1f7a2c2ad7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "039b6d845d917740c8d071d65286407bd5698cf580bd5ad9bbf431971ab6fda2", "task_path": "tasks/nmp3_5c9539a7-a933-52e5-995b-5d1f7a2c2ad7", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5c9539a7-a933-52e5-995b-5d1f7a2c2ad7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5caa4008-c33f-5252-883f-66a936128854", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for every positive integer $n$ there exist $n$ consecutive positive integers none of which is divisible by the sum of its decimal digits. (Equivalently, calling a number *good* if it is not divisible by the sum of its digits, prove that for every $n$ there are $n$ consecutive good numbers.)\nimport Mathlib.Data.Nat.Digits.Defs\n\n/-!\n# Formal statement of the consecutive-good-numbers problem\n\nA natural number is *good* when the sum of its decimal digits does not divide it.\nThe target says that for every positive number `n`, there is a block of `n`\nconsecutive positive natural numbers, all of which are good.\n-/\n\nnamespace Problem\n\n/-- The sum of the decimal digits of a natural number.\n\n`Nat.digits 10 n` is Mathlib's list of base-ten digits of `n`, in little-endian\norder and without leading zeroes. Its sum is therefore exactly the usual sum\nof the decimal digits of `n`. -/\ndef decimalDigitSum (n : ℕ) : ℕ :=\n (Nat.digits 10 n).sum\n\n/-- A number is good if it is not divisible by the sum of its decimal digits. -/\ndef Good (n : ℕ) : Prop :=\n ¬ decimalDigitSum n ∣ n\n\n/-- The block `a, a + 1, ..., a + (n - 1)` consists of `n` consecutive good\nnumbers. The inequality `i < n` selects exactly the `n` indices from `0` to\n`n - 1`, and each member uses its own decimal digit sum through `Good`. -/\ndef ConsecutiveGood (n a : ℕ) : Prop :=\n ∀ i : ℕ, i < n → Good (a + i)\n\n/-- For every positive integer `n`, there exist `n` consecutive positive\nintegers none of which is divisible by the sum of its own decimal digits.\n\nThe witness `a` is the first member of the block. Its positivity makes every\nmember positive, and `ConsecutiveGood n a` says that the `n` members are good. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ∃ a : ℕ, 0 < a ∧ ConsecutiveGood n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5caa4008-c33f-5252-883f-66a936128854", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2fe21461ea1ddba76a7fef80347682d7516d2234f9ae16804f66d29da535f94b", "task_path": "tasks/nmp3_5caa4008-c33f-5252-883f-66a936128854", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5caa4008-c33f-5252-883f-66a936128854", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5cad9708-686d-5568-9f5f-94def2a280da", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f$ be a function differentiable on $[0,1]$ (hence $f'$ exists on $(0,1)$) such that $f(0)=0$ and $f(1)=1$. Prove that there exist two distinct numbers $a,b\\in(0,1)$ with \n-- $$f'(a)\\,f'(b)=1.$$\nimport Mathlib.Analysis.Calculus.Deriv.Basic\n\n/-!\n# Formalization of the derivative-product statement\n\nThe original problem asks for a proof that every real-valued function which is\ndifferentiable on the closed interval `[0, 1]`, with endpoint values `0` and\n`1`, has two distinct interior points whose derivatives multiply to `1`.\n\nThe closed-interval differentiability convention used here is the standard one:\nthe function is continuous on `[0, 1]` and has an ordinary (two-sided)\nderivative at every point of `(0, 1)`.\n-/\n\nnamespace Problem\n\n/-- The standard closed-interval differentiability hypothesis, for a real-valued\nfunction represented as a total function `ℝ → ℝ`. -/\ndef DifferentiableOnClosedUnitInterval (f : ℝ → ℝ) : Prop :=\n ContinuousOn f (Set.Icc (0 : ℝ) 1) ∧\n DifferentiableOn ℝ f (Set.Ioo (0 : ℝ) 1)\n\n/-- The derivative-product conclusion: there are two distinct interior points\nwhose derivatives multiply to one. -/\ndef HasTwoDistinctInteriorDerivativesProductOne (f : ℝ → ℝ) : Prop :=\n ∃ a b : ℝ,\n a ∈ Set.Ioo (0 : ℝ) 1 ∧\n b ∈ Set.Ioo (0 : ℝ) 1 ∧\n a ≠ b ∧ deriv f a * deriv f b = 1\n\n/-- The full mathematical assertion of the problem. It is stated as a\nproposition so that no proof is asserted in this declaration. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ,\n DifferentiableOnClosedUnitInterval f →\n f 0 = 0 →\n f 1 = 1 →\n HasTwoDistinctInteriorDerivativesProductOne f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5cad9708-686d-5568-9f5f-94def2a280da", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "90a089b242965c518df0a9bc7ab1deeaa90ba8fa54d1da103124d953d8c4e723", "task_path": "tasks/nmp3_5cad9708-686d-5568-9f5f-94def2a280da", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5cad9708-686d-5568-9f5f-94def2a280da", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5cb34ac5-e56a-5b38-9785-e689876789c7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ be real numbers such that not more than one of them is zero (i.e. no two of $a,b,c$ are simultaneously zero). Prove that \n-- \\[\n-- \\frac{a^{3}+3abc}{(b+c)^{2}}+\\frac{b^{3}+3abc}{(c+a)^{2}}+\\frac{c^{3}+3abc}{(a+b)^{2}}\\ge a+b+c\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Statement formalization\n\nSource problem: for nonnegative real numbers `a`, `b`, `c` with at most one\nof them equal to zero, prove the displayed cyclic inequality.\n\nThis file contains only the formal statement; no proof is supplied.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- At most one of `a`, `b`, and `c` is zero, expressed as the pairwise\ncondition that no two of the three numbers vanish simultaneously. -/\ndef AtMostOneZero (a b c : ℝ) : Prop :=\n ¬ (a = 0 ∧ b = 0) ∧\n ¬ (a = 0 ∧ c = 0) ∧\n ¬ (b = 0 ∧ c = 0)\n\n/-- The hypotheses of the source problem: `a`, `b`, and `c` are nonnegative\nreal numbers and at most one of them is zero. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ AtMostOneZero a b c\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a ^ 3 + (3 : ℝ) * a * b * c) / (b + c) ^ 2 +\n (b ^ 3 + (3 : ℝ) * a * b * c) / (c + a) ^ 2 +\n (c ^ 3 + (3 : ℝ) * a * b * c) / (a + b) ^ 2\n\n/-- The right-hand side of the displayed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n a + b + c\n\n/-- The asserted inequality, as a proposition depending on `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full target statement: for all nonnegative real `a`, `b`, and `c`\nwith at most one of them zero, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5cb34ac5-e56a-5b38-9785-e689876789c7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ddf60019cf7d8c2a210d4821e65b2059eb73b43f87a811cb0ce6b3b224fec73c", "task_path": "tasks/nmp3_5cb34ac5-e56a-5b38-9785-e689876789c7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5cb34ac5-e56a-5b38-9785-e689876789c7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5ce57fcb-f448-5086-9c87-8d7590cce808", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every integer $n>2$,\n-- \\[\n-- \\sum_{k=2}^{n}\\varphi(k)\\;\\ge\\;\\frac{n(n-1)}{4}+1,\n-- \\]\n-- where $\\varphi$ denotes Euler's totient function.\nimport Mathlib.Data.Nat.Totient\nimport Mathlib.Basic.Real.Basic\nimport Mathlib.Data.Int.Interval\nimport Mathlib.Algebra.BigOperators.Group.Finset.Basic\n\nnamespace Problem\n\n/--\nThe assertion of the problem: for every integer `n > 2`, the sum of Euler's\ntotient function over the integers `k` with `2 ≤ k ≤ n` is at least\n`n * (n - 1) / 4 + 1`, with the right-hand side evaluated in `ℝ`.\n\nThe summand is `Nat.totient k.toNat`; on the summation range `2 ≤ k`, the map\nfrom integers to naturals `Int.toNat` is the identity on the corresponding\npositive integers.\n-/\ndef Target : Prop :=\n ∀ n : ℤ, 2 < n →\n (∑ k ∈ Finset.Icc (2 : ℤ) n, (Nat.totient k.toNat : ℝ)) ≥\n ((n : ℝ) * ((n : ℝ) - 1)) / 4 + 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ce57fcb-f448-5086-9c87-8d7590cce808", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a6901b2907168bf03b3858513562318448c364882022c716ff0f46bc0c7633af", "task_path": "tasks/nmp3_5ce57fcb-f448-5086-9c87-8d7590cce808", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ce57fcb-f448-5086-9c87-8d7590cce808", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5ce887e1-16ec-50c6-8959-fcbd1d14679f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c>0$, prove that \n-- \\[\n-- \\frac{(a+b)(b+c)(c+a)}{8abc}\\;\\ge\\;\\frac{(a^2+b^2)(b^2+c^2)(c^2+a^2)}{(a^2+bc)(b^2+ca)(c^2+ab)}.\n-- \\]\nimport Mathlib.Data.Real.Basic\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`,\nthe product of the pairwise sums, divided by `8abc`, is at least the product of the\npairwise sums of squares, divided by the product of `a² + bc`, `b² + ca`, and\n`c² + ab`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n ((a + b) * (b + c) * (c + a)) / (8 * a * b * c) ≥\n ((a ^ 2 + b ^ 2) * (b ^ 2 + c ^ 2) * (c ^ 2 + a ^ 2)) /\n ((a ^ 2 + b * c) * (b ^ 2 + c * a) * (c ^ 2 + a * b))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ce887e1-16ec-50c6-8959-fcbd1d14679f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "65e135ff5258c0d9ab37126788116a382a72ee7749afd3ffc1cde9cf93bf90db", "task_path": "tasks/nmp3_5ce887e1-16ec-50c6-8959-fcbd1d14679f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ce887e1-16ec-50c6-8959-fcbd1d14679f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5d0bf704-113a-5eb8-9b18-1804f46af19c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c>0$, then \n-- \\[\n-- \\frac{a+3b}{b(b+c)^2}+\\frac{b+3c}{c(c+a)^2}+\\frac{c+3a}{a(a+b)^2}\\ge \\frac{9}{ab+bc+ca}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the positive-real inequality\n\nThe problem asks to establish, for positive real numbers `a`, `b`, and `c`,\nthe inequality\n\\[\n\\frac{a+3b}{b(b+c)^2}+\\frac{b+3c}{c(c+a)^2}+\\frac{c+3a}{a(a+b)^2}\n\\ge \\frac{9}{ab+bc+ca}.\n\\]\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a + 3 * b) / (b * (b + c) ^ 2) +\n (b + 3 * c) / (c * (c + a) ^ 2) +\n (c + 3 * a) / (a * (a + b) ^ 2)\n\n/-- The right-hand side of the inequality in the problem statement. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (9 : ℝ) / (a * b + b * c + c * a)\n\n/-- The inequality to be proved, for every triple of positive real numbers. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/--\nThe complete assertion of the problem: for all real numbers `a`, `b`, and `c`\nsatisfying `a > 0`, `b > 0`, and `c > 0`, the stated inequality holds.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5d0bf704-113a-5eb8-9b18-1804f46af19c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "69789c347f6ee905e2e94b74ecbd63e09b1cca43f7d485cf59d2f409b9f42ccc", "task_path": "tasks/nmp3_5d0bf704-113a-5eb8-9b18-1804f46af19c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5d0bf704-113a-5eb8-9b18-1804f46af19c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5d182fa4-f379-5625-b294-509aba21f2f2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For non‑negative real numbers $x$, $y$, $z$ satisfying $x^{2}+y^{2}+z^{2}+xyz=4$, prove that \n-- \\[\n-- 4\\le x(x+y)+y(y+z)+z(z+x)\\le 6\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The cyclic sum `x(x+y) + y(y+z) + z(z+x)` appearing in the conclusion. -/\ndef Objective (x y z : ℝ) : ℝ :=\n x * (x + y) + y * (y + z) + z * (z + x)\n\n/-- The hypothesis that `x`, `y`, and `z` are nonnegative and satisfy\n`x^2 + y^2 + z^2 + xyz = 4`. -/\ndef Constraint (x y z : ℝ) : Prop :=\n 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z ∧ x ^ 2 + y ^ 2 + z ^ 2 + x * y * z = 4\n\n/-- The assertion that for every triple of nonnegative reals satisfying\n`x^2 + y^2 + z^2 + xyz = 4`, the cyclic sum lies between `4` and `6`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Constraint x y z →\n 4 ≤ Objective x y z ∧ Objective x y z ≤ 6\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5d182fa4-f379-5625-b294-509aba21f2f2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a55db43b07e276203f54997b0ef84e0639bcc0916a6e4ee8d27845f2c69c4b11", "task_path": "tasks/nmp3_5d182fa4-f379-5625-b294-509aba21f2f2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5d182fa4-f379-5625-b294-509aba21f2f2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5d1cfb28-38e5-5abe-b645-167c01db821c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $x$, $y$ and $z$ are positive real numbers, prove that \n-- \\[\n-- \\frac{x^{2}}{x^{2}+xy+y^{2}}+\\frac{y^{2}}{y^{2}+yz+z^{2}}+\\frac{z^{2}}{z^{2}+zx+x^{2}}\\ge 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable cyclic inequality\n\nThe source problem asks to prove, for all positive real numbers `x`, `y`, and\n`z`, the inequality\n\n`x^2 / (x^2 + x*y + y^2) +\n y^2 / (y^2 + y*z + z^2) +\n z^2 / (z^2 + z*x + x^2) ≥ 1`.\n\nThe declarations below record the exact proposition with real addition,\nmultiplication, exponentiation, and division. They do not contain a proof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The side condition that the three real variables are positive. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The left-hand side of the cyclic inequality. -/\ndef lhs (x y z : ℝ) : ℝ :=\n x ^ 2 / (x ^ 2 + x * y + y ^ 2) +\n y ^ 2 / (y ^ 2 + y * z + z ^ 2) +\n z ^ 2 / (z ^ 2 + z * x + x ^ 2)\n\n/-- The asserted inequality for one triple of real numbers, without the\npositivity side condition. -/\ndef InequalityHolds (x y z : ℝ) : Prop :=\n lhs x y z ≥ 1\n\n/-- The complete universal assertion of the source problem: for every triple\nof positive real numbers, the cyclic sum is at least one. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → InequalityHolds x y z\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5d1cfb28-38e5-5abe-b645-167c01db821c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e480bc9ae766682738619fc7e1882d721b36e32c03b82c6ed4f19cf35ddb1015", "task_path": "tasks/nmp3_5d1cfb28-38e5-5abe-b645-167c01db821c", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5d1cfb28-38e5-5abe-b645-167c01db821c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5d3dae4b-15d1-50c8-9718-ba4c6c019823", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose that $\\le_1,\\dots,\\le_k$ are $k$ total orders on $\\mathbb N$ such that each $(\\mathbb N,\\le_i)$ is a well‑ordering (for $i=1,\\dots,k$). Prove that there exist two natural numbers $x\\neq y$ such that $x\\le_i y$ for every $i=1,\\dots,k\\,. $\nimport Mathlib\n\n/-!\n# Formalization of: common oriented pair for finitely many well-orders on `ℕ`\n\nThe source problem asks to prove that, given finitely many total well-orderings\n`≤₁, ..., ≤ₖ` of `ℕ`, there are distinct natural numbers `x` and `y` such that\n`x ≤ᵢ y` for every index `i`.\n\nThe relations are kept as explicit binary relations rather than as typeclass\ninstances, so that the statement records every order axiom and the\nleast-element property of a well-ordering.\n-/\n\nnamespace Problem\n\n/-- A binary relation on `ℕ` is a non-strict total order when it is reflexive,\nantisymmetric, transitive, and total. This is the interpretation of the\nsymbols `≤ᵢ` in the source. -/\ndef IsTotalOrderRel (r : ℕ → ℕ → Prop) : Prop :=\n (∀ x : ℕ, r x x) ∧\n (∀ x y : ℕ, r x y → r y x → x = y) ∧\n (∀ x y z : ℕ, r x y → r y z → r x z) ∧\n (∀ x y : ℕ, r x y ∨ r y x)\n\n/-- A relation on `ℕ` has least elements exactly when every nonempty subset of\n`ℕ` has a least element with respect to the relation. This is the\nleast-element condition used to express that `(ℕ, ≤ᵢ)` is a well-ordering. -/\ndef HasLeastElements (r : ℕ → ℕ → Prop) : Prop :=\n ∀ S : Set ℕ, S.Nonempty → ∃ m : ℕ, m ∈ S ∧ ∀ x : ℕ, x ∈ S → r m x\n\n/-- A well-order relation on `ℕ`, in the non-strict presentation of the source.\nIt consists of a total order together with the least-element property for all\nnonempty subsets. -/\ndef IsWellOrderRel (r : ℕ → ℕ → Prop) : Prop :=\n IsTotalOrderRel r ∧ HasLeastElements r\n\n/-- The complete assertion of the source problem.\n\nFor every natural number `k` and every family of binary relations\n`le : Fin k → ℕ → ℕ → Prop`, if every `le i` is a total order on `ℕ` and\nevery `(ℕ, le i)` is a well-ordering, then there exist distinct natural\nnumbers `x` and `y` such that `le i x y` holds for every index `i`.\n\nThe index `i : Fin k` represents the one-based label `i + 1`, so the family is\nexactly indexed by `i = 1, ..., k`. When `k = 0` the index type is empty; the\nconclusion is still the assertion that two distinct natural numbers exist. -/\ndef Target : Prop :=\n ∀ (k : ℕ) (le : Fin k → ℕ → ℕ → Prop),\n (∀ i : Fin k, IsTotalOrderRel (le i)) →\n (∀ i : Fin k, IsWellOrderRel (le i)) →\n ∃ x y : ℕ, x ≠ y ∧ ∀ i : Fin k, le i x y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5d3dae4b-15d1-50c8-9718-ba4c6c019823", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6c2ad3789c4515913e866762de088e475c6de1852a20014d0f72653cd3e16b28", "task_path": "tasks/nmp3_5d3dae4b-15d1-50c8-9718-ba4c6c019823", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5d3dae4b-15d1-50c8-9718-ba4c6c019823", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5d6a3d58-b729-57b9-88bd-3bcbd9183400", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be non‑negative real numbers such that \\(ab+bc+ca\\neq0\\). Prove the double inequality \n-- \\[\n-- \\frac{3(ab+bc+ca)}{2\\bigl(a^{2}b^{2}+b^{2}c^{2}+c^{2}a^{2}\\bigr)}\n-- \\;\\le\\;\n-- \\frac1{a^{2}+bc}+\\frac1{b^{2}+ca}+\\frac1{c^{2}+ab}\n-- \\;\\le\\;\n-- \\frac{3(a^{2}+b^{2}+c^{2})}{2\\bigl(a^{2}b^{2}+b^{2}c^{2}+c^{2}a^{2}\\bigr)}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of a three-variable double inequality\n\nFor non-negative real numbers `a`, `b`, and `c` with `ab + bc + ca ≠ 0`,\nthe source problem asserts\n`L(a,b,c) ≤ M(a,b,c) ≤ R(a,b,c)`, where these three real-valued expressions\nare defined below. The final declaration, `Problem.Target`, packages the\nuniversally quantified assertion as a proposition. No proof is supplied.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand expression in the source double inequality. -/\ndef LeftSide (a b c : ℝ) : ℝ :=\n ((3 : ℝ) * (a * b + b * c + c * a)) /\n ((2 : ℝ) * (a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2))\n\n/-- The three-term middle expression in the source double inequality. -/\ndef MiddleSide (a b c : ℝ) : ℝ :=\n 1 / (a ^ 2 + b * c) +\n 1 / (b ^ 2 + c * a) +\n 1 / (c ^ 2 + a * b)\n\n/-- The right-hand expression in the source double inequality. -/\ndef RightSide (a b c : ℝ) : ℝ :=\n ((3 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2)) /\n ((2 : ℝ) * (a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2))\n\n/-- The three variables are non-negative real numbers, componentwise. -/\ndef NonnegativeTriple (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The source hypothesis `ab + bc + ca ≠ 0`. -/\ndef PairwiseProductSumNeZero (a b c : ℝ) : Prop :=\n a * b + b * c + c * a ≠ 0\n\n/-- The complete admissibility condition on `(a,b,c)` from the source problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n NonnegativeTriple a b c ∧ PairwiseProductSumNeZero a b c\n\n/-- The double inequality relating the left, middle, and right sides. -/\ndef DoubleInequality (a b c : ℝ) : Prop :=\n LeftSide a b c ≤ MiddleSide a b c ∧\n MiddleSide a b c ≤ RightSide a b c\n\n/-- The full assertion of the source problem: for every admissible triple of\nreal numbers, the double inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → DoubleInequality a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5d6a3d58-b729-57b9-88bd-3bcbd9183400", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b85ad68a8935caa2fd85c7f599992e84c90933a3971f039bf5cc93beb72af1cc", "task_path": "tasks/nmp3_5d6a3d58-b729-57b9-88bd-3bcbd9183400", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5d6a3d58-b729-57b9-88bd-3bcbd9183400", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5d8f4a0e-4978-570c-b210-8aab1b50f1b6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for non‑negative real numbers $a,b,c$ satisfying $a+b+c=1$,\n-- \\[\n-- \\sqrt{a+(b-c)^2}+\\sqrt{b+(c-a)^2}+\\sqrt{c+(a-b)^2}\\ge\\sqrt3.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the problem.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n Real.sqrt (a + (b - c) ^ (2 : ℕ)) +\n Real.sqrt (b + (c - a) ^ (2 : ℕ)) +\n Real.sqrt (c + (a - b) ^ (2 : ℕ))\n\n/-- The admissibility conditions on the real numbers `a`, `b`, and `c`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a + b + c = (1 : ℝ)\n\n/-- The assertion to be proved: for every admissible triple, the left-hand side is\nat least `Real.sqrt 3`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → LeftHandSide a b c ≥ Real.sqrt (3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5d8f4a0e-4978-570c-b210-8aab1b50f1b6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8afa3733d7d5a35f80d6cc2cffe5f77bf8258a7d36ab993edf4d6fd31432fc4b", "task_path": "tasks/nmp3_5d8f4a0e-4978-570c-b210-8aab1b50f1b6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5d8f4a0e-4978-570c-b210-8aab1b50f1b6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5da7eaef-8205-517d-901b-6e3a69f7925d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers \\(a,b,c\\) prove that \n-- \\[\n-- \\frac{16a^{2}b^{2}}{\\sqrt{2a^{2}b^{2}+abc^{2}+c^{4}}}+\\frac{16b^{2}c^{2}}{\\sqrt{2b^{2}c^{2}+bca^{2}+a^{4}}}+\\frac{16c^{2}a^{2}}{\\sqrt{2c^{2}a^{2}+acb^{2}+b^{4}}}+3(a^{2}+b^{2}+c^{2})\\ge 11(ab+bc+ca)\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the positive-real inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe stated lower bound. This file records the quantified proposition as a\ndefinition; it intentionally contains no proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The source problem's admissibility condition: all three variables are\nstrictly positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The first fractional summand in the source inequality. -/\ndef firstTerm (a b c : ℝ) : ℝ :=\n 16 * a ^ 2 * b ^ 2 /\n Real.sqrt (2 * a ^ 2 * b ^ 2 + a * b * c ^ 2 + c ^ 4)\n\n/-- The second fractional summand in the source inequality. -/\ndef secondTerm (a b c : ℝ) : ℝ :=\n 16 * b ^ 2 * c ^ 2 /\n Real.sqrt (2 * b ^ 2 * c ^ 2 + b * c * a ^ 2 + a ^ 4)\n\n/-- The third fractional summand in the source inequality. -/\ndef thirdTerm (a b c : ℝ) : ℝ :=\n 16 * c ^ 2 * a ^ 2 /\n Real.sqrt (2 * c ^ 2 * a ^ 2 + a * c * b ^ 2 + b ^ 4)\n\n/-- The left-hand side of the source inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n firstTerm a b c + secondTerm a b c + thirdTerm a b c +\n 3 * (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The right-hand side of the source inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 11 * (a * b + b * c + c * a)\n\n/-- The inequality asserted by the source problem, before quantifying over its\npositive-real domain. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete source assertion: for every triple of positive real numbers,\nthe stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5da7eaef-8205-517d-901b-6e3a69f7925d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "293838430928bd2b71a95baab492036cbfa13b46499ee75339fa952ba6abaf07", "task_path": "tasks/nmp3_5da7eaef-8205-517d-901b-6e3a69f7925d", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5da7eaef-8205-517d-901b-6e3a69f7925d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5dc51020-ac7a-59e7-a331-1b8cc8ed64d6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- $$\\frac{a^2+2bc}{a}+\\frac{b^2+2ca}{b}+\\frac{c^2+2ab}{c}\\ge\\sqrt{5a^2+4b^2}+\\sqrt{5b^2+4c^2}+\\sqrt{5c^2+4a^2}\\,. $$\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthe displayed inequality. This file records the assertion as a proposition.\nNo proof is provided at the statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality:\n`(a^2 + 2bc)/a + (b^2 + 2ca)/b + (c^2 + 2ab)/c`. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n (a ^ 2 + 2 * b * c) / a +\n (b ^ 2 + 2 * c * a) / b +\n (c ^ 2 + 2 * a * b) / c\n\n/-- The right-hand side of the displayed inequality:\n`sqrt(5a^2 + 4b^2) + sqrt(5b^2 + 4c^2) + sqrt(5c^2 + 4a^2)`. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n Real.sqrt (5 * a ^ 2 + 4 * b ^ 2) +\n Real.sqrt (5 * b ^ 2 + 4 * c ^ 2) +\n Real.sqrt (5 * c ^ 2 + 4 * a ^ 2)\n\n/-- The displayed inequality for a particular real triple. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n rightHandSide a b c ≤ leftHandSide a b c\n\n/-- The full assertion of the problem: for all positive real `a`, `b`, and `c`,\nthe displayed inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5dc51020-ac7a-59e7-a331-1b8cc8ed64d6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0caf090b3fba582ad0705abc157019d5cdce3f573908178ccaef2e0f0f725799", "task_path": "tasks/nmp3_5dc51020-ac7a-59e7-a331-1b8cc8ed64d6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5dc51020-ac7a-59e7-a331-1b8cc8ed64d6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5dd5113b-e753-5ef6-bccd-44a4d4567126", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that $abc=1$. Prove that \n-- \\[\n-- \\frac{a}{b^{2}+c^{2}+a}+\\frac{b}{c^{2}+a^{2}+b}+\\frac{c}{a^{2}+b^{2}+c}\\le 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the inequality problem\n\nThe original problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwith `a * b * c = 1`, that\n\n`a / (b ^ 2 + c ^ 2 + a) + b / (c ^ 2 + a ^ 2 + b)\n + c / (a ^ 2 + b ^ 2 + c) ≤ 1`.\n\nThis file only states the target; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved in the problem.\n\nFor all positive real numbers `a`, `b`, and `c` satisfying `a * b * c = 1`,\nthe displayed sum of three rational terms is at most `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n a / (b ^ 2 + c ^ 2 + a) +\n b / (c ^ 2 + a ^ 2 + b) +\n c / (a ^ 2 + b ^ 2 + c) ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5dd5113b-e753-5ef6-bccd-44a4d4567126", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9e1e3f9b88d1ce8901ff2f0e2b1f1862344841f18cfb36e13b065a9568c247ee", "task_path": "tasks/nmp3_5dd5113b-e753-5ef6-bccd-44a4d4567126", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5dd5113b-e753-5ef6-bccd-44a4d4567126", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5e0b434f-1edc-5280-916a-92c705230b0a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a finite set $P$ of prime numbers, prove that there exists a positive integer $x$ such that for every $p\\in P$ the number $x$ can be written in the form $a^p+b^p$ with $a,b$ positive integers, and for every prime $p\\notin P$ the number $x$ cannot be written in that form.\nimport Mathlib\n\n/-!\n# Formalization of the prime-power sum problem\n\nFor every finite set `P` of prime numbers, there is a positive integer `x`\nwhich is a sum of two positive `p`-th powers exactly for the primes `p`\nbelonging to `P`.\n-/\n\nnamespace Problem\n\n/-- `Representable x p` means that `x` can be written as `a ^ p + b ^ p`\nfor some positive natural numbers `a` and `b`. -/\ndef Representable (x p : ℕ) : Prop :=\n ∃ a b : ℕ, 0 < a ∧ 0 < b ∧ x = a ^ p + b ^ p\n\n/-- The requirement that `x` be representable for every exponent `p` in the\nfinite set `P`. -/\ndef RepresentableForSet (P : Finset ℕ) (x : ℕ) : Prop :=\n ∀ p : ℕ, p ∈ P → Representable x p\n\n/-- The requirement that `x` not be representable for any prime `p` outside\nthe finite set `P`. -/\ndef NotRepresentableOutsidePrimeSet (P : Finset ℕ) (x : ℕ) : Prop :=\n ∀ p : ℕ, Nat.Prime p → p ∉ P → ¬ Representable x p\n\n/-- A positive `x` satisfying both required representability conditions for\nthe finite set `P`. -/\ndef IsSolution (P : Finset ℕ) (x : ℕ) : Prop :=\n 0 < x ∧ RepresentableForSet P x ∧ NotRepresentableOutsidePrimeSet P x\n\n/-- The full assertion of the problem: for every finite set `P` of prime\nnumbers, there exists a positive integer `x` with the required\nrepresentability properties. -/\ndef Target : Prop :=\n ∀ P : Finset ℕ,\n (∀ p : ℕ, p ∈ P → Nat.Prime p) →\n ∃ x : ℕ, IsSolution P x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e0b434f-1edc-5280-916a-92c705230b0a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8a3b70bbed3383a62d1acc5ce7f6b2ddfaec152ca974d5cadfcfdf821eac1054", "task_path": "tasks/nmp3_5e0b434f-1edc-5280-916a-92c705230b0a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e0b434f-1edc-5280-916a-92c705230b0a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5e193823-92d7-5593-a062-7548a5e723cd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a$, $b$, and $c$, prove that \n-- \\[\n-- \\frac{a^5}{b^5}+\\frac{b^5}{c^5}+\\frac{c^5}{a^5}\\ge\\frac{(a+1)^5}{(b+1)^5}+\\frac{(b+1)^5}{(c+1)^5}+\\frac{(c+1)^5}{(a+1)^5}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`, the stated cyclic\ninequality between fifth powers holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n a ^ 5 / b ^ 5 + b ^ 5 / c ^ 5 + c ^ 5 / a ^ 5 ≥\n (a + 1) ^ 5 / (b + 1) ^ 5 +\n (b + 1) ^ 5 / (c + 1) ^ 5 +\n (c + 1) ^ 5 / (a + 1) ^ 5\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e193823-92d7-5593-a062-7548a5e723cd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f6add986452b36207470c3ecef7ec6489b7694c2bd05344cb9dd2c23d4fddac6", "task_path": "tasks/nmp3_5e193823-92d7-5593-a062-7548a5e723cd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e193823-92d7-5593-a062-7548a5e723cd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5e25d2de-9337-529f-9de5-695c2be6dfaf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers \\(a,b,c,x,y,z\\) the inequality\n-- \\[\n-- \\frac{x}{\\,y+z\\,}(b+c)\\;+\\;\\frac{y}{\\,z+x\\,}(c+a)\\;+\\;\\frac{z}{\\,x+y\\,}(a+b)\\;\\ge\\;\\sqrt{3\\bigl(ab+bc+ca\\bigr)}\n-- \\]\n-- holds.\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the proposed inequality\n\nThe problem asks to prove, for all positive real numbers `a`, `b`, `c`, `x`, `y`, and `z`,\nthe stated cyclic inequality involving real square roots.\n-/\n\nnamespace Problem\n\n/-- The assertion stated in the problem: for all positive reals `a, b, c, x, y, z`,\n`x / (y + z) * (b + c) + y / (z + x) * (c + a) + z / (x + y) * (a + b)`\nis at least `Real.sqrt (3 * (a * b + b * c + c * a))`. -/\ndef Target : Prop :=\n ∀ (a b c x y z : ℝ),\n 0 < a → 0 < b → 0 < c → 0 < x → 0 < y → 0 < z →\n x / (y + z) * (b + c) +\n y / (z + x) * (c + a) +\n z / (x + y) * (a + b) ≥\n Real.sqrt (3 * (a * b + b * c + c * a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e25d2de-9337-529f-9de5-695c2be6dfaf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c9c43791cef3d6ee330dc9d1a911fff948b89d4ec8a3b96b74df8d23e2605835", "task_path": "tasks/nmp3_5e25d2de-9337-529f-9de5-695c2be6dfaf", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e25d2de-9337-529f-9de5-695c2be6dfaf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5e3f1935-7a81-5137-b0bc-7a176fb6bbb7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ and $ab^2+bc^2+ca^2=3$. Prove that \n-- \\[\n-- \\frac{2a^5+3b^5}{ab}+\\frac{2b^5+3c^5}{bc}+\\frac{2c^5+3a^5}{ca}\\ge 15\\bigl(a^3+b^3+c^3-2\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the source inequality problem\n\nThe source asks for a proof of an inequality under the assumptions that three\npositive real numbers satisfy a cubic constraint. This file contains only\nthe formal statement; it deliberately contains no proof of the inequality.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypotheses for a triple `(a, b, c)`:\nall three numbers are positive and satisfy the cubic constraint\n`a * b^2 + b * c^2 + c * a^2 = 3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b ^ 2 + b * c ^ 2 + c * a ^ 2 = 3\n\n/-- The asserted inequality, as a predicate of arbitrary real triples.\n\nThe divisions are real divisions, and each denominator is the product of the\ntwo variables displayed adjacent to it in the source. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (2 * a ^ 5 + 3 * b ^ 5) / (a * b) +\n (2 * b ^ 5 + 3 * c ^ 5) / (b * c) +\n (2 * c ^ 5 + 3 * a ^ 5) / (c * a) ≥\n 15 * (a ^ 3 + b ^ 3 + c ^ 3 - 2)\n\n/-- The full formal target: for every positive real triple satisfying\n`a * b^2 + b * c^2 + c * a^2 = 3`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n a * b ^ 2 + b * c ^ 2 + c * a ^ 2 = 3 →\n Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e3f1935-7a81-5137-b0bc-7a176fb6bbb7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8a755b8317c3e9386516148040e913f215b36d6be03395a89484bdad9b36eefc", "task_path": "tasks/nmp3_5e3f1935-7a81-5137-b0bc-7a176fb6bbb7", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e3f1935-7a81-5137-b0bc-7a176fb6bbb7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5e4a7d72-474b-542a-91a3-b786e9b911ee", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every positive integer \\(n\\), the product of six consecutive positive integers\n-- \\[\n-- P=n(n+1)(n+2)(n+3)(n+4)(n+5)\n-- \\]\n-- is never a perfect square.\nimport Mathlib\n\n/-!\n# Formal statement for: six consecutive positive integers never form a square\n\nThe source problem asks to prove that for every positive integer `n`, the product\n`n(n+1)(n+2)(n+3)(n+4)(n+5)` is not a perfect square.\n-/\n\nnamespace Problem\n\n/-- The product of the six consecutive natural numbers starting at `n`. -/\ndef P (n : ℕ) : ℕ :=\n n * (n + 1) * (n + 2) * (n + 3) * (n + 4) * (n + 5)\n\n/-- A natural number is a perfect square when it is the square of a natural number. -/\ndef IsPerfectSquare (N : ℕ) : Prop :=\n ∃ m : ℕ, N = m ^ 2\n\n/-- For every positive integer `n`, the product of the six consecutive positive\nintegers `n, n+1, ..., n+5` is not a perfect square. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ¬ IsPerfectSquare (P n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e4a7d72-474b-542a-91a3-b786e9b911ee", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "db96d20f401e1064822eb0e00f4893d5950cacd47bdb46c5ea3aded6dde00cbb", "task_path": "tasks/nmp3_5e4a7d72-474b-542a-91a3-b786e9b911ee", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e4a7d72-474b-542a-91a3-b786e9b911ee", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5e679cb6-b4a8-569a-9ec4-b69046f6648c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers with $0\\le a,b,c\\le1$ and $a+b\\ge1,\\;b+c\\ge1,\\;c+a\\ge1$. Prove that \n-- \\[\n-- 1\\le (1-a)^2+(1-b)^2+(1-c)^2+\\frac{2\\sqrt2\\,abc}{\\sqrt{a^2+b^2+c^2}}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the inequality problem\n\nThe source problem asks for a proof of a real-variable inequality under the\nhypotheses `0 ≤ a, b, c ≤ 1` and the three pairwise lower bounds on sums.\nThe declarations below record the objects, hypotheses, expression, and target\nproposition. In accordance with the task, `Target` is a `Prop`-valued\ndefinition and no proof of it is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real numbers `a`, `b`, and `c`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ a ≤ 1 ∧\n 0 ≤ b ∧ b ≤ 1 ∧\n 0 ≤ c ∧ c ≤ 1 ∧\n 1 ≤ a + b ∧\n 1 ≤ b + c ∧\n 1 ≤ c + a\n\n/-- The real expression appearing on the right-hand side of the desired inequality. -/\nnoncomputable def Expression (a b c : ℝ) : ℝ :=\n (1 - a) ^ 2 + (1 - b) ^ 2 + (1 - c) ^ 2 +\n (2 * Real.sqrt 2 * a * b * c) /\n Real.sqrt (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The asserted lower bound for an admissible triple `(a,b,c).` -/\ndef Inequality (a b c : ℝ) : Prop :=\n 1 ≤ Expression a b c\n\n/--\nThe complete statement: for every three real numbers satisfying the source\nhypotheses, the displayed expression is at least `1`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e679cb6-b4a8-569a-9ec4-b69046f6648c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f8b442ec2dae6efb63c7b8a6ce9a9ecb0e5a7c1934470eb2b69c114b42e9a33d", "task_path": "tasks/nmp3_5e679cb6-b4a8-569a-9ec4-b69046f6648c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e679cb6-b4a8-569a-9ec4-b69046f6648c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5e6ef740-9cd8-51fc-8539-3f314f45b663", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute‑angled triangle with $AB Polynomial.C (a i) * Polynomial.X ^ (i : ℕ))\n + Polynomial.X ^ r\n\n/-- The polynomial\n`b_0 + b_1 X + ... + b_(s-1) X^(s-1) + X^s`,\nrepresented by its lower-degree coefficient function `b : Fin s → ℝ`. -/\nnoncomputable def rightPolynomial (s : ℕ) (b : Fin s → ℝ) : Polynomial ℝ :=\n (Finset.sum Finset.univ fun i : Fin s => Polynomial.C (b i) * Polynomial.X ^ (i : ℕ))\n + Polynomial.X ^ s\n\n/-- The right-hand side polynomial\n`1 + X + ... + X^(r+s)`. -/\nnoncomputable def geometricPolynomial (r s : ℕ) : Polynomial ℝ :=\n Finset.sum (Finset.range (r + s + 1)) fun k : ℕ => Polynomial.X ^ k\n\n/-- The hypotheses of the problem: the two degrees are positive, the listed\nlower coefficients are non-negative, and the polynomial identity holds. -/\ndef Hypotheses (r s : ℕ) (a : Fin r → ℝ) (b : Fin s → ℝ) : Prop :=\n 1 ≤ r ∧\n 1 ≤ s ∧\n (∀ i : Fin r, 0 ≤ a i) ∧\n (∀ j : Fin s, 0 ≤ b j) ∧\n leftPolynomial r a * rightPolynomial s b = geometricPolynomial r s\n\n/-- The conclusion of the problem: every lower coefficient on both sides is\neither `0` or `1`. -/\ndef Conclusion (r s : ℕ) (a : Fin r → ℝ) (b : Fin s → ℝ) : Prop :=\n (∀ i : Fin r, a i = 0 ∨ a i = 1) ∧\n (∀ j : Fin s, b j = 0 ∨ b j = 1)\n\n/-- Formal statement of the problem.\n\nFor all positive natural numbers `r` and `s`, all real lower-coefficient\nfunctions `a_0, ..., a_(r-1)` and `b_0, ..., b_(s-1)`, if all these\ncoefficients are non-negative and the two displayed monic polynomials have\nproduct equal to the polynomial `1 + X + ... + X^(r+s)`, then every one of\nthe coefficients `a_i` and `b_j` is either `0` or `1`. -/\ndef Target : Prop :=\n ∀ (r s : ℕ) (a : Fin r → ℝ) (b : Fin s → ℝ),\n Hypotheses r s a b → Conclusion r s a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e781dc4-3e73-591b-af8a-52e44ab58e72", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "44e789856dfc0d6a5dcbb17cb0cc975cb41f8fb013a108192063cd6424cec0b6", "task_path": "tasks/nmp3_5e781dc4-3e73-591b-af8a-52e44ab58e72", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5e781dc4-3e73-591b-af8a-52e44ab58e72", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5ea78d4b-75a3-5611-9383-211335e4987c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$ and $c$ be non‑negative numbers such that \n-- \\[\n-- 2\\bigl(a^3b+b^3c+c^3a\\bigr)=a^2b^2+a^2c^2+b^2c^2.\n-- \\] \n-- Prove that \n-- \\[\n-- 2ab(a-b)^2+2ac(a-c)^2+2bc(b-c)^2\\ge (ab+ac+bc)^2.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The admissibility hypothesis for `a`, `b`, and `c`: they are non-negative\nreal numbers and satisfy the given cyclic relation. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧\n 2 * (a ^ 3 * b + b ^ 3 * c + c ^ 3 * a) =\n a ^ 2 * b ^ 2 + a ^ 2 * c ^ 2 + b ^ 2 * c ^ 2\n\n/-- The inequality asserted for admissible `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (a * b + a * c + b * c) ^ 2 ≤\n 2 * a * b * (a - b) ^ 2 +\n 2 * a * c * (a - c) ^ 2 +\n 2 * b * c * (b - c) ^ 2\n\n/-- The complete statement: for every non-negative real triple satisfying the\ngiven relation, the asserted inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ea78d4b-75a3-5611-9383-211335e4987c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f50743e5d30d88f6bca41b4f2eab6477161b1f4f10dbe3f98d29c6a33d50d9f2", "task_path": "tasks/nmp3_5ea78d4b-75a3-5611-9383-211335e4987c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ea78d4b-75a3-5611-9383-211335e4987c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5ead29ce-4ac5-5393-88a5-07c95ce6f4b4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$, prove that if \n-- \\[\n-- 4abc\\ge a+b+c+1,\n-- \\] \n-- then \n-- \\[\n-- \\frac{a^7}{b^2}+\\frac{b^7}{c^2}+\\frac{c^7}{a^2}\\ge \n-- \\frac{a^5}{b}+\\frac{b^5}{c}+\\frac{c^5}{a}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three real variables are positive. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The hypothesis `4abc ≥ a + b + c + 1` from the problem. -/\ndef Hypothesis (a b c : ℝ) : Prop :=\n 4 * a * b * c ≥ a + b + c + 1\n\n/-- The target inequality `a^7/b^2 + b^7/c^2 + c^7/a^2 ≥ a^5/b + b^5/c + c^5/a`. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n a ^ 7 / b ^ 2 + b ^ 7 / c ^ 2 + c ^ 7 / a ^ 2 ≥\n a ^ 5 / b + b ^ 5 / c + c ^ 5 / a\n\n/-- For positive real numbers `a`, `b`, `c`, if `4abc ≥ a + b + c + 1`,\nthen `a^7/b^2 + b^7/c^2 + c^7/a^2 ≥ a^5/b + b^5/c + c^5/a`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → Hypothesis a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ead29ce-4ac5-5393-88a5-07c95ce6f4b4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8f78b2d27e4926ec23904c86c5356db49950d0e92c5b479cf11ee1eb07661028", "task_path": "tasks/nmp3_5ead29ce-4ac5-5393-88a5-07c95ce6f4b4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ead29ce-4ac5-5393-88a5-07c95ce6f4b4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5eb98680-d63f-5d5e-82cf-81d4eb307d80", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be non‑negative real numbers such that $a+b>0$, $b+c>0$, $c+a>0$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a}{\\,b+c\\,}}+\\sqrt{\\frac{b}{\\,a+c\\,}}+\\sqrt{\\frac{c}{\\,a+b\\,}}+\\frac{9\\sqrt{ab+bc+ca}}{a+b+c}\\ge 6\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the inequality in the problem. -/\ndef lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a / (b + c)) +\n Real.sqrt (b / (a + c)) +\n Real.sqrt (c / (a + b)) +\n 9 * Real.sqrt (a * b + b * c + c * a) / (a + b + c)\n\n/-- The assertion of the problem: for all non-negative real numbers `a`, `b`, and `c`\nsatisfying `a + b > 0`, `b + c > 0`, and `c + a > 0`, the stated expression is at\nleast `6`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a + b > 0 →\n b + c > 0 →\n c + a > 0 →\n lhs a b c ≥ 6\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5eb98680-d63f-5d5e-82cf-81d4eb307d80", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "484030b268f80d3b122a42970b8ec3cbbd1acd18dc092c0913a97b136a77fa56", "task_path": "tasks/nmp3_5eb98680-d63f-5d5e-82cf-81d4eb307d80", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5eb98680-d63f-5d5e-82cf-81d4eb307d80", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5ed344aa-3d9d-54b7-9dde-13cdc21ec977", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $ab+bc+ca=3$. Prove that \n-- \\[\n-- \\frac{a(b^2+c^2)}{a^2+bc}+\\frac{b(c^2+a^2)}{b^2+ca}+\\frac{c(a^2+b^2)}{c^2+ab}\\ge 3.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three variables are strictly positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The pairwise-product constraint `ab + bc + ca = 3`, over the reals. -/\ndef PairwiseProductSumEqThree (a b c : ℝ) : Prop :=\n a * b + b * c + c * a = (3 : ℝ)\n\n/-- The full admissibility hypothesis from the problem statement. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositiveTriple a b c ∧ PairwiseProductSumEqThree a b c\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a * (b ^ 2 + c ^ 2) / (a ^ 2 + b * c) +\n b * (c ^ 2 + a ^ 2) / (b ^ 2 + c * a) +\n c * (a ^ 2 + b ^ 2) / (c ^ 2 + a * b)\n\n/-- The full claim: for all positive real `a`, `b`, and `c` satisfying\n`a*b + b*c + c*a = 3`, the displayed sum is at least `3`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → (3 : ℝ) ≤ LHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ed344aa-3d9d-54b7-9dde-13cdc21ec977", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a05f7a2c53fcf3a1ed822c8363eb5e1750dd178c7069b124453e0981cafb8dd5", "task_path": "tasks/nmp3_5ed344aa-3d9d-54b7-9dde-13cdc21ec977", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ed344aa-3d9d-54b7-9dde-13cdc21ec977", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5f38765f-c58e-546d-80e5-9d35656f1ab4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers satisfying $a^{2}+b^{2}+c^{2}+abc=4$. Prove that \n-- \\[\n-- \\sqrt{(4-a^{2})(4-b^{2})}+\\sqrt{(4-b^{2})(4-c^{2})}+\\sqrt{(4-c^{2})(4-a^{2})}\\ge (2+\\sqrt{abc})^{2}.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The admissibility conditions on the three positive real parameters. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 2 + b ^ 2 + c ^ 2 + a * b * c = 4\n\n/-- The left-hand side of the asserted inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n Real.sqrt ((4 - a ^ 2) * (4 - b ^ 2)) +\n Real.sqrt ((4 - b ^ 2) * (4 - c ^ 2)) +\n Real.sqrt ((4 - c ^ 2) * (4 - a ^ 2))\n\n/-- The right-hand side of the asserted inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (2 + Real.sqrt (a * b * c)) ^ 2\n\n/-- The asserted inequality under the admissibility conditions. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full universally quantified statement of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5f38765f-c58e-546d-80e5-9d35656f1ab4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "abceaf78600af600663493ff0974e662ffec5ebbd17cf124cabc05d8d153fa67", "task_path": "tasks/nmp3_5f38765f-c58e-546d-80e5-9d35656f1ab4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5f38765f-c58e-546d-80e5-9d35656f1ab4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5f618ef2-2078-5f5b-bc93-82965ca47c90", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the sides of a triangle. Prove that \n-- \\[\n-- \\frac{a}{b^{2}+ca}+\\frac{b}{c^{2}+ab}+\\frac{c}{a^{2}+bc}\\ge \\frac{(a+b+c)^{3}}{6\\,(ab^{3}+bc^{3}+ca^{3})}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The real numbers `a`, `b`, and `c` are the side lengths of a nondegenerate\nEuclidean triangle: they are positive and satisfy the three strict triangle\ninequalities. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a < b + c ∧ b < c + a ∧ c < a + b\n\n/-- The inequality asserted in the problem for real numbers `a`, `b`, and `c`.\nThe divisions are the usual division in `ℝ`. -/\ndef TriangleInequality (a b c : ℝ) : Prop :=\n a / (b ^ 2 + c * a) + b / (c ^ 2 + a * b) + c / (a ^ 2 + b * c) ≥\n (a + b + c) ^ 3 / (6 * (a * b ^ 3 + b * c ^ 3 + c * a ^ 3))\n\n/-- The complete universal statement: for every triple of positive real numbers\nsatisfying the strict triangle inequalities, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsTriangleSideLengths a b c → TriangleInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5f618ef2-2078-5f5b-bc93-82965ca47c90", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "49ea35c821168dc9fa06ebb67ec7edb0f5ba49a07f3c8d68e3903ef1e773a959", "task_path": "tasks/nmp3_5f618ef2-2078-5f5b-bc93-82965ca47c90", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5f618ef2-2078-5f5b-bc93-82965ca47c90", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5f852544-35ed-5a15-956f-d02d98988d05", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,\\;b,\\;c$ be positive real numbers such that $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{a^{5}(b+2c)^{2}}+\\frac{1}{b^{5}(c+2a)^{2}}+\\frac{1}{c^{5}(a+2b)^{2}}\\ge\\frac13\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic reciprocal inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwith `a * b * c = 1`, the inequality\n\n`1 / (a^5 * (b + 2*c)^2) + 1 / (b^5 * (c + 2*a)^2)\n + 1 / (c^5 * (a + 2*b)^2) >= 1/3`.\n\nThis file records the exact proposition as data; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the required inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (1 : ℝ) / (a ^ (5 : ℕ) * (b + (2 : ℝ) * c) ^ (2 : ℕ)) +\n (1 : ℝ) / (b ^ (5 : ℕ) * (c + (2 : ℝ) * a) ^ (2 : ℕ)) +\n (1 : ℝ) / (c ^ (5 : ℕ) * (a + (2 : ℝ) * b) ^ (2 : ℕ))\n\n/-- The admissibility conditions from the problem: `a`, `b`, and `c` are\npositive real numbers and their product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n (0 : ℝ) < a ∧ (0 : ℝ) < b ∧ (0 : ℝ) < c ∧ a * b * c = (1 : ℝ)\n\n/-- The assertion requested by the source problem. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → LHS a b c ≥ (1 / 3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5f852544-35ed-5a15-956f-d02d98988d05", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "42cd96c332bc0fb90279fa1840a2b414447e27e4c10189fb109fb4cc58433fc6", "task_path": "tasks/nmp3_5f852544-35ed-5a15-956f-d02d98988d05", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5f852544-35ed-5a15-956f-d02d98988d05", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5f87eeb8-4581-5ea5-8443-fe495cbbdc94", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a+b}{\\,b+c\\,}+\\frac{b+c}{\\,c+a\\,}+\\frac{c+a}{\\,a+b\\,}+\\frac{3(ab+bc+ca)}{(a+b+c)^2}\\ge 4.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality, as an explicit real-valued expression. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a + b) / (b + c) + (b + c) / (c + a) + (c + a) / (a + b)\n + 3 * (a * b + b * c + c * a) / (a + b + c) ^ 2\n\n/-- The assertion to be proved: for all positive real numbers `a`, `b`, and `c`,\nthe stated left-hand side is at least `4`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → lhs a b c ≥ 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5f87eeb8-4581-5ea5-8443-fe495cbbdc94", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8ac92b8136ec4090abfd10c2477489b459b0c35fa00c30cfb8350f09286393bd", "task_path": "tasks/nmp3_5f87eeb8-4581-5ea5-8443-fe495cbbdc94", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5f87eeb8-4581-5ea5-8443-fe495cbbdc94", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5fc44f11-6e3f-5df8-ba7e-d9e4a9802e64", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For every prime number $p$ prove that there exist infinitely many natural numbers $n$ such that \n-- \n-- \\[\n-- \\underbrace{2^{\\,2^{\\,\\cdot^{\\cdot^{\\,2^{\\,n}}}}}}_{1397\\text{ copies of }2}\n-- \\equiv\n-- n^{\\underbrace{2^{\\,2^{\\,\\cdot^{\\cdot^{\\,2}}}}}_{1397\\text{ copies of }2}}\n-- \\pmod p .\n-- \\]\n-- \n-- The left‑hand side is a tower of $1397$ twos with $n$ as the top exponent; the right‑hand side is $n$ raised to a tower of $1397$ twos. (The case $p=2$ is immediate.)\nimport Mathlib\n\n/-!\n# Formal statement of the iterated power-tower congruence problem\n\nThis file contains only definitions and the statement of the target. It does\nnot assert or prove the target.\n-/\n\nnamespace Problem\n\n/-- The right-associated power tower consisting of `k` copies of `2`.\n\n`Tower2 0` is the empty tower (conventionally `1`), `Tower2 1 = 2`,\n`Tower2 2 = 2 ^ 2`, `Tower2 3 = 2 ^ (2 ^ 2)`, and so on. In particular, `Tower2 1397`\ncontains exactly 1397 twos. -/\ndef Tower2 : ℕ → ℕ\n | 0 => 1\n | k + 1 => 2 ^ Tower2 k\n\n/-- The right-associated power tower consisting of `k` copies of `2`, with\n`n` placed at the top as an additional exponent.\n\n`TowerWithTop 0 n = n`, `TowerWithTop 1 n = 2 ^ n`,\n`TowerWithTop 2 n = 2 ^ (2 ^ n)`, and so on. -/\ndef TowerWithTop : ℕ → ℕ → ℕ\n | 0, n => n\n | k + 1, n => 2 ^ TowerWithTop k n\n\n/-- The number of explicit twos appearing in each side of the displayed\ncongruence in the source problem. -/\ndef towerHeight : ℕ := 1397\n\n/-- The admissibility predicate for a proposed natural number `n`, for a fixed\nmodulus `p`: the left-hand tower (with `n` at its top) is congruent to `n`\nraised to the right-hand tower, modulo `p`. Primality of `p` is imposed by\n`Target`, not by this predicate. -/\ndef Admissible (p n : ℕ) : Prop :=\n Nat.ModEq p (TowerWithTop towerHeight n) (n ^ Tower2 towerHeight)\n\n/-- The formal target: for every prime number `p`, infinitely many natural\nnumbers `n` satisfy the displayed congruence modulo `p`. -/\ndef Target : Prop :=\n ∀ p : ℕ, Nat.Prime p → Set.Infinite {n : ℕ | Admissible p n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5fc44f11-6e3f-5df8-ba7e-d9e4a9802e64", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e6f5ae912ad1c36afd06c06e1edc86c3a42c11cadb796d863d50c5d7abf387cd", "task_path": "tasks/nmp3_5fc44f11-6e3f-5df8-ba7e-d9e4a9802e64", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5fc44f11-6e3f-5df8-ba7e-d9e4a9802e64", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_5ff18e71-0ee9-597a-8e89-2cd3d8bf77b2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{1}{b+c}+\\frac{1}{c+a}+\\frac{1}{a+b}\\;\\ge\\;\\frac{2a}{3a^{2}+bc}+\\frac{2b}{3b^{2}+ca}+\\frac{2c}{3c^{2}+ab}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nFor positive real numbers `a`, `b`, and `c`, prove that\n\n`1 / (b + c) + 1 / (c + a) + 1 / (a + b) ≥\n 2a / (3a^2 + bc) + 2b / (3b^2 + ca) + 2c / (3c^2 + ab)`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n 1 / (b + c) + 1 / (c + a) + 1 / (a + b)\n\n/-- The right-hand side of the target inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (2 * a) / (3 * a ^ 2 + b * c) +\n (2 * b) / (3 * b ^ 2 + c * a) +\n (2 * c) / (3 * c ^ 2 + a * b)\n\n/-- The pointwise inequality asserted in the problem, before imposing positivity. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The positivity hypothesis on the three real variables. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The full quantified assertion of the problem: for all positive real numbers\n`a`, `b`, and `c`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ff18e71-0ee9-597a-8e89-2cd3d8bf77b2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9af3035db143d8b8e50def9de9c1e92a48b2c2f66053fff2d0185686f58b77b2", "task_path": "tasks/nmp3_5ff18e71-0ee9-597a-8e89-2cd3d8bf77b2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "5ff18e71-0ee9-597a-8e89-2cd3d8bf77b2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_60301152-e7be-58b4-bf27-13c09c898fd2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For a positive real number $x$, define $\\log_{*}(x)$ to be the smallest positive integer $k$ such that applying the base‑2 logarithm $k$ times to $x$ yields a value $\\le 1$. \n-- Let $f:\\mathbb Z_{>0}\\to\\mathbb Z_{>0}$ be an unbounded function satisfying \n-- \\[\n-- f(\\tau(n))=\\tau(f(n))\\qquad\\text{for all }n\\in\\mathbb Z_{>0},\n-- \\] \n-- where $\\tau(m)$ denotes the number of positive divisors of $m$. \n-- Prove that there exists a constant $b>0$ and infinitely many positive integers $n$ such that \n-- \\[\n-- f(n)\\ge \\log_{*}(n)-b\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The base-2 logarithm on real numbers, written using Mathlib's `Real.logb`. -/\nnoncomputable def logbTwo (x : ℝ) : ℝ := Real.logb 2 x\n/-- The `k`-fold iterate of the base-2 logarithm. Thus `iteratedLogbTwo k x` is\n`log₂ (log₂ (... (log₂ x)))`, with `k` logarithm symbols. -/\nnoncomputable def iteratedLogbTwo (k : ℕ) (x : ℝ) : ℝ :=\n (logbTwo)^[k] x\n\nlemma iteratedLogbTwo_zero (x : ℝ) : iteratedLogbTwo 0 x = x := rfl\n\nlemma iteratedLogbTwo_succ (n : ℕ) (x : ℝ) :\n iteratedLogbTwo (n + 1) x = logbTwo (iteratedLogbTwo n x) := by\n change (logbTwo)^[n + 1] x = logbTwo ((logbTwo)^[n] x)\n rw [Function.iterate_succ_apply']\n\nlemma logbTwo_two : logbTwo 2 = 1 := by\n unfold logbTwo\n exact Real.logb_self_eq_one (by norm_num)\n\nlemma logbTwo_four : logbTwo 4 = 2 := by\n unfold logbTwo\n rw [show (4 : ℝ) = 2 ^ 2 by norm_num, Real.logb_pow]\n rw [Real.logb_self_eq_one (by norm_num)]\n norm_num\n\nlemma logbTwo_strictMonoOn {x y : ℝ} (hx : 0 < x) (hxy : x < y) :\n logbTwo x < logbTwo y := by\n unfold logbTwo\n exact Real.logb_lt_logb (by norm_num : (1 : ℝ) < 2) hx hxy\n\nlemma logbTwo_monoOn {x y : ℝ} (hx : 0 < x) (hxy : x ≤ y) :\n logbTwo x ≤ logbTwo y := by\n unfold logbTwo\n exact Real.logb_le_logb_of_le (by norm_num : (1 : ℝ) < 2) hx hxy\n\nlemma logbTwo_pos_of_one_lt {x : ℝ} (hx : 1 < x) : 0 < logbTwo x := by\n unfold logbTwo\n exact Real.logb_pos (by norm_num : (1 : ℝ) < 2) hx\n\nlemma logb_two_le_half {z : ℝ} (hz : 4 ≤ z) : logbTwo z ≤ z / 2 := by\n unfold logbTwo\n rw [Real.logb]\n have hlog2pos : 0 < Real.log 2 := Real.log_pos (by norm_num)\n rw [div_le_iff₀ hlog2pos]\n have hzpos : 0 < z := by linarith\n have h4pos : 0 < z / 4 := by positivity\n have hlog4 : Real.log (4 : ℝ) = 2 * Real.log 2 := by\n rw [show (4 : ℝ) = 2 ^ 2 by norm_num, Real.log_pow]\n norm_num\n have hlogz : Real.log z = Real.log 4 + Real.log (z / 4) := by\n rw [← Real.log_mul (by norm_num : (4 : ℝ) ≠ 0) (by positivity : z / 4 ≠ 0)]\n congr 1\n ring\n calc\n Real.log z = Real.log 4 + Real.log (z / 4) := hlogz\n _ ≤ Real.log 4 + (z / 4 - 1) := by\n gcongr\n exact Real.log_le_sub_one_of_pos h4pos\n _ = 2 * Real.log 2 + z / 4 - 1 := by\n rw [hlog4]\n ring\n _ ≤ z / 2 * Real.log 2 := by\n nlinarith [Real.log_two_gt_d9, hz]\n\nlemma exists_iteratedLogbTwo_le_four (x : ℝ) :\n ∃ n : ℕ, iteratedLogbTwo n x ≤ 4 := by\n classical\n by_contra h\n push Not at h\n have hbound : ∀ n : ℕ, iteratedLogbTwo n x ≤ x / (2 : ℝ) ^ n := by\n intro n\n induction n with\n | zero => simp [iteratedLogbTwo_zero]\n | succ n ih =>\n have hn4 : 4 ≤ iteratedLogbTwo n x := le_of_lt (h n)\n calc\n iteratedLogbTwo (n + 1) x = logbTwo (iteratedLogbTwo n x) :=\n iteratedLogbTwo_succ n x\n _ ≤ iteratedLogbTwo n x / 2 := logb_two_le_half hn4\n _ ≤ (x / (2 : ℝ) ^ n) / 2 := by gcongr\n _ = x / (2 : ℝ) ^ (n + 1) := by\n rw [pow_succ]\n ring\n obtain ⟨n, hn⟩ := pow_unbounded_of_one_lt (x / 4) (by norm_num : (1 : ℝ) < 2)\n have hpowpos : 0 < (2 : ℝ) ^ n := by positivity\n have hlt : x / (2 : ℝ) ^ n < 4 := by\n rw [div_lt_iff₀ hpowpos]\n nlinarith\n have hxle := hbound n\n have hxgt := h n\n linarith\n\n/-- The first `k` iterated logarithms are all applied to positive inputs. This records\nthe domain condition for applying the real logarithm repeatedly. -/\ndef iteratedLogbTwoDefined (x : ℝ) (k : ℕ) : Prop :=\n ∀ j : ℕ, j < k → 0 < iteratedLogbTwo j x\n\n/-- `k` is an admissible positive logarithm depth for `x`: the iterated logarithms are\ndefined through step `k`, and the final value is at most `1`. -/\ndef logStarAdmissible (x : ℝ) (k : ℕ) : Prop :=\n 0 < k ∧ iteratedLogbTwoDefined x k ∧ iteratedLogbTwo k x ≤ 1\n\n/-- `k` is the smallest positive admissible logarithm depth for `x`; this is the\nmathematical predicate defining `log_*(x)`. -/\ndef IsLogStar (x : ℝ) (k : ℕ) : Prop :=\n logStarAdmissible x k ∧ ∀ j : ℕ, logStarAdmissible x j → k ≤ j\n\nlemma exists_isLogStar_of_pos_le_two {x : ℝ} (hx0 : 0 < x) (hx2 : x ≤ 2) :\n ∃ k : ℕ, IsLogStar x k := by\n refine ⟨1, ?_⟩\n have hadm : logStarAdmissible x 1 := by\n refine ⟨by norm_num, ?_, ?_⟩\n · intro j hj\n have hj0 : j = 0 := by omega\n simpa [iteratedLogbTwo_zero, hj0] using hx0\n · have h1 : iteratedLogbTwo 1 x = logbTwo x := by\n simpa [iteratedLogbTwo_zero] using iteratedLogbTwo_succ 0 x\n rw [h1]\n unfold logbTwo\n rw [Real.logb_le_iff_le_rpow (by norm_num : (1 : ℝ) < 2) hx0]\n simpa using hx2\n refine ⟨hadm, ?_⟩\n intro j hj\n exact Nat.succ_le_of_lt hj.1\n\nlemma exists_isLogStar_of_pos {x : ℝ} (hx0 : 0 < x) :\n ∃ k : ℕ, IsLogStar x k := by\n by_cases hx2 : x ≤ 2\n · exact exists_isLogStar_of_pos_le_two hx0 hx2\n · push Not at hx2\n classical\n let a : ℕ → ℝ := fun n => iteratedLogbTwo n x\n have ha_zero : a 0 = x := rfl\n have ha_succ : ∀ n : ℕ, a (n + 1) = logbTwo (a n) := by\n intro n\n simpa [a] using iteratedLogbTwo_succ n x\n have hex : ∃ n : ℕ, a n ≤ 4 := by\n simpa [a] using exists_iteratedLogbTwo_le_four x\n let n : ℕ := Nat.find hex\n have hn4 : a n ≤ 4 := Nat.find_spec hex\n have hprev : ∀ j : ℕ, j < n → 4 < a j := by\n intro j hj\n exact lt_of_not_ge (Nat.find_min hex hj)\n have han_gt_two : 2 < a n := by\n by_cases hn0 : n = 0\n · have han0 : a n = x := by\n rw [hn0, ha_zero]\n rw [han0]\n exact hx2\n · have hnpos : 0 < n := Nat.pos_of_ne_zero hn0\n have hprevn : 4 < a (n - 1) := hprev (n - 1) (by omega)\n have hn_eq : n = (n - 1) + 1 := by omega\n have hstep : a n = logbTwo (a (n - 1)) :=\n (congrArg a hn_eq).trans (ha_succ (n - 1))\n calc\n 2 = logbTwo 4 := logbTwo_four.symm\n _ < logbTwo (a (n - 1)) :=\n logbTwo_strictMonoOn (by norm_num : (0 : ℝ) < 4) hprevn\n _ = a n := hstep.symm\n have han_pos : 0 < a n := lt_trans zero_lt_two han_gt_two\n have hanext_gt_one : 1 < a (n + 1) := by\n calc\n 1 = logbTwo 2 := logbTwo_two.symm\n _ < logbTwo (a n) :=\n logbTwo_strictMonoOn (by norm_num : (0 : ℝ) < 2) han_gt_two\n _ = a (n + 1) := (ha_succ n).symm\n have hanext_le_two : a (n + 1) ≤ 2 := by\n calc\n a (n + 1) = logbTwo (a n) := ha_succ n\n _ ≤ logbTwo 4 := logbTwo_monoOn han_pos hn4\n _ = 2 := logbTwo_four\n have hanext2_eq : a (n + 2) = logbTwo (a (n + 1)) := by\n have hsucc := ha_succ (n + 1)\n simpa [Nat.add_assoc] using hsucc\n have hanext2_le_one : a (n + 2) ≤ 1 := by\n rw [hanext2_eq]\n calc\n logbTwo (a (n + 1)) ≤ logbTwo 2 :=\n logbTwo_monoOn (lt_trans zero_lt_one hanext_gt_one) hanext_le_two\n _ = 1 := logbTwo_two\n have hdef : iteratedLogbTwoDefined x (n + 2) := by\n intro j hj\n change 0 < a j\n have hjle : j ≤ n + 1 := by omega\n by_cases hjn : j ≤ n\n · rcases lt_or_eq_of_le hjn with hjlt | hjeq\n · linarith [hprev j hjlt]\n · subst j\n exact lt_trans zero_lt_two han_gt_two\n · have hjeq : j = n + 1 := by omega\n subst j\n exact lt_trans zero_lt_one hanext_gt_one\n have hadm : logStarAdmissible x (n + 2) := by\n refine ⟨by omega, hdef, ?_⟩\n change a (n + 2) ≤ 1\n exact hanext2_le_one\n refine ⟨n + 2, hadm, ?_⟩\n intro j hj\n by_contra hnot\n have hjlt : j < n + 2 := Nat.lt_of_not_ge hnot\n have hjle : j ≤ n + 1 := by omega\n have hgt_one : 1 < a j := by\n by_cases hjn : j ≤ n\n · rcases lt_or_eq_of_le hjn with hjltn | hjeq\n · linarith [hprev j hjltn]\n · subst j\n linarith\n · have hjeq : j = n + 1 := by omega\n subst j\n exact hanext_gt_one\n exact (not_lt_of_ge hj.2.2) hgt_one\n\n/-- For every positive real `x`, at least one admissible positive logarithm depth exists. -/\nlemma exists_logStarAdmissible_of_pos {x : ℝ} (hx : 0 < x) :\n ∃ k : ℕ, logStarAdmissible x k := by\n rcases exists_isLogStar_of_pos hx with ⟨k, hk⟩\n exact ⟨k, hk.1⟩\n\n/-- The iterated-logarithm star function. For a positive real number `x`, this is the\nleast positive `k` such that the `k`-fold base-2 logarithm of `x` is at most `1`. -/\nnoncomputable def logStar (x : ℝ) (hx : 0 < x) : ℕ := by\n classical\n exact Nat.find (exists_logStarAdmissible_of_pos hx)\n\nlemma logStar_admissible {x : ℝ} (hx : 0 < x) :\n logStarAdmissible x (logStar x hx) := by\n classical\n unfold logStar\n exact Nat.find_spec (exists_logStarAdmissible_of_pos hx)\n\nlemma logStar_min {x : ℝ} (hx : 0 < x) {k : ℕ}\n (hk : logStarAdmissible x k) : logStar x hx ≤ k := by\n classical\n unfold logStar\n exact Nat.find_min' (exists_logStarAdmissible_of_pos hx) hk\n\ntheorem IsLogStar.unique {x : ℝ} {k l : ℕ}\n (hk : IsLogStar x k) (hl : IsLogStar x l) : k = l := by\n exact le_antisymm (hk.2 l hl.1) (hl.2 k hk.1)\n\nlemma logStar_isLogStar {x : ℝ} (hx : 0 < x) :\n IsLogStar x (logStar x hx) :=\n ⟨logStar_admissible hx, fun _ hk => logStar_min hx hk⟩\n\nlemma logStar_eq_iff {x : ℝ} (hx : 0 < x) {k : ℕ} :\n logStar x hx = k ↔ IsLogStar x k := by\n constructor\n · intro h\n rw [← h]\n exact logStar_isLogStar hx\n · intro hk\n exact IsLogStar.unique (logStar_isLogStar hx) hk\n\nlemma logStar_pos {x : ℝ} (hx : 0 < x) : 0 < logStar x hx :=\n (logStar_admissible hx).1\n\n/-- The divisor-counting function `τ`, bundled as a map on positive integers. -/\ndef tau (n : ℕ+) : ℕ+ :=\n ⟨(Nat.divisors (n : ℕ)).card, by\n rw [Finset.card_pos]\n exact ⟨1, Nat.one_mem_divisors.mpr (PNat.ne_zero n)⟩⟩\n\n/-- Unboundedness above for a function on positive integers: for every real bound `B`\nthere is a positive integer whose image under `f` exceeds `B`. -/\ndef IsUnbounded (f : ℕ+ → ℕ+) : Prop :=\n ∀ B : ℝ, ∃ n : ℕ+, B < ((f n : ℕ) : ℝ)\n\n/-- The functional equation `f (τ n) = τ (f n)` for every positive integer `n`. -/\ndef SatisfiesTauEquation (f : ℕ+ → ℕ+) : Prop :=\n ∀ n : ℕ+, f (tau n) = tau (f n)\n\n/-- The formal target statement: every unbounded `f : ℕ+ → ℕ+` satisfying the divisor\nfunctional equation has a positive real additive constant `b` and infinitely many\npositive integers `n` with `f n ≥ log_* n - b`. -/\ndef Target : Prop :=\n ∀ f : ℕ+ → ℕ+,\n IsUnbounded f →\n SatisfiesTauEquation f →\n ∃ b : ℝ,\n 0 < b ∧\n Set.Infinite\n {n : ℕ+ | ((f n : ℕ) : ℝ) ≥ ((logStar (n : ℝ) (by exact_mod_cast n.pos) : ℕ) : ℝ) - b}\n\nend Problem\n\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "60301152-e7be-58b4-bf27-13c09c898fd2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4e018a44fd60dfd51347fa133b4cd0d5978a25a73f42363fdcc13bec0ec8c81f", "task_path": "tasks/nmp3_60301152-e7be-58b4-bf27-13c09c898fd2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "60301152-e7be-58b4-bf27-13c09c898fd2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_605c4aeb-9c65-55c8-9c1f-92b10e081227", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c,d$ satisfying $a^{2}+b^{2}+c^{2}+d^{2}=4$, prove that \n-- \\[\n-- \\frac{b+d}{a+c}+\\frac{1}{ac+bd}\\ge\\frac{(b+d+1)^{2}}{5+abcd}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the four-variable real inequality\n\nThe source problem asks to prove an inequality for all positive real numbers\n`a`, `b`, `c`, and `d` whose squared sum is `4`.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions from the source problem: all four variables are\npositive reals and their squared sum is `4`. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧\n a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = 4\n\n/-- The inequality asserted in the source problem, with the two fractions\ninterpreted as division in the real numbers. -/\ndef Inequality (a b c d : ℝ) : Prop :=\n (b + d) / (a + c) + 1 / (a * c + b * d) ≥\n (b + d + 1) ^ 2 / (5 + a * b * c * d)\n\n/-- The complete assertion to be proved: for every quadruple of positive real\nnumbers satisfying the squared-sum condition, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Inequality a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "605c4aeb-9c65-55c8-9c1f-92b10e081227", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3c827a119077f4deef1efebc81f3ae01459053adbc8d0eeef2c29363355dae1e", "task_path": "tasks/nmp3_605c4aeb-9c65-55c8-9c1f-92b10e081227", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "605c4aeb-9c65-55c8-9c1f-92b10e081227", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_606b9cca-6368-5d21-9a20-c7d5c5a07acc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m,n$ be positive integers with $m\\neq n$. Prove that the fraction \n-- \\[\n-- \\frac{4m^{2}n^{2}-1}{(m^{2}-n^{2})^{2}}\n-- \\]\n-- is never an integer; i.e., there are no positive integer solutions $(m,n)$ for which this expression belongs to $\\mathbb Z$.\nimport Mathlib\n\nnamespace Problem\n\n/-- A rational number is an integer if it is the image of an integer under the\ncanonical embedding `ℤ → ℚ`. -/\ndef IsInteger (q : ℚ) : Prop :=\n ∃ z : ℤ, (z : ℚ) = q\n\n/-- There are no positive integers `m` and `n`, with `m ≠ n`, for which\n`(4 m^2 n^2 - 1) / (m^2 - n^2)^2` is an integer. -/\ndef Target : Prop :=\n ∀ m n : ℕ, 0 < m → 0 < n → m ≠ n →\n ¬ IsInteger\n ((4 * (m : ℚ) ^ 2 * (n : ℚ) ^ 2 - 1) /\n (((m : ℚ) ^ 2 - (n : ℚ) ^ 2) ^ 2))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "606b9cca-6368-5d21-9a20-c7d5c5a07acc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "66f89abf19bff029bf465cedf14eb0a38da5e32d1ba915beac8bfa670931ae6a", "task_path": "tasks/nmp3_606b9cca-6368-5d21-9a20-c7d5c5a07acc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "606b9cca-6368-5d21-9a20-c7d5c5a07acc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_606fac13-edb3-5b76-86e4-b6543616bcdf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- $$a\\sqrt{a^{2}+2bc}+b\\sqrt{b^{2}+2ac}+c\\sqrt{c^{2}+2ab}\\;\\ge\\;\\sqrt{3}\\,\\bigl(ab+bc+ca\\bigr).$$\nimport Mathlib.Analysis.Real.Sqrt\n\nnamespace Problem\n\n/-- The inequality of the problem, for all positive real numbers `a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n a * Real.sqrt (a ^ 2 + 2 * b * c) +\n b * Real.sqrt (b ^ 2 + 2 * a * c) +\n c * Real.sqrt (c ^ 2 + 2 * a * b) ≥\n Real.sqrt (3 : ℝ) * (a * b + b * c + c * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "606fac13-edb3-5b76-86e4-b6543616bcdf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "900f3059331345b63cd02b15ce1d31fef39836b28cb073f4e3c2f4cc21a06462", "task_path": "tasks/nmp3_606fac13-edb3-5b76-86e4-b6543616bcdf", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "606fac13-edb3-5b76-86e4-b6543616bcdf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6080f252-7418-5bd7-9e8d-1a191c758f7a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every nonnegative integer $n$, the number $7^{7^{n}}+1$ is the product of at least $2n+3$ (not necessarily distinct) primes.\nimport Mathlib\n\nnamespace Problem\n\n/--\n`IsProductOfAtLeastPrimes N k` means that `N` can be written as a product of a\nlist of at least `k` primes. A list is used rather than a set or finset so that\nrepeated prime factors (that is, \"not necessarily distinct\" primes) are allowed.\n-/\ndef IsProductOfAtLeastPrimes (N k : ℕ) : Prop :=\n ∃ factors : List ℕ,\n (∀ p ∈ factors, Nat.Prime p) ∧\n k ≤ factors.length ∧\n factors.prod = N\n\n/-- For every nonnegative integer `n`, the number `7 ^ (7 ^ n) + 1` has at\nleast `2 * n + 3` prime factors, counted with multiplicity. -/\ndef Target : Prop :=\n ∀ n : ℕ, IsProductOfAtLeastPrimes (7 ^ (7 ^ n) + 1) (2 * n + 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6080f252-7418-5bd7-9e8d-1a191c758f7a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7945d5584ff3ae91c1d00173354d4305e8eaf41b166713ea16c4f0551daeaa77", "task_path": "tasks/nmp3_6080f252-7418-5bd7-9e8d-1a191c758f7a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6080f252-7418-5bd7-9e8d-1a191c758f7a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_60888582-0a28-52b1-a585-2658be21a55d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A$ be a set of $2001$ positive integers. Prove that there exists a subset $B\\subseteq A$ such that \n-- \n-- (i) $|B|\\ge 668$, \n-- \n-- (ii) for any $u,v\\in B$ (not necessarily distinct) we have $u+v\\notin B\\,. $\nimport Mathlib.Data.Finset.Card\n\n/-!\n# Formal statement of the 2001-element sum-free subset problem\n\nThe source problem asks us to prove that every finite set of 2001 positive\nintegers contains a subset of cardinality at least 668 which is sum-free in\nthe sense that the sum of any two (possibly equal) of its elements is not in\nthe subset.\n\nThis file records the unproved target as a proposition-valued definition.\n-/\n\nnamespace Problem\n\n/-- A finite set of natural numbers consists entirely of positive integers. -/\ndef PositiveIntegerSet (A : Finset ℕ) : Prop :=\n ∀ a : ℕ, a ∈ A → 0 < a\n\n/-- The subset has at least 668 elements. -/\ndef LargeEnough (B : Finset ℕ) : Prop :=\n 668 ≤ B.card\n\n/-- No sum of two elements of `B`, with the two elements allowed to be equal,\nbelongs to `B`. -/\ndef SumFree (B : Finset ℕ) : Prop :=\n ∀ u : ℕ, u ∈ B → ∀ v : ℕ, v ∈ B → u + v ∉ B\n\n/-- `B` is an admissible subset of `A`: it is a subset of `A`, has at least\n668 elements, and is sum-free. -/\ndef AdmissibleSubset (A B : Finset ℕ) : Prop :=\n B ⊆ A ∧ LargeEnough B ∧ SumFree B\n\n/-- The assertion of the problem: for every finite set `A` of 2001 positive\nintegers, there exists a subset `B ⊆ A` which has at least 668 elements and is\nsuch that no sum of two (not necessarily distinct) elements of `B` is again in\n`B`. -/\ndef Target : Prop :=\n ∀ A : Finset ℕ,\n PositiveIntegerSet A →\n A.card = 2001 →\n ∃ B : Finset ℕ,\n AdmissibleSubset A B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "60888582-0a28-52b1-a585-2658be21a55d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "74a926119e2cb0abbd5aa5cf57ad51911349172683b20d307cb05e95a3a459ef", "task_path": "tasks/nmp3_60888582-0a28-52b1-a585-2658be21a55d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "60888582-0a28-52b1-a585-2658be21a55d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6088fcf3-de92-526d-85c8-fdaa57d32d1a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(m>2\\) be an integer and let \\(a_{1},a_{2},\\dots ,a_{m}\\in\\mathbb{R}\\). Define \n-- \\[\n-- A_{k}=a_{1}+a_{2}+\\cdots +a_{k}\\qquad(k=1,2,\\dots ,m).\n-- \\] \n-- Prove that \n-- \n-- \\[\n-- \\sum_{k=2}^{m}\\left(\\frac{A_{k}}{k}\\right)^{2}\\le 12\\sum_{i=1}^{m}a_{i}^{2}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The `k`-th prefix sum of a real vector of length `m`.\n\nFor `k ≤ m`, this is exactly `a₁ + ⋯ + aₖ`; values outside that range are\nirrelevant to the target statement. -/\ndef partialSum {m : ℕ} (a : Fin m → ℝ) (k : ℕ) : ℝ :=\n Finset.sum (Finset.range k)\n (fun j => if h : j < m then a ⟨j, h⟩ else 0)\n\n/-- The inequality stated in the problem: for every integer `m > 2` and every\nreal vector `(a₁, …, aₘ)`, the sum of the squared prefix-sum averages from\n`k = 2` through `m` is at most twelve times the sum of the squares of the\nentries. -/\ndef Target : Prop :=\n ∀ (m : ℕ) (hm : 2 < m) (a : Fin m → ℝ),\n Finset.sum (Finset.Icc 2 m)\n (fun k => (partialSum a k / (k : ℝ)) ^ 2)\n ≤ 12 * Finset.sum Finset.univ (fun i : Fin m => (a i) ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6088fcf3-de92-526d-85c8-fdaa57d32d1a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7de1307cdedebae7ef113acd4671b551a40217ec14a60691da83d5a9d174b626", "task_path": "tasks/nmp3_6088fcf3-de92-526d-85c8-fdaa57d32d1a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6088fcf3-de92-526d-85c8-fdaa57d32d1a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_60b714d9-7ce3-5c91-8020-6e15eebf87d1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be the side lengths of a triangle (i.e. $a0$ be the side lengths of a triangle (so $a 1\n | n + 1 => 9 * a n - 2 * b n\n\n /-- The sequence `b` defined by `b 0 = 1` and\n `b (n + 1) = 2 * a n + 4 * b n`. -/\n def b : ℕ → ℤ\n | 0 => 1\n | n + 1 => 2 * a n + 4 * b n\nend\n\n/-- The sequence `c n = a n + b n`. -/\ndef c (n : ℕ) : ℤ := a n + b n\n\n/-- The proposition asserted by the problem: there do not exist three pairwise\ndistinct positive integers `k`, `r`, and `m` such that\n`c r ^ 2 = c k * c m`. -/\ndef Target : Prop :=\n ¬ ∃ k r m : ℕ,\n 0 < k ∧ 0 < r ∧ 0 < m ∧\n k ≠ r ∧ k ≠ m ∧ r ≠ m ∧\n (c r) ^ 2 = c k * c m\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "61192cc9-a9f3-569d-be38-d5b64ac5773e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c4bf359cf018d5f0bfdc9e609897b4de22c780c0066b94d2e91245c908a20b15", "task_path": "tasks/nmp3_61192cc9-a9f3-569d-be38-d5b64ac5773e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "61192cc9-a9f3-569d-be38-d5b64ac5773e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_611f2680-93b6-5df7-bda4-2243189d81ee", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f \\in \\mathbb Z[x]$ be a monic polynomial and let $a$ be a nonzero integer. Prove that for all sufficiently large positive integers $q$, the polynomial \n-- \\[\n-- (x-q)f(x) + a\n-- \\]\n-- is irreducible over the integers.\nimport Mathlib\n\nnamespace Problem\n\n/-- The polynomial `(x - q) * f(x) + a`, regarded as an element of `ℤ[x]`. -/\nnoncomputable def perturbedPolynomial (f : Polynomial ℤ) (a : ℤ) (q : ℕ) :\n Polynomial ℤ :=\n (Polynomial.X - Polynomial.C (q : ℤ)) * f + Polynomial.C a\n\n/--\nFor every monic integer polynomial `f` and every nonzero integer `a`, all sufficiently\nlarge positive integers `q` make `(x - q) * f(x) + a` irreducible in `ℤ[x]`.\n-/\ndef Target : Prop :=\n ∀ f : Polynomial ℤ, Polynomial.Monic f →\n ∀ a : ℤ, a ≠ 0 →\n ∃ N : ℕ, ∀ q : ℕ, N ≤ q → 0 < q →\n Irreducible (perturbedPolynomial f a q)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "611f2680-93b6-5df7-bda4-2243189d81ee", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e181e8bbb3c8fed58cba385f57bdf3934eebb8709e4d909fd868f2224801fe04", "task_path": "tasks/nmp3_611f2680-93b6-5df7-bda4-2243189d81ee", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "611f2680-93b6-5df7-bda4-2243189d81ee", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6153407d-3e6c-5500-9d46-541e07d63c6b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that \n-- $$f(xy+f(x))=xf(y)+f(x)$$ \n-- for all real numbers $x$ and $y$.\nimport Mathlib\n\n/-!\n# Formalization of a real functional equation\n\nThe source problem asks for all functions `f : ℝ → ℝ` satisfying\n\n`f (x * y + f x) = x * f y + f x` for every `x, y : ℝ`.\n\nWe record the admissibility predicate, the proposed complete solution set\n(the zero function and the identity function), and the predicate saying\nthat a proposed solution set is a complete answer.\n-/\n\nnamespace Problem\n\n/-- A function satisfies the functional equation when the equation holds for\nevery pair of real numbers `x` and `y`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x * y + f x) = x * f y + f x\n\n/-- The zero function, represented as a pointwise property. -/\ndef IsZeroFunction (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, f x = 0\n\n/-- The identity function on `ℝ`, represented as a pointwise property. -/\ndef IsIdentityFunction (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, f x = x\n\n/-- The proposed complete set of solutions: the zero function and the\nidentity function. -/\ndef ProposedSolutionSet : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | IsZeroFunction f ∨ IsIdentityFunction f}\n\n/-- A set `S` of real functions is a correct complete answer when it contains\nexactly the admissible functions. The two directions ensure both that every\nproposed member is a solution and that every solution is proposed. -/\ndef AnswerCorrect (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, f ∈ S ↔ Admissible f\n\n/-- The complete classification requested by the problem, stated as correctness\nof the explicitly proposed solution set. -/\ndef Target : Prop :=\n AnswerCorrect ProposedSolutionSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6153407d-3e6c-5500-9d46-541e07d63c6b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e59c5da605edb1d6a137af34ed59e2fbfb5e3c64fcc83c030bdee4164051053d", "task_path": "tasks/nmp3_6153407d-3e6c-5500-9d46-541e07d63c6b", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6153407d-3e6c-5500-9d46-541e07d63c6b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_616ca39c-3b20-5127-9df5-1ddb1fba0532", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\left(2+\\frac{a}{b}\\right)^{2}+\\left(2+\\frac{b}{c}\\right)^{2}+\\left(2+\\frac{c}{a}\\right)^{2}\\ge\\frac{9\\,(a+b+c)^{2}}{ab+bc+ca}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n ((2 : ℝ) + a / b) ^ 2 + ((2 : ℝ) + b / c) ^ 2 +\n ((2 : ℝ) + c / a) ^ 2\n\n/-- The right-hand side of the inequality in the problem statement. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (9 : ℝ) * (a + b + c) ^ 2 / (a * b + b * c + c * a)\n\n/-- The assertion of the problem: for all positive reals `a`, `b`, and `c`,\nthe stated inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "616ca39c-3b20-5127-9df5-1ddb1fba0532", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ef1ad22c2c0a9a8e86df73be1c7fd9c63e83e3953e5f5aed8ce47e3383a9dabb", "task_path": "tasks/nmp3_616ca39c-3b20-5127-9df5-1ddb1fba0532", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "616ca39c-3b20-5127-9df5-1ddb1fba0532", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6176903b-1505-559c-8ca3-e4cb39293620", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb N_0\\to\\mathbb N_0$ be a bijection, where $\\mathbb N_0=\\{0,1,2,\\dots\\}$. Prove that there exist non‑negative integers $a1$ be a real constant. A sequence of positive real numbers $(a_n)_{n\\ge1}$ satisfies $a_1=1$, $a_2=2$, the multiplicative property \n-- \\[\n-- a_{mn}=a_m\\,a_n\\qquad\\text{for all positive integers }m,n,\n-- \\] \n-- and the additive bound \n-- \\[\n-- a_{m+n}\\le C\\bigl(a_m+a_n\\bigr)\\qquad\\text{for all positive integers }m,n.\n-- \\] \n-- Prove that $a_n=n$ for every positive integer $n$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The sequence `a` is indexed by the positive integers and all terms are positive reals. -/\ndef IsPositiveSequence (a : ℕ+ → ℝ) : Prop :=\n ∀ n : ℕ+, (0 : ℝ) < a n\n\n/-- The initial values `a 1 = 1` and `a 2 = 2`. -/\ndef HasInitialValues (a : ℕ+ → ℝ) : Prop :=\n a (1 : ℕ+) = (1 : ℝ) ∧ a (2 : ℕ+) = (2 : ℝ)\n\n/-- The multiplicative property `a (m * n) = a m * a n` for all positive integers `m`, `n`. -/\ndef IsMultiplicative (a : ℕ+ → ℝ) : Prop :=\n ∀ m n : ℕ+, a (m * n) = a m * a n\n\n/-- The additive bound `a (m + n) ≤ C * (a m + a n)` for all positive integers `m`, `n`. -/\ndef SatisfiesAdditiveBound (C : ℝ) (a : ℕ+ → ℝ) : Prop :=\n ∀ m n : ℕ+, a (m + n) ≤ C * (a m + a n)\n\n/-- All sequence hypotheses except the restriction `C > 1`. -/\ndef SatisfiesSequenceHypotheses (C : ℝ) (a : ℕ+ → ℝ) : Prop :=\n IsPositiveSequence a ∧\n HasInitialValues a ∧\n IsMultiplicative a ∧\n SatisfiesAdditiveBound C a\n\n/-- All hypotheses of the problem, including `C > 1`. -/\ndef Admissible (C : ℝ) (a : ℕ+ → ℝ) : Prop :=\n 1 < C ∧ SatisfiesSequenceHypotheses C a\n\n/-- The asserted conclusion: every term of the sequence equals its positive integer index. -/\ndef Claim (a : ℕ+ → ℝ) : Prop :=\n ∀ n : ℕ+, a n = (n : ℝ)\n\n/--\nThe complete statement to be proved: for every real `C > 1` and every positive real\nsequence indexed by the positive integers satisfying the listed hypotheses,\nthe sequence is the identity sequence.\n-/\ndef Target : Prop :=\n ∀ (C : ℝ), 1 < C → ∀ (a : ℕ+ → ℝ),\n SatisfiesSequenceHypotheses C a → Claim a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "618d5cd5-3185-585f-95e9-ab52532df490", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "88cf067c059780022d3d2516e87eeb9948aeee078bc8e8e260c916ea1e5ff2ed", "task_path": "tasks/nmp3_618d5cd5-3185-585f-95e9-ab52532df490", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "618d5cd5-3185-585f-95e9-ab52532df490", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_61ad3a7c-3e49-5648-bf4e-6d4cb9b6733a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $x$, $y$, $z$, prove that \n-- \\[\n-- (x+y+z)^2\\left(\\frac{3}{x^2+y^2+z^2}+\\frac{1}{x^2}+\\frac{1}{y^2}+\\frac{1}{z^2}\\right)\\ge 36.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe original problem asks to prove, for all positive real numbers `x`, `y`, and\n`z`, the inequality\n\n`(x + y + z)^2 * (3/(x^2 + y^2 + z^2) + 1/x^2 + 1/y^2 + 1/z^2) ≥ 36`.\n\nThe proposition is packaged as a `Prop`-valued definition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `x`, `y`, and `z`,\n`(x + y + z)^2 * (3/(x^2 + y^2 + z^2) + 1/x^2 + 1/y^2 + 1/z^2) ≥ 36`.\n\nThe positivity hypotheses make all four displayed denominators nonzero. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n (36 : ℝ) ≤\n (x + y + z) ^ 2 *\n (3 / (x ^ 2 + y ^ 2 + z ^ 2) +\n 1 / x ^ 2 + 1 / y ^ 2 + 1 / z ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "61ad3a7c-3e49-5648-bf4e-6d4cb9b6733a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2a190714209a3a49da601f40e4b8cb7d52a871e7d2c36be54112923d60364166", "task_path": "tasks/nmp3_61ad3a7c-3e49-5648-bf4e-6d4cb9b6733a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "61ad3a7c-3e49-5648-bf4e-6d4cb9b6733a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_61b483ee-39e3-5992-a0be-035cf610df15", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be the side lengths of a triangle (i.e. $a x\n\n/-- Complete correctness of a proposed answer `g` for the classification:\n`g` itself is admissible, and every admissible function is pointwise equal to\n`g`. Thus the set of admissible functions is exactly the singleton `{g}`. -/\ndef AnswerCorrect (g : ℝ → ℝ) : Prop :=\n Admissible g ∧\n ∀ f : ℝ → ℝ, Admissible f → ∀ x : ℝ, f x = g x\n\n/-- The target assertion: the proposed function `x ↦ x` is admissible and is\nthe only admissible function. -/\ndef Target : Prop :=\n AnswerCorrect IdentityFunction\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "626af9b0-988f-50b4-a5a0-8ca852b4c969", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9b9eaf83a4a2aaa0ab9a9b7c13c62a9a3ade8d35d094b426cb777891ea098927", "task_path": "tasks/nmp3_626af9b0-988f-50b4-a5a0-8ca852b4c969", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "626af9b0-988f-50b4-a5a0-8ca852b4c969", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_627749e8-05a4-5c35-9239-23d3e7e58038", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $ab+bc+ca+abc=4$. Prove that \n-- \\[\n-- \\frac{ab}{2a+3b}+\\frac{bc}{2b+3c}+\\frac{ca}{2c+3a}+\\frac15\\ge\\frac45\\,abc.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe original problem asks to prove, for positive real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca + abc = 4`, the inequality\n\n`ab/(2a+3b) + bc/(2b+3c) + ca/(2c+3a) + 1/5 ≥ (4/5)abc`.\n\nThe declarations below record the domain, admissibility hypothesis, and target\nproposition without supplying a proof.\n-/\n\nnamespace Problem\n\n/-- The hypotheses on the real numbers `a`, `b`, and `c` in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a + a * b * c = 4\n\n/-- The inequality asserted by the problem for fixed real numbers `a`, `b`, `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (a * b) / (2 * a + 3 * b) +\n (b * c) / (2 * b + 3 * c) +\n (c * a) / (2 * c + 3 * a) +\n (1 : ℝ) / 5 ≥\n (4 : ℝ) / 5 * a * b * c\n\n/-- The full universally quantified assertion of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "627749e8-05a4-5c35-9239-23d3e7e58038", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "74ed11e7031a74b93caf9b7fce3760973b0346cdcbf30b1ae39d1903aa04b129", "task_path": "tasks/nmp3_627749e8-05a4-5c35-9239-23d3e7e58038", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "627749e8-05a4-5c35-9239-23d3e7e58038", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_627d0fc1-6a3d-5819-aa11-38f1b526a1e5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any integer $n\\ge 1$ and all real numbers $x,y\\ge 0$,\n-- \\[\n-- 2\\bigl(x^{n}+1\\bigr)\\bigl(y^{\\,n+3}+1\\bigr)\\ge (x+1)\\bigl(x^{\\,n-1}y^{4}+1\\bigr)\\bigl(y^{\\,n-1}+1\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for an inequality\n\nThe source problem asks to prove, for every integer `n ≥ 1` and all\nnonnegative real numbers `x` and `y`, the stated inequality.\n-/\n\nnamespace Problem\n\n/-- The assertion of the source problem:\n\nFor every integer `n ≥ 1` and all real numbers `x, y ≥ 0`,\n`2 (x^n + 1) (y^(n+3) + 1) ≥ (x+1) (x^(n-1) y^4 + 1) (y^(n-1) + 1)`.\n\nHere integer exponents are the usual real-valued integer powers (`zpow`).\nSince `n ≥ 1`, all exponents occurring in the statement are nonnegative. -/\ndef Target : Prop :=\n ∀ (n : ℤ), (hn : (1 : ℤ) ≤ n) →\n ∀ (x y : ℝ), (hx : (0 : ℝ) ≤ x) → (hy : (0 : ℝ) ≤ y) →\n (2 : ℝ) * (x ^ n + (1 : ℝ)) * (y ^ (n + (3 : ℤ)) + (1 : ℝ)) ≥\n (x + (1 : ℝ)) * (x ^ (n - (1 : ℤ)) * y ^ (4 : ℤ) + (1 : ℝ)) *\n (y ^ (n - (1 : ℤ)) + (1 : ℝ))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "627d0fc1-6a3d-5819-aa11-38f1b526a1e5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2f7f29a1f2129ce834e216fbc9192f48f0cc6a2b0c045acac3fca91c3fa5427c", "task_path": "tasks/nmp3_627d0fc1-6a3d-5819-aa11-38f1b526a1e5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "627d0fc1-6a3d-5819-aa11-38f1b526a1e5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_62963348-a95a-5d34-a6c0-d0cae80ac587", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$, prove that \n-- $$27abc\\,(a^2b+b^2c+c^2a)\\le (a+b+c)^2\\,(ab+bc+ca)^2.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- For positive real numbers `a`, `b`, and `c`,\n`27abc(a²b + b²c + c²a) ≤ (a + b + c)²(ab + bc + ca)²`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n 27 * a * b * c * (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a) ≤\n (a + b + c) ^ 2 * (a * b + b * c + c * a) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "62963348-a95a-5d34-a6c0-d0cae80ac587", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "83a8dc66e34a4730a12cbb334aa85aeff6b2c6f36b52858212552f140e093a66", "task_path": "tasks/nmp3_62963348-a95a-5d34-a6c0-d0cae80ac587", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "62963348-a95a-5d34-a6c0-d0cae80ac587", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_62b167d8-f737-59b2-ac9f-2bdf926271a0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given non‑negative real numbers $a,b,c$ satisfying $ab+bc+ca=3$, prove that \n-- \\[\n-- 2\\bigl(\\sqrt{a^{2}+3}+\\sqrt{b^{2}+3}+\\sqrt{c^{2}+3}\\bigr)+abc\\ge 13.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a real-variable inequality\n\nFor all non-negative real numbers `a`, `b`, and `c` satisfying\n`a*b + b*c + c*a = 3`, the source asks for a proof of\n\n`2 * (sqrt (a^2 + 3) + sqrt (b^2 + 3) + sqrt (c^2 + 3)) + a*b*c >= 13`.\n\nThe complete universal proposition is packaged as `Problem.Target`. This file\ncontains statements and definitions only; it deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- `a`, `b`, and `c` are non-negative real numbers. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The symmetric constraint `a*b + b*c + c*a = 3`, over the reals. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a * b + b * c + c * a = 3\n\n/-- The hypotheses of the source problem, bundled together. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ Constraint a b c\n\n/-- The asserted inequality, for fixed real numbers `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n 2 * (Real.sqrt (a ^ 2 + 3) + Real.sqrt (b ^ 2 + 3) +\n Real.sqrt (c ^ 2 + 3)) + a * b * c ≥ 13\n\n/-- The full proposition stated by the problem: for every triple of\nnon-negative real numbers satisfying `a*b + b*c + c*a = 3`, the indicated\nsquare-root expression plus `a*b*c` is at least `13`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "62b167d8-f737-59b2-ac9f-2bdf926271a0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a3db76edd5e367b1c98944d37685dfe4658bb020e3a5867b2075cd36f7a1429b", "task_path": "tasks/nmp3_62b167d8-f737-59b2-ac9f-2bdf926271a0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "62b167d8-f737-59b2-ac9f-2bdf926271a0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_62f4db75-a492-5625-a214-20bb5bbd3845", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In an $m\\times n$ rectangular board (with $m,n\\ge1$) each unit $1\\times1$ cell has exactly one of its two possible diagonals drawn (either the $\\diagup$ or the $\\diagdown$ diagonal). Treat the drawn diagonals as edges joining the corners of the cells. Prove that there exists a connected chain of drawn diagonals that either connects the left side of the board to the right side, or connects the top side of the board to the bottom side (or both).\nimport Mathlib\n\n/-!\n# A diagonal-crossing theorem for rectangular boards\n\nThis file formalizes the statement of the problem. An `m × n` board has cells\nindexed by pairs in `Fin m × Fin n`. A choice of one diagonal in every cell is\nrepresented by a function from cells to the two-element type `Diagonal`.\nThe corners of the board are indexed by `Fin (n + 1) × Fin (m + 1)`; the first\ncoordinate is horizontal and the second coordinate is vertical, both increasing\nto the right/up. A diagonal is an undirected edge between its two corners.\n-/\n\nnamespace Problem\n\n/-- The two possible diagonals in a unit cell. `diagUp` joins the\nbottom-left corner to the top-right corner, while `diagDown` joins the\ntop-left corner to the bottom-right corner. -/\ninductive Diagonal : Type\n | diagUp\n | diagDown\n deriving DecidableEq, Repr\n\n/-- The cells of an `m × n` rectangular board. The first coordinate indexes\nrows (vertical position) and the second coordinate indexes columns (horizontal\nposition). -/\nabbrev Cell (m n : ℕ) : Type := Fin m × Fin n\n\n/-- The corner grid of an `m × n` rectangular board. There are `n + 1`\nvertical grid lines and `m + 1` horizontal grid lines. -/\nabbrev Corner (m n : ℕ) : Type := Fin (n + 1) × Fin (m + 1)\n\n/-- The two endpoints of the diagonal selected in a given cell. Both possible\ndiagonals join opposite corners of that unit cell. -/\ndef diagonalEndpoints {m n : ℕ} (d : Cell m n → Diagonal) (c : Cell m n) :\n Corner m n × Corner m n :=\n match d c with\n | Diagonal.diagUp =>\n ((Fin.castSucc c.2, Fin.castSucc c.1),\n (Fin.succ c.2, Fin.succ c.1))\n | Diagonal.diagDown =>\n ((Fin.castSucc c.2, Fin.succ c.1),\n (Fin.succ c.2, Fin.castSucc c.1))\n\n/-- Two corners are adjacent by one drawn diagonal. The relation is explicitly\nundirected: an edge may be traversed in either orientation. -/\ndef DiagonalStep {m n : ℕ} (d : Cell m n → Diagonal)\n (u v : Corner m n) : Prop :=\n ∃ c : Cell m n,\n (u = (diagonalEndpoints d c).1 ∧ v = (diagonalEndpoints d c).2) ∨\n (u = (diagonalEndpoints d c).2 ∧ v = (diagonalEndpoints d c).1)\n\n/-- A connected chain of drawn diagonals from one corner to another, expressed\nas reflexive-transitive closure of the single-diagonal step relation. -/\ndef ConnectedChain {m n : ℕ} (d : Cell m n → Diagonal)\n (u v : Corner m n) : Prop :=\n Relation.ReflTransGen\n (fun a b : Corner m n => DiagonalStep (m := m) (n := n) d a b) u v\n\n/-- A corner on the left side of the board. -/\ndef OnLeft {m n : ℕ} (u : Corner m n) : Prop :=\n u.1 = (0 : Fin (n + 1))\n\n/-- A corner on the right side of the board. -/\ndef OnRight {m n : ℕ} (u : Corner m n) : Prop :=\n u.1 = Fin.last n\n\n/-- A corner on the bottom side of the board. -/\ndef OnBottom {m n : ℕ} (u : Corner m n) : Prop :=\n u.2 = (0 : Fin (m + 1))\n\n/-- A corner on the top side of the board. -/\ndef OnTop {m n : ℕ} (u : Corner m n) : Prop :=\n u.2 = Fin.last m\n\n/-- There is a connected chain of drawn diagonals joining the left side of the\nboard to the right side. -/\ndef HasLeftRightChain {m n : ℕ} (d : Cell m n → Diagonal) : Prop :=\n ∃ u v : Corner m n, OnLeft u ∧ OnRight v ∧ ConnectedChain d u v\n\n/-- There is a connected chain of drawn diagonals joining the top side of the\nboard to the bottom side. -/\ndef HasTopBottomChain {m n : ℕ} (d : Cell m n → Diagonal) : Prop :=\n ∃ u v : Corner m n, OnTop u ∧ OnBottom v ∧ ConnectedChain d u v\n\n/-- The proposition asserted by the problem: for every positive-width and\npositive-height rectangular board and every choice of exactly one diagonal in\neach cell, either there is a connected chain of drawn diagonals from the left\nside to the right side, or there is one from the top side to the bottom side\n(the two alternatives are not exclusive). -/\ndef Target : Prop :=\n ∀ (m n : ℕ), 1 ≤ m → 1 ≤ n →\n ∀ d : Cell m n → Diagonal,\n HasLeftRightChain d ∨ HasTopBottomChain d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "62f4db75-a492-5625-a214-20bb5bbd3845", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "849c3d3d619efba2ae16440868961d8f18385c621ebb7bcaf2bc63f7c07ef964", "task_path": "tasks/nmp3_62f4db75-a492-5625-a214-20bb5bbd3845", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "62f4db75-a492-5625-a214-20bb5bbd3845", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_62f8a9da-bdec-5243-8fc2-770028f59276", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{\\sqrt{(1+a)(1+b)}}+\\frac{1}{\\sqrt{(1+b)(1+c)}}+\\frac{1}{\\sqrt{(1+c)(1+a)}}\\le\\frac{3}{2}\\,.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\nnamespace Problem\n\n/-- The left-hand side of the inequality from the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / Real.sqrt ((1 + a) * (1 + b)) +\n 1 / Real.sqrt ((1 + b) * (1 + c)) +\n 1 / Real.sqrt ((1 + c) * (1 + a))\n\n/-- The assertion to be proved: for all positive real numbers `a`, `b`, and `c`\nwith `abc = 1`, the cyclic sum of reciprocal square roots is at most `3 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a * b * c = 1 →\n lhs a b c ≤ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "62f8a9da-bdec-5243-8fc2-770028f59276", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8a7196060fd6449b50ec35fc83228fe378c303bea4a28e00a7569b157495e9f3", "task_path": "tasks/nmp3_62f8a9da-bdec-5243-8fc2-770028f59276", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "62f8a9da-bdec-5243-8fc2-770028f59276", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_62fe54e3-825a-5d9d-8b1b-d8c2c38581a5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z,a,b,c>0$ satisfy \n-- \\[\n-- xy+yz+zx+xyz=4\\qquad\\text{and}\\qquad ab+bc+ca+abc=4.\n-- \\] \n-- Prove that \n-- \\[\n-- \\frac{x}{a}+\\frac{y}{b}+\\frac{z}{c}\\ge \\frac{xyz}{abc}+2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a positive-real inequality under two symmetric constraints\n\nThe source problem asks to prove that for positive real numbers\n`x, y, z, a, b, c` satisfying\n`xy + yz + zx + xyz = 4` and `ab + bc + ca + abc = 4`,\nthe inequality\n`x / a + y / b + z / c ≥ xyz / (abc) + 2`\nholds.\n\nThe declarations below only state the proposition. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The six scalar variables are all strictly positive real numbers. -/\ndef PositiveVariables (x y z a b c : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The constraint satisfied by the first triple `x, y, z`. -/\ndef FirstConstraint (x y z : ℝ) : Prop :=\n x * y + y * z + z * x + x * y * z = 4\n\n/-- The constraint satisfied by the second triple `a, b, c`. -/\ndef SecondConstraint (a b c : ℝ) : Prop :=\n a * b + b * c + c * a + a * b * c = 4\n\n/-- The full hypothesis of the problem: positivity and both constraints. -/\ndef Admissible (x y z a b c : ℝ) : Prop :=\n PositiveVariables x y z a b c ∧\n FirstConstraint x y z ∧\n SecondConstraint a b c\n\n/-- The inequality asserted in the conclusion of the problem. -/\ndef Inequality (x y z a b c : ℝ) : Prop :=\n x / a + y / b + z / c ≥ x * y * z / (a * b * c) + 2\n\n/-- The universal implication stated by the source problem. -/\ndef Target : Prop :=\n ∀ x y z a b c : ℝ,\n Admissible x y z a b c → Inequality x y z a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "62fe54e3-825a-5d9d-8b1b-d8c2c38581a5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "161a7405f1352e74382c4679c3f15579f1f52c0d0a6013829190663e7913413c", "task_path": "tasks/nmp3_62fe54e3-825a-5d9d-8b1b-d8c2c38581a5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "62fe54e3-825a-5d9d-8b1b-d8c2c38581a5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_63da41e1-47db-5a38-8958-edd971410db2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Peter has a deck of 1001 cards. He writes the numbers $1,2,\\ldots,1001$ on the cards (one number per card) on the side that will be face down (the blue side). He then arranges the cards in a circle, blue side down. For each card $C$, consider the $500$ consecutive cards that follow $C$ clockwise (not including $C$). Let $f(C)$ be the number of those $500$ cards whose blue numbers are larger than the blue number on $C$. Peter writes the value $f(C)$ on the opposite side of $C$ (the red side). Basil sees only the red numbers $f(C)$ on all cards. Prove that Basil can determine the blue number on each card; i.e., the blue numbers are uniquely determined by the red numbers.\nimport Mathlib\n\n/-!\n# Formalization of the 1001-card red/blue counter problem\n\nThe cards are represented by their positions in a fixed clockwise cyclic order.\nA blue numbering is a bijection from positions to the labels `0, ..., 1000`; the\nfunction `blueNumber` converts these labels to the actual blue numbers\n`1, ..., 1001`. The 500 cards following a position clockwise are the positions\nat offsets `1, ..., 500` in this cyclic order.\n\nThe final declaration `Target` states that, for every blue numbering, the\nresulting complete red profile determines a unique table of blue numbers on the\ncards. The existence part is witnessed by the original numbering; the\nuniqueness part is the mathematical content requested by the problem.\n-/\n\nnamespace Problem\n\n/-- The 1001 card positions, indexed in clockwise cyclic order. -/\nabbrev CardPosition : Type := Fin 1001\n\n/--\nThe 1001 possible blue-number labels, zero-based. The actual blue number\nencoded by `k : BlueLabel` is `k.val + 1`.\n-/\nabbrev BlueLabel : Type := Fin 1001\n\n/--\nA placement of the blue numbers on the cards, encoded as a bijection from card\npositions to the 1001 blue-number labels. Bijectivity expresses that the\nnumbers `1, ..., 1001` are written one per card.\n-/\nabbrev BlueNumbering : Type := CardPosition ≃ BlueLabel\n\n/-- The actual blue number (`1` through `1001`) written on the card at `i`. -/\ndef blueNumber (b : BlueNumbering) (i : CardPosition) : ℕ :=\n (b i).val + 1\n\n/-- The complete table of blue numbers on the cards. -/\ndef blueTable (b : BlueNumbering) : CardPosition → ℕ :=\n fun i => blueNumber b i\n\n/-- The clockwise offset `1, ..., 500` corresponding to `d : Fin 500`. -/\ndef clockwiseOffset (d : Fin 500) : CardPosition :=\n Fin.castLE (by norm_num : 500 ≤ 1001) d + 1\n\n/--\nThe set of the 500 cards immediately following `i` clockwise, not including\n`i` itself.\n-/\ndef followingClockwise (i : CardPosition) : Finset CardPosition :=\n Finset.univ.image (fun d : Fin 500 => i + clockwiseOffset d)\n\n/--\nThe red number at `i`: the number of the 500 following cards whose blue numbers\nare strictly larger than the blue number on `i`.\n-/\ndef redNumber (b : BlueNumbering) (i : CardPosition) : ℕ :=\n ((followingClockwise i).filter\n (fun j => blueNumber b i < blueNumber b j)).card\n\n/-- The complete red-side information visible to Basil. -/\ndef RedProfile (b : BlueNumbering) : CardPosition → ℕ :=\n fun i => redNumber b i\n\n/--\nA proposed table of blue numbers is consistent with an observed red profile if\nit is the blue-number table of some blue numbering producing exactly that red\nprofile.\n-/\ndef BlueTableCorrectForRedProfile\n (r : CardPosition → ℕ) (answer : CardPosition → ℕ) : Prop :=\n ∃ b : BlueNumbering, RedProfile b = r ∧ answer = blueTable b\n\n/--\nThe observed red profile determines the complete table of blue numbers: exactly\none table of blue numbers on the red-visible card positions is consistent with\nthe red profile.\n-/\ndef RedProfileDeterminesBlueTable (r : CardPosition → ℕ) : Prop :=\n ∃! answer : CardPosition → ℕ, BlueTableCorrectForRedProfile r answer\n\n/--\nThe statement to be proved: Basil can determine the blue number on each card\nfrom the red numbers. For each actual blue numbering `a`, the red profile it\nproduces has a unique consistent complete table of blue numbers on the cards.\n\nEquivalently, this says that any two blue numberings with the same red profile\nhave the same complete table of blue numbers. The equivalence is mathematical;\nthe declaration itself records the existence-and-uniqueness form.\n-/\ndef Target : Prop :=\n ∀ a : BlueNumbering,\n RedProfileDeterminesBlueTable (RedProfile a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "63da41e1-47db-5a38-8958-edd971410db2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ab549fa2bf2a011222ddbfc56ab821a0d01d77a4fa70f965963150b8a7223f85", "task_path": "tasks/nmp3_63da41e1-47db-5a38-8958-edd971410db2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "63da41e1-47db-5a38-8958-edd971410db2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_63f5adcd-60e1-5d71-bc82-22bc13cbf24c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Alice has an integer $N>1$ on a blackboard. Starting with $x_0=N$, she repeatedly performs the following step: if the current number $x_k$ is not a perfect cube, she replaces it with $2x_k+1$; if $x_k$ is a perfect cube, she replaces it with its integer cube root $\\sqrt[3]{x_k}$. Prove that at some step $k$ the number written on the board satisfies $x_k>10^{100}$.\nimport Mathlib\n\n/-!\nFormalization of the statement in `problem.md`.\n\nThe board contains an integer. `IsIntegerCubeRoot r x` says that `r` is\nan integer cube root of `x`, and `IsPerfectCube x` says that such an\ninteger root exists. The chosen root is used to define the deterministic\nprocess. The main target is the assertion that, for every integer `N > 1`,\nthe orbit starting at `N` eventually contains a term strictly larger than\n`10 ^ 100`.\n-/\n\nnamespace Problem\n\n/-- `r` is an integer cube root of `x`. -/\ndef IsIntegerCubeRoot (r x : ℤ) : Prop :=\n x = r ^ 3\n\n/-- `x` is a perfect cube in the integers. -/\ndef IsPerfectCube (x : ℤ) : Prop :=\n ∃ r : ℤ, IsIntegerCubeRoot r x\n\n/-- The integer cube root of a perfect cube, chosen from its defining\nexistential witness. Its defining property is recorded by\n`integerCubeRoot_spec`; uniqueness over the integers is recorded by\n`integerCubeRoot_unique`. -/\nnoncomputable def integerCubeRoot (x : ℤ) (hx : IsPerfectCube x) : ℤ :=\n Classical.choose hx\n\n/-- The chosen integer cube root really is a cube root. -/\ntheorem integerCubeRoot_spec (x : ℤ) (hx : IsPerfectCube x) :\n IsIntegerCubeRoot (integerCubeRoot x hx) x := by\n simpa [integerCubeRoot, IsPerfectCube, IsIntegerCubeRoot] using\n (Classical.choose_spec hx)\n\n/-- Integer cube roots are unique, so the arbitrary choice in\n`integerCubeRoot` represents the intended root uniquely. -/\ntheorem integerCubeRoot_unique (x r : ℤ) (hx : IsPerfectCube x)\n (hr : IsIntegerCubeRoot r x) : integerCubeRoot x hx = r := by\n apply (Odd.pow_injective (n := 3) (by norm_num : Odd 3) :\n Function.Injective fun z : ℤ => z ^ 3)\n exact (integerCubeRoot_spec x hx).symm.trans hr\n\n/-- One step of the process. If `x` is a perfect cube, replace it by its\ninteger cube root; otherwise replace it by `2 * x + 1`. -/\nnoncomputable def next (x : ℤ) : ℤ := by\n classical\n exact if hx : IsPerfectCube x then integerCubeRoot x hx else 2 * x + 1\n\n/-- At a perfect cube, one step takes the integer cube root. -/\ntheorem next_of_perfectCube {x : ℤ} (hx : IsPerfectCube x) :\n next x = integerCubeRoot x hx := by\n classical\n simp [next, hx]\n\n/-- At a non-cube, one step takes `2 * x + 1`. -/\ntheorem next_of_not_perfectCube {x : ℤ} (hx : ¬ IsPerfectCube x) :\n next x = 2 * x + 1 := by\n classical\n simp [next, hx]\n\n/-- The sequence on the board, with `orbit N 0 = N` and each successor\ngiven by `next`. -/\nnoncomputable def orbit (N : ℤ) : ℕ → ℤ\n | 0 => N\n | k + 1 => next (orbit N k)\n\n/-- The initial value of the orbit is `N`. -/\n@[simp] theorem orbit_zero (N : ℤ) : orbit N 0 = N := rfl\n\n/-- The successor recurrence defining the orbit. -/\n@[simp] theorem orbit_succ (N : ℤ) (k : ℕ) :\n orbit N (k + 1) = next (orbit N k) := rfl\n\n/-- The explicit threshold from the problem. -/\ndef threshold : ℤ := (10 : ℤ) ^ 100\n\n/-- The orbit starting at `N` reaches a value strictly larger than the\nthreshold at some nonnegative step. -/\ndef reachesAbove (N : ℤ) : Prop :=\n ∃ k : ℕ, threshold < orbit N k\n\n/-- The full assertion: for every integer `N > 1`, the process starting at\n`N` eventually writes a number strictly greater than `10 ^ 100`. -/\ndef Target : Prop :=\n ∀ N : ℤ, (1 : ℤ) < N → reachesAbove N\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "63f5adcd-60e1-5d71-bc82-22bc13cbf24c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b0867efc7e2bf79b2d489731d276fe0a05693c26d6d3d995f85bb93db0b4c70c", "task_path": "tasks/nmp3_63f5adcd-60e1-5d71-bc82-22bc13cbf24c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "63f5adcd-60e1-5d71-bc82-22bc13cbf24c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6448ba29-7139-5bf5-93cd-fa88a552a457", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Positive real numbers $x,y,z$ satisfy $xyz+xy+yz+zx = x+y+z+1$. Prove that \n-- \\[\n-- \\frac13\\Bigg(\\sqrt{\\frac{1+x^2}{1+x}}+\\sqrt{\\frac{1+y^2}{1+y}}+\\sqrt{\\frac{1+z^2}{1+z}}\\Bigg)\\le\\Big(\\frac{x+y+z}{3}\\Big)^{5/8}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a positive-real inequality\n\nThe problem asks to prove an inequality for all positive real numbers\n`x`, `y`, and `z` satisfying\n`x*y*z + x*y + y*z + z*x = x + y + z + 1`.\n\nThis file records the exact proposition as a `Prop`-valued definition. It\ndoes not assert or prove that the proposition is true.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The strict positivity condition on a triple of real numbers. -/\ndef Positive (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The algebraic equation imposed on a triple of real numbers. -/\ndef Equation (x y z : ℝ) : Prop :=\n x * y * z + x * y + y * z + z * x = x + y + z + 1\n\n/-- The admissibility condition on a triple of real numbers from the problem:\nall three are strictly positive and they satisfy the displayed algebraic\nequation. -/\ndef Admissible (x y z : ℝ) : Prop :=\n Positive x y z ∧ Equation x y z\n\n/-- The left-hand side of the requested inequality. -/\ndef lhs (x y z : ℝ) : ℝ :=\n (Real.sqrt ((1 + x ^ 2) / (1 + x)) +\n Real.sqrt ((1 + y ^ 2) / (1 + y)) +\n Real.sqrt ((1 + z ^ 2) / (1 + z))) / 3\n\n/-- The right-hand side of the requested inequality. -/\ndef rhs (x y z : ℝ) : ℝ :=\n ((x + y + z) / 3) ^ (5 / 8 : ℝ)\n\n/-- The inequality to be proved for each admissible triple. -/\ndef Inequality (x y z : ℝ) : Prop :=\n lhs x y z ≤ rhs x y z\n\n/-- The full universally quantified statement of the problem: for every\ntriple of positive real numbers satisfying the given equation, the displayed\ninequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6448ba29-7139-5bf5-93cd-fa88a552a457", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6861ab7efa38744f5326bcb07dc7e72922dd25e5185341f538fe1b3edb250e05", "task_path": "tasks/nmp3_6448ba29-7139-5bf5-93cd-fa88a552a457", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6448ba29-7139-5bf5-93cd-fa88a552a457", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_647bdcd5-4ead-502f-bb3b-dcc3cf3564fc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In the parliament of Alternativia there are finitely many deputies. The acquaintance relation among deputies is symmetric. The condition “for any two deputies there exists a third who is acquainted with exactly one of the two’’ holds. Each deputy belongs to exactly one of two parties. Each day the President (who is not a deputy) selects a (non‑empty) set S of deputies and orders them to switch parties; simultaneously every deputy who knows at least one member of S also switches parties. Prove that the President can, after finitely many days, ensure that all deputies belong to the same party.\nimport Mathlib\n\n/-!\n# The parliament of Alternativia\n\nThis file formalizes the statement of the problem, without giving a proof.\nThe President acts on a finite set of deputies equipped with a symmetric\nacquaintance relation and a two-party assignment. A daily move replaces the\nparty assignment by one obtained by switching exactly the deputies in a chosen\nnonempty set and all deputies acquainted with at least one member of that set.\nThe target proposition asserts that some finite sequence of such moves reaches\na constant party assignment.\n-/\n\nnamespace Problem\n\nuniverse u\n\n/-- The two possible parties. The names are arbitrary labels. -/\ninductive Party where\n | first\n | second\n deriving DecidableEq, Repr\n\n/-- A proposition saying that exactly one of `P` and `Q` holds. -/\ndef ExactlyOne (P Q : Prop) : Prop :=\n (P ∧ ¬ Q) ∨ (¬ P ∧ Q)\n\n/-- The acquaintance relation is symmetric. -/\ndef SymmetricAcquaintance {V : Type u} (acquainted : V → V → Prop) : Prop :=\n ∀ x y : V, acquainted x y → acquainted y x\n\n/-- For every two distinct deputies, there is a third deputy who is acquainted\nwith exactly one of them. -/\ndef HasThirdAcquaintedWithExactlyOne {V : Type u}\n (acquainted : V → V → Prop) : Prop :=\n ∀ x y : V, x ≠ y →\n ∃ z : V,\n z ≠ x ∧ z ≠ y ∧\n ExactlyOne (acquainted z x) (acquainted z y)\n\n/-- The deputies whose parties switch on a day when `S` is selected: the\nmembers of `S`, together with all deputies acquainted with a member of `S`. -/\ndef SwitchesOn {V : Type u} (acquainted : V → V → Prop) (S : Set V)\n (v : V) : Prop :=\n v ∈ S ∨ ∃ s : V, s ∈ S ∧ acquainted v s\n\n/-- One day's move. The chosen set `S` is nonempty, and a deputy's party\nchanges exactly when that deputy is in `S` or knows a member of `S`. Since\nthere are only two parties, `q v ≠ p v` means that the deputy switched. -/\ndef DayStep {V : Type u} (acquainted : V → V → Prop)\n (p q : V → Party) : Prop :=\n ∃ S : Set V,\n S.Nonempty ∧\n ∀ v : V, (q v ≠ p v ↔ SwitchesOn acquainted S v)\n\n/-- `q` is reachable from `p` after finitely many days (possibly zero days). -/\ndef FinitelyReachable {V : Type u} (acquainted : V → V → Prop)\n (p q : V → Party) : Prop :=\n Relation.ReflTransGen (DayStep acquainted) p q\n\n/-- Every deputy belongs to the same party. -/\ndef AllOneParty {V : Type u} (p : V → Party) : Prop :=\n ∀ x y : V, p x = p y\n\n/-- The assertion to be proved: in every finite parliament satisfying the\nstated acquaintance condition, every initial two-party assignment can be made\nconstant by finitely many legal daily moves. -/\ndef Target : Prop :=\n ∀ (V : Type u) [Fintype V],\n ∀ (acquainted : V → V → Prop),\n SymmetricAcquaintance acquainted →\n HasThirdAcquaintedWithExactlyOne acquainted →\n ∀ p : V → Party,\n ∃ q : V → Party,\n FinitelyReachable acquainted p q ∧ AllOneParty q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "647bdcd5-4ead-502f-bb3b-dcc3cf3564fc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e9937c6e6eac712d5bbd634f9924dd74942328c3577b08b6d56542680ea042b2", "task_path": "tasks/nmp3_647bdcd5-4ead-502f-bb3b-dcc3cf3564fc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "647bdcd5-4ead-502f-bb3b-dcc3cf3564fc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_648db476-eed3-5862-bd6e-b728104288ae", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 2$ and $k\\ge \\frac52\\,n-1$ be integers. Choose any $k$ distinct lattice points $(x,y)$ with integer coordinates satisfying $1\\le x\\le n$ and $1\\le y\\le n$. Prove that among the chosen points there exist four that lie on a common circle.\nimport Mathlib\n\n/-!\n# Formal statement: four concyclic lattice points in a square grid\n\nThis file formalizes the statement of the problem, without proving it.\n-/\n\nnamespace Problem\n\n/-- A lattice point in the plane, represented by its two integer coordinates. -/\nabbrev LatticePoint : Type := ℤ × ℤ\n\n/-- A lattice point lies in the `n` by `n` grid with coordinates from `1` through `n`. -/\ndef InGrid (n : ℤ) (p : LatticePoint) : Prop :=\n 1 ≤ p.1 ∧ p.1 ≤ n ∧ 1 ≤ p.2 ∧ p.2 ≤ n\n\n/-- The point `p` lies on the circle with center `(cx, cy)` and radius `r`. -/\ndef OnCircle (p : LatticePoint) (cx cy r : ℝ) : Prop :=\n ((p.1 : ℝ) - cx) ^ 2 + ((p.2 : ℝ) - cy) ^ 2 = r ^ 2\n\n/-- A finite set of lattice points contains four distinct points on a common\nnondegenerate circle. -/\ndef ContainsFourOnCircle (S : Finset LatticePoint) : Prop :=\n ∃ T : Finset LatticePoint,\n T ⊆ S ∧ T.card = 4 ∧\n ∃ cx cy r : ℝ, 0 < r ∧ ∀ p ∈ T, OnCircle p cx cy r\n\n/-- Let `n ≥ 2` and let `k ≥ (5 / 2) n - 1` be integers. Any set of `k`\ndistinct lattice points in the `n` by `n` grid contains four points lying on a\ncommon circle. -/\ndef Target : Prop :=\n ∀ (n k : ℤ),\n 2 ≤ n →\n ((5 : ℝ) / 2) * (n : ℝ) - 1 ≤ (k : ℝ) →\n ∀ S : Finset LatticePoint,\n (S.card : ℤ) = k →\n (∀ p ∈ S, InGrid n p) →\n ContainsFourOnCircle S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "648db476-eed3-5862-bd6e-b728104288ae", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8cad5f4c074716f10b49d1a92bbfdb893a7f25f3a38bf00eb8b980f4e0819497", "task_path": "tasks/nmp3_648db476-eed3-5862-bd6e-b728104288ae", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "648db476-eed3-5862-bd6e-b728104288ae", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_64c78429-a2e7-5cc5-9740-c9019bd40866", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that the Diophantine equation \n-- $$x^2y^2 = z^2\\bigl(z^2 - x^2 - y^2\\bigr)$$ \n-- has no solutions in positive integers $x,\\;y,\\;z$.\nimport Mathlib\n\n/-!\n# Formalization of the Diophantine equation problem\n\nThe source problem asks to prove that the equation\n\n x² y² = z² (z² - x² - y²)\n\nhas no solutions in positive integers x, y, z.\n\nThe subtraction on the right-hand side is interpreted as subtraction in `ℤ`.\nThis is the standard reading of a Diophantine equation in integer unknowns, and\navoids the truncating behavior of subtraction in `ℕ`.\n-/\n\nnamespace Problem\n\n/-- The polynomial equation from the problem, stated over the integers. -/\ndef DiophantineEquation (x y z : ℤ) : Prop :=\n x ^ 2 * y ^ 2 = z ^ 2 * (z ^ 2 - x ^ 2 - y ^ 2)\n\n/-- A positive integer solution of the displayed Diophantine equation. -/\ndef HasPositiveIntegerSolution : Prop :=\n ∃ x y z : ℕ,\n 0 < x ∧ 0 < y ∧ 0 < z ∧\n DiophantineEquation (x : ℤ) (y : ℤ) (z : ℤ)\n\n/-- The assertion requested by the problem: there are no positive integer\nsolutions `x, y, z` of the displayed equation. -/\ndef Target : Prop := ¬ HasPositiveIntegerSolution\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "64c78429-a2e7-5cc5-9740-c9019bd40866", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "345452a47daca99443498ce1a5e469a0463220ecd555da8db2931bc8e38444be", "task_path": "tasks/nmp3_64c78429-a2e7-5cc5-9740-c9019bd40866", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "64c78429-a2e7-5cc5-9740-c9019bd40866", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_64f18f96-db49-5fd4-a752-c9a60d11108a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $x$, $y$, and $z$ satisfying $x+y+z=2$, prove that \n-- \\[\n-- \\frac{x^{2}\\sqrt{y}}{\\sqrt{x+z}}+\\frac{y^{2}\\sqrt{z}}{\\sqrt{y+x}}+\\frac{z^{2}\\sqrt{x}}{\\sqrt{z+y}}\n-- \\le \\sqrt{x^{3}+y^{3}+z^{3}}\\,.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement of the target inequality\n\nThe source problem asks, for positive real numbers `x`, `y`, and `z`\nwith `x + y + z = 2`, to prove the stated inequality involving real\nsquare roots. The declarations below only state the proposition; no\nproof of it is provided.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n x ^ 2 * Real.sqrt y / Real.sqrt (x + z) +\n y ^ 2 * Real.sqrt z / Real.sqrt (y + x) +\n z ^ 2 * Real.sqrt x / Real.sqrt (z + y)\n\n/-- The right-hand side of the inequality in the problem. -/\nnoncomputable def rhs (x y z : ℝ) : ℝ :=\n Real.sqrt (x ^ 3 + y ^ 3 + z ^ 3)\n\n/-- Admissibility of the variables: they are positive real numbers whose\nsum is `2`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = 2\n\n/-- The asserted inequality for fixed admissible `x`, `y`, and `z`. -/\nnoncomputable def Inequality (x y z : ℝ) : Prop :=\n lhs x y z ≤ rhs x y z\n\n/-- The complete universally quantified proposition of the problem. -/\nnoncomputable def Target : Prop :=\n ∀ (x y z : ℝ), Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "64f18f96-db49-5fd4-a752-c9a60d11108a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4179c67517275469773aa1df9fb908b11a5ac959852af3657f66237f2fc143b6", "task_path": "tasks/nmp3_64f18f96-db49-5fd4-a752-c9a60d11108a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "64f18f96-db49-5fd4-a752-c9a60d11108a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_654f6ab7-5d16-5afa-bbc4-4431bc38d2ef", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m,n\\ge 2$ be integers, let $X$ be a set with $|X|=n$, and let $X_1,X_2,\\dots,X_m\\subseteq X$ be pairwise distinct non‑empty (not necessarily disjoint) subsets. A function $f\\colon X\\to\\{1,2,\\dots,n+1\\}$ is called **nice** if there exists an index $k$ such that \n-- \\[\n-- \\sum_{x\\in X_k}f(x)>\\sum_{x\\in X_i}f(x)\\qquad\\text{for all }i\\neq k.\n-- \\]\n-- Prove that the number of nice functions is at least $n^n\\,. $\nimport Mathlib\n\nopen scoped BigOperators\n\nuniverse u\n\nnamespace Problem\n\n/-- The finite set `{1, 2, ..., n+1}` of possible values of a function. -/\nabbrev Value (n : ℕ) : Type := {v : ℕ // v ∈ Finset.Icc 1 (n + 1)}\n\n/-- The natural `Fintype` structure on the finite interval `{1, ..., n+1}`. -/\ninstance Value.instFintype (n : ℕ) : Fintype (Value n) := by\n unfold Value\n infer_instance\n\n/-- A function from `X` to `{1, ..., n+1}` is nice for a family `Y` of subsets\nif one member of the family has strictly larger `f`-sum than every other member. -/\ndef Nice (m n : ℕ) (X : Type u) (Y : Fin m → Finset X)\n (f : X → Value n) : Prop :=\n ∃ k : Fin m, ∀ i : Fin m, i ≠ k →\n (∑ x ∈ Y k, (f x).val) > (∑ x ∈ Y i, (f x).val)\n\n/-- The family `Y` consists of pairwise distinct nonempty subsets of `X`.\nNo disjointness condition is included. -/\ndef FamilyAdmissible (m : ℕ) (X : Type u) (Y : Fin m → Finset X) : Prop :=\n (∀ i : Fin m, (Y i).Nonempty) ∧ Function.Injective Y\n\n/-- The number of nice functions `f : X → {1, ..., n+1}` for the family `Y`. -/\nnoncomputable def NiceFunctionCount (m n : ℕ) (X : Type u) [Fintype X]\n (Y : Fin m → Finset X) : ℕ := by\n classical\n exact Fintype.card { f : X → Value n // Nice m n X Y f }\n\n/-- The assertion of the problem: for all integers `m,n ≥ 2`, every set `X`\nwith `|X| = n`, and every pairwise distinct nonempty family\n`X₁, ..., Xₘ ⊆ X`, at least `n^n` functions `f : X → {1,...,n+1}` are nice. -/\ndef Target : Prop :=\n ∀ (m n : ℕ), 2 ≤ m → 2 ≤ n →\n ∀ (X : Type u) [Fintype X],\n Fintype.card X = n →\n ∀ Y : Fin m → Finset X,\n FamilyAdmissible m X Y →\n NiceFunctionCount m n X Y ≥ n ^ n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "654f6ab7-5d16-5afa-bbc4-4431bc38d2ef", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8a1b29fa48dae52ae44e6aa66b1e8769cad4951d2b8f80cdd3a6a83c9ae6521f", "task_path": "tasks/nmp3_654f6ab7-5d16-5afa-bbc4-4431bc38d2ef", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "654f6ab7-5d16-5afa-bbc4-4431bc38d2ef", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_65670e91-f4d8-5628-a8f2-ba59123978e5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle with incenter $I$. Let $I_1$, $I_2$, $I_3$ be the incenters of triangles $BIC$, $CIA$, and $AIB$, respectively. Prove that the lines $AI_1$, $BI_2$, and $CI_3$ are concurrent.\nimport Mathlib\n\n/-!\nFormalization of the following plane geometry statement.\n\nLet `ABC` be a triangle with incenter `I`. Let `I₁`, `I₂`, `I₃` be the\nincenters of triangles `BIC`, `CIA`, and `AIB`, respectively. Prove that the\nlines `AI₁`, `BI₂`, and `CI₃` are concurrent.\n\nThe file gives explicit coordinate definitions for a nondegenerate triangle,\nstrict interior, the (undirected) distance from a point to a side line, the\nincenter predicate, collinearity, and concurrence of three lines. The target\nis stated as a `Prop`-valued definition; no proof of the target is supplied.\n-/\n\nnamespace Problem\n\n/-- A point of the Euclidean plane, represented by its Cartesian coordinates. -/\nstructure Point2 where\n x : ℝ\n y : ℝ\n\n/-- The displacement vector from `P` to `Q`. -/\ndef displacement (P Q : Point2) : Point2 :=\n ⟨Q.x - P.x, Q.y - P.y⟩\n\n/-- The signed two-dimensional cross product (twice the signed area). -/\ndef cross (u v : Point2) : ℝ :=\n u.x * v.y - u.y * v.x\n\n/-- The oriented doubled area of the triangle with vertices `A`, `B`, `C`. -/\ndef doubledArea (A B C : Point2) : ℝ :=\n cross (displacement A B) (displacement A C)\n\n/-- `A`, `B`, and `C` are the vertices of a nondegenerate triangle. -/\ndef NondegenerateTriangle (A B C : Point2) : Prop :=\n doubledArea A B C ≠ 0\n\n/-- `P` lies strictly in the interior of triangle `ABC`, expressed through\nstrictly positive barycentric coordinates. -/\ndef StrictlyInside (A B C P : Point2) : Prop :=\n ∃ α β γ : ℝ,\n 0 < α ∧ 0 < β ∧ 0 < γ ∧\n α + β + γ = 1 ∧\n P = ⟨α * A.x + β * B.x + γ * C.x,\n α * A.y + β * B.y + γ * C.y⟩\n\n/-- The Euclidean distance from `P` to the line through the distinct points\n`A` and `B`. For a nondegenerate triangle, every side has distinct endpoints. -/\nnoncomputable def distToLine (A B P : Point2) : ℝ :=\n |cross (displacement A B) (displacement A P)| /\n Real.sqrt ((displacement A B).x ^ 2 + (displacement A B).y ^ 2)\n\n/-- `I` is the internal incenter of triangle `ABC`: `ABC` is nondegenerate,\n`I` is strictly inside it, and its distances to the three side lines are equal. -/\ndef IsIncenter (A B C I : Point2) : Prop :=\n NondegenerateTriangle A B C ∧\n StrictlyInside A B C I ∧\n distToLine A B I = distToLine B C I ∧\n distToLine B C I = distToLine C A I\n\n/-- `A`, `B`, and `P` are collinear. -/\ndef Collinear (A B P : Point2) : Prop :=\n cross (displacement A B) (displacement A P) = 0\n\n/-- `P` lies on the proper line determined by the distinct points `A` and `B`. -/\ndef LineThrough (A B P : Point2) : Prop :=\n A ≠ B ∧ Collinear A B P\n\n/-- The three proper lines `AB`, `CD`, and `EF` are concurrent. Requiring each\npair of endpoints to be distinct records the standard definedness condition for\nthe line notation used in the problem. -/\ndef LinesConcurrent (A B C D E F : Point2) : Prop :=\n ∃ P : Point2,\n LineThrough A B P ∧ LineThrough C D P ∧ LineThrough E F P\n\n/-- The formalized target statement: for every triangle `ABC` with internal\nincenter `I`, if `I₁`, `I₂`, and `I₃` are the internal incenters of the\ntriangles `BIC`, `CIA`, and `AIB`, respectively, then the lines `AI₁`, `BI₂`,\nand `CI₃` are concurrent. -/\ndef Target : Prop :=\n ∀ A B C I I1 I2 I3 : Point2,\n IsIncenter A B C I →\n IsIncenter B I C I1 →\n IsIncenter C I A I2 →\n IsIncenter A I B I3 →\n LinesConcurrent A I1 B I2 C I3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "65670e91-f4d8-5628-a8f2-ba59123978e5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dae301e9612ba1a73d5bf7f4389c01d19b9bfd7121644363dfee951a21f709c9", "task_path": "tasks/nmp3_65670e91-f4d8-5628-a8f2-ba59123978e5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "65670e91-f4d8-5628-a8f2-ba59123978e5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6582cf86-75fd-5a2e-b4cd-334e0e6dc785", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for any function $f:(0,\\infty)\\to(0,\\infty)$ there exist real numbers $x>0$ and $y>0$ such that $f(x+y) 0`\nand `y > 0` such that `f (x + y) < y * f (f x)`.\n-/\ndef Target : Prop :=\n ∀ f : PositiveReal → PositiveReal,\n ∃ x : ℝ, ∃ y : ℝ, ∃ hx : 0 < x, ∃ hy : 0 < y,\n (f ⟨x + y, add_pos hx hy⟩ : ℝ) <\n y * (f (f ⟨x, hx⟩) : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6582cf86-75fd-5a2e-b4cd-334e0e6dc785", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1aa8b703cf2b225bf56886b75196e688390a6cba9aabbce26f8756908afaad71", "task_path": "tasks/nmp3_6582cf86-75fd-5a2e-b4cd-334e0e6dc785", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6582cf86-75fd-5a2e-b4cd-334e0e6dc785", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_659598de-ac30-5d4e-ab82-f1ae52efce29", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^{2}}{a^{2}+ab+b^{2}}+\\frac{b^{2}}{b^{2}+bc+c^{2}}+\\frac{c^{2}}{c^{2}+ca+a^{2}}\\ge 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic inequality\n\nThis file records the assertion from the problem statement without proving it.\nAll variables are real numbers, and the hypotheses state that each is positive.\n-/\n\nnamespace Problem\n\n/-- The cyclic left-hand side appearing in the problem. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n a ^ 2 / (a ^ 2 + a * b + b ^ 2) +\n b ^ 2 / (b ^ 2 + b * c + c ^ 2) +\n c ^ 2 / (c ^ 2 + c * a + a ^ 2)\n\n/-- For all positive real numbers `a`, `b`, and `c`, the cyclic sum is at least one. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → cyclicSum a b c ≥ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "659598de-ac30-5d4e-ab82-f1ae52efce29", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a77323ae76727b5737652c6e9c8bda13663b4bc550e676d09fe8656208962a39", "task_path": "tasks/nmp3_659598de-ac30-5d4e-ab82-f1ae52efce29", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "659598de-ac30-5d4e-ab82-f1ae52efce29", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_65b9665a-34f0-5520-9029-109bba0bc09b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,\\;b,\\;c\\) be positive real numbers. Prove the inequality \n-- \\[\n-- 3\\Bigl(a+\\sqrt{ab}+\\sqrt[3]{abc}\\Bigr)\\;\\le\\;2\\Bigl(4+\\frac{\\sqrt{ab}}{a+b}\\Bigr)\\sqrt[3]{\\,a\\cdot\\frac{a+b}{2}\\cdot\\frac{a+b+c}{3}\\,}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nThe real cube root of `x`, represented as the principal real power `x ^ (1 / 3 : ℝ)`.\nFor the nonnegative (indeed positive) radicands in the target inequality, this is the\nusual nonnegative cube root.\n-/\nnoncomputable def cubeRoot (x : ℝ) : ℝ := Real.rpow x (1 / 3 : ℝ)\n\n/--\nFor all positive real numbers `a`, `b`, and `c`,\n`3 (a + sqrt (a b) + cbrt (a b c))`\nis at most\n`2 (4 + sqrt (a b) / (a + b)) * cbrt (a ((a + b) / 2) ((a + b + c) / 3))`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 3 * (a + Real.sqrt (a * b) + cubeRoot (a * b * c))\n ≤ 2 * (4 + Real.sqrt (a * b) / (a + b)) *\n cubeRoot (a * ((a + b) / 2) * ((a + b + c) / 3))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "65b9665a-34f0-5520-9029-109bba0bc09b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d5d4c9cf7a288745c73979b28533aa203110ff86fad2c73a69fd9fd2c188a64e", "task_path": "tasks/nmp3_65b9665a-34f0-5520-9029-109bba0bc09b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "65b9665a-34f0-5520-9029-109bba0bc09b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_65ce0ed3-58b5-5f65-b356-5a49abef5ab1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be positive real numbers. Prove that \n-- \\[\n-- \\frac{(b+c)(a^4-b^2c^2)}{ab+2bc+ca}+\\frac{(c+a)(b^4-c^2a^2)}{bc+2ca+ab}+\\frac{(a+b)(c^4-a^2b^2)}{ca+2ab+bc}\\ge 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Statement of the cyclic real inequality\n\nThis file formalizes the assertion in `problem.md`. It only records the\nmathematical statement as a proposition; it does not assert or prove it.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The first cyclic summand of the left-hand side. -/\ndef firstTerm (a b c : ℝ) : ℝ :=\n ((b + c) * (a ^ 4 - b ^ 2 * c ^ 2)) / (a * b + 2 * b * c + c * a)\n\n/-- The second cyclic summand of the left-hand side. -/\ndef secondTerm (a b c : ℝ) : ℝ :=\n ((c + a) * (b ^ 4 - c ^ 2 * a ^ 2)) / (b * c + 2 * c * a + a * b)\n\n/-- The third cyclic summand of the left-hand side. -/\ndef thirdTerm (a b c : ℝ) : ℝ :=\n ((a + b) * (c ^ 4 - a ^ 2 * b ^ 2)) / (c * a + 2 * a * b + b * c)\n\n/-- The complete left-hand side of the inequality. -/\ndef inequalityLHS (a b c : ℝ) : ℝ :=\n firstTerm a b c + secondTerm a b c + thirdTerm a b c\n\n/-- The statement to be proved: for all positive real numbers `a`, `b`, and `c`,\nthe given cyclic sum is nonnegative. -/\ndef Target : Prop :=\n ∀ (a : ℝ) (b : ℝ) (c : ℝ),\n 0 < a → 0 < b → 0 < c → 0 ≤ inequalityLHS a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "65ce0ed3-58b5-5f65-b356-5a49abef5ab1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "38d46bf8156639b391225c1d6cc9ef97220740678ca0a976c8af2433b1338777", "task_path": "tasks/nmp3_65ce0ed3-58b5-5f65-b356-5a49abef5ab1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "65ce0ed3-58b5-5f65-b356-5a49abef5ab1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_662a5a68-4c64-57f2-87fd-074f9da8901e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ and define \n-- \\[\n-- x=\\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}.\n-- \\] \n-- Prove that \n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\ge 3+\\frac{(7x+8)(x-1)}{(x+1)(x+2)}.\n-- \\]\n/-\nFormal statement of the inequality problem in `problem.md`.\n\nThe source asks to prove an inequality for positive real numbers `a`, `b`, `c`,\nwhere `x` is the symmetric ratio\n`(a^2 + b^2 + c^2) / (a*b + b*c + c*a)`.\n\nThis file records the assertion as a proposition; it does not prove it.\n-/\n\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The quantity `x` defined in the problem statement. -/\nnoncomputable def centralRatio (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a)\n\n/-- The left-hand side `a/b + b/c + c/a`. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n a / b + b / c + c / a\n\n/-- The right-hand side\n`3 + ((7*x + 8)*(x - 1))/((x + 1)*(x + 2))`, with `x` the central ratio. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n 3 + (7 * centralRatio a b c + 8) * (centralRatio a b c - 1) /\n ((centralRatio a b c + 1) * (centralRatio a b c + 2))\n\n/-- The proposition asserted by the problem: for all positive reals `a`, `b`, and\n`c`, the desired inequality holds with `x = (a^2+b^2+c^2)/(ab+bc+ca)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n leftHandSide a b c ≥ rightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "662a5a68-4c64-57f2-87fd-074f9da8901e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6d5fa3b13fcec6dbf9c08bc442ffbe06418f5a0bafc6f125496861c73d0c3094", "task_path": "tasks/nmp3_662a5a68-4c64-57f2-87fd-074f9da8901e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "662a5a68-4c64-57f2-87fd-074f9da8901e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6660e106-13eb-5dfe-8005-3440f9b3023d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a (non‑degenerate) tetrahedron $ABCD$, let $x = AB\\cdot CD$, $y = AC\\cdot BD$, and $z = AD\\cdot BC$, where $AB$, $AC$, $AD$, $BC$, $BD$, $CD$ denote the lengths of the edges of the tetrahedron. Prove that there exists a triangle whose side lengths are $x$, $y$, and $z$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Basic\nimport Mathlib.LinearAlgebra.AffineSpace.Simplex.Basic\n\n/-!\n# Products of opposite edges of a non-degenerate tetrahedron\n\nThis file formalizes the statement of the following problem: for a\nnon-degenerate tetrahedron `ABCD`, the three products `AB * CD`,\n`AC * BD`, and `AD * BC` are the side lengths of some triangle.\n\nThe target is recorded as a proposition-valued definition. No proof of\nthe target is part of this file.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane, used as the ambient affine plane for the triangle. -/\nabbrev EuclideanPlane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Three-dimensional Euclidean space, used as the ambient affine space for the tetrahedron. -/\nabbrev EuclideanThreeSpace : Type := EuclideanSpace ℝ (Fin 3)\n\n/-- The four vertices of a tetrahedron, indexed in the order `A, B, C, D`. -/\ndef tetrahedronVertices (A B C D : EuclideanThreeSpace) : Fin 4 → EuclideanThreeSpace :=\n ![A, B, C, D]\n\n/-- A tetrahedron with vertices `A, B, C, D` is non-degenerate when its four vertices are\naffinely independent. In three-dimensional Euclidean space this is equivalent to the four\nvertices not being coplanar. -/\ndef NondegenerateTetrahedron (A B C D : EuclideanThreeSpace) : Prop :=\n AffineIndependent ℝ (tetrahedronVertices A B C D)\n\n/-- The length of the edge between two points. -/\ndef edgeLength (P Q : EuclideanThreeSpace) : ℝ :=\n dist P Q\n\n/-- The product `AB * CD` of one pair of opposite edge lengths. -/\ndef oppositeEdgeProductAB_CD (A B C D : EuclideanThreeSpace) : ℝ :=\n edgeLength A B * edgeLength C D\n\n/-- The product `AC * BD` of one pair of opposite edge lengths. -/\ndef oppositeEdgeProductAC_BD (A B C D : EuclideanThreeSpace) : ℝ :=\n edgeLength A C * edgeLength B D\n\n/-- The product `AD * BC` of one pair of opposite edge lengths. -/\ndef oppositeEdgeProductAD_BC (A B C D : EuclideanThreeSpace) : ℝ :=\n edgeLength A D * edgeLength B C\n\n/-- There is a non-degenerate triangle in the Euclidean plane whose three side lengths, in\ncyclic order, are `x`, `y`, and `z`. A triangle is represented by three affinely independent\npoints in `EuclideanPlane`. -/\ndef ExistsTriangleWithSideLengths (x y z : ℝ) : Prop :=\n ∃ T : Affine.Triangle ℝ EuclideanPlane,\n dist (T.points 0) (T.points 1) = x ∧\n dist (T.points 1) (T.points 2) = y ∧\n dist (T.points 2) (T.points 0) = z\n\n/-- The full statement of the problem: for every non-degenerate tetrahedron `ABCD` in\nthree-dimensional Euclidean space, if\n`x = AB * CD`, `y = AC * BD`, and `z = AD * BC`, then there exists a triangle whose side\nlengths are `x`, `y`, and `z`. -/\ndef Target : Prop :=\n ∀ A B C D : EuclideanThreeSpace,\n NondegenerateTetrahedron A B C D →\n ExistsTriangleWithSideLengths\n (oppositeEdgeProductAB_CD A B C D)\n (oppositeEdgeProductAC_BD A B C D)\n (oppositeEdgeProductAD_BC A B C D)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6660e106-13eb-5dfe-8005-3440f9b3023d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "84df7f86e0286867e01afb40f3259e5a7c0b7fd9c5b3fae4f37b32b3bf4958ae", "task_path": "tasks/nmp3_6660e106-13eb-5dfe-8005-3440f9b3023d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6660e106-13eb-5dfe-8005-3440f9b3023d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6687774f-750c-521a-b896-ee7f534df0b5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sqrt[3]{\\frac{a^2+bc}{\\,b^2+c^2\\,}}+\\sqrt[3]{\\frac{b^2+ca}{\\,c^2+a^2\\,}}+\\sqrt[3]{\\frac{c^2+ab}{\\,a^2+b^2\\,}}\\ge\\frac{9\\sqrt[3]{abc}}{a+b+c}.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formal statement of the three-variable cubic-root inequality\n\nThe original problem asks to prove an inequality for positive real numbers\n`a`, `b`, and `c`. The notation `∛x` is represented by the real cube-root\nfunction `Problem.cubeRoot`, defined as the real power with exponent `1 / 3`.\n-/\n\nnamespace Problem\n\n/-- The real cube root of `x`, represented by the real power `x ^ (1 / 3)`. -/\nnoncomputable def cubeRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 3 : ℝ)\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n cubeRoot ((a ^ 2 + b * c) / (b ^ 2 + c ^ 2)) +\n cubeRoot ((b ^ 2 + c * a) / (c ^ 2 + a ^ 2)) +\n cubeRoot ((c ^ 2 + a * b) / (a ^ 2 + b ^ 2))\n\n/-- The right-hand side of the inequality in the problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 9 * cubeRoot (a * b * c) / (a + b + c)\n\n/-- The statement of the problem: for all positive real numbers `a`, `b`, and\n`c`, the displayed sum of cube roots is at least the displayed right-hand side. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6687774f-750c-521a-b896-ee7f534df0b5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d8b1115094be3857fc2981b5bd0a0de10b76eb5b437d5b68f3a33bc47d51e566", "task_path": "tasks/nmp3_6687774f-750c-521a-b896-ee7f534df0b5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6687774f-750c-521a-b896-ee7f534df0b5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_66929b62-6a58-57db-b318-307e1a5e1cf3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $M,a,b,r$ be non‑negative integers with $a\\ge2$ and $r\\ge2$, and suppose there exists a function $f:\\mathbb Z\\to\\mathbb Z$ satisfying \n-- \n-- 1. $f^{(r)}(n)=a n+b$ for all $n\\in\\mathbb Z$, where $f^{(r)}$ denotes the $r$‑fold composition of $f$; \n-- \n-- 2. $f(n)\\ge0$ for all $n\\ge M$; \n-- \n-- 3. $n-m\\mid f(n)-f(m)$ for all integers $n>m>M$. \n-- \n-- Show that $a$ is a perfect $r$‑th power, i.e. $a=u^{\\,r}$ for some integer $u\\ge1\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the perfect-power conclusion from `problem.md`\n\nThe source problem concerns functions on the integers whose `r`-fold iterate is\nan affine map, which are eventually nonnegative, and which satisfy a\ndivisibility condition on differences on a tail of the integers. The target\nbelow states that the coefficient `a` must then be a perfect `r`-th power.\n\nNo proof of the target is included; the declaration is a proposition-valued\ndefinition.\n-/\n\nnamespace Problem\n\n/-- The iterate equation: the `r`-fold composition of `f` is\n`n ↦ a * n + b` on all of `ℤ`. -/\ndef IterateEquation (f : ℤ → ℤ) (a b r : ℕ) : Prop :=\n ∀ n : ℤ, f^[r] n = (a : ℤ) * n + (b : ℤ)\n\n/-- The eventual nonnegativity condition: `f n ≥ 0` for every integer `n ≥ M`. -/\ndef EventuallyNonnegative (M : ℕ) (f : ℤ → ℤ) : Prop :=\n ∀ n : ℤ, (M : ℤ) ≤ n → 0 ≤ f n\n\n/-- The divisibility condition on a tail: for all integers `n > m > M`,\n`n - m` divides `f n - f m`. -/\ndef TailDifferenceDivisible (M : ℕ) (f : ℤ → ℤ) : Prop :=\n ∀ n m : ℤ, n > m → m > (M : ℤ) → (n - m) ∣ (f n - f m)\n\n/-- The hypotheses that an admissible function `f : ℤ → ℤ` exists for the\nparameters `M,a,b,r`. -/\ndef ExistsAdmissibleFunction (M a b r : ℕ) : Prop :=\n ∃ f : ℤ → ℤ,\n IterateEquation f a b r ∧\n EventuallyNonnegative M f ∧\n TailDifferenceDivisible M f\n\n/-- `a` is a perfect `r`-th power in the sense of the problem: there is an\ninteger `u ≥ 1` with `a = u^r`. -/\ndef IsPerfectRthPower (a r : ℕ) : Prop :=\n ∃ u : ℤ, 1 ≤ u ∧ (a : ℤ) = u ^ r\n\n/-- The complete assertion of the problem: for all nonnegative integers\n`M,a,b,r` with `a ≥ 2` and `r ≥ 2`, if an admissible function exists, then\n`a` is a perfect `r`-th power. -/\ndef Target : Prop :=\n ∀ (M a b r : ℕ),\n 2 ≤ a →\n 2 ≤ r →\n ExistsAdmissibleFunction M a b r →\n IsPerfectRthPower a r\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "66929b62-6a58-57db-b318-307e1a5e1cf3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fa862d8685363efd8aa2585d8a2d9e1cf520063a83094423fa3e9f625610ba56", "task_path": "tasks/nmp3_66929b62-6a58-57db-b318-307e1a5e1cf3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "66929b62-6a58-57db-b318-307e1a5e1cf3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_669c18f5-1fff-51a0-977c-90ea35c33e12", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be non‑negative real numbers such that $a,b,c$ are pairwise distinct and $ab+bc+ca>0$. Prove that \n-- \\[\n-- \\frac{1}{(a-b)^{2}}+\\frac{1}{(b-c)^{2}}+\\frac{1}{(c-a)^{2}}\n-- \\;\\ge\\;\n-- \\frac{\\,4(ab+bc+ca)+\\displaystyle\\frac{32\\,abc}{a+b+c}\\,}{(ab+bc+ca)^{2}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the pairwise-distinct three-variable inequality\n\nThe source problem asks, for non-negative (nonnegative) pairwise distinct real\nnumbers `a`, `b`, and `c` satisfying `ab + bc + ca > 0`, to prove the stated\ninequality. This file records only the mathematical statement; it does not\nprovide a proof.\n-/\n\nnamespace Problem\n\n/-- The three real variables are nonnegative. -/\ndef NonnegativeTriple (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- Three real numbers are pairwise distinct. -/\ndef PairwiseDistinct (a b c : ℝ) : Prop :=\n a ≠ b ∧ b ≠ c ∧ c ≠ a\n\n/-- The symmetric sum `ab + bc + ca` of the pairwise products. -/\ndef PairwiseProductSum (a b c : ℝ) : ℝ :=\n a * b + b * c + c * a\n\n/-- The admissible hypotheses from the source problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n NonnegativeTriple a b c ∧\n PairwiseDistinct a b c ∧\n 0 < PairwiseProductSum a b c\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def leftSide (a b c : ℝ) : ℝ :=\n 1 / (a - b) ^ 2 + 1 / (b - c) ^ 2 + 1 / (c - a) ^ 2\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rightSide (a b c : ℝ) : ℝ :=\n (4 * PairwiseProductSum a b c + (32 * a * b * c) / (a + b + c)) /\n (PairwiseProductSum a b c) ^ 2\n\n/-- The asserted inequality at fixed values of `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n leftSide a b c ≥\n rightSide a b c\n\n/-- The complete universally quantified statement to be proved. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "669c18f5-1fff-51a0-977c-90ea35c33e12", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "af86c663b5dea0ed04390e47f6ec225af0db0203f1de849821ac4451cf408c70", "task_path": "tasks/nmp3_669c18f5-1fff-51a0-977c-90ea35c33e12", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "669c18f5-1fff-51a0-977c-90ea35c33e12", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_66aff446-fde0-5b43-bd00-32dbe809040b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $A_1,\\dots ,A_{2n}$ are $2n$ non‑empty subsets of $\\{0,1,2,\\dots ,2n-1\\}$ such that \n-- \\[\n-- |A_1|+|A_2|+\\cdots+|A_{2n}|=\\binom{2n+1}{2}=n(2n+1).\n-- \\] \n-- Prove that one can select an element $a_i\\in A_i$ from each subset so that \n-- \\[\n-- a_1+a_2+\\cdots +a_{2n}=\\binom{2n}{2}=n(2n-1)\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a selection theorem for a family of non-empty subsets\n\nThe original problem asks to prove, for every natural number `n`, that from a\nfamily of `2 * n` non-empty subsets of `{0, 1, ..., 2 * n - 1}` whose total\ncardinality is `n * (2 * n + 1)`, one can choose one element from each subset\nso that the chosen elements sum to `n * (2 * n - 1)`.\n\nWe use `Fin (2 * n)` as the type representing `{0, 1, ..., 2 * n - 1}`.\n-/\n\nnamespace Problem\n\n/-- The data in the hypothesis of the problem: a family `A` indexed by\n`Fin (2 * n)`, consisting of non-empty finite subsets of `Fin (2 * n)`, whose\ncardinalities sum to `n * (2 * n + 1)` (the explicit product form of\n`Nat.choose (2 * n + 1) 2`). -/\ndef Admissible (n : ℕ) (A : Fin (2 * n) → Finset (Fin (2 * n))) : Prop :=\n (∀ i : Fin (2 * n), (A i).Nonempty) ∧\n (∑ i : Fin (2 * n), (A i).card) = n * (2 * n + 1)\n\n/-- A selection of one element `a i` from each `A i` whose values sum to\n`n * (2 * n - 1)` (the explicit product form of `Nat.choose (2 * n) 2`). -/\ndef IsDesiredSelection (n : ℕ) (A : Fin (2 * n) → Finset (Fin (2 * n)))\n (a : Fin (2 * n) → Fin (2 * n)) : Prop :=\n (∀ i : Fin (2 * n), a i ∈ A i) ∧\n (∑ i : Fin (2 * n), (a i).val) = n * (2 * n - 1)\n\n/-- The assertion of the problem for a fixed natural number `n`. When `n = 0`,\nthis is the vacuous empty-family case. -/\ndef TargetFor (n : ℕ) : Prop :=\n ∀ A : Fin (2 * n) → Finset (Fin (2 * n)),\n Admissible n A → ∃ a : Fin (2 * n) → Fin (2 * n), IsDesiredSelection n A a\n\n/-- The full universally quantified assertion of the problem. -/\ndef Target : Prop :=\n ∀ n : ℕ, TargetFor n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "66aff446-fde0-5b43-bd00-32dbe809040b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cc80672aa5c6f495a4b8e0bf7908b43c6760d328fd35444590f73e12b4a854db", "task_path": "tasks/nmp3_66aff446-fde0-5b43-bd00-32dbe809040b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "66aff446-fde0-5b43-bd00-32dbe809040b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_66b811f7-f037-587f-8a84-10da7f63a43d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{a^3+bc^2}{(c+a)^2}+\\frac{b^3+ca^2}{(a+b)^2}+\\frac{c^3+ab^2}{(b+c)^2}\\ge\\frac{9}{2\\,(a^3+b^3+c^3)}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real parameters: they are\nstrictly positive and their product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n (a ^ 3 + b * c ^ 2) / (c + a) ^ 2 +\n (b ^ 3 + c * a ^ 2) / (a + b) ^ 2 +\n (c ^ 3 + a * b ^ 2) / (b + c) ^ 2\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n 9 / (2 * (a ^ 3 + b ^ 3 + c ^ 3))\n\n/-- The asserted inequality as a predicate on the three real parameters. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n leftHandSide a b c ≥ rightHandSide a b c\n\n/-- The complete target: for every positive real triple with product one,\nthe displayed inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "66b811f7-f037-587f-8a84-10da7f63a43d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f52bd21aae5c0600174d8f61f9d449e3fc94b5e06c96d8f5cbf49b7a27a3eccf", "task_path": "tasks/nmp3_66b811f7-f037-587f-8a84-10da7f63a43d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "66b811f7-f037-587f-8a84-10da7f63a43d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_66b886be-da73-5f98-9c9b-e8e4857a0029", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every real $a>1$ the infinite series \n-- \\[\n-- \\sum_{n=1}^{\\infty}\\frac{1}{n^{a}\\,|\\sin(\\pi\\sqrt{2}\\,n)|}\n-- \\]\n-- converges.\nimport Mathlib\n\n/-!\n# Formalization of the convergence of a trigonometric series\n\nThe problem asks to prove that for every real `a > 1`, the series\n`∑_{n=1}^∞ 1 / (n^a * |sin(π * sqrt 2 * n)|)` converges.\n\nWe encode the series as a summable real sequence indexed from zero,\nwith the term at index `n` using the original summation index `n + 1`.\n-/\n\nnamespace Problem\n\n/-- The `n`-th term of the original series, with `n : ℕ` indexing the\npartial sum starting at the original index `n + 1`.\n\nThus `term a 0` is the term with original index `1`, `term a 1` is the\nterm with original index `2`, and so on. -/\nnoncomputable def term (a : ℝ) (n : ℕ) : ℝ :=\n 1 / (Real.rpow (((n + 1 : ℕ) : ℝ)) a *\n |Real.sin (Real.pi * Real.sqrt (2 : ℝ) * ((n + 1 : ℕ) : ℝ))|)\n\n/-- The formalized proposition: for every real exponent `a > 1`, the series\n`∑_{n=1}^∞ 1 / (n^a * |sin(π * sqrt 2 * n)|)` converges. -/\ndef Target : Prop :=\n ∀ a : ℝ, 1 < a → Summable (fun n : ℕ => term a n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "66b886be-da73-5f98-9c9b-e8e4857a0029", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "15449ecf0bdb0f137d45692f8737b1306d099118ce51bd111db9d1d83c1fb69d", "task_path": "tasks/nmp3_66b886be-da73-5f98-9c9b-e8e4857a0029", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "66b886be-da73-5f98-9c9b-e8e4857a0029", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6705534e-84c2-50db-88ca-e1449932fe73", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers \\(a,b,c,x,y,z\\),\n-- \n-- \\[\n-- ax+by+cz+3\\sqrt{(a^{2}+b^{2}+c^{2})(x^{2}+y^{2}+z^{2})}\\;\\ge\\;4\\sqrt{(ab+bc+ca)(xy+yz+zx)}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The inequality stated in the problem, for all positive real numbers\n`a`, `b`, `c`, `x`, `y`, and `z`. -/\ndef Target : Prop :=\n ∀ a b c x y z : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 0 < x →\n 0 < y →\n 0 < z →\n 4 * Real.sqrt ((a * b + b * c + c * a) * (x * y + y * z + z * x)) ≤\n a * x + b * y + c * z +\n 3 * Real.sqrt ((a ^ 2 + b ^ 2 + c ^ 2) * (x ^ 2 + y ^ 2 + z ^ 2))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6705534e-84c2-50db-88ca-e1449932fe73", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ccd96091954a8ded1f33adb07c7586f034f5e16f93a94ad377dcf55a4dcb0bcd", "task_path": "tasks/nmp3_6705534e-84c2-50db-88ca-e1449932fe73", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6705534e-84c2-50db-88ca-e1449932fe73", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6706f21d-6131-549e-9618-a33cdbbfc2d8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A$ be a set of $2001$ positive integers. Prove that there exists a subset $B\\subseteq A$ such that \n-- \n-- 1. $|B|\\ge 668$; \n-- 2. for any $a,b\\in B$ (the elements need not be distinct), $a+b\\notin B$.\nimport Mathlib\n\nnamespace Problem\n\n/-- A finite set of natural numbers is weakly sum-free when no sum of two\n(not necessarily distinct) members of the set is again a member of the set. -/\ndef WeaklySumFree (B : Finset Nat) : Prop :=\n ∀ (a : Nat), a ∈ B → ∀ (b : Nat), b ∈ B → a + b ∉ B\n\n/--\nThe assertion from the problem: every finite set of 2001 positive integers\ncontains a weakly sum-free subset with at least 668 elements.\n-/\ndef Target : Prop :=\n ∀ (A : Finset Nat),\n A.card = 2001 →\n (∀ (a : Nat), a ∈ A → 0 < a) →\n ∃ B : Finset Nat,\n B ⊆ A ∧\n 668 ≤ B.card ∧\n WeaklySumFree B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6706f21d-6131-549e-9618-a33cdbbfc2d8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0872c136fe003f07c215251bd35d4cbcb98a9b8ea0b551a8f4c9be0c2d8502ea", "task_path": "tasks/nmp3_6706f21d-6131-549e-9618-a33cdbbfc2d8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6706f21d-6131-549e-9618-a33cdbbfc2d8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_67369a82-9406-5468-bc1a-d5cff66b4001", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $ab+bc+ca=1$. Prove that \n-- \\[\n-- 8a^2b^2c^2\\ge (1-a^2)(1-b^2)(1-c^2).\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The statement of the problem.\n\nFor all positive real numbers `a`, `b`, and `c` satisfying\n`ab + bc + ca = 1`, the inequality holds.\n\nThis is a proposition-valued declaration: it records the assertion to be\nproved, without supplying a proof. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b + b * c + c * a = 1 →\n 8 * a ^ 2 * b ^ 2 * c ^ 2 ≥\n (1 - a ^ 2) * (1 - b ^ 2) * (1 - c ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "67369a82-9406-5468-bc1a-d5cff66b4001", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d854819bfcf08a136f4482f3ece1aae0766433f99ee6ce6c93991edafd036623", "task_path": "tasks/nmp3_67369a82-9406-5468-bc1a-d5cff66b4001", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "67369a82-9406-5468-bc1a-d5cff66b4001", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6740165a-98d8-53cb-b1f6-cc2a49963ecb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with \\((a+b)(b+c)(c+a)=8\\). Prove that \\(\\sqrt{a}+\\sqrt{b}+\\sqrt{c} \\ge ab+bc+ca\\).\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement of a positive-real inequality\n\nThe source problem asks us to prove, for positive real numbers `a`, `b`, and `c`\nwhose pairwise-sum product is `8`, the inequality\n`sqrt a + sqrt b + sqrt c ≥ a*b + b*c + c*a`.\n\nThis file records the problem statement as propositions. In particular,\n`Problem.Target` is a proposition, not a proof of the source assertion.\n-/\n\nnamespace Problem\n\n/-- The assertion that all three variables are strictly positive. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The equation `(a + b) * (b + c) * (c + a) = 8` from the hypothesis. -/\ndef PairwiseSumProductEqEight (a b c : ℝ) : Prop :=\n (a + b) * (b + c) * (c + a) = 8\n\n/-- The admissibility conditions in the problem: `a`, `b`, and `c` are positive\nand `(a + b) * (b + c) * (c + a) = 8`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositiveTriple a b c ∧ PairwiseSumProductEqEight a b c\n\n/-- The desired conclusion of the inequality for fixed `a`, `b`, and `c`. -/\nnoncomputable def Conclusion (a b c : ℝ) : Prop :=\n Real.sqrt a + Real.sqrt b + Real.sqrt c ≥ a * b + b * c + c * a\n\n/-- The complete universally quantified assertion stated in the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6740165a-98d8-53cb-b1f6-cc2a49963ecb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "08bfdff5afad6191751943c8910aafb3741274a91d2e413fe525cd6909a4f38e", "task_path": "tasks/nmp3_6740165a-98d8-53cb-b1f6-cc2a49963ecb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6740165a-98d8-53cb-b1f6-cc2a49963ecb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6748a423-4cf5-5321-89b3-251754239236", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that the sequence of prime numbers $(p_n)_{n\\ge1}$ does not satisfy any linear recurrence relation with rational coefficients. In other words, for every integer $k\\ge1$ and for any rational numbers $\\alpha_0,\\alpha_1,\\dots,\\alpha_{k-1}$, there exists an $n\\in\\mathbb{N}$ such that \n-- $$p_{n+k}\\neq\\sum_{i=0}^{k-1}\\alpha_i\\,p_{n+i}\\,. $$\n/-\nFormalization of the statement that the sequence of prime numbers is not\nlinearly recurrent over the rationals.\n\nSource: nmp3_6748a423-4cf5-5321-89b3-251754239236_r1\n-/\n\nimport Mathlib.Data.Nat.Prime.Nth\nimport Mathlib.Data.Rat.BigOperators\n\nnamespace Problem\n\n/--\nThe sequence of primes with one-based indexing: `primeSeq n` is the `n`-th\nprime number, so in particular `primeSeq 1 = 2` and `primeSeq 2 = 3`.\n-/\nnoncomputable def primeSeq (n : ℕ) : ℕ :=\n Nat.nth Nat.Prime (n - 1)\n\n/--\nThe assertion that the linear recurrence with coefficients `a` of order `k`\nfails at the (one-based) sequence index `n`.\n\nThe sums and coefficients are interpreted in `ℚ`, so the natural-number\nvalues of the prime sequence are cast to rational numbers.\n-/\ndef RecurrenceFailsAt (k : ℕ) (a : Fin k → ℚ) (n : ℕ) : Prop :=\n (primeSeq (n + k) : ℚ) ≠\n ∑ i : Fin k, a i * (primeSeq (n + (i : ℕ)) : ℚ)\n\n/--\nThe prime sequence satisfies no linear recurrence relation with rational\ncoefficients: for every positive order `k` and every rational coefficient\ntuple `a_0, …, a_{k-1}`, there is a positive index `n` at which the recurrence\nfails.\n-/\ndef Target : Prop :=\n ∀ k : ℕ, 1 ≤ k → ∀ a : Fin k → ℚ,\n ∃ n : ℕ, 1 ≤ n ∧ RecurrenceFailsAt k a n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6748a423-4cf5-5321-89b3-251754239236", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "27839b1e39149c293b182dc905740d15ad4d4e9fef051d85415ef58f6ba445f3", "task_path": "tasks/nmp3_6748a423-4cf5-5321-89b3-251754239236", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6748a423-4cf5-5321-89b3-251754239236", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_675503d5-8314-5b07-87b9-2064cecabb17", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{(z+x)(x+y)}{(y+z)\\bigl(3x^{2}+4yz\\bigr)}\\ge\\frac{18}{7\\,(x+y+z)}.\n-- \\]\n-- Here the cyclic sum runs over the three permutations $(x,y,z)$, $(y,z,x)$, $(z,x,y)$.\nimport Mathlib\n\n/-!\n# Cyclic rational inequality\n\nThis file formalizes the statement of the following problem.\n\nLet x, y, z > 0. Prove that\n Σ_cyc ((z+x)(x+y)) / ((y+z)(3x²+4yz)) ≥ 18 / (7(x+y+z)),\nwhere the cyclic sum runs over the permutations (x,y,z), (y,z,x), (z,x,y).\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- One summand of the displayed cyclic sum, with the displayed variables\n`a`, `b`, `c` playing the roles of `x`, `y`, `z`. -/\ndef cyclicTerm (a b c : ℝ) : ℝ :=\n ((c + a) * (a + b)) / ((b + c) * (3 * a ^ 2 + 4 * b * c))\n\n/-- The cyclic sum over the three permutations `(x,y,z)`, `(y,z,x)`, and\n`(z,x,y)`, written out in that order. -/\ndef cyclicSum (x y z : ℝ) : ℝ :=\n cyclicTerm x y z + cyclicTerm y z x + cyclicTerm z x y\n\n/-- The assertion to be proved: for all positive real `x`, `y`, and `z`, the\ncyclic sum is at least `18 / (7 * (x + y + z))`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z →\n cyclicSum x y z ≥ 18 / (7 * (x + y + z))\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "675503d5-8314-5b07-87b9-2064cecabb17", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a55f891b6e47432cdea6cc83d6f78a43587197f05268cae6dd14b6c6c9830db1", "task_path": "tasks/nmp3_675503d5-8314-5b07-87b9-2064cecabb17", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "675503d5-8314-5b07-87b9-2064cecabb17", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_676c58d8-962e-5d43-a886-74c327d4ec7c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are positive real numbers, prove that \n-- \\[\n-- 3+a+b+c+\\frac1a+\\frac1b+\\frac1c+\\Bigl(\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\Bigr)\\ge\\frac{3\\,(a+1)(b+1)(c+1)}{1+abc}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the positive-real inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and\n`c`, an inequality between a sum of reciprocal and cyclic-ratio terms and a\nrational expression involving `(a + 1)(b + 1)(c + 1)` and `1 + abc`.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the required inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n 3 + a + b + c + 1 / a + 1 / b + 1 / c + (a / b + b / c + c / a)\n\n/-- The right-hand side of the required inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 3 * (a + 1) * (b + 1) * (c + 1) / (1 + a * b * c)\n\n/-- The admissibility condition on the three variables: they are all positive reals. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The inequality asserted by the problem, for fixed real values of `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n rhs a b c ≤ lhs a b c\n\n/-- The complete proposition asserted by the problem: for every triple of positive real\nnumbers `a`, `b`, and `c`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "676c58d8-962e-5d43-a886-74c327d4ec7c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cdc7a3b36adcaf3619b811fbc73f542b79db2b70a3f8b1763c84ab0b453fe9c3", "task_path": "tasks/nmp3_676c58d8-962e-5d43-a886-74c327d4ec7c", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "676c58d8-962e-5d43-a886-74c327d4ec7c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_67887f2b-0c17-5669-8c91-02e5d03f2440", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $ab+bc+ca=3$. Prove that \n-- \\[\n-- (2+3a^3)(2+3b^3)(2+3c^3)\\ge 125.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of a three-variable real inequality\n\nThe source problem asks to prove that for positive real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca = 3`, the product\n`(2 + 3a^3)(2 + 3b^3)(2 + 3c^3)` is at least `125`.\n-/\n\nnamespace Problem\n\n/-- The admissibility predicate for the three real variables in the source problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = 3\n\n/-- The inequality asserted in the source problem, with the left-hand side written\nexactly as the product of the three factors. -/\ndef Inequality (a b c : ℝ) : Prop :=\n 125 ≤ (2 + 3 * a ^ 3) * (2 + 3 * b ^ 3) * (2 + 3 * c ^ 3)\n\n/-- The complete assertion to prove: for every triple of positive real numbers whose\npairwise products sum to `3`, the displayed product is at least `125`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "67887f2b-0c17-5669-8c91-02e5d03f2440", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1ad2d499f9a7972ed23c75be9498ce0baace1c42169ecd2f33c9822dbad2d77f", "task_path": "tasks/nmp3_67887f2b-0c17-5669-8c91-02e5d03f2440", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "67887f2b-0c17-5669-8c91-02e5d03f2440", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_678a8caf-e5d2-550d-b329-6a5a49c8b5d5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\Bigl(\\sum_{cyc}\\frac{a}{b+c}\\Bigr)^{2}\\le\n-- \\Bigl(\\sum_{cyc}\\frac{a^{2}}{b^{2}+bc}\\Bigr)\\Bigl(\\sum_{cyc}\\frac{a}{a+c}\\Bigr),\n-- \\] \n-- where \n-- \n-- \\[\n-- \\sum_{cyc}\\frac{a}{b+c}= \\frac{a}{b+c}+\\frac{b}{c+a}+\\frac{c}{a+b},\n-- \\qquad\n-- \\sum_{cyc}\\frac{a^{2}}{b^{2}+bc}= \\frac{a^{2}}{b^{2}+bc}+\\frac{b^{2}}{c^{2}+ca}+\\frac{c^{2}}{a^{2}+ab},\n-- \\] \n-- \n-- \\[\n-- \\sum_{cyc}\\frac{a}{a+c}= \\frac{a}{a+c}+\\frac{b}{b+a}+\\frac{c}{c+b}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic inequality problem\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe inequality\n`(Σ_cyc a / (b + c))^2 ≤ (Σ_cyc a^2 / (b^2 + b*c)) * (Σ_cyc a / (a + c))`.\n\nThe three cyclic sums are expanded explicitly, exactly as they are in the source.\nNo proof of the inequality is supplied here; `Problem.Target` is the proposition to\nbe proved.\n-/\n\nnamespace Problem\n\n/-- The first cyclic sum:\n`∑cyc a / (b + c) = a / (b + c) + b / (c + a) + c / (a + b)`. -/\nnoncomputable def cyclicSumOne (a b c : ℝ) : ℝ :=\n a / (b + c) + b / (c + a) + c / (a + b)\n\n/-- The second cyclic sum:\n`∑cyc a^2 / (b^2 + b*c) = a^2 / (b^2 + b*c) + b^2 / (c^2 + c*a) + c^2 / (a^2 + a*b)`. -/\nnoncomputable def cyclicSumTwo (a b c : ℝ) : ℝ :=\n a ^ 2 / (b ^ 2 + b * c) +\n b ^ 2 / (c ^ 2 + c * a) +\n c ^ 2 / (a ^ 2 + a * b)\n\n/-- The third cyclic sum:\n`∑cyc a / (a + c) = a / (a + c) + b / (b + a) + c / (c + b)`. -/\nnoncomputable def cyclicSumThree (a b c : ℝ) : ℝ :=\n a / (a + c) + b / (b + a) + c / (c + b)\n\n/-- The assertion to be proved: for all positive real `a`, `b`, and `c`, the square of\nthe first cyclic sum is at most the product of the second and third cyclic sums. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n (cyclicSumOne a b c) ^ 2 ≤\n cyclicSumTwo a b c * cyclicSumThree a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "678a8caf-e5d2-550d-b329-6a5a49c8b5d5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9e757eb511424e6af67cbd2109618e852fcc35defb04e1113510c6c2877911e6", "task_path": "tasks/nmp3_678a8caf-e5d2-550d-b329-6a5a49c8b5d5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "678a8caf-e5d2-550d-b329-6a5a49c8b5d5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_678f13bd-c5a5-51eb-adc6-af7a442dbdbc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>1$, and let $A_1,A_2,\\dots,A_{n+1}$ be non‑empty subsets of $X=\\{1,2,\\dots,n\\}$. Prove that there exist non‑empty disjoint subsets $I$ and $J$ of $\\{1,2,\\dots,n+1\\}$ such that \n-- \\[\n-- \\bigcup_{i\\in I}A_i \\;=\\; \\bigcup_{j\\in J}A_j\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks for a proof of the following assertion. The set\n`Fin n` represents `{1, ..., n}`, and `Fin (n + 1)` represents the index set\n`{1, ..., n + 1}`.\n-/\n\nnamespace Problem\n\n/-- The union of the sets indexed by a subset `I` of `{1, ..., n + 1}`. -/\ndef IndexUnion {n : ℕ} (A : Fin (n + 1) → Set (Fin n))\n (I : Set (Fin (n + 1))) : Set (Fin n) :=\n ⋃ i ∈ I, A i\n\n/-- Two subsets of the index set have equal unions under the family `A`. -/\ndef EqualUnionPair {n : ℕ} (A : Fin (n + 1) → Set (Fin n))\n (I J : Set (Fin (n + 1))) : Prop :=\n IndexUnion A I = IndexUnion A J\n\n/--\nFor every integer `n > 1` and every family of nonempty subsets\n`A_1, ..., A_{n+1}` of `{1, ..., n}`, there exist nonempty disjoint\nsubsets `I` and `J` of `{1, ..., n + 1}` whose unions are equal.\n-/\ndef Target : Prop :=\n ∀ (n : ℕ), 1 < n →\n ∀ A : Fin (n + 1) → Set (Fin n),\n (∀ i : Fin (n + 1), (A i).Nonempty) →\n ∃ I J : Set (Fin (n + 1)),\n I.Nonempty ∧ J.Nonempty ∧ Disjoint I J ∧ EqualUnionPair A I J\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "678f13bd-c5a5-51eb-adc6-af7a442dbdbc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ce069c9106c82ab588562f7df025bcadd2dd91746c877c1f953c41ce7bbdd41e", "task_path": "tasks/nmp3_678f13bd-c5a5-51eb-adc6-af7a442dbdbc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "678f13bd-c5a5-51eb-adc6-af7a442dbdbc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_67bf1718-4928-5707-9948-aa058f8ce301", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive integers such that $\\gcd(a,b)=1$ and either $\\gcd(c,a)=1$ or $\\gcd(c,b)=1$. Prove that there exist infinitely many triples $(x,y,z)$ of distinct positive integers satisfying \n-- \\[x^{a}+y^{b}=z^{c}.\\]\nimport Mathlib\n\n/-!\n# Formalization of the problem statement\n\nThe original problem asks, for positive natural numbers `a`, `b`, and `c` with\n`gcd a b = 1` and with `gcd c a = 1` or `gcd c b = 1`, for infinitely many\nordered triples `(x, y, z)` of pairwise distinct positive natural numbers\nsatisfying `x ^ a + y ^ b = z ^ c`.\n\nThis file states that assertion as a proposition. It intentionally contains\nno proof of the assertion.\n-/\n\nnamespace Problem\n\n/-- An ordered triple `(x, y, z)` is a solution for the exponents `(a, b, c)` if\nall three entries are positive, pairwise distinct natural numbers and satisfy\n`x ^ a + y ^ b = z ^ c`. -/\ndef IsSolution (a b c x y z : ℕ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧\n x ≠ y ∧ x ≠ z ∧ y ≠ z ∧\n x ^ a + y ^ b = z ^ c\n\n/-- The set of all ordered triples of positive, pairwise distinct natural\nnumbers solving `x ^ a + y ^ b = z ^ c` for fixed exponents `a`, `b`, and `c`. -/\ndef SolutionSet (a b c : ℕ) : Set (ℕ × ℕ × ℕ) :=\n {p | IsSolution a b c p.1 p.2.1 p.2.2}\n\n/-- The target assertion: for every three positive natural numbers `a`, `b`,\nand `c`, if `gcd a b = 1` and either `gcd c a = 1` or `gcd c b = 1`, then\nthere are infinitely many ordered triples `(x, y, z)` of pairwise distinct\npositive natural numbers satisfying `x ^ a + y ^ b = z ^ c`. -/\ndef Target : Prop :=\n ∀ a b c : ℕ,\n 0 < a → 0 < b → 0 < c →\n Nat.gcd a b = 1 →\n (Nat.gcd c a = 1 ∨ Nat.gcd c b = 1) →\n (SolutionSet a b c).Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "67bf1718-4928-5707-9948-aa058f8ce301", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4b5b0d86e69175434e2b807573bf3253f901e13928f1bceeda70234c74658230", "task_path": "tasks/nmp3_67bf1718-4928-5707-9948-aa058f8ce301", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "67bf1718-4928-5707-9948-aa058f8ce301", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_67e97b64-b6bf-5d78-82ce-7405cb2517fa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ (with $b^2+c^2$, $c^2+a^2$, $a^2+b^2$ non‑zero). Prove that \n-- \n-- \\[\n-- \\frac{2a^{2}+bc}{\\,b^{2}+c^{2}\\,}+\\frac{2b^{2}+ca}{\\,c^{2}+a^{2}\\,}+\\frac{2c^{2}+ab}{\\,a^{2}+b^{2}\\,}\\ge\\frac{9}{2}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (2 * a ^ 2 + b * c) / (b ^ 2 + c ^ 2) +\n (2 * b ^ 2 + c * a) / (c ^ 2 + a ^ 2) +\n (2 * c ^ 2 + a * b) / (a ^ 2 + b ^ 2)\n\n/-- The assertion stated in the problem: for all nonnegative real numbers\n`a`, `b`, and `c` for which the three displayed denominators are nonzero,\nthe left-hand side is at least `9 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n b ^ 2 + c ^ 2 ≠ 0 →\n c ^ 2 + a ^ 2 ≠ 0 →\n a ^ 2 + b ^ 2 ≠ 0 →\n lhs a b c ≥ (9 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "67e97b64-b6bf-5d78-82ce-7405cb2517fa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5ad8bb39b24c791f4af470b1c2ca33ce2478bdacab116e17bfe585f7d30f546c", "task_path": "tasks/nmp3_67e97b64-b6bf-5d78-82ce-7405cb2517fa", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "67e97b64-b6bf-5d78-82ce-7405cb2517fa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6806c3cd-e207-5eea-83da-593f78a10d24", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ and $ab+bc+ca>0$. Prove that \n-- \\[\n-- \\sum_{cyc}\\frac{a(b+c)}{b^{2}+bc+c^{2}}\n-- \\;\\ge\\;\n-- \\sum_{cyc}\\frac{a}{\\,b+c\\,}+\\frac{4abc}{(a+b)(b+c)(c+a)}\n-- \\;\\ge\\;\n-- \\frac{ab^{2}+bc^{2}+ca^{2}}{a^{2}b+b^{2}c+c^{2}a}\n-- +\\frac{a^{2}b+b^{2}c+c^{2}a}{ab^{2}+bc^{2}+ca^{2}}\n-- \\;\\ge\\;2,\n-- \\] \n-- where $\\displaystyle\\sum_{cyc}$ denotes the cyclic sum over $a,b,c$.\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic inequality problem\n\nThe source assumes nonnegative real numbers `a`, `b`, and `c` satisfying\n`ab + bc + ca > 0`, and asserts the four-term chain\n`L ≥ M ≥ R ≥ 2`, where each displayed cyclic sum has three terms in the\norder `(a,b,c)`, `(b,c,a)`, `(c,a,b)`.\n\nThis file only states the problem. It contains no proof of `Target`.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The cyclic sum of a ternary real-valued expression, expanded in the\nstandard order `(a,b,c)`, `(b,c,a)`, `(c,a,b)`. -/\ndef cyclicSum (f : ℝ → ℝ → ℝ → ℝ) (a b c : ℝ) : ℝ :=\n f a b c + f b c a + f c a b\n\n/-- The summand `a (b + c) / (b^2 + b c + c^2)` of the first cyclic sum. -/\ndef firstSummand (a b c : ℝ) : ℝ :=\n a * (b + c) / (b ^ 2 + b * c + c ^ 2)\n\n/-- The first displayed cyclic sum. -/\ndef firstCyclicSum (a b c : ℝ) : ℝ :=\n cyclicSum firstSummand a b c\n\n/-- The left-hand expression, which is the first displayed cyclic sum. -/\ndef leftHandSide (a b c : ℝ) : ℝ :=\n firstCyclicSum a b c\n\n/-- The summand `a / (b + c)` of the second cyclic sum. -/\ndef secondSummand (a b c : ℝ) : ℝ :=\n a / (b + c)\n\n/-- The second displayed cyclic sum. -/\ndef secondCyclicSum (a b c : ℝ) : ℝ :=\n cyclicSum secondSummand a b c\n\n/-- The product term `4abc / ((a+b)(b+c)(c+a))`, which is not cyclic. -/\ndef productTerm (a b c : ℝ) : ℝ :=\n 4 * a * b * c / ((a + b) * (b + c) * (c + a))\n\n/-- The middle expression: the second cyclic sum plus the product term. -/\ndef middleExpression (a b c : ℝ) : ℝ :=\n secondCyclicSum a b c + productTerm a b c\n\n/-- The expression `a b^2 + b c^2 + c a^2`, used as the numerator of the\nfirst ratio and the denominator of its reciprocal. -/\ndef firstRatioNumerator (a b c : ℝ) : ℝ :=\n a * b ^ 2 + b * c ^ 2 + c * a ^ 2\n\n/-- The expression `a^2 b + b^2 c + c^2 a`, used as the denominator of the\nfirst ratio and the numerator of its reciprocal. -/\ndef firstRatioDenominator (a b c : ℝ) : ℝ :=\n a ^ 2 * b + b ^ 2 * c + c ^ 2 * a\n\n/-- The first ratio `(a b^2 + b c^2 + c a^2) / (a^2 b + b^2 c + c^2 a)`. -/\ndef firstRatio (a b c : ℝ) : ℝ :=\n firstRatioNumerator a b c / firstRatioDenominator a b c\n\n/-- The reciprocal of `firstRatio`, the second ratio on the right-hand side. -/\ndef secondRatio (a b c : ℝ) : ℝ :=\n firstRatioDenominator a b c / firstRatioNumerator a b c\n\n/-- The right-hand expression, i.e. the sum of the two reciprocal ratios. -/\ndef rightHandSide (a b c : ℝ) : ℝ :=\n firstRatio a b c + secondRatio a b c\n\n/-- The admissibility condition on the variables in the source problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a * b + b * c + c * a\n\n/-- The first adjacent inequality in the displayed chain. -/\ndef FirstInequality (a b c : ℝ) : Prop :=\n leftHandSide a b c ≥ middleExpression a b c\n\n/-- The second adjacent inequality in the displayed chain. -/\ndef SecondInequality (a b c : ℝ) : Prop :=\n middleExpression a b c ≥ rightHandSide a b c\n\n/-- The third adjacent inequality in the displayed chain. -/\ndef ThirdInequality (a b c : ℝ) : Prop :=\n rightHandSide a b c ≥ (2 : ℝ)\n\n/-- The full displayed chain, represented as the conjunction of its three\nadjacent inequalities. -/\ndef Chain (a b c : ℝ) : Prop :=\n FirstInequality a b c ∧ SecondInequality a b c ∧ ThirdInequality a b c\n\n/-- The complete statement of the problem: for every admissible nonnegative\nreal triple, all three inequalities in the displayed chain hold. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Chain a b c\n\nend\n\nend Problem\n\n#check Problem.cyclicSum\n#check Problem.firstCyclicSum\n#check Problem.leftHandSide\n#check Problem.secondCyclicSum\n#check Problem.productTerm\n#check Problem.middleExpression\n#check Problem.firstRatio\n#check Problem.secondRatio\n#check Problem.rightHandSide\n#check Problem.Admissible\n#check Problem.FirstInequality\n#check Problem.SecondInequality\n#check Problem.ThirdInequality\n#check Problem.Chain\n#check Problem.Target\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6806c3cd-e207-5eea-83da-593f78a10d24", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b7d0729d278e57f1e871719547f061af70d2094682df205096d5cc4bc4ea272e", "task_path": "tasks/nmp3_6806c3cd-e207-5eea-83da-593f78a10d24", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6806c3cd-e207-5eea-83da-593f78a10d24", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_682c6bba-bd01-5384-9609-03b799904a79", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- \\[\n-- \\sqrt{\\frac{x}{x+y}}+\\sqrt{\\frac{y}{y+z}}+\\sqrt{\\frac{z}{z+x}}\\le\\frac{3}{\\sqrt2}\\,.\n-- \\] \n-- (The cyclic sum $\\sum_{cyc}\\sqrt{\\frac{z}{x+z}}$ is equivalent to the left‑hand side.)\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\n/-!\n# Formal statement for a cyclic square-root inequality\n\nFor positive real numbers `x`, `y`, and `z`, the problem asks for the\ninequality\n`sqrt (x / (x + y)) + sqrt (y / (y + z)) + sqrt (z / (z + x)) ≤ 3 / sqrt 2`.\n\nThe declarations below record the left-hand side and the bound. The target is\na proposition, not a proof. The final definition records the parenthetical\nidentification of the displayed cyclic sum with the displayed left-hand side.\n-/\n\nnamespace Problem\n\n/-- The explicit left-hand side displayed in the problem. -/\nnoncomputable def originalLeftHandSide (x y z : ℝ) : ℝ :=\n Real.sqrt (x / (x + y)) +\n Real.sqrt (y / (y + z)) +\n Real.sqrt (z / (z + x))\n\n/-- The cyclic sum `∑_cyc sqrt (z / (x + z))`, expanded over `x`, `y`, `z`. -/\nnoncomputable def cyclicLeftHandSide (x y z : ℝ) : ℝ :=\n Real.sqrt (z / (x + z)) +\n Real.sqrt (x / (y + x)) +\n Real.sqrt (y / (z + y))\n\n/-- The asserted inequality for all positive real `x`, `y`, and `z`. -/\nnoncomputable def Target : Prop :=\n ∀ (x y z : ℝ),\n 0 < x →\n 0 < y →\n 0 < z →\n originalLeftHandSide x y z ≤ (3 : ℝ) / Real.sqrt (2 : ℝ)\n\n/-- The parenthetical claim that the cyclic sum is equivalent to the displayed\nleft-hand side, under the same positivity hypotheses. -/\nnoncomputable def CyclicSumEquivalent : Prop :=\n ∀ (x y z : ℝ),\n 0 < x →\n 0 < y →\n 0 < z →\n cyclicLeftHandSide x y z = originalLeftHandSide x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "682c6bba-bd01-5384-9609-03b799904a79", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5e30f51621a9262f452cb09cf8d64c504f48a4c834af3dda4a51aa55fbfc546d", "task_path": "tasks/nmp3_682c6bba-bd01-5384-9609-03b799904a79", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "682c6bba-bd01-5384-9609-03b799904a79", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_683dbcce-7b3f-5a01-a2e6-d3972ba104a5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\mathbb Q_{>0}$ be the set of all positive rational numbers. Let $f:\\mathbb Q_{>0}\\to\\mathbb R$ satisfy \n-- \n-- (i) $f(x)f(y)\\ge f(xy)$ for all $x,y\\in\\mathbb Q_{>0}$, \n-- \n-- (ii) $f(x+y)\\ge f(x)+f(y)$ for all $x,y\\in\\mathbb Q_{>0}$, \n-- \n-- (iii) there exists a rational $a>1$ with $f(a)=a$. \n-- \n-- Prove that $f(x)=x$ for every $x\\in\\mathbb Q_{>0}\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the positive-rational functional-inequality problem\n\nThe problem concerns a function on the positive rationals.\n-/\n\nnamespace Problem\n\n/-- The domain `ℚ_{>0}` of positive rational numbers, represented as a subtype. -/\nabbrev PositiveRat : Type := {x : ℚ // 0 < x}\n\n/-- Multiplication in the positive rationals. -/\ndef positiveRatMul (x y : PositiveRat) : PositiveRat :=\n ⟨(x : ℚ) * (y : ℚ), mul_pos x.2 y.2⟩\n\n/-- Addition in the positive rationals. -/\ndef positiveRatAdd (x y : PositiveRat) : PositiveRat :=\n ⟨(x : ℚ) + (y : ℚ), add_pos x.2 y.2⟩\n\n/-- Condition (i): for all positive rationals `x,y`,\n`f(x) f(y) ≥ f(xy)`. -/\ndef MultiplicativeInequality (f : PositiveRat → ℝ) : Prop :=\n ∀ x y : PositiveRat, f x * f y ≥ f (positiveRatMul x y)\n\n/-- Condition (ii): for all positive rationals `x,y`,\n`f(x+y) ≥ f(x)+f(y)`. -/\ndef AdditiveInequality (f : PositiveRat → ℝ) : Prop :=\n ∀ x y : PositiveRat, f (positiveRatAdd x y) ≥ f x + f y\n\n/-- Condition (iii): there exists a rational `a > 1` whose value under `f`\nis `a` itself. -/\ndef FixedPointAboveOne (f : PositiveRat → ℝ) : Prop :=\n ∃ a : PositiveRat, 1 < (a : ℚ) ∧ f a = ((a : ℚ) : ℝ)\n\n/-- The assertion to be proved: any `f : ℚ_{>0} → ℝ` satisfying (i), (ii),\nand (iii) is the identity function. -/\ndef Target : Prop :=\n ∀ f : PositiveRat → ℝ,\n MultiplicativeInequality f →\n AdditiveInequality f →\n FixedPointAboveOne f →\n ∀ x : PositiveRat, f x = ((x : ℚ) : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "683dbcce-7b3f-5a01-a2e6-d3972ba104a5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d50831e5c21ca7c1eae9828911e3eb0cf122692e8a5dfbca06005f152b4bd079", "task_path": "tasks/nmp3_683dbcce-7b3f-5a01-a2e6-d3972ba104a5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "683dbcce-7b3f-5a01-a2e6-d3972ba104a5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_683ece7d-8fba-544a-b9f7-ab12ba74c426", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be a finite group such that for every subgroup $H\\le G$ there exists a homomorphism $f:G\\to H$ satisfying $f(h)=h$ for all $h\\in H$ (i.e., each subgroup is a retract of $G$). Prove that $G$ is isomorphic to a direct product of cyclic groups of prime order.\nimport Mathlib\n\n/-!\n# Formal statement: finite groups all of whose subgroups are retracts\n\nThe source problem asks to prove that a finite group `G` with the property that\nevery subgroup `H ≤ G` admits a group homomorphism `G → H` which is the identity\non `H` is isomorphic to a direct product of cyclic groups of prime order.\n-/\n\nuniverse u\n\nnamespace Problem\n\n/-- A subgroup `H` of a group `G` is a retract of `G` when there is a group\nhomomorphism from `G` to `H` whose restriction to `H` is the identity. -/\ndef IsSubgroupRetract (G : Type u) [Group G] (H : Subgroup G) : Prop :=\n ∃ f : G →* H, ∀ h : H, f (h : G) = h\n\n/-- `G` is isomorphic to a finite direct product of cyclic groups of prime order.\nThe product is indexed by `Fin n`; its factors are the multiplicative groups\nunderlying `ZMod (p i)`, which are cyclic of order `p i` when `p i` is prime. -/\ndef IsDirectProductOfPrimeCyclicGroups (G : Type u) [Group G] : Prop :=\n ∃ (n : ℕ) (p : Fin n → ℕ),\n (∀ i : Fin n, Nat.Prime (p i)) ∧\n Nonempty (G ≃* ((i : Fin n) → Multiplicative (ZMod (p i))))\n\n/-- The full assertion of the problem: every finite group in the universe `u`\nin which every subgroup is a retract is isomorphic to a finite direct product of\ncyclic groups of prime order. -/\ndef Target : Prop :=\n ∀ (G : Type u) [Group G] [Finite G],\n (∀ H : Subgroup G, IsSubgroupRetract G H) →\n IsDirectProductOfPrimeCyclicGroups G\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "683ece7d-8fba-544a-b9f7-ab12ba74c426", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e9468d091d28040ec60841b152aae3961f6b8960ef4fc783d9a1dc25175ca09a", "task_path": "tasks/nmp3_683ece7d-8fba-544a-b9f7-ab12ba74c426", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "683ece7d-8fba-544a-b9f7-ab12ba74c426", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6842b318-5cc9-544a-a5de-875426c36bc5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c,d$, prove that \n-- \\[\n-- (1+a+a^{2})(1+b+b^{2})(1+c+c^{2})(1+d+d^{2})\\;\\ge\\;(1+a+ab)(1+b+bc)(1+c+cd)(1+d+da).\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the cyclic product inequality\n\nFor positive real numbers `a`, `b`, `c`, and `d`, the problem asks to prove\n\n`(1 + a + a^2) * (1 + b + b^2) * (1 + c + c^2) * (1 + d + d^2)\n ≥ (1 + a + a*b) * (1 + b + b*c) * (1 + c + c*d) * (1 + d + d*a)`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\ndef LHS (a b c d : ℝ) : ℝ :=\n (1 + a + a ^ 2) * (1 + b + b ^ 2) * (1 + c + c ^ 2) * (1 + d + d ^ 2)\n\n/-- The right-hand side of the target inequality. -/\ndef RHS (a b c d : ℝ) : ℝ :=\n (1 + a + a * b) * (1 + b + b * c) * (1 + c + c * d) * (1 + d + d * a)\n\n/-- The assertion from the problem: for all positive real numbers `a b c d`, the\nleft-hand product is at least the cyclic right-hand product. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d → LHS a b c d ≥ RHS a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6842b318-5cc9-544a-a5de-875426c36bc5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "60efdaa43cfcf716f4b87cd51f4f0cd1a46cdfab00bd8fac0fb29f46a7010ae9", "task_path": "tasks/nmp3_6842b318-5cc9-544a-a5de-875426c36bc5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6842b318-5cc9-544a-a5de-875426c36bc5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_68a62700-fc3b-5778-926d-698d93b4aa41", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:(0,\\infty)\\to(0,\\infty)$ be a differentiable function. Prove that \n-- \\[\n-- \\int_{0}^{\\infty}\\frac{\\sqrt{1+(f'(t))^{2}}}{\\,f(t)\\,}\\,dt = +\\infty .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks to prove that, for every differentiable positive-valued\nfunction `f` on `(0, ∞)`, the nonnegative integral of\n`sqrt (1 + (f') ^ 2) / f` over `(0, ∞)` diverges to `+∞`.\n\nThe integrand is nonnegative under the hypotheses, so it is represented as an\nextended nonnegative Lebesgue integral (`lintegral`) with values in `ℝ≥0∞`.\nThe equality with `⊤` is the formal form of divergence to `+∞`.\n-/\n\nopen MeasureTheory\nopen scoped ENNReal\n\nnamespace Problem\n\n/-- The pointwise integrand\n`sqrt (1 + (f'(t))^2) / f(t)`, as a real-valued function. -/\nnoncomputable def integrand (f : ℝ → ℝ) (t : ℝ) : ℝ :=\n Real.sqrt (1 + (deriv f t) ^ 2) / f t\n\n/--\nThe assertion of the problem: for every function `f : (0, ∞) → (0, ∞)`\nwhich is differentiable on `(0, ∞)`, the integral\n`∫₀^∞ sqrt(1 + (f'(t))²) / f(t) dt` is `+∞`.\n\nThe source function on the open interval `(0, ∞)` is encoded as a total\nfunction `ℝ → ℝ` together with the condition that its values are positive on\n`(0, ∞)`. Only the restriction to `(0, ∞)` is constrained. The integral is the\nextended nonnegative Lebesgue integral over `Set.Ioi 0`; the endpoint `0` is\nexcluded, as in the source domain.\n-/\nnoncomputable def Target : Prop :=\n ∀ f : ℝ → ℝ,\n (∀ t : ℝ, 0 < t → 0 < f t) →\n DifferentiableOn ℝ f (Set.Ioi (0 : ℝ)) →\n (∫⁻ t in Set.Ioi (0 : ℝ),\n ENNReal.ofReal (integrand f t) ∂(volume : MeasureTheory.Measure ℝ)) = ⊤\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "68a62700-fc3b-5778-926d-698d93b4aa41", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "04b7071993da00502aa5b5e5d3b4741aeb8606a64263df349d2b60c3dc8f4078", "task_path": "tasks/nmp3_68a62700-fc3b-5778-926d-698d93b4aa41", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "68a62700-fc3b-5778-926d-698d93b4aa41", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_68b1fca5-a15e-537e-85f2-2f6174d0aba8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy \n-- \\[\n-- \\frac{a}{1+b}+\\frac{b}{1+c}+\\frac{c}{1+a}=1.\n-- \\] \n-- Prove that \n-- \\[\n-- (a+c)^2(2a-1)+(c+b)^2(2c-1)+(b+a)^2(2b-1)\\ge0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the nonnegative-variable constrained inequality\n\nThe source problem asks, for real numbers `a`, `b`, and `c` that are\nnonnegative and satisfy\n`a / (1 + b) + b / (1 + c) + c / (1 + a) = 1`, to prove a certain\nsquared-term inequality. The proposition is packaged as `Problem.Target`;\nno proof of it is supplied here.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions from the problem: `a`, `b`, and `c` are\nnonnegative and satisfy the displayed rational equation. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧\n a / (1 + b) + b / (1 + c) + c / (1 + a) = 1\n\n/-- The left-hand side of the inequality to be proved. -/\ndef InequalityLHS (a b c : ℝ) : ℝ :=\n (a + c) ^ 2 * (2 * a - 1) +\n (c + b) ^ 2 * (2 * c - 1) +\n (b + a) ^ 2 * (2 * b - 1)\n\n/-- The conclusion of the problem for fixed `a`, `b`, and `c`: the\nleft-hand side is nonnegative. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n 0 ≤ InequalityLHS a b c\n\n/-- The full universally quantified assertion of the problem. For every\nthree real numbers satisfying the nonnegativity and displayed equation,\nthe required inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "68b1fca5-a15e-537e-85f2-2f6174d0aba8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a54c566831d34cf3690ea9fa33b13ecc8fc7634516035f57ef5fb5c56b83c2b2", "task_path": "tasks/nmp3_68b1fca5-a15e-537e-85f2-2f6174d0aba8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "68b1fca5-a15e-537e-85f2-2f6174d0aba8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_68b4e4a7-c88f-543a-840f-d6e80e59fa35", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P$ be an interior point of an acute triangle $ABC$. Let $D$, $E$, $F$ be the intersections of the lines $AP$, $BP$, $CP$ with the sides $BC$, $CA$, $AB$, respectively. Suppose that $\\triangle DEF$ is similar to $\\triangle ABC$. Prove that $P$ is the centroid of $\\triangle ABC$ (equivalently, $D$, $E$, $F$ are the midpoints of $BC$, $CA$, $AB$).\nimport Mathlib\n\n/-!\n# Formalization of a planar triangle problem\n\nThe problem is stated in the Euclidean plane. We use `EuclideanSpace ℝ (Fin 2)`\nas the ambient plane and spell out the elementary predicates (collinearity,\nstrict interior, side intersection, acuteness, similarity, centroid, and\nmidpoint) in coordinates. No theorem is proved here: `Problem.Target` is the\ntarget proposition.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, represented by two real coordinates. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The dot product of two plane vectors, written in coordinates. -/\ndef dot (u v : Point) : ℝ := u 0 * v 0 + u 1 * v 1\n\n/-- The signed two-dimensional cross product of two plane vectors. -/\ndef cross (u v : Point) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- Three points are collinear when the two vectors from the first point are\nlinearly dependent in the plane. -/\ndef Collinear (A B C : Point) : Prop :=\n cross (B - A) (C - A) = 0\n\n/-- `X` lies on the closed segment with endpoints `A` and `B`. -/\ndef OnClosedSegment (A B X : Point) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ X = (1 - t) • A + t • B\n\n/-- The point `T` is the (necessarily unique) intersection of the line through\n`X` and `P` with the closed side `YZ`. Explicitly, the set of points lying on\nboth that line and that side is exactly the singleton `{T}`. This records the\nexistence and uniqueness implicit in the word \"the intersection\". -/\ndef IsTraceOnSide (X P Y Z T : Point) : Prop :=\n ({U : Point | Collinear X P U ∧ OnClosedSegment Y Z U} : Set Point) = {T}\n\n/-- Triangle `ABC` is a genuine (nondegenerate) acute triangle. Nondegeneracy\nis expressed by a nonzero cross product, and each angle is required to be\nstrictly less than a right angle by a strictly positive dot product at the\ncorresponding vertex. -/\ndef AcuteTriangle (A B C : Point) : Prop :=\n A ≠ B ∧ A ≠ C ∧ B ≠ C ∧\n cross (B - A) (C - A) ≠ 0 ∧\n 0 < dot (B - A) (C - A) ∧\n 0 < dot (C - B) (A - B) ∧\n 0 < dot (A - C) (B - C)\n\n/-- `P` lies strictly in the interior of triangle `ABC`, expressed by strictly\npositive barycentric coordinates. -/\ndef StrictInterior (A B C P : Point) : Prop :=\n ∃ α β γ : ℝ,\n 0 < α ∧ 0 < β ∧ 0 < γ ∧ α + β + γ = 1 ∧\n P = α • A + β • B + γ • C\n\n/-- Triangles `XYZ` and `ABC` are similar with the ordered vertex\ncorrespondence `X ↔ A`, `Y ↔ B`, `Z ↔ C`. This is the usual side-length\nproportionality criterion; reflections are allowed. -/\ndef SimilarOrdered (X Y Z A B C : Point) : Prop :=\n ∃ k : ℝ, 0 < k ∧\n dist X Y = k * dist A B ∧\n dist Y Z = k * dist B C ∧\n dist Z X = k * dist C A\n\n/-- `P` is the centroid of triangle `ABC`. -/\ndef IsCentroid (A B C P : Point) : Prop :=\n P = (1 / 3 : ℝ) • A + (1 / 3 : ℝ) • B + (1 / 3 : ℝ) • C\n\n/-- `M` is the midpoint of the segment with endpoints `A` and `B`. -/\ndef IsMidpoint (M A B : Point) : Prop :=\n M = (1 / 2 : ℝ) • A + (1 / 2 : ℝ) • B\n\n/-- `D`, `E`, and `F` are respectively the midpoints of `BC`, `CA`, and `AB`. -/\ndef SideMidpoints (D E F A B C : Point) : Prop :=\n IsMidpoint D B C ∧ IsMidpoint E C A ∧ IsMidpoint F A B\n\n/-- The conclusion asserted in the source: `P` is the centroid of `ABC`, and,\nequivalently under the intersection hypotheses, `D`, `E`, and `F` are the\nmidpoints of the opposite sides. -/\ndef Conclusion (A B C P D E F : Point) : Prop :=\n IsCentroid A B C P ∧ SideMidpoints D E F A B C\n\n/-- The full target of the problem.\n\nFor every acute triangle `ABC` and every strictly interior point `P`, let `D`,\n`E`, and `F` be respectively the intersections of the lines `AP`, `BP`, and\n`CP` with the closed sides `BC`, `CA`, and `AB`. If the ordered triangle `DEF`\nis similar to the ordered triangle `ABC`, then `P` is the centroid of `ABC`;\nequivalently, `D`, `E`, and `F` are the midpoints of `BC`, `CA`, and `AB`.\nWe state both equivalent conclusions in the conclusion to make the entire\noriginal sentence explicit. -/\ndef Target : Prop :=\n ∀ A B C P D E F : Point,\n AcuteTriangle A B C →\n StrictInterior A B C P →\n IsTraceOnSide A P B C D →\n IsTraceOnSide B P C A E →\n IsTraceOnSide C P A B F →\n SimilarOrdered D E F A B C →\n Conclusion A B C P D E F\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "68b4e4a7-c88f-543a-840f-d6e80e59fa35", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "68e782b16e0aa5c63a5d36a089f44e157b0bb66741284b89f76157785f2ed291", "task_path": "tasks/nmp3_68b4e4a7-c88f-543a-840f-d6e80e59fa35", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "68b4e4a7-c88f-543a-840f-d6e80e59fa35", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_68c9325c-e8c3-5428-9706-9e18e7a84549", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}(b+c)^2\\,(a-b)(a-c)(a+b-c)(a+c-b)\\ge0.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Cyclic polynomial inequality\n\nThis file formalizes the statement of the problem without asserting a proof.\nFor positive real numbers `a`, `b`, and `c`, the cyclic sum\n`∑_cyc (b+c)^2 (a-b)(a-c)(a+b-c)(a+c-b)` is nonnegative.\n-/\n\nnamespace Problem\n\n/-- A single summand of the cyclic sum.\n\nWith the displayed notation, this is the summand corresponding to the\nvariables `(a,b,c)`:\n`(b+c)^2 * (a-b) * (a-c) * (a+b-c) * (a+c-b)`.\n-/\ndef cyclicTerm (a b c : ℝ) : ℝ :=\n (b + c) ^ 2 * (a - b) * (a - c) * (a + b - c) * (a + c - b)\n\n/-- The cyclic sum over the three cyclic permutations of `(a,b,c)`.\n\nThe three summands are obtained by applying `cyclicTerm` to `(a,b,c)`,\n`(b,c,a)`, and `(c,a,b)`, respectively.\n-/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The full assertion of the problem: for all positive real `a`, `b`, and `c`,\nthe cyclic sum is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → cyclicSum a b c ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "68c9325c-e8c3-5428-9706-9e18e7a84549", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "794dd85ae0fd17fe065037cf5cce2f2ee3f5cc63ee5403087724e9eea6a6529a", "task_path": "tasks/nmp3_68c9325c-e8c3-5428-9706-9e18e7a84549", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "68c9325c-e8c3-5428-9706-9e18e7a84549", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_68c995a8-c6dd-5cb3-8892-8ffdef71d741", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given an integer $n\\ge 2$ and real numbers $x_1,x_2,\\dots ,x_n\\in[0,1]$, prove that there exist real numbers $a_0,a_1,\\dots ,a_n$ such that \n-- \n-- 1. $a_0+a_n=0$; \n-- 2. $|a_i|\\le 1$ for all $i=0,1,\\dots ,n$; \n-- 3. $|a_i-a_{i-1}|=x_i$ for all $i=1,2,\\dots ,n\\,. $\nimport Mathlib\n\n/-!\n# Formal statement for the sequence interpolation problem\n\nFor every integer `n ≥ 2` and every real sequence\n`x_1, ..., x_n` in `[0, 1]`, there is a real sequence `a_0, ..., a_n`\nwhose endpoint sum is zero, whose terms are bounded by one in absolute\nvalue, and whose successive differences have absolute values exactly\nthe prescribed `x_i`.\n-/\n\nnamespace Problem\n\n/-- The prescribed data `x : Fin n → ℝ` all lie in the closed interval\n`[0, 1]`. Under the convention used below, `x i` is the problem's\n`x_{i+1}`. -/\ndef InputInUnitInterval (n : ℕ) (x : Fin n → ℝ) : Prop :=\n ∀ i : Fin n, x i ∈ Set.Icc (0 : ℝ) 1\n\n/--\n`IsAdmissible n x a` says that the finite real sequence `a`, indexed by\n`Fin (n + 1)`, satisfies the three required conditions for the prescribed\ndata `x`, indexed by `Fin n`. Thus `x i` denotes the problem's\n`x_{i+1}`, while `a i` denotes the problem's `a_i`.\n-/\ndef IsAdmissible (n : ℕ) (x : Fin n → ℝ) (a : Fin (n + 1) → ℝ) : Prop :=\n a 0 + a (Fin.last n) = 0 ∧\n (∀ i : Fin (n + 1), |a i| ≤ (1 : ℝ)) ∧\n (∀ i : Fin n, |a i.succ - a i.castSucc| = x i)\n\n/-- There exists a real sequence `a_0, ..., a_n` satisfying all three\nadmissibility conditions for the prescribed sequence `x`. -/\ndef HasSolution (n : ℕ) (x : Fin n → ℝ) : Prop :=\n ∃ a : Fin (n + 1) → ℝ, IsAdmissible n x a\n\n/--\nThe complete proposition stated by the problem: for every natural\nnumber `n` at least two and every real sequence `x_1, ..., x_n` taking\nvalues in `[0, 1]`, there exists a real sequence `a_0, ..., a_n`\nsatisfying all three required conditions.\n-/\ndef Target : Prop :=\n ∀ (n : ℕ), 2 ≤ n → ∀ (x : Fin n → ℝ),\n InputInUnitInterval n x → HasSolution n x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "68c995a8-c6dd-5cb3-8892-8ffdef71d741", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9d1b534dffae3faab401d0ca67f1dda532a4650810f1d1c663879229a21bcb90", "task_path": "tasks/nmp3_68c995a8-c6dd-5cb3-8892-8ffdef71d741", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "68c995a8-c6dd-5cb3-8892-8ffdef71d741", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_68f51b44-fe4c-53f3-b989-b120272c8c51", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:(0,\\infty)\\to(0,\\infty)$ such that for every pair of positive real numbers $x$ and $y$,\n-- $$f(x)\\,f\\bigl(yf(x)\\bigr)=f(x+y).$$\nimport Mathlib\n\n/-!\n# Formalization of the positive-real functional equation\n\nThe problem asks for all functions `f : (0, ∞) → (0, ∞)` satisfying\n\n`f x * f (y * f x) = f (x + y)`\n\nfor all positive real numbers `x` and `y`.\n\nThe open half-line is represented by the subtype `PositiveReal`. The\nadmissibility predicate below preserves the exact domain, codomain, product,\naddition, and universal quantification in the source statement. The\ncandidate family and the complete-answer predicate encode the requested\nclassification: for a proposed set of functions, both inclusions between\nbeing in that set and being admissible are required.\n-/\n\nnamespace Problem\n\n/-- The open positive real half-line `(0, ∞)`, as a subtype of `ℝ`. -/\nabbrev PositiveReal : Type := {x : ℝ // 0 < x}\n\n/-- Addition of two positive reals, with the positivity proof. -/\ndef addPositive (x y : PositiveReal) : PositiveReal :=\n ⟨(x : ℝ) + (y : ℝ), add_pos x.property y.property⟩\n\n/-- Multiplication of two positive reals, with the positivity proof. -/\ndef mulPositive (x y : PositiveReal) : PositiveReal :=\n ⟨(x : ℝ) * (y : ℝ), mul_pos x.property y.property⟩\n\n/--\n`Admissible f` says that `f : (0, ∞) → (0, ∞)` satisfies\n`f x * f (y * f x) = f (x + y)` for every pair of positive reals `x`, `y`.\n\nThe coerce-to-`ℝ` on each side is only for reading the subtype-valued\nfunction as an ordinary real equation; injectivity of the subtype coercion\nmakes this equivalent to equality in the positive reals.\n-/\ndef Admissible (f : PositiveReal → PositiveReal) : Prop :=\n ∀ x y : PositiveReal,\n (f x : ℝ) * (f (mulPositive y (f x)) : ℝ) =\n (f (addPositive x y) : ℝ)\n\n/--\nThe candidate family suggested by the classification: for a real parameter\n`c ≥ 0`, it is the function `x ↦ 1 / (1 + c*x)` on positive reals.\n-/\nnoncomputable def solutionCandidate (c : ℝ) (hc : 0 ≤ c) :\n PositiveReal → PositiveReal :=\n fun x =>\n ⟨1 / (1 + c * (x : ℝ)), by\n apply one_div_pos.mpr\n have hx : 0 ≤ (x : ℝ) := le_of_lt x.property\n have hcx : 0 ≤ c * (x : ℝ) := mul_nonneg hc hx\n linarith\n ⟩\n\n/-- The proposed complete family of solutions `x ↦ 1 / (1 + c*x)`, `c ≥ 0`. -/\ndef candidateFamily : Set (PositiveReal → PositiveReal) :=\n {f | ∃ (c : ℝ) (hc : 0 ≤ c), f = solutionCandidate c hc}\n\n/--\n`IsCompleteAnswer S` is the complete-answer predicate for the \"find all\"\nproblem: a proposed set `S` of functions is correct exactly when, for every\nfunction `f`, membership in `S` is equivalent to admissibility. Thus both\ndirections of the classification are required.\n-/\ndef IsCompleteAnswer (S : Set (PositiveReal → PositiveReal)) : Prop :=\n ∀ f : PositiveReal → PositiveReal, f ∈ S ↔ Admissible f\n\n/--\nThe mathematical target of the problem: the displayed equation holds for all\npositive `x,y` if and only if `f` is one of the functions\n`x ↦ 1 / (1 + c*x)` with a real parameter `c ≥ 0`.\n-/\ndef Target : Prop :=\n ∀ f : PositiveReal → PositiveReal,\n Admissible f ↔ ∃ (c : ℝ) (hc : 0 ≤ c), f = solutionCandidate c hc\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "68f51b44-fe4c-53f3-b989-b120272c8c51", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bdb9f6a9013a3b87953fc6ff80dd29ca41389f2506345962c09fe8db46acfd9a", "task_path": "tasks/nmp3_68f51b44-fe4c-53f3-b989-b120272c8c51", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "68f51b44-fe4c-53f3-b989-b120272c8c51", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_69483268-b939-5fa5-84de-d550682ffd0d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ be real numbers such that $ab+bc+ca=1$. Prove that \n-- \\[\n-- \\frac{1+a^{2}b^{2}}{(a+b)^{2}}+\\frac{1+b^{2}c^{2}}{(b+c)^{2}}+\\frac{1+c^{2}a^{2}}{(c+a)^{2}}\\ge\\frac52.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic inequality problem\n\nThe original problem asks to prove a lower bound for a sum of three rational\nexpressions under nonnegativity and a normalization condition on the variables.\n-/\n\nnamespace Problem\n\n/-- The assertion from the problem: for all nonnegative real numbers `a`, `b`,\nand `c` satisfying `ab + bc + ca = 1`, the given cyclic sum is at least `5 / 2`.\n\nThe divisions are real divisions. The hypothesis `ab + bc + ca = 1` is part\nof the statement of the target proposition, not an additional assumption\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a * b + b * c + c * a = 1 →\n (1 + a ^ 2 * b ^ 2) / (a + b) ^ 2\n + (1 + b ^ 2 * c ^ 2) / (b + c) ^ 2\n + (1 + c ^ 2 * a ^ 2) / (c + a) ^ 2\n ≥ (5 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "69483268-b939-5fa5-84de-d550682ffd0d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "639e3748264aacf2bf54b9ecba62ae344f06f82177ea3a93463f2ca490e30ad3", "task_path": "tasks/nmp3_69483268-b939-5fa5-84de-d550682ffd0d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "69483268-b939-5fa5-84de-d550682ffd0d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6951737d-9e7e-5648-8825-865210ec5d60", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any positive real numbers $a$, $b$, $c$,\n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{1}{\\sqrt{a^{2}+bc}}\\;\\le\\;\\sum_{\\text{cyc}}\\frac{\\sqrt{2}}{a+b}.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The three-term cyclic sum `f a b c + f b c a + f c a b`. -/\ndef cyclicSum (f : ℝ → ℝ → ℝ → ℝ) (a b c : ℝ) : ℝ :=\n f a b c + f b c a + f c a b\n\n/-- The left-hand side of the displayed inequality. -/\ndef leftSide (a b c : ℝ) : ℝ :=\n cyclicSum (fun x y z : ℝ => 1 / Real.sqrt (x ^ 2 + y * z)) a b c\n\n/-- The right-hand side of the displayed inequality. -/\ndef rightSide (a b c : ℝ) : ℝ :=\n cyclicSum (fun x y _z : ℝ => Real.sqrt 2 / (x + y)) a b c\n\n/-- The assertion for one fixed triple of positive real numbers. -/\ndef ClaimAt (a b c : ℝ) : Prop :=\n 0 < a → 0 < b → 0 < c → leftSide a b c ≤ rightSide a b c\n\n/-- The full universally quantified assertion in the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, ClaimAt a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6951737d-9e7e-5648-8825-865210ec5d60", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "359389b0fe1d71ea4a2bc125da6d1a25409d2b53cc94355b1e3e55858324dad4", "task_path": "tasks/nmp3_6951737d-9e7e-5648-8825-865210ec5d60", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6951737d-9e7e-5648-8825-865210ec5d60", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_69845c3c-71ee-5a43-bd6d-260bca22540b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exist infinitely many positive integers $n$ such that $n$ does not divide $2^n+1$ but $n$ divides $2^{2^n+1}+1$.\nimport Mathlib\n\n/-!\n# Formalization of the target statement\n\nThe problem asks to prove that infinitely many positive natural numbers `n`\nsatisfy the following two divisibility conditions:\n* `n` does not divide `2 ^ n + 1`;\n* `n` divides `2 ^ (2 ^ n + 1) + 1`.\n\nThe ambient number domain is `ℕ`, with the positivity assumption `0 < n`\nincluded in `Admissible`. The final declaration `Target` is a proposition,\nnot a proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility predicate for a positive integer `n` in the problem:\n`n` is positive, does not divide `2 ^ n + 1`, and divides\n`2 ^ (2 ^ n + 1) + 1`. -/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧ ¬ n ∣ (2 ^ n + 1) ∧ n ∣ (2 ^ (2 ^ n + 1) + 1)\n\n/-- The set of positive integers satisfying both divisibility conditions. -/\ndef SolutionSet : Set ℕ :=\n {n : ℕ | Admissible n}\n\n/-- The statement to be proved: there are infinitely many positive integers\n`n` which do not divide `2 ^ n + 1` but do divide `2 ^ (2 ^ n + 1) + 1`. -/\ndef Target : Prop :=\n Set.Infinite SolutionSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "69845c3c-71ee-5a43-bd6d-260bca22540b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5005b5a64eef0efa68a6e97a6791880b6fb6ef9e1b4ede83188ee18b44838078", "task_path": "tasks/nmp3_69845c3c-71ee-5a43-bd6d-260bca22540b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "69845c3c-71ee-5a43-bd6d-260bca22540b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_69c8e2f9-846f-51a0-859d-7230bd3e572e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any real numbers $a,b,c$,\n-- \\[\n-- \\bigl(a^{2}+b^{2}+c^{2}-ab-bc-ca\\bigr)^{2}+4\\bigl(a^{3}b+b^{3}c+c^{3}a\\bigr)\\ge 0.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- For any real numbers `a`, `b`, and `c`, the expression\n`(a^2 + b^2 + c^2 - a*b - b*c - c*a)^2 + 4*(a^3*b + b^3*c + c^3*a) is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n (a ^ 2 + b ^ 2 + c ^ 2 - a * b - b * c - c * a) ^ 2\n + 4 * (a ^ 3 * b + b ^ 3 * c + c ^ 3 * a) ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "69c8e2f9-846f-51a0-859d-7230bd3e572e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "aa454fb2fe0971e9a32ae25d7b5cefd73020fa31c0d7d650e56982f3a0813c08", "task_path": "tasks/nmp3_69c8e2f9-846f-51a0-859d-7230bd3e572e", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "69c8e2f9-846f-51a0-859d-7230bd3e572e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_69d36153-6550-5da1-a0f7-4e54ba6561a9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every positive integer $n$ there exists a set $M$ of $n$ distinct positive integers such that for any two distinct elements $a,b\\in M$ we have \\[(a-b)^2\\mid ab.\\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The divisibility condition for an ordered pair of natural numbers, interpreted in the\nintegers so that `(a - b)^2` is the square of the usual (possibly negative) integer\ndifference. -/\ndef PairCondition (a b : ℕ) : Prop :=\n (((a : ℤ) - (b : ℤ)) ^ 2 ∣ (a : ℤ) * (b : ℤ))\n\n/-- A finite set of positive integers. -/\ndef PositiveSet (M : Finset ℕ) : Prop :=\n ∀ a : ℕ, a ∈ M → 0 < a\n\n/-- A finite set of positive integers satisfying the required pairwise divisibility\ncondition. -/\ndef Admissible (M : Finset ℕ) : Prop :=\n PositiveSet M ∧\n ∀ a : ℕ, a ∈ M → ∀ b : ℕ, b ∈ M → a ≠ b → PairCondition a b\n\n/-- For every positive integer `n`, there is an admissible set of exactly `n` distinct\npositive integers. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ∃ M : Finset ℕ, M.card = n ∧ Admissible M\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "69d36153-6550-5da1-a0f7-4e54ba6561a9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4edb6e3b288431efbe151f396c32cdf94efc038b2c3054f6264f62da3b9cee71", "task_path": "tasks/nmp3_69d36153-6550-5da1-a0f7-4e54ba6561a9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "69d36153-6550-5da1-a0f7-4e54ba6561a9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6a028bd5-804a-5cf1-a37d-e09d4bf706dc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $(a_n)$ is a sequence of positive integers such that \n-- \\[\n-- \\lim_{n\\to\\infty}\\frac{n}{a_n}=0.\n-- \\]\n-- Prove that there exists a positive integer $k$ such that there are at least $1990$ perfect squares strictly between \n-- \\[\n-- S_k = a_1+a_2+\\dots+a_k\n-- \\qquad\\text{and}\\qquad\n-- S_{k+1}=a_1+a_2+\\dots+a_{k+1}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the statement\n\nThe original problem asks to prove that, for every sequence `(a_n)` of positive\nintegers with `n / a_n → 0`, some positive index `k` has at least 1990 perfect\nsquares strictly between the partial sums `S_k` and `S_{k+1}`.\n\nThis file only states the problem. It does not contain a proof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The partial sum `S_k = a_1 + a_2 + ... + a_k`. The sequence is indexed by\nthe positive integers `ℕ+`, so no indexing convention shift is needed. -/\ndef partialSum (a : ℕ+ → ℕ) (k : ℕ+) : ℕ :=\n ∑ i ∈ Finset.Icc (1 : ℕ+) k, a i\n\n/-- The assertion that a sequence consists of positive integers. -/\ndef PositiveIntegerSequence (a : ℕ+ → ℕ) : Prop :=\n ∀ n : ℕ+, 0 < a n\n\n/-- The limit condition `n / a_n → 0`, with the quotient interpreted in `ℝ`. -/\ndef HasZeroRelativeSize (a : ℕ+ → ℕ) : Prop :=\n Filter.Tendsto (fun n : ℕ+ => (n : ℝ) / (a n : ℝ)) Filter.atTop (nhds (0 : ℝ))\n\n/-- The number of perfect squares strictly between `S_k` and `S_{k+1}`. -/\ndef numberOfSquaresBetween (a : ℕ+ → ℕ) (k : ℕ+) : ℕ :=\n Nat.card {m : ℕ // partialSum a k < m ∧ m < partialSum a (k + 1) ∧ IsSquare m}\n\n/-- The conclusion that at least 1990 perfect squares lie strictly between\n`S_k` and `S_{k+1}`. -/\ndef HasAtLeast1990SquaresBetween (a : ℕ+ → ℕ) (k : ℕ+) : Prop :=\n 1990 ≤ numberOfSquaresBetween a k\n\n/-- The full statement of the problem. -/\ndef Target : Prop :=\n ∀ a : ℕ+ → ℕ,\n PositiveIntegerSequence a →\n HasZeroRelativeSize a →\n ∃ k : ℕ+, HasAtLeast1990SquaresBetween a k\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6a028bd5-804a-5cf1-a37d-e09d4bf706dc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5d75bc799902e3a19574e1dee2cd6d22e52ce407eebe91950f066394935ea847", "task_path": "tasks/nmp3_6a028bd5-804a-5cf1-a37d-e09d4bf706dc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6a028bd5-804a-5cf1-a37d-e09d4bf706dc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6a387bbb-dac4-57ed-8bb9-9bad6ec658eb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Five points are placed in the plane. The ten triangles determined by all triples of these points each have area at least $2$. Prove that at least one of these triangles has area at least $3$.\nimport Mathlib\n\n/-!\n# Five points and triangle areas\n\nThis module formalizes the statement of the problem. A point of the plane is\nrepresented by a pair of real coordinates. The area of a triangle is the\nabsolute value of the shoelace determinant divided by two. No proof of the\nassertion is supplied; `Problem.Target` is the proposition to be proved.\n-/\n\nnamespace Problem\n\n/-- A point in the Euclidean coordinate plane. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- The signed doubled area (shoelace determinant) of the triangle with\nvertices `p`, `q`, and `r`. -/\ndef signedDoubleArea (p q r : Point) : ℝ :=\n (q.1 - p.1) * (r.2 - p.2) - (q.2 - p.2) * (r.1 - p.1)\n\n/-- The area of the triangle with vertices `p`, `q`, and `r`, computed from the\nabsolute value of the shoelace determinant. Degenerate triples have area zero. -/\nnoncomputable def triangleArea (p q r : Point) : ℝ :=\n |signedDoubleArea p q r| / 2\n\n/-- The admissibility condition: for every triple of distinct indices (hence\nfor each of the ten triangles determined by the five points), the area is at\nleast `2`. -/\ndef Admissible (p : Fin 5 → Point) : Prop :=\n ∀ i j k : Fin 5,\n i ≠ j → i ≠ k → j ≠ k →\n 2 ≤ triangleArea (p i) (p j) (p k)\n\n/-- The conclusion: at least one of the triangles determined by three distinct\npoints has area at least `3`. -/\ndef HasLargeTriangle (p : Fin 5 → Point) : Prop :=\n ∃ i j k : Fin 5,\n i ≠ j ∧ i ≠ k ∧ j ≠ k ∧\n 3 ≤ triangleArea (p i) (p j) (p k)\n\n/-- The full statement: for any five points in the plane, if all ten triangles\ndetermined by triples of the points have area at least `2`, then at least one of\nthose triangles has area at least `3`. -/\ndef Target : Prop :=\n ∀ p : Fin 5 → Point, Admissible p → HasLargeTriangle p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6a387bbb-dac4-57ed-8bb9-9bad6ec658eb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e2a7d7832e58ecc1e3fe7e923be2e9b9cabe710fc687acc1e2c61cf9e279c34b", "task_path": "tasks/nmp3_6a387bbb-dac4-57ed-8bb9-9bad6ec658eb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6a387bbb-dac4-57ed-8bb9-9bad6ec658eb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6a55e983-dc88-57b5-8fa5-150574a0ace3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $r\\ge 2$ be a fixed positive integer, and let $\\mathcal F$ be an infinite family of sets, each of size $r$, such that no two sets in $\\mathcal F$ are disjoint. Prove that there exists a set $T$ of size $r-1$ that meets (i.e. has non‑empty intersection with) every set in $\\mathcal F$.\nimport Mathlib.Data.Set.Card\n\nuniverse u\n\nnamespace Problem\n\n/-- A set has cardinality `n` when it is finite and its natural cardinality is `n`. -/\ndef SetHasCard {α : Type u} (s : Set α) (n : ℕ) : Prop :=\n Set.Finite s ∧ Set.ncard s = n\n\n/-- Every member of the family has cardinality `r`. -/\ndef IsUniformFamily {α : Type u} (r : ℕ) (F : Set (Set α)) : Prop :=\n ∀ (A : Set α), A ∈ F → SetHasCard A r\n\n/-- Any two distinct members of the family have a nonempty intersection. -/\ndef IsPairwiseIntersecting {α : Type u} (F : Set (Set α)) : Prop :=\n ∀ (A : Set α), A ∈ F → ∀ (B : Set α), B ∈ F → A ≠ B → ¬ Disjoint A B\n\n/-- A set meets every member of a family in a nonempty intersection. -/\ndef MeetsEvery {α : Type u} (T : Set α) (F : Set (Set α)) : Prop :=\n ∀ (A : Set α), A ∈ F → Set.Nonempty (T ∩ A)\n\n/-- `T` has cardinality `n` and meets every member of `F`. -/\ndef IsHittingSetOfCard {α : Type u} (n : ℕ) (T : Set α)\n (F : Set (Set α)) : Prop :=\n SetHasCard T n ∧ MeetsEvery T F\n\n/-- The statement of the problem: an infinite pairwise-intersecting family of\n`r`-element sets, with `r ≥ 2`, admits a hitting set of cardinality `r - 1`. -/\ndef Target : Prop :=\n ∀ (α : Type u) (r : ℕ) (F : Set (Set α)),\n 2 ≤ r →\n Set.Infinite F →\n IsUniformFamily r F →\n IsPairwiseIntersecting F →\n ∃ (T : Set α), IsHittingSetOfCard (r - 1) T F\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6a55e983-dc88-57b5-8fa5-150574a0ace3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6a1bcdaa9c2f8e63a394d0002a22591c84b6489cecdbffb784c24260fcf492d9", "task_path": "tasks/nmp3_6a55e983-dc88-57b5-8fa5-150574a0ace3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6a55e983-dc88-57b5-8fa5-150574a0ace3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6a703b69-e4b3-511e-a938-1e66481d2bd3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Three sequences $(a_0,a_1,\\ldots,a_n)$, $(b_0,b_1,\\ldots,b_n)$, $(c_0,c_1,\\ldots,c_{2n})$ of non‑negative real numbers are given such that for all $0\\le i,j\\le n$ we have \n-- $$a_i b_j\\le (c_{i+j})^2.$$ \n-- Prove that \n-- \\[\n-- \\sum_{i=0}^n a_i\\;\\sum_{j=0}^n b_j\\;\\le\\;\\Bigl(\\sum_{k=0}^{2n}c_k\\Bigr)^2.\n-- \\]\nimport Mathlib\n\n/-!\n# Statement of the three-sequence inequality\n\nThis file formalizes the statement of the problem. It deliberately does not\ncontain a proof of the target proposition.\n-/\n\nnamespace Problem\n\n/-- The index `i + j` in the sequence `c`, where `i` and `j` range over\n`0, ..., n`. Since both indices are at most `n`, their sum is at most `2n`,\nso it is a valid index in `Fin (2n+1)`. -/\ndef cIndex {n : ℕ} (i j : Fin (n + 1)) : Fin (2 * n + 1) :=\n ⟨i.val + j.val, by\n have hi : i.val ≤ n := Nat.le_of_lt_succ i.isLt\n have hj : j.val ≤ n := Nat.le_of_lt_succ j.isLt\n omega⟩\n\n/-- The hypotheses of the problem: the three finite sequences have non-negative\nreal entries, and every pairwise product `a_i b_j` is at most `(c_{i+j})^2`. -/\ndef Admissible (n : ℕ)\n (a b : Fin (n + 1) → ℝ) (c : Fin (2 * n + 1) → ℝ) : Prop :=\n (∀ i : Fin (n + 1), 0 ≤ a i) ∧\n (∀ j : Fin (n + 1), 0 ≤ b j) ∧\n (∀ k : Fin (2 * n + 1), 0 ≤ c k) ∧\n (∀ i j : Fin (n + 1),\n a i * b j ≤ (c (cIndex i j)) ^ 2)\n\n/-- The asserted conclusion: the product of the two sums is at most the square\nof the sum of all `c_k`, for `k = 0, ..., 2n`. -/\ndef Conclusion (n : ℕ)\n (a b : Fin (n + 1) → ℝ) (c : Fin (2 * n + 1) → ℝ) : Prop :=\n (∑ i : Fin (n + 1), a i) * (∑ j : Fin (n + 1), b j) ≤\n (∑ k : Fin (2 * n + 1), c k) ^ 2\n\n/-- The full assertion of the problem: for every natural number `n` and all\nnon-negative finite real sequences `a`, `b`, and `c` of the indicated lengths,\nif `a_i b_j ≤ (c_{i+j})^2` for all `0 ≤ i,j ≤ n`, then the displayed sum\ninequality holds. -/\ndef Target : Prop :=\n ∀ (n : ℕ)\n (a b : Fin (n + 1) → ℝ) (c : Fin (2 * n + 1) → ℝ),\n Admissible n a b c → Conclusion n a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6a703b69-e4b3-511e-a938-1e66481d2bd3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "37e253715682a8344797b6b82c0696c577c0a43e1b52615c9379840034a472ee", "task_path": "tasks/nmp3_6a703b69-e4b3-511e-a938-1e66481d2bd3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6a703b69-e4b3-511e-a938-1e66481d2bd3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6b071d55-67b7-55a0-ab25-9fd3c1f60357", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^{2}-2c^{2}}{a^{2}+ab+b^{2}}+\\frac{b^{2}-2a^{2}}{b^{2}+bc+c^{2}}+\\frac{c^{2}-2b^{2}}{c^{2}+ca+a^{2}}+\\frac{ab+bc+ca}{a^{2}+b^{2}+c^{2}}\\le 0.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion that the three real parameters are strictly positive. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- First summand of the left-hand side. -/\nnoncomputable def term1 (a b c : ℝ) : ℝ :=\n (a ^ 2 - 2 * c ^ 2) / (a ^ 2 + a * b + b ^ 2)\n\n/-- Second summand of the left-hand side. -/\nnoncomputable def term2 (a b c : ℝ) : ℝ :=\n (b ^ 2 - 2 * a ^ 2) / (b ^ 2 + b * c + c ^ 2)\n\n/-- Third summand of the left-hand side. -/\nnoncomputable def term3 (a b c : ℝ) : ℝ :=\n (c ^ 2 - 2 * b ^ 2) / (c ^ 2 + c * a + a ^ 2)\n\n/-- Fourth summand of the left-hand side. -/\nnoncomputable def term4 (a b c : ℝ) : ℝ :=\n (a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The complete left-hand side of the claimed inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n term1 a b c + term2 a b c + term3 a b c + term4 a b c\n\n/--\nFor all strictly positive real numbers `a`, `b`, and `c`, the displayed\nrational expression is at most zero.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → LHS a b c ≤ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b071d55-67b7-55a0-ab25-9fd3c1f60357", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a0730247a202195a6081dfd81a047dba0a6dd84986a03eb30a5aa0afe979e881", "task_path": "tasks/nmp3_6b071d55-67b7-55a0-ab25-9fd3c1f60357", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b071d55-67b7-55a0-ab25-9fd3c1f60357", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6b072882-953f-51a4-b1f4-127ecf769bb6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A house contains an even total number of lamps, distributed among its rooms so that each room has at least three lamps. Every lamp is paired with exactly one other lamp by a switch; toggling a switch flips the states of its two lamps simultaneously. Prove that for any initial on/off configuration of the lamps there exists a sequence of switch toggles after which every room contains at least one lamp that is on and at least one lamp that is off.\nimport Mathlib.Data.Fintype.Card\nimport Mathlib.Algebra.Ring.Parity\n\n/-!\n# Formalization of the lamps-and-switches problem\n\nThe house is represented by a finite type `L` of lamps and an arbitrary type `R`\nof rooms. The assignment `room : L → R` says which room each lamp belongs to.\nA switch pairing is represented by a fixed-point-free involution `pair : L → L`;\nthus the two lamps of a switch are mutually paired, and every lamp has exactly\none partner. A switch is represented by an ordered pair of its two endpoints.\n\nA state is a Boolean-valued function on lamps, with `true` meaning \"on\" and\n`false` meaning \"off\". A listed switch flips both of its endpoint lamps.\nToggling a sequence of switches is the finite composition of those flips,\nstarting from the chosen initial state.\n\nThe declaration `Problem.Target` is the proposition asserted by the problem;\nit is intentionally a `Prop`-valued definition and no proof is supplied.\n-/\n\nnoncomputable section\nopen Classical\n\nnamespace Problem\n\nuniverse u v\n\n/-- An on/off state of the lamps of `L`; `true` denotes on and `false` denotes off. -/\nabbrev LampState (L : Type u) : Type u := L → Bool\n\n/-- Flip the two endpoint lamps of a switch, represented by an ordered pair. -/\ndef ToggleSwitch {L : Type u} (sw : L × L) (state : LampState L) : LampState L :=\n fun x : L => if x = sw.1 ∨ x = sw.2 then !state x else state x\n\n/-- Apply a finite sequence of switch toggles, starting from `state`. -/\ndef ToggleSwitches {L : Type u} :\n List (L × L) → LampState L → LampState L\n | [], state => state\n | sw :: rest, state => ToggleSwitches rest (ToggleSwitch sw state)\n\n/-- `sw` is one of the switches specified by the pairing `pair`. -/\ndef IsSwitch {L : Type u} (pair : L → L) (sw : L × L) : Prop :=\n pair sw.1 = sw.2 ∧ pair sw.2 = sw.1\n\n/-- Every switch in the finite sequence is an actual switch of the pairing. -/\ndef UsesOnlySwitches {L : Type u} (pair : L → L) (switches : List (L × L)) : Prop :=\n ∀ sw : L × L, sw ∈ switches → IsSwitch pair sw\n\n/-- Room `r` has at least one on lamp and at least one off lamp in `state`. -/\ndef RoomHasOnAndOff {L : Type u} {R : Type v}\n (room : L → R) (state : LampState L) (r : R) : Prop :=\n (∃ l : L, room l = r ∧ state l = true) ∧\n (∃ l : L, room l = r ∧ state l = false)\n\n/-- Every room has at least one on lamp and at least one off lamp. -/\ndef RoomMixed {L : Type u} {R : Type v}\n (room : L → R) (state : LampState L) : Prop :=\n ∀ r : R, RoomHasOnAndOff room state r\n\n/-- Room `r` contains at least three distinct lamps. -/\ndef RoomHasAtLeastThree {L : Type u} {R : Type v} (room : L → R) (r : R) : Prop :=\n ∃ a b c : L,\n room a = r ∧ room b = r ∧ room c = r ∧\n a ≠ b ∧ a ≠ c ∧ b ≠ c\n\n/-- The total number of lamps in the house is even. -/\ndef HasEvenNumberOfLamps {L : Type u} [Fintype L] : Prop :=\n Even (Fintype.card L)\n\n/-- Every room contains at least three distinct lamps. -/\ndef EveryRoomHasAtLeastThree {L : Type u} {R : Type v} (room : L → R) : Prop :=\n ∀ r : R, RoomHasAtLeastThree room r\n\n/-- `pair` is a fixed-point-free involution, hence a perfect pairing of lamps. -/\ndef IsSwitchPairing {L : Type u} (pair : L → L) : Prop :=\n (∀ l : L, pair (pair l) = l) ∧ (∀ l : L, pair l ≠ l)\n\n/-- The structural hypotheses of the problem instance. -/\ndef ValidHouse {L : Type u} {R : Type v} [Fintype L]\n (room : L → R) (pair : L → L) : Prop :=\n HasEvenNumberOfLamps (L := L) ∧\n EveryRoomHasAtLeastThree room ∧\n IsSwitchPairing pair\n\n/-- The assertion to be proved.\n\nFor every finite house (`L`, `R`, `room`, `pair`) satisfying the hypotheses and\nevery initial on/off configuration, there is a finite sequence of switches such\nthat after toggling that sequence every room has both an on lamp and an off lamp. -/\ndef Target : Prop :=\n ∀ (L : Type u) (R : Type v) [Fintype L],\n ∀ (room : L → R) (pair : L → L),\n ValidHouse room pair →\n ∀ initial : LampState L,\n ∃ switches : List (L × L),\n UsesOnlySwitches pair switches ∧\n RoomMixed room (ToggleSwitches switches initial)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b072882-953f-51a4-b1f4-127ecf769bb6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9d6d9b0108589d32b39548f5a2fb76b1bc82f7fb975b75ce958e01a002be9264", "task_path": "tasks/nmp3_6b072882-953f-51a4-b1f4-127ecf769bb6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b072882-953f-51a4-b1f4-127ecf769bb6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6b07f081-af20-5fb8-a782-4f2bd5a97bc2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:[a,b]\\to[a,b]$ be a continuous function and let $p\\in[a,b]$. Define $p_0=p$ and $p_{n+1}=f(p_n)$ for $n=0,1,2,\\dots$. Suppose the set \n-- $$T_p=\\{p_n:n=0,1,2,\\dots\\}$$ \n-- is closed (i.e. if $x\\notin T_p$ then there exists $\\delta>0$ such that $|x'-x|\\ge\\delta$ for all $x'\\in T_p$). Prove that $T_p$ contains only finitely many elements.\nmodule\n\npublic import Mathlib\n\n/-!\n# Formal statement of the finite orbit problem\n\nThe source problem asks, for a continuous self-map of a closed bounded interval,\nto prove that a closed forward orbit of a point is finite. This file records the\nstatement only; it deliberately contains no proof of the target proposition.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The forward orbit of `p` under `f`: `orbit f p 0 = p` and\n`orbit f p (n + 1) = f (orbit f p n)`. -/\ndef orbit (f : ℝ → ℝ) (p : ℝ) : ℕ → ℝ\n | 0 => p\n | n + 1 => f (orbit f p n)\n\n@[simp] theorem orbit_zero (f : ℝ → ℝ) (p : ℝ) : orbit f p 0 = p := rfl\n\n@[simp] theorem orbit_succ (f : ℝ → ℝ) (p : ℝ) (n : ℕ) :\n orbit f p (n + 1) = f (orbit f p n) := rfl\n\n/-- The set `T_p = {p_n : n = 0, 1, 2, ...}` of all points in the forward orbit. -/\ndef Tp (f : ℝ → ℝ) (p : ℝ) : Set ℝ := Set.range (orbit f p)\n\n/-- The source's explicit separation formulation of closedness for a subset of `ℝ`:\nevery point outside the set has a positive distance from every point of the set. -/\ndef ClosedBySeparation (s : Set ℝ) : Prop :=\n ∀ x : ℝ, x ∉ s → ∃ δ : ℝ, 0 < δ ∧\n ∀ x' : ℝ, x' ∈ s → δ ≤ |x' - x|\n\n/-- The complete assertion of the problem: for every real interval `[a,b]`, every\ncontinuous self-map `f` of that interval, and every `p` in the interval, if the forward\norbit set `T_p` is closed (in the positive-distance formulation stated in the problem),\nthen `T_p` is finite. -/\ndef Target : Prop :=\n ∀ (a b : ℝ) (f : ℝ → ℝ) (p : ℝ),\n Set.MapsTo f (Set.Icc a b) (Set.Icc a b) →\n ContinuousOn f (Set.Icc a b) →\n p ∈ Set.Icc a b →\n ClosedBySeparation (Tp f p) →\n Set.Finite (Tp f p)\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b07f081-af20-5fb8-a782-4f2bd5a97bc2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ff1033a704af4cf0ba8c7c01e03d1c0a0d7e882f8df6f3a73ceb4b7df11dd502", "task_path": "tasks/nmp3_6b07f081-af20-5fb8-a782-4f2bd5a97bc2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b07f081-af20-5fb8-a782-4f2bd5a97bc2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6b10af8e-ab23-5f0b-9e71-5c29333b7218", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb N\\times\\mathbb Z\\to\\mathbb Z$ be defined by \n-- \\[\n-- f(0,0)=5^{2003},\\qquad f(0,n)=0\\ \\text{for all }n\\neq0,\n-- \\] \n-- and for every integer $n$ and every natural $m>0$,\n-- \\[\n-- f(m,n)=f(m-1,n)-2\\Big\\lfloor\\frac{f(m-1,n)}2\\Big\\rfloor\n-- +\\Big\\lfloor\\frac{f(m-1,n-1)}2\\Big\\rfloor\n-- +\\Big\\lfloor\\frac{f(m-1,n+1)}2\\Big\\rfloor,\n-- \\]\n-- where $\\lfloor x\\rfloor$ denotes the integral part of $x$. \n-- Prove that there exists a positive integer $M$ such that \n-- \\[\n-- f(M,n)=1\\quad\\text{for all integers }n\\text{ with }|n|\\le\\frac{5^{2003}-1}2,\n-- \\] \n-- and \n-- \\[\n-- f(M,n)=0\\quad\\text{for all integers }n\\text{ with }|n|>\\frac{5^{2003}-1}2.\n-- \\]\nimport Mathlib.Algebra.Order.Archimedean.Real.Basic\n\n/-!\n# Formal statement of the recursive floor-function problem\n\nThis file formalizes the data and the assertion in `problem.md`. The target is\nstated as a `Prop`-valued definition; no proof of the existence assertion is\nprovided here.\n-/\n\nnamespace Problem\n\n/-- The integer `⌊z / 2⌋`, with the division performed exactly in `ℝ`.\nFor an integer `z`, this is the usual floor of the rational number `z / 2`. -/\nnoncomputable def floorHalf (z : ℤ) : ℤ :=\n Int.floor ((z : ℝ) / 2)\n\n/-- The function `f : ℕ × ℤ → ℤ` defined recursively in the first argument.\nAt level zero it is supported only at `n = 0`, where it equals `5 ^ 2003`.\nAt a positive first argument, the recurrence uses the preceding row. -/\nnoncomputable def f : ℕ → ℤ → ℤ\n | 0, n => if n = 0 then (5 : ℤ) ^ 2003 else 0\n | m + 1, n =>\n f m n - 2 * floorHalf (f m n)\n + floorHalf (f m (n - 1)) + floorHalf (f m (n + 1))\n\n/-- The integer radius `(5 ^ 2003 - 1) / 2`.\n\nThe numerator is even, so the integer quotient is exactly the mathematical\nhalf of `5 ^ 2003 - 1`; no rounding occurs. -/\ndef bound : ℤ := ((5 : ℤ) ^ 2003 - 1) / 2\n\n/-- The assertion to be proved: some positive natural number `M` makes the\n`M`-th row of `f` equal to `1` on `|n| ≤ bound` and equal to `0` on\n`|n| > bound`. -/\ndef Target : Prop :=\n ∃ M : ℕ, 0 < M ∧\n (∀ n : ℤ, |n| ≤ bound → f M n = 1) ∧\n (∀ n : ℤ, bound < |n| → f M n = 0)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b10af8e-ab23-5f0b-9e71-5c29333b7218", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4485d3269f7209ef3b5cdb83cdb3e9e01c11e139b86008450302b0f448fa8231", "task_path": "tasks/nmp3_6b10af8e-ab23-5f0b-9e71-5c29333b7218", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b10af8e-ab23-5f0b-9e71-5c29333b7218", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6b1da361-5272-5e61-9eaa-d374e9e0402e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle $ABC$ (so $a,b,c>0$ and $a+b>c$, $b+c>a$, $c+a>b$). Prove that \n-- \\[\n-- \\frac{1}{(a+b+c)^{2}}+\\frac{1}{(ab+bc+ca)^{2}}\n-- \\;\\ge\\;\n-- \\frac{1}{3\\,(a^{2}b+b^{2}c+c^{2}a)}+\\frac{1}{3\\,(ab^{2}+bc^{2}+ca^{2})}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assumptions in the problem that `a`, `b`, and `c` are the side lengths of\na (nondegenerate) triangle: all three are positive and satisfy the three strict\ntriangle inequalities. -/\ndef TriangleSideConditions (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The numerical inequality asserted in the problem. -/\ndef TriangleInequality (a b c : ℝ) : Prop :=\n 1 / ((a + b + c) ^ 2) + 1 / ((a * b + b * c + c * a) ^ 2) ≥\n 1 / (3 * (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a)) +\n 1 / (3 * (a * b ^ 2 + b * c ^ 2 + c * a ^ 2))\n\n/-- The full proposition to be proved: for every real triple satisfying the\ntriangle side-length conditions, the asserted numerical inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, TriangleSideConditions a b c → TriangleInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b1da361-5272-5e61-9eaa-d374e9e0402e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1c1fc7e3ebd851abf6392d7c82916a8ff11e064cfdad7631b0eb66c45ad02805", "task_path": "tasks/nmp3_6b1da361-5272-5e61-9eaa-d374e9e0402e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b1da361-5272-5e61-9eaa-d374e9e0402e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6b483dff-51f0-53ba-9fa4-89150b40dc99", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The 52 cards of a standard deck (4 suits, each containing the 13 distinct values) are placed in a $13\\times4$ rectangular array (13 columns and 4 rows). Whenever two cells are adjacent horizontally or vertically, the two cards in those cells either have the same suit or have the same value (rank). Prove that for each suit all 13 cards of that suit lie in a single row of the array (i.e., each of the four rows consists entirely of one suit).\nimport Mathlib\n\n/-!\n# Formal statement of the 13 x 4 card-array problem\n\nWe model the standard deck as the product of four suits and thirteen ranks,\nplaced bijectively into four rows and thirteen columns. The target states that\nif every horizontally or vertically adjacent pair of cards shares a suit or a\nrank, then every suit occupies one row and every row consists of one suit.\n-/\n\nnamespace Problem\n\n/-- The four suits of a standard deck. -/\nabbrev Suit : Type := Fin 4\n\n/-- The thirteen distinct ranks (values) in each suit. -/\nabbrev Rank : Type := Fin 13\n\n/-- A card is determined by its suit and its rank. -/\nabbrev Card : Type := Suit × Rank\n\n/-- A row index of the 13 by 4 array. -/\nabbrev Row : Type := Fin 4\n\n/-- A column index of the 13 by 4 array. -/\nabbrev Column : Type := Fin 13\n\n/-- A cell of the 13 by 4 array, indexed first by row and then by column. -/\nabbrev Cell : Type := Row × Column\n\n/-- An arrangement of the deck in the array: every cell contains exactly one\ncard and every card occurs in exactly one cell. -/\nabbrev Arrangement : Type := Cell ≃ Card\n\n/-- Two cards have the same suit. -/\ndef SameSuit (c d : Card) : Prop := c.1 = d.1\n\n/-- Two cards have the same rank (value). -/\ndef SameRank (c d : Card) : Prop := c.2 = d.2\n\n/-- Two cards satisfy the stated compatibility condition: same suit or same\nrank. -/\ndef SameSuitOrRank (c d : Card) : Prop := SameSuit c d ∨ SameRank c d\n\n/-- Two cells are horizontally adjacent when they are in the same row and\ntheir column indices differ by one. -/\ndef HorizontallyAdjacent (p q : Cell) : Prop :=\n p.1 = q.1 ∧ (p.2.val + 1 = q.2.val ∨ q.2.val + 1 = p.2.val)\n\n/-- Two cells are vertically adjacent when they are in the same column and\ntheir row indices differ by one. -/\ndef VerticallyAdjacent (p q : Cell) : Prop :=\n p.2 = q.2 ∧ (p.1.val + 1 = q.1.val ∨ q.1.val + 1 = p.1.val)\n\n/-- Two cells are adjacent horizontally or vertically. -/\ndef Adjacent (p q : Cell) : Prop :=\n HorizontallyAdjacent p q ∨ VerticallyAdjacent p q\n\n/-- The hypothesis that every horizontally or vertically adjacent pair of\ncards has either the same suit or the same rank. -/\ndef AdjacencyHypothesis (a : Arrangement) : Prop :=\n ∀ p q : Cell, Adjacent p q → SameSuitOrRank (a p) (a q)\n\n/-- For every suit, all cards of that suit occupy one common row. -/\ndef SuitCardsOccupySingleRow (a : Arrangement) : Prop :=\n ∀ s : Suit, ∃ r : Row, ∀ p : Cell, (a p).1 = s → p.1 = r\n\n/-- Each of the four rows consists entirely of cards of one suit. -/\ndef EachRowHasSingleSuit (a : Arrangement) : Prop :=\n ∀ r : Row, ∃ s : Suit, ∀ c : Column, (a (r, c)).1 = s\n\n/-- The conclusion stated in the problem, in both of its explicit forms. -/\ndef Conclusion (a : Arrangement) : Prop :=\n SuitCardsOccupySingleRow a ∧ EachRowHasSingleSuit a\n\n/-- The full universal statement to be proved: for every bijective placement\nof the deck in the 13 by 4 array, if all horizontal and vertical neighbors\nshare a suit or a rank, then every suit lies in a single row and every row\nconsists of a single suit. -/\ndef Target : Prop :=\n ∀ a : Arrangement, AdjacencyHypothesis a → Conclusion a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b483dff-51f0-53ba-9fa4-89150b40dc99", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "703b503202946ee0fdb507c7ff97553e84fdd9d3dab41ce9b7a72874d6f9c436", "task_path": "tasks/nmp3_6b483dff-51f0-53ba-9fa4-89150b40dc99", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b483dff-51f0-53ba-9fa4-89150b40dc99", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6b583d1d-de85-571f-aa2a-fe0123a02fd0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- a, b, c > 0 with \\(abc=1\\). Prove that \n-- \\[\n-- ab(a+b)+bc(b+c)+ca(c+a)+9\\ge 5(a+b+c)\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a three-variable inequality\n\nThe problem asks to prove, for positive real numbers `a`, `b`, and `c`\nsatisfying `a * b * c = 1`, that\n\n`a*b*(a+b) + b*c*(b+c) + c*a*(c+a) + 9 ≥ 5*(a+b+c)`.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`\nwith product one, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n a * b * (a + b) + b * c * (b + c) + c * a * (c + a) + 9 ≥\n 5 * (a + b + c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b583d1d-de85-571f-aa2a-fe0123a02fd0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "49ff9732adb3a6ce9f51c508500fbe58c51242819c39d511f7dc42e421012d29", "task_path": "tasks/nmp3_6b583d1d-de85-571f-aa2a-fe0123a02fd0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b583d1d-de85-571f-aa2a-fe0123a02fd0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6b787aeb-7297-5512-ab00-18ada27c3935", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=1$. Prove that \n-- \\[\n-- \\frac{1}{2a+3b+4c}+\\frac{1}{2b+3c+4a}+\\frac{1}{2c+3a+4b}\\le\\frac{1}{\\bigl(\\sqrt{ab}+\\sqrt{bc}+\\sqrt{ca}\\bigr)^{2}}\\,.\n-- \\]\n/-\nFormal statement of the inequality problem.\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, `c`\nwith `a + b + c = 1`, that\n\n 1 / (2a + 3b + 4c) + 1 / (2b + 3c + 4a) + 1 / (2c + 3a + 4b)\n ≤ 1 / ((sqrt (a*b) + sqrt (b*c) + sqrt (c*a)) ^ 2).\n\nThis file records the unproved proposition only.\n-/\n\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\nnamespace Problem\n\n/-- The admissibility condition for the variables of the problem: `a`, `b`, and `c`\nare positive real numbers whose sum is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 1\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n 1 / (2 * a + 3 * b + 4 * c) +\n 1 / (2 * b + 3 * c + 4 * a) +\n 1 / (2 * c + 3 * a + 4 * b)\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n 1 / ((Real.sqrt (a * b) + Real.sqrt (b * c) + Real.sqrt (c * a)) ^ 2)\n\n/-- The proposition asserted by the source problem. -/\nnoncomputable def Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → leftHandSide a b c ≤ rightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b787aeb-7297-5512-ab00-18ada27c3935", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "85bd1bb7c44d65a2143ff6d4f3cd6e7371cc71d2352456529d01b7023d3c6c67", "task_path": "tasks/nmp3_6b787aeb-7297-5512-ab00-18ada27c3935", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b787aeb-7297-5512-ab00-18ada27c3935", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6b7a8035-0402-5f71-9da4-def385ed3f52", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be positive numbers. Prove that \n-- \\[\n-- \\frac{1}{b(a+b)}+\\frac{1}{c(c+b)}+\\frac{1}{a(a+c)}\\ge\\frac{9}{2\\,(ab+bc+ca)}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nThe statement of the problem: for all positive real numbers `a`, `b`, and `c`,\nthe cyclic sum `1 / (b * (a + b)) + 1 / (c * (c + b)) + 1 / (a * (a + c))`\nis at least `9 / (2 * (a * b + b * c + c * a))`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n 1 / (b * (a + b)) + 1 / (c * (c + b)) + 1 / (a * (a + c)) ≥\n 9 / (2 * (a * b + b * c + c * a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b7a8035-0402-5f71-9da4-def385ed3f52", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d4f1e10f3e226e5ba33046e69c4a798da8c2049291bffdc5fae640f0a14e0085", "task_path": "tasks/nmp3_6b7a8035-0402-5f71-9da4-def385ed3f52", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6b7a8035-0402-5f71-9da4-def385ed3f52", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6ba2de8b-9acb-53f8-98d0-0120a1ef2806", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $S$ be a set with $n$ elements and let $A_1,A_2,\\dots,A_n$ be subsets of $S$. Assume that \n-- \n-- 1. for every unordered pair $\\{x,y\\}\\subseteq S$ there is exactly one index $i$ such that $\\{x,y\\}\\subseteq A_i$, and \n-- 2. each $A_i$ contains more than one element (i.e. $|A_i|>1$). \n-- \n-- Prove that for any two distinct indices $i\\neq j$ we have $|A_i\\cap A_j|=1\\,. $\nimport Mathlib\n\n/-!\nFormalization of a finite set-system statement.\n\nThe source problem statement is:\n\nLet `S` be a set with `n` elements and let `A_1, ..., A_n` be subsets of `S`.\nAssume that\n\n1. every unordered pair `{x,y} ⊆ S` is contained in exactly one `A_i`, and\n2. every `A_i` has more than one element.\n\nProve that `|A_i ∩ A_j| = 1` for all distinct indices `i` and `j`.\n\nThe declarations below only state the target proposition; no proof is supplied.\n-/\n\nuniverse u\n\nnamespace Problem\n\nvariable {α : Type u}\n\n/-- The indexed family `A` consists of subsets of `S`. -/\ndef IsSubsetFamily (S : Set α) {n : ℕ} (A : Fin n → Set α) : Prop :=\n ∀ i : Fin n, A i ⊆ S\n\n/--\nEvery two-element subset of `S` lies in exactly one member of the family `A`.\n\nThe source speaks of unordered pairs `{x,y}`. This is represented by\nquantifying over ordered pairs `x y` with `x ∈ S`, `y ∈ S`, and `x ≠ y`;\nthe condition `x ∈ A i ∧ y ∈ A i` is symmetric, so the order of `x` and\n`y` does not affect the assertion.\n-/\ndef PairCoveringUnique (S : Set α) {n : ℕ} (A : Fin n → Set α) : Prop :=\n ∀ x : α, x ∈ S → ∀ y : α, y ∈ S → x ≠ y →\n ∃! i : Fin n, x ∈ A i ∧ y ∈ A i\n\n/-- Every member of the family has cardinality greater than one. -/\ndef EachMoreThanOne {n : ℕ} (A : Fin n → Set α) : Prop :=\n ∀ i : Fin n, 1 < (A i).ncard\n\n/-- Every two members with distinct indices have an intersection of cardinality one. -/\ndef PairwiseIntersectionSingleton {n : ℕ} (A : Fin n → Set α) : Prop :=\n ∀ i j : Fin n, i ≠ j → (A i ∩ A j).ncard = 1\n\n/--\nThe full target assertion.\n\nFor every ambient type `α`, natural number `n`, finite set `S : Set α` of\ncardinality `n`, and indexed family `A : Fin n → Set α` of subsets of `S`,\nif every two-element subset of `S` is covered by exactly one member of the\nfamily and every member has more than one element, then the intersection of\nany two distinct members has exactly one element.\n\nThe index set `Fin n` is the standard Lean replacement for the source indices\n`1, 2, ..., n` (reindexed as `0, 1, ..., n-1`).\n-/\ndef Target : Prop :=\n ∀ (α : Type u) (n : ℕ) (S : Set α) (A : Fin n → Set α),\n S.Finite →\n S.ncard = n →\n IsSubsetFamily (α := α) S A →\n PairCoveringUnique (α := α) S A →\n EachMoreThanOne (α := α) A →\n PairwiseIntersectionSingleton (α := α) A\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6ba2de8b-9acb-53f8-98d0-0120a1ef2806", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "502fac96abd02fbdd83038aa67bd577faadc4ed3c884714206c8639ad60aed25", "task_path": "tasks/nmp3_6ba2de8b-9acb-53f8-98d0-0120a1ef2806", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6ba2de8b-9acb-53f8-98d0-0120a1ef2806", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6baef8a7-8a55-5553-95c6-634c302a2c72", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A set of three nonnegative integers $\\{x,y,z\\}$ with $x0$ with $x+y+z=3$. Prove that \n-- \\[\n-- \\frac{x^3}{\\,y^3+8\\,}+\\frac{y^3}{\\,z^3+8\\,}+\\frac{z^3}{\\,x^3+8\\,}\\ge\\frac19+\\frac{2}{27}\\,(xy+yz+zx).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility hypotheses of the problem: `x`, `y`, and `z` are positive\nreal numbers whose sum is `3`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = 3\n\n/-- The cyclic inequality asserted in the problem, for fixed positive reals\n`x`, `y`, and `z`. -/\ndef Inequality (x y z : ℝ) : Prop :=\n x ^ 3 / (y ^ 3 + 8) + y ^ 3 / (z ^ 3 + 8) + z ^ 3 / (x ^ 3 + 8) ≥\n (1 : ℝ) / 9 + ((2 : ℝ) / 27) * (x * y + y * z + z * x)\n\n/-- The complete statement to be proved: for all positive real numbers\n`x`, `y`, and `z` satisfying `x + y + z = 3`, the cyclic inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6bba8ac8-fdcc-5c3b-a946-39329941dd23", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f0fd438cf773e1aac03cebc0809cb751eed83128411dd22b466cc08d653797bc", "task_path": "tasks/nmp3_6bba8ac8-fdcc-5c3b-a946-39329941dd23", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6bba8ac8-fdcc-5c3b-a946-39329941dd23", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6bbbbfe0-c5b0-56d0-b57a-4c3c240541e9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every prime number $p$, the integer \n-- $$p^{\\,p+1}+(p+1)^p$$ \n-- is never a perfect square.\n/-\nFormal statement for the problem:\n\nProve that for every prime number `p`, the integer\n`p ^ (p + 1) + (p + 1) ^ p` is never a perfect square.\n\nThis file only states the assertion; it contains no proof.\n-/\n\nimport Mathlib.Data.Int.Basic\nimport Mathlib.Data.Nat.Prime.Basic\n\nnamespace Problem\n\n/-- The integer appearing in the problem, for a natural-number parameter `p`:\n`p ^ (p + 1) + (p + 1) ^ p`, with the arithmetic performed in `ℤ`. -/\ndef expression (p : ℕ) : ℤ :=\n (p : ℤ) ^ (p + 1) + ((p : ℤ) + 1) ^ p\n\n/-- An integer is a perfect square when it is the square of an integer. -/\ndef IsPerfectSquare (z : ℤ) : Prop :=\n ∃ n : ℤ, z = n ^ 2\n\n/-- For every prime number `p`, `p ^ (p + 1) + (p + 1) ^ p` is not a perfect\nsquare. Prime numbers are represented by natural numbers via `Nat.Prime`. -/\ndef Target : Prop :=\n ∀ p : ℕ, Nat.Prime p → ¬ IsPerfectSquare (expression p)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6bbbbfe0-c5b0-56d0-b57a-4c3c240541e9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cbbaddf4689572ac8d7f15eb96a34856796855f30a90b91ee084a2c2351324ef", "task_path": "tasks/nmp3_6bbbbfe0-c5b0-56d0-b57a-4c3c240541e9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6bbbbfe0-c5b0-56d0-b57a-4c3c240541e9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6bda9159-8b33-5f7f-9a4a-0648a4bc6956", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ with $xyz=1$. Prove \n-- \\[\n-- \\frac{1}{\\sqrt{(1+y)(1+z)}}+\\frac{1}{\\sqrt{(1+z)(1+x)}}+\\frac{1}{\\sqrt{(1+x)(1+y)}}\\le\\frac32\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic square-root inequality\n\nThe source problem asks to prove, for positive real numbers `x`, `y`, `z`\nwith `x * y * z = 1`, that\n\n`1 / sqrt ((1 + y) * (1 + z)) +\n 1 / sqrt ((1 + z) * (1 + x)) +\n 1 / sqrt ((1 + x) * (1 + y)) ≤ 3 / 2`.\n\nThis file records the statement as a proposition; it does not supply a proof.\n-/\n\nnamespace Problem\n\n/-- The three-term left-hand side of the asserted inequality. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n 1 / Real.sqrt ((1 + y) * (1 + z)) +\n 1 / Real.sqrt ((1 + z) * (1 + x)) +\n 1 / Real.sqrt ((1 + x) * (1 + y))\n\n/-- The admissibility conditions imposed on `x`, `y`, and `z` by the problem. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x * y * z = 1\n\n/-- The assertion to be proved: for all positive reals whose product is one,\nthe cyclic square-root sum is at most `3 / 2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → lhs x y z ≤ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6bda9159-8b33-5f7f-9a4a-0648a4bc6956", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "82b511ce6f8416d8e2244208d24b811a4f6fa6ee78f6c13bbbd4c72a7e8928a7", "task_path": "tasks/nmp3_6bda9159-8b33-5f7f-9a4a-0648a4bc6956", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6bda9159-8b33-5f7f-9a4a-0648a4bc6956", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6c359d5c-ace4-50ff-a0f3-8c231e92fcfc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x_1,\\dots,x_n$ be $n>1$ real numbers satisfying \n-- \\[\n-- A=\\Bigl|\\sum_{i=1}^n x_i\\Bigr|\\neq0,\\qquad \n-- B=\\max_{1\\le i 1` real numbers `x_i` and `n` vectors\n`α_i` in the Euclidean plane. We encode the plane as `EuclideanSpace ℝ (Fin 2)`.\nThe finite maximum in the definition of `B` and in `max_i ‖α_i‖` is represented\nas the supremum of the corresponding finite (and, under the hypotheses,\nnonempty) set of real numbers. For finite nonempty sets this is exactly the\nmaximum in the source statement.\n-/\n\nnoncomputable section\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real inner-product space of\ndimension two. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The quantity `A = |∑_{i=1}^n x_i|` from the problem. -/\ndef AValue {n : ℕ} (x : Fin n → ℝ) : ℝ :=\n |∑ i : Fin n, x i|\n\n/-- The quantity `B = max_{1 ≤ i < j ≤ n} |x_j - x_i|` from the problem,\nwritten as the supremum of the finite set of all indexed pairwise distances. -/\ndef BValue {n : ℕ} (x : Fin n → ℝ) : ℝ :=\n sSup {r : ℝ | ∃ i j : Fin n, i < j ∧ r = |x j - x i|}\n\n/-- The maximum `max_{1 ≤ i ≤ n} ‖α_i‖` of the norms of the plane vectors. -/\ndef maxNorm {n : ℕ} (α : Fin n → Plane) : ℝ :=\n sSup (Set.range fun i : Fin n => ‖α i‖)\n\n/-- The assertion stated in the problem: for every integer `n > 1`, every\nfamily of `n` reals with `A ≠ 0` and `B ≠ 0`, and every family of `n` plane\nvectors, there is a permutation of the indices for which the displayed norm\ninequality holds. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (_hn : 1 < n) (x : Fin n → ℝ),\n AValue x ≠ 0 →\n BValue x ≠ 0 →\n ∀ α : Fin n → Plane,\n ∃ k : Equiv.Perm (Fin n),\n ‖∑ i : Fin n, x (k i) • α i‖ ≥\n AValue x * BValue x / (2 * AValue x + BValue x) * maxNorm α\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c359d5c-ace4-50ff-a0f3-8c231e92fcfc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9a57fa601851e53906a857157384deef2f73cacd3680ea6ac38679dc2e1b8c0f", "task_path": "tasks/nmp3_6c359d5c-ace4-50ff-a0f3-8c231e92fcfc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c359d5c-ace4-50ff-a0f3-8c231e92fcfc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6c469903-f943-5ebb-9faf-9cd901da65bc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^{2}+b^{2}+c^{2}+abc=4$. Prove that \n-- $$ab+bc+ca\\le abc+2\\,.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- Admissibility conditions for the variables in the problem: `a`, `b`, and `c`\nare positive real numbers satisfying\n`a^2 + b^2 + c^2 + a * b * c = 4`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 2 + b ^ 2 + c ^ 2 + a * b * c = 4\n\n/-- The desired conclusion of the inequality. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n a * b + b * c + c * a ≤ a * b * c + 2\n\n/-- The full assertion to be proved: for all positive real numbers `a`, `b`, and\n`c` satisfying `a^2 + b^2 + c^2 + a * b * c = 4`, one has\n`a * b + b * c + c * a ≤ a * b * c + 2`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c469903-f943-5ebb-9faf-9cd901da65bc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8c9e657809ce9b7858987fc06b653d8d3b3a6f95d54b680227cc035ad2ec7e07", "task_path": "tasks/nmp3_6c469903-f943-5ebb-9faf-9cd901da65bc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c469903-f943-5ebb-9faf-9cd901da65bc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6c4b1480-1c73-5b56-bc44-6caf38ae6135", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The real numbers $a,b,c,d$ satisfy $a\\ge b\\ge c\\ge d>0$ and $a+b+c+d=1$. Prove that \n-- \\[\n-- (a+2b+3c+4d)\\,a^{a}b^{b}c^{c}d^{d}<1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe problem asks for a proof of a strict inequality for all quadruples of real\nnumbers satisfying the stated ordering, positivity, and normalization\nconditions. The real power `x ^ x` is represented by `Real.rpow x x`; the\nadmissibility hypotheses ensure that all bases are positive.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The ordering and positivity clause `a ≥ b ≥ c ≥ d > 0`. -/\ndef OrderedPositive (a b c d : ℝ) : Prop :=\n a ≥ b ∧ b ≥ c ∧ c ≥ d ∧ 0 < d\n\n/-- The normalization clause `a + b + c + d = 1`. -/\ndef SumEqOne (a b c d : ℝ) : Prop :=\n a + b + c + d = 1\n\n/-- The hypotheses of the problem: `a ≥ b ≥ c ≥ d > 0` and the sum is `1`. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n OrderedPositive a b c d ∧ SumEqOne a b c d\n\n/-- The left-hand side\n`(a + 2b + 3c + 4d) a^a b^b c^c d^d`, with real exponentiation. -/\ndef LeftHandSide (a b c d : ℝ) : ℝ :=\n (a + 2 * b + 3 * c + 4 * d) * Real.rpow a a * Real.rpow b b *\n Real.rpow c c * Real.rpow d d\n\n/-- The strict inequality asserted by the problem. -/\ndef Inequality (a b c d : ℝ) : Prop :=\n LeftHandSide a b c d < 1\n\n/-- The full universally quantified statement of the problem. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Inequality a b c d\n\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c4b1480-1c73-5b56-bc44-6caf38ae6135", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3f84ecc17b96b0dcda8096f9d9048b7b08af8702db3faf5fd8b52ae0df627c46", "task_path": "tasks/nmp3_6c4b1480-1c73-5b56-bc44-6caf38ae6135", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c4b1480-1c73-5b56-bc44-6caf38ae6135", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6c68aa31-7ed6-5e1a-a2fc-d2cd65119e00", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c>0$, prove that \n-- \\[\n-- \\frac{1}{a\\sqrt{8a+b}}+\\frac{1}{b\\sqrt{8b+c}}+\\frac{1}{c\\sqrt{8c+a}}\\ge \\frac{1}{\\sqrt{abc}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable square-root inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\n\n`1 / (a * sqrt (8*a + b)) + 1 / (b * sqrt (8*b + c)) + 1 / (c * sqrt (8*c + a)) ≥ 1 / sqrt (a*b*c)`.\n\nThe statement is represented as a closed proposition. No proof is supplied here.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / (a * Real.sqrt (8 * a + b)) +\n 1 / (b * Real.sqrt (8 * b + c)) +\n 1 / (c * Real.sqrt (8 * c + a))\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 1 / Real.sqrt (a * b * c)\n\n/--\nThe complete formal assertion: for all real numbers `a`, `b`, and `c` that are\nstrictly positive, the left-hand side is at least the right-hand side.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c68aa31-7ed6-5e1a-a2fc-d2cd65119e00", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3b8890bc15da8f8cd26017935b4cbaf9d054403c866d033b46ea613a2c30cd22", "task_path": "tasks/nmp3_6c68aa31-7ed6-5e1a-a2fc-d2cd65119e00", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c68aa31-7ed6-5e1a-a2fc-d2cd65119e00", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6c7fee3c-3ecd-5ca3-a38d-d850a6d33206", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are positive real numbers, prove that \n-- \\[\n-- \\frac{a^{2}}{a+b}+\\frac{b^{2}}{b+c}+\\frac{c^{2}}{c+a}\\le \\frac{3\\,(a^{2}+b^{2}+c^{2})}{2\\,(a+b+c)}\\;.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The assertion that for all positive real numbers `a`, `b`, and `c`, the stated\ninequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n a ^ 2 / (a + b) + b ^ 2 / (b + c) + c ^ 2 / (c + a) ≤\n 3 * (a ^ 2 + b ^ 2 + c ^ 2) / (2 * (a + b + c))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c7fee3c-3ecd-5ca3-a38d-d850a6d33206", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "153df23f05fcb746263769fe46bae304ec328ad093d198482370ff445413e397", "task_path": "tasks/nmp3_6c7fee3c-3ecd-5ca3-a38d-d850a6d33206", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c7fee3c-3ecd-5ca3-a38d-d850a6d33206", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6c843eb6-bea7-5865-9a51-c41d3706273b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let Δ be a parabola with focus H. Suppose points A, B, C lie on Δ such that the orthocenter of triangle ABC coincides with H. Prove that, as A, B, C vary on Δ while keeping H as the orthocenter, the inradius of triangle ABC remains constant (i.e., does not depend on the choice of A, B, C).\nimport Mathlib\n\n/-!\n# Formalization of the parabola inradius problem\n\nWe work in the Euclidean plane represented by Cartesian coordinates. A\nparabola is represented by its focus and its directrix through the usual\nfocus-directrix distance characterization. The triangle inradius is encoded\nby the standard formula `area / semiperimeter`, equivalently\n`|twiceSignedArea| / perimeter`.\n-/\n\nnamespace Problem\n\n/-- A point of the Euclidean plane with Cartesian coordinates. -/\nstructure Point where\n x : ℝ\n y : ℝ\n\n/-- The Euclidean dot product of two plane vectors. -/\ndef dot (P Q : Point) : ℝ := P.x * Q.x + P.y * Q.y\n\n/-- Vector subtraction in coordinates. -/\ndef vsub (P Q : Point) : Point := ⟨P.x - Q.x, P.y - Q.y⟩\n\n/-- Euclidean distance between two plane points. -/\nnoncomputable def euclideanDistance (P Q : Point) : ℝ :=\n Real.sqrt ((P.x - Q.x) ^ 2 + (P.y - Q.y) ^ 2)\n\n/-- Twice the signed area of the oriented triangle `ABC`. -/\ndef twiceSignedArea (A B C : Point) : ℝ :=\n (B.x - A.x) * (C.y - A.y) - (B.y - A.y) * (C.x - A.x)\n\n/-- The triangle with vertices `A`, `B`, `C` is nondegenerate, i.e. its\nvertices are not collinear. This also entails that they are distinct. -/\ndef NondegenerateTriangle (A B C : Point) : Prop :=\n twiceSignedArea A B C ≠ 0\n\n/-- A point `H` is the orthocenter of triangle `ABC` when it lies on all\nthe three altitudes: `AH ⟂ BC`, `BH ⟂ CA`, and `CH ⟂ AB`. -/\ndef IsOrthocenter (A B C H : Point) : Prop :=\n dot (vsub H A) (vsub B C) = 0 ∧\n dot (vsub H B) (vsub C A) = 0 ∧\n dot (vsub H C) (vsub A B) = 0\n\n/-- The inradius of triangle `ABC`, written using the standard identity\n`r = 2 * area / perimeter = |twiceSignedArea| / perimeter`. -/\nnoncomputable def inradius (A B C : Point) : ℝ :=\n |twiceSignedArea A B C| /\n (euclideanDistance A B + euclideanDistance B C + euclideanDistance C A)\n\n/-- The set whose points are at equal distance from the focus `H` and the\ndirectrix `{X | dot n X = c}`. Here `n` is a nonzero normal vector of the\ndirectrix. -/\ndef ParabolaLocus (H n : Point) (c : ℝ) : Set Point :=\n {X : Point |\n euclideanDistance X H = |dot n X - c| / Real.sqrt (dot n n)}\n\n/-- `Δ` is a Euclidean parabola with focus `H`, expressed through the\nfocus-directrix characterization. The focus is required not to lie on the\ndirectrix, as is standard for a nondegenerate parabola. -/\ndef IsParabolaWithFocus (Δ : Set Point) (H : Point) : Prop :=\n ∃ (n : Point) (c : ℝ),\n n ≠ ⟨0, 0⟩ ∧ dot n H ≠ c ∧ Δ = ParabolaLocus H n c\n\n/-- A triangle is admissible for the problem when its vertices lie on the\nparabola and its orthocenter is exactly the focus `H`. -/\ndef AdmissibleTriangle (Δ : Set Point) (H A B C : Point) : Prop :=\n A ∈ Δ ∧ B ∈ Δ ∧ C ∈ Δ ∧\n NondegenerateTriangle A B C ∧ IsOrthocenter A B C H\n\n/-- Pairwise independence of the inradius over all admissible triangles on a\nfixed parabola. Two arbitrary admissible triangles have the same inradius. -/\ndef InradiusConstantOnParabola (Δ : Set Point) (H : Point) : Prop :=\n ∀ A B C A' B' C' : Point,\n AdmissibleTriangle Δ H A B C →\n AdmissibleTriangle Δ H A' B' C' →\n inradius A B C = inradius A' B' C'\n\n/-- The assertion of the problem: for every parabola and every two triangles\nwhose vertices lie on it and whose orthocenter is the focus, the inradii of\nthe triangles are equal. This is the precise \"does not depend on the choice\nof `A`, `B`, `C`\" conclusion. -/\ndef Target : Prop :=\n ∀ (Δ : Set Point) (H : Point),\n IsParabolaWithFocus Δ H →\n InradiusConstantOnParabola Δ H\n\nend Problem\n\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c843eb6-bea7-5865-9a51-c41d3706273b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3c93649d0369e3e53dcbf3568623d41d96afc7939437f478feb3423c13b52437", "task_path": "tasks/nmp3_6c843eb6-bea7-5865-9a51-c41d3706273b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c843eb6-bea7-5865-9a51-c41d3706273b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6c9cbd6c-54b1-5735-ab6e-17abe19cae24", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute triangle with side lengths $a,b,c$. Denote by $m_a,m_b,m_c$ the lengths of the medians from $A,B,C$ respectively, where \n-- $$m_a=\\frac12\\sqrt{2(b^2+c^2)-a^2},\\qquad \n-- m_b=\\frac12\\sqrt{2(c^2+a^2)-b^2},\\qquad \n-- m_c=\\frac12\\sqrt{2(a^2+b^2)-c^2}.$$ \n-- Prove that \n-- \\[\n-- \\frac{ab}{m_a^2}+\\frac{bc}{m_b^2}+\\frac{ca}{m_c^2}\\ge 4.\n-- \\]\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Simplex\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane in which the triangle `ABC` is represented. -/\nabbrev EuclideanPlane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The vertex `A` of a vertex-indexed triangle. -/\ndef vertexA (T : Affine.Triangle ℝ EuclideanPlane) : EuclideanPlane :=\n T.points 0\n\n/-- The vertex `B` of a vertex-indexed triangle. -/\ndef vertexB (T : Affine.Triangle ℝ EuclideanPlane) : EuclideanPlane :=\n T.points 1\n\n/-- The vertex `C` of a vertex-indexed triangle. -/\ndef vertexC (T : Affine.Triangle ℝ EuclideanPlane) : EuclideanPlane :=\n T.points 2\n\n/-- The triangle is acute when its three interior angles at `A`, `B`, and `C`\nare strictly less than a right angle. -/\ndef IsAcuteTriangle (T : Affine.Triangle ℝ EuclideanPlane) : Prop :=\n EuclideanGeometry.angle (vertexB T) (vertexA T) (vertexC T) < Real.pi / 2 ∧\n EuclideanGeometry.angle (vertexC T) (vertexB T) (vertexA T) < Real.pi / 2 ∧\n EuclideanGeometry.angle (vertexA T) (vertexC T) (vertexB T) < Real.pi / 2\n\n/-- The length `a`, opposite vertex `A`: the distance from `B` to `C`. -/\ndef sideLengthA (T : Affine.Triangle ℝ EuclideanPlane) : ℝ :=\n dist (vertexB T) (vertexC T)\n\n/-- The length `b`, opposite vertex `B`: the distance from `C` to `A`. -/\ndef sideLengthB (T : Affine.Triangle ℝ EuclideanPlane) : ℝ :=\n dist (vertexC T) (vertexA T)\n\n/-- The length `c`, opposite vertex `C`: the distance from `A` to `B`. -/\ndef sideLengthC (T : Affine.Triangle ℝ EuclideanPlane) : ℝ :=\n dist (vertexA T) (vertexB T)\n\n/-- The median length `m_a`, as specified in the problem. -/\ndef medianA (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * (b ^ 2 + c ^ 2) - a ^ 2)\n\n/-- The median length `m_b`, as specified in the problem. -/\ndef medianB (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * (c ^ 2 + a ^ 2) - b ^ 2)\n\n/-- The median length `m_c`, as specified in the problem. -/\ndef medianC (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * (a ^ 2 + b ^ 2) - c ^ 2)\n\n/-- The left-hand side of the asserted inequality. -/\ndef inequalityLHS (a b c : ℝ) : ℝ :=\n a * b / (medianA a b c) ^ 2 +\n b * c / (medianB a b c) ^ 2 +\n c * a / (medianC a b c) ^ 2\n\n/-- The non-strict inequality asserted for a side-length triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n inequalityLHS a b c ≥ 4\n\n/-- The displayed inequality for a particular triangle, with `a = |BC|`,\n`b = |CA|`, and `c = |AB|`. -/\ndef TriangleInequality (T : Affine.Triangle ℝ EuclideanPlane) : Prop :=\n let a : ℝ := sideLengthA T\n let b : ℝ := sideLengthB T\n let c : ℝ := sideLengthC T\n Inequality a b c\n\n/-- The full formal statement: every acute planar triangle satisfies the\ndisplayed inequality for its usual side lengths. -/\ndef Target : Prop :=\n ∀ T : Affine.Triangle ℝ EuclideanPlane,\n IsAcuteTriangle T → TriangleInequality T\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c9cbd6c-54b1-5735-ab6e-17abe19cae24", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2250cbc0c69f61616feece861da6c7a5f06588454f44974d971a59b907cd7a52", "task_path": "tasks/nmp3_6c9cbd6c-54b1-5735-ab6e-17abe19cae24", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6c9cbd6c-54b1-5735-ab6e-17abe19cae24", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6cbd63dd-dd22-5417-80d4-b237572f7dcc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- $$\\sqrt{\\frac{(a+b)(b+c)(c+a)}{8abc}}\\;\\ge\\;1+\\frac35\\Bigl(1-\\sqrt{\\frac{ab+bc+ca}{a^2+b^2+c^2}}\\Bigr).$$\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality\n\nThe problem asks to prove an inequality for positive real numbers `a`, `b`, and `c`.\nThe declarations below only state the target; they do not contain a proof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the displayed inequality. -/\ndef LHS (a b c : ℝ) : ℝ :=\n Real.sqrt (((a + b) * (b + c) * (c + a)) / (8 * a * b * c))\n\n/-- The right-hand side of the displayed inequality. -/\ndef RHS (a b c : ℝ) : ℝ :=\n 1 + (3 / 5 : ℝ) *\n (1 - Real.sqrt ((a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2)))\n\n/-- The displayed inequality, before imposing the positivity assumptions on `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n Problem.LHS a b c ≥ Problem.RHS a b c\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the displayed square-root\ninequality holds.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Problem.Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6cbd63dd-dd22-5417-80d4-b237572f7dcc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1db36b8da0f256d60058a60676dc7929303555755d70e1684f780e7a9c7f571f", "task_path": "tasks/nmp3_6cbd63dd-dd22-5417-80d4-b237572f7dcc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6cbd63dd-dd22-5417-80d4-b237572f7dcc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6cd33590-d392-543c-84bc-5421633895ef", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be non‑negative real numbers. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}} (23a-5b-c)\\,(a-b)^{2}\\,(a+b-3c)^{2}\\ge 0.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\nFormalization of the cyclic polynomial inequality from `problem.md`.\nThe statement is recorded as an unproved proposition.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum\n`Σ_cyc (23a - 5b - c) (a - b)^2 (a + b - 3c)^2`,\nexpanded over the three cyclic permutations `(a,b,c)`, `(b,c,a)`, `(c,a,b)`. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n (23 * a - 5 * b - c) * (a - b) ^ 2 * (a + b - 3 * c) ^ 2 +\n (23 * b - 5 * c - a) * (b - c) ^ 2 * (b + c - 3 * a) ^ 2 +\n (23 * c - 5 * a - b) * (c - a) ^ 2 * (c + a - 3 * b) ^ 2\n\n/-- For all non-negative real numbers `a`, `b`, and `c`, the cyclic sum above is\nnon-negative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → 0 ≤ cyclicSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6cd33590-d392-543c-84bc-5421633895ef", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bb7b611494026959ecef59c625147cd4f5519bbf87fbab844e6c98deed4573b2", "task_path": "tasks/nmp3_6cd33590-d392-543c-84bc-5421633895ef", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6cd33590-d392-543c-84bc-5421633895ef", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6cf1a9ce-803a-5012-86aa-9cb6121e1ea7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exists a positive integer which can be written as a three‑digit palindrome in base $b$ for at least $2002$ different values of $b$ (a three‑digit palindrome in base $b$ means an integer of the form $d\\,b^2+e\\,b+d$ with $0\\le d,e0$).\nimport Mathlib\n\n/-!\n# Three-digit palindromes in many bases\n\nThis file formalizes the statement of the problem, without providing a proof.\n-/\n\nnamespace Problem\n\n/--\n`n` can be written as a three-digit palindrome in base `b`, i.e. as\n`d * b ^ 2 + e * b + d` for digits `d` and `e`, where `d` is the nonzero\nleading/trailing digit and both digits are less than the base.\n-/\ndef IsThreeDigitPalindromeInBase (n b : ℕ) : Prop :=\n ∃ d e : ℕ,\n 0 < d ∧ d < b ∧ e < b ∧\n n = d * b ^ 2 + e * b + d\n\n/-- The bases in which `n` has a three-digit palindromic expansion. -/\ndef ThreeDigitPalindromeBases (n : ℕ) : Set ℕ :=\n {b : ℕ | IsThreeDigitPalindromeInBase n b}\n\n/-- `n` has three-digit palindromic expansions in at least `k` distinct bases. -/\ndef HasAtLeastNDistinctPalindromeBases (n k : ℕ) : Prop :=\n ∃ bases : Finset ℕ,\n k ≤ bases.card ∧\n ∀ b : ℕ, b ∈ bases → b ∈ ThreeDigitPalindromeBases n\n\n/--\nThere exists a positive integer that is a three-digit palindrome in at least\n`2002` distinct bases.\n-/\ndef Target : Prop :=\n ∃ n : ℕ, 0 < n ∧ HasAtLeastNDistinctPalindromeBases n 2002\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6cf1a9ce-803a-5012-86aa-9cb6121e1ea7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "360ee67894a67a96221f67d27da5e3d3139e347bdb08b63e0543fd6fd5000510", "task_path": "tasks/nmp3_6cf1a9ce-803a-5012-86aa-9cb6121e1ea7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6cf1a9ce-803a-5012-86aa-9cb6121e1ea7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6d009760-0a73-5c24-8e9a-e26f2d5bee94", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $(a+b)(b+c)(c+a)>0$. Prove that \n-- \\[\n-- \\frac{ab}{(a+b)^2}+\\frac{bc}{(b+c)^2}+\\frac{ca}{(c+a)^2}+\\frac54\\ge\\frac{6(ab+bc+ca)}{(a+b+c)^2}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of a nonnegative-variable inequality\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, and `c`\nwhose pairwise sums have positive product, the inequality\n\n`ab/(a+b)^2 + bc/(b+c)^2 + ca/(c+a)^2 + 5/4\n ≥ 6(ab+bc+ca)/(a+b+c)^2`.\n\nThis file only records the proposition to be proved; it contains no proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypotheses on the three variables.\n\nThe product hypothesis is kept in exactly the multiplicative form used in the\nsource problem rather than being replaced by its consequences for pairwise sums. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ (a + b) * (b + c) * (c + a) > 0\n\n/-- The inequality asserted in the source problem, for arbitrary real `a`, `b`,\nand `c`. Division is ordinary division in `ℝ`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (a * b) / (a + b) ^ 2 +\n (b * c) / (b + c) ^ 2 +\n (c * a) / (c + a) ^ 2 +\n (5 : ℝ) / 4 ≥\n (6 * (a * b + b * c + c * a)) / (a + b + c) ^ 2\n\n/-- The full universally quantified proposition asserted by the problem:\nfor every triple of nonnegative real numbers satisfying the stated product\ncondition, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6d009760-0a73-5c24-8e9a-e26f2d5bee94", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3ad538187b95c4df51616f2e86ab5627b423ebf35db3d4073dce519551b06b9c", "task_path": "tasks/nmp3_6d009760-0a73-5c24-8e9a-e26f2d5bee94", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6d009760-0a73-5c24-8e9a-e26f2d5bee94", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6d01c1d6-ff93-5553-b069-cfe0fdb6ec80", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exists a constant \\(c>0\\) such that for any positive integers \\(a,b,n\\) satisfying \n-- \\[\n-- \\gcd(a+i,\\;b+j)>1\\qquad\\text{for all }0\\le i,j\\le n,\n-- \\]\n-- one has \n-- \\[\n-- \\min\\{a,b\\}>c^{\\,n}\\,n^{\\,n/2}\\,. \n-- \\] \n-- (In other words, the condition that every pair \\((a+i,b+j)\\) shares a non‑trivial common divisor forces the smaller of \\(a\\) and \\(b\\) to grow at least like a constant to the \\(n\\)‑th power times \\(n^{n/2}\\).)\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\nimport Mathlib.Data.Nat.GCD.Basic\n\n/-!\nFormalization of the statement from `problem.md`.\n\nThe statement asserts the existence of a positive real constant `c` such that,\nfor every triple of positive natural numbers `a`, `b`, `n`, if every pair\n`(a + i, b + j)` with `0 ≤ i, j ≤ n` has gcd greater than one, then the\nsmaller of `a` and `b` is strictly larger than `c ^ n * n ^ (n / 2)`.\n-/\n\nnamespace Problem\n\n/-- The hypothesis that every pair `(a + i, b + j)` with `0 ≤ i, j ≤ n`\nhas a nontrivial common divisor. -/\ndef PairwiseGCDCondition (a b n : ℕ) : Prop :=\n ∀ (i j : ℕ), i ≤ n → j ≤ n → Nat.gcd (a + i) (b + j) > 1\n\n/-- The admissibility condition on the three positive integers `a`, `b`, `n`\nfrom the problem. -/\ndef Admissible (a b n : ℕ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < n ∧ PairwiseGCDCondition a b n\n\nnoncomputable section\n\n/-- The real-valued factor `n ^ (n / 2)`, using the real power for the\ngenerally non-integer exponent `n / 2`. -/\ndef AsymptoticFactor (n : ℕ) : ℝ :=\n Real.rpow (n : ℝ) ((n : ℝ) / 2)\n\n/-- The asserted lower bound for a fixed constant `c` and triple `(a, b, n)`. -/\ndef BoundHolds (c : ℝ) (a b n : ℕ) : Prop :=\n ((min a b : ℕ) : ℝ) > c ^ n * AsymptoticFactor n\n\n/-- The full mathematical assertion: there is a positive real constant `c`\nsuch that the stated lower bound holds for every admissible positive integer\ntriple `(a, b, n)`. -/\ndef Target : Prop :=\n ∃ c : ℝ, 0 < c ∧\n ∀ (a b n : ℕ), Admissible a b n → BoundHolds c a b n\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6d01c1d6-ff93-5553-b069-cfe0fdb6ec80", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "edf165cacdf29ca33167a16fb8b306c34eeac185c6c7f1502ed9046f58e94458", "task_path": "tasks/nmp3_6d01c1d6-ff93-5553-b069-cfe0fdb6ec80", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6d01c1d6-ff93-5553-b069-cfe0fdb6ec80", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6d1f04f9-c44d-5e97-9e3f-5e09dcf4a44b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A 10 × 10 × 10 cube is built from 1000 unit cubes. Exactly 500 of the unit cubes are coloured black and 500 are coloured white. Prove that there exist at least 100 unit squares that are common faces of a white cube and a black cube (i.e., at least 100 adjacent black–white cube pairs).\nimport Mathlib\n\n/-!\n# Adjacent black-white faces in a coloured 10 × 10 × 10 cube\n\nThe unit cubes are represented by triples of coordinates in `Fin 10`. An\ninternal unit square face is represented by its normal axis, its position in\nthe nine layers between adjacent cubes along that axis, and the two remaining\ncoordinates. This gives each common face of two unit cubes exactly one\nrepresentation, so counting faces does not double count ordered cube pairs.\n-/\n\nnamespace Problem\n\n/-- The two colours with which the unit cubes are coloured. -/\ninductive CubeColour : Type\n | black\n | white\n deriving DecidableEq, Repr\n\n/-- The 10 × 10 × 10 grid of unit cubes. -/\nabbrev Cube : Type := Fin 10 × Fin 10 × Fin 10\n\n/-- The grid contains exactly 1000 unit cubes. -/\ntheorem cube_card : Fintype.card Cube = 1000 := by\n simp [Cube]\n\n/-- The first coordinate of a cube. -/\ndef cubeX (c : Cube) : Fin 10 := c.1\n\n/-- The second coordinate of a cube. -/\ndef cubeY (c : Cube) : Fin 10 := c.2.1\n\n/-- The third coordinate of a cube. -/\ndef cubeZ (c : Cube) : Fin 10 := c.2.2\n\n/-- Two coordinates are consecutive in the finite grid. -/\ndef Consecutive (a b : Fin 10) : Prop :=\n a.val + 1 = b.val ∨ b.val + 1 = a.val\n\n/-- Two cubes share a face exactly when they differ by one in one coordinate\nand are equal in the other two coordinates. -/\ndef Adjacent (c d : Cube) : Prop :=\n (Consecutive (cubeX c) (cubeX d) ∧ cubeY c = cubeY d ∧ cubeZ c = cubeZ d) ∨\n (cubeX c = cubeX d ∧ Consecutive (cubeY c) (cubeY d) ∧ cubeZ c = cubeZ d) ∨\n (cubeX c = cubeX d ∧ cubeY c = cubeY d ∧ Consecutive (cubeZ c) (cubeZ d))\n\ninstance adjacentDecidable : DecidableRel Adjacent := by\n intro c d\n unfold Adjacent Consecutive\n infer_instance\n\n/-- The axis normal to a common unit square face. -/\ninductive FaceAxis : Type\n | x\n | y\n | z\n deriving DecidableEq, Repr\n\ninstance faceAxisFintype : Fintype FaceAxis :=\n Fintype.ofList [FaceAxis.x, FaceAxis.y, FaceAxis.z] (by\n intro a\n cases a <;> simp)\n\n/-- An internal unit square face. Its `position` is one of the nine layers\nbetween adjacent coordinate values, and `horizontal` and `vertical` are the two\ncoordinates within that layer. -/\nstructure InternalFace : Type where\n axis : FaceAxis\n position : Fin 9\n horizontal : Fin 10\n vertical : Fin 10\n deriving DecidableEq, Repr, Fintype\n\n/-- The lower-coordinate endpoint of a face position along an axis. -/\ndef fin9Low (i : Fin 9) : Fin 10 :=\n ⟨i.val, Nat.lt_trans i.isLt (by decide)⟩\n\n/-- The higher-coordinate endpoint of a face position along an axis. -/\ndef fin9High (i : Fin 9) : Fin 10 :=\n ⟨i.val + 1, Nat.succ_lt_succ i.isLt⟩\n\n/-- The cube on the lower-coordinate side of an internal face. -/\ndef faceLow (f : InternalFace) : Cube :=\n match f.axis with\n | FaceAxis.x => (fin9Low f.position, f.horizontal, f.vertical)\n | FaceAxis.y => (f.horizontal, fin9Low f.position, f.vertical)\n | FaceAxis.z => (f.horizontal, f.vertical, fin9Low f.position)\n\n/-- The cube on the higher-coordinate side of an internal face. -/\ndef faceHigh (f : InternalFace) : Cube :=\n match f.axis with\n | FaceAxis.x => (fin9High f.position, f.horizontal, f.vertical)\n | FaceAxis.y => (f.horizontal, fin9High f.position, f.vertical)\n | FaceAxis.z => (f.horizontal, f.vertical, fin9High f.position)\n\n/-- The two cubes on the two sides of an internal face are adjacent. -/\ndef FaceAdjacent (f : InternalFace) : Prop :=\n Adjacent (faceLow f) (faceHigh f)\n\n/-- Every represented internal face indeed has its two incident cubes adjacent. -/\ntheorem faceAdjacent_all (f : InternalFace) : FaceAdjacent f := by\n rcases f with ⟨axis, position, horizontal, vertical⟩\n unfold FaceAdjacent Adjacent\n cases axis\n · left\n exact ⟨Or.inl rfl, rfl, rfl⟩\n · right\n left\n exact ⟨rfl, Or.inl rfl, rfl⟩\n · right\n right\n exact ⟨rfl, rfl, Or.inl rfl⟩\n\n/-- The number of unit cubes coloured black. -/\ndef blackCubeCount (colour : Cube → CubeColour) : Nat :=\n (Finset.univ.filter (fun c : Cube => colour c = CubeColour.black)).card\n\n/-- The number of unit cubes coloured white. -/\ndef whiteCubeCount (colour : Cube → CubeColour) : Nat :=\n (Finset.univ.filter (fun c : Cube => colour c = CubeColour.white)).card\n\n/-- The colouring uses each colour exactly 500 times. -/\ndef HasExactlyFiveHundredOfEachColour (colour : Cube → CubeColour) : Prop :=\n blackCubeCount colour = 500 ∧ whiteCubeCount colour = 500\n\n/-- A common face is black-white when the two cubes on its two sides have\ndifferent colours. -/\ndef IsBlackWhiteFace (colour : Cube → CubeColour) (f : InternalFace) : Prop :=\n FaceAdjacent f ∧ colour (faceLow f) ≠ colour (faceHigh f)\n\ninstance isBlackWhiteFaceDecidable (colour : Cube → CubeColour) :\n DecidablePred (IsBlackWhiteFace colour) := by\n intro f\n unfold IsBlackWhiteFace FaceAdjacent Adjacent Consecutive\n infer_instance\n\n/-- The number of unit squares that are common faces of a black cube and a\nwhite cube. Each such square is counted exactly once by its `InternalFace`\nrepresentation. -/\ndef blackWhiteFaceCount (colour : Cube → CubeColour) : Nat :=\n (Finset.univ.filter (fun f : InternalFace => IsBlackWhiteFace colour f)).card\n\n/-- The formal assertion: for every black-white colouring of the 10 × 10 × 10\ncube with exactly 500 cubes of each colour, there are at least 100 common\nfaces between a black cube and a white cube. -/\ndef Target : Prop :=\n ∀ colour : Cube → CubeColour,\n HasExactlyFiveHundredOfEachColour colour → 100 ≤ blackWhiteFaceCount colour\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6d1f04f9-c44d-5e97-9e3f-5e09dcf4a44b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3d63b9a76f581eaa256b71f12459b7e3c08817883a6f5e5568e4323cb15ac7b1", "task_path": "tasks/nmp3_6d1f04f9-c44d-5e97-9e3f-5e09dcf4a44b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6d1f04f9-c44d-5e97-9e3f-5e09dcf4a44b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6d396651-2c40-5389-bf77-7fd8b7257b24", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a}{b+c}+\\frac{b}{c+a}+\\frac{c}{a+b}+\\frac12\\;\\ge\\;\n-- \\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}+\\frac{ab+bc+ca}{a^{2}+b^{2}+c^{2}}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility condition from the problem: the three variables are positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / (b + c) + b / (c + a) + c / (a + b) + (1 / 2 : ℝ)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a) +\n (a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The full universal inequality stated in the problem, over all positive real triples. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6d396651-2c40-5389-bf77-7fd8b7257b24", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "423961812217ddcdd2ac70c01294904d54020f4e875be4119474f0145b1fa159", "task_path": "tasks/nmp3_6d396651-2c40-5389-bf77-7fd8b7257b24", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6d396651-2c40-5389-bf77-7fd8b7257b24", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6d455c7c-d211-5c10-84c9-5ab1109a7d7e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a$, $b$, $c$, $d$ are positive numbers and $ab+ac+ad+bc+bd+cd=6$, prove \n-- \\[\n-- \\sqrt{ \\frac{abc}{a+b+c+3d}}+ \\sqrt{ \\frac{bcd}{b+c+d+3a}}+ \\sqrt{ \\frac{cda}{c+d+a+3b}}+ \\sqrt{ \\frac{dab}{d+a+b+3c}} \\le 2\\sqrt{\\frac{2}{3}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a four-variable real inequality\n\nThe source problem asks to prove an inequality for four positive real numbers\nwhose six pairwise products sum to `6`.\n\nWe encode the assertion as a proposition-valued definition, as requested. The\nprincipal real square root is `Real.sqrt`, and all arithmetic is over `ℝ`.\n-/\n\nnamespace Problem\n\n/-- The sum of the six pairwise products of four real numbers. -/\ndef pairwiseSum (a b c d : ℝ) : ℝ :=\n a * b + a * c + a * d + b * c + b * d + c * d\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c d : ℝ) : ℝ :=\n Real.sqrt (a * b * c / (a + b + c + (3 : ℝ) * d)) +\n Real.sqrt (b * c * d / (b + c + d + (3 : ℝ) * a)) +\n Real.sqrt (c * d * a / (c + d + a + (3 : ℝ) * b)) +\n Real.sqrt (d * a * b / (d + a + b + (3 : ℝ) * c))\n\n/-- The complete assertion of the source problem: for all positive reals\n`a`, `b`, `c`, `d` with pairwise-product sum `6`, the stated square-root sum\nis at most `2 * sqrt (2 / 3)`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 0 < d →\n pairwiseSum a b c d = (6 : ℝ) →\n lhs a b c d ≤ 2 * Real.sqrt ((2 : ℝ) / 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6d455c7c-d211-5c10-84c9-5ab1109a7d7e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8024ae4a036a18922786fd0f48b11a3dc87b63c3228d3d9ba4fa7e8df0fad1dd", "task_path": "tasks/nmp3_6d455c7c-d211-5c10-84c9-5ab1109a7d7e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6d455c7c-d211-5c10-84c9-5ab1109a7d7e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6da002ba-6624-5843-842c-1c8d99cb45d1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given positive real numbers $x$, $y$, and $z$, prove that \n-- \\[\n-- \\bigl((x-1)^2+11\\bigr)\\bigl((y-1)^2+11\\bigr)\\bigl((z-1)^2+11\\bigr) \\;>\\; 8\\,(xyz+27)^{\\frac32}\\,.\n-- \\] \n-- (The inequality is strict.)\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe original problem asks to prove, for positive real numbers `x`, `y`, and `z`, the strict inequality\n\n`((x - 1)^2 + 11) * ((y - 1)^2 + 11) * ((z - 1)^2 + 11)\n > 8 * (x * y * z + 27)^(3/2)`.\n\nThe definitions below only state the proposition; no proof is supplied.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The three variables are positive real numbers. -/\ndef PositiveTriple (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The left-hand side of the target inequality. -/\ndef leftHandSide (x y z : ℝ) : ℝ :=\n ((x - 1) ^ 2 + 11) * ((y - 1) ^ 2 + 11) * ((z - 1) ^ 2 + 11)\n\n/-- The right-hand side of the target inequality, using the real power `(3 / 2 : ℝ)`. -/\ndef rightHandSide (x y z : ℝ) : ℝ :=\n 8 * Real.rpow (x * y * z + 27) ((3 : ℝ) / 2)\n\n/-- The pointwise strict inequality asserted by the problem. -/\ndef Inequality (x y z : ℝ) : Prop :=\n leftHandSide x y z > rightHandSide x y z\n\n/-- The complete assertion: for every positive real `x`, `y`, and `z`, the strict\ninequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, PositiveTriple x y z → Inequality x y z\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6da002ba-6624-5843-842c-1c8d99cb45d1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "36bfa517534b20acfc469a804cf418f1afa1d2d1e6ffc6394b9e41551a34856f", "task_path": "tasks/nmp3_6da002ba-6624-5843-842c-1c8d99cb45d1", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6da002ba-6624-5843-842c-1c8d99cb45d1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6dbb6768-77ce-5e92-b6c2-0b2b49f24784", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p\\ge5$ be a prime number. Prove that there exist at least two distinct primes $q_1,q_2$ such that $10$ and $m,n\\in\\mathbb Z^+$ . Prove that \n-- \\[\n-- \\frac{a^{m}b^{n}}{c^{\\,m+n}}+\\frac{b^{m}c^{n}}{a^{\\,m+n}}+\\frac{c^{m}a^{n}}{b^{\\,m+n}}\n-- \\;\\ge\\;\n-- \\frac{ab}{c^{2}}+\\frac{bc}{a^{2}}+\\frac{ca}{b^{2}}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic real inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, `c` and\npositive integers `m`, `n`, the cyclic inequality\n\n`a^m b^n / c^(m+n) + b^m c^n / a^(m+n) + c^m a^n / b^(m+n)`\n` ≥ ab / c^2 + bc / a^2 + ca / b^2`.\n\nThe positive-integer hypothesis on `m` and `n` is represented by integers\ntogether with proofs that they are positive; consequently the real powers are\ninteger powers (`zpow`).\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def leftSide (a b c : ℝ) (m n : ℤ) : ℝ :=\n a ^ m * b ^ n / c ^ (m + n) +\n b ^ m * c ^ n / a ^ (m + n) +\n c ^ m * a ^ n / b ^ (m + n)\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rightSide (a b c : ℝ) : ℝ :=\n a * b / c ^ (2 : ℤ) +\n b * c / a ^ (2 : ℤ) +\n c * a / b ^ (2 : ℤ)\n\n/-- The complete assertion requested by the source problem. -/\nnoncomputable def Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n ∀ (m n : ℤ), 0 < m → 0 < n →\n leftSide a b c m n ≥ rightSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6dc115b8-0494-5b71-b9d3-43730f08f697", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a1a1a41a50dbbc3df9c956ff961d9e7eabf4e739cbd0e0190535da3134a8a2ad", "task_path": "tasks/nmp3_6dc115b8-0494-5b71-b9d3-43730f08f697", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6dc115b8-0494-5b71-b9d3-43730f08f697", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6dfb06af-44b9-5a54-a7af-6c2dd8e6ec56", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Point $P$ lies in the interior of triangle $ABC$. The cevians $AP$, $BP$, $CP$ intersect the opposite sides at $A'$, $B'$, $C'$, respectively. Let $P_A$ be the midpoint of the segment joining the incenters of triangles $BPC'$ and $CPB'$, and define $P_B$ and $P_C$ analogously. Show that if \n-- \\[AB'+BC'+CA'=AC'+BA'+CB',\\] \n-- then the points $P$, $P_A$, $P_B$, and $P_C$ are concyclic.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Sphere.Basic\nimport Mathlib.LinearAlgebra.AffineSpace.Midpoint\n\nset_option linter.unusedVariables false\n\n/-!\n# Formal statement: concyclicity of a point and three midpoint incenters\n\nThis file states the geometric assertion from `problem.md` without proving it.\nThe ambient plane is `EuclideanSpace ℝ (Fin 2)`.\n-/\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, represented as the real vector space `ℝ²`. -/\nabbrev Point2 : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The open segment with endpoints `X` and `Y`, expressed using affine coordinates:\n`Z = (1 - t) • X + t • Y` with `0 < t < 1`. -/\ndef OnOpenSegment (X Y Z : Point2) : Prop :=\n ∃ t : ℝ, 0 < t ∧ t < 1 ∧ Z = (1 - t) • X + t • Y\n\n/-- The point `P` is strictly inside the triangle with vertices `A`, `B`, `C`,\nexpressed by positive barycentric coordinates summing to one. -/\ndef InTriangleInterior (A B C P : Point2) : Prop :=\n ∃ α β γ : ℝ,\n 0 < α ∧ 0 < β ∧ 0 < γ ∧ α + β + γ = 1 ∧\n P = α • A + β • B + γ • C\n\n/-- The three vertices are noncollinear, i.e. they form a genuine triangle. -/\ndef TriangleNondegenerate (A B C : Point2) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Point2)\n\n/-- `F` is the point where the cevian from `X` through `P` meets the opposite side\n`YZ`: `F` lies on the open side `YZ`, and `P` lies on the open segment from `X` to `F`. -/\ndef IsCevianFoot (X P Y Z F : Point2) : Prop :=\n OnOpenSegment Y Z F ∧ OnOpenSegment X F P\n\n/-- The standard side-length weighted formula for the incenter of a (nondegenerate)\ntriangle with vertices `X`, `Y`, and `Z`. -/\nnoncomputable def triangleIncenter (X Y Z : Point2) : Point2 :=\n (dist Y Z + dist Z X + dist X Y : ℝ)⁻¹ •\n ((dist Y Z) • X + (dist Z X) • Y + (dist X Y) • Z)\n\n/-- `P_A`, the midpoint of the incenters of triangles `B P C'` and `C P B'`. -/\nnoncomputable def pA (A B C P A' B' C' : Point2) : Point2 :=\n midpoint ℝ (triangleIncenter B P C') (triangleIncenter C P B')\n\n/-- `P_B`, defined cyclically from `P_A`. -/\nnoncomputable def pB (A B C P A' B' C' : Point2) : Point2 :=\n midpoint ℝ (triangleIncenter C P A') (triangleIncenter A P C')\n\n/-- `P_C`, defined cyclically from `P_A`. -/\nnoncomputable def pC (A B C P A' B' C' : Point2) : Point2 :=\n midpoint ℝ (triangleIncenter A P B') (triangleIncenter B P A')\n\n/-- The length condition from the statement:\n`AB' + BC' + CA' = AC' + BA' + CB'`. -/\ndef LengthCondition (A B C A' B' C' : Point2) : Prop :=\n dist A B' + dist B C' + dist C A' = dist A C' + dist B A' + dist C B'\n\n/-- Four points are concyclic if they all lie on a circle with positive radius. -/\ndef Concyclic4 (X Y Z W : Point2) : Prop :=\n ∃ O : Point2, ∃ r : ℝ,\n 0 < r ∧ dist X O = r ∧ dist Y O = r ∧ dist Z O = r ∧ dist W O = r\n\n/-- The conclusion of the problem: `P`, `P_A`, `P_B`, and `P_C` are concyclic. -/\ndef Conclusion (A B C P A' B' C' : Point2) : Prop :=\n Concyclic4 P (pA A B C P A' B' C') (pB A B C P A' B' C')\n (pC A B C P A' B' C')\n\n/-- The full universally quantified assertion of the problem. -/\ndef Target : Prop :=\n ∀ (A B C P : Point2),\n TriangleNondegenerate A B C →\n InTriangleInterior A B C P →\n ∀ (A' B' C' : Point2),\n IsCevianFoot A P B C A' →\n IsCevianFoot B P C A B' →\n IsCevianFoot C P A B C' →\n LengthCondition A B C A' B' C' →\n Conclusion A B C P A' B' C'\n\nend Problem\n\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6dfb06af-44b9-5a54-a7af-6c2dd8e6ec56", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8be44f5c21a8cb8543a17248bb229d6e281405aac9d3d3acdf492a3c1679e79b", "task_path": "tasks/nmp3_6dfb06af-44b9-5a54-a7af-6c2dd8e6ec56", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6dfb06af-44b9-5a54-a7af-6c2dd8e6ec56", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6e218f9e-087c-5666-b760-f4c91bc889b3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\varphi(k)$ denote the number of positive integers $\\le k$ that are relatively prime to $k$ (Euler's totient function). Prove that there exists a positive integer $n$ such that \n-- \\[\n-- \\varphi(2n-1)+\\varphi(2n+1)<\\frac1{1000}\\,\\varphi(2n).\n-- \\]\nimport Mathlib.Data.Nat.Totient\n\n/-!\n# Formal statement of the Euler-totient inequality problem\n\nThe problem defines `φ(k)` as the number of positive integers at most `k`\nthat are relatively prime to `k`, and asks for a positive integer `n` such\nthat `φ(2n-1) + φ(2n+1) < φ(2n)/1000`.\n\nThe proposition is stated over the rational numbers. All three totient\nvalues are natural numbers, so this is the exact rational form of the\ndisplayed inequality (and is equivalent to its real-valued reading).\n-/\n\nnamespace Problem\n\n/-- Euler's totient function, defined literally as in the problem: the\nnumber of positive integers `m` with `m ≤ k` and `Nat.Coprime m k`. -/\ndef EulerPhi (k : ℕ) : ℕ :=\n ((Finset.Icc 1 k).filter fun m => Nat.Coprime m k).card\n\n/-- The displayed inequality for a fixed natural number `n`. -/\ndef Inequality (n : ℕ) : Prop :=\n (EulerPhi (2 * n - 1) : ℚ) + (EulerPhi (2 * n + 1) : ℚ) <\n (1 / 1000 : ℚ) * (EulerPhi (2 * n) : ℚ)\n\n/-- A positive integer `n` is admissible when it satisfies the displayed\ninequality. -/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧ Inequality n\n\n/-- The target assertion: there exists a positive integer `n` satisfying\nthe displayed inequality. -/\ndef Target : Prop :=\n ∃ n : ℕ, 0 < n ∧ Inequality n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e218f9e-087c-5666-b760-f4c91bc889b3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "917d41d459cf5d0e2b50856a96135ca0e41dbd1d2be3bd41574151be5ff1226b", "task_path": "tasks/nmp3_6e218f9e-087c-5666-b760-f4c91bc889b3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e218f9e-087c-5666-b760-f4c91bc889b3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6e334a40-7579-5044-bb9c-ef682d973467", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$ satisfying $a+b+c=1$, prove that \n-- \\[\n-- \\frac{a+b^4}{(1+b^2c)^2}+\\frac{b+c^4}{(1+c^2a)^2}+\\frac{c+a^4}{(1+a^2b)^2}\\ge\\frac{1}{a^4+b^4+c^4+1}\\,. \n-- \\]\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\npublic section\n\nnamespace Problem\n\n/-- The admissibility assumptions of the problem: `a`, `b`, and `c` are\npositive real numbers whose sum is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 1\n\n/-- The left-hand side of the stated inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (a + b ^ 4) / (1 + b ^ 2 * c) ^ 2 +\n (b + c ^ 4) / (1 + c ^ 2 * a) ^ 2 +\n (c + a ^ 4) / (1 + a ^ 2 * b) ^ 2\n\n/-- The right-hand side of the stated inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 1 / (a ^ 4 + b ^ 4 + c ^ 4 + 1)\n\n/-- The inequality assertion for a fixed admissible triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ RHS a b c\n\n/-- The full theorem to be proved: for every positive real triple satisfying\n`a + b + c = 1`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e334a40-7579-5044-bb9c-ef682d973467", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2192f138caea77cef1a8cdf9ce6bf229f36fbdd9a9d47945db00c0df7880b02c", "task_path": "tasks/nmp3_6e334a40-7579-5044-bb9c-ef682d973467", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e334a40-7579-5044-bb9c-ef682d973467", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6e3b908b-cc1c-53b3-afe3-97fbfd376ee0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $d(k)$ denote the number of positive divisors of the integer $k$. An integer $n$ is called **balanced** if either \n-- $$d(n-1)\\le d(n)\\le d(n+1)$$ \n-- or \n-- $$d(n-1)\\ge d(n)\\ge d(n+1).$$ \n-- Prove that there exist infinitely many balanced numbers.\nimport Mathlib\n\n/-!\n# Balanced integers\n\nFormal statement of the problem: given the number of positive divisors of an\ninteger, call `n` balanced when the triple of divisor counts at `n - 1`, `n`,\nand `n + 1` is monotone (in either direction), and assert that infinitely many\nintegers are balanced.\n\nThe divisor count is valued in the extended natural numbers so that the\npositive divisors of `0` (which are all positive integers) have cardinality\n`⊤`, while every nonzero integer has a finite divisor count.\n-/\n\nnamespace Problem\n\n/-- The set of positive divisors of an integer. -/\ndef positiveDivisors (k : ℤ) : Set ℤ :=\n {m : ℤ | 0 < m ∧ m ∣ k}\n\n/-- The number of positive divisors of an integer, in the extended natural\nnumbers. For nonzero `k` this is a finite natural number; for `k = 0` it is\n`⊤`, since every positive integer divides zero. -/\nnoncomputable def divisorCount (k : ℤ) : ℕ∞ :=\n (positiveDivisors k).encard\n\n/-- An integer `n` is balanced if the sequence of divisor counts\n`d(n - 1), d(n), d(n + 1)` is monotone, either nondecreasing or nonincreasing. -/\ndef Balanced (n : ℤ) : Prop :=\n (divisorCount (n - 1) ≤ divisorCount n ∧\n divisorCount n ≤ divisorCount (n + 1)) ∨\n (divisorCount (n - 1) ≥ divisorCount n ∧\n divisorCount n ≥ divisorCount (n + 1))\n\n/-- There are infinitely many balanced integers. -/\ndef Target : Prop :=\n {n : ℤ | Balanced n}.Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e3b908b-cc1c-53b3-afe3-97fbfd376ee0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c1588dedd78c04fc32dd68c8912fedcb96d75d2f74e067b66cfe3ab1925852ed", "task_path": "tasks/nmp3_6e3b908b-cc1c-53b3-afe3-97fbfd376ee0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e3b908b-cc1c-53b3-afe3-97fbfd376ee0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6e6611ff-90b2-50ab-a0ad-35b19d84e556", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be a finite connected undirected graph with the property that for every odd cycle $C$ in $G$, the graph obtained by deleting all edges of $C$ (i.e. $G\\setminus E(C)$) is disconnected. Prove that the vertex set of $G$ can be partitioned into four independent sets; equivalently, $G$ is $4$‑colorable.\nimport Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex\nimport Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected\nimport Mathlib.Combinatorics.SimpleGraph.DeleteEdges\nimport Mathlib.Combinatorics.SimpleGraph.Paths\n\nuniverse u\n\nnamespace Problem\n\n/-- The set of (undirected) edges traversed by the closed walk `C`. Taking\nthe set underlying the edge list removes any repetitions; for an `IsCycle`\nwalk there are no repeated edges in any case. -/\ndef CycleEdgeSet {V : Type u} {G : SimpleGraph V} {v : V}\n (C : G.Walk v v) : Set (Sym2 V) :=\n {e : Sym2 V | e ∈ C.edges}\n\n/-- The graph obtained from `G` by deleting precisely the edges of the cycle\nwalk `C`. -/\ndef DeleteCycleEdges {V : Type u} {G : SimpleGraph V} {v : V}\n (C : G.Walk v v) : SimpleGraph V :=\n G.deleteEdges (CycleEdgeSet C)\n\n/-- A simple graph is disconnected when it is not connected. (In the\napplication the vertex type is nonempty because the original graph is\nconnected, so this agrees with the usual notion.) -/\ndef Disconnected {V : Type u} (G : SimpleGraph V) : Prop :=\n ¬ G.Connected\n\n/-- A cycle whose length, measured as a number of edges, is odd. -/\ndef IsOddCycle {V : Type u} {G : SimpleGraph V} {v : V}\n (C : G.Walk v v) : Prop :=\n C.IsCycle ∧ Odd C.length\n\n/-- The exceptional hypothesis of the problem: deleting all edges of every\nodd cycle disconnects the ambient graph. -/\ndef OddCycleEdgeDeletionDisconnects {V : Type u} (G : SimpleGraph V) : Prop :=\n ∀ (v : V) (C : G.Walk v v),\n IsOddCycle C → Disconnected (DeleteCycleEdges C)\n\n/-- A four-coloring viewed as a partition into four labelled independent\nclasses: a map to `Fin 4` sends adjacent vertices to distinct classes.\nEmpty classes are allowed, which is exactly the convention behind the\nequivalence with four-colorability. -/\ndef HasFourIndependentSetPartition {V : Type u} (G : SimpleGraph V) : Prop :=\n ∃ color : V → Fin 4,\n ∀ ⦃v w : V⦄, G.Adj v w → color v ≠ color w\n\n/-- The source's parenthetical equivalence: the indexed-independent-class\nformulation is Mathlib's `SimpleGraph.Colorable 4`. -/\ntheorem hasFourIndependentSetPartition_iff_colorable {V : Type u}\n (G : SimpleGraph V) :\n HasFourIndependentSetPartition G ↔ G.Colorable 4 := by\n constructor\n · rintro ⟨color, hcolor⟩\n exact ⟨SimpleGraph.Coloring.mk color (fun {v w} h => hcolor h)⟩\n · rintro ⟨C⟩\n exact ⟨C, fun {v w} h => C.valid h⟩\n\n/-- The formal target: every finite connected undirected simple graph with\nthe odd-cycle edge-deletion disconnection property is 4-colorable. -/\ndef Target : Prop :=\n ∀ (V : Type u) [Fintype V] (G : SimpleGraph V),\n G.Connected →\n OddCycleEdgeDeletionDisconnects G →\n G.Colorable 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e6611ff-90b2-50ab-a0ad-35b19d84e556", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fa9c2c2c6cdefc9f61798e8fd5a380cc08fd9b63839533533b1b4346957e198d", "task_path": "tasks/nmp3_6e6611ff-90b2-50ab-a0ad-35b19d84e556", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e6611ff-90b2-50ab-a0ad-35b19d84e556", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6e68c3bb-5b51-5815-b57e-8b923b4e4459", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- We say that a function $f:\\mathbb{R}^k \\rightarrow \\mathbb{R}$ is a **metapolynomial** if, for some positive integers $m$ and $n$, it can be represented in the form \n-- \\[\n-- f(x_1,\\dots ,x_k)=\\max_{i=1,\\dots ,m}\\;\\min_{j=1,\\dots ,n} P_{i,j}(x_1,\\dots ,x_k),\n-- \\] \n-- where each $P_{i,j}$ is a multivariate polynomial. Prove that the product of two metapolynomials is also a metapolynomial.\nimport Mathlib.Basic.Real.Basic\nimport Mathlib.Algebra.MvPolynomial.Eval\nimport Mathlib.Data.Finset.Lattice.Fold\nimport Mathlib.Data.PNat.Basic\n\n/-!\n# Metapolynomials and closure under pointwise multiplication\n\nThis file formalizes the definition and the statement of the problem: a real-valued\nfunction on `ℝ^k` is a metapolynomial when it is a finite maximum of finite minima of\nmultivariate real polynomial functions. The target proposition says that the pointwise\nproduct of two metapolynomials is again a metapolynomial.\n\nThe main target is stated as a `def ... : Prop`; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The underlying space `ℝ^k`, represented as functions from the finite index set\n`Fin k` to `ℝ`. -/\nabbrev Point (k : ℕ) : Type := Fin k → ℝ\n\n/-- Real multivariate polynomials in the `k` variables indexed by `Fin k`. -/\nabbrev Polynomial (k : ℕ) : Type := MvPolynomial (Fin k) ℝ\n\n/-- The maximum of a nonempty finite family of real numbers. -/\nnoncomputable def finiteMax {ι : Type} [Fintype ι] [Nonempty ι]\n (g : ι → ℝ) : ℝ :=\n (Finset.univ : Finset ι).sup' Finset.univ_nonempty g\n\n/-- The minimum of a nonempty finite family of real numbers. -/\nnoncomputable def finiteMin {ι : Type} [Fintype ι] [Nonempty ι]\n (g : ι → ℝ) : ℝ :=\n (Finset.univ : Finset ι).inf' Finset.univ_nonempty g\n\n/-- Given positive integers `m` and `n` and a double family of real multivariate\npolynomials `P : Fin m → Fin n → MvPolynomial (Fin k) ℝ`, this is the value at `x` of\n`max_{i=1,...,m} min_{j=1,...,n} P_{i,j}(x)`.\n\nThe finite index sets `Fin m` and `Fin n` are the usual zero-based reindexing of the\none-based ranges `1,...,m` and `1,...,n`. -/\nnoncomputable def latticeCombination {k : ℕ} (m n : ℕ+)\n (P : Fin m → Fin n → Polynomial k) (x : Point k) : ℝ :=\n letI : Nonempty (Fin (m : ℕ)) := ⟨⟨0, m.pos⟩⟩\n letI : Nonempty (Fin (n : ℕ)) := ⟨⟨0, n.pos⟩⟩\n finiteMax (fun i : Fin (m : ℕ) =>\n finiteMin (fun j : Fin (n : ℕ) =>\n MvPolynomial.eval x (P i j)))\n\n/-- `IsMetapolynomial f` says that `f : ℝ^k → ℝ` admits a representation as a finite\nmaximum of finite minima of multivariate real polynomial functions. The integers `m`\nand `n` ranging over `ℕ+` encode the requirement that they be positive. -/\ndef IsMetapolynomial {k : ℕ} (f : Point k → ℝ) : Prop :=\n ∃ m n : ℕ+,\n ∃ P : Fin m → Fin n → Polynomial k,\n ∀ x : Point k, f x = latticeCombination m n P x\n\n/-- The assertion, at a fixed dimension `k`, that the pointwise product of any two\nmetapolynomials on `ℝ^k` is again a metapolynomial. -/\ndef productClosedAt (k : ℕ) : Prop :=\n ∀ f g : Point k → ℝ,\n IsMetapolynomial f →\n IsMetapolynomial g →\n IsMetapolynomial (fun x : Point k => f x * g x)\n\n/-- The full target: for every natural-number dimension `k`, the pointwise product of two\nmetapolynomials on `ℝ^k` is a metapolynomial. -/\ndef Target : Prop :=\n ∀ k : ℕ, productClosedAt k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e68c3bb-5b51-5815-b57e-8b923b4e4459", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4a1f33cf493fdb4d9a8ef1c904612101b935f40e9c98758e364ab950a2e2810d", "task_path": "tasks/nmp3_6e68c3bb-5b51-5815-b57e-8b923b4e4459", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e68c3bb-5b51-5815-b57e-8b923b4e4459", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6e6b391c-60d8-5fbd-9da6-ad16a2e16ed7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(x,y,z>0\\) with \\(x+y+z=3\\). Prove that \n-- \\[\n-- \\sum_{cyc}\\frac{x^{3}}{y^{3}+8}\\ge \\frac{1}{9}+\\frac{2}{27}(xy+yz+zx).\n-- \\] \n-- (The sum \\(\\sum_{cyc}\\) is cyclic: \\(\\frac{x^{3}}{y^{3}+8}+\\frac{y^{3}}{z^{3}+8}+\\frac{z^{3}}{x^{3}+8}\\.)\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the cyclic inequality\n\nThe source problem asks to prove, for strictly positive real numbers\n`x`, `y`, `z` satisfying `x + y + z = 3`, the cyclic inequality\n\n`x^3 / (y^3 + 8) + y^3 / (z^3 + 8) + z^3 / (x^3 + 8)`\n` ≥ 1/9 + (2/27) * (x*y + y*z + z*x)`.\n\nThis file records only the mathematical assertion; it does not supply a proof.\n-/\n\nnamespace Problem\n\n@[expose] public section\n\nnoncomputable section\n\n/-- The cyclic sum appearing on the left-hand side of the target inequality. -/\ndef CyclicSum (x y z : ℝ) : ℝ :=\n x ^ 3 / (y ^ 3 + 8) + y ^ 3 / (z ^ 3 + 8) + z ^ 3 / (x ^ 3 + 8)\n\n/-- The admissibility assumptions on the three real variables in the problem. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = 3\n\n/-- The assertion stated in the problem: for every triple of strictly positive\nreal numbers with sum `3`, the cyclic sum is at least\n`1/9 + (2/27) * (xy + yz + zx)`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n Admissible x y z →\n CyclicSum x y z ≥\n (1 : ℝ) / 9 + (2 : ℝ) / 27 * (x * y + y * z + z * x)\n\nend\n\nend\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e6b391c-60d8-5fbd-9da6-ad16a2e16ed7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9063fae180983115d11ac88ff0b58082c4110bcfa96f2c353fcd9c939744e54d", "task_path": "tasks/nmp3_6e6b391c-60d8-5fbd-9da6-ad16a2e16ed7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e6b391c-60d8-5fbd-9da6-ad16a2e16ed7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6e6d59d0-ab7e-5635-9a4d-f03da05746d9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^3+b^3+c^3=abc\\,(a^2+b^2+c^2)$. Prove that \n-- $$3\\bigl(a^2+b^2+c^2+1\\bigr)\\ge 4\\left(\\frac{a}{c}+\\frac{b}{a}+\\frac{c}{b}\\right).$$\nimport Mathlib\n\n/-!\n# Formalization of the supplied inequality problem\n\nThe original problem quantifies over positive real numbers `a`, `b`, and `c`\nsatisfying a cubic equation, and asks for a proof of the displayed non-strict\ninequality.\n\nThis file records the statement as a proposition-valued definition. No proof\nof the proposition is supplied or assumed.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions from the problem: `a`, `b`, and `c` are\nstrictly positive and satisfy\n`a^3 + b^3 + c^3 = abc (a^2 + b^2 + c^2)`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a ^ 3 + b ^ 3 + c ^ 3 = a * b * c * (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The inequality whose proof is requested in the problem. -/\ndef ClaimedInequality (a b c : ℝ) : Prop :=\n 3 * (a ^ 2 + b ^ 2 + c ^ 2 + 1) ≥\n 4 * (a / c + b / a + c / b)\n\n/-- The complete assertion of the problem: for every triple of positive real\nnumbers satisfying the given cubic equation, the claimed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → ClaimedInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e6d59d0-ab7e-5635-9a4d-f03da05746d9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d16c71e4b611da653a885f2fa1a6a47017cee75b567c06164a5b1fcce1dd99e8", "task_path": "tasks/nmp3_6e6d59d0-ab7e-5635-9a4d-f03da05746d9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e6d59d0-ab7e-5635-9a4d-f03da05746d9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6e7f3092-29f0-5804-9ada-f3a2cef2cfe1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_i$ and $b_j$ be positive numbers such that $a_i\\lt b_j$ for any natural $i$ and $j$. Prove that \n-- \\[\n-- \\sqrt{\\frac{1}{3n}\\sum_{k=1}^n\\bigl(a_k^2+a_kb_k+b_k^2\\bigr)}\\;\\ge\\;\n-- \\sqrt[3]{\\frac{1}{2n}\\sum_{k=1}^n (a_k+b_k)a_kb_k}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The real (odd) cube root, represented using real powers with exponent\n`1 / 3`.\n\nFor nonnegative `x` this is `Real.rpow x (1 / 3)`. For negative `x` it is\nthe negative of the corresponding positive cube root. The argument in the\nproblem is positive under the stated hypotheses, so the first branch is the\nrelevant one there. -/\nnoncomputable def cubeRoot (x : ℝ) : ℝ :=\n if 0 ≤ x then Real.rpow x (1 / 3 : ℝ)\n else -Real.rpow (-x) (1 / 3 : ℝ)\n\n/-- The summand `a_k ^ 2 + a_k * b_k + b_k ^ 2` on the left-hand side. -/\ndef quadraticTerm (a b : ℕ+ → ℝ) (k : ℕ+) : ℝ :=\n a k ^ 2 + a k * b k + b k ^ 2\n\n/-- The summand `(a_k + b_k) * a_k * b_k` on the right-hand side. -/\ndef cubicTerm (a b : ℕ+ → ℝ) (k : ℕ+) : ℝ :=\n (a k + b k) * a k * b k\n\n/-- The left-hand side\n`Real.sqrt ((1 / (3 * n)) * ∑_{k=1}^n (a_k^2 + a_k b_k + b_k^2))`. -/\nnoncomputable def lhs (n : ℕ+) (a b : ℕ+ → ℝ) : ℝ :=\n Real.sqrt ((1 / (3 * (n : ℝ))) *\n ∑ k ∈ Finset.Icc (1 : ℕ+) n, quadraticTerm a b k)\n\n/-- The right-hand side\n`((1 / (2 * n)) * ∑_{k=1}^n (a_k + b_k) a_k b_k)^(1/3)`, with the\nreal cube root represented by `Problem.cubeRoot`. -/\nnoncomputable def rhs (n : ℕ+) (a b : ℕ+ → ℝ) : ℝ :=\n cubeRoot ((1 / (2 * (n : ℝ))) *\n ∑ k ∈ Finset.Icc (1 : ℕ+) n, cubicTerm a b k)\n\n/-- The assumptions on the two sequences: all `a` terms and all `b` terms\nare strictly positive, and every `a` term is strictly smaller than every\n`b` term. -/\ndef Admissible (a b : ℕ+ → ℝ) : Prop :=\n (∀ i : ℕ+, 0 < a i) ∧\n (∀ j : ℕ+, 0 < b j) ∧\n (∀ i j : ℕ+, a i < b j)\n\n/-- The asserted non-strict inequality `lhs n a b ≥ rhs n a b`. -/\ndef Inequality (n : ℕ+) (a b : ℕ+ → ℝ) : Prop :=\n lhs n a b ≥ rhs n a b\n\n/-- The full statement: for every positive integer `n` and every pair of\npositive-indexed real sequences satisfying the pointwise positivity and\ncross-inequality assumptions, the required inequality holds. -/\ndef Target : Prop :=\n ∀ (n : ℕ+) (a b : ℕ+ → ℝ), Admissible a b → Inequality n a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e7f3092-29f0-5804-9ada-f3a2cef2cfe1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ce819af687bdbb13449e1f675276455cb5e8f06db7e9947670cbadf6c8cd7d6d", "task_path": "tasks/nmp3_6e7f3092-29f0-5804-9ada-f3a2cef2cfe1", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e7f3092-29f0-5804-9ada-f3a2cef2cfe1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6e8f7189-54c0-5f2e-94cb-7e824fd1e73f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any set of 200 integers there exists a subset of exactly 100 integers whose sum is a multiple of 100.\nimport Mathlib\n\n/-!\n# A one-hundred-element subset with sum divisible by one hundred\n\nThis file formalizes the statement of the problem. A \"set of 200 integers\" is\nrepresented by a `Finset ℤ` of cardinality 200, and a subset of exactly 100\nintegers is represented by a sub-`Finset` of cardinality 100.\n-/\n\nnamespace Problem\n\n/-- A finite set of exactly two hundred integers. -/\ndef IsSetOfTwoHundredIntegers (S : Finset ℤ) : Prop :=\n S.card = 200\n\n/-- `T` is a subset of `S` having exactly one hundred elements. -/\ndef IsSubsetOfExactlyOneHundred (T S : Finset ℤ) : Prop :=\n T ⊆ S ∧ T.card = 100\n\n/-- An integer is a multiple of one hundred. -/\ndef IsMultipleOfHundred (z : ℤ) : Prop :=\n (100 : ℤ) ∣ z\n\n/-- `S` has a subset of exactly one hundred integers whose sum is a multiple of 100. -/\ndef HasHundredElementSubsetWithSumMultipleOfHundred (S : Finset ℤ) : Prop :=\n ∃ T : Finset ℤ,\n IsSubsetOfExactlyOneHundred T S ∧\n IsMultipleOfHundred (T.sum (fun x : ℤ => x))\n\n/-- For every set of 200 integers, there exists a subset of exactly 100 integers\nwhose sum is a multiple of 100. -/\ndef Target : Prop :=\n ∀ S : Finset ℤ, IsSetOfTwoHundredIntegers S →\n HasHundredElementSubsetWithSumMultipleOfHundred S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e8f7189-54c0-5f2e-94cb-7e824fd1e73f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "85d11f8eb230cff6d64bf435b3044dd71132f0f0265aab22a8b9e0ec525c7d63", "task_path": "tasks/nmp3_6e8f7189-54c0-5f2e-94cb-7e824fd1e73f", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e8f7189-54c0-5f2e-94cb-7e824fd1e73f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6e8f8348-7e27-5cc9-b524-06712f41c1f9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) with \\(a+b+c=3\\). Prove that\n-- \\[\n-- \\frac{a}{b^{3}+2}+\\frac{b}{c^{3}+2}+\\frac{c}{a^{3}+2}\\ge 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`\nwhose sum is `3`, the stated cyclic sum is at least `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 3 →\n (1 : ℝ) ≤\n a / (b ^ 3 + 2) + b / (c ^ 3 + 2) + c / (a ^ 3 + 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e8f8348-7e27-5cc9-b524-06712f41c1f9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6d1a4aba2c63f4762ffb04a4b9837a30c02f4abcfa767753018250305c549fbb", "task_path": "tasks/nmp3_6e8f8348-7e27-5cc9-b524-06712f41c1f9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6e8f8348-7e27-5cc9-b524-06712f41c1f9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6ea16396-028a-5c7d-aae3-3ac889d0451e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute‑angled triangle. Let $AD$, $BE$, $CF$ be the internal angle bisectors with $D\\in BC$, $E\\in CA$, $F\\in AB$. Prove that \n-- \\[\n-- \\frac{EF}{BC}+\\frac{FD}{CA}+\\frac{DE}{AB}\\ge 1+\\frac{r}{R},\n-- \\] \n-- where $r$ and $R$ are the inradius and circumradius of $ABC$, respectively.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Simplex\nimport Mathlib.Geometry.Euclidean.Circumcenter\nimport Mathlib.Geometry.Euclidean.Incenter.Basic\n\n/-!\n# Formal statement of an acute-triangle angle-bisector inequality\n\nThis file records the problem statement only. It introduces the Euclidean plane,\nthe relation saying that a point is the foot of an internal angle bisector on the\nopposite side, and the proposition asserting the desired inequality.\n-/\n\nopen scoped Real\nopen EuclideanGeometry Affine\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used for the triangle. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `IsInternalAngleBisectorFoot A B C D` means that `D` lies on the side `BC` and\nthe ray `AD` splits the angle `∠BAC` into two equal (unoriented) angles. In a\nnondegenerate triangle this is exactly the condition that `D` is the intersection\nof the internal angle bisector from `A` with the side `BC`. -/\ndef IsInternalAngleBisectorFoot (A B C D : Plane) : Prop :=\n D ∈ segment ℝ B C ∧ ∠ B A D = ∠ D A C\n\n/-- The inequality asserted in the problem, for a triangle and prescribed\nangle-bisector feet `D`, `E`, and `F`. -/\ndef angleBisectorInequality (t : Affine.Triangle ℝ Plane) (D E F : Plane) : Prop :=\n 1 + t.inradius / t.circumradius ≤\n dist E F / dist (t.points 1) (t.points 2) +\n dist F D / dist (t.points 2) (t.points 0) +\n dist D E / dist (t.points 0) (t.points 1)\n\n/-- The full formalized assertion: for every acute Euclidean triangle `ABC`, and\nfor every points `D`, `E`, `F` that are the feet of the internal angle bisectors\nfrom `A`, `B`, `C` on `BC`, `CA`, `AB`, respectively, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ (t : Affine.Triangle ℝ Plane),\n t.AcuteAngled →\n ∀ D E F : Plane,\n IsInternalAngleBisectorFoot (t.points 0) (t.points 1) (t.points 2) D →\n IsInternalAngleBisectorFoot (t.points 1) (t.points 2) (t.points 0) E →\n IsInternalAngleBisectorFoot (t.points 2) (t.points 0) (t.points 1) F →\n angleBisectorInequality t D E F\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6ea16396-028a-5c7d-aae3-3ac889d0451e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3fb89b5267dd3be5eee6e7de79c01e9b9b55428b35813385fa1e4e8ab9f8b92c", "task_path": "tasks/nmp3_6ea16396-028a-5c7d-aae3-3ac889d0451e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6ea16396-028a-5c7d-aae3-3ac889d0451e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6eac2623-38a2-5c4d-b771-e2c3f858ff3e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $abc=1$. Prove that \n-- \\[\n-- \\frac{a^{2}}{\\sqrt{1+a}}+\\frac{b^{2}}{\\sqrt{1+b}}+\\frac{c^{2}}{\\sqrt{1+c}}\n-- \\;\\ge\\;\n-- \\sqrt{\\frac{3\\,(a^{2}+b^{2}+c^{2})}{2}}\\;.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove an inequality for three positive real\nnumbers whose product is one.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition on the reals `a`, `b`, and `c`:\nall three are positive and their product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = (1 : ℝ)\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 2 / Real.sqrt ((1 : ℝ) + a) + b ^ 2 / Real.sqrt ((1 : ℝ) + b) +\n c ^ 2 / Real.sqrt ((1 : ℝ) + c)\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n Real.sqrt ((3 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2) / (2 : ℝ))\n\n/-- For all positive real numbers `a`, `b`, `c` with `a * b * c = 1`,\nthe sum `a^2 / sqrt (1 + a) + b^2 / sqrt (1 + b) + c^2 / sqrt (1 + c)`\nis at least `sqrt (3 * (a^2 + b^2 + c^2) / 2)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6eac2623-38a2-5c4d-b771-e2c3f858ff3e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a58f21091e6d7079c617dbf161286467a0978bac1ac1a0f061ada4c7782dbfb2", "task_path": "tasks/nmp3_6eac2623-38a2-5c4d-b771-e2c3f858ff3e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6eac2623-38a2-5c4d-b771-e2c3f858ff3e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6ef686f8-f75d-5d5e-979e-766221a43de8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- \\frac{a^{2}}{(b+c)^{2}}+\\frac{b^{2}}{(c+a)^{2}}+\\frac{c^{2}}{(a+b)^{2}}+\\frac14\\ge\\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of a three-variable real inequality\n\nThe original problem asks to prove, for positive real numbers `a`, `b`, and `c`,\n\n`a^2 / (b+c)^2 + b^2 / (c+a)^2 + c^2 / (a+b)^2 + 1/4`\n` ≥ (a^2 + b^2 + c^2) / (a*b + b*c + c*a)`.\n\nThis file only declares the proposition; it deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The positivity hypothesis `a, b, c > 0` from the problem statement. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 2 / (b + c) ^ 2 + b ^ 2 / (c + a) ^ 2 + c ^ 2 / (a + b) ^ 2 + (1 : ℝ) / 4\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a)\n\n/-- The displayed inequality for a fixed triple of real numbers. -/\ndef Inequality (a b c : ℝ) : Prop :=\n rhs a b c ≤ lhs a b c\n\n/-- The complete universal proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6ef686f8-f75d-5d5e-979e-766221a43de8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a89612175d7741fe7e4c6476542b2bb5b156d7e69574d0bf36ee5f991e325877", "task_path": "tasks/nmp3_6ef686f8-f75d-5d5e-979e-766221a43de8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6ef686f8-f75d-5d5e-979e-766221a43de8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6ef6b939-4f8c-57cd-b6aa-02ec070aae50", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $M,N,P$ be arbitrary points on the sides $BC,CA,AB$ respectively of an acute‑angled triangle $ABC$. Prove that at least one of the three inequalities \n-- $$NP\\ge\\frac12\\,BC,\\qquad PM\\ge\\frac12\\,CA,\\qquad MN\\ge\\frac12\\,AB$$ \n-- holds.\nmodule\n\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Geometry.Euclidean.Simplex\npublic import Mathlib.Analysis.Convex.Segment\n\n@[expose] public section\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The Euclidean plane in which the triangle and all its side points are interpreted. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `OnClosedSide X A B` means that `X` lies on the closed line segment with endpoints `A`\nand `B`. This is the interpretation of being a point on the side `AB` of a triangle. -/\ndef OnClosedSide (X A B : Plane) : Prop :=\n X ∈ segment ℝ A B\n\n/-- A nondegenerate Euclidean triangle with vertices `A`, `B`, and `C` is acute-angled when\nall three of its interior angles are strictly less than a right angle. Affine independence\nexpresses that the three points really form a (non-collinear) triangle. -/\ndef AcuteTriangle (A B C : Plane) : Prop :=\n AffineIndependent ℝ ![A, B, C] ∧\n EuclideanGeometry.angle A B C < Real.pi / 2 ∧\n EuclideanGeometry.angle B C A < Real.pi / 2 ∧\n EuclideanGeometry.angle C A B < Real.pi / 2\n\n/-- The first asserted inequality: `NP ≥ (1 / 2) * BC`. -/\ndef NPGeHalfBC (B C N P : Plane) : Prop :=\n dist N P ≥ (1 / 2 : ℝ) * dist B C\n\n/-- The second asserted inequality: `PM ≥ (1 / 2) * CA`. -/\ndef PMGeHalfCA (C A P M : Plane) : Prop :=\n dist P M ≥ (1 / 2 : ℝ) * dist C A\n\n/-- The third asserted inequality: `MN ≥ (1 / 2) * AB`. -/\ndef MNGeHalfAB (A B M N : Plane) : Prop :=\n dist M N ≥ (1 / 2 : ℝ) * dist A B\n\n/-- The disjunctive conclusion of the problem: at least one of the three asserted\nhalf-side inequalities holds. -/\ndef Conclusion (A B C M N P : Plane) : Prop :=\n NPGeHalfBC B C N P ∨ PMGeHalfCA C A P M ∨ MNGeHalfAB A B M N\n\n/-- The statement of the problem. For every acute-angled triangle `ABC` and every choice of\npoints `M`, `N`, and `P` on the respective closed sides `BC`, `CA`, and `AB`, at least one of\n`NP ≥ BC / 2`, `PM ≥ CA / 2`, and `MN ≥ AB / 2` holds. -/\ndef Target : Prop :=\n ∀ (A B C M N P : Plane),\n AcuteTriangle A B C →\n OnClosedSide M B C →\n OnClosedSide N C A →\n OnClosedSide P A B →\n Conclusion A B C M N P\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6ef6b939-4f8c-57cd-b6aa-02ec070aae50", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0056ae164b5a58820da8949e57bc17f907c84f88cb7679f5ca725cbe9b46f039", "task_path": "tasks/nmp3_6ef6b939-4f8c-57cd-b6aa-02ec070aae50", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6ef6b939-4f8c-57cd-b6aa-02ec070aae50", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6efacb6b-d525-5223-982a-1aa2d65395a8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find two monotone non‑increasing sequences of non‑negative real numbers $(a_n)$ and $(b_n)$ such that both series $\\displaystyle\\sum_{n=1}^{\\infty}a_n$ and $\\displaystyle\\sum_{n=1}^{\\infty}b_n$ diverge, while the series $\\displaystyle\\sum_{n=1}^{\\infty}\\min\\{a_n,b_n\\}$ converges.\nimport Mathlib\n\n/-!\n# Two monotone nonnegative divergent series with convergent pointwise minimum\n\nThe problem concerns real sequences indexed by positive integers `n = 1, 2, ...`.\nWe use `ℕ+` (the subtype of positive natural numbers) as the index type, so no\ncondition on a term at index `0` has to be introduced.\n-/\n\nnamespace Problem\n\n/-- The positive integer corresponding to the `k`-th term of a series starting\nat `1`: the term with index `k + 1`. -/\ndef PositiveIndex (k : ℕ) : ℕ+ :=\n ⟨k + 1, Nat.succ_pos k⟩\n\n/-- Every term of the sequence is nonnegative. -/\ndef Nonnegative (a : ℕ+ → ℝ) : Prop :=\n ∀ n : ℕ+, 0 ≤ a n\n\n/-- The sequence is monotone non-increasing: `a (n+1) ≤ a n` for all positive\ninteger indices `n`. -/\ndef Nonincreasing (a : ℕ+ → ℝ) : Prop :=\n ∀ n : ℕ+, a (n + 1) ≤ a n\n\n/-- The series `a_1 + a_2 + ...` has a finite real sum: its partial sums tend\nto some real limit. -/\ndef SeriesFromOneConverges (a : ℕ+ → ℝ) : Prop :=\n ∃ L : ℝ,\n Filter.Tendsto\n (fun N : ℕ => Finset.sum (Finset.range N) (fun k : ℕ => a (PositiveIndex k)))\n Filter.atTop\n (nhds L)\n\n/-- The series `a_1 + a_2 + ...` diverges: its partial sums have no finite real\nlimit. -/\ndef SeriesFromOneDiverges (a : ℕ+ → ℝ) : Prop :=\n ¬ SeriesFromOneConverges a\n\n/-- An ordered pair of positive-indexed real sequences is a solution of the\nproblem when both sequences are nonnegative and monotone non-increasing, both\nindividual series diverge, and the series of pointwise minima converges. -/\ndef AdmissiblePair (a b : ℕ+ → ℝ) : Prop :=\n Nonincreasing a ∧\n Nonincreasing b ∧\n Nonnegative a ∧\n Nonnegative b ∧\n SeriesFromOneDiverges a ∧\n SeriesFromOneDiverges b ∧\n SeriesFromOneConverges (fun n : ℕ+ => min (a n) (b n))\n\n/-- Correctness of a proposed ordered pair of sequences for the problem. -/\ndef AnswerCorrect (a b : ℕ+ → ℝ) : Prop :=\n AdmissiblePair a b\n\n/-- The problem asks for the existence of two real sequences satisfying all of\nthe stated conditions. -/\ndef Target : Prop :=\n ∃ a b : ℕ+ → ℝ, AnswerCorrect a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6efacb6b-d525-5223-982a-1aa2d65395a8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "63d41038d8c9b330fd559db0cf82c152735a849b31cb93b9bfebc08ad73e662f", "task_path": "tasks/nmp3_6efacb6b-d525-5223-982a-1aa2d65395a8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6efacb6b-d525-5223-982a-1aa2d65395a8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6eff6118-9da1-5e35-aabb-de15d97276ab", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a^{2}+b^{2}+c^{2}}{2(ab+bc+ca)}+\\frac{a^{3}+b^{3}+c^{3}}{3abc}+\\frac{12abc}{(a+b)(b+c)(c+a)}\\ge 3.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) / (2 * (a * b + b * c + c * a)) +\n (a ^ 3 + b ^ 3 + c ^ 3) / (3 * a * b * c) +\n (12 * a * b * c) / ((a + b) * (b + c) * (c + a))\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the displayed quantity is at\nleast `3`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6eff6118-9da1-5e35-aabb-de15d97276ab", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bbe7f00d4163763b2e649d741993b304cb9c7b3aa570f3bcfc55ef1b20ea6ca9", "task_path": "tasks/nmp3_6eff6118-9da1-5e35-aabb-de15d97276ab", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6eff6118-9da1-5e35-aabb-de15d97276ab", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6f2a71b3-9915-5171-afb9-4935116243e2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a^{4}+b^{4}+c^{4}=3$. Prove that \n-- \\[\n-- \\frac{a^{2}}{b^{3}+1}+\\frac{b^{2}}{c^{3}+1}+\\frac{c^{2}}{a^{3}+1}\\ge\\frac{3}{2}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic inequality\n\nThis file records the statement of the source problem as a proposition. It does not\ncontain a proof of that proposition.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition from the problem: `a`, `b`, and `c` are positive\nreal numbers whose fourth powers sum to `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n (0 : ℝ) < a ∧ (0 : ℝ) < b ∧ (0 : ℝ) < c ∧\n a ^ (4 : ℕ) + b ^ (4 : ℕ) + c ^ (4 : ℕ) = (3 : ℝ)\n\n/-- The cyclic inequality asserted in the problem. All operations are over `ℝ`;\nin particular, the divisions are real divisions. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a ^ (2 : ℕ) / (b ^ (3 : ℕ) + (1 : ℝ)) +\n b ^ (2 : ℕ) / (c ^ (3 : ℕ) + (1 : ℝ)) +\n c ^ (2 : ℕ) / (a ^ (3 : ℕ) + (1 : ℝ)) ≥ (3 : ℝ) / 2\n\n/-- The complete universal statement of the problem: every admissible triple of\npositive real numbers satisfies the asserted cyclic inequality. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6f2a71b3-9915-5171-afb9-4935116243e2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b48520ceecc28d89e7bebe9272c7efe8ea88cad9739b8d9f0a85a092350f8200", "task_path": "tasks/nmp3_6f2a71b3-9915-5171-afb9-4935116243e2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6f2a71b3-9915-5171-afb9-4935116243e2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6f548c00-5cc2-59cf-b352-be6186feb584", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ with $xyz\\ge1$. Prove that \n-- \\[\n-- \\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}}\\ge0.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def LHS (x y z : ℝ) : ℝ :=\n (x ^ 5 - x ^ 2) / (x ^ 5 + y ^ 2 + z ^ 2) +\n (y ^ 5 - y ^ 2) / (x ^ 2 + y ^ 5 + z ^ 2) +\n (z ^ 5 - z ^ 2) / (x ^ 2 + y ^ 2 + z ^ 5)\n\n/-- The assertion to be proved: for all positive reals `x`, `y`, and `z`\nwhose product is at least one, the displayed sum is nonnegative. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n 1 ≤ x * y * z →\n 0 ≤ LHS x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6f548c00-5cc2-59cf-b352-be6186feb584", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fdb6eeb676491c6e74b1fad15720438e73953118ed9a779411db506fbbc1d0c8", "task_path": "tasks/nmp3_6f548c00-5cc2-59cf-b352-be6186feb584", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6f548c00-5cc2-59cf-b352-be6186feb584", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6f7f6016-3a08-56ea-906b-66083fb78ab2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ be real numbers such that no two of them are zero (equivalently $ab+bc+ca>0$). Prove that\n-- \\[\n-- \\frac{1}{(a+b)^{2}}+\\frac{1}{(b+c)^{2}}+\\frac{1}{(c+a)^{2}}\\ge\\frac{9}{4(ab+bc+ca)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a three-variable real inequality\n\nThe source problem asks to prove that for nonnegative real numbers\n`a`, `b`, and `c`, with no two of them equal to zero (equivalently,\nwith `a * b + b * c + c * a > 0`),\n\n`1 / (a + b)^2 + 1 / (b + c)^2 + 1 / (c + a)^2\n >= 9 / (4 * (a * b + b * c + c * a))`.\n\nThis file records the definitions and the target proposition. It does not\ncontain a proof of the target inequality. The small equivalence between the\ntwo supplied forms of the hypothesis is stated and proved explicitly; this\nonly justifies using either formulation for the same admissibility condition.\n-/\n\nnamespace Problem\n\n/-- The three variables are nonnegative real numbers. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- No pair among `a`, `b`, and `c` consists of two zero entries: it is\nnot the case that `a` and `b` are both zero, nor `b` and `c`, nor `c` and\n`a`. -/\ndef NoTwoZero (a b c : ℝ) : Prop :=\n ¬(a = 0 ∧ b = 0) ∧ ¬(b = 0 ∧ c = 0) ∧ ¬(c = 0 ∧ a = 0)\n\n/-- The equivalent algebraic admissibility condition stated in the problem. -/\ndef PairProductPositive (a b c : ℝ) : Prop :=\n 0 < a * b + b * c + c * a\n\n/-- Under nonnegativity, saying that no two variables are zero is equivalent\nto saying that `a * b + b * c + c * a` is positive. -/\ntheorem noTwoZero_iff_pairProductPositive (a b c : ℝ)\n (h : Nonnegative a b c) :\n NoTwoZero a b c ↔ PairProductPositive a b c := by\n rcases h with ⟨ha, hb, hc⟩\n constructor\n · rintro ⟨h12, h23, h31⟩\n change 0 < a * b + b * c + c * a\n by_cases ha0 : a = 0\n · have hbne : b ≠ 0 := by\n intro hb0\n exact h12 ⟨ha0, hb0⟩\n have hcne : c ≠ 0 := by\n intro hc0\n exact h31 ⟨hc0, ha0⟩\n have hbpos : 0 < b := lt_of_le_of_ne hb (Ne.symm hbne)\n have hcpos : 0 < c := lt_of_le_of_ne hc (Ne.symm hcne)\n have hbc : 0 < b * c := mul_pos hbpos hcpos\n nlinarith\n · by_cases hb0 : b = 0\n · have hane : a ≠ 0 := by\n intro ha0'\n exact h12 ⟨ha0', hb0⟩\n have hcne : c ≠ 0 := by\n intro hc0\n exact h23 ⟨hb0, hc0⟩\n have hapos : 0 < a := lt_of_le_of_ne ha (Ne.symm hane)\n have hcpos : 0 < c := lt_of_le_of_ne hc (Ne.symm hcne)\n have hca : 0 < c * a := mul_pos hcpos hapos\n nlinarith\n · by_cases hc0 : c = 0\n · have hane : a ≠ 0 := by\n intro ha0'\n exact h31 ⟨hc0, ha0'⟩\n have hbne : b ≠ 0 := by\n intro hb0'\n exact h23 ⟨hb0', hc0⟩\n have hapos : 0 < a := lt_of_le_of_ne ha (Ne.symm hane)\n have hbpos : 0 < b := lt_of_le_of_ne hb (Ne.symm hbne)\n have hab : 0 < a * b := mul_pos hapos hbpos\n nlinarith\n · have hapos : 0 < a := lt_of_le_of_ne ha (Ne.symm ha0)\n have hbpos : 0 < b := lt_of_le_of_ne hb (Ne.symm hb0)\n have hab : 0 < a * b := mul_pos hapos hbpos\n have hbc_nonneg : 0 ≤ b * c := mul_nonneg hb hc\n have hca_nonneg : 0 ≤ c * a := mul_nonneg hc ha\n nlinarith\n · rintro hp\n constructor\n · rintro ⟨ha0, hb0⟩\n subst a\n subst b\n simp [PairProductPositive] at hp\n · constructor\n · rintro ⟨hb0, hc0⟩\n subst b\n subst c\n simp [PairProductPositive] at hp\n · rintro ⟨hc0, ha0⟩\n subst c\n subst a\n simp [PairProductPositive] at hp\n\n/-- Admissibility of `(a, b, c)` in the formulation using the literal\n\"no two are zero\" hypothesis. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ NoTwoZero a b c\n\n/-- The same admissibility condition using the equivalent product-positivity\nformulation given parenthetically in the problem. -/\ndef AdmissibleViaPairProduct (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ PairProductPositive a b c\n\n/-- The inequality target of the source problem.\n\nThe universal quantifiers range over all real `a`, `b`, and `c`. The\nhypotheses are nonnegativity, followed by the condition that no two of the\nthree numbers are zero. The conclusion uses real division and the\nnon-strict inequality `≥`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n 1 / ((a + b) ^ 2) +\n 1 / ((b + c) ^ 2) +\n 1 / ((c + a) ^ 2) ≥\n 9 / (4 * (a * b + b * c + c * a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6f7f6016-3a08-56ea-906b-66083fb78ab2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a46791e423a69e0a4c4ce9285708eff63f4471bb8612df8456cf27dfd9d5ddd5", "task_path": "tasks/nmp3_6f7f6016-3a08-56ea-906b-66083fb78ab2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6f7f6016-3a08-56ea-906b-66083fb78ab2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6fcb850c-cb55-5755-a641-eb4e77acb2fa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\ge0$ be real numbers such that no two of them are zero. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{a^{2}(b+c+d)}{(a+b)(a+c)(a+d)}\\le\\frac32\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- One cyclic summand\n`a^2 * (b + c + d) / ((a + b) * (a + c) * (a + d))`. -/\nnoncomputable def CyclicTerm (a b c d : ℝ) : ℝ :=\n a ^ 2 * (b + c + d) / ((a + b) * (a + c) * (a + d))\n\n/-- The cyclic sum over `(a, b, c, d)`, expanded as its four cyclic rotations. -/\nnoncomputable def CyclicSum (a b c d : ℝ) : ℝ :=\n CyclicTerm a b c d + CyclicTerm b c d a +\n CyclicTerm c d a b + CyclicTerm d a b c\n\n/-- No two of the four numbers are both zero. -/\ndef NoTwoZero (a b c d : ℝ) : Prop :=\n (a ≠ 0 ∨ b ≠ 0) ∧\n (a ≠ 0 ∨ c ≠ 0) ∧\n (a ≠ 0 ∨ d ≠ 0) ∧\n (b ≠ 0 ∨ c ≠ 0) ∧\n (b ≠ 0 ∨ d ≠ 0) ∧\n (c ≠ 0 ∨ d ≠ 0)\n\n/-- The admissibility assumptions: all variables are nonnegative reals and no\ntwo of them are zero. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 ≤ d ∧ NoTwoZero a b c d\n\n/-- The assertion of the problem: for every admissible quadruple of reals, the\ncyclic sum is at most `3 / 2`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → CyclicSum a b c d ≤ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6fcb850c-cb55-5755-a641-eb4e77acb2fa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "48c3403c9377b529059fca75a6d56ebc33962457edbb2c8641117979c9af387c", "task_path": "tasks/nmp3_6fcb850c-cb55-5755-a641-eb4e77acb2fa", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6fcb850c-cb55-5755-a641-eb4e77acb2fa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6fd8ad7e-cb3d-503d-9531-b9108abeb125", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A group consists of $n$ tourists. Among any three of them there are at least two who are not familiar with each other. For any partition of the group into two buses, at least one bus contains a pair of familiar tourists. Prove that there exists a tourist who is familiar with at most $\\displaystyle\\frac{2}{5}n$ of the tourists.\nimport Mathlib.Combinatorics.SimpleGraph.Clique\nimport Mathlib.Combinatorics.SimpleGraph.Finite\nimport Mathlib.Data.Rat.Defs\n\n/-!\n# Formalization of the tourist familiarity problem\n\nThe tourists are represented by `Fin n`, and the symmetric, irreflexive familiarity\nrelation is represented by a `SimpleGraph`. The statement is packaged as the\nproposition `Problem.Target`; no proof of it is supplied here.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- No three tourists are pairwise familiar.\n\nEquivalently, this is the triangle-free condition on the familiarity graph. -/\ndef TriangleFree {n : ℕ} (G : SimpleGraph (Fin n)) : Prop :=\n G.CliqueFree 3\n\n/-- A bus contains a familiar pair if two distinct tourists assigned to that bus\nare adjacent in the familiarity graph. -/\ndef ContainsFamiliarPair {n : ℕ} (G : SimpleGraph (Fin n))\n (bus : Set (Fin n)) : Prop :=\n ∃ u ∈ bus, ∃ v ∈ bus, u ≠ v ∧ G.Adj u v\n\n/-- A partition of the tourists into two buses.\n\nThe two buses are an ordered pair of disjoint sets whose union is the whole group.\nEmpty buses are permitted; this convention makes the second hypothesis express\nexactly that there is no proper two-colouring of the familiarity graph. -/\ndef IsTwoBusPartition {n : ℕ} (bus₁ bus₂ : Set (Fin n)) : Prop :=\n Disjoint bus₁ bus₂ ∧ bus₁ ∪ bus₂ = Set.univ\n\n/-- Every partition of the tourists into two buses has a familiar pair in at least\none of the two buses. -/\ndef EveryTwoBusPartitionHasFamiliarPair {n : ℕ}\n (G : SimpleGraph (Fin n)) : Prop :=\n ∀ bus₁ bus₂ : Set (Fin n),\n IsTwoBusPartition bus₁ bus₂ →\n ContainsFamiliarPair G bus₁ ∨ ContainsFamiliarPair G bus₂\n\n/-- Tourist `v` is familiar with at most `(2 / 5) * n` tourists.\n\nThe comparison is made in `ℚ`, so the bound is the exact rational bound occurring\nin the source rather than a natural-number division (which would be truncated). -/\ndef DegreeAtMostTwoFifths {n : ℕ} (G : SimpleGraph (Fin n))\n (v : Fin n) : Prop :=\n letI : DecidableRel G.Adj := Classical.decRel G.Adj\n (G.degree v : ℚ) ≤ (2 / 5 : ℚ) * (n : ℚ)\n\n/-- There exists a tourist familiar with at most `(2 / 5) * n` tourists. -/\ndef ExistsTouristWithSmallDegree {n : ℕ}\n (G : SimpleGraph (Fin n)) : Prop :=\n ∃ v : Fin n, DegreeAtMostTwoFifths G v\n\n/-- The complete assertion of the source problem: for every group size `n` and\nevery familiarity graph on the tourists, if the graph is triangle-free and every\ntwo-bus partition has a familiar pair in one of its buses, then some tourist has\ndegree at most `(2 / 5) * n`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (G : SimpleGraph (Fin n)),\n TriangleFree G →\n EveryTwoBusPartitionHasFamiliarPair G →\n ExistsTouristWithSmallDegree G\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6fd8ad7e-cb3d-503d-9531-b9108abeb125", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1860b4dad017f61dfd08901fa1cf39e26d8799d0fa924c47889c04d488a06e1e", "task_path": "tasks/nmp3_6fd8ad7e-cb3d-503d-9531-b9108abeb125", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6fd8ad7e-cb3d-503d-9531-b9108abeb125", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6fdae524-58b4-5ebe-a32a-05395e5788b9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c>0$ satisfy $a^{2}+b^{2}+c^{2}+abc=4$, prove that \n-- $$ab+bc+ca\\le 2+\\sqrt{abc}\\,. $$\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`\nsatisfying `a^2 + b^2 + c^2 + abc = 4`, one has\n`ab + bc + ca ≤ 2 + sqrt(abc)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 + a * b * c = 4 →\n a * b + b * c + c * a ≤ 2 + Real.sqrt (a * b * c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6fdae524-58b4-5ebe-a32a-05395e5788b9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c8657bc0e6b4d390096abd0a0c96f81f03dff58de40d4bd813db59bbd13b6601", "task_path": "tasks/nmp3_6fdae524-58b4-5ebe-a32a-05395e5788b9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6fdae524-58b4-5ebe-a32a-05395e5788b9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_6ffe2f28-ce61-5b4d-b58a-56c575c1db3a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- $$\\frac{3}{\\sqrt{5}} \\ge \\frac{a}{\\sqrt{b^2+(c+a)^2}}+\\frac{b}{\\sqrt{c^2+(b+a)^2}}+\\frac{c}{\\sqrt{a^2+(c+b)^2}}.$$\nimport Mathlib\n\n/-!\n# Formal statement: a cyclic square-root denominator inequality\n\nThe source problem asks to prove the following inequality for positive real\nnumbers `a`, `b`, and `c`:\n\n`3 / sqrt 5 ≥ a / sqrt (b^2 + (c + a)^2)\n + b / sqrt (c^2 + (b + a)^2)\n + c / sqrt (a^2 + (c + b)^2)`.\n\nThis file only states the target as a proposition; it does not supply a proof.\n-/\n\nnamespace Problem\n\n/-- The inequality of the problem, universally quantified over positive reals. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 3 / Real.sqrt 5 ≥\n a / Real.sqrt (b ^ 2 + (c + a) ^ 2) +\n b / Real.sqrt (c ^ 2 + (b + a) ^ 2) +\n c / Real.sqrt (a ^ 2 + (c + b) ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6ffe2f28-ce61-5b4d-b58a-56c575c1db3a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "80225538faea9e71eafe08744fe609f224c4df6142ef5d674520b9b57284975c", "task_path": "tasks/nmp3_6ffe2f28-ce61-5b4d-b58a-56c575c1db3a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "6ffe2f28-ce61-5b4d-b58a-56c575c1db3a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_700fd471-0c55-5968-b9bb-5ef008865185", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c,d\\ge 0$ satisfy $a\\ge b\\ge c\\ge d$ and $a^{2}+b^{2}+c^{2}+d^{2}=4$, prove that \n-- \\[\n-- 1-\\sqrt{abcd}\\;\\ge\\;\\frac13\\,(b-d)^{2}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypotheses of the problem for four real numbers `a`, `b`, `c`, and `d`:\nthey are nonnegative, ordered as `a ≥ b ≥ c ≥ d`, and their squares sum to `4`. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 ≤ d ∧\n a ≥ b ∧ b ≥ c ∧ c ≥ d ∧\n a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = 4\n\n/-- The assertion to be proved: for all real `a`, `b`, `c`, and `d` satisfying the\nadmissibility hypotheses, `1 - sqrt (a*b*c*d) ≥ (1/3) * (b-d)^2`. -/\ndef Target : Prop :=\n ∀ (a b c d : ℝ), Admissible a b c d →\n 1 - Real.sqrt (a * b * c * d) ≥ (1 / 3 : ℝ) * (b - d) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "700fd471-0c55-5968-b9bb-5ef008865185", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f3245f8885d51eaf6bd504c2f0f050e9e3b36ef3e8cff07bea49f72affe41c0c", "task_path": "tasks/nmp3_700fd471-0c55-5968-b9bb-5ef008865185", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "700fd471-0c55-5968-b9bb-5ef008865185", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_70388b27-218b-517b-808d-21ca16679e1a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose that $n$ and $k$ are positive integers such that \n-- \\[\n-- \\underbrace{\\varphi(\\varphi(\\dots\\varphi}_{k\\text{ times}}(n)\\dots)=1.\n-- \\] \n-- Prove that $n\\le 3^{k}\\,,$ where $\\varphi$ denotes Euler’s totient function (with $\\varphi(1)=1$).\nimport Mathlib.Data.Nat.Totient\n\n/-!\n# Formal statement for the iterated Euler totient bound\n\nThe source problem asks to prove that if a positive integer `n` reaches `1`\nafter exactly `k` applications of Euler's totient function, with `k` positive,\nthen `n ≤ 3 ^ k`.\n-/\n\nnamespace Problem\n\n/-- The result of applying Euler's totient function exactly `k` times to `n`. -/\ndef iteratedTotient (k n : ℕ) : ℕ :=\n Nat.totient^[k] n\n\n/--\nThe formal target: for all positive natural numbers `n` and `k`, if the\n`k`-fold iterate of `Nat.totient` at `n` is `1`, then `n ≤ 3 ^ k`.\n\n`Nat.totient` is Mathlib's Euler totient function; in particular\n`Nat.totient 1 = 1`, as required by the parenthetical in the source.\n-/\ndef Target : Prop :=\n ∀ n k : ℕ, 0 < n → 0 < k → iteratedTotient k n = 1 → n ≤ 3 ^ k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "70388b27-218b-517b-808d-21ca16679e1a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a27b80acbd68608775b0c83631ccbff526dae9960a88c2d887873198ac716495", "task_path": "tasks/nmp3_70388b27-218b-517b-808d-21ca16679e1a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "70388b27-218b-517b-808d-21ca16679e1a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7038b4db-ab9f-5832-abd0-c28c7281f129", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\in\\mathbb{R}^+$ with $xyz=1$. Prove that \n-- \\[\n-- \\frac{x^8+y^8-x^4y-xy^4}{\\,x^8+y^8+z^4\\,}\n-- +\\frac{y^8+z^8-y^4z-yz^4}{\\,y^8+z^8+x^4\\,}\n-- +\\frac{z^8+x^8-z^4x-zx^4}{\\,z^8+x^8+y^4\\,}\\ge 0.\n-- \\]\n/-\nFormalization of the inequality problem in `problem.md`.\nThe statement is intentionally expressed as a proposition-valued definition;\nno proof of the inequality is supplied.\n-/\n\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LHS (x y z : ℝ) : ℝ :=\n (x ^ 8 + y ^ 8 - x ^ 4 * y - x * y ^ 4) /\n (x ^ 8 + y ^ 8 + z ^ 4) +\n (y ^ 8 + z ^ 8 - y ^ 4 * z - y * z ^ 4) /\n (y ^ 8 + z ^ 8 + x ^ 4) +\n (z ^ 8 + x ^ 8 - z ^ 4 * x - z * x ^ 4) /\n (z ^ 8 + x ^ 8 + y ^ 4)\n\n/-- For positive real numbers `x`, `y`, and `z` satisfying `x * y * z = 1`,\nthe indicated sum of three rational expressions is nonnegative. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n x * y * z = (1 : ℝ) → LHS x y z ≥ (0 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7038b4db-ab9f-5832-abd0-c28c7281f129", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6df377c888e79db913b494444c905f1c96561e7249c9ad6f641531fe4931c9e2", "task_path": "tasks/nmp3_7038b4db-ab9f-5832-abd0-c28c7281f129", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7038b4db-ab9f-5832-abd0-c28c7281f129", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_70578cab-9c69-587c-a13b-cec554c91d38", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, $c$ be positive numbers such that $abc=1$. Prove that \n-- \\[\n-- a^{2}b+b^{2}c+c^{2}a\\ge \\sqrt{3\\,(a^{2}+b^{2}+c^{2})}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the proposed inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose product is `1`, that\n`a^2 * b + b^2 * c + c^2 * a ≥ sqrt (3 * (a^2 + b^2 + c^2))`.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissibility assumptions on the three numbers in the source problem:\nthey are all positive and their product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The left-hand side of the desired inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a ^ 2 * b + b ^ 2 * c + c ^ 2 * a\n\n/-- The right-hand side of the desired inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n Real.sqrt (3 * (a ^ 2 + b ^ 2 + c ^ 2))\n\n/-- The inequality asserted in the source problem, for fixed `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete proposition to be proved: for every triple of positive real\nnumbers with product one, the asserted inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "70578cab-9c69-587c-a13b-cec554c91d38", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "abc8dc5073c387108e3b02fb03ac770db6068c3ccd172e124086e0c59d59bc34", "task_path": "tasks/nmp3_70578cab-9c69-587c-a13b-cec554c91d38", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "70578cab-9c69-587c-a13b-cec554c91d38", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_706165f4-ebed-54ae-8169-31f9ed9c4d7a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $X,Y\\in M_{7}(\\mathbb{C})$. If $X^{3}+Y^{3}=O_{7}$ and $YX-X^{2}Y^{2}=I_{7}$, prove that $XY-Y^{2}X^{2}=I_{7}$.\nimport Mathlib\n\n/-!\nFormal statement for the problem:\n\nLet `X Y ∈ M_7(ℂ)`. If `X^3 + Y^3 = O_7` and\n`Y * X - X^2 * Y^2 = I_7`, prove that\n`X * Y - Y^2 * X^2 = I_7`.\n-/\n\nnamespace Problem\n\n/-- The type of `7 × 7` matrices over `ℂ`, i.e. `M_7(ℂ)`. -/\nabbrev Matrix7 : Type := Matrix (Fin 7) (Fin 7) ℂ\n\n/-- The `7 × 7` zero matrix `O_7`. -/\ndef O7 : Matrix7 := 0\n\n/-- The `7 × 7` identity matrix `I_7`. -/\ndef I7 : Matrix7 := 1\n\n/-- The first supplied matrix equation. -/\ndef firstEquation (X Y : Matrix7) : Prop :=\n X ^ 3 + Y ^ 3 = O7\n\n/-- The second supplied matrix equation. -/\ndef secondEquation (X Y : Matrix7) : Prop :=\n Y * X - X ^ 2 * Y ^ 2 = I7\n\n/-- The matrix equation asserted as the conclusion of the problem. -/\ndef conclusionEquation (X Y : Matrix7) : Prop :=\n X * Y - Y ^ 2 * X ^ 2 = I7\n\n/-- The full assertion: for every pair of `7 × 7` complex matrices satisfying\nthe two displayed hypotheses, the displayed conclusion holds. -/\ndef Target : Prop :=\n ∀ X Y : Matrix7,\n firstEquation X Y →\n secondEquation X Y →\n conclusionEquation X Y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "706165f4-ebed-54ae-8169-31f9ed9c4d7a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "946b60c3b574afed41bbe77ec0d7c4bada6d8fade91c8be910f4d129468874ab", "task_path": "tasks/nmp3_706165f4-ebed-54ae-8169-31f9ed9c4d7a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "706165f4-ebed-54ae-8169-31f9ed9c4d7a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_709b3565-76dd-5447-8c15-5c2c89694f7e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $(ab)^4+(bc)^4+(ca)^4=(abc)^2$. Prove that $a^5+b^5+c^5<\\frac14$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem:\n\nFor all positive real numbers `a`, `b`, and `c`, if\n`(ab)^4 + (bc)^4 + (ca)^4 = (abc)^2`, then\n`a^5 + b^5 + c^5 < 1 / 4`.\n\nThis is a statement definition; it does not assert or supply a proof. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (a * b) ^ 4 + (b * c) ^ 4 + (c * a) ^ 4 = (a * b * c) ^ 2 →\n a ^ 5 + b ^ 5 + c ^ 5 < (1 : ℝ) / 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "709b3565-76dd-5447-8c15-5c2c89694f7e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7cc90f04e045b38f921d36a6f6e6429994ccbd7a56553a93da1e8eaa211c184d", "task_path": "tasks/nmp3_709b3565-76dd-5447-8c15-5c2c89694f7e", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "709b3565-76dd-5447-8c15-5c2c89694f7e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_709c92dd-d95b-54b9-aba7-1bdccd2d5a2e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be non‑negative real numbers satisfying $ab+ac+ad+bc+bd+cd=6$. Prove that \n-- \\[\n-- \\frac{1}{a^2+1}+\\frac{1}{b^2+1}+\\frac{1}{c^2+1}+\\frac{1}{d^2+1}\\ge 2.\n-- \\]\nimport Mathlib.Data.Real.Basic\n\n/-!\n# Formal statement: a four-variable inequality under a pairwise-product constraint\n\nThe source problem asks to prove an inequality for non-negative real numbers\n`a`, `b`, `c`, and `d` whose six pairwise products sum to `6`.\n-/\n\nnamespace Problem\n\n/-- All four variables are non-negative real numbers. -/\ndef NonnegativeVariables (a b c d : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 ≤ d\n\n/-- The sum of all six pairwise products is equal to `6`. -/\ndef PairwiseProductSumEqSix (a b c d : ℝ) : Prop :=\n a * b + a * c + a * d + b * c + b * d + c * d = 6\n\n/-- The admissibility condition imposed on the four real numbers. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n NonnegativeVariables a b c d ∧ PairwiseProductSumEqSix a b c d\n\n/-- The conclusion asserted in the source problem. -/\ndef Conclusion (a b c d : ℝ) : Prop :=\n 1 / (a ^ 2 + 1) + 1 / (b ^ 2 + 1) + 1 / (c ^ 2 + 1) + 1 / (d ^ 2 + 1) ≥ 2\n\n/-- The full universally quantified target statement of the problem. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Conclusion a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "709c92dd-d95b-54b9-aba7-1bdccd2d5a2e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4172733c6ee1805f4deab07a6ae08729c821f0d9e551b78a851406f2831de79e", "task_path": "tasks/nmp3_709c92dd-d95b-54b9-aba7-1bdccd2d5a2e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "709c92dd-d95b-54b9-aba7-1bdccd2d5a2e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_709f3985-91cb-5b73-8865-3a94aadcb1c3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{a}{9+a-c}+\\frac{b}{9+b-a}+\\frac{c}{9+c-b}\\le \\frac{11}{6}-\\frac{a^{2}b}{a+b}-\\frac{b^{2}c}{b+c}-\\frac{c^{2}a}{c+a}\\,. \n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the inequality statement in `problem.md`.\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`\nwith `a + b + c = 3`, the stated inequality. This file only records the\nproposition; it does not provide a proof.\n-/\n\nnamespace Problem\n\n/-- The assertion stated in the problem.\n\nFor all positive real `a`, `b`, `c` satisfying `a + b + c = 3`,\n`a / (9 + a - c) + b / (9 + b - a) + c / (9 + c - b)` is at most\n`11 / 6 - a^2 * b / (a + b) - b^2 * c / (b + c) - c^2 * a / (c + a)`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c → a + b + c = 3 →\n a / (9 + a - c) + b / (9 + b - a) + c / (9 + c - b)\n ≤ (11 : ℝ) / 6 - a ^ 2 * b / (a + b)\n - b ^ 2 * c / (b + c) - c ^ 2 * a / (c + a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "709f3985-91cb-5b73-8865-3a94aadcb1c3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "723f8edaa3672c24c8c42a8ad3c2cf726937ffa5dd13325dc2193078f4ab8a1c", "task_path": "tasks/nmp3_709f3985-91cb-5b73-8865-3a94aadcb1c3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "709f3985-91cb-5b73-8865-3a94aadcb1c3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_70e54ea6-fbe4-5a33-9b1d-d78ebffd3236", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 2$ be an integer. An $n\\times n$ chessboard is filled with the numbers $1,2,\\dots,n^{2}$, each appearing exactly once. Prove that there exist two orthogonally adjacent squares (i.e., sharing a common edge) whose numbers differ by at least $n$.\nimport Mathlib\n\n/-!\n# Formal statement: large difference between adjacent squares of a filled chessboard\n\nThe source problem asks to prove that every filling of an `n × n` chessboard by\nthe numbers `1, ..., n²`, with each number used exactly once, contains two\northogonally adjacent squares whose entries differ by at least `n`.\n-/\n\nnamespace Problem\n\n/-- The squares of an `n × n` chessboard, represented by zero-based row and\ncolumn indices. -/\nabbrev Square (n : ℕ) : Type := Fin n × Fin n\n\n/-- Two squares are orthogonally adjacent when they are distinct and the\nManhattan distance between their row and column indices is exactly one. This\nis equivalent to saying that they share a common edge; in particular, there is\nno wrapping from the last row or column to the first. -/\ndef OrthogonallyAdjacent {n : ℕ} (p q : Square n) : Prop :=\n p ≠ q ∧\n Nat.dist p.1.val q.1.val + Nat.dist p.2.val q.2.val = 1\n\n/-- A filling of an `n × n` board by the numbers `1, ..., n²`, each appearing\nexactly once. The first conjunct bounds every entry by the required range;\nthe second says that each of the `n²` prescribed values occurs at a unique\nsquare. The type `Fin (n ^ 2)` enumerates the values from `0` to `n² - 1`,\nand adding one gives `1, ..., n²`. -/\ndef IsFilling {n : ℕ} (a : Square n → ℕ) : Prop :=\n (∀ s : Square n, 1 ≤ a s ∧ a s ≤ n ^ 2) ∧\n ∀ k : Fin (n ^ 2), ∃! s : Square n, a s = k.val + 1\n\n/-- The board filling has an orthogonally adjacent pair of squares whose\nentries differ by at least the board side length `n`. -/\ndef HasAdjacentDifferenceAtLeast {n : ℕ} (a : Square n → ℕ) : Prop :=\n ∃ p q : Square n,\n OrthogonallyAdjacent p q ∧ n ≤ Nat.dist (a p) (a q)\n\n/-- The full assertion of the problem: for every integer `n ≥ 2` and every\nfilling of an `n × n` chessboard by `1, ..., n²` exactly once, there are two\northogonally adjacent squares whose entries differ by at least `n`. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 2 ≤ n →\n ∀ (a : Square n → ℕ),\n IsFilling a → HasAdjacentDifferenceAtLeast a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "70e54ea6-fbe4-5a33-9b1d-d78ebffd3236", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "19afd11cf6a63050501a8757cb8a31be82a254c8cb86491723ba5848f76e6c08", "task_path": "tasks/nmp3_70e54ea6-fbe4-5a33-9b1d-d78ebffd3236", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "70e54ea6-fbe4-5a33-9b1d-d78ebffd3236", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_71005d02-0515-59b7-bf18-154983c1d5b3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy \n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\ge \\frac{b}{a}+\\frac{c}{b}+\\frac{a}{c}.\n-- \\] \n-- Prove that \n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}+1\\;\\ge\\;\\frac{12\\,(a^{2}+b^{2}+c^{2})}{(a+b+c)^{2}}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypotheses of the problem: `a`, `b`, and `c` are positive real numbers\nand satisfy the given cyclic inequality. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n (a / b + b / c + c / a ≥ b / a + c / b + a / c)\n\n/-- The asserted inequality, with real-number division and powers. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a / b + b / c + c / a + 1 ≥\n (12 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2) / (a + b + c) ^ 2\n\n/-- The complete statement to be proved: for all positive real `a`, `b`, and\n`c` satisfying the admissibility condition, the asserted inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71005d02-0515-59b7-bf18-154983c1d5b3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "263ccc25f9bc3c50a0f69a52bb94c8ead1cdd250268023decb950b2ce56f79ec", "task_path": "tasks/nmp3_71005d02-0515-59b7-bf18-154983c1d5b3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71005d02-0515-59b7-bf18-154983c1d5b3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_713ca7bf-b223-57d9-91fa-b8c705e334f6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^{4}}{b}+\\frac{b^{4}}{c}+\\frac{c^{4}}{a}+abc\\!\\left(\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\right)\\ge 2\\bigl(a^{3}+b^{3}+c^{3}\\bigr).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ (4 : ℕ) / b + b ^ (4 : ℕ) / c + c ^ (4 : ℕ) / a +\n a * b * c * (a / b + b / c + c / a)\n\n/-- The right-hand side of the inequality in the problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 2 * (a ^ (3 : ℕ) + b ^ (3 : ℕ) + c ^ (3 : ℕ))\n\n/-- The three strict positivity assumptions on the real variables. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The inequality asserted in the problem, as a predicate of `a`, `b`, and `c`. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/--\nThe assertion to be proved: for all positive real numbers `a`, `b`, and `c`,\nthe stated inequality holds.\n-/\nnoncomputable def Target : Prop :=\n ∀ (a b c : ℝ), PositiveTriple a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "713ca7bf-b223-57d9-91fa-b8c705e334f6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a949a6dad2047e621e67320de69767db2a3655696e7e64362547b9e62a74cbb3", "task_path": "tasks/nmp3_713ca7bf-b223-57d9-91fa-b8c705e334f6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "713ca7bf-b223-57d9-91fa-b8c705e334f6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_714749f7-886a-553d-95db-1ce1d67fd8b1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a^2+b^2+c^2=3$. Prove that \n-- \\[\n-- (a+b+c)^2+9\\Bigl(\\frac{1}{4-a^2}+\\frac{1}{4-b^2}+\\frac{1}{4-c^2}\\Bigr)\\le 18.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable inequality\n\nThe original problem asks, for positive real numbers `a`, `b`, and `c`\nsatisfying `a^2 + b^2 + c^2 = 3`, to prove the inequality\n\n`(a + b + c)^2 + 9 * (1/(4-a^2) + 1/(4-b^2) + 1/(4-c^2)) <= 18`.\n\nThis file records the assertion as a proposition-valued definition. No proof\nof the assertion is supplied at the statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- The reciprocal sum appearing in the inequality. -/\nnoncomputable def reciprocalSum (a b c : ℝ) : ℝ :=\n 1 / (4 - a ^ 2) + 1 / (4 - b ^ 2) + 1 / (4 - c ^ 2)\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a + b + c) ^ 2 + 9 * reciprocalSum a b c\n\n/-- The admissibility hypotheses imposed on the variables: positivity and the\nnormalization of the sum of squares. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 2 + b ^ 2 + c ^ 2 = 3\n\n/-- The complete inequality asserted in the original problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≤ 18\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "714749f7-886a-553d-95db-1ce1d67fd8b1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e00dac065da0674293a3afce5dac3f7cc83b62686a9ad8a7c9942e3bd643738a", "task_path": "tasks/nmp3_714749f7-886a-553d-95db-1ce1d67fd8b1", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "714749f7-886a-553d-95db-1ce1d67fd8b1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_716ad099-2cb1-5a30-b40c-42ffbddfb3da", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>1$ be an integer and let $a_1,a_2,\\dots,a_n$ be integers satisfying $n\\mid a_i-i$ for every $1\\le i\\le n$. Prove that there exists an infinite sequence $(b_k)_{k\\ge1}$ such that \n-- \n-- * $b_k\\in\\{a_1,a_2,\\dots,a_n\\}$ for every $k$, and \n-- * $\\displaystyle\\sum_{k=1}^{\\infty}\\frac{b_k}{n^k}$ is an integer.\nimport Mathlib\n\n/-!\n# Formalization of the target statement\n\nThe source problem asks, for every integer `n > 1` and integers `a_1, ..., a_n`\nwith `n ∣ a_i - i`, for an infinite sequence `(b_k)_{k ≥ 1}` whose terms lie\nin `{a_1, ..., a_n}` and whose series `∑_{k ≥ 1} b_k / n^k` converges to an\ninteger.\n\nWe represent the finite family `a_1, ..., a_n` as a function `Fin n → ℤ`,\nwhere `i : Fin n` corresponds to the source index `i.val + 1`. A sequence\nindexed by `k ≥ 1` is represented by a function `b : ℕ → ℤ`; only its values\nat positive indices are used in the statement. The infinite sum is expressed\nas the limit of its ordinary partial sums in `ℝ`.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The hypotheses on `n` and on the finite family `(a_1, ..., a_n)`.\n\nThe element `i : Fin n` represents the source index `i.val + 1`, so the\ncongruence is `n ∣ a_i - i` for every `i = 1, ..., n`. -/\ndef AdmissibleData (n : ℕ) (a : Fin n → ℤ) : Prop :=\n 1 < n ∧ ∀ i : Fin n, (n : ℤ) ∣ a i - ((i.val + 1 : ℕ) : ℤ)\n\n/-- The condition that every term `b_k` with `k ≥ 1` belongs to the finite set\n`{a_1, ..., a_n}`. The value `b 0` is irrelevant because the source sequence\nis indexed by positive integers. -/\ndef SequenceInSet (n : ℕ) (a : Fin n → ℤ) (b : ℕ → ℤ) : Prop :=\n ∀ k : ℕ, 1 ≤ k → b k ∈ Set.range a\n\n/-- The `N`-th partial sum of `∑_{k=1}^∞ b_k / n^k`, namely\n`∑_{k=1}^N b_k / n^k`, evaluated in `ℝ`. -/\nnoncomputable def partialSum (n : ℕ) (b : ℕ → ℤ) (N : ℕ) : ℝ :=\n ∑ k ∈ Finset.Icc 1 N, (b k : ℝ) / (n : ℝ) ^ k\n\n/-- The ordinary infinite series `∑_{k=1}^∞ b_k / n^k` converges in `ℝ` to\nsome integer. This is expressed by convergence of the partial sums\n`partialSum n b N` to the real cast of an integer `z`. -/\nnoncomputable def HasIntegerSum (n : ℕ) (b : ℕ → ℤ) : Prop :=\n ∃ z : ℤ,\n Filter.Tendsto (fun N : ℕ => partialSum n b N) Filter.atTop (nhds (z : ℝ))\n\n/-- The conclusion asserted for fixed admissible data: there is an infinite\nsequence taking all its positive-indexed values in `{a_1, ..., a_n}` whose\nseries `∑_{k=1}^∞ b_k / n^k` converges to an integer. -/\nnoncomputable def Conclusion (n : ℕ) (a : Fin n → ℤ) : Prop :=\n ∃ b : ℕ → ℤ, SequenceInSet n a b ∧ HasIntegerSum n b\n\n/-- The full target proposition of the problem: for every natural number\n`n > 1` and every finite integer family `(a_1, ..., a_n)` satisfying\n`n ∣ a_i - i` for all `i = 1, ..., n`, there exists an infinite integer\nsequence `(b_k)_{k ≥ 1}` contained in `{a_1, ..., a_n}` such that\n`∑_{k=1}^∞ b_k / n^k` is an integer. -/\nnoncomputable def Target : Prop :=\n ∀ (n : ℕ) (a : Fin n → ℤ),\n AdmissibleData n a → Conclusion n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "716ad099-2cb1-5a30-b40c-42ffbddfb3da", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "80bdc1259926d4a2329deed8732906425db265faaf63a3aa62253aad66904720", "task_path": "tasks/nmp3_716ad099-2cb1-5a30-b40c-42ffbddfb3da", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "716ad099-2cb1-5a30-b40c-42ffbddfb3da", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_71949a3e-b7a9-55be-811d-6d28f3955de4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any positive real numbers $a,b,c$,\n-- \\[\n-- \\sum_{cyc}\\frac{a^{2}+bc}{a^{2}+(b+c)^{2}}\\le\\frac{18}{5}\\cdot\\frac{a^{2}+b^{2}+c^{2}}{(a+b+c)^{2}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a cyclic inequality in three positive real variables\n\nThis file records the target proposition from the problem statement. It does\nnot contain a proof of the inequality.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- One cyclic summand of the left-hand side.\n\nFor the cyclic choice `(x, y, z) = (a, b, c)`, this is\n`(x^2 + y*z) / (x^2 + (y+z)^2)`. -/\ndef cyclicSummand (x y z : ℝ) : ℝ :=\n (x ^ 2 + y * z) / (x ^ 2 + (y + z) ^ 2)\n\n/-- The cyclic sum\n`(a^2+bc)/(a^2+(b+c)^2) + (b^2+ca)/(b^2+(c+a)^2) +\n (c^2+ab)/(c^2+(a+b)^2)`. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n cyclicSummand a b c + cyclicSummand b c a + cyclicSummand c a b\n\n/-- The right-hand side of the target inequality. -/\ndef targetRHS (a b c : ℝ) : ℝ :=\n ((18 : ℝ) / (5 : ℝ)) *\n ((a ^ 2 + b ^ 2 + c ^ 2) / (a + b + c) ^ 2)\n\n/-- The assertion: for all positive real numbers `a`, `b`, and `c`, the cyclic\nsum is at most `18/5` times the ratio of the sum of squares to the square of\nthe sum. This is a proposition-valued declaration, not a proof. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n cyclicSum a b c ≤ targetRHS a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71949a3e-b7a9-55be-811d-6d28f3955de4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "caaa2cf3a0558b10dd62baee4a62ce8edef6ab24422d3c19cba47abc039fd49a", "task_path": "tasks/nmp3_71949a3e-b7a9-55be-811d-6d28f3955de4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71949a3e-b7a9-55be-811d-6d28f3955de4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_71bb08a4-958b-58ab-92b2-9525ca0de974", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 + 1$.\nimport Mathlib\n\n/-!\n# Formal statement\n\nThere are infinitely many positive integers `n` for which the largest prime\ndivisor of `n ^ 4 + n ^ 2 + 1` is equal to the largest prime divisor of\n`(n + 1) ^ 4 + (n + 1) ^ 2 + 1`.\n\nThe greatest prime factor is represented by Mathlib's `Nat.maxPrimeFac`. Its\ndocumented junk values at `0` and `1` are never used below: if `n` is positive,\nthen both `n ^ 4 + n ^ 2 + 1` and `(n + 1) ^ 4 + (n + 1) ^ 2 + 1` are greater\nthan one.\n-/\n\nnamespace Problem\n\n/-- The polynomial `n ^ 4 + n ^ 2 + 1` appearing in the problem. -/\ndef polynomial (n : ℕ) : ℕ :=\n n ^ 4 + n ^ 2 + 1\n\n/-- The admissibility property for a positive integer `n`: the largest prime\ndivisor of `n ^ 4 + n ^ 2 + 1` equals the largest prime divisor of\n`(n + 1) ^ 4 + (n + 1) ^ 2 + 1`. -/\ndef admissible (n : ℕ) : Prop :=\n 0 < n ∧\n Nat.maxPrimeFac (polynomial n) =\n Nat.maxPrimeFac (polynomial (n + 1))\n\n/-- The assertion to be proved: infinitely many positive integers satisfy the\nstated equality of largest prime divisors. -/\ndef Target : Prop :=\n Set.Infinite {n : ℕ | admissible n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71bb08a4-958b-58ab-92b2-9525ca0de974", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9f4032b64f0b270ef41ef96993ef508449eff855d883b706dc3d291fa2e9fb47", "task_path": "tasks/nmp3_71bb08a4-958b-58ab-92b2-9525ca0de974", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71bb08a4-958b-58ab-92b2-9525ca0de974", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_71bf3f9f-81d8-5c70-a64e-ca7a5545c5ab", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Each integer is colored with one of three colors. Prove that there exist two distinct integers of the same color whose difference is a perfect square.\nimport Mathlib\n\n/-!\n# Formal statement of a three-coloring Ramsey-type problem\n\nEvery integer is colored with one of three colors. The statement asserts\nthat some two distinct integers have the same color and the absolute value of\ntheir difference is a perfect square.\n\nThe target is stated as a proposition-valued definition; no proof is supplied.\n\nThe intended theorem is true, but this file only formalizes the claim.\n-/\n\nnamespace Problem\n\n/-- A natural number is a perfect square if it is `k ^ 2` for some natural\nnumber `k`. In particular, `0` is included as a perfect square. -/\ndef IsPerfectSquareNat (n : ℕ) : Prop :=\n ∃ k : ℕ, n = k ^ 2\n\n/-- The complete assertion: for every coloring of the integers by one of\nthree colors, there exist two distinct integers with the same color whose\nabsolute difference is a perfect square. -/\ndef Target : Prop :=\n ∀ coloring : ℤ → Fin 3,\n ∃ x y : ℤ,\n x ≠ y ∧ coloring x = coloring y ∧\n IsPerfectSquareNat (Int.natAbs (x - y))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71bf3f9f-81d8-5c70-a64e-ca7a5545c5ab", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d6f671c4f8aef13c0e63b5488e6abc46c5b0c7ffe80af7d3d86600dc9af08ec4", "task_path": "tasks/nmp3_71bf3f9f-81d8-5c70-a64e-ca7a5545c5ab", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71bf3f9f-81d8-5c70-a64e-ca7a5545c5ab", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_71cee056-45da-5486-83cb-cab403697a65", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m\\in\\mathbb N$. An infinite strictly increasing sequence of positive integers $a_10$. Prove that \n-- \\[\n-- \\frac{x^{2}y^{5}z^{5}}{x^{7}z^{5}+x^{2}y^{10}+y^{5}z^{7}}+\\frac{y^{2}z^{5}x^{5}}{y^{7}x^{5}+y^{2}z^{10}+z^{5}x^{7}}+\\frac{z^{2}x^{5}y^{5}}{z^{7}y^{5}+z^{2}x^{10}+x^{5}y^{7}}\\le 1.\n-- \\] \n-- (The sum is taken cyclically over $x,\\;y,\\;z$.)\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic rational inequality\n\nThe source problem asks to prove, for positive real numbers `x`, `y`, and `z`,\nthat the explicitly displayed cyclic sum of three rational expressions is at\nmost one. The definition below records the proposition to be proved; it does\nnot assert or prove it.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the cyclic inequality. The three summands are the\nthree displayed terms, in the displayed order. -/\nnoncomputable def CyclicLHS (x y z : ℝ) : ℝ :=\n x ^ 2 * y ^ 5 * z ^ 5 /\n (x ^ 7 * z ^ 5 + x ^ 2 * y ^ 10 + y ^ 5 * z ^ 7) +\n y ^ 2 * z ^ 5 * x ^ 5 /\n (y ^ 7 * x ^ 5 + y ^ 2 * z ^ 10 + z ^ 5 * x ^ 7) +\n z ^ 2 * x ^ 5 * y ^ 5 /\n (z ^ 7 * y ^ 5 + z ^ 2 * x ^ 10 + x ^ 5 * y ^ 7)\n\n/-- The proposition requested by the source problem: for all positive real\n`x`, `y`, and `z`, the displayed cyclic sum is at most `1`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → CyclicLHS x y z ≤ (1 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71db133a-49c4-515b-8400-fe20cfcb1be8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8acb720036af6cd9ea03fce77e61eae64e4002d00d5165d0a14d89b3570f2232", "task_path": "tasks/nmp3_71db133a-49c4-515b-8400-fe20cfcb1be8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71db133a-49c4-515b-8400-fe20cfcb1be8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_71fba979-c05c-5dc2-a963-c7b67a599693", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCDEF$ be a convex hexagon satisfying $AC=DF$, $CE=FB$ and $EA=BD$. Prove that the three lines joining the midpoints of the three pairs of opposite sides of the hexagon are concurrent.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.LinearAlgebra.AffineSpace.Midpoint\nimport Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Defs\nimport Mathlib.Data.Fin.VecNotation\n\n/-!\n# Formalization of the three-midpoint concurrence problem for a convex hexagon\n\nThe ambient Euclidean plane is represented by `EuclideanSpace ℝ (Fin 2)`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane, with coordinates indexed by `Fin 2`. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The signed area/cross-product determinant of two plane vectors. -/\ndef cross (u v : Point) : ℝ :=\n u (0 : Fin 2) * v (1 : Fin 2) - u (1 : Fin 2) * v (0 : Fin 2)\n\n/-- The orientation determinant of the ordered triple `(P, Q, R)`:\ntwice the signed area of triangle `PQR`. -/\ndef orientation (P Q R : Point) : ℝ :=\n cross (Q - P) (R - P)\n\n/-- The next cyclic index, modulo six. -/\ndef nextIndex (i : Fin 6) : Fin 6 :=\n ⟨(i.val + 1) % 6, Nat.mod_lt _ (by norm_num)⟩\n\n/-- The six vertices as a cyclic family indexed by `Fin 6`. -/\ndef vertices (A B C D E F : Point) : Fin 6 → Point :=\n ![A, B, C, D, E, F]\n\n/-- The vertices are in strict convex position and are cyclically ordered with the\nspecified orientation sign. The sign `1` means counterclockwise, and `-1` means\nclockwise. For each directed side, every vertex other than its two endpoints lies\nstrictly in the corresponding open half-plane. -/\ndef StrictlyConvexInOrientation (V : Fin 6 → Point) (s : ℝ) : Prop :=\n ∀ i j : Fin 6,\n j ≠ i → j ≠ nextIndex i →\n s * orientation (V i) (V (nextIndex i)) (V j) > 0\n\n/-- `A B C D E F` is a strictly convex hexagon with its vertices in that cyclic\norder. Either the counterclockwise or the clockwise orientation is allowed. -/\ndef IsConvexHexagon (A B C D E F : Point) : Prop :=\n StrictlyConvexInOrientation (vertices A B C D E F) 1 ∨\n StrictlyConvexInOrientation (vertices A B C D E F) (-1)\n\n/-- The three affine lines determined by the midpoints of the opposite side pairs\n`AB`/`DE`, `BC`/`EF`, and `CD`/`FA` are concurrent. -/\ndef MidpointLinesConcurrent (A B C D E F : Point) : Prop :=\n ∃ O : Point,\n O ∈ line[ℝ, midpoint ℝ A B, midpoint ℝ D E] ∧\n O ∈ line[ℝ, midpoint ℝ B C, midpoint ℝ E F] ∧\n O ∈ line[ℝ, midpoint ℝ C D, midpoint ℝ F A]\n\n/-- The assertion of the problem: every strictly convex hexagon `ABCDEF` whose\ndiagonals satisfy `AC = DF`, `CE = FB`, and `EA = BD` has concurrent lines joining\nthe midpoints of its three pairs of opposite sides. -/\ndef Target : Prop :=\n ∀ A B C D E F : Point,\n IsConvexHexagon A B C D E F →\n dist A C = dist D F →\n dist C E = dist F B →\n dist E A = dist B D →\n MidpointLinesConcurrent A B C D E F\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71fba979-c05c-5dc2-a963-c7b67a599693", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "16792c2b6e737e6dd8f46ab848c8f75c6baf2615cd0f5370fd5ea26efbd2b951", "task_path": "tasks/nmp3_71fba979-c05c-5dc2-a963-c7b67a599693", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71fba979-c05c-5dc2-a963-c7b67a599693", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_71ffd263-45f1-5804-ba46-c341c27f1cd5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a+b+c=abc$. Prove that \n-- $$3+\\frac{b}{a^{2}}+\\frac{c}{b^{2}}+\\frac{a}{c^{2}}\\ge\\Big(\\frac1a+\\frac1b+\\frac1c\\Big)^{2}+\\sqrt3\\,.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The positive-real admissibility condition from the problem:\n`a`, `b`, and `c` are positive and satisfy `a + b + c = a * b * c`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = a * b * c\n\n/-- The inequality asserted in the problem, for real `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n 3 + b / a ^ 2 + c / b ^ 2 + a / c ^ 2 ≥\n (1 / a + 1 / b + 1 / c) ^ 2 + Real.sqrt 3\n\n/-- The full statement: for every positive real triple satisfying\n`a + b + c = a * b * c`, the asserted inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71ffd263-45f1-5804-ba46-c341c27f1cd5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "325daf15f219076c97ffe81ca7ec22722375ca39574d6f338d22c4f3372ad51a", "task_path": "tasks/nmp3_71ffd263-45f1-5804-ba46-c341c27f1cd5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "71ffd263-45f1-5804-ba46-c341c27f1cd5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_720eeadd-31a9-5f9b-b939-f0e8c8220899", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A,B,C$ be the vertices of a triangle $\\triangle ABC$ and let $M$ be any point that is not exterior to the triangle (i.e. $M$ lies in the interior of $\\triangle ABC$ or on its boundary). Prove that \n-- \\[\n-- \\min\\{\\,2MA+MB+MC,\\;MA+2MB+MC,\\;MA+MB+2MC\\,\\}0\\),\n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{(b+c-a)^2}{a^2+(b+c)^2}\\;\\ge\\;\n-- \\frac{3\\,(a^2+b^2+c^2)}{\\,a^2+b^2+c^2+4(ab+bc+ca)\\,}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the cyclic inequality\n\nThe source asks us to prove, for non-negative real numbers `a b c` whose\nsum of squares is positive, the inequality\n`∑_cyc (b + c - a)^2 / (a^2 + (b + c)^2) ≥\n 3 * (a^2 + b^2 + c^2) / (a^2 + b^2 + c^2 + 4 * (a*b + b*c + c*a))`.\n\nThis file records the statement as a proposition. In particular, the cyclic\nsum is expanded using the three cyclic shifts `(a,b,c)`, `(b,c,a)`, and\n`(c,a,b)`.\n-/\n\nnamespace Problem\n\n/-- One cyclic summand, displayed as\n`(b + c - a)^2 / (a^2 + (b + c)^2)`. -/\nnoncomputable def cyclicTerm (a b c : ℝ) : ℝ :=\n (b + c - a) ^ 2 / (a ^ 2 + (b + c) ^ 2)\n\n/-- The cyclic sum of the three shifts of `cyclicTerm`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The right-hand side of the source inequality. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n (3 * (a ^ 2 + b ^ 2 + c ^ 2)) /\n (a ^ 2 + b ^ 2 + c ^ 2 + 4 * (a * b + b * c + c * a))\n\n/-- The complete assertion of the source problem, without a proof. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n (0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c) →\n a ^ 2 + b ^ 2 + c ^ 2 > 0 →\n cyclicSum a b c ≥ rightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7244475c-044e-5713-aa39-14421efab4d5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f6fd9d07033534e7391f9c6176756722ec2f9ed04b6bb2efa95a1c7ee0bff318", "task_path": "tasks/nmp3_7244475c-044e-5713-aa39-14421efab4d5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7244475c-044e-5713-aa39-14421efab4d5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_726c1a02-75db-5c82-960b-78cea3076905", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$. Prove that \n-- $$4(a+b+c)^3\\ge 27\\bigl(a^2b+b^2c+c^2a+abc\\bigr).$$\nimport Mathlib\n\n/-!\n# Formalization of a nonnegative-variable cubic inequality\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, and `c`,\nthat\n`4 * (a + b + c)^3 ≥ 27 * (a^2 * b + b^2 * c + c^2 * a + a * b * c)`.\n\nThis file records the assertion as a proposition-valued definition. No proof is\nsupplied at this statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all nonnegative real numbers `a`, `b`, and\n`c`, the stated cubic inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n 4 * (a + b + c) ^ 3 ≥\n 27 * (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a + a * b * c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "726c1a02-75db-5c82-960b-78cea3076905", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a32e3fb2ac36ff2f78fc6b2be4174b112d451a834ea7dc7c9beb44fb20a868b7", "task_path": "tasks/nmp3_726c1a02-75db-5c82-960b-78cea3076905", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "726c1a02-75db-5c82-960b-78cea3076905", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_72760ce4-e2f7-5944-bfd2-31474b5adfdf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,\\;b,\\;c,\\;d$ are positive real numbers satisfying $abcd=1$, prove that \n-- \\[\n-- (a-1)(a-2)+(b-1)(b-2)+(c-1)(c-2)+(d-1)(d-2)\\ge0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the four-variable inequality\n\nProblem statement: if `a`, `b`, `c`, and `d` are positive real numbers with\n`a * b * c * d = 1`, then\n`(a - 1) * (a - 2) + (b - 1) * (b - 2) + (c - 1) * (c - 2) +\n (d - 1) * (d - 2) ≥ 0`.\n\nThis file records the mathematical assertion as a proposition-valued\ndefinition. It intentionally contains no proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\ndef LeftHandSide (a b c d : ℝ) : ℝ :=\n (a - 1) * (a - 2) + (b - 1) * (b - 2) +\n (c - 1) * (c - 2) + (d - 1) * (d - 2)\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, `c`,\nand `d` whose product is `1`, the indicated sum is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d →\n a * b * c * d = 1 →\n LeftHandSide a b c d ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "72760ce4-e2f7-5944-bfd2-31474b5adfdf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ebf938d28989f65c0ace340ef706c981d31280a3e3b2fe0595d41cb6a06ab957", "task_path": "tasks/nmp3_72760ce4-e2f7-5944-bfd2-31474b5adfdf", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "72760ce4-e2f7-5944-bfd2-31474b5adfdf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_727b1e56-99e5-55e3-8c16-96bd5d212c0a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$. Prove that \n-- \\[\n-- (a^2+2bc)(b^2+2ac)(c^2+2ab)\\ge(ab+ac+bc)^3\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks for a proof of a nonnegative-real inequality.\nThis file records the assertion as a proposition; it does not assert or prove it.\n-/\n\nnamespace Problem\n\n/-- The inequality from the source problem, with the nonnegativity hypotheses\nmade explicit and the variables universally quantified over the reals. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c →\n (a ^ 2 + 2 * b * c) * (b ^ 2 + 2 * a * c) * (c ^ 2 + 2 * a * b) ≥\n (a * b + a * c + b * c) ^ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "727b1e56-99e5-55e3-8c16-96bd5d212c0a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "464393bf8ba8f5e4508cc5f88f99311e8c6695777db4e500888cfa13b2957f92", "task_path": "tasks/nmp3_727b1e56-99e5-55e3-8c16-96bd5d212c0a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "727b1e56-99e5-55e3-8c16-96bd5d212c0a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7286ffd1-27ec-5b29-a548-9dc579e64d35", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be a prime, let $a\\in\\mathbb Z$ be divisible by $p$, and let $n$ be a positive integer. Prove that the polynomial \n-- \\[\n-- \\bigl(x^p - x + a\\bigr)^{p^{\\,n}} + p - 1\n-- \\]\n-- is irreducible over $\\mathbb Z[x]$.\nimport Mathlib\n\n/-!\n# Irreducibility of `(X ^ p - X + a) ^ (p ^ n) + p - 1` over `ℤ[X]`\n\nThis file formalizes the statement of the problem. It deliberately contains\nonly definitions of the relevant polynomial and of the target proposition; no\nproof of the target is supplied.\n-/\n\nnamespace Problem\n\n/-- The integer polynomial\n`(X ^ p - X + a) ^ (p ^ n) + (p - 1)`.\n\nHere `p` is represented by a natural number (so that `p ^ n` is the natural\npower appearing in the exponent), while `a` and the constant `p - 1` are\nintegers. -/\nnoncomputable def polynomial (p : ℕ) (a : ℤ) (n : ℕ) : Polynomial ℤ :=\n (Polynomial.X ^ p - Polynomial.X + Polynomial.C a) ^ (p ^ n) +\n Polynomial.C ((p : ℤ) - 1)\n\n/-- The assertion to be proved: for every prime natural number `p`, every\ninteger `a` divisible by `p`, and every positive integer `n`, the polynomial\n`(X ^ p - X + a) ^ (p ^ n) + p - 1` is irreducible in `ℤ[X]`. -/\ndef Target : Prop :=\n ∀ (p : ℕ) (a : ℤ) (n : ℕ),\n Nat.Prime p → (p : ℤ) ∣ a → 0 < n →\n Irreducible (polynomial p a n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7286ffd1-27ec-5b29-a548-9dc579e64d35", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "41221a10a6df480e045932c7688eea3587e593d728b4cb747ab74000bed3e712", "task_path": "tasks/nmp3_7286ffd1-27ec-5b29-a548-9dc579e64d35", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7286ffd1-27ec-5b29-a548-9dc579e64d35", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_72bf67dc-205c-5094-8da0-b62e8a7b0110", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,\\;y,\\;z>0$. Prove \n-- \\[\n-- \\Bigl(x^2y^2+y^2z^2+z^2x^2\\Bigr)\\Bigl(\\frac1{(y+z)^4}+\\frac1{(z+x)^4}+\\frac1{(x+y)^4}\\Bigr)\\ge\\frac{9}{16}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the cyclic inequality\n\nThe source problem asks to prove, for positive real numbers `x`, `y`, and `z`,\nthe inequality\n`(x^2 y^2 + y^2 z^2 + z^2 x^2) *\n (1 / (y + z)^4 + 1 / (z + x)^4 + 1 / (x + y)^4) ≥ 9 / 16`.\n\nThis file states the problem; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The positivity hypothesis `x > 0`, `y > 0`, and `z > 0`. -/\ndef Domain (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n (x ^ 2 * y ^ 2 + y ^ 2 * z ^ 2 + z ^ 2 * x ^ 2) *\n (1 / (y + z) ^ 4 + 1 / (z + x) ^ 4 + 1 / (x + y) ^ 4)\n\n/-- The asserted lower bound for `lhs`. -/\ndef Inequality (x y z : ℝ) : Prop :=\n lhs x y z ≥ (9 : ℝ) / 16\n\n/-- The complete universal statement of the source problem. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Domain x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "72bf67dc-205c-5094-8da0-b62e8a7b0110", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ad2721eeb884a58af8c2831c3204fd9a501b3b733bd1d265db8ab83a9cc9f127", "task_path": "tasks/nmp3_72bf67dc-205c-5094-8da0-b62e8a7b0110", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "72bf67dc-205c-5094-8da0-b62e8a7b0110", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_72d75ed0-4813-55bd-8069-53aca95adc35", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be positive real numbers such that $abcd=1$. Prove that \n-- \\[\n-- a^{4}b+b^{4}c+c^{4}d+d^{4}a\\ge a+b+c+d.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the positive-real four-variable inequality\n\nThe source problem asks one to prove the inequality\n\n a^4 b + b^4 c + c^4 d + d^4 a >= a + b + c + d\n\nfor positive real numbers `a`, `b`, `c`, and `d` satisfying `a b c d = 1`.\n\nThis file records the mathematical assertion as the proposition-valued\ndefinition `Problem.Target`; it deliberately contains no proof of that\nassertion.\n-/\n\nnamespace Problem\n\n/-- The four numbers `a`, `b`, `c`, and `d` are all strictly positive reals. -/\ndef Positive (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d\n\n/-- The four real numbers satisfy the product condition `a b c d = 1`. -/\ndef ProductOne (a b c d : ℝ) : Prop :=\n a * b * c * d = 1\n\n/-- The hypotheses of the problem: positivity and product equal to one. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n Positive a b c d ∧ ProductOne a b c d\n\n/-- The left-hand side of the desired inequality. -/\ndef leftSide (a b c d : ℝ) : ℝ :=\n a ^ 4 * b + b ^ 4 * c + c ^ 4 * d + d ^ 4 * a\n\n/-- The right-hand side of the desired inequality. -/\ndef rightSide (a b c d : ℝ) : ℝ :=\n a + b + c + d\n\n/-- The inequality asserted in the problem, for fixed `a`, `b`, `c`, and `d`. -/\ndef Inequality (a b c d : ℝ) : Prop :=\n leftSide a b c d ≥ rightSide a b c d\n\n/-- The complete universal statement of the source problem. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Inequality a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "72d75ed0-4813-55bd-8069-53aca95adc35", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1a080be88a581e1d82e032da59ac743436f71b64fcedb3a391ff28c7f58f03b8", "task_path": "tasks/nmp3_72d75ed0-4813-55bd-8069-53aca95adc35", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "72d75ed0-4813-55bd-8069-53aca95adc35", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_72d86e49-9a28-557b-8991-f162cf515623", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,a_3,a_4,a_5,a_6>0$ be real numbers such that $a_1a_2a_3a_4a_5a_6=1$. Prove that \n-- \\[\n-- \\frac1{a_1(a_2+1)}+\\frac1{a_2(a_3+1)}+\\frac1{a_3(a_4+1)}+\\frac1{a_4(a_5+1)}+\\frac1{a_5(a_6+1)}+\\frac1{a_6(a_1+1)}\\ge 3.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The cyclic successor on the six-element index set `Fin 6`: it sends\n`0 ↦ 1`, `1 ↦ 2`, ..., and `5 ↦ 0`. -/\ndef cyclicSucc (i : Fin 6) : Fin 6 :=\n ⟨(i.val + 1) % 6, Nat.mod_lt _ (by norm_num)⟩\n\n/-- Let `a₁, ..., a₆` be positive real numbers with product `1`. Then\n\\[\n\\sum_{i=1}^{6} \\frac{1}{a_i(a_{i+1}+1)} \\ge 3,\n\\]\nwhere the indices are read cyclically, so that `a₇ = a₁`.\n-/\ndef Target : Prop :=\n ∀ a : Fin 6 → ℝ,\n (∀ i : Fin 6, 0 < a i) →\n (∏ i : Fin 6, a i) = (1 : ℝ) →\n (∑ i : Fin 6, (1 : ℝ) / (a i * (a (cyclicSucc i) + 1))) ≥ (3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "72d86e49-9a28-557b-8991-f162cf515623", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "afc0361fc95402965fc398e996609b5104fec5a7794e7a3b7a8fa637e1a547bf", "task_path": "tasks/nmp3_72d86e49-9a28-557b-8991-f162cf515623", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "72d86e49-9a28-557b-8991-f162cf515623", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7328c48e-746a-5c36-ad38-40dded812190", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that\n-- \\[\n-- \\sqrt{\\frac{x^{3}}{(x+y+z)(y^{2}+zx)}}+\\sqrt{\\frac{y^{3}}{(x+y+z)(z^{2}+xy)}}+\\sqrt{\\frac{z^{3}}{(x+y+z)(x^{2}+yz)}}\\ge\\frac{\\sqrt6}{2}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the radical inequality problem\n\nThe original problem asks to prove, for positive real numbers `x`, `y`, and `z`,\nthe cyclic radical inequality\n`√(x³ / ((x+y+z)(y²+zx))) + ... ≥ √6 / 2`.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition: the variables `x`, `y`, and `z` are positive reals. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n Real.sqrt (x ^ 3 / ((x + y + z) * (y ^ 2 + z * x))) +\n Real.sqrt (y ^ 3 / ((x + y + z) * (z ^ 2 + x * y))) +\n Real.sqrt (z ^ 3 / ((x + y + z) * (x ^ 2 + y * z)))\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def rhs : ℝ :=\n Real.sqrt 6 / 2\n\n/-- The complete assertion of the problem: for all positive reals `x`, `y`, and `z`,\nthe displayed cyclic radical sum is at least `√6 / 2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → lhs x y z ≥ rhs\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7328c48e-746a-5c36-ad38-40dded812190", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "268c7f40c567486815041544676c3f41cdf506f509095472f1ee5054026a4102", "task_path": "tasks/nmp3_7328c48e-746a-5c36-ad38-40dded812190", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7328c48e-746a-5c36-ad38-40dded812190", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_734ff2b6-ca85-54fa-a38e-657f5d6a0687", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer and let $a_1,a_2,\\dots,a_{2n+1}$ be positive real numbers. For each $k=1,2,\\dots,2n+1$ define \n-- \\[\n-- b_k=\\max_{0\\le m\\le n}\\frac{1}{2m+1}\\sum_{i=k-m}^{k+m}a_i,\n-- \\] \n-- where the indices are taken modulo $2n+1$ (so the sum is over the $2m+1$ consecutive terms centered at $k$ on the cyclic sequence). Prove that the number of indices $k$ for which $b_k\\ge1$ satisfies \n-- \\[\n-- \\#\\{k:b_k\\ge1\\}\\le 2\\sum_{i=1}^{2n+1}a_i.\n-- \\]\nimport Mathlib\n\n/-!\n# Cyclic centered averages and a counting bound\n\nThis file formalizes the statement of the problem. The original sequence\n`a_1, ..., a_{2n+1}` is represented by a function on `Fin (2*n+1)`, with the\n`i`-th source term corresponding to Lean index `i-1`. This is a harmless\nzero-based relabeling that preserves the cyclic order.\n-/\n\nnamespace Problem\n\n/-- The cyclic index obtained from `k + j` by reduction modulo `N`, with the\nrepresentative chosen in `{0, ..., N-1}`. This supplies the meaning of the\nmodulo indexing in the centered sums. -/\ndef cyclicIndex (N : ℕ) (hN : 0 < N) (k : Fin N) (j : ℤ) : Fin N :=\n ⟨(((k.val : ℤ) + j) % (N : ℤ)).toNat, by\n rw [Int.toNat_lt' (by exact_mod_cast hN)]\n exact Int.emod_lt_of_pos _ (by exact_mod_cast hN)⟩\n\n/-- The average of the `2*m+1` cyclically consecutive terms centered at `k`,\nfor a window half-width `m`. The sum is over the integer offsets\n`-m, -m+1, ..., m`; each occurrence is reduced to a cyclic index. -/\nnoncomputable def cyclicWindowAverage (n : ℕ) (hn : 0 < n)\n (a : Fin (2 * n + 1) → ℝ) (k : Fin (2 * n + 1)) (m : ℕ) : ℝ :=\n (∑ j ∈ Finset.Icc (-(m : ℤ)) (m : ℤ),\n a (cyclicIndex (2 * n + 1) (by omega) k j)) /\n ((2 * m + 1 : ℕ) : ℝ)\n\n/-- The quantity `b_k`: the maximum, over `0 ≤ m ≤ n.`, of the centered\ncyclic window averages. The finite maximum is taken over the image of\n`Finset.range (n+1)`. -/\nnoncomputable def b (n : ℕ) (hn : 0 < n)\n (a : Fin (2 * n + 1) → ℝ) (k : Fin (2 * n + 1)) : ℝ :=\n Finset.max'\n ((Finset.range (n + 1)).image\n (fun m => cyclicWindowAverage n hn a k m))\n (by\n rw [Finset.image_nonempty]\n exact ⟨0, by simp⟩)\n\n/-- The asserted inequality: for every positive integer `n` and every positive\nreal cyclic sequence of length `2*n+1`, the number of centers `k` with\n`b_k ≥ 1` is at most twice the sum of all sequence entries. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (hn : 0 < n) (a : Fin (2 * n + 1) → ℝ),\n (∀ i, 0 < a i) →\n (((Finset.univ.filter (fun k => 1 ≤ b n hn a k)).card : ℕ) : ℝ) ≤\n 2 * ∑ i : Fin (2 * n + 1), a i\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "734ff2b6-ca85-54fa-a38e-657f5d6a0687", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b3627ce820635bdea52667b6b7e43ba38bc3e88f21464498808ad549b0654786", "task_path": "tasks/nmp3_734ff2b6-ca85-54fa-a38e-657f5d6a0687", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "734ff2b6-ca85-54fa-a38e-657f5d6a0687", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_735291d3-a484-5fef-ab7f-75b58bc5e948", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- a,b,c>0,\\; abc=1.\\; Prove that \n-- \\[\n-- \\frac{(a^{2}+b^{2}+c^{2})^{2}}{ab+bc+ca}+6\\ge (a+b+c)^{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwith `a * b * c = 1`, that\n\n`((a^2 + b^2 + c^2)^2) / (a*b + b*c + c*a) + 6 >= (a+b+c)^2`.\n\nThese declarations record the hypotheses and the claimed proposition. No proof\nof the proposition is supplied.\n-/\n\nnamespace Problem\n\n/-- The hypotheses of the problem: `a`, `b`, and `c` are positive reals and\ntheir product is `1`. -/\ndef Hypotheses (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The inequality asserted in the problem, as a proposition over reals. -/\ndef Inequality (a b c : ℝ) : Prop :=\n ((a ^ 2 + b ^ 2 + c ^ 2) ^ 2) / (a * b + b * c + c * a) + 6 ≥\n (a + b + c) ^ 2\n\n/-- The assertion for a fixed triple `(a, b, c)`: the problem's hypotheses\nimply the stated inequality. -/\ndef TargetAt (a b c : ℝ) : Prop :=\n Hypotheses a b c → Inequality a b c\n\n/-- The full universally quantified statement asked for by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, TargetAt a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "735291d3-a484-5fef-ab7f-75b58bc5e948", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "be10a5ec7d77f099784e73b568a370df0bc15eb13b3d9949886278047c6b7649", "task_path": "tasks/nmp3_735291d3-a484-5fef-ab7f-75b58bc5e948", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "735291d3-a484-5fef-ab7f-75b58bc5e948", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_735cb2be-7698-519c-8d13-570b1d765b51", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$ and $c$ be real numbers such that \n-- $$a(b-c)^7+b(c-a)^7+c(a-b)^7\\ge0$$ \n-- and \n-- $$a(b-c)^3+b(c-a)^3+c(a-b)^3\\ge0.$$ \n-- Prove that \n-- $$a(b-c)^5+b(c-a)^5+c(a-b)^5\\ge0.$$\nimport Mathlib\n\n/-!\n# Formalization of the stated inequality problem\n\nThe original problem asks us to prove the degree-five inequality\n`a (b - c)^5 + b (c - a)^5 + c (a - b)^5 ≥ 0` for all real numbers `a`, `b`, `c`\nwhich satisfy the corresponding degree-seven and degree-three inequalities.\n\nThe proposition to be proved is packaged as `Problem.Target`. It is a\ndefinition of type `Prop`, not a theorem with a supplied proof.\n-/\n\nnamespace Problem\n\n/-- The degree-seven cyclic expression appearing in the first hypothesis:\n`a (b - c)^7 + b (c - a)^7 + c (a - b)^7`. -/\ndef degreeSevenExpression (a b c : ℝ) : ℝ :=\n a * (b - c) ^ 7 + b * (c - a) ^ 7 + c * (a - b) ^ 7\n\n/-- The degree-three cyclic expression appearing in the second hypothesis:\n`a (b - c)^3 + b (c - a)^3 + c (a - b)^3`. -/\ndef degreeThreeExpression (a b c : ℝ) : ℝ :=\n a * (b - c) ^ 3 + b * (c - a) ^ 3 + c * (a - b) ^ 3\n\n/-- The degree-five cyclic expression whose nonnegativity is the conclusion:\n`a (b - c)^5 + b (c - a)^5 + c (a - b)^5`. -/\ndef degreeFiveExpression (a b c : ℝ) : ℝ :=\n a * (b - c) ^ 5 + b * (c - a) ^ 5 + c * (a - b) ^ 5\n\n/-- The two hypotheses of the problem, for a fixed triple of real numbers. -/\ndef Hypotheses (a b c : ℝ) : Prop :=\n 0 ≤ degreeSevenExpression a b c ∧ 0 ≤ degreeThreeExpression a b c\n\n/-- The conclusion of the problem, for a fixed triple of real numbers. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n 0 ≤ degreeFiveExpression a b c\n\n/-- The assertion to be proved: for every choice of real numbers `a`, `b`, `c`,\nif both the degree-seven and degree-three cyclic inequalities hold, then the\ndegree-five cyclic inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Hypotheses a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "735cb2be-7698-519c-8d13-570b1d765b51", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7a8c74d575b8825512564c07764f98e83388b483b976d2acc3588e4dd20cec4d", "task_path": "tasks/nmp3_735cb2be-7698-519c-8d13-570b1d765b51", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "735cb2be-7698-519c-8d13-570b1d765b51", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_737b9d21-7db8-5c10-bd15-43d374ef54ac", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that \n-- \\[\n-- \\cot 13^{\\circ}\\,\\cot 23^{\\circ}\\,\\tan 31^{\\circ}\\,\\tan 35^{\\circ}\\,\\tan 41^{\\circ}= \\tan 75^{\\circ}.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic\n\n/-!\n# Formal statement of the trigonometric identity\n\nThe source problem states an identity involving trigonometric functions of angles\ngiven in degrees. Mathlib's real trigonometric functions take their arguments in\nradians, so `Problem.degToRad` records the standard conversion from degrees to\nradians. The target below is the resulting closed proposition over `ℝ`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- Convert an angle measured in degrees to the corresponding radian measure:\n`d` degrees is `d * π / 180` radians. -/\ndef degToRad (d : ℝ) : ℝ := d * Real.pi / 180\n\n/-- The proposition asserted by the problem:\n`cot 13° * cot 23° * tan 31° * tan 35° * tan 41° = tan 75°`,\nwith all six angle measures interpreted in degrees. -/\ndef Target : Prop :=\n Real.cot (degToRad (13 : ℝ)) * Real.cot (degToRad (23 : ℝ)) *\n Real.tan (degToRad (31 : ℝ)) * Real.tan (degToRad (35 : ℝ)) *\n Real.tan (degToRad (41 : ℝ)) =\n Real.tan (degToRad (75 : ℝ))\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "737b9d21-7db8-5c10-bd15-43d374ef54ac", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7f20355498458e6b4e8e91a143e743fccd3e2d15c559cdb2d40e686960dc2f90", "task_path": "tasks/nmp3_737b9d21-7db8-5c10-bd15-43d374ef54ac", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "737b9d21-7db8-5c10-bd15-43d374ef54ac", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_73c108f9-db2b-5dd9-8add-99b694a5f645", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $S$ be a set of 100 points in the plane, with no three collinear. Prove that the number of acute triangles determined by triples of points from $S$ is at most $70\\%$ of all possible triangles; equivalently, show that the number of acute triangles is $\\le \\frac{7}{10}\\binom{100}{3}$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Data.Finset.Powerset\nimport Mathlib.Data.Rat.Defs\n\n/-!\n# Formal statement: acute triangles among 100 planar points\n\nThis file states, without proof, the proposition that among any 100 points\nin the Euclidean plane with no three collinear, at most 70 percent of the\ntriples span an acute triangle.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\nopen scoped EuclideanGeometry\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A finite set of points in the plane has no three collinear points. -/\ndef NoThreeCollinear (S : Finset Point) : Prop :=\n ∀ p ∈ S, ∀ q ∈ S, ∀ r ∈ S,\n p ≠ q → p ≠ r → q ≠ r → ¬ Collinear ℝ ({p, q, r} : Set Point)\n\n/-- A three-element finite set of points determines an acute triangle when\nevery angle at a point of the triple is strictly less than a right angle. -/\ndef IsAcuteTriangle (T : Finset Point) : Prop :=\n T.card = 3 ∧\n ∀ p ∈ T, ∀ q ∈ T, ∀ r ∈ T,\n q ≠ p → r ≠ p → q ≠ r →\n EuclideanGeometry.angle q p r < Real.pi / 2\n\n/-- The number of acute triangles determined by three-element subsets of `S`. -/\ndef acuteTriangleCount (S : Finset Point) : ℕ := by\n classical\n exact ((S.powersetCard 3).filter IsAcuteTriangle).card\n\n/-- The assertion of the problem: if `S` is a set of 100 points in the plane\nwith no three collinear, then the number of acute triangles determined by\ntriples from `S` is at most `7/10` of the number of all triples. -/\ndef Target : Prop :=\n ∀ S : Finset Point,\n S.card = 100 →\n NoThreeCollinear S →\n (acuteTriangleCount S : ℚ) ≤ (7 / 10 : ℚ) * ((Nat.choose 100 3 : ℕ) : ℚ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "73c108f9-db2b-5dd9-8add-99b694a5f645", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8a285c192368d83bc0b199e26eb3908ba54879b8c9f68db8984a113bc462d7ca", "task_path": "tasks/nmp3_73c108f9-db2b-5dd9-8add-99b694a5f645", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "73c108f9-db2b-5dd9-8add-99b694a5f645", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_73fdd724-75c2-5613-81c1-39b750960031", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let an $m\\times n$ rectangular array ($m,n\\ge 3$) be filled with integers. \n-- In one move we may choose a whole row, a whole column, or a diagonal (a set of cells whose row index minus column index is constant, i.e. a line parallel to the main diagonal) and add either $+1$ or $-1$ to every entry of the chosen line. \n-- \n-- Assume that for **every** $3\\times3$ integer board there exists a sequence of such moves that makes all nine entries equal to $0$. Prove that for any $m\\times n$ board there also exists a sequence of such moves that makes all $mn$ entries equal to $0$.\nimport Mathlib\n\n/-!\n# Formalization of the rectangular-board diagonal-move problem\n\nThe board is a function from cell coordinates to integers. Rows and columns\nare indexed by `Fin m` and `Fin n`; this is the usual zero-based indexing, and\nthe difference `row - column` used to define diagonals is unchanged by passing\nto one-based coordinates.\n\nA move acts on one maximal nonempty line whose cells have a fixed value of\n`row - column`. A move carries a sign, adding either `+1` or `-1` to every\ncell of that line. A finite sequence of moves is a `List` of moves.\n-/\n\nnamespace Problem\n\n/-- An `m × n` integer board. -/\nabbrev Board (m n : ℕ) : Type := Fin m → Fin n → ℤ\n\n/-- The two possible additions in a single move: `+1` or `-1`. -/\ninductive MoveSign : Type where\n | plus : MoveSign\n | minus : MoveSign\n deriving DecidableEq, Repr\n\nnamespace MoveSign\n\n/-- The integer added by a signed move. -/\ndef toInt : MoveSign → ℤ\n | plus => 1\n | minus => -1\n\n@[simp] theorem toInt_plus : toInt plus = 1 := rfl\n@[simp] theorem toInt_minus : toInt minus = -1 := rfl\n\nend MoveSign\n\n/-- The possible maximal nonempty diagonals of an `m × n` board.\n\nA diagonal is indexed by the constant value of `row - column`; the subtype\nrecords exactly those constants that occur for some cell of the board. -/\ndef DiagonalIndex (m n : ℕ) : Type :=\n {d : ℤ // ∃ (r : Fin m) (c : Fin n), (r : ℤ) - (c : ℤ) = d}\n\n/-- A single legal move: choose a row, a column, or a diagonal, and choose\nwhether to add `+1` or `-1` to every entry on the chosen line. -/\ninductive Move (m n : ℕ) : Type where\n | row (i : Fin m) (sign : MoveSign) : Move m n\n | column (j : Fin n) (sign : MoveSign) : Move m n\n | diagonal (d : DiagonalIndex m n) (sign : MoveSign) : Move m n\n\n/-- Apply one legal move to a board. -/\ndef applyMove {m n : ℕ} (A : Board m n) : Move m n → Board m n\n | Move.row i sign => fun r c => if r = i then A r c + sign.toInt else A r c\n | Move.column j sign => fun r c => if c = j then A r c + sign.toInt else A r c\n | Move.diagonal d sign =>\n fun r c =>\n if (r : ℤ) - (c : ℤ) = (d : DiagonalIndex m n).1 then\n A r c + sign.toInt\n else\n A r c\n\n/-- Apply a finite sequence of legal moves to a board. -/\ndef applyMoves {m n : ℕ} (A : Board m n) : List (Move m n) → Board m n\n | [] => A\n | move :: rest => applyMoves (applyMove A move) rest\n\n@[simp] theorem applyMoves_nil {m n : ℕ} (A : Board m n) :\n applyMoves A [] = A := rfl\n\n@[simp] theorem applyMoves_cons {m n : ℕ} (A : Board m n)\n (move : Move m n) (rest : List (Move m n)) :\n applyMoves A (move :: rest) = applyMoves (applyMove A move) rest := rfl\n\n/-- A board is zero if every one of its entries is zero. -/\ndef IsZeroBoard {m n : ℕ} (A : Board m n) : Prop :=\n ∀ r c, A r c = 0\n\n/-- A board is solvable if some finite sequence of legal moves makes every\nentry zero. -/\ndef Zeroable {m n : ℕ} (A : Board m n) : Prop :=\n ∃ moves : List (Move m n), IsZeroBoard (applyMoves A moves)\n\n/-- The hypothesis assumed in the problem: every `3 × 3` integer board is\nsolvable. -/\ndef ThreeByThreeHypothesis : Prop :=\n ∀ A : Board 3 3, Zeroable A\n\n/-- The conclusion to be proved: every integer board of size `m × n`, with\n`m ≥ 3` and `n ≥ 3`, is solvable. -/\ndef UniversalZeroability : Prop :=\n ∀ (m n : ℕ), 3 ≤ m → 3 ≤ n → ∀ A : Board m n, Zeroable A\n\n/-- The full implication stated by the problem, written out explicitly. -/\ndef Target : Prop :=\n (∀ A : Board 3 3, Zeroable A) →\n ∀ (m n : ℕ), 3 ≤ m → 3 ≤ n → ∀ A : Board m n, Zeroable A\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "73fdd724-75c2-5613-81c1-39b750960031", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b49e7ca8cec01cab0533fb80089f57202f168dc254aee45d3a56506408126ce0", "task_path": "tasks/nmp3_73fdd724-75c2-5613-81c1-39b750960031", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "73fdd724-75c2-5613-81c1-39b750960031", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_740586f0-2279-5465-85b1-b3ecbcd2ada8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $ab+bc+ca+2abc=1$. Prove that \n-- \\[\n-- a+b+c+\\frac1{a+b}+\\frac1{b+c}+\\frac1{c+a}\\ge\\frac92.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the nonnegative-real inequality problem\n\nThe source problem asks, for nonnegative real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca + 2abc = 1`, to prove\n\n`a + b + c + 1/(a+b) + 1/(b+c) + 1/(c+a) ≥ 9/2`.\n\nThe declarations below only state the problem. In particular, `Target` is a\nproposition-valued definition and does not contain a proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypotheses on the three real variables: each is\nnonnegative and they satisfy `ab + bc + ca + 2abc = 1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧\n a * b + b * c + c * a + 2 * a * b * c = 1\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def Lhs (a b c : ℝ) : ℝ :=\n a + b + c + 1 / (a + b) + 1 / (b + c) + 1 / (c + a)\n\n/-- The complete assertion to be proved: for every real triple satisfying the\nadmissibility condition, the displayed left-hand side is at least `9 / 2`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Lhs a b c ≥ (9 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "740586f0-2279-5465-85b1-b3ecbcd2ada8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "491ce5e1cbef457de250f53b3c3fd4387ef63b14e22c7e8fe2a394fd18de044f", "task_path": "tasks/nmp3_740586f0-2279-5465-85b1-b3ecbcd2ada8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "740586f0-2279-5465-85b1-b3ecbcd2ada8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_740e6ccb-537a-5bae-97a8-db3edf575871", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions \\(f:(0,\\infty)\\to(0,\\infty)\\) such that \n-- \\[\n-- f\\big(x\\,f(x)+f(y)\\big)=\\big(f(x)\\big)^2+y\\qquad\\text{for all }x,y>0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the functional-equation problem\n\nThe original problem asks for all functions `f : (0, ∞) → (0, ∞)` satisfying\n`f (x * f x + f y) = (f x)^2 + y` for all positive `x` and `y`.\n\nThe positive real numbers are represented by the subtype `PositiveReal`. Thus\nboth the domain and the codomain of `PositiveFunction` are exactly the positive\nreals, rather than `ℝ` with separate positivity hypotheses.\n-/\n\nnamespace Problem\n\n/-- The positive real numbers, as a subtype of `ℝ`. -/\nabbrev PositiveReal : Type := {x : ℝ // 0 < x}\n\n/-- Functions from the positive reals to the positive reals. -/\nabbrev PositiveFunction : Type := PositiveReal → PositiveReal\n\n/-- The positive-real argument `x * f x + f y` occurring in the functional equation. -/\ndef equationArgument (f : PositiveFunction) (x y : PositiveReal) : PositiveReal :=\n ⟨(x : ℝ) * (f x : ℝ) + (f y : ℝ), by\n have hx : (0 : ℝ) < (x : ℝ) := x.2\n have hfx : (0 : ℝ) < (f x : ℝ) := (f x).2\n have hfy : (0 : ℝ) < (f y : ℝ) := (f y).2\n exact add_pos (mul_pos hx hfx) hfy⟩\n\n/-- The admissibility predicate for the functional equation.\n\nFor functions whose domain and codomain are definitionally the positive reals,\nthis says\n`f (x * f x + f y) = (f x)^2 + y` for every positive `x` and `y`. -/\ndef Admissible (f : PositiveFunction) : Prop :=\n ∀ x y : PositiveReal,\n (f (equationArgument f x y) : ℝ) = (f x : ℝ) ^ 2 + (y : ℝ)\n\n/-- The identity function on the positive reals. -/\ndef identityFunction : PositiveFunction := fun (x : PositiveReal) => x\n\n/-- The proposed answer set for the problem: the singleton containing only the\nidentity function. -/\ndef identityAnswer : Set PositiveFunction := {f : PositiveFunction | f = identityFunction}\n\n/-- A set of positive-real functions is a complete answer to the problem exactly\nwhen it contains every admissible function and every function it contains is\nadmissible. The two conjuncts explicitly record both directions of the\nclassification. -/\ndef CompleteAnswer (S : Set PositiveFunction) : Prop :=\n (∀ f : PositiveFunction, f ∈ S → Admissible f) ∧\n (∀ f : PositiveFunction, Admissible f → f ∈ S)\n\n/-- The target assertion of the original problem: the identity function on\n`(0, ∞)` is the unique admissible function. This is stated as a proposition to\nbe proved, not as a proof of itself. -/\ndef Target : Prop := CompleteAnswer identityAnswer\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "740e6ccb-537a-5bae-97a8-db3edf575871", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9ffc41e4ca985d3b6db886583cefbf1573c7d9d866d1e40268a603cfb75de3fa", "task_path": "tasks/nmp3_740e6ccb-537a-5bae-97a8-db3edf575871", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "740e6ccb-537a-5bae-97a8-db3edf575871", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_74254f2b-3123-543f-b92f-3c332120e112", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{1}{a(1+b)}+\\frac{1}{b(1+c)}+\\frac{1}{c(1+d)}+\\frac{1}{d(1+a)}\\ge \\frac{16}{1+8\\sqrt{abcd}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the cyclic inequality for four positive real numbers\n\nThis file states, but does not prove, the inequality from the problem.\n-/\n\nnamespace Problem\n\n/-- The inequality from the problem: for every four positive real numbers\n`a`, `b`, `c`, and `d`, the cyclic sum of reciprocals\n`1 / (a * (1 + b)) + ... + 1 / (d * (1 + a))` is at least\n`16 / (1 + 8 * sqrt (a * b * c * d))`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 0 < d →\n (1 : ℝ) / (a * (1 + b)) +\n (1 : ℝ) / (b * (1 + c)) +\n (1 : ℝ) / (c * (1 + d)) +\n (1 : ℝ) / (d * (1 + a)) ≥\n (16 : ℝ) / (1 + 8 * Real.sqrt (a * b * c * d))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "74254f2b-3123-543f-b92f-3c332120e112", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "250a5b37aefb3fc33ae30d73dc62996e7155bb3ce45ba8edba92515bb33dcbdc", "task_path": "tasks/nmp3_74254f2b-3123-543f-b92f-3c332120e112", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "74254f2b-3123-543f-b92f-3c332120e112", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_74337dde-34c9-540d-822e-2b7e30b9c846", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exists a constant $C$ such that every prime $p>C$ can be written in the form \n-- \\[\n-- p \\;=\\; 1 + b_1 + b_1b_2 + b_1b_2b_3 + \\dots + b_1b_2\\cdots b_{2022},\n-- \\] \n-- where $b_1,b_2,\\dots,b_{2022}$ are integers greater than $1$ (the $b_i$ need not be distinct).\nimport Mathlib\n\n/-!\nFormalization of the statement from `problem.md`.\n\nThe problem asks for a threshold `C` such that every prime `p > C` has a\nrepresentation\n`p = 1 + b₁ + b₁b₂ + ... + b₁...b₂₀₂₂`,\nwith each `bᵢ` an integer greater than `1`, and with repetition allowed.\n-/\n\nnamespace Problem\n\nopen scoped BigOperators\n\n/-- The product of the first `j` entries of a finite integer sequence `b`,\nwhere `j ≤ n`. In particular, `prefixProduct n b 0 = 1` and, for `j > 0`,\nthis is `b 0 * b 1 * ... * b (j-1)`. -/\ndef prefixProduct (n : ℕ) (b : Fin n → ℤ) (j : ℕ) (hj : j ≤ n) : ℤ :=\n ∏ i : Fin j, b ⟨i.1, Nat.lt_of_lt_of_le i.2 hj⟩\n\n/-- The integer\n`1 + b₁ + b₁b₂ + ... + b₁b₂...bₙ`\nassociated to a finite integer sequence `b₁,...,bₙ`. -/\ndef onePlusPartialSums (n : ℕ) (b : Fin n → ℤ) : ℤ :=\n 1 + ∑ j ∈ (Finset.Icc 1 n).attach,\n prefixProduct n b j.1 (Finset.mem_Icc.mp j.2).2\n\n/-- `p` has a representation of length `n`: there are integers\n`b₁,...,bₙ`, all greater than `1`, such that\n`p = 1 + b₁ + b₁b₂ + ... + b₁...bₙ`.\nNo distinctness condition is imposed on the `bᵢ`. -/\ndef IsRepresentable (n p : ℕ) : Prop :=\n ∃ b : Fin n → ℤ,\n (∀ i : Fin n, 1 < b i) ∧\n (p : ℤ) = onePlusPartialSums n b\n\n/-- The complete assertion of the problem: there is a natural-number\nthreshold `C` such that every prime `p` greater than `C` admits a\nlength-2022 representation with all `bᵢ : ℤ` greater than `1`. -/\ndef Target : Prop :=\n ∃ C : ℕ, ∀ p : ℕ, Nat.Prime p → C < p → IsRepresentable 2022 p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "74337dde-34c9-540d-822e-2b7e30b9c846", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "09c46ca9c1bd6377d960427e46eeb4c8b6a4457e7a25de0b3bdc13d471872996", "task_path": "tasks/nmp3_74337dde-34c9-540d-822e-2b7e30b9c846", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "74337dde-34c9-540d-822e-2b7e30b9c846", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_74cf3d83-60f2-5ea3-8d02-307a5cf9f964", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there is no triple of positive integers $(x,y,n)$ such that $xy(x+y)=n^3$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility predicate for a triple of positive integers satisfying\n`x * y * (x + y) = n ^ 3`. The domain is `ℕ`, with positivity stated\nexplicitly for each component. -/\ndef PositiveIntegerTriple (x y n : ℕ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < n ∧ x * y * (x + y) = n ^ 3\n\n/-- There is no triple of positive integers `(x, y, n)` satisfying\n`x * y * (x + y) = n ^ 3`. -/\ndef Target : Prop :=\n ¬ ∃ x y n : ℕ, PositiveIntegerTriple x y n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "74cf3d83-60f2-5ea3-8d02-307a5cf9f964", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ef51ce114a4bc32e675bce4538f8c27c3ded011031c50795bda26ff80c3607bc", "task_path": "tasks/nmp3_74cf3d83-60f2-5ea3-8d02-307a5cf9f964", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "74cf3d83-60f2-5ea3-8d02-307a5cf9f964", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_74d31fcd-f7ea-59c1-a2cd-a252e76eaa99", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ satisfy \n-- \\[\n-- x+y+z=\\frac1x+\\frac1y+\\frac1z.\n-- \\]\n-- Prove that \n-- \\[\n-- \\sqrt{x^2y^2+y^2z^2+z^2x^2}+(2\\sqrt2-\\sqrt3)\\,xyz\\ge 2\\sqrt2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positivity/reciprocal-sum inequality\n\nThe source problem asks, for positive real numbers `x`, `y`, and `z` satisfying\n`x + y + z = 1/x + 1/y + 1/z`, to prove the displayed inequality involving\n`Real.sqrt`. The declarations below record the admissibility condition, the\nconclusion, and the closed universally quantified target proposition.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The hypotheses of the problem: `x`, `y`, and `z` are positive real numbers\nand their sum equals the sum of their reciprocals. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧\n x + y + z = 1 / x + 1 / y + 1 / z\n\n/-- The left-hand side of the inequality to be proved. -/\ndef lhs (x y z : ℝ) : ℝ :=\n Real.sqrt (x ^ 2 * y ^ 2 + y ^ 2 * z ^ 2 + z ^ 2 * x ^ 2) +\n (2 * Real.sqrt 2 - Real.sqrt 3) * (x * y * z)\n\n/-- The right-hand side of the inequality to be proved. -/\ndef rhs : ℝ :=\n 2 * Real.sqrt 2\n\n/-- The asserted inequality as a predicate in the three positive real variables. -/\ndef Inequality (x y z : ℝ) : Prop :=\n lhs x y z ≥ rhs\n\n/-- The full source assertion: for every triple of positive real numbers\nsatisfying the reciprocal-sum condition, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "74d31fcd-f7ea-59c1-a2cd-a252e76eaa99", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2d3f4f7fcbfd7a737346d2162c6ad73064e2e720ff300657bcf07b233fe60e3e", "task_path": "tasks/nmp3_74d31fcd-f7ea-59c1-a2cd-a252e76eaa99", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "74d31fcd-f7ea-59c1-a2cd-a252e76eaa99", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_74ede7d3-39d8-5dfd-89eb-aca14cc96832", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb{R}$ satisfy $abc=1$. Prove that \n-- \\[\n-- 6\\bigl(ab^{2}+bc^{2}+ca^{2}+(a+b+c)(ab+bc+ca)\\bigr)\\le\n-- 7\\,(a+b+c-1)^{2}+7\\,(ab+bc+ca-1)^{2}+16.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n 6 * (a * b ^ 2 + b * c ^ 2 + c * a ^ 2 +\n (a + b + c) * (a * b + b * c + c * a))\n\n/-- The right-hand side of the displayed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 7 * (a + b + c - 1) ^ 2 +\n 7 * (a * b + b * c + c * a - 1) ^ 2 + 16\n\n/-- The displayed inequality for a fixed real triple `(a, b, c)`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ rhs a b c\n\n/-- The assertion of the problem: for all real `a`, `b`, and `c` with\n`a * b * c = 1`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, a * b * c = 1 → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "74ede7d3-39d8-5dfd-89eb-aca14cc96832", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "26c7fa6f2fb0745ed9512ebfa7d7f0ed6568fe4c23bce8d13ef9b7f0aadcf2c7", "task_path": "tasks/nmp3_74ede7d3-39d8-5dfd-89eb-aca14cc96832", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "74ede7d3-39d8-5dfd-89eb-aca14cc96832", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_74fb1072-e143-5922-ac5e-cdd98e34b4ca", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- $$\\frac{1}{a^2-ab+b^2}+\\frac{1}{b^2-bc+c^2}+\\frac{1}{c^2-ca+a^2}\\ge\\frac{6}{a^2+b^2+c^2}\\,.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The common quadratic denominator `x^2 - x*y + y^2`. -/\ndef quadraticDenominator (x y : ℝ) : ℝ :=\n x ^ 2 - x * y + y ^ 2\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def inequalityLeftHandSide (a b c : ℝ) : ℝ :=\n 1 / quadraticDenominator a b +\n 1 / quadraticDenominator b c +\n 1 / quadraticDenominator c a\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def inequalityRightHandSide (a b c : ℝ) : ℝ :=\n 6 / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the sum of the reciprocals of\nthe three cyclic quadratic forms `a^2 - a*b + b^2`, `b^2 - b*c + c^2`, and\n`c^2 - c*a + a^2` is at least `6 / (a^2+b^2+c^2)`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c →\n inequalityLeftHandSide a b c ≥ inequalityRightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "74fb1072-e143-5922-ac5e-cdd98e34b4ca", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1d0595a0ddf3bcaa98741293231b2fc7837a447413c8cb48c55951cb1c7de757", "task_path": "tasks/nmp3_74fb1072-e143-5922-ac5e-cdd98e34b4ca", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "74fb1072-e143-5922-ac5e-cdd98e34b4ca", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7530280f-9fd4-5930-9548-547328b773e9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ and assume that no two of them are simultaneously zero (i.e., at most one of $a,b,c$ may be zero). Prove that \n-- \\[\n-- \\sqrt[3]{\\frac{a^{2}+bc}{\\,b^{2}+c^{2}\\,}}+\\sqrt[3]{\\frac{b^{2}+ca}{\\,c^{2}+a^{2}\\,}}+\\sqrt[3]{\\frac{c^{2}+ab}{\\,a^{2}+b^{2}\\,}}\\ge \\frac{9\\sqrt[3]{abc}}{a+b+c}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The condition that among `a`, `b`, and `c` no two are simultaneously zero.\nEquivalently (for three values), at most one of them is zero. -/\ndef NoTwoZero (a b c : ℝ) : Prop :=\n (a ≠ 0 ∨ b ≠ 0) ∧ (b ≠ 0 ∨ c ≠ 0) ∧ (c ≠ 0 ∨ a ≠ 0)\n\n/-- The nonnegative hypotheses and the no-two-zero hypothesis from the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ NoTwoZero a b c\n\n/-- The real cube root, represented as the real power with exponent `1 / 3`. -/\nnoncomputable def cubeRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 3 : ℝ)\n\n/-- The displayed inequality, for arbitrary real `a`, `b`, and `c`.\nIts fractions are interpreted using real division. -/\ndef Inequality (a b c : ℝ) : Prop :=\n cubeRoot ((a ^ 2 + b * c) / (b ^ 2 + c ^ 2)) +\n cubeRoot ((b ^ 2 + c * a) / (c ^ 2 + a ^ 2)) +\n cubeRoot ((c ^ 2 + a * b) / (a ^ 2 + b ^ 2)) ≥\n (9 * cubeRoot (a * b * c)) / (a + b + c)\n\n/-- The full assertion: for all nonnegative real `a`, `b`, and `c`, with no two\nsimultaneously zero, the displayed three-term cube-root inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\n/-- The displayed denominators are positive under the source admissibility conditions.\nThis records that the fractional expressions are mathematically well defined and does not\nadd any hypothesis to `Target`. -/\ntheorem admissible_denominators_pos {a b c : ℝ} (h : Admissible a b c) :\n 0 < b ^ 2 + c ^ 2 ∧ 0 < c ^ 2 + a ^ 2 ∧\n 0 < a ^ 2 + b ^ 2 ∧ 0 < a + b + c := by\n rcases h with ⟨ha, hb, hc, hab, hbc, hca⟩\n have h_bc : 0 < b ^ 2 + c ^ 2 := by\n rcases hbc with hb_ne | hc_ne\n · have hbpos : 0 < b := lt_of_le_of_ne hb (Ne.symm hb_ne)\n nlinarith [sq_nonneg c]\n · have hcpos : 0 < c := lt_of_le_of_ne hc (Ne.symm hc_ne)\n nlinarith [sq_nonneg b]\n have h_ca : 0 < c ^ 2 + a ^ 2 := by\n rcases hca with hc_ne | ha_ne\n · have hcpos : 0 < c := lt_of_le_of_ne hc (Ne.symm hc_ne)\n nlinarith [sq_nonneg a]\n · have hapos : 0 < a := lt_of_le_of_ne ha (Ne.symm ha_ne)\n nlinarith [sq_nonneg c]\n have h_ab : 0 < a ^ 2 + b ^ 2 := by\n rcases hab with ha_ne | hb_ne\n · have hapos : 0 < a := lt_of_le_of_ne ha (Ne.symm ha_ne)\n nlinarith [sq_nonneg b]\n · have hbpos : 0 < b := lt_of_le_of_ne hb (Ne.symm hb_ne)\n nlinarith [sq_nonneg a]\n have h_sum : 0 < a + b + c := by\n rcases hab with ha_ne | hb_ne\n · have hapos : 0 < a := lt_of_le_of_ne ha (Ne.symm ha_ne)\n linarith\n · have hbpos : 0 < b := lt_of_le_of_ne hb (Ne.symm hb_ne)\n linarith\n exact ⟨h_bc, h_ca, h_ab, h_sum⟩\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7530280f-9fd4-5930-9548-547328b773e9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ce701ad0f01a1812d1f0f51b8852bee1c0c074dd3e20e611785acebedb2d201c", "task_path": "tasks/nmp3_7530280f-9fd4-5930-9548-547328b773e9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7530280f-9fd4-5930-9548-547328b773e9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_75344483-3d4c-51ff-826a-96cf80aefd20", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b$ be integers greater than $1$. Suppose that for all sufficiently large integers $n$, the integer $a^n-n^a$ divides $b^n-n^b$. Prove that either $a=b$ or $(a,b)=(2,4)$.\nimport Mathlib\n\n/-!\n# Formalization of the large-`n` divisibility problem\n\nThe source problem concerns integers `a` and `b` greater than one and a\ndivisibility relation that is to hold for every sufficiently large integer\n`n`. The exponent `n` in the source is an integer exponent; on the\neventual nonnegative range this is represented by `n.toNat`.\n-/\n\nnamespace Problem\n\n/--\nThe hypothesis that, for every sufficiently large integer `n`, the integer\n`a ^ n - n ^ a` divides `b ^ n - n ^ b`.\n\nThe threshold `N` is explicitly taken to be nonnegative. This does not\nstrengthen the usual meaning of \"sufficiently large\", since any integer\nthreshold can be increased to a nonnegative one. On the range `N ≤ n`, the\ncasts `n.toNat` and `a.toNat` are the ordinary nonnegative integer exponents\nfrom the source (using `1 < a`).\n-/\ndef LargeNDivisibility (a b : ℤ) : Prop :=\n ∃ N : ℤ, 0 ≤ N ∧\n ∀ n : ℤ, N ≤ n →\n (a ^ n.toNat - n ^ a.toNat) ∣ (b ^ n.toNat - n ^ b.toNat)\n\n/--\nThe full assertion of the problem: if integers `a, b > 1` satisfy the\neventual divisibility hypothesis, then either `a = b` or `(a,b) = (2,4)`.\n-/\ndef Target : Prop :=\n ∀ a b : ℤ, 1 < a → 1 < b → LargeNDivisibility a b →\n a = b ∨ (a, b) = (2, 4)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "75344483-3d4c-51ff-826a-96cf80aefd20", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a3d43df4fe1a8886f220dbc6766aa53340740ee0f08d3abb0f0f29f4f3f01225", "task_path": "tasks/nmp3_75344483-3d4c-51ff-826a-96cf80aefd20", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "75344483-3d4c-51ff-826a-96cf80aefd20", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_75458731-a7ea-56da-9994-23efa7665a63", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $S$ be a set of positive integers such that for any $a,b\\in S$ with $a x\n\n/-- The candidate solution `f(x) = -2x`. -/\ndef negativeTwoSolution : ℝ → ℝ :=\n fun (x : ℝ) => (-2 : ℝ) * x\n\n/-- The explicit proposed solution set consisting of the two candidates. -/\ndef ProposedSolutions : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | f = identitySolution ∨ f = negativeTwoSolution}\n\n/-- The complete-answer assertion for the proposed solution set. This is the\nformal target of the `find all` problem; it asserts both directions of the\nclassification. -/\ndef Target : Prop :=\n CompleteAnswer ProposedSolutions\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7552a5a8-c774-5004-81ad-ef7b6f977b16", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c9c8c0b0ca2753b274a91c4983b74c7e8e79a7bb979dfaac0b0d708496c63fe9", "task_path": "tasks/nmp3_7552a5a8-c774-5004-81ad-ef7b6f977b16", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7552a5a8-c774-5004-81ad-ef7b6f977b16", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7560cd3e-4b1d-562b-805a-dbcd5ea2ac5f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- We have an infinite strictly increasing sequence of positive integers \\(a_1,a_2,a_3,\\dots\\). Prove that there are infinitely many indices \\(m\\) for which the term \\(a_m\\) can be expressed as \n-- \\[a_m = x\\,a_i + y\\,a_j\\] \n-- for some indices \\(i,j\\) (not necessarily distinct) and positive integers \\(x,y\\; (>0)\\).\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe original problem concerns an infinite strictly increasing sequence of\npositive integers `a₁, a₂, a₃, …`. We use `ℕ+` for the positive integers,\nboth as values and as (positive) indices. `StrictMono a` says that the\nsequence is strictly increasing. The set of admissible indices `m` consists\nof those for which `a m` is a positive-integer linear combination of two\nterms of the sequence (the two indices may coincide).\n-/\n\nnamespace Problem\n\n/-- `Admissible a m` says that `a m` can be written as\n`x * a i + y * a j`, where `i`, `j`, `x`, and `y` are positive integers\nand `i` and `j` are not required to be distinct. -/\ndef Admissible (a : ℕ+ → ℕ+) (m : ℕ+) : Prop :=\n ∃ i j x y : ℕ+,\n a m = x * a i + y * a j\n\n/-- The assertion of the problem: for every infinite strictly increasing\nsequence of positive integers, infinitely many indices `m` are admissible. -/\ndef Target : Prop :=\n ∀ a : ℕ+ → ℕ+,\n StrictMono a → Set.Infinite {m : ℕ+ | Admissible a m}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7560cd3e-4b1d-562b-805a-dbcd5ea2ac5f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a4e5a521001484b4c58aae4015ee756d9e25fb7fd720790d2b4f5b099a4b8bae", "task_path": "tasks/nmp3_7560cd3e-4b1d-562b-805a-dbcd5ea2ac5f", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7560cd3e-4b1d-562b-805a-dbcd5ea2ac5f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7578bb52-bf12-5ecc-8725-76859cb245fe", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f(x)$ be a nonconstant polynomial with integer coefficients such that $f(0)$ and $f(1)$ are odd. For each positive integer $k$ define \n-- \n-- \\[\n-- a_k \\;=\\; f(1)\\,f(2)\\,\\cdots\\,f(k)\\;+\\;1 .\n-- \\]\n-- \n-- Prove that there are infinitely many distinct prime numbers that divide at least one term of the sequence $(a_k)_{k\\ge 1}$.\nimport Mathlib\n\n/-!\n# Formalization of the prime-divisors problem\n\nThe original problem asks to prove that, for every nonconstant integer\npolynomial `f` with odd values at `0` and `1`, the set of prime numbers\ndividing at least one term of the sequence\n`a_k = f(1) * ... * f(k) + 1` (`k ≥ 1`) is infinite.\n\nThis file only records the mathematical statement. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The integer `a_k = f(1) * f(2) * ... * f(k) + 1`.\n\nThe definition is total on `ℕ`, but every use in the statement below is\nrestricted to positive indices `k`. -/\ndef a (f : Polynomial ℤ) (k : ℕ) : ℤ :=\n (∏ i ∈ Finset.Icc 1 k, Polynomial.eval (i : ℤ) f) + 1\n\n/-- A polynomial over `ℤ` is nonconstant exactly when its natural degree is\nnonzero. -/\ndef NonconstantIntegerPolynomial (f : Polynomial ℤ) : Prop :=\n f.natDegree ≠ 0\n\n/-- The hypotheses on the polynomial in the problem: it has integer\ncoefficients, is nonconstant, and its values at `0` and `1` are odd. -/\ndef AdmissiblePolynomial (f : Polynomial ℤ) : Prop :=\n NonconstantIntegerPolynomial f ∧\n Odd (Polynomial.eval (0 : ℤ) f) ∧\n Odd (Polynomial.eval (1 : ℤ) f)\n\n/-- A natural number `p` is a prime that divides at least one positive-index\nterm of the sequence `(a_k)`. -/\ndef PrimeDividingSomeTerm (f : Polynomial ℤ) (p : ℕ) : Prop :=\n p.Prime ∧ ∃ k : ℕ, 0 < k ∧ (p : ℤ) ∣ a f k\n\n/-- There are infinitely many distinct prime numbers dividing at least one\nterm of the sequence `(a_k)_{k ≥ 1}`. -/\ndef Target : Prop :=\n ∀ f : Polynomial ℤ,\n AdmissiblePolynomial f →\n Set.Infinite {p : ℕ | PrimeDividingSomeTerm f p}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7578bb52-bf12-5ecc-8725-76859cb245fe", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "76454fe15735de022cd7280dba99b4e7f7f3336d593f900cfd00c2f7a721cecb", "task_path": "tasks/nmp3_7578bb52-bf12-5ecc-8725-76859cb245fe", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7578bb52-bf12-5ecc-8725-76859cb245fe", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_759c12af-638f-59b3-910f-347d9d17e6f6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A$ be a set of $2n$ points in the plane, with no three points collinear. Prove that for any two distinct points $a,b\\in A$ there exists a line that separates $A$ into two subsets each containing exactly $n$ points, and such that $a$ and $b$ lie on opposite sides of the line.\n/-\nFormalization of the planar point-set separation statement from `problem.md`.\n\nThe plane is represented by Cartesian coordinates `ℝ × ℝ`. A line is represented\nby a nonzero normal vector and a real offset; its two open sides are the sign regions\nof the corresponding affine linear functional.\n-/\nimport Mathlib\n\nopen Classical\n\nnamespace Problem\n\n/-- A point of the Euclidean plane, represented by its Cartesian coordinates. -/\nabbrev Plane : Type := ℝ × ℝ\n\n/-- An oriented affine line in the plane, given by a nonzero normal vector and an\noffset. Multiplying both the normal and the offset by a nonzero scalar leaves the\nunderlying line unchanged. -/\nstructure AffineLine where\n normal : Plane\n offset : ℝ\n normal_ne_zero : normal ≠ 0\n\n/-- The affine linear functional whose sign determines the two open sides of a line. -/\nnoncomputable def AffineLine.orientedValue (L : AffineLine) (p : Plane) : ℝ :=\n L.normal.1 * p.1 + L.normal.2 * p.2 + L.offset\n\n/-- The open side of `L` on which `orientedValue` is positive. -/\ndef AffineLine.PositiveSide (L : AffineLine) (p : Plane) : Prop :=\n 0 < L.orientedValue p\n\n/-- The open side of `L` on which `orientedValue` is negative. -/\ndef AffineLine.NegativeSide (L : AffineLine) (p : Plane) : Prop :=\n L.orientedValue p < 0\n\n/-- Points `p`, `q`, and `r` are collinear exactly when the determinant of two\ndifference vectors vanishes. -/\ndef CollinearTriple (p q r : Plane) : Prop :=\n (q.1 - p.1) * (r.2 - p.2) - (q.2 - p.2) * (r.1 - p.1) = 0\n\n/-- No three distinct points of `A` are collinear. -/\ndef NoThreeCollinear (A : Finset Plane) : Prop :=\n ∀ p ∈ A, ∀ q ∈ A, ∀ r ∈ A,\n p ≠ q → p ≠ r → q ≠ r → ¬ CollinearTriple p q r\n\n/-- The line `L` partitions `A` into its two open positive and negative sides, and\neach side contains exactly `n` points of `A`. -/\ndef AffineLine.SeparatesBalanced (L : AffineLine) (A : Finset Plane) (n : ℕ) : Prop :=\n let positiveSide := A.filter (fun p => L.PositiveSide p)\n let negativeSide := A.filter (fun p => L.NegativeSide p)\n positiveSide.card = n ∧ negativeSide.card = n ∧ A = positiveSide ∪ negativeSide\n\n/-- Two points lie on opposite sides of `L` when their strict signs are opposite. -/\ndef OppositeSides (L : AffineLine) (a b : Plane) : Prop :=\n (L.PositiveSide a ∧ L.NegativeSide b) ∨\n (L.NegativeSide a ∧ L.PositiveSide b)\n\n/-- The complete statement: for every natural number `n` and every finite set `A`\nof `2 * n` planar points in general position, every two distinct points `a` and `b`\nof `A` have a line whose two open halfplanes each contain exactly `n` points of `A`,\nwith `a` and `b` on opposite sides. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (A : Finset Plane),\n A.card = 2 * n →\n NoThreeCollinear A →\n ∀ a b : Plane,\n a ∈ A → b ∈ A → a ≠ b →\n ∃ L : AffineLine, L.SeparatesBalanced A n ∧ OppositeSides L a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "759c12af-638f-59b3-910f-347d9d17e6f6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "529599846cd96eadada80bfc11ca473809574d7e8e9ab3f63db21910c087fa68", "task_path": "tasks/nmp3_759c12af-638f-59b3-910f-347d9d17e6f6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "759c12af-638f-59b3-910f-347d9d17e6f6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_75ace225-6206-5888-aca0-a1651dc27b74", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be positive real numbers. Prove that \n-- \\[\n-- \\sqrt[3]{\\frac{(a+b)(b+c)(c+a)}{abc}}\\;\\ge\\;\\frac{4}{3}\\Bigl(\\frac{a^{2}}{a^{2}+bc}+\\frac{b^{2}}{b^{2}+ca}+\\frac{c^{2}}{c^{2}+ab}\\Bigr)\\,.\n-- \\]\n/-\nStatement formalization for the inequality\n\n cbrt(((a + b) * (b + c) * (c + a)) / (a * b * c))\n ≥ (4 / 3) * (a^2 / (a^2 + b*c) + b^2 / (b^2 + c*a) + c^2 / (c^2 + a*b))\n\nfor positive real numbers a, b, c.\n-/\n\nmodule\n\npublic import Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The real cube root, represented as the real power with exponent `1 / 3`.\nFor the nonnegative (indeed positive) radicands appearing in the problem, this is the\nprincipal real cube root. -/\nnoncomputable def CubeRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 3 : ℝ)\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def LeftSide (a : ℝ) (b : ℝ) (c : ℝ) : ℝ :=\n CubeRoot (((a + b) * (b + c) * (c + a)) / (a * b * c))\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def RightSide (a : ℝ) (b : ℝ) (c : ℝ) : ℝ :=\n (4 / 3 : ℝ) *\n (a ^ (2 : ℕ) / (a ^ (2 : ℕ) + b * c) +\n b ^ (2 : ℕ) / (b ^ (2 : ℕ) + c * a) +\n c ^ (2 : ℕ) / (c ^ (2 : ℕ) + a * b))\n\n/-- The claimed inequality, for a fixed positive triple `(a, b, c)`. -/\nnoncomputable def Inequality (a : ℝ) (b : ℝ) (c : ℝ) : Prop :=\n LeftSide a b c ≥ RightSide a b c\n\n/-- The complete proposition asserted by the problem: for every positive real triple\n`a`, `b`, `c`, the stated cube-root inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ (a : ℝ) (b : ℝ) (c : ℝ),\n 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "75ace225-6206-5888-aca0-a1651dc27b74", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "08392f1f96bc08989bb885a2528fcfd31fb55fb261c871b5dc1f97e88943bfbe", "task_path": "tasks/nmp3_75ace225-6206-5888-aca0-a1651dc27b74", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "75ace225-6206-5888-aca0-a1651dc27b74", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_75ce0275-adcf-54a5-a8cf-8cb20f676e0f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x_1,x_2,\\dots,x_n$ and $y_1,y_2,\\dots,y_n$ be real numbers such that \n-- $$x_1\\ge x_2\\ge\\cdots\\ge x_n>0,\\qquad y_1\\ge y_2\\ge\\cdots\\ge y_n>0,$$ \n-- and for every $k=1,2,\\dots,n$ \n-- $$\\prod_{i=1}^{k}x_i\\;\\ge\\;\\prod_{i=1}^{k}y_i.$$ \n-- Prove that \n-- $$\\sum_{i=1}^{n}x_i\\;\\ge\\;\\sum_{i=1}^{n}y_i.$$\nimport Mathlib\n\n/-!\n# Formalization of a finite product/sum inequality\n\nThe source problem considers two finite nonincreasing positive real sequences\n`x₁, …, xₙ` and `y₁, …, yₙ`. Their prefix products satisfy\n`x₁ ⋯ xₖ ≥ y₁ ⋯ yₖ` for every `k = 1, …, n`, and the desired conclusion is\n`x₁ + ⋯ + xₙ ≥ y₁ + ⋯ + yₙ`.\n\nThe tuples are represented by functions on `Fin n`, so no out-of-range values\nare introduced. The natural number `n` is required to be positive, reflecting\nthe fact that the source indexes the entries from `1` through `n` and takes\n`k` starting at `1`.\n-/\n\nnamespace Problem\n\n/-- The product of the first `k` terms of a finite real sequence `x`, where\n`k ≤ n`. It is the source expression `∏_{i=1}^{k} x_i`. -/\nnoncomputable def PrefixProduct {n : ℕ} (x : Fin n → ℝ) (k : ℕ) (hk : k ≤ n) : ℝ :=\n ∏ i : Fin k, x (Fin.castLE hk i)\n\n/-- The sequence is nonincreasing: `x_1 ≥ x_2 ≥ ⋯ ≥ x_n`. -/\ndef NonincreasingOnFin {n : ℕ} (x : Fin n → ℝ) : Prop :=\n ∀ i j : Fin n, i ≤ j → x j ≤ x i\n\n/-- Every entry of the finite real sequence is strictly positive. -/\ndef PositiveOnFin {n : ℕ} (x : Fin n → ℝ) : Prop :=\n ∀ i : Fin n, 0 < x i\n\n/-- The sequence is both nonincreasing and strictly positive, matching\n`x_1 ≥ x_2 ≥ ⋯ ≥ x_n > 0`. -/\ndef NonincreasingPositiveOnFin {n : ℕ} (x : Fin n → ℝ) : Prop :=\n NonincreasingOnFin x ∧ PositiveOnFin x\n\n/-- The prefix-product dominance hypothesis:\nfor every `k = 1, …, n`,\n`∏_{i=1}^{k} x_i ≥ ∏_{i=1}^{k} y_i`. -/\ndef PrefixProductDominates {n : ℕ} (x y : Fin n → ℝ) : Prop :=\n ∀ (k : ℕ) (hk : k ≤ n), 1 ≤ k →\n PrefixProduct x k hk ≥ PrefixProduct y k hk\n\n/-- The assumptions of the source problem on the pair of finite real\nsequences, apart from the implicit positivity of the length. -/\ndef Conditions (n : ℕ) (x y : Fin n → ℝ) : Prop :=\n NonincreasingPositiveOnFin x ∧\n NonincreasingPositiveOnFin y ∧\n PrefixProductDominates x y\n\n/-- The complete assertion to be proved: for every positive length `n`, every\npair of real `n`-tuples satisfying the stated monotonicity, positivity, and\nprefix-product conditions has\n`∑_{i=1}^{n} x_i ≥ ∑_{i=1}^{n} y_i`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (x y : Fin n → ℝ),\n 0 < n → Conditions n x y →\n (∑ i : Fin n, x i) ≥ (∑ i : Fin n, y i)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "75ce0275-adcf-54a5-a8cf-8cb20f676e0f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f9b28d258a00ae50e1459b5702431dec620dfecc60e7fd5b719e1e2af4c9292e", "task_path": "tasks/nmp3_75ce0275-adcf-54a5-a8cf-8cb20f676e0f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "75ce0275-adcf-54a5-a8cf-8cb20f676e0f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_75d17c10-372b-54a2-9612-9b6fa01bb7f7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given positive numbers $a_1,\\dots,a_n$, $b_1,\\dots,b_n$, $c_1,\\dots,c_n$. For each $k\\in\\{1,\\dots,n\\}$ let $m_k$ be the maximum of the products $a_i b_j c_\\ell$ over all triples $(i,j,\\ell)$ with $\\max\\{i,j,\\ell\\}=k$. Prove that \n-- \\[\n-- \\bigl(a_1+\\cdots +a_n\\bigr)\\bigl(b_1+\\cdots +b_n\\bigr)\\bigl(c_1+\\cdots +c_n\\bigr)\\le n^{2}\\,\\bigl(m_1+\\cdots +m_n\\bigr)\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the max-index product inequality\n\nThe original problem is stated for positive real numbers. We use `Fin n` for the\none-based index set `{1, ..., n}`; an index `i : Fin n` corresponds to the original\nindex `i.val + 1`.\n-/\n\nnamespace Problem\n\n/-- The largest one-based index among three indices `i`, `j`, and `ℓ`. -/\ndef oneBasedIndexMax {n : ℕ} (i j ℓ : Fin n) : ℕ :=\n max (max (i.val + 1) (j.val + 1)) (ℓ.val + 1)\n\n/--\nThe set of all products `a i * b j * c ℓ` whose largest one-based index is `k`.\n\nThe index `k : Fin n` denotes the original index `k.val + 1`.\n-/\ndef maxIndexProductSet {n : ℕ} (a b c : Fin n → ℝ) (k : Fin n) : Set ℝ :=\n {x : ℝ | ∃ i j ℓ : Fin n,\n oneBasedIndexMax i j ℓ = k.val + 1 ∧ x = a i * b j * c ℓ}\n\n/-- A real-valued sequence indexed by `Fin n` is strictly positive termwise. -/\ndef PositiveTuple {n : ℕ} (x : Fin n → ℝ) : Prop :=\n ∀ i : Fin n, 0 < x i\n\n/--\n`m` consists of the maximum product at every one-based index `k`.\n\nFor each `k`, `IsGreatest` requires both that `m k` is an attainable product whose\ntriple has maximum index `k` and that every such product is at most `m k`.\n-/\ndef IsMaxIndexProductMaximum {n : ℕ}\n (a b c m : Fin n → ℝ) : Prop :=\n ∀ k : Fin n, IsGreatest (maxIndexProductSet a b c k) (m k)\n\n/-- The displayed product-sum inequality for `a`, `b`, `c`, and `m`. -/\ndef InequalityHolds {n : ℕ} (a b c m : Fin n → ℝ) : Prop :=\n (∑ i : Fin n, a i) * (∑ i : Fin n, b i) * (∑ i : Fin n, c i)\n ≤ (n : ℝ) ^ 2 * (∑ k : Fin n, m k)\n\n/--\nGiven positive real sequences `a`, `b`, and `c` indexed by `{1, ..., n}`, and\ngiven `m k` to be the maximum of the products `a i * b j * c ℓ` over all triples\nwhose largest index is `k`, the product of the three sums is at most `n^2` times\nthe sum of the maxima.\n-/\ndef Target : Prop :=\n ∀ (n : ℕ), 0 < n →\n ∀ (a b c : Fin n → ℝ),\n PositiveTuple a →\n PositiveTuple b →\n PositiveTuple c →\n ∀ (m : Fin n → ℝ),\n IsMaxIndexProductMaximum a b c m →\n InequalityHolds a b c m\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "75d17c10-372b-54a2-9612-9b6fa01bb7f7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bb9df59770106a1a2d7b4903aeb15020e9317a6a394f9a7d15c01c365aff581b", "task_path": "tasks/nmp3_75d17c10-372b-54a2-9612-9b6fa01bb7f7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "75d17c10-372b-54a2-9612-9b6fa01bb7f7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_75dfb8fb-7d09-55fd-89f5-3cd35c3e00ea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Determine all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that for all real numbers $x$ and $y$,\n-- \\[\n-- f\\bigl(f(x)\\bigr)\\,\\bigl(x-f(y)\\bigr)+2xy = f(x)\\,f(x+y).\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the functional-equation problem\n\nThe source problem asks for every function `f : ℝ → ℝ` satisfying\n\n`f (f x) * (x - f y) + 2 * x * y = f x * f (x + y)`\n\nfor every pair of real numbers `x`, `y`.\n\nThis file records the admissibility predicate, a predicate saying that a proposed\nset is the complete solution set (in both directions), and the concrete target\nwith the proposed complete solution set consisting of the identity function.\n-/\n\nnamespace Problem\n\n/-- A real-valued function of a real variable is admissible when it satisfies the\nfunctional equation displayed in the problem for every pair of real numbers `x`\nand `y`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ (x y : ℝ),\n f (f x) * (x - f y) + (2 : ℝ) * x * y = f x * f (x + y)\n\n/-- The proposed complete set of solutions: all functions `f : ℝ → ℝ` that are\npointwise equal to the identity function. -/\ndef identitySolutionSet : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | ∀ x : ℝ, f x = x}\n\n/-- A proposed set `S` of real-valued functions is a complete answer precisely\nwhen it has no non-admissible members and contains every admissible function.\nThis is the two-direction classification condition requested by \"determine all\nfunctions\"; it does not merely assert that at least one solution exists. -/\ndef AnswerCorrect (S : Set (ℝ → ℝ)) : Prop :=\n (∀ f : ℝ → ℝ, f ∈ S → Admissible f) ∧\n (∀ f : ℝ → ℝ, Admissible f → f ∈ S)\n\n/-- The target statement: the set of all functions pointwise equal to the\nidentity is the complete solution set of the functional equation. -/\ndef Target : Prop :=\n AnswerCorrect identitySolutionSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "75dfb8fb-7d09-55fd-89f5-3cd35c3e00ea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e0fde99a8a54d735fab5307380964abed8332f5f8e0c551c98c440b0ad5b0d63", "task_path": "tasks/nmp3_75dfb8fb-7d09-55fd-89f5-3cd35c3e00ea", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "75dfb8fb-7d09-55fd-89f5-3cd35c3e00ea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_75e4f483-d8a4-56bc-bbee-412e3b7cd26d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\sqrt{\\frac{a}{b}}\\;+\\;\\sqrt{\\Big(\\sum_{\\text{cyc}}a\\Big)\\Big(\\sum_{\\text{cyc}}\\frac{1}{a}\\Big)}\n-- \\;\\ge\\;\\frac{32}{3}\\Bigg(\\sum_{\\text{cyc}}\\frac{\\sqrt{ab}}{\\sqrt{a}+\\sqrt{b}+2\\sqrt{c}}\\Bigg)\\Bigg(\\sum_{\\text{cyc}}\\frac{\\sqrt{c}}{2\\sqrt{ab}+\\sqrt{bc}+\\sqrt{ac}}\\Bigg)\\!,\n-- \\] \n-- where all cyclic sums are taken over $(a,b,c)$.\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The sum of the three cyclic shifts of a function of `(a, b, c)`. -/\ndef cycSum (f : ℝ → ℝ → ℝ → ℝ) (a b c : ℝ) : ℝ :=\n f a b c + f b c a + f c a b\n\n/-- The left-hand side of the target inequality. -/\ndef leftSide (a b c : ℝ) : ℝ :=\n cycSum (fun x y _ => Real.sqrt (x / y)) a b c +\n Real.sqrt\n ((cycSum (fun x _ _ => x) a b c) *\n (cycSum (fun x _ _ => 1 / x) a b c))\n\n/-- The first cyclic sum appearing on the right-hand side. -/\ndef firstRightSum (a b c : ℝ) : ℝ :=\n cycSum\n (fun x y z => Real.sqrt (x * y) /\n (Real.sqrt x + Real.sqrt y + 2 * Real.sqrt z)) a b c\n\n/-- The second cyclic sum appearing on the right-hand side. -/\ndef secondRightSum (a b c : ℝ) : ℝ :=\n cycSum\n (fun x y z => Real.sqrt z /\n (2 * Real.sqrt (x * y) + Real.sqrt (y * z) + Real.sqrt (x * z))) a b c\n\n/-- The right-hand side of the target inequality. -/\ndef rightSide (a b c : ℝ) : ℝ :=\n (32 / 3 : ℝ) * firstRightSum a b c * secondRightSum a b c\n\n/-- The hypothesis that `a`, `b`, and `c` are all positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The asserted inequality, for fixed real parameters `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n leftSide a b c ≥ rightSide a b c\n\n/-- The inequality asserted in the problem for all positive real `a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "75e4f483-d8a4-56bc-bbee-412e3b7cd26d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bb76138f209118202f175c8c23e89ccafcd37b558cb79a2211993ce4f99a6442", "task_path": "tasks/nmp3_75e4f483-d8a4-56bc-bbee-412e3b7cd26d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "75e4f483-d8a4-56bc-bbee-412e3b7cd26d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_761cda88-5b23-5fb4-a8b7-76cfa1be1a8e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,\\;b,\\;c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{b+c}{\\sqrt{a^{2}+3bc}}+\\frac{c+a}{\\sqrt{b^{2}+3ca}}+\\frac{a+b}{\\sqrt{c^{2}+3ab}}\\ge 3\\,. \n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\nnamespace Problem\n\n/-- The first summand in the cyclic inequality:\n`(b + c) / sqrt (a ^ 2 + 3 * b * c)`. -/\nnoncomputable def cyclicTerm (a b c : ℝ) : ℝ :=\n (b + c) / Real.sqrt (a ^ 2 + 3 * b * c)\n\n/-- The left-hand side of the stated cyclic inequality. -/\nnoncomputable def cyclicLHS (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The assertion in the problem: for all positive real numbers `a`, `b`, and `c`,\nthe cyclic sum is at least `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → cyclicLHS a b c ≥ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "761cda88-5b23-5fb4-a8b7-76cfa1be1a8e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "05737427952921f73a791d7b8bd7bf21f3eeedc3b98ced046e1d4e9e4f6566fc", "task_path": "tasks/nmp3_761cda88-5b23-5fb4-a8b7-76cfa1be1a8e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "761cda88-5b23-5fb4-a8b7-76cfa1be1a8e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7635e5b4-6bcf-5c71-b4a3-ada99d5e0676", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be the side lengths of a triangle and let \\(s=\\dfrac{a+b+c}{2}\\) be its semiperimeter. Prove that \n-- \\[\n-- \\frac{3}{s^{3}}\\;\\ge\\;\\frac{1}{a s^{2}+9\\,(s-a)^{3}}+\\frac{1}{b s^{2}+9\\,(s-b)^{3}}+\\frac{1}{c s^{2}+9\\,(s-c)^{3}}\\;.\n-- \\]\nimport Mathlib\n\n/-!\n# Triangle inequality with semiperimeter\n\nThis file formalizes the statement of the problem. It records the\nadmissibility conditions for real side lengths of a nondegenerate triangle,\nthe semiperimeter relation, and the asserted inequality. No proof of the\nassertion is supplied here.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The real numbers `a`, `b`, and `c` are side lengths of a nondegenerate\nEuclidean triangle. This is encoded by positivity of all three lengths and\nthe three strict triangle inequalities. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a < b + c ∧ b < c + a ∧ c < a + b\n\n/-- The inequality is expressed with the semiperimeter `s`. The condition on\n`s` is exactly `s = (a + b + c) / 2`. -/\ndef IsSemiperimeter (a b c s : ℝ) : Prop :=\n s = (a + b + c) / 2\n\n/-- A triple of side lengths together with its semiperimeter. The data are\nadmissible for the problem precisely when the lengths satisfy the strict\ntriangle conditions and `s` is their semiperimeter. -/\ndef TriangleAdmissible (a b c s : ℝ) : Prop :=\n IsTriangleSideLengths a b c ∧ IsSemiperimeter a b c s\n\n/-- The left-hand side of the desired inequality. -/\ndef LeftHandSide (s : ℝ) : ℝ :=\n 3 / s ^ 3\n\n/-- The right-hand side of the asserted inequality. -/\ndef RightHandSide (a b c s : ℝ) : ℝ :=\n 1 / (a * s ^ 2 + 9 * (s - a) ^ 3) +\n 1 / (b * s ^ 2 + 9 * (s - b) ^ 3) +\n 1 / (c * s ^ 2 + 9 * (s - c) ^ 3)\n\n/-- The asserted inequality for one admissible triangle. -/\ndef TriangleInequality (a b c s : ℝ) : Prop :=\n LeftHandSide s ≥ RightHandSide a b c s\n\n/-- The complete statement to be proved: for every real triple `a`, `b`, `c`\nof side lengths of a nondegenerate triangle, and for its semiperimeter `s`,\nthe displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c s : ℝ,\n TriangleAdmissible a b c s → TriangleInequality a b c s\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7635e5b4-6bcf-5c71-b4a3-ada99d5e0676", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "784583afca542b0bb9031d9705130383c12949fa8693f5984b7c3102a8c5ab21", "task_path": "tasks/nmp3_7635e5b4-6bcf-5c71-b4a3-ada99d5e0676", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7635e5b4-6bcf-5c71-b4a3-ada99d5e0676", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7644bc70-f7cc-5d67-a53e-7f2b5d14eb7b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- a,b,c are real numbers with $a^{2}+b^{2}+c^{2}=1$. Prove that \n-- \\[\n-- a^{5}+b^{5}+c^{5}-5abc\\,(a^{2}-bc)\\le 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a three-variable real inequality\n\nThe source problem asks one to prove, for real numbers `a`, `b`, and `c`\nsatisfying `a^2 + b^2 + c^2 = 1`, that\n`a^5 + b^5 + c^5 - 5*a*b*c*(a^2 - b*c) ≤ 1`.\n\nThe assertion is packaged as a proposition-valued definition. No proof is\nasserted here, as this file is the statement-formalization deliverable.\n-/\n\nnamespace Problem\n\n/-- The target assertion: for all real `a`, `b`, `c` with\n`a^2 + b^2 + c^2 = 1`,\n`a^5 + b^5 + c^5 - 5abc(a^2 - bc) ≤ 1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n a ^ 2 + b ^ 2 + c ^ 2 = 1 →\n a ^ 5 + b ^ 5 + c ^ 5 - 5 * a * b * c * (a ^ 2 - b * c) ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7644bc70-f7cc-5d67-a53e-7f2b5d14eb7b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "67c8ae0b251aefe4e9921e1a547547271b80feca62c84964c2ff4569cdbfdf94", "task_path": "tasks/nmp3_7644bc70-f7cc-5d67-a53e-7f2b5d14eb7b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7644bc70-f7cc-5d67-a53e-7f2b5d14eb7b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_765e7d00-86fe-5812-98be-caf8de71a416", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c>0$ prove that \n-- \\[\n-- \\frac{3a+b+2c}{a^{2}(b+c)}+\\frac{3b+c+2a}{b^{2}(c+a)}+\\frac{3c+a+2b}{c^{2}(a+b)}\\ge\\frac{27}{ab+bc+ca}\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (3 * a + b + 2 * c) / (a ^ 2 * (b + c)) +\n (3 * b + c + 2 * a) / (b ^ 2 * (c + a)) +\n (3 * c + a + 2 * b) / (c ^ 2 * (a + b))\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 27 / (a * b + b * c + c * a)\n\n/-- For positive real numbers `a`, `b`, and `c`, the stated sum is at least\n`27 / (a * b + b * c + c * a)`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → rhs a b c ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "765e7d00-86fe-5812-98be-caf8de71a416", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "72715a68289190264e276604cd69d9dc7ff1fb0edb6a4b5d659ae66b4d6c3551", "task_path": "tasks/nmp3_765e7d00-86fe-5812-98be-caf8de71a416", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "765e7d00-86fe-5812-98be-caf8de71a416", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_767ea5e9-abe6-54aa-a572-5d771f4dd6dd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that\n-- \\[\n-- \\frac{a^{2}}{2a+5b}+\\frac{b^{2}}{2b+5c}+\\frac{c^{2}}{2c+5a}\\ge\\frac{3\\,(a^{2}+b^{2}+c^{2})}{7\\,(a+b+c)}\\;.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a ^ 2 / (2 * a + 5 * b) +\n b ^ 2 / (2 * b + 5 * c) +\n c ^ 2 / (2 * c + 5 * a)\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 3 * (a ^ 2 + b ^ 2 + c ^ 2) / (7 * (a + b + c))\n\n/-- The asserted pointwise inequality. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ RHS a b c\n\n/-- The full proposition: for all positive real `a`, `b`, and `c`, the stated\ninequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "767ea5e9-abe6-54aa-a572-5d771f4dd6dd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0d2144945401a780acef43b84be4564d352864c560117cded9ebe0f8c5a23811", "task_path": "tasks/nmp3_767ea5e9-abe6-54aa-a572-5d771f4dd6dd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "767ea5e9-abe6-54aa-a572-5d771f4dd6dd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7683634c-1e51-5669-b982-8a08c212f5cb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>2$ be an integer and let $p>2n-4$ be a prime. Let $M$ be a set of $n$ points in the plane, no three of which are collinear. An integer is assigned to each point such that \n-- \n-- (a) exactly one of the assigned integers is congruent to $0\\pmod p$; \n-- \n-- (b) for any three distinct points $A,B,C\\in M$, the sum of the integers assigned to all points of $M$ that lie on the circumcircle of $\\triangle ABC$ is congruent to $0\\pmod p$. \n-- \n-- Prove that all points of $M$ lie on a common circle.\nimport Mathlib.Geometry.Euclidean.Sphere.Basic\nimport Mathlib.Data.Int.ModEq\nimport Mathlib.Data.Fintype.Sets\nimport Mathlib.Analysis.InnerProductSpace.PiL2\n\n/-!\n# Formal statement of a concyclicity problem\n\nThis file states (without proving) the geometric assertion from `problem.md`.\nThe ambient plane is the real Euclidean plane `EuclideanSpace ℝ (Fin 2)`.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A finite set of points in the plane has no three collinear points. -/\ndef NoThreeCollinear (M : Finset Plane) : Prop :=\n ∀ A : Plane, A ∈ M → ∀ B : Plane, B ∈ M → ∀ C : Plane, C ∈ M →\n A ≠ B → A ≠ C → B ≠ C → ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- A point `X` lies on the circumcircle of the (non-collinear) triangle `ABC`\nif there is a circle through all four points. When `A`, `B`, and `C` are distinct\nand non-collinear, such a circle is unique and is their circumcircle. -/\ndef OnCircumcircle (A B C X : Plane) : Prop :=\n ∃ s : EuclideanGeometry.Sphere Plane, A ∈ s ∧ B ∈ s ∧ C ∈ s ∧ X ∈ s\n\n/-- The sum of the integers assigned to points of `M` which lie on the\ncircumcircle of `A`, `B`, and `C`. -/\nnoncomputable def assignedSumOnCircumcircle {M : Finset Plane} (a : M → ℤ)\n (A B C : Plane) : ℤ := by\n classical\n exact ∑ X ∈ M.attach.filter (fun X : M => OnCircumcircle A B C (X : Plane)), a X\n\n/-- Assumption (a): exactly one assigned integer is congruent to `0` modulo `p`. -/\ndef ExactlyOneZeroMod (p : ℕ) {M : Finset Plane} (a : M → ℤ) : Prop :=\n ∃! X : M, Int.ModEq (p : ℤ) (a X) 0\n\n/-- Assumption (b): for every three distinct points of `M`, the sum over the\npoints of `M` on their circumcircle is congruent to `0` modulo `p`. -/\ndef CircumcircleSumCondition (p : ℕ) (M : Finset Plane) (a : M → ℤ) : Prop :=\n ∀ A : Plane, A ∈ M → ∀ B : Plane, B ∈ M → ∀ C : Plane, C ∈ M →\n A ≠ B → A ≠ C → B ≠ C →\n Int.ModEq (p : ℤ) (assignedSumOnCircumcircle a A B C) 0\n\n/-- The two admissibility conditions imposed by the problem on the assignment. -/\ndef AdmissibleAssignment (p : ℕ) (M : Finset Plane) (a : M → ℤ) : Prop :=\n ExactlyOneZeroMod p a ∧ CircumcircleSumCondition p M a\n\n/-- All points of `M` lie on one common (nondegenerate) circle. -/\ndef OnCommonCircle (M : Finset Plane) : Prop :=\n ∃ center : Plane, ∃ radius : ℝ,\n 0 < radius ∧ ∀ X : Plane, X ∈ M → dist X center = radius\n\n/-- The target proposition: for every integer `n > 2`, prime `p > 2n - 4`, finite\nset `M` of `n` planar points with no three collinear, and integer assignment\nsatisfying (a) and (b), the points of `M` lie on a common circle. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 2 < n →\n ∀ (p : ℕ), 2 * n - 4 < p → Nat.Prime p →\n ∀ (M : Finset Plane), M.card = n → NoThreeCollinear M →\n ∀ (a : M → ℤ), AdmissibleAssignment p M a →\n OnCommonCircle M\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7683634c-1e51-5669-b982-8a08c212f5cb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "776ce23b44056eb0f0db2ee2029091a62505a0a0dcf0cd94c91df343ce1874a2", "task_path": "tasks/nmp3_7683634c-1e51-5669-b982-8a08c212f5cb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7683634c-1e51-5669-b982-8a08c212f5cb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_76ce6eac-e0a1-5d31-b0c1-ffdc78910646", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{(a+1)(a+2)}+\\frac{1}{(b+1)(b+2)}+\\frac{1}{(c+1)(c+2)}\\ge\\frac12.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the positive-real inequality problem\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nsatisfying `a * b * c = 1`, that a sum of three rational expressions is at\nleast `1 / 2`. The target is stated as a proposition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The sum appearing on the left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / ((a + 1) * (a + 2)) +\n 1 / ((b + 1) * (b + 2)) +\n 1 / ((c + 1) * (c + 2))\n\n/-- All three real numbers are strictly positive. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The product of the three real numbers is one. -/\ndef ProductOne (a b c : ℝ) : Prop :=\n a * b * c = (1 : ℝ)\n\n/-- The admissibility conditions on the three real numbers: all are positive\nand their product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Positive a b c ∧ ProductOne a b c\n\n/-- The asserted inequality for a fixed admissible triple. -/\ndef Claim (a b c : ℝ) : Prop :=\n lhs a b c ≥ (1 / 2 : ℝ)\n\n/-- The complete proposition asserted by the source problem: for every triple\nof positive real numbers whose product is `1`, the displayed sum is at least\n`1 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Claim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "76ce6eac-e0a1-5d31-b0c1-ffdc78910646", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e6577ec076e6155721abdc983b7620c3110003ae5508c9967a6edaba0952a32c", "task_path": "tasks/nmp3_76ce6eac-e0a1-5d31-b0c1-ffdc78910646", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "76ce6eac-e0a1-5d31-b0c1-ffdc78910646", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_76ef3231-a722-54a2-8a06-68903850b7d6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that\n-- \\[\n-- 1\\;<\\;\\frac{a}{\\sqrt{a^{2}+b^{2}}}+\\frac{b}{\\sqrt{b^{2}+c^{2}}}+\\frac{c}{\\sqrt{c^{2}+a^{2}}}\\;\\le\\;\\frac{3\\sqrt2}{2}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic radical inequality\n\nFor positive real numbers `a`, `b`, and `c`, the cyclic sum\n`a / sqrt (a^2 + b^2) + b / sqrt (b^2 + c^2) + c / sqrt (c^2 + a^2)`\nis strictly greater than `1` and at most `3 * sqrt 2 / 2`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the cyclic inequality. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n a / Real.sqrt (a ^ 2 + b ^ 2) +\n b / Real.sqrt (b ^ 2 + c ^ 2) +\n c / Real.sqrt (c ^ 2 + a ^ 2)\n\n/-- The sharp upper bound appearing on the right-hand side. -/\ndef sharpUpperBound : ℝ :=\n (3 * Real.sqrt 2) / 2\n\n/-- The proposition asserted by the problem: for all positive reals `a`, `b`, `c`,\nthe cyclic sum lies strictly above `1` and at most at `3 * sqrt 2 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n 1 < cyclicSum a b c ∧ cyclicSum a b c ≤ sharpUpperBound\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "76ef3231-a722-54a2-8a06-68903850b7d6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7705efacfef6f240da02b3a6f1c50478bfdc59b79b159b6ad454b5a471558fb5", "task_path": "tasks/nmp3_76ef3231-a722-54a2-8a06-68903850b7d6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "76ef3231-a722-54a2-8a06-68903850b7d6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7703a76e-e71e-5453-b271-8d19aa2134d7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge0$ satisfy $x^2+y^2+z^2+xyz=4$. Prove that \n-- \\[\n-- xy+yz+zx+\\frac{(x-y)^2(y-z)^2(z-x)^2}{8}\\le 2+\\frac{(x+y+z-1)xyz}{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the problem in `problem.md`\n\nThe problem asks us to prove, for every triple of nonnegative real numbers\nsatisfying `x^2 + y^2 + z^2 + xyz = 4`, the stated inequality.\n\nThis file records the assertion as a proposition. In accordance with the\ntask instructions, no proof of the proposition is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition for the variables in the problem:\n`x`, `y`, and `z` are nonnegative real numbers satisfying\n`x^2 + y^2 + z^2 + xyz = 4`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z ∧\n x ^ 2 + y ^ 2 + z ^ 2 + x * y * z = 4\n\n/-- The conclusion of the problem, with real division by `8` and `2`. -/\ndef Inequality (x y z : ℝ) : Prop :=\n x * y + y * z + z * x +\n ((x - y) ^ 2 * (y - z) ^ 2 * (z - x) ^ 2) / 8\n ≤ 2 + ((x + y + z - 1) * x * y * z) / 2\n\n/-- The original assertion. The universal quantifier ranges over all\nnonnegative real triples satisfying the given constraint. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7703a76e-e71e-5453-b271-8d19aa2134d7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "17ac22e80d8dc06fadb9b9961a1652470c9707024d0e4cce4ee5b22416474b3d", "task_path": "tasks/nmp3_7703a76e-e71e-5453-b271-8d19aa2134d7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7703a76e-e71e-5453-b271-8d19aa2134d7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7717be7f-863b-52a8-a2e2-cec2c008e519", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any triangle $ABC$ with side lengths $a,b,c$, medians $m_a,m_b,m_c$ to those sides, and semiperimeter $s=\\frac{a+b+c}{2}$, the inequality \n-- \\[\n-- \\frac{1}{m_a}+\\frac{1}{m_b}+\\frac{1}{m_c}>\\frac{5}{s}\n-- \\]\n-- holds.\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used for the triangle. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A nondegenerate triangle is a triple of noncollinear points in the plane. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- The side length customarily denoted `a`, opposite vertex `A`: `a = |BC|`. -/\ndef sideA (_A B C : Plane) : ℝ :=\n dist B C\n\n/-- The side length customarily denoted `b`, opposite vertex `B`: `b = |CA|`. -/\ndef sideB (A _B C : Plane) : ℝ :=\n dist C A\n\n/-- The side length customarily denoted `c`, opposite vertex `C`: `c = |AB|`. -/\ndef sideC (A B _C : Plane) : ℝ :=\n dist A B\n\n/-- The length `m_a` of the median from `A` to the midpoint of side `BC`. -/\ndef medianA (A B C : Plane) : ℝ :=\n dist A (midpoint ℝ B C)\n\n/-- The length `m_b` of the median from `B` to the midpoint of side `CA`. -/\ndef medianB (A B C : Plane) : ℝ :=\n dist B (midpoint ℝ C A)\n\n/-- The length `m_c` of the median from `C` to the midpoint of side `AB`. -/\ndef medianC (A B C : Plane) : ℝ :=\n dist C (midpoint ℝ A B)\n\n/-- The semiperimeter `s = (a + b + c) / 2`. -/\ndef semiperimeter (a b c : ℝ) : ℝ :=\n (a + b + c) / 2\n\n/-- For every nondegenerate triangle `ABC` in the Euclidean plane, with side\nlengths `a`, `b`, `c`, medians `m_a`, `m_b`, `m_c`, and semiperimeter `s`,\nthe inequality `1 / m_a + 1 / m_b + 1 / m_c > 5 / s` holds. -/\ndef Target : Prop :=\n ∀ A B C : Plane,\n IsTriangle A B C →\n let a : ℝ := sideA A B C\n let b : ℝ := sideB A B C\n let c : ℝ := sideC A B C\n let m_a : ℝ := medianA A B C\n let m_b : ℝ := medianB A B C\n let m_c : ℝ := medianC A B C\n let s : ℝ := semiperimeter a b c\n 1 / m_a + 1 / m_b + 1 / m_c > 5 / s\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7717be7f-863b-52a8-a2e2-cec2c008e519", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "df9cd80f3a36f3ea893319afdd4fcc241ff11d1d2f96555b9dfef818b0c965ff", "task_path": "tasks/nmp3_7717be7f-863b-52a8-a2e2-cec2c008e519", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7717be7f-863b-52a8-a2e2-cec2c008e519", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7790b82e-a9d9-5fb5-b6ee-e232e9cb1dc4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $ab+bc+ca+2abc=1$. Prove that \n-- \\[\n-- 0\\;\\le\\;\\sqrt a+\\sqrt b+\\sqrt c\\;-\\;2\\sqrt{1+abc}\\;\\le\\;\\frac12\\sqrt{1+\\frac1{abc}}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for an inequality in three positive reals\n\nThe original problem asks to prove a two-sided inequality for positive real\nnumbers `a`, `b`, `c` subject to `ab + bc + ca + 2abc = 1`.\n\nThis file only states the assertion as a `Prop`; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real parameters. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧\n 0 < b ∧\n 0 < c ∧\n a * b + b * c + c * a + 2 * a * b * c = 1\n\n/-- The expression whose two-sided bound is asserted in the problem. -/\nnoncomputable def Expression (a b c : ℝ) : ℝ :=\n Real.sqrt a + Real.sqrt b + Real.sqrt c - 2 * Real.sqrt (1 + a * b * c)\n\n/-- The lower bound in the asserted double inequality. -/\ndef LowerBound (a b c : ℝ) : Prop :=\n 0 ≤ Expression a b c\n\n/-- The upper bound in the asserted double inequality. -/\nnoncomputable def UpperBound (a b c : ℝ) : Prop :=\n Expression a b c ≤ (1 / 2 : ℝ) * Real.sqrt (1 + 1 / (a * b * c))\n\n/-- Both sides of the asserted double inequality. -/\nnoncomputable def Bounds (a b c : ℝ) : Prop :=\n LowerBound a b c ∧ UpperBound a b c\n\n/-- The complete assertion of the problem. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Bounds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7790b82e-a9d9-5fb5-b6ee-e232e9cb1dc4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c33bd8994ce3f74809b7190ace502c4eb6f6d12ab1fc33265f64d27be306b9e3", "task_path": "tasks/nmp3_7790b82e-a9d9-5fb5-b6ee-e232e9cb1dc4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7790b82e-a9d9-5fb5-b6ee-e232e9cb1dc4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_77b22f9e-6738-542b-a5f7-647cc8b88166", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y>0$. Prove that \n-- \\[\n-- (x+y+1)(x^2+y^2+1)^2(x^4+y^4+1)\\le 3\\bigl(x^3+y^3+1\\bigr)^3.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The polynomial inequality asserted in the problem, for real numbers `x` and `y`. -/\ndef Inequality (x y : ℝ) : Prop :=\n (x + y + 1) * (x ^ 2 + y ^ 2 + 1) ^ 2 * (x ^ 4 + y ^ 4 + 1) ≤\n 3 * (x ^ 3 + y ^ 3 + 1) ^ 3\n\n/-- The full assertion: for every pair of strictly positive real numbers `x` and `y`,\nthe stated polynomial inequality holds. -/\ndef Target : Prop :=\n ∀ x y : ℝ, x > 0 → y > 0 → Inequality x y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "77b22f9e-6738-542b-a5f7-647cc8b88166", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d5f8bfc54da7eb46a82ebfcdcd01c569c1a2083d6ba394272163e355ab3e3ba5", "task_path": "tasks/nmp3_77b22f9e-6738-542b-a5f7-647cc8b88166", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "77b22f9e-6738-542b-a5f7-647cc8b88166", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_77b92c70-48de-558e-b974-9cc26b889895", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$ be a positive integer. A positive integer $b$ is called **$a$‑good** if for every positive integer $n$ with $an\\ge b$ the integer $an+1$ divides $\\displaystyle\\binom{an}{b}-1$. Suppose $b$ is $a$‑good but $b+2$ is not $a$‑good. Prove that $b+1$ is a prime number.\nimport Mathlib\n\n/-!\nFormal statement of the problem.\n\nFor a natural number `a`, a positive natural number `b` is `a`-good when,\nfor every positive natural number `n` satisfying `a * n ≥ b`, the number\n`a * n + 1` divides the natural number `(a * n).choose b - 1`.\nThe final declaration `Problem.Target` is the proposition stated in the\nproblem, with all positivity assumptions made explicit.\n-/\n\nnamespace Problem\n\n/-- The defining divisibility property of `b` being `a`-good.\n\nThe source restricts `b` to positive integers before using this property;\nthat domain restriction is recorded explicitly in `Problem.Target` rather\nthan hidden inside this predicate, so that `¬ IsAGood a (b + 2)` means\nthat the defining property itself fails for `b + 2`. -/\ndef IsAGood (a b : ℕ) : Prop :=\n ∀ n : ℕ,\n 0 < n →\n b ≤ a * n →\n (a * n + 1) ∣ (Nat.choose (a * n) b - 1)\n\n/--\nLet `a` be a positive integer. If a positive integer `b` is `a`-good\nbut `b + 2` is not `a`-good, then `b + 1` is prime.\n-/\ndef Target : Prop :=\n ∀ a b : ℕ,\n 0 < a →\n 0 < b →\n IsAGood a b →\n ¬ IsAGood a (b + 2) →\n Nat.Prime (b + 1)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "77b92c70-48de-558e-b974-9cc26b889895", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "04250ae0a276ff167cc6bb6bc3a2aba3bf0e3b77deba6d1b0e53fda196abc8ab", "task_path": "tasks/nmp3_77b92c70-48de-558e-b974-9cc26b889895", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "77b92c70-48de-558e-b974-9cc26b889895", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_77c12e85-21b5-5328-b49c-c2b4bd197146", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n,k$ be positive integers such that $3\\nmid n$ and $k\\ge n$. Prove that there exists a positive integer $m$ which is divisible by $n$ and whose sum of decimal digits equals $k$.\nimport Mathlib\n\n/-!\n# Formal statement for the decimal digit-sum divisibility problem\n\nThe source problem asks, for positive integers `n` and `k` with `3 ∤ n` and\n`k ≥ n`, to prove the existence of a positive integer `m` such that `n ∣ m`\nand the sum of the decimal digits of `m` is `k`.\n\nThe digit sum is represented using Mathlib's little-endian base-10 digit\nexpansion `Nat.digits 10 m`; leading zeros are absent and do not affect a sum.\n-/\n\nnamespace Problem\n\n/-- The sum of the decimal digits of a natural number. -/\ndef decimalDigitSum (m : ℕ) : ℕ :=\n (Nat.digits 10 m).sum\n\n/-- The proposition asserted by the source problem. -/\ndef Target : Prop :=\n ∀ n k : ℕ,\n 0 < n →\n 0 < k →\n ¬ (3 ∣ n) →\n n ≤ k →\n ∃ m : ℕ,\n 0 < m ∧\n n ∣ m ∧\n decimalDigitSum m = k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "77c12e85-21b5-5328-b49c-c2b4bd197146", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bc023baaf4ce156885eb95bc278e2c63a48842e21f90a8c91b9eff8679cc935d", "task_path": "tasks/nmp3_77c12e85-21b5-5328-b49c-c2b4bd197146", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "77c12e85-21b5-5328-b49c-c2b4bd197146", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_77d3818d-fdea-5a0e-a9f1-aca489eaef57", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are positive real numbers, prove that \n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\ge 3\\sqrt{\\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}}.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the target statement:\n\nIf `a`, `b`, and `c` are positive real numbers, then\n`a / b + b / c + c / a ≥ 3 * sqrt ((a^2 + b^2 + c^2) / (a*b + b*c + c*a))`.\n\nThe assertion is packaged as a proposition-valued definition. No proof is\nprovided here; this file only records the exact statement to be proved.\n-/\n\nnamespace Problem\n\n/-- The assertion as a closed proposition.\n\nThe three variables range over the real numbers. Each is assumed strictly\npositive. The division symbols are real division, the square root is the\nprincipal real square root `Real.sqrt`, and the displayed comparison is the\nnon-strict order on `ℝ`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n a / b + b / c + c / a ≥\n (3 : ℝ) * Real.sqrt\n ((a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "77d3818d-fdea-5a0e-a9f1-aca489eaef57", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3bca7ba79bd726ba08ed5c749d9dadc79d029d07fb87515fbc68e0b4e16763d7", "task_path": "tasks/nmp3_77d3818d-fdea-5a0e-a9f1-aca489eaef57", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "77d3818d-fdea-5a0e-a9f1-aca489eaef57", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_780c73c8-5376-5b2a-a41d-933878d257cb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge2$ be an integer and let $x_1,x_2,\\dots,x_n$ be positive real numbers such that \n-- \\[\n-- \\sum_{i=1}^{n}x_i=1,\\qquad \\sum_{i=1}^{n}\\frac{x_i^{2}}{x_{i+1}}=2,\n-- \\] \n-- where the indices are taken cyclically ($x_{n+1}=x_1$). Prove that \n-- \\[\n-- \\sum_{i=1}^{n}\\sqrt{x_i^{2}+x_{i+1}^{2}}\\le\\frac53\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Cyclic inequality with positive real numbers\n\nThis file formalizes the statement of the problem. The original problem asks\nfor a proof of an inequality under a cyclic-sum hypothesis. It does not ask\nfor a proof of that inequality here: `Problem.Target` is the proposition to be\nproved.\n-/\n\nnamespace Problem\n\n/-- The cyclic successor of an index `i : Fin n`.\n\nFor `n > 0`, this sends the last index to `0` and every other index to its\nnumeric successor. The definition is total on `Fin n`; when `n = 0` there is\nno index to apply it to. -/\ndef cyclicSucc {n : ℕ} (i : Fin n) : Fin n :=\n if h : (i : ℕ) + 1 < n then\n ⟨(i : ℕ) + 1, h⟩\n else\n ⟨0, Nat.lt_of_le_of_lt (Nat.zero_le _) i.isLt⟩\n\n/-- The hypotheses of the problem for a natural number `n` and a family\n`x : Fin n → ℝ`.\n\nThe index `i : Fin n` corresponds to `x_{i+1}` in the problem's one-based\nnotation. The cyclic index `x_{i+1}` under zero-based indexing is represented\nby `x (cyclicSucc i)`. -/\ndef Hypotheses (n : ℕ) (x : Fin n → ℝ) : Prop :=\n 2 ≤ n ∧\n (∀ i : Fin n, 0 < x i) ∧\n (∑ i : Fin n, x i = (1 : ℝ)) ∧\n (∑ i : Fin n, ((x i) ^ 2) / (x (cyclicSucc i)) = (2 : ℝ))\n\n/-- The quantity to be bounded, namely\n`∑ i, sqrt (x_i^2 + x_{i+1}^2)`, is at most `5 / 3`. -/\ndef BoundConclusion (n : ℕ) (x : Fin n → ℝ) : Prop :=\n (∑ i : Fin n, Real.sqrt ((x i) ^ 2 + (x (cyclicSucc i)) ^ 2)) ≤\n ((5 : ℝ) / 3)\n\n/-- The complete formal statement of the problem: for every integer `n ≥ 2`\nand every family of positive real numbers satisfying the two given cyclic-sum\nconditions, the stated square-root sum is at most `5 / 3`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (x : Fin n → ℝ), Hypotheses n x → BoundConclusion n x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "780c73c8-5376-5b2a-a41d-933878d257cb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "624fc9beb7d59e85be2beefd713b855f371465be607596ff2d806b6f7d4bd045", "task_path": "tasks/nmp3_780c73c8-5376-5b2a-a41d-933878d257cb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "780c73c8-5376-5b2a-a41d-933878d257cb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_781aaf2b-5dac-5169-b55d-5b3dec2207f6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that\n-- \\[\n-- \\left(\\frac{2a+c}{2a+b+c}\\right)^3+\\left(\\frac{2b+a}{2b+c+a}\\right)^3+\\left(\\frac{2c+b}{2c+a+b}\\right)^3\\ge\\frac{81}{64}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the three-variable real inequality\n\nThe source asks to prove, for all positive real numbers `a`, `b`, and `c`, an\ninequality involving three rational functions raised to the third power.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in `problem.md`. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n ((2 * a + c) / (2 * a + b + c)) ^ 3 +\n ((2 * b + a) / (2 * b + c + a)) ^ 3 +\n ((2 * c + b) / (2 * c + a + b)) ^ 3\n\n/-- The assertion requested in `problem.md`: for every triple of positive real\nnumbers `a`, `b`, `c`, the sum of the three displayed cubes is at least\n`81 / 64`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n lhs a b c ≥ (81 / 64 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "781aaf2b-5dac-5169-b55d-5b3dec2207f6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "aa3f6aba2f6e618898fb0e57108f81f34fe26be89661702460efc3c970e988eb", "task_path": "tasks/nmp3_781aaf2b-5dac-5169-b55d-5b3dec2207f6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "781aaf2b-5dac-5169-b55d-5b3dec2207f6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_783cb783-cba3-5548-bd4b-010bab2bc7d1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose that $a,b,c$ are positive real numbers. Prove that\n-- \\[\n-- 1<\\frac{a}{\\sqrt{a^{2}+b^{2}}}+\\frac{b}{\\sqrt{b^{2}+c^{2}}}+\\frac{c}{\\sqrt{c^{2}+a^{2}}}\\le\\frac{3\\sqrt{2}}{2}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The cyclic sum\n`a / sqrt (a^2 + b^2) + b / sqrt (b^2 + c^2) + c / sqrt (c^2 + a^2)`.-/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n a / Real.sqrt (a ^ 2 + b ^ 2) +\n b / Real.sqrt (b ^ 2 + c ^ 2) +\n c / Real.sqrt (c ^ 2 + a ^ 2)\n\n/-- For all positive real numbers `a`, `b`, and `c`, the cyclic sum lies strictly\nabove `1` and at most `(3 * sqrt 2) / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n 1 < cyclicSum a b c ∧ cyclicSum a b c ≤ (3 * Real.sqrt 2) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "783cb783-cba3-5548-bd4b-010bab2bc7d1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2025cf24c373e4f87cc21f558cab8e23df30f74cab924051296d5def5bd5c735", "task_path": "tasks/nmp3_783cb783-cba3-5548-bd4b-010bab2bc7d1", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "783cb783-cba3-5548-bd4b-010bab2bc7d1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_784e8c28-c229-532a-9702-d3a7394f3c73", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive numbers such that $a^4+b^4+c^4=a+b+c$. Prove that \n-- \\[\n-- \\frac{a}{c^2(b^2+ca)}+\\frac{b}{a^2(c^2+ab)}+\\frac{c}{b^2(a^2+bc)}\\ge\\frac32.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of an inequality with a constraint\n\nThe source problem asks us to prove an inequality for positive real numbers\n`a`, `b`, and `c` satisfying `a^4 + b^4 + c^4 = a + b + c`.\n-/\n\nnamespace Problem\n\n/-- The admissibility predicate for the variables of the problem: all three\nreal numbers are positive and satisfy the stated fourth-power constraint. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 4 + b ^ 4 + c ^ 4 = a + b + c\n\n/-- The left-hand side of the required inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / ((c ^ 2) * ((b ^ 2) + c * a)) +\n b / ((a ^ 2) * ((c ^ 2) + a * b)) +\n c / ((b ^ 2) * ((a ^ 2) + b * c))\n\n/-- The assertion to be proved: for all positive real numbers `a`, `b`, `c`\nsatisfying `a^4 + b^4 + c^4 = a + b + c`, the displayed left-hand side is at\nleast `3 / 2`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "784e8c28-c229-532a-9702-d3a7394f3c73", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "518d854e6072905d6c07f71d5fbafae79a18270a40b0cc73e01b1118e1f9e816", "task_path": "tasks/nmp3_784e8c28-c229-532a-9702-d3a7394f3c73", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "784e8c28-c229-532a-9702-d3a7394f3c73", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_78521da0-4cf7-5ae1-8c86-bc51edb6b729", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^2+b^2+c^2+2abc=1$. Prove that \n-- \\[\n-- a^2+b^2+c^2 \\ge 4\\bigl(a^2b^2+b^2c^2+c^2a^2\\bigr).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypotheses of the problem: `a`, `b`, and `c` are positive real numbers\nand satisfy `a^2 + b^2 + c^2 + 2abc = 1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a ^ 2 + b ^ 2 + c ^ 2 + 2 * a * b * c = 1\n\n/-- The inequality asserted in the problem, for a fixed triple of real numbers. -/\ndef DesiredInequality (a b c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 ≥\n 4 * (a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2)\n\n/-- The complete universal statement to be proved: every positive real triple\nsatisfying the constraint satisfies the displayed inequality. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → DesiredInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "78521da0-4cf7-5ae1-8c86-bc51edb6b729", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9224b77766648344e0739de9e39b45641f88a17b85f82f285994f5ba31b54b6d", "task_path": "tasks/nmp3_78521da0-4cf7-5ae1-8c86-bc51edb6b729", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "78521da0-4cf7-5ae1-8c86-bc51edb6b729", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7854f8c5-9282-501d-93f1-31c424088a89", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with at most one of them equal to $0$ (i.e., no two of $a,b,c$ are zero). Prove that \n-- \\[\n-- \\frac{ab+ac-bc}{b^{2}+c^{2}}+\\frac{bc+ba-ca}{c^{2}+a^{2}}+\\frac{ca+cb-ab}{a^{2}+b^{2}}\\ge\\frac32.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three nonnegative real numbers `a`, `b`, `c` contain no pair of zeros.\nThis is the problem's clarification of \"at most one of them equal to `0`\". -/\ndef AtMostOneZero (a b c : ℝ) : Prop :=\n ¬ (a = 0 ∧ b = 0) ∧\n ¬ (a = 0 ∧ c = 0) ∧\n ¬ (b = 0 ∧ c = 0)\n\n/-- The admissibility hypotheses of the problem: `a`, `b`, and `c` are\nnonnegative and at most one of them is zero. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ AtMostOneZero a b c\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a * b + a * c - b * c) / (b ^ 2 + c ^ 2) +\n (b * c + b * a - c * a) / (c ^ 2 + a ^ 2) +\n (c * a + c * b - a * b) / (a ^ 2 + b ^ 2)\n\n/-- The proposition asserted by the problem: for all nonnegative real\n`a`, `b`, and `c`, if no two of them are zero, then the displayed sum is at\nleast `3 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n lhs a b c ≥ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7854f8c5-9282-501d-93f1-31c424088a89", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2dfbe721bfc8b30bf9b9bcf72d29bba42c8bdf66fe6675932bab57963279f873", "task_path": "tasks/nmp3_7854f8c5-9282-501d-93f1-31c424088a89", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7854f8c5-9282-501d-93f1-31c424088a89", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7864a255-4a02-57db-ac37-9c826aa08e73", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(a_n)_{n\\ge1}$ be a sequence of positive integers such that \n-- \n-- 1. for every $n\\in\\mathbb{Z}^+$, $n^2\\mid\\displaystyle\\sum_{i=1}^{n}a_i$, \n-- \n-- 2. for all $n\\ge2016$, $a_n\\le (n+2016)^2$. \n-- \n-- Define $b_n=a_{n+1}-a_n$. Prove that the sequence $(b_n)_{n\\ge1}$ is eventually constant; i.e. there exist integers $N$ and $B$ such that $b_n=B$ for all $n\\ge N$.\nimport Mathlib\n\n/-!\n# Formalization of the statement\n\nThe source problem concerns a sequence `a` of positive integers indexed by\npositive integers. We represent indices by natural numbers and impose the\nlower bound `1 ≤ n` wherever a positive index is required. The difference\n`b n = a (n+1) - a n` is integer-valued, since consecutive terms of `a` need\nnot be monotone.\n-/\n\nnamespace Problem\n\n/-- The partial sum `a_1 + ... + a_n`, with the empty/irrelevant value at `n = 0`\nincluded for all natural-number indices. -/\ndef partialSum (a : ℕ → ℕ) (n : ℕ) : ℕ :=\n (Finset.Icc 1 n).sum a\n\n/-- The terms of the sequence are positive integers at all positive indices. -/\ndef PositiveIntegerSequence (a : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, 1 ≤ n → 0 < a n\n\n/-- Condition 1: for every positive integer `n`, `n^2` divides the partial sum\n`a_1 + ... + a_n`. -/\ndef DivisibilityCondition (a : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, 1 ≤ n → n ^ 2 ∣ partialSum a n\n\n/-- Condition 2: for every integer `n ≥ 2016`, `a_n ≤ (n + 2016)^2`. -/\ndef GrowthCondition (a : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, 2016 ≤ n → a n ≤ (n + 2016) ^ 2\n\n/-- The integer-valued forward difference `b_n = a_{n+1} - a_n`. -/\ndef b (a : ℕ → ℕ) (n : ℕ) : ℤ :=\n (a (n + 1) : ℤ) - (a n : ℤ)\n\n/-- The conclusion: the sequence of differences is eventually constant, with\ninteger eventual index `N` and integer constant value `B`. The condition\n`1 ≤ n` records that `b_n` is only part of the original sequence for positive\nindices. -/\ndef EventuallyConstantDifferences (a : ℕ → ℕ) : Prop :=\n ∃ N : ℤ, ∃ B : ℤ,\n ∀ n : ℕ, 1 ≤ n → N ≤ (n : ℤ) → b a n = B\n\n/-- The assertion to be proved: every sequence of positive integers satisfying\nthe divisibility and growth conditions has eventually constant consecutive\ndifferences. -/\ndef Target : Prop :=\n ∀ a : ℕ → ℕ,\n PositiveIntegerSequence a →\n DivisibilityCondition a →\n GrowthCondition a →\n EventuallyConstantDifferences a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7864a255-4a02-57db-ac37-9c826aa08e73", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "996090880ef574657b86400d56a8996e7a4b4d8470bf375d36c5c05a5c9b4bb6", "task_path": "tasks/nmp3_7864a255-4a02-57db-ac37-9c826aa08e73", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7864a255-4a02-57db-ac37-9c826aa08e73", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_78775e07-fa71-50eb-825b-4e4a5dbcaf07", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- \\frac{a^{3}}{(a+b)^{3}}+\\frac{b^{3}}{(b+c)^{3}}+\\frac{c^{3}}{(c+a)^{3}}\\ge\\frac{3}{8}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a cyclic inequality\n\nThe source problem asks to prove a lower bound for a cyclic sum of three\nnonnegative terms under the assumption that the three real parameters are\npositive.\n-/\n\nnamespace Problem\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the cyclic sum\n`a^3 / (a + b)^3 + b^3 / (b + c)^3 + c^3 / (c + a)^3`\nis at least `3 / 8`.\n\nThis declaration records the proposition to be proved; it is not a proof of it.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n a ^ 3 / (a + b) ^ 3 + b ^ 3 / (b + c) ^ 3 + c ^ 3 / (c + a) ^ 3 ≥\n (3 : ℝ) / 8\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "78775e07-fa71-50eb-825b-4e4a5dbcaf07", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "005b349002f6f52a162e0ad7b4817b4bb2db5e5f784dc75436d42dc44e1d66e1", "task_path": "tasks/nmp3_78775e07-fa71-50eb-825b-4e4a5dbcaf07", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "78775e07-fa71-50eb-825b-4e4a5dbcaf07", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_78e08777-b8bf-5d73-8494-719fc8e269b7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ be real numbers with $ab+bc+ca>0$. Prove that \n-- \\[\n-- \\frac{a^{2}+bc}{b^{2}+c^{2}}+\\frac{b^{2}+ca}{c^{2}+a^{2}}+\\frac{c^{2}+ab}{a^{2}+b^{2}}+\\frac{a^{2}+b^{2}+c^{2}}{2(ab+bc+ca)}\\ge\\frac72\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion from the problem: for every triple of nonnegative real numbers\n`a`, `b`, `c` whose pairwise-sum term `ab + bc + ca` is positive, the displayed\nsum is at least `7 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n 0 < a * b + b * c + c * a →\n (a ^ 2 + b * c) / (b ^ 2 + c ^ 2) +\n (b ^ 2 + c * a) / (c ^ 2 + a ^ 2) +\n (c ^ 2 + a * b) / (a ^ 2 + b ^ 2) +\n (a ^ 2 + b ^ 2 + c ^ 2) / (2 * (a * b + b * c + c * a))\n ≥ (7 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "78e08777-b8bf-5d73-8494-719fc8e269b7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7625a832359090e7a073ad4c892bc801f7019cb821a52439db73b781c4fa6a22", "task_path": "tasks/nmp3_78e08777-b8bf-5d73-8494-719fc8e269b7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "78e08777-b8bf-5d73-8494-719fc8e269b7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7925cf02-4cb3-562d-8207-a75a25c33a1c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a\\ge b\\ge c>0$ and $a^2+b^2+c^2+abc=4$, prove that \n-- $$a+b+c+\\frac{b(a^2-c^2)}{2ac}\\ge 3.$$\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the inequality problem\n\nThe problem asks to prove, for real numbers `a`, `b`, and `c` satisfying\n`a ≥ b ≥ c > 0` and `a^2 + b^2 + c^2 + a*b*c = 4`, the inequality\n`a + b + c + b*(a^2 - c^2)/(2*a*c) ≥ 3`.\n-/\n\nnamespace Problem\n\n/-- The admissible triples from the problem: real `a b c` with\n`a ≥ b ≥ c > 0` satisfying `a^2 + b^2 + c^2 + a*b*c = 4`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n a ≥ b ∧ b ≥ c ∧ c > 0 ∧ a ^ 2 + b ^ 2 + c ^ 2 + a * b * c = 4\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def Lhs (a b c : ℝ) : ℝ :=\n a + b + c + b * (a ^ 2 - c ^ 2) / (2 * a * c)\n\n/-- The inequality asserted as the conclusion of the problem. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n Lhs a b c ≥ 3\n\n/-- The exact universally quantified statement to be proved. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7925cf02-4cb3-562d-8207-a75a25c33a1c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "09b54c9fac13da74efbb1f2a578c61af482c466424371fae38dd5b3033b32a16", "task_path": "tasks/nmp3_7925cf02-4cb3-562d-8207-a75a25c33a1c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7925cf02-4cb3-562d-8207-a75a25c33a1c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7949ea14-caa7-5481-83d9-2322b3e2e6e8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c>0$, prove that \n-- \\[\n-- \\bigl(a^2+2b^2+3c^2\\bigr)\\bigl(b^2+2c^2+3a^2\\bigr)\\bigl(c^2+2a^2+3b^2\\bigr)\\ge\\frac{8}{9}\\,(ab+bc+ca)\\,(a+b+c)^4\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThis file records the assertion from the problem statement as a proposition-valued\ndefinition. It deliberately contains no proof of the assertion.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the asserted inequality. -/\ndef LHS (a b c : ℝ) : ℝ :=\n (a ^ 2 + 2 * b ^ 2 + 3 * c ^ 2) *\n (b ^ 2 + 2 * c ^ 2 + 3 * a ^ 2) *\n (c ^ 2 + 2 * a ^ 2 + 3 * b ^ 2)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n (8 / 9 : ℝ) * (a * b + b * c + c * a) * (a + b + c) ^ 4\n\n/-- The full assertion: for all positive real numbers `a`, `b`, and `c`, the\nproduct on the left is at least the stated expression on the right. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → LHS a b c ≥ RHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7949ea14-caa7-5481-83d9-2322b3e2e6e8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ccc1cbb3d9924b08266abcb0255f3ad100b0e7d8a279810ae210a51121b23d58", "task_path": "tasks/nmp3_7949ea14-caa7-5481-83d9-2322b3e2e6e8", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7949ea14-caa7-5481-83d9-2322b3e2e6e8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_795d8c34-21bc-5c6b-8c4a-c156a38170b9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute triangle with circumcircle $\\omega$. Let $D$ be the foot of the altitude from $A$ to $BC$, and let $L$ be the foot of the internal angle bisector of $\\angle BAC$ on $BC$. Let $W$ be the second intersection of line $AL$ with $\\omega$ (other than $A$). Let $T$ be the second intersection of line $WD$ with $\\omega$ (other than $W$). Let $S$ be the second intersection of line $TL$ with $\\omega$ (other than $T$). Prove that $AS$ is a diameter of $\\omega$ (i.e. $S$ is the antipodal point of $A$ on $\\omega$).\nimport Mathlib.Geometry.Euclidean.Circumcenter\nimport Mathlib.Geometry.Euclidean.Sphere.SecondInter\nimport Mathlib.Geometry.Euclidean.Triangle\n\n/-!\n# Formal statement of the geometry problem\n\nWe work in the Euclidean plane `EuclideanSpace ℝ (Fin 2)`. The source problem is a\npure universal geometric assertion: for every acute triangle and every configuration of\nthe points named in the statement, the final chord is a diameter of the circumcircle.\n\nThe formalization below spells out all named points and the circumcircle as explicit\nvariables. The auxiliary predicates state the defining incidences, equalities, and\nuniqueness properties from the problem text. No existence or construction is assumed\nbeyond those stated hypotheses; in particular, `IsSecondIntersectionOnCircle` states\nthat the chosen point is the unique other intersection of the line and the circle.\n-/\n\nnoncomputable section\n\nopen scoped EuclideanGeometry RealInnerProductSpace\n\nnamespace Problem\n\n/-- The ambient Euclidean plane. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The three points `A`, `B`, `C` form a non-degenerate triangle. -/\ndef IsTriangle (A B C : Point) : Prop :=\n AffineIndependent ℝ ![A, B, C]\n\n/-- The triangle `ABC` is acute: it is non-degenerate and its three internal angles are\nstrictly less than `π / 2`. -/\ndef AcuteTriangle (A B C : Point) : Prop :=\n Problem.IsTriangle A B C ∧\n EuclideanGeometry.angle B A C < Real.pi / 2 ∧\n EuclideanGeometry.angle A B C < Real.pi / 2 ∧\n EuclideanGeometry.angle B C A < Real.pi / 2\n\n/-- `ω` is the circumcircle of the non-degenerate triangle `ABC`: it is the unique circle\n(or, in the ambient inner-product space, sphere) passing through all three vertices. -/\ndef IsCircumcircle (A B C : Point) (ω : EuclideanGeometry.Sphere Point) : Prop :=\n A ∈ ω ∧ B ∈ ω ∧ C ∈ ω ∧\n ∀ ω' : EuclideanGeometry.Sphere Point,\n A ∈ ω' → B ∈ ω' → C ∈ ω' → ω' = ω\n\n/-- `D` is the foot of the altitude from `A` to the line `BC`: it lies on `BC` and the\nvector `AD` is perpendicular to the direction vector `CB`. -/\ndef IsAltitudeFoot (A B C D : Point) : Prop :=\n D ∈ affineSpan ℝ ({B, C} : Set Point) ∧\n ⟪A -ᵥ D, C -ᵥ B⟫ = 0\n\n/-- `L` is the foot on the side `BC` of the internal angle bisector from `A`: it lies\nstrictly between `B` and `C`, and the two adjacent angles at `A` are equal. -/\ndef IsInternalAngleBisectorFoot (A B C L : Point) : Prop :=\n Sbtw ℝ B L C ∧\n EuclideanGeometry.angle B A L = EuclideanGeometry.angle L A C\n\n/-- `Y` is the second intersection of the line through `P` and `X` with the circle `ω`,\nother than `P`. The line is the affine span of `P` and `X`; the last conjunct is the\nuniqueness of the second intersection, so no third common point exists. -/\ndef IsSecondIntersectionOnCircle (ω : EuclideanGeometry.Sphere Point)\n (P X Y : Point) : Prop :=\n P ∈ ω ∧ Y ∈ ω ∧ Y ∈ affineSpan ℝ ({P, X} : Set Point) ∧ Y ≠ P ∧\n ∀ Z : Point,\n Z ∈ ω → Z ∈ affineSpan ℝ ({P, X} : Set Point) → Z = P ∨ Z = Y\n\n/-- The assertion of the problem. Quantifiers are in the order in which the objects are\nintroduced in the source: the triangle `ABC`, its circumcircle `ω`, and then `D`, `L`, `W`,\n`T`, and `S`. The hypotheses impose the stated construction, and the conclusion is that\n`AS` is a diameter of `ω`. -/\ndef Target : Prop :=\n ∀ (A B C : Point) (ω : EuclideanGeometry.Sphere Point) (D L W T S : Point),\n Problem.AcuteTriangle A B C →\n Problem.IsCircumcircle A B C ω →\n Problem.IsAltitudeFoot A B C D →\n Problem.IsInternalAngleBisectorFoot A B C L →\n Problem.IsSecondIntersectionOnCircle ω A L W →\n Problem.IsSecondIntersectionOnCircle ω W D T →\n Problem.IsSecondIntersectionOnCircle ω T L S →\n EuclideanGeometry.Sphere.IsDiameter ω A S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "795d8c34-21bc-5c6b-8c4a-c156a38170b9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8ae80d7be23d4cef739593427bfbab11f2e9937538a7db0ddf6648e1f8c5fb34", "task_path": "tasks/nmp3_795d8c34-21bc-5c6b-8c4a-c156a38170b9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "795d8c34-21bc-5c6b-8c4a-c156a38170b9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_796d6ee3-5d56-5522-a10e-0e4866c7a1ae", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In a triangle $A_1A_2A_3$, the excircles opposite $A_1$, $A_2$, $A_3$ touch the sides $A_2A_3$, $A_3A_1$, $A_1A_2$ at $T_1$, $T_2$, $T_3$, respectively. Let $H_1$, $H_2$, $H_3$ be the orthocenters of triangles $A_1T_2T_3$, $A_2T_3T_1$, $A_3T_1T_2$, respectively. Prove that the lines $H_1T_1$, $H_2T_2$, $H_3T_3$ are concurrent.\nimport Mathlib\n\n/-!\n# Formalization of a synthetic geometry concurrency problem\n\nThe problem concerns a nondegenerate triangle `A₁A₂A₃`.\nThe points `T₁`, `T₂`, and `T₃` are the touchpoints of the excircles\nopposite `A₁`, `A₂`, and `A₃` with the corresponding opposite sides.\nFor each `i`, `Hᵢ` is the orthocenter of the triangle formed by `Aᵢ`\nand the two excontact points on the adjacent sides. The conclusion is\nthat the three lines `HᵢTᵢ` are concurrent.\n\nAll geometry is carried out in the real Euclidean plane.\n-/\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace Affine\n\nnamespace Problem\n\n/-- The real Euclidean plane. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The Euclidean distance between two points. -/\ndef dist (P Q : Plane) : ℝ := ‖Q - P‖\n\n/-- Side length `a = |BC|`, opposite the first named vertex `A`. -/\ndef sideA (_A B C : Plane) : ℝ := dist B C\n\n/-- Side length `b = |CA|`, opposite the second named vertex `B`. -/\ndef sideB (A _B C : Plane) : ℝ := dist C A\n\n/-- Side length `c = |AB|`, opposite the third named vertex `C`. -/\ndef sideC (A B _C : Plane) : ℝ := dist A B\n\n/--\nThe excenter opposite `A` of the triangle with vertices `A`, `B`, `C`.\nIn barycentric coordinates (relative to `A,B,C`) it is `(-a : b : c)`,\nwhere `a = |BC|`, `b = |CA|`, and `c = |AB|`.\n-/\ndef excenterA (A B C : Plane) : Plane :=\n let a := sideA A B C\n let b := sideB A B C\n let c := sideC A B C\n (1 / (-a + b + c)) • ((-a) • A + b • B + c • C)\n\n/--\nThe excenter opposite `B` of the triangle with vertices `A`, `B`, `C`.\nIn barycentric coordinates it is `(a : -b : c)`.\n-/\ndef excenterB (A B C : Plane) : Plane :=\n let a := sideA A B C\n let b := sideB A B C\n let c := sideC A B C\n (1 / (a - b + c)) • (a • A + (-b) • B + c • C)\n\n/--\nThe excenter opposite `C` of the triangle with vertices `A`, `B`, `C`.\nIn barycentric coordinates it is `(a : b : -c)`.\n-/\ndef excenterC (A B C : Plane) : Plane :=\n let a := sideA A B C\n let b := sideB A B C\n let c := sideC A B C\n (1 / (a + b - c)) • (a • A + b • B + (-c) • C)\n\n/--\nThe orthogonal projection of the `A`-excenter onto the line `BC`.\nFor a nondegenerate triangle this is precisely the touchpoint of the\n`A`-excircle with side `BC`.\n-/\ndef excontactA (A B C : Plane) : Plane :=\n let I := excenterA A B C\n let v := C - B\n B + (inner ℝ (I - B) v / inner ℝ v v) • v\n\n/--\nThe orthogonal projection of the `B`-excenter onto the line `CA`.\nFor a nondegenerate triangle this is precisely the touchpoint of the\n`B`-excircle with side `CA`.\n-/\ndef excontactB (A B C : Plane) : Plane :=\n let I := excenterB A B C\n let v := A - C\n C + (inner ℝ (I - C) v / inner ℝ v v) • v\n\n/--\nThe orthogonal projection of the `C`-excenter onto the line `AB`.\nFor a nondegenerate triangle this is precisely the touchpoint of the\n`C`-excircle with side `AB`.\n-/\ndef excontactC (A B C : Plane) : Plane :=\n let I := excenterC A B C\n let v := B - A\n A + (inner ℝ (I - A) v / inner ℝ v v) • v\n\n/-- `T` is the touchpoint of the excircle opposite `A` of triangle `ABC`. -/\ndef IsExcontactA (A B C T : Plane) : Prop :=\n T = excontactA A B C\n\n/-- `T` is the touchpoint of the excircle opposite `B` of triangle `ABC`. -/\ndef IsExcontactB (A B C T : Plane) : Prop :=\n T = excontactB A B C\n\n/-- `T` is the touchpoint of the excircle opposite `C` of triangle `ABC`. -/\ndef IsExcontactC (A B C T : Plane) : Prop :=\n T = excontactC A B C\n\n/--\n`H` is an orthocenter of the triangle with vertices `X`, `Y`, `Z`.\nEquivalently, the three altitude conditions hold: `HX ⟂ YZ`,\n`HY ⟂ XZ`, and `HZ ⟂ XY`. For noncollinear `X,Y,Z` these conditions\ndetermine a unique point, the usual orthocenter.\n-/\ndef IsOrthocenter (X Y Z H : Plane) : Prop :=\n inner ℝ (H - X) (Y - Z) = 0 ∧\n inner ℝ (H - Y) (X - Z) = 0 ∧\n inner ℝ (H - Z) (X - Y) = 0\n\n/-- `P` lies on the affine line through `X` and `Y`. -/\ndef OnLine (P X Y : Plane) : Prop :=\n P ∈ line[ℝ, X, Y]\n\n/-- The three affine lines `X₁Y₁`, `X₂Y₂`, and `X₃Y₃` are concurrent. -/\ndef Concurrent (X₁ Y₁ X₂ Y₂ X₃ Y₃ : Plane) : Prop :=\n ∃ P : Plane, OnLine P X₁ Y₁ ∧ OnLine P X₂ Y₂ ∧ OnLine P X₃ Y₃\n\n/--\nThe full assertion of the problem: for every nondegenerate triangle\n`A₁A₂A₃`, if `H₁`, `H₂`, and `H₃` are the orthocenters of\n`A₁T₂T₃`, `A₂T₃T₁`, and `A₃T₁T₂`, where `T₁`, `T₂`, and `T₃` are\nthe excircle touchpoints constructed above, then `H₁T₁`, `H₂T₂`, and\n`H₃T₃` are concurrent.\n-/\ndef Target : Prop :=\n ∀ A₁ A₂ A₃ T₁ T₂ T₃ H₁ H₂ H₃ : Plane,\n ¬ Collinear ℝ ({A₁, A₂, A₃} : Set Plane) →\n IsExcontactA A₁ A₂ A₃ T₁ →\n IsExcontactB A₁ A₂ A₃ T₂ →\n IsExcontactC A₁ A₂ A₃ T₃ →\n IsOrthocenter A₁ T₂ T₃ H₁ →\n IsOrthocenter A₂ T₃ T₁ H₂ →\n IsOrthocenter A₃ T₁ T₂ H₃ →\n Concurrent H₁ T₁ H₂ T₂ H₃ T₃\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "796d6ee3-5d56-5522-a10e-0e4866c7a1ae", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ac7766d4c89427a0eb40bf346f55f23bb7290711d275d95c355211f0852f7a9d", "task_path": "tasks/nmp3_796d6ee3-5d56-5522-a10e-0e4866c7a1ae", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "796d6ee3-5d56-5522-a10e-0e4866c7a1ae", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7977fe28-ce81-5d78-90ef-5c2d33088cfc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\Bigl(1+ \\frac{2a^2}{(b+c)^2}\\Bigr)\\Bigl( 1+\\frac{2b^2}{(c+a)^2}\\Bigr)\\Bigl(1+ \\frac{2c^2}{(a+b)^2}\\Bigr)\\ge \\frac{3}{2}\\left(\\frac{2a^2+2b^2+2c^2+ab+bc+ca}{a^2+b^2+c^2+ab+bc+ca}\\right)^2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe original problem asks us to prove, for positive real numbers `a`, `b`, and `c`,\nthe inequality\n\n\\[\n\\left(1+\\frac{2a^2}{(b+c)^2}\\right)\n\\left(1+\\frac{2b^2}{(c+a)^2}\\right)\n\\left(1+\\frac{2c^2}{(a+b)^2}\\right)\n\\ge\n\\frac32\n\\left(\\frac{2a^2+2b^2+2c^2+ab+bc+ca}\n{a^2+b^2+c^2+ab+bc+ca}\\right)^2 .\n\\]\n\nThe declaration below records only the proposition to be proved. It does not\ncontain a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (1 + 2 * a ^ 2 / (b + c) ^ 2) *\n (1 + 2 * b ^ 2 / (c + a) ^ 2) *\n (1 + 2 * c ^ 2 / (a + b) ^ 2)\n\n/-- The right-hand side of the inequality, including the factor `3 / 2`. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (3 / 2 : ℝ) *\n ((2 * a ^ 2 + 2 * b ^ 2 + 2 * c ^ 2 + a * b + b * c + c * a) /\n (a ^ 2 + b ^ 2 + c ^ 2 + a * b + b * c + c * a)) ^ 2\n\n/--\nFor all positive real `a`, `b`, and `c`, the product on the left is at least\nthe stated rational expression on the right.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7977fe28-ce81-5d78-90ef-5c2d33088cfc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "86df8c2ca22f9a06bfc432586ee381b426fc8c8892a4445c0dea3717ecbbe8d7", "task_path": "tasks/nmp3_7977fe28-ce81-5d78-90ef-5c2d33088cfc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7977fe28-ce81-5d78-90ef-5c2d33088cfc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_798c4065-c949-570e-a437-687bed21afec", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be any positive integer, and let $S(n)$ denote the number of permutations $\\tau$ of $\\{1,2,\\dots,n\\}$ such that $k^4+(\\tau(k))^4$ is prime for every $k=1,\\dots,n$. Prove that $S(n)$ is always a perfect square.\nimport Mathlib\n\n/-!\n# Formalization of the problem\n\nThe problem asks us to prove that, for every positive integer `n`, the number\n`S(n)` of permutations `τ` of `{1, ..., n}` such that\n`k^4 + (τ(k))^4` is prime for all `k = 1, ..., n` is a perfect square.\n\nWe represent `{1, ..., n}` by `Fin n` via the order isomorphism\n`i ↦ i.val + 1`. Thus a permutation of `{1, ..., n}` is represented by an\nelement of `Equiv.Perm (Fin n)`, and the number `k` (respectively `τ(k)`) is\nrepresented by `k.val + 1` (respectively `(τ k).val + 1`).\n-/\n\nnamespace Problem\n\n/-- `permutationAdmissible n τ` says that `τ` is a permutation of\n`{1, ..., n}` for which `k ^ 4 + (τ k)^4` is prime at every index `k`. -/\ndef permutationAdmissible (n : ℕ) (τ : Equiv.Perm (Fin n)) : Prop :=\n ∀ k : Fin n,\n Nat.Prime (((k : ℕ) + 1) ^ 4 + (((τ k : Fin n) : ℕ) + 1) ^ 4)\n\n/-- `S n` is the number of admissible permutations of `{1, ..., n}`. -/\nnoncomputable def S (n : ℕ) : ℕ := by\n classical\n exact Fintype.card {τ : Equiv.Perm (Fin n) // permutationAdmissible n τ}\n\n/-- A natural number is a perfect square when it is the square of a natural\nnumber. In particular, `0` is a perfect square. -/\ndef IsPerfectSquare (m : ℕ) : Prop :=\n ∃ r : ℕ, m = r ^ 2\n\n/-- The assertion of the problem: for every positive integer `n`, `S n` is a\nperfect square. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → IsPerfectSquare (S n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "798c4065-c949-570e-a437-687bed21afec", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6c9031177a663d5e7efc249251b82b93769f0e3e13909bb4f903f325e599321e", "task_path": "tasks/nmp3_798c4065-c949-570e-a437-687bed21afec", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "798c4065-c949-570e-a437-687bed21afec", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_79a4fd5d-cd76-58ee-b69a-5d53f4706feb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a+b}{b+c}+\\frac{b+c}{c+a}+\\frac{c+a}{a+b}+\\frac{3(ab+bc+ca)}{(a+b+c)^2}\\ge 4\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The inequality stated in the problem, for all positive real numbers `a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n (a + b) / (b + c) + (b + c) / (c + a) + (c + a) / (a + b)\n + 3 * (a * b + b * c + c * a) / (a + b + c) ^ 2 ≥ 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "79a4fd5d-cd76-58ee-b69a-5d53f4706feb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fb0b72db650043d956990ef239928d10ba4294811c921fce306650b22aaaed61", "task_path": "tasks/nmp3_79a4fd5d-cd76-58ee-b69a-5d53f4706feb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "79a4fd5d-cd76-58ee-b69a-5d53f4706feb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_79ac23d3-9867-5309-ad15-fcf70ee18785", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $B$ be a set of more than $\\displaystyle\\frac{2^{\\,n+1}}{n}$ distinct points whose coordinates are of the form $(\\pm1,\\pm1,\\dots,\\pm1)$ in $n$‑dimensional space, where $n\\ge3$. Prove that $B$ contains three distinct points that are the vertices of an equilateral triangle.\nimport Mathlib\n\n/-!\n# Formalization of the hypercube equilateral triangle problem\n\nThe ambient space is the real Euclidean space with coordinates indexed by `Fin n`.\nThe hypercube vertices are exactly the points all of whose coordinates are `1` or `-1`.\n-/\n\nnamespace Problem\n\n/-- A point of `EuclideanSpace ℝ (Fin n)` is a vertex of the `n`-dimensional\n`{±1}` hypercube when every one of its coordinates is either `1` or `-1`. -/\ndef CubeVertex (n : ℕ) (x : EuclideanSpace ℝ (Fin n)) : Prop :=\n ∀ i : Fin n, x i = (1 : ℝ) ∨ x i = (-1 : ℝ)\n\n/-- Three points are the vertices of an equilateral triangle when they are\npairwise distinct, non-collinear, and all three pairwise Euclidean distances\nare equal. -/\ndef IsEquilateralTriangle (n : ℕ)\n (x y z : EuclideanSpace ℝ (Fin n)) : Prop :=\n x ≠ y ∧ y ≠ z ∧ z ≠ x ∧\n ¬ Collinear ℝ ({x, y, z} : Set (EuclideanSpace ℝ (Fin n))) ∧\n dist x y = dist y z ∧ dist y z = dist z x ∧ dist z x = dist x y\n\n/-- For every integer `n ≥ 3` and every finite set `B` of more than\n`2^(n+1)/n` distinct `{±1}` vertices of `n`-dimensional Euclidean space,\nthere exist three distinct points of `B` that are the vertices of an\nequilateral triangle. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 3 ≤ n →\n ∀ B : Finset (EuclideanSpace ℝ (Fin n)),\n (∀ x : EuclideanSpace ℝ (Fin n), x ∈ B → CubeVertex n x) →\n (B.card : ℝ) > (2 : ℝ) ^ (n + 1) / (n : ℝ) →\n ∃ x : EuclideanSpace ℝ (Fin n), x ∈ B ∧\n ∃ y : EuclideanSpace ℝ (Fin n), y ∈ B ∧\n ∃ z : EuclideanSpace ℝ (Fin n), z ∈ B ∧\n IsEquilateralTriangle n x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "79ac23d3-9867-5309-ad15-fcf70ee18785", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1b0e2d416cf522f3ade6d3528fdeb71de3937230a31eef6a88dee1f114d9c6ef", "task_path": "tasks/nmp3_79ac23d3-9867-5309-ad15-fcf70ee18785", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "79ac23d3-9867-5309-ad15-fcf70ee18785", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_79c09564-3fef-5b6f-92df-d7278bd0d482", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\triangle AEC$ be an acute, non‑isosceles triangle. Let $O$ be the circumcenter of $\\triangle AEC$. Let $B$, $D$, $F$ be the reflections of $O$ in the sides $AC$, $CE$, and $EA$, respectively (so $AC$, $CE$, $EA$ are the perpendicular bisectors of $OB$, $OD$, $OF$). Let $A'$, $C'$, $E'$ be the feet of the perpendiculars from $A$, $C$, $E$ onto the opposite sides $CE$, $EA$, $AC$ (the orthic triangle of $AEC$). Define \n-- \n-- \\[\n-- M = BD\\cap A'E',\\qquad \n-- N = DF\\cap A'C',\\qquad \n-- P = BF\\cap E'C'.\n-- \\]\n-- \n-- Prove that the points $M$, $N$, $P$ are collinear.\nimport Mathlib\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\n\n/-!\n# Formal statement for the collinearity of three constructed intersections\n\nThe ambient object is the Euclidean plane over the reals. All incidence,\nperpendicularity, reflection, and circumcenter conditions are stated explicitly;\nthe main declaration `Problem.Target` is only the proposition to be proved.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real inner-product space of dimension two. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `Q` lies on the affine line through `X` and `Y` (the line is degenerate when `X = Y`). -/\ndef OnLine (Q X Y : Plane) : Prop :=\n Q ∈ affineSpan ℝ ({X, Y} : Set Plane)\n\n/-- Three points of the plane are collinear. -/\ndef AreCollinear (X Y Z : Plane) : Prop :=\n Collinear ℝ ({X, Y, Z} : Set Plane)\n\n/-- The three vertices `A`, `C`, `E` are not collinear, so they form a genuine triangle. -/\ndef IsNondegenerateTriangle (A C E : Plane) : Prop :=\n ¬ Collinear ℝ ({A, C, E} : Set Plane)\n\n/-- All three interior angles of the triangle `A C E` are strictly acute. -/\ndef IsAcuteTriangle (A C E : Plane) : Prop :=\n IsNondegenerateTriangle A C E ∧\n (∠ A C E < Real.pi / 2 ∧\n (∠ C E A < Real.pi / 2 ∧ ∠ E A C < Real.pi / 2))\n\n/-- The triangle has no pair of equal side lengths, i.e. it is scalene. -/\ndef IsScaleneTriangle (A C E : Plane) : Prop :=\n dist A C ≠ dist C E ∧\n dist C E ≠ dist E A ∧\n dist E A ≠ dist A C\n\n/-- `O` is equidistant from `A`, `C`, and `E`, hence is the circumcenter of the\nnondegenerate triangle `A C E`. -/\ndef IsCircumcenter (O A C E : Plane) : Prop :=\n dist O A = dist O C ∧ dist O C = dist O E\n\n/-- The affine line through `U` and `V` is the perpendicular bisector of the segment\njoining `O` to `X`. Equivalently, `X` is the reflection of `O` in the line `U V`. -/\ndef IsReflectionInLine (X O U V : Plane) : Prop :=\n OnLine (midpoint ℝ O X) U V ∧\n inner ℝ (X -ᵥ O) (V -ᵥ U) = 0\n\n/-- `X` is the foot of the perpendicular from `P` to the affine line through `U`\nand `V`. -/\ndef IsFoot (X P U V : Plane) : Prop :=\n OnLine X U V ∧\n inner ℝ (P -ᵥ X) (V -ᵥ U) = 0\n\n/-- `A'`, `C'`, and `E'` are respectively the feet from `A` to `C E`, from `C` to\n`E A`, and from `E` to `A C`; this is the orthic triangle of `A C E`. -/\ndef IsOrthicTriangle (A' C' E' A C E : Plane) : Prop :=\n IsFoot A' A C E ∧\n (IsFoot C' C E A ∧ IsFoot E' E A C)\n\n/-- The two affine lines through `X,Y` and through `U,V` meet in the unique point `M`. -/\ndef IsUniqueLineIntersection (M X Y U V : Plane) : Prop :=\n OnLine M X Y ∧\n OnLine M U V ∧\n ∀ (Q : Plane), OnLine Q X Y → OnLine Q U V → Q = M\n\n/-- The mathematical assertion of the problem: for every acute scalene triangle, every\nchoice of its circumcenter, the three side-reflections of the circumcenter, and the orthic\ntriangle, the three pairwise line intersections are collinear. The unique-intersection\nhypotheses make explicit the unique meeting of each named pair of lines that is implicit in\nthe notation `M = BD ∩ A'E'`, `N = DF ∩ A'C'`, and `P = BF ∩ E'C'`. -/\ndef Target : Prop :=\n ∀ (A C E : Plane),\n IsAcuteTriangle A C E →\n IsScaleneTriangle A C E →\n ∀ (O : Plane),\n IsCircumcenter O A C E →\n ∀ (B D F : Plane),\n IsReflectionInLine B O A C →\n IsReflectionInLine D O C E →\n IsReflectionInLine F O E A →\n ∀ (A' C' E' : Plane),\n IsOrthicTriangle A' C' E' A C E →\n ∀ (M N P : Plane),\n IsUniqueLineIntersection M B D A' E' →\n IsUniqueLineIntersection N D F A' C' →\n IsUniqueLineIntersection P B F E' C' →\n AreCollinear M N P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "79c09564-3fef-5b6f-92df-d7278bd0d482", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d02157666f231b30e820491611f7bb954906571a3094a3c961c32dfa39da891b", "task_path": "tasks/nmp3_79c09564-3fef-5b6f-92df-d7278bd0d482", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "79c09564-3fef-5b6f-92df-d7278bd0d482", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_79db2d03-8d0a-5749-87a6-9e1201df9da6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 3$ be an integer and let $x_1,x_2,\\dots ,x_n$ be positive real numbers satisfying \n-- \\[\n-- x_1+x_2+\\cdots +x_n=n .\n-- \\] \n-- Prove that \n-- \\[\n-- \\Bigl(\\prod_{i=1}^{n}x_i\\Bigr)\\Bigl(\\frac{x_2}{x_1}+\\frac{x_3}{x_2}+\\cdots +\\frac{x_1}{x_n}\\Bigr)\\le \\max\\{n,4\\},\n-- \\] \n-- where the indices are taken cyclically (i.e. $x_{n+1}=x_1$).\nimport Mathlib\n\n/-!\n# Formal statement of a cyclic product-sum inequality\n\nThe source problem asks to prove, for every integer `n ≥ 3` and every\npositive real sequence `x₁, …, xₙ` with total sum `n`, the inequality\n\n`(∏ i, xᵢ) * (∑ i, x_{i+1}/xᵢ) ≤ max n 4`,\n\nwhere indices are read cyclically. This file only states the assertion; it\ndoes not prove it.\n-/\n\nnamespace Problem\n\nopen scoped BigOperators\n\nnoncomputable section\n\n/--\nThe cyclic successor of an index `i : Fin n`, corresponding to `i + 1` for\n`i < n - 1` and to `0` for the last index. Thus `x (CyclicSucc i)` is\n`x_{i+1}` in the source notation, with `x_{n+1} = x_1`.\n-/\ndef CyclicSucc {n : ℕ} (i : Fin n) : Fin n :=\n if h : i.val + 1 < n then\n ⟨i.val + 1, h⟩\n else\n ⟨0, Nat.lt_of_le_of_lt (Nat.zero_le i.val) i.isLt⟩\n\n/-- The cyclic ratio sum `x₂/x₁ + x₃/x₂ + ⋯ + x₁/xₙ`. -/\ndef CyclicRatioSum (n : ℕ) (x : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, x (CyclicSucc i) / x i\n\n/-- The product `x₁ x₂ ⋯ xₙ`. -/\ndef Product (n : ℕ) (x : Fin n → ℝ) : ℝ :=\n ∏ i : Fin n, x i\n\n/-- The two assumptions on the sequence `x`: positivity and total sum `n`. -/\ndef Admissible (n : ℕ) (x : Fin n → ℝ) : Prop :=\n (∀ i : Fin n, 0 < x i) ∧\n (∑ i : Fin n, x i) = (n : ℝ)\n\n/-- The asserted inequality for a fixed `n` and sequence `x`. -/\ndef Inequality (n : ℕ) (x : Fin n → ℝ) : Prop :=\n Product n x * CyclicRatioSum n x ≤ max (n : ℝ) 4\n\n/--\nThe full assertion: for every natural number `n ≥ 3` and every positive real\nfunction `x : Fin n → ℝ` whose sum is `n`, the cyclic product-sum expression\nis at most `max n 4`.\n-/\ndef Target : Prop :=\n ∀ (n : ℕ), 3 ≤ n → ∀ (x : Fin n → ℝ),\n Admissible n x → Inequality n x\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "79db2d03-8d0a-5749-87a6-9e1201df9da6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "998017e8110b328b44160f9820e92d1e8ac1bbcf63633937f1c920367306fbab", "task_path": "tasks/nmp3_79db2d03-8d0a-5749-87a6-9e1201df9da6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "79db2d03-8d0a-5749-87a6-9e1201df9da6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_79e754c6-61e2-5af1-a624-7db8048c7069", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive integers and let $x,y,z$ be integers such that \n-- \n-- (a) $ax^2+by^2+cz^2=abc+2xyz-1$; \n-- \n-- (b) $ab+bc+ca\\ge x^2+y^2+z^2$. \n-- \n-- Prove that each of $a,b,c$ can be written as a sum of three squares of integers.\nimport Mathlib\n\n/-!\n# Formal statement: positive integer triples satisfying a Hurwitz-type equation\n\nThis file records the statement of the problem only. It intentionally contains no\nproof of the claimed conclusion.\n-/\n\nnamespace Problem\n\n/-- The equation appearing in clause (a) of the problem. The positive integers\n`a`, `b`, and `c` are coerced to `Int` so that the equation is an integer equation,\nas in the source problem. -/\ndef EquationCondition (a b c : Nat) (x y z : Int) : Prop :=\n (a : Int) * x ^ 2 + (b : Int) * y ^ 2 + (c : Int) * z ^ 2 =\n (a : Int) * (b : Int) * (c : Int) + 2 * x * y * z - 1\n\n/-- The inequality appearing in clause (b) of the problem. -/\ndef InequalityCondition (a b c : Nat) (x y z : Int) : Prop :=\n (a : Int) * (b : Int) + (b : Int) * (c : Int) + (c : Int) * (a : Int) ≥\n x ^ 2 + y ^ 2 + z ^ 2\n\n/-- The hypotheses that the parameters `a`, `b`, and `c` are positive integers. -/\ndef PositiveParameters (a b c : Nat) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The two simultaneous hypotheses (a) and (b) on `a`, `b`, `c`, `x`, `y`, and `z`. -/\ndef AdmissibleParameters (a b c : Nat) (x y z : Int) : Prop :=\n EquationCondition a b c x y z ∧ InequalityCondition a b c x y z\n\n/-- An integer is a sum of three squares of integers. Zero summands are allowed,\nand the signs of the integer square roots are immaterial. -/\ndef IsSumOfThreeIntegerSquares (n : Int) : Prop :=\n ∃ u v w : Int, n = u ^ 2 + v ^ 2 + w ^ 2\n\n/-- The complete statement of the problem: for all positive integers `a`, `b`, `c`\nand all integers `x`, `y`, `z` satisfying clauses (a) and (b), each of `a`, `b`,\nand `c` is a sum of three squares of integers. -/\ndef Target : Prop :=\n ∀ (a b c : Nat) (x y z : Int),\n PositiveParameters a b c →\n AdmissibleParameters a b c x y z →\n IsSumOfThreeIntegerSquares (a : Int) ∧\n IsSumOfThreeIntegerSquares (b : Int) ∧\n IsSumOfThreeIntegerSquares (c : Int)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "79e754c6-61e2-5af1-a624-7db8048c7069", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "184ee90231271e46fd8ad1e523de556cbab323afec673997ff1820438b41855a", "task_path": "tasks/nmp3_79e754c6-61e2-5af1-a624-7db8048c7069", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "79e754c6-61e2-5af1-a624-7db8048c7069", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7a81ff07-894a-597c-9238-d5e7c4d07ccd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for positive real numbers $a,b,c$,\n-- \\[\n-- \\frac{8a^{2}+2ab}{\\bigl(b+\\sqrt{6ac}+3c\\bigr)^{2}}\n-- +\\frac{2b^{2}+3bc}{\\bigl(3c+\\sqrt{2ab}+2a\\bigr)^{2}}\n-- +\\frac{18c^{2}+6ac}{\\bigl(2a+\\sqrt{3bc}+b\\bigr)^{2}}\n-- \\ge 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of a cyclic radical inequality\n\nThe source problem asks to prove a lower bound for a sum of three rational\nexpressions involving square roots of products of positive real variables.\nThis file records the exact proposition as a `Prop`-valued definition; no\nproof of the inequality is supplied here.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality from the problem statement. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (8 * a ^ 2 + 2 * a * b) /\n (b + Real.sqrt (6 * a * c) + 3 * c) ^ 2 +\n (2 * b ^ 2 + 3 * b * c) /\n (3 * c + Real.sqrt (2 * a * b) + 2 * a) ^ 2 +\n (18 * c ^ 2 + 6 * a * c) /\n (2 * a + Real.sqrt (3 * b * c) + b) ^ 2\n\n/-- For all positive real numbers `a`, `b`, and `c`, the sum of the three\ndisplayed fractional expressions is at least `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → 1 ≤ LHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7a81ff07-894a-597c-9238-d5e7c4d07ccd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "119dbecb64c7bce342871ac7f2e2fcf0da02b3ab5f24024e54c84223807c7765", "task_path": "tasks/nmp3_7a81ff07-894a-597c-9238-d5e7c4d07ccd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7a81ff07-894a-597c-9238-d5e7c4d07ccd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7aa0e1b6-1a0e-5405-bb5f-bd189a043bdc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A school has 450 students. Each student has at least 100 friends among the other students, and among any 200 students there are always two that are friends. Prove that 302 of the students can be chosen and placed in 151 two‑seater kayaks so that each kayak contains a pair of friends.\nimport Mathlib.Combinatorics.SimpleGraph.Finite\n\n/-!\n# Formalization of the school-friendship and kayak problem\n\nThe 450 students are represented by `Fin 450`, and the friendship relation is\nrepresented by a simple graph on that type. A simple graph supplies symmetry\nand looplessness, so a student is adjacent only to *other* students.\n\nThe declarations in this file are statement-level `Prop` definitions. In\nparticular, `Problem.Target` is the proposition asserted by the problem; it is\nnot proved here.\n-/\n\nnoncomputable section\n\nopen Classical\n\nnamespace Problem\n\n/-- Every student has at least 100 friends among the other students. -/\ndef HasAtLeastHundredFriends (G : SimpleGraph (Fin 450)) : Prop :=\n ∀ student : Fin 450, (100 : ℕ) ≤ G.degree student\n\n/-- Every choice of exactly 200 students contains two distinct friends. -/\ndef EveryTwoHundredStudentsContainFriends (G : SimpleGraph (Fin 450)) : Prop :=\n ∀ students : Finset (Fin 450),\n students.card = (200 : ℕ) →\n ∃ first : Fin 450,\n first ∈ students ∧\n ∃ second : Fin 450,\n second ∈ students ∧ first ≠ second ∧ G.Adj first second\n\n/-- The two hypotheses imposed on the friendship graph by the problem. -/\ndef AdmissibleFriendshipGraph (G : SimpleGraph (Fin 450)) : Prop :=\n HasAtLeastHundredFriends G ∧ EveryTwoHundredStudentsContainFriends G\n\n/--\nThere is a set of exactly 302 chosen students and a seating assignment of those\nstudents to 151 kayaks, with two seats in each kayak, such that the two\noccupants of every kayak are friends.\n-/\ndef HasFriendKayakPlacement (G : SimpleGraph (Fin 450)) : Prop :=\n ∃ chosen : Finset (Fin 450),\n chosen.card = (302 : ℕ) ∧\n ∃ seatAssignment : chosen ≃ (Fin 151 × Fin 2),\n ∀ kayak : Fin 151,\n G.Adj\n (seatAssignment.symm (kayak, (0 : Fin 2))).1\n (seatAssignment.symm (kayak, (1 : Fin 2))).1\n\n/-- The complete statement of the problem: for every friendship graph on the\n450 students satisfying the two stated hypotheses, 302 students permit the\nrequired placement into 151 kayaks with one friendship pair per kayak. -/\ndef Target : Prop :=\n ∀ G : SimpleGraph (Fin 450),\n AdmissibleFriendshipGraph G → HasFriendKayakPlacement G\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7aa0e1b6-1a0e-5405-bb5f-bd189a043bdc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "18d132fdd9f53a208ce33e584ed8cbab5b905214e65a90b4ba8d396722eef7ba", "task_path": "tasks/nmp3_7aa0e1b6-1a0e-5405-bb5f-bd189a043bdc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7aa0e1b6-1a0e-5405-bb5f-bd189a043bdc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7ab49540-b7f4-5a8c-9bc1-4019b1695cc2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all integers \\(k\\ge 1\\) and all positive real numbers \\(a,b,c\\), prove that \n-- \\[\n-- \\frac{a}{b}\\cdot\\frac{a^{3k}-b^{3k}}{a^{3k}+(2k-1)b^{3k}}\n-- +\\frac{b}{c}\\cdot\\frac{b^{3k}-c^{3k}}{b^{3k}+(2k-1)c^{3k}}\n-- +\\frac{c}{a}\\cdot\\frac{c^{3k}-a^{3k}}{c^{3k}+(2k-1)a^{3k}}\n-- \\ge 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic inequality\n\nThis file records the problem statement only. It defines the left-hand\nside of the desired inequality and packages the universally quantified\nclaim as a proposition; no proof of the claim is supplied.\n-/\n\nnamespace Problem\n\n/-- A single summand of the cyclic expression:\n`(x / y) * ((x ^ (3k) - y ^ (3k)) /\n (x ^ (3k) + (2k - 1) * y ^ (3k)))`.\nHere the exponent `3 * k` is an integer exponent, and `k` is an integer. -/\nnoncomputable def summand (k : ℤ) (x y : ℝ) : ℝ :=\n (x / y) * ((x ^ (3 * k) - y ^ (3 * k)) /\n (x ^ (3 * k) + (2 * (k : ℝ) - 1) * y ^ (3 * k)))\n\n/-- The complete left-hand side of the cyclic inequality. -/\nnoncomputable def lhs (k : ℤ) (a b c : ℝ) : ℝ :=\n summand k a b + summand k b c + summand k c a\n\n/-- For every integer `k ≥ 1` and every positive real `a`, `b`, `c`, the\ncyclic expression is nonnegative. -/\ndef Target : Prop :=\n ∀ (k : ℤ), 1 ≤ k →\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → 0 ≤ lhs k a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7ab49540-b7f4-5a8c-9bc1-4019b1695cc2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c3759d9de4e5212fe46c3cffb22706e5361e86725df6bf4e6edfa78d5ec7c855", "task_path": "tasks/nmp3_7ab49540-b7f4-5a8c-9bc1-4019b1695cc2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7ab49540-b7f4-5a8c-9bc1-4019b1695cc2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7ad8dc8a-3500-50f2-ae32-f99faaccb392", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- There are 100 cards, each bearing a distinct integer from 1 to 100. In the game a card with a larger integer beats a card with a smaller integer, except that 1 beats 100 (so the beating relation is cyclic). The player knows the set of values and the beating rule, but not which card has which value. The dealer knows the exact assignment of values to the 100 cards. The dealer may tell the player, for any chosen ordered pair of distinct cards, which one beats the other (i.e., may give a message of the form “card X beats card Y”). Prove that the dealer can select 100 such messages so that after receiving those 100 pieces of information the player can uniquely determine the value of each card.\nimport Mathlib\n\nset_option autoImplicit false\n\nnamespace Problem\n\n/-- The 100 physical cards, labelled by their identity. This index is not the\ninteger written on the card. -/\nabbrev Card : Type := Fin 100\n\n/-- The possible integers written on cards: the natural numbers from 1 to 100. -/\nabbrev Value : Type := {n : ℕ // 1 ≤ n ∧ n ≤ 100}\n\n/-- The beating relation on card values. A larger value beats a smaller value,\nwith the exceptional comparison that value 1 beats value 100 (and consequently\n100 does not beat 1). -/\ndef Beats (a b : Value) : Prop :=\n (b.val < a.val ∧ ¬ (a.val = 100 ∧ b.val = 1)) ∨\n (a.val = 1 ∧ b.val = 100)\n\n/-- A complete assignment of distinct values to the cards. It is a bijection\nbecause there are equally many cards and available values. -/\nabbrev Assignment : Type := Card ≃ Value\n\n/-- A proposed message is an ordered pair of cards; its intended content is\n\"the first card beats the second card\". Distinctness of the two cards is\nimposed in `TrueMessage`. -/\nabbrev Message : Type := Card × Card\n\n/-- The assertion that `message` is a true beating message under `assignment`. -/\ndef TrueMessage (assignment : Assignment) (message : Message) : Prop :=\n message.1 ≠ message.2 ∧\n Beats (assignment message.1) (assignment message.2)\n\n/-- The selected messages are all true under the assignment. -/\ndef MessagesTrue (assignment : Assignment) (messages : Finset Message) : Prop :=\n ∀ message ∈ messages, TrueMessage assignment message\n\n/-- The selected messages identify every card's value: every assignment that\nwould make all of the selected assertions true gives each card the same value as\nthe actual assignment. -/\ndef IdentifiesAssignment (assignment : Assignment) (messages : Finset Message) : Prop :=\n MessagesTrue assignment messages ∧\n ∀ other : Assignment,\n MessagesTrue other messages →\n ∀ card : Card, other card = assignment card\n\n/-- For every possible secret assignment, the dealer can find a set of exactly\n100 distinct true beating messages that uniquely determines that assignment. -/\ndef DealerCanSelectHundredMessages : Prop :=\n ∀ assignment : Assignment,\n ∃ messages : Finset Message,\n messages.card = 100 ∧ IdentifiesAssignment assignment messages\n\n/-- The formal target statement: for every assignment of the values 1 through\n100 to the 100 cards, the knowing dealer can select 100 true messages of the\nform \"card X beats card Y\" after which every card's value is uniquely\ndetermined. This is written out directly (rather than only as an alias) so the\nproposition under the target declaration is explicit. -/\ndef Target : Prop :=\n ∀ assignment : Assignment,\n ∃ messages : Finset Message,\n messages.card = 100 ∧ IdentifiesAssignment assignment messages\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7ad8dc8a-3500-50f2-ae32-f99faaccb392", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1734485a93c789ca7f479ba148509b55187d74b3513b976b0244e350e7398901", "task_path": "tasks/nmp3_7ad8dc8a-3500-50f2-ae32-f99faaccb392", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7ad8dc8a-3500-50f2-ae32-f99faaccb392", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7af5fa61-d04e-5d45-b702-8c524a515243", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{a}{2b+1}+\\frac{b}{2c+1}+\\frac{c}{2a+1}\\le\\frac1{abc}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the given inequality problem\n\nThe original problem asks us to prove, for all positive real numbers\n`a`, `b`, and `c` satisfying `a + b + c = 3`, that\n\n`a / (2 * b + 1) + b / (2 * c + 1) + c / (2 * a + 1) ≤ 1 / (a * b * c)`.\n\nThe assertion is represented as a proposition-valued definition. No proof is\nsupplied at this statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- The target assertion of the problem.\n\nFor every triple of positive real numbers `a`, `b`, and `c` whose sum is `3`,\nthe stated rational expression is at most `1 / (a * b * c)`. All divisions are\ndivision in the field of real numbers, and the outer quantifiers range over\nreal numbers. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 3 →\n a / (2 * b + 1) + b / (2 * c + 1) + c / (2 * a + 1) ≤\n (1 : ℝ) / (a * b * c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7af5fa61-d04e-5d45-b702-8c524a515243", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b8ead8d351378e3417ef2be276cc7c31ee70cc7040175badac380a5bc25cc28d", "task_path": "tasks/nmp3_7af5fa61-d04e-5d45-b702-8c524a515243", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7af5fa61-d04e-5d45-b702-8c524a515243", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7b0243b2-3183-5f97-b57a-ea2ae05e0a5f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x$, $y$, $z$ be positive real numbers such that $x+y+z=1$. Prove that \n-- \\[\n-- \\frac{x}{\\sqrt{y^{2}+xyz}}+\\frac{y}{\\sqrt{z^{2}+xyz}}+\\frac{z}{\\sqrt{x^{2}+xyz}}\\ge\\frac{3\\sqrt3}{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic square-root inequality\n\nThe source problem asks, for positive real numbers `x`, `y`, `z` with\n`x + y + z = 1`, to prove\n\n`x / sqrt (y^2 + x*y*z) + y / sqrt (z^2 + x*y*z)\n + z / sqrt (x^2 + x*y*z) ≥ 3*sqrt 3 / 2`.\n\nThe declaration below records only the proposition to be proved.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the cyclic inequality. -/\ndef lhs (x y z : ℝ) : ℝ :=\n x / Real.sqrt (y ^ 2 + x * y * z) +\n y / Real.sqrt (z ^ 2 + x * y * z) +\n z / Real.sqrt (x ^ 2 + x * y * z)\n\n/-- The numerical lower bound on the right-hand side, `(3 * sqrt 3) / 2`. -/\ndef lowerBound : ℝ :=\n (3 * Real.sqrt 3) / 2\n\n/-- The admissibility condition on the three real variables: all are strictly\npositive and their sum is `1`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = 1\n\n/-- The full proposition asserted by the problem. The variables range over all\nreal triples satisfying `Admissible`; the conclusion is the stated non-strict\nlower bound. -/\ndef Target : Prop :=\n ∀ (x y z : ℝ), Admissible x y z → lhs x y z ≥ lowerBound\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b0243b2-3183-5f97-b57a-ea2ae05e0a5f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bf5ad49c120ebf7bffadcd5bcd6b1ea00782b2e8de16061bd6b0312eada139fa", "task_path": "tasks/nmp3_7b0243b2-3183-5f97-b57a-ea2ae05e0a5f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b0243b2-3183-5f97-b57a-ea2ae05e0a5f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7b07be66-4e1a-5ba5-a8e7-682e66a4c0f3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for an integer $n\\ge 2$, $n$ is prime if and only if $\\phi(n)$ divides $n-1$ and $n+1$ divides $\\sigma(n)$, where $\\phi$ denotes Euler’s totient function and $\\sigma$ denotes the sum‑of‑divisors function.\nmodule\n\nimport Mathlib.Data.Nat.Totient\nimport Mathlib.NumberTheory.Divisors\nimport Mathlib.RingTheory.Int.Basic\n\n/-!\n# Formal statement: primality characterized by totient and divisor-sum divisibility\n\nThe source problem asks to prove that every integer `n ≥ 2` is prime exactly when\n`φ(n)` divides `n - 1` and `n + 1` divides `σ(n)`.\n\nThe problem's variable is an integer. Since the two arithmetic functions are\ntraditionally defined on positive integers, they are transported to an integer\n`n` using `Int.natAbs`; on the stated domain `n ≥ 2`, this is exactly `n` itself.\nEuler's totient is Mathlib's `Nat.totient`, and `σ` is the sum over the positive\ndivisors in `Nat.divisors`.\n-/\n\npublic section\n\nnamespace Problem\n\n/-- Euler's totient function, transported to integers through `Int.natAbs`. -/\ndef eulerPhi (n : ℤ) : ℕ :=\n Nat.totient n.natAbs\n\n/-- The sum-of-divisors function `σ(n)`, transported to integers through\n`Int.natAbs` and summing the positive divisors in `Nat.divisors`. -/\ndef sumOfDivisors (n : ℤ) : ℕ :=\n n.natAbs.divisors.sum fun d => d\n\n/-- The two divisibility conditions appearing in the problem, with the natural\nvalues of `φ(n)` and `σ(n)` interpreted in the integer divisibility relation. -/\ndef DivisibilityCondition (n : ℤ) : Prop :=\n ((eulerPhi n : ℤ) ∣ n - 1) ∧\n (n + 1 ∣ (sumOfDivisors n : ℤ))\n\n/-- The full assertion of the problem: for every integer `n ≥ 2`, `n` is prime\nif and only if `φ(n)` divides `n - 1` and `n + 1` divides `σ(n)`. -/\ndef Target : Prop :=\n ∀ n : ℤ, 2 ≤ n → (_root_.Prime n ↔ DivisibilityCondition n)\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b07be66-4e1a-5ba5-a8e7-682e66a4c0f3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "64ca00ad7e235eba7a0a56e2dfed322de2730b192b98300d7b8a30b0b6e73517", "task_path": "tasks/nmp3_7b07be66-4e1a-5ba5-a8e7-682e66a4c0f3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b07be66-4e1a-5ba5-a8e7-682e66a4c0f3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7b3e7644-7d05-5082-a3ba-4d09985c9db9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- \\frac{a^{3}+b^{3}+c^{3}}{3abc}+\\frac{a(b+c)}{b^{2}+c^{2}}+\\frac{b(c+a)}{c^{2}+a^{2}}+\\frac{c(a+b)}{a^{2}+b^{2}}\\ge 4.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the positive-real inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthe stated four-term inequality. The declaration below records exactly that\nuniversally quantified proposition. No proof is supplied in this statement\nformalization.\n-/\n\nnamespace Problem\n\n/-- The left-hand side appearing in the source inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 3 + b ^ 3 + c ^ 3) / (3 * a * b * c)\n + a * (b + c) / (b ^ 2 + c ^ 2)\n + b * (c + a) / (c ^ 2 + a ^ 2)\n + c * (a + b) / (a ^ 2 + b ^ 2)\n\n/-- For all positive real numbers `a`, `b`, and `c`, the four-term\nleft-hand side is at least `4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b3e7644-7d05-5082-a3ba-4d09985c9db9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8a2628aa75d11f2d2c2dc7475093b1953f30431b46a2a31bd8ad47e579911eca", "task_path": "tasks/nmp3_7b3e7644-7d05-5082-a3ba-4d09985c9db9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b3e7644-7d05-5082-a3ba-4d09985c9db9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7b5b0c2f-de52-5a0d-af9c-ecd5a3245192", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The kingdom of Mathlandia contains 2016 airports. Each airport has direct flights to at least 100 other airports. The flight network is connected (one can travel from any airport to any other using stopovers). Prove that any two airports can be connected by a route using fewer than 65 flights (i.e., the distance between any two vertices of the graph is at most 64).\nmodule\n\npublic import Mathlib.Combinatorics.SimpleGraph.Metric\npublic import Mathlib.Combinatorics.SimpleGraph.Finite\n\n/-!\n# Formal statement: a minimum-degree bound on the diameter of a finite graph\n\nThe problem is represented by a finite simple undirected graph whose vertices are\nthe airports and whose edges are direct flights. A graph with exactly `2016`\nvertices and minimum degree at least `100` is asserted to have graph distance at\nmost `64` between every pair of vertices.\n\nThis file states the target as a proposition; it deliberately contains no proof\nof that proposition.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\nuniverse u\n\n/-- The finite vertex type has exactly 2016 elements (airports). -/\ndef Has2016Airports (V : Type u) [Fintype V] : Prop :=\n Fintype.card V = 2016\n\n/-- Every airport has direct flights to at least 100 other airports.\n\n`G.degree v` is the cardinality of the finite set of vertices adjacent to `v`.\nThe local `letI` supplies classical decidability of adjacency solely so that\nthis finite cardinality can be used; it is not an additional mathematical\nassumption. -/\nnoncomputable def MinimumDegreeAtLeast100 (V : Type u) [Fintype V]\n (G : SimpleGraph V) : Prop :=\n letI : DecidableRel G.Adj := Classical.decRel G.Adj\n ∀ v : V, 100 ≤ G.degree v\n\n/-- Every two vertices are at graph distance at most 64.\n\n`SimpleGraph.dist u v` is the length of a shortest walk from `u` to `v`, counted\nas a number of edges (direct flights). -/\nnoncomputable def DiameterAtMost64 (V : Type u) (G : SimpleGraph V) : Prop :=\n ∀ u v : V, G.dist u v ≤ 64\n\n/-- The complete statement of the problem.\n\nFor every finite simple graph with exactly 2016 vertices, if every vertex has\ndegree at least 100 and the graph is connected, then the distance between any\ntwo vertices is at most 64. -/\nnoncomputable def Target : Prop :=\n ∀ (V : Type u) [Fintype V],\n Has2016Airports V →\n ∀ G : SimpleGraph V,\n MinimumDegreeAtLeast100 V G →\n G.Connected →\n DiameterAtMost64 V G\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b5b0c2f-de52-5a0d-af9c-ecd5a3245192", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "544a9897f12ddb3046bec506c6830e088bafa06497a503f4a9eacd1614fc1229", "task_path": "tasks/nmp3_7b5b0c2f-de52-5a0d-af9c-ecd5a3245192", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b5b0c2f-de52-5a0d-af9c-ecd5a3245192", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7b611b05-94a2-57db-8e3d-08ebbfd13487", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that any connected subset of the plane whose diameter is $1$ can be contained in a regular hexagon of side length $\\frac{1}{\\sqrt3}\\,.$\nimport Mathlib\n\n/-!\n# Formal statement: covering a connected plane set of diameter one by a regular hexagon\n\nThis file formalizes the statement of the source problem. The Euclidean plane is\nrepresented by `ℂ` with its usual norm/metric and topology. A (closed) regular hexagon\nof side length `s` is represented as the convex hull of six consecutive vertices on the\ncircle of radius `s`; this is the standard circumradius/side-length relation for a\nregular hexagon. The parameters `center` and `angle` allow arbitrary translations and\nrotations.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane, represented by the complex numbers. -/\nabbrev Plane : Type := ℂ\n\n/-- The `k`-th vertex of the regular hexagon of side length `side`, centered at `center`\nand rotated by `angle`. Its circumradius is `side`, as for a regular hexagon. -/\nnoncomputable def regularHexagonVertex (center : Plane) (angle side : ℝ) (k : Fin 6) : Plane :=\n center + (side : ℂ) * Complex.exp (((angle + (k.1 : ℝ) * Real.pi / 3 : ℝ) : ℂ) * Complex.I)\n\n/-- The closed filled regular hexagon of side length `side`, centered at `center` and\nrotated by `angle`. It is the convex hull of its six vertices. -/\nnoncomputable def regularHexagon (center : Plane) (angle side : ℝ) : Set Plane :=\n convexHull ℝ (Set.range (regularHexagonVertex center angle side))\n\n/-- A subset of the plane is admissible when it is connected and has diameter exactly one. -/\ndef planeSetConnectedDiameterOne (K : Set Plane) : Prop :=\n IsConnected K ∧ Metric.diam K = 1\n\n/-- The set `K` is contained in some regular hexagon of side length `side`. -/\ndef coverableByRegularHexagonOfSide (K : Set Plane) (side : ℝ) : Prop :=\n ∃ (center : Plane) (angle : ℝ), K ⊆ regularHexagon center angle side\n\n/-- Formal statement of the problem: every connected subset of the Euclidean plane whose\ndiameter is exactly `1` is contained in a regular hexagon of side length `1 / sqrt 3`. -/\nnoncomputable def Target : Prop :=\n ∀ K : Set Plane,\n planeSetConnectedDiameterOne K →\n coverableByRegularHexagonOfSide K (1 / Real.sqrt 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b611b05-94a2-57db-8e3d-08ebbfd13487", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "19cd87029472054d3e371f3204d414e1d14c5b2de2a8835e0668ff7f0e5b32c0", "task_path": "tasks/nmp3_7b611b05-94a2-57db-8e3d-08ebbfd13487", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b611b05-94a2-57db-8e3d-08ebbfd13487", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7b6578b5-3b53-56f5-bf5b-5b0ecccb3a55", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute triangle and let $P$ be a point inside $ABC$. Prove that \n-- \\[\n-- PA\\cdot PB\\,\\sin\\angle C\\;+\\;PB\\cdot PC\\,\\sin\\angle A\\;+\\;PC\\cdot PA\\,\\sin\\angle B\\;\\ge\\;2[ABC],\n-- \\] \n-- where $[ABC]$ denotes the area of $\\triangle ABC\\,. $\nimport Mathlib\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\nopen Real\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, represented by the standard real inner product space `ℝ²`. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Twice the signed (oriented) area of the triangle with vertices `A`, `B`, `C`.\nThe formula is the two-dimensional determinant based at `C`. -/\ndef signedDoubleArea (A B C : Plane) : ℝ :=\n (A (0 : Fin 2) - C (0 : Fin 2)) * (B (1 : Fin 2) - C (1 : Fin 2)) -\n (A (1 : Fin 2) - C (1 : Fin 2)) * (B (0 : Fin 2) - C (0 : Fin 2))\n\n/-- The (nonnegative) area of the triangle with vertices `A`, `B`, `C`. -/\ndef triangleArea (A B C : Plane) : ℝ :=\n |signedDoubleArea A B C| / 2\n\n/-- The interior angle of triangle `ABC` at vertex `A`, i.e. `∠BAC`. -/\ndef angleA (A B C : Plane) : ℝ :=\n EuclideanGeometry.angle B A C\n\n/-- The interior angle of triangle `ABC` at vertex `B`, i.e. `∠ABC`. -/\ndef angleB (A B C : Plane) : ℝ :=\n EuclideanGeometry.angle A B C\n\n/-- The interior angle of triangle `ABC` at vertex `C`, i.e. `∠ACB`. -/\ndef angleC (A B C : Plane) : ℝ :=\n EuclideanGeometry.angle A C B\n\n/-- `ABC` is an acute triangle: its vertices are distinct and all three interior\nangles lie strictly between `0` and `π / 2`. -/\ndef IsAcuteTriangle (A B C : Plane) : Prop :=\n A ≠ B ∧ B ≠ C ∧ C ≠ A ∧\n 0 < angleA A B C ∧ angleA A B C < π / 2 ∧\n 0 < angleB A B C ∧ angleB A B C < π / 2 ∧\n 0 < angleC A B C ∧ angleC A B C < π / 2\n\n/-- The closed triangular region with vertices `A`, `B`, `C`, represented as the\nconvex hull of the three vertices. -/\ndef triangleHull (A B C : Plane) : Set Plane :=\n convexHull ℝ ({A, B, C} : Set Plane)\n\n/-- The point `P` lies strictly inside the triangle `ABC`, i.e. in the topological\ninterior of its closed convex hull. -/\ndef InsideTriangle (A B C P : Plane) : Prop :=\n P ∈ interior (triangleHull A B C)\n\n/-- The asserted geometric inequality for a fixed labelled triangle and point. -/\ndef TriangleInequality (A B C P : Plane) : Prop :=\n dist P A * dist P B * Real.sin (angleC A B C) +\n dist P B * dist P C * Real.sin (angleA A B C) +\n dist P C * dist P A * Real.sin (angleB A B C) ≥\n 2 * triangleArea A B C\n\n/-- The quantified implication for fixed `A`, `B`, `C`, and `P`. -/\ndef TargetAt (A B C P : Plane) : Prop :=\n IsAcuteTriangle A B C → InsideTriangle A B C P → TriangleInequality A B C P\n\n/-- The complete statement: for every acute triangle `ABC` and every point `P`\nstrictly inside it, the stated sum is at least twice the area of `ABC`. -/\ndef Target : Prop :=\n ∀ (A B C P : Plane), TargetAt A B C P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b6578b5-3b53-56f5-bf5b-5b0ecccb3a55", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e19d7cc7c8787ce07b78fc349216c3517794fe09a1122024c5999df7a93ad18a", "task_path": "tasks/nmp3_7b6578b5-3b53-56f5-bf5b-5b0ecccb3a55", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b6578b5-3b53-56f5-bf5b-5b0ecccb3a55", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7b8b1b0b-fee6-527a-9c90-edd1a6468c66", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y$ be positive integers. Suppose that for every positive integer $n$ we have \n-- \\[\n-- (ny)^2+1 \\mid x^{\\varphi(n)}-1,\n-- \\] \n-- where $\\varphi$ denotes Euler’s totient function. Prove that $x=1$.\nimport Mathlib.Data.Nat.Totient\n\n/-!\nFormalization of the source problem:\n\nLet `x` and `y` be positive integers. Suppose that for every positive integer `n`,\n`(n * y)^2 + 1` divides `x ^ φ(n) - 1`, where `φ` denotes Euler's totient function.\nProve that `x = 1`.\n\nThe positive integers are represented by natural numbers carrying explicit\npositivity hypotheses. The divisibility is natural-number divisibility. The\nexponent is `Nat.totient n`. No proof of the target assertion is supplied here.\n-/\n\nnamespace Problem\n\n/-- The divisibility condition in the problem for one positive integer `n`. -/\ndef Condition (x y n : ℕ) : Prop :=\n ((n * y) ^ 2 + 1) ∣ (x ^ (Nat.totient n) - 1)\n\n/-- The universal hypothesis: the condition holds for every positive integer `n`. -/\ndef Hypothesis (x y : ℕ) : Prop :=\n ∀ n : ℕ, 0 < n → Condition x y n\n\n/-- Main target proposition of the problem: for all positive integers `x` and `y`,\nif the divisibility hypothesis holds for every positive integer `n`, then `x = 1`. -/\ndef Target : Prop :=\n ∀ x y : ℕ, 0 < x → 0 < y → Hypothesis x y → x = 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b8b1b0b-fee6-527a-9c90-edd1a6468c66", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "38f134903fa101262db296b05e37ad1163e28f0d5f2a973acc7fe59de3f996ec", "task_path": "tasks/nmp3_7b8b1b0b-fee6-527a-9c90-edd1a6468c66", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7b8b1b0b-fee6-527a-9c90-edd1a6468c66", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7bf8319a-2dac-5595-aff1-19d3d54503fb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $S=\\{1,2,\\dots,2017\\}$. For each subset $A\\subseteq S$ a real number $f(A)\\ge0$ is assigned such that \n-- \n-- 1. $f(A\\cup B)+f(A\\cap B)\\le f(A)+f(B)$ for all $A,B\\subseteq S$; \n-- 2. $f(A)\\le f(B)$ whenever $A\\subseteq B\\subseteq S$; \n-- 3. For any $k\\in S$ and any $j\\in S$, \n-- \\[\n-- f(\\{1,2,\\dots,k\\})\\;\\ge\\;f\\big((\\{1,2,\\dots,k\\}\\setminus\\{k\\})\\cup\\{j\\}\\big);\n-- \\] \n-- 4. $f(\\varnothing)=0$. \n-- \n-- Prove that for every three‑element subset $T\\subseteq S$,\n-- \\[\n-- f(T)\\le\\frac{27}{19}\\,f(\\{1,2,3\\})\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The ground set `S = {1, 2, ..., 2017}`. -/\ndef S : Finset ℕ := Finset.Icc 1 2017\n\n/-- The type of subsets of `S`. A term consists of a finite set of naturals\ntogether with a proof that it is contained in `S`. -/\nabbrev SubsetOfS : Type := {A : Finset ℕ // A ⊆ S}\n\n/-- Union of two subsets of `S`, as a subset of `S`. -/\ndef unionSubset (A B : SubsetOfS) : SubsetOfS :=\n ⟨A.1 ∪ B.1, Finset.union_subset A.2 B.2⟩\n\n/-- Intersection of two subsets of `S`, as a subset of `S`. -/\ndef interSubset (A B : SubsetOfS) : SubsetOfS :=\n ⟨A.1 ∩ B.1, by\n intro x hx\n exact A.2 (Finset.mem_inter.mp hx).1⟩\n\n/-- The empty subset of `S`. -/\ndef emptySubset : SubsetOfS :=\n ⟨∅, by simp⟩\n\n/-- The initial segment `{1, 2, ..., k}`. -/\ndef initialSegment (k : ℕ) : Finset ℕ := Finset.Icc 1 k\n\n/-- The initial segment `{1, 2, ..., k}` regarded as a subset of `S`. -/\ndef initialSegmentOfS (k : ℕ) (hk : k ∈ S) : SubsetOfS :=\n ⟨initialSegment k, by\n intro x hx\n have hk' : 1 ≤ k ∧ k ≤ 2017 := by\n simpa [S] using hk\n have hx' : 1 ≤ x ∧ x ≤ k := by\n simpa [initialSegment] using hx\n exact Finset.mem_Icc.mpr ⟨hx'.1, le_trans hx'.2 hk'.2⟩⟩\n\n/-- The set `({1, 2, ..., k} \\ {k}) ∪ {j}`. -/\ndef replaceLast (k j : ℕ) : Finset ℕ :=\n (initialSegment k \\ {k}) ∪ {j}\n\n/-- The set `({1, 2, ..., k} \\ {k}) ∪ {j}` regarded as a subset of `S`. -/\ndef replaceLastOfS (k j : ℕ) (hk : k ∈ S) (hj : j ∈ S) : SubsetOfS :=\n ⟨replaceLast k j, by\n intro x hx\n have hx' : x = j ∨ x ∈ initialSegment k ∧ ¬ x = k := by\n simpa [replaceLast, Finset.mem_sdiff, Finset.mem_singleton] using hx\n rcases hx' with hx' | hx'\n · rw [hx']\n exact hj\n · exact (initialSegmentOfS k hk).2 hx'.1⟩\n\n/-- The three-element set `{1, 2, 3}` regarded as a subset of `S`. -/\ndef triple123 : SubsetOfS :=\n ⟨({1, 2, 3} : Finset ℕ), by\n intro x hx\n have hx' : x = 1 ∨ x = 2 ∨ x = 3 := by\n simpa using hx\n have hx'' : 1 ≤ x ∧ x ≤ 2017 := by omega\n exact Finset.mem_Icc.mpr hx''⟩\n\n/-- The nonnegativity part of the hypothesis: every assigned value is real and nonnegative. -/\ndef Nonnegative (f : SubsetOfS → ℝ) : Prop :=\n ∀ A : SubsetOfS, 0 ≤ f A\n\n/-- Hypothesis 1: submodularity of `f`. -/\ndef Submodular (f : SubsetOfS → ℝ) : Prop :=\n ∀ A B : SubsetOfS,\n f (unionSubset A B) + f (interSubset A B) ≤ f A + f B\n\n/-- Hypothesis 2: monotonicity of `f` with respect to inclusion. -/\ndef InclusionMonotone (f : SubsetOfS → ℝ) : Prop :=\n ∀ A B : SubsetOfS, A.1 ⊆ B.1 → f A ≤ f B\n\n/-- Hypothesis 3: replacing the last element `k` of the initial segment\n`{1, 2, ..., k}` by any `j ∈ S` does not increase `f`. -/\ndef PrefixReplacementInequality (f : SubsetOfS → ℝ) : Prop :=\n ∀ (k : ℕ) (hk : k ∈ S) (j : ℕ) (hj : j ∈ S),\n f (initialSegmentOfS k hk) ≥ f (replaceLastOfS k j hk hj)\n\n/-- Hypothesis 4: `f` vanishes on the empty set. -/\ndef EmptyZero (f : SubsetOfS → ℝ) : Prop :=\n f emptySubset = 0\n\n/-- All hypotheses imposed on `f`. -/\ndef Admissible (f : SubsetOfS → ℝ) : Prop :=\n Nonnegative f ∧\n Submodular f ∧\n InclusionMonotone f ∧\n PrefixReplacementInequality f ∧\n EmptyZero f\n\n/-- The assertion requested by the problem: every three-element subset `T` of\n`S` satisfies `f(T) ≤ (27/19) f({1,2,3})` under hypotheses 1--4. -/\ndef Target : Prop :=\n ∀ (f : SubsetOfS → ℝ),\n Admissible f →\n ∀ (T : SubsetOfS),\n T.1.card = 3 →\n f T ≤ ((27 : ℝ) / (19 : ℝ)) * f triple123\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7bf8319a-2dac-5595-aff1-19d3d54503fb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5df71dd3b72007ca37426a2032e14a5b5e5622762b4e32f5e6ffd8450f12a17e", "task_path": "tasks/nmp3_7bf8319a-2dac-5595-aff1-19d3d54503fb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7bf8319a-2dac-5595-aff1-19d3d54503fb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7c1c27b1-56c7-5a2a-bcf3-e442577429cf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. For $1\\le i,j\\le n$, let $a_{i,j}>0$ be real numbers satisfying $a_{i,j}\\,a_{j,i}=1$ for all $i,j$. Define $c_i=\\displaystyle\\sum_{k=1}^{n}a_{k,i}$ for each $i$. Prove that \n-- \\[\n-- \\sum_{i=1}^{n}\\frac{1}{c_i}\\le 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a positive reciprocal matrix inequality\n\nThe original problem asks, for every positive integer `n` and every positive real\nmatrix `a` whose transpose is its entrywise reciprocal, to prove that the sum of\nthe reciprocals of the column sums is at most one.\n\nWe only state the assertion here; no proof is supplied.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- Every entry of the matrix `a` is strictly positive. -/\ndef EntrywisePositive (n : ℕ) (a : Fin n → Fin n → ℝ) : Prop :=\n ∀ i j : Fin n, 0 < a i j\n\n/-- Each entry of `a` is the reciprocal of the entry at the transposed indices. -/\ndef ReciprocalTranspose (n : ℕ) (a : Fin n → Fin n → ℝ) : Prop :=\n ∀ i j : Fin n, a i j * a j i = 1\n\n/-- The matrix `a` is entrywise positive and satisfies `a i j * a j i = 1`\nfor every pair of indices. -/\ndef Admissible (n : ℕ) (a : Fin n → Fin n → ℝ) : Prop :=\n EntrywisePositive n a ∧ ReciprocalTranspose n a\n\n/-- The `i`-th column sum, using `Fin n` as the index set with `n` elements. -/\ndef ColumnSum (n : ℕ) (a : Fin n → Fin n → ℝ) (i : Fin n) : ℝ :=\n ∑ k : Fin n, a k i\n\n/-- The asserted conclusion: the sum of reciprocal column sums is at most one. -/\ndef Inequality (n : ℕ) (a : Fin n → Fin n → ℝ) : Prop :=\n (∑ i : Fin n, (1 : ℝ) / ColumnSum n a i) ≤ (1 : ℝ)\n\n/-- The full universally quantified assertion of the problem. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 0 < n → ∀ (a : Fin n → Fin n → ℝ),\n Admissible n a → Inequality n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7c1c27b1-56c7-5a2a-bcf3-e442577429cf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "210bcafd870e475bab4cbb6a278a0b63c3c6b93fe4113ce5dc5f58149ef1f75c", "task_path": "tasks/nmp3_7c1c27b1-56c7-5a2a-bcf3-e442577429cf", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7c1c27b1-56c7-5a2a-bcf3-e442577429cf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7c9953ba-581d-5789-bb06-8bedeebe6446", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p>2$ be a prime and let $a,b,c,d$ be integers not divisible by $p$. Suppose that for every integer $r$ with $p\\nmid r$,\n-- \\[\n-- \\Bigl\\{\\frac{ra}{p}\\Bigr\\}+\\Bigl\\{\\frac{rb}{p}\\Bigr\\}+\\Bigl\\{\\frac{rc}{p}\\Bigr\\}+\\Bigl\\{\\frac{rd}{p}\\Bigr\\}=2,\n-- \\]\n-- where $\\{x\\}=x-\\lfloor x\\rfloor$ denotes the fractional part of $x$. Prove that at least two of the six numbers\n-- \\[\n-- a+b,\\;a+c,\\;a+d,\\;b+c,\\;b+d,\\;c+d\n-- \\]\n-- are divisible by $p\\,.\nimport Mathlib\n\n/-!\n# Formal statement for the fractional-parts problem\n\nThe original problem considers a prime `p > 2`, four integers `a b c d`\nindivisible by `p`, the hypothesis that a sum of four fractional parts equals\n`2` for every integer `r` not divisible by `p`, and the conclusion that at\nleast two of the six pairwise sums are divisible by `p`.\n\nThis file only records the mathematical statement. It contains no proof of\nthe statement.\n-/\n\nnamespace Problem\n\n/-- The fractional part `{x} = x - floor x` of a real number. -/\nnoncomputable def fractionalPart (x : ℝ) : ℝ :=\n x - (Int.floor x : ℝ)\n\n/-- The sum\n`{r*a/p} + {r*b/p} + {r*c/p} + {r*d/p}` appearing in the hypothesis. -/\nnoncomputable def fractionalPartSum (p : ℕ) (a b c d r : ℤ) : ℝ :=\n fractionalPart (((r * a : ℤ) : ℝ) / (p : ℝ)) +\n fractionalPart (((r * b : ℤ) : ℝ) / (p : ℝ)) +\n fractionalPart (((r * c : ℤ) : ℝ) / (p : ℝ)) +\n fractionalPart (((r * d : ℤ) : ℝ) / (p : ℝ))\n\n/-- The six numbered pairwise sums, in the order displayed in the problem:\n`a+b, a+c, a+d, b+c, b+d, c+d`. -/\ndef pairwiseSums (a b c d : ℤ) : Fin 6 → ℤ :=\n ![a + b, a + c, a + d, b + c, b + d, c + d]\n\n/-- The displayed hypothesis: for every integer `r` with `p ∤ r`, the sum of\nthe four fractional parts equals `2`. -/\nnoncomputable def fractionalPartHypothesis (p : ℕ) (a b c d : ℤ) : Prop :=\n ∀ r : ℤ, (¬ ((p : ℤ) ∣ r)) → fractionalPartSum p a b c d r = (2 : ℝ)\n\n/-- At least two of the six pairwise sums are divisible by `p`, where the\nsix displayed sums are counted as six indexed entries. -/\ndef AtLeastTwoPairwiseSumsDivisible (p : ℕ) (a b c d : ℤ) : Prop :=\n ∃ i j : Fin 6,\n i ≠ j ∧\n (p : ℤ) ∣ pairwiseSums a b c d i ∧\n (p : ℤ) ∣ pairwiseSums a b c d j\n\n/-- The complete mathematical assertion of the problem: for every prime\n`p > 2` and all integers `a, b, c, d` not divisible by `p`, if the displayed\nfractional-part identity holds for every integer `r` with `p ∤ r`, then at\nleast two of the six displayed pairwise sums are divisible by `p`. -/\nnoncomputable def Target : Prop :=\n ∀ (p : ℕ) (a b c d : ℤ),\n Nat.Prime p →\n 2 < p →\n (¬ ((p : ℤ) ∣ a)) →\n (¬ ((p : ℤ) ∣ b)) →\n (¬ ((p : ℤ) ∣ c)) →\n (¬ ((p : ℤ) ∣ d)) →\n fractionalPartHypothesis p a b c d →\n AtLeastTwoPairwiseSumsDivisible p a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7c9953ba-581d-5789-bb06-8bedeebe6446", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6e927ceb804edc553f4b5d162f841c0e6740dada549a43b8c952672f47f3f1f8", "task_path": "tasks/nmp3_7c9953ba-581d-5789-bb06-8bedeebe6446", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7c9953ba-581d-5789-bb06-8bedeebe6446", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7cc46654-c9d7-5371-9dfe-6c77ba518e5c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $x,y,z>0$ and $x^5+y^5+z^5=3$. Prove that \n-- \\[\n-- \\frac{x^4}{y^3}+\\frac{y^4}{z^3}+\\frac{z^4}{x^3}\\ge 3.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The three variables are strictly positive. -/\ndef StrictlyPositive (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The prescribed sum of fifth powers is exactly the real number 3. -/\ndef FifthPowerSumEqThree (x y z : ℝ) : Prop :=\n x ^ 5 + y ^ 5 + z ^ 5 = 3\n\n/-- The complete hypothesis of the problem: strict positivity together with\nthe fifth-power sum condition. -/\ndef Admissible (x y z : ℝ) : Prop :=\n StrictlyPositive x y z ∧ FifthPowerSumEqThree x y z\n\n/-- The left-hand side whose lower bound is asserted in the problem. -/\nnoncomputable def LeftHandSide (x y z : ℝ) : ℝ :=\n x ^ 4 / y ^ 3 + y ^ 4 / z ^ 3 + z ^ 4 / x ^ 3\n\n/-- The asserted non-strict lower bound, stated as a proposition about a\nfixed admissible triple. -/\ndef Inequality (x y z : ℝ) : Prop :=\n 3 ≤ LeftHandSide x y z\n\n/-- The complete assertion: for every admissible real triple `(x, y, z)`,\nthe displayed cyclic quotient sum is at least 3. This is a proposition, not a\nproof of the inequality. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7cc46654-c9d7-5371-9dfe-6c77ba518e5c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8ab30f9bf95c7113d72e0bf513e31a057f26d2090d5edcc6336b9503b6084c72", "task_path": "tasks/nmp3_7cc46654-c9d7-5371-9dfe-6c77ba518e5c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7cc46654-c9d7-5371-9dfe-6c77ba518e5c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7cfa50a8-46c7-5c03-85ea-81e035391f4a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, and $c$ be non‑negative real numbers. Prove that \n-- \\[\n-- \\left(1+\\frac{2}{\\sqrt3}\\right)(a^2-a+1)(b^2-b+1)(c^2-c+1)\\ge a^2b^2c^2-abc+1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The product on the left-hand side of the stated inequality. -/\nnoncomputable def LeftSide (a b c : ℝ) : ℝ :=\n (1 + 2 / Real.sqrt (3 : ℝ)) *\n (a ^ 2 - a + 1) * (b ^ 2 - b + 1) * (c ^ 2 - c + 1)\n\n/-- The expression on the right-hand side of the stated inequality. -/\nnoncomputable def RightSide (a b c : ℝ) : ℝ :=\n a ^ 2 * b ^ 2 * c ^ 2 - a * b * c + 1\n\n/-- The substantive inequality, with its left-hand side written first. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n LeftSide a b c ≥ RightSide a b c\n\n/-- The complete assertion: for all non-negative real numbers `a`, `b`, and `c`,\nthe stated inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7cfa50a8-46c7-5c03-85ea-81e035391f4a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "85a54803fb51a2058cf8c979da147930f7d96bc11fa0bdf00cd7cf85c87a25d4", "task_path": "tasks/nmp3_7cfa50a8-46c7-5c03-85ea-81e035391f4a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7cfa50a8-46c7-5c03-85ea-81e035391f4a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7d047826-9a18-56d6-932d-ad78c782e922", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers \\(a,b,c\\) prove that \n-- \\[\n-- \\frac{a^{2}}{b+c}+\\frac{b^{2}}{c+a}+\\frac{c^{2}}{a+b}\\;\\ge\\;\\frac{3}{2}\\cdot\\frac{a^{3}+b^{3}+c^{3}}{a^{2}+b^{2}+c^{2}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the positive-real inequality\n\nFor positive real numbers `a`, `b`, and `c`, the left-hand side\n`a^2 / (b + c) + b^2 / (c + a) + c^2 / (a + b)` is at least\n`(3 / 2) * (a^3 + b^3 + c^3) / (a^2 + b^2 + c^2)`.\n\nThis file records the statement only; it does not assert a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality, as a real-valued expression. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n a ^ 2 / (b + c) + b ^ 2 / (c + a) + c ^ 2 / (a + b)\n\n/-- The right-hand side of the target inequality, as a real-valued expression. -/\nnoncomputable def RightHandSide (a b c : ℝ) : ℝ :=\n (3 / 2 : ℝ) * ((a ^ 3 + b ^ 3 + c ^ 3) / (a ^ 2 + b ^ 2 + c ^ 2))\n\n/-- The hypothesis that all three real numbers are positive. -/\ndef PositiveReals (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The inequality to be proved for a fixed triple `(a, b, c)`. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n LeftHandSide a b c ≥ RightHandSide a b c\n\n/-- The full universal statement: for every triple of positive real numbers,\nthe stated inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, PositiveReals a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7d047826-9a18-56d6-932d-ad78c782e922", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0ec8886a8ab03a8976579130be269341ef52c5cde283f83ac19f18587ae78a60", "task_path": "tasks/nmp3_7d047826-9a18-56d6-932d-ad78c782e922", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7d047826-9a18-56d6-932d-ad78c782e922", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7d084b99-996f-5f33-9209-e5b8889aafdc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ and define \n-- $$x = a + \\frac{1}{b},\\qquad y = b + \\frac{1}{c},\\qquad z = c + \\frac{1}{a}.$$ \n-- Prove that \n-- $$xy + yz + zx \\;\\ge\\; 2\\,(x + y + z).$$\n/-\n Formal statement of the problem from `problem.md`.\n\n The source states an inequality for positive real parameters `a`, `b`, `c`\n and the derived quantities `x`, `y`, `z`. The target below records the\n universally quantified implication without asserting or proving it.\n-/\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The problem's quantity `x`, defined by `x = a + 1 / b`. -/\nnoncomputable def x (a b : ℝ) : ℝ :=\n a + 1 / b\n\n/-- The problem's quantity `y`, defined by `y = b + 1 / c`. -/\nnoncomputable def y (b c : ℝ) : ℝ :=\n b + 1 / c\n\n/-- The problem's quantity `z`, defined by `z = c + 1 / a`. -/\nnoncomputable def z (c a : ℝ) : ℝ :=\n c + 1 / a\n\n/--\n For all positive real `a`, `b`, `c`, with `x`, `y`, `z` as in the problem,\n one has `x * y + y * z + z * x ≥ 2 * (x + y + z)`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n x a b * y b c + y b c * z c a + z c a * x a b ≥\n 2 * (x a b + y b c + z c a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7d084b99-996f-5f33-9209-e5b8889aafdc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7d1ab135589aa9b799f14487a7a5cea967d40f7ca43d2884581c21b7796fc3b5", "task_path": "tasks/nmp3_7d084b99-996f-5f33-9209-e5b8889aafdc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7d084b99-996f-5f33-9209-e5b8889aafdc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7d264ee6-cb8b-59a6-a1fd-344f9240a05b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- \\[\n-- \\frac{(4x+5y)(x-y)}{y(y+8x)}+\\frac{(4y+5z)(y-z)}{z(z+8y)}+\\frac{(4z+5x)(z-x)}{x(x+8z)}\\ge 0.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The cyclic sum appearing on the left-hand side of the inequality. -/\nnoncomputable def LHS (x y z : ℝ) : ℝ :=\n ((4 * x + 5 * y) * (x - y)) / (y * (y + 8 * x)) +\n ((4 * y + 5 * z) * (y - z)) / (z * (z + 8 * y)) +\n ((4 * z + 5 * x) * (z - x)) / (x * (x + 8 * z))\n\n/-- For every triple of positive real numbers, the cyclic sum is nonnegative. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → 0 ≤ LHS x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7d264ee6-cb8b-59a6-a1fd-344f9240a05b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b32220a04cff30b1ed1ade2d6bbf3cace45ff515c30735ccebce1ef9ccc32728", "task_path": "tasks/nmp3_7d264ee6-cb8b-59a6-a1fd-344f9240a05b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7d264ee6-cb8b-59a6-a1fd-344f9240a05b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7d292cf3-fb51-5b44-8004-bdc82feea6b5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all real numbers \\(a,b,c\\),\n-- \\[\n-- a^{2}(a-b)(a-2b)+b^{2}(b-c)(b-2c)+c^{2}(c-a)(c-2a)\\ge 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable real inequality\n\nThe source problem asks to prove, for every triple of real numbers `a`, `b`, and\n`c`, that the cyclic sum below is nonnegative.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved:\n\nFor all real numbers `a`, `b`, and `c`,\n`a ^ 2 * (a - b) * (a - 2 * b) +\n b ^ 2 * (b - c) * (b - 2 * c) +\n c ^ 2 * (c - a) * (c - 2 * a) ≥ 0`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n a ^ 2 * (a - b) * (a - 2 * b) +\n b ^ 2 * (b - c) * (b - 2 * c) +\n c ^ 2 * (c - a) * (c - 2 * a) ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7d292cf3-fb51-5b44-8004-bdc82feea6b5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4afc821a8822aa8e96089c651171535de237a9511d33395e1f9228372e7a9de8", "task_path": "tasks/nmp3_7d292cf3-fb51-5b44-8004-bdc82feea6b5", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7d292cf3-fb51-5b44-8004-bdc82feea6b5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7d40e906-a9ba-5ae5-88fe-a5af32000aba", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c>0$, prove that \n-- \\[\n-- \\left(\\frac{a+b}{c}+\\frac{b+c}{a}+\\frac{c+a}{b}\\right)\n-- \\left(\\frac{ab}{b^{2}+c^{2}}+\\frac{bc}{c^{2}+a^{2}}+\\frac{ca}{a^{2}+b^{2}}\\right)\\ge 9\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Statement formalization\n\nThe source problem asks to prove an inequality for three positive real numbers.\nThis file records the precise target proposition and its constituent expressions.\nNo proof of the target is supplied here.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The first parenthesized factor in the problem:\n`(a + b) / c + (b + c) / a + (c + a) / b`. -/\ndef firstFactor (a b c : ℝ) : ℝ :=\n (a + b) / c + (b + c) / a + (c + a) / b\n\n/-- The second parenthesized factor in the problem:\n`a * b / (b ^ 2 + c ^ 2) + b * c / (c ^ 2 + a ^ 2) +\n c * a / (a ^ 2 + b ^ 2)`. -/\ndef secondFactor (a b c : ℝ) : ℝ :=\n a * b / (b ^ 2 + c ^ 2) +\n b * c / (c ^ 2 + a ^ 2) +\n c * a / (a ^ 2 + b ^ 2)\n\n/-- The product on the left-hand side of the asserted inequality. -/\ndef leftHandSide (a b c : ℝ) : ℝ :=\n firstFactor a b c * secondFactor a b c\n\n/-- The admissibility condition imposed on the three variables in the source. -/\ndef Admissible (a b c : ℝ) : Prop :=\n a > 0 ∧ b > 0 ∧ c > 0\n\n/-- The inequality asserted for a fixed triple of admissible real numbers. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n leftHandSide a b c ≥ 9\n\n/-- The complete statement to be proved: for every triple of positive real\nnumbers, the product of the two displayed factors is at least `9`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → InequalityHolds a b c\n\n\nend\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7d40e906-a9ba-5ae5-88fe-a5af32000aba", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e7d2a77de1116c26e39cae88ee7965086d1cbd970b8662f75a524cd67a4fc817", "task_path": "tasks/nmp3_7d40e906-a9ba-5ae5-88fe-a5af32000aba", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7d40e906-a9ba-5ae5-88fe-a5af32000aba", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7d64ddbd-e222-5a40-bf58-af6678e4f9c1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $00$ with $a+b+c=3$. Prove that \n-- \\[\n-- 2\\bigl(a^{4}+b^{4}+c^{4}\\bigr)+\\frac{4ab}{(a+b)^{2}}+\\frac{4bc}{(b+c)^{2}}+\\frac{4ca}{(c+a)^{2}}\n-- \\;\\ge\\;3\\bigl(a^{2}+b^{2}+c^{2}\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a cyclic symmetric inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose sum is `3`:\n\n`2 (a^4 + b^4 + c^4) + 4ab/(a+b)^2 + 4bc/(b+c)^2 + 4ca/(c+a)^2\n ≥ 3 (a^2 + b^2 + c^2)`.\n\nThe assertion is packaged as a proposition-valued definition. No proof of the\nassertion is supplied here.\n-/\n\nnamespace Problem\n\n/-- The inequality requested by the problem, universally quantified over the\npositive real variables satisfying the stated sum constraint. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 3 →\n 2 * (a ^ 4 + b ^ 4 + c ^ 4)\n + 4 * a * b / (a + b) ^ 2\n + 4 * b * c / (b + c) ^ 2\n + 4 * c * a / (c + a) ^ 2\n ≥ 3 * (a ^ 2 + b ^ 2 + c ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7ddd46fb-2392-5c65-998f-e3e86b49e6e7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d58e1db08bb76a97b6de4292cb1af0261bd7f4febe9e6a1efc9ce28302b760d8", "task_path": "tasks/nmp3_7ddd46fb-2392-5c65-998f-e3e86b49e6e7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7ddd46fb-2392-5c65-998f-e3e86b49e6e7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7de24947-58ec-565a-837a-374e12e89927", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k,n>1$ be integers. Let $\\mathbb N$ denote the set of positive integers and let $A_1,A_2,\\dots ,A_k\\subset\\mathbb N$ be pairwise disjoint subsets whose union is $\\mathbb N$ (i.e., $\\{A_i\\}$ is a partition of $\\mathbb N$). Prove that there exists an index $i\\in\\{1,2,\\dots ,k\\}$ such that there are infinitely many irreducible (non‑factorable over $\\mathbb Z$, equivalently over $\\mathbb Q$) polynomials of degree $n$ whose $n+1$ coefficients are all distinct positive integers belonging to $A_i$.\nimport Mathlib\n\n/-!\n# Formalization of the partition problem for irreducible polynomials\n\nThe problem uses the positive integers as the ambient set. We model them by the\nsubtype `Problem.PositiveInt` of natural numbers. Polynomials are considered\nover `ℤ`, with non-factorability stated explicitly.\n\nWe formalize *non-factorable* in the usual polynomial sense: a polynomial is\nnot the product of two polynomials of positive degree. This is the reading\nconsistent with the phrase \"non-factorable over `ℤ`, equivalently over `ℚ`\":\nconstant content factors do not count as factorizations. The predicate\n`Problem.NonfactorableOverRat` records the corresponding condition after\nmapping coefficients to `ℚ`.\n-/\n\nnamespace Problem\n\n/-- The positive integers, as a subtype of `ℕ`. -/\nabbrev PositiveInt : Type := {m : ℕ // 0 < m}\n\n/-- Every coefficient of `p` in degrees `0, ..., n` is an element of `A`\n(transported to an integer coefficient). -/\ndef CoefficientsInSet (p : Polynomial ℤ) (n : ℕ) (A : Set PositiveInt) : Prop :=\n ∀ j : Fin (n + 1), ∃ a : PositiveInt, a ∈ A ∧ p.coeff (j : ℕ) = ((a : ℕ) : ℤ)\n\n/-- The `n + 1` coefficients of `p` in degrees `0, ..., n` are pairwise distinct. -/\ndef CoefficientsDistinct (p : Polynomial ℤ) (n : ℕ) : Prop :=\n Function.Injective fun j : Fin (n + 1) => p.coeff (j : ℕ)\n\n/-- `p` cannot be written as a product of two positive-degree integer polynomials. -/\ndef NonfactorableOverInt (p : Polynomial ℤ) : Prop :=\n ¬ ∃ q r : Polynomial ℤ,\n 0 < q.natDegree ∧ 0 < r.natDegree ∧ p = q * r\n\n/-- The image of `p` in `ℚ[X]` cannot be written as a product of two\npositive-degree rational polynomials. -/\ndef NonfactorableOverRat (p : Polynomial ℤ) : Prop :=\n ¬ ∃ q r : Polynomial ℚ,\n 0 < q.natDegree ∧ 0 < r.natDegree ∧\n p.map (Int.castRingHom ℚ) = q * r\n\n/-- The non-factorability condition used in the statement, recorded over both\n`ℤ` and `ℚ` to reflect the parenthetical equivalence in the problem. -/\ndef IrreduciblePolynomial (p : Polynomial ℤ) : Prop :=\n NonfactorableOverInt p ∧ NonfactorableOverRat p\n\n/-- Admissibility of a polynomial for the conclusion of the problem: it has\ndegree `n`, its `n + 1` coefficients are pairwise distinct elements of `A`,\nand it is non-factorable both over `ℤ` and over `ℚ`. -/\ndef IsAdmissiblePolynomial (n : ℕ) (A : Set PositiveInt) (p : Polynomial ℤ) : Prop :=\n p.natDegree = n ∧\n CoefficientsDistinct p n ∧\n CoefficientsInSet p n A ∧\n IrreduciblePolynomial p\n\n/-- The set of all polynomials admissible for a fixed degree `n` and cell `A`. -/\ndef AdmissiblePolynomials (n : ℕ) (A : Set PositiveInt) : Set (Polynomial ℤ) :=\n {p : Polynomial ℤ | IsAdmissiblePolynomial n A p}\n\n/-- The hypothesis that the indexed family `A` is a pairwise disjoint cover of\nthe positive integers. -/\ndef IsPartition {k : ℕ} (A : Fin k → Set PositiveInt) : Prop :=\n (∀ i j : Fin k, i ≠ j → Disjoint (A i) (A j)) ∧\n (⋃ i : Fin k, A i) = Set.univ\n\n/-- **Target statement.** For integers `k, n > 1` and any pairwise disjoint\ncover `A_1, ..., A_k` of the positive integers, some cell `A_i` contains the\ncoefficients of infinitely many degree-`n` polynomials that are non-factorable\nover `ℤ` and `ℚ` and whose `n + 1` coefficients are pairwise distinct. -/\ndef Target : Prop :=\n ∀ (k n : ℕ), 1 < k → 1 < n →\n ∀ A : Fin k → Set PositiveInt,\n IsPartition A →\n ∃ i : Fin k, Set.Infinite (AdmissiblePolynomials n (A i))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7de24947-58ec-565a-837a-374e12e89927", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a2d42bef2218c11b1d56d2a365d696dac31de3301cb9f30b5fc7cab8aa2dbc72", "task_path": "tasks/nmp3_7de24947-58ec-565a-837a-374e12e89927", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7de24947-58ec-565a-837a-374e12e89927", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7e3d47f5-5ee4-574e-99ab-08db46e81a24", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any integer $n$ such that $10\\nmid n$, prove that there exist infinitely many positive multiples of $n$ whose decimal representation contains no digit $0$.\nimport Mathlib.Data.Nat.Digits.Defs\nimport Mathlib.Data.Set.Finite.Basic\n\n/-!\n# Formal statement: infinitely many zero-free multiples\n\nThis file states the problem of finding infinitely many positive multiples of an\ninteger `n` (with `10 ∤ n`) whose decimal expansion contains no digit `0`.\nThe target is only a proposition; it is not proved here.\n-/\n\nnamespace Problem\n\n/-- A decimal expansion of a nonzero integer has no digit `0` when no entry of its\ncanonical base-10 digit list for the absolute value is zero. -/\ndef HasNoZeroDigit (z : ℤ) : Prop :=\n ∀ d : ℕ, d ∈ Nat.digits 10 z.natAbs → d ≠ 0\n\n/-- The hypothesis on `n` in the problem: `10` does not divide `n`. -/\ndef Admissible (n : ℤ) : Prop :=\n ¬ (10 : ℤ) ∣ n\n\n/-- An integer `z` is a positive multiple of `n` with no zero digit in its decimal\nexpansion. -/\ndef IsPositiveMultipleWithoutZeroDigit (n z : ℤ) : Prop :=\n 0 < z ∧ n ∣ z ∧ HasNoZeroDigit z\n\n/-- For every integer `n` not divisible by `10`, the set of positive multiples of\n`n` whose decimal representation contains no digit `0` is infinite. -/\ndef Target : Prop :=\n ∀ n : ℤ, Admissible n →\n {z : ℤ | IsPositiveMultipleWithoutZeroDigit n z}.Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7e3d47f5-5ee4-574e-99ab-08db46e81a24", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7fdeb8ecb9b3900316877c8736011ac0777548706c8e46502e1e36807c6e7c20", "task_path": "tasks/nmp3_7e3d47f5-5ee4-574e-99ab-08db46e81a24", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7e3d47f5-5ee4-574e-99ab-08db46e81a24", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7e471fb0-adf7-58e8-adb3-60e0f1fa9448", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $A$, $B$, $C$ are the interior angles of a triangle ($A,B,C>0$, $A+B+C=\\pi$), prove that \n-- \\[\n-- \\cos^{3}A+\\cos^{3}B+\\cos^{3}C+5\\cos A\\cos B\\cos C\\le 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the triangle-angle cosine inequality\n\nThe problem asks, for the interior angles `A`, `B`, and `C` of a triangle\n(characterized by `A, B, C > 0` and `A + B + C = π`), to prove\n\n`cos A ^ 3 + cos B ^ 3 + cos C ^ 3 + 5 * cos A * cos B * cos C ≤ 1`.\n\nThis file records the proposition as a `Prop`-valued definition. No proof of\nthe proposition is supplied.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The real numbers `A`, `B`, and `C` are the interior angles of a triangle:\neach is strictly positive and their sum is `π`. -/\ndef InteriorTriangleAngles (A B C : ℝ) : Prop :=\n 0 < A ∧ 0 < B ∧ 0 < C ∧ A + B + C = Real.pi\n\n/-- The cosine inequality appearing as the conclusion of the problem. -/\ndef TriangleCosineInequality (A B C : ℝ) : Prop :=\n Real.cos A ^ 3 + Real.cos B ^ 3 + Real.cos C ^ 3\n + 5 * Real.cos A * Real.cos B * Real.cos C ≤ 1\n\n/-- The assertion to be proved: for every triple of interior angles of a\ntriangle, the stated cosine inequality holds. -/\ndef Target : Prop :=\n ∀ A B C : ℝ,\n InteriorTriangleAngles A B C → TriangleCosineInequality A B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7e471fb0-adf7-58e8-adb3-60e0f1fa9448", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9c44c671808cccbc7d28cee352816aa88d366ee0fe6dd631e2cbd1e8150da98a", "task_path": "tasks/nmp3_7e471fb0-adf7-58e8-adb3-60e0f1fa9448", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7e471fb0-adf7-58e8-adb3-60e0f1fa9448", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7e53a945-ca7f-5208-821f-9c8ad6113fb2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge k$ be positive integers and let $\\mathcal{F}$ be a family of finite sets satisfying:\n-- (i) $\\mathcal{F}$ contains at least $\\binom{n}{k}+1$ distinct sets each of size exactly $k$;\n-- (ii) for any $A,B\\in\\mathcal{F}$ the union $A\\cup B$ also belongs to $\\mathcal{F}$.\n-- Prove that $\\mathcal{F}$ contains at least three distinct sets each having at least $n$ elements.\nimport Mathlib\n\nuniverse u\n\nnamespace Problem\n\n/--\nA family of finite sets over an ambient type `α`: every member of `F` is a\nfinite subset of `α`. The family `F` itself is an arbitrary collection (it is\nnot assumed to be finite).\n-/\ndef IsFamilyOfFiniteSets {α : Type u} (F : Set (Set α)) : Prop :=\n ∀ A : Set α, A ∈ F → A.Finite\n\n/--\nCondition (i): `F` contains at least `Nat.choose n k + 1` distinct sets of\ncardinality exactly `k`. The finite subfamily `G` records the distinct\nwitnessing sets and its `Finset.card` is at least the required binomial\nthreshold.\n-/\ndef HasAtLeastKMembers {α : Type u} (n k : ℕ) (F : Set (Set α)) : Prop :=\n ∃ G : Finset (Set α),\n (∀ A : Set α, A ∈ G → A ∈ F ∧ A.Finite ∧ A.ncard = k) ∧\n Nat.choose n k + 1 ≤ G.card\n\n/--\nCondition (ii): `F` is closed under pairwise union. The statement includes\nthe case `A = B`.\n-/\ndef IsUnionClosed {α : Type u} (F : Set (Set α)) : Prop :=\n ∀ A : Set α, A ∈ F → ∀ B : Set α, B ∈ F → A ∪ B ∈ F\n\n/--\nThe conclusion: `F` contains at least three distinct finite members, each of\ncardinality at least `n`.\n-/\ndef HasAtLeastThreeLargeMembers {α : Type u} (n : ℕ) (F : Set (Set α)) : Prop :=\n ∃ A : Set α,\n A ∈ F ∧ A.Finite ∧ n ≤ A.ncard ∧\n ∃ B : Set α,\n B ∈ F ∧ B.Finite ∧ n ≤ B.ncard ∧\n ∃ C : Set α,\n C ∈ F ∧ C.Finite ∧ n ≤ C.ncard ∧\n A ≠ B ∧ A ≠ C ∧ B ≠ C\n\n/--\nThe complete formal statement of the problem: for all positive integers\n`n` and `k` with `k ≤ n`, every union-closed family of finite sets containing\nat least `Nat.choose n k + 1` distinct sets of size `k` has at least three\ndistinct members of size at least `n`.\n-/\ndef Target : Prop :=\n ∀ {α : Type u}, ∀ (n k : ℕ), ∀ (F : Set (Set α)),\n 0 < n →\n 0 < k →\n k ≤ n →\n IsFamilyOfFiniteSets F →\n HasAtLeastKMembers n k F →\n IsUnionClosed F →\n HasAtLeastThreeLargeMembers n F\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7e53a945-ca7f-5208-821f-9c8ad6113fb2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f7b0bea3d47db2674e196926d71fb9ac973a4af948d9aff50638a404bc0563e6", "task_path": "tasks/nmp3_7e53a945-ca7f-5208-821f-9c8ad6113fb2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7e53a945-ca7f-5208-821f-9c8ad6113fb2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7e70fc31-d915-57b7-a726-fb3172038ff2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Determine all functions \\(f:\\mathbb{Z}\\to\\mathbb{Z}\\) such that for every pair of integers \\(a,b\\) the identity\n-- \\[\n-- f(a^2-ab+b^2)=f(a)\\,f(b)\n-- \\]\n-- holds.\nimport Mathlib\n\n/-!\n# Functional equation on the Eisenstein norm\n\nThe source problem asks for all functions `f : ℤ → ℤ` satisfying\n`f (a^2 - a*b + b^2) = f a * f b` for every pair of integers `a`, `b`.\n\nThis file records the exact admissibility condition and a complete-answer\npredicate for a proposed set of functions. It also gives the explicit\nproposed answer set obtained from the classification; no proof of correctness\nis asserted here.\n-/\n\nnamespace Problem\n\n/-- The integer-valued Eisenstein norm appearing in the functional equation. -/\ndef normForm (a b : ℤ) : ℤ :=\n a ^ 2 - a * b + b ^ 2\n\n/-- A function is admissible when it satisfies the functional equation for\nevery pair of integers. -/\ndef IsAdmissible (f : ℤ → ℤ) : Prop :=\n ∀ (a b : ℤ), f (Problem.normForm a b) = f a * f b\n\n/-- A natural number that may occur as the modulus of the support of a\nclassified nonzero solution. Besides the zero modulus (support `{0}`), this\nrequires the modulus to be squarefree and all of its prime divisors to be\n`2 mod 3`. This includes `1`, whose associated indicator is the constant-one\nfunction. -/\ndef IsAllowedModulus (n : ℕ) : Prop :=\n n = 0 ∨ (Squarefree n ∧ ∀ p : ℕ, Nat.Prime p → p ∣ n → p % 3 = 2)\n\n/-- The indicator function of the integer multiples of `n`. With `n = 0`,\n`0 ∣ x` means `x = 0`, so this is the indicator of `{0}`. -/\ndef multipleIndicator (n : ℕ) (x : ℤ) : ℤ :=\n if (n : ℤ) ∣ x then 1 else 0\n\n/-- The explicit proposed classification: either the identically zero\nfunction, or the indicator of the integer multiples of an allowed modulus. -/\ndef IsClassifiedSolution (f : ℤ → ℤ) : Prop :=\n (∀ x : ℤ, f x = 0) ∨\n ∃ n : ℕ, Problem.IsAllowedModulus n ∧ ∀ x : ℤ, f x = Problem.multipleIndicator n x\n\n/-- The proposed complete answer, as a set of functions. This is deliberately\ndefined from the explicit classification predicate above, rather than from\n`IsAdmissible`. -/\ndef ProposedAnswerSet : Set (ℤ → ℤ) :=\n {f : ℤ → ℤ | Problem.IsClassifiedSolution f}\n\n/-- Soundness of a proposed answer set: every function it lists is admissible. -/\ndef AnswerSound (answer : Set (ℤ → ℤ)) : Prop :=\n ∀ f : ℤ → ℤ, f ∈ answer → Problem.IsAdmissible f\n\n/-- Completeness of a proposed answer set: every admissible function is listed. -/\ndef AnswerComplete (answer : Set (ℤ → ℤ)) : Prop :=\n ∀ f : ℤ → ℤ, Problem.IsAdmissible f → f ∈ answer\n\n/-- A proposed answer set is correct when it is both sound and complete for\nthe original admissibility condition. These are the two directions of the\n\"find all\" classification. -/\ndef AnswerCorrect (answer : Set (ℤ → ℤ)) : Prop :=\n Problem.AnswerSound answer ∧ Problem.AnswerComplete answer\n\n/-- The closed statement that the explicit proposed set is exactly the set of\nall admissible functions. -/\ndef Target : Prop :=\n Problem.AnswerCorrect Problem.ProposedAnswerSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7e70fc31-d915-57b7-a726-fb3172038ff2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "46d3f467e59d75a712969255ee30ef50a0e2607dd7c8207976fc70588aa898d2", "task_path": "tasks/nmp3_7e70fc31-d915-57b7-a726-fb3172038ff2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7e70fc31-d915-57b7-a726-fb3172038ff2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7ea4eb25-463e-5ce1-bdf7-587926537f4a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a+b+c=\\frac1a+\\frac1b+\\frac1c$. Prove that \n-- \\[\n-- abc+ab+ac+bc\\ge 4.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The admissibility condition of the problem: `a`, `b`, and `c` are positive\nreal numbers and satisfy `a + b + c = 1/a + 1/b + 1/c`. -/\ndef IsAdmissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b + c = (1 : ℝ) / a + (1 : ℝ) / b + (1 : ℝ) / c\n\n/-- The inequality asserted by the problem: `abc + ab + ac + bc ≥ 4`. -/\ndef Claim (a b c : ℝ) : Prop :=\n a * b * c + a * b + a * c + b * c ≥ (4 : ℝ)\n\n/-- The full universal assertion: for every triple of positive real numbers\nsatisfying the reciprocal-sum condition, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsAdmissible a b c → Claim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7ea4eb25-463e-5ce1-bdf7-587926537f4a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cc9f712067636eae49af01ea54c4ddbe83eb976cc4ae2c0a5dd72ac811d4170c", "task_path": "tasks/nmp3_7ea4eb25-463e-5ce1-bdf7-587926537f4a", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7ea4eb25-463e-5ce1-bdf7-587926537f4a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7ecab81b-0a61-5213-bdb3-91d768f9ae54", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For a permutation $\\sigma\\in S_n$ with $(1,2,\\dots ,n)\\mapsto(i_1,i_2,\\dots ,i_n)$, define \n-- \\[\n-- D(\\sigma)=\\sum_{k=1}^{n}\\bigl|\\,i_k-k\\,\\bigr|.\n-- \\] \n-- Let \n-- \\[\n-- Q(n,d)=\\Bigl|\\{\\sigma\\in S_n\\mid D(\\sigma)=d\\}\\Bigr|.\n-- \\] \n-- Show that $Q(n,d)$ is an even number for every integer $d\\ge 2n$ (with $n\\ge1$).\nimport Mathlib\n\n/-!\n# Formal statement for the parity of displacement-counts of permutations\n\nThe problem is stated in one-line notation for permutations of `{1, ..., n}`.\nWe use `Equiv.Perm (Fin n)` for `S_n`; this is the same permutation group\nafter relabelling `j` as `j - 1`. Both coordinates of every displacement\nare shifted by the same amount, so the absolute displacement is unchanged.\n-/\n\nnamespace Problem\n\nopen scoped BigOperators\n\n/-- The displacement `D(σ) = ∑_{k=1}^n |i_k - k|`, where `i_k` is the image\nof `k` under the permutation `σ`.\n\nThe type `Fin n` is zero-indexed. This is the standard relabelling of\n`{1, ..., n}` by `{0, ..., n-1}`; the formulas for the summands are unchanged\nbecause `(i_k - 1) - (k - 1) = i_k - k`. -/\ndef D (n : ℕ) (σ : Equiv.Perm (Fin n)) : ℤ :=\n ∑ k : Fin n, |(((σ k : Fin n) : ℕ) : ℤ) - (((k : Fin n) : ℕ) : ℤ)|\n\n/-- `Q(n,d)` is the number of permutations of `Fin n` whose displacement is\nthe integer `d`. -/\ndef Q (n : ℕ) (d : ℤ) : ℕ :=\n Fintype.card {σ : Equiv.Perm (Fin n) // D n σ = d}\n\n/-- The assertion of the problem: for every `n ≥ 1` and every integer\n`d ≥ 2n`, the number `Q(n,d)` is even. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 1 ≤ n → ∀ d : ℤ, 2 * (n : ℤ) ≤ d → Even (Q n d)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7ecab81b-0a61-5213-bdb3-91d768f9ae54", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c3b3c54b9e7deae688a6017b18904815cd12561fac29c76ef7a90ea00d7e867f", "task_path": "tasks/nmp3_7ecab81b-0a61-5213-bdb3-91d768f9ae54", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7ecab81b-0a61-5213-bdb3-91d768f9ae54", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7ee3d9e0-d2bd-54f9-aaba-2ec311e2da69", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- \\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}+\\frac12\\sum_{\\text{cyc}}\\frac{ab}{a^{2}+b^{2}}\\ge\\frac74\\,,\n-- \\] \n-- where \\(\\displaystyle\\sum_{\\text{cyc}}ab/(a^{2}+b^{2})=\\frac{ab}{a^{2}+b^{2}}+\\frac{bc}{b^{2}+c^{2}}+\\frac{ca}{c^{2}+a^{2}}\\).\nimport Mathlib\n\n/-!\n# Formal statement: a cyclic inequality in three positive reals\n\nThe source problem asks to prove, for all strictly positive real numbers `a`, `b`,\nand `c`, the inequality\n\n`(a^2 + b^2 + c^2) / (ab + bc + ca) + 1/2 * (ab/(a^2+b^2)\n + bc/(b^2+c^2) + ca/(c^2+a^2)) >= 7/4`.\n\nThe declaration `Problem.Target` records exactly this universal proposition. It is\na proposition-valued definition, not a proof.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real `a`, `b`, and `c`, the\ndisplayed cyclic inequality holds. The cyclic sum is written out explicitly in\nthe order `ab`, `bc`, `ca`, as specified in the source. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a)\n + (1 / 2 : ℝ) *\n (a * b / (a ^ 2 + b ^ 2)\n + b * c / (b ^ 2 + c ^ 2)\n + c * a / (c ^ 2 + a ^ 2))\n ≥ (7 / 4 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7ee3d9e0-d2bd-54f9-aaba-2ec311e2da69", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "52cc6ba21ddd610af8598a62b876d8057b03a33eb9b2814f942c795b06acd8ef", "task_path": "tasks/nmp3_7ee3d9e0-d2bd-54f9-aaba-2ec311e2da69", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7ee3d9e0-d2bd-54f9-aaba-2ec311e2da69", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7f2167dd-8fa0-5e0d-9160-d08f98a8e4be", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- We are given six points in Euclidean space such that all fifteen pairwise distances are distinct and no three points are collinear. Among the $\\binom{6}{3}=20$ triangles formed by these points, prove that there exist two distinct triangles $T_1$ and $T_2$ such that the longest side of $T_1$ is the shortest side of $T_2$.\nimport Mathlib\n\nset_option autoImplicit false\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean space, of arbitrary finite dimension `n`. -/\nabbrev Point (n : ℕ) : Type := EuclideanSpace ℝ (Fin n)\n\n/-- The length of an unordered pair of points, encoded as an element of `Sym2`. -/\ndef SideLength {n : ℕ} (e : Sym2 (Point n)) : ℝ :=\n Sym2.lift ⟨fun a b : Point n => dist a b, by\n intro a b\n exact dist_comm a b⟩ e\n\n/-- The finite point set `S` consists of exactly six points. -/\ndef HasSixPoints {n : ℕ} (S : Finset (Point n)) : Prop :=\n S.card = 6\n\n/-- `T` is one of the triangles determined by a finite point set `S`: a\nthree-element subset of `S`. -/\ndef IsTriangleIn {n : ℕ} (S T : Finset (Point n)) : Prop :=\n T ⊆ S ∧ T.card = 3\n\n/-- `e` is a nondegenerate side of the finite set of points `T`. -/\ndef IsSideOf {n : ℕ} (T : Finset (Point n)) (e : Sym2 (Point n)) : Prop :=\n ∃ a b : Point n, a ≠ b ∧ a ∈ T ∧ b ∈ T ∧ e = Sym2.mk a b\n\n/-- `e` is a side of `T` and has maximal length among all sides of `T`. -/\ndef IsLongestSideOf {n : ℕ} (T : Finset (Point n)) (e : Sym2 (Point n)) : Prop :=\n IsSideOf T e ∧ ∀ f : Sym2 (Point n), IsSideOf T f → SideLength f ≤ SideLength e\n\n/-- `e` is a side of `T` and has minimal length among all sides of `T`. -/\ndef IsShortestSideOf {n : ℕ} (T : Finset (Point n)) (e : Sym2 (Point n)) : Prop :=\n IsSideOf T e ∧ ∀ f : Sym2 (Point n), IsSideOf T f → SideLength e ≤ SideLength f\n\n/-- All pairwise distances among the six points in `S` are distinct: the\nrestriction of side length to nondegenerate unordered pairs from `S` is\ninjective. -/\ndef PairwiseDistancesDistinct {n : ℕ} (S : Finset (Point n)) : Prop :=\n ∀ e f : Sym2 (Point n),\n IsSideOf S e → IsSideOf S f → SideLength e = SideLength f → e = f\n\n/-- No three distinct points of `S` are collinear. -/\ndef NoThreeCollinear {n : ℕ} (S : Finset (Point n)) : Prop :=\n ∀ a ∈ S, ∀ b ∈ S, ∀ c ∈ S,\n a ≠ b → a ≠ c → b ≠ c → ¬ Collinear ℝ ({a, b, c} : Set (Point n))\n\n/-- Among the twenty triangles determined by six points in Euclidean space, with\nall fifteen pairwise distances distinct and no three points collinear, there\nexist two distinct triangles whose longest and shortest sides (respectively)\nare the same side. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (S : Finset (Point n)),\n HasSixPoints S →\n PairwiseDistancesDistinct S →\n NoThreeCollinear S →\n ∃ T₁ T₂ : Finset (Point n),\n IsTriangleIn S T₁ ∧ IsTriangleIn S T₂ ∧ T₁ ≠ T₂ ∧\n ∃ e : Sym2 (Point n),\n IsLongestSideOf T₁ e ∧ IsShortestSideOf T₂ e\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7f2167dd-8fa0-5e0d-9160-d08f98a8e4be", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2ac3a62934415248ac0622ac8ee9352602c558737ec608544a0f93d6bcd9fa58", "task_path": "tasks/nmp3_7f2167dd-8fa0-5e0d-9160-d08f98a8e4be", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7f2167dd-8fa0-5e0d-9160-d08f98a8e4be", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7f414099-5520-5f31-835e-57bbcb4d8420", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $\\{a(n)\\}_{n=1}^{\\infty}$ is a sequence satisfying \n-- \n-- \\[\n-- a(1)=a(2)=1,\n-- \\qquad \n-- a(n)=a\\bigl(a(n-1)\\bigr)+a\\bigl(n-a(n-1)\\bigr)\\quad\\text{for all }n\\ge3.\n-- \\]\n-- \n-- Prove that for every integer $n\\ge1$,\n-- \\[\n-- a(2n)\\le 2\\,a(n).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a sequence inequality\n\nThis module records the statement of the problem and does not contain a proof.\nThe sequence is represented by a natural-number-valued function on natural\nindices. The source indexes the sequence from `1`; the total function on `ℕ`\nis the customary Lean representation, with the recurrence constrained only for\nindices `n ≥ 3`.\n-/\n\nnamespace Problem\n\n/-- The two prescribed initial values of the sequence. -/\ndef InitialValues (a : ℕ → ℕ) : Prop :=\n a 1 = 1 ∧ a 2 = 1\n\n/-- The recursive relation, required at every natural number `n ≥ 3`.\n\nThe arithmetic is natural-number arithmetic: `n - 1` and `n - a (n - 1)` use\nLean's total truncated subtraction on `ℕ`. -/\ndef Recurrence (a : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, 3 ≤ n →\n a n = a (a (n - 1)) + a (n - a (n - 1))\n\n/-- The admissibility predicate for sequences in the problem: both initial\nvalues are one, and the recurrence holds for every integer `n ≥ 3`. -/\ndef AdmissibleSequence (a : ℕ → ℕ) : Prop :=\n InitialValues a ∧ Recurrence a\n\n/-- The inequality asserted in the conclusion, together with its quantifier\nover all integers `n ≥ 1`. -/\ndef Claim (a : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, 1 ≤ n → a (2 * n) ≤ 2 * a n\n\n/-- The complete mathematical statement to be proved: every sequence of natural\nnumbers satisfying the initial conditions and the recurrence satisfies\n`a (2 * n) ≤ 2 * a n` for every integer `n ≥ 1`. -/\ndef Target : Prop :=\n ∀ a : ℕ → ℕ, AdmissibleSequence a → Claim a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7f414099-5520-5f31-835e-57bbcb4d8420", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "091bac4927425b902ad8d3fe412ce9b78eae6d0e9b1d67cbe18df359f71f4604", "task_path": "tasks/nmp3_7f414099-5520-5f31-835e-57bbcb4d8420", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7f414099-5520-5f31-835e-57bbcb4d8420", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7f48d425-cbd4-50c4-a154-54e573b07f42", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $x,y,z$, prove the double inequality \n-- \\[\n-- \\sum_{\\text{cyc}}\\sqrt{\\frac{x}{x+y}}\\;\\le\\;2\\sqrt{1+\\frac{xyz}{(x+y)(y+z)(z+x)}}\\;\\le\\;\\sum_{\\text{cyc}}\\sqrt{\\frac{x}{\\,y+z\\,}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\nFormal statement of the double inequality in `problem.md`.\n\nFor positive real numbers `x`, `y`, and `z`, the problem asserts\n\\[\n\\sum_{\\mathrm{cyc}}\\sqrt{\\frac{x}{x+y}}\n \\le 2\\sqrt{1+\\frac{xyz}{(x+y)(y+z)(z+x)}}\n \\le \\sum_{\\mathrm{cyc}}\\sqrt{\\frac{x}{y+z}}.\n\\]\n\nThe cyclic sums are unfolded with the cycle `x → y → z → x`.\n-/\n\nnamespace Problem\n\n/-- The left cyclic sum\n`sqrt (x / (x + y)) + sqrt (y / (y + z)) + sqrt (z / (z + x))`. -/\nnoncomputable def leftSide (x y z : ℝ) : ℝ :=\n Real.sqrt (x / (x + y)) +\n Real.sqrt (y / (y + z)) +\n Real.sqrt (z / (z + x))\n\n/-- The common middle expression\n`2 * sqrt (1 + x*y*z / ((x+y)*(y+z)*(z+x)))`. -/\nnoncomputable def middleSide (x y z : ℝ) : ℝ :=\n 2 * Real.sqrt (1 + (x * y * z) / ((x + y) * (y + z) * (z + x)))\n\n/-- The right cyclic sum\n`sqrt (x / (y + z)) + sqrt (y / (z + x)) + sqrt (z / (x + y))`. -/\nnoncomputable def rightSide (x y z : ℝ) : ℝ :=\n Real.sqrt (x / (y + z)) +\n Real.sqrt (y / (z + x)) +\n Real.sqrt (z / (x + y))\n\n/-- The left-hand inequality of the displayed double inequality. -/\ndef FirstInequality (x y z : ℝ) : Prop :=\n leftSide x y z ≤ middleSide x y z\n\n/-- The right-hand inequality of the displayed double inequality. -/\ndef SecondInequality (x y z : ℝ) : Prop :=\n middleSide x y z ≤ rightSide x y z\n\n/-- For fixed `x`, `y`, and `z`, the double inequality asserted in the problem,\nas the conjunction of its two adjacent inequalities. -/\ndef DoubleInequality (x y z : ℝ) : Prop :=\n FirstInequality x y z ∧ SecondInequality x y z\n\n/-- The full universally quantified assertion of `problem.md`: for all positive\nreal numbers `x`, `y`, and `z`, the stated double inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → DoubleInequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7f48d425-cbd4-50c4-a154-54e573b07f42", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "49699eb1520445021f92a655a1a452eba4097f0a8b5cf3482ebacae6081bcd20", "task_path": "tasks/nmp3_7f48d425-cbd4-50c4-a154-54e573b07f42", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7f48d425-cbd4-50c4-a154-54e573b07f42", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7f76cbe6-6034-5944-b70c-8736f5b50092", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f$ be a bijective function from $\\mathbb{N}=\\{0,1,2,3,\\ldots\\}$ to itself. Prove that there exist three integers $a performSwap s current) state\n\n/-- The total price of a finite sequence of swaps. -/\ndef totalSwapCost {n : ℕ} (swaps : List (Swap n)) : ℕ :=\n (swaps.map swapPrice).sum\n\n/-- The right-hand side of the claimed bound:\n`|a_1 - 1| + |a_2 - 2| + ... + |a_n - n|`. -/\ndef discrepancyCost {n : ℕ} (a : State n) : ℕ :=\n ∑ i : Fin n, labelDistance (a i) i\n\n/-- Petya can restore the initial state from `a` using swaps whose total price\nis at most `budget`. -/\ndef CanReturnWithin {n : ℕ} (a : State n) (budget : ℕ) : Prop :=\n ∃ swaps : List (Swap n),\n performSwaps swaps a = initialState ∧\n totalSwapCost swaps ≤ budget\n\n/-- The statement of the problem: for every number `n` of cells and every\npermutation produced by Vasya, Petya can restore every card to its original\ncell with cost at most the sum of the label-position discrepancies. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (a : State n),\n CanReturnWithin a (discrepancyCost a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7fcd5cfd-ba91-5929-85d8-f2e8049c2df7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "325778c04d74ba06c57baec0697f61062204b18277fd05888d50c009c8d59f30", "task_path": "tasks/nmp3_7fcd5cfd-ba91-5929-85d8-f2e8049c2df7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7fcd5cfd-ba91-5929-85d8-f2e8049c2df7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7fdf6a7a-9c4f-5403-a729-863cf2c3e443", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\tau(n)$ denote the number of positive divisors of $n$ and $\\sigma(n)$ denote the sum of the positive divisors of $n$. \n-- Suppose $a$ and $b$ are positive integers satisfying \n-- \\[\n-- \\sigma(a^{\\,n})\\mid\\sigma(b^{\\,n})\\qquad\\text{for all }n\\in\\mathbb N.\n-- \\] \n-- Prove that every prime divisor of $\\tau(a)$ also divides $\\tau(b)$; i.e. each prime factor of $\\tau(a)$ divides $\\tau(b)$.\nimport Mathlib.NumberTheory.ArithmeticFunction.Misc\n\n/-!\n# Formalization of the divisor-function problem\n\nThe source problem uses `τ n` for the number of positive divisors of `n` and\n`σ n` for the sum of the positive divisors of `n`. The main formal statement\nis `Problem.Target`, a proposition (not a proof).\n-/\n\nnamespace Problem\n\n/-- `tau n` is the number of positive divisors of the natural number `n`.\n\nFor `n = 0`, `Nat.divisors 0` is empty by Mathlib's convention. The statement\nonly uses `tau` at the positive integers `a` and `b`, so this convention is not\notherwise relevant. -/\ndef tau (n : ℕ) : ℕ := (Nat.divisors n).card\n\n/-- `sigma n` is the sum of the positive divisors of the natural number `n`.\n\nFor `n = 0`, `Nat.divisors 0` is empty by Mathlib's convention. The statement\nonly uses `sigma` at positive powers of positive integers. -/\ndef sigma (n : ℕ) : ℕ := ∑ d ∈ Nat.divisors n, d\n\n/-- The divisibility hypothesis of the problem: for every natural exponent `n`,\n`σ (a ^ n)` divides `σ (b ^ n)`. -/\ndef DivisorCondition (a b : ℕ) : Prop :=\n ∀ n : ℕ, sigma (a ^ n) ∣ sigma (b ^ n)\n\n/-- The conclusion of the problem: every prime divisor of `τ a` is a divisor\nof `τ b`. -/\ndef PrimeDivisorConclusion (a b : ℕ) : Prop :=\n ∀ p : ℕ, Nat.Prime p → p ∣ tau a → p ∣ tau b\n\n/-- The formalized statement of the problem: for all positive integers `a` and\n`b`, if `σ (a ^ n)` divides `σ (b ^ n)` for every natural number `n`, then\nevery prime divisor of `τ a` divides `τ b`. -/\ndef Target : Prop :=\n ∀ (a b : ℕ), 0 < a → 0 < b →\n DivisorCondition a b → PrimeDivisorConclusion a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7fdf6a7a-9c4f-5403-a729-863cf2c3e443", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "69a16986babef1ee05c7b1db7ef548136a40c5f773cdc3ac4b5a9e58a00f5d53", "task_path": "tasks/nmp3_7fdf6a7a-9c4f-5403-a729-863cf2c3e443", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7fdf6a7a-9c4f-5403-a729-863cf2c3e443", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7fe043e2-a2a7-52ec-ba1e-126f24403c38", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle inscribed in the circle $(O,R)$ and let $P$ be any point in its plane. Prove that \n-- \\[\n-- \\frac{PB\\cdot PC}{\\sin A}+\\frac{PC\\cdot PA}{\\sin B}+\\frac{PA\\cdot PB}{\\sin C}\\ge 2\\sqrt{3}\\,|OP^{2}-R^{2}|.\n-- \\]\nimport Mathlib.Geometry.Euclidean.Triangle\n\n/-!\n# Formal statement of the triangle circumcircle power inequality\n\nThe original problem is:\n\nLet `ABC` be a triangle inscribed in the circle `(O, R)` and let `P` be any\npoint in its plane. Prove that\n\n`PB * PC / sin A + PC * PA / sin B + PA * PB / sin C\n ≥ 2 * sqrt 3 * |OP^2 - R^2|`.\n\nAll distances below are Euclidean distances. The angle `A` is the angle\n`∠BAC` at vertex `A`, and similarly for `B` and `C`.\n-/\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the formalization. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Three plane points form a genuine (nondegenerate) triangle exactly when\nthey are not collinear. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- A point lies on the circle with centre `O` and radius `R`. -/\ndef OnCircle (O : Plane) (R : ℝ) (X : Plane) : Prop :=\n dist X O = R\n\n/-- The hypotheses that `A`, `B`, and `C` are the vertices of a nondegenerate\ntriangle inscribed in the circle with centre `O` and radius `R`. -/\ndef InscribedTriangle (A B C O : Plane) (R : ℝ) : Prop :=\n 0 < R ∧ IsTriangle A B C ∧\n OnCircle O R A ∧ OnCircle O R B ∧ OnCircle O R C\n\n/-- The left-hand side of the asserted inequality. -/\ndef LHS (A B C P : Plane) : ℝ :=\n dist P B * dist P C / Real.sin (∠ B A C) +\n dist P C * dist P A / Real.sin (∠ C B A) +\n dist P A * dist P B / Real.sin (∠ A C B)\n\n/-- The right-hand side of the inequality, including the absolute value. -/\ndef RHS (O P : Plane) (R : ℝ) : ℝ :=\n 2 * Real.sqrt 3 * |(dist O P) ^ 2 - R ^ 2|\n\n/-- The assertion of the original problem: for every triangle `ABC` inscribed\nin the circle `(O, R)` and every point `P` of the plane, the displayed\ninequality holds. -/\ndef Target : Prop :=\n ∀ (A B C O : Plane) (R : ℝ) (P : Plane),\n InscribedTriangle A B C O R → LHS A B C P ≥ RHS O P R\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7fe043e2-a2a7-52ec-ba1e-126f24403c38", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c3028493978fde17878073fc339d48f4ee03ff585e036abe7522a33e369ac0e5", "task_path": "tasks/nmp3_7fe043e2-a2a7-52ec-ba1e-126f24403c38", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7fe043e2-a2a7-52ec-ba1e-126f24403c38", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_7fffd8d9-def0-5796-9603-93060d7ae7f7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a}{a^{2}+bc}+\\frac{b}{b^{2}+ac}+\\frac{c}{c^{2}+ab}\\ge \\frac{3}{a+b+c}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side sum appearing in the problem. -/\ndef LHS (a b c : ℝ) : ℝ :=\n a / (a ^ 2 + b * c) + b / (b ^ 2 + a * c) + c / (c ^ 2 + a * b)\n\n/-- The inequality asserted in the problem, for arbitrary real `a`, `b`, `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ 3 / (a + b + c)\n\n/-- The full target: for all positive real `a`, `b`, `c`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7fffd8d9-def0-5796-9603-93060d7ae7f7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1c099d3e674b283d9d742f31db410d061a38c88b286fe1a20df4fc3e3dbaf5d1", "task_path": "tasks/nmp3_7fffd8d9-def0-5796-9603-93060d7ae7f7", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "7fffd8d9-def0-5796-9603-93060d7ae7f7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_80ebcbf2-f2ec-5c6d-936d-e27785eb8c5d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ with $xyz=1$. Prove that \n-- \\[\n-- \\frac{1}{x+y^{20}+z^{11}}+\\frac{1}{y+z^{20}+x^{11}}+\\frac{1}{z+x^{20}+y^{11}}\\le 1.\n-- \\]\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the inequality problem\n\nThe source problem asks to prove an inequality for three positive real numbers\nwhose product is one. This file records only the proposition to be proved.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- For all positive real numbers `x`, `y`, and `z` satisfying `x * y * z = 1`,\nthe sum of the three displayed reciprocal expressions is at most `1`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z → x * y * z = 1 →\n 1 / (x + y ^ 20 + z ^ 11) +\n 1 / (y + z ^ 20 + x ^ 11) +\n 1 / (z + x ^ 20 + y ^ 11) ≤ 1\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "80ebcbf2-f2ec-5c6d-936d-e27785eb8c5d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "aeaefece5b22449730971cd30e9e2de9a375ea546ae3e5f31d02a92d18ed5015", "task_path": "tasks/nmp3_80ebcbf2-f2ec-5c6d-936d-e27785eb8c5d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "80ebcbf2-f2ec-5c6d-936d-e27785eb8c5d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_81025467-32dd-5e09-8c3b-630e66b91fb9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a set $\\mathcal P$ of $n$ points in the plane with no three collinear, prove that there exists a subset $\\mathcal P'\\subset\\mathcal P$ of size at least $c\\,n^{1/3}$ (for some absolute constant $c>0$) such that any two distinct segments determined by points of $\\mathcal P'$ have different lengths (i.e., all pairwise distances among $\\mathcal P'$ are distinct).\nimport Mathlib\n\n/-!\n# Statement: a large subset with pairwise-distinct distances\n\nThis file formalizes the problem statement from `problem.md`. It does not\ncontain a proof of the assertion.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real Euclidean vector space of\ndimension two. -/\nabbrev PlanePoint : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A finite planar point set has no three collinear points if every choice of\nthree pairwise distinct points from it is not collinear. -/\ndef NoThreeCollinear (P : Finset PlanePoint) : Prop :=\n ∀ a b c : PlanePoint,\n a ∈ P → b ∈ P → c ∈ P →\n a ≠ b → a ≠ c → b ≠ c →\n ¬ Collinear ℝ ({a, b, c} : Set PlanePoint)\n\n/-- All lengths of distinct segments determined by points of `P` are distinct.\nAn unordered segment is represented by the two-element set of its endpoints. -/\ndef PairwiseDistancesDistinct (P : Finset PlanePoint) : Prop :=\n ∀ a b c d : PlanePoint,\n a ∈ P → b ∈ P → c ∈ P → d ∈ P →\n a ≠ b → c ≠ d →\n ({a, b} : Set PlanePoint) ≠ ({c, d} : Set PlanePoint) →\n dist a b ≠ dist c d\n\n/-- The assertion of the problem: there is an absolute positive constant `c`\nsuch that every finite planar point set `P` with `n` points and no three\ncollinear points has a subset `P'` whose cardinality is at least\n`c * n ^ (1/3)` and all of whose distinct segment lengths are pairwise\ndifferent. -/\ndef Target : Prop :=\n ∃ c : ℝ,\n 0 < c ∧\n ∀ (n : ℕ) (P : Finset PlanePoint),\n P.card = n →\n NoThreeCollinear P →\n ∃ P' : Finset PlanePoint,\n P' ⊆ P ∧\n c * (n : ℝ) ^ ((1 : ℝ) / 3) ≤ (P'.card : ℝ) ∧\n PairwiseDistancesDistinct P'\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "81025467-32dd-5e09-8c3b-630e66b91fb9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "45ccb418bbadb94eed1f2eb7ca0cebad4b8e7fcd13ffea1e9621b41047387099", "task_path": "tasks/nmp3_81025467-32dd-5e09-8c3b-630e66b91fb9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "81025467-32dd-5e09-8c3b-630e66b91fb9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_81598e4a-2407-5464-b155-2f8986e950b1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $T$ be the set of all infinite sequences of integers. For $x=(a_1,a_2,a_3,\\dots)$ and $y=(b_1,b_2,b_3,\\dots)$ define the coordinate‑wise sum $x+y=(a_1+b_1,a_2+b_2,a_3+b_3,\\dots)$. \n-- Let $f\\colon T\\to\\mathbb Z$ satisfy \n-- \n-- (i) If $x\\in T$ has exactly one term equal to $1$ and all other terms equal $0$, then $f(x)=0$. \n-- \n-- (ii) $f(x+y)=f(x)+f(y)$ for all $x,y\\in T$. \n-- \n-- Prove that $f(x)=0$ for every $x\\in T\\,. $\nimport Mathlib\n\n/-!\n# Formal statement: additive functionals on infinite integer sequences\n\nThe source problem considers all infinite sequences of integers, pointwise\naddition, additive maps from this product group to `ℤ`, and maps vanishing on\nthe standard one-hot sequences. The declarations below state the problem;\nthey do not contain a proof.\n-/\n\nnamespace Problem\n\n/-- The positive integer positions occurring in the source notation\n`a₁, a₂, a₃, …`. -/\nabbrev Index : Type := ℕ+\n\n/-- `T` is the type of all infinite sequences of integers, indexed by the\npositive integer positions. -/\nabbrev T : Type := Index → ℤ\n\n/-- The coordinate-wise sum of two sequences. -/\ndef coordinatewiseAdd (x y : T) : T :=\n fun i : Index => x i + y i\n\n/-- A sequence has exactly one term equal to `1` and every other term equal\nto `0`. This is the source problem's standard one-hot sequence. -/\ndef IsStandardBasis (x : T) : Prop :=\n ∃! i : Index, x i = 1 ∧ ∀ j : Index, j ≠ i → x j = 0\n\n/-- Additivity with respect to the coordinate-wise sum on `T`. -/\ndef IsAdditive (f : T → ℤ) : Prop :=\n ∀ x y : T, f (coordinatewiseAdd x y) = f x + f y\n\n/-- The two hypotheses imposed on `f : T → ℤ` in the source problem. -/\ndef SatisfiesHypotheses (f : T → ℤ) : Prop :=\n (∀ x : T, IsStandardBasis x → f x = 0) ∧ IsAdditive f\n\n/-- The desired conclusion for a fixed `f : T → ℤ`. -/\ndef VanishesEverywhere (f : T → ℤ) : Prop :=\n ∀ x : T, f x = 0\n\n/-- The full assertion to be proved: every integer-valued additive function on\nall infinite integer sequences that vanishes on each standard one-hot sequence\nis identically zero. -/\ndef Target : Prop :=\n ∀ f : T → ℤ, SatisfiesHypotheses f → VanishesEverywhere f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "81598e4a-2407-5464-b155-2f8986e950b1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f7291ba45535003a5f503c3622d7ce64310b960dcaff1a4f17f9e890c177283d", "task_path": "tasks/nmp3_81598e4a-2407-5464-b155-2f8986e950b1", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "81598e4a-2407-5464-b155-2f8986e950b1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_81c919b4-aa9e-5471-bd66-fdd06faa31ac", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A positive integer is called a **heinersch** number if it can be written as the sum of a positive perfect square and a positive perfect cube. Prove that there exist infinitely many heinersch numbers $h$ such that both $h-1$ and $h+1$ are also heinersch.\nimport Mathlib\n\n/-!\n# Formalization of the heinersch-number problem\n\nA positive integer is called *heinersch* when it is the sum of a positive\nperfect square and a positive perfect cube. The target asserts that\ninfinitely many heinersch numbers `h` have the property that both `h - 1`\nand `h + 1` are heinersch as well.\n-/\n\nnamespace Problem\n\n/-- A natural number is a positive perfect square if it is the square of a\npositive natural number. -/\ndef IsPositivePerfectSquare (n : ℕ) : Prop :=\n ∃ a : ℕ, 0 < a ∧ n = a ^ 2\n\n/-- A natural number is a positive perfect cube if it is the cube of a\npositive natural number. -/\ndef IsPositivePerfectCube (n : ℕ) : Prop :=\n ∃ b : ℕ, 0 < b ∧ n = b ^ 3\n\n/-- A positive integer is a heinersch number when it is the sum of a positive\nperfect square and a positive perfect cube. -/\ndef IsHeinersch (n : ℕ) : Prop :=\n 0 < n ∧ ∃ s c : ℕ,\n IsPositivePerfectSquare s ∧ IsPositivePerfectCube c ∧ n = s + c\n\n/-- The set of heinersch numbers `h` for which `h - 1` and `h + 1` are also\nheinersch. -/\ndef HeinerschWithHeinerschNeighbors : Set ℕ :=\n {h : ℕ | IsHeinersch h ∧ IsHeinersch (h - 1) ∧ IsHeinersch (h + 1)}\n\n/-- There exist infinitely many heinersch numbers `h` such that both `h - 1`\nand `h + 1` are also heinersch. -/\ndef Target : Prop :=\n Set.Infinite HeinerschWithHeinerschNeighbors\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "81c919b4-aa9e-5471-bd66-fdd06faa31ac", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e8a78dc795831b01b3f2f14bfe827e02b82672bc1d455b006c19a3fa11685821", "task_path": "tasks/nmp3_81c919b4-aa9e-5471-bd66-fdd06faa31ac", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "81c919b4-aa9e-5471-bd66-fdd06faa31ac", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_81d27610-9a88-5ecb-9db0-30d4d81b84c9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every acute triangle $ABC$,\n-- \\[\n-- \\sin A\\sin 3A + \\sin B\\sin 3B + \\sin C\\sin 3C \\le 0.\n-- \\]\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\n/-!\n# Formal statement for the acute-triangle trigonometric inequality\n\nThe source problem asserts, for every acute triangle with angles `A`, `B`, and\n`C`, that\n`sin A * sin (3A) + sin B * sin (3B) + sin C * sin (3C) ≤ 0`.\n\nThe triangle is represented by three labelled points in the Euclidean plane.\nIts angles are the usual unoriented interior angles supplied by\n`EuclideanGeometry.angle`. The assertion itself is packaged as the proposition\n`Problem.Target`; no proof of it is included here.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, whose points serve as labelled triangle vertices. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The interior angle at vertex `A` of the labelled triangle `ABC`. -/\ndef angleAtA (A B C : Point) : ℝ :=\n EuclideanGeometry.angle B A C\n\n/-- The interior angle at vertex `B` of the labelled triangle `ABC`. -/\ndef angleAtB (A B C : Point) : ℝ :=\n EuclideanGeometry.angle A B C\n\n/-- The interior angle at vertex `C` of the labelled triangle `ABC`. -/\ndef angleAtC (A B C : Point) : ℝ :=\n EuclideanGeometry.angle A C B\n\n/-- A labelled triangle `ABC` is acute when its vertices are noncollinear and\nall three of its interior angles are strictly less than a right angle. The\nnoncollinearity condition says that `A`, `B`, and `C` really are the three\nvertices of a nondegenerate triangle; under this condition the three displayed\nangles are its positive interior angles. -/\ndef IsAcuteTriangle (A B C : Point) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Point) ∧\n angleAtA A B C < Real.pi / (2 : ℝ) ∧\n angleAtB A B C < Real.pi / (2 : ℝ) ∧\n angleAtC A B C < Real.pi / (2 : ℝ)\n\n/-- The left-hand side of the asserted inequality, expressed using the three\ninterior angles of the labelled triangle `ABC`. -/\ndef inequalityLHS (A B C : Point) : ℝ :=\n Real.sin (angleAtA A B C) * Real.sin ((3 : ℝ) * angleAtA A B C) +\n Real.sin (angleAtB A B C) * Real.sin ((3 : ℝ) * angleAtB A B C) +\n Real.sin (angleAtC A B C) * Real.sin ((3 : ℝ) * angleAtC A B C)\n\n/-- For every acute triangle `ABC`, the sum\n`sin A * sin (3A) + sin B * sin (3B) + sin C * sin (3C)` is nonpositive. -/\ndef Target : Prop :=\n ∀ A B C : Point, IsAcuteTriangle A B C → inequalityLHS A B C ≤ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "81d27610-9a88-5ecb-9db0-30d4d81b84c9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ff3998ee453c7a1a15bd1fa6eef8ed8f276c2f4457fd23259551f75c5d0723e9", "task_path": "tasks/nmp3_81d27610-9a88-5ecb-9db0-30d4d81b84c9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "81d27610-9a88-5ecb-9db0-30d4d81b84c9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_82639d7b-087f-55bc-8aab-40e1b541f7e3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are nonnegative real numbers such that $a+b+c=3$, prove that \n-- \\[\n-- \\sqrt{a^{2}b+b^{2}c}+\\sqrt{b^{2}c+c^{2}a}+\\sqrt{c^{2}a+a^{2}b}\\le 3\\sqrt{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the nonnegative-real inequality\n\nThe source problem asks us to prove, for all nonnegative real numbers\n`a`, `b`, and `c` satisfying `a + b + c = 3`, that\n\n`sqrt (a^2 * b + b^2 * c) +\n sqrt (b^2 * c + c^2 * a) +\n sqrt (c^2 * a + a^2 * b) ≤ 3 * sqrt 2`.\n\nThis file records only the target proposition; it contains no proof of it.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the claimed inequality. `Real.sqrt` is the\nprincipal nonnegative real square root. -/\ndef leftHandSide (a b c : ℝ) : ℝ :=\n Real.sqrt (a ^ 2 * b + b ^ 2 * c) +\n Real.sqrt (b ^ 2 * c + c ^ 2 * a) +\n Real.sqrt (c ^ 2 * a + a ^ 2 * b)\n\n/-- The right-hand side of the claimed inequality. -/\ndef rightHandSide : ℝ :=\n 3 * Real.sqrt 2\n\n/-- The complete target assertion: for every triple of nonnegative real\nnumbers whose sum is three, the stated sum of square roots is at most\nthree times the square root of two.\n\nThe three nonnegativity hypotheses and the sum hypothesis are kept as\nseparate implications so that their order and individual meanings are\nexplicit. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a + b + c = 3 →\n leftHandSide a b c ≤ rightHandSide\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "82639d7b-087f-55bc-8aab-40e1b541f7e3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f805b51b47aff6fc4c93ab0b9f8a3ab34f483814cbb776cd9a5fc9178c14efdd", "task_path": "tasks/nmp3_82639d7b-087f-55bc-8aab-40e1b541f7e3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "82639d7b-087f-55bc-8aab-40e1b541f7e3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_82cd3a8e-47b5-55b2-8a64-4d91ede9e023", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c>0$, prove that \n-- \\[\n-- \\sum_{cyc}\\frac{2bc}{b^2+c^2}+\\sum_{cyc}\\frac{2a^2}{bc}+3\\ge\n-- \\frac{2a}{b}+\\frac{2b}{a}+\\frac{2a}{c}+\\frac{2c}{a}+\\frac{2c}{b}+\\frac{2b}{c}.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The first cyclic sum in the problem:\n`2bc/(b^2+c^2) + 2ca/(c^2+a^2) + 2ab/(a^2+b^2)`. -/\ndef cyclicSumOne (a b c : ℝ) : ℝ :=\n (2 * b * c) / (b ^ 2 + c ^ 2) +\n (2 * c * a) / (c ^ 2 + a ^ 2) +\n (2 * a * b) / (a ^ 2 + b ^ 2)\n\n/-- The second cyclic sum in the problem:\n`2a^2/(bc) + 2b^2/(ca) + 2c^2/(ab)`. -/\ndef cyclicSumTwo (a b c : ℝ) : ℝ :=\n (2 * a ^ 2) / (b * c) +\n (2 * b ^ 2) / (c * a) +\n (2 * c ^ 2) / (a * b)\n\n/-- The six-term right-hand side, in the order displayed in the problem. -/\ndef rightHandSide (a b c : ℝ) : ℝ :=\n (2 * a) / b + (2 * b) / a +\n (2 * a) / c + (2 * c) / a +\n (2 * c) / b + (2 * b) / c\n\n/-- The inequality of the problem for fixed real values of `a`, `b`, and `c`.\nThe positivity hypotheses are not needed to state the expression, but are\nincluded in `Target` below, exactly as in the source problem. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n cyclicSumOne a b c + cyclicSumTwo a b c + 3 ≥ rightHandSide a b c\n\n/-- The complete statement to be proved: for all positive real numbers `a`, `b`,\nand `c`, the displayed cyclic-sum inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "82cd3a8e-47b5-55b2-8a64-4d91ede9e023", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1795ea3b92d4dfb94946e5cd06dabea3bc1bc15e770a1e26d00e316039553361", "task_path": "tasks/nmp3_82cd3a8e-47b5-55b2-8a64-4d91ede9e023", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "82cd3a8e-47b5-55b2-8a64-4d91ede9e023", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_82ce7b3b-583c-5267-9a07-ff8aca45293c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c>0$ with $abc=1$, prove that \n-- \\[\n-- \\frac{1}{a(a^3+1)}+\\frac{1}{b(b^3+1)}+\\frac{1}{c(c^3+1)}\\ge\\frac{3}{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the single inequality problem\n\nThe original problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose product is one, that the displayed sum is at least `3 / 2`.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition from the problem: all three variables are\nstrictly positive and their product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n 1 / (a * (a ^ 3 + 1)) +\n 1 / (b * (b ^ 3 + 1)) +\n 1 / (c * (c ^ 3 + 1))\n\n/-- The proposition asserted by the problem. It says that for every\nadmissible triple of real numbers, the displayed sum is at least `3 / 2`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "82ce7b3b-583c-5267-9a07-ff8aca45293c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "56bda11f29acb3219fecce7e774dbb94b643876d6c5b41e8952879baa18d9a2c", "task_path": "tasks/nmp3_82ce7b3b-583c-5267-9a07-ff8aca45293c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "82ce7b3b-583c-5267-9a07-ff8aca45293c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8315ba97-0ce6-53a9-bd51-25a9cf19211f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a^5+b^5+c^5=3$. Prove that \n-- $$3\\,(a+b+c)^5\\;\\ge\\;\\bigl(a^5b^5+b^5c^5+c^5a^5\\bigr)^6\\,.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissible triples in the statement: three positive real numbers whose\nfifth powers sum to 3. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 5 + b ^ 5 + c ^ 5 = 3\n\n/-- The inequality asserted for an admissible triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n 3 * (a + b + c) ^ 5 ≥\n (a ^ 5 * b ^ 5 + b ^ 5 * c ^ 5 + c ^ 5 * a ^ 5) ^ 6\n\n/-- The full universally quantified proposition of the problem. The\nantecedent is definitionally the predicate `Admissible`, and the consequent is\ndefinitionally the predicate `Inequality`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 5 + b ^ 5 + c ^ 5 = 3 →\n 3 * (a + b + c) ^ 5 ≥\n (a ^ 5 * b ^ 5 + b ^ 5 * c ^ 5 + c ^ 5 * a ^ 5) ^ 6\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8315ba97-0ce6-53a9-bd51-25a9cf19211f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2eedcf711ba3d3060f78135047de4854e75603928db0647fd6aabd2748432af5", "task_path": "tasks/nmp3_8315ba97-0ce6-53a9-bd51-25a9cf19211f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8315ba97-0ce6-53a9-bd51-25a9cf19211f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_837336dd-117e-54fc-a8c6-469f26f8378c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $f:[0,1]\\to[0,1]$ is differentiable on $[0,1]$ and satisfies $|f'(x)|\\le 1$ for every $x\\in[0,1]$. For any initial $x_0\\in[0,1]$ define the sequence $x_{n+1}=f(x_n)$ for $n\\ge0$. Prove that the subsequence $(x_{2n})_{n\\ge0}$ converges (i.e., has a limit in $[0,1]$).\nimport Mathlib.Analysis.Calculus.Deriv.Basic\n\n/-!\n# Formal statement: convergence of even iterates\n\nThis file formalizes the statement of the problem, without asserting or proving it.\nThe function is represented as a real-valued function on `ℝ` that maps `[0,1]` into\nitself. Differentiability on the closed interval and the derivative bound are expressed\nusing the within-interval derivative, which gives the one-sided interpretation at the\nendpoints.\n-/\n\nnamespace Problem\n\n/-- The orbit of `x₀` under iteration of `f`: `orbit f x₀ 0 = x₀` and\n`orbit f x₀ (n+1) = f (orbit f x₀ n)`. -/\ndef orbit (f : ℝ → ℝ) (x₀ : ℝ) : ℕ → ℝ\n | 0 => x₀\n | n + 1 => f (orbit f x₀ n)\n\n/-- The initial value of the orbit. -/\n@[simp] theorem orbit_zero (f : ℝ → ℝ) (x₀ : ℝ) : orbit f x₀ 0 = x₀ := rfl\n\n/-- The recursive step of the orbit. -/\n@[simp] theorem orbit_succ (f : ℝ → ℝ) (x₀ : ℝ) (n : ℕ) :\n orbit f x₀ (n + 1) = f (orbit f x₀ n) := rfl\n\n/-- The assumption that `f` maps the unit interval into itself. -/\ndef IsSelfMapOnUnitInterval (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, x ∈ Set.Icc (0 : ℝ) 1 → f x ∈ Set.Icc (0 : ℝ) 1\n\n/-- Differentiability of `f` on the closed interval `[0,1]`, in the within-set sense. -/\ndef DifferentiableOnUnitInterval (f : ℝ → ℝ) : Prop :=\n DifferentiableOn ℝ f (Set.Icc (0 : ℝ) 1)\n\n/-- The bound `|f'(x)| ≤ 1` for every `x ∈ [0,1]`, using the derivative within `[0,1]`.\nAt the endpoints this is the appropriate one-sided derivative. -/\ndef DerivativeBoundOnUnitInterval (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, x ∈ Set.Icc (0 : ℝ) 1 →\n |derivWithin f (Set.Icc (0 : ℝ) 1) x| ≤ 1\n\n/-- The subsequence `(x_{2n})_{n ≥ 0}` of the orbit. -/\ndef evenOrbit (f : ℝ → ℝ) (x₀ : ℝ) : ℕ → ℝ :=\n fun n : ℕ => orbit f x₀ (2 * n)\n\n/-- The `n`-th term of the even subsequence is the `(2n)`-th orbit term. -/\n@[simp] theorem evenOrbit_apply (f : ℝ → ℝ) (x₀ : ℝ) (n : ℕ) :\n evenOrbit f x₀ n = orbit f x₀ (2 * n) := rfl\n\n/-- A real sequence has a limit belonging to the unit interval. -/\ndef HasLimitInUnitInterval (x : ℕ → ℝ) : Prop :=\n ∃ L : ℝ, L ∈ Set.Icc (0 : ℝ) 1 ∧\n Filter.Tendsto x Filter.atTop (nhds L)\n\n/-- The complete assertion of the problem: for every self-map `f` of `[0,1]` that is\ndifferentiable on `[0,1]` with `|f'(x)| ≤ 1` there, and for every initial `x₀ ∈ [0,1]`,\nthe subsequence of even iterates converges to a limit in `[0,1]`. -/\ndef Target : Prop :=\n ∀ (f : ℝ → ℝ),\n IsSelfMapOnUnitInterval f →\n DifferentiableOnUnitInterval f →\n DerivativeBoundOnUnitInterval f →\n ∀ (x₀ : ℝ), x₀ ∈ Set.Icc (0 : ℝ) 1 →\n HasLimitInUnitInterval (evenOrbit f x₀)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "837336dd-117e-54fc-a8c6-469f26f8378c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4e0dcbee14cfa2d9c27caa1cbf0baef530a69c05444d7d73358ffe14d41ec888", "task_path": "tasks/nmp3_837336dd-117e-54fc-a8c6-469f26f8378c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "837336dd-117e-54fc-a8c6-469f26f8378c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_837a48f9-6999-5cab-b6cb-bab8628db3a8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x_1,x_2,\\dots,x_n$ be positive real numbers such that \n-- \\[\n-- \\sum_{i=1}^n\\frac{1}{1+x_i}=1.\n-- \\] \n-- Prove that \n-- \\[\n-- \\sum_{i=1}^n\\sqrt{x_i}\\;\\ge\\;(n-1)\\sum_{i=1}^n\\frac{1}{\\sqrt{x_i}}.\n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The admissible data for the problem: a finite family of positive real numbers\nindexed by `Fin n`, whose terms satisfy the displayed reciprocal-sum condition. -/\ndef Admissible (n : ℕ) (x : Fin n → ℝ) : Prop :=\n (∀ i : Fin n, 0 < x i) ∧\n (∑ i : Fin n, (1 : ℝ) / (1 + x i)) = 1\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def leftSide (n : ℕ) (x : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, Real.sqrt (x i)\n\n/-- The right-hand side of the desired inequality. The factor `(n - 1)` is\ninterpreted as the real number `(n : ℝ) - 1`. -/\nnoncomputable def rightSide (n : ℕ) (x : Fin n → ℝ) : ℝ :=\n ((n : ℝ) - 1) * ∑ i : Fin n, (1 : ℝ) / Real.sqrt (x i)\n\n/-- The full statement to be proved: for every natural number `n` and every\npositive real family `x : Fin n → ℝ` satisfying the reciprocal-sum condition,\nthe stated inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ (n : ℕ) (x : Fin n → ℝ),\n Admissible n x → leftSide n x ≥ rightSide n x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "837a48f9-6999-5cab-b6cb-bab8628db3a8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "37d5de28bee6a5885ee6d2da8a48d2e1288ef66ac40e34720fed7e5fd72b6a8e", "task_path": "tasks/nmp3_837a48f9-6999-5cab-b6cb-bab8628db3a8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "837a48f9-6999-5cab-b6cb-bab8628db3a8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_83cf7efa-47df-58d5-8d74-79c5001a83b5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy \n-- \\[\n-- \\frac1{ab}+\\frac1{bc}+\\frac1{ca}=1.\n-- \\] \n-- Prove that \n-- \\[\n-- \\frac{a^2+b^2+c^2+ab+bc+ca}{5}\\ge \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}+\\frac35.\n-- \\] \n-- (Equivalently, $a^2+b^2+c^2+ab+bc+ca\\ge 5\\!\\left(\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\right)+3$.)\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThe source problem asks to prove an inequality for three positive real numbers\nsatisfying a reciprocal-product constraint. The declarations below record the\nconstraint, the two displayed (equivalent) forms of the conclusion, and the\ntarget proposition. No proof of the target is supplied.\n-/\n\nnamespace Problem\n\n/-- The assumptions that `a`, `b`, and `c` are strictly positive. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The constraint\n`1 / (a * b) + 1 / (b * c) + 1 / (c * a) = 1`. -/\ndef ConstraintCondition (a b c : ℝ) : Prop :=\n (1 : ℝ) / (a * b) + (1 : ℝ) / (b * c) + (1 : ℝ) / (c * a) = 1\n\n/-- The complete admissibility condition from the problem: positivity together\nwith the reciprocal-product constraint. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositiveTriple a b c ∧ ConstraintCondition a b c\n\n/-- The first displayed inequality, with denominator `5` on the left and `3 / 5`\non the right. -/\ndef MainInequality (a b c : ℝ) : Prop :=\n (a ^ 2 + b ^ 2 + c ^ 2 + a * b + b * c + c * a) / (5 : ℝ) ≥\n a / b + b / c + c / a + (3 : ℝ) / 5\n\n/-- The parenthetical, algebraically expanded form of the conclusion. -/\ndef ExpandedInequality (a b c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 + a * b + b * c + c * a ≥\n 5 * (a / b + b / c + c / a) + (3 : ℝ)\n\n/-- The equivalence asserted by the parenthetical display, under the same\nadmissibility assumptions as the target: the two written forms of the desired\ninequality are equivalent. -/\ndef EquivalenceClaim : Prop :=\n ∀ (a b c : ℝ), Admissible a b c →\n (MainInequality a b c ↔ ExpandedInequality a b c)\n\n/-- The proposition asked to be proved: for all positive real `a`, `b`, `c`\nsatisfying the reciprocal-product constraint, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → MainInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "83cf7efa-47df-58d5-8d74-79c5001a83b5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ea969bc94a1f66d17db7c11dbab400a6b97df5911516285edbc4d258adbdffde", "task_path": "tasks/nmp3_83cf7efa-47df-58d5-8d74-79c5001a83b5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "83cf7efa-47df-58d5-8d74-79c5001a83b5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_83da256d-2ca1-5254-acda-c21f49c18d5a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a fixed triangle. Let $D$ be an arbitrary point inside $\\triangle ABC$ such that the angle $\\angle BAD$ is fixed. Draw the line through $D$ parallel to $BC$; it meets the circumcircle of $ABC$ again at $E$ and $F$. Prove that the tangent to the circumcircle of $ADE$ at $E$ and the tangent to the circumcircle of $ADF$ at $F$ intersect at a point that does not depend on the choice of $D$ (i.e., the intersection point is fixed).\nimport Mathlib\n\n/-!\nFormalization of the planar geometry statement in `problem.md`.\n\nThe Euclidean plane is represented by `ℝ × ℝ`. All geometric notions used by\nthe statement (strict triangle interior, collinearity, parallelism, ordinary\nangle, circumcircle and tangent line) are defined explicitly below. The target\nis declarative: it records the assertion to be proved, but contains no proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- Points of the Euclidean plane, represented by their Cartesian coordinates. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- Difference of two points, regarded as a displacement vector. -/\ndef vsub (p q : Point) : Point := (p.1 - q.1, p.2 - q.2)\n\n/-- Dot product of two displacement vectors. -/\ndef dot (u v : Point) : ℝ := u.1 * v.1 + u.2 * v.2\n\n/-- Two-dimensional scalar cross product (oriented area determinant). -/\ndef cross (u v : Point) : ℝ := u.1 * v.2 - u.2 * v.1\n\n/-- Squared Euclidean norm of a displacement vector. -/\ndef normSq (u : Point) : ℝ := dot u u\n\n/-- Squared Euclidean distance between two points. -/\ndef distSq (p q : Point) : ℝ := normSq (vsub p q)\n\n/-- Three points are collinear when the vectors from the first two to the third\nhave zero cross product. -/\ndef Collinear (p q r : Point) : Prop := cross (vsub q p) (vsub r p) = 0\n\n/-- The line through `p` and `q` is parallel to the line through `r` and `s`. -/\ndef Parallel (p q r s : Point) : Prop := cross (vsub q p) (vsub s r) = 0\n\n/-- `d` lies in the strict interior of triangle `abc`, expressed by positive\nbarycentric coordinates with respect to the vertices. -/\ndef InsideTriangle (a b c d : Point) : Prop :=\n ∃ x y z : ℝ,\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = 1 ∧\n d = x • a + y • b + z • c\n\n/-- Ordinary (non-oriented) angle at `a` between the rays `ab` and `ac`, in\nradians, computed with the arccosine formula. The formula is total; for the\nnondegenerate configurations in the problem its value is the usual angle. -/\ndef angleAt (a b c : Point) : ℝ :=\n let u := vsub b a\n let v := vsub c a\n Real.arccos (dot u v / Real.sqrt (normSq u * normSq v))\n\n/-- The circumcenter of the circle through `a`, `b`, and `c`, obtained by\nsolving the two perpendicular-bisector equations. Its formula is meaningful\nwhen the three points are noncollinear; the target includes that hypothesis in\nthe tangent predicate. -/\ndef circumcenter (a b c : Point) : Point :=\n let u := vsub b a\n let v := vsub c a\n let den := cross u v\n (a.1 + (normSq u * v.2 - normSq v * u.2) / (2 * den),\n a.2 + (normSq v * u.1 - normSq u * v.1) / (2 * den))\n\n/-- A point lies on the circumcircle of `a`, `b`, and `c`. -/\ndef OnCircle (a b c x : Point) : Prop :=\n distSq x (circumcenter a b c) = distSq a (circumcenter a b c)\n\n/-- `x` lies on the tangent line at `t` to the circle through `p`, `q`, and `r`.\nThe first conjunct records that the circle is nondegenerate. The second records\nthat the designated tangency point is on the circle. The final equation says\nthat the displacement from `t` to `x` is perpendicular to the radius. -/\ndef OnTangentAt (p q r t x : Point) : Prop :=\n ¬ Collinear p q r ∧\n OnCircle p q r t ∧\n dot (vsub x t) (vsub t (circumcenter p q r)) = 0\n\n/-- The two lines tangent at `e` and `f` to the respective circles through\n`a,d,e` and `a,d,f` meet in the single point `x`. -/\ndef TangentLinesMeetAt (a d e f x : Point) : Prop :=\n OnTangentAt a d e e x ∧\n OnTangentAt a d f f x ∧\n ∀ y : Point,\n OnTangentAt a d e e y →\n OnTangentAt a d f f y → y = x\n\n/-- The line through `d` parallel to `b c`, together with its two intersections\nwith the circumcircle of `a b c`. The final condition states explicitly that\n`e` and `f` exhaust the intersection of that line with the circle. -/\ndef IsParallelChord (a b c d e f : Point) : Prop :=\n e ≠ f ∧\n Collinear e f d ∧\n Parallel e f b c ∧\n OnCircle a b c e ∧\n OnCircle a b c f ∧\n ∀ x : Point,\n OnCircle a b c x → Collinear e f x → x = e ∨ x = f\n\n/-- `d` is an admissible choice for the variable point: it lies strictly inside\ntriangle `a b c`, and the ordinary angle `∠ b a d` equals the prescribed fixed\nangle `theta`. -/\ndef IsAdmissiblePoint (a b c : Point) (theta : ℝ) (d : Point) : Prop :=\n InsideTriangle a b c d ∧ angleAt a b d = theta\n\n/-- A supporting formulation of the nonemptiness of the fixed-angle class. It\nrecords what is meant by there existing an interior point with the prescribed\nangle; the universal conditional target does not need it as an extra hypothesis. -/\ndef HasAdmissibleInteriorPoint (a b c : Point) (theta : ℝ) : Prop :=\n ∃ d : Point, IsAdmissiblePoint a b c theta d\n\n/-- `x` is a point depending only on the fixed triangle `a b c` and fixed angle\n`theta` through which every pair of tangents specified by an admissible `d`\npasses. For every admissible `d` and every admissible labelling `e,f` of the\ntwo parallel chord intersections, the tangent lines have `x` as their unique\ncommon point. -/\ndef IsFixedTangentIntersection (a b c : Point) (theta : ℝ) (x : Point) : Prop :=\n ∀ d : Point,\n IsAdmissiblePoint a b c theta d →\n ∀ e f : Point,\n IsParallelChord a b c d e f → TangentLinesMeetAt a d e f x\n\n/-- The main target predicate for a fixed triangle and a fixed angle: there\nexists a point `x`, independent of the choice of `d`, such that the two tangents\nalways meet uniquely at `x`. The statement is the standard universal\nconditional over admissible choices of `d`; no concrete admissible point or\nanswer point is supplied or assumed. -/\ndef TargetFor (a b c : Point) (theta : ℝ) : Prop :=\n ¬ Collinear a b c →\n ∃ x : Point, IsFixedTangentIntersection a b c theta x\n\n/-- The fully quantified formal statement of the problem: for every fixed\nnondegenerate triangle `a b c` and every fixed angle `theta`, there is a point\nindependent of the choice of the point `d` (whenever `d` is strictly inside and\n`∠ b a d = theta`) at which the two specified tangents meet uniquely. -/\ndef Target : Prop :=\n ∀ (a b c : Point) (theta : ℝ), TargetFor a b c theta\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "83da256d-2ca1-5254-acda-c21f49c18d5a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "eadfc7b89b7ef1504971a382b348808fa2e03d3fee026da572e7cec06797a176", "task_path": "tasks/nmp3_83da256d-2ca1-5254-acda-c21f49c18d5a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "83da256d-2ca1-5254-acda-c21f49c18d5a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_84144bed-5b3d-5c3d-a849-db3afb1e3fcd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,x,y,z$ be positive real numbers such that $\\displaystyle\\frac{1}{x}+\\frac{1}{y}+\\frac{1}{z}=1$. Prove that \n-- \\[\n-- a^{x}+b^{y}+c^{z}\\ge \\frac{4\\,abc\\,xyz}{\\bigl(x+y+z-3\\bigr)^{2}}\\,.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\nnamespace Problem\n\n/-- The admissibility conditions from the problem: all six variables are positive\nreal numbers and their reciprocals satisfy `1 / x + 1 / y + 1 / z = 1`. -/\ndef Admissible (a b c x y z : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < x ∧ 0 < y ∧ 0 < z ∧\n 1 / x + 1 / y + 1 / z = 1\n\n/-- The asserted inequality, with `a ^ x`, `b ^ y`, and `c ^ z` interpreted as\nreal powers (`Real.rpow`). -/\ndef Inequality (a b c x y z : ℝ) : Prop :=\n a ^ x + b ^ y + c ^ z ≥\n 4 * a * b * c * x * y * z / (x + y + z - 3) ^ 2\n\n/-- The full universal implication asserting the problem's inequality under the\nstated positivity and reciprocal-sum hypotheses. -/\ndef Target : Prop :=\n ∀ (a b c x y z : ℝ), Admissible a b c x y z → Inequality a b c x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84144bed-5b3d-5c3d-a849-db3afb1e3fcd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5e06ad283e4cca7eb6385115450d198105726f45a35b1e7dd6cdedb3bb9bdf1c", "task_path": "tasks/nmp3_84144bed-5b3d-5c3d-a849-db3afb1e3fcd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84144bed-5b3d-5c3d-a849-db3afb1e3fcd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_842d84a3-8fb7-5103-a428-fab6554198ee", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\in\\mathbb{R}$ satisfy $ab=4$ and $c^{2}+4d^{2}=4$. Prove that \n-- \\[\n-- (a-c)^{2}+(b-d)^{2}\\ge\\frac{8}{5}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe problem asks to prove that for all real numbers `a`, `b`, `c`, and `d`\nsatisfying `a*b = 4` and `c^2 + 4*d^2 = 4`, one has\n`(a-c)^2 + (b-d)^2 >= 8/5`.\n\nThe declaration `Problem.Target` is the proposition to be proved. It is\ndeliberately a `def` returning `Prop`: no proof of the original problem is\nincluded in this formalization-only file.\n-/\n\nnamespace Problem\n\n/-- The first hypothesis of the problem, namely `a * b = 4`. -/\ndef ABHypothesis (a b : ℝ) : Prop :=\n a * b = (4 : ℝ)\n\n/-- The second hypothesis of the problem, namely `c^2 + 4*d^2 = 4`. -/\ndef CDHypothesis (c d : ℝ) : Prop :=\n c ^ 2 + (4 : ℝ) * d ^ 2 = (4 : ℝ)\n\n/-- Both hypotheses, holding for the same four real numbers. -/\ndef Hypotheses (a b c d : ℝ) : Prop :=\n ABHypothesis a b ∧ CDHypothesis c d\n\n/-- The squared Euclidean distance expression from the conclusion. -/\ndef DistanceSq (a b c d : ℝ) : ℝ :=\n (a - c) ^ 2 + (b - d) ^ 2\n\n/-- The desired lower bound, using real division `8 / 5`. -/\nnoncomputable def LowerBound : ℝ :=\n (8 : ℝ) / 5\n\n/-- The conclusion `(a-c)^2 + (b-d)^2 ≥ 8/5`. -/\ndef Conclusion (a b c d : ℝ) : Prop :=\n DistanceSq a b c d ≥ LowerBound\n\n/-- The full assertion of the problem: for every quadruple of real numbers\nsatisfying both constraints, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c d : ℝ), Hypotheses a b c d → Conclusion a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "842d84a3-8fb7-5103-a428-fab6554198ee", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "467407986e3d9ebd0e862dcf54d2bb7f0e032792b31082b4643ae35fbeebe2b1", "task_path": "tasks/nmp3_842d84a3-8fb7-5103-a428-fab6554198ee", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "842d84a3-8fb7-5103-a428-fab6554198ee", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8437b0d3-fdd0-5cea-9eca-a34cbf91384e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(x,y,z\\ge 0\\). Prove that \n-- \\[\n-- \\bigl(x^{3}+y^{3}+z^{3}\\bigr)^{3}\\;\\ge\\;\\bigl(x^{2}+y^{2}+z^{2}\\bigr)\\,\\bigl(x^{2}y+y^{2}z+z^{2}x\\bigr)\\,\\bigl(x^{4}+y^{4}+z^{4}\\bigr),\n-- \\] \n-- where each sum is taken cyclically.\nimport Mathlib\n\n/-!\n# Formal statement: a cyclic three-variable inequality\n\nThe source problem asks, for nonnegative real numbers `x`, `y`, and `z`, to\nprove a cubic-versus-product inequality. We record the precise proposition as\na `Prop`-valued definition; no proof is supplied at this statement-formalization\nstage.\n-/\n\nnamespace Problem\n\n/-- The cyclic expression `x^2 y + y^2 z + z^2 x`. -/\ndef cyclicMixedPowerSum (x y z : ℝ) : ℝ :=\n x ^ 2 * y + y ^ 2 * z + z ^ 2 * x\n\n/--\nFor all nonnegative real numbers `x`, `y`, and `z`, the cube of the sum of\ncubes is at least the product of the sum of squares, the cyclic mixed power\nsum, and the sum of fourth powers.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 ≤ x → 0 ≤ y → 0 ≤ z →\n (x ^ 3 + y ^ 3 + z ^ 3) ^ 3 ≥\n (x ^ 2 + y ^ 2 + z ^ 2) *\n cyclicMixedPowerSum x y z *\n (x ^ 4 + y ^ 4 + z ^ 4)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8437b0d3-fdd0-5cea-9eca-a34cbf91384e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ffb173686f63ba50591977d8a67075dc6f449d4622a894e3b93f12e963e2cb96", "task_path": "tasks/nmp3_8437b0d3-fdd0-5cea-9eca-a34cbf91384e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8437b0d3-fdd0-5cea-9eca-a34cbf91384e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_843de117-1fe6-5d60-aa47-d77d1d89e435", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are positive real numbers, prove that \n-- $$4\\Bigl(a+\\frac1a\\Bigr)\\Bigl(b+\\frac1b\\Bigr)\\Bigl(c+\\frac1c\\Bigr)\\ge 9(a+b+c).$$\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement\n\nIf `a`, `b`, and `c` are positive real numbers, then\n`4 * (a + 1 / a) * (b + 1 / b) * (c + 1 / c) ≥ 9 * (a + b + c)`.\n-/\n\nnamespace Problem\n\n@[expose] public section\n\n/-- The three variables are positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The asserted inequality for a fixed triple of real numbers. -/\ndef Inequality (a b c : ℝ) : Prop :=\n 4 * (a + 1 / a) * (b + 1 / b) * (c + 1 / c) ≥ 9 * (a + b + c)\n\n/-- The complete universal statement of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → Inequality a b c\n\nend\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "843de117-1fe6-5d60-aa47-d77d1d89e435", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "55c5e0bcaae20ac72bad096459c39f374dac4ef879d32984952dc3d9f53ae7be", "task_path": "tasks/nmp3_843de117-1fe6-5d60-aa47-d77d1d89e435", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "843de117-1fe6-5d60-aa47-d77d1d89e435", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_84463704-acef-5380-91e4-f857279b63fa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c>0$, prove that \n-- \n-- \\[\n-- \\sqrt{\\frac{a}{\\,b+c\\,}}+\\sqrt{\\frac{b}{\\,a+c\\,}}+\\sqrt{\\frac{c}{\\,a+b\\,}}\n-- \\;\\ge\\;\n-- \\sqrt{2+\\frac{a}{\\,b+c\\,}+\\frac{b}{\\,a+c\\,}+\\frac{c}{\\,a+b\\,}\n-- +\\sqrt{\\frac{8abc}{(a+b)(b+c)(c+a)}}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Statement: a three-variable square-root inequality\n\nThis file formalizes the assertion in `problem.md`. It only states the\ninequality; no proof of it is supplied.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality:\n`√(a/(b+c)) + √(b/(a+c)) + √(c/(a+b))`. -/\nnoncomputable def leftSide (a b c : ℝ) : ℝ :=\n Real.sqrt (a / (b + c)) +\n Real.sqrt (b / (a + c)) +\n Real.sqrt (c / (a + b))\n\n/-- The expression inside the outer square root on the right-hand side,\nbefore taking that outer square root. -/\nnoncomputable def rightRadicand (a b c : ℝ) : ℝ :=\n 2 + a / (b + c) + b / (a + c) + c / (a + b) +\n Real.sqrt (8 * a * b * c / ((a + b) * (b + c) * (c + a)))\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rightSide (a b c : ℝ) : ℝ :=\n Real.sqrt (rightRadicand a b c)\n\n/-- For all positive real numbers `a`, `b`, and `c`, the sum of the three\nsquare-root terms is at least the square root of\n`2 + a/(b+c) + b/(a+c) + c/(a+b) + √(8abc/((a+b)(b+c)(c+a)))`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n rightSide a b c ≤ leftSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84463704-acef-5380-91e4-f857279b63fa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9f6322366dacfbef23546fc146e502c7a1029efff620eada991b5155ac660cfd", "task_path": "tasks/nmp3_84463704-acef-5380-91e4-f857279b63fa", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84463704-acef-5380-91e4-f857279b63fa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_84844916-66ce-5f29-96d6-c16c9e418c35", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be an odd prime. Suppose $f:\\mathbb Z_{>0}\\times\\mathbb Z_{>0}\\to\\{0,1\\}$ satisfies \n-- \n-- 1. $f(1,1)=0$; \n-- 2. $f(a,b)+f(b,a)=1$ for any relatively prime positive integers $a,b$ with $(a,b)\\neq(1,1)$; \n-- 3. $f(a+b,b)=f(a,b)$ for any relatively prime positive integers $a,b$. \n-- \n-- Prove that \n-- \n-- \\[\n-- \\sum_{n=1}^{p-1} f(n^2,p)\\;\\ge\\;\\sqrt{2p}-2\\,. \n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\n/-!\n# Formal statement for the problem\n\nThe problem concerns a function on pairs of positive integers with values in\n`{0, 1}` satisfying three constraints, and an inequality involving the sum\n`∑_{n=1}^{p-1} f(n², p)`.\n\nPositive integers are represented by `ℕ+` (that is, `PNat`), the two-element\ncodomain by `Fin 2`, and the sum by a reindexed finite sum over\n`Finset.range (p - 1)`. The proposition `Target` is the universal statement\nof the problem; it is not given a proof here.\n-/\n\nnamespace Problem\n\n/-- Condition 1: `f(1,1) = 0`. -/\ndef conditionOne (f : ℕ+ × ℕ+ → Fin 2) : Prop :=\n f (1, 1) = 0\n\n/-- Condition 2: for relatively prime positive integers `a` and `b`, other\nthan `(1,1)`, the numerical values of `f(a,b)` and `f(b,a)` sum to `1`. -/\ndef conditionTwo (f : ℕ+ × ℕ+ → Fin 2) : Prop :=\n ∀ a b : ℕ+,\n Nat.Coprime (a : ℕ) (b : ℕ) →\n (a, b) ≠ ((1, 1) : ℕ+ × ℕ+) →\n (f (a, b)).val + (f (b, a)).val = 1\n\n/-- Condition 3: for relatively prime positive integers `a` and `b`,\n`f(a+b,b) = f(a,b)`. -/\ndef conditionThree (f : ℕ+ × ℕ+ → Fin 2) : Prop :=\n ∀ a b : ℕ+,\n Nat.Coprime (a : ℕ) (b : ℕ) →\n f (a + b, b) = f (a, b)\n\n/-- The conjunction of the three hypotheses imposed on `f`. -/\ndef Satisfies (f : ℕ+ × ℕ+ → Fin 2) : Prop :=\n conditionOne f ∧ conditionTwo f ∧ conditionThree f\n\n/-- The prime `p`, regarded as a positive integer (the second component of\nthe argument of `f` in the summation). -/\ndef primeAsPositive (p : ℕ) (hp : p.Prime) : ℕ+ :=\n ⟨p, hp.pos⟩\n\n/-- The positive integer `(k + 1)^2`, used after reindexing `n = k + 1` in\nthe sum. -/\ndef successorSquare (k : ℕ) : ℕ+ :=\n ⟨(k + 1) * (k + 1),\n Nat.mul_pos (Nat.succ_pos k) (Nat.succ_pos k)⟩\n\n/-- The left-hand side `∑_{n=1}^{p-1} f(n², p)`, reindexed by\n`k = n - 1`. The sum is a sum of natural-number representatives in\n`{0, 1}`. -/\ndef sumLHS (p : ℕ) (hp : p.Prime) (f : ℕ+ × ℕ+ → Fin 2) : ℕ :=\n ∑ k ∈ Finset.range (p - 1),\n (f (successorSquare k, primeAsPositive p hp)).val\n\n/-- The asserted inequality for a fixed odd prime `p` and function `f`.\n\nThe left-hand sum of natural values is cast to `ℝ`, and the square root is\nthe real square root of `2p`. -/\ndef mainInequality (p : ℕ) (hp : p.Prime)\n (f : ℕ+ × ℕ+ → Fin 2) : Prop :=\n (sumLHS p hp f : ℝ) ≥ Real.sqrt ((2 : ℝ) * (p : ℝ)) - 2\n\n/-- The full statement of the problem:\n\nfor every odd prime `p`, every function `f : ℕ+ × ℕ+ → {0,1}` satisfying the\nthree stated conditions obeys the asserted lower bound. -/\ndef Target : Prop :=\n ∀ (p : ℕ) (hp : p.Prime) (_hodd : Odd p)\n (f : ℕ+ × ℕ+ → Fin 2),\n Satisfies f → mainInequality p hp f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84844916-66ce-5f29-96d6-c16c9e418c35", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a5e9a6857ec12e54c77c30384e1ba8c01622acf1672b06ba53c9726947913455", "task_path": "tasks/nmp3_84844916-66ce-5f29-96d6-c16c9e418c35", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84844916-66ce-5f29-96d6-c16c9e418c35", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_84bdc608-e2ab-5742-9659-14966b75f789", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a}{1+ab^{2}}+\\frac{b}{1+bc^{2}}+\\frac{c}{1+ca^{2}}\\ge\\frac{3\\sqrt[3]{abc}}{1+abc}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of a three-variable real inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and\n`c`, the inequality\n\n`a / (1 + a * b ^ 2) + b / (1 + b * c ^ 2) + c / (1 + c * a ^ 2)\n ≥ 3 * (a * b * c) ^ (1 / 3) / (1 + a * b * c)`.\n\nMathlib does not currently provide a `Real.cbrt` function. Since the product\n`a * b * c` is positive under the hypotheses, its real cube root is faithfully\nrepresented by `Real.rpow (a * b * c) (1 / 3)`. The definition below records\nthis representation explicitly.\n-/\n\nnamespace Problem\n\n/-- The real cube root used in the statement, represented as a real power. -/\nnoncomputable def realCubeRoot (x : ℝ) : ℝ :=\n Real.rpow x ((1 : ℝ) / 3)\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / (1 + a * b ^ 2) + b / (1 + b * c ^ 2) + c / (1 + c * a ^ 2)\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 3 * realCubeRoot (a * b * c) / (1 + a * b * c)\n\n/-- The assertion to be proved: for all positive reals `a`, `b`, and `c`, the\nthree-term sum is at least `3 * cbrt (a*b*c) / (1 + a*b*c)`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84bdc608-e2ab-5742-9659-14966b75f789", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e828fe47b91e573c11cb00ef9de0ac614d1d98e8bf11edc2cd23f187bab8089a", "task_path": "tasks/nmp3_84bdc608-e2ab-5742-9659-14966b75f789", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84bdc608-e2ab-5742-9659-14966b75f789", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_84c1fe8b-a1f8-5aa8-b2bc-a6f96d6fb5f3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb R$ satisfy $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{1}{2+a^{2}+b^{2}}+\\frac{1}{2+b^{2}+c^{2}}+\\frac{1}{2+c^{2}+a^{2}}\\le\\frac34\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / (2 + a ^ 2 + b ^ 2) +\n 1 / (2 + b ^ 2 + c ^ 2) +\n 1 / (2 + c ^ 2 + a ^ 2)\n\n/-- The assertion in the problem: for all real `a`, `b`, and `c` with\n`a + b + c = 3`, the sum of the three given reciprocal terms is at most `3 / 4`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), a + b + c = (3 : ℝ) → lhs a b c ≤ (3 : ℝ) / 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84c1fe8b-a1f8-5aa8-b2bc-a6f96d6fb5f3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1e239604e75cb99e7b3ee18ee4b11556f966b1c23ffe67326eaefab0ca3ed2c0", "task_path": "tasks/nmp3_84c1fe8b-a1f8-5aa8-b2bc-a6f96d6fb5f3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84c1fe8b-a1f8-5aa8-b2bc-a6f96d6fb5f3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_84d2e696-8d0d-5072-92cc-a436a3dba172", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A,B\\in M_n(\\mathbb{R})$ and let $I_n$ denote the $n\\times n$ identity matrix. Suppose $AB=BA$. Prove that \n-- \\[\n-- \\det\\!\\big(A^{2}+B^{2}+I_n\\big)\\ge 0.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The `n × n` identity matrix over the real numbers, denoted `I_n` in the problem. -/\ndef IdentityMatrix (n : ℕ) : Matrix (Fin n) (Fin n) ℝ :=\n 1\n\n/-- The assertion that two real square matrices commute. -/\ndef CommuteMatrices {n : ℕ} (A B : Matrix (Fin n) (Fin n) ℝ) : Prop :=\n A * B = B * A\n\n/-- The matrix `A ^ 2 + B ^ 2 + I_n` whose determinant appears in the problem. -/\ndef TargetMatrix {n : ℕ} (A B : Matrix (Fin n) (Fin n) ℝ) : Matrix (Fin n) (Fin n) ℝ :=\n A ^ 2 + B ^ 2 + IdentityMatrix n\n\n/-- The proposition asserted by the problem. For every natural number `n` and every\npair of commuting real `n × n` matrices `A` and `B`, the determinant of\n`A ^ 2 + B ^ 2 + I_n` is nonnegative. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (A B : Matrix (Fin n) (Fin n) ℝ),\n CommuteMatrices A B → (TargetMatrix A B).det ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84d2e696-8d0d-5072-92cc-a436a3dba172", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "650b0e732d3e404819365a05c02dcdef4e17d2c9d2e4eb19ff71ae19fb2b0393", "task_path": "tasks/nmp3_84d2e696-8d0d-5072-92cc-a436a3dba172", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84d2e696-8d0d-5072-92cc-a436a3dba172", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_84d3e5cf-bd5d-5dd0-9d2f-7759b6652df4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, $c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a^{2}}{b^{2}}+\\frac{b^{2}}{c^{2}}+\\frac{c^{2}}{a^{2}}+\\frac{2abc}{a^{3}+b^{3}+c^{3}}\\ge\\frac{11}{3}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable positive-real inequality\n\nThe original problem asks for a proof of a universal inequality over positive\nreal numbers. The declarations below record its domain, its left-hand side,\nits inequality predicate, and the complete universally quantified proposition.\nNo proof of the proposition is supplied.\n-/\n\nnamespace Problem\n\n/-- The three variables `a`, `b`, and `c` are all positive real numbers. -/\ndef PositiveDomain (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the displayed inequality:\n`a^2 / b^2 + b^2 / c^2 + c^2 / a^2 + 2abc / (a^3 + b^3 + c^3)`. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a ^ 2 / b ^ 2 + b ^ 2 / c ^ 2 + c ^ 2 / a ^ 2 +\n (2 * a * b * c) / (a ^ 3 + b ^ 3 + c ^ 3)\n\n/-- The displayed inequality as a predicate on real triples. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ (11 : ℝ) / 3\n\n/-- The complete assertion of the problem: for every triple of positive real\nnumbers `a`, `b`, and `c`, the displayed non-strict inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveDomain a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84d3e5cf-bd5d-5dd0-9d2f-7759b6652df4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8e4c9ef9521ca1954df51ea05c96199c65e13613047800e858617a142b75d4cc", "task_path": "tasks/nmp3_84d3e5cf-bd5d-5dd0-9d2f-7759b6652df4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "84d3e5cf-bd5d-5dd0-9d2f-7759b6652df4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_850de133-a103-5be1-a48f-83fa4510239d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- (abc)^{2}\\,(a+b+c)^{3}\\,(-a+b+c)\\,(a-b+c)\\,(a+b-c)\\;\\ge\\;(a^{2}+b^{2}+c^{2})^{3}\\,(-a^{2}+b^{2}+c^{2})\\,(a^{2}-b^{2}+c^{2})\\,(a^{2}+b^{2}-c^{2})\\,. \n-- \\]\n/-\nFormal statement of the inequality problem.\n\nThe original problem asks, for positive real numbers `a, b, c`, to prove\n\n (abc)^2 (a + b + c)^3 (-a + b + c)(a - b + c)(a + b - c)\n ≥ (a^2 + b^2 + c^2)^3 (-a^2 + b^2 + c^2)(a^2 - b^2 + c^2)(a^2 + b^2 - c^2).\n\nOnly the statement is formalized here; no proof is supplied.\n-/\n\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\npublic def LHS (a b c : ℝ) : ℝ :=\n (a * b * c) ^ 2 * (a + b + c) ^ 3 * (-a + b + c) * (a - b + c) * (a + b - c)\n\n/-- The right-hand side of the inequality. -/\npublic def RHS (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) ^ 3 *\n (-(a ^ 2) + b ^ 2 + c ^ 2) * (a ^ 2 - b ^ 2 + c ^ 2) * (a ^ 2 + b ^ 2 - c ^ 2)\n\n/-- The pointwise inequality asserted in the problem, for a fixed triple of reals. -/\npublic def Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ RHS a b c\n\n/-- The full universally quantified statement of the problem: for every triple of\npositive real numbers, the displayed inequality holds. -/\npublic def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "850de133-a103-5be1-a48f-83fa4510239d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "99bbf6a407fb322e8b525a7f39dc36d7ac9a1b5e8b92840ab0485bdcf680041e", "task_path": "tasks/nmp3_850de133-a103-5be1-a48f-83fa4510239d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "850de133-a103-5be1-a48f-83fa4510239d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_85144383-d199-5473-9296-7507878afdc5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The lengths of the sides of a convex hexagon $ABCDEF$ satisfy $AB=BC$, $CD=DE$, $EF=FA$. Prove that \n-- \\[\n-- \\frac{BC}{BE}+\\frac{DE}{DA}+\\frac{FA}{FC}\\ge\\frac32\\,.\n-- \\]\nmodule\n\n/-\nFormal statement of the convex-hexagon length inequality.\n\nThe ambient plane is represented by the real Euclidean vector space of\ndimension two. `ConvexHexagon` records that the six supplied points occur\nas the vertices of a strictly convex hexagon in the cyclic order in which\nthey are named; reversing the order is allowed, since the statement does not\nprescribe an orientation.\n-/\n\npublic import Mathlib\n\n@[expose] public section\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used for the vertices of the hexagon. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The signed area (two-dimensional cross product) of two displacement vectors. -/\ndef cross (u v : Plane) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/--\nThe six distinct points `p 0, ..., p 5` are in strictly convex position in the\ndisplayed cyclic order and are oriented counterclockwise. Equivalently, every\ntriple of vertices taken in increasing index order has strictly positive signed\narea.\n-/\ndef StrictlyConvexCyclicCCW (p : Fin 6 → Plane) : Prop :=\n Function.Injective p ∧\n ∀ i j k : Fin 6, i < j → j < k →\n 0 < cross (p j - p i) (p k - p i)\n\n/--\n`A B C D E F` is a strictly convex hexagon whose vertices are encountered in\nthe cyclic order `A, B, C, D, E, F`. Both possible orientations are admitted.\n-/\ndef ConvexHexagon (A B C D E F : Plane) : Prop :=\n StrictlyConvexCyclicCCW ![A, B, C, D, E, F] ∨\n StrictlyConvexCyclicCCW ![A, F, E, D, C, B]\n\n/-- The Euclidean length of the segment joining two points. -/\ndef edgeLength (A B : Plane) : ℝ := dist A B\n\n/-- The inequality from the problem, for an ordered six-tuple of points. -/\ndef HexagonInequality (A B C D E F : Plane) : Prop :=\n edgeLength B C / edgeLength B E +\n edgeLength D E / edgeLength D A +\n edgeLength F A / edgeLength F C ≥ (3 : ℝ) / 2\n\n/--\nThe complete theorem statement: for every convex hexagon `ABCDEF` satisfying\n`AB = BC`, `CD = DE`, and `EF = FA`, the stated sum of length ratios is at\nleast `3/2`.\n-/\ndef Target : Prop :=\n ∀ A B C D E F : Plane,\n ConvexHexagon A B C D E F →\n edgeLength A B = edgeLength B C →\n edgeLength C D = edgeLength D E →\n edgeLength E F = edgeLength F A →\n HexagonInequality A B C D E F\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "85144383-d199-5473-9296-7507878afdc5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "680d1f98f15d11890a2383e2f47f09490ba1eae8d957f413ecb9c62736913afd", "task_path": "tasks/nmp3_85144383-d199-5473-9296-7507878afdc5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "85144383-d199-5473-9296-7507878afdc5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_85231ff3-8e01-5007-8bab-075f80bb52be", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $2n+1$ real numbers $w_1,w_2,\\dots,w_{2n+1}$ with $n\\ge1$ an integer, suppose that for each $i$ ($1\\le i\\le 2n+1$) the $2n$ numbers $\\{w_j\\mid j\\neq i\\}$ can be split into two groups of $n$ elements each whose sums are equal. Prove that $w_1=w_2=\\dots =w_{2n+1}$.\nimport Mathlib\n\n/-!\n# Equal-sum splits after deleting one term\n\nThis file formalizes the statement of the problem as a proposition-valued\ndefinition. The original indices `1, ..., 2n+1` are represented by the finite\ntype `Fin (2 * n + 1)`; this is only a zero-based relabeling of the same index\nset.\n-/\n\nnamespace Problem\n\n/-- The `2 * n` entries of `w` other than `w i` can be partitioned into two\ndisjoint groups `A` and `B`, each of cardinality `n`, with equal sums.\n\nThe equality `A ∪ B = Finset.univ.erase i` says that the two groups use every\nindex except `i` exactly once. Together with `Disjoint A B`, this is precisely\na split of the remaining elements into two groups. -/\ndef EqualNSplit (n : ℕ) (w : Fin (2 * n + 1) → ℝ)\n (i : Fin (2 * n + 1)) : Prop :=\n ∃ A B : Finset (Fin (2 * n + 1)),\n A.card = n ∧\n B.card = n ∧\n Disjoint A B ∧\n A ∪ B = Finset.univ.erase i ∧\n (∑ j ∈ A, w j) = ∑ j ∈ B, w j\n\n/-- For every index `i`, after deleting `w i`, the remaining `2 * n` entries\nallow a split into two groups of `n` entries with equal sums. -/\ndef Admissible (n : ℕ) (w : Fin (2 * n + 1) → ℝ) : Prop :=\n ∀ i : Fin (2 * n + 1), EqualNSplit n w i\n\n/-- All entries of the finite sequence `w` are equal. -/\ndef AllEqual (n : ℕ) (w : Fin (2 * n + 1) → ℝ) : Prop :=\n ∀ i j : Fin (2 * n + 1), w i = w j\n\n/-- The complete assertion: for every positive integer `n` and every real\nsequence `w` indexed by `Fin (2 * n + 1)`, if deleting any one entry leaves\n`2 * n` entries that can be split into two groups of `n` entries with equal\nsums, then all entries of `w` are equal. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 1 ≤ n → ∀ (w : Fin (2 * n + 1) → ℝ),\n Admissible n w → AllEqual n w\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "85231ff3-8e01-5007-8bab-075f80bb52be", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e90b31f0f8954248e2471170fe87b95956e189b3ef5fc9c25eabd96cb22bbec9", "task_path": "tasks/nmp3_85231ff3-8e01-5007-8bab-075f80bb52be", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "85231ff3-8e01-5007-8bab-075f80bb52be", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_85446ece-92c1-5843-9f16-126a9c801e28", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x_{1},x_{2},\\dots ,x_{1000}$ be integers. Suppose that for every positive integer $k\\le 672$ the sum \n-- \\[\n-- \\sum_{i=1}^{1000}x_{i}^{k}\n-- \\]\n-- is divisible by $2017$ (where $2017$ is prime). Prove that each $x_{i}$ is divisible by $2017$; i.e. $x_{1}\\equiv x_{2}\\equiv\\cdots\\equiv x_{1000}\\equiv0\\pmod{2017}$.\nimport Mathlib\n\n/-!\n# Formal statement of the power-sum congruence problem\n\nThe original problem asks: if 1000 integers have, for every positive\ninteger `k ≤ 672`, a sum of `k`-th powers divisible by the prime `2017`,\nthen every one of the integers is divisible by `2017`.\n\nThe main declaration is `Problem.Target`. It is a proposition and no proof\nof it is supplied here. The auxiliary definitions spell out the summation,\ndivisibility, and congruence language of the source. The final equivalence\nlemma records that the divisibility conclusion and the displayed congruence\nconclusion are the same assertion, but the target itself is stated in the\nprimary divisibility form requested in the first conclusion clause.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The `k`-th power sum `∑_{i=1}^{1000} x_i ^ k`. The type `Fin 1000`\nis a 1000-element index set; it is the standard zero-based relabelling of\nthe source indices `1, ..., 1000`. -/\ndef PowerSum (x : Fin 1000 → ℤ) (k : ℕ) : ℤ :=\n ∑ i : Fin 1000, x i ^ k\n\n/-- Integer divisibility by the fixed modulus `2017`. -/\ndef DivisibleBy2017 (a : ℤ) : Prop :=\n (2017 : ℤ) ∣ a\n\n/-- Congruence of an integer to zero modulo `2017`, represented by equality\nto zero in `ZMod 2017`. -/\ndef CongruentZeroMod2017 (a : ℤ) : Prop :=\n (a : ZMod 2017) = 0\n\n/-- The parenthetical supplied condition that `2017` is prime. -/\ndef Prime2017 : Prop :=\n Nat.Prime 2017\n\n/-- The hypothesis of the problem: for every positive integer `k ≤ 672`,\nthe `k`-th power sum of the entries of `x` is divisible by `2017`. -/\ndef PowerSumHypothesis (x : Fin 1000 → ℤ) : Prop :=\n ∀ k : ℕ, 0 < k → k ≤ 672 → DivisibleBy2017 (PowerSum x k)\n\n/-- The asserted conclusion: every one of the 1000 integers is divisible\nby `2017`. -/\ndef AllDivisibleBy2017 (x : Fin 1000 → ℤ) : Prop :=\n ∀ i : Fin 1000, DivisibleBy2017 (x i)\n\n/-- The equivalent displayed congruence form of the conclusion:\n`x_1 ≡ x_2 ≡ ⋯ ≡ x_1000 ≡ 0 (mod 2017)`. -/\ndef AllCongruentZeroMod2017 (x : Fin 1000 → ℤ) : Prop :=\n ∀ i : Fin 1000, CongruentZeroMod2017 (x i)\n\n/-- Divisibility by `2017` is the same as vanishing in `ZMod 2017`. -/\ntheorem congruentZeroMod2017_iff_divisibleBy2017 (a : ℤ) :\n CongruentZeroMod2017 a ↔ DivisibleBy2017 a := by\n simpa [CongruentZeroMod2017, DivisibleBy2017] using\n (ZMod.intCast_zmod_eq_zero_iff_dvd a 2017)\n\n/-- The congruence form of the conclusion is equivalent to the divisibility\nform for the whole 1000-term tuple. -/\ntheorem allCongruentZeroMod2017_iff_allDivisibleBy2017\n (x : Fin 1000 → ℤ) :\n AllCongruentZeroMod2017 x ↔ AllDivisibleBy2017 x := by\n simp only [AllCongruentZeroMod2017, AllDivisibleBy2017]\n constructor\n · intro h i\n exact (congruentZeroMod2017_iff_divisibleBy2017 (x i)).mp (h i)\n · intro h i\n exact (congruentZeroMod2017_iff_divisibleBy2017 (x i)).mpr (h i)\n\n/-- The complete formal statement of the original problem.\n\nThe tuple `x` is introduced first. The parenthetical primality of `2017`,\nthe power-sum hypothesis, and the conclusion then occur in the same logical\norder as in the source. The hypothesis contains a bounded universal\nquantifier over positive natural numbers `k`; the conclusion contains a\nuniversal quantifier over the 1000 positions. -/\ndef Target : Prop :=\n ∀ x : Fin 1000 → ℤ,\n Prime2017 →\n PowerSumHypothesis x →\n AllDivisibleBy2017 x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "85446ece-92c1-5843-9f16-126a9c801e28", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "50cfb5d8266643b1d2aa945fb634cb265d9d88f9c35f75c7393be1a4a361cade", "task_path": "tasks/nmp3_85446ece-92c1-5843-9f16-126a9c801e28", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "85446ece-92c1-5843-9f16-126a9c801e28", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_854a44bf-2fa2-5905-9a77-1b6d9fb5758a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f(x)=a_0x^d+a_1x^{d-1}+\\cdots +a_d\\in\\mathbb Z[a_0,a_1,\\dots ,a_d,x]$ be a polynomial. Define the iterates by $f^{1}(x)=f(x)$ and $f^{k+1}(x)=f\\!\\bigl(f^{k}(x)\\bigr)$ for $k\\ge1$. If $m$ and $n$ are relatively prime natural numbers, prove that the polynomial $(f^{mn}(x)-x)(f(x)-x)$ is divisible by $(f^{m}(x)-x)(f^{n}(x)-x)$ in the ring $\\mathbb Z[a_0,a_1,\\dots ,a_d,x]$.\nimport Mathlib\n\n/-!\n# Formalization of a polynomial-divisibility problem\n\nThe source works in the multivariate polynomial ring\n`ℤ[a_0, ..., a_d, x]`. We model this ring literally as\n`MvPolynomial (Fin (d + 2)) ℤ`. The variable with index `0` is `x`, and the\nvariable with index `i + 1` is the coefficient `a_i`.\n\nThe notation `f^{k}(x)` in the source denotes the `k`-th iterate under\ncomposition, not a power in the polynomial ring. `polynomialIterate`\nformalizes that iterate by replacing `x` by the previous iterate inside `f`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The variable `x` in the ring `ℤ[a_0, ..., a_d, x]`, represented as index\n`0` of `Fin (d + 2)`. -/\ndef xVariable (d : ℕ) : MvPolynomial (Fin (d + 2)) ℤ :=\n MvPolynomial.X 0\n\n/-- The coefficient variable `a_i` in the ring `ℤ[a_0, ..., a_d, x]`,\nrepresented as the variable at index `i + 1`. -/\ndef coefficientVariable (d : ℕ) (i : Fin (d + 1)) : MvPolynomial (Fin (d + 2)) ℤ :=\n MvPolynomial.X (Fin.succ i)\n\n/-- The generic polynomial\n`f(x) = a_0 x^d + a_1 x^(d-1) + ... + a_d`\nwith symbolic integer coefficients `a_0, ..., a_d`. -/\ndef genericPolynomial (d : ℕ) : MvPolynomial (Fin (d + 2)) ℤ :=\n ∑ i : Fin (d + 1),\n coefficientVariable d i * xVariable d ^ (d - i.val)\n\n/-- Substitute the polynomial `f` for the distinguished variable `x` in the\npolynomial `p`, leaving all coefficient variables `a_i` fixed. -/\ndef substituteX {d : ℕ} (f p : MvPolynomial (Fin (d + 2)) ℤ) :\n MvPolynomial (Fin (d + 2)) ℤ :=\n MvPolynomial.aeval\n (fun i : Fin (d + 2) => if i = 0 then f else MvPolynomial.X i) p\n\n/-- The `k`-th compositional iterate of a polynomial `f`.\n\nThe value at `k = 0` is the identity polynomial `x`; the value at `k = 1`\nis the original polynomial `f`; and for `k ≥ 1` the next iterate is obtained\nby substituting the previous iterate into `f`, matching\n`f^{k+1}(x) = f(f^k(x))`. -/\ndef polynomialIterate {d : ℕ} (f : MvPolynomial (Fin (d + 2)) ℤ) :\n ℕ → MvPolynomial (Fin (d + 2)) ℤ\n | 0 => xVariable d\n | 1 => f\n | k + 2 => substituteX f (polynomialIterate f (k + 1))\n\n/-- The proposition asserted by the problem: for all natural numbers `d`,\n`m`, and `n` with `m` and `n` relatively prime, the polynomial\n`(f^{mn}(x) - x) * (f(x) - x)` is divisible by\n`(f^m(x) - x) * (f^n(x) - x)` in `ℤ[a_0, ..., a_d, x]`.\n\nThe positivity assumptions on `m` and `n` spell out the standard\ninterpretation of \"relatively prime natural numbers\" in the presence of the\nsource's iterate notation `f^k` with `k ≥ 1`; in particular `f^m`, `f^n`,\nand `f^(mn)` are all iterates at positive indices. -/\ndef Target : Prop :=\n ∀ (d m n : ℕ),\n 0 < m →\n 0 < n →\n Nat.Coprime m n →\n let f : MvPolynomial (Fin (d + 2)) ℤ := genericPolynomial d\n let fiter : ℕ → MvPolynomial (Fin (d + 2)) ℤ := polynomialIterate f\n let x : MvPolynomial (Fin (d + 2)) ℤ := xVariable d\n (((fiter m - x) * (fiter n - x)) ∣\n ((fiter (m * n) - x) * (f - x)))\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "854a44bf-2fa2-5905-9a77-1b6d9fb5758a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cf9d8485dff3b8ba3e9fed62aa238661fb832006d44fda17704771768e42cc38", "task_path": "tasks/nmp3_854a44bf-2fa2-5905-9a77-1b6d9fb5758a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "854a44bf-2fa2-5905-9a77-1b6d9fb5758a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_85551f7a-7ddd-5908-a662-96ef8dbabd65", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $abc=8$. Prove that \n-- \\[\n-- \\frac{1}{\\sqrt{1+a}}+\\frac{1}{\\sqrt{1+b}}+\\frac{1}{\\sqrt{1+c}}<2\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks one to prove a strict upper bound for a sum of three\nreciprocals of square roots, under positivity and product constraints on three\nreal variables.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and\n`c` whose product is `8`, the sum of the reciprocals of the square roots of\n`1 + a`, `1 + b`, and `1 + c` is strictly less than `2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a * b * c = 8 →\n 1 / Real.sqrt (1 + a) + 1 / Real.sqrt (1 + b) + 1 / Real.sqrt (1 + c) < 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "85551f7a-7ddd-5908-a662-96ef8dbabd65", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "611c36d641306f7d9cac2d328b53f3e4eecb16ae00daec7c5216e8ee95eec491", "task_path": "tasks/nmp3_85551f7a-7ddd-5908-a662-96ef8dbabd65", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "85551f7a-7ddd-5908-a662-96ef8dbabd65", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8564665f-a5f4-5172-858c-6f65bdeb0c50", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a function $f$ defined for real numbers and satisfying $f(2x)=4x-2f(x)-x^{2}$ for all $x$ and $f(0)=0$, evaluate the limit $\\displaystyle\\lim_{x\\to0}\\frac{x-f(x)}{x^{2}}$ (if it exists).\nimport Mathlib\n\nopen Filter\nopen scoped Topology\n\nnamespace Problem\n\n/-- A real-valued function satisfies the functional equation and the stated value at zero. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n (∀ x : ℝ, f (2 * x) = 4 * x - 2 * f x - x ^ 2) ∧\n f 0 = 0\n\n/-- The quotient whose two-sided limit at zero is requested. -/\nnoncomputable def differenceQuotient (f : ℝ → ℝ) (x : ℝ) : ℝ :=\n (x - f x) / x ^ 2\n\n/-- The two-sided punctured limit of the quotient at zero equals `L`. -/\ndef HasLimit (f : ℝ → ℝ) (L : ℝ) : Prop :=\n Tendsto (differenceQuotient f) (𝓝[≠] (0 : ℝ)) (𝓝 L)\n\n/-- The requested limit exists for `f`. -/\ndef LimitExists (f : ℝ → ℝ) : Prop :=\n ∃ L : ℝ, HasLimit f L\n\n/-- A proposed value `L` is correct when every limit that exists for an admissible\nfunction has value `L`. -/\ndef AnswerCorrect (L : ℝ) : Prop :=\n ∀ f : ℝ → ℝ, Admissible f → LimitExists f →\n ∀ M : ℝ, HasLimit f M → M = L\n\n/-- The target assertion: under the stated hypotheses, if the limit exists, its value is `1 / 6`. -/\ndef Target : Prop :=\n AnswerCorrect (1 / 6)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8564665f-a5f4-5172-858c-6f65bdeb0c50", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "af7f7d2d2b450642e57a88913a6322ff8d939cb3b5f9881e5176c72a358495ac", "task_path": "tasks/nmp3_8564665f-a5f4-5172-858c-6f65bdeb0c50", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8564665f-a5f4-5172-858c-6f65bdeb0c50", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_857f0c6b-c85c-5c0f-915a-50e752922c63", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(x_k)_{k\\ge 1}$ be defined by \n-- \\[\n-- x_k = k\\qquad\\text{for }1\\le k\\le 2006,\n-- \\] \n-- and for $k\\ge 2006$ \n-- \\[\n-- x_{k+1}=x_k+x_{k-2005}\\,. \n-- \\] \n-- Show that the sequence $(x_k)$ contains $2005$ consecutive terms each divisible by $2006$; i.e., there exists an index $N$ such that $2006\\mid x_N,\\;2006\\mid x_{N+1},\\dots,2006\\mid x_{N+2004}$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The initial segment prescribed by the problem: `a k = k` for\n`1 ≤ k ≤ 2006`. No condition is imposed at the auxiliary index `0`. -/\ndef InitialCondition (a : ℕ → ℕ) : Prop :=\n ∀ k : ℕ, 1 ≤ k → k ≤ 2006 → a k = k\n\n/-- The recurrence prescribed by the problem for every `k ≥ 2006`. -/\ndef RecurrenceCondition (a : ℕ → ℕ) : Prop :=\n ∀ k : ℕ, 2006 ≤ k → a (k + 1) = a k + a (k - 2005)\n\n/-- A sequence satisfying both defining clauses from the problem. -/\ndef IsProblemSequence (a : ℕ → ℕ) : Prop :=\n InitialCondition a ∧ RecurrenceCondition a\n\n/-- The sequence described in the problem, defined by strong recursion.\nThe value at `0` is an auxiliary total-function value outside the problem's\nindex set `k ≥ 1`. -/\nnoncomputable def sequence : ℕ → ℕ\n | 0 => 0\n | n + 1 =>\n if n + 1 ≤ 2006 then n + 1\n else sequence n + sequence (n + 1 - 2006)\ntermination_by n => n\ndecreasing_by\n · omega\n · exact Nat.sub_lt_self (by omega) (by omega)\n\n/-- There exist `2005` consecutive terms, starting at a positive index `N`,\nall divisible by `2006`. -/\ndef Has2005ConsecutiveMultiples (a : ℕ → ℕ) : Prop :=\n ∃ N : ℕ, 1 ≤ N ∧ ∀ i : ℕ, i < 2005 → (2006 : ℕ) ∣ a (N + i)\n\n/-- The assertion requested by the problem for its recursively defined sequence. -/\ndef Target : Prop :=\n Has2005ConsecutiveMultiples sequence\n\n\ntheorem sequence_zero : sequence 0 = 0 := by simp [sequence]\n\ntheorem sequence_init (k : ℕ) (h1 : 1 ≤ k) (h2 : k ≤ 2006) :\n sequence k = k := by\n cases k with\n | zero => omega\n | succ n =>\n simp [sequence, h2]\n\ntheorem sequence_step (k : ℕ) (hk : 2006 ≤ k) :\n sequence (k + 1) = sequence k + sequence (k - 2005) := by\n have hnot : ¬ k + 1 ≤ 2006 := by omega\n have hsub : k + 1 - 2006 = k - 2005 := by omega\n simp [sequence, hnot, hsub]\n\ntheorem sequence_isProblemSequence : IsProblemSequence sequence := by\n constructor\n · intro k h1 h2\n exact sequence_init k h1 h2\n · intro k hk\n exact sequence_step k hk\n\n\ntheorem sequence_unique (a : ℕ → ℕ) (ha : IsProblemSequence a) :\n ∀ k : ℕ, 1 ≤ k → a k = sequence k := by\n intro k\n induction k using Nat.strong_induction_on with\n | h k ih =>\n intro hk\n by_cases hle : k ≤ 2006\n · rw [ha.1 k hk hle, sequence_init k hk hle]\n · have hkgt : 2006 < k := by omega\n have hk1 : 1 ≤ k - 1 := by omega\n have hk2 : 1 ≤ k - 2006 := by omega\n have hlt1 : k - 1 < k := by omega\n have hlt2 : k - 2006 < k := by omega\n have hk_eq : k - 1 + 1 = k := by omega\n have hsub : k - 1 - 2005 = k - 2006 := by omega\n have hstep_a := ha.2 (k - 1) (by omega)\n have hstep_s := sequence_step (k - 1) (by omega)\n have hA : a k = a (k - 1) + a (k - 2006) := by\n simpa [hk_eq, hsub] using hstep_a\n have hS : sequence k = sequence (k - 1) + sequence (k - 2006) := by\n simpa [hk_eq, hsub] using hstep_s\n have ih1 := ih (k - 1) hlt1 hk1\n have ih2 := ih (k - 2006) hlt2 hk2\n rw [hA, hS, ih1, ih2]\n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "857f0c6b-c85c-5c0f-915a-50e752922c63", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c458c0a1c1f64aaf336d9a033c5881f0ec11c242692251ff759de60dc1efc849", "task_path": "tasks/nmp3_857f0c6b-c85c-5c0f-915a-50e752922c63", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "857f0c6b-c85c-5c0f-915a-50e752922c63", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_858004ac-7ac9-54f1-aac4-7d791e77ea9a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- $a,b,c>0$, $a^{2}+b^{2}+c^{2}=3$. Prove that \n-- \\[\n-- a^{4}+b^{4}+c^{4}+a^{3}+b^{3}+c^{3}+abc\\ge 7.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion in the problem: for all positive real numbers `a`, `b`, and `c`\nwhose squares sum to `3`, the sum\n`a^4 + b^4 + c^4 + a^3 + b^3 + c^3 + a*b*c` is at least `7`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = 3 →\n 7 ≤ a ^ 4 + b ^ 4 + c ^ 4 + a ^ 3 + b ^ 3 + c ^ 3 + a * b * c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "858004ac-7ac9-54f1-aac4-7d791e77ea9a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "64eb2c3e0e6ac48d83546596661f0cb58436758c50923706668e19612445d100", "task_path": "tasks/nmp3_858004ac-7ac9-54f1-aac4-7d791e77ea9a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "858004ac-7ac9-54f1-aac4-7d791e77ea9a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8600c201-1d29-55e0-8798-9d44e1dd2348", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For non‑negative real numbers $a$, $b$, $c$, prove that \n-- \\[\n-- a^{5}+b^{5}+c^{5}+2\\bigl(a^{2}b^{3}+b^{2}c^{3}+c^{2}a^{3}\\bigr)\\ge a^{4}b+b^{4}c+c^{4}a+2\\bigl(ab^{4}+bc^{4}+ca^{4}\\bigr).\\]\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThis file records the inequality problem from `problem.md` as an unproved\nproposition. It is a statement formalization only; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a ^ 5 + b ^ 5 + c ^ 5 +\n 2 * (a ^ 2 * b ^ 3 + b ^ 2 * c ^ 3 + c ^ 2 * a ^ 3)\n\n/-- The right-hand side of the displayed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n a ^ 4 * b + b ^ 4 * c + c ^ 4 * a +\n 2 * (a * b ^ 4 + b * c ^ 4 + c * a ^ 4)\n\n/-- The displayed inequality, as a predicate of its three real arguments. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full assertion: for all non-negative real numbers `a`, `b`, and `c`,\nthe displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8600c201-1d29-55e0-8798-9d44e1dd2348", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fe2a4d512a80290e9c4cb1c99f2d9cdb594f4edc13495e7629fa453997f425a0", "task_path": "tasks/nmp3_8600c201-1d29-55e0-8798-9d44e1dd2348", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8600c201-1d29-55e0-8798-9d44e1dd2348", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_86079e6f-7c35-56d8-98d1-bb444fbab5b5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given triangle $ABC$. Let $P$ be a point on side $AC$ and $Q$ a point on segment $PC$ such that \n-- \\[\n-- \\frac{PA}{PC}=\\frac{QP}{QC}.\n-- \\] \n-- Let the circumcircle of $\\triangle ABQ$ meet line $BC$ again at $R$. Let the circumcircles of $\\triangle PAB$ and $\\triangle PQR$ intersect again (besides $P$) at $S$. Let $D$ be the intersection $SP\\cap AB$. Prove that the four points $B,\\;S,\\;R,\\;D$ are concyclic.\nmodule\npublic import Mathlib.Analysis.Real.Sqrt\n\npublic section\n\n/-!\n# Formal statement: concyclicity in a configuration of two circles\n\nThis file gives an explicit coordinate model of the planar configuration in\n`problem.md`. Points are points of the real Euclidean plane with coordinates\n`(x, y)`. Circumcircles are represented through the predicate `Concyclic`,\nwhich says that four points lie on one circle of positive radius.\n\nThe declaration `Problem.Target` is a proposition, not a proof of the problem.\nIts hypotheses include the defining/uniqueness properties of the intersections\nthat are named in the problem statement.\n-/\n\nnamespace Problem\n\n/-- A point of the real Euclidean plane. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- Squared Euclidean distance between two plane points. -/\ndef sqDistance (X Y : Point) : ℝ :=\n (X.1 - Y.1) ^ 2 + (X.2 - Y.2) ^ 2\n\n/-- Euclidean distance between two plane points. -/\nnoncomputable def distance (X Y : Point) : ℝ :=\n Real.sqrt (sqDistance X Y)\n\n/-- Three points are collinear when the determinant of the two displacement\nvectors from the first point vanishes. -/\ndef Collinear (A B C : Point) : Prop :=\n (B.1 - A.1) * (C.2 - A.2) - (B.2 - A.2) * (C.1 - A.1) = 0\n\n/-- `OnSegment A C P` means that `P` belongs to the closed segment from `A`\nto `C`, parametrized by `t ∈ [0,1]`. -/\ndef OnSegment (A C P : Point) : Prop :=\n ∃ t : ℝ,\n 0 ≤ t ∧ t ≤ 1 ∧\n P.1 = A.1 + t * (C.1 - A.1) ∧\n P.2 = A.2 + t * (C.2 - A.2)\n\n/-- `OnCircle O r P` means that `P` lies on the circle with center `O` and\nradius `r`, expressed by equality of squared distances. -/\ndef OnCircle (O : Point) (r : ℝ) (P : Point) : Prop :=\n sqDistance P O = r ^ 2\n\n/-- Four points are concyclic when there is a circle of positive radius\npassing through all of them. -/\ndef Concyclic (A B C D : Point) : Prop :=\n ∃ O : Point, ∃ r : ℝ,\n 0 < r ∧\n OnCircle O r A ∧ OnCircle O r B ∧ OnCircle O r C ∧ OnCircle O r D\n\n/-- `R` is the second intersection of the circumcircle of triangle `ABQ`\nwith the line `BC`. The point `B` is the already known intersection, and\n`Concyclic A B Q R` expresses membership of `R` in the circumcircle of\n`A`, `Q`, and `B` because `A`, `B`, and `Q` are noncollinear. -/\ndef IsSecondIntersectionABQWithBC (A B C Q R : Point) : Prop :=\n ¬ Collinear A B Q ∧\n Concyclic A B Q R ∧\n Collinear B C R ∧\n R ≠ B ∧\n ∀ X : Point,\n Collinear B C X → Concyclic A B Q X → X = B ∨ X = R\n\n/-- `S` is the second intersection, different from `P`, of the circumcircles\nof triangles `PAB` and `PQR`. The final universal condition states that there\nis no other common point besides `P` and `S`. -/\ndef IsSecondIntersectionOfCircumcircles (P A B Q R S : Point) : Prop :=\n ¬ Collinear P A B ∧\n ¬ Collinear P Q R ∧\n Concyclic P A B S ∧\n Concyclic P Q R S ∧\n S ≠ P ∧\n ∀ X : Point,\n Concyclic P A B X → Concyclic P Q R X → X = P ∨ X = S\n\n/-- `D` is the unique intersection of the line through `S` and `P` with the\nline through `A` and `B`. -/\ndef IsIntersectionSPAndAB (S P A B D : Point) : Prop :=\n Collinear S P D ∧\n Collinear A B D ∧\n ∀ X : Point,\n Collinear S P X → Collinear A B X → X = D\n\n/-- The initial non-circular part of the configuration: `ABC` is a triangle,\n`P` lies on side `AC`, `Q` lies on segment `PC`, and the length ratio in the\nproblem holds (with nonzero denominators). -/\ndef InitialConfiguration (A B C P Q : Point) : Prop :=\n ¬ Collinear A B C ∧\n OnSegment A C P ∧\n OnSegment P C Q ∧\n distance P C ≠ 0 ∧\n distance Q C ≠ 0 ∧\n distance P A / distance P C = distance Q P / distance Q C\n\n/-- The assertion of the problem: for every initial configuration, and for\nthe specified second intersections `R` and `S` and line intersection `D`,\nthe four points `B`, `S`, `R`, and `D` are concyclic. -/\ndef Target : Prop :=\n ∀ A B C P Q : Point,\n InitialConfiguration A B C P Q →\n ∀ R : Point,\n IsSecondIntersectionABQWithBC A B C Q R →\n ∀ S : Point,\n IsSecondIntersectionOfCircumcircles P A B Q R S →\n ∀ D : Point,\n IsIntersectionSPAndAB S P A B D →\n Concyclic B S R D\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "86079e6f-7c35-56d8-98d1-bb444fbab5b5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cbc587e52936b1900f0cb6bba85a32123bf7d7d07308ba7d2e1ca539b76f092e", "task_path": "tasks/nmp3_86079e6f-7c35-56d8-98d1-bb444fbab5b5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "86079e6f-7c35-56d8-98d1-bb444fbab5b5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_862bb9a9-ccc1-54ca-83b2-0306f0649bc6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle (i.e. $a,b,c>0$ and $a+b>c$, $b+c>a$, $c+a>b$). Prove that \n-- \\[\n-- (a-b)(a-c)\\Bigl(\\frac{4bc}{a}-a\\Bigr)+(b-c)(b-a)\\Bigl(\\frac{4ca}{b}-b\\Bigr)+(c-a)(c-b)\\Bigl(\\frac{4ab}{c}-c\\Bigr)\\ge0\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The three strict triangle inequalities for real numbers `a`, `b`, and `c`. -/\ndef TriangleInequalities (a b c : ℝ) : Prop :=\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- `a`, `b`, and `c` are the side lengths of a (nondegenerate) triangle:\nthey are all positive and satisfy the three strict triangle inequalities. -/\ndef IsTriangleSide (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ TriangleInequalities a b c\n\n/-- The left-hand side of the inequality in the problem. -/\ndef InequalityLHS (a b c : ℝ) : ℝ :=\n (a - b) * (a - c) * (((4 : ℝ) * b * c) / a - a) +\n (b - c) * (b - a) * (((4 : ℝ) * c * a) / b - b) +\n (c - a) * (c - b) * (((4 : ℝ) * a * b) / c - c)\n\n/-- The inequality asserted by the problem, for an arbitrary real triple. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n InequalityLHS a b c ≥ 0\n\n/-- The full universal statement of the problem: for every positive real triple\nsatisfying the strict triangle inequalities, the displayed expression is\nnonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsTriangleSide a b c → InequalityHolds a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "862bb9a9-ccc1-54ca-83b2-0306f0649bc6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "245e23c9cf822bc75c6d1ea52c90efc99b56baa09158c4e9bac6575724aaddd1", "task_path": "tasks/nmp3_862bb9a9-ccc1-54ca-83b2-0306f0649bc6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "862bb9a9-ccc1-54ca-83b2-0306f0649bc6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8637aa61-31f7-586a-9628-a00fb59c5084", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For every positive integer $n$ we denote by $d(n)$ the sum of its digits in the decimal representation. Prove that for each positive integer $k$ there exists a positive integer $m$ such that the equation $x+d(x)=m$ has exactly $k$ solutions in the set of positive integers.\nimport Mathlib.Data.Nat.Digits.Lemmas\nimport Mathlib.Data.Set.Card\n\n/-!\n# Formal statement of the digit-sum preimage problem\n\nThe source problem uses `d(n)` for the sum of the decimal digits of a positive\ninteger `n`. We use Mathlib's `Nat.digits 10`, whose entries are the base-10\ndigits (least significant digit first), and sum that list. This total function\nagrees with the source definition on every positive integer; its value at `0`\nis irrelevant because all solution candidates below are required to be positive.\n-/\n\nnamespace Problem\n\n/-- `decimalDigitSum n` is the sum of the digits of `n` in base 10. -/\ndef decimalDigitSum (n : ℕ) : ℕ :=\n (Nat.digits 10 n).sum\n\n/-- `IsSolution m x` says that the positive integer `x` satisfies\n`x + d(x) = m`. The positivity condition is part of being a solution in the\nset of positive integers. -/\ndef IsSolution (m x : ℕ) : Prop :=\n 0 < x ∧ x + decimalDigitSum x = m\n\n/-- The set of positive integer solutions of `x + d(x) = m`. -/\ndef solutionSet (m : ℕ) : Set ℕ :=\n {x : ℕ | IsSolution m x}\n\n/-- `HasExactlyKSolutions k m` says that the equation `x + d(x) = m` has\nexactly `k` positive integer solutions: the solution set is finite and its\nnatural-number cardinality is `k`. -/\ndef HasExactlyKSolutions (k m : ℕ) : Prop :=\n (solutionSet m).Finite ∧ (solutionSet m).ncard = k\n\n/-- For every positive integer `k`, there is a positive integer `m` for which\n`x + d(x) = m` has exactly `k` positive integer solutions. -/\ndef Target : Prop :=\n ∀ k : ℕ, 0 < k → ∃ m : ℕ, 0 < m ∧ HasExactlyKSolutions k m\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8637aa61-31f7-586a-9628-a00fb59c5084", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c234221d375d7df7660f0b365ebbda7e4d3ce67a8fe3ccc9de23021b2cc6cf8e", "task_path": "tasks/nmp3_8637aa61-31f7-586a-9628-a00fb59c5084", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8637aa61-31f7-586a-9628-a00fb59c5084", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_86a9fe2f-ad1a-5596-a951-794a8734a347", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- \\sum_{cyc}\\frac{1}{a^{2}+ab+bc}\\ge \\frac{1}{ab+bc+ca}+\\frac{4}{a^{2}+b^{2}+c^{2}+ab+bc+ca}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: cyclic reciprocal inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\nthe cyclic reciprocal inequality\n\n`∑_cyc 1 / (a^2 + a*b + b*c) ≥ 1 / (a*b + b*c + c*a)\n + 4 / (a^2 + b^2 + c^2 + a*b + b*c + c*a)`.\n\nThe declarations below record the proposition only; no proof is supplied.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side, with the cyclic sum written out in the standard order\n`a → b → c → a`. -/\ndef cyclicLHS (a b c : ℝ) : ℝ :=\n 1 / (a ^ 2 + a * b + b * c) +\n 1 / (b ^ 2 + b * c + c * a) +\n 1 / (c ^ 2 + c * a + a * b)\n\n/-- The right-hand side of the asserted inequality. -/\ndef cyclicRHS (a b c : ℝ) : ℝ :=\n 1 / (a * b + b * c + c * a) +\n 4 / (a ^ 2 + b ^ 2 + c ^ 2 + a * b + b * c + c * a)\n\n/-- The full inequality of the problem: for all positive real `a`, `b`, `c`,\nthe cyclic reciprocal sum is at least the stated right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n cyclicLHS a b c ≥ cyclicRHS a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "86a9fe2f-ad1a-5596-a951-794a8734a347", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c7c6057d532cff4da74c8b960f2a94f3faa83f9e4b9c9097c1267306a117cb89", "task_path": "tasks/nmp3_86a9fe2f-ad1a-5596-a951-794a8734a347", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "86a9fe2f-ad1a-5596-a951-794a8734a347", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_86ce1e4e-77fa-5ce6-9e92-a08b2e39f648", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers such that $a+b+c=1$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{\\sqrt{a\\bigl(a+bc\\bigr)}}{\\,b+ca\\,}\\;\\le\\;\\frac{1}{2\\sqrt{abc}}\\,,\n-- \\] \n-- where the sum is taken cyclically over $(a,b,c)$.\nimport Mathlib\n\n/-!\n# Formalization of the cyclic radical inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, `c`\nwith sum one,\n\n`Σ_cyc sqrt (a * (a + b*c)) / (b + c*a) ≤ 1 / (2 * sqrt (a*b*c))`.\n\nThis file records the statement as a proposition-valued definition. No proof\nof the proposition is supplied.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- One cyclic summand `sqrt (a * (a + b*c)) / (b + c*a)`. -/\ndef cyclicTerm (a b c : ℝ) : ℝ :=\n Real.sqrt (a * (a + b * c)) / (b + c * a)\n\n/-- The sum cyclic over `(a,b,c)`, written out in full. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The right-hand side `1 / (2 * sqrt (a*b*c))`. -/\ndef cyclicRHS (a b c : ℝ) : ℝ :=\n 1 / (2 * Real.sqrt (a * b * c))\n\n/-- The admissible triples of the source problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 1\n\n/-- The assertion to be proved: for all positive reals summing to one, the\ncyclic sum is at most `1 / (2 * sqrt (a*b*c))`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n Admissible a b c →\n cyclicSum a b c ≤ cyclicRHS a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "86ce1e4e-77fa-5ce6-9e92-a08b2e39f648", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3090c9ed81681ac9199992235a5684ce716db1f55d474cbffce8c4d4ed148821", "task_path": "tasks/nmp3_86ce1e4e-77fa-5ce6-9e92-a08b2e39f648", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "86ce1e4e-77fa-5ce6-9e92-a08b2e39f648", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_870077dc-5e0f-522b-8635-4a5e057b6850", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be integers and $p$ an odd prime. Prove that if the quadratic polynomial $f(x)=ax^{2}+bx+c$ takes a perfect square integer value for $2p-1$ consecutive integer arguments $x$, then $p$ divides the discriminant $b^{2}-4ac$.\nimport Mathlib\n\n/-!\n# Formal statement: square values on consecutive arguments imply a discriminant divisibility\n\nThis file records the mathematical assertion from `problem.md` as an unproved\n`Prop`-valued definition. No proof of the assertion is supplied or required.\n-/\n\nnamespace Problem\n\n/-- The value of the integer-coefficient quadratic expression\n`a * x ^ 2 + b * x + c` at the integer argument `x`. -/\ndef polynomialValue (a b c x : Int) : Int :=\n a * x ^ 2 + b * x + c\n\n/-- The discriminant of the quadratic expression `a * x ^ 2 + b * x + c`. -/\ndef discriminant (a b c : Int) : Int :=\n b ^ 2 - 4 * a * c\n\n/-- An integer is a perfect square (in the integer sense) if it is the square of\nsome integer. In particular, negative integers are not perfect squares. -/\ndef IsPerfectSquareInteger (z : Int) : Prop :=\n ∃ y : Int, z = y ^ 2\n\n/-- The expression takes perfect-square integer values at `2 * p - 1`\nconsecutive integer arguments. The starting argument `x₀` is existentially\nchosen, and the consecutive arguments are `x₀, x₀ + 1, ..., x₀ + (2 * p - 2)`.\nThe square root witnessing each value is allowed to depend on the argument. -/\ndef HasConsecutiveSquareValues (a b c : Int) (p : Nat) : Prop :=\n ∃ x₀ : Int, ∀ k : Nat, k < 2 * p - 1 →\n IsPerfectSquareInteger (polynomialValue a b c (x₀ + (k : Int)))\n\n/-- `p` is an odd prime, expressed as a natural-number prime together with the\npredicate `Odd p`. -/\ndef IsOddPrime (p : Nat) : Prop :=\n p.Prime ∧ Odd p\n\n/-- The leading coefficient is nonzero, so `a * x ^ 2 + b * x + c` is a genuine\nquadratic polynomial rather than a polynomial of lower degree. -/\ndef IsQuadratic (a : Int) : Prop :=\n a ≠ 0\n\n/-- The hypothesis package of the problem, excluding the asserted divisibility\nconclusion: `a`, `b`, and `c` are integer coefficients, `p` is an odd prime,\nthe polynomial is genuinely quadratic, and the expression assumes perfect-square\ninteger values on `2 * p - 1` consecutive integer arguments. -/\ndef Hypotheses (a b c : Int) (p : Nat) : Prop :=\n IsOddPrime p ∧ IsQuadratic a ∧ HasConsecutiveSquareValues a b c p\n\n/-- The assertion for fixed coefficients and prime: under the stated hypotheses,\n`p` divides the discriminant `b ^ 2 - 4 * a * c`. -/\ndef TargetFor (a b c : Int) (p : Nat) : Prop :=\n Hypotheses a b c p → (p : Int) ∣ discriminant a b c\n\n/-- The full universally quantified statement from the problem: for all integer\ncoefficients `a`, `b`, `c` and every odd prime `p`, if the genuinely quadratic\npolynomial `a * x ^ 2 + b * x + c` takes perfect-square integer values at\n`2 * p - 1` consecutive integer arguments, then `p` divides its discriminant. -/\ndef Target : Prop :=\n ∀ (a b c : Int) (p : Nat), TargetFor a b c p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "870077dc-5e0f-522b-8635-4a5e057b6850", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dc007cf9f78316950d26978c709219508482e7dcec9498254167e5ab192182ee", "task_path": "tasks/nmp3_870077dc-5e0f-522b-8635-4a5e057b6850", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "870077dc-5e0f-522b-8635-4a5e057b6850", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_871d65da-79ba-561a-bf87-aef6323e8ee3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there are no positive integers $x,y,z,w$ such that $x^2+y^2=z^2$ and $y^2+z^2=w^2$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility condition for a quadruple of positive integers: the first\nthree entries form a Pythagorean triple ending at `z`, and the last three entries\nform a Pythagorean triple ending at `w`. -/\ndef Admissible (x y z w : ℤ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ 0 < w ∧\n x ^ 2 + y ^ 2 = z ^ 2 ∧ y ^ 2 + z ^ 2 = w ^ 2\n\n/-- There are no positive integers `x`, `y`, `z`, and `w` such that\n`x^2 + y^2 = z^2` and `y^2 + z^2 = w^2`. -/\ndef Target : Prop :=\n ¬ ∃ x y z w : ℤ, Admissible x y z w\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "871d65da-79ba-561a-bf87-aef6323e8ee3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "838b8438a8309313da358f001a2e36121f6720c83f2a0b85530573b15906a426", "task_path": "tasks/nmp3_871d65da-79ba-561a-bf87-aef6323e8ee3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "871d65da-79ba-561a-bf87-aef6323e8ee3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8756af88-9998-5893-886e-889a38ad711e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a\\) and \\(b\\) be positive integers such that \\(a!+b!\\) divides \\(a!b!\\). Prove that\n-- \\[\n-- 3a\\ge 2b+2\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target statement\n\nThe original problem asks to prove, for all positive integers `a` and `b`\nsuch that `a! + b!` divides `a! * b!`, that `3 * a ≥ 2 * b + 2`.\nThis file records only the statement as a proposition; it contains no proof.\n-/\n\nnamespace Problem\n\n/-- The natural-number admissibility hypothesis from the problem:\n`a` and `b` are positive and `a! + b!` divides `a! * b!`. -/\ndef Admissible (a b : ℕ) : Prop :=\n 0 < a ∧ 0 < b ∧\n (Nat.factorial a + Nat.factorial b) ∣ Nat.factorial a * Nat.factorial b\n\n/-- The inequality asserted as the conclusion of the problem. -/\ndef Conclusion (a b : ℕ) : Prop :=\n 3 * a ≥ 2 * b + 2\n\n/-- The complete universal statement of the problem. -/\ndef Target : Prop :=\n ∀ a b : ℕ, Admissible a b → Conclusion a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8756af88-9998-5893-886e-889a38ad711e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ed590a6b5659eb85737ba3a24a72510db43fa9de40a6ca1e90c4bd8ffc52fff5", "task_path": "tasks/nmp3_8756af88-9998-5893-886e-889a38ad711e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8756af88-9998-5893-886e-889a38ad711e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_87570627-be62-5682-abf1-5d6e2198ccbf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all non‑negative real numbers $a,\\;b,\\;c$ prove the double inequality \n-- \\[\n-- \\sum_{\\text{cyc}} a\\sqrt{a^{2}+8bc}\\;\\le\\;(a+b+c)^{2}\\;\\le\\;\\sum_{\\text{cyc}} a\\sqrt{4a^{2}+5bc}\\,,\n-- \\] \n-- where $\\displaystyle\\sum_{\\text{cyc}}$ denotes the cyclic sum over $a,b,c$ (i.e. $a\\sqrt{a^{2}+8bc}+b\\sqrt{b^{2}+8ca}+c\\sqrt{c^{2}+8ab}$, etc.).\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement of the cyclic double square-root inequality\n\nFor nonnegative real numbers `a`, `b`, and `c`, this file states the two-sided\ninequality between the two cyclic square-root sums and `(a + b + c)^2`.\nThe declarations are statements only; no proof of the inequality is supplied.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum `∑_cyc a * sqrt (a^2 + 8 * b * c)`, written out over the three\ncyclic permutations of `(a, b, c)`. -/\nnoncomputable def lowerCyclicSum (a b c : ℝ) : ℝ :=\n a * Real.sqrt (a ^ (2 : ℕ) + (8 : ℝ) * b * c) +\n b * Real.sqrt (b ^ (2 : ℕ) + (8 : ℝ) * c * a) +\n c * Real.sqrt (c ^ (2 : ℕ) + (8 : ℝ) * a * b)\n\n/-- The cyclic sum `∑_cyc a * sqrt (4 * a^2 + 5 * b * c)`, written out over the\nthree cyclic permutations of `(a, b, c)`. -/\nnoncomputable def upperCyclicSum (a b c : ℝ) : ℝ :=\n a * Real.sqrt ((4 : ℝ) * a ^ (2 : ℕ) + (5 : ℝ) * b * c) +\n b * Real.sqrt ((4 : ℝ) * b ^ (2 : ℕ) + (5 : ℝ) * c * a) +\n c * Real.sqrt ((4 : ℝ) * c ^ (2 : ℕ) + (5 : ℝ) * a * b)\n\n/-- The left-hand inequality of the requested double inequality, for fixed\nvalues of `a`, `b`, and `c`. -/\ndef LeftInequality (a b c : ℝ) : Prop :=\n lowerCyclicSum a b c ≤ (a + b + c) ^ (2 : ℕ)\n\n/-- The right-hand inequality of the requested double inequality, for fixed\nvalues of `a`, `b`, and `c`. -/\ndef RightInequality (a b c : ℝ) : Prop :=\n (a + b + c) ^ (2 : ℕ) ≤ upperCyclicSum a b c\n\n/-- The full formal target: for all nonnegative real numbers `a`, `b`, and `c`,\nthe lower cyclic square-root sum is at most `(a + b + c)^2`, which in turn is at\nmost the upper cyclic square-root sum. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 ≤ a → 0 ≤ b → 0 ≤ c →\n LeftInequality a b c ∧ RightInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "87570627-be62-5682-abf1-5d6e2198ccbf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2ef3f15170d826673bb144310f3ce88526b81d1393aef628d5ce74a7c501dea6", "task_path": "tasks/nmp3_87570627-be62-5682-abf1-5d6e2198ccbf", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "87570627-be62-5682-abf1-5d6e2198ccbf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8795ec24-bf3e-5eba-83de-f33dec905662", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $S$ be a finite set of integers, each greater than $1$. Suppose that for every integer $n$ there exists $s\\in S$ such that $\\gcd(s,n)=1$ or $\\gcd(s,n)=s$ (i.e., $s$ divides $n$). Prove that there exist $s,t\\in S$ whose greatest common divisor is a prime number.\nimport Mathlib.Data.Int.GCD\nimport Mathlib.Data.Nat.Prime.Basic\nimport Mathlib.Data.Finset.Basic\n\nnamespace Problem\n\n/-- The condition on one element `s` and one integer `n`:\n`s` is coprime to `n`, or `s` divides `n`.\n\nThe second disjunct is the formal version of the parenthetical\n`gcd(s,n) = s (i.e., s divides n)` for positive integers `s`. -/\ndef CoprimeOrDivides (s n : ℤ) : Prop :=\n Int.gcd s n = 1 ∨ s ∣ n\n\n/-- A finite set of integers satisfies the hypothesis of the problem when all of\nits elements are greater than `1` and every integer is either coprime to some\nelement of the set or divisible by some element of the set. -/\ndef SatisfiesHypothesis (S : Finset ℤ) : Prop :=\n (∀ s : ℤ, s ∈ S → 1 < s) ∧\n (∀ n : ℤ, ∃ s : ℤ, s ∈ S ∧ CoprimeOrDivides s n)\n\n/-- The finite set has a pair of (not necessarily distinct) elements whose\ngreatest common divisor is prime. -/\ndef HasPrimeGcdPair (S : Finset ℤ) : Prop :=\n ∃ s : ℤ, s ∈ S ∧ ∃ t : ℤ, t ∈ S ∧ Nat.Prime (Int.gcd s t)\n\n/-- The assertion of the problem: every finite set of integers greater than\n`1` satisfying the stated covering property contains two elements whose\ngreatest common divisor is prime. -/\ndef Target : Prop :=\n ∀ S : Finset ℤ, SatisfiesHypothesis S → HasPrimeGcdPair S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8795ec24-bf3e-5eba-83de-f33dec905662", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "354a3313a4634c65c7769eee3d206716b1c237f0c30f8bdbc49ea2ea37d6ce18", "task_path": "tasks/nmp3_8795ec24-bf3e-5eba-83de-f33dec905662", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8795ec24-bf3e-5eba-83de-f33dec905662", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_87cb2f99-96b4-5884-ad34-4ffd49a0f800", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ and define \n-- \\[\n-- x=a+b+c,\\qquad y=ab+bc+ca,\\qquad z=abc.\n-- \\]\n-- Assume that \n-- \\[\n-- 4x^{4}+25xz+4y^{2}\\ge17x^{2}y.\n-- \\]\n-- Prove that \n-- \\[\n-- \\sqrt{9a^{2}+16bc}+\\sqrt{9b^{2}+16ca}+\\sqrt{9c^{2}+16ab}\\le5(a+b+c).\\\nimport Mathlib\n\n/-!\n# Formal statement for the nonnegative-variable inequality problem\n\nThe source problem asks, for nonnegative real numbers `a`, `b`, `c`, to prove an\ninequality under a symmetric hypothesis expressed through the elementary\nsymmetric polynomials `x = a + b + c`, `y = ab + bc + ca`, and `z = abc`.\nThis file records the statement as a proposition; it does not prove it.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The first elementary symmetric polynomial `x = a + b + c`. -/\ndef x (a b c : ℝ) : ℝ :=\n a + b + c\n\n/-- The second elementary symmetric polynomial `y = ab + bc + ca`. -/\ndef y (a b c : ℝ) : ℝ :=\n a * b + b * c + c * a\n\n/-- The third elementary symmetric polynomial `z = abc`. -/\ndef z (a b c : ℝ) : ℝ :=\n a * b * c\n\n/-- The left-hand side of the inequality to be proved. -/\ndef lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (9 * a ^ 2 + 16 * b * c) +\n Real.sqrt (9 * b ^ 2 + 16 * c * a) +\n Real.sqrt (9 * c ^ 2 + 16 * a * b)\n\n/-- The right-hand side of the inequality to be proved. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 5 * (a + b + c)\n\n/-- The assumed inequality in the source problem. -/\ndef assumption (a b c : ℝ) : Prop :=\n 4 * x a b c ^ 4 + 25 * x a b c * z a b c + 4 * y a b c ^ 2 ≥\n 17 * x a b c ^ 2 * y a b c\n\n/-- The inequality that is the requested conclusion. -/\ndef conclusion (a b c : ℝ) : Prop :=\n lhs a b c ≤ rhs a b c\n\n/-- The complete universal proposition stated by the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n assumption a b c →\n conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "87cb2f99-96b4-5884-ad34-4ffd49a0f800", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1034b18c39c0c69322cb7cbd0796586fd52dbadbdd58aaadbb5f50f391972dc2", "task_path": "tasks/nmp3_87cb2f99-96b4-5884-ad34-4ffd49a0f800", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "87cb2f99-96b4-5884-ad34-4ffd49a0f800", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_88163350-9e10-50e6-8fdf-d84bbeb258ba", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ and $q$ be positive integers. Prove that \n-- \\[\n-- \\sum_{k=0}^{\\,n-1}\\binom{q\\,(n,k)}{(n,k)}\n-- \\] \n-- is divisible by $nq$, where $(x,y)=\\gcd(x,y)$ denotes the greatest common divisor of $x$ and $y$.\nimport Mathlib\n\n/-!\n# Formal statement of the gcd/binomial divisibility problem\n\nThe source problem asks, for all positive integers `n` and `q`, to prove that\n`∑_{k=0}^{n-1} choose (q * gcd n k) (gcd n k)` is divisible by `n * q`.\n-/\n\nnamespace Problem\n\n/-- The value `(n, k)` appearing in the problem, namely the greatest common\ndivisor of `n` and `k`. -/\ndef gcdTerm (n k : ℕ) : ℕ :=\n Nat.gcd n k\n\n/-- The `k`-th summand in the problem. The upper argument of the binomial\nsummand is `q * (n, k)` and the lower argument is `(n, k)`. -/\ndef summand (n q k : ℕ) : ℕ :=\n Nat.choose (q * gcdTerm n k) (gcdTerm n k)\n\n/-- The finite sum from `k = 0` through `k = n - 1`. -/\ndef partialSum (n q : ℕ) : ℕ :=\n (Finset.range n).sum (fun k => summand n q k)\n\n/-- The assertion that for every pair of positive integers `n` and `q`, the\nfinite sum displayed in the problem is divisible by `n * q`. -/\ndef Target : Prop :=\n ∀ n q : ℕ, 0 < n → 0 < q → n * q ∣ partialSum n q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "88163350-9e10-50e6-8fdf-d84bbeb258ba", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b84e8837c4bcc5a99396c736af5fa575354fc0e163c376f741afc8dbdc18438e", "task_path": "tasks/nmp3_88163350-9e10-50e6-8fdf-d84bbeb258ba", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "88163350-9e10-50e6-8fdf-d84bbeb258ba", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_886956b2-6656-5e79-9f21-096819d76104", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{a+1}{b}+\\frac{b+1}{c}+\\frac{c+1}{a}\\ge 2\\,(a^2+b^2+c^2)\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c` whose sum is `3`, the inequality\n`(a + 1) / b + (b + 1) / c + (c + 1) / a ≥ 2 * (a^2 + b^2 + c^2)` holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 3 →\n (a + 1) / b + (b + 1) / c + (c + 1) / a ≥\n 2 * (a ^ 2 + b ^ 2 + c ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "886956b2-6656-5e79-9f21-096819d76104", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "951622f29121bdcdd2a3fa49828a00aa8f9f253b3edca2f007cad470b9910323", "task_path": "tasks/nmp3_886956b2-6656-5e79-9f21-096819d76104", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "886956b2-6656-5e79-9f21-096819d76104", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_886ece48-0142-57f4-a2f6-83cfb15e2171", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d,e$ be real numbers such that \n-- \\[\n-- a+b+c+d+e\\ge 0,\\qquad \n-- ab+ac+ad+ae+bc+bd+be+cd+ce+de\\ge 0.\n-- \\] \n-- Prove that \n-- \\[\n-- a^{5}+b^{5}+c^{5}+d^{5}+e^{5}\\;\\ge\\;5\\,abcde .\n-- \\]\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the five-variable real inequality\n\nThe source problem asks, for real numbers `a, b, c, d, e`, to prove the\nfifth-power inequality from the two elementary-symmetric nonnegativity\nassumptions. The assertion is packaged as a proposition-valued definition;\nno proof of the assertion is supplied here.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The first hypothesis: the sum of the five real numbers is nonnegative. -/\ndef SumNonnegative (a b c d e : ℝ) : Prop :=\n a + b + c + d + e ≥ 0\n\n/-- The second hypothesis: the sum of all unordered pairwise products is nonnegative. -/\ndef PairwiseSumNonnegative (a b c d e : ℝ) : Prop :=\n a * b + a * c + a * d + a * e +\n b * c + b * d + b * e + c * d + c * e + d * e ≥ 0\n\n/-- The asserted conclusion: the sum of fifth powers is at least five times the product. -/\ndef PowerSumGeFiveProduct (a b c d e : ℝ) : Prop :=\n a ^ 5 + b ^ 5 + c ^ 5 + d ^ 5 + e ^ 5 ≥ 5 * a * b * c * d * e\n\n/--\nFor all real numbers `a, b, c, d, e`, if their sum is nonnegative and the sum\nof all ten pairwise products is nonnegative, then the sum of their fifth powers\nis at least five times their product.\n-/\ndef Target : Prop :=\n ∀ (a : ℝ) (b : ℝ) (c : ℝ) (d : ℝ) (e : ℝ),\n SumNonnegative a b c d e →\n PairwiseSumNonnegative a b c d e →\n PowerSumGeFiveProduct a b c d e\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "886ece48-0142-57f4-a2f6-83cfb15e2171", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e21a010f44579d70893da64d334488cd444a4b5999d0670061d6d9b7859f745d", "task_path": "tasks/nmp3_886ece48-0142-57f4-a2f6-83cfb15e2171", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "886ece48-0142-57f4-a2f6-83cfb15e2171", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_887d09d5-aa51-5ffe-b9c5-1339264a779a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ be real numbers such that $x+y+z=3$. Prove that \n-- \\[\n-- \\frac{x}{3x^{2}+xyz+27}+\\frac{y}{3y^{2}+xyz+27}+\\frac{z}{3z^{2}+xyz+27}\\le\\frac{3}{31}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the claimed inequality. -/\nnoncomputable def inequalityLHS (x y z : ℝ) : ℝ :=\n x / (3 * x ^ 2 + x * y * z + 27) +\n y / (3 * y ^ 2 + x * y * z + 27) +\n z / (3 * z ^ 2 + x * y * z + 27)\n\n/-- The right-hand side of the claimed inequality. -/\nnoncomputable def inequalityRHS : ℝ :=\n (3 : ℝ) / 31\n\n/--\nFor all positive real numbers `x`, `y`, and `z` satisfying `x + y + z = 3`,\nthe sum of the three displayed fractions is at most `3 / 31`.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x + y + z = 3 →\n inequalityLHS x y z ≤ inequalityRHS\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "887d09d5-aa51-5ffe-b9c5-1339264a779a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fc8f5a039661d3b3fb37ffc6b78473ddfdbba3d5140a1bcd85de9608cf17a4aa", "task_path": "tasks/nmp3_887d09d5-aa51-5ffe-b9c5-1339264a779a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "887d09d5-aa51-5ffe-b9c5-1339264a779a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_88b851b6-e70b-590f-a062-60b39d3329d0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$ be a positive integer. Prove that there exist infinitely many positive integers $m$ such that \n-- \\[\n-- \\sigma(am)<\\sigma(am+1),\n-- \\]\n-- where $\\sigma(n)$ denotes the sum of all positive divisors of $n$.\nimport Mathlib\n\n/-!\n# Formal statement: infinitely many divisor-sum inequalities\n\nThe source problem asks, for every positive integer `a`, to prove that\ninfinitely many positive integers `m` satisfy\n`σ (a * m) < σ (a * m + 1)`, where `σ n` is the sum of the positive\ndivisors of `n`.\n-/\n\nnamespace Problem\n\n/-- The sum of all positive divisors of a natural number, usually denoted `σ`. -/\ndef sumOfPositiveDivisors (n : ℕ) : ℕ :=\n ∑ d ∈ n.divisors, d\n\n/-- The predicate that a natural number `m` is a positive integer satisfying the\nrequired divisor-sum inequality for the fixed multiplier `a`. -/\ndef IsGoodMultiplier (a m : ℕ) : Prop :=\n 0 < m ∧ sumOfPositiveDivisors (a * m) < sumOfPositiveDivisors (a * m + 1)\n\n/-- The set of positive integers `m` satisfying the required inequality for `a`. -/\ndef goodMultipliers (a : ℕ) : Set ℕ :=\n {m : ℕ | IsGoodMultiplier a m}\n\n/-- For every positive integer `a`, infinitely many positive integers `m` satisfy\n`σ (a * m) < σ (a * m + 1)`. -/\ndef Target : Prop :=\n ∀ a : ℕ, 0 < a → (goodMultipliers a).Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "88b851b6-e70b-590f-a062-60b39d3329d0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a1eddef3139fcdeb4602728a5aa25c071e305a44ac285a0428d806405c54b7f4", "task_path": "tasks/nmp3_88b851b6-e70b-590f-a062-60b39d3329d0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "88b851b6-e70b-590f-a062-60b39d3329d0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_88bcdd7d-960a-5e36-aa4b-ef0befd558de", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \\[(x^{2}+2)(y^{2}+2)(z^{2}+2)\\ge 9(xy+yz+zx).\\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the positive-real product inequality\n\nThe source problem asks one to prove that, for all positive real numbers `x`, `y`, and `z`,\n`(x^2 + 2) * (y^2 + 2) * (z^2 + 2)` is at least\n`9 * (x * y + y * z + z * x)`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side `(x^2 + 2)(y^2 + 2)(z^2 + 2)` of the target inequality. -/\ndef lhs (x y z : ℝ) : ℝ :=\n (x ^ 2 + 2) * (y ^ 2 + 2) * (z ^ 2 + 2)\n\n/-- The right-hand side `9(xy + yz + zx)` of the target inequality. -/\ndef rhs (x y z : ℝ) : ℝ :=\n 9 * (x * y + y * z + z * x)\n\n/--\nThe proposition asserted by the source problem: for every triple of strictly positive real\nnumbers, the left-hand side is at least the right-hand side.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → lhs x y z ≥ rhs x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "88bcdd7d-960a-5e36-aa4b-ef0befd558de", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "30f32cb99ab5c9ff2551cd34ffd1d453de01790b140e8b72f1461b1620b255ff", "task_path": "tasks/nmp3_88bcdd7d-960a-5e36-aa4b-ef0befd558de", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "88bcdd7d-960a-5e36-aa4b-ef0befd558de", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_88c15860-cd9e-5447-92e6-c59573a439cd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\frac{(a-b)^2}{ab}+\\frac{(b-c)^2}{bc}+\\frac{(c-a)^2}{ca}+\\frac{c}{a}+\\frac{a}{b}+\\frac{b}{c}\\ge\n-- \\frac{3bc+ac-ab}{2ab+ac}+\\frac{3ac+ab-bc}{2bc+ab}+\\frac{3ab+bc-ac}{2ac+bc}\\, .\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the positive-real inequality\n\nThe problem asks, for positive real numbers `a`, `b`, and `c`, to prove the\ndisplayed inequality. The declarations below record only the proposition to\nbe proved; no proof or asserted answer is included.\n-/\n\nnamespace Problem\n\n/-- The hypothesis that the three real parameters are positive. -/\ndef IsPositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a - b) ^ 2 / (a * b) +\n (b - c) ^ 2 / (b * c) +\n (c - a) ^ 2 / (c * a) +\n c / a + a / b + b / c\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (3 * b * c + a * c - a * b) / (2 * a * b + a * c) +\n (3 * a * c + a * b - b * c) / (2 * b * c + a * b) +\n (3 * a * b + b * c - a * c) / (2 * a * c + b * c)\n\n/-- The displayed inequality as a statement about three real numbers. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete problem statement: for all positive real numbers `a`, `b`,\nand `c`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsPositiveTriple a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "88c15860-cd9e-5447-92e6-c59573a439cd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9b34ec5c0ec2b0522ad64fb4e086c4dfb414c9e4b3f1dc094c1b1e74cca58010", "task_path": "tasks/nmp3_88c15860-cd9e-5447-92e6-c59573a439cd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "88c15860-cd9e-5447-92e6-c59573a439cd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_88dc097c-1f56-58d5-8343-abd420592c32", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots,a_n$ be positive real numbers satisfying \n-- \\[\n-- \\sum_{i=1}^{n}\\frac{1}{1+a_i}=1 .\n-- \\] \n-- Prove that \n-- \\[\n-- \\sum_{i=1}^{n}\\sqrt{a_i}\\;\\ge\\;(n-1)\\sum_{i=1}^{n}\\frac{1}{\\sqrt{a_i}} .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the inequality problem\n\nThe source states: for positive reals `a_1, ..., a_n` satisfying\n`∑ i, 1 / (1 + a_i) = 1`, prove that\n`∑ i, sqrt (a_i) ≥ (n - 1) * ∑ i, 1 / sqrt (a_i)`.\n\nWe represent the one-based indexing `a_1, ..., a_n` by a function on `Fin n`.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The hypotheses of the problem for a finite family indexed by `Fin n`:\nevery term is positive and the displayed reciprocal-sum identity holds. -/\ndef Admissible (n : ℕ) (a : Fin n → ℝ) : Prop :=\n (∀ i : Fin n, 0 < a i) ∧\n (∑ i : Fin n, (1 : ℝ) / (1 + a i)) = 1\n\n/-- The inequality asserted as the conclusion of the problem. -/\ndef Conclusion (n : ℕ) (a : Fin n → ℝ) : Prop :=\n (∑ i : Fin n, Real.sqrt (a i)) ≥\n ((n - 1 : ℕ) : ℝ) * ∑ i : Fin n, (1 : ℝ) / Real.sqrt (a i)\n\n/-- The full mathematical assertion: for every positive integer `n` and every\npositive real family `a` of length `n`, if the reciprocal-sum identity holds,\nthen the asserted inequality holds. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 0 < n → ∀ (a : Fin n → ℝ), Admissible n a → Conclusion n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "88dc097c-1f56-58d5-8343-abd420592c32", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3592c4c06d468e1fe3ac3a98b48c5e9171afc87813c1bf731f7f7f133a899145", "task_path": "tasks/nmp3_88dc097c-1f56-58d5-8343-abd420592c32", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "88dc097c-1f56-58d5-8343-abd420592c32", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_88e96e7a-8002-5576-a59d-4301575ef9b0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\triangle ABC$ be a triangle with incenter $I$. Let $P$ and $Q$ be the midpoints of $IB$ and $IC$, respectively. Let the circumcircles of $\\triangle APB$ and $\\triangle AQC$ intersect line $BC$ again at points $K$ and $L$, respectively. Prove that $BK = CL\\,.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Incenter.Basic\nimport Mathlib.Geometry.Euclidean.Sphere.Basic\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the formalization. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A (nondegenerate) labelled triangle in the Euclidean plane. -/\nabbrev Triangle : Type := Affine.Triangle ℝ Point\n\n/-- The first vertex `A` of a labelled triangle. -/\ndef vertexA (t : Triangle) : Point :=\n t.points 0\n\n/-- The second vertex `B` of a labelled triangle. -/\ndef vertexB (t : Triangle) : Point :=\n t.points 1\n\n/-- The third vertex `C` of a labelled triangle. -/\ndef vertexC (t : Triangle) : Point :=\n t.points 2\n\n/-- The incenter `I` of a labelled triangle. -/\ndef incenter (t : Triangle) : Point :=\n t.incenter\n\n/-- The midpoint `P` of the segment from the incenter `I` to the vertex `B`. -/\ndef midpointIB (t : Triangle) : Point :=\n midpoint ℝ (incenter t) (vertexB t)\n\n/-- The midpoint `Q` of the segment from the incenter `I` to the vertex `C`. -/\ndef midpointIC (t : Triangle) : Point :=\n midpoint ℝ (incenter t) (vertexC t)\n\n/-- `ω` is the circumcircle of the three points `A`, `B`, `C`: it is the unique circle\n(one-dimensional sphere in the Euclidean plane) through those three points. -/\ndef IsCircumcircle (ω : EuclideanGeometry.Sphere Point) (A B C : Point) : Prop :=\n A ∈ ω ∧ B ∈ ω ∧ C ∈ ω ∧\n ∀ ω' : EuclideanGeometry.Sphere Point,\n A ∈ ω' → B ∈ ω' → C ∈ ω' → ω' = ω\n\n/-- A point lies on the circumcircle of `A`, `B`, and `C`, i.e. it lies on the unique circle\nthrough those three points. -/\ndef OnCircumcircle (X A B C : Point) : Prop :=\n ∃ ω : EuclideanGeometry.Sphere Point, IsCircumcircle ω A B C ∧ X ∈ ω\n\n/-- A point is the second intersection of the line through `U` and `V` with the circumcircle of\n`A`, `B`, and `U`. The first intersection used here is `U`. The last conjunct states that there\nis no other intersection besides `U` and the point itself. -/\ndef IsSecondIntersection (X U V A B : Point) : Prop :=\n X ≠ U ∧\n Collinear ℝ ({U, V, X} : Set Point) ∧\n OnCircumcircle X A B U ∧\n ∀ Y : Point,\n Collinear ℝ ({U, V, Y} : Set Point) →\n OnCircumcircle Y A B U →\n Y = U ∨ Y = X\n\n/-- The assertion of the problem: for every nondegenerate labelled triangle `ABC`, with incenter\n`I`, midpoints `P` of `IB` and `Q` of `IC`, and with `K` (respectively `L`) the second\nintersection of `BC` with the circumcircle of `APB` (respectively of `AQC`), the segment lengths\n`BK` and `CL` are equal. -/\ndef Target : Prop :=\n ∀ (t : Triangle) (K L : Point),\n IsSecondIntersection K (vertexB t) (vertexC t) (vertexA t) (midpointIB t) →\n IsSecondIntersection L (vertexC t) (vertexB t) (vertexA t) (midpointIC t) →\n dist (vertexB t) K = dist (vertexC t) L\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "88e96e7a-8002-5576-a59d-4301575ef9b0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1b55fb546feb54dd39610f02f5393d852ca1dd36b18b671f51add7f4fd5e8df2", "task_path": "tasks/nmp3_88e96e7a-8002-5576-a59d-4301575ef9b0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "88e96e7a-8002-5576-a59d-4301575ef9b0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_890a3b8e-9445-580a-92b6-ad26751938df", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\left(\\frac{a}{b+c}\\right)^2+\\left(\\frac{b}{c+a}\\right)^2+\\left(\\frac{c}{a+b}\\right)^2+3\\;\\ge\\;\\frac{5\\,(a+b+c)^2}{4\\,(ab+bc+ca)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nFor positive real numbers `a`, `b`, and `c`, prove that\n`(a / (b + c)) ^ 2 + (b / (c + a)) ^ 2 + (c / (a + b)) ^ 2 + 3`\nis at least `5 * (a + b + c) ^ 2 / (4 * (a * b + b * c + c * a))`.\n\nThis file only states the proposition; it does not provide a proof.\n-/\n\nnamespace Problem\n\n/-- The inequality in the problem, universally quantified over positive reals. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c →\n (a / (b + c)) ^ 2 + (b / (c + a)) ^ 2 +\n (c / (a + b)) ^ 2 + 3 ≥\n (5 * (a + b + c) ^ 2) /\n (4 * (a * b + b * c + c * a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "890a3b8e-9445-580a-92b6-ad26751938df", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "48898e5c4ed41f4219fd0f5362ad389e8b4f2378b10d563af48be0eb92e7ecda", "task_path": "tasks/nmp3_890a3b8e-9445-580a-92b6-ad26751938df", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "890a3b8e-9445-580a-92b6-ad26751938df", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8912b7df-651d-5bb6-ad08-c3dca05477c4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x>2$, $y>1$, $z>0$ be integers satisfying $x^y+1=z^2$. Denote by $p$ the number of distinct prime divisors of $x$ and by $q$ the number of distinct prime divisors of $y$. Prove that $p\\ge q+2\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the stated number-theory problem\n\nThe original problem quantifies over positive integers `x`, `y`, and `z`, with\n`x > 2`, `y > 1`, and `z > 0`. They are represented as integers. The exponent\n`y` in `x ^ y` is represented by its natural-number coercion `y.toNat`; the\nhypothesis `1 < y` ensures that this is the intended positive integer exponent.\nThe number of distinct prime divisors of an integer `n` is the cardinality of\nthe finset of prime factors of `n.natAbs`.\n-/\n\nnamespace Problem\n\n/-- The number of distinct prime divisors of an integer. Taking `natAbs`\nmakes this agree with the usual count for positive integers and gives a total\nfunction on all integers. -/\ndef numberOfDistinctPrimeDivisors (n : ℤ) : ℕ :=\n n.natAbs.primeFactors.card\n\n/-- The value called `p` in the statement: the number of distinct prime\ndivisors of `x`. -/\ndef p (x : ℤ) : ℕ :=\n numberOfDistinctPrimeDivisors x\n\n/-- The value called `q` in the statement: the number of distinct prime\ndivisors of `y`. -/\ndef q (y : ℤ) : ℕ :=\n numberOfDistinctPrimeDivisors y\n\n/-- The hypotheses of the original problem for integer `x`, `y`, and `z`. -/\ndef Admissible (x y z : ℤ) : Prop :=\n 2 < x ∧ 1 < y ∧ 0 < z ∧ x ^ y.toNat + 1 = z ^ 2\n\n/-- The assertion to be proved: for all integers `x > 2`, `y > 1`, `z > 0`\nand `x ^ y + 1 = z ^ 2`, the number `p` of distinct prime divisors of `x` is\nat least `q + 2`, where `q` is the number of distinct prime divisors of `y`. -/\ndef Target : Prop :=\n ∀ x y z : ℤ, Admissible x y z → p x ≥ q y + 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8912b7df-651d-5bb6-ad08-c3dca05477c4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1e5f9f559008290044752da363c905af8f5571e92701938e7861eb52a70b748f", "task_path": "tasks/nmp3_8912b7df-651d-5bb6-ad08-c3dca05477c4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8912b7df-651d-5bb6-ad08-c3dca05477c4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8941f945-b6a9-5bad-9a73-742162d08e1e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f\\in\\mathbb Q[x]$ be a polynomial of degree $n\\ge1$. Suppose that for all integers $k,l$ with $0\\le k0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\sqrt{x^{2}+xy+y^{2}}\\;\\ge\\;\\sum_{\\text{cyc}}\\sqrt{2x^{2}+xy}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Cyclic square-root inequality\n\nThis file formalizes the statement of the following problem:\n\nFor positive real numbers `x`, `y`, and `z`, prove that\n\n`∑_cyc sqrt (x^2 + x*y + y^2) ≥ ∑_cyc sqrt (2*x^2 + x*y)`.\n\nThe cyclic sums are written out as the three corresponding terms.\n-/\n\nnamespace Problem\n\n/-- The left-hand cyclic sum\n`sqrt (x^2 + x*y + y^2) + sqrt (y^2 + y*z + z^2) + sqrt (z^2 + z*x + x^2)`. -/\nnoncomputable def cyclicLHS (x y z : ℝ) : ℝ :=\n Real.sqrt (x ^ 2 + x * y + y ^ 2) +\n Real.sqrt (y ^ 2 + y * z + z ^ 2) +\n Real.sqrt (z ^ 2 + z * x + x ^ 2)\n\n/-- The right-hand cyclic sum\n`sqrt (2*x^2 + x*y) + sqrt (2*y^2 + y*z) + sqrt (2*z^2 + z*x)`. -/\nnoncomputable def cyclicRHS (x y z : ℝ) : ℝ :=\n Real.sqrt (2 * x ^ 2 + x * y) +\n Real.sqrt (2 * y ^ 2 + y * z) +\n Real.sqrt (2 * z ^ 2 + z * x)\n\n/-- The positivity hypothesis `x > 0`, `y > 0`, `z > 0`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The cyclic inequality for fixed `x`, `y`, and `z`. -/\ndef Inequality (x y z : ℝ) : Prop :=\n cyclicLHS x y z ≥ cyclicRHS x y z\n\n/-- The full universal statement: for all positive real `x`, `y`, and `z`,\nthe left-hand cyclic sum is at least the right-hand cyclic sum. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "899474d4-4001-5d07-83e8-85560c3fe260", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b1f8e4c95497c5872c3807c046eee159c6fb167063e64a35d7962c63441cd373", "task_path": "tasks/nmp3_899474d4-4001-5d07-83e8-85560c3fe260", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "899474d4-4001-5d07-83e8-85560c3fe260", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_89cf0ed4-ad45-5c38-a346-261a92c7e8de", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers \\(a,\\;b,\\;c\\) prove that \n-- \\[\n-- \\frac{(a+b-c)^{2}}{(a+b)^{2}+c^{2}}+\\frac{(b+c-a)^{2}}{(b+c)^{2}+a^{2}}+\\frac{(c+a-b)^{2}}{(c+a)^{2}+b^{2}}+\\frac{2}{5}\\le\n-- \\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic inequality problem\n\nThe problem asks to prove, for all positive real numbers `a`, `b`, and `c`, the\ninequality\n\n`((a+b-c)^2)/((a+b)^2+c^2) + ... + 2/5 ≤ (a^2+b^2+c^2)/(ab+bc+ca)`.\n\nThis file only states the target proposition. No proof is supplied at this\nformalization stage.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The three cyclic fraction terms on the left-hand side of the target\ninequality. The separate additive constant `2 / 5` is kept outside this\ndefinition so that the formal target follows the source expression directly. -/\ndef FractionSum (a b c : ℝ) : ℝ :=\n (a + b - c) ^ 2 / ((a + b) ^ 2 + c ^ 2) +\n (b + c - a) ^ 2 / ((b + c) ^ 2 + a ^ 2) +\n (c + a - b) ^ 2 / ((c + a) ^ 2 + b ^ 2)\n\n/-- The right-hand side `(a^2 + b^2 + c^2) / (ab + bc + ca)`. -/\ndef RHS (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a)\n\n/-- The exact proposition requested by the problem: for every positive real\n`a`, `b`, and `c`, the cyclic fraction sum plus `2 / 5` is at most the stated\nsymmetric ratio. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n FractionSum a b c + (2 : ℝ) / (5 : ℝ) ≤ RHS a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "89cf0ed4-ad45-5c38-a346-261a92c7e8de", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6addf9abeb69211d401726747b45fc9a6160cbc0e5a6f1ca4ad11cc5be6dbabc", "task_path": "tasks/nmp3_89cf0ed4-ad45-5c38-a346-261a92c7e8de", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "89cf0ed4-ad45-5c38-a346-261a92c7e8de", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8a0b116a-6ae0-5a5c-b42e-3499c814e717", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the lengths of the sides of a triangle. Prove that \n-- \\[\n-- (a+b+c)\\Big(\\frac{1}{b+c-a}+\\frac{1}{c+a-b}+\\frac{1}{a+b-c}\\Big)\\ge\n-- 3\\Big(\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\Big).\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\nFormal statement of the triangle side-length inequality from `problem.md`.\n\nThe original problem asks, for real side lengths `a`, `b`, and `c` of a\n(nondegenerate) triangle, to prove\n`(a + b + c) * (1 / (b + c - a) + 1 / (c + a - b) + 1 / (a + b - c)) ≥\n 3 * (a / b + b / c + c / a)`.\n-/\n\nnamespace Problem\n\n/-- The hypotheses that `a`, `b`, and `c` are side lengths of a nondegenerate\ntriangle, expressed as real numbers. Positivity is included because side\nlengths are lengths; the three strict triangle inequalities are the\nnondegenerate triangle condition. -/\ndef TriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The inequality asserted by the problem, as a predicate of the three side\nlengths. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (a + b + c) *\n (1 / (b + c - a) + 1 / (c + a - b) + 1 / (a + b - c)) ≥\n 3 * (a / b + b / c + c / a)\n\n/-- The complete assertion of the problem: for every triple of real numbers\nthat are side lengths of a nondegenerate triangle, the displayed inequality\nholds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, TriangleSideLengths a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a0b116a-6ae0-5a5c-b42e-3499c814e717", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8349030432dfb5483b7115f7b88b1a642b0b7273897acd3939b8b7c9037ab67e", "task_path": "tasks/nmp3_8a0b116a-6ae0-5a5c-b42e-3499c814e717", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a0b116a-6ae0-5a5c-b42e-3499c814e717", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8a1ae90c-ff6d-577a-bfa1-7088ec89ccaf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z,t,r>0$ satisfy $x^2+y^2+z^2+t^2+r^2\\ge 1$. Prove that \n-- \\[\n-- \\frac{x^2}{y+z+t}+\\frac{y^2}{z+t+r}+\\frac{z^2}{t+r+x}+\\frac{t^2}{r+x+y}+\\frac{r^2}{x+y+z}\\ge\\frac{\\sqrt5}{3}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the five-variable cyclic square-over-sum inequality\n\nThe original problem asks to prove, for positive real numbers\n`x y z t r` whose squares sum to at least one, that a cyclic sum of\nfive nonnegative terms is at least `sqrt 5 / 3`.\n-/\n\nnamespace Problem\n\n/-- The assertion is that the cyclic inequality holds for all positive reals\n`x, y, z, t, r` satisfying `x^2 + y^2 + z^2 + t^2 + r^2 ≥ 1`. -/\ndef Target : Prop :=\n ∀ x y z t r : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n 0 < t →\n 0 < r →\n x ^ 2 + y ^ 2 + z ^ 2 + t ^ 2 + r ^ 2 ≥ 1 →\n x ^ 2 / (y + z + t) +\n y ^ 2 / (z + t + r) +\n z ^ 2 / (t + r + x) +\n t ^ 2 / (r + x + y) +\n r ^ 2 / (x + y + z) ≥ Real.sqrt 5 / 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a1ae90c-ff6d-577a-bfa1-7088ec89ccaf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "53d035da94b9d0456cfa7684aac7fbb08c79b1bcd01f7d050dbd91ff21892204", "task_path": "tasks/nmp3_8a1ae90c-ff6d-577a-bfa1-7088ec89ccaf", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a1ae90c-ff6d-577a-bfa1-7088ec89ccaf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8a1cefcb-1287-5a41-9369-e8772af4fe23", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(a_n)_{n\\ge0}$ be a sequence of non‑negative real numbers such that $\\displaystyle\\sum_{n=0}^{\\infty}a_n<\\infty$. \n-- Let $(u_n)_{n\\ge0}$ be a real sequence satisfying \n-- \n-- \\[\n-- u_n\\ge u_{\\,n-1}-a_{\\,n-1}\\qquad\\text{for all }n\\ge1,\n-- \\]\n-- \n-- and suppose there exists a constant $M$ with $u_n\\le M$ for all $n$. Prove that the sequence $(u_n)$ converges.\nimport Mathlib\n\n/-!\n# Formalization of the convergence problem\n\nThe problem asks to prove that a real sequence `u` converges, assuming that\nit is bounded above and that its downward jumps are controlled by the terms of\na summable non-negative real series `a`.\n-/\n\nnamespace Problem\n\n/-- A real sequence `u` converges (to a finite real limit). -/\ndef Converges (u : ℕ → ℝ) : Prop :=\n ∃ L : ℝ, Filter.Tendsto u Filter.atTop (nhds L)\n\n/-- The one-sided lower bound for the increments of `u`. -/\ndef IncrementLowerBound (a u : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, 1 ≤ n → u n ≥ u (n - 1) - a (n - 1)\n\n/-- The full assertion of the problem: if `a` is a non-negative summable\nreal sequence, `u` is a real sequence whose increments are bounded below as\nin the statement, and `u` is bounded above, then `u` converges. -/\ndef Target : Prop :=\n ∀ (a u : ℕ → ℝ),\n (∀ n : ℕ, 0 ≤ a n) →\n Summable a →\n IncrementLowerBound a u →\n (∃ M : ℝ, ∀ n : ℕ, u n ≤ M) →\n Converges u\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a1cefcb-1287-5a41-9369-e8772af4fe23", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "86bbc8ebf0bcb63febe01206ead40e7c7cca57aadd602534aa55fe9529c267f3", "task_path": "tasks/nmp3_8a1cefcb-1287-5a41-9369-e8772af4fe23", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a1cefcb-1287-5a41-9369-e8772af4fe23", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8a2fba8b-8e0b-506a-b220-cb5548225a3b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For each positive integer $n$, let $f(n)$ denote the number of ways of representing $n$ as a sum of powers of $2$ with non‑negative integer exponents, where order of the summands does not matter. Prove that for every integer $n\\ge 3$ \n-- \\[\n-- 2^{\\,n^{2}/4}3$. Prove that $3$ divides \n-- \\[\n-- \\sum_{m=1}^{\\frac{p-1}{2}}\\Bigl(\\frac{m}{p}\\Bigr),\n-- \\]\n-- where $\\bigl(\\frac{m}{p}\\bigr)$ denotes the Legendre symbol modulo $p$.\nimport Mathlib.NumberTheory.LegendreSymbol.Basic\n\n/-!\n# Formal statement for the partial-sum congruence for the Legendre symbol\n\nThe source problem asks us to prove that, for every prime `p` with\n`p % 8 = 3` and `p > 3`, the integer sum of the Legendre symbols\n`(m / p)` for `1 ≤ m ≤ (p - 1) / 2` is divisible by `3`.\n-/\n\nnamespace Problem\n\n/-- The integer sum `∑_{m=1}^{(p-1)/2} (m / p)`, where `(m / p)` is Mathlib's\nLegendre symbol `legendreSym p m`. The `Fact p.Prime` argument is needed by\nMathlib's definition of the Legendre symbol. -/\ndef partialLegendreSum (p : ℕ) [Fact p.Prime] : ℤ :=\n ∑ m ∈ Finset.Icc 1 ((p - 1) / 2), legendreSym p (m : ℤ)\n\n/-- The assertion from the problem: for every natural-number prime `p` that is\n`3` modulo `8` and greater than `3`, `3` divides the partial sum of Legendre\nsymbols from `1` through `(p - 1) / 2`. -/\ndef Target : Prop :=\n ∀ (p : ℕ) (hp : Nat.Prime p) (hmod : p % 8 = 3) (hpgt : 3 < p),\n letI : Fact p.Prime := ⟨hp⟩\n (3 : ℤ) ∣ partialLegendreSum p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a6c9073-95ff-506e-9f9c-3d81fed9d8fe", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e3d1c57498afceae858c20e8fca4b953f953dafeac7c435d17bf5e42aa5586dd", "task_path": "tasks/nmp3_8a6c9073-95ff-506e-9f9c-3d81fed9d8fe", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a6c9073-95ff-506e-9f9c-3d81fed9d8fe", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8a77ec7d-9528-5f9a-8e56-ee247a58bb61", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any two positive real numbers $a$ and $b$ with $a>b$, there exists a positive integer $n$ such that \n-- $$b<\\frac{\\varphi(n+2)}{\\varphi(n)} b`, there exists a\npositive integer `n` such that `b < φ (n + 2) / φ n < a`. -/\ndef Target : Prop :=\n ∀ a b : ℝ,\n 0 < a →\n 0 < b →\n b < a →\n ∃ n : ℕ,\n 0 < n ∧ b < totientRatio n ∧ totientRatio n < a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a77ec7d-9528-5f9a-8e56-ee247a58bb61", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "56fa698eafefce5f4e9a654451eaabe56e490761337397d58c25672f2204ffb8", "task_path": "tasks/nmp3_8a77ec7d-9528-5f9a-8e56-ee247a58bb61", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a77ec7d-9528-5f9a-8e56-ee247a58bb61", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8a847300-94a5-5342-8aea-a7312a196ad7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- There are positive real numbers $a_0,a_1$. Define the sequence by $a_{n+2}=1+\\frac{a_{n+1}}{a_n}$ for all integers $n\\ge0$. Prove that \n-- \\[\n-- |a_{2016}-2|<2^{-100}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The sequence determined by positive initial values `a0` and `a1` via\n`a (n + 2) = 1 + a (n + 1) / a n`. -/\nnoncomputable def sequence (a0 a1 : ℝ) : ℕ → ℝ\n | 0 => a0\n | 1 => a1\n | n + 2 => 1 + sequence a0 a1 (n + 1) / sequence a0 a1 n\n\n/-- The assertion of the problem: for every choice of positive real initial\nvalues, the corresponding recursively defined sequence satisfies\n`|a_2016 - 2| < 2^(-100)`. -/\ndef Target : Prop :=\n ∀ (a0 a1 : ℝ), 0 < a0 → 0 < a1 →\n |sequence a0 a1 2016 - 2| < (2 : ℝ) ^ (-100 : ℤ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a847300-94a5-5342-8aea-a7312a196ad7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "05d9446c941fab1d435d31e7268c7a6351dac3126b3d1dcf5dde355fcd2c35b8", "task_path": "tasks/nmp3_8a847300-94a5-5342-8aea-a7312a196ad7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a847300-94a5-5342-8aea-a7312a196ad7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8a890ecd-e129-5cb3-b20c-e7ce2bd84431", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $S=\\{n+1,n+2,\\dots ,n+9\\}$ be any set of nine consecutive positive integers. Prove that it is impossible to partition $S$ into two (non‑empty) subsets $X$ and $Y$ (so that $X\\cup Y=S$ and $X\\cap Y=\\varnothing$) with the property \n-- \\[\n-- \\prod_{x\\in X}x\\;=\\;\\prod_{y\\in Y}y.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The set `{n+1, n+2, ..., n+9}` of nine consecutive positive integers,\nencoded as a finite set of natural numbers. -/\ndef NineConsecutiveSet (n : ℕ) : Finset ℕ :=\n Finset.Icc (n + 1) (n + 9)\n\n/-- A labelled partition of `Problem.NineConsecutiveSet n` into two nonempty\nfinite subsets whose products are equal. The explicit subset conjuncts record\nthat `X` and `Y` are subsets of `S`; they are redundant with the union equality\nbut make the partition hypotheses explicit. -/\ndef EqualProductPartition (n : ℕ) (X Y : Finset ℕ) : Prop :=\n X.Nonempty ∧\n Y.Nonempty ∧\n X ⊆ NineConsecutiveSet n ∧\n Y ⊆ NineConsecutiveSet n ∧\n X ∪ Y = NineConsecutiveSet n ∧\n X ∩ Y = ∅ ∧\n X.prod (fun x => x) = Y.prod (fun y => y)\n\n/-- For every choice of nine consecutive positive integers, no partition into\ntwo nonempty subsets can have equal products. -/\ndef Target : Prop :=\n ∀ n : ℕ, ¬ ∃ X Y : Finset ℕ, EqualProductPartition n X Y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a890ecd-e129-5cb3-b20c-e7ce2bd84431", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5659871a4b97297c4ea584654fe8bb4b3fa442de9107e3a6f42501b309a6fe65", "task_path": "tasks/nmp3_8a890ecd-e129-5cb3-b20c-e7ce2bd84431", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a890ecd-e129-5cb3-b20c-e7ce2bd84431", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8a8e284b-c41d-5fa6-8a30-9e3c7f3c1fb0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a^{2}}{a^{2}+ab+b^{2}}+ \\frac{b^{2}}{b^{2}+bc+c^{2}}+ \\frac{c^{2}}{c^{2}+ca+a^{2}}\n-- \\le \\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 2 / (a ^ 2 + a * b + b ^ 2) +\n b ^ 2 / (b ^ 2 + b * c + c ^ 2) +\n c ^ 2 / (c ^ 2 + c * a + a ^ 2)\n\n/-- The right-hand side of the inequality in the problem statement. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a)\n\n/-- For all positive real numbers `a`, `b`, and `c`, the three-term sum of\nquadratic-over-quadratic fractions is at most the ratio of the sum of squares\nto the sum of pairwise products. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a8e284b-c41d-5fa6-8a30-9e3c7f3c1fb0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a89c82c247f8771bdc9550b261891bbc8e40403c6db559043f91e2f7ecc32aa1", "task_path": "tasks/nmp3_8a8e284b-c41d-5fa6-8a30-9e3c7f3c1fb0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8a8e284b-c41d-5fa6-8a30-9e3c7f3c1fb0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8ac1ae00-9f54-573b-92ea-10a1d24f6acb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P(x)=c_0+c_1x+\\dots+c_nx^n$ be a real polynomial whose roots are all real and strictly negative. Prove that the coefficient sequence $(c_0,c_1,\\dots,c_n)$ is log‑concave; equivalently, for every $k=1,\\dots,n-1$ one has $c_k^2\\ge c_{k-1}c_{k+1}\\,. $\nimport Mathlib\n\n/-!\n# Coefficient log-concavity for real polynomials with negative roots\n\nThe source problem fixes a real polynomial\n`P(x) = c₀ + c₁ x + ⋯ + cₙ xⁿ` all of whose roots are real and strictly\nnegative, and asks for a proof that\n`cₖ^2 ≥ cₖ₋₁ cₖ₊₁` for every `k = 1, ..., n - 1`.\n\nThis file gives the proposition-valued statement only; it does not prove it.\n-/\n\nopen Polynomial\n\nnamespace Problem\n\n/-- The polynomial `c₀ + c₁ X + ⋯ + cₙ Xⁿ`, formed from a real coefficient\nsequence and a top index `n`. Coefficients of `c` beyond index `n`, if any,\nare not used. -/\nnoncomputable def PolynomialOfCoeffs (n : ℕ) (c : ℕ → ℝ) : ℝ[X] :=\n ∑ i ∈ Finset.range (n + 1), Polynomial.C (c i) * Polynomial.X ^ i\n\n/-- Every complex root of the real polynomial `P` is real and strictly\nnegative.\n\nMapping `P` to `ℂ[X]` lets this single condition cover both requirements:\nthe imaginary part of each complex root is zero, and its real part is\nstrictly negative. In particular, the zero polynomial does not satisfy this\ncondition, since every complex number is one of its roots. -/\ndef RootsAllRealNegative (P : ℝ[X]) : Prop :=\n ∀ z : ℂ, Polynomial.eval z (P.map (algebraMap ℝ ℂ)) = 0 →\n z.im = 0 ∧ z.re < 0\n\n/-- The coefficient sequence `(c₀, ..., cₙ)` is log-concave in the precise\nequivalent form stated in the problem: for all `k = 1, ..., n - 1`,\n`cₖ^2 ≥ cₖ₋₁ cₖ₊₁`. -/\ndef CoefficientSequenceLogConcave (n : ℕ) (c : ℕ → ℝ) : Prop :=\n ∀ k : ℕ, 1 ≤ k → k < n →\n (c k) ^ 2 ≥ c (k - 1) * c (k + 1)\n\n/-- Formal target of the problem.\n\nFor every real polynomial `P`, every natural number `n`, and every real\ncoefficient sequence `c`, if `P` is represented by\n`c₀ + c₁ X + ⋯ + cₙ Xⁿ` and every complex root of `P` is real and strictly\nnegative, then `(cₖ)` is log-concave: for every natural number `k` with\n`1 ≤ k < n`, one has `cₖ^2 ≥ cₖ₋₁ cₖ₊₁`.\n\nThe range `1 ≤ k < n` is exactly `k = 1, ..., n - 1`; when `n = 0` or\n`n = 1` it is empty, so the conclusion is vacuous. -/\ndef Target : Prop :=\n ∀ (P : ℝ[X]) (n : ℕ) (c : ℕ → ℝ),\n P = PolynomialOfCoeffs n c →\n RootsAllRealNegative P →\n CoefficientSequenceLogConcave n c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8ac1ae00-9f54-573b-92ea-10a1d24f6acb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5f6966adb8e01e2115ba6c7b335720f7d442b25ed4950d0acc3f62c9be30558b", "task_path": "tasks/nmp3_8ac1ae00-9f54-573b-92ea-10a1d24f6acb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8ac1ae00-9f54-573b-92ea-10a1d24f6acb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8acc4b87-065a-59bf-8e7b-529fe1eb2c72", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers such that $abc=1$. Prove that \n-- \\[\n-- 3\\sqrt[3]{(a^{3}+1)(b^{3}+1)(c^{3}+1)}+1\\ge\n-- \\frac1a+\\frac1b+\\frac1c+2\\sqrt{\\,1+\\frac1a+\\frac1b+\\frac1c\\,}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality statement\n\nThe source problem asks, in a `prove` task, to show an inequality for all\npositive real numbers `a`, `b`, `c` satisfying `a * b * c = 1`.\n\nThe real cube root of a nonnegative number `x` is represented here as the\nreal power `x ^ (1 / 3 : ℝ)`. On the (positive) radicand in the problem this\nis the principal cube root.\n-/\n\nnamespace Problem\n\n/-- The real cube root, represented as the real power with exponent `1 / 3`. -/\nnoncomputable def cubeRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 3 : ℝ)\n\n/-- The left-hand side of the stated inequality. -/\nnoncomputable def leftSide (a b c : ℝ) : ℝ :=\n (3 : ℝ) * cubeRoot ((a ^ 3 + 1) * (b ^ 3 + 1) * (c ^ 3 + 1)) + 1\n\n/-- The right-hand side of the stated inequality. -/\nnoncomputable def rightSide (a b c : ℝ) : ℝ :=\n 1 / a + 1 / b + 1 / c +\n 2 * Real.sqrt (1 + 1 / a + 1 / b + 1 / c)\n\n/-- The assertion of the source problem: for all positive reals `a`, `b`, `c`\nwith `a * b * c = 1`, the stated inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n leftSide a b c ≥ rightSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8acc4b87-065a-59bf-8e7b-529fe1eb2c72", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b5847213ec3151edf8fb058ade14b375a6a8e5226d708776a7d859f633175d58", "task_path": "tasks/nmp3_8acc4b87-065a-59bf-8e7b-529fe1eb2c72", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8acc4b87-065a-59bf-8e7b-529fe1eb2c72", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8ad022bd-1b02-5dee-a9fb-f044d675a594", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A committee of 3366 film critics each votes for exactly one actor and exactly one actress. It is known that for every integer $n$ with $1\\le n\\le100$, there exists some actor or some actress who receives exactly $n$ votes. Prove that there must be two critics who voted for the same actor and the same actress (i.e., the ordered pair of votes of two critics coincides).\nimport Mathlib\n\n/-!\n# Formalization of the film critics voting problem\n\nThe problem asks for a proof of a pigeonhole-type assertion about the ordered\npairs of actor and actress votes cast by 3366 critics. We model the critics by\n`Fin 3366`; a vote is a total function from the critics to the type of actors\nand another total function to the type of actresses. The number of votes\nreceived by a person is the cardinality of the corresponding fibre.\n-/\n\nnamespace Problem\n\nuniverse u v\n\n/-- The number of critics who voted for the actor `a`. -/\nnoncomputable def ActorVoteCount {Actor : Type u} (actorVote : Fin 3366 → Actor)\n (a : Actor) : ℕ :=\n Set.ncard {c : Fin 3366 | actorVote c = a}\n\n/-- The number of critics who voted for the actress `r`. -/\nnoncomputable def ActressVoteCount {Actress : Type v} (actressVote : Fin 3366 → Actress)\n (r : Actress) : ℕ :=\n Set.ncard {c : Fin 3366 | actressVote c = r}\n\n/--\nFor every integer `n` from 1 through 100, at least one actor or at least one\nactress receives exactly `n` votes.\n-/\ndef EverySmallCountOccurs {Actor : Type u} {Actress : Type v}\n (actorVote : Fin 3366 → Actor) (actressVote : Fin 3366 → Actress) : Prop :=\n ∀ n : ℕ, 1 ≤ n → n ≤ 100 →\n (∃ a : Actor, ActorVoteCount actorVote a = n) ∨\n (∃ r : Actress, ActressVoteCount actressVote r = n)\n\n/--\nThere are two distinct critics whose actor vote and actress vote both agree;\nequivalently, their ordered pairs coincide.\n-/\ndef HasRepeatedOrderedPair {Actor : Type u} {Actress : Type v}\n (actorVote : Fin 3366 → Actor) (actressVote : Fin 3366 → Actress) : Prop :=\n ∃ c₁ c₂ : Fin 3366,\n c₁ ≠ c₂ ∧ actorVote c₁ = actorVote c₂ ∧ actressVote c₁ = actressVote c₂\n\n/--\nThe complete assertion of the problem: for any types of actors and actresses,\nand any assignments of one actor and one actress to each of 3366 critics, if\nevery `n` with `1 ≤ n ≤ 100` occurs as the number of votes received by some\nactor or some actress, then two distinct critics have the same ordered pair of\nvotes.\n-/\ndef Target : Prop :=\n ∀ (Actor : Type u) (Actress : Type v)\n (actorVote : Fin 3366 → Actor) (actressVote : Fin 3366 → Actress),\n EverySmallCountOccurs actorVote actressVote →\n HasRepeatedOrderedPair actorVote actressVote\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8ad022bd-1b02-5dee-a9fb-f044d675a594", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bd306b685f2fe8b562dbc37d0fae951cae243b9cf2c2299830a3d1e17ef9f8e7", "task_path": "tasks/nmp3_8ad022bd-1b02-5dee-a9fb-f044d675a594", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8ad022bd-1b02-5dee-a9fb-f044d675a594", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8add44d9-cdd8-5afd-9bbd-852b0c1e6860", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\in\\mathbb R^{+}$ such that $x+y+z=3$. Prove that \n-- \\[\n-- \\bigl(xy^{3}+yz^{3}+zx^{3}\\bigr)\\bigl(xy+yz+zx\\bigr)\\le 16.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the real-variable inequality\n\nThe original problem asks to prove an inequality for three positive real numbers\nwhose sum is three. The proposition is stated here as a `Prop`-valued\ndefinition; no proof of it is asserted in this file.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions for the variables in the problem:\n`x`, `y`, and `z` are strictly positive real numbers and their sum is `3`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = 3\n\n/-- The inequality asserted by the problem for an admissible triple. -/\ndef Inequality (x y z : ℝ) : Prop :=\n (x * y ^ 3 + y * z ^ 3 + z * x ^ 3) * (x * y + y * z + z * x) ≤ 16\n\n/-- The complete assertion of the problem: for every triple of strictly positive\nreal numbers `x`, `y`, `z` satisfying `x + y + z = 3`, the stated product is at\nmost `16`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8add44d9-cdd8-5afd-9bbd-852b0c1e6860", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7b5d179ce47b5b6d5adb659add89785b8e38961ec5681c069a6e6304ba0d4e4e", "task_path": "tasks/nmp3_8add44d9-cdd8-5afd-9bbd-852b0c1e6860", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8add44d9-cdd8-5afd-9bbd-852b0c1e6860", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8af3afbc-75e8-5d24-aac3-ff3ee695ef41", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove, without using congruence arguments, that for all natural numbers $n$ and $k$ the integer $4n+3$ never divides $4k^2+1$; i.e. $4n+3 \\nmid 4k^2+1$ for every $n,k\\in\\mathbb N$.\nimport Mathlib\n\n/-!\n# Formal statement of the divisibility problem\n\nThe source problem asks to prove that, for all natural numbers `n` and `k`,\nthe integer `4 * n + 3` never divides `4 * k ^ 2 + 1`.\n-/\n\nnamespace Problem\n\n/-- The integer `4n + 3`, where `n` is a natural number. -/\ndef four_mul_nat_add_three (n : ℕ) : ℤ :=\n 4 * (n : ℤ) + 3\n\n/-- The integer `4k^2 + 1`, where `k` is a natural number. -/\ndef four_mul_nat_sq_add_one (k : ℕ) : ℤ :=\n 4 * (k : ℤ) ^ 2 + 1\n\n/-- For every pair of natural numbers `n` and `k`, the integer `4n + 3`\ndoes not divide the integer `4k^2 + 1`. -/\ndef Target : Prop :=\n ∀ n k : ℕ, ¬ (four_mul_nat_add_three n ∣ four_mul_nat_sq_add_one k)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8af3afbc-75e8-5d24-aac3-ff3ee695ef41", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "165b07927bd86046f8d777f471734b2df011d3099133a25747774fd1369b2865", "task_path": "tasks/nmp3_8af3afbc-75e8-5d24-aac3-ff3ee695ef41", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8af3afbc-75e8-5d24-aac3-ff3ee695ef41", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8b08ce7e-c6a4-543e-97b7-665037259b18", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that \n-- \\[\n-- \\frac1a+\\frac1b+\\frac1c=3.\n-- \\] \n-- Prove that \n-- \\[\n-- \\sqrt[4]{\\frac{a^4+b^4}{2}}+\\sqrt[4]{\\frac{b^4+c^4}{2}}+\\sqrt[4]{\\frac{c^4+a^4}{2}}\\le 3\\bigl(a+b+c-2\\bigr).\\]\nimport Mathlib\n\n/-!\n# Formal statement of the reciprocal-normalized fourth-root inequality\n\nThe source problem asks for a proof of an inequality for three positive real\nnumbers whose reciprocal sum is `3`. The declarations below only formalize the\nstatement; no proof of `Problem.Target` is supplied.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The principal fourth root of a nonnegative real number, written as\n`x ^ (1 / 4 : ℝ)`. All radicands occurring in the problem are nonnegative,\nindeed positive, because `a`, `b`, and `c` are positive. -/\ndef FourthRoot (x : ℝ) : ℝ :=\n Real.rpow x ((1 : ℝ) / 4)\n\n/-- The reciprocal sum `1 / a + 1 / b + 1 / c`. -/\ndef ReciprocalSum (a b c : ℝ) : ℝ :=\n (1 : ℝ) / a + (1 : ℝ) / b + (1 : ℝ) / c\n\n/-- The three variables are positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n (0 : ℝ) < a ∧ (0 : ℝ) < b ∧ (0 : ℝ) < c\n\n/-- The reciprocal-sum equation `1 / a + 1 / b + 1 / c = 3`. -/\ndef ReciprocalCondition (a b c : ℝ) : Prop :=\n ReciprocalSum a b c = (3 : ℝ)\n\n/-- The source problem's hypotheses: `a`, `b`, and `c` are positive real\nnumbers and their reciprocal sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositiveTriple a b c ∧ ReciprocalCondition a b c\n\n/-- The left-hand side of the desired inequality. -/\ndef InequalityLHS (a b c : ℝ) : ℝ :=\n FourthRoot ((a ^ (4 : ℕ) + b ^ (4 : ℕ)) / (2 : ℝ)) +\n FourthRoot ((b ^ (4 : ℕ) + c ^ (4 : ℕ)) / (2 : ℝ)) +\n FourthRoot ((c ^ (4 : ℕ) + a ^ (4 : ℕ)) / (2 : ℝ))\n\n/-- The right-hand side of the desired inequality. -/\ndef InequalityRHS (a b c : ℝ) : ℝ :=\n (3 : ℝ) * (a + b + c - (2 : ℝ))\n\n/-- The asserted inequality, for fixed real numbers `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n InequalityLHS a b c ≤ InequalityRHS a b c\n\n/-- The full statement of the problem: for every triple of positive real\nnumbers `a`, `b`, and `c` satisfying `1 / a + 1 / b + 1 / c = 3`, the\nfourth-root inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8b08ce7e-c6a4-543e-97b7-665037259b18", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a3852834810685708e299c4aebdb3be9968722682260efa3316b0e40b79002a0", "task_path": "tasks/nmp3_8b08ce7e-c6a4-543e-97b7-665037259b18", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8b08ce7e-c6a4-543e-97b7-665037259b18", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8b15fcfd-e8bf-5da5-b7e0-122ad3579361", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all integers $x$ and $y$, let $a_{x,y}$ be a real number. Suppose that $a_{0,0}=0$ and that only a finite number of the $a_{x,y}$ are non‑zero. Prove that \n-- \\[\n-- \\sum_{x=-\\infty}^{\\infty}\\sum_{y=-\\infty}^{\\infty} a_{x,y}\\bigl(a_{x,\\,2x+y}+a_{x+2y,\\,y}\\bigr)\\;\\le\\;\\sqrt{3}\\sum_{x=-\\infty}^{\\infty}\\sum_{y=-\\infty}^{\\infty}a_{x,y}^{2}\\, .\n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- An integer-indexed real array has only finitely many nonzero entries. -/\ndef HasFiniteSupport (a : ℤ × ℤ → ℝ) : Prop :=\n (Function.support a).Finite\n\n/-- The two assumptions on the array in the problem: zero at `(0,0)` and finite support. -/\ndef Admissible (a : ℤ × ℤ → ℝ) : Prop :=\n a (0, 0) = 0 ∧ HasFiniteSupport a\n\n/-- The left-hand side of the displayed inequality, written as the original iterated\nsum over all integers. -/\nnoncomputable def lhs (a : ℤ × ℤ → ℝ) : ℝ :=\n ∑' x : ℤ, (∑' y : ℤ,\n a (x, y) * (a (x, 2 * x + y) + a (x + 2 * y, y)))\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def rhs (a : ℤ × ℤ → ℝ) : ℝ :=\n Real.sqrt 3 * ∑' x : ℤ, (∑' y : ℤ, (a (x, y)) ^ 2)\n\n/-- The assertion to be proved: for every finitely supported real array indexed by\ninteger pairs, vanishing at `(0,0)`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a : ℤ × ℤ → ℝ, Admissible a → lhs a ≤ rhs a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8b15fcfd-e8bf-5da5-b7e0-122ad3579361", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "39159f22cb74e6e8e5979956530c981f8113ea65face2ae25bcc1e2561d37074", "task_path": "tasks/nmp3_8b15fcfd-e8bf-5da5-b7e0-122ad3579361", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8b15fcfd-e8bf-5da5-b7e0-122ad3579361", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8b597053-d584-58d0-b5d3-05983f1a987c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a+b}{b+c}+\\frac{b+c}{c+a}+\\frac{c+a}{a+b}+\\frac{3(ab+ac+bc)}{(a+b+c)^2}\\ge 4.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real three-variable inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthe inequality\n\n`(a + b) / (b + c) + (b + c) / (c + a) + (c + a) / (a + b)\n + 3 * (a * b + a * c + b * c) / (a + b + c)^2 ≥ 4`.\n\nThis file records the statement as a proposition. No proof of the proposition\nis supplied here.\n-/\n\nnamespace Problem\n\n/-- The asserted inequality for a fixed triple of real numbers. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (a + b) / (b + c) + (b + c) / (c + a) + (c + a) / (a + b) +\n (3 : ℝ) * (a * b + a * c + b * c) / (a + b + c) ^ 2 ≥\n (4 : ℝ)\n\n/-- The full source assertion: the inequality holds for every triple of\npositive real numbers `a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8b597053-d584-58d0-b5d3-05983f1a987c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ae8ba8c70a4b9a1d3def274f0c6c9e862fa7093b81bf6e219f9618211c4ff76a", "task_path": "tasks/nmp3_8b597053-d584-58d0-b5d3-05983f1a987c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8b597053-d584-58d0-b5d3-05983f1a987c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8b6e45a0-3d18-5a17-8f98-a57b41d7421e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}} \\frac{b+c}{2a^{2}+bc}\\;\\ge\\;\\frac{6}{a+b+c}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the cyclic inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\n\n`∑_cyc (b + c) / (2 a^2 + b c) ≥ 6 / (a + b + c)`.\n\nThe cyclic sum is expanded into its three terms. The assertion is packaged as a\n`Prop`-valued definition; no proof of it is supplied in this statement file.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The cyclic sum\n`(b+c)/(2a^2+bc) + (c+a)/(2b^2+ca) + (a+b)/(2c^2+ab)`\nas a real-valued expression in `a`, `b`, and `c`. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n (b + c) / (2 * a ^ 2 + b * c) +\n (c + a) / (2 * b ^ 2 + c * a) +\n (a + b) / (2 * c ^ 2 + a * b)\n\n/-- The assertion from the problem: for all positive real numbers `a`, `b`, and\n`c`, the cyclic sum is at least `6 / (a + b + c)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n cyclicSum a b c ≥ 6 / (a + b + c)\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8b6e45a0-3d18-5a17-8f98-a57b41d7421e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "70cf4227dd18072a8580c91a57382f08b68b77f66c694f23040c94b1db169122", "task_path": "tasks/nmp3_8b6e45a0-3d18-5a17-8f98-a57b41d7421e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8b6e45a0-3d18-5a17-8f98-a57b41d7421e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8b9455e6-0df3-5d5e-8ccf-971a374b6496", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given real numbers $a,b,c$ such that $a^{2}+b^{2}+c^{2}=4+abc$, prove that \n-- \\[\n-- (a^{2}+2)(b^{2}+2)(c^{2}+2)\\ge 9+6(ab+bc+ca).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypothesis of the problem, for real numbers `a`, `b`, and `c`. -/\ndef Hypothesis (a b c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 = 4 + a * b * c\n\n/-- The asserted inequality of the problem, for real numbers `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (a ^ 2 + 2) * (b ^ 2 + 2) * (c ^ 2 + 2) ≥\n 9 + 6 * (a * b + b * c + c * a)\n\n/-- The full quantified statement: every real triple satisfying\n`a^2 + b^2 + c^2 = 4 + abc` also satisfies the asserted inequality. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Hypothesis a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8b9455e6-0df3-5d5e-8ccf-971a374b6496", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7988164ab03eb90e8d83775ed4f204190d99f1d464d28b7bd59a4e7b4f85cee2", "task_path": "tasks/nmp3_8b9455e6-0df3-5d5e-8ccf-971a374b6496", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8b9455e6-0df3-5d5e-8ccf-971a374b6496", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8b9e02fc-9259-5095-89eb-47ad88ce26a2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ satisfy $a^{3}+b^{3}+c^{3}+d^{3}=1$. Prove that \n-- \\[\n-- \\frac1{\\,1-abc\\,}+\\frac1{\\,1-bcd\\,}+\\frac1{\\,1-cda\\,}+\\frac1{\\,1-dab\\,}\\le\\frac{16}{3}\\, .\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The problem's assertion: for positive real numbers `a`, `b`, `c`, and `d`\nwhose cubes sum to `1`, the stated cyclic sum of reciprocals is at most `16 / 3`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 0 < d →\n a ^ (3 : ℕ) + b ^ (3 : ℕ) + c ^ (3 : ℕ) + d ^ (3 : ℕ) = (1 : ℝ) →\n (1 : ℝ) / ((1 : ℝ) - a * b * c) +\n (1 : ℝ) / ((1 : ℝ) - b * c * d) +\n (1 : ℝ) / ((1 : ℝ) - c * d * a) +\n (1 : ℝ) / ((1 : ℝ) - d * a * b) ≤\n (16 : ℝ) / (3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8b9e02fc-9259-5095-89eb-47ad88ce26a2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2559fec423ba846256e06364e437240aa0ec2e6cdbc02a7b717511019195d324", "task_path": "tasks/nmp3_8b9e02fc-9259-5095-89eb-47ad88ce26a2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8b9e02fc-9259-5095-89eb-47ad88ce26a2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8bb8797b-8f2e-512c-a059-d1f4a79e5818", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Initially, two distinct positive integers $a$ and $b$ are written on a blackboard. At each step Andrea may choose two distinct numbers $x$ and $y$ already on the blackboard and write the number $\\gcd(x,y)+\\operatorname{lcm}(x,y)$ on the blackboard as well. Let $n$ be any positive integer. Prove that, regardless of the initial values of $a$ and $b$, Andrea can perform a finite number of steps after which a multiple of $n$ appears on the blackboard.\nimport Mathlib\n\n/-!\n# Formalization of the blackboard gcd/lcm problem\n\nThe blackboard is represented by the finite set of integer values currently\nwritten on it. A legal step adds `gcd x y + lcm x y` for two distinct values\nalready present. Reachability is the reflexive-transitive closure of that\none-step relation, i.e. it represents any finite number of legal steps. A\npositive multiple of `n` is expressed by the usual natural-number divisibility\nrelation `n ∣ z`.\n-/\n\nnamespace Problem\n\n/-- The initial blackboard, containing the two values `a` and `b`. -/\ndef InitialBoard (a b : ℕ) : Finset ℕ :=\n {a, b}\n\n/-- One legal blackboard step: from the finite set `S`, choose two distinct\nelements `x` and `y`, and add `gcd x y + lcm x y` to the board. -/\ndef BoardStep (S T : Finset ℕ) : Prop :=\n ∃ (x : ℕ), x ∈ S ∧ ∃ (y : ℕ), y ∈ S ∧ x ≠ y ∧\n T = insert (Nat.gcd x y + Nat.lcm x y) S\n\n/-- The board `S` is reachable from the initial board containing `a` and `b`\nby finitely many legal blackboard steps (possibly zero steps). -/\ndef Reachable (a b : ℕ) (S : Finset ℕ) : Prop :=\n Relation.ReflTransGen BoardStep (InitialBoard a b) S\n\n/-- The board `S` contains a multiple of the positive integer `n`. -/\ndef ContainsMultiple (n : ℕ) (S : Finset ℕ) : Prop :=\n ∃ (z : ℕ), z ∈ S ∧ n ∣ z\n\n/-- The assertion of the problem: for every pair of distinct positive initial\nintegers `a`, `b` and every positive integer `n`, Andrea has a finite legal\nplay ending with a board containing a multiple of `n`. -/\ndef Target : Prop :=\n ∀ (a b : ℕ), 0 < a → 0 < b → a ≠ b →\n ∀ (n : ℕ), 0 < n →\n ∃ S : Finset ℕ, Reachable a b S ∧ ContainsMultiple n S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8bb8797b-8f2e-512c-a059-d1f4a79e5818", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bd47edd86f5bef062fcfd1b55316c5d04b99810d70eb44e0008f10a28eb48737", "task_path": "tasks/nmp3_8bb8797b-8f2e-512c-a059-d1f4a79e5818", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8bb8797b-8f2e-512c-a059-d1f4a79e5818", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8bf295af-8045-5a0f-a1ee-3c729cfe87e8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given positive real numbers $a,b,c$ satisfying $ab+bc+ca=1$, prove that \n-- \\[\n-- \\frac{(1+a^{2})^{2}}{b^{2}+c^{2}}+\\frac{(1+b^{2})^{2}}{c^{2}+a^{2}}+\\frac{(1+c^{2})^{2}}{a^{2}+b^{2}}\\ge 8.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe problem asks to prove an inequality for three positive real numbers\nsubject to the condition `a*b + b*c + c*a = 1`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality from the problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (1 + a ^ 2) ^ 2 / (b ^ 2 + c ^ 2) +\n (1 + b ^ 2) ^ 2 / (c ^ 2 + a ^ 2) +\n (1 + c ^ 2) ^ 2 / (a ^ 2 + b ^ 2)\n\n/--\nFor all positive real numbers `a`, `b`, and `c` satisfying\n`a*b + b*c + c*a = 1`, the sum of the three given fractions is at least `8`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n a * b + b * c + c * a = 1 →\n LHS a b c ≥ 8\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8bf295af-8045-5a0f-a1ee-3c729cfe87e8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1fcd2c009ebf3b1c8c092a8c0667892df593df2259e7d16a2cea0f8af089d221", "task_path": "tasks/nmp3_8bf295af-8045-5a0f-a1ee-3c729cfe87e8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8bf295af-8045-5a0f-a1ee-3c729cfe87e8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8c040252-4af1-5567-ae96-f0f44300b9d0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a}{b}\\cdot\\frac{a^{3}-b^{3}}{a^{3}+b^{3}}+\\frac{b}{c}\\cdot\\frac{b^{3}-c^{3}}{b^{3}+c^{3}}+\\frac{c}{a}\\cdot\\frac{c^{3}-a^{3}}{c^{3}+a^{3}}\\ge0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-term cyclic real inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\nthat the displayed cyclic sum is nonnegative.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a / b) * ((a ^ 3 - b ^ 3) / (a ^ 3 + b ^ 3)) +\n (b / c) * ((b ^ 3 - c ^ 3) / (b ^ 3 + c ^ 3)) +\n (c / a) * ((c ^ 3 - a ^ 3) / (c ^ 3 + a ^ 3))\n\n/-- For all positive real numbers `a`, `b`, and `c`, the cyclic expression\nfrom the problem is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8c040252-4af1-5567-ae96-f0f44300b9d0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "49c8eeb82d4922385a9bd97b6659f8ce7bcb1c7872941ba28b2cf33fc7c35556", "task_path": "tasks/nmp3_8c040252-4af1-5567-ae96-f0f44300b9d0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8c040252-4af1-5567-ae96-f0f44300b9d0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8c379bec-39d7-583a-9f44-e4f7151893de", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be a graph whose edges are colored with two colors. Assume that for each color, every connected component of the subgraph formed by the edges of that color contains at most $n>1$ vertices. Prove that the vertices of $G$ can be properly colored with $n$ colors.\nimport Mathlib.Combinatorics.SimpleGraph.Coloring.EdgeLabeling\nimport Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex\n\n/-!\n# Two-edge-coloured graphs with bounded monochromatic components\n\nThis file formalizes the statement of the following graph-colouring problem.\n\nLet `G` be a graph whose edges are coloured with two colours. Assume that, for\neach colour, every connected component of the subgraph formed by the edges of\nthat colour contains at most `n > 1` vertices. Then the vertices of `G` can be\nproperly coloured with `n` colours.\n\nThe assertion is represented as a proposition-valued definition; no proof is\nprovided, since the task is statement formalization.\n-/\n\nopen SimpleGraph\n\nuniverse u\n\nnamespace Problem\n\n/-- The hypothesis that both monochromatic edge subgraphs of a two-edge-coloured\ngraph have only finite connected components, each with at most `n` vertices.\n\nThe two colours are indexed by `Fin 2`. For each colour `i`,\n`C.labelGraph i` is the spanning subgraph whose edges are precisely those\nlabelled `i`. Its connected components are represented by\n`(C.labelGraph i).ConnectedComponent`; the support `K.supp` is the set of\nall vertices in that component. The conjunct `K.supp.Finite` records that the\ncomponent is finite, and `K.supp.ncard ≤ n` records that it has at most `n`\nvertices. -/\ndef MonochromaticComponentBounded {V : Type u} (G : SimpleGraph V)\n (C : G.EdgeLabeling (Fin 2)) (n : ℕ) : Prop :=\n ∀ i : Fin 2, ∀ K : (C.labelGraph i).ConnectedComponent,\n K.supp.Finite ∧ K.supp.ncard ≤ n\n\n/-- Formal statement of the problem: every simple graph whose edges are coloured\nwith two colours and whose monochromatic connected components each have at most\n`n` vertices, where `n > 1`, admits a proper vertex colouring with `n` colours.\n\n`G.Colorable n` is Mathlib's predicate that `G` has a proper vertex colouring\nusing colours in `Fin n`. -/\ndef Target : Prop :=\n ∀ {V : Type u} (G : SimpleGraph V) (C : G.EdgeLabeling (Fin 2)) (n : ℕ),\n 1 < n →\n MonochromaticComponentBounded G C n →\n G.Colorable n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8c379bec-39d7-583a-9f44-e4f7151893de", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1cda256bb9b519d7887008a369f9b75ae6272fc1d2ef2bd17be7af2d2abec078", "task_path": "tasks/nmp3_8c379bec-39d7-583a-9f44-e4f7151893de", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8c379bec-39d7-583a-9f44-e4f7151893de", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8c3d208f-3967-5b94-9375-dc20d0372f08", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The sequence $\\{a_n\\}_{n\\ge1}$ is defined by $a_1=2,\\;a_2=12$ and \n-- $$a_{n+1}=6a_n-a_{n-1}\\qquad\\text{for every integer }n\\ge2.$$ \n-- Prove that no term $a_n$ is equal to a perfect power greater than one; i.e. there do not exist integers $m>1$ and $k\\ge2$ such that $a_n=m^k$ for any $n\\ge1\\,. $\nimport Mathlib\n\n/-!\nFormalization of the statement of the problem.\n\nThe original sequence is indexed by integers `n ≥ 1`. It is represented here\nas a function `Nat → Int`; the value at `0` is definitional padding outside the\noriginal index set. Thus all statements and quantifiers below involving the\nsequence use the source's lower bound `n ≥ 1`.\n-/\n\nnamespace Problem\n\n/-- The sequence `a` from the problem. For the source indices `n ≥ 1` the\ndefining clauses are `a 1 = 2`, `a 2 = 12`, and\n`a (n + 1) = 6 * a n - a (n - 1)` for every `n ≥ 2`. The value `a 0 = 0`\nis not part of the source problem; it is the arbitrary totalization needed to\ndefine a function on all natural numbers. -/\ndef a : Nat → Int\n | 0 => 0\n | 1 => 2\n | 2 => 12\n | n + 3 => 6 * a (n + 2) - a (n + 1)\n\n@[simp] theorem a_zero : a 0 = 0 := rfl\n\n@[simp] theorem a_one : a 1 = 2 := rfl\n\n@[simp] theorem a_two : a 2 = 12 := rfl\n\n/-- The recurrence of the sequence, at the original indexing and with the\noriginal lower bound on the recurrence parameter. -/\ntheorem a_recurrence (n : Nat) (hn : 2 ≤ n) :\n a (n + 1) = 6 * a n - a (n - 1) := by\n obtain ⟨k, rfl⟩ := Nat.exists_eq_add_of_le' hn\n rfl\n\n/-- An integer is a perfect power greater than one in the precise sense used in\nthe problem: it has a representation `m ^ k` with an integer base `m > 1` and\nan exponent `k ≥ 2`. The exponent is represented as a natural number, the\ncanonical type for a nonnegative integer exponent in Lean. -/\ndef IsPerfectPowerGreaterThanOne (x : Int) : Prop :=\n ∃ m : Int, 1 < m ∧ ∃ k : Nat, 2 ≤ k ∧ x = m ^ k\n\n/-- The assertion to be proved: for every term of the sequence whose index is\n`n ≥ 1`, there do not exist an integer `m > 1` and an exponent `k ≥ 2` such\nthat `a_n = m ^ k`. -/\ndef Target : Prop :=\n ∀ n : Nat, 1 ≤ n → ¬ IsPerfectPowerGreaterThanOne (a n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8c3d208f-3967-5b94-9375-dc20d0372f08", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c4ddc153eda1f609103c8cab607414af4ead8dc1f05aa758717eaa7f06875e9a", "task_path": "tasks/nmp3_8c3d208f-3967-5b94-9375-dc20d0372f08", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8c3d208f-3967-5b94-9375-dc20d0372f08", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8c6e9e27-14e9-542e-bb98-36257f4a5225", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle (i.e. $a,b,c>0$ and $a+b>c$, $b+c>a$, $c+a>b$). Prove that\n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\;\\ge\\;\\frac{2a}{b+c}+\\frac{2b}{c+a}+\\frac{2c}{a+b}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the triangle side-length inequality\n\nThe source problem asks, for real side lengths of a nondegenerate triangle,\nto prove\n`a / b + b / c + c / a ≥ 2a / (b + c) + 2b / (c + a) + 2c / (a + b)`.\n-/\n\nnamespace Problem\n\n/-- The three positive real numbers `a`, `b`, and `c` satisfy the strict\ntriangle inequalities, and hence are admissible as side lengths of a\nnondegenerate triangle. -/\ndef IsTriangleSideLength (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / b + b / c + c / a\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 2 * a / (b + c) + 2 * b / (c + a) + 2 * c / (a + b)\n\n/-- The complete assertion of the source problem: for every triple of positive\nreal side lengths satisfying the three strict triangle inequalities, the\nleft-hand side is at least the right-hand side. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, IsTriangleSideLength a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8c6e9e27-14e9-542e-bb98-36257f4a5225", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "38757c88ea115c52ddecfaa0bd8ac5160f9006bcb9b10cf50e77d53d853c3147", "task_path": "tasks/nmp3_8c6e9e27-14e9-542e-bb98-36257f4a5225", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8c6e9e27-14e9-542e-bb98-36257f4a5225", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8c788b71-2c9a-533e-b819-45b9a083b172", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that for every real $x$ and $y$,\n-- $$f(x)f(y)-f(x-1)-f(y+1)=f(xy)+2x-2y-4.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- A real function satisfies the functional equation of the problem. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ,\n f x * f y - f (x - 1) - f (y + 1) =\n f (x * y) + 2 * x - 2 * y - 4\n\n/-- The function asserted by the complete answer. -/\ndef CandidateFunction : ℝ → ℝ :=\n fun x : ℝ => x ^ 2 + 1\n\n/-- The proposed answer set consisting of the single candidate function. -/\ndef CandidateSolutionSet : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | f = CandidateFunction}\n\n/-- A set is a complete answer when it contains exactly the admissible functions.\nThe two directions respectively say that every proposed member is admissible and\nthat every admissible function is included. -/\ndef CompleteAnswer (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, f ∈ S ↔ Admissible f\n\n/-- The complete classification asserted for the problem: the admissible functions\nare precisely those equal to the candidate function. -/\ndef Target : Prop :=\n CompleteAnswer CandidateSolutionSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8c788b71-2c9a-533e-b819-45b9a083b172", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2a2c6cba455551730086256fa03cf7972a305734fbe6c2623b16e19b41d5cefa", "task_path": "tasks/nmp3_8c788b71-2c9a-533e-b819-45b9a083b172", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8c788b71-2c9a-533e-b819-45b9a083b172", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8cbe508a-27eb-5917-942b-a4eed88d56e3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be a prime and let $A$ be an infinite set of integers. Prove that there exists a subset $B\\subseteq A$ with $|B|=2p-2$ such that for any $p$ distinct elements of $B$, their arithmetic mean is not an element of $A$.\nimport Mathlib\n\n/-!\n# Statement formalization\n\nProblem: for every prime natural number `p` and every infinite set `A` of\nintegers, there is a finite subset `B` of `A` with `|B| = 2*p - 2` such that\nno arithmetic mean of `p` distinct elements of `B` belongs to `A`.\n\nThe arithmetic mean is represented in `ℚ`, and membership of an integer set\nis transported to `ℚ` by the canonical coercion.\n-/\n\nnamespace Problem\n\n/-- The image of a set of integers in the rational numbers, used to state\nthat a rational arithmetic mean is an element of the original integer set. -/\ndef IntSetInRat (A : Set ℤ) : Set ℚ :=\n ((fun z : ℤ => (z : ℚ)) '' A)\n\n/-- The arithmetic mean of a finite set of integers, with denominator `p`.\nThe definition itself does not assert `s.card = p`; that condition is imposed\nby `AdmissibleSubset`. -/\ndef ArithmeticMean (p : ℕ) (s : Finset ℤ) : ℚ :=\n (∑ x ∈ s, (x : ℚ)) / (p : ℚ)\n\n/-- A finite subset `B` of `A` is admissible for the problem when it has\ncardinality `2*p - 2` and every `p`-element subset of `B` has arithmetic mean\noutside `A`. -/\ndef AdmissibleSubset (p : ℕ) (A : Set ℤ) (B : Finset ℤ) : Prop :=\n (B : Set ℤ) ⊆ A ∧\n B.card = 2 * p - 2 ∧\n ∀ s : Finset ℤ, s ⊆ B → s.card = p → ArithmeticMean p s ∉ IntSetInRat A\n\n/-- Formal statement of the problem: for every prime `p` and every infinite\nset `A ⊆ ℤ`, some admissible subset `B` exists. -/\ndef Target : Prop :=\n ∀ (p : ℕ), Nat.Prime p → ∀ (A : Set ℤ), A.Infinite →\n ∃ B : Finset ℤ, AdmissibleSubset p A B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8cbe508a-27eb-5917-942b-a4eed88d56e3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "703f5550279fa894b29e6cef9240dbedd76a86757f0ea63c9ae22f977df58d7c", "task_path": "tasks/nmp3_8cbe508a-27eb-5917-942b-a4eed88d56e3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8cbe508a-27eb-5917-942b-a4eed88d56e3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8cd72cec-bd1a-57e8-a63c-bfb7c3ee31bb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $x$, $y$, $z$, prove that \n-- \n-- \\[\n-- \\frac{(x+y)(x+z)}{y+z}+\\frac{(y+z)(y+x)}{z+x}+\\frac{(z+x)(z+y)}{x+y}\n-- + xyz\\Biggl(\\frac{1}{x^{2}+xy+yz+zx}\n-- +\\frac{1}{y^{2}+xy+yz+zx}\n-- +\\frac{1}{z^{2}+xy+yz+zx}\\Biggr)\n-- \\;\\ge\\; \\frac{9(x+y+z)}{4}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe problem asks to prove, for all positive real numbers `x`, `y`, and `z`,\nthe inequality stated in `Problem.Target`.\n\nThis file formalizes the proposition only; it intentionally contains no proof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The first summand:\n`((x + y) * (x + z)) / (y + z)`. -/\ndef firstTerm (x y z : ℝ) : ℝ :=\n ((x + y) * (x + z)) / (y + z)\n\n/-- The second summand:\n`((y + z) * (y + x)) / (z + x)`. -/\ndef secondTerm (x y z : ℝ) : ℝ :=\n ((y + z) * (y + x)) / (z + x)\n\n/-- The third summand:\n`((z + x) * (z + y)) / (x + y)`. -/\ndef thirdTerm (x y z : ℝ) : ℝ :=\n ((z + x) * (z + y)) / (x + y)\n\n/-- The denominator `x^2 + xy + yz + zx` occurring in the first\nreciprocal summand. -/\ndef denomX (x y z : ℝ) : ℝ :=\n x ^ 2 + x * y + y * z + z * x\n\n/-- The denominator `y^2 + xy + yz + zx` occurring in the second\nreciprocal summand. -/\ndef denomY (x y z : ℝ) : ℝ :=\n y ^ 2 + x * y + y * z + z * x\n\n/-- The denominator `z^2 + xy + yz + zx` occurring in the third\nreciprocal summand. -/\ndef denomZ (x y z : ℝ) : ℝ :=\n z ^ 2 + x * y + y * z + z * x\n\n/-- The `xyz`-weighted reciprocal sum:\n`xyz * (1 / denomX + 1 / denomY + 1 / denomZ)`. -/\ndef reciprocalSum (x y z : ℝ) : ℝ :=\n x * y * z *\n (1 / denomX x y z + 1 / denomY x y z + 1 / denomZ x y z)\n\n/-- The complete left-hand side of the inequality. -/\ndef leftHandSide (x y z : ℝ) : ℝ :=\n firstTerm x y z + secondTerm x y z + thirdTerm x y z + reciprocalSum x y z\n\n/-- The complete right-hand side of the inequality:\n`9 * (x + y + z) / 4`. -/\ndef rightHandSide (x y z : ℝ) : ℝ :=\n 9 * (x + y + z) / 4\n\n/-- The assertion of the problem: for every triple of positive real numbers,\nthe left-hand side is at least the right-hand side. -/\ndef Target : Prop :=\n ∀ (x y z : ℝ), 0 < x → 0 < y → 0 < z →\n leftHandSide x y z ≥ rightHandSide x y z\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8cd72cec-bd1a-57e8-a63c-bfb7c3ee31bb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1e1c9fc944d0f828f4494508d1c828d16501dcd9f0ad7856e1c633f5913628c5", "task_path": "tasks/nmp3_8cd72cec-bd1a-57e8-a63c-bfb7c3ee31bb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8cd72cec-bd1a-57e8-a63c-bfb7c3ee31bb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8cd961e6-1d60-5330-bfa8-19d1131a0137", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$, prove \n-- \\[\n-- 10(a^3+b^3+c^3)+3+18abc \\ge 6\\sum_{\\sym} a^{3/2}b^{1/2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real three-variable inequality\n\nThe source problem uses `∑_{sym} a^(3/2) b^(1/2)`. Here the symmetric sum is\nexpanded over all six ordered choices of two distinct variables, namely\n`a,b`, `a,c`, `b,a`, `b,c`, `c,a`, and `c,b`.\n-/\n\nnamespace Problem\n\n/-- The symmetric sum\n`a^(3/2) b^(1/2) + a^(3/2) c^(1/2) + b^(3/2) a^(1/2) +\n b^(3/2) c^(1/2) + c^(3/2) a^(1/2) + c^(3/2) b^(1/2)`.\n\nThe real powers are `Real.rpow`, written using Lean's real-exponent power\nnotation. -/\nnoncomputable def symPowSum (a b c : ℝ) : ℝ :=\n a ^ (3 / 2 : ℝ) * b ^ (1 / 2 : ℝ)\n + a ^ (3 / 2 : ℝ) * c ^ (1 / 2 : ℝ)\n + b ^ (3 / 2 : ℝ) * a ^ (1 / 2 : ℝ)\n + b ^ (3 / 2 : ℝ) * c ^ (1 / 2 : ℝ)\n + c ^ (3 / 2 : ℝ) * a ^ (1 / 2 : ℝ)\n + c ^ (3 / 2 : ℝ) * b ^ (1 / 2 : ℝ)\n\n/-- The inequality in the source, with the symmetric sum expanded explicitly. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n 10 * (a ^ (3 : ℕ) + b ^ (3 : ℕ) + c ^ (3 : ℕ)) + 3 + 18 * (a * b * c)\n ≥ 6 * symPowSum a b c\n\n/-- The full universally quantified target: for every triple of positive real\nnumbers `a`, `b`, and `c`, the stated inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8cd961e6-1d60-5330-bfa8-19d1131a0137", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8d2a4f6e4904d49f907f2457965c268f25696b41104ab869c70e5c5a1b8aaf98", "task_path": "tasks/nmp3_8cd961e6-1d60-5330-bfa8-19d1131a0137", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8cd961e6-1d60-5330-bfa8-19d1131a0137", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8ce698ef-8e3e-5197-a945-98aedced8435", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\ge0$. Prove that \n-- \\[\n-- 2\\bigl(a^4+b^4+c^4+d^4-4abcd\\bigr)+(a+b)(b+c)(c+d)(d+a)\\ge\\bigl(a^2+b^2+c^2+d^2\\bigr)^2\\,. \n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the four-variable nonnegative real inequality\n\nThis file records the proposition from the problem statement. It deliberately\ncontains no proof of the inequality.\n-/\n\nnamespace Problem\n\n/-- The algebraic inequality asserted for four real numbers `a`, `b`, `c`, and `d`.\n\nThe left-hand side is\n`2 * (a^4 + b^4 + c^4 + d^4 - 4*a*b*c*d) + (a+b)*(b+c)*(c+d)*(d+a)`,\nand the right-hand side is `(a^2 + b^2 + c^2 + d^2)^2`. -/\ndef Inequality (a b c d : ℝ) : Prop :=\n 2 * (a ^ 4 + b ^ 4 + c ^ 4 + d ^ 4 - 4 * a * b * c * d)\n + (a + b) * (b + c) * (c + d) * (d + a)\n ≥ (a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2) ^ 2\n\n/-- The full assertion: for all nonnegative real numbers `a`, `b`, `c`, and `d`,\n`Problem.Inequality a b c d` holds. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → 0 ≤ d → Inequality a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8ce698ef-8e3e-5197-a945-98aedced8435", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4b4f67bd7cd4be16a8b74c57b0294a6da07bb4ad82a8fce19e882420c3d0ad04", "task_path": "tasks/nmp3_8ce698ef-8e3e-5197-a945-98aedced8435", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8ce698ef-8e3e-5197-a945-98aedced8435", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8d0cc27a-0859-5bca-9e35-7e5cbae920a8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle and let $M$ be a point in its interior. Prove that \n-- \\[\n-- \\min\\{MA,MB,MC\\}+MA+MB+MC \\;<\\; AB+BC+CA\\,.\n-- \\]\n/-\nFormal statement of the problem in `problem.md`.\n\nLet `ABC` be a triangle and let `M` be a point in its interior. Prove that\n`min {MA, MB, MC} + MA + MB + MC < AB + BC + CA`.\n\nThe Euclidean plane is represented by `EuclideanSpace ℝ (Fin 2)`, a\n(nondegenerate) triangle by three non-collinear points. The assertion is\nrecorded as a `Prop`-valued definition, not proved here.\n-/\nimport Mathlib\n\nnoncomputable section\n\nopen Set\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The ambient Euclidean plane. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `A`, `B`, `C` are the vertices of a genuine (nondegenerate) triangle,\ni.e. they are not collinear. In particular, this implies that the three\nvertices are pairwise distinct. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- `M` lies in the (strict, topological) interior of the triangle with\nvertices `A`, `B`, `C`. Since a nondegenerate triangle in the plane has\nnonempty interior, this is the usual open triangular region. -/\ndef IsInteriorPoint (A B C M : Plane) : Prop :=\n M ∈ interior (convexHull ℝ ({A, B, C} : Set Plane))\n\n/-- The minimum of the distances from `M` to the vertices `A`, `B`, `C`,\nwritten `min {MA, MB, MC}` in the source problem. -/\ndef minDist (M A B C : Plane) : ℝ :=\n min (dist M A) (min (dist M B) (dist M C))\n\n/-- The sum `MA + MB + MC` of the distances from `M` to the three\nvertices. -/\ndef distSum (M A B C : Plane) : ℝ :=\n dist M A + dist M B + dist M C\n\n/-- The perimeter `AB + BC + CA` of the triangle with vertices `A`, `B`,\n`C`. -/\ndef perimeter (A B C : Plane) : ℝ :=\n dist A B + dist B C + dist C A\n\n/-- The strict inequality asserted by the problem for a fixed triangle\n`ABC` and a fixed point `M`. -/\ndef Inequality (A B C M : Plane) : Prop :=\n minDist M A B C + distSum M A B C < perimeter A B C\n\n/-- Admissibility of the data in the problem: `ABC` is a genuine triangle\nand `M` is a point in its interior. -/\ndef Admissible (A B C M : Plane) : Prop :=\n IsTriangle A B C ∧ IsInteriorPoint A B C M\n\n/-- The complete assertion of the problem: for every triangle `ABC` in the\nEuclidean plane and every point `M` in its interior,\n`min {MA, MB, MC} + MA + MB + MC < AB + BC + CA`.\n\nThis is only the target proposition; no proof of it is supplied here. -/\ndef Target : Prop :=\n ∀ (A B C M : Plane),\n Admissible A B C M →\n Inequality A B C M\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8d0cc27a-0859-5bca-9e35-7e5cbae920a8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d93c392e2840d74067ba170d15fa897a27b2d4a74501ec95225dc2953ba564f4", "task_path": "tasks/nmp3_8d0cc27a-0859-5bca-9e35-7e5cbae920a8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8d0cc27a-0859-5bca-9e35-7e5cbae920a8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8d2c7d8c-d6b3-5135-9f51-e11bed77cb9b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- An infinite set $B$ of positive integers satisfies the property: for any $a,b\\in B$ with $a>b$, the integer $\\displaystyle\\frac{a-b}{\\gcd(a,b)}$ also belongs to $B$ (here $\\gcd(a,b)$ denotes the greatest common divisor of $a$ and $b$). Prove that $B$ contains every positive integer.\nimport Mathlib.Data.Set.Finite.Basic\nimport Mathlib.Data.Nat.GCD.Basic\n\n/-!\n# Formalization of the stated problem\n\nAn infinite set `B` of positive integers is closed under the operation\n\n`(a, b) ↦ (a - b) / gcd(a, b)`\n\nfor all `a, b ∈ B` with `a > b`. The assertion to be proved is that such a\nset contains every positive integer.\n\nThis file records the mathematical statement as a proposition. It does not\nprovide a proof of the proposition.\n-/\n\nnamespace Problem\n\n/-- `B` is an infinite set all of whose members are positive integers. -/\ndef IsInfinitePositiveSet (B : Set ℕ) : Prop :=\n B.Infinite ∧ ∀ n : ℕ, n ∈ B → 0 < n\n\n/-- The normalized difference `(a - b) / gcd(a, b)`, represented as a natural\nnumber. In the closure condition below it is only used when `b < a` and both\nnumbers are positive members of `B`; in that situation `Nat.gcd a b` divides\n`a - b`, so natural-number division agrees with the exact integer quotient. -/\ndef NormalizedDifference (a b : ℕ) : ℕ :=\n (a - b) / Nat.gcd a b\n\n/-- `B` is closed under the normalized positive difference operation: whenever\n`a` and `b` are elements of `B` and `b < a`, the normalized difference\n`(a - b) / gcd(a, b)` is again an element of `B`. -/\ndef ClosedUnderNormalizedDifference (B : Set ℕ) : Prop :=\n ∀ a : ℕ, ∀ b : ℕ, a ∈ B → b ∈ B → b < a →\n NormalizedDifference a b ∈ B\n\n/-- The admissibility predicate for a set `B` satisfying all hypotheses of the\nproblem: it is infinite, consists only of positive integers, and is closed\nunder the stated normalized-difference operation. -/\ndef Admissible (B : Set ℕ) : Prop :=\n IsInfinitePositiveSet B ∧ ClosedUnderNormalizedDifference B\n\n/-- `B` contains every positive integer. -/\ndef ContainsEveryPositiveInteger (B : Set ℕ) : Prop :=\n ∀ n : ℕ, 0 < n → n ∈ B\n\n/-- The full proposition asserted by the problem: every admissible set `B`\ncontains every positive integer. -/\ndef Target : Prop :=\n ∀ B : Set ℕ, Admissible B → ContainsEveryPositiveInteger B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8d2c7d8c-d6b3-5135-9f51-e11bed77cb9b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6876cf6040d7ce9d40365f6b2f204211a0e41969c3164450e62deaaa47524d6d", "task_path": "tasks/nmp3_8d2c7d8c-d6b3-5135-9f51-e11bed77cb9b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8d2c7d8c-d6b3-5135-9f51-e11bed77cb9b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8d4cb1a6-464f-5c80-ada3-ec7a87b87d67", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute‑angled triangle. Prove that \n-- $$\\cos A+\\cos B+\\cos C\\le\\sqrt{\\,2\\cos A\\cos B\\cos C+2\\,}\\,.$$\nimport Mathlib\n\n/-!\n# Formalization of the acute-triangle cosine inequality\n\nThe original problem considers the three interior angles of an acute-angled\ntriangle. We model those angles by real numbers in radians. A triple\n`(A, B, C)` is a valid acute-triangle angle triple exactly when all three\nangles are strictly between `0` and `π / 2` and their sum is `π`.\n-/\n\nnamespace Problem\n\n/-- The three real numbers `A`, `B`, and `C` are the interior angles, measured\nin radians, of an acute-angled triangle. -/\ndef IsAcuteTriangleAngles (A B C : ℝ) : Prop :=\n 0 < A ∧ A < Real.pi / 2 ∧\n 0 < B ∧ B < Real.pi / 2 ∧\n 0 < C ∧ C < Real.pi / 2 ∧\n A + B + C = Real.pi\n\n/-- For every acute-angled triangle with interior angles `A`, `B`, and `C`,\nthe claimed cosine inequality holds. -/\ndef Target : Prop :=\n ∀ A B C : ℝ,\n IsAcuteTriangleAngles A B C →\n Real.cos A + Real.cos B + Real.cos C ≤\n Real.sqrt (2 * Real.cos A * Real.cos B * Real.cos C + 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8d4cb1a6-464f-5c80-ada3-ec7a87b87d67", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8da1cec82f999c3605ab91455a51382864ff77b7e475adef8f9a127a8d2e55a5", "task_path": "tasks/nmp3_8d4cb1a6-464f-5c80-ada3-ec7a87b87d67", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8d4cb1a6-464f-5c80-ada3-ec7a87b87d67", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8d6ba90d-8c76-552f-914b-3adff1903527", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=1$. Prove that \n-- \\[\n-- \\frac{\\sqrt{a^2+abc}}{c+ab}+\\frac{\\sqrt{b^2+abc}}{a+bc}+\\frac{\\sqrt{c^2+abc}}{b+ca}\\le\\frac{1}{2\\sqrt{abc}}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe source problem asks for a proof of a single real-variable inequality under\nthe constraints `a > 0`, `b > 0`, `c > 0`, and `a + b + c = 1`.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the real variables `a`, `b`, and `c`:\neach is strictly positive and their sum is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 1\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a ^ 2 + a * b * c) / (c + a * b) +\n Real.sqrt (b ^ 2 + a * b * c) / (a + b * c) +\n Real.sqrt (c ^ 2 + a * b * c) / (b + c * a)\n\n/-- The right-hand side of the inequality in the problem statement. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 1 / (2 * Real.sqrt (a * b * c))\n\n/-- The target proposition: for all real numbers `a`, `b`, and `c` satisfying\nthe admissibility conditions, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8d6ba90d-8c76-552f-914b-3adff1903527", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6c5f011210b1b4a04583da98e2c8088531bb19838c1f9664c0bbc2e984b851ff", "task_path": "tasks/nmp3_8d6ba90d-8c76-552f-914b-3adff1903527", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8d6ba90d-8c76-552f-914b-3adff1903527", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8d703736-caf2-523b-b6ec-5c7c87996fcb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$. Prove that \n-- \\[\n-- \\sqrt{a^3(b+c)}+\\sqrt{b^3(c+a)}+\\sqrt{c^3(a+b)}\n-- \\ge\n-- \\sqrt{\\bigl(a^2+b^2+c^2+ab+bc+ca\\bigr)(ab+bc+ca)}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissible triples of real numbers in the problem: all three are nonnegative. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n Real.sqrt (a ^ 3 * (b + c)) +\n Real.sqrt (b ^ 3 * (c + a)) +\n Real.sqrt (c ^ 3 * (a + b))\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n Real.sqrt ((a ^ 2 + b ^ 2 + c ^ 2 + a * b + b * c + c * a) *\n (a * b + b * c + c * a))\n\n/-- The asserted inequality for a fixed admissible triple. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ RHS a b c\n\n/-- The complete mathematical assertion of the problem. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8d703736-caf2-523b-b6ec-5c7c87996fcb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "52a62f506702ac84b14e44812d83a2062eb9dbde9836a50f296a03ce3680c352", "task_path": "tasks/nmp3_8d703736-caf2-523b-b6ec-5c7c87996fcb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8d703736-caf2-523b-b6ec-5c7c87996fcb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8d8eff04-180d-5e08-938f-bbe72cbbeef7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. Consider all lattice points $(x,y)$ with $x,y\\ge0$ integers and $x+y\\le n$. Each such point is colored either red or blue, subject to the condition: if a point $(x,y)$ is red, then every point $(x',y')$ with $x'\\le x$ and $y'\\le y$ is also red. Let $A$ be the number of ways to choose $n$ blue points whose $x$‑coordinates are all distinct, and let $B$ be the number of ways to choose $n$ blue points whose $y$‑coordinates are all distinct. Prove that $A=B$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The set of lattice points `(x, y)` with `x, y ≥ 0` and `x + y ≤ n`.\nNatural-number coordinates already encode the nonnegativity condition. -/\ndef triangle (n : ℕ) : Finset (ℕ × ℕ) :=\n ((Finset.range (n + 1)).product (Finset.range (n + 1))).filter\n (fun p : ℕ × ℕ => p.1 + p.2 ≤ n)\n\n/-- The admissibility condition on the red set: it is contained in the\ntriangular grid and is downward closed toward the southwest. -/\ndef IsAdmissibleRed (n : ℕ) (red : Finset (ℕ × ℕ)) : Prop :=\n red ⊆ triangle n ∧\n (∀ ⦃p q : ℕ × ℕ⦄,\n p ∈ red → q ∈ triangle n → q.1 ≤ p.1 → q.2 ≤ p.2 → q ∈ red)\n\n/-- A red/blue coloring of the triangular grid. The set `red` determines the\ncoloring because every grid point not in `red` is blue. -/\nstructure Coloring (n : ℕ) where\n red : Finset (ℕ × ℕ)\n isAdmissible : IsAdmissibleRed n red\n\n/-- The blue points of a coloring: precisely the grid points that are not red. -/\ndef blue (n : ℕ) (C : Coloring n) : Finset (ℕ × ℕ) :=\n triangle n \\ C.red\n\n/-- A finite set of lattice points has pairwise distinct first coordinates. -/\ndef HasDistinctFst (S : Finset (ℕ × ℕ)) : Prop :=\n (S.image (fun p : ℕ × ℕ => p.1)).card = S.card\n\n/-- A finite set of lattice points has pairwise distinct second coordinates. -/\ndef HasDistinctSnd (S : Finset (ℕ × ℕ)) : Prop :=\n (S.image (fun p : ℕ × ℕ => p.2)).card = S.card\n\n/-- An `n`-element set of blue points whose `x`-coordinates are pairwise distinct. -/\ndef IsBlueSelectionX (n : ℕ) (C : Coloring n) (S : Finset (ℕ × ℕ)) : Prop :=\n S ⊆ blue n C ∧ S.card = n ∧ HasDistinctFst S\n\n/-- An `n`-element set of blue points whose `y`-coordinates are pairwise distinct. -/\ndef IsBlueSelectionY (n : ℕ) (C : Coloring n) (S : Finset (ℕ × ℕ)) : Prop :=\n S ⊆ blue n C ∧ S.card = n ∧ HasDistinctSnd S\n\ninstance instDecidableHasDistinctFst (S : Finset (ℕ × ℕ)) : Decidable (HasDistinctFst S) := by\n unfold HasDistinctFst\n infer_instance\n\ninstance instDecidableHasDistinctSnd (S : Finset (ℕ × ℕ)) : Decidable (HasDistinctSnd S) := by\n unfold HasDistinctSnd\n infer_instance\n\ninstance instDecidableIsBlueSelectionX (n : ℕ) (C : Coloring n)\n (S : Finset (ℕ × ℕ)) : Decidable (IsBlueSelectionX n C S) := by\n unfold IsBlueSelectionX\n infer_instance\n\ninstance instDecidableIsBlueSelectionY (n : ℕ) (C : Coloring n)\n (S : Finset (ℕ × ℕ)) : Decidable (IsBlueSelectionY n C S) := by\n unfold IsBlueSelectionY\n infer_instance\n\n/-- `A` is the number of `n`-element blue selections with distinct first coordinates. -/\ndef A (n : ℕ) (C : Coloring n) : ℕ :=\n ((blue n C).powerset.filter (fun S : Finset (ℕ × ℕ) => IsBlueSelectionX n C S)).card\n\n/-- `B` is the number of `n`-element blue selections with distinct second coordinates. -/\ndef B (n : ℕ) (C : Coloring n) : ℕ :=\n ((blue n C).powerset.filter (fun S : Finset (ℕ × ℕ) => IsBlueSelectionY n C S)).card\n\n/-- The assertion of the problem: for every positive integer `n` and every\nadmissible red/blue coloring of the triangular grid, `A = B`. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 0 < n → ∀ C : Coloring n, A n C = B n C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8d8eff04-180d-5e08-938f-bbe72cbbeef7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "feb7d6c877092acba5866a764633fe9eaca01d277d929f821d20fa9ee3fb65d7", "task_path": "tasks/nmp3_8d8eff04-180d-5e08-938f-bbe72cbbeef7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8d8eff04-180d-5e08-938f-bbe72cbbeef7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8da4c639-e501-5928-8da8-1ce64b3590d4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\frac{a^{3}+3abc}{\\,b+c\\,}+\\frac{b^{3}+3abc}{\\,a+c\\,}+\\frac{c^{3}+3abc}{\\,a+b\\,}\n-- \\;\\ge\\;\n-- a\\sqrt{a^{2}+3bc}+b\\sqrt{b^{2}+3ca}+c\\sqrt{c^{2}+3ab}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the inequality, for real numbers `a`, `b`, and `c`. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a ^ 3 + 3 * a * b * c) / (b + c) +\n (b ^ 3 + 3 * a * b * c) / (a + c) +\n (c ^ 3 + 3 * a * b * c) / (a + b)\n\n/-- The right-hand side of the inequality, for real numbers `a`, `b`, and `c`. -/\ndef rhs (a b c : ℝ) : ℝ :=\n a * Real.sqrt (a ^ 2 + 3 * b * c) +\n b * Real.sqrt (b ^ 2 + 3 * c * a) +\n c * Real.sqrt (c ^ 2 + 3 * a * b)\n\n/-- For all positive real numbers `a`, `b`, and `c`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8da4c639-e501-5928-8da8-1ce64b3590d4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "009ad185be9d7d7aed844ffa21f7de16ca7868d405ba368e055da1ee7dbfaf37", "task_path": "tasks/nmp3_8da4c639-e501-5928-8da8-1ce64b3590d4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8da4c639-e501-5928-8da8-1ce64b3590d4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8dbef4db-c213-5d91-b341-a730b82380b0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For real numbers $a,b,c>0$, prove that \n-- \\[\n-- \\frac{a}{a+b}+\\frac{b}{b+c}+\\frac{c}{c+a}\\ge \\frac32\\sqrt[6]{\\frac{ab+bc+ca}{a^{2}+b^{2}+c^{2}}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the positive-real three-variable inequality\n\nThe source problem asks to prove that for all positive real numbers `a`, `b`, and `c`,\n\n`a / (a + b) + b / (b + c) + c / (c + a)`\nis at least\n`(3 / 2) * (ab + bc + ca) / (a^2 + b^2 + c^2)` raised to the power `1 / 6`.\n\nThe sixth root is represented by `Real.rpow` with exponent `(1 / 6 : ℝ)`.\nUnder the stated positivity assumptions the radicand is positive, so this is the\nusual nonnegative sixth root.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def leftSide (a b c : ℝ) : ℝ :=\n a / (a + b) + b / (b + c) + c / (c + a)\n\n/-- The radicand under the sixth root on the right-hand side. -/\nnoncomputable def radicand (a b c : ℝ) : ℝ :=\n (a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rightSide (a b c : ℝ) : ℝ :=\n ((3 : ℝ) / 2) * Real.rpow (radicand a b c) ((1 : ℝ) / 6)\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the sum\n`a/(a+b) + b/(b+c) + c/(c+a)` is at least\n`(3/2) * ((ab+bc+ca)/(a^2+b^2+c^2))^(1/6)`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n leftSide a b c ≥ rightSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8dbef4db-c213-5d91-b341-a730b82380b0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bc1a343d2e39bd3e9b77e8fe25045117be599a4f0c230388a3b8c2a6eb61cd4b", "task_path": "tasks/nmp3_8dbef4db-c213-5d91-b341-a730b82380b0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8dbef4db-c213-5d91-b341-a730b82380b0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8dc0f988-8019-5991-82ff-ab084797e8a6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ with $xyz=1$. Prove that \n-- \\[\n-- \\frac{x^3}{x^4+1}+\\frac{y^3}{y^4+1}+\\frac{z^3}{z^4+1}\\le\\frac32\\, .\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement: a positive-real inequality under a unit product constraint\n\nThis file records the statement of the source problem. It intentionally does not\ninclude a proof: `Problem.Target` is a proposition-valued definition.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The summand `x^3 / (x^4 + 1)` appearing in the source inequality. -/\ndef term (x : ℝ) : ℝ :=\n x ^ 3 / (x ^ 4 + 1)\n\n/-- The left-hand side of the source inequality. -/\ndef lhs (x y z : ℝ) : ℝ :=\n term x + term y + term z\n\n/-- The hypotheses on `x`, `y`, and `z`: all are positive and their product is one. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x * y * z = 1\n\n/-- The assertion to be proved: for every positive real triple whose product is one,\nthe sum of `t^3 / (t^4 + 1)` over the three variables is at most `3 / 2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n Admissible x y z →\n lhs x y z ≤ (3 : ℝ) / 2\n\nend\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8dc0f988-8019-5991-82ff-ab084797e8a6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "507e3206a3fc24f5e87df74b146bee87f30797bb1e1018befc49e29990dddcdb", "task_path": "tasks/nmp3_8dc0f988-8019-5991-82ff-ab084797e8a6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8dc0f988-8019-5991-82ff-ab084797e8a6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8e3f4fa1-afca-5e9b-8ebc-682f3d5f4320", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ with $xy+yz+zx=1$. Prove that \n-- \\[\n-- \\frac{z}{x}+\\frac{x}{y}+\\frac{y}{z}\\;\\ge\\;(x+y+z)^2+\\frac{2}{(x+y+z)^2}\\Big((x-y)^2+(y-z)^2+(z-x)^2\\Big)\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality\n\nThe source problem asks one to prove an inequality for positive real numbers\n`x`, `y`, and `z` satisfying `x*y + y*z + z*x = 1`.\n-/\n\nnamespace Problem\n\n/--\nFor all positive real numbers `x`, `y`, and `z` satisfying\n`x*y + y*z + z*x = 1`, the displayed inequality holds.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x * y + y * z + z * x = 1 →\n z / x + x / y + y / z ≥\n (x + y + z) ^ 2 +\n (2 / (x + y + z) ^ 2) *\n ((x - y) ^ 2 + (y - z) ^ 2 + (z - x) ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8e3f4fa1-afca-5e9b-8ebc-682f3d5f4320", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4cd1bf233631a11aae83ff968d01579244e1e0f460d6c79ed3cf893bacbd700e", "task_path": "tasks/nmp3_8e3f4fa1-afca-5e9b-8ebc-682f3d5f4320", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8e3f4fa1-afca-5e9b-8ebc-682f3d5f4320", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8e55d3e4-e2de-541c-bb8c-abc4ee4b693f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle with medians of lengths $m_a$, $m_b$, $m_c$ and inradius $r$. Prove that \n-- \\[\n-- m_a+m_b+m_c\\;\\ge\\;6r\\Bigl(\\frac{m_a}{m_b+m_c}+\\frac{m_b}{m_c+m_a}+\\frac{m_c}{m_a+m_b}\\Bigr).\n-- \\]\nmodule\n\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Geometry.Euclidean.Incenter.Basic\n\n/-!\n# Median-inradius inequality for a triangle\n\nThis file formalizes the statement of the problem. A triangle is represented by\n`Affine.Triangle ℝ Plane`, which bundles three affinely independent points in the\nEuclidean plane. The three medians are the distances from each vertex to the\nmidpoint of the opposite side, and the inradius is Mathlib's inradius of the\ncorresponding Euclidean simplex.\n-/\n\n@[expose] public section\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used for the triangle. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A nondegenerate labelled triangle in the Euclidean plane. -/\nabbrev Triangle : Type := Affine.Triangle ℝ Plane\n\n/-- The length of the median from the vertex labelled `0` (the `A` vertex) to the\nmidpoint of the opposite side joining the vertices labelled `1` and `2`. -/\ndef medianA (t : Triangle) : ℝ :=\n dist (t.points 0) (midpoint ℝ (t.points 1) (t.points 2))\n\n/-- The length of the median from the vertex labelled `1` (the `B` vertex) to the\nmidpoint of the opposite side joining the vertices labelled `0` and `2`. -/\ndef medianB (t : Triangle) : ℝ :=\n dist (t.points 1) (midpoint ℝ (t.points 0) (t.points 2))\n\n/-- The length of the median from the vertex labelled `2` (the `C` vertex) to the\nmidpoint of the opposite side joining the vertices labelled `0` and `1`. -/\ndef medianC (t : Triangle) : ℝ :=\n dist (t.points 2) (midpoint ℝ (t.points 0) (t.points 1))\n\n/-- The inradius of a labelled triangle, as the radius of its insphere. -/\ndef inradius (t : Triangle) : ℝ :=\n t.inradius\n\n/-- The assertion of the median-inradius inequality for one labelled triangle. -/\ndef MedianInequality (t : Triangle) : Prop :=\n medianA t + medianB t + medianC t ≥\n 6 * inradius t *\n (medianA t / (medianB t + medianC t) +\n medianB t / (medianC t + medianA t) +\n medianC t / (medianA t + medianB t))\n\n/-- The universally quantified statement of the problem: every nondegenerate\nlabelled triangle in the Euclidean plane satisfies the median-inradius inequality. -/\ndef Target : Prop :=\n ∀ t : Triangle, MedianInequality t\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8e55d3e4-e2de-541c-bb8c-abc4ee4b693f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "72757720395e4d037a24c272c89aa6a3683b8c2e12db6f8534550d7392babd86", "task_path": "tasks/nmp3_8e55d3e4-e2de-541c-bb8c-abc4ee4b693f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8e55d3e4-e2de-541c-bb8c-abc4ee4b693f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8e751ec7-e4c4-521f-8a94-501c5d8d5621", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that \n-- \\[\n-- \\int_{0}^{\\infty}\\frac{x^{4}+x^{2}+\\frac{1}{12}}{\\bigl(x^{4}+x^{2}+\\frac{3}{4}\\bigr)^{3}}\\,e^{-x^{2}}\\,dx=\\frac{\\sqrt{\\pi}}{9}\\, .\n-- \\]\nimport Mathlib.MeasureTheory.Integral.IntervalIntegral.Basic\nimport Mathlib.Analysis.SpecialFunctions.Exponential\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\nnamespace Problem\n\n/-- The real-valued integrand in the problem. The variable `x` is the bound\nintegration variable; this definition only records the algebraic expression. -/\nnoncomputable def integrand (x : ℝ) : ℝ :=\n ((x ^ 4 + x ^ 2 + (1 / 12 : ℝ)) /\n (x ^ 4 + x ^ 2 + (3 / 4 : ℝ)) ^ 3) *\n Real.exp (-(x ^ 2))\n\n/-- `ImproperIntegralConvergesTo f L` says that the improper integral of `f`\nover `[0, ∞)` converges to `L`, namely that the finite interval integrals\n`∫ x in 0..R, f x` tend to `L` as the real endpoint `R` tends to `+∞`. -/\nnoncomputable def ImproperIntegralConvergesTo (f : ℝ → ℝ) (L : ℝ) : Prop :=\n Filter.Tendsto (fun R : ℝ => ∫ x in (0 : ℝ)..R, f x)\n Filter.atTop (nhds L)\n\n/-- The assertion stated in the problem: the improper integral from `0` to\n`∞` of the displayed integrand equals `sqrt(π) / 9`. -/\nnoncomputable def Target : Prop :=\n ImproperIntegralConvergesTo integrand (Real.sqrt Real.pi / 9)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8e751ec7-e4c4-521f-8a94-501c5d8d5621", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "baba7f3c7782298054fc7f308c4e0734f42112d24d0713a46f1a1d0c275e62dc", "task_path": "tasks/nmp3_8e751ec7-e4c4-521f-8a94-501c5d8d5621", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8e751ec7-e4c4-521f-8a94-501c5d8d5621", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8e7c9b40-717b-5cd1-9181-d599886e03a1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for all positive real numbers \\(a,\\;b,\\;c\\),\n-- \\[\n-- \\frac{(b+c)\\bigl(a^{4}-b^{2}c^{2}\\bigr)}{ab+2bc+ca}\n-- +\\frac{(c+a)\\bigl(b^{4}-c^{2}a^{2}\\bigr)}{bc+2ca+ab}\n-- +\\frac{(a+b)\\bigl(c^{4}-a^{2}b^{2}\\bigr)}{ca+2ab+bc}\\ge 0.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The cyclic sum appearing on the left-hand side of the inequality. -/\nnoncomputable def inequalityLHS (a b c : ℝ) : ℝ :=\n ((b + c) * (a ^ 4 - b ^ 2 * c ^ 2)) / (a * b + 2 * b * c + c * a)\n + ((c + a) * (b ^ 4 - c ^ 2 * a ^ 2)) / (b * c + 2 * c * a + a * b)\n + ((a + b) * (c ^ 4 - a ^ 2 * b ^ 2)) / (c * a + 2 * a * b + b * c)\n\n/--\nFor every positive real triple `(a, b, c)`, the cyclic sum\n`inequalityLHS a b c` is nonnegative.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → inequalityLHS a b c ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8e7c9b40-717b-5cd1-9181-d599886e03a1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cc1dfe5e3fa6141686aa82f1b7588607a9373904d3804a2c2621265f6b9d04d5", "task_path": "tasks/nmp3_8e7c9b40-717b-5cd1-9181-d599886e03a1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8e7c9b40-717b-5cd1-9181-d599886e03a1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8ea7ce1f-3614-5253-8ac3-be86ea6a1a96", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $a,b,c$,\n-- \\[\n-- \\frac{\\sqrt{(2a^{2}+b^{2}+c^{2})(a^{2}+2b^{2}+c^{2})}}{a+b}+\n-- \\frac{\\sqrt{(a^{2}+2b^{2}+c^{2})(a^{2}+b^{2}+2c^{2})}}{b+c}+\n-- \\frac{\\sqrt{(a^{2}+b^{2}+2c^{2})(2a^{2}+b^{2}+c^{2})}}{c+a}\n-- \\;\\ge\\;2\\sqrt{3\\,(a^{2}+b^{2}+c^{2})}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a three-term radical inequality\n\nThis file formalizes the assertion in `problem.md` as a proposition-valued\ndefinition. No proof of the assertion is supplied or required.\n-/\n\nnamespace Problem\n\n/-- The cyclic quadratic expression `2a² + b² + c²`. -/\ndef quadraticOne (a b c : ℝ) : ℝ :=\n 2 * a ^ 2 + b ^ 2 + c ^ 2\n\n/-- The cyclic quadratic expression `a² + 2b² + c²`. -/\ndef quadraticTwo (a b c : ℝ) : ℝ :=\n a ^ 2 + 2 * b ^ 2 + c ^ 2\n\n/-- The cyclic quadratic expression `a² + b² + 2c²`. -/\ndef quadraticThree (a b c : ℝ) : ℝ :=\n a ^ 2 + b ^ 2 + 2 * c ^ 2\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def inequalityLeft (a b c : ℝ) : ℝ :=\n Real.sqrt (quadraticOne a b c * quadraticTwo a b c) / (a + b) +\n Real.sqrt (quadraticTwo a b c * quadraticThree a b c) / (b + c) +\n Real.sqrt (quadraticThree a b c * quadraticOne a b c) / (c + a)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def inequalityRight (a b c : ℝ) : ℝ :=\n 2 * Real.sqrt (3 * (a ^ 2 + b ^ 2 + c ^ 2))\n\n/-- The full assertion: for every positive real triple `(a,b,c)`, the stated\nsum of three radicals is at least the stated right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n inequalityLeft a b c ≥ inequalityRight a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8ea7ce1f-3614-5253-8ac3-be86ea6a1a96", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8bcf9568973d40f451cff6f5b59e314d8abf3918856a29ec493e41ee609f16e4", "task_path": "tasks/nmp3_8ea7ce1f-3614-5253-8ac3-be86ea6a1a96", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8ea7ce1f-3614-5253-8ac3-be86ea6a1a96", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8ed16c30-2a3d-5c55-8f23-f6fe040c9600", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Denote by $\\mathbb{N}$ the positive integers. Let $f:\\mathbb{N}\\to\\mathbb{N}$ satisfy, for all $w,x,y,z\\in\\mathbb{N}$,\n-- \\[\n-- f(f(f(z)))\\,f\\bigl(w\\,x\\,f(y\\,f(z))\\bigr)=z^{2}\\,f\\bigl(x\\,f(y)\\bigr)\\,f(w).\n-- \\]\n-- Prove that $f(n!)\\ge n!$ for every positive integer $n$.\n/-\nFormal statement for the problem in `problem.md`.\n\nThe source uses `ℕ` for the positive integers. In Lean this is represented by\n`ℕ+` (`PNat`), the subtype of positive natural numbers. The target is stated\nas a proposition and is intentionally not proved here.\n-/\n\nimport Mathlib.Data.PNat.Basic\nimport Mathlib.Data.Nat.Factorial.Basic\n\nnamespace Problem\n\n/-- The positive integers, represented by Lean's positive natural numbers. -/\nabbrev PositiveInteger : Type := ℕ+\n\n/-- The factorial of a positive integer, with positivity witnessed explicitly. -/\ndef pnatFactorial (n : PositiveInteger) : PositiveInteger :=\n ⟨Nat.factorial (n : ℕ), Nat.factorial_pos (n : ℕ)⟩\n\n/-- The functional equation assumed in the problem, for a function on positive integers. -/\ndef FunctionalEquation (f : PositiveInteger → PositiveInteger) : Prop :=\n ∀ w x y z : PositiveInteger,\n f (f (f z)) * f (w * x * f (y * f z)) =\n z ^ 2 * f (x * f y) * f w\n\n/--\nThe assertion to be proved: every function `f` on the positive integers satisfying\nthe given functional equation satisfies `f (n!) ≥ n!` for every positive integer\n`n`.\n-/\ndef Target : Prop :=\n ∀ f : PositiveInteger → PositiveInteger,\n FunctionalEquation f →\n ∀ n : PositiveInteger, pnatFactorial n ≤ f (pnatFactorial n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8ed16c30-2a3d-5c55-8f23-f6fe040c9600", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fa0ff42e54736a9672a521387df4926516f3e1963cb05a5afbd2cd6b40a42a93", "task_path": "tasks/nmp3_8ed16c30-2a3d-5c55-8f23-f6fe040c9600", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8ed16c30-2a3d-5c55-8f23-f6fe040c9600", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8ed6cc89-03b5-509d-bd48-288af127ab80", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The sequence $c_{0},c_{1},c_{2},\\dots$ is defined by $c_{0}=1$, $c_{1}=0$, and $c_{n+2}=c_{n+1}+c_{n}$ for $n\\ge 0$. \n-- Let $S$ be the set of ordered pairs $(x,y)$ of non‑negative integers for which there exists a finite set $J$ of positive integers such that \n-- \n-- \\[\n-- x=\\sum_{j\\in J}c_{j},\\qquad y=\\sum_{j\\in J}c_{j-1},\n-- \\]\n-- \n-- (with the convention that a sum over the empty set equals $0$). \n-- Prove that there exist real numbers $\\alpha,\\beta,m,M$ such that for any non‑negative integers $(x,y)$ \n-- \n-- \\[\n-- m<\\alpha x+\\beta y 1\n | 1 => 0\n | n + 2 => c (n + 1) + c n\n\n/-- A finite set of positive integer indices, represented as a `Finset ℕ`. -/\ndef PositiveIndexSet (J : Finset ℕ) : Prop :=\n ∀ j : ℕ, j ∈ J → 0 < j\n\n/-- The real-valued linear expression `α x + β y`, where `x` and `y` are\nnon-negative integers coerced to real numbers. -/\ndef LinearForm (α β : ℝ) (x y : ℕ) : ℝ :=\n α * (x : ℝ) + β * (y : ℝ)\n\n/-- Membership in the set `S` from the problem: `(x,y)` is admissible exactly\nwhen there is a finite set of positive integer indices `J` for which the two\ngiven sums are `x` and `y`. Empty sums are handled by `Finset.sum`. -/\ndef InS (x y : ℕ) : Prop :=\n ∃ J : Finset ℕ,\n PositiveIndexSet J ∧\n x = ∑ j ∈ J, c j ∧\n y = ∑ j ∈ J, c (j - 1)\n\n/-- The set `S` of ordered pairs of non-negative integers in the problem. -/\ndef S : Set (ℕ × ℕ) :=\n {p : ℕ × ℕ | InS p.1 p.2}\n\n/-- The assertion to be proved: there exist real numbers `α`, `β`, `m`, `M`\nsuch that an ordered pair `(x,y)` of non-negative integers lies strictly between\nthe two parallel lines `α x + β y = m` and `α x + β y = M` if and only if it\nbelongs to `S`. -/\ndef Target : Prop :=\n ∃ α β m M : ℝ,\n ∀ x y : ℕ,\n (m < LinearForm α β x y ∧ LinearForm α β x y < M) ↔ (x, y) ∈ S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8ed6cc89-03b5-509d-bd48-288af127ab80", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9003fe39b23385f1790fe512407e145f72fa5542a3e23495054780c2962e5bb0", "task_path": "tasks/nmp3_8ed6cc89-03b5-509d-bd48-288af127ab80", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8ed6cc89-03b5-509d-bd48-288af127ab80", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8f0a7c62-851b-5da6-bdf0-c7c951e71955", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, $c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a^{2}}{a^{2}+b^{2}}+\\frac{b^{2}}{b^{2}+c^{2}}+\\frac{c^{2}}{c^{2}+a^{2}}\n-- \\;\\ge\\;\\frac{9}{2}\\cdot\\frac{ab+bc+ca}{(a+b+c)^{2}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the positive-real inequality\n\nThe problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe stated lower bound for the cyclic sum of three squares-over-squares terms.\n\nThis file records the mathematical assertion as a proposition-valued definition.\nNo proof of the assertion is included.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum appearing on the left-hand side. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 2 / (a ^ 2 + b ^ 2) +\n b ^ 2 / (b ^ 2 + c ^ 2) +\n c ^ 2 / (c ^ 2 + a ^ 2)\n\n/-- The right-hand side of the claimed inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (9 / 2 : ℝ) * ((a * b + b * c + c * a) / (a + b + c) ^ 2)\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the cyclic sum is at least\n`(9 / 2) * (ab + bc + ca) / (a + b + c)^2`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → rhs a b c ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f0a7c62-851b-5da6-bdf0-c7c951e71955", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d92954c897d58f421474a2ec82e795f8e6be9562ee4b73fbfd1753c72bcdf2d9", "task_path": "tasks/nmp3_8f0a7c62-851b-5da6-bdf0-c7c951e71955", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f0a7c62-851b-5da6-bdf0-c7c951e71955", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8f2445b9-4ac2-5f40-8321-b96ce9652dc4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that \\(\\displaystyle\\int_{\\,1-t}^{\\,1+t} x^{\\frac{3}{x}}\\,dx \\ge 2t\\) for all \\(0\\le t<1\\).\nmodule\npublic import Mathlib.MeasureTheory.Integral.IntervalIntegral.Basic\npublic import Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n@[expose] public section\n\nnoncomputable section\n\nopen MeasureTheory\n\nnamespace Problem\n\n/-- The integrand `x ^ (3 / x)` appearing in the problem. -/\ndef integrand (x : ℝ) : ℝ :=\n Real.rpow x ((3 : ℝ) / x)\n\n/--\nThe assertion to be proved: for every real `t` satisfying `0 ≤ t < 1`,\nthe integral of `x ^ (3 / x)` from `1 - t` to `1 + t` is at least `2 * t`.\n-/\ndef Target : Prop :=\n ∀ t : ℝ, 0 ≤ t → t < 1 →\n (∫ (x : ℝ) in (1 - t)..(1 + t), Problem.integrand x ∂volume) ≥ 2 * t\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f2445b9-4ac2-5f40-8321-b96ce9652dc4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4333eb59f2e945e98f9b49bcb0df61c491b5a51b49baf180dd11e2c5fe3536fd", "task_path": "tasks/nmp3_8f2445b9-4ac2-5f40-8321-b96ce9652dc4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f2445b9-4ac2-5f40-8321-b96ce9652dc4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8f2986e7-5553-5c78-83a2-b4aab9178a44", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{a^{2}+b}{a^{2}+1}+\\frac{b^{2}+c}{b^{2}+1}+\\frac{c^{2}+a}{c^{2}+1}\\ge 3\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of a three-variable real inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`\nsatisfying `a + b + c = 3`, that\n`(a^2 + b)/(a^2 + 1) + (b^2 + c)/(b^2 + 1) + (c^2 + a)/(c^2 + 1) ≥ 3`.\n-/\n\nnamespace Problem\n\n/-- The three variables are strictly positive real numbers. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The three variables have sum exactly `3`. -/\ndef SumEqThree (a b c : ℝ) : Prop :=\n a + b + c = 3\n\n/-- The admissibility assumptions on the three real variables: all are positive\nand their sum is exactly `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Positive a b c ∧ SumEqThree a b c\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def inequalityExpression (a b c : ℝ) : ℝ :=\n (a ^ 2 + b) / (a ^ 2 + 1)\n + (b ^ 2 + c) / (b ^ 2 + 1)\n + (c ^ 2 + a) / (c ^ 2 + 1)\n\n/-- The proposition asserted by the source problem: for every triple of positive\nreal numbers whose sum is `3`, the displayed expression is at least `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → inequalityExpression a b c ≥ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f2986e7-5553-5c78-83a2-b4aab9178a44", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ce19a79d8537df346ec5eaba3b6d430169298893485ba733c991372dff70b6db", "task_path": "tasks/nmp3_8f2986e7-5553-5c78-83a2-b4aab9178a44", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f2986e7-5553-5c78-83a2-b4aab9178a44", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8f38b8b6-4fae-5547-b562-b49ac160643c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a+b+c+d=4$ and $a,b,c,d>0$, prove that \n-- \\[\n-- \\frac{4}{abcd}\\;\\ge\\;\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{d}+\\frac{d}{a}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the proposed inequality\n\nThis file contains the formal target of the problem only. It does not contain\na proof of the inequality.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, `c`, and `d` whose sum is `4`,\nthe inequality `4 / (a * b * c * d) ≥ a / b + b / c + c / d + d / a` holds. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n a + b + c + d = (4 : ℝ) →\n 0 < a →\n 0 < b →\n 0 < c →\n 0 < d →\n (4 : ℝ) / (a * b * c * d) ≥ a / b + b / c + c / d + d / a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f38b8b6-4fae-5547-b562-b49ac160643c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0f5cb7e3cb0378e9e638f643580b041193115050182946ca41112dd477f820d5", "task_path": "tasks/nmp3_8f38b8b6-4fae-5547-b562-b49ac160643c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f38b8b6-4fae-5547-b562-b49ac160643c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8f3e4bd0-fce2-5bcd-b7e3-fa946c32f0a4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given positive real numbers $a,b,c$ such that $abc=1$, prove that \n-- \\[\n-- \\frac{1}{a^{5}+b^{5}+c^{2}}+\\frac{1}{b^{5}+c^{5}+a^{2}}+\\frac{1}{c^{5}+a^{5}+b^{2}}\\le 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three variables range over the positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The normalization condition appearing in the problem. -/\ndef NormalizedTriple (a b c : ℝ) : Prop :=\n a * b * c = 1\n\n/-- The left-hand side of the cyclic inequality in the problem. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n (1 : ℝ) / (a ^ 5 + b ^ 5 + c ^ 2) +\n (1 : ℝ) / (b ^ 5 + c ^ 5 + a ^ 2) +\n (1 : ℝ) / (c ^ 5 + a ^ 5 + b ^ 2)\n\n/-- The assertion to be proved: for all positive real `a`, `b`, and `c`\nwith `a * b * c = 1`, the stated cyclic sum is at most one. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n PositiveTriple a b c →\n NormalizedTriple a b c →\n CyclicSum a b c ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f3e4bd0-fce2-5bcd-b7e3-fa946c32f0a4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "034a7de8f4c436d667882e7cabfe8980548b83e4638924bd53cff24db4080c61", "task_path": "tasks/nmp3_8f3e4bd0-fce2-5bcd-b7e3-fa946c32f0a4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f3e4bd0-fce2-5bcd-b7e3-fa946c32f0a4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8f428418-af41-5547-8a6c-9b3ba9c383d3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $O$ be the circumcenter of $\\triangle ABC$, where $\\angle ABC>90^\\circ$, and let $M$ be the midpoint of $BC$. \n-- Point $P$ lies inside $\\triangle ABC$ such that $PB\\perp PC$. \n-- Points $D$ and $E$, distinct from $P$, lie on the line through $P$ perpendicular to $AP$ and satisfy $BD=BP$ and $CE=CP$. \n-- If quadrilateral $ADOE$ is a parallelogram, prove that \n-- \\[\n-- \\angle OPE=\\angle AMB.\n-- \\]\nmodule\n\npublic import Mathlib.Geometry.Euclidean.Triangle\npublic import Mathlib.Analysis.Convex.Hull\n\n/-!\n# Formal statement for an obtuse-triangle geometry problem\n\nThis file records the statement of the problem, not a proof. Points are\nrepresented in a fixed two-dimensional Euclidean affine space, namely\n`EuclideanSpace ℝ (Fin 2)` viewed as an affine space over itself.\n-/\n\n@[expose] public section\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `O` is equidistant from `A`, `B`, and `C`; in a nondegenerate triangle this\nis exactly the circumcenter condition. -/\ndef IsCircumcenter (A B C O : Plane) : Prop :=\n dist O A = dist O B ∧ dist O B = dist O C\n\n/-- `P` lies in the strict interior of the convex hull of the three vertices,\ni.e. inside (not on the boundary of) triangle `ABC`. -/\ndef InsideTriangle (A B C P : Plane) : Prop :=\n P ∈ interior (convexHull ℝ ({A, B, C} : Set Plane))\n\n/-- `X` lies on the line through `P` perpendicular to `AP`; combined with\n`X ≠ P`, this says that `PX` is the line through `P` perpendicular to `AP`. -/\ndef OnPerpLineThrough (P A X : Plane) : Prop :=\n inner ℝ (X - P) (A - P) = 0\n\n/-- The quadrilateral with vertices `A`, `D`, `O`, `E`, in that order, is a\nparallelogram. This is expressed by equality of the midpoints of its diagonals\n`AO` and `DE`. -/\ndef IsParallelogram (A D O E : Plane) : Prop :=\n midpoint ℝ A O = midpoint ℝ D E\n\n/-- All hypotheses of the problem, with the points supplied as variables rather\nthan asserted to be constructed. -/\ndef Hypotheses (A B C O M P D E : Plane) : Prop :=\n IsCircumcenter A B C O ∧\n EuclideanGeometry.angle A B C > Real.pi / 2 ∧\n M = midpoint ℝ B C ∧\n InsideTriangle A B C P ∧\n inner ℝ (B - P) (C - P) = 0 ∧\n D ≠ P ∧\n E ≠ P ∧\n OnPerpLineThrough P A D ∧\n OnPerpLineThrough P A E ∧\n dist B D = dist B P ∧\n dist C E = dist C P ∧\n IsParallelogram A D O E\n\n/-- The desired equality of (unoriented) angles. -/\ndef Conclusion (A B O M P E : Plane) : Prop :=\n EuclideanGeometry.angle O P E = EuclideanGeometry.angle A M B\n\n/-- The full universal implication asserted by the problem. -/\ndef Target : Prop :=\n ∀ A B C O M P D E : Plane,\n Hypotheses A B C O M P D E → Conclusion A B O M P E\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f428418-af41-5547-8a6c-9b3ba9c383d3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2bb2f77cca4f1c61004d9210f994601d06a2bea2a73e11fff2de2f9539d90b61", "task_path": "tasks/nmp3_8f428418-af41-5547-8a6c-9b3ba9c383d3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f428418-af41-5547-8a6c-9b3ba9c383d3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8f51ff92-5c7f-5023-8d18-dda44f691f5c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=1$. Prove that \n-- \\[\n-- \\frac{a^{3}+b}{b+c}+\\frac{b^{3}+c}{c+a}+\\frac{c^{3}+a}{a+b}\\ge\\frac{5}{3}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe source problem asks one to prove, for positive real numbers `a`, `b`, and\n`c` whose sum is `1`, the inequality\n\n`(a^3 + b) / (b + c) + (b^3 + c) / (c + a) + (c^3 + a) / (a + b) ≥ 5 / 3`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 3 + b) / (b + c) + (b ^ 3 + c) / (c + a) + (c ^ 3 + a) / (a + b)\n\n/-- The assertion to be proved: for every positive real triple summing to one,\nthe stated cyclic sum is at least `5 / 3`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a + b + c = 1 →\n lhs a b c ≥ (5 : ℝ) / 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f51ff92-5c7f-5023-8d18-dda44f691f5c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6e28e99471c36550cd243cc93da69f65c788774749d0ea944192042075b5a0cb", "task_path": "tasks/nmp3_8f51ff92-5c7f-5023-8d18-dda44f691f5c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f51ff92-5c7f-5023-8d18-dda44f691f5c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8f7115ab-3ba7-5ed2-8058-7ae4c155a476", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\sqrt[3]{a^{2}+b^{2}}+\\sqrt[3]{b^{2}+c^{2}}+\\sqrt[3]{c^{2}+a^{2}}\\ge 3\\sqrt[3]{2}\\, .\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The real cube root of `x`, encoded as the real power `x ^ (1 / 3)`.\nFor nonnegative `x` this is the usual nonnegative real cube root. -/\ndef cubeRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 3 : ℝ)\n\n/-- The complete quantified inequality stated in the problem.\n\nThe variables `a`, `b`, and `c` range over real numbers, are each assumed\nnonnegative, and satisfy `a + b + c = 3`. The conclusion is the stated\nnon-strict lower bound for the sum of the three real cube roots. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n a + b + c = 3 →\n cubeRoot (a ^ 2 + b ^ 2) +\n cubeRoot (b ^ 2 + c ^ 2) +\n cubeRoot (c ^ 2 + a ^ 2) ≥\n 3 * cubeRoot 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f7115ab-3ba7-5ed2-8058-7ae4c155a476", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5690af33ff1110f6ba8ebce3aa4c20f3edc341bfc8973def43a5b4410327b2c2", "task_path": "tasks/nmp3_8f7115ab-3ba7-5ed2-8058-7ae4c155a476", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f7115ab-3ba7-5ed2-8058-7ae4c155a476", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8f8d371e-30bf-5918-a828-ffe0694eadbb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle with side lengths $BC=a$, $CA=b$, and $AB=c$. For any point $P$ in space, prove that \n-- \\[\n-- \\frac{PA\\cdot PB}{ab}+\\frac{PB\\cdot PC}{bc}+\\frac{PC\\cdot PA}{ca}\\ge 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the triangle inequality for a point in space\n\nThe source problem concerns a nondegenerate triangle `ABC` in three-dimensional\nEuclidean space, with side lengths `a = BC`, `b = CA`, `c = AB`, and an arbitrary\npoint `P`. The target proposition states the claimed lower bound for the sum of\nthree products of distances divided by pairwise products of side lengths.\n-/\n\nnamespace Problem\n\n/-- The ambient space in the problem: three-dimensional Euclidean space over `ℝ`. -/\nabbrev Space : Type := EuclideanSpace ℝ (Fin 3)\n\n/-- The side length `BC` of a triangle with vertices `A`, `B`, and `C`. -/\nnoncomputable def sideBC (_A B C : Space) : ℝ := dist B C\n\n/-- The side length `CA` of a triangle with vertices `A`, `B`, and `C`. -/\nnoncomputable def sideCA (A _B C : Space) : ℝ := dist C A\n\n/-- The side length `AB` of a triangle with vertices `A`, `B`, and `C`. -/\nnoncomputable def sideAB (A B _C : Space) : ℝ := dist A B\n\n/-- The three vertices form a nondegenerate triangle, i.e. they are not collinear. -/\ndef IsNondegenerateTriangle (A B C : Space) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Space)\n\n/-- The inequality asserted for fixed vertices and fixed side lengths, uniformly in\nthe point `P`. The side-length hypotheses `a = BC`, `b = CA`, and `c = AB` are\nplaced before the universal quantifier over `P`, matching the order in the source. -/\ndef Claim (A B C : Space) (a b c : ℝ) : Prop :=\n IsNondegenerateTriangle A B C →\n a = sideBC A B C →\n b = sideCA A B C →\n c = sideAB A B C →\n ∀ P : Space,\n (dist P A * dist P B) / (a * b) +\n (dist P B * dist P C) / (b * c) +\n (dist P C * dist P A) / (c * a) ≥ (1 : ℝ)\n\n/-- The full formal statement: for every nondegenerate triangle `ABC` in\nthree-dimensional Euclidean space, for every choice of its side lengths\n`a = BC`, `b = CA`, `c = AB`, and for every point `P` in that space, the stated\ninequality holds. -/\ndef Target : Prop :=\n ∀ (A B C : Space) (a b c : ℝ), Claim A B C a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f8d371e-30bf-5918-a828-ffe0694eadbb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "154e1e1d8f56684d1f65366e0e943a633b13d5ec21dbca48c5ce672683dcadb8", "task_path": "tasks/nmp3_8f8d371e-30bf-5918-a828-ffe0694eadbb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8f8d371e-30bf-5918-a828-ffe0694eadbb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8fa3a05c-9978-5804-b54f-ebc74a679679", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\lambda\\in(0,1)$ be a real number and let $n\\ge1$ be an integer. Prove that every zero $z\\in\\mathbb C$ of the polynomial \n-- \\[\n-- f(x)=\\sum_{k=0}^{n}\\binom{n}{k}\\lambda^{\\,k\\,(n-k)}x^{k}\n-- \\]\n-- satisfies $|z|=1\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the polynomial root-modulus problem\n\nThe source problem asks us to prove that, for every real number `λ ∈ (0, 1)` and\nevery integer `n ≥ 1`, all complex roots of\n\n`f(x) = ∑_{k=0}^n choose(n,k) λ^(k(n-k)) x^k`\n\nhave complex absolute value one.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\nopen Polynomial\nopen scoped BigOperators\n\n/-- The polynomial with complex coefficients associated to `n : ℕ` and `λ : ℝ`:\n`∑_{k=0}^n (n choose k) λ^(k(n-k)) x^k`. -/\ndef poly (n : ℕ) (lambda : ℝ) : Polynomial ℂ :=\n ∑ k ∈ Finset.range (n + 1),\n Polynomial.C ((Nat.choose n k : ℂ) * (lambda : ℂ) ^ (k * (n - k))) *\n Polynomial.X ^ k\n\n/-- The exact assertion of the source problem: for every real `λ` with\n`0 < λ < 1` and every natural number `n ≥ 1`, every complex root `z` of the\npolynomial `poly n λ` satisfies `|z| = 1`. -/\ndef Target : Prop :=\n ∀ (lambda : ℝ) (n : ℕ),\n 0 < lambda →\n lambda < 1 →\n 1 ≤ n →\n ∀ z : ℂ,\n Polynomial.IsRoot (poly n lambda) z →\n ‖z‖ = 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8fa3a05c-9978-5804-b54f-ebc74a679679", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c930b210eae186c6e94a98579f5790b92118e38816494e8e9fc4826c3271cea5", "task_path": "tasks/nmp3_8fa3a05c-9978-5804-b54f-ebc74a679679", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8fa3a05c-9978-5804-b54f-ebc74a679679", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8fc9f3e8-a27a-5038-8ea8-2be1f6c01a20", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that the sequence $a_n = 3^n - 2^n$, defined for positive integers $n$, contains no three distinct terms that form a geometric progression.\nimport Mathlib\n\nnamespace Problem\n\n/-- The term `a_n = 3^n - 2^n`, regarded as an integer-valued sequence.\nThe source only uses the values at positive integer indices. -/\ndef a (n : ℕ) : ℤ := (3 : ℤ) ^ n - (2 : ℤ) ^ n\n\n/-- Three integer terms `x`, `y`, `z`, in the displayed order, are a\nnonconstant three-term geometric progression. There is a rational common\nratio taking each term to the next, and the three terms are pairwise distinct. -/\ndef IsDistinctThreeTermGeometricProgression (x y z : ℤ) : Prop :=\n x ≠ y ∧ x ≠ z ∧ y ≠ z ∧\n ∃ q : ℚ, (y : ℚ) = (x : ℚ) * q ∧ (z : ℚ) = (y : ℚ) * q\n\n/-- There are three distinct terms of the sequence, at positive indices in\nincreasing order, which form a geometric progression. -/\ndef HasThreeTermGeometricProgression : Prop :=\n ∃ i j k : ℕ,\n 0 < i ∧ 0 < j ∧ 0 < k ∧\n i < j ∧ j < k ∧\n IsDistinctThreeTermGeometricProgression (a i) (a j) (a k)\n\n/-- The sequence `a_n = 3^n - 2^n` contains no three distinct terms that\nform a geometric progression. -/\ndef Target : Prop := ¬ HasThreeTermGeometricProgression\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8fc9f3e8-a27a-5038-8ea8-2be1f6c01a20", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3422c9224f0f46d3d7c0a0e53d6248f4efb15de00d117c9c51dd552f9c54a319", "task_path": "tasks/nmp3_8fc9f3e8-a27a-5038-8ea8-2be1f6c01a20", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8fc9f3e8-a27a-5038-8ea8-2be1f6c01a20", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_8fd3909c-8112-525e-9e26-f63f93fb88ad", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any given positive integers $m$ and $n$, there exists a positive integer $k$ such that $2^{k}-m$ has at least $n$ distinct prime divisors.\nimport Mathlib\n\n/-!\n# Formalization of the target number-theoretic statement\n\nThe statement asserts that for every pair of positive integers `m` and `n`, there\nis a positive integer `k` for which the integer `2 ^ k - m` has at least `n`\ndistinct prime divisors.\n-/\n\nnamespace Problem\n\n/--\n`HasAtLeastNDistinctPrimeDivisors z n` means that the integer `z` has at least\n`n` distinct prime divisors.\n\nThe formulation uses a finite set of at least `n` natural-number primes, each\nof which divides the integer `z`. This expresses \"at least `n`\" directly and\ndoes not require a factorization convention for the integer zero. Divisibility\nis the usual divisibility relation in `ℤ`, so it also applies to negative\nvalues of `z`.\n-/\ndef HasAtLeastNDistinctPrimeDivisors (z : ℤ) (n : ℕ) : Prop :=\n ∃ primes : Finset ℕ,\n n ≤ primes.card ∧\n ∀ p : ℕ, p ∈ primes → Nat.Prime p ∧ (p : ℤ) ∣ z\n\n/--\n`Admissible m n k` records that `k` is a positive integer satisfying the\nrequired prime-divisor condition for the integer `2 ^ k - m`.\n-/\ndef Admissible (m n k : ℕ) : Prop :=\n 0 < k ∧ HasAtLeastNDistinctPrimeDivisors ((2 : ℤ) ^ k - (m : ℤ)) n\n\n/--\nFor every pair of positive integers `m` and `n`, there exists a positive\ninteger `k` such that `2 ^ k - m` has at least `n` distinct prime divisors.\n-/\ndef Target : Prop :=\n ∀ m n : ℕ, 0 < m → 0 < n → ∃ k : ℕ, Admissible m n k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8fd3909c-8112-525e-9e26-f63f93fb88ad", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5397a98f8bc18220be200b9ca0c9c7b06b1dc671c3188bf0624a5bb886a70720", "task_path": "tasks/nmp3_8fd3909c-8112-525e-9e26-f63f93fb88ad", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "8fd3909c-8112-525e-9e26-f63f93fb88ad", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_900c2984-c287-52c6-957f-bc2a62477c9d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- 3\\;\\le\\;\\sum_{cyc}\\frac{a(3a+1)}{(a+1)^2}\\;\\le\\;a+b+c,\n-- \\] \n-- where the sum is taken over $a,b,c$ cyclically.\nimport Mathlib\n\nnamespace Problem\n\n/-- The summand occurring in the cyclic sum. -/\nnoncomputable def summand (x : ℝ) : ℝ :=\n x * (3 * x + 1) / (x + 1) ^ 2\n\n/-- A cyclic sum over three real variables. For a summand depending only on\nthe displayed variable, this is `f a + f b + f c`. -/\ndef cyclicSum (f : ℝ → ℝ) (a b c : ℝ) : ℝ :=\n f a + f b + f c\n\n/-- The complete assertion, including the positivity and product assumptions.\nThe cyclic sum is expanded explicitly as the three corresponding summands. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n 3 ≤ cyclicSum summand a b c ∧\n cyclicSum summand a b c ≤ a + b + c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "900c2984-c287-52c6-957f-bc2a62477c9d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "64fbde3ae1752053da94dae7e2f20666f75fd60614505fca32033720282eb23e", "task_path": "tasks/nmp3_900c2984-c287-52c6-957f-bc2a62477c9d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "900c2984-c287-52c6-957f-bc2a62477c9d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_902cf6dc-667d-5a52-a8a6-391ef6fed102", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $a,b,c$,\n-- \\[\n-- \\frac{1}{a+b}+\\frac{1}{b+c}+\\frac{1}{c+a}\\;\\ge\\;\\frac{a}{a^{2}+bc}+\\frac{b}{b^{2}+ca}+\\frac{c}{c^{2}+ab}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks to prove an inequality for all positive real numbers\n`a`, `b`, and `c`. The proposition is packaged as a definition, so the\nformalization records the target statement without supplying a proof.\n-/\n\nnamespace Problem\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the sum of the reciprocals\nof the pairwise sums is at least the stated sum of rational expressions.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (1 : ℝ) / (a + b) + (1 : ℝ) / (b + c) + (1 : ℝ) / (c + a) ≥\n a / (a ^ 2 + b * c) + b / (b ^ 2 + c * a) + c / (c ^ 2 + a * b)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "902cf6dc-667d-5a52-a8a6-391ef6fed102", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fb01a9225774d1151889f0469936574bf6d3bedd86838152fb5a5fb096be8c31", "task_path": "tasks/nmp3_902cf6dc-667d-5a52-a8a6-391ef6fed102", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "902cf6dc-667d-5a52-a8a6-391ef6fed102", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_902e7d06-cc1c-5199-b282-d5b3c4a50ecf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c>0$ with $abc=1$, prove that \n-- \\[\n-- \\frac{a^3c}{a^3+bc+ca}+\\frac{b^3a}{b^3+ca+ab}+\\frac{c^3b}{c^3+ab+bc}\\le\\frac{(a^2+b^2+c^2)^3}{3(a+b+c)^2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic rational inequality\n\nThe source problem asks to prove an inequality for positive real numbers\n`a`, `b`, and `c` satisfying `a * b * c = 1`. We use `ℝ` for the\npositive quantities and Lean's real division and order operations.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the stated inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (((a ^ 3) * c) / ((a ^ 3) + (b * c) + (c * a))) +\n (((b ^ 3) * a) / ((b ^ 3) + (c * a) + (a * b))) +\n (((c ^ 3) * b) / ((c ^ 3) + (a * b) + (b * c)))\n\n/-- The right-hand side of the stated inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (((a ^ 2) + (b ^ 2) + (c ^ 2)) ^ 3) /\n (3 * ((a + b + c) ^ 2))\n\n/-- The positivity and product hypotheses imposed on the three variables. -/\ndef admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The complete proposition asserted by the source problem. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, admissible a b c → lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "902e7d06-cc1c-5199-b282-d5b3c4a50ecf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5b5bbda0f474a378f362360d1c5c558381778115b8862c4371f55e221f83eaa7", "task_path": "tasks/nmp3_902e7d06-cc1c-5199-b282-d5b3c4a50ecf", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "902e7d06-cc1c-5199-b282-d5b3c4a50ecf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9058b2aa-082e-5a5b-88ae-098f9a7bdbdb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>1$ be an integer, and let $k$ be the number of distinct prime divisors of $n$. Prove that there exists an integer $a$ satisfying \n-- $$1 1` is an integer and `k` is its number of distinct\nprime divisors, then there is an integer `a` with\n\n`1 < a < n / k + 1` and `n ∣ a ^ 2 - a`.\n\nThe quotient `n / k` is interpreted as exact rational division. The integer\n`n` is represented by `ℤ`; its distinct prime divisor count is taken via\n`Int.natAbs`, which agrees with the usual count because the hypothesis `1 < n`\nmakes `n` positive.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The number of distinct (positive) prime divisors of an integer `n`. -/\ndef distinctPrimeFactorCount (n : ℤ) : ℕ :=\n n.natAbs.primeFactors.card\n\n/-- The witness conditions for a fixed integer `n` and prime-divisor count `k`.\n\nThe inequalities are interpreted in `ℚ`, so that `n / k` is exact division.\nThe last condition is divisibility in `ℤ`.\n-/\ndef Admissible (n : ℤ) (k : ℕ) (a : ℤ) : Prop :=\n 1 < a ∧\n (a : ℚ) < (n : ℚ) / (k : ℚ) + 1 ∧\n n ∣ a ^ 2 - a\n\n/-- The complete target assertion: for every integer `n > 1`, if `k` is the\nnumber of distinct prime divisors of `n`, then some integer `a` is admissible\nfor this `n` and this `k`. -/\ndef Target : Prop :=\n ∀ n : ℤ, 1 < n →\n ∃ a : ℤ, Admissible n (distinctPrimeFactorCount n) a\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9058b2aa-082e-5a5b-88ae-098f9a7bdbdb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cca6369ae79ecb8e73695904e88d01f64a9afcfa0eb5c1f861c564b620f774b4", "task_path": "tasks/nmp3_9058b2aa-082e-5a5b-88ae-098f9a7bdbdb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9058b2aa-082e-5a5b-88ae-098f9a7bdbdb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_90838857-387c-53a7-979c-ea3abefeaa23", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $c\\ge 1$ be an integer. Define a sequence of positive integers $(a_n)$ by $a_1=c$ and \n-- \\[\n-- a_{n+1}=a_n^{3}-4c\\,a_n^{2}+5c^{2}\\,a_n+c\\qquad(n\\ge1).\n-- \\] \n-- Prove that for every integer $n\\ge2$ there exists a prime number $p$ such that $p\\mid a_n$ but $p\\nmid a_1,a_2,\\dots,a_{n-1}\\,. $\nimport Mathlib\n\n/-!\n# Formal statement of the prime-divisibility problem\n\nThe original sequence is indexed by the positive integers. We represent it as\na function `a : ℕ → ℕ`; the value `a 0` is irrelevant, while the conditions in\n`Problem.IsPositiveIntegerSequence` constrain exactly the values `a n` for\n`n ≥ 1`. The recurrence is written as an equality in `ℤ`, so that the\nsubtraction in the polynomial has its ordinary integer meaning rather than\nLean's truncated natural-number subtraction.\n-/\n\nnamespace Problem\n\n/-- The data and equations defining the sequence from the problem.\n\nThe sequence is indexed starting at `1`, hence the recurrence is imposed for\nall natural numbers `n ≥ 1`. Its values are required to be positive natural\nnumbers, and the initial value is `a₁ = c`. The recurrence is interpreted in\nthe integers. -/\ndef IsPositiveIntegerSequence (c : ℕ) (a : ℕ → ℕ) : Prop :=\n a 1 = c ∧\n (∀ n : ℕ, 1 ≤ n →\n (a (n + 1) : ℤ) =\n (a n : ℤ) ^ 3 - 4 * (c : ℤ) * (a n : ℤ) ^ 2\n + 5 * (c : ℤ) ^ 2 * (a n : ℤ) + (c : ℤ)) ∧\n (∀ n : ℕ, 1 ≤ n → 0 < a n)\n\n/-- A prime `p` is a \"fresh\" prime divisor at index `n` when it divides `a n`\nand divides none of the earlier terms `a 1, …, a (n-1)`. -/\ndef FreshPrimeAt (a : ℕ → ℕ) (n p : ℕ) : Prop :=\n Nat.Prime p ∧\n p ∣ a n ∧\n (∀ i : ℕ, 1 ≤ i → i < n → ¬ p ∣ a i)\n\n/-- The assertion to be proved: for every integer `c ≥ 1` and every positive\ninteger sequence satisfying the stated recurrence, each term with index at\nleast `2` has a prime divisor that has not divided any earlier term. -/\ndef Target : Prop :=\n ∀ c : ℕ, 1 ≤ c →\n ∀ a : ℕ → ℕ,\n IsPositiveIntegerSequence c a →\n ∀ n : ℕ, 2 ≤ n →\n ∃ p : ℕ, FreshPrimeAt a n p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "90838857-387c-53a7-979c-ea3abefeaa23", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0ed27e3c5c2ef9a7f436d5dd6bb77ada76722ede62050a7cac9bb30cfe09f593", "task_path": "tasks/nmp3_90838857-387c-53a7-979c-ea3abefeaa23", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "90838857-387c-53a7-979c-ea3abefeaa23", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_90975575-b4fa-5031-867b-2ce54dd57cbc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots,a_{99}$ be non‑negative real numbers with $\\displaystyle\\sum_{i=1}^{99}a_i=1$, and let $b_1,b_2,\\dots,b_{99}$ be non‑negative real numbers with $\\displaystyle\\sum_{i=1}^{99}b_i=1$. Prove that there always exists a set $S\\subset\\{1,2,\\dots,99\\}$ of exactly $50$ indices such that \n-- \\[\n-- \\sum_{s\\in S}a_s\\ge\\frac12\\qquad\\text{and}\\qquad\\sum_{s\\in S}b_s\\ge\\frac12\\,.\n-- \\] \n-- (Equivalently, answer “yes” to the question whether such a set $S$ must exist.)\nimport Mathlib\n\nopen scoped BigOperators\n\n/-!\n# Formalization of the two-mass fifty-index subset problem\n\nThe original problem indexes the two mass distributions by\n`{1, 2, ..., 99}`. We represent this index set by `Fin 99`; a finite\nsubset of the index set is then represented by a `Finset (Fin 99)`.\n-/\n\nnamespace Problem\n\n/--\nFor every two non-negative probability vectors `a` and `b` on `99`\nindices, there is a set of exactly fifty indices which carries at least\none half of the mass of each vector.\n-/\ndef Target : Prop :=\n ∀ a b : Fin 99 → ℝ,\n (∀ i : Fin 99, 0 ≤ a i) →\n (∑ i : Fin 99, a i = 1) →\n (∀ i : Fin 99, 0 ≤ b i) →\n (∑ i : Fin 99, b i = 1) →\n ∃ S : Finset (Fin 99),\n S.card = 50 ∧\n (1 / 2 : ℝ) ≤ S.sum a ∧\n (1 / 2 : ℝ) ≤ S.sum b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "90975575-b4fa-5031-867b-2ce54dd57cbc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "244a01ffb84adb3e65e6dede36c23274056398e87c57aed79e76ae19c29fd400", "task_path": "tasks/nmp3_90975575-b4fa-5031-867b-2ce54dd57cbc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "90975575-b4fa-5031-867b-2ce54dd57cbc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_90f5d0f8-7986-5b75-929f-5b6b433e6122", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ be real numbers such that at most one of them is zero (i.e. no two of $a,b,c$ are simultaneously zero). Prove that \n-- \\[\n-- \\frac{a}{b^{3}+c^{3}}+\\frac{b}{a^{3}+c^{3}}+\\frac{c}{a^{3}+b^{3}}\n-- \\;\\ge\\;\n-- \\frac{18}{\\,5(a^{2}+b^{2}+c^{2})-ab-ac-bc\\,}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the three-variable nonnegative real inequality\n\nThe source problem asks to prove a lower bound for a symmetric rational\nexpression in three nonnegative real numbers, under the condition that no two\nof the numbers are simultaneously zero.\n-/\n\nnamespace Problem\n\n/-- The condition that at most one of `a`, `b`, and `c` is zero, expressed in\nthe equivalent form used explicitly in the problem: no two of the three\nnumbers are simultaneously zero. -/\ndef AtMostOneZero (a b c : ℝ) : Prop :=\n ¬ (a = 0 ∧ b = 0) ∧\n ¬ (a = 0 ∧ c = 0) ∧\n ¬ (b = 0 ∧ c = 0)\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n a / (b ^ 3 + c ^ 3) +\n b / (a ^ 3 + c ^ 3) +\n c / (a ^ 3 + b ^ 3)\n\n/-- The denominator occurring on the right-hand side of the source problem. -/\ndef RightHandSideDenominator (a b c : ℝ) : ℝ :=\n 5 * (a ^ 2 + b ^ 2 + c ^ 2) - a * b - a * c - b * c\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def RightHandSide (a b c : ℝ) : ℝ :=\n 18 / RightHandSideDenominator a b c\n\n/-- The complete assertion to be proved: for all nonnegative real numbers\n`a`, `b`, and `c`, with no two of them simultaneously zero, the stated\nleft-hand side is at least the stated right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n AtMostOneZero a b c →\n LeftHandSide a b c ≥ RightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "90f5d0f8-7986-5b75-929f-5b6b433e6122", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e22d4248003d3a5a2207da7917e971a974c159d4d27f040b4b5a14c2fbd7db07", "task_path": "tasks/nmp3_90f5d0f8-7986-5b75-929f-5b6b433e6122", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "90f5d0f8-7986-5b75-929f-5b6b433e6122", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9109fa13-7634-5644-9ea8-4d579d4a416e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b>1$ be odd positive integers. Consider an $a\\times b$ rectangular board from which the three unit squares $(2,1)$, $(a-2,b)$ and $(a,b)$ are removed. The remaining cells are tiled with $2\\times2$ squares and $2\\times1$ dominoes (dominoes may be placed horizontally or vertically). Prove that the number of dominoes in any such tiling satisfies \n-- \\[\n-- \\#\\text{dominoes}\\;\\ge\\;\\frac32\\,(a+b)-6\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Domino lower bound for an odd rectangular board with three removed squares\n\nThis file formalizes the statement of the problem. It does not contain a proof\nof the asserted lower bound.\n-/\n\nnamespace Problem\n\n/-- The three possible kinds of tile used in the tiling. -/\ninductive TileKind where\n | square\n | horizontalDomino\n | verticalDomino\n deriving DecidableEq, Repr\n\n/-- A tile kind is a domino exactly for the two one-by-two orientations. -/\ndef TileKind.IsDomino : TileKind → Prop\n | .square => False\n | .horizontalDomino => True\n | .verticalDomino => True\n\ninstance TileKind.instDecidableIsDomino (k : TileKind) : Decidable k.IsDomino := by\n cases k with\n | square => exact isFalse (by simp [TileKind.IsDomino])\n | horizontalDomino => exact isTrue (by simp [TileKind.IsDomino])\n | verticalDomino => exact isTrue (by simp [TileKind.IsDomino])\n\n/-- A tile is a shape together with its upper-left (in the horizontal domino\ncase, leftmost) unit-square coordinate. Coordinates are one-indexed. -/\nstructure Tile where\n kind : TileKind\n row : ℕ\n col : ℕ\n deriving DecidableEq, Repr\n\n/-- The finite set of unit-square coordinates covered by a tile. -/\ndef Tile.cells (t : Tile) : Finset (ℕ × ℕ) :=\n match t.kind with\n | .square =>\n {(t.row, t.col), (t.row + 1, t.col),\n (t.row, t.col + 1), (t.row + 1, t.col + 1)}\n | .horizontalDomino =>\n {(t.row, t.col), (t.row, t.col + 1)}\n | .verticalDomino =>\n {(t.row, t.col), (t.row + 1, t.col)}\n\n/-- A tile represents a domino when its kind is one of the two domino kinds. -/\ndef Tile.IsDomino (t : Tile) : Prop :=\n t.kind.IsDomino\n\ninstance Tile.instDecidableIsDomino (t : Tile) : Decidable t.IsDomino :=\n inferInstanceAs (Decidable t.kind.IsDomino)\n\n/-- The full one-indexed `a × b` rectangular board, as a finite set of\ncoordinates `(row, column)`. -/\ndef fullBoard (a b : ℕ) : Finset (ℕ × ℕ) :=\n (Finset.Icc 1 a).product (Finset.Icc 1 b)\n\n/-- The three unit squares removed from the board, using the one-indexed\ncoordinates from the problem. -/\ndef removedCells (a b : ℕ) : Finset (ℕ × ℕ) :=\n {(2, 1), (a - 2, b), (a, b)}\n\n/-- The board that remains after the three specified cells have been removed. -/\ndef boardCells (a b : ℕ) : Finset (ℕ × ℕ) :=\n fullBoard a b \\ removedCells a b\n\n/-- A tiling of the remaining board by `2 × 2` squares and `2 × 1` dominoes,\nwith dominoes allowed in either orientation. The `covers` field says that the\ntile footprints cover exactly the remaining board, and `pairwiseDisjoint` says\nthat different tile footprints are disjoint. -/\nstructure Tiling (a b : ℕ) where\n pieces : Finset Tile\n covers : pieces.biUnion Tile.cells = boardCells a b\n pairwiseDisjoint :\n ∀ p ∈ pieces, ∀ q ∈ pieces, p ≠ q → Disjoint p.cells q.cells\n\n/-- The number of dominoes (in either orientation) in a tiling. -/\ndef Tiling.numDominoes {a b : ℕ} (T : Tiling a b) : ℕ :=\n (T.pieces.filter (fun t => t.IsDomino)).card\n\n/-- The asserted lower bound for a fixed tiling. -/\ndef DominoCountLowerBound {a b : ℕ} (T : Tiling a b) : Prop :=\n (3 / 2 : ℚ) * (a + b : ℚ) - 6 ≤ (T.numDominoes : ℚ)\n\n/-- The formal target: for all odd integers `a, b > 1`, every tiling of the\nspecified remaining board by `2 × 2` squares and `2 × 1` dominoes has at least\n`(3 / 2) * (a + b) - 6` dominoes. -/\ndef Target : Prop :=\n ∀ (a b : ℕ), 1 < a → 1 < b → Odd a → Odd b →\n ∀ T : Tiling a b, DominoCountLowerBound T\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9109fa13-7634-5644-9ea8-4d579d4a416e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "795fb65dd0febd9b674f1ff2ce55c7004bfd5dfd2fe0cfae84beeea7faaea44f", "task_path": "tasks/nmp3_9109fa13-7634-5644-9ea8-4d579d4a416e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9109fa13-7634-5644-9ea8-4d579d4a416e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_910b63f7-7f33-5b28-ab2f-d2dda6846d74", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb{R}$ satisfy $abc=1$. Prove that\n-- \\[\n-- a^{4}+b^{4}+c^{4}-3\\;\\ge\\;(ab+bc+ca)\\bigl(a^{2}+b^{2}+c^{2}-3\\bigr).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion stated in the problem: for all real numbers `a`, `b`, `c`\nwith `a * b * c = 1`, the displayed fourth-power inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n a * b * c = 1 →\n a ^ 4 + b ^ 4 + c ^ 4 - 3 ≥\n (a * b + b * c + c * a) * (a ^ 2 + b ^ 2 + c ^ 2 - 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "910b63f7-7f33-5b28-ab2f-d2dda6846d74", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "818eec21d50374e41609af9983ca9aabf5e2cb4939922f94ae8329016ebe5880", "task_path": "tasks/nmp3_910b63f7-7f33-5b28-ab2f-d2dda6846d74", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "910b63f7-7f33-5b28-ab2f-d2dda6846d74", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_911957b8-4f4b-5ed5-9436-c4189eb04dd1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \n-- \\[\n-- \\frac{a}{\\sqrt{a^{2}+2bc}}+\\frac{b}{\\sqrt{b^{2}+2ca}}+\\frac{c}{\\sqrt{c^{2}+2ab}}\n-- \\le\n-- \\frac{a+b+c}{\\sqrt{ab+bc+ca}}.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for a cyclic square-root inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\n\n`a / sqrt (a^2 + 2bc) + b / sqrt (b^2 + 2ca) + c / sqrt (c^2 + 2ab)\n ≤ (a + b + c) / sqrt (ab + bc + ca)`.\n\nThis file records the assertion as a proposition; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the source inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / Real.sqrt (a ^ 2 + 2 * b * c) +\n b / Real.sqrt (b ^ 2 + 2 * c * a) +\n c / Real.sqrt (c ^ 2 + 2 * a * b)\n\n/-- The right-hand side of the source inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a + b + c) / Real.sqrt (a * b + b * c + c * a)\n\n/-- The complete assertion of the problem: for all positive real `a`, `b`, and `c`,\nthe cyclic square-root sum is at most `(a + b + c) / sqrt (ab + bc + ca)`. -/\nnoncomputable def Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "911957b8-4f4b-5ed5-9436-c4189eb04dd1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2528f230b1cb307bf7ca6d612d88f1f863e12999654a4424bd2abb0750538671", "task_path": "tasks/nmp3_911957b8-4f4b-5ed5-9436-c4189eb04dd1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "911957b8-4f4b-5ed5-9436-c4189eb04dd1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9120a11c-b934-5946-a594-e3563af5af85", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle for which there exists an interior point $F$ such that $\\angle AFB=\\angle BFC=\\angle CFA$. Let the line $BF$ intersect side $AC$ at $D$ and the line $CF$ intersect side $AB$ at $E$. Prove that \n-- \\[AB+AC\\ge 4\\,DE.\\]\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.Convex.Hull\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the formalization. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The three vertices form a genuine (non-collinear) triangle. -/\ndef Triangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- `F` is an interior point of the triangle with vertices `A`, `B`, and `C`. -/\ndef StrictlyInsideTriangle (A B C F : Plane) : Prop :=\n F ∈ interior (convexHull ℝ ({A, B, C} : Set Plane))\n\n/-- The three angles at `F` specified in the problem are equal. -/\ndef EqualAnglesAtF (A B C F : Plane) : Prop :=\n ∠ A F B = ∠ B F C ∧ ∠ B F C = ∠ C F A\n\n/-- `D` is the intersection point of the line `BF` with the side (closed segment) `AC`. -/\ndef DOnLineBFAndSideAC (A B C F D : Plane) : Prop :=\n D ∈ line[ℝ, B, F] ∧ D ∈ segment ℝ A C\n\n/-- `E` is the intersection point of the line `CF` with the side (closed segment) `AB`. -/\ndef EOnLineCFAndSideAB (A B C F E : Plane) : Prop :=\n E ∈ line[ℝ, C, F] ∧ E ∈ segment ℝ A B\n\n/-- The assertion to be proved: for every nondegenerate triangle `ABC`, every interior\npoint `F` whose three angles `AFB`, `BFC`, and `CFA` are equal, and the intersections\n`D` and `E` of `BF` and `CF` with the opposite sides, one has\n`AB + AC ≥ 4 * DE`. -/\ndef Target : Prop :=\n ∀ A B C : Plane, Triangle A B C →\n ∀ F : Plane, StrictlyInsideTriangle A B C F →\n EqualAnglesAtF A B C F →\n ∀ D E : Plane,\n DOnLineBFAndSideAC A B C F D →\n EOnLineCFAndSideAB A B C F E →\n dist A B + dist A C ≥ 4 * dist D E\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9120a11c-b934-5946-a594-e3563af5af85", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fe6482bb15180d6faa0bf451fd391658226296b18a1976dff1caf1fbcf88fe5c", "task_path": "tasks/nmp3_9120a11c-b934-5946-a594-e3563af5af85", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9120a11c-b934-5946-a594-e3563af5af85", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9125355d-5716-5103-8224-c4511c140640", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(n\\ge 2\\) be an integer. Let real numbers \\(x_1\\ge x_2\\ge\\cdots\\ge x_n\\) and \\(y_1\\ge y_2\\ge\\cdots\\ge y_n\\) satisfy \n-- \\[\n-- \\sum_{i=1}^n x_i=\\sum_{i=1}^n y_i=0,\\qquad \n-- \\sum_{i=1}^n x_i^{2}=\\sum_{i=1}^n y_i^{2}=1.\n-- \\] \n-- Prove that \n-- \\[\n-- \\sum_{i=1}^{n}\\bigl(x_i y_i - x_i y_{\\,n+1-i}\\bigr)\\ge\\frac{2}{\\sqrt{\\,n-1\\,}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of a rearrangement-type inequality\n\nThe original problem uses one-based indices `1, ..., n`. We represent them by\n`Fin n`, whose element `i` corresponds to the one-based index `i.val + 1`.\nThe reversal `Fin.rev i` then corresponds to the one-based index `n + 1 - (i.val + 1)`.\n-/\n\nnoncomputable section\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- A real sequence indexed by `Fin n` is nonincreasing in the usual order:\nif `i ≤ j`, then `a j ≤ a i`. -/\ndef IsNonincreasing {n : ℕ} (a : Fin n → ℝ) : Prop :=\n ∀ i j : Fin n, i ≤ j → a j ≤ a i\n\n/-- The hypotheses imposed on the two real sequences, excluding the condition `2 ≤ n`\non their common length. The sums are over all one-based indices `1, ..., n`,\nrepresented by `Fin n`. -/\ndef Admissible (n : ℕ) (x y : Fin n → ℝ) : Prop :=\n IsNonincreasing x ∧\n IsNonincreasing y ∧\n (∑ i : Fin n, x i) = 0 ∧\n (∑ i : Fin n, y i) = 0 ∧\n (∑ i : Fin n, (x i) ^ 2) = 1 ∧\n (∑ i : Fin n, (y i) ^ 2) = 1\n\n/-- The left-hand side\n`∑ i, (x_i * y_i - x_i * y_{n+1-i})` of the asserted inequality. -/\ndef SymmetricDifferenceSum (n : ℕ) (x y : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, (x i * y i - x i * y (Fin.rev i))\n\n/-- The right-hand side `2 / sqrt (n - 1)` of the asserted inequality. -/\ndef Bound (n : ℕ) : ℝ :=\n (2 : ℝ) / Real.sqrt (((n - 1 : ℕ) : ℝ))\n\n/-- The full universal assertion of the problem: for every integer length `n ≥ 2`\nand every pair of nonincreasing real sequences satisfying the prescribed sum and\nsum-of-squares conditions, the displayed symmetric-difference sum is at least\n`2 / sqrt (n - 1)`. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 2 ≤ n → ∀ (x y : Fin n → ℝ),\n Admissible n x y →\n SymmetricDifferenceSum n x y ≥ Bound n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9125355d-5716-5103-8224-c4511c140640", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "07e00bf328de65e5f59685f1fd47bd3cd9901d1467307a0166474611ec970328", "task_path": "tasks/nmp3_9125355d-5716-5103-8224-c4511c140640", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9125355d-5716-5103-8224-c4511c140640", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9130f5e9-f2c9-5c3a-afe7-df3b944b9da1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with no two of them equal to zero. Prove that \n-- \\[\n-- \\frac{a^{2}}{a^{2}+ab+b^{2}}+\\frac{b^{2}}{b^{2}+bc+c^{2}}+\\frac{c^{2}}{c^{2}+ca+a^{2}}\\ge1.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\nFormalization of the inequality problem in `problem.md`.\n\nThe source variables are interpreted as nonnegative real numbers. The phrase\n\"no two of them equal to zero\" is formalized as the three pairwise conditions\nthat `a` and `b`, `b` and `c`, and `c` and `a` are not simultaneously zero.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def InequalityLHS (a b c : ℝ) : ℝ :=\n a ^ 2 / (a ^ 2 + a * b + b ^ 2) +\n b ^ 2 / (b ^ 2 + b * c + c ^ 2) +\n c ^ 2 / (c ^ 2 + c * a + a ^ 2)\n\n/-- No two of `a`, `b`, and `c` are both equal to zero. -/\ndef NoTwoZero (a b c : ℝ) : Prop :=\n ¬ (a = 0 ∧ b = 0) ∧ ¬ (b = 0 ∧ c = 0) ∧ ¬ (c = 0 ∧ a = 0)\n\n/--\nFor all nonnegative real numbers `a`, `b`, and `c`, with no two of them\nsimply zero, the stated cyclic sum is at least one.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n NoTwoZero a b c →\n InequalityLHS a b c ≥ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9130f5e9-f2c9-5c3a-afe7-df3b944b9da1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b2cce0d11315e9d8a1c94c6f8f3336ae87d6204328718b6ec2e7f4443706cb96", "task_path": "tasks/nmp3_9130f5e9-f2c9-5c3a-afe7-df3b944b9da1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9130f5e9-f2c9-5c3a-afe7-df3b944b9da1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_915ace8f-8a4d-55ee-944d-4e3feb6b5968", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $\\sqrt a+\\sqrt b+\\sqrt c=1$. Prove that \n-- \\[\n-- \\frac{a^{2}+bc}{a\\sqrt{\\,b+c\\,}}+\\frac{b^{2}+ca}{b\\sqrt{\\,c+a\\,}}+\\frac{c^{2}+ab}{c\\sqrt{\\,a+b\\,}}\\ge \\sqrt2\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe original problem asks, for positive real numbers `a`, `b`, and `c` whose\nsquare roots sum to `1`, to prove a lower bound for a symmetric sum of three\npositive real expressions.\n-/\n\nnamespace Problem\n\n/--\nTarget assertion: for all positive real numbers `a`, `b`, and `c` satisfying\n`Real.sqrt a + Real.sqrt b + Real.sqrt c = 1`, the cyclic sum\n`(a^2 + b*c) / (a * sqrt (b+c)) + (b^2 + c*a) / (b * sqrt (c+a))\n + (c^2 + a*b) / (c * sqrt (a+b))` is at least `Real.sqrt 2`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n Real.sqrt a + Real.sqrt b + Real.sqrt c = 1 →\n (a ^ 2 + b * c) / (a * Real.sqrt (b + c)) +\n (b ^ 2 + c * a) / (b * Real.sqrt (c + a)) +\n (c ^ 2 + a * b) / (c * Real.sqrt (a + b)) ≥\n Real.sqrt 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "915ace8f-8a4d-55ee-944d-4e3feb6b5968", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fcfda41c789bb9c2a03fd2c198469fbe388cd05ed7b965bf9d99e83a7ce9059a", "task_path": "tasks/nmp3_915ace8f-8a4d-55ee-944d-4e3feb6b5968", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "915ace8f-8a4d-55ee-944d-4e3feb6b5968", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_91b3e099-4e16-56ce-a6be-3c8d525ca5e8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=1$. Prove that \n-- \\[\n-- \\frac1a+\\frac1b+\\frac1c\\ge 5\\Bigl(\\frac1{b+c+1}+\\frac1{c+a+1}+\\frac1{a+b+1}\\Bigr).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three variables are positive real numbers. -/\ndef IsPositiveRealTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The three positive real variables are normalized by `a + b + c = 1`. -/\ndef IsNormalizedPositiveRealTriple (a b c : ℝ) : Prop :=\n IsPositiveRealTriple a b c ∧ a + b + c = 1\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def InequalityLeftHandSide (a b c : ℝ) : ℝ :=\n 1 / a + 1 / b + 1 / c\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def InequalityRightHandSide (a b c : ℝ) : ℝ :=\n 5 * (1 / (b + c + 1) + 1 / (c + a + 1) + 1 / (a + b + 1))\n\n/-- The asserted inequality for a fixed triple of real numbers. -/\ndef InequalityClaim (a b c : ℝ) : Prop :=\n InequalityLeftHandSide a b c ≥ InequalityRightHandSide a b c\n\n/-- The full universal statement from the problem: for all positive real `a`, `b`, `c`\nwith `a + b + c = 1`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsNormalizedPositiveRealTriple a b c → InequalityClaim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "91b3e099-4e16-56ce-a6be-3c8d525ca5e8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c1eaf007deccd18686be60dd389c396e07574fc3b53ed665c565161d37f62ded", "task_path": "tasks/nmp3_91b3e099-4e16-56ce-a6be-3c8d525ca5e8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "91b3e099-4e16-56ce-a6be-3c8d525ca5e8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_91c81dea-9ac4-5235-8a24-83fa45c5278c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^2+b^2+c^2=a+b+c$. Prove that \n-- \\[\n-- \\frac{\\sqrt{2a^2+bc}}{a^2+bc}+\\frac{\\sqrt{2b^2+ca}}{b^2+ca}+\\frac{\\sqrt{2c^2+ab}}{c^2+ab}\\ge\\frac{3\\sqrt3}{2}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- One summand of the left-hand side:\n`sqrt (2a^2 + bc) / (a^2 + bc)`. -/\nnoncomputable def summand (a b c : ℝ) : ℝ :=\n Real.sqrt (2 * a ^ 2 + b * c) / (a ^ 2 + b * c)\n\n/-- The admissibility conditions on the positive reals `a`, `b`, and `c`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 2 + b ^ 2 + c ^ 2 = a + b + c\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n summand a b c + summand b c a + summand c a b\n\n/-- The right-hand side of the desired inequality, `3 * sqrt 3 / 2`. -/\nnoncomputable def rightHandSide : ℝ :=\n 3 * Real.sqrt 3 / 2\n\n/-- The assertion to be proved: for all positive real `a`, `b`, and `c` satisfying\n`a^2 + b^2 + c^2 = a + b + c`, the stated sum is at least `3 * sqrt 3 / 2`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c →\n leftHandSide a b c ≥ rightHandSide\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "91c81dea-9ac4-5235-8a24-83fa45c5278c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0ecaa8fcd6cb28bd9f5a13183f53f5ce30b727cb0c5002fbf3a1ca14888402ba", "task_path": "tasks/nmp3_91c81dea-9ac4-5235-8a24-83fa45c5278c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "91c81dea-9ac4-5235-8a24-83fa45c5278c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_91d17bbc-57f6-512f-a03a-c9d479f185b5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a^3+b^3+c^3=3$. Prove that \n-- \\[\n-- \\frac{a^2}{b+5}+\\frac{b^2}{c+5}+\\frac{c^2}{a+5}\\le\\frac12.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`\nsatisfying `a ^ 3 + b ^ 3 + c ^ 3 = 3`, the cyclic inequality\n\n`a ^ 2 / (b + 5) + b ^ 2 / (c + 5) + c ^ 2 / (a + 5) ≤ 1 / 2`.\n\nThis file only records the mathematical statement as a proposition; it does not\ncontain a proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real numbers in the problem:\nthey are all strictly positive and the sum of their cubes is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a ^ (3 : ℕ) + b ^ (3 : ℕ) + c ^ (3 : ℕ) = (3 : ℝ)\n\n/-- The full assertion to be proved: for every admissible triple of reals, the\ncyclic sum of the three real-valued fractions is at most one half. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c →\n a ^ (2 : ℕ) / (b + (5 : ℝ)) +\n b ^ (2 : ℕ) / (c + (5 : ℝ)) +\n c ^ (2 : ℕ) / (a + (5 : ℝ)) ≤\n (1 : ℝ) / (2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "91d17bbc-57f6-512f-a03a-c9d479f185b5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cb00c9e1dfc75fcaa59e6098f923f9e76dec86ca8b9ca6240211683b493aef36", "task_path": "tasks/nmp3_91d17bbc-57f6-512f-a03a-c9d479f185b5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "91d17bbc-57f6-512f-a03a-c9d479f185b5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_91e7a91d-68f4-5741-8804-8e518e7813dd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f$ be a continuous function on the positive real numbers such that $f(x)\\le f(nx)$ for every $x>0$ and every integer $n>0$. Prove that $\\displaystyle\\lim_{x\\to\\infty}f(x)$ exists (the limit may be $+\\infty$).\nimport Mathlib\n\n/-!\n# Formal statement: existence of a limit at infinity under integer-scaling monotonicity\n\nSource problem: Let `f` be a continuous function on the positive real numbers\nsuch that `f x ≤ f (n * x)` for every `x > 0` and every positive integer `n`.\nProve that `lim_{x → ∞} f x` exists, where the limit is allowed to be `+∞`.\n\nThe problem is formalized as an unproved proposition (`Problem.Target`); no\nproof of the mathematical assertion is supplied here.\n-/\n\nnamespace Problem\n\n/-- Continuity of `f` on the positive real numbers. The function is represented\nas a total function `ℝ → ℝ`; only its values and continuity on `Set.Ioi 0` are\nrelevant to the problem. -/\ndef ContinuousOnPositive (f : ℝ → ℝ) : Prop :=\n ContinuousOn f (Set.Ioi (0 : ℝ))\n\n/-- The integer-scaling monotonicity hypothesis: for every positive real `x` and\nevery positive integer `n`, `f x ≤ f (n * x)`. -/\ndef IntegerScalingMonotone (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, 0 < x → ∀ n : ℕ, 0 < n → f x ≤ f ((n : ℝ) * x)\n\n/-- Admissibility: both hypotheses of the problem hold for `f`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ContinuousOnPositive f ∧ IntegerScalingMonotone f\n\n/-- The conclusion that the limit of `f` at `+∞` exists in\n`ℝ ∪ {+∞}`: either the limit is a finite real number `L`, or `f` tends to\n`+∞` in the usual order topology on `ℝ`. -/\ndef LimitExistsAtTopOrFinite (f : ℝ → ℝ) : Prop :=\n (∃ L : ℝ, Filter.Tendsto f Filter.atTop (nhds L)) ∨\n Filter.Tendsto f Filter.atTop Filter.atTop\n\n/-- The complete statement of the problem, universally quantified over `f`. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, Admissible f → LimitExistsAtTopOrFinite f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "91e7a91d-68f4-5741-8804-8e518e7813dd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "02043a131958b6ce46d4c8b12cd62e36532548285fbf23faf9c07c516fe36048", "task_path": "tasks/nmp3_91e7a91d-68f4-5741-8804-8e518e7813dd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "91e7a91d-68f4-5741-8804-8e518e7813dd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_91f15082-ec8c-504f-b14e-cb04ff386b2c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{xy}{z}+\\frac{yz}{x}+\\frac{zx}{y}>2\\sqrt[3]{\\,x^3+y^3+z^3\\,}\\,.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formal statement of the cyclic cube-root inequality\n\nThe source problem asks to prove, for positive real numbers `x`, `y`, and `z`,\n\n`x*y/z + y*z/x + z*x/y > 2 * (x^3 + y^3 + z^3)^(1/3)`.\n\nMathlib does not provide a real cube-root function in this version, so\n`Problem.realCubeRoot` is defined as the real power with exponent `1/3`.\nFor the nonnegative radicand occurring in the statement, this is the\nnonnegative real cube root.\n-/\n\nnamespace Problem\n\n/-- The principal real cube root, represented via the real `1/3` power.\n\nFor nonnegative `a`, `Real.rpow a (1 / 3)` is the unique nonnegative real\nnumber whose cube is `a`. The statement below only applies it to the\nnonnegative number `x ^ 3 + y ^ 3 + z ^ 3` when `x`, `y`, and `z` are positive.\n-/\nnoncomputable def realCubeRoot (a : ℝ) : ℝ :=\n Real.rpow a (1 / 3 : ℝ)\n\n/-- For positive real numbers `x`, `y`, and `z`,\n`xy/z + yz/x + zx/y > 2 * cbrt (x^3 + y^3 + z^3)`. -/\nnoncomputable def Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n (x * y) / z + (y * z) / x + (z * x) / y >\n 2 * realCubeRoot (x ^ 3 + y ^ 3 + z ^ 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "91f15082-ec8c-504f-b14e-cb04ff386b2c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "adc05a4c2a700005d4cc7509aff038405b74edbb9fb14c1b74113ed8b20de95a", "task_path": "tasks/nmp3_91f15082-ec8c-504f-b14e-cb04ff386b2c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "91f15082-ec8c-504f-b14e-cb04ff386b2c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_920cfa57-f2d4-5d1b-9913-3f71b15e48e9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_{1},a_{2},\\dots ,a_{2n+1}\\in\\mathbb{R}$ and let $n\\ge 1$ be an integer. For each index $i$ with $1\\le i\\le 2n+1$ there exist two disjoint subsets $G_{1},G_{2}\\subset\\{1,2,\\dots ,2n+1\\}\\setminus\\{i\\}$ such that \n-- \n-- \\[\n-- |G_{1}|=|G_{2}|=n,\\qquad \n-- \\sum_{j\\in G_{1}}a_{j}=\\sum_{j\\in G_{2}}a_{j}.\n-- \\]\n-- \n-- Prove that \n-- \\[\n-- a_{1}=a_{2}=\\cdots =a_{2n+1}.\n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\n/-!\n# Formalization of the equal-sum two-subset problem\n\nThe original problem indexes the real numbers by `1, …, 2n+1`. We use the\ncanonical finite type `Fin (2 * n + 1)`, whose elements are `0, …, 2n`; this is\nthe usual zero-based encoding of those indices. A subset of the index set is\nrepresented by a `Finset` of this finite type, and sums over such a subset use\n`Finset.sum`.\n-/\n\nnamespace Problem\n\n/-- The hypothesis supplied in the problem: for every index `i`, the remaining\nindices contain two disjoint `n`-element subsets whose `a`-sums are equal. -/\ndef Admissible (n : ℕ) (a : Fin (2 * n + 1) → ℝ) : Prop :=\n ∀ i : Fin (2 * n + 1),\n ∃ G1 G2 : Finset (Fin (2 * n + 1)),\n G1 ⊆ Finset.univ.erase i ∧\n G2 ⊆ Finset.univ.erase i ∧\n Disjoint G1 G2 ∧\n G1.card = n ∧\n G2.card = n ∧\n (∑ j ∈ G1, a j) = (∑ j ∈ G2, a j)\n\n/-- The conclusion that all the indexed real numbers are equal. -/\ndef AllEqual (n : ℕ) (a : Fin (2 * n + 1) → ℝ) : Prop :=\n ∀ i j : Fin (2 * n + 1), a i = a j\n\n/-- The full mathematical assertion of the problem: for every positive integer\n`n` and every real-valued function `a` on `2n+1` indices, if the equal-sum\ntwo-subset hypothesis holds at every index, then all values of `a` are equal. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 1 ≤ n → ∀ a : Fin (2 * n + 1) → ℝ,\n Admissible n a → AllEqual n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "920cfa57-f2d4-5d1b-9913-3f71b15e48e9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "91837f97db993af1facf1a4520f10ab304ada0665722444aeacebc50a3371bc0", "task_path": "tasks/nmp3_920cfa57-f2d4-5d1b-9913-3f71b15e48e9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "920cfa57-f2d4-5d1b-9913-3f71b15e48e9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9210dd89-c0f3-5bc9-804e-2f66b030eabd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) satisfy \\(ab+bc+ca=3\\). Prove that \n-- \\[\n-- \\frac{a}{b^{3}+abc}+\\frac{b}{c^{3}+abc}+\\frac{c}{a^{3}+abc}\\ge\\frac32\\, .\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca = 3`, that\n\n`a / (b^3 + abc) + b / (c^3 + abc) + c / (a^3 + abc) ≥ 3 / 2`.\n\nThis file records the assertion as a proposition-valued definition. No proof is\nprovided at this formalization stage.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on `a`, `b`, and `c`: all three are strictly\npositive and `ab + bc + ca = 3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = 3\n\n/-- The left-hand side of the target inequality. The product written `abc` in\nthe source is represented as `a * b * c`. -/\ndef Expression (a b c : ℝ) : ℝ :=\n a / (b ^ 3 + a * b * c) +\n b / (c ^ 3 + a * b * c) +\n c / (a ^ 3 + a * b * c)\n\n/-- The proposition to be proved in the source problem: for every real triple\nsatisfying the admissibility conditions, the displayed expression is at least\n`3 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Expression a b c ≥ (3 : ℝ) / 2\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9210dd89-c0f3-5bc9-804e-2f66b030eabd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "93dafe0e34738c5e6a44fbb209980b7b0bd541880370cd032f1cc1a64bd417a6", "task_path": "tasks/nmp3_9210dd89-c0f3-5bc9-804e-2f66b030eabd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9210dd89-c0f3-5bc9-804e-2f66b030eabd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_921c8023-6e47-527f-a4be-3cc394b95396", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k\\ge 0$ be an integer. Prove that there are infinitely many positive integers $n$ such that the product of any $n$ consecutive integers is divisible by $(n+k)^2+1\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the consecutive-products divisibility problem\n\nThe problem asks, for every nonnegative integer `k`, for infinitely many\npositive integers `n` such that the product of any `n` consecutive integers\nis divisible by `(n + k)^2 + 1`.\n\nWe state this as a `Prop`-valued definition; no proof is supplied here.\n-/\n\nnamespace Problem\n\n/-- The product of the `n` consecutive integers beginning at `a`:\n`a * (a + 1) * ... * (a + n - 1)`. -/\ndef consecutiveProduct (n : ℕ) (a : ℤ) : ℤ :=\n ∏ i ∈ Finset.range n, (a + (i : ℤ))\n\n/-- The positive modulus `(n + k)^2 + 1`, retained as a natural number. -/\ndef modulus (k n : ℕ) : ℕ :=\n (n + k) ^ 2 + 1\n\n/-- The assertion that the product of every block of `n` consecutive integers is\ndivisible by `(n + k)^2 + 1`. The starting point of the block is an arbitrary\ninteger `a`. -/\ndef consecutiveProductDivisibleBy (k n : ℕ) : Prop :=\n ∀ a : ℤ, (modulus k n : ℤ) ∣ consecutiveProduct n a\n\n/-- The set of positive integers `n` satisfying the required divisibility\nproperty for a fixed nonnegative integer `k`. -/\ndef admissibleN (k : ℕ) : Set ℕ :=\n {n : ℕ | 0 < n ∧ consecutiveProductDivisibleBy k n}\n\n/-- For every nonnegative integer `k`, there are infinitely many positive\nintegers `n` for which the product of any `n` consecutive integers is divisible\nby `(n + k)^2 + 1`. -/\ndef Target : Prop :=\n ∀ k : ℕ, Set.Infinite (admissibleN k)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "921c8023-6e47-527f-a4be-3cc394b95396", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "06c00d2d2833628a6fcca71a14a4b7e595da2ca8c4164fa0736d00dc799552cf", "task_path": "tasks/nmp3_921c8023-6e47-527f-a4be-3cc394b95396", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "921c8023-6e47-527f-a4be-3cc394b95396", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9237a745-efb0-557e-8444-790a1382172e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be a prime and $n$ a positive integer. Define $d=\\gcd(n,p-1)$. Prove that the set \n-- \\[\n-- \\{\\,a_1^n+a_2^n+\\dots +a_d^n \\pmod p \\mid a_1,a_2,\\dots ,a_d\\in\\mathbb Z/p\\mathbb Z\\,\\}\n-- \\]\n-- contains every residue class modulo $p$; i.e. for each $r\\in\\{0,1,\\dots ,p-1\\}$ there exist $a_1,\\dots ,a_d\\in\\mathbb Z/p\\mathbb Z$ such that $a_1^n+\\cdots +a_d^n\\equiv r\\pmod p\\,. $\nimport Mathlib\n\n/-!\n# Sums of `d`-many `n`-th powers modulo a prime\n\nFormalization of the statement in `problem.md`. The source proves that, for a\nprime `p` and a positive integer `n`, with `d = gcd n (p - 1)`, sums of exactly\n`d` `n`-th powers in `ZMod p` realize every residue class modulo `p`.\n-/\n\nnamespace Problem\n\n/-- The set of residue classes modulo `p` that can be written as a sum of\nexactly `gcd n (p - 1)` many `n`-th powers of elements of `ZMod p`. -/\ndef reachableResidues (p n : ℕ) : Set (ZMod p) :=\n {r | ∃ a : Fin (Nat.gcd n (p - 1)) → ZMod p,\n (∑ i : Fin (Nat.gcd n (p - 1)), (a i) ^ n) = r}\n\n/-- For every prime `p` and positive integer `n`, every residue class modulo `p`\nis a sum of exactly `gcd n (p - 1)` many `n`-th powers in `ZMod p`. -/\ndef Target : Prop :=\n ∀ (p n : ℕ), Nat.Prime p → 0 < n →\n ∀ r : ZMod p, r ∈ reachableResidues p n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9237a745-efb0-557e-8444-790a1382172e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f9baaf9f692144a85b37b914f9a38857f44f5210afd9685e1e137924d0fe66b8", "task_path": "tasks/nmp3_9237a745-efb0-557e-8444-790a1382172e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9237a745-efb0-557e-8444-790a1382172e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9248e1e8-734a-54d9-9a2c-57dbde7cccaa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A convex quadrilateral $ABCD$ is inscribed in a circle with centre $O$. Its diagonals $AC$ and $BD$ intersect at $P$. The circumcircles of $\\triangle ABP$ and $\\triangle CDP$ intersect again at $Q$ (the points $O$, $P$, $Q$ are pairwise distinct). Prove that $\\displaystyle\\angle OQP=90^{\\circ}\\,.$\n/-\nFormal statement of the geometry problem in `problem.md`.\n\nThe ambient plane is the real Euclidean plane `EuclideanSpace ℝ (Fin 2)`.\nThe target is stated as a proposition (not proved here).\n-/\nmodule\n\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\npublic import Mathlib.Geometry.Euclidean.Sphere.Basic\n\n@[expose] public section\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean plane. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The signed two-dimensional cross product (z-component of the planar cross product). -/\ndef cross (u v : Plane) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- The signed turn from edge `AB` to edge `BC`. -/\ndef turn (A B C : Plane) : ℝ := cross (B - A) (C - B)\n\n/-- `A B C D` are the vertices, in cyclic order, of a nondegenerate convex quadrilateral.\nThe four consecutive turns have one common strict sign; both clockwise and counterclockwise\norders are allowed. Distinctness of the four vertices is stated explicitly. -/\ndef ConvexQuadrilateral (A B C D : Plane) : Prop :=\n A ≠ B ∧ A ≠ C ∧ A ≠ D ∧ B ≠ C ∧ B ≠ D ∧ C ≠ D ∧\n ((0 < turn A B C ∧ 0 < turn B C D ∧ 0 < turn C D A ∧ 0 < turn D A B) ∨\n (turn A B C < 0 ∧ turn B C D < 0 ∧ turn C D A < 0 ∧ turn D A B < 0))\n\n/-- The points `A`, `B`, `C`, and `D` lie on a circle with centre `O` and a positive radius. -/\ndef CyclicWithCenter (A B C D O : Plane) : Prop :=\n ∃ r : ℝ, 0 < r ∧ dist A O = r ∧ dist B O = r ∧ dist C O = r ∧ dist D O = r\n\n/-- The diagonals `AC` and `BD` meet at `P`, strictly inside both diagonal segments. -/\ndef DiagonalIntersection (A B C D P : Plane) : Prop :=\n Sbtw ℝ A P C ∧ Sbtw ℝ B P D\n\n/-- A circle which is the unique circle through `X`, `Y`, and `Z`.\nThe uniqueness condition forces the three points to determine a genuine circumcircle. -/\ndef IsCircumcircle (X Y Z : Plane) (s : EuclideanGeometry.Sphere Plane) : Prop :=\n X ∈ s ∧ Y ∈ s ∧ Z ∈ s ∧\n ∀ t : EuclideanGeometry.Sphere Plane, X ∈ t → Y ∈ t → Z ∈ t → t = s\n\n/-- The circumcircles of triangles `ABP` and `CDP` have exactly the two common points `P`\nand `Q`, with `Q` distinct from `P`. -/\ndef CircumcirclesMeetAgain (A B C D P Q : Plane) : Prop :=\n ∃ s₁ s₂ : EuclideanGeometry.Sphere Plane,\n IsCircumcircle A B P s₁ ∧\n IsCircumcircle C D P s₂ ∧\n Q ∈ s₁ ∧\n Q ∈ s₂ ∧\n Q ≠ P ∧\n ∀ X : Plane, X ∈ s₁ → X ∈ s₂ → X = P ∨ X = Q\n\n/-- The three named points `O`, `P`, `Q` are pairwise distinct. -/\ndef PairwiseDistinctThree (O P Q : Plane) : Prop :=\n O ≠ P ∧ O ≠ Q ∧ P ≠ Q\n\n/-- All hypotheses of the original problem, bundled in the same order. -/\ndef Hypotheses (A B C D O P Q : Plane) : Prop :=\n ConvexQuadrilateral A B C D ∧\n CyclicWithCenter A B C D O ∧\n DiagonalIntersection A B C D P ∧\n CircumcirclesMeetAgain A B C D P Q ∧\n PairwiseDistinctThree O P Q\n\n/-- The assertion of the problem: for every configuration satisfying the stated hypotheses,\nthe angle `OQP` is a right angle. -/\ndef Target : Prop :=\n ∀ A B C D O P Q : Plane,\n ConvexQuadrilateral A B C D →\n CyclicWithCenter A B C D O →\n DiagonalIntersection A B C D P →\n CircumcirclesMeetAgain A B C D P Q →\n PairwiseDistinctThree O P Q →\n EuclideanGeometry.angle O Q P = Real.pi / 2\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9248e1e8-734a-54d9-9a2c-57dbde7cccaa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9fe8cae7cfde24327f107714345941bb5910ca70c286dbd70fe0d1a35732d33e", "task_path": "tasks/nmp3_9248e1e8-734a-54d9-9a2c-57dbde7cccaa", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9248e1e8-734a-54d9-9a2c-57dbde7cccaa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_92491edd-13b9-5373-a2a4-d694f2381605", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$ with $a+b+c=1$, prove that \n-- \\[\n-- \\frac{a^4}{\\sqrt{b^4+c^4}}+\\frac{b^4}{\\sqrt{c^4+a^4}}+\\frac{c^4}{\\sqrt{a^4+b^4}}\\ge\\frac{1}{3\\sqrt2}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissible triples in the problem: positive real `a`, `b`, `c`\nwhose sum is `1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 1\n\n/-- The cyclic left-hand side\n`a^4 / sqrt (b^4 + c^4) + b^4 / sqrt (c^4 + a^4) + c^4 / sqrt (a^4 + b^4)`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n a ^ 4 / Real.sqrt (b ^ 4 + c ^ 4) +\n b ^ 4 / Real.sqrt (c ^ 4 + a ^ 4) +\n c ^ 4 / Real.sqrt (a ^ 4 + b ^ 4)\n\n/-- The lower bound `1 / (3 * sqrt 2)` appearing on the right-hand side. -/\nnoncomputable def lowerBound : ℝ :=\n 1 / (3 * Real.sqrt 2)\n\n/-- The assertion to be proved: for every positive real triple `a`, `b`, `c`\nwith `a + b + c = 1`, the cyclic sum is at least `1 / (3 * sqrt 2)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lowerBound ≤ cyclicSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "92491edd-13b9-5373-a2a4-d694f2381605", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0fdd92bbd3d77467840c6d32ab6dc5d6a7680799079ed105eb1a1bc4c80c7487", "task_path": "tasks/nmp3_92491edd-13b9-5373-a2a4-d694f2381605", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "92491edd-13b9-5373-a2a4-d694f2381605", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_924d50b8-d587-5f14-8ffe-31b36b288d1a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(x,\\;y,\\;z>0\\) satisfy \\(x+y+z=3\\) and assume that \\(z=\\max\\{x,y,z\\}\\). Prove that \n-- \\[\n-- \\frac{x+z}{x^{2}z^{2}}-\\frac{y+z}{xz}+\\frac{x+y}{3xyz}\\ge 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the inequality problem\n\nThe source problem asks one to prove an inequality for three positive real\nnumbers whose sum is three, under the additional hypothesis that the third\nnumber is a maximum of the three.\n\nThis file only states the problem. It deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality asserted in the problem. -/\nnoncomputable def inequalityLHS (x y z : ℝ) : ℝ :=\n (x + z) / (x ^ 2 * z ^ 2) - (y + z) / (x * z) +\n (x + y) / (3 * x * y * z)\n\n/-- The hypotheses of the problem.\n\nBesides positivity and the sum condition, `z = max x (max y z)` says precisely\nthat `z` is the maximum of the three numbers `x`, `y`, and `z`. -/\nnoncomputable def Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = 3 ∧ z = max x (max y z)\n\n/-- The complete assertion to be proved: for all positive real `x`, `y`, and\n`z` with sum three, if `z` is the maximum of the three, then the displayed\nleft-hand side is nonnegative. -/\nnoncomputable def Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → 0 ≤ inequalityLHS x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "924d50b8-d587-5f14-8ffe-31b36b288d1a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "877044947f8d27e08716dea5800892fca7b6a123afeb283db81c842ee489f522", "task_path": "tasks/nmp3_924d50b8-d587-5f14-8ffe-31b36b288d1a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "924d50b8-d587-5f14-8ffe-31b36b288d1a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_92546e2e-bad6-50e5-9dbc-6772cda73f08", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that if \\(a,b,c\\) are the side lengths of a triangle (i.e. \\(a,b,c>0\\) and \\(a n`. -/\nnoncomputable def f (n : PositiveInteger) : ℕ := by\n classical\n exact Nat.findGreatest\n (fun k : ℕ => HasMonochromaticCompleteBipartite n.1 k) n.1\n\n/-- A monochromatic `K_{k,k}` inside `K_{n,n}` cannot have a part larger than\nthe whole part of the host complete bipartite graph. -/\ntheorem le_of_hasMonochromaticCompleteBipartite {n k : ℕ}\n (h : HasMonochromaticCompleteBipartite n k) : k ≤ n := by\n classical\n rcases h (fun _ _ => EdgeColor.red) with ⟨A, _B, hA, _hB, _hmono⟩\n rw [← hA]\n simpa using A.card_le_univ\n\n/-- For every positive `n`, every colouring has a monochromatic `K_{1,1}`:\nthis is just the colour of any one edge. -/\ntheorem hasMonochromaticCompleteBipartite_one {n : ℕ} (hn : 0 < n) :\n HasMonochromaticCompleteBipartite n 1 := by\n intro coloring\n let a : Fin n := ⟨0, hn⟩\n refine ⟨{a}, {a}, by simp, by simp, ?_⟩\n cases h : coloring a a with\n | red => exact Or.inl (by simp [h])\n | blue => exact Or.inr (by simp [h])\n\n/-- The definition of `f` indeed selects the largest forced size. -/\ntheorem f_isLargest_monochromaticCompleteBipartiteSize (n : PositiveInteger) :\n IsLargestMonochromaticCompleteBipartiteSize n.1 (f n) := by\n classical\n have h1 : HasMonochromaticCompleteBipartite n.1 1 :=\n hasMonochromaticCompleteBipartite_one n.2\n refine ⟨?_, ?_⟩\n · dsimp [f]\n exact Nat.findGreatest_spec n.2 h1\n · intro l hl\n dsimp [f]\n exact Nat.le_findGreatest (le_of_hasMonochromaticCompleteBipartite hl) hl\n\n/-- The non-colouring form of the requested eventual lower bound. -/\ndef Target : Prop :=\n ∀ m : PositiveInteger, ∃ N : ℕ,\n ∀ n : PositiveInteger, N ≤ n.1 → m.1 ≤ f n\n\n/-- The explicitly equivalent colouring formulation stated in the problem. -/\ndef ColoringTarget : Prop :=\n ∀ m : PositiveInteger, ∃ N : ℕ,\n ∀ n : PositiveInteger, N ≤ n.1 →\n HasMonochromaticCompleteBipartite n.1 m.1\n\n/-- Forced monochromatic balanced complete bipartite subgraphs are monotone\ndownward in the requested size: if a `K_{k,k}` is forced, then so is every\n`K_{l,l}` with `l ≤ k`, by taking subsets of the two parts. -/\ntheorem hasMonochromaticCompleteBipartite_of_le {n k l : ℕ} (hlk : l ≤ k)\n (h : HasMonochromaticCompleteBipartite n k) :\n HasMonochromaticCompleteBipartite n l := by\n intro coloring\n rcases h coloring with ⟨A, B, hA, hB, hmono⟩\n have hlkA : l ≤ A.card := by simpa [hA] using hlk\n have hlB : l ≤ B.card := by simpa [hB] using hlk\n rcases Finset.exists_subset_card_eq hlkA with ⟨A', hA'subset, hA'card⟩\n rcases Finset.exists_subset_card_eq hlB with ⟨B', hB'subset, hB'card⟩\n refine ⟨A', B', hA'card, hB'card, ?_⟩\n rcases hmono with hred | hblue\n · exact Or.inl fun a ha b hb =>\n hred a (hA'subset ha) b (hB'subset hb)\n · exact Or.inr fun a ha b hb =>\n hblue a (hA'subset ha) b (hB'subset hb)\n\n/-- If `m ≤ f n`, then `m` itself is a forced monochromatic size. -/\ntheorem hasMonochromaticCompleteBipartite_of_le_f {m : ℕ} {n : PositiveInteger}\n (hm : m ≤ f n) : HasMonochromaticCompleteBipartite n.1 m :=\n hasMonochromaticCompleteBipartite_of_le hm\n (f_isLargest_monochromaticCompleteBipartiteSize n).1\n\n/-- If `m` is a forced monochromatic size, then it is at most `f n`. -/\ntheorem le_f_of_hasMonochromaticCompleteBipartite {m : ℕ} {n : PositiveInteger}\n (hm : HasMonochromaticCompleteBipartite n.1 m) : m ≤ f n :=\n (f_isLargest_monochromaticCompleteBipartiteSize n).2 m hm\n\n/-- The `f n ≥ m` formulation and the equivalent explicitly colouring-based\nformulation stated in the source problem are indeed equivalent. -/\ntheorem target_iff_coloringTarget : Target ↔ ColoringTarget := by\n constructor\n · intro htarget m\n rcases htarget m with ⟨N, hN⟩\n refine ⟨N, ?_⟩\n intro n hn\n exact hasMonochromaticCompleteBipartite_of_le_f (hN n hn)\n · intro hcoloring m\n rcases hcoloring m with ⟨N, hN⟩\n refine ⟨N, ?_⟩\n intro n hn\n exact le_f_of_hasMonochromaticCompleteBipartite (hN n hn)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "925bdac4-bc2d-5b19-ba64-25e2d0d790f2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1b6782f425b593af55d7f510327725a9cfe57e258f3ecce15155bc0ffa148957", "task_path": "tasks/nmp3_925bdac4-bc2d-5b19-ba64-25e2d0d790f2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "925bdac4-bc2d-5b19-ba64-25e2d0d790f2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_926f9894-31ab-5202-a285-cbcac81d2d39", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In an acute triangle $BDE$, let $\\omega$ be its circumcircle. Let $C$ be the intersection of the two tangents to $\\omega$ at $D$ and $E$. Choose points $G$ on the extension of $BD$ beyond $D$ and $F$ on the extension of $BE$ beyond $E$, both lying outside $\\omega$, such that the line $GF$ passes through $C$. Prove that the intersection point of the lines $DF$ and $GE$ lies on $\\omega$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Simplex\nimport Mathlib.Geometry.Euclidean.Sphere.Tangent\n\nnoncomputable section\n\nopen scoped Affine Real EuclideanGeometry\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, represented as the real Euclidean space on two coordinates. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `AcuteTriangle B D E` records that `B`, `D`, and `E` are noncollinear and that\neach of the three interior angles of triangle `BDE` is strictly acute. -/\ndef AcuteTriangle (B D E : Plane) : Prop :=\n ¬ Collinear ℝ ({B, D, E} : Set Plane) ∧\n ∠ D B E < Real.pi / 2 ∧\n ∠ B D E < Real.pi / 2 ∧\n ∠ B E D < Real.pi / 2\n\n/-- A sphere is the circumcircle of `BDE` when it contains all three vertices and is\nthe unique sphere doing so. -/\ndef IsCircumcircle (B D E : Plane) (ω : EuclideanGeometry.Sphere Plane) : Prop :=\n B ∈ ω ∧ D ∈ ω ∧ E ∈ ω ∧\n ∀ ω' : EuclideanGeometry.Sphere Plane,\n B ∈ ω' → D ∈ ω' → E ∈ ω' → ω' = ω\n\n/-- The line through `P` and `X` is the tangent line to `ω` at `P`. -/\ndef IsTangentLineAt (ω : EuclideanGeometry.Sphere Plane) (P X : Plane) : Prop :=\n P ∈ ω ∧ X ≠ P ∧ line[ℝ, P, X] = ω.orthRadius P\n\n/-- `C` is the (unique) intersection of the two tangents to `ω` at `D` and at `E`. -/\ndef IsTangentIntersection (ω : EuclideanGeometry.Sphere Plane) (D E C : Plane) : Prop :=\n IsTangentLineAt ω D C ∧ IsTangentLineAt ω E C ∧\n ∀ C' : Plane,\n IsTangentLineAt ω D C' → IsTangentLineAt ω E C' → C' = C\n\n/-- `X` lies on the extension of the ray from `A` through `B`, beyond `B`. -/\ndef OnExtensionBeyond (A B X : Plane) : Prop :=\n ∃ t : ℝ, 1 < t ∧ X = (1 - t) • A + t • B\n\n/-- A point is strictly outside a circle when its distance from the center is strictly\nlarger than the radius. -/\ndef OutsideSphere (ω : EuclideanGeometry.Sphere Plane) (X : Plane) : Prop :=\n ω.radius < dist X ω.center\n\n/-- `X` is the unique intersection point of the lines through `A,B` and through `C,D`. -/\ndef IsUniqueLineIntersection (A B C D X : Plane) : Prop :=\n X ∈ line[ℝ, A, B] ∧ X ∈ line[ℝ, C, D] ∧\n ∀ Y : Plane, Y ∈ line[ℝ, A, B] → Y ∈ line[ℝ, C, D] → Y = X\n\n/-- The lines through `A,B` and through `C,D` have a unique intersection point, and\nthat point lies on `ω`. -/\ndef IntersectionOfLinesOnCircle (ω : EuclideanGeometry.Sphere Plane)\n (A B C D : Plane) : Prop :=\n ∃ X : Plane, IsUniqueLineIntersection A B C D X ∧ X ∈ ω\n\n/-- The full statement: in every acute triangle `BDE` with circumcircle `ω`, with `C`\nthe intersection of the tangents at `D` and `E`, and with `G` and `F` chosen on the\nextension of `BD` beyond `D` and of `BE` beyond `E`, respectively, both outside `ω`,\nsuch that `GF` passes through `C`, the intersection of `DF` and `GE` lies on `ω`. -/\ndef Target : Prop :=\n ∀ (B D E : Plane) (ω : EuclideanGeometry.Sphere Plane) (C G F : Plane),\n AcuteTriangle B D E →\n IsCircumcircle B D E ω →\n IsTangentIntersection ω D E C →\n OnExtensionBeyond B D G →\n OnExtensionBeyond B E F →\n OutsideSphere ω G →\n OutsideSphere ω F →\n C ∈ line[ℝ, G, F] →\n IntersectionOfLinesOnCircle ω D F G E\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "926f9894-31ab-5202-a285-cbcac81d2d39", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5cee9cc277a66644ba306f3ab0f044f2b437749b48c5a48a69001b11d1baf79b", "task_path": "tasks/nmp3_926f9894-31ab-5202-a285-cbcac81d2d39", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "926f9894-31ab-5202-a285-cbcac81d2d39", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_927803df-3162-5cba-8608-165cbb86eafb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Every integer is colored either black or white. Prove that for at least one of the colors (black or white), every even integer can be expressed in the form \n-- \\[\n-- a+b-c-d,\n-- \\] \n-- where the four integers \\(a,b,c,d\\) all have that same color.\nimport Mathlib.Data.Int.Basic\n\n/-!\nFormalization of the problem statement.\n\nThe integers are colored black or white by a total function into a two-element\ncolor type. An even integer is one of the form `2 * k` for an integer `k`.\n-/\n\nnamespace Problem\n\n/-- The two colors with which every integer is colored. -/\ninductive Color : Type\n | black : Color\n | white : Color\n deriving DecidableEq, Repr\n\n/-- An integer `n` is even when it is `2` times an integer. -/\ndef IsEvenInteger (n : Int) : Prop :=\n ∃ k : Int, n = 2 * k\n\n/-- The integer `n` has a representation `a + b - c - d` in which all four\nsummands have the specified color under the coloring. -/\ndef FourSameColorExpression\n (coloring : Int → Color) (color : Color) (n : Int) : Prop :=\n ∃ a b c d : Int,\n coloring a = color ∧\n coloring b = color ∧\n coloring c = color ∧\n coloring d = color ∧\n n = a + b - c - d\n\n/-- Every even integer is expressible as `a + b - c - d` using four integers\nof the specified color. -/\ndef EveryEvenIntegerExpressibleInColor\n (coloring : Int → Color) (color : Color) : Prop :=\n ∀ n : Int, IsEvenInteger n → FourSameColorExpression coloring color n\n\n/-- The assertion of the problem: for every black/white coloring of the\nintegers, at least one of the two colors expresses every even integer as\n`a + b - c - d` using four integers all of that color. -/\ndef Target : Prop :=\n ∀ coloring : Int → Color,\n ∃ color : Color, EveryEvenIntegerExpressibleInColor coloring color\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "927803df-3162-5cba-8608-165cbb86eafb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "aac49595548472b59aeb76be4e0588e2104d4c08647056f6869b661869903427", "task_path": "tasks/nmp3_927803df-3162-5cba-8608-165cbb86eafb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "927803df-3162-5cba-8608-165cbb86eafb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_92eaec0e-fc67-5bb6-b457-db5441dac36c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy \n-- \\[\n-- \\frac1{\\sqrt a}+\\frac1{\\sqrt b}+\\frac1{\\sqrt c}\\le 3.\n-- \\]\n-- Prove that \n-- \\[\n-- \\frac1{3a+b}+\\frac1{3b+c}+\\frac1{3c+a}\\le\\frac34.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility conditions on the positive real parameters `a`, `b`, and `c`:\nthe reciprocals of their principal real square roots sum to at most `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n (1 / Real.sqrt a + 1 / Real.sqrt b + 1 / Real.sqrt c ≤ (3 : ℝ))\n\n/-- The asserted conclusion: the sum of the three displayed reciprocal linear forms\nis at most `3 / 4`. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n 1 / ((3 : ℝ) * a + b) +\n 1 / ((3 : ℝ) * b + c) +\n 1 / ((3 : ℝ) * c + a) ≤ (3 : ℝ) / 4\n\n/-- The complete statement of the problem: for all positive reals `a`, `b`, `c`\nsatisfying the square-root reciprocal hypothesis, the displayed sum is at most\n`3 / 4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "92eaec0e-fc67-5bb6-b457-db5441dac36c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "53c20c9fa305205227fbab0743b8f31c93dbaa5f518434dd79788719c6921cee", "task_path": "tasks/nmp3_92eaec0e-fc67-5bb6-b457-db5441dac36c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "92eaec0e-fc67-5bb6-b457-db5441dac36c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_934f9d91-de70-5438-b786-e8d6c6d07907", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there is no function $f:\\mathbb{R}^{+}\\to\\mathbb{R}^{+}$ satisfying \n-- \\[\n-- f\\bigl(f(x)+y\\bigr)=f(x)+3x+y\\,f(y)\n-- \\] \n-- for all positive real numbers $x$ and $y$ (where $\\mathbb{R}^{+}=\\{t\\in\\mathbb{R}\\mid t>0\\}$).\nimport Mathlib\n\nnamespace Problem\n\n/-- The positive real numbers, as specified in the problem:\n`ℝ⁺ = {t ∈ ℝ | t > 0}`. -/\nabbrev PositiveReal : Type := {t : ℝ // 0 < t}\n\n/-- The equation asserted in the problem, for a function\n`f : ℝ⁺ → ℝ⁺`. The sum `f x + y` is viewed as a positive real using\nthe fact that both summands are positive. The right-hand side is\nevaluated in `ℝ` so that `3 * x` and `y * f y` are ordinary real\nmultiplication and addition. -/\ndef SatisfiesEquation (f : PositiveReal → PositiveReal) : Prop :=\n ∀ x y : PositiveReal,\n (f ⟨(f x : ℝ) + (y : ℝ), add_pos (f x).2 y.2⟩ : ℝ) =\n (f x : ℝ) + 3 * (x : ℝ) + (y : ℝ) * (f y : ℝ)\n\n/-- There is no function `f : ℝ⁺ → ℝ⁺` satisfying the displayed equation\nfor all positive real `x` and `y`. -/\ndef Target : Prop :=\n ¬ ∃ f : PositiveReal → PositiveReal, SatisfiesEquation f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "934f9d91-de70-5438-b786-e8d6c6d07907", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6c643f189753923cf29bbc06d7e6d23e4ca591ee677b8ac5922ac862ebb7a7a4", "task_path": "tasks/nmp3_934f9d91-de70-5438-b786-e8d6c6d07907", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "934f9d91-de70-5438-b786-e8d6c6d07907", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_938430ac-8520-53bf-871f-13091d99e54f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers \\(a,\\;b,\\;c\\), prove that \n-- \\[\n-- \\frac{a+b+2c}{(2a+c)^2}+\\frac{b+c+2a}{(2b+a)^2}+\\frac{c+a+2b}{(2c+b)^2}\\ge\\frac{4}{a+b+c}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the three-variable real inequality\n\nThe original problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe stated rational inequality. The assertion is recorded as a proposition-valued\ndefinition; no proof is supplied at the statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, `c`,\n`(a+b+2c)/(2a+c)^2 + (b+c+2a)/(2b+a)^2 + (c+a+2b)/(2c+b)^2 ≥ 4/(a+b+c)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n (a + b + 2 * c) / (2 * a + c) ^ 2 +\n (b + c + 2 * a) / (2 * b + a) ^ 2 +\n (c + a + 2 * b) / (2 * c + b) ^ 2 ≥\n 4 / (a + b + c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "938430ac-8520-53bf-871f-13091d99e54f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ca215866be4cb784cfd129099ad54c629e5a92ea752acbe95014671abc219e03", "task_path": "tasks/nmp3_938430ac-8520-53bf-871f-13091d99e54f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "938430ac-8520-53bf-871f-13091d99e54f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_93ac92f8-3e8a-5f87-8e45-995e3192d69b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers such that $a+b+c=4$. Prove that \n-- $$a^3b+b^3c+c^3a\\le 27\\,.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion: for all positive real numbers `a`, `b`, and `c` with\n`a + b + c = 4`, one has `a ^ 3 * b + b ^ 3 * c + c ^ 3 * a ≤ 27`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 4 →\n a ^ 3 * b + b ^ 3 * c + c ^ 3 * a ≤ (27 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "93ac92f8-3e8a-5f87-8e45-995e3192d69b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "562a76dc751861359bf0efed4a5d0877f7800ec246b67a63f66aef74a721f2bd", "task_path": "tasks/nmp3_93ac92f8-3e8a-5f87-8e45-995e3192d69b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "93ac92f8-3e8a-5f87-8e45-995e3192d69b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_93d6eac2-f896-5de2-9f91-2daf7aad6d19", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,n$ be positive integers with $a>b$ such that $a^{2021}\\mid n$, $b^{2021}\\mid n$, and $2022\\mid(a-b)$. Prove that there exists a subset $T$ of the set of positive divisors of $n$ whose sum is divisible by $2022$ but not divisible by $2022^{2}$.\nimport Mathlib.Data.Finset.NatDivisors\n\n/-!\n# Formal statement for the subset-of-divisors problem\n\nThe original problem asks for a proof of an existence statement about a subset of\nthe positive divisors of a positive natural number `n`.\n-/\n\nnamespace Problem\n\n/-- The finite set of positive divisors of `n`.\n\nMathlib's `Nat.divisors n` is the finset of natural numbers in `[1, n]` that\ndivide `n`; in particular it consists exactly of the positive divisors when\n`n > 0`.\n-/\ndef PositiveDivisors (n : ℕ) : Finset ℕ :=\n n.divisors\n\n/-- The full assertion of the problem.\n\nFor all positive integers `a`, `b`, and `n` with `a > b`, if\n`a ^ 2021 ∣ n`, `b ^ 2021 ∣ n`, and `2022 ∣ (a - b)`, then there is a finite\nsubset `T` of the positive divisors of `n` such that the sum of the elements of\n`T` is divisible by `2022` but not by `2022 ^ 2`.\n-/\ndef Target : Prop :=\n ∀ (a : ℕ) (b : ℕ) (n : ℕ),\n 0 < a →\n 0 < b →\n 0 < n →\n b < a →\n a ^ 2021 ∣ n →\n b ^ 2021 ∣ n →\n 2022 ∣ (a - b) →\n ∃ T : Finset ℕ,\n T ⊆ PositiveDivisors n ∧\n 2022 ∣ T.sum (fun d : ℕ => d) ∧\n ¬ (2022 ^ 2 ∣ T.sum (fun d : ℕ => d))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "93d6eac2-f896-5de2-9f91-2daf7aad6d19", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "eaa9513b9a11dd43dcf2359431aa9b53724df866fe569e4c1d912f755da07dad", "task_path": "tasks/nmp3_93d6eac2-f896-5de2-9f91-2daf7aad6d19", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "93d6eac2-f896-5de2-9f91-2daf7aad6d19", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_93df0711-b8ba-55ea-99b0-0d4546383975", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=6$. Prove that \n-- \\[\n-- \\frac{a^2-4}{4a^2-9a+6}+\\frac{b^2-4}{4b^2-9b+6}+\\frac{c^2-4}{4c^2-9c+6}\\le 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe problem asks to prove an inequality over positive real numbers\n`a`, `b`, and `c` whose sum is `6`.\n\nWe separate the quadratic denominator and the rational summand so that the\ncorrespondence with the source expression is explicit. Lean's real division is\ntotal; for the positive parameters appearing in the target, the denominator is\nin fact strictly positive (see `Problem.denominator_pos). Thus no additional\nnonzero-denominator hypothesis is needed for a faithful reading of the rational\nexpressions on the original domain.\n-/\n\nnamespace Problem\n\n/-- The quadratic expression `4*x^2 - 9*x + 6` appearing in every denominator. -/\ndef denominator (x : ℝ) : ℝ :=\n 4 * x ^ 2 - 9 * x + 6\n\n/-- One summand `(x^2 - 4) / (4*x^2 - 9*x + 6)` of the left-hand side. -/\nnoncomputable def summand (x : ℝ) : ℝ :=\n (x ^ 2 - 4) / denominator x\n\n/-- The complete left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n summand a + summand b + summand c\n\n/-- For every positive real `x`, the denominator is strictly positive. -/\nlemma denominator_pos (x : ℝ) : 0 < denominator x := by\n unfold denominator\n nlinarith [sq_nonneg (x - 9 / 8)]\n\n/-- The assertion requested by the problem: for all positive real numbers\n`a`, `b`, and `c` with `a + b + c = 6`, the displayed sum is at most zero. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a + b + c = 6 → lhs a b c ≤ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "93df0711-b8ba-55ea-99b0-0d4546383975", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9afc78b1781d882313dc8ede8d21029a225b187e57192e04c8cc52fc47127e41", "task_path": "tasks/nmp3_93df0711-b8ba-55ea-99b0-0d4546383975", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "93df0711-b8ba-55ea-99b0-0d4546383975", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_93f20e44-a8eb-5555-a174-51926f79f11a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given \\(a,b,c\\in\\mathbb{R}^+\\), prove that \n-- \\[\n-- \\frac{(a+b)^2}{2c^2+3ab}+\\frac{(b+c)^2}{2a^2+3bc}+\\frac{(c+a)^2}{2b^2+3ca}\\ge\\frac73.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThis file formalizes the inequality stated in `problem.md`. It deliberately\nonly declares the target proposition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The inequality from the problem, for strictly positive real `a`, `b`, `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (a + b) ^ 2 / ((2 : ℝ) * c ^ 2 + 3 * a * b) +\n (b + c) ^ 2 / ((2 : ℝ) * a ^ 2 + 3 * b * c) +\n (c + a) ^ 2 / ((2 : ℝ) * b ^ 2 + 3 * c * a) ≥\n (7 : ℝ) / 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "93f20e44-a8eb-5555-a174-51926f79f11a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "21a3256a1d7cd6bee8c1dd46183b6d623c6d55c8bc6d4b9a9550680eaf30dc69", "task_path": "tasks/nmp3_93f20e44-a8eb-5555-a174-51926f79f11a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "93f20e44-a8eb-5555-a174-51926f79f11a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_93f98bb6-8d2f-55e5-8cfa-e5fc581f5245", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For every natural number $n$, prove that there exists a circle in the plane whose circumference contains exactly $n$ points with integer coordinates (lattice points).\nimport Mathlib.Basic.Real.Basic\nimport Mathlib.Data.Set.Card\n\n/-!\n# Statement: circles with prescribed numbers of lattice points\n\nFor every natural number `n`, there is a circle in the real Euclidean plane\nwhose circumference contains exactly `n` points with integer coordinates.\n\nThe plane is represented as `ℝ × ℝ`. A lattice point is represented by a\npair `z : ℤ × ℤ`, embedded into the plane by `latticePointToPlane`.\n-/\n\nnamespace Problem\n\n/-- The point of the real plane corresponding to a pair of integer coordinates. -/\ndef latticePointToPlane (z : ℤ × ℤ) : ℝ × ℝ :=\n ((z.1 : ℝ), (z.2 : ℝ))\n\n/-- A circle in the real plane, specified by its center and a positive radius. -/\nstructure Circle where\n center : ℝ × ℝ\n radius : ℝ\n radius_pos : 0 < radius\n\nnamespace Circle\n\n/-- The circumference of a circle: the set of plane points at the given radius\nfrom its center, written using squared Euclidean distance. -/\ndef circumference (C : Circle) : Set (ℝ × ℝ) :=\n {p | (p.1 - C.center.1) ^ 2 + (p.2 - C.center.2) ^ 2 = C.radius ^ 2}\n\n/-- The lattice points (integer-coordinate points) lying on the circumference. -/\ndef latticePoints (C : Circle) : Set (ℤ × ℤ) :=\n {z | latticePointToPlane z ∈ C.circumference}\n\n/-- The circumference contains exactly `n` lattice points.\n\nFiniteness is stated explicitly so that `Set.ncard` is used only on a finite\nset; this distinguishes an empty set (`n = 0`) from an infinite set. -/\ndef HasExactlyNLatticePoints (C : Circle) (n : ℕ) : Prop :=\n C.latticePoints.Finite ∧ C.latticePoints.ncard = n\n\nend Circle\n\n/-- For every natural number `n`, there exists a circle in the plane whose\ncircumference contains exactly `n` points with integer coordinates. -/\ndef Target : Prop :=\n ∀ n : ℕ, ∃ C : Circle, C.HasExactlyNLatticePoints n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "93f98bb6-8d2f-55e5-8cfa-e5fc581f5245", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b3d2f8ed52798d982226240da7c121433c158c5e29ecc73186ed37cfd382e47f", "task_path": "tasks/nmp3_93f98bb6-8d2f-55e5-8cfa-e5fc581f5245", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "93f98bb6-8d2f-55e5-8cfa-e5fc581f5245", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_94153b27-5078-5e2a-a6ca-81fce114c193", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $n>3$ points in the plane such that no three of the points are collinear, prove that there exists a circle passing through at least three of the given points and containing none of the other $n$ points in its interior.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Data.Finset.Basic\nimport Mathlib.Geometry.Euclidean.Sphere.Basic\n\n/-!\n# Formal statement: a circle through three points that avoids the interior\n\nThe problem is stated for `n > 3` distinct points in the Euclidean plane with no\nthree collinear. We model the finite set of points as a `Finset` of cardinality\n`n` in `EuclideanSpace ℝ (Fin 2)`. A circle is represented by\n`EuclideanGeometry.Sphere Plane` together with the condition that its radius is\npositive. The interior of the circle is the open metric ball with the same\ncenter and radius.\n\nAll declarations in this file are statements/definitions only; no proof of the\ngeometric theorem is included.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real normed vector space of\ndimension two. As a type it is also an affine space over itself. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- No three distinct points of the finite set `points` are collinear. -/\ndef NoThreeCollinear (points : Finset Plane) : Prop :=\n ∀ x ∈ points, ∀ y ∈ points, ∀ z ∈ points,\n x ≠ y → x ≠ z → y ≠ z →\n ¬ Collinear ℝ ({x, y, z} : Set Plane)\n\n/-- The circle passes through at least three points of `points`. A witness is a\nfinite subset of at least three given points all lying on the circle. -/\ndef PassesThroughAtLeastThree (points : Finset Plane)\n (circle : EuclideanGeometry.Sphere Plane) : Prop :=\n ∃ marked : Finset Plane,\n marked ⊆ points ∧ 3 ≤ marked.card ∧\n ∀ x ∈ marked, x ∈ (circle : Set Plane)\n\n/-- No given point lies in the open disk bounded by the circle. Points on the\ncircle itself are not in its interior. -/\ndef AvoidsInterior (points : Finset Plane)\n (circle : EuclideanGeometry.Sphere Plane) : Prop :=\n ∀ x ∈ points, x ∉ Metric.ball circle.center circle.radius\n\n/-- A circle which is admissible for the problem: it is a nondegenerate circle\n(positive radius), passes through at least three of the given points, and has no\ngiven point in its interior. -/\ndef IsAdmissibleCircle (points : Finset Plane)\n (circle : EuclideanGeometry.Sphere Plane) : Prop :=\n 0 < circle.radius ∧\n PassesThroughAtLeastThree points circle ∧\n AvoidsInterior points circle\n\n/-- The formalized assertion: for every `n > 3` and every set of exactly `n`\nplane points with no three collinear, there exists an admissible circle. -/\ndef Target : Prop :=\n ∀ n : ℕ, 3 < n →\n ∀ points : Finset Plane,\n points.card = n →\n NoThreeCollinear points →\n ∃ circle : EuclideanGeometry.Sphere Plane,\n IsAdmissibleCircle points circle\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94153b27-5078-5e2a-a6ca-81fce114c193", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5bc7a9dc41fe706d5d833907ec527a0074ed3dc9904ad3c20afdff90d60c8289", "task_path": "tasks/nmp3_94153b27-5078-5e2a-a6ca-81fce114c193", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94153b27-5078-5e2a-a6ca-81fce114c193", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_94748585-5246-5bdd-bbf3-f24add4bdc89", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ with $x^2+y^2+z^2=3$. Prove that \n-- \\[\n-- 4(x+y+z)\\;\\ge\\;(y+z^2)(1+x)+(z+x^2)(1+y)+(1+z)(x+y^2)\\, .\n-- \\]\nimport Mathlib.Data.Real.Basic\n\n/-!\n# Formal statement: a three-variable real inequality\n\nThe problem asks, for positive real numbers `x`, `y`, and `z` satisfying\n`x ^ 2 + y ^ 2 + z ^ 2 = 3`, to prove the stated inequality.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved: for all positive real `x`, `y`, `z` whose\nsquares sum to `3`, the left-hand side `4 * (x + y + z)` is at least the\nthree-term right-hand side from the problem statement. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x ^ 2 + y ^ 2 + z ^ 2 = 3 →\n 4 * (x + y + z) ≥\n (y + z ^ 2) * (1 + x) +\n (z + x ^ 2) * (1 + y) +\n (1 + z) * (x + y ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94748585-5246-5bdd-bbf3-f24add4bdc89", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4b39bc8566196759687258006e0d81cc8869cc008bbeedc0031a5e13d874b2f2", "task_path": "tasks/nmp3_94748585-5246-5bdd-bbf3-f24add4bdc89", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94748585-5246-5bdd-bbf3-f24add4bdc89", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_94a04833-97ee-5fbb-8839-c3c9444bd079", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $ab+bc+ca=1$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{(a^{2}+1)^{2}}{b^{2}+c^{2}}\\ge 8.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the cyclic inequality problem\n\nThe source problem asks, for nonnegative real numbers `a`, `b`, `c` with\n`ab + bc + ca = 1`, to prove\n\n`∑_cyc (a^2 + 1)^2 / (b^2 + c^2) ≥ 8`.\n\nThe cyclic sum has the three terms obtained by cycling `(a, b, c)`.\nThe main assertion is packaged as `Problem.Target`; no proof is supplied here.\n-/\n\nnamespace Problem\n\n/-- The summand `(a^2 + 1)^2 / (b^2 + c^2)` appearing in the cyclic sum. -/\nnoncomputable def CyclicTerm (a b c : ℝ) : ℝ :=\n (a ^ 2 + 1) ^ 2 / (b ^ 2 + c ^ 2)\n\n/-- The three-term cyclic sum, with terms for `(a, b, c)`, `(b, c, a)`, and\n`(c, a, b)`. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n CyclicTerm a b c + CyclicTerm b c a + CyclicTerm c a b\n\n/-- The full assertion from the problem: for all nonnegative real `a`, `b`, `c`\nthe constraint `ab + bc + ca = 1` implies the cyclic sum is at least `8`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n a * b + b * c + c * a = 1 →\n CyclicSum a b c ≥ 8\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94a04833-97ee-5fbb-8839-c3c9444bd079", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3ffe132a6024daa85541726c72f2b87f2a7471e6fba6f22c91a57646778d5f13", "task_path": "tasks/nmp3_94a04833-97ee-5fbb-8839-c3c9444bd079", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94a04833-97ee-5fbb-8839-c3c9444bd079", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_94a12875-8381-5681-9964-9c50b93ba33d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The infinite sequence $a_1,a_2,a_3,\\ldots$ of distinct positive integers is defined by $a_1=1$, and for each $n\\ge2$, $a_n$ is the smallest positive integer not equal to any of $a_1,a_2,\\dots,a_{n-1}$ such that the nested radical \n-- \\[\n-- \\sqrt{a_n+\\sqrt{a_{n-1}+\\cdots+\\sqrt{a_2+\\sqrt{a_1}}}}\n-- \\]\n-- is an integer. Prove that every positive integer appears in the sequence $(a_n)_{n\\ge1}$.\nimport Mathlib\n\n/-!\n# Formal statement for the nested-radical sequence problem\n\nThe source problem introduces a sequence indexed by the positive integers.\nWe represent such a sequence as a function `ℕ+ → ℕ`. The nested radical\n`R_n` is defined recursively by `R_1 = sqrt (a_1)` and\n`R_{n+1} = sqrt (a_{n+1} + R_n)`. Thus `nestedRadical a n` is the radical\nformed from the first `n` terms of `a`.\n-/\n\nnamespace Problem\n\n/-- The nested radical formed from the first `n` terms of the sequence `a`.\nFor `n = 0` it is defined to be `0`; for `n ≥ 1`,\n`nestedRadical a n = sqrt (a_n + sqrt (a_{n-1} + ... + sqrt (a_1)))`. -/\nnoncomputable def nestedRadical (a : ℕ+ → ℕ) : ℕ → ℝ\n | 0 => 0\n | k + 1 =>\n Real.sqrt ((a ⟨k + 1, Nat.succ_pos k⟩ : ℝ) + nestedRadical a k)\n\n/-- The value of the nested radical after adjoining a candidate value `m`\nin the `n`-th position, while keeping the first `n - 1` terms of `a`.\nThis is the expression required to be an integer at stage `n`. -/\nnoncomputable def radicalWithCandidate (a : ℕ+ → ℕ) (n : ℕ+) (m : ℕ) : ℝ :=\n Real.sqrt ((m : ℝ) + nestedRadical a ((n : ℕ) - 1))\n\n/-- The nested radical after adjoining the candidate `m` at position `n`\nhas an integer value. -/\ndef IsIntegerRadicalWith (a : ℕ+ → ℕ) (n : ℕ+) (m : ℕ) : Prop :=\n ∃ z : ℤ, radicalWithCandidate a n m = (z : ℝ)\n\n/-- The positive integer `m` has not occurred among the terms strictly\nbefore the positive index `n`. -/\ndef NotEqualToPrevious (a : ℕ+ → ℕ) (n : ℕ+) (m : ℕ) : Prop :=\n ∀ i : ℕ+, i < n → a i ≠ m\n\n/-- A positive integer `m` is eligible at stage `n` when it has not occurred\namong the earlier terms and makes the nested radical an integer. -/\ndef IsEligible (a : ℕ+ → ℕ) (n : ℕ+) (m : ℕ) : Prop :=\n 0 < m ∧\n NotEqualToPrevious a n m ∧\n IsIntegerRadicalWith a n m\n\n/-- The term `a n` is the smallest positive integer which has not occurred\nbefore and which makes the nested radical at stage `n` an integer. -/\ndef IsSmallestEligible (a : ℕ+ → ℕ) (n : ℕ+) : Prop :=\n IsEligible a n (a n) ∧\n ∀ m : ℕ, IsEligible a n m → a n ≤ m\n\n/-- The defining predicate for the sequence in the problem: all terms are\npositive and distinct, `a_1 = 1`, and for every `n ≥ 2` the term `a_n` is\nchosen by the stated minimality rule. -/\ndef IsNestedRadicalSequence (a : ℕ+ → ℕ) : Prop :=\n a 1 = 1 ∧\n Function.Injective a ∧\n (∀ n : ℕ+, 0 < a n) ∧\n (∀ n : ℕ+, (2 : ℕ+) ≤ n → IsSmallestEligible a n)\n\n/-- Every positive integer occurs somewhere in the sequence. -/\ndef EveryPositiveIntegerAppears (a : ℕ+ → ℕ) : Prop :=\n ∀ m : ℕ, 0 < m → ∃ n : ℕ+, a n = m\n\n/-- The assertion to be proved: for every sequence satisfying the recursive\ndescription in the problem, every positive integer appears among its terms. -/\ndef Target : Prop :=\n ∀ a : ℕ+ → ℕ, IsNestedRadicalSequence a → EveryPositiveIntegerAppears a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94a12875-8381-5681-9964-9c50b93ba33d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "24a2572e4d7966e020c4b41f2fb50d3bfc317f6ee214f84d86e5f7af6b67642a", "task_path": "tasks/nmp3_94a12875-8381-5681-9964-9c50b93ba33d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94a12875-8381-5681-9964-9c50b93ba33d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_94a764b2-6d1a-5367-90a5-1e20aa5af2ee", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\ge0$. Prove that \n-- \\[\n-- a^4+b^4+c^4+d^4+\\sum_{\\text{cyc}}a^3(b+c+d)+20abcd\\ge 3\\sum_{\\text{cyc}}a^2(bc+bd+cd).\n-- \\]\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThis file states the inequality from the problem. It deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum of `x^3 * (sum of the other three variables)` over the\nordered quadruple `(a,b,c,d)`. The cyclic permutations are\n`(a,b,c,d)`, `(b,c,d,a)`, `(c,d,a,b)`, and `(d,a,b,c)`. -/\ndef cyclicCubicSum (a b c d : ℝ) : ℝ :=\n a ^ 3 * (b + c + d) +\n b ^ 3 * (c + d + a) +\n c ^ 3 * (d + a + b) +\n d ^ 3 * (a + b + c)\n\n/-- The cyclic sum of `x^2 * (sum of the pairwise products of the other three\nvariables)` over the ordered quadruple `(a,b,c,d)`. The cyclic permutations are\n`(a,b,c,d)`, `(b,c,d,a)`, `(c,d,a,b)`, and `(d,a,b,c)`. -/\ndef cyclicQuadraticPairSum (a b c d : ℝ) : ℝ :=\n a ^ 2 * (b * c + b * d + c * d) +\n b ^ 2 * (c * d + c * a + d * a) +\n c ^ 2 * (d * a + d * b + a * b) +\n d ^ 2 * (a * b + a * c + b * c)\n\n/-- The assertion of the problem: for all nonnegative real numbers `a,b,c,d`,\n`a^4 + b^4 + c^4 + d^4 + sum_cyc a^3(b+c+d) + 20abcd` is at least\n`3 * sum_cyc a^2(bc+bd+cd)`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n 0 ≤ d →\n a ^ 4 + b ^ 4 + c ^ 4 + d ^ 4 +\n cyclicCubicSum a b c d + 20 * a * b * c * d ≥\n 3 * cyclicQuadraticPairSum a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94a764b2-6d1a-5367-90a5-1e20aa5af2ee", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bb715ce0579d87ee02b718890f40d5b6a25979fc2a2553a40ecf1a82c9dfe7ba", "task_path": "tasks/nmp3_94a764b2-6d1a-5367-90a5-1e20aa5af2ee", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94a764b2-6d1a-5367-90a5-1e20aa5af2ee", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_94c67cfa-b089-5f0f-a814-1a011d002266", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(x_n)_{n\\ge1}$ be a sequence of positive integers such that for every pair of positive integers $m,n$ we have $x_{mn}\\neq x_{m(n+1)}$. Prove that there exists a positive integer $i$ with $x_i\\ge2017$.\nimport Mathlib.Data.Nat.Basic\n\n/-!\n# Formalization of the 2017 sequence problem\n\nThe original problem indexes a sequence by the positive integers and takes values in\nthe positive integers. We represent it as a function `ℕ → ℕ` together with an\nexplicit positivity hypothesis on positive indices. All indexing and arithmetic in\nthe problem are natural-number operations.\n-/\n\nnamespace Problem\n\n/-- The sequence takes positive-integer values at every positive index. -/\ndef IsPositiveIntegerSequence (x : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, 0 < n → 0 < x n\n\n/-- For every pair of positive integers `m` and `n`, the terms at `m * n` and\n`m * (n + 1)` are distinct. -/\ndef ScalingAdjacentTermsDistinct (x : ℕ → ℕ) : Prop :=\n ∀ m n : ℕ, 0 < m → 0 < n → x (m * n) ≠ x (m * (n + 1))\n\n/-- The asserted conclusion: some positive index has value at least `2017`. -/\ndef HasTermAtLeast2017 (x : ℕ → ℕ) : Prop :=\n ∃ i : ℕ, 0 < i ∧ 2017 ≤ x i\n\n/-- The complete proposition stated by the problem. -/\ndef Target : Prop :=\n ∀ x : ℕ → ℕ,\n IsPositiveIntegerSequence x →\n ScalingAdjacentTermsDistinct x →\n HasTermAtLeast2017 x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94c67cfa-b089-5f0f-a814-1a011d002266", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7c2d950982ca53337aff81bf0bc6b6c1f1df09921aacc7f2061dcc8c52823c81", "task_path": "tasks/nmp3_94c67cfa-b089-5f0f-a814-1a011d002266", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94c67cfa-b089-5f0f-a814-1a011d002266", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_94e476ad-1e26-5a59-b7a9-b30bcdc6ae5a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all real numbers $a,b,c$ the following inequality holds:\n-- \\[\n-- \\sum_{\\sym}a^6 \\;+\\; 10\\sum_{\\sym}a^4b^2 \\;+\\; 5\\sum_{\\sym}a^4bc \n-- \\;\\ge\\; 6\\sum_{\\sym}a^5b \\;+\\; 5\\sum_{\\sym}a^3b^3 \\;+\\; 5\\sum_{\\sym}a^3b^2c,\n-- \\]\n-- where $\\sum_{\\sym}$ denotes the sum over all distinct permutations of the indices (e.g. $\\sum_{\\sym}a^4b^2=a^4b^2+a^4c^2+b^4a^2+b^4c^2+c^4a^2+c^4b^2$, etc.).\nimport Mathlib\n\n/-!\n# Symmetric-sum inequality in three real variables\n\nThis file formalizes the statement of the problem. The source defines\n`∑_sym` as the sum over all distinct permutations of the indices. Thus for\nthree variables we sum over the six distinct permutations of the argument\npositions. For a monomial with repeated exponents, different index\npermutations may print the same monomial; those permutations remain separate\nsummands in the formal symmetric sum.\n\nNo proof of the inequality is asserted or required here.\n-/\n\nnamespace Problem\n\n/-- Sum `f` over the six distinct permutations of the three argument\npositions. This is the source's `∑_sym` operation for three variables. -/\ndef symSum (f : ℝ → ℝ → ℝ → ℝ) (a b c : ℝ) : ℝ :=\n f a b c + f a c b + f b a c + f b c a + f c a b + f c b a\n\n/-- The symmetric sum of `a^6` over all six index permutations.\nIt expands to `a^6 + a^6 + b^6 + b^6 + c^6 + c^6`. -/\ndef symSumA6 (a b c : ℝ) : ℝ :=\n symSum (fun x _ _ => x ^ 6) a b c\n\n/-- The symmetric sum of `a^4 b^2` over all six index permutations.\nThis expands to the six terms displayed in the source example. -/\ndef symSumA4B2 (a b c : ℝ) : ℝ :=\n symSum (fun x y _ => x ^ 4 * y ^ 2) a b c\n\n/-- The symmetric sum of `a^4 b c` over all six index permutations.\nIt expands to `a^4*b*c + a^4*c*b + b^4*a*c + b^4*c*a + c^4*a*b +\nc^4*b*a`; the equal printed monomials are retained as separate summands. -/\ndef symSumA4BC (a b c : ℝ) : ℝ :=\n symSum (fun x y z => x ^ 4 * y * z) a b c\n\n/-- The symmetric sum of `a^5 b` over all six index permutations. -/\ndef symSumA5B (a b c : ℝ) : ℝ :=\n symSum (fun x y _ => x ^ 5 * y) a b c\n\n/-- The symmetric sum of `a^3 b^3` over all six index permutations.\nIt expands to `a^3*b^3 + a^3*c^3 + b^3*a^3 + b^3*c^3 + c^3*a^3 +\nc^3*b^3`, with repeated printed monomials retained. -/\ndef symSumA3B3 (a b c : ℝ) : ℝ :=\n symSum (fun x y _ => x ^ 3 * y ^ 3) a b c\n\n/-- The symmetric sum of `a^3 b^2 c` over all six index permutations. -/\ndef symSumA3B2C (a b c : ℝ) : ℝ :=\n symSum (fun x y z => x ^ 3 * y ^ 2 * z) a b c\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n symSumA6 a b c + 10 * symSumA4B2 a b c + 5 * symSumA4BC a b c\n\n/-- The right-hand side of the displayed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 6 * symSumA5B a b c + 5 * symSumA3B3 a b c + 5 * symSumA3B2C a b c\n\n/-- The displayed inequality, with the symmetric sums expanded. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete universal assertion in the problem: the displayed\ninequality holds for all real numbers `a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94e476ad-1e26-5a59-b7a9-b30bcdc6ae5a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4b3ecee07bf0ecbd43ceaa9ade122de7cc0335f42f7ce10d3fdc0d7d393f599d", "task_path": "tasks/nmp3_94e476ad-1e26-5a59-b7a9-b30bcdc6ae5a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "94e476ad-1e26-5a59-b7a9-b30bcdc6ae5a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9532d4f7-1c52-5fa1-9c75-20007e2d198e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a parallelogram. Let $M$ be an interior point of $ABCD$. Choose a point $N$ inside triangle $AMD$ such that \n-- \\[\n-- \\angle MNA + \\angle MCB = \\angle MND + \\angle MBC = 180^\\circ .\n-- \\]\n-- Prove that $MN\\parallel AB$.\n/-\nFormal statement of the Euclidean geometry problem in `problem.md`.\n\nThe target is left as a proposition-valued definition; no proof is supplied.\n-/\n\nmodule\n\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\npublic import Mathlib.Analysis.Convex.Topology\n\n@[expose] public section\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, with points represented by their position vectors. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The points `a`, `b`, `c`, `d` form a parallelogram in cyclic order.\n\nThe equation `a + c = b + d` says that the diagonals `ac` and `bd` have the\nsame midpoint (equivalently, the opposite side vectors are equal). Degenerate\ninstances are not separately excluded here: in the target the strict interior\nhypothesis on `m` forces the quadrilateral to be nondegenerate. -/\ndef IsParallelogram (a b c d : Point) : Prop :=\n a + c = b + d\n\n/-- `m` is a strict interior point of the quadrilateral with vertices\n`a`, `b`, `c`, `d`, i.e. a point in the topological interior of its convex hull.\nIn particular, boundary points are excluded. -/\ndef IsInteriorOfParallelogram (a b c d m : Point) : Prop :=\n m ∈ interior (convexHull ℝ ({a, b, c, d} : Set Point))\n\n/-- `x` is a strict interior point of the triangle with vertices `p`, `q`, `r`,\ni.e. a point in the topological interior of its convex hull. Boundary points\nare excluded. -/\ndef IsInsideTriangle (p q r x : Point) : Prop :=\n x ∈ interior (convexHull ℝ ({p, q, r} : Set Point))\n\n/-- The direction of the segment from `p` to `q` is parallel to the direction\nof the segment from `r` to `s`: their difference vectors are real scalar\nmultiples of one another. -/\ndef IsParallel (p q r s : Point) : Prop :=\n ∃ k : ℝ, q - p = k • (s - r)\n\n/-- The chained angle condition\n`∠MNA + ∠MCB = ∠MND + ∠MBC = 180°`.\n\nAngles are Mathlib's unoriented angles in `[0, π]`, and `180°` is represented\nby the real number `π`. -/\ndef AngleCondition (a b c d m n : Point) : Prop :=\n (EuclideanGeometry.angle m n a + EuclideanGeometry.angle m c b =\n EuclideanGeometry.angle m n d + EuclideanGeometry.angle m b c) ∧\n (EuclideanGeometry.angle m n d + EuclideanGeometry.angle m b c = Real.pi)\n\n/-- The assertion of the problem: for every parallelogram `ABCD` in the\nEuclidean plane, for every interior point `M` of it, and for every point `N`\nstrictly inside triangle `AMD` satisfying the two angle-sum equalities, the\nline `MN` is parallel to the line `AB`. -/\ndef Target : Prop :=\n ∀ (a b c d : Point),\n IsParallelogram a b c d →\n ∀ (m : Point),\n IsInteriorOfParallelogram a b c d m →\n ∀ (n : Point),\n IsInsideTriangle a m d n →\n AngleCondition a b c d m n →\n IsParallel m n a b\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9532d4f7-1c52-5fa1-9c75-20007e2d198e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1c249996808e72b8dfdefd9e84ea024ec9e1b1de32e9cadb4dcae7d45cd6751f", "task_path": "tasks/nmp3_9532d4f7-1c52-5fa1-9c75-20007e2d198e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9532d4f7-1c52-5fa1-9c75-20007e2d198e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_95869809-c320-525a-b2bf-da6a6760220f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all non‑negative real numbers \\(a,b,c\\) one has \n-- \\[\n-- 3(a+b+c)\\;\\ge\\;2\\Bigl(\\sqrt{a^{2}+bc}+\\sqrt{b^{2}+ac}+\\sqrt{c^{2}+ab}\\Bigr).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The inequality from the problem: for all non-negative real numbers `a`, `b`, `c`,\n`3 (a + b + c)` is at least twice the displayed sum of square roots. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 ≤ a → 0 ≤ b → 0 ≤ c →\n 3 * (a + b + c) ≥\n 2 * (Real.sqrt (a ^ 2 + b * c) +\n Real.sqrt (b ^ 2 + a * c) +\n Real.sqrt (c ^ 2 + a * b))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "95869809-c320-525a-b2bf-da6a6760220f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "829a17f5de8ce1e4fe2fda7cd37ef662dc888a3b2cc9ee4b1c35a01ed9ee5000", "task_path": "tasks/nmp3_95869809-c320-525a-b2bf-da6a6760220f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "95869809-c320-525a-b2bf-da6a6760220f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_95924451-0e75-5199-931f-bac3db249957", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A=(a_1,a_2,\\ldots ,a_{2000})$ be a sequence of integers with $-1000\\le a_i\\le 1000$ for each $i$. Suppose that $\\displaystyle\\sum_{i=1}^{2000}a_i=1$. Prove that there exists a non‑empty subsequence of $A$ whose sum is $0$.\nimport Mathlib\n\n/-!\n# Formal statement of the zero-sum subsequence problem\n\nThis file records the statement of the problem, not a proof. The original\nsequence has length 2000 and is indexed by `i = 1, ..., 2000`; we represent the\nindex set by `Fin 2000` (indices `0, ..., 1999`).\n-/\n\nnamespace Problem\n\n/-- The entrywise integer bounds `-1000 ≤ a_i ≤ 1000` for every index of the\nlength-2000 sequence `a`. -/\ndef TermBound (a : Fin 2000 → ℤ) : Prop :=\n ∀ i : Fin 2000, -1000 ≤ a i ∧ a i ≤ 1000\n\n/-- The total-sum condition `∑_{i=1}^{2000} a_i = 1`. -/\ndef TotalSum (a : Fin 2000 → ℤ) : Prop :=\n (∑ i : Fin 2000, a i) = 1\n\n/-- A nonempty subsequence of the sequence `a` whose entries sum to zero.\n\nHere a subsequence of length `k` is represented by an order-preserving index\nmap `f : Fin k → Fin 2000`. The condition `StrictMono f` says that the chosen\nindices are distinct and occur in increasing order; `0 < k` says the\nsubsequence is nonempty. -/\ndef HasNonemptyZeroSumSubsequence (a : Fin 2000 → ℤ) : Prop :=\n ∃ k : ℕ, ∃ _hk : 0 < k, ∃ f : Fin k → Fin 2000,\n StrictMono f ∧ (∑ j : Fin k, a (f j)) = 0\n\n/-- The assertion of the original problem: every integer sequence of length\n2000 whose entries lie in `[-1000, 1000]` and whose total sum is `1` has a\nnonempty subsequence summing to `0`. -/\ndef Target : Prop :=\n ∀ a : Fin 2000 → ℤ,\n TermBound a → TotalSum a → HasNonemptyZeroSumSubsequence a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "95924451-0e75-5199-931f-bac3db249957", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8722f49a1a71bca21cb49d583c1e1165bf79b10915de27091e4f5bed4708902f", "task_path": "tasks/nmp3_95924451-0e75-5199-931f-bac3db249957", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "95924451-0e75-5199-931f-bac3db249957", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9593da71-4326-5a8f-b888-2ddc1d85baef", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. Suppose an $n\\times n$ board (grid of unit squares) is tiled with $2\\times1$ dominoes (tiles covering exactly two adjacent unit squares) with no overlaps and covering every square. Prove that there exists a $2\\times2$ sub‑square of the board that is covered by exactly two dominoes, i.e. two dominoes are placed side‑by‑side sharing their longer side.\nimport Mathlib\n\n/-!\n# Domino tilings of square boards\n\nThis file formalizes the statement of the problem. The board is the set of\nsquares `Fin n × Fin n`; a domino is a two-element set of adjacent squares.\nA tiling is a set of such dominoes which covers every square exactly once.\nThe target asserts that every domino tiling of a positive square board has a\n`2 × 2` block tiled by exactly two dominoes.\n-/\n\nnamespace Problem\n\n/-- A square of an `n × n` board, indexed by its row and column. -/\nabbrev Cell (n : ℕ) : Type := Fin n × Fin n\n\n/-- Two board squares share an edge (are horizontally or vertically adjacent). -/\ndef Adjacent {n : ℕ} (a b : Cell n) : Prop :=\n (a.1 = b.1 ∧ (a.2.val + 1 = b.2.val ∨ b.2.val + 1 = a.2.val)) ∨\n (a.2 = b.2 ∧ (a.1.val + 1 = b.1.val ∨ b.1.val + 1 = a.1.val))\n\n/-- A domino is a finite set of exactly two pairwise-adjacent board squares. -/\ndef IsDomino (n : ℕ) (d : Finset (Cell n)) : Prop :=\n d.card = 2 ∧\n ∀ a : Cell n, a ∈ d → ∀ b : Cell n, b ∈ d → a ≠ b → Adjacent a b\n\n/-- A domino tiling of the `n × n` board: every square lies in exactly one\nmember of the supplied set of dominoes, and every member is a domino. -/\ndef IsDominoTiling (n : ℕ) (D : Set (Finset (Cell n))) : Prop :=\n (∀ d : Finset (Cell n), d ∈ D → IsDomino n d) ∧\n ∀ x : Cell n, ∃! d : Finset (Cell n), d ∈ D ∧ x ∈ d\n\n/-- The set of four board squares in the `2 × 2` block whose upper-left square\nhas coordinates `(i, j)`. The accompanying inequalities\n`i.val + 1 < n` and `j.val + 1 < n` ensure that all four squares exist. -/\ndef TwoByTwoBlock (n : ℕ) (i j : Fin n) : Set (Cell n) :=\n {x : Cell n |\n (x.1.val = i.val ∨ x.1.val = i.val + 1) ∧\n (x.2.val = j.val ∨ x.2.val = j.val + 1)}\n\n/-- The assertion that a specified set `B` of board squares is covered by\nexactly two dominoes from `D`: there are two distinct dominoes whose union is\n`B`, and no other member of `D` meets `B`. -/\ndef ExactlyTwoDominoesCoverBlock\n (n : ℕ) (D : Set (Finset (Cell n))) (B : Set (Cell n)) : Prop :=\n ∃ d₁ : Finset (Cell n), d₁ ∈ D ∧\n ∃ d₂ : Finset (Cell n), d₂ ∈ D ∧\n d₁ ≠ d₂ ∧\n (↑d₁ ∪ ↑d₂ : Set (Cell n)) = B ∧\n ∀ d : Finset (Cell n), d ∈ D →\n (∃ x : Cell n, x ∈ d ∧ x ∈ B) → d = d₁ ∨ d = d₂\n\n/-- A board has a `2 × 2` subsquare covered by exactly two dominoes. -/\ndef HasTwoByTwoSubsquare\n (n : ℕ) (D : Set (Finset (Cell n))) : Prop :=\n ∃ i : Fin n, ∃ j : Fin n,\n i.val + 1 < n ∧ j.val + 1 < n ∧\n ExactlyTwoDominoesCoverBlock n D (TwoByTwoBlock n i j)\n\n/-- The complete assertion of the problem: for every positive integer `n`, and\nfor every domino tiling `D` of the `n × n` board, there is a `2 × 2`\nsubsquare covered by exactly two dominoes (equivalently, by two dominoes\nplaced side by side along their longer sides). -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ∀ D : Set (Finset (Cell n)),\n IsDominoTiling n D → HasTwoByTwoSubsquare n D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9593da71-4326-5a8f-b888-2ddc1d85baef", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f9c0461efcaa0cb6240943c46ebfe2bb992f5485edfecbc2818734aab48cd5c1", "task_path": "tasks/nmp3_9593da71-4326-5a8f-b888-2ddc1d85baef", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9593da71-4326-5a8f-b888-2ddc1d85baef", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_95a625c1-3021-58e7-b6a3-66a310dbb75c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that \n-- $$f\\big(f(x)+y\\big)=2x+f\\big(f(f(y))-x\\big)$$ \n-- for all real numbers $x$ and $y$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility predicate for the functional equation.\n\nA function `f : ℝ → ℝ` is admissible when it satisfies\n`f (f x + y) = 2 * x + f (f (f y) - x)` for every pair of real numbers\n`x` and `y`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (f x + y) = 2 * x + f (f (f y) - x)\n\n/-- The identity function on the real numbers. -/\ndef IdentityFunction : ℝ → ℝ :=\n fun x : ℝ => x\n\n/-- The proposed complete solution set: the singleton containing only the\nidentity function. -/\ndef ProposedSolutions : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | f = Problem.IdentityFunction}\n\n/-- A proposed set `S` is a complete answer to the \"find all\" problem when it\ncontains exactly the admissible functions. The biconditional records both\ndirections: soundness of the proposed answer and exhaustiveness. -/\ndef AnswerCorrect (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, f ∈ S ↔ Problem.Admissible f\n\n/-- The target statement, parameterized by a proposed complete set `S` of\nsolutions. No particular solution set is assumed or constructed here. -/\ndef TargetFor (S : Set (ℝ → ℝ)) : Prop :=\n Problem.AnswerCorrect S\n\n/-- The target classification: the admissible functions are exactly the\nidentity function. The correctness predicate expands to the two directions\nof the classification. -/\ndef Target : Prop :=\n Problem.TargetFor Problem.ProposedSolutions\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "95a625c1-3021-58e7-b6a3-66a310dbb75c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "86515469a68efde3d43e578505ab7ca920e03dc7d33d657e3834ac5f730b6c0e", "task_path": "tasks/nmp3_95a625c1-3021-58e7-b6a3-66a310dbb75c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "95a625c1-3021-58e7-b6a3-66a310dbb75c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_95a86f58-f595-57f7-9a11-7d70f42ace79", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle satisfying $a^2+b^2+c^2=3$. Prove that \n-- $$a^3b+b^3c+c^3a\\ge ab+bc+ca.$$\nimport Mathlib\n\n/-!\n# Triangle inequality problem\n\nThis file formalizes the statement of the target problem only. It intentionally\ncontains no proof of the asserted inequality.\n-/\n\nnamespace Problem\n\n/-- The three real numbers `a`, `b`, and `c` are the side lengths of a\nnondegenerate (ordinary) triangle. Positivity is stated explicitly, and the\nthree inequalities are strict. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a < b + c ∧ b < c + a ∧ c < a + b\n\n/-- The statement of the problem: if `a`, `b`, and `c` are the side lengths\nof a triangle and satisfy `a ^ 2 + b ^ 2 + c ^ 2 = 3`, then\n`a ^ 3 * b + b ^ 3 * c + c ^ 3 * a ≥ a * b + b * c + c * a`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n IsTriangleSideLengths a b c →\n a ^ 2 + b ^ 2 + c ^ 2 = 3 →\n a ^ 3 * b + b ^ 3 * c + c ^ 3 * a ≥\n a * b + b * c + c * a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "95a86f58-f595-57f7-9a11-7d70f42ace79", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8cfe5e02597f624f728b148d0c9575da300b69072e4129a359d918a5d64304da", "task_path": "tasks/nmp3_95a86f58-f595-57f7-9a11-7d70f42ace79", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "95a86f58-f595-57f7-9a11-7d70f42ace79", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9653c9a8-9d72-5e98-9b17-c03843cf0c8e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a right triangle with hypotenuse $AB$ (so $\\angle C=90^\\circ$). Let $D\\neq A,C$ be a point on side $AC$. Denote by $I$ the incenter of $\\triangle ABC$ and by $J$ the incenter of $\\triangle BCD$. Suppose the line through $I$ that is parallel to the internal angle bisector of $\\angle ADB$ is tangent to the incircle of $\\triangle BCD$ (the circle centered at $J$). Prove that $AD=BD$.\nimport Mathlib\n\n/-!\n# Formal statement of the right-triangle incenter tangency problem\n\nWe model the Euclidean plane as `EuclideanSpace ℝ (Fin 2)`. The declarations below\nspatially define all the geometric objects occurring in the problem. In particular,\n`Target` is the complete statement to be proved; it is a proposition, not a proof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The Euclidean plane used to model all points in the problem. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The determinant (two-dimensional cross product) of two displacement vectors. -/\ndef cross (u v : Point) : ℝ :=\n u 0 * v 1 - u 1 * v 0\n\n/-- The affine line through `P` in direction `v`, written as a set of points. -/\ndef lineThrough (P v : Point) : Set Point :=\n {X | ∃ t : ℝ, X = P + t • v}\n\n/-- The Euclidean distance from a point `X` to the affine line through `P` with\ndirection `v`. This is the usual distance formula `|v × (X - P)| / ‖v‖`.\nWhen `v = 0` this formula is not interpreted as a line distance; every use in the\nproblem supplies a nonzero `v` through `IsTangentToCircle`. -/\ndef lineDistance (X P v : Point) : ℝ :=\n |cross v (X - P)| / ‖v‖\n\n/-- `X` lies on the closed segment with endpoints `A` and `C`. -/\ndef OnSegment (A C X : Point) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ X = (1 - t) • A + t • C\n\n/-- `X` lies in the open (nondegenerate) triangle with vertices `A`, `B`, `C`,\nexpressed by strictly positive barycentric coordinates summing to one. -/\ndef InOpenTriangle (A B C X : Point) : Prop :=\n ∃ α β γ : ℝ,\n 0 < α ∧ 0 < β ∧ 0 < γ ∧ α + β + γ = 1 ∧\n X = α • A + β • B + γ • C\n\n/-- The standard condition that `ABC` is a nondegenerate right triangle whose\nhypotenuse is `AB`, i.e. the angle at `C` is a right angle. Pairwise distinctness\nis included so that all three sides have positive length and the angle at `C` is a\ngenuine angle. -/\ndef IsRightTriangleWithHypotenuse (A B C : Point) : Prop :=\n A ≠ B ∧ A ≠ C ∧ B ≠ C ∧\n (A - C) 1 * (B - C) 1 + (A - C) 0 * (B - C) 0 = 0\n\n/-- The triangle with vertices `A`, `B`, `C` is nondegenerate, i.e. the three\npoints are not collinear. -/\ndef NondegenerateTriangle (A B C : Point) : Prop :=\n cross (B - A) (C - A) ≠ 0\n\n/-- `X` is the incenter of triangle `ABC`: the triangle is nondegenerate, `X` is\nstrictly inside it, and `X` is equidistant from all three side lines. This is the\nstandard angle-bisector/incircle-center characterization of the incenter. -/\ndef IsTriangleIncenter (A B C X : Point) : Prop :=\n NondegenerateTriangle A B C ∧\n InOpenTriangle A B C X ∧\n lineDistance X A (B - A) = lineDistance X B (C - B) ∧\n lineDistance X B (C - B) = lineDistance X C (A - C)\n\n/-- The radius of the incircle associated with the incenter `J` of triangle `ABC`.\nIt is the distance from `J` to the side line `BC`; the incenter property makes this\nequal to the distances to the other two side lines. -/\ndef IncircleRadius (_A B C J : Point) : ℝ :=\n lineDistance J B (C - B)\n\n/-- The affine line through `P` in direction `w` is tangent to the circle centered\nat `center` with radius `r`. The direction is required to be nonzero, and tangency\nis expressed by the standard center-to-line distance criterion. -/\ndef IsTangentToCircle (P w center : Point) (r : ℝ) : Prop :=\n w ≠ 0 ∧ lineDistance center P w = r\n\n/-- A nonzero direction vector for the internal angle bisector of the angle\n`∠ADB`. If `u` and `v` are the unit vectors along the rays `DA` and `DB`, then\n`u + v` points along the internal angle bisector. -/\ndef internalAngleBisectorDirection (A D B : Point) : Point :=\n (‖A - D‖)⁻¹ • (A - D) + (‖B - D‖)⁻¹ • (B - D)\n\n/-- The complete assertion of the problem: for every right triangle `ABC` with\nhypotenuse `AB`, every interior point `D` of side `AC`, and the incenters `I` and\n`J` of `ABC` and `BCD`, if the line through `I` parallel to the internal angle\nbisector of `∠ADB` is tangent to the incircle of `BCD` centered at `J`, then\n`AD = BD`. -/\ndef Target : Prop :=\n ∀ A B C D I J : Point,\n IsRightTriangleWithHypotenuse A B C →\n OnSegment A C D →\n D ≠ A →\n D ≠ C →\n IsTriangleIncenter A B C I →\n IsTriangleIncenter B C D J →\n IsTangentToCircle I (internalAngleBisectorDirection A D B)\n J (IncircleRadius B C D J) →\n dist A D = dist B D\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9653c9a8-9d72-5e98-9b17-c03843cf0c8e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "56534b0d728dd2abe1a7379f8f088e3f49b7ec3efdc172cac753e464e52b4c1c", "task_path": "tasks/nmp3_9653c9a8-9d72-5e98-9b17-c03843cf0c8e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9653c9a8-9d72-5e98-9b17-c03843cf0c8e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9675cfeb-5b55-5dce-b715-03bc0577b156", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for real numbers $a,b,c\\in(0,2)$ satisfying $a+b+c=3$, the inequality \n-- \\[\n-- 3\\,(a-c+2)(b-a+2)(c-b+2)\\le \\sum_{\\text{cyc}} a^{2}\\,(2b+c-1)(2a+c+1)\n-- \\]\n-- holds, where the cyclic sum expands to \n-- $a^{2}(2b+c-1)(2a+c+1)+b^{2}(2c+a-1)(2b+a+1)+c^{2}(2a+b-1)(2c+b+1)\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe source problem asks to prove, for all real numbers `a`, `b`, and `c`\nlying in the open interval `(0, 2)` and satisfying `a + b + c = 3`, that a\nspecified cyclic-sum inequality holds.\n\nThis file records the statement as a proposition. It does not contain a\nproof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the required inequality. -/\ndef LHS (a b c : ℝ) : ℝ :=\n 3 * (a - c + 2) * (b - a + 2) * (c - b + 2)\n\n/-- The right-hand side, with the cyclic sum written out in full. -/\ndef RHS (a b c : ℝ) : ℝ :=\n a ^ 2 * (2 * b + c - 1) * (2 * a + c + 1) +\n b ^ 2 * (2 * c + a - 1) * (2 * b + a + 1) +\n c ^ 2 * (2 * a + b - 1) * (2 * c + b + 1)\n\n/-- The admissibility conditions on the real parameters: each lies in the\nopen interval `(0, 2)`, and their sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n a ∈ Set.Ioo (0 : ℝ) 2 ∧\n b ∈ Set.Ioo (0 : ℝ) 2 ∧\n c ∈ Set.Ioo (0 : ℝ) 2 ∧\n a + b + c = 3\n\n/-- The assertion to be proved: for every triple of real numbers satisfying\nthe admissibility conditions, the specified inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≤ RHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9675cfeb-5b55-5dce-b715-03bc0577b156", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5c9d3d6e45f5642298bb200f2fce03eafbf66c9ed53e5edca16f6acd20231c38", "task_path": "tasks/nmp3_9675cfeb-5b55-5dce-b715-03bc0577b156", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9675cfeb-5b55-5dce-b715-03bc0577b156", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_968e5550-022a-5535-838f-4029cfcf8001", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\frac{a}{a^{2}+2bc}+\\frac{b}{b^{2}+2ac}+\\frac{c}{c^{2}+2ab}\\le \n-- \\frac{2\\,(a^{2}+b^{2}+c^{2})}{(a+b+c)^{2}}\n-- \\Bigl(\\frac1{a+b}+\\frac1{b+c}+\\frac1{c+a}\\Bigr).\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the proposed three-variable real inequality\n\nThe original problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe inequality\n\n`a / (a^2 + 2bc) + b / (b^2 + 2ac) + c / (c^2 + 2ab)\n ≤ 2 (a^2 + b^2 + c^2) / (a + b + c)^2\n * (1/(a+b) + 1/(b+c) + 1/(c+a))`.\n\nAll arithmetic below is arithmetic in the real numbers. The declaration\n`Problem.Target` is only the proposition to be proved; it contains no proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition in the original statement: `a`, `b`, and `c`\nare positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the requested inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / (a ^ 2 + 2 * b * c) +\n b / (b ^ 2 + 2 * a * c) +\n c / (c ^ 2 + 2 * a * b)\n\n/-- The right-hand side of the requested inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (2 * (a ^ 2 + b ^ 2 + c ^ 2) / (a + b + c) ^ 2) *\n (1 / (a + b) + 1 / (b + c) + 1 / (c + a))\n\n/-- The complete proposition asked by the problem: for every triple of positive\nreal numbers, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "968e5550-022a-5535-838f-4029cfcf8001", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "51d75ad4da38afa76716268c4c77a218f39d4da057bafcd3739c1e28638a2346", "task_path": "tasks/nmp3_968e5550-022a-5535-838f-4029cfcf8001", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "968e5550-022a-5535-838f-4029cfcf8001", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_96a0af09-6211-5148-a26b-decb09967977", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are positive real numbers, prove that \n-- \\[\n-- \\left(\\frac{a^{2}+b^{2}+c^{2}}{3}\\right)^{3}\\ge a^{2}b^{2}c^{2}+(a-b)^{2}(b-c)^{2}(c-a)^{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks to prove a real-variable inequality for three positive\nreal numbers. The assertion is represented as a proposition-valued\ndefinition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`, the cube of their mean\nsquare is at least the product `a²b²c²` plus the product of the squared\npairwise differences. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c →\n ((a ^ 2 + b ^ 2 + c ^ 2) / 3) ^ 3 ≥\n a ^ 2 * b ^ 2 * c ^ 2 + (a - b) ^ 2 * (b - c) ^ 2 * (c - a) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "96a0af09-6211-5148-a26b-decb09967977", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7a5ff31e43e7be284bb31ae6519f604755bd6f77887106bfecfc72dd51f9746f", "task_path": "tasks/nmp3_96a0af09-6211-5148-a26b-decb09967977", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "96a0af09-6211-5148-a26b-decb09967977", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_96a0da21-8a14-5d97-9095-86a9a3deb10a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $X$ be a set of $10\\,000$ integers, none of which is divisible by $47$. Prove that there exists a subset $Y\\subseteq X$ with $|Y|=2007$ such that for every choice of $a,b,c,d,e\\in Y$ (repetitions allowed) the integer $a-b+c-d+e$ is not divisible by $47$.\nimport Mathlib\n\n/-!\n# Formalization of the 2007-subset modulo 47 problem\n\nThe source asks us to prove the following: from any set `X` of 10,000\nintegers none of which is divisible by `47`, one can choose a 2,007-element\nsubset `Y` such that no alternating sum `a - b + c - d + e` with all five\nterms (not necessarily distinct) in `Y` is divisible by `47`.\n\nThe declarations below state this as a proposition. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The hypothesis on the original set `X`: it has exactly 10,000 elements,\nand none of its elements is divisible by `47`. -/\ndef XAdmissible (X : Finset ℤ) : Prop :=\n X.card = 10000 ∧ ∀ x : ℤ, x ∈ X → ¬ (47 : ℤ) ∣ x\n\n/-- A subset `Y` of `X` is good when it has exactly 2,007 elements and every\nalternating sum `a - b + c - d + e` of five elements of `Y` is not divisible\nby `47`. The five elements are universally quantified independently, so\nrepetitions are allowed. -/\ndef GoodSubset (X Y : Finset ℤ) : Prop :=\n Y ⊆ X ∧ Y.card = 2007 ∧\n ∀ a : ℤ, a ∈ Y → ∀ b : ℤ, b ∈ Y → ∀ c : ℤ, c ∈ Y →\n ∀ d : ℤ, d ∈ Y → ∀ e : ℤ, e ∈ Y →\n ¬ (47 : ℤ) ∣ a - b + c - d + e\n\n/-- The full statement to be proved: every admissible set `X` contains a\ngood subset `Y`. -/\ndef Target : Prop :=\n ∀ X : Finset ℤ, XAdmissible X → ∃ Y : Finset ℤ, GoodSubset X Y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "96a0da21-8a14-5d97-9095-86a9a3deb10a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "49f91d087f1873fda91d00a68ea8d749e465c92b82892a9682ec9edf116df272", "task_path": "tasks/nmp3_96a0da21-8a14-5d97-9095-86a9a3deb10a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "96a0da21-8a14-5d97-9095-86a9a3deb10a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_96d203f2-77e0-5f3b-9546-93996d5d2f50", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ satisfy the relation \n-- $$a(c^2-1)=b\\,(b^2+c^2)$$ \n-- and assume $d\\le 1$. Prove that \n-- $$d\\Bigl(a\\sqrt{1-d^2}+b^2\\sqrt{\\,1+d^2\\,}\\Bigr)\\;\\le\\;\\frac{(a+b)c}{2}\\,. $$\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe source problem asks for a proof of a real-variable inequality under a\npolynomial constraint. The declarations below encode the assumptions and the\nclaimed conclusion as propositions; no proof of `Problem.Target` is supplied.\n-/\n\nnamespace Problem\n\n/-- The four parameters are strictly positive real numbers. -/\ndef PositiveParameters (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d\n\n/-- The polynomial relation imposed on `a`, `b`, and `c`. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a * (c ^ 2 - 1) = b * (b ^ 2 + c ^ 2)\n\n/-- The upper bound imposed on `d`. -/\ndef UnitUpperBound (d : ℝ) : Prop :=\n d ≤ 1\n\n/-- All hypotheses of the source problem, in the order in which they occur:\npositivity of all four variables, then the displayed polynomial relation, then\n`d ≤ 1`. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n PositiveParameters a b c d ∧ Constraint a b c ∧ UnitUpperBound d\n\n/-- The inequality asserted in the source problem. `Real.sqrt` is the\nnonnegative real square root. -/\ndef Inequality (a b c d : ℝ) : Prop :=\n d * (a * Real.sqrt (1 - d ^ 2) + b ^ 2 * Real.sqrt (1 + d ^ 2)) ≤\n (a + b) * c / 2\n\n/-- The complete universally quantified statement of the source problem:\nfor every choice of real numbers `a`, `b`, `c`, and `d` satisfying the\nadmissibility hypotheses, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Inequality a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "96d203f2-77e0-5f3b-9546-93996d5d2f50", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4d02184300e8d84874c0ec38f252db5009f946fc439f2404856c7b775a4b953e", "task_path": "tasks/nmp3_96d203f2-77e0-5f3b-9546-93996d5d2f50", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "96d203f2-77e0-5f3b-9546-93996d5d2f50", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_96d80864-5ec4-55a0-9a56-668ce1205135", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be non‑negative real numbers, not two of which are zero. Prove that \n-- \\[\n-- \\frac{1}{(a+2b)^{2}}+\\frac{1}{(b+2c)^{2}}+\\frac{1}{(c+2a)^{2}}\\ge\\frac{1}{ab+bc+ca}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the inequality problem\n\nThe original problem asks to prove an inequality for three non-negative real\nnumbers, with no two of them simultaneously zero.\n-/\n\nnamespace Problem\n\n/-- No two of the three real numbers `a`, `b`, and `c` are both zero. -/\ndef NoTwoZero (a b c : ℝ) : Prop :=\n ¬ (a = 0 ∧ b = 0) ∧ ¬ (a = 0 ∧ c = 0) ∧ ¬ (b = 0 ∧ c = 0)\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / (a + 2 * b) ^ 2 + 1 / (b + 2 * c) ^ 2 + 1 / (c + 2 * a) ^ 2\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 1 / (a * b + b * c + c * a)\n\n/-- The proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n NoTwoZero a b c →\n lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "96d80864-5ec4-55a0-9a56-668ce1205135", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dc10cd103985c77256562a6912b0c7563564c264be9853bcb965ffef838fe78d", "task_path": "tasks/nmp3_96d80864-5ec4-55a0-9a56-668ce1205135", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "96d80864-5ec4-55a0-9a56-668ce1205135", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_970d37ad-b021-5290-a511-db553b765ea8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that the set $\\{1,2,\\dots,1989\\}$ can be partitioned into $117$ disjoint subsets $A_1,A_2,\\dots,A_{117}$ such that \n-- \n-- (i) each $A_i$ contains exactly $17$ elements; \n-- \n-- (ii) the sum of the elements in each $A_i$ is the same.\nimport Mathlib\n\n/-!\n# Formal statement: a partition of `{1, ..., 1989}` into 117 equal-sum blocks\n\nThe original problem asks for the existence of a partition of the finite set\n`{1, 2, ..., 1989}` into 117 pairwise disjoint subsets, each having exactly 17\nelements and all having the same element sum.\n\nThe blocks are indexed by `Fin 117` (internally `0, ..., 116`); this is only a\nzero-based indexing of the original `A_1, ..., A_117`.\n-/\n\nnamespace Problem\n\n/-- The union of the indexed blocks is exactly the finite set `{1, ..., 1989}`. -/\ndef BlocksCoverInterval (A : Fin 117 → Finset ℕ) : Prop :=\n Finset.univ.biUnion A = Finset.Icc 1 1989\n\n/-- Distinct indexed blocks are pairwise disjoint. -/\ndef BlocksPairwiseDisjoint (A : Fin 117 → Finset ℕ) : Prop :=\n ∀ i j : Fin 117, i ≠ j → Disjoint (A i) (A j)\n\n/-- Every block contains exactly 17 elements. -/\ndef BlocksHaveCardinality17 (A : Fin 117 → Finset ℕ) : Prop :=\n ∀ i : Fin 117, (A i).card = 17\n\n/-- There is one common value equal to the sum of the elements of every block. -/\ndef BlocksHaveEqualSums (A : Fin 117 → Finset ℕ) : Prop :=\n ∃ s : ℕ, ∀ i : Fin 117, (A i).sum id = s\n\n/-- `A` is a partition of `{1, ..., 1989}` into 117 pairwise disjoint blocks. -/\ndef IsPartitionInto117DisjointSubsets (A : Fin 117 → Finset ℕ) : Prop :=\n BlocksCoverInterval A ∧ BlocksPairwiseDisjoint A\n\n/-- The assertion requested by the problem: there exist 117 pairwise disjoint\nblocks covering `{1, ..., 1989}`, each of cardinality 17, whose element sums\nare all equal. -/\ndef Target : Prop :=\n ∃ A : Fin 117 → Finset ℕ,\n IsPartitionInto117DisjointSubsets A ∧\n BlocksHaveCardinality17 A ∧\n BlocksHaveEqualSums A\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "970d37ad-b021-5290-a511-db553b765ea8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4c282619023c636d9434f2dc5bb7156fb4fc24dbb2a229210cf710a9a55eb926", "task_path": "tasks/nmp3_970d37ad-b021-5290-a511-db553b765ea8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "970d37ad-b021-5290-a511-db553b765ea8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_97107912-1a02-5f02-86f0-1458bbcde998", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- $a,b,c>0$ with $ab+bc+ca=3abc$. Prove that \n-- \\[\n-- \\frac{a^2}{a^2+b^3+c^3}+\\frac{b^2}{b^2+c^3+a^3}+\\frac{c^2}{c^2+a^3+b^3}\\le 1.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the source inequality problem\n\nThe source asks, for positive real numbers `a`, `b`, and `c` satisfying\n`a*b + b*c + c*a = 3*a*b*c`, to prove the cyclic fractional inequality\nwhose right-hand side is `1`.\n\nThis file records the statement only. It deliberately contains no proof of\n`Problem.Target`.\n-/\n\nnamespace Problem\n\n/-- The three parameters are strictly positive real numbers. -/\ndef StrictlyPositive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The side condition `ab + bc + ca = 3abc`. -/\ndef SideCondition (a b c : ℝ) : Prop :=\n a * b + b * c + c * a = 3 * a * b * c\n\n/-- Admissibility of the parameters: all are strictly positive and satisfy\n`ab + bc + ca = 3abc`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n StrictlyPositive a b c ∧ SideCondition a b c\n\n/-- The assertion to be proved: for all positive real `a`, `b`, `c`\nsatisfying `ab + bc + ca = 3abc`, the sum of the three displayed fractions is\nat most `1`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c →\n a ^ 2 / (a ^ 2 + b ^ 3 + c ^ 3) +\n b ^ 2 / (b ^ 2 + c ^ 3 + a ^ 3) +\n c ^ 2 / (c ^ 2 + a ^ 3 + b ^ 3) ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "97107912-1a02-5f02-86f0-1458bbcde998", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "38ed4c4d725eb3710a09c68f654be1cadf84021c4c10e67b6773df433ce48f58", "task_path": "tasks/nmp3_97107912-1a02-5f02-86f0-1458bbcde998", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "97107912-1a02-5f02-86f0-1458bbcde998", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_972345f4-2be4-5ca1-ae2d-dd4c3d6425f1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that \n-- 1) $f(1)=1$, \n-- 2) $f(a+b)=f(a)+f(b)$ for all $a,b\\in\\mathbb{R}$, \n-- 3) $f(x)\\,f\\!\\bigl(\\tfrac1{x}\\bigr)=1$ for all $x\\in\\mathbb{R}\\setminus\\{0\\}\\,. $\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility predicate for a proposed function `f : ℝ → ℝ` in the\noriginal problem. It records exactly the three numbered requirements:\n`f 1 = 1`, additivity on all real pairs, and the reciprocal product identity\nfor every nonzero real input, together with the domain and codomain of `f`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n f 1 = 1 ∧\n (∀ a b : ℝ, f (a + b) = f a + f b) ∧\n (∀ x : ℝ, x ≠ 0 → f x * f (1 / x) = 1)\n\n/-- The identity function `ℝ → ℝ`, which is the proposed complete answer. -/\ndef IdentityFunction : ℝ → ℝ :=\n fun x : ℝ => x\n\n/-- The answer predicate selecting exactly the identity function. -/\ndef ProposedAnswer (f : ℝ → ℝ) : Prop :=\n f = IdentityFunction\n\n/-- A predicate on functions is a complete answer to the \"find all\" question\nwhen it holds for exactly the admissible functions. The `↔` contains both\ndirections: every function satisfying the predicate is admissible, and every\nadmissible function satisfies the predicate. This is stated for an arbitrary\nproposed answer predicate, without assuming that the answer set of admissible\nfunctions itself is the answer. -/\ndef IsCompleteAnswer (P : (ℝ → ℝ) → Prop) : Prop :=\n ∀ f : ℝ → ℝ, P f ↔ Admissible f\n\n/-- The formal target: the proposed answer predicate `ProposedAnswer`, namely\nthe identity function, is a complete answer to the problem. -/\ndef Target : Prop :=\n IsCompleteAnswer ProposedAnswer\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "972345f4-2be4-5ca1-ae2d-dd4c3d6425f1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f485cc9a50339d6da67064a4fd3a3f75b8b649ed1772c5ad3d41e2adc359c34f", "task_path": "tasks/nmp3_972345f4-2be4-5ca1-ae2d-dd4c3d6425f1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "972345f4-2be4-5ca1-ae2d-dd4c3d6425f1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9736f056-50b0-521a-8c00-668127ba7f38", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m,n\\ge 2$ be positive integers, and let $a_1,a_2,\\dots,a_n$ be integers, none of which is a multiple of $m^{\\,n-1}$. Prove that there exist integers $e_1,e_2,\\dots,e_n$, not all zero, with $|e_i|0$. Prove that \n-- \\[\n-- \\frac{1}{a^2+b^2+ab}+\\frac{1}{b^2+c^2+bc}+\\frac{1}{c^2+a^2+ca}\\ge\\frac{9}{(a+b+c)^2}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nThe assertion of the problem: for all positive real numbers `a`, `b`, and `c`,\nthe sum of the three reciprocals is at least `9 / (a + b + c)^2`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (1 / (a ^ 2 + b ^ 2 + a * b) +\n 1 / (b ^ 2 + c ^ 2 + b * c) +\n 1 / (c ^ 2 + a ^ 2 + c * a) :\n ℝ) ≥\n 9 / ((a + b + c) ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "977fcb96-7cbd-545c-8512-4c39df8850c8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5afb710dabc079fdd185cbcf97ea9ee7b38b71451fdc2d842db57ea142d68205", "task_path": "tasks/nmp3_977fcb96-7cbd-545c-8512-4c39df8850c8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "977fcb96-7cbd-545c-8512-4c39df8850c8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_97a20024-de65-5512-8d9e-ba4b0683d768", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $r>s$ be relatively prime positive integers. Let $P(x)$ and $Q(x)$ be distinct non‑constant polynomials with real coefficients such that \n-- \\[\n-- P(x)^{\\,r}-P(x)^{\\,s}=Q(x)^{\\,r}-Q(x)^{\\,s}\\qquad\\text{for all }x\\in\\mathbb{R}.\n-- \\] \n-- Prove that $r=2$ and $s=1$.\nimport Mathlib.Algebra.Polynomial.Degree.Defs\nimport Mathlib.Algebra.Polynomial.Eval.Defs\nimport Mathlib.Data.Nat.GCD.Basic\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the polynomial functional-equation problem\n\nThe source problem asks to prove that the only relatively prime positive\nnatural-number exponents `r > s` for which two distinct nonconstant real\npolynomials `P` and `Q` can satisfy the pointwise identity\n`P(x)^r - P(x)^s = Q(x)^r - Q(x)^s` for every real `x` are `r = 2`, `s = 1`.\n-/\n\nnamespace Problem\n\n/-- A real polynomial is nonconstant exactly when its natural degree is positive.\nThe zero polynomial is constant, so it also has natural degree zero and is excluded. -/\ndef NonconstantPolynomial (P : Polynomial ℝ) : Prop :=\n 0 < Polynomial.natDegree P\n\n/-- The pointwise polynomial identity from the source problem, for natural-number\nexponents `r` and `s` and real polynomials `P` and `Q`. -/\ndef PolynomialIdentity (r s : ℕ) (P Q : Polynomial ℝ) : Prop :=\n ∀ x : ℝ, (Polynomial.eval x P) ^ r - (Polynomial.eval x P) ^ s =\n (Polynomial.eval x Q) ^ r - (Polynomial.eval x Q) ^ s\n\n/-- The assertion to be proved: for every pair of relatively prime positive\nintegers `r > s`, and every pair of distinct nonconstant real polynomials\nsatisfying the displayed identity for all real `x`, necessarily `r = 2` and\n`s = 1`. -/\ndef Target : Prop :=\n ∀ (r s : ℕ) (P Q : Polynomial ℝ),\n 0 < r →\n 0 < s →\n r > s →\n Nat.Coprime r s →\n P ≠ Q →\n NonconstantPolynomial P →\n NonconstantPolynomial Q →\n PolynomialIdentity r s P Q →\n r = 2 ∧ s = 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "97a20024-de65-5512-8d9e-ba4b0683d768", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "59e1ff7e15cea76c6e6bf428e230af4fd98a36c66825bb73ffacb104a3f93fa8", "task_path": "tasks/nmp3_97a20024-de65-5512-8d9e-ba4b0683d768", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "97a20024-de65-5512-8d9e-ba4b0683d768", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_97ca1b19-9d1b-56ec-819a-af1aa089bf5d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}} \\frac{ab}{a^{2}+b^{2}+3c^{2}} \\le \\frac35.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The cyclic sum\n`ab/(a^2+b^2+3c^2) + bc/(b^2+c^2+3a^2) + ca/(c^2+a^2+3b^2)`,\nfor real `a`, `b`, and `c`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n a * b / (a ^ 2 + b ^ 2 + 3 * c ^ 2) +\n b * c / (b ^ 2 + c ^ 2 + 3 * a ^ 2) +\n c * a / (c ^ 2 + a ^ 2 + 3 * b ^ 2)\n\n/-- For all positive real `a`, `b`, and `c`, the cyclic sum is at most `3/5`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n cyclicSum a b c ≤ (3 : ℝ) / 5\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "97ca1b19-9d1b-56ec-819a-af1aa089bf5d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "87a04951e5c481906512e8c11b9eb1610f078a56c897b4e9182865b4e07442f0", "task_path": "tasks/nmp3_97ca1b19-9d1b-56ec-819a-af1aa089bf5d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "97ca1b19-9d1b-56ec-819a-af1aa089bf5d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_97da05ed-a0c4-5f17-9460-451ddc911457", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c,d>0$, prove that \n-- $$2\\bigl(ab+ac+ad+bc+bd+cd\\bigr)^3\\ge 27\\bigl(abc+abd+acd+bcd\\bigr)^2.$$\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the positive-real inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, `c`,\nand `d`, the inequality\n\n`2 * (ab + ac + ad + bc + bd + cd)^3 ≥\n 27 * (abc + abd + acd + bcd)^2`.\n\nThe declaration below records the proposition to be proved. Its body is a\nproposition, not a proof.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, `c`, and `d`, twice the cube of\nthe sum of the six pairwise products is at least twenty-seven times the square\nof the sum of the four triple products. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d →\n 2 * (a * b + a * c + a * d + b * c + b * d + c * d) ^ 3 ≥\n 27 * (a * b * c + a * b * d + a * c * d + b * c * d) ^ 2\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "97da05ed-a0c4-5f17-9460-451ddc911457", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "040a92a42fc83b264eaf81cb945db4b617572d07f13a0ae58ebd355b6b6066de", "task_path": "tasks/nmp3_97da05ed-a0c4-5f17-9460-451ddc911457", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "97da05ed-a0c4-5f17-9460-451ddc911457", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_97dc991e-00f7-5003-9e7a-f3b673ed542b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that\n-- \\[\n-- \\sqrt{\\frac{a+b}{c}}+\\sqrt{\\frac{b+c}{a}}+\\sqrt{\\frac{c+a}{b}}\n-- \\;\\ge\\;\n-- 2\\sqrt[4]{\\frac{6\\,(a+b+c)^{3}}{(a+b)(b+c)(c+a)}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nProblem: for all positive real numbers `a`, `b`, and `c`, prove that\n\n`sqrt ((a + b) / c) + sqrt ((b + c) / a) + sqrt ((c + a) / b)`\nis at least\n`2 * (6 * (a + b + c)^3 / ((a + b) * (b + c) * (c + a)))^(1/4)`.\n\nThe fourth root is represented by the real power with exponent `1 / 4`.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The assertion of the problem, with the positivity hypotheses universally\nquantified over real `a`, `b`, and `c`. The fourth root of a nonnegative real\nnumber `x` is represented as `x ^ (1 / 4 : ℝ)` using `Real.rpow`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n Real.sqrt ((a + b) / c) +\n Real.sqrt ((b + c) / a) +\n Real.sqrt ((c + a) / b)\n ≥\n 2 * Real.rpow\n (6 * (a + b + c) ^ 3 / ((a + b) * (b + c) * (c + a)))\n (1 / 4 : ℝ)\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "97dc991e-00f7-5003-9e7a-f3b673ed542b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ed93cf01d6b41fab9fc536971701ddf150d59d89fb0f801339e7176a386fb91a", "task_path": "tasks/nmp3_97dc991e-00f7-5003-9e7a-f3b673ed542b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "97dc991e-00f7-5003-9e7a-f3b673ed542b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9835f0f7-7c8a-52d1-bab4-1cdb0b398385", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- With $a,b,c>0$ and $(a+b)(b+c)(c+a)=1$, prove that \n-- \\[\n-- \\frac{a}{(a+2b)^2(b+c)}+\\frac{b}{(b+2c)^2(c+a)}+\\frac{c}{(c+2a)^2(a+b)}\\ge \\frac{2}{3}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic inequality problem\n\nThe source problem asks one to prove, for positive real numbers `a`, `b`, and\n`c` satisfying `(a + b) * (b + c) * (c + a) = 1`, the cyclic inequality\nwith right-hand side `2 / 3`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / ((a + 2 * b) ^ 2 * (b + c))\n + b / ((b + 2 * c) ^ 2 * (c + a))\n + c / ((c + 2 * a) ^ 2 * (a + b))\n\n/-- The constraint `(a + b) * (b + c) * (c + a) = 1`. -/\ndef productConstraint (a b c : ℝ) : Prop :=\n (a + b) * (b + c) * (c + a) = 1\n\n/--\nThe complete assertion of the problem: for all positive real numbers `a`, `b`,\nand `c` satisfying the product constraint, the stated cyclic sum is at least\n`2 / 3`.\n\nThis is a proposition-valued declaration; no proof is supplied.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n productConstraint a b c →\n lhs a b c ≥ (2 / 3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9835f0f7-7c8a-52d1-bab4-1cdb0b398385", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f5c3c4dc0bffaa792e03f5e3d2b674e03d50de6428da3ade47f9036913fb6d37", "task_path": "tasks/nmp3_9835f0f7-7c8a-52d1-bab4-1cdb0b398385", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9835f0f7-7c8a-52d1-bab4-1cdb0b398385", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9845cd52-4891-55af-ad60-e931d36f913f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every prime $p$, the integer $p^{p+1}+(p+1)^p$ is not a perfect square.\nimport Mathlib\n\nnamespace Problem\n\n/-- The integer appearing in the problem:\n`p ^ (p + 1) + (p + 1) ^ p`, where the prime `p` is a natural number. -/\ndef expression (p : ℕ) : ℤ :=\n (p : ℤ) ^ (p + 1) + ((p + 1 : ℕ) : ℤ) ^ p\n\n/-- An integer is a perfect square when it is the square of some integer. -/\ndef IsIntegerSquare (n : ℤ) : Prop :=\n ∃ m : ℤ, n = m ^ 2\n\n/-- For every prime natural number `p`, the integer\n`p ^ (p + 1) + (p + 1) ^ p` is not a perfect square. -/\ndef Target : Prop :=\n ∀ p : ℕ, Nat.Prime p → ¬ IsIntegerSquare (expression p)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9845cd52-4891-55af-ad60-e931d36f913f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5ec74abac61f25b88696f960ae3e9603c238d0986e8af72128602e30105323a5", "task_path": "tasks/nmp3_9845cd52-4891-55af-ad60-e931d36f913f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9845cd52-4891-55af-ad60-e931d36f913f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_984f7730-170c-5396-9dcf-0f3cde2b6299", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m>0$ be an integer, $\\gcd(a,m)=1$, $h\\ge 0$, $c\\in\\mathbb{R}$ and let $\\psi:\\{0,1,\\dots,m-1\\}\\to\\mathbb{R}$ satisfy $\\psi(x)\\in[c,c+h]$ for every $x$. Define \n-- \\[\n-- S=\\sum_{x=0}^{m-1}\\Bigl\\{\\frac{ax+\\psi(x)}{m}\\Bigr\\},\n-- \\] \n-- where $\\{y\\}=y-\\lfloor y\\rfloor$ denotes the fractional part. Prove that \n-- \\[\n-- \\Bigl|S-\\frac{m}{2}\\Bigr|\\le h+\\frac12.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: bounded perturbation of a modular fractional-part sum\n\nThe source problem asks for a proof that, for a positive integer modulus `m`, an\ninteger `a` coprime to `m`, a nonnegative real width `h`, a real base point `c`,\nand a function `ψ` on the residue representatives `0, ..., m - 1` taking values\nin `[c, c + h]`, the sum of the fractional parts\n`(a * x + ψ x) / m` differs from `m / 2` by at most `h + 1 / 2`.\n-/\n\nnamespace Problem\n\nopen scoped BigOperators\n\n/-- The fractional-part operation `{y} = y - floor y`, for a real number `y`. -/\nnoncomputable def fractionalPart (y : ℝ) : ℝ :=\n y - (⌊y⌋ : ℝ)\n\n/-- The sum `S = ∑_{x=0}^{m-1} { (a * x + ψ x) / m }`.\n\nThe domain `{0, 1, ..., m - 1}` is represented by `Fin m`; its elements carry\ntheir natural-number value for the multiplication by `a`. -/\nnoncomputable def S (m : ℕ) (a : ℤ) (ψ : Fin m → ℝ) : ℝ :=\n ∑ x : Fin m, fractionalPart (((a : ℝ) * (x : ℝ) + ψ x) / (m : ℝ))\n\n/-- The coprimality hypothesis `gcd(a, m) = 1`, with `a` an integer and the\npositive modulus `m` cast to an integer for `Int.gcd`. -/\ndef CoprimeToModulus (a : ℤ) (m : ℕ) : Prop :=\n Int.gcd a (m : ℤ) = 1\n\n/-- The hypothesis that every value of `ψ` lies in the closed interval\n`[c, c + h]`. -/\ndef PsiInInterval (m : ℕ) (c h : ℝ) (ψ : Fin m → ℝ) : Prop :=\n ∀ x : Fin m, c ≤ ψ x ∧ ψ x ≤ c + h\n\n/-- The complete assertion of the source problem.\n\nThe integer modulus is represented by a natural number `m` subject to `0 < m`.\nThe multiplier is an integer `a`, and coprimality is `Int.gcd a m = 1` after\ncasting `m` to `ℤ`. The parameters `c` and `h` are real, and `h` is nonnegative.\nThe function `ψ` is defined on exactly the residue representatives `Fin m`. -/\ndef Target : Prop :=\n ∀ (m : ℕ) (a : ℤ) (h c : ℝ) (ψ : Fin m → ℝ),\n 0 < m →\n CoprimeToModulus a m →\n 0 ≤ h →\n PsiInInterval m c h ψ →\n |S m a ψ - (m : ℝ) / 2| ≤ h + (1 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "984f7730-170c-5396-9dcf-0f3cde2b6299", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b1d5a03c9f6c2fe0f5369dc77839e369406fbf0acee50878524e1302e73afc1b", "task_path": "tasks/nmp3_984f7730-170c-5396-9dcf-0f3cde2b6299", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "984f7730-170c-5396-9dcf-0f3cde2b6299", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_98686452-07c6-54c7-8144-72b3633c0d73", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ such that $x^2+y^2+z^2=3$. Prove that \n-- $$xy^2+yz^2+zx^2\\le 2+xyz.$$\nimport Mathlib\n\n/-!\n# Formal statement for the inequality problem\n\nThe problem asks to prove, for positive real numbers `x`, `y`, and `z`\nsatisfying `x ^ 2 + y ^ 2 + z ^ 2 = 3`, that\n`x * y ^ 2 + y * z ^ 2 + z * x ^ 2 ≤ 2 + x * y * z`.\n-/\n\nnamespace Problem\n\n/-- The hypotheses of the problem: all three variables are strictly positive\nand the sum of their squares is three. -/\ndef Admissibility (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x ^ 2 + y ^ 2 + z ^ 2 = 3\n\n/-- The inequality asserted by the problem. -/\ndef Inequality (x y z : ℝ) : Prop :=\n x * y ^ 2 + y * z ^ 2 + z * x ^ 2 ≤ 2 + x * y * z\n\n/-- The full universal statement to be proved. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissibility x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98686452-07c6-54c7-8144-72b3633c0d73", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f715ce5c85ec5e28afe4262174cd8e918c91074c8eac074304415522777d152c", "task_path": "tasks/nmp3_98686452-07c6-54c7-8144-72b3633c0d73", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98686452-07c6-54c7-8144-72b3633c0d73", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9872200e-4a3a-55e0-9cca-5ea44eafbada", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be a prime. Suppose the mean (average) of the nonzero quadratic residues modulo $p$ is less than $\\frac{p}{2}$. Prove that the median of the nonzero quadratic residues modulo $p$ is also less than $\\frac{p}{2}$.\nimport Mathlib\n\nnamespace Problem\n\n/-- A natural number `a` is a nonzero quadratic residue modulo `p` when it is a\nleast positive residue modulo `p` and is the square of a nonzero element of\n`ZMod p`. -/\ndef IsNonzeroQuadraticResidue (p a : ℕ) : Prop :=\n 1 ≤ a ∧ a < p ∧\n ∃ x : Fin p, (x : ℕ) ≠ 0 ∧ (((x : ℕ) : ZMod p) ^ 2 = (a : ZMod p))\n\n/-- The set of nonzero quadratic residues modulo `p`, represented by their least\npositive integer residues `1, ..., p - 1`. -/\nnoncomputable def nonzeroQuadraticResidues (p : ℕ) : Finset ℕ := by\n classical\n exact (Finset.range p).filter fun a => IsNonzeroQuadraticResidue p a\n\n/-- Membership in the finite set is exactly the defining predicate: a least\npositive representative of a nonzero square class modulo `p`. -/\nlemma mem_nonzeroQuadraticResidues_iff {p a : ℕ} :\n a ∈ nonzeroQuadraticResidues p ↔ IsNonzeroQuadraticResidue p a := by\n classical\n rw [nonzeroQuadraticResidues, Finset.mem_filter, Finset.mem_range]\n constructor\n · exact fun h => h.2\n · intro h\n exact ⟨h.2.1, h⟩\n\n/-- The nonzero quadratic residues modulo a prime form a nonempty finite set:\nthe residue `1` is always present. This makes the median definition's\nnonempty branch applicable in the target. -/\nlemma one_mem_nonzeroQuadraticResidues {p : ℕ} (hp : Nat.Prime p) :\n 1 ∈ nonzeroQuadraticResidues p := by\n classical\n rw [nonzeroQuadraticResidues, Finset.mem_filter, Finset.mem_range]\n refine ⟨hp.one_lt, ?_⟩\n refine ⟨le_rfl, hp.one_lt, ?_⟩\n refine ⟨⟨1, hp.one_lt⟩, by norm_num, ?_⟩\n norm_num\n\n/-- The set of nonzero quadratic residues modulo a prime is nonempty. -/\nlemma nonzeroQuadraticResidues_nonempty {p : ℕ} (hp : Nat.Prime p) :\n (nonzeroQuadraticResidues p).Nonempty :=\n ⟨1, one_mem_nonzeroQuadraticResidues hp⟩\n\n/-- The number of nonzero quadratic residues modulo a prime is positive, so the\nrational mean has a nonzero denominator. -/\nlemma nonzeroQuadraticResidues_card_pos {p : ℕ} (hp : Nat.Prime p) :\n 0 < (nonzeroQuadraticResidues p).card :=\n Finset.card_pos.mpr (nonzeroQuadraticResidues_nonempty hp)\n\n/-- The arithmetic median of a finite set of natural numbers, as a rational\nnumber. After sorting the elements increasingly, an odd-sized set has median\nthe middle element, and an even-sized set has median the average of the two\nmiddle elements. The value `0` is a fallback only for the empty set; the set\nof nonzero quadratic residues of a prime is nonempty. -/\nnoncomputable def medianOfNatFinset (s : Finset ℕ) : ℚ :=\n if h : s.Nonempty then\n let l := s.sort (· ≤ ·)\n let n := l.length\n have hn : 0 < n := by\n dsimp only [l, n]\n rw [Finset.length_sort]\n exact Finset.card_pos.mpr h\n if n % 2 = 1 then\n (l.get ⟨n / 2, by omega⟩ : ℚ)\n else\n (((l.get ⟨n / 2 - 1, by omega⟩ : ℕ) +\n l.get ⟨n / 2, by omega⟩ : ℚ) / 2)\n else\n 0\n\n/-- The mean (average) of the nonzero quadratic residues modulo `p`, represented\nby their least positive integer residues and evaluated as a rational number. -/\nnoncomputable def nonzeroQuadraticResidueMean (p : ℕ) : ℚ :=\n ((nonzeroQuadraticResidues p).sum fun a => (a : ℚ)) /\n ((nonzeroQuadraticResidues p).card : ℚ)\n\n/-- The median of the nonzero quadratic residues modulo `p`, represented by\ntheir least positive integer residues. -/\nnoncomputable def nonzeroQuadraticResidueMedian (p : ℕ) : ℚ :=\n medianOfNatFinset (nonzeroQuadraticResidues p)\n\n/-- The hypothesis that the mean of the nonzero quadratic residues modulo `p`\nis less than `p / 2`. -/\ndef MeanBelowHalf (p : ℕ) : Prop :=\n nonzeroQuadraticResidueMean p < (p : ℚ) / 2\n\n/-- The conclusion that the median of the nonzero quadratic residues modulo `p`\nis less than `p / 2`. -/\ndef MedianBelowHalf (p : ℕ) : Prop :=\n nonzeroQuadraticResidueMedian p < (p : ℚ) / 2\n\n/-- The assertion: for every prime `p`, if the mean of the nonzero quadratic\nresidues modulo `p` is less than p / 2, then their median is also less than\np / 2. -/\ndef Target : Prop :=\n ∀ (p : ℕ), Nat.Prime p → MeanBelowHalf p → MedianBelowHalf p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9872200e-4a3a-55e0-9cca-5ea44eafbada", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "97990be66f67ed7dfc0fef0bec9ac990799d4b9865ab406640f6bf032671da08", "task_path": "tasks/nmp3_9872200e-4a3a-55e0-9cca-5ea44eafbada", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9872200e-4a3a-55e0-9cca-5ea44eafbada", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_988fad08-c2b0-5fe1-b699-d55340450887", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In triangle $ABC$, let $X$ and $Y$ be the midpoints of $AB$ and $AC$, respectively. On segment $BC$ there is a point $D$, distinct from the midpoint of $BC$, such that $\\angle XDY = \\angle BAC$. Prove that $AD \\perp BC$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used to model the triangle. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The three vertices `A`, `B`, `C` form a (nondegenerate) triangle. In the\ntwo-dimensional model this is expressed by affine independence, equivalently\nby the three points being non-collinear. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n AffineIndependent ℝ ![A, B, C]\n\n/-- `M` is the midpoint of the segment with endpoints `P` and `Q`. -/\ndef IsMidpointOf (P Q M : Plane) : Prop :=\n M = midpoint ℝ P Q\n\n/-- `D` lies on the closed segment `BC`. -/\ndef LiesOnSegmentBC (B C D : Plane) : Prop :=\n D ∈ affineSegment ℝ B C\n\n/-- `D` is distinct from the midpoint of `BC`. -/\ndef NotMidpointOfBC (B C D : Plane) : Prop :=\n D ≠ midpoint ℝ B C\n\n/-- The angle condition `∠XDY = ∠BAC`, where `X` and `Y` are the points\nwhose midpoint identities are supplied separately. -/\ndef AngleCondition (A B C X Y D : Plane) : Prop :=\n EuclideanGeometry.angle X D Y = EuclideanGeometry.angle B A C\n\n/-- The line `AD` is perpendicular to the line `BC`, expressed by vanishing\nof the Euclidean inner product of their direction vectors. -/\ndef ADPerpendicularBC (A B C D : Plane) : Prop :=\n inner ℝ (A -ᵥ D) (B -ᵥ C) = 0\n\n/-- The full assertion: in any nondegenerate triangle `ABC`, if `X` is the\nmidpoint of `AB`, `Y` is the midpoint of `AC`, `D` lies on the closed segment\n`BC`, `D` is not the midpoint of `BC`, and `∠XDY = ∠BAC`, then `AD` is\nperpendicular to `BC`. -/\ndef Target : Prop :=\n ∀ (A B C X Y D : Plane),\n IsTriangle A B C →\n IsMidpointOf A B X →\n IsMidpointOf A C Y →\n LiesOnSegmentBC B C D →\n NotMidpointOfBC B C D →\n AngleCondition A B C X Y D →\n ADPerpendicularBC A B C D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "988fad08-c2b0-5fe1-b699-d55340450887", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "38badf8cc8e25c804ec71d83c78161d5de649822243e0fe42f7bd7907742d03e", "task_path": "tasks/nmp3_988fad08-c2b0-5fe1-b699-d55340450887", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "988fad08-c2b0-5fe1-b699-d55340450887", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9895dfd5-0dba-506e-8c5d-3aa9ca4eca99", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be a prime number and let $k,r$ be positive integers with $p>r$. If $pk+r$ divides $p^p+1$, prove that $r$ divides $k$.\nimport Mathlib.Data.Nat.Prime.Basic\n\n/-!\n# Formalization of the problem statement\n\nLet `p` be a prime number and let `k`, `r` be positive integers with `p > r`.\nIf `p * k + r` divides `p ^ p + 1`, then `r` divides `k`.\n-/\n\nnamespace Problem\n\n/-- The proposition asserted by the problem.\n\nFor every natural number `p` that is prime, and every pair of positive natural\nnumbers `k` and `r` with `p > r`, if `p * k + r` divides `p ^ p + 1`, then\n`r` divides `k`. -/\ndef Target : Prop :=\n ∀ (p k r : ℕ),\n Nat.Prime p →\n 0 < k →\n 0 < r →\n p > r →\n (p * k + r) ∣ (p ^ p + 1) →\n r ∣ k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9895dfd5-0dba-506e-8c5d-3aa9ca4eca99", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1fe2325732bfbf0164f10bb83c0897814820c3e2c39028c0f498dc6b5dd720f2", "task_path": "tasks/nmp3_9895dfd5-0dba-506e-8c5d-3aa9ca4eca99", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9895dfd5-0dba-506e-8c5d-3aa9ca4eca99", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_98b2860c-a4a8-57e3-aa0c-2f1deef05704", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- \\[\n-- \\sqrt{x+\\sqrt{x}}+\\sqrt{y+\\sqrt{y}}+\\sqrt{z+\\sqrt{z}}\\;\\le\\;\n-- \\sqrt{x+\\sqrt{y}}+\\sqrt{y+\\sqrt{z}}+\\sqrt{z+\\sqrt{x}}\\,.\n-- \\]\nmodule\n\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe original problem asks one to prove, for positive real numbers `x`, `y`, and\n`z`, the inequality\n\n`sqrt (x + sqrt x) + sqrt (y + sqrt y) + sqrt (z + sqrt z)\n ≤ sqrt (x + sqrt y) + sqrt (y + sqrt z) + sqrt (z + sqrt x)`.\n\nHere `sqrt` is `Real.sqrt`, the nonnegative real square root.\n-/\n\nnamespace Problem\n\npublic section\n\n/-- The assertion of the problem: for all positive real `x`, `y`, and `z`, the\ncyclic sum on the left with matching square-root arguments is at most the\ncyclic sum on the right in which each outer square-root argument uses the next\nvariable under the inner square root. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z →\n Real.sqrt (x + Real.sqrt x) +\n Real.sqrt (y + Real.sqrt y) +\n Real.sqrt (z + Real.sqrt z) ≤\n Real.sqrt (x + Real.sqrt y) +\n Real.sqrt (y + Real.sqrt z) +\n Real.sqrt (z + Real.sqrt x)\n\nend\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98b2860c-a4a8-57e3-aa0c-2f1deef05704", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "765ce938f7f9e5205a16f76a7e6430323b700d4a071e8f6f17415a0409fbbd38", "task_path": "tasks/nmp3_98b2860c-a4a8-57e3-aa0c-2f1deef05704", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98b2860c-a4a8-57e3-aa0c-2f1deef05704", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_98bf76c8-e5c2-5fcf-82cc-589e9759655b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) satisfy \\(a^{2}+b^{2}+c^{2}=12\\). Prove that \n-- \\[\n-- \\frac{1}{a+b}+\\frac{1}{b+c}+\\frac{1}{c+a}\\ge \\frac{8}{a^{2}+28}+\\frac{8}{b^{2}+28}+\\frac{8}{c^{2}+28}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the problem in `problem.md`\n\nThe problem asks to prove a real-variable inequality under positivity and\nunit-sphere (sum of squares) hypotheses. This file only states the target;\nit deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/--\nFor all positive real numbers `a`, `b`, and `c` satisfying\n`a ^ 2 + b ^ 2 + c ^ 2 = 12`, prove the inequality\n\n`1 / (a + b) + 1 / (b + c) + 1 / (c + a) ≥\n 8 / (a ^ 2 + 28) + 8 / (b ^ 2 + 28) + 8 / (c ^ 2 + 28)`.\n\nAll arithmetic and division in this statement are real arithmetic.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = (12 : ℝ) →\n (1 : ℝ) / (a + b) + (1 : ℝ) / (b + c) + (1 : ℝ) / (c + a) ≥\n (8 : ℝ) / (a ^ 2 + (28 : ℝ)) +\n (8 : ℝ) / (b ^ 2 + (28 : ℝ)) +\n (8 : ℝ) / (c ^ 2 + (28 : ℝ))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98bf76c8-e5c2-5fcf-82cc-589e9759655b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "725b56358917b0ac324da72970dbe261a3613131d23d98acaa66f5a884593d12", "task_path": "tasks/nmp3_98bf76c8-e5c2-5fcf-82cc-589e9759655b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98bf76c8-e5c2-5fcf-82cc-589e9759655b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_98ce17ce-8d5a-545e-a1ae-bdf68d3b2a89", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The sequence $\\{a_n\\}$ is defined by $a_0=1$, $a_1=2$, and for $n\\ge2$\n-- $$a_n \\;=\\; a_{n-1}^2 \\;+\\;\\bigl(a_0a_1\\cdots a_{\\,n-2}\\bigr)^2.$$ \n-- Let $k$ be a positive integer and let $p$ be a prime divisor of $a_k$. Prove that \n-- $$p \\;>\\;4(k-1).$$\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/--\nThe sequence `a` from the problem, indexed from `0`. Its first two terms are\n`a 0 = 1` and `a 1 = 2`. At index `n + 2`, the product in the recurrence has\nthe factors `a 0, ..., a n`, and the preceding term is `a (n + 1)`.\n-/\ndef a : ℕ → ℕ\n | 0 => 1\n | 1 => 2\n | n + 2 =>\n a (n + 1) ^ 2 +\n ((Finset.range (n + 1)).attach.prod (fun i => a i.1)) ^ 2\ntermination_by n => n\ndecreasing_by\n · omega\n · have hi : i.1 < n + 1 := Finset.mem_range.mp i.2\n omega\n\n/-- The prefix product `a 0 * a 1 * ... * a (n - 1)`, with value `1` at `n = 0`. -/\ndef prefixProduct (n : ℕ) : ℕ :=\n ∏ i ∈ Finset.range n, a i\n\n/-- The initial value `a 0 = 1`. -/\ntheorem a_zero : a 0 = 1 := a.eq_1\n\n/-- The initial value `a 1 = 2`. -/\ntheorem a_one : a 1 = 2 := a.eq_2\n\n/--\nThe recurrence at index `n + 2`: the final factor of the product is `a n`, and\nthe preceding term is `a (n + 1)`.\n-/\ntheorem a_recurrence (n : ℕ) :\n a (n + 2) = a (n + 1) ^ 2 + prefixProduct (n + 1) ^ 2 := by\n rw [a.eq_3, prefixProduct]\n congr 1\n rw [Finset.prod_attach]\n\n/-- The recurrence exactly in the source's form for every `n ≥ 2`. -/\ntheorem a_recurrence_of_two_le {n : ℕ} (hn : 2 ≤ n) :\n a n = a (n - 1) ^ 2 + prefixProduct (n - 1) ^ 2 := by\n obtain ⟨m, rfl⟩ := Nat.exists_eq_add_of_le hn\n have h : 2 + m - 1 = m + 1 := by omega\n rw [h]\n simpa [Nat.add_comm] using a_recurrence m\n\n/-- `p` is a prime divisor of the natural number `n`. -/\ndef IsPrimeDivisor (n p : ℕ) : Prop :=\n Nat.Prime p ∧ p ∣ n\n\n/--\nThe assertion from the problem: for every positive integer `k` and every prime\ndivisor `p` of `a k`, one has `p > 4 * (k - 1)`.\n-/\ndef Target : Prop :=\n ∀ (k : ℕ), 0 < k →\n ∀ (p : ℕ), IsPrimeDivisor (a k) p → p > 4 * (k - 1)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98ce17ce-8d5a-545e-a1ae-bdf68d3b2a89", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "18ee6528f1bb79c3993b548a295c51641a7ad2831014f0db9ae78e06a8716717", "task_path": "tasks/nmp3_98ce17ce-8d5a-545e-a1ae-bdf68d3b2a89", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98ce17ce-8d5a-545e-a1ae-bdf68d3b2a89", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_98de9ba0-08f0-5914-bf0a-8759a8521fe4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- When $\\frac12\\le x,y,z\\le1$, prove that \n-- \\[\n-- (x+y+z)^2\\,(xy+yz+zx)^2+11(x+y+z)(xy+yz+zx)xyz\\ge6\\,xyz\\,(x+y+z)^3+18x^2y^2z^2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable inequality\n\nThis module records the problem statement only. It introduces the admissible\ndomain and the displayed inequality as `Prop`-valued definitions, and packages\nthe universally quantified claim as `Problem.Target`. No proof of the claim is\nprovided here.\n-/\n\nnamespace Problem\n\n/-- A real number lies in the closed interval from one half to one, inclusive. -/\ndef BetweenOneHalfAndOne (t : ℝ) : Prop :=\n (1 / 2 : ℝ) ≤ t ∧ t ≤ 1\n\n/-- All three variables satisfy the displayed lower and upper bounds. -/\ndef Admissible (x y z : ℝ) : Prop :=\n BetweenOneHalfAndOne x ∧ BetweenOneHalfAndOne y ∧ BetweenOneHalfAndOne z\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (x y z : ℝ) : ℝ :=\n (x + y + z) ^ 2 * (x * y + y * z + z * x) ^ 2\n + 11 * (x + y + z) * (x * y + y * z + z * x) * x * y * z\n\n/-- The right-hand side of the displayed inequality. -/\ndef rhs (x y z : ℝ) : ℝ :=\n 6 * x * y * z * (x + y + z) ^ 3 + 18 * x ^ 2 * y ^ 2 * z ^ 2\n\n/-- The displayed inequality, for arbitrary real `x`, `y`, and `z`. -/\ndef Inequality (x y z : ℝ) : Prop :=\n lhs x y z ≥ rhs x y z\n\n/-- The complete asserted statement: for every triple of real numbers satisfying\n`1 / 2 ≤ x, y, z ≤ 1`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98de9ba0-08f0-5914-bf0a-8759a8521fe4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3bcef3b785c69a99e2d507dc97a904108bce0b5ee301ca3b85a926c5825b30a4", "task_path": "tasks/nmp3_98de9ba0-08f0-5914-bf0a-8759a8521fe4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98de9ba0-08f0-5914-bf0a-8759a8521fe4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_98e6a3f3-87b5-504e-aa27-7a1763eed394", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x$ and $y$ be integers with $x\\neq\\pm y$. If \n-- $$x^2-y^2\\mid x^2+y^2-2,$$ \n-- prove that $x^2-y^2$ and $x^2+y^2-2$ have exactly the same set of prime divisors (i.e., each prime dividing one of the numbers also divides the other).\nimport Mathlib.Data.Int.Basic\nimport Mathlib.Data.Nat.Prime.Basic\nimport Mathlib.Data.Set.Basic\n\n/-!\n# Formalization of the target statement\n\nThe source problem asks, for integers `x` and `y` with `x ≠ ±y`, to prove that\nthe divisibility condition `x^2 - y^2 ∣ x^2 + y^2 - 2` implies that the two\nintegers have exactly the same prime divisors.\n\nThis file merely states the problem as a proposition. It does not prove it.\n-/\n\nnamespace Problem\n\n/-- The set of (positive) prime divisors of an integer. -/\ndef primeDivisorSet (n : ℤ) : Set ℕ :=\n {p : ℕ | Nat.Prime p ∧ (p : ℤ) ∣ n}\n\n/-- Two integers have exactly the same set of prime divisors. -/\ndef SamePrimeDivisors (m n : ℤ) : Prop :=\n primeDivisorSet m = primeDivisorSet n\n\n/-- The full proposition asserted by the source problem. -/\ndef Target : Prop :=\n ∀ (x y : ℤ), x ≠ y ∧ x ≠ -y →\n (x ^ 2 - y ^ 2 : ℤ) ∣ (x ^ 2 + y ^ 2 - 2 : ℤ) →\n SamePrimeDivisors (x ^ 2 - y ^ 2) (x ^ 2 + y ^ 2 - 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98e6a3f3-87b5-504e-aa27-7a1763eed394", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9b91a8bb79609211d481dece6e20da62129b8d3785af57a9e0654832a77e22b7", "task_path": "tasks/nmp3_98e6a3f3-87b5-504e-aa27-7a1763eed394", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98e6a3f3-87b5-504e-aa27-7a1763eed394", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_98f2aa81-dc19-57d9-ac38-e83822004c6b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $ab+bc+ca=3$. Prove that \n-- \\[\n-- \\frac{1}{\\sqrt{2a^{2}+5ab+2b^{2}}}+\\frac{1}{\\sqrt{2b^{2}+5bc+2c^{2}}}+\\frac{1}{\\sqrt{2c^{2}+5ca+2a^{2}}}\\ge 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThis file formalizes the statement of the problem, not its proof.\n-/\n\nnamespace Problem\n\n/-- The admissible triples: three positive real numbers satisfying\n`ab + bc + ca = 3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = (3 : ℝ)\n\n/-- One summand from the left-hand side, with denominator\n`sqrt (2x^2 + 5xy + 2y^2)`. -/\nnoncomputable def summand (x y : ℝ) : ℝ :=\n (1 : ℝ) /\n Real.sqrt ((2 : ℝ) * x ^ 2 + (5 : ℝ) * x * y + (2 : ℝ) * y ^ 2)\n\n/-- The complete left-hand side, cyclically using the pairs `(a,b)`,\n`(b,c)`, and `(c,a)`. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n summand a b + summand b c + summand c a\n\n/-- The assertion to be proved: for all positive real numbers `a`, `b`, `c`\nwith `ab + bc + ca = 3`, the cyclic sum is at least `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b + b * c + c * a = (3 : ℝ) →\n lhs a b c ≥ (1 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98f2aa81-dc19-57d9-ac38-e83822004c6b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6e0a009a5e9969938d3420a7d8f1c5e1a1efb9796aa0ac0e4cf382b03c674ea8", "task_path": "tasks/nmp3_98f2aa81-dc19-57d9-ac38-e83822004c6b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "98f2aa81-dc19-57d9-ac38-e83822004c6b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_99045924-9920-5010-a9a3-c1a08b6d51ee", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive integers $x,\\;y,\\;k,\\;m,\\;n$, the integer $4kxy-1$ never divides $x^{m}+y^{n}$; i.e. $4kxy-1 \\nmid x^{m}+y^{n}$.\nimport Mathlib\n\n/-!\n# Formal statement for the problem\n\nThe source problem asks to prove that, for every five positive integers\n`x, y, k, m, n`, the integer `4*k*x*y - 1` does not divide\n`x^m + y^n`.\n\nThe expression `4*k*x*y - 1` and the dividend are interpreted in the\nintegers, as indicated by the source wording \"the integer\". The positive\ninteger parameters are represented by natural numbers with explicit\npositivity hypotheses; `m` and `n` therefore directly serve as natural\nexponents.\n-/\n\nnamespace Problem\n\n/-- The proposition asserted in the source problem: for all positive integers\n`x`, `y`, `k`, `m`, and `n`, the integer `4*k*x*y - 1` does not divide\n`x^m + y^n`. -/\ndef Target : Prop :=\n ∀ x y k m n : ℕ,\n 0 < x → 0 < y → 0 < k → 0 < m → 0 < n →\n ¬ ((4 : ℤ) * (k : ℤ) * (x : ℤ) * (y : ℤ) - 1 ∣\n (x : ℤ) ^ m + (y : ℤ) ^ n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99045924-9920-5010-a9a3-c1a08b6d51ee", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3dd12fab8b6b90e2072ce0243685097777465c6022ee050b508e1903c6b9b337", "task_path": "tasks/nmp3_99045924-9920-5010-a9a3-c1a08b6d51ee", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99045924-9920-5010-a9a3-c1a08b6d51ee", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_99067707-3cda-5558-b500-b10c352fe30e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \n-- \\[\n-- E_n=\\frac{(3n)!}{\\,n!\\,(n+1)!\\,(n+2)!\\,}.\n-- \\]\n-- Prove that $E_n$ is a positive integer for every integer $n\\ge 3$.\nimport Mathlib\n\n/-!\n# Formal statement for the factorial quotient problem\n\nThe source problem defines\n`E_n = (3n)! / (n! (n+1)! (n+2)!)`\nand asks to prove that `E_n` is a positive integer for every integer `n ≥ 3`.\n\nThe factorial arguments are nonnegative under the hypothesis `n ≥ 3`, so the\ninteger variable is represented by a natural number `n` with `3 ≤ n`. The\nquotient is represented in `ℚ`, and the conclusion asserts the existence of a\npositive natural number equal to that quotient.\n-/\n\nnamespace Problem\n\n/-- The rational value of `(3n)! / (n! (n+1)! (n+2)!)`. -/\ndef E (n : ℕ) : ℚ :=\n (Nat.factorial (3 * n) : ℚ) /\n ((Nat.factorial n : ℚ) * (Nat.factorial (n + 1) : ℚ) *\n (Nat.factorial (n + 2) : ℚ))\n\n/-- For every natural `n ≥ 3`, the quotient `E n` is a positive integer. -/\ndef Target : Prop :=\n ∀ n : ℕ, 3 ≤ n → ∃ m : ℕ, 0 < m ∧ E n = (m : ℚ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99067707-3cda-5558-b500-b10c352fe30e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "608661c674fdb924a813753cac440f676a42e8618f164909015f81c93ce96593", "task_path": "tasks/nmp3_99067707-3cda-5558-b500-b10c352fe30e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99067707-3cda-5558-b500-b10c352fe30e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_99098378-591b-5cc6-9684-aec73a25de7c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $a,b,c,d$,\n-- \\[\n-- \\frac{a^{2}}{b^{2}}+\\frac{b^{2}}{c^{2}}+\\frac{c^{2}}{d^{2}}+\\frac{d^{2}}{a^{2}}\n-- \\;\\ge\\;\n-- \\frac{a+b+c+d}{\\sqrt[4]{abcd}}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The nonnegative real fourth root of `x`, represented as the nested\nprincipal real square root. On nonnegative inputs this is the unique\nnonnegative `y` with `y ^ 4 = x`. -/\nnoncomputable def fourthRoot (x : ℝ) : ℝ :=\n Real.sqrt (Real.sqrt x)\n\n/-- The assertion from the problem: for all positive real numbers `a`, `b`,\n`c`, and `d`,\n$$\n\\frac{a^2}{b^2}+\\frac{b^2}{c^2}+\\frac{c^2}{d^2}+\\frac{d^2}{a^2}\n\\ge\n\\frac{a+b+c+d}{\\sqrt[4]{abcd}}.\n$$ -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 0 < d →\n a ^ 2 / b ^ 2 + b ^ 2 / c ^ 2 + c ^ 2 / d ^ 2 + d ^ 2 / a ^ 2\n ≥ (a + b + c + d) / fourthRoot (a * b * c * d)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99098378-591b-5cc6-9684-aec73a25de7c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f3e8d2a25e3edc62de1d74f7d1d62fcd1b4b43e20472c138741629a1b01d1c34", "task_path": "tasks/nmp3_99098378-591b-5cc6-9684-aec73a25de7c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99098378-591b-5cc6-9684-aec73a25de7c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9931851e-77ad-5f8a-960f-c400c02959ea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that an integer $a$ is a perfect square in $\\mathbb Z$ if and only if for every prime $p$ the residue class $\\overline a$ of $a$ modulo $p$ is a square (quadratic residue) in the finite field $\\mathbb Z/p\\mathbb Z$.\nimport Mathlib\n\nnamespace Problem\n\n/-- An integer `a` is a perfect square in `ℤ`, i.e. it is the square of an integer. -/\ndef PerfectSquareInInt (a : ℤ) : Prop :=\n ∃ b : ℤ, a = b ^ 2\n\n/-- The residue class of the integer `a` modulo `p`, regarded as an element of `ZMod p`. -/\ndef residueClass (a : ℤ) (p : ℕ) : ZMod p :=\n (a : ZMod p)\n\n/-- The residue class of `a` modulo a prime `p` is a square in the finite field `ZMod p`. -/\ndef isQuadraticResidueModulo (a : ℤ) (p : ℕ) (hp : Nat.Prime p) : Prop :=\n letI : Fact p.Prime := ⟨hp⟩\n IsSquare (residueClass a p)\n\n/-- The equivalence of the problem, stated for a fixed integer `a`. -/\ndef TargetFor (a : ℤ) : Prop :=\n PerfectSquareInInt a ↔\n ∀ (p : ℕ) (hp : Nat.Prime p), isQuadraticResidueModulo a p hp\n\n/-- The full assertion: for every integer `a`, `a` is a perfect square in `ℤ` if and only if\nits residue class modulo every prime `p` is a square in the finite field `ZMod p`. -/\ndef Target : Prop :=\n ∀ a : ℤ, TargetFor a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9931851e-77ad-5f8a-960f-c400c02959ea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d40f51b52f02017989a219d8d32c023aaeab4af9f481b7298f98c9d3f0a64918", "task_path": "tasks/nmp3_9931851e-77ad-5f8a-960f-c400c02959ea", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9931851e-77ad-5f8a-960f-c400c02959ea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_99398bfa-09c7-57a4-aacf-edede997c3b5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n,m,k,\\ell$ be positive integers with $n\\neq1$ such that $n^k+mn^\\ell+1$ divides $n^{k+\\ell}-1$. Prove that either \n-- 1) $m=1$ and $\\ell=2k$, or \n-- 2) $\\ell\\mid k$ and $m=\\displaystyle\\frac{n^{\\,k-\\ell}-1}{\\,n^\\ell-1}\\,.$\nimport Mathlib\n\n/-!\n# Formal statement for the divisibility problem\n\nThe original problem asks to prove, for positive integers `n`, `m`, `k`, and `l`\nwith `n ≠ 1`, that a certain divisibility hypothesis forces one of two\nexplicit alternatives.\n\nThe displayed fraction in the second alternative is interpreted as an equality\nin the rational numbers. Its denominator is nonzero under the hypotheses:\n`0 < n`, `n ≠ 1`, and `0 < l` imply `2 ≤ n` and hence `n ^ l ≠ 1`.\n-/\n\nnamespace Problem\n\n/-- The positivity assumptions on the four integer parameters. -/\ndef PositiveParameters (n m k l : ℕ) : Prop :=\n 0 < n ∧ 0 < m ∧ 0 < k ∧ 0 < l\n\n/-- The divisibility hypothesis from the problem statement. -/\ndef DivisibilityHypothesis (n m k l : ℕ) : Prop :=\n (n ^ k + m * n ^ l + 1) ∣ (n ^ (k + l) - 1)\n\n/-- All assumptions of the original problem. -/\ndef Hypotheses (n m k l : ℕ) : Prop :=\n PositiveParameters n m k l ∧\n n ≠ 1 ∧\n DivisibilityHypothesis n m k l\n\n/-- The first alternative in the conclusion. -/\ndef CaseOne (m k l : ℕ) : Prop :=\n m = 1 ∧ l = 2 * k\n\n/-- The second alternative in the conclusion. -/\ndef CaseTwo (n m k l : ℕ) : Prop :=\n l ∣ k ∧\n (m : ℚ) =\n ((n : ℚ) ^ (k - l) - 1) / ((n : ℚ) ^ l - 1)\n\n/-- The conclusion: the disjunction of the two listed alternatives. -/\ndef Conclusion (n m k l : ℕ) : Prop :=\n CaseOne m k l ∨ CaseTwo n m k l\n\n/--\nThe complete formal assertion of the problem: for every four positive integers\n`n`, `m`, `k`, and `l` with `n ≠ 1`, if\n`n ^ k + m * n ^ l + 1` divides `n ^ (k + l) - 1`, then either\n`m = 1` and `l = 2 * k`, or `l ∣ k` and\n`m = (n ^ (k - l) - 1) / (n ^ l - 1)` in `ℚ`.\n-/\ndef Target : Prop :=\n ∀ n m k l : ℕ, Hypotheses n m k l → Conclusion n m k l\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99398bfa-09c7-57a4-aacf-edede997c3b5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b37448775046763e759f00f8d10c2fb356f351bdf1fc4901574bcd89d55fb847", "task_path": "tasks/nmp3_99398bfa-09c7-57a4-aacf-edede997c3b5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99398bfa-09c7-57a4-aacf-edede997c3b5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_99488fe4-95cc-5064-85f9-85c0bf35fc5d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ with $xyz=1$. Prove that \n-- $$\\frac{\\sqrt{x}}{x^2+1}+\\frac{\\sqrt{y}}{y^2+1}+\\frac{\\sqrt{z}}{z^2+1}\\le\\frac32\\,.$$\nimport Mathlib.Analysis.Real.Sqrt\n\nnamespace Problem\n\n/-- The admissibility conditions from the problem: `x`, `y`, and `z` are positive\nreal numbers whose product is `1`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x * y * z = 1\n\n/-- The left-hand side of the inequality to be proved. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n Real.sqrt x / (x ^ 2 + 1) +\n Real.sqrt y / (y ^ 2 + 1) +\n Real.sqrt z / (z ^ 2 + 1)\n\n/-- The right-hand side of the inequality to be proved. -/\nnoncomputable def rhs : ℝ := (3 : ℝ) / 2\n\n/-- The full quantified statement: for all positive real `x`, `y`, and `z`\nwith `x * y * z = 1`, the given sum is at most `3 / 2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → lhs x y z ≤ rhs\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99488fe4-95cc-5064-85f9-85c0bf35fc5d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "42d7ae9228625a7bff32afd1084454224ddec0093c3c75f53c02c4b10d5ced5a", "task_path": "tasks/nmp3_99488fe4-95cc-5064-85f9-85c0bf35fc5d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99488fe4-95cc-5064-85f9-85c0bf35fc5d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9955d1f2-9e40-54ee-963d-467cf4420d02", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A polynomial $f(x)$ with integer coefficients is given. Define $d(a,k)=|f^{k}(a)-a|$, where $f^{k}$ denotes the $k$‑fold iterate ($f^{0}(x)=x$, $f^{k}(x)=f(f^{k-1}(x))$). It is known that for each integer $a$ and each natural number $k\\ge1$, $d(a,k)>0$ (i.e. $f^{k}(a)\\neq a$). Prove that for all such $a$ and $k$,\n-- $$d(a,k)\\ge\\frac{k}{3}\\,.$$\nimport Mathlib\n\n/-!\n# Formalization of an integer-polynomial iterated-distance lower bound\n\nThe source problem concerns a polynomial with integer coefficients. It uses\n`f^k` for the `k`-fold iterate of the induced map on the integers and\n`d(a,k) = |f^k(a) - a|`. The assumed positivity of these distances is stated\nas a hypothesis, and the desired conclusion is the real-valued lower bound\n`d(a,k) ≥ k / 3`.\n-/\n\nnamespace Problem\n\n/-- The map `ℤ → ℤ` obtained by evaluating an integer-coefficient polynomial. -/\ndef polynomialMap (f : Polynomial ℤ) (a : ℤ) : ℤ :=\n Polynomial.eval a f\n\n/-- The `k`-fold iterate of the integer map induced by `f`, with the usual\nconvention that the zeroth iterate is the identity. -/\ndef iterate (f : Polynomial ℤ) (k : ℕ) (a : ℤ) : ℤ :=\n (polynomialMap f)^[k] a\n\n/-- The distance `d(a,k) = |f^k(a) - a|`.\n\nSince `f^k(a) - a` is an integer, this uses the integer absolute value and\nkeeps `d` integer-valued; its value is coerced to `ℝ` for comparison with\n`k / 3`. -/\ndef d (f : Polynomial ℤ) (a : ℤ) (k : ℕ) : ℤ :=\n |iterate f k a - a|\n\n/-- The stated positivity hypothesis: for every integer `a` and every natural\nnumber `k ≥ 1`, one has `d(a,k) > 0`. -/\ndef HasPositiveDistances (f : Polynomial ℤ) : Prop :=\n ∀ (a : ℤ) (k : ℕ), 1 ≤ k → 0 < d f a k\n\n/-- The parenthetical reformulation of the hypothesis: no integer point is\nperiodic with a positive period. Because `d` is the integer absolute value of\n`f^k(a) - a`, this is equivalent to `HasPositiveDistances f`. -/\ndef HasNoPositiveIntegerPeriodicPoints (f : Polynomial ℤ) : Prop :=\n ∀ (a : ℤ) (k : ℕ), 1 ≤ k → iterate f k a ≠ a\n\n/-- For a fixed integer-coefficient polynomial, assuming the stated distance\npositivity hypothesis, every integer `a` and natural `k ≥ 1` satisfies\n`d(a,k) ≥ k/3`, with the right-hand side interpreted in `ℝ`. -/\ndef BoundHoldsFor (f : Polynomial ℤ) : Prop :=\n HasPositiveDistances f →\n ∀ (a : ℤ) (k : ℕ), 1 ≤ k → (d f a k : ℝ) ≥ (k : ℝ) / 3\n\n/-- The full source statement: for every integer-coefficient polynomial `f`\nsatisfying the stated positivity hypothesis, and for every integer `a` and\nnatural number `k ≥ 1`, the inequality `d(a,k) ≥ k/3` holds. -/\ndef Target : Prop :=\n ∀ f : Polynomial ℤ, BoundHoldsFor f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9955d1f2-9e40-54ee-963d-467cf4420d02", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d12f9ebd51ddc52e1b660ae89bca781df7bc7f75a4596383df579bde21a7e90b", "task_path": "tasks/nmp3_9955d1f2-9e40-54ee-963d-467cf4420d02", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9955d1f2-9e40-54ee-963d-467cf4420d02", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_99af2a15-f34e-5284-b97e-8009211957f9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. Prove that \n-- \n-- \\[\n-- \\sum_{0\\le i,j\\le 2n-1}\\Biggl(\\binom{i}{j}\\binom{2n-i-1}{\\,n-j-1\\,}\\Biggr)^2\n-- =\\frac12\\binom{4n}{2n-1},\n-- \\]\n-- \n-- where we adopt the convention $\\binom{i}{j}=0$ for $im$).\nimport Mathlib.Data.Nat.Choose.Basic\nimport Mathlib.Data.Fin.Basic\nimport Mathlib.Data.Fintype.Fin\nimport Mathlib.Algebra.BigOperators.Group.Finset.Basic\nimport Mathlib.Data.Rat.Defs\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The binomial coefficient extended to integer arguments by the convention\n`C(a, b) = 0` whenever `b < 0`, `a < 0`, or `b > a`. For `0 ≤ b ≤ a` it is\nthe usual natural-number binomial coefficient. -/\ndef ExtendedBinomial (a b : ℤ) : ℤ :=\n if 0 ≤ b ∧ b ≤ a then Nat.choose a.toNat b.toNat else 0\n\n/-- The summand appearing in the double sum, as a rational number. -/\ndef Summand (n i j : ℕ) : ℚ :=\n (((ExtendedBinomial (i : ℤ) (j : ℤ) : ℚ) *\n (ExtendedBinomial (2 * (n : ℤ) - (i : ℤ) - 1)\n ((n : ℤ) - (j : ℤ) - 1) : ℚ)) ^ 2)\n\n/-- The left-hand side of the asserted identity:\n`∑_{0 ≤ i,j ≤ 2n-1} (C(i,j) C(2n-i-1,n-j-1))^2`. -/\ndef LHS (n : ℕ) : ℚ :=\n ∑ i : Fin (2 * n), ∑ j : Fin (2 * n), Summand n i.val j.val\n\n/-- The right-hand side of the asserted identity:\n`(1/2) * C(4n, 2n-1)`. -/\ndef RHS (n : ℕ) : ℚ :=\n (1 / 2 : ℚ) * (Nat.choose (4 * n) (2 * n - 1) : ℚ)\n\n/-- The full statement: for every positive integer `n`, the double sum over\n`0 ≤ i,j ≤ 2n-1` equals one half of `C(4n, 2n-1)`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → LHS n = RHS n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99af2a15-f34e-5284-b97e-8009211957f9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0d854c82dadd7c61e0a8f09f6188d12509dbc833f12e4452a1707554c5413a43", "task_path": "tasks/nmp3_99af2a15-f34e-5284-b97e-8009211957f9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99af2a15-f34e-5284-b97e-8009211957f9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_99bca8e6-0378-53c9-bc33-9e3260c65c57", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers \\(a,b,c\\) prove that \n-- \n-- \\[\n-- \\frac{a^{3}(b+c-a)}{a^{2}+bc}+\\frac{b^{3}(c+a-b)}{b^{2}+ca}+\\frac{c^{3}(a+b-c)}{c^{2}+ab}\\le\\frac{ab+bc+ca}{2}\\,. \n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\nthe inequality\n`a^3 (b+c-a)/(a^2+bc) + b^3 (c+a-b)/(b^2+ca)\n + c^3 (a+b-c)/(c^2+ab) ≤ (ab+bc+ca)/2`.\n\nThe declarations below spell out all domains, assumptions, and the conclusion.\n-/\n\nnamespace Problem\n\n/-- The three real numbers `a`, `b`, and `c` are all strictly positive. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the inequality, as a real-valued expression. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 3 * (b + c - a) / (a ^ 2 + b * c) +\n b ^ 3 * (c + a - b) / (b ^ 2 + c * a) +\n c ^ 3 * (a + b - c) / (c ^ 2 + a * b)\n\n/-- The right-hand side of the inequality, as a real-valued expression. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a * b + b * c + c * a) / 2\n\n/-- The asserted inequality for a particular triple of real numbers. -/\nnoncomputable def InequalityHolds (a b c : ℝ) : Prop :=\n lhs a b c ≤ rhs a b c\n\n/-- The complete universal statement from the problem: for every triple of\nstrictly positive real numbers, the displayed inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99bca8e6-0378-53c9-bc33-9e3260c65c57", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "546b4e5e7fb74d5b50d647552f39457a8660167c23f0842dd43d3136a3fdc862", "task_path": "tasks/nmp3_99bca8e6-0378-53c9-bc33-9e3260c65c57", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99bca8e6-0378-53c9-bc33-9e3260c65c57", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_99d6b13e-7e44-5c94-b029-19d8b47f8850", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be a prime number with $p\\equiv1\\pmod4$. Prove that there exist infinitely many positive integers $n$ such that \n-- \\[\n-- \\big\\lfloor n\\sqrt p\\big\\rfloor\n-- \\] \n-- is a perfect square.\nimport Mathlib\n\nnamespace Problem\n\n/-- An integer is a perfect square when it is the square of a natural number.\nThis includes `0`, as is standard. -/\ndef IsPerfectSquare (z : ℤ) : Prop :=\n ∃ k : ℕ, z = (k : ℤ) ^ 2\n\n/-- For a fixed natural number `p`, the positive integers `n` whose corresponding\nfloor is a perfect square. The positivity of `n` is part of the admissibility\ncondition, not an implicit restriction on the set. -/\ndef Admissible (p n : ℕ) : Prop :=\n 0 < n ∧ IsPerfectSquare ⌊(n : ℝ) * Real.sqrt (p : ℝ)⌋\n\n/-- The set of positive integers `n` admissible for `p`. -/\ndef SolutionSet (p : ℕ) : Set ℕ :=\n {n : ℕ | Admissible p n}\n\n/-- The assertion of the problem: for every prime `p` congruent to `1` modulo `4`,\nthere are infinitely many positive integers `n` for which\n`⌊n * sqrt p⌋` is a perfect square. -/\ndef Target : Prop :=\n ∀ p : ℕ, Nat.Prime p → p % 4 = 1 → (SolutionSet p).Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99d6b13e-7e44-5c94-b029-19d8b47f8850", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dabd3710b1dc354b3c0b877be40629cc1563e3448b80a4d15345e84d5b29fc82", "task_path": "tasks/nmp3_99d6b13e-7e44-5c94-b029-19d8b47f8850", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "99d6b13e-7e44-5c94-b029-19d8b47f8850", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9a03b155-f451-52ee-99b9-c7a1bce3f106", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $(a+b)(b+c)(c+a)=8$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{1}{a^{2}+ab+b^{2}}\\ge\\frac{ab+bc+ca}{a+b+c}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the cyclic reciprocal inequality\n\nThis file states, without proof, the assertion from the source problem.\n\nFor positive real numbers `a`, `b`, and `c` satisfying\n`(a + b) * (b + c) * (c + a) = 8`, the cyclic sum\n`1 / (a ^ 2 + a * b + b ^ 2)` is asserted to be at least\n`(a * b + b * c + c * a) / (a + b + c)`.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum on the left-hand side of the asserted inequality. -/\nnoncomputable def cyclicReciprocalSum (a b c : ℝ) : ℝ :=\n 1 / (a ^ 2 + a * b + b ^ 2) +\n 1 / (b ^ 2 + b * c + c ^ 2) +\n 1 / (c ^ 2 + c * a + a ^ 2)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n (a * b + b * c + c * a) / (a + b + c)\n\n/-- The formal statement of the original problem: for every triple of positive\nreal numbers satisfying `(a + b)(b + c)(c + a) = 8`, the cyclic reciprocal\nsum is at least `(ab + bc + ca) / (a + b + c)`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (a + b) * (b + c) * (c + a) = 8 →\n cyclicReciprocalSum a b c ≥ rightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a03b155-f451-52ee-99b9-c7a1bce3f106", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7c7520f0313091c1079def0d6925dbf2b7ca7d4b9e1898acac36a816a2dae1bf", "task_path": "tasks/nmp3_9a03b155-f451-52ee-99b9-c7a1bce3f106", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a03b155-f451-52ee-99b9-c7a1bce3f106", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9a111021-4e9f-59fb-8c5d-0257cdd932a9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A function $\\psi\\colon\\mathbb Z\\to\\mathbb Z$ is called **zero‑requiem** if for every positive integer $n$ and every integers $a_1,\\dots,a_n$ (not necessarily distinct) the two sums \n-- \\[\n-- \\sum_{i=1}^n a_i\\qquad\\text{and}\\qquad\\sum_{i=1}^n\\psi(a_i)\n-- \\]\n-- are never both equal to $0$. \n-- \n-- Let $f$ and $g$ be zero‑requiem functions such that $f\\circ g$ and $g\\circ f$ are the identity on $\\mathbb Z$ (so $f$ and $g$ are mutually inverse bijections). \n-- Assume that the pointwise sum $f+g$ (i.e. $(f+g)(x)=f(x)+g(x)$) is **not** a zero‑requiem function. \n-- \n-- Prove that both $f\\circ f$ and $g\\circ g$ are zero‑requiem functions.\n/-\nFormalization of the statement in `problem.md`.\n\nA function ψ : ℤ → ℤ is called zero-requiem when, for every positive\nlength n and every finite integer sequence a : Fin n → ℤ, the two sums\n∑ i, a i and ∑ i, ψ (a i) are not both zero.\n-/\n\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- `IsZeroRequiem ψ` says that no nonempty finite integer sequence `a`\nhas both `∑ i, a i = 0` and `∑ i, ψ (a i) = 0`.\n\nThe index type `Fin n` together with the hypothesis `0 < n` represents\nthe source's quantifier over every positive integer `n` and every choice\nof integers `a_1, ..., a_n`. The entries of `a` need not be distinct. -/\ndef IsZeroRequiem (ψ : ℤ → ℤ) : Prop :=\n ∀ (n : ℕ), 0 < n → ∀ a : Fin n → ℤ,\n ¬ ((∑ i : Fin n, a i) = 0 ∧ (∑ i : Fin n, ψ (a i)) = 0)\n\n/-- The formal statement of the problem.\n\nFor all functions `f g : ℤ → ℤ` which are zero-requiem, which are\nmutually inverse via `f ∘ g = id` and `g ∘ f = id`, and whose\npointwise sum `f + g` is not zero-requiem, the self-compositions\n`f ∘ f` and `g ∘ g` are both zero-requiem. -/\ndef Target : Prop :=\n ∀ (f g : ℤ → ℤ),\n IsZeroRequiem f →\n IsZeroRequiem g →\n (f ∘ g = (id : ℤ → ℤ)) →\n (g ∘ f = (id : ℤ → ℤ)) →\n ¬ IsZeroRequiem (fun x : ℤ => f x + g x) →\n IsZeroRequiem (f ∘ f) ∧ IsZeroRequiem (g ∘ g)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a111021-4e9f-59fb-8c5d-0257cdd932a9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4ef837b13524a56abead28d7aed94425c5bbb3145224eca99fe21682e8bb905a", "task_path": "tasks/nmp3_9a111021-4e9f-59fb-8c5d-0257cdd932a9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a111021-4e9f-59fb-8c5d-0257cdd932a9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9a236e97-301f-503f-aafd-ac0da53afd47", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{ab(a^3+b^3)}{a^2+b^2}+\\frac{bc(b^3+c^3)}{b^2+c^2}+\\frac{ca(c^3+a^3)}{c^2+a^2}\\ge\\sqrt{3abc\\,(a^3+b^3+c^3)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a positive-real inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\nthe inequality\n\n`ab(a^3+b^3)/(a^2+b^2) + bc(b^3+c^3)/(b^2+c^2)\n + ca(c^3+a^3)/(c^2+a^2)\n ≥ sqrt(3abc(a^3+b^3+c^3))`.\n\nThis file only states the problem; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * b * (a ^ 3 + b ^ 3) / (a ^ 2 + b ^ 2) +\n b * c * (b ^ 3 + c ^ 3) / (b ^ 2 + c ^ 2) +\n c * a * (c ^ 3 + a ^ 3) / (c ^ 2 + a ^ 2)\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n Real.sqrt (3 * a * b * c * (a ^ 3 + b ^ 3 + c ^ 3))\n\n/-- The universally quantified assertion of the source problem:\nfor all positive real numbers `a`, `b`, and `c`, the displayed inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → rhs a b c ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a236e97-301f-503f-aafd-ac0da53afd47", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "38bb809c02ee939bcf02d289a2c3fa9c95863128d55f7e629850ac3813dc49d1", "task_path": "tasks/nmp3_9a236e97-301f-503f-aafd-ac0da53afd47", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a236e97-301f-503f-aafd-ac0da53afd47", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9a30cdb3-2762-55ff-8a7a-acd77825a314", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For every integer \\(k>1\\) prove that there exists a real number \\(x\\) such that for every positive integer \\(n\\) with \\(1\\le n\\le1397\\) (i.e. \\(n<1398\\)),\n-- \\[\n-- \\{x^{n}\\}<\\{x^{\\,n-1}\\}\\quad\\Longleftrightarrow\\quad k\\mid n,\n-- \\]\n-- where \\(\\{y\\}=y-\\lfloor y\\rfloor\\) denotes the fractional part of \\(y\\).\nimport Mathlib\n\n/-!\n# Formal statement for the fractional-part problem\n\nFor every integer `k > 1`, there is a real `x` such that, for every positive\ninteger `n ≤ 1397`, the fractional part of `x ^ n` is strictly less than the\nfractional part of `x ^ (n - 1)` exactly when `k` divides `n`.\n\nThe declarations below only state the problem. In particular, `Problem.Target`\nis a proposition and is not supplied with a proof.\n-/\n\nnamespace Problem\n\n/-- The property that a real number `x` satisfies the required equivalence for\nthe fixed integer `k`, uniformly for all positive natural numbers `n ≤ 1397`.\n\nThe exponent `n - 1` is natural-number subtraction; on the quantified range\n`1 ≤ n`, it agrees with the ordinary predecessor of `n`. -/\ndef Admissible (k : ℤ) (x : ℝ) : Prop :=\n ∀ n : ℕ, 1 ≤ n → n ≤ 1397 →\n (Int.fract (x ^ n) < Int.fract (x ^ (n - 1)) ↔ k ∣ (n : ℤ))\n\n/-- For every integer `k > 1`, some real `x` satisfies the fractional-part\nequivalence for all positive integers `n` from `1` through `1397`. -/\ndef Target : Prop :=\n ∀ k : ℤ, 1 < k → ∃ x : ℝ, Admissible k x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a30cdb3-2762-55ff-8a7a-acd77825a314", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f0d9ab285d02974a28581a06fada7d4122c455f2973b1ac323e7982109fdfd8a", "task_path": "tasks/nmp3_9a30cdb3-2762-55ff-8a7a-acd77825a314", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a30cdb3-2762-55ff-8a7a-acd77825a314", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9a32c15f-f205-5a62-93cf-55f0a776ae8c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A polygon is monochromatic if all its vertices are coloured by the same colour. Suppose every point of the plane is coloured red or blue. Prove that in any such red‑blue colouring there must exist either a monochromatic equilateral triangle of side length 2, or a monochromatic equilateral triangle of side length √3, or a monochromatic rhombus whose sides all have length 1.\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real two-dimensional Euclidean space. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The two possible colours of a point. -/\ninductive Color : Type where\n | red : Color\n | blue : Color\n\n/-- A set of points is monochromatic under a colouring when one colour is used on\nall of its points. In the problem this is applied to the vertex set of a polygon. -/\ndef Monochromatic (colouring : Plane → Color) (vertices : Set Plane) : Prop :=\n ∃ colour : Color, ∀ point : Plane, point ∈ vertices → colouring point = colour\n\n/-- Four points, in the indicated cyclic order, form a parallelogram when their\ndiagonals have the same midpoint. In a real vector space this is equivalent to\n`a + c = b + d`. -/\ndef IsParallelogram (a b c d : Plane) : Prop :=\n a + c = b + d\n\n/-- Three distinct points are the vertices of an equilateral triangle of side length\n`side`. The vertices are not required here to be in any particular order. -/\ndef IsEquilateralTriangleOfSide (side : ℝ) (a b c : Plane) : Prop :=\n a ≠ b ∧ b ≠ c ∧ c ≠ a ∧\n dist a b = side ∧ dist b c = side ∧ dist c a = side\n\n/-- There is a monochromatic equilateral triangle of the prescribed side length. -/\ndef HasMonochromaticEquilateralTriangle\n (colouring : Plane → Color) (side : ℝ) : Prop :=\n ∃ a b c : Plane,\n IsEquilateralTriangleOfSide side a b c ∧\n Monochromatic colouring ({a, b, c} : Set Plane)\n\n/-- Four distinct points, in cyclic order, are the vertices of a rhombus of side\nlength `side`. A rhombus is taken in its standard nondegenerate sense: a\nparallelogram whose four sides have the prescribed length. -/\ndef IsRhombusOfSide (side : ℝ) (a b c d : Plane) : Prop :=\n a ≠ b ∧ b ≠ c ∧ c ≠ d ∧ d ≠ a ∧ a ≠ c ∧ b ≠ d ∧\n IsParallelogram a b c d ∧\n dist a b = side ∧ dist b c = side ∧\n dist c d = side ∧ dist d a = side\n\n/-- There is a monochromatic rhombus all of whose four sides have the prescribed\nlength. -/\ndef HasMonochromaticRhombus (colouring : Plane → Color) (side : ℝ) : Prop :=\n ∃ a b c d : Plane,\n IsRhombusOfSide side a b c d ∧\n Monochromatic colouring ({a, b, c, d} : Set Plane)\n\n/-- The conclusion required for a fixed red-blue colouring: one of the three\nmonochromatic configurations named in the problem exists. -/\ndef Conclusion (colouring : Plane → Color) : Prop :=\n HasMonochromaticEquilateralTriangle colouring (2 : ℝ) ∨\n HasMonochromaticEquilateralTriangle colouring (Real.sqrt (3 : ℝ)) ∨\n HasMonochromaticRhombus colouring (1 : ℝ)\n\n/-- The assertion of the problem: every red-blue colouring of the Euclidean plane\nsatisfies the required alternative. -/\ndef Target : Prop :=\n ∀ colouring : Plane → Color, Conclusion colouring\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a32c15f-f205-5a62-93cf-55f0a776ae8c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "037fd51236062d86f5db695fa378c2984747e1496a758610cd7da1ac38a66dbd", "task_path": "tasks/nmp3_9a32c15f-f205-5a62-93cf-55f0a776ae8c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a32c15f-f205-5a62-93cf-55f0a776ae8c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9a40bfc5-f33d-5686-a0bf-352f447f21c7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\sqrt[6]{\\frac{a+b}{a+c}}+\\sqrt[6]{\\frac{b+c}{b+a}}+\\sqrt[6]{\\frac{c+a}{c+b}}\\le \\frac{a+b+c}{\\sqrt[3]{abc}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the positive-real inequality\n\nThe original problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\n\n`(a+b)/(a+c)` sixth root + `(b+c)/(b+a)` sixth root + `(c+a)/(c+b)` sixth root\n ≤ `(a+b+c)` divided by the cube root of `a*b*c`.\n\nWe represent the principal real `n`-th root of a nonnegative number by\n`Real.rpow x (1 / n : ℝ)`. All radicands below are positive under the stated\npositivity assumptions, so this is the usual principal real radical.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The principal real sixth root, represented by the real power with exponent `1 / 6`. -/\nnoncomputable def sixthRoot (x : ℝ) : ℝ :=\n Real.rpow x ((1 : ℝ) / 6)\n\n/-- The principal real cube root, represented by the real power with exponent `1 / 3`. -/\nnoncomputable def cubeRoot (x : ℝ) : ℝ :=\n Real.rpow x ((1 : ℝ) / 3)\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n sixthRoot ((a + b) / (a + c)) +\n sixthRoot ((b + c) / (b + a)) +\n sixthRoot ((c + a) / (c + b))\n\n/-- The right-hand side of the inequality in the problem statement. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a + b + c) / cubeRoot (a * b * c)\n\n/-- The full inequality stated in the problem, for positive real `a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≤ rhs a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a40bfc5-f33d-5686-a0bf-352f447f21c7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "31ab7a3b355dfcfe5d59079074d27f0193a9417e2f7bc5f374119c8fe475f7dc", "task_path": "tasks/nmp3_9a40bfc5-f33d-5686-a0bf-352f447f21c7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a40bfc5-f33d-5686-a0bf-352f447f21c7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9a509f1d-7e0a-5de6-9e42-df7e446b5357", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ be real numbers. Prove that \n-- \\[\n-- \\sqrt{\\frac{2xy}{x^{2}+y^{2}}}+\\sqrt{\\frac{2yz}{y^{2}+z^{2}}}+\\sqrt{\\frac{2xz}{x^{2}+z^{2}}}\\ge 3\\left(\\frac{xy+yz+zx}{x^{2}+y^{2}+z^{2}}\\right)^{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable square-root inequality\n\nThe original problem asks one to prove, for positive real numbers `x`, `y`, and `z`,\nthe inequality\n`Real.sqrt (2xy / (x^2 + y^2)) + ... ≥ 3 * ((xy + yz + zx) / (x^2 + y^2 + z^2))^2`.\nThis file records that assertion as a proposition; it does not assert or prove it.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality:\n`√(2xy/(x²+y²)) + √(2yz/(y²+z²)) + √(2xz/(x²+z²))`. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n Real.sqrt (2 * x * y / (x ^ 2 + y ^ 2)) +\n Real.sqrt (2 * y * z / (y ^ 2 + z ^ 2)) +\n Real.sqrt (2 * x * z / (x ^ 2 + z ^ 2))\n\n/-- The right-hand side of the inequality:\n`3 * ((xy + yz + zx) / (x²+y²+z²))²`. -/\nnoncomputable def rhs (x y z : ℝ) : ℝ :=\n 3 * (((x * y + y * z + z * x) / (x ^ 2 + y ^ 2 + z ^ 2)) ^ 2)\n\n/-- The pointwise inequality asserted in the problem, for arbitrary real `x`, `y`, `z`.\nThe positivity hypotheses are supplied separately in `Target`, matching the problem's\nstanding assumption `x,y,z > 0`. -/\nnoncomputable def Inequality (x y z : ℝ) : Prop :=\n lhs x y z ≥ rhs x y z\n\n/-- The complete statement of the problem: for all positive real numbers `x`, `y`, and\n`z`, the sum of the three square roots is at least the squared normalized symmetric\nsum on the right. -/\nnoncomputable def Target : Prop :=\n ∀ (x y z : ℝ), 0 < x → 0 < y → 0 < z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a509f1d-7e0a-5de6-9e42-df7e446b5357", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "03e08918595eb3b1d9fe971110e256939fd36152f52d2d2079f899dd6c903821", "task_path": "tasks/nmp3_9a509f1d-7e0a-5de6-9e42-df7e446b5357", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a509f1d-7e0a-5de6-9e42-df7e446b5357", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9a6aed46-7517-5054-8746-e28b74a9e837", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let triangles $ADC$ and $ABC$ satisfy $AD=DC$, $AC=AB$, $\\angle CAB=20^\\circ$, and $\\angle ADC=100^\\circ$. Prove, without using trigonometry, that \n-- $$AB = BC + CD.$$\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\n/-!\n# Formalization of the statement of the angle and side-length problem\n\nThe source problem concerns four points in the Euclidean plane forming the\ntriangles `ADC` and `ABC`, with two side equalities and two specified angles,\nand asks for a proof of an additive relation among three side lengths.\n\nThis file states the resulting proposition. It does not prove it.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\nopen scoped EuclideanGeometry\n\n/-- The Euclidean plane used to interpret the planar triangle problem. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- An angle supplied in degrees, converted to radians. -/\ndef degreeToRadian (degrees : ℝ) : ℝ := degrees * Real.pi / 180\n\n/-- Three points are the vertices of a nondegenerate triangle exactly when they\nare not collinear. -/\ndef IsNondegenerateTriangle (X Y Z : Plane) : Prop :=\n ¬ Collinear ℝ ({X, Y, Z} : Set Plane)\n\n/-- The two nondegeneracy assumptions implicit in calling `ADC` and `ABC`\ntriangles. -/\ndef TriangleAssumptions (A B C D : Plane) : Prop :=\n IsNondegenerateTriangle A D C ∧\n IsNondegenerateTriangle A B C\n\n/-- The two side equalities and the two specified angles from the source\nproblem. -/\ndef SideAngleAssumptions (A B C D : Plane) : Prop :=\n dist A D = dist D C ∧\n dist A C = dist A B ∧\n ∠ C A B = degreeToRadian 20 ∧\n ∠ A D C = degreeToRadian 100\n\n/-- The geometric hypotheses of the problem, including the nondegeneracy implicit\nin calling `ADC` and `ABC` triangles. -/\ndef Hypotheses (A B C D : Plane) : Prop :=\n TriangleAssumptions A B C D ∧ SideAngleAssumptions A B C D\n\n/-- The desired side-length conclusion `AB = BC + CD`. -/\ndef Conclusion (A B C D : Plane) : Prop :=\n dist A B = dist B C + dist C D\n\n/-- The assertion for a fixed ordered quadruple of points. -/\ndef TargetFor (A B C D : Plane) : Prop :=\n Hypotheses A B C D → Conclusion A B C D\n\n/-- The full statement to be proved: for every four points of the Euclidean\nplane, if they form the stated two nondegenerate triangles and satisfy the two\nside equalities and the two angle equalities, then `AB = BC + CD`. -/\ndef Target : Prop :=\n ∀ (A B C D : Plane), TargetFor A B C D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a6aed46-7517-5054-8746-e28b74a9e837", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "edeb1019c80e3524e9c426a3871b9adbd7b8e0f799098f7608edc29ceb305c8b", "task_path": "tasks/nmp3_9a6aed46-7517-5054-8746-e28b74a9e837", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a6aed46-7517-5054-8746-e28b74a9e837", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9a7bc6e0-7f79-5855-9fe9-6c5faadc2ec4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ with $a+b+c>0$. Prove \n-- \\[\n-- \\frac{a}{a+b+7c}+\\frac{b}{b+c+7a}+\\frac{c}{c+a+7b}+\\frac{2}{3}\\cdot\\frac{ab+bc+ca}{a^{2}+b^{2}+c^{2}}\\le 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of a cyclic rational inequality\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, `c`\nwhose sum is positive, that a certain rational expression is at most `1`.\nThis file gives the data and the proposition to be proved; it does not contain\na proof.\n-/\n\nnamespace Problem\n\n/-- The condition that each of `a`, `b`, and `c` is nonnegative. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The condition that the sum `a + b + c` is strictly positive. -/\ndef PositiveSum (a b c : ℝ) : Prop :=\n 0 < a + b + c\n\n/-- The admissibility hypotheses of the source problem: each variable is\nnonnegative and their sum is strictly positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ PositiveSum a b c\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / (a + b + 7 * c)\n + b / (b + c + 7 * a)\n + c / (c + a + 7 * b)\n + (2 / 3 : ℝ) * ((a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2))\n\n/-- The asserted comparison between the source problem's left-hand side and `1`. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ 1\n\n/-- The complete assertion to be proved: for all nonnegative real `a`, `b`, `c`\nwith positive sum, the given rational expression is at most `1`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a7bc6e0-7f79-5855-9fe9-6c5faadc2ec4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "97c5e396ead1bfc06f9f2dcef7035875c774f6a85628a1c45f3bb0ca63922f09", "task_path": "tasks/nmp3_9a7bc6e0-7f79-5855-9fe9-6c5faadc2ec4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9a7bc6e0-7f79-5855-9fe9-6c5faadc2ec4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9ab45bde-9270-5ab0-a152-0a1fff79a2af", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for relatively prime positive integers $m$ and $n$, one has $\\phi(5^{m}-1) \\neq 5^{n}-1$, where $\\phi$ denotes Euler’s totient function.\nimport Mathlib.Data.Nat.Totient\n\n/-!\n# Formal statement of the problem\n\nFor relatively prime positive integers `m` and `n`, the totient\n`φ (5 ^ m - 1)` is not equal to `5 ^ n - 1`.\n\nThe expression `5 ^ k - 1` is interpreted in `ℕ`; for positive `k` this agrees\nwith the positive integer `5 ^ k - 1`. Mathlib's `Nat.totient` is Euler's\ntotient function on natural numbers.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive, relatively prime natural\nnumbers `m` and `n`, `φ (5 ^ m - 1) ≠ 5 ^ n - 1`, where `φ` is Euler's\ntotient function. -/\ndef Target : Prop :=\n ∀ (m : ℕ) (n : ℕ), 0 < m → 0 < n → Nat.Coprime m n →\n Nat.totient (5 ^ m - 1) ≠ 5 ^ n - 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9ab45bde-9270-5ab0-a152-0a1fff79a2af", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e4d1e70e8b5c87b4657885ae6411fb0bbda844b0375632ea17458f8e15e8ef32", "task_path": "tasks/nmp3_9ab45bde-9270-5ab0-a152-0a1fff79a2af", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9ab45bde-9270-5ab0-a152-0a1fff79a2af", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9ad4d55f-8bc4-5016-b92d-a1e17170e54f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $d(n)$ denote the number of positive divisors of $n$. Define a sequence by $a_0=1$ and for each integer $n\\ge1$ \n-- \\[\n-- a_n \\;=\\; d(a_{n-1})+d(d(a_{n-2}))+\\cdots+\\underbrace{d(d(\\dots d(a_0)\\dots))}_{n\\text{ times}}\\,,\n-- \\] \n-- i.e. $a_n=\\sum_{k=1}^{n}d^{(k)}(a_{\\,n-k})$, where $d^{(k)}$ is the $k$‑fold iteration of $d$. Prove that \n-- \\[\n-- a_n\\le 3n\\qquad\\text{for all integers }n\\ge1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- `d(n)`, the number of positive divisors of `n`, implemented as the cardinality of\nthe finite set of positive natural divisors of `n`. For `n = 0`, Mathlib's\n`Nat.divisors` is empty; the recurrence below only applies `d` to positive terms. -/\ndef divisorCount (n : ℕ) : ℕ :=\n n.divisors.card\n\n/-- The `k`-th summand `d^{(k)}(a_{n-k})` in the recurrence for `a_n`. -/\ndef recurrenceTerm (a : ℕ → ℕ) (n k : ℕ) : ℕ :=\n (divisorCount^[k]) (a (n - k))\n\n/-- The full right-hand side `∑_{k=1}^n d^{(k)}(a_{n-k})`. -/\ndef recurrenceSum (a : ℕ → ℕ) (n : ℕ) : ℕ :=\n ∑ k ∈ Finset.Icc 1 n, recurrenceTerm a n k\n\n/-- The same recurrence sum after reindexing `k = j + 1`. -/\ndef recurrenceSumRange (a : ℕ → ℕ) (n : ℕ) : ℕ :=\n ∑ j ∈ Finset.range n, recurrenceTerm a n (j + 1)\n\ntheorem recurrenceSumRange_eq_recurrenceSum (a : ℕ → ℕ) (n : ℕ) :\n recurrenceSumRange a n = recurrenceSum a n := by\n rw [recurrenceSumRange, recurrenceSum]\n refine Finset.sum_bij (fun j _ => j + 1) ?_ ?_ ?_ ?_\n · intro j hj\n rw [Finset.mem_Icc]\n have hj' : j < n := Finset.mem_range.mp hj\n omega\n · intro j₁ _ j₂ _ h\n omega\n · intro k hk\n rw [Finset.mem_Icc] at hk\n refine ⟨k - 1, ?_, ?_⟩\n · rw [Finset.mem_range]\n omega\n · omega\n · intro j _\n rfl\n\n/-- A sequence satisfying the problem's initial condition and recurrence. -/\ndef IsProblemSequence (a : ℕ → ℕ) : Prop :=\n a 0 = 1 ∧ ∀ n : ℕ, 1 ≤ n → a n = recurrenceSum a n\n\n/-- The sequence defined recursively by `a_0 = 1` and the stated recurrence. -/\nnoncomputable def sequence (n : ℕ) : ℕ :=\n Nat.strongRecOn n fun n ih =>\n if _h : n = 0 then 1 else\n ∑ j ∈ Finset.range n,\n (divisorCount^[j + 1]) (ih (n - (j + 1)) (by omega))\n\ntheorem sequence_zero : sequence 0 = 1 := by\n rw [sequence, Nat.strongRecOn_eq]\n simp\n\ntheorem sequence_succ_range (n : ℕ) :\n sequence (n + 1) = recurrenceSumRange sequence (n + 1) := by\n rw [sequence, Nat.strongRecOn_eq]\n simp only [Nat.succ_ne_zero, dite_eq_right, not_false_eq_true]\n rfl\n\ntheorem sequence_recurrence (n : ℕ) :\n sequence (n + 1) = recurrenceSum sequence (n + 1) := by\n rw [sequence_succ_range, recurrenceSumRange_eq_recurrenceSum]\n\ntheorem sequence_isProblemSequence : IsProblemSequence sequence := by\n constructor\n · exact sequence_zero\n · intro n hn\n cases n with\n | zero => omega\n | succ m => exact sequence_recurrence m\n\ntheorem IsProblemSequence.unique {a b : ℕ → ℕ}\n (ha : IsProblemSequence a) (hb : IsProblemSequence b) : a = b := by\n funext n\n induction n using Nat.strong_induction_on with\n | h n ih =>\n rcases Nat.eq_zero_or_pos n with hn0 | hnpos\n · subst n\n exact ha.1.trans hb.1.symm\n · rw [ha.2 n hnpos, hb.2 n hnpos]\n apply Finset.sum_congr rfl\n intro k hk\n rw [Finset.mem_Icc] at hk\n apply congrArg (divisorCount^[k])\n exact ih (n - k) (by omega)\n\ntheorem divisorCount_one : divisorCount 1 = 1 := by\n norm_num [divisorCount]\n\ntheorem divisorCount_iterate_one (k : ℕ) : (divisorCount^[k]) 1 = 1 := by\n induction k with\n | zero => rfl\n | succ k ih =>\n rw [Function.iterate_succ_apply', ih, divisorCount_one]\n\n/-- Every term of the recursively defined sequence is positive. -/\ntheorem sequence_pos (n : ℕ) : 0 < sequence n := by\n cases n with\n | zero =>\n rw [sequence_zero]\n norm_num\n | succ m =>\n rw [sequence_recurrence]\n have hmem : m + 1 ∈ Finset.Icc 1 (m + 1) := by\n rw [Finset.mem_Icc]\n omega\n have hle : recurrenceTerm sequence (m + 1) (m + 1) ≤\n recurrenceSum sequence (m + 1) := by\n rw [recurrenceSum]\n exact Finset.single_le_sum (fun k _ => Nat.zero_le _) hmem\n have hterm : recurrenceTerm sequence (m + 1) (m + 1) = 1 := by\n rw [recurrenceTerm]\n have hsub : m + 1 - (m + 1) = 0 := by omega\n rw [hsub, sequence_zero, divisorCount_iterate_one]\n omega\n\n/-- The assertion to be proved: for every natural number `n ≥ 1`,\nthe recursively defined sequence satisfies `a_n ≤ 3 * n`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 1 ≤ n → sequence n ≤ 3 * n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9ad4d55f-8bc4-5016-b92d-a1e17170e54f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d868a30fbf87559b05dfe0c9370b009a5f189d87228797f2a2bb6313a9004793", "task_path": "tasks/nmp3_9ad4d55f-8bc4-5016-b92d-a1e17170e54f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9ad4d55f-8bc4-5016-b92d-a1e17170e54f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9b6cdfce-5b8c-5167-9e4d-90191e0aad1d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\sqrt{\\frac{(5a+3c)(5b+3c)}{(a+b)^2}}+\\sqrt{\\frac{(5b+3a)(5c+3a)}{(b+c)^2}}+\\sqrt{\\frac{(5c+3b)(5a+3b)}{(c+a)^2}}\\ge 12,\n-- \\] \n-- i.e. equivalently \n-- \\[\n-- \\frac{\\sqrt{(5a+3c)(5b+3c)}}{a+b}+\\frac{\\sqrt{(5b+3a)(5c+3a)}}{b+c}+\\frac{\\sqrt{(5c+3b)(5a+3b)}}{c+a}\\ge 12.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the positive-real square-root inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\na sum of three real square roots is at least `12`. The source also records the\nequivalent form obtained by moving each positive denominator `a + b`, `b + c`,\nand `c + a` outside the corresponding square root.\n\nThis file only formalizes the asserted proposition; it deliberately contains no\nproof of it.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the first displayed inequality. -/\nnoncomputable def OriginalLHS (a b c : ℝ) : ℝ :=\n Real.sqrt (((5 * a + 3 * c) * (5 * b + 3 * c)) / (a + b) ^ 2) +\n Real.sqrt (((5 * b + 3 * a) * (5 * c + 3 * a)) / (b + c) ^ 2) +\n Real.sqrt (((5 * c + 3 * b) * (5 * a + 3 * b)) / (c + a) ^ 2)\n\n/-- The left-hand side of the equivalent displayed inequality. -/\nnoncomputable def EquivalentLHS (a b c : ℝ) : ℝ :=\n Real.sqrt ((5 * a + 3 * c) * (5 * b + 3 * c)) / (a + b) +\n Real.sqrt ((5 * b + 3 * a) * (5 * c + 3 * a)) / (b + c) +\n Real.sqrt ((5 * c + 3 * b) * (5 * a + 3 * b)) / (c + a)\n\n/-- The first displayed inequality, for all positive real `a`, `b`, and `c`. -/\ndef OriginalInequality : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → (12 : ℝ) ≤ OriginalLHS a b c\n\n/-- The equivalent displayed inequality, for all positive real `a`, `b`, and `c`. -/\ndef EquivalentInequality : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → (12 : ℝ) ≤ EquivalentLHS a b c\n\n/-- The complete assertion of the source problem, retaining both displayed forms. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n (12 : ℝ) ≤ OriginalLHS a b c ∧ (12 : ℝ) ≤ EquivalentLHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9b6cdfce-5b8c-5167-9e4d-90191e0aad1d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fe150cf571daabfc57b745a560932474fbc7f8c92edcc6dca058b0ea3e786bf1", "task_path": "tasks/nmp3_9b6cdfce-5b8c-5167-9e4d-90191e0aad1d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9b6cdfce-5b8c-5167-9e4d-90191e0aad1d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9b763a08-91da-5f70-9b90-23ff39f016d6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p>3$ be a prime number and let $k=\\bigl\\lfloor\\frac{2p}{3}\\bigr\\rfloor$. Prove that the sum \n-- \\[\n-- \\binom{p}{1}+\\binom{p}{2}+\\cdots+\\binom{p}{k}\n-- \\]\n-- is divisible by $p^{2}$.\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThe source problem asks, for every prime `p > 3`, for the sum of\n`Nat.choose p i` over `1 ≤ i ≤ floor (2 * p / 3)`, and asserts that this\nnatural-number sum is divisible by `p ^ 2`.\n\nNatural-number division is used for the floor: for `p : ℕ`, `(2 * p) / 3`\nis exactly `⌊(2 * p) / 3⌋`.\n-/\n\nnamespace Problem\n\n/-- The bound `k = floor (2 * p / 3)` from the problem, with `p` a natural number. -/\ndef binomialUpperBound (p : ℕ) : ℕ :=\n (2 * p) / 3\n\n/-- The finite sum `choose p 1 + choose p 2 + ... + choose p k`,\nwhere `k = floor (2 * p / 3)`. -/\ndef partialBinomialSum (p : ℕ) : ℕ :=\n ∑ i ∈ Finset.Icc 1 (binomialUpperBound p), p.choose i\n\n/-- The complete proposition stated by the source problem. -/\ndef Target : Prop :=\n ∀ p : ℕ, Nat.Prime p → 3 < p → (p ^ 2 : ℕ) ∣ partialBinomialSum p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9b763a08-91da-5f70-9b90-23ff39f016d6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b4aa402731303a7102938f085cf17e1546d5d276ce71bf2b41bb5454e04907d3", "task_path": "tasks/nmp3_9b763a08-91da-5f70-9b90-23ff39f016d6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9b763a08-91da-5f70-9b90-23ff39f016d6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9b7e8c6a-85a7-5687-890a-2abeb3ce690d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) with \\(a+b+c=1\\). Prove that \n-- \\[\n-- \\frac{a^{2}+b}{\\,b+c\\,}+\\frac{b^{2}+c}{\\,c+a\\,}+\\frac{c^{2}+a}{\\,a+b\\,}\\ge 2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality statement\n\nThe problem asks to prove, for positive real numbers `a`, `b`, and `c` whose\nsum is `1`, that a sum of three explicit rational expressions is at least `2`.\nThe main assertion is recorded as a proposition-valued definition; no proof is\nprovided at this statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b) / (b + c) + (b ^ 2 + c) / (c + a) + (c ^ 2 + a) / (a + b)\n\n/-- The stated hypotheses on the variables: all three are positive and their sum is `1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 1\n\n/-- The assertion to be proved: for all positive reals `a`, `b`, `c` with\n`a + b + c = 1`, the given expression is at least `2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9b7e8c6a-85a7-5687-890a-2abeb3ce690d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "083e650e3b7a57eaf6195d8256296a10bcadd484b7ccc1ba0d159fe0d5013ec4", "task_path": "tasks/nmp3_9b7e8c6a-85a7-5687-890a-2abeb3ce690d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9b7e8c6a-85a7-5687-890a-2abeb3ce690d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9b88546e-7fed-50f6-8383-7e583c00ac9e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- $$2(a^{2}+1)(b^{2}+1)(c^{2}+1)\\ge (a+1)(b+1)(c+1)(abc+1).$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion: for all positive real numbers `a`, `b`, and `c`,\n`2 * (a^2 + 1) * (b^2 + 1) * (c^2 + 1)` is at least\n`(a + 1) * (b + 1) * (c + 1) * (a * b * c + 1)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 2 * (a ^ 2 + 1) * (b ^ 2 + 1) * (c ^ 2 + 1) ≥\n (a + 1) * (b + 1) * (c + 1) * (a * b * c + 1)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9b88546e-7fed-50f6-8383-7e583c00ac9e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "84e621fad93fd189d2b5273229cfb01a5c23d8c756d48032baa7d139c20282cd", "task_path": "tasks/nmp3_9b88546e-7fed-50f6-8383-7e583c00ac9e", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9b88546e-7fed-50f6-8383-7e583c00ac9e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9b89f42f-a680-5874-b097-cfd69272d735", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose a positive integer $n$ can be written as a sum of four distinct odd squares, i.e. $n = x_1^2+x_2^2+x_3^2+x_4^2$ where the $x_i$ are distinct odd integers. Prove that $n$ can also be written as a sum of four distinct even squares, i.e. $n = y_1^2+y_2^2+y_3^2+y_4^2$ where the $y_i$ are distinct even integers.\nimport Mathlib\n\n/-!\n# Sums of four distinct odd and even squares\n\nThis file formalizes the statement of the problem. The assertion itself is\nrepresented as a proposition-valued definition; no proof is supplied here.\n-/\n\nnamespace Problem\n\n/-- `n` is a sum of four distinct odd integer squares. The four integer\nwitnesses are pairwise distinct, their squares are pairwise distinct, each\nwitness is odd, and the squares sum to `n`. The explicit condition on the\nsquares records the phrase \"four distinct odd squares\"; it also implies that\nthe witnesses themselves are distinct. -/\ndef FourDistinctOddSquares (n : ℕ) : Prop :=\n ∃ x : Fin 4 → ℤ,\n (∀ i : Fin 4, Odd (x i)) ∧\n Function.Injective x ∧\n Function.Injective (fun i : Fin 4 => (x i) ^ 2) ∧\n (n : ℤ) = ∑ i : Fin 4, (x i) ^ 2\n\n/-- `n` is a sum of four distinct even integer squares. The four integer\nwitnesses are pairwise distinct, their squares are pairwise distinct, each\nwitness is even, and the squares sum to `n`. The explicit condition on the\nsquares records the phrase \"four distinct even squares\"; it also implies that\nthe witnesses themselves are distinct. -/\ndef FourDistinctEvenSquares (n : ℕ) : Prop :=\n ∃ y : Fin 4 → ℤ,\n (∀ i : Fin 4, Even (y i)) ∧\n Function.Injective y ∧\n Function.Injective (fun i : Fin 4 => (y i) ^ 2) ∧\n (n : ℤ) = ∑ i : Fin 4, (y i) ^ 2\n\n/-- The complete assertion: every positive integer that is a sum of four\ndistinct odd squares is also a sum of four distinct even squares. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → FourDistinctOddSquares n → FourDistinctEvenSquares n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9b89f42f-a680-5874-b097-cfd69272d735", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7c115db0b3cefc9fd36685887042c28dc8189cf04aa5f7235e96ee53d5195df2", "task_path": "tasks/nmp3_9b89f42f-a680-5874-b097-cfd69272d735", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9b89f42f-a680-5874-b097-cfd69272d735", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9bbe960a-f41d-5d05-86b2-5ad3d6ef3909", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all distinct positive real numbers $x,y,z$ satisfying $x+y+z=6$, the inequality \n-- \\[\n-- \\frac{x+y}{(x-y)^2}+\\frac{y+z}{(y-z)^2}+\\frac{z+x}{(z-x)^2}\\ge \\frac32\n-- \\] \n-- holds.\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The admissibility hypotheses of the problem: `x`, `y`, and `z` are\npositive, pairwise distinct real numbers whose sum is `6`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n (0 : ℝ) < x ∧ (0 : ℝ) < y ∧ (0 : ℝ) < z ∧\n x ≠ y ∧ y ≠ z ∧ z ≠ x ∧ x + y + z = (6 : ℝ)\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def inequalityLHS (x y z : ℝ) : ℝ :=\n (x + y) / (x - y) ^ 2 + (y + z) / (y - z) ^ 2 + (z + x) / (z - x) ^ 2\n\n/-- The full universal statement asserted by the problem: for every triple of\ndistinct positive real numbers with sum `6`, the given expression is at least\n`3 / 2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → inequalityLHS x y z ≥ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9bbe960a-f41d-5d05-86b2-5ad3d6ef3909", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2f66fa3723da41c4297701661f03a7c0dce716ffdd3cfff4f71dc940c953ba9d", "task_path": "tasks/nmp3_9bbe960a-f41d-5d05-86b2-5ad3d6ef3909", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9bbe960a-f41d-5d05-86b2-5ad3d6ef3909", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9bbf99e0-b252-5152-829f-8af628d5e3fa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $ab+bc+ca+abc=4$. Prove that \n-- \\[\n-- a^{2}+b^{2}+c^{2}-3\\;\\ge\\;2\\bigl(\\sqrt{2}+1\\bigr)\\,\\bigl(a+b+c-3\\bigr).\\]\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nLet `a`, `b`, and `c` be positive real numbers satisfying\n`ab + bc + ca + abc = 4`. The assertion states the inequality\n`a² + b² + c² - 3 ≥ 2 (√2 + 1) (a + b + c - 3)`.\n\nThis file only records the proposition; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The inequality asserted in the problem, for all positive real numbers\n`a`, `b`, and `c` satisfying `ab + bc + ca + abc = 4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b + b * c + c * a + a * b * c = 4 →\n a ^ 2 + b ^ 2 + c ^ 2 - (3 : ℝ) ≥\n (2 : ℝ) * (Real.sqrt 2 + 1) * (a + b + c - 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9bbf99e0-b252-5152-829f-8af628d5e3fa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0e4edfbe4aa483a102ea1699b79983330d624caf0bf480e4632a532b345632dd", "task_path": "tasks/nmp3_9bbf99e0-b252-5152-829f-8af628d5e3fa", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9bbf99e0-b252-5152-829f-8af628d5e3fa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9bcde24b-e52d-5f26-af3a-de82ab9ec60e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(F_n)$ be the Fibonacci sequence defined by $F_1=F_2=1$ and $F_n=F_{n-1}+F_{n-2}$ for $n\\ge 3$. Let $k$ be a positive integer. Suppose that for every positive integer $m$ there exists a positive integer $n$ such that $m\\mid F_n-k$ (i.e., $F_n\\equiv k\\pmod m$). Prove that $k$ must itself be a Fibonacci number; that is, $k=F_t$ for some $t\\in\\mathbb N$.\nimport Mathlib.Data.Nat.Fib.Basic\n\n/-!\n# Formal statement for the Fibonacci-residue problem\n\nThe source problem uses a positive-indexed Fibonacci sequence with\n`F_1 = F_2 = 1` and `F_{n+2} = F_n + F_{n+1}`. We use Mathlib's standard\n`Nat.fib`, which has `Nat.fib 0 = 0`, `Nat.fib 1 = 1`, `Nat.fib 2 = 1`, and\nthe same recurrence. Thus its values at positive indices are exactly the\nsequence specified in the problem.\n-/\n\nnamespace Problem\n\n/-- The problem's Fibonacci sequence, using Mathlib's standard Fibonacci\nsequence. Its extension by `Nat.fib 0 = 0` is outside the source sequence's\npositive index range and does not affect any positive-index occurrence. -/\ndef Fibonacci (n : ℕ) : ℕ :=\n Nat.fib n\n\n/-- The first supplied initial value: `F_1 = 1`. -/\ntheorem Fibonacci_one : Fibonacci 1 = 1 :=\n Nat.fib_one\n\n/-- The second supplied initial value: `F_2 = 1`. -/\ntheorem Fibonacci_two : Fibonacci 2 = 1 :=\n Nat.fib_two\n\n/-- The supplied recurrence, stated for every source index `n + 3 ≥ 3`:\n`F_(n+3) = F_(n+1) + F_(n+2)`. -/\ntheorem Fibonacci_recurrence (n : ℕ) :\n Fibonacci (n + 3) = Fibonacci (n + 1) + Fibonacci (n + 2) :=\n Nat.fib_add_two\n\n/-- `k` is a Fibonacci number from the source sequence: `k = F_t` for a\npositive Fibonacci index `t`. -/\ndef IsFibonacciNumber (k : ℕ) : Prop :=\n ∃ t : ℕ, 0 < t ∧ k = Fibonacci t\n\n/-- The hypothesis that every positive modulus `m` admits a positive index `n`\nwith `F_n ≡ k (mod m)`. The congruence is written exactly as the divisibility\n`m ∣ (F_n - k)` in the integers, so a negative difference is handled in the\nstandard integer sense. -/\ndef HasAllFibonacciResidues (k : ℕ) : Prop :=\n ∀ m : ℕ, 0 < m →\n ∃ n : ℕ, 0 < n ∧ (m : ℤ) ∣ (Fibonacci n : ℤ) - (k : ℤ)\n\n/-- The complete assertion of the problem: every positive integer `k` whose\nvalues are Fibonacci residues modulo every positive modulus is itself a\nFibonacci number. -/\ndef Target : Prop :=\n ∀ k : ℕ, 0 < k →\n HasAllFibonacciResidues k →\n IsFibonacciNumber k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9bcde24b-e52d-5f26-af3a-de82ab9ec60e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5dfbbaaf03e851af22bf9bf81eec847ebb9aa186f4e9425d4d425e8bd4bf4cd1", "task_path": "tasks/nmp3_9bcde24b-e52d-5f26-af3a-de82ab9ec60e", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9bcde24b-e52d-5f26-af3a-de82ab9ec60e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9c14861d-bead-5423-9b32-9edaa3364fd8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer and let $a_1,a_2,\\dots,a_n$ be pairwise distinct positive integers. Prove that \n-- \\[\n-- \\sum_{k=1}^{n}\\frac{1}{[a_1,a_2,\\dots,a_k]}<4,\n-- \\] \n-- where $[a_1,a_2,\\dots,a_k]$ denotes the least common multiple of $a_1,a_2,\\dots,a_k$.\nimport Mathlib\n\n/-!\n# Statement: a bound for a sum of reciprocals of iterated least common multiples\n\nThe source problem asks to prove the following: if `n` is a positive integer and\n`a₁, a₂, …, aₙ` are pairwise distinct positive integers, then\n\n `∑_{k=1}^{n} 1 / [a₁, a₂, …, aₖ] < 4`,\n\nwhere `[a₁, …, aₖ]` is the least common multiple of `a₁, …, aₖ`.\n\nThis file formalizes the statement only; it does not prove it.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The least common multiple of the first `k` entries of the finite family `a`,\nwhere `k : Fin n` corresponds to the original index `k + 1`.\n\nConcretely, the set `{i : Fin n | i ≤ k}` is `{0, …, k}`, so this is the lcm of\n`a 0, …, a k`, i.e. of the original `a₁, …, a_{k+1}`. -/\ndef partialLcm (n : ℕ) (a : Fin n → ℕ) (k : Fin n) : ℕ :=\n (Finset.univ.filter (fun i : Fin n => i ≤ k)).lcm a\n\n/-- The finite sum `∑_{k=1}^{n} 1 / [a₁, a₂, …, aₖ]`, expressed in `ℝ`.\n\nThe `Fin n` index `k` corresponds to the original summation index `k + 1`, and\n`partialLcm n a k` is the lcm `[a₁, …, a_{k+1}]`. -/\nnoncomputable def partialSum (n : ℕ) (a : Fin n → ℕ) : ℝ :=\n ∑ k : Fin n, (1 : ℝ) / ((partialLcm n a k : ℝ))\n\n/-- The entries `a₁, …, aₙ` are all positive integers. -/\ndef EntriesPositive (n : ℕ) (a : Fin n → ℕ) : Prop :=\n ∀ i : Fin n, 0 < a i\n\n/-- The entries `a₁, …, aₙ` are pairwise distinct. -/\ndef PairwiseDistinct (n : ℕ) (a : Fin n → ℕ) : Prop :=\n ∀ i j : Fin n, i ≠ j → a i ≠ a j\n\n/-- The target proposition of the source problem.\n\nFor every positive integer `n` and every pairwise distinct positive-integer family\n`a₁, …, aₙ`, the sum of `1 / [a₁, …, aₖ]` over `k = 1, …, n` is strictly less\nthan `4`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ∀ a : Fin n → ℕ,\n EntriesPositive n a →\n PairwiseDistinct n a →\n partialSum n a < 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c14861d-bead-5423-9b32-9edaa3364fd8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6eb085d781e9fd2b3d4282aa45f2a2e4aa05b534d290c706f4d07c32dcf30166", "task_path": "tasks/nmp3_9c14861d-bead-5423-9b32-9edaa3364fd8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c14861d-bead-5423-9b32-9edaa3364fd8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9c188b52-a883-589f-9c5f-3260edcd8eed", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $I$ be the incenter of triangle $ABC$. Let $M$, $D$, $E$ be the midpoints of $BC$, $IB$, and $IC$, respectively. Let $F$ and $G$ be the circumcenters of triangles $ABD$ and $ACE$, respectively. Prove that the lines $AM$ and $FG$ are perpendicular.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Incenter.Basic\nimport Mathlib.Geometry.Euclidean.Circumcenter\nimport Mathlib.Geometry.Euclidean.Simplex\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\nimport Mathlib.LinearAlgebra.AffineSpace.MidpointZero\nimport Mathlib.Analysis.InnerProductSpace.Orthogonal\n\nnoncomputable section\n\nopen scoped Affine RealInnerProductSpace\n\nnamespace Problem\n\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\ndef vertexA (t : Affine.Triangle ℝ Plane) : Plane := t.points 0\n\ndef vertexB (t : Affine.Triangle ℝ Plane) : Plane := t.points 1\n\ndef vertexC (t : Affine.Triangle ℝ Plane) : Plane := t.points 2\n\ndef triangleIncenter (t : Affine.Triangle ℝ Plane) : Plane := t.incenter\n\ndef midpointBC (t : Affine.Triangle ℝ Plane) : Plane :=\n midpoint ℝ (vertexB t) (vertexC t)\n\ndef midpointIB (t : Affine.Triangle ℝ Plane) : Plane :=\n midpoint ℝ (triangleIncenter t) (vertexB t)\n\ndef midpointIC (t : Affine.Triangle ℝ Plane) : Plane :=\n midpoint ℝ (triangleIncenter t) (vertexC t)\n\ntheorem affineIndependent_ABI (t : Affine.Triangle ℝ Plane) :\n AffineIndependent ℝ ![vertexA t, vertexB t, triangleIncenter t] := by\n have hI : triangleIncenter t ∉ line[ℝ, vertexA t, vertexB t] := by\n simpa only [vertexA, vertexB, triangleIncenter] using\n (t.incenter_notMem_affineSpan_pair 0 1)\n have hAB : vertexA t ≠ vertexB t := by\n intro h\n exact (by decide : (0 : Fin 3) ≠ 1) (t.independent.injective h)\n rw [affineIndependent_iff_not_collinear_set]\n intro hcol\n exact hI (Collinear.mem_affineSpan_of_mem_of_ne hcol\n (by simp) (by simp) (by simp) hAB)\n\ntheorem affineIndependent_ACI (t : Affine.Triangle ℝ Plane) :\n AffineIndependent ℝ ![vertexA t, vertexC t, triangleIncenter t] := by\n have hI : triangleIncenter t ∉ line[ℝ, vertexA t, vertexC t] := by\n simpa only [vertexA, vertexC, triangleIncenter] using\n (t.incenter_notMem_affineSpan_pair 0 2)\n have hAC : vertexA t ≠ vertexC t := by\n intro h\n exact (by decide : (0 : Fin 3) ≠ 2) (t.independent.injective h)\n rw [affineIndependent_iff_not_collinear_set]\n intro hcol\n exact hI (Collinear.mem_affineSpan_of_mem_of_ne hcol\n (by simp) (by simp) (by simp) hAC)\n\ntheorem midpointIB_mem_line (t : Affine.Triangle ℝ Plane) :\n midpointIB t ∈ line[ℝ, vertexB t, triangleIncenter t] := by\n rw [midpointIB]\n rw [midpoint_comm]\n rw [← lineMap_inv_two (R := ℝ) (vertexB t) (triangleIncenter t)]\n exact mem_affineSpan_pair_iff_exists_lineMap_eq.mpr ⟨(2 : ℝ)⁻¹, rfl⟩\n\ntheorem midpointIC_mem_line (t : Affine.Triangle ℝ Plane) :\n midpointIC t ∈ line[ℝ, vertexC t, triangleIncenter t] := by\n rw [midpointIC]\n rw [midpoint_comm]\n rw [← lineMap_inv_two (R := ℝ) (vertexC t) (triangleIncenter t)]\n exact mem_affineSpan_pair_iff_exists_lineMap_eq.mpr ⟨(2 : ℝ)⁻¹, rfl⟩\n\ntheorem collinear_BID (t : Affine.Triangle ℝ Plane) :\n Collinear ℝ ({vertexB t, triangleIncenter t, midpointIB t} : Set Plane) := by\n apply collinear_triple_of_mem_affineSpan_pair\n (p₄ := vertexB t) (p₅ := triangleIncenter t)\n · exact subset_affineSpan ℝ ({vertexB t, triangleIncenter t} : Set Plane) (by simp)\n · exact subset_affineSpan ℝ ({vertexB t, triangleIncenter t} : Set Plane) (by simp)\n · exact midpointIB_mem_line t\n\ntheorem collinear_CIE (t : Affine.Triangle ℝ Plane) :\n Collinear ℝ ({vertexC t, triangleIncenter t, midpointIC t} : Set Plane) := by\n apply collinear_triple_of_mem_affineSpan_pair\n (p₄ := vertexC t) (p₅ := triangleIncenter t)\n · exact subset_affineSpan ℝ ({vertexC t, triangleIncenter t} : Set Plane) (by simp)\n · exact subset_affineSpan ℝ ({vertexC t, triangleIncenter t} : Set Plane) (by simp)\n · exact midpointIC_mem_line t\n\ntheorem vertexB_ne_midpointIB (t : Affine.Triangle ℝ Plane) :\n vertexB t ≠ midpointIB t := by\n intro h\n have h' : midpoint ℝ (triangleIncenter t) (vertexB t) = vertexB t := by\n simpa only [midpointIB] using h.symm\n exact (t.incenter_ne_point 1) ((midpoint_eq_right_iff ℝ).mp h')\n\ntheorem vertexC_ne_midpointIC (t : Affine.Triangle ℝ Plane) :\n vertexC t ≠ midpointIC t := by\n intro h\n have h' : midpoint ℝ (triangleIncenter t) (vertexC t) = vertexC t := by\n simpa only [midpointIC] using h.symm\n exact (t.incenter_ne_point 2) ((midpoint_eq_right_iff ℝ).mp h')\n\ndef triangleABD (t : Affine.Triangle ℝ Plane) : Affine.Triangle ℝ Plane :=\n ⟨![vertexA t, vertexB t, midpointIB t], by\n exact affineIndependent_of_affineIndependent_collinear_ne\n (affineIndependent_ABI t) (collinear_BID t) (vertexB_ne_midpointIB t)⟩\n\ndef triangleACE (t : Affine.Triangle ℝ Plane) : Affine.Triangle ℝ Plane :=\n ⟨![vertexA t, vertexC t, midpointIC t], by\n exact affineIndependent_of_affineIndependent_collinear_ne\n (affineIndependent_ACI t) (collinear_CIE t) (vertexC_ne_midpointIC t)⟩\n\ndef circumcenterF (t : Affine.Triangle ℝ Plane) : Plane :=\n (triangleABD t).circumcenter\n\ndef circumcenterG (t : Affine.Triangle ℝ Plane) : Plane :=\n (triangleACE t).circumcenter\n\ndef amLine (t : Affine.Triangle ℝ Plane) : AffineSubspace ℝ Plane :=\n line[ℝ, vertexA t, midpointBC t]\n\ndef fgLine (t : Affine.Triangle ℝ Plane) : AffineSubspace ℝ Plane :=\n line[ℝ, circumcenterF t, circumcenterG t]\n\ndef IsProperLine (L : AffineSubspace ℝ Plane) : Prop :=\n Module.finrank ℝ L.direction = 1\n\ndef LinesPerpendicular (L₁ L₂ : AffineSubspace ℝ Plane) : Prop :=\n IsProperLine L₁ ∧ IsProperLine L₂ ∧\n Submodule.IsOrtho L₁.direction L₂.direction\n\ndef Target : Prop :=\n ∀ t : Affine.Triangle ℝ Plane,\n LinesPerpendicular (amLine t) (fgLine t)\n\nend Problem\n\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c188b52-a883-589f-9c5f-3260edcd8eed", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7f1fa470832d96d6f4a4677c1b5091458b130fd613686384d670e232a1df16bd", "task_path": "tasks/nmp3_9c188b52-a883-589f-9c5f-3260edcd8eed", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c188b52-a883-589f-9c5f-3260edcd8eed", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9c23601f-5241-5758-95bd-9f15ca011157", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c,d\\in\\mathbb{R}^{+}$ satisfy $a+b+c+d=4$, prove that \n-- \\[\n-- \\frac{4}{abcd}\\ge\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{d}+\\frac{d}{a}.\n-- \\]\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n/-!\nFormalization of the problem statement:\n\nIf `a b c d : ℝ` are positive and satisfy `a + b + c + d = 4`, then\n`4 / (a * b * c * d) ≥ a / b + b / c + c / d + d / a`.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The four variables are strictly positive real numbers. -/\ndef IsPositiveReal (x : ℝ) : Prop :=\n 0 < x\n\n/-- The complete inequality assertion of the problem, with its positivity and\nsum hypotheses universally quantified. -/\ndef Target : Prop :=\n ∀ (a b c d : ℝ),\n IsPositiveReal a →\n IsPositiveReal b →\n IsPositiveReal c →\n IsPositiveReal d →\n a + b + c + d = 4 →\n 4 / (a * b * c * d) ≥ a / b + b / c + c / d + d / a\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c23601f-5241-5758-95bd-9f15ca011157", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e9bf7ac3dfbd6f20b774bc98c110bfe81ee978b183ce177565ed68aa96819774", "task_path": "tasks/nmp3_9c23601f-5241-5758-95bd-9f15ca011157", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c23601f-5241-5758-95bd-9f15ca011157", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9c2a8521-b8a3-5efc-a3c9-bcf380907c1c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there exists a rational number $r\\in(0,1)$ which can be expressed as a sum of $2021$ reciprocals of positive integers, but cannot be expressed as a sum of $2020$ reciprocals of positive integers.\nimport Mathlib\n\n/-!\n# Sums of reciprocals of positive integers\n\nThis file formalizes the statement of the problem: there exists a rational\nnumber in the open unit interval that is a sum of exactly 2021 reciprocals of\npositive integers, but is not a sum of exactly 2020 reciprocals of positive\nintegers.\n-/\n\nnamespace Problem\n\n/-- A rational number `r` is expressible as a sum of exactly `n` reciprocals of\npositive integers if there is an `n`-term (possibly repetitious) family of\npositive natural-number denominators whose reciprocal sum is `r`. -/\ndef IsSumOfReciprocals (n : ℕ) (r : ℚ) : Prop :=\n ∃ a : Fin n → ℕ,\n (∀ i : Fin n, 0 < a i) ∧\n (∑ i : Fin n, (1 : ℚ) / (a i : ℚ)) = r\n\n/-- There is a rational number strictly between 0 and 1 that is a sum of\nexactly 2021 reciprocals of positive integers and is not a sum of exactly 2020\nreciprocals of positive integers. -/\ndef Target : Prop :=\n ∃ r : ℚ,\n 0 < r ∧ r < 1 ∧\n IsSumOfReciprocals 2021 r ∧ ¬ IsSumOfReciprocals 2020 r\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c2a8521-b8a3-5efc-a3c9-bcf380907c1c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "138bb3abfc8e99d6294a835a08ba1118374f85cd9354c11fcae360fc795d2c72", "task_path": "tasks/nmp3_9c2a8521-b8a3-5efc-a3c9-bcf380907c1c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c2a8521-b8a3-5efc-a3c9-bcf380907c1c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9c309083-1170-5b50-8943-36bf4ce153cb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A=(a_{ij})$ be an $n\\times n$ matrix of non‑negative integers. For every pair $(i,j)$ with $a_{ij}=0$, the sum of the entries in the $i$‑th row plus the sum of the entries in the $j$‑th column is at least $n$. Prove that the total sum of all entries of $A$ satisfies \n-- \\[\n-- \\sum_{i=1}^{n}\\sum_{j=1}^{n}a_{ij}\\ge\\frac{n^{2}}{2}\\,. \n-- \\]\nimport Mathlib\n\nset_option autoImplicit false\n\n/-!\n# Formal statement of the matrix-sum inequality\n\nThe source problem asks to prove that an `n × n` matrix of nonnegative\nintegers, all of whose zero entries satisfy a row-sum plus column-sum\ncondition, has total sum at least `n^2 / 2`.\n-/\n\nnamespace Problem\n\nopen BigOperators\n\n/-- The sum of the entries in row `i` of the matrix `A`. -/\ndef rowSum {n : ℕ} (A : Matrix (Fin n) (Fin n) ℕ) (i : Fin n) : ℕ :=\n ∑ j : Fin n, A i j\n\n/-- The sum of the entries in column `j` of the matrix `A`. -/\ndef colSum {n : ℕ} (A : Matrix (Fin n) (Fin n) ℕ) (j : Fin n) : ℕ :=\n ∑ i : Fin n, A i j\n\n/-- The hypothesis of the problem: for every zero entry `aᵢⱼ`, the sum of\nthe entries in row `i` plus the sum of the entries in column `j` is at least\n`n`. -/\ndef Admissible (n : ℕ) (A : Matrix (Fin n) (Fin n) ℕ) : Prop :=\n ∀ i j : Fin n, A i j = 0 → rowSum A i + colSum A j ≥ n\n\n/-- The sum of all entries of the matrix `A`. -/\ndef totalSum {n : ℕ} (A : Matrix (Fin n) (Fin n) ℕ) : ℕ :=\n ∑ i : Fin n, ∑ j : Fin n, A i j\n\n/-- The assertion to be proved: for every natural number `n` and every\n`n × n` matrix `A` of nonnegative integers satisfying the zero-entry\nrow/column condition, the total sum of the entries is at least `n^2 / 2`,\nwhere the comparison is made in the real numbers. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (A : Matrix (Fin n) (Fin n) ℕ),\n Admissible n A → (totalSum A : ℝ) ≥ (n : ℝ) ^ 2 / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c309083-1170-5b50-8943-36bf4ce153cb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "65b89c10dad13c67066d489cf859fbafccf25ccc4421cd55f051a9b60cd9b2ea", "task_path": "tasks/nmp3_9c309083-1170-5b50-8943-36bf4ce153cb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c309083-1170-5b50-8943-36bf4ce153cb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9c35ba81-a966-550d-9937-62f46f80c744", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be a connected simple graph with $k$ edges. Prove that there exists a labeling of the edges by the integers $1,2,\\dots,k$ (each integer used exactly once) such that for every vertex of degree at least $2$, the greatest common divisor of the labels on the edges incident to that vertex equals $1$.\nimport Mathlib\n\n/-!\n# Formal statement of the edge-labeling problem\n\nThis file records the statement of the problem, not a proof of it. The graph is\nrepresented by `SimpleGraph V`; its edges are the finite subtype `G.edgeSet`.\n-/\n\nnamespace Problem\n\n/-- The finite set of edges of `G` incident to a vertex `v`.\n\nFor an edge `e` of a simple graph, `v ∈ (e : Sym2 V)` means that `v` is one of\nthe two endpoints of `e`. -/\nnoncomputable def incidentEdges {V : Type*} (G : SimpleGraph V) [Fintype G.edgeSet]\n (v : V) : Finset G.edgeSet :=\n by\n classical\n exact Finset.univ.filter (fun e : G.edgeSet => v ∈ (e : Sym2 V))\n\n/-- The assertion that `v` has degree at least two, expressed as having at least\ntwo incident edges. In a simple graph this is the same as having degree at least\ntwo. -/\ndef HasDegreeAtLeastTwo {V : Type*} (G : SimpleGraph V) [Fintype G.edgeSet]\n (v : V) : Prop :=\n 2 ≤ (incidentEdges G v).card\n\n/-- A labeling of the edges of `G` by the integers `1, 2, ..., k`, with every\nsuch integer used exactly once.\n\nThe function is defined on all graph edges. `Set.BijOn` expresses that its image\non the whole edge set is exactly the set `{1, ..., k}` and that the function is\ninjective on the edge set. -/\ndef IsEdgeLabeling {V : Type*} (G : SimpleGraph V) [Fintype G.edgeSet]\n (k : ℕ) (label : G.edgeSet → ℤ) : Prop :=\n Set.BijOn label Set.univ (((Finset.Icc (1 : ℤ) (k : ℤ)) : Finset ℤ) : Set ℤ)\n\n/-- The greatest common divisor of all labels on the edges incident to `v`.\n\nIt is `Finset.gcd`, whose value on the empty finite set is `0`; this definition is\nonly used under the explicit hypothesis that `v` has at least two incident edges. -/\nnoncomputable def IncidentLabelGcd {V : Type*} (G : SimpleGraph V) [Fintype G.edgeSet]\n (label : G.edgeSet → ℤ) (v : V) : ℤ :=\n (incidentEdges G v).gcd label\n\n/-- A labeling is valid for the problem if it uses each label from `1` through `k`\nexactly once and every vertex of degree at least two has incident-label gcd `1`. -/\ndef IsValidLabeling {V : Type*} (G : SimpleGraph V) [Fintype G.edgeSet]\n (k : ℕ) (label : G.edgeSet → ℤ) : Prop :=\n IsEdgeLabeling G k label ∧\n ∀ v : V, HasDegreeAtLeastTwo G v → IncidentLabelGcd G label v = 1\n\n/-- The target statement: every connected simple graph with `k` edges admits a\nlabeling of its edges by `1, 2, ..., k`, each used exactly once, such that at every\nvertex of degree at least two the gcd of the incident labels is `1`. -/\ndef Target : Prop :=\n ∀ (V : Type*) (G : SimpleGraph V) [Fintype G.edgeSet] (k : ℕ),\n G.Connected →\n Fintype.card G.edgeSet = k →\n ∃ label : G.edgeSet → ℤ, IsValidLabeling G k label\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c35ba81-a966-550d-9937-62f46f80c744", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e06c87e36bf1e754b57a1d04f43de2b1480e7f04d8d6ce56f0057d295e1f051c", "task_path": "tasks/nmp3_9c35ba81-a966-550d-9937-62f46f80c744", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c35ba81-a966-550d-9937-62f46f80c744", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9c49b2b4-0bcc-5265-a2ad-22f666a83939", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a$, $b$, and $c$, prove using the AM‑GM inequality that \n-- \\[\n-- \\sum_{\\text{cyc}}a^{4}+abc\\sum_{\\text{cyc}}a\\;\\ge\\;\\sum_{\\text{cyc}}ab\\,(a^{2}+b^{2}),\n-- \\] \n-- where $\\sum_{\\text{cyc}}a^{4}=a^{4}+b^{4}+c^{4}$, $\\sum_{\\text{cyc}}a=a+b+c$, and $\\sum_{\\text{cyc}}ab\\,(a^{2}+b^{2})=ab(a^{2}+b^{2})+bc(b^{2}+c^{2})+ca(c^{2}+a^{2})\\,. $\nimport Mathlib\n\n/-!\n# Formal statement of the AM-GM inequality problem\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\nthe cyclic inequality\n`sum_cyc ...`.\n\nOnly the statement is formalized here. The Lean declarations below are\ndefinitions whose bodies are propositions or the real-valued cyclic sums used\nto state that proposition. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum `∑_cyc a^4 = a^4 + b^4 + c^4`. -/\ndef cyclicFourthSum (a b c : ℝ) : ℝ :=\n a ^ 4 + b ^ 4 + c ^ 4\n\n/-- The cyclic sum `∑_cyc a = a + b + c`. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n a + b + c\n\n/-- The cyclic sum\n`∑_cyc ab (a^2 + b^2)\n = ab(a^2 + b^2) + bc(b^2 + c^2) + ca(c^2 + a^2)`. -/\ndef cyclicMixedSum (a b c : ℝ) : ℝ :=\n a * b * (a ^ 2 + b ^ 2)\n + b * c * (b ^ 2 + c ^ 2)\n + c * a * (c ^ 2 + a ^ 2)\n\n/-- The displayed inequality, for fixed real numbers `a`, `b`, and `c`. -/\ndef inequality (a b c : ℝ) : Prop :=\n cyclicFourthSum a b c + a * b * c * cyclicSum a b c\n ≥ cyclicMixedSum a b c\n\n/-- The full assertion of the problem: the displayed inequality holds for all\npositive real numbers `a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c49b2b4-0bcc-5265-a2ad-22f666a83939", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6c628a29b4126f9d2589facc470b24dd58877115fde03fe2c059e3df96ce0d2f", "task_path": "tasks/nmp3_9c49b2b4-0bcc-5265-a2ad-22f666a83939", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c49b2b4-0bcc-5265-a2ad-22f666a83939", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9c522410-3242-55cb-9d2f-4dc80f52324a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given an integer \\(n\\ge 3\\), a real number \\(\\alpha>0\\), and a finite set \\(S=\\{k_{1},k_{2},\\dots ,k_{r}\\}\\) of real numbers, prove that there exists a convex polygon with exactly \\(n\\) vertices, each vertex belonging to the integer lattice \\(\\mathbb Z^{2}\\), such that every line segment lying entirely inside the polygon whose slope belongs to \\(S\\) has length at most \\(\\alpha\\).\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThe source problem asks, for every integer `n ≥ 3`, every positive real `α`, and\nevery finite set `S` of real slopes, for a convex lattice polygon with exactly\n`n` vertices whose internal segments in the directions from S all have length\nat most `α`.\n\nWe represent a polygon by its closed convex hull together with its finite set of\nvertices. A point is a vertex exactly when it is an extreme point of the hull.\n-/\n\nnoncomputable section\n\nopen Set\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A point of the plane whose two coordinates are integers. -/\ndef IsLatticePoint (p : Plane) : Prop :=\n ∃ z : Fin 2 → ℤ, p = fun i => ((z i : ℤ) : ℝ)\n\n/-- A point is an extreme point of a convex set `P` when it cannot be written as\na nontrivial convex combination of two points of `P`. -/\ndef IsExtremePoint (P : Set Plane) (v : Plane) : Prop :=\n v ∈ P ∧\n ∀ (x : Plane), x ∈ P → ∀ (y : Plane), y ∈ P → ∀ (t : ℝ),\n 0 ≤ t → t ≤ 1 → v = t • x + (1 - t) • y → x = v ∨ y = v\n\n/-- `P` is the closed convex polygon whose vertex set is `V`, and it has exactly\n`n` vertices. The condition that every point of `V` is extreme rules out\ncollinear or redundant points in `V`; thus `V` really is the set of vertices of\nthe convex hull, rather than an arbitrary finite generating set. -/\ndef IsConvexPolygonWithVertices (n : ℤ) (P : Set Plane) (V : Finset Plane) : Prop :=\n (V.card : ℤ) = n ∧\n (∀ (v : Plane), v ∈ V → IsLatticePoint v) ∧\n P = convexHull ℝ (V : Set Plane) ∧\n ∀ (v : Plane), v ∈ V → IsExtremePoint P v\n\n/-- The (oriented) segment from `p` to `q` has a slope which belongs to the\nfinite set `S`. Vertical segments have no real slope and are therefore not\ncovered by this predicate. The slope is the usual quotient of the change in\nthe second coordinate by the change in the first coordinate. -/\ndef HasSlopeIn (S : Finset ℝ) (p q : Plane) : Prop :=\n p ≠ q ∧\n p 0 ≠ q 0 ∧\n ∃ (s : ℝ), s ∈ S ∧ (q 1 - p 1) / (q 0 - p 0) = s\n\n/-- The complete mathematical assertion of the source problem. -/\ndef Target : Prop :=\n ∀ (n : ℤ) (α : ℝ) (S : Finset ℝ),\n (3 : ℤ) ≤ n →\n 0 < α →\n ∃ (P : Set Plane) (V : Finset Plane),\n IsConvexPolygonWithVertices n P V ∧\n ∀ (p : Plane) (q : Plane),\n segment ℝ p q ⊆ P →\n HasSlopeIn S p q →\n dist p q ≤ α\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c522410-3242-55cb-9d2f-4dc80f52324a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6908f5e94b4b910ae5ff776a13a36e246369f36e1b38ec4e2bf45bc89294d4ab", "task_path": "tasks/nmp3_9c522410-3242-55cb-9d2f-4dc80f52324a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c522410-3242-55cb-9d2f-4dc80f52324a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9c61f5c0-d20d-5bd3-b00a-0fac7bdab281", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every integer \\(k>1\\) there exist infinitely many positive integers \\(n\\) such that \\(2^{2^{n}}+k\\) is not prime (i.e., is composite).\nimport Mathlib.Data.Int.NatPrime\nimport Mathlib.Data.Set.Finite.Basic\nimport Mathlib.RingTheory.Int.Basic\n\n/-!\n# Formal statement: integer shifts of Fermat powers\n\nThe source problem asks us to prove that for every integer `k > 1`, infinitely many\npositive exponents `n` make `2 ^ (2 ^ n) + k` composite. The assertion itself is\nrecorded as a `Prop`-valued definition; no proof is supplied at this stage.\n-/\n\nnamespace Problem\n\n/-- The integer `2 ^ (2 ^ n) + k`. The inner exponent is a natural number, so this\nis the usual right-associated power `2 ^ (2 ^ n)`, not `(2 ^ 2) ^ n`. -/\ndef value (k : ℤ) (n : ℕ) : ℤ :=\n (2 : ℤ) ^ ((2 : ℕ) ^ n) + k\n\n/-- An integer is treated as composite exactly when it is greater than one and is not\na prime element. For a positive integer this agrees with the usual notion of a\ncomposite number. The condition `1 < z` excludes `0`, `1`, and all negative\nintegers; the latter are not positive composites, even though some negative\nintegers are prime elements of `ℤ`. -/\ndef IsComposite (z : ℤ) : Prop :=\n 1 < z ∧ ¬ Prime z\n\n/-- The set of positive natural exponents `n` for which `2 ^ (2 ^ n) + k` is\ncomposite. -/\ndef solutionSet (k : ℤ) : Set ℕ :=\n {n : ℕ | 0 < n ∧ IsComposite (value k n)}\n\n/-- Target assertion: for every integer `k > 1`, the set of positive `n` for which\n`2 ^ (2 ^ n) + k` is composite is infinite. -/\ndef Target : Prop :=\n ∀ k : ℤ, 1 < k → Set.Infinite (solutionSet k)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c61f5c0-d20d-5bd3-b00a-0fac7bdab281", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e1b1d5094e42614ab98fede65892470f05d747dd635acf2a9edc4dcefa0c2f14", "task_path": "tasks/nmp3_9c61f5c0-d20d-5bd3-b00a-0fac7bdab281", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c61f5c0-d20d-5bd3-b00a-0fac7bdab281", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9c7b763a-8668-549a-8481-3b55f9ad7121", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ satisfy $abc+bcd+cda+dab=a+b+c+d$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a^{2}+1}{2}}+\\sqrt{\\frac{b^{2}+1}{2}}+\\sqrt{\\frac{c^{2}+1}{2}}+\\sqrt{\\frac{d^{2}+1}{2}}\\le a+b+c+d.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the four-variable inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, `c`, and `d`\nsatisfying\n\n`abc + bcd + cda + dab = a + b + c + d`,\n\nthe inequality\n\n`sqrt ((a^2 + 1) / 2) + sqrt ((b^2 + 1) / 2) +\n sqrt ((c^2 + 1) / 2) + sqrt ((d^2 + 1) / 2) <= a + b + c + d`.\n\nNo proof is included; `Target` is the unproved proposition to be established.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions in the problem: all four variables are positive\nand `abc + bcd + cda + dab = a + b + c + d`. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧\n a * b * c + b * c * d + c * d * a + d * a * b = a + b + c + d\n\n/-- The left-hand side of the requested inequality. -/\nnoncomputable def lhs (a b c d : ℝ) : ℝ :=\n Real.sqrt ((a ^ 2 + 1) / 2) + Real.sqrt ((b ^ 2 + 1) / 2) +\n Real.sqrt ((c ^ 2 + 1) / 2) + Real.sqrt ((d ^ 2 + 1) / 2)\n\n/-- The right-hand side of the requested inequality. -/\ndef rhs (a b c d : ℝ) : ℝ := a + b + c + d\n\n/-- The proposition asserted by the problem: for every positive real quadruple\nsatisfying the given product-sum identity, the stated square-root sum is at most\nthe sum of the four variables. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → lhs a b c d ≤ rhs a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c7b763a-8668-549a-8481-3b55f9ad7121", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d5e9b9d8d2209c7b1ac60a7e5f9261c21ad5ff1c05a2ccce608ebcc2bf05e7b1", "task_path": "tasks/nmp3_9c7b763a-8668-549a-8481-3b55f9ad7121", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c7b763a-8668-549a-8481-3b55f9ad7121", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9c90e817-c322-552c-91da-0b9707f39ad7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$ satisfying $a^{2}b^{2}+b^{2}c^{2}+c^{2}a^{2}=3$, prove that \n-- \\[\n-- \\sqrt{\\frac{a+bc^{2}}{2}}+\\sqrt{\\frac{b+ca^{2}}{2}}+\\sqrt{\\frac{c+ab^{2}}{2}}\\le\\frac{3}{abc}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the inequality problem\n\nThe source asks to prove an inequality for all positive real numbers `a`, `b`, and\n`c` satisfying `a^2 b^2 + b^2 c^2 + c^2 a^2 = 3`.\n\nThis file states the problem as a proposition-valued definition. No proof is\nincluded.\n-/\n\nnamespace Problem\n\n/-- The three numbers are strictly positive real numbers. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The constraint imposed on the positive reals in the source problem. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2 = 3\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n Real.sqrt ((a + b * c ^ 2) / 2) +\n Real.sqrt ((b + c * a ^ 2) / 2) +\n Real.sqrt ((c + a * b ^ 2) / 2)\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 3 / (a * b * c)\n\n/-- The assertion of the inequality for one fixed real triple, under the source's\npositivity and constraint hypotheses. -/\ndef Claim (a b c : ℝ) : Prop :=\n Positive a b c → Constraint a b c → LHS a b c ≤ RHS a b c\n\n/-- The full universally quantified proposition requested by the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Claim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c90e817-c322-552c-91da-0b9707f39ad7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "74a88ad6e0d4bb6ba6bda715b6e9d1589a0f78bf88d4f4f732fe93aad91f3e06", "task_path": "tasks/nmp3_9c90e817-c322-552c-91da-0b9707f39ad7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9c90e817-c322-552c-91da-0b9707f39ad7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9cd4f553-034e-5927-a73b-3c865b08fa95", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there are infinitely many positive integers $n$ such that \n-- $$n\\mid 2^n+2\\qquad\\text{and}\\qquad n-1\\mid 2^n+1.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- A positive integer `n` satisfies the two divisibility conditions in the problem. -/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧ n ∣ 2 ^ n + 2 ∧ n - 1 ∣ 2 ^ n + 1\n\n/-- There are infinitely many positive integers `n` for which\n`n ∣ 2 ^ n + 2` and `n - 1 ∣ 2 ^ n + 1`. -/\ndef Target : Prop :=\n Set.Infinite {n : ℕ | Admissible n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9cd4f553-034e-5927-a73b-3c865b08fa95", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bd8836209db304d4bb390248d926c10aefe320d353aaf4b60ab843dc9d557990", "task_path": "tasks/nmp3_9cd4f553-034e-5927-a73b-3c865b08fa95", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9cd4f553-034e-5927-a73b-3c865b08fa95", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9cdb2501-793e-5cd4-a213-035d543f745c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$ and $b$ be integers with $a>1$ and $b>1$. Prove that the set of prime divisors of the numbers $a^n+b$ (as $n$ ranges over the positive integers) is infinite; i.e., the sequence $\\{a^n+b\\}_{n\\ge1}$ contains infinitely many distinct prime factors.\nimport Mathlib\n\n/-!\n# Formal statement: infinitely many prime divisors of `a ^ n + b`\n\nThe source problem asks, for integers `a, b > 1`, to prove that the set of\nprime divisors of the terms `a ^ n + b`, with `n` ranging over positive\nintegers, is infinite.\n-/\n\nnamespace Problem\n\n/-- The set of (positive, natural) primes dividing at least one term of the\ninteger sequence `n ↦ a ^ n + b`, where `n` is a positive integer. -/\ndef PrimeDivisorsOfSequence (a b : ℤ) : Set ℕ :=\n {p : ℕ | Nat.Prime p ∧ ∃ n : ℕ, 0 < n ∧ (p : ℤ) ∣ a ^ n + b}\n\n/-- For all integers `a > 1` and `b > 1`, the set of prime divisors of the\nterms `a ^ n + b`, as `n` ranges over positive integers, is infinite. -/\ndef Target : Prop :=\n ∀ a b : ℤ, 1 < a → 1 < b → Set.Infinite (PrimeDivisorsOfSequence a b)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9cdb2501-793e-5cd4-a213-035d543f745c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b09d40fb2a95911f30199e345790fa3a18ae2afd51fec4819daee48eb7d6bc70", "task_path": "tasks/nmp3_9cdb2501-793e-5cd4-a213-035d543f745c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9cdb2501-793e-5cd4-a213-035d543f745c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9cdbf580-a9d8-53b0-b094-dd00d68a768a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a triangle $ABC$, prove that \n-- \\[\n-- \\cos A+\\cos B+\\cos C\\;\\le\\;1+\\frac16\\Bigl(\\cos^2\\frac{A-B}{2}+\\cos^2\\frac{B-C}{2}+\\cos^2\\frac{C-A}{2}\\Bigr)\\!,\n-- \\] \n-- where the sums are taken cyclically over the angles $A,B,C$ of the triangle.\nimport Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic\n\nnamespace Problem\n\n/-- The three interior angles of a nondegenerate triangle, measured in radians.\nPositivity and the angle sum `π` determine the admissible triples; in particular\neach angle is automatically less than `π`. -/\ndef TriangleAngles (A B C : ℝ) : Prop :=\n 0 < A ∧ 0 < B ∧ 0 < C ∧ A + B + C = Real.pi\n\n/-- The cosine inequality in the problem, as a predicate of three angle measures. -/\ndef TriangleCosineInequality (A B C : ℝ) : Prop :=\n Real.cos A + Real.cos B + Real.cos C ≤\n 1 + (1 / 6 : ℝ) *\n (Real.cos ((A - B) / 2) ^ 2 +\n Real.cos ((B - C) / 2) ^ 2 +\n Real.cos ((C - A) / 2) ^ 2)\n\n/-- For every nondegenerate triangle, with interior angles `A`, `B`, and `C`\nmeasured in radians, the stated cosine inequality holds. -/\ndef Target : Prop :=\n ∀ A B C : ℝ,\n TriangleAngles A B C → TriangleCosineInequality A B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9cdbf580-a9d8-53b0-b094-dd00d68a768a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "71a067c674345b85a1f52b1accf2642daf183650f4b19fe147d03a61c16227fc", "task_path": "tasks/nmp3_9cdbf580-a9d8-53b0-b094-dd00d68a768a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9cdbf580-a9d8-53b0-b094-dd00d68a768a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9cfdf032-2cb4-5902-a89e-99e90ddc1e7d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\sqrt{\\frac{a}{b+c}} + \\sqrt{\\frac{b}{c+a}} + \\sqrt{\\frac{c}{a+b}}\n-- \\ge\n-- \\sqrt{4+\\frac{3abc}{ab(a+b)+bc(b+c)+ca(c+a)}}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The denominator appearing on the right-hand side of the inequality. -/\ndef InequalityDenominator (a b c : ℝ) : ℝ :=\n a * b * (a + b) + b * c * (b + c) + c * a * (c + a)\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def InequalityLHS (a b c : ℝ) : ℝ :=\n Real.sqrt (a / (b + c)) +\n Real.sqrt (b / (c + a)) +\n Real.sqrt (c / (a + b))\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def InequalityRHS (a b c : ℝ) : ℝ :=\n Real.sqrt (4 + (3 * a * b * c) / InequalityDenominator a b c)\n\n/--\nFor all positive real numbers `a`, `b`, and `c`,\n`√(a/(b+c)) + √(b/(c+a)) + √(c/(a+b))` is at least\n`√(4 + 3abc/(ab(a+b) + bc(b+c) + ca(c+a)))`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n InequalityLHS a b c ≥ InequalityRHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9cfdf032-2cb4-5902-a89e-99e90ddc1e7d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6960ce130710cfdc185c8ef7f5c4c94c090ecaa8bc30df96c260d793a70a0a84", "task_path": "tasks/nmp3_9cfdf032-2cb4-5902-a89e-99e90ddc1e7d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9cfdf032-2cb4-5902-a89e-99e90ddc1e7d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9d004cde-15d4-586b-8998-fe48ba2d704e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a positive integer $n$, let $D$ be the set of all positive divisors of $n$. For subsets $A,B\\subseteq D$ satisfying that for every $a\\in A$ and $b\\in B$ neither $a\\mid b$ nor $b\\mid a$, prove that \n-- \\[\n-- \\sqrt{|A|}+\\sqrt{|B|}\\le\\sqrt{|D|}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the divisor cross-antichain inequality\n\nThe source problem asks to prove the following statement. For a positive\nnatural number `n`, let `D` be the finite set of positive divisors of `n`.\nIf `A` and `B` are subsets of `D` such that no element of `A` divides an\nelement of `B` and no element of `B` divides an element of `A`, then\n`sqrt |A| + sqrt |B| <= sqrt |D|`.\n\nThis file records the assertion as a proposition. It deliberately contains\nno proof of the proposition.\n-/\n\nnamespace Problem\n\n/-- The finite set `D` of all positive divisors of `n`.\n\nMathlib's `Nat.divisors n` is the finset of natural numbers in the interval\n`[1, n + 1)` that divide `n`. In particular, for `n > 0` its elements are\nexactly the positive divisors of `n`; the hypothesis `0 < n` in `Target`\nensures that this is the intended set. -/\ndef PositiveDivisors (n : ℕ) : Finset ℕ :=\n n.divisors\n\n/-- The cross-incomparability condition from the problem.\n\nFor every `a` in `A` and every `b` in `B`, neither `a ∣ b` nor `b ∣ a`.\nBoth negations are included, so a pair with `a = b` cannot occur. -/\ndef CrossIncomparable (A B : Finset ℕ) : Prop :=\n ∀ a : ℕ, a ∈ A → ∀ b : ℕ, b ∈ B → (¬ a ∣ b) ∧ (¬ b ∣ a)\n\n/-- The assertion from the source problem, with the positive integer `n`,\nthe two subsets of its positive divisors, and the cross-incomparability\ncondition universally quantified in the same dependency order as in the\nproblem. Cardinalities are the natural-number sizes of the finite sets,\ncoerced to `ℝ` before applying `Real.sqrt`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n →\n ∀ A B : Finset ℕ,\n A ⊆ PositiveDivisors n →\n B ⊆ PositiveDivisors n →\n CrossIncomparable A B →\n Real.sqrt (A.card : ℝ) + Real.sqrt (B.card : ℝ) ≤\n Real.sqrt ((PositiveDivisors n).card : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9d004cde-15d4-586b-8998-fe48ba2d704e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dcfee004704bd3e9a6ae923f385c97750dbe2180a9bfdde619804d5d941c0ced", "task_path": "tasks/nmp3_9d004cde-15d4-586b-8998-fe48ba2d704e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9d004cde-15d4-586b-8998-fe48ba2d704e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9d0b78d9-a429-5025-94ab-6f849542909d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all $n\\times n$ matrices $A$ (with $n\\ge 2$) over a field such that for every $n\\times n$ matrix $M$ (over the same field) one has \n-- \\[\n-- \\det(A+M)=\\det(A)+\\det(M)\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of: determinant translation-additivity matrices\n\nThe source problem asks for all `n × n` matrices `A` over a field, with `n ≥ 2`,\nsuch that for every `n × n` matrix `M` over the same field,\n`det (A + M) = det A + det M`.\n\nThis file states the admissibility condition, the correctness criterion for a\nproposed complete answer, and the target assertion that the answer set is the\nsingleton consisting of the zero matrix.\n-/\n\nopen Matrix\n\nnamespace Problem\n\nuniverse u\n\n/-- The admissibility predicate from the problem.\n\nFor a fixed field `K`, a natural number `n` together with the hypothesis\n`2 ≤ n`, and an `n × n` matrix `A` over `K`, this says that for every\n`n × n` matrix `M` over the same field `K`, the determinant of `A + M`\nequals the sum of the determinants of `A` and `M`.\n-/\ndef Admissible (K : Type u) [Field K] (n : ℕ) (_hn : 2 ≤ n)\n (A : Matrix (Fin n) (Fin n) K) : Prop :=\n ∀ M : Matrix (Fin n) (Fin n) K,\n Matrix.det (A + M) = Matrix.det A + Matrix.det M\n\n/-- A proposed set `S` is a complete answer if it consists exactly of the\nadmissible matrices: every member of `S` is admissible, and every admissible\nmatrix belongs to `S`. -/\ndef CompleteAnswer (K : Type u) [Field K] (n : ℕ) (hn : 2 ≤ n)\n (S : Set (Matrix (Fin n) (Fin n) K)) : Prop :=\n (∀ A : Matrix (Fin n) (Fin n) K, A ∈ S → Admissible K n hn A) ∧\n (∀ A : Matrix (Fin n) (Fin n) K, Admissible K n hn A → A ∈ S)\n\n/-- The proposed answer set consisting only of the zero matrix. -/\ndef zeroSolutionSet (K : Type u) [Field K] (n : ℕ) :\n Set (Matrix (Fin n) (Fin n) K) :=\n {A | A = 0}\n\n/-- The formal target: for every field `K` and every `n ≥ 2`, the complete\nanswer set of admissible matrices is exactly the singleton containing the zero\nmatrix. -/\ndef Target : Prop :=\n ∀ (K : Type u) [Field K] (n : ℕ) (hn : 2 ≤ n),\n CompleteAnswer K n hn (zeroSolutionSet K n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9d0b78d9-a429-5025-94ab-6f849542909d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0086d200fc10c41f792ef9e31cb93f9dbbdfff6546b1074198d6b3a74907c954", "task_path": "tasks/nmp3_9d0b78d9-a429-5025-94ab-6f849542909d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9d0b78d9-a429-5025-94ab-6f849542909d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9d56fd52-c984-5f95-b71f-8bbcb9cb8888", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exists an absolute constant $C>0$ with the following property: for any infinite arithmetic progression of positive integers \n-- \\[\n-- a_n = a_1+(n-1)d\\qquad(n\\ge1),\n-- \\]\n-- if $\\gcd(a_1,a_2)$ is squarefree, then there is an index $m\\le C\\,a_2^{2}$ such that $a_m$ is squarefree. (Recall that a positive integer $N$ is squarefree if it is not divisible by any square $>1$.)\nimport Mathlib.Data.Nat.Squarefree\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement\n\nThe statement below formalizes the problem in `problem.md`. Natural numbers are\nused for the progression's first term, positive common difference, indices, and\nterms. The absolute constant is a positive real number.\n-/\n\nnamespace Problem\n\n/-- The `n`-th term `a_n = a₁ + (n - 1)d` of an arithmetic progression, with\nthe convention that the sequence is indexed starting at `n = 1`. -/\ndef APTerm (a₁ d n : ℕ) : ℕ :=\n a₁ + (n - 1) * d\n\n/-- The assertion of the problem: there is an absolute positive real constant\n`C` such that every infinite arithmetic progression of positive integers whose\nfirst two terms have squarefree gcd has a squarefree term at some positive\nindex `m` satisfying `m ≤ C * a₂^2`.\n\nThe first term `a₁` and common difference `d` are positive natural numbers.\nThus every term `APTerm a₁ d n` is a positive integer, and `d > 0` makes the\nprogression infinite (indeed, nonconstant). The second term is\n`APTerm a₁ d 2 = a₁ + d`. -/\ndef Target : Prop :=\n ∃ C : ℝ,\n 0 < C ∧\n ∀ a₁ d : ℕ,\n 0 < a₁ →\n 0 < d →\n Squarefree (Nat.gcd a₁ (APTerm a₁ d 2)) →\n ∃ m : ℕ,\n 1 ≤ m ∧\n (m : ℝ) ≤ C * (APTerm a₁ d 2 : ℝ) ^ 2 ∧\n Squarefree (APTerm a₁ d m)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9d56fd52-c984-5f95-b71f-8bbcb9cb8888", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d7daba00a34ea9c27320cd7b67b958fec8219c4a7292fd60076b190242d3358e", "task_path": "tasks/nmp3_9d56fd52-c984-5f95-b71f-8bbcb9cb8888", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9d56fd52-c984-5f95-b71f-8bbcb9cb8888", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9d71234d-9685-577c-af35-0395f3bfdcf6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that the real number \n-- $$k=0.12481632\\ldots,$$ \n-- whose decimal expansion after the decimal point is formed by concatenating the decimal representations of $2^n$ for $n=0,1,2,\\dots$, is irrational.\nimport Mathlib.Analysis.Real.OfDigits\nimport Mathlib.Data.Nat.Digits.Lemmas\nimport Mathlib.NumberTheory.Real.Irrational\n\n/-!\n# Concatenated powers of two as a decimal\n\nThe number in the problem is the real number whose decimal digits after the point are the\nconcatenation of the ordinary decimal representations of `2 ^ n` for `n = 0, 1, 2, ...`.\nThis file gives an explicit construction of that digit sequence and states the requested\nirrationality assertion. No proof of the assertion is included in this formalization file.\n-/\n\nnamespace Problem\n\n/-- The decimal digits of `2 ^ n`, in the usual most-significant-first order, represented as\nelements of `Fin 10`. `Nat.digits 10` produces little-endian digits, hence the reversal. -/\ndef blockDigits (n : ℕ) : List (Fin 10) :=\n List.pmap (P := fun d : ℕ => d < 10)\n (fun d hd => ⟨d, hd⟩)\n (Nat.digits 10 (2 ^ n)).reverse\n (by\n intro d hd\n exact Nat.digits_lt_base (by norm_num) (List.mem_reverse.mp hd))\n\n/-- The list `blockDigits n` has exactly the usual decimal digits of `2 ^ n`, read from most\nsignificant to least significant. -/\nlemma blockDigits_val (n : ℕ) :\n (blockDigits n).map Fin.val = (Nat.digits 10 (2 ^ n)).reverse := by\n unfold blockDigits\n rw [List.map_pmap]\n simp\n\n/-- `blockDigits n` really is a decimal representation of `2 ^ n`. -/\nlemma ofDigits_blockDigits (n : ℕ) :\n Nat.ofDigits 10 ((blockDigits n).map Fin.val).reverse = 2 ^ n := by\n rw [blockDigits_val, List.reverse_reverse]\n exact Nat.ofDigits_digits 10 (2 ^ n)\n\n/-- The number of decimal digits in the ordinary decimal representation of `2 ^ n`. -/\ndef blockLen (n : ℕ) : ℕ := (blockDigits n).length\n\n/-- `blockLen` is the length of the standard little-endian list of decimal digits of `2 ^ n`. -/\nlemma blockLen_eq_natDigits_length (n : ℕ) :\n blockLen n = (Nat.digits 10 (2 ^ n)).length := by\n simp [blockLen, blockDigits]\n\n/-- The total number of digits occurring in the blocks `0, ..., n - 1`. Thus\n`blockStart n` is the position (counting from zero after the decimal point) at which the\ndecimal representation of `2 ^ n` starts in the concatenated expansion. -/\ndef blockStart : ℕ → ℕ\n | 0 => 0\n | n + 1 => blockStart n + blockLen n\n\n/-- Every block is nonempty, since `2 ^ n` is positive and therefore has at least one\ndecimal digit. -/\nlemma blockLen_pos (n : ℕ) : 0 < blockLen n := by\n have hpow : 2 ^ n ≠ 0 := pow_ne_zero n (by norm_num)\n have hne : Nat.digits 10 (2 ^ n) ≠ [] :=\n Nat.digits_ne_nil_iff_ne_zero.mpr hpow\n have hlen : 0 < (Nat.digits 10 (2 ^ n)).length := List.length_pos_iff.mpr hne\n have hlen' : (Nat.digits 10 (2 ^ n)).length = (blockDigits n).length := by\n simp [blockDigits]\n rw [blockLen, ← hlen']\n exact hlen\n\n/-- The starting positions of the successive blocks are at least as large as the block\nindices; in particular they tend to infinity. -/\nlemma le_blockStart (n : ℕ) : n ≤ blockStart n := by\n induction n with\n | zero => exact Nat.zero_le 0\n | succ n ih =>\n have hpos : 0 < blockLen n := blockLen_pos n\n simp only [blockStart]\n omega\n\n/-- For each digit position `i` there is at least one block end strictly beyond `i`. -/\nlemma exists_blockStart_succ_gt (i : ℕ) : ∃ n : ℕ, i < blockStart (n + 1) := by\n refine ⟨i, lt_of_lt_of_le ?_ (le_blockStart (i + 1))⟩\n exact Nat.lt_succ_self i\n\n/-- The index of the unique block containing the `i`-th digit after the decimal point.\nIt is the least `n` such that the block `n` ends strictly after position `i`. -/\nnoncomputable def blockIndex (i : ℕ) : ℕ :=\n Nat.find (exists_blockStart_succ_gt i)\n\n/-- The chosen block indeed ends strictly after position `i`. -/\nlemma blockIndex_end_gt (i : ℕ) : i < blockStart (blockIndex i + 1) :=\n Nat.find_spec (exists_blockStart_succ_gt i)\n\n/-- The chosen block starts at or before position `i`. -/\nlemma blockStart_blockIndex_le (i : ℕ) : blockStart (blockIndex i) ≤ i := by\n by_cases hzero : blockIndex i = 0\n · simp [hzero, blockStart]\n · have hlt : blockIndex i - 1 < blockIndex i := Nat.sub_one_lt hzero\n have hnot : ¬ i < blockStart ((blockIndex i - 1) + 1) :=\n Nat.find_min (exists_blockStart_succ_gt i) hlt\n have heq : (blockIndex i - 1) + 1 = blockIndex i := by omega\n rw [heq] at hnot\n omega\n\n/-- The offset of position `i` inside its containing block is a valid list index. -/\nlemma offset_lt_blockLen (i : ℕ) :\n i - blockStart (blockIndex i) < blockLen (blockIndex i) := by\n have hend := blockIndex_end_gt i\n have hle := blockStart_blockIndex_le i\n simp only [blockStart] at hend\n exact Nat.sub_lt_left_of_lt_add hle hend\n\n/-- The `i`-th decimal digit after the decimal point in the concatenation. -/\nnoncomputable def concatDigit (i : ℕ) : Fin 10 :=\n (blockDigits (blockIndex i)).get\n ⟨i - blockStart (blockIndex i), by\n simpa [blockLen] using offset_lt_blockLen i⟩\n\n/-- `k` is the real number `0.12481632...` whose decimal digits are the concatenation of\nthe decimal representations of `2 ^ n`, `n = 0, 1, 2, ...`. -/\nnoncomputable def k : ℝ :=\n Real.ofDigits concatDigit\n\n/-- The assertion requested in the problem: the concatenation number `k` is irrational. -/\ndef Target : Prop :=\n Irrational k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9d71234d-9685-577c-af35-0395f3bfdcf6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1531612d7a66ffde5d44142ae76b9c676fb3d529fe8ce6a5d7310788df5ff533", "task_path": "tasks/nmp3_9d71234d-9685-577c-af35-0395f3bfdcf6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9d71234d-9685-577c-af35-0395f3bfdcf6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9d7fc948-6152-589e-840e-1a9849f4d6eb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x$, $y$, $z$ be positive real numbers such that $xyz=1$. Prove that \n-- \\[\n-- \\frac{1-x}{x^{2}-x+1}+\\frac{1-y}{y^{2}-y+1}+\\frac{1-z}{z^{2}-z+1}\\ge0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the inequality problem\n\nThe source problem asks to prove, for positive real numbers `x`, `y`, and `z`\nsatisfying `x * y * z = 1`, that\n\n`(1 - x) / (x ^ 2 - x + 1) + (1 - y) / (y ^ 2 - y + 1)\n + (1 - z) / (z ^ 2 - z + 1) ≥ 0`.\n\nThis file records the statement as a proposition; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The quadratic denominator `x ^ 2 - x + 1` occurring in each summand. -/\ndef denominator (x : ℝ) : ℝ := x ^ 2 - x + 1\n\n/-- One summand `(1 - x) / (x ^ 2 - x + 1)` from the left-hand side. -/\nnoncomputable def summand (x : ℝ) : ℝ := (1 - x) / denominator x\n\n/-- The assertion of the problem: for all positive real `x`, `y`, and `z`\nwith `x * y * z = 1`, the displayed sum is nonnegative. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z → x * y * z = 1 →\n summand x + summand y + summand z ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9d7fc948-6152-589e-840e-1a9849f4d6eb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e75cf587df594cb34b4908e44e16429dd67fa4e836e2b68bdf23be7bcd99a68a", "task_path": "tasks/nmp3_9d7fc948-6152-589e-840e-1a9849f4d6eb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9d7fc948-6152-589e-840e-1a9849f4d6eb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9d9690fa-6b1d-55bc-bf08-5d2140866cc4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\bigl(a+\\frac1b-1\\bigr)\\bigl(b+\\frac1c-1\\bigr)\\;+\\;\\bigl(b+\\frac1c-1\\bigr)\\bigl(c+\\frac1a-1\\bigr)\\;+\\;\\bigl(c+\\frac1a-1\\bigr)\\bigl(a+\\frac1b-1\\bigr)\\;\\ge\\;3.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, `c`, that\nthe sum of the three pairwise products of\n`a + 1 / b - 1`, `b + 1 / c - 1`, and `c + 1 / a - 1`\nis at least `3`.\n\nThis file only states the problem. No proof of `Problem.Target` is supplied.\n-/\n\nnamespace Problem\n\n/-- The first cyclic factor `a + 1 / b - 1`. -/\nnoncomputable def factorAB (a b : ℝ) : ℝ := a + 1 / b - 1\n\n/-- The second cyclic factor `b + 1 / c - 1`. -/\nnoncomputable def factorBC (b c : ℝ) : ℝ := b + 1 / c - 1\n\n/-- The third cyclic factor `c + 1 / a - 1`. -/\nnoncomputable def factorCA (c a : ℝ) : ℝ := c + 1 / a - 1\n\n/-- The complete assertion of the problem: for all positive real `a`, `b`, `c`,\nthe sum of the cyclic pairwise products of the displayed factors is at least `3`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n factorAB a b * factorBC b c +\n factorBC b c * factorCA c a +\n factorCA c a * factorAB a b ≥ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9d9690fa-6b1d-55bc-bf08-5d2140866cc4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "552766283feb20f0f3e296ad29bcdafab03510e5b7d8bbaa955e373750edee47", "task_path": "tasks/nmp3_9d9690fa-6b1d-55bc-bf08-5d2140866cc4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9d9690fa-6b1d-55bc-bf08-5d2140866cc4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9da321a9-e303-5949-a494-52dfb712f8c9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb{R}\\to\\mathbb{R}$ be a continuous function satisfying \n-- $$f(x+f(x))=f(x)\\qquad\\text{for all }x\\in\\mathbb{R}.$$ \n-- Find all such functions $f$.\nimport Mathlib\n\nnamespace Problem\n\n/--\nThe admissibility predicate for the original problem: a function\n`f : ℝ → ℝ` is a solution precisely when it is continuous and satisfies\n`f (x + f x) = f x` for every real number `x`.\n-/\ndef IsSolution (f : ℝ → ℝ) : Prop :=\n Continuous f ∧ ∀ x : ℝ, f (x + f x) = f x\n\n/--\nA candidate predicate describing the proposed complete answer: `f` is a\nconstant function (with arbitrary real constant). We use pointwise equality\nto make the arbitrary constant explicit.\n-/\ndef IsConstantFunction (f : ℝ → ℝ) : Prop :=\n ∃ c : ℝ, ∀ x : ℝ, f x = c\n\n/--\nA proposed answer predicate is complete when it holds exactly for the\nadmissible functions. The `↔` records both directions of the classification:\nevery function satisfying `Candidate` is a solution, and every solution\nsatisfies `Candidate`.\n-/\ndef IsCompleteAnswer (Candidate : (ℝ → ℝ) → Prop) : Prop :=\n ∀ f : ℝ → ℝ, Candidate f ↔ IsSolution f\n\n/--\nSet-valued version of `IsCompleteAnswer`: `S` contains exactly the admissible\nfunctions. This is the two-directional classification predicate required for\na \"find all\" problem.\n-/\ndef IsCompleteSolutionSet (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, f ∈ S ↔ IsSolution f\n\n/-- The proposed complete answer set: all constant real-valued functions. -/\ndef ConstantSolutionSet : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | IsConstantFunction f}\n\n/--\nThe formal target of the problem: the constant real-valued functions are\nexactly the continuous functions satisfying `f (x + f x) = f x` for all `x`.\n-/\ndef Target : Prop :=\n IsCompleteAnswer IsConstantFunction\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9da321a9-e303-5949-a494-52dfb712f8c9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1cc36ffdb287818e3c01f86a3896a2600d4e16d71203d6600f57bf38e210e87d", "task_path": "tasks/nmp3_9da321a9-e303-5949-a494-52dfb712f8c9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9da321a9-e303-5949-a494-52dfb712f8c9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9da580be-f1a0-5bf9-8b06-60a8cacbf142", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{2}{8a^{2}+bc}+\\frac{2}{8b^{2}+ca}+\\frac{2}{8c^{2}+ab}+\\frac{1}{a^{2}+b^{2}+c^{2}}\\ge\\frac{3}{ab+bc+ca}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def leftSide (a b c : ℝ) : ℝ :=\n 2 / (8 * a ^ 2 + b * c) +\n 2 / (8 * b ^ 2 + c * a) +\n 2 / (8 * c ^ 2 + a * b) +\n 1 / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def rightSide (a b c : ℝ) : ℝ :=\n 3 / (a * b + b * c + c * a)\n\n/-- The full assertion of the source problem: for all positive real numbers\n`a`, `b`, and `c`, the displayed left-hand side is at least the displayed\nright-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → leftSide a b c ≥ rightSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9da580be-f1a0-5bf9-8b06-60a8cacbf142", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "245266e4a804ebe448e026fa5abcd85853d4ad9c9cee27e64abcf49aad091780", "task_path": "tasks/nmp3_9da580be-f1a0-5bf9-8b06-60a8cacbf142", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9da580be-f1a0-5bf9-8b06-60a8cacbf142", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9dcff3d6-00e5-5867-8c47-4a24adec5074", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- $$\\frac{a(b+c)}{a^2+2bc}+\\frac{b(c+a)}{b^2+2ca}+\\frac{c(a+b)}{c^2+2ab}+1\\le\\frac{(a+b+c)^2}{ab+bc+ca}\\,. $$\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissible domain of the problem: triples of positive real numbers. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The first summand, `a (b + c) / (a ^ 2 + 2 b c)`. -/\nnoncomputable def term1 (a b c : ℝ) : ℝ :=\n a * (b + c) / (a ^ 2 + 2 * b * c)\n\n/-- The second summand, `b (c + a) / (b ^ 2 + 2 c a)`. -/\nnoncomputable def term2 (a b c : ℝ) : ℝ :=\n b * (c + a) / (b ^ 2 + 2 * c * a)\n\n/-- The third summand, `c (a + b) / (c ^ 2 + 2 a b)`. -/\nnoncomputable def term3 (a b c : ℝ) : ℝ :=\n c * (a + b) / (c ^ 2 + 2 * a * b)\n\n/-- The complete left-hand side: the three displayed fractions plus `1`. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n term1 a b c + term2 a b c + term3 a b c + 1\n\n/-- The right-hand side, `(a + b + c) ^ 2 / (a b + b c + c a)`. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a + b + c) ^ 2 / (a * b + b * c + c * a)\n\n/-- The pointwise non-strict inequality asserted in the problem. -/\nnoncomputable def InequalityHolds (a b c : ℝ) : Prop :=\n lhs a b c ≤ rhs a b c\n\n/-- The original problem statement: for all positive real numbers `a`, `b`, and\n`c`, the displayed inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9dcff3d6-00e5-5867-8c47-4a24adec5074", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "54d7431411c02b997130958959df2c670267c734a1a084603e01746ac8b3b212", "task_path": "tasks/nmp3_9dcff3d6-00e5-5867-8c47-4a24adec5074", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9dcff3d6-00e5-5867-8c47-4a24adec5074", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9dd42c4d-75da-5160-a5f7-6f80ba5187bd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. Prove that the polynomial \n-- $$p(x)=\\prod_{k=1}^{n}\\bigl(x^{2}+k^{2}\\bigr)+1$$ \n-- is irreducible in $\\mathbb{Z}[x]$.\nimport Mathlib\n\n/-!\n# Irreducibility of a family of integer polynomials\n\nThis file records the statement of the problem. It contains no proof of the\ntarget assertion; `Problem.Target` is a proposition-valued definition.\n-/\n\nnamespace Problem\n\n/-- The polynomial\n`p_n(x) = ∏_{k=1}^n (x^2 + k^2) + 1`, regarded as an element of `ℤ[x]`. -/\nnoncomputable def p (n : ℕ) : Polynomial ℤ :=\n (Finset.Icc 1 n).prod\n (fun k : ℕ =>\n (Polynomial.X : Polynomial ℤ) ^ 2 + Polynomial.C ((k : ℤ) ^ 2)) + 1\n\n/-- For every positive integer `n`, the polynomial `p_n` is irreducible in ℤ[x]. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → Irreducible (p n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9dd42c4d-75da-5160-a5f7-6f80ba5187bd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d1f46424c1f0354c216baf66554913e6c920c53366c430032ab67c4568ec5044", "task_path": "tasks/nmp3_9dd42c4d-75da-5160-a5f7-6f80ba5187bd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9dd42c4d-75da-5160-a5f7-6f80ba5187bd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9df55b06-2e2e-5053-a9f0-4f8cc031917b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a}{4a+4b+c}}+\\sqrt{\\frac{b}{4b+4c+a}}+\\sqrt{\\frac{c}{4c+4a+b}}\\le 1.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement\n\nThe original problem asks, for positive real numbers `a b c`, to prove the\ncyclic square-root inequality\n\n`sqrt (a / (4a + 4b + c)) + sqrt (b / (4b + 4c + a))\n + sqrt (c / (4c + 4a + b)) ≤ 1`.\n\nThe declaration below records that assertion as a proposition; it does not\ncontain a proof.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`, the cyclic sum of the\nthree indicated square roots is at most one. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c →\n Real.sqrt (a / (4 * a + 4 * b + c)) +\n Real.sqrt (b / (4 * b + 4 * c + a)) +\n Real.sqrt (c / (4 * c + 4 * a + b)) ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9df55b06-2e2e-5053-a9f0-4f8cc031917b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d05f23cd378cfae55d20d9d61fbcf0a40f1a4f3553a7a2f0d95bebd7b13d0136", "task_path": "tasks/nmp3_9df55b06-2e2e-5053-a9f0-4f8cc031917b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9df55b06-2e2e-5053-a9f0-4f8cc031917b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9dfc95d8-786c-5419-b9be-a633e6e8d615", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a set M of 1985 distinct positive integers, none of which has a prime divisor greater than 23, prove that M contains a subset of four elements whose product is the fourth power of an integer.\nimport Mathlib\n\n/-!\n# Formalization of the given combinatorial number-theory problem\n\nThe source problem asks: given a set `M` of 1985 distinct positive integers,\nnone of which has a prime divisor greater than 23, prove that `M` contains a\nfour-element subset whose product is the fourth power of an integer.\n\nThe declaration `Problem.Target` below is the proposition asserted by that\nproblem. It is a statement formalization only; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- `PrimeDivisorsAtMost B n` says that every prime divisor of `n` is at most\n`B`. In particular, for `n = 1` the condition is vacuous. -/\ndef PrimeDivisorsAtMost (B : ℕ) (n : ℕ) : Prop :=\n ∀ (p : ℕ), p.Prime → p ∣ n → p ≤ B\n\n/-- The hypotheses describing the finite set `M` in the source problem:\nit has 1985 elements, all its elements are positive integers, and all their\nprime divisors are at most 23. Since `M` is a `Finset`, its elements are\nautomatically distinct. -/\ndef Admissible (M : Finset ℕ) : Prop :=\n M.card = 1985 ∧\n (∀ (n : ℕ), n ∈ M → 0 < n) ∧\n (∀ (n : ℕ), n ∈ M → PrimeDivisorsAtMost 23 n)\n\n/-- `M` contains a subset with exactly four elements whose product is the\nfourth power of an integer. The elements are multiplied as integers, so the\nwitness `k` ranges over `ℤ`. -/\ndef ContainsFourthPowerFourSubset (M : Finset ℕ) : Prop :=\n ∃ (S : Finset ℕ),\n S ⊆ M ∧\n S.card = 4 ∧\n ∃ (k : ℤ), S.prod (fun (n : ℕ) => (n : ℤ)) = k ^ 4\n\n/-- The full assertion of the source problem, with the quantified set `M` and\nall of its hypotheses made explicit. -/\ndef Target : Prop :=\n ∀ (M : Finset ℕ), Admissible M → ContainsFourthPowerFourSubset M\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9dfc95d8-786c-5419-b9be-a633e6e8d615", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1f17f1d11b055ddfdd82e51e18004a240c8e4500df41a3c4a474787193213827", "task_path": "tasks/nmp3_9dfc95d8-786c-5419-b9be-a633e6e8d615", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9dfc95d8-786c-5419-b9be-a633e6e8d615", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9e47364a-e71d-5947-aa79-970a336a58a3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb{R}\\to\\mathbb{R}$. Prove that if \n-- \\[f(xy+y+x)=f(xy)+f(x)+f(y)\\qquad\\text{for all real }x,y,\\] \n-- then \n-- \\[f(x+y)=f(x)+f(y)\\qquad\\text{for all real }x,y.\\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Statement formalization\n\nSource problem: for every function `f : ℝ → ℝ`, if\n`f (x * y + y + x) = f (x * y) + f x + f y` for all real `x, y`,\nthen `f (x + y) = f x + f y` for all real `x, y`.\n\nThe declarations below only state the problem. They do not prove it.\n-/\n\nnamespace Problem\n\n/-- The hypothesis of the problem: the given functional equation holds for\nevery pair of real numbers. -/\ndef FunctionalEquationHypothesis (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x * y + y + x) = f (x * y) + f x + f y\n\n/-- The conclusion asserted by the problem: `f` is additive on the reals. -/\ndef AdditiveConclusion (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x + y) = f x + f y\n\n/-- The full universally quantified implication stated by the problem. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, FunctionalEquationHypothesis f → AdditiveConclusion f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9e47364a-e71d-5947-aa79-970a336a58a3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d731c0c7cb504211468430b65e2ca8a89c5ce3d5047bc19e87b35dc5a735eafc", "task_path": "tasks/nmp3_9e47364a-e71d-5947-aa79-970a336a58a3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9e47364a-e71d-5947-aa79-970a336a58a3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9e6e3485-e5b8-5214-9949-1ddb6a85d7ba", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there are no nonnegative integers $k,m$ such that \n-- $$k!+48=48\\,(k+1)^m.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The equation `k! + 48 = 48 * (k + 1)^m` for natural numbers `k` and `m`. -/\ndef Equation (k m : ℕ) : Prop :=\n Nat.factorial k + 48 = 48 * (k + 1) ^ m\n\n/-- There are no nonnegative integers `k` and `m` satisfying `k! + 48 = 48 * (k + 1)^m`. -/\ndef Target : Prop :=\n ¬ ∃ k m : ℕ, Equation k m\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9e6e3485-e5b8-5214-9949-1ddb6a85d7ba", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "12294267f02965ac7cb5a16d4d989be294707f427f443ec78970956deb9a05a0", "task_path": "tasks/nmp3_9e6e3485-e5b8-5214-9949-1ddb6a85d7ba", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9e6e3485-e5b8-5214-9949-1ddb6a85d7ba", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9e8372a6-f047-5046-ae4b-30f84606a576", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- \\sqrt[3]{\\frac{a}{\\,b+c\\,}}+\\sqrt[3]{\\frac{b}{\\,c+a\\,}}+\\sqrt[3]{\\frac{c}{\\,a+b\\,}}>2\\,.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formalization of the cube-root inequality problem\n\nThe source asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthat the sum of the three real cube roots of `a / (b + c)`, `b / (c + a)`,\nand `c / (a + b)` is strictly greater than `2`.\n\nFor positive real inputs the principal real cube root is represented by the\nreal power with exponent `1 / 3`.\n-/\n\nnamespace Problem\n\n/-- The principal real cube root, represented as a real power with exponent\n`1 / 3`. The target below applies this only to positive arguments, where this\ncoincides with the usual positive real cube-root function. -/\nnoncomputable def cubeRoot (x : ℝ) : ℝ :=\n x ^ ((1 : ℝ) / 3)\n\n/-- The full assertion of the problem: for all positive reals `a`, `b`, `c`,\nthe sum of the cube roots of `a / (b + c)`, `b / (c + a)`, and\n`c / (a + b)` is strictly greater than `2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n cubeRoot (a / (b + c)) +\n cubeRoot (b / (c + a)) +\n cubeRoot (c / (a + b)) >\n 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9e8372a6-f047-5046-ae4b-30f84606a576", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "12334b5501b1838b8d3210f718e1ec1735b048bc2093dc7923a70144b7ad50d5", "task_path": "tasks/nmp3_9e8372a6-f047-5046-ae4b-30f84606a576", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9e8372a6-f047-5046-ae4b-30f84606a576", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9ead9533-2987-5ded-9f1d-9c7997bde439", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ be real numbers such that $ab+bc+ca=1$. Prove that \n-- \\[\n-- \\frac{1}{\\sqrt{a+bc}}+\\frac{1}{\\sqrt{b+ca}}+\\frac{1}{\\sqrt{c+ab}}\\ge 2\\sqrt{2}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the inequality problem\n\nThe source asks, for nonnegative real numbers `a`, `b`, and `c` satisfying\n`a*b + b*c + c*a = 1`, to prove the stated lower bound for the sum of three\nreciprocals of square roots.\n\nThis file records the proposition only. It deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition imposed on the three real variables in the\nsource problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + b * c + c * a = 1\n\n/-- The lower bound asserted in the source problem, for arbitrary real\n`a`, `b`, and `c`. -/\ndef ClaimInequality (a b c : ℝ) : Prop :=\n 1 / Real.sqrt (a + b * c) +\n 1 / Real.sqrt (b + c * a) +\n 1 / Real.sqrt (c + a * b) ≥\n 2 * Real.sqrt 2\n\n/-- The complete universally quantified statement to be proved: for all real\n`a`, `b`, `c`, if they are nonnegative and satisfy `ab + bc + ca = 1`, then\nthe displayed inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → ClaimInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9ead9533-2987-5ded-9f1d-9c7997bde439", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "380d6827ae1639f302816cf23bd3521507fc4a81c57dfc2aa93528883e83a8ed", "task_path": "tasks/nmp3_9ead9533-2987-5ded-9f1d-9c7997bde439", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9ead9533-2987-5ded-9f1d-9c7997bde439", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9ec15917-36f4-5f10-9515-2d2cc27003b6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be the side lengths of a triangle $ABC$ (so $a+b>c$, $b+c>a$, $c+a>b$), and let $p=\\frac{a+b+c}{2}$ be its semiperimeter. Prove that \n-- \\[\n-- a^2(p-a)(p-b)+b^2(p-b)(p-c)+c^2(p-c)(p-a)\\le \\frac{4}{27}p^{4}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a triangle semiperimeter inequality\n\nThis file records the mathematical assertion from the problem as a proposition-valued\ndefinition. No proof of the assertion is supplied.\n-/\n\nnamespace Problem\n\n/-- The semiperimeter `p = (a + b + c) / 2` of a triangle with side lengths\n`a`, `b`, and `c`. All quantities are real numbers.\n-/\nnoncomputable def Semiperimeter (a b c : ℝ) : ℝ :=\n (a + b + c) / 2\n\n/-- The admissible triples `(a, b, c)` in the problem: they are positive real\nnumbers and satisfy the three strict triangle inequalities. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n a > 0 ∧ b > 0 ∧ c > 0 ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The assertion of the problem: for every triple of positive real numbers that\nare the side lengths of a triangle, with semiperimeter\n`p = (a + b + c) / 2`, the stated fourth-degree expression is at most\n`(4 / 27) * p^4`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n IsTriangleSideLengths a b c →\n a ^ 2 * (Semiperimeter a b c - a) * (Semiperimeter a b c - b)\n + b ^ 2 * (Semiperimeter a b c - b) * (Semiperimeter a b c - c)\n + c ^ 2 * (Semiperimeter a b c - c) * (Semiperimeter a b c - a)\n ≤ (4 / 27 : ℝ) * (Semiperimeter a b c) ^ 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9ec15917-36f4-5f10-9515-2d2cc27003b6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f9db886ee2b5ced71612f7853cd00df5700d6b00234cf9c1889c8da08819ab59", "task_path": "tasks/nmp3_9ec15917-36f4-5f10-9515-2d2cc27003b6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9ec15917-36f4-5f10-9515-2d2cc27003b6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9f0cc8b9-d51e-5c6d-9957-12b82d9ec149", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge 0$ be real numbers satisfying $xy+yz+zx=x+y+z>0$. Prove that \n-- \\[\n-- \\sqrt[3]{(x^2+y)(y^2+z)(z^2+x)}\\;\\ge\\;\\sqrt{\\frac{(x+y)(y+z)(z+x)}{2}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of a cyclic three-variable real inequality\n\nThe source problem asks, for nonnegative real numbers `x`, `y`, and `z`\nsatisfying `x*y + y*z + z*x = x + y + z > 0`, to prove\n\n`cbrt ((x^2 + y) * (y^2 + z) * (z^2 + x)) ≥ sqrt (((x+y)*(y+z)*(z+x))/2)`.\n\nThe declarations below only state the target; they do not assert or prove it.\n-/\n\nnamespace Problem\n\n/-- The real cube root, with the usual sign convention.\n\nFor nonnegative `a` this is `a ^ (1 / 3 : ℝ)`; for negative `a` it is the\nnegative of the cube root of `-a`. This gives the ordinary real cube root on\nall of `ℝ`, rather than relying on an arbitrary branch of real exponentiation.\n-/\nnoncomputable def cubeRoot (a : ℝ) : ℝ :=\n if 0 ≤ a then a ^ (1 / 3 : ℝ) else -((-a) ^ (1 / 3 : ℝ))\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n cubeRoot ((x ^ 2 + y) * (y ^ 2 + z) * (z ^ 2 + x))\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def rhs (x y z : ℝ) : ℝ :=\n Real.sqrt (((x + y) * (y + z) * (z + x)) / 2)\n\n/-- The hypotheses of the source problem. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z ∧\n x * y + y * z + z * x = x + y + z ∧\n 0 < x + y + z\n\n/-- The inequality asserted by the source problem, for fixed `x`, `y`, `z`. -/\ndef Inequality (x y z : ℝ) : Prop :=\n lhs x y z ≥ rhs x y z\n\n/-- The full universally quantified statement of the source problem.\n\nFor every triple of nonnegative real numbers satisfying\n`xy + yz + zx = x + y + z > 0`, the cube root of\n`(x^2+y)(y^2+z)(z^2+x)` is at least the square root of\n`((x+y)(y+z)(z+x))/2`.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f0cc8b9-d51e-5c6d-9957-12b82d9ec149", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3ba1dd3891431f83ca8461b8e18018e6f5680b9af89def00ddc28a9f1e11899a", "task_path": "tasks/nmp3_9f0cc8b9-d51e-5c6d-9957-12b82d9ec149", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f0cc8b9-d51e-5c6d-9957-12b82d9ec149", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9f342343-56f9-5376-bc13-74f2cc13272c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $x,y,z$,\n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{x^{4}(y+z)}{yz\\bigl(y^{3}+z^{3}+4x^{3}\\bigr)}\\ge 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- One summand in the cyclic sum from the problem, with the variable\n`x` distinguished as the variable appearing in the numerator and in the\n`4 x ^ 3` term. Division is real division. -/\nnoncomputable def cyclicTerm (x y z : ℝ) : ℝ :=\n x ^ 4 * (y + z) / (y * z * (y ^ 3 + z ^ 3 + 4 * x ^ 3))\n\n/-- The three-term cyclic sum, in the order\n`(x,y,z)`, `(y,z,x)`, `(z,x,y)`. -/\nnoncomputable def cyclicSum (x y z : ℝ) : ℝ :=\n cyclicTerm x y z + cyclicTerm y z x + cyclicTerm z x y\n\n/-- For all positive real numbers `x`, `y`, and `z`, the cyclic sum is at\nleast one. This declaration is the proposition to be proved, not a proof\nof it. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → 1 ≤ cyclicSum x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f342343-56f9-5376-bc13-74f2cc13272c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8ff761bb2e0b9b3bb3d41f94c3b661e7df64c832732d7908817773065ef673b9", "task_path": "tasks/nmp3_9f342343-56f9-5376-bc13-74f2cc13272c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f342343-56f9-5376-bc13-74f2cc13272c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9f44f65a-0e12-5a70-88b0-1063243b2157", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers such that the denominators below are defined (i.e. $a\\neq b$, $b\\neq c$, $c\\neq a$). Prove that \n-- \n-- \\[\n-- \\frac{(a^{2}+1)(b^{2}+1)}{(c^{2}+1)(a-b)^{2}}\n-- +\\frac{(b^{2}+1)(c^{2}+1)}{(a^{2}+1)(b-c)^{2}}\n-- +\\frac{(c^{2}+1)(a^{2}+1)}{(b^{2}+1)(c-a)^{2}}\n-- \\ge 2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable real inequality\n\nThe source problem asks to prove, for real numbers `a`, `b`, and `c` whose\npairwise differences in the displayed denominators are nonzero, that a\nparticular sum of three nonnegative rational terms is at least `2`.\n\nThe value under consideration and the admissibility condition on the three\nreal parameters are defined explicitly below. The target is a `Prop`-valued\ndefinition; no proof of it is supplied. The pairwise distinctness hypotheses\nare exactly the three conditions stated in the problem.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n ((a ^ 2 + 1) * (b ^ 2 + 1)) / ((c ^ 2 + 1) * (a - b) ^ 2)\n + ((b ^ 2 + 1) * (c ^ 2 + 1)) / ((a ^ 2 + 1) * (b - c) ^ 2)\n + ((c ^ 2 + 1) * (a ^ 2 + 1)) / ((b ^ 2 + 1) * (c - a) ^ 2)\n\n/-- The admissibility condition stated in the problem: the three real numbers\nare pairwise distinct, equivalently all three displayed denominator\ndifferences are nonzero. -/\ndef Admissible (a b c : ℝ) : Prop :=\n a ≠ b ∧ b ≠ c ∧ c ≠ a\n\n/-- The complete assertion of the source problem: for every admissible triple\nof real numbers, the displayed left-hand side is at least `2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f44f65a-0e12-5a70-88b0-1063243b2157", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "da38ba898dd8941460ec97c72e8c986c6d5f908c6e74d3a6a8b50ce66a4b66bb", "task_path": "tasks/nmp3_9f44f65a-0e12-5a70-88b0-1063243b2157", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f44f65a-0e12-5a70-88b0-1063243b2157", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9f548348-4231-5fa7-ab85-c562a4a59a02", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Define $p=a+b+c$ and $q=ab+bc+ca$. Prove that \n-- $$p^2+2q^2+6\\ge 2pq+2p+3q.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The symmetric sum `p = a + b + c`. -/\ndef p (a b c : ℝ) : ℝ := a + b + c\n\n/-- The pairwise-product sum `q = ab + bc + ca`. -/\ndef q (a b c : ℝ) : ℝ := a * b + b * c + c * a\n\n/-- The positivity and normalization assumptions on the three real variables. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The asserted inequality, with `p` and `q` written via their definitions. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (p a b c) ^ 2 + 2 * (q a b c) ^ 2 + 6 ≥\n 2 * (p a b c) * (q a b c) + 2 * (p a b c) + 3 * (q a b c)\n\n/-- The complete target statement: for all positive real `a`, `b`, `c` with\n`abc = 1`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f548348-4231-5fa7-ab85-c562a4a59a02", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "df5e7aab3729a193a76338c83ae3bf2082569062e36765f545f8d47b531fe3a6", "task_path": "tasks/nmp3_9f548348-4231-5fa7-ab85-c562a4a59a02", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f548348-4231-5fa7-ab85-c562a4a59a02", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9f5498c7-c414-536a-901d-8361623a643c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n,m>1$ be integers, and let $a_1,\\dots,a_m$ be positive integers with $a_i\\le n^m$ for each $i$. Prove that there exist positive integers $b_1,\\dots,b_m$, each satisfying $1\\le b_i\\le n$, such that \n-- \\[\n-- \\gcd(a_1+b_1,\\;a_2+b_2,\\;\\dots,\\;a_m+b_m) 1` and every\nfamily of positive integers `a_i` (`i = 1, ..., m`) bounded above by `n ^ m`,\nfor the existence of a family of positive integers `b_i`, with\n`1 ≤ b_i ≤ n`, such that the gcd of all `a_i + b_i` is strictly less than `n`.\n\nThe finite index set `Fin m` replaces the index range `1, ..., m`.\nAll integer quantities in the problem are positive, so they are represented\nas natural numbers. `Finset.univ.gcd` denotes the gcd of the finite family\nindexed by `Fin m`.\n-/\n\nnamespace Problem\n\n/-- The proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ (n m : ℕ), 1 < n → 1 < m →\n ∀ a : Fin m → ℕ,\n (∀ i : Fin m, 1 ≤ a i ∧ a i ≤ n ^ m) →\n ∃ b : Fin m → ℕ,\n (∀ i : Fin m, 1 ≤ b i ∧ b i ≤ n) ∧\n (Finset.univ.gcd (fun i : Fin m => a i + b i)) < n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f5498c7-c414-536a-901d-8361623a643c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f8ffb1f6542e241b2f1d387323c34cde4ffb857e7d5a8e2ac2beb1ceacfd4157", "task_path": "tasks/nmp3_9f5498c7-c414-536a-901d-8361623a643c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f5498c7-c414-536a-901d-8361623a643c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9f5769b2-2836-5856-8cab-60d2a6e6b865", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,\\;y,\\;z\\ge 0$. Prove that \n-- \\[\n-- 1+\\sqrt[3]{(1+x^{3})(1+y^{3})(1+z^{3})}\\;\\ge\\;x+y+z\\,.\n-- \\]\n/-\nFormal statement for the problem:\n\nLet x, y, z ≥ 0. Prove that\n1 + ∛((1 + x^3)(1 + y^3)(1 + z^3)) ≥ x + y + z.\n\nThe real cube root of a nonnegative real number a is encoded as the\nstandard real power a ^ (1 / 3 : ℝ). Under the hypotheses, the radicand\nis nonnegative, so this is the usual nonnegative real cube root.\n-/\nimport Mathlib\n\nnamespace Problem\n\n/-- The real cube root, represented using the standard real power with\nexponent `1 / 3`. For nonnegative arguments this is the unique\nnonnegative real number whose cube is the argument. -/\nnoncomputable def cbrt (a : ℝ) : ℝ := a ^ (1 / 3 : ℝ)\n\n/-- The proposition to be proved: for all nonnegative real numbers `x`, `y`,\nand `z`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 ≤ x → 0 ≤ y → 0 ≤ z →\n 1 + cbrt ((1 + x ^ (3 : ℕ)) * (1 + y ^ (3 : ℕ)) * (1 + z ^ (3 : ℕ))) ≥ x + y + z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f5769b2-2836-5856-8cab-60d2a6e6b865", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3fb7a35827e3a451253267b234add6df04e37ac6b09db8f21768b0e36506a98d", "task_path": "tasks/nmp3_9f5769b2-2836-5856-8cab-60d2a6e6b865", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f5769b2-2836-5856-8cab-60d2a6e6b865", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9f7b7090-7d4d-5630-9bd4-d59b2152cefd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}+\\frac{4abc\\,(a+b+c)}{a^{3}b+b^{3}c+c^{3}a+3abc\\,(a+b+c)}\\ge 2.\n-- \\]\nimport Mathlib\n\n/-!\nThis file formalizes the assertion in `problem.md` as a proposition. It does not\ncontain a proof of that proposition.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a) +\n 4 * a * b * c * (a + b + c) /\n (a ^ 3 * b + b ^ 3 * c + c ^ 3 * a + 3 * a * b * c * (a + b + c))\n\n/-- The assertion: for all positive real numbers `a`, `b`, and `c`, the displayed\nleft-hand side is at least `2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ 2\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f7b7090-7d4d-5630-9bd4-d59b2152cefd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b0267d9acbaf1838910ae37935f488aec63336a2295f0a74327c40d0eee12003", "task_path": "tasks/nmp3_9f7b7090-7d4d-5630-9bd4-d59b2152cefd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9f7b7090-7d4d-5630-9bd4-d59b2152cefd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9fb85737-8e50-5e24-bd19-9ab0d2f49e00", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m,n\\ge 2$ be given integers. Prove that there exist positive integers $a_10$ be real numbers satisfying $a(c^2-1)=b(b^2+c^2)$ and $d\\le 1$. Prove that \n-- $$d\\Big(a\\sqrt{1-d^2}+b^2\\sqrt{1+d^2}\\Big)\\le\\frac{(a+b)c}{2}\\,. $$\nimport Mathlib\n\n/-!\n# Formalization of the stated inequality problem\n\nThe original problem asks, for positive real numbers `a`, `b`, `c`, and `d`\nsatisfying `a * (c ^ 2 - 1) = b * (b ^ 2 + c ^ 2)` and `d ≤ 1`, to prove\n\n`d * (a * sqrt (1 - d ^ 2) + b ^ 2 * sqrt (1 + d ^ 2))\n ≤ (a + b) * c / 2`.\n\nNo proof is supplied here: `Problem.Target` is the proposition to be proved.\n-/\n\nnamespace Problem\n\n/-- The first positivity assumption, `a > 0`. -/\ndef PositiveA (a : ℝ) : Prop :=\n 0 < a\n\n/-- The second positivity assumption, `b > 0`. -/\ndef PositiveB (b : ℝ) : Prop :=\n 0 < b\n\n/-- The third positivity assumption, `c > 0`. -/\ndef PositiveC (c : ℝ) : Prop :=\n 0 < c\n\n/-- The inequality assumption `d > 0`. -/\ndef PositiveD (d : ℝ) : Prop :=\n 0 < d\n\n/-- The algebraic constraint\n`a(c^2 - 1) = b(b^2 + c^2)`. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a * (c ^ 2 - 1) = b * (b ^ 2 + c ^ 2)\n\n/-- The explicit upper bound on `d`, `d ≤ 1`. -/\ndef DAtMostOne (d : ℝ) : Prop :=\n d ≤ 1\n\n/-- All hypotheses of the original problem, with the same variable dependencies. -/\ndef Assumptions (a b c d : ℝ) : Prop :=\n PositiveA a ∧\n PositiveB b ∧\n PositiveC c ∧\n PositiveD d ∧\n Constraint a b c ∧\n DAtMostOne d\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def LeftHandSide (a b d : ℝ) : ℝ :=\n d * (a * Real.sqrt (1 - d ^ 2) + b ^ 2 * Real.sqrt (1 + d ^ 2))\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def RightHandSide (a b c : ℝ) : ℝ :=\n (a + b) * c / 2\n\n/-- The desired conclusion, isolated from the hypotheses. -/\nnoncomputable def Conclusion (a b c d : ℝ) : Prop :=\n LeftHandSide a b d ≤ RightHandSide a b c\n\n/-- The full universal statement of the problem. -/\nnoncomputable def Target : Prop :=\n ∀ a b c d : ℝ, Assumptions a b c d → Conclusion a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9fc9ca8f-d438-55cb-931a-b77b8fc102e7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ae267c4a0100c7ff8c9461543ce99e7bf516c21e24fd2bad5baedce32314c1d8", "task_path": "tasks/nmp3_9fc9ca8f-d438-55cb-931a-b77b8fc102e7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9fc9ca8f-d438-55cb-931a-b77b8fc102e7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9fdafe3b-aa32-5eda-b46c-c18e395b6a28", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb R\\to\\mathbb R$ be a function satisfying \n-- \\[f(x+y)\\le y\\,f(x)+f(f(x))\\] \n-- for all real numbers $x$ and $y$. Prove that $f(x)=0$ for every $x\\le 0$.\nimport Mathlib\n\n/-!\n# Formalization of the functional-inequality problem\n\nThe source problem asks one to prove a pointwise conclusion for every real-valued\nfunction on `ℝ` satisfying a quantified functional inequality.\n\nThis file records the admissibility predicate, the claimed conclusion, and the\nfull problem target as `Prop`-valued definitions. No proof of the target is\nprovided (and none is needed for statement formalization).\n-/\n\nnamespace Problem\n\n/-- The hypothesis of the problem: a function `f : ℝ → ℝ` satisfies\n`f (x + y) ≤ y * f x + f (f x)` for every pair of real numbers `x` and `y`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x + y) ≤ y * f x + f (f x)\n\n/-- The conclusion asserted by the problem: `f x = 0` at every real number\n`x` with `x ≤ 0`. -/\ndef DesiredConclusion (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, x ≤ 0 → f x = 0\n\n/-- The complete assertion to be proved: every function\n`f : ℝ → ℝ` satisfying the quantified functional inequality has the claimed\npointwise conclusion on the nonpositive real numbers. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, Admissible f → DesiredConclusion f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9fdafe3b-aa32-5eda-b46c-c18e395b6a28", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4b0b5c3117d4f3d38b3ec8d6d08593924e91613f96fce1e715c7866162e7d212", "task_path": "tasks/nmp3_9fdafe3b-aa32-5eda-b46c-c18e395b6a28", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9fdafe3b-aa32-5eda-b46c-c18e395b6a28", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_9ff2bc03-1a88-5833-97c4-b6032877b705", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that among any $3^{2022}$ integers, it is possible to find exactly $3^{2021}$ of them whose sum is divisible by $3^{2021}$.\nimport Mathlib\n\n/-!\n# Formalization of the combinatorial divisibility problem\n\nThe original problem asks to prove that from any collection of `3 ^ 2022`\nintegers one can select exactly `3 ^ 2021` whose sum is divisible by\n`3 ^ 2021`.\n\nThe collection is represented by an indexed family `Fin (3 ^ 2022) → ℤ`.\nUsing indices preserves multiplicities: equal integers occurring at different\npositions remain distinguishable choices for the selected subcollection.\n-/\n\nnamespace Problem\n\n/-- The number of initially available integers, namely `3 ^ 2022`. -/\ndef NumberOfIntegers : ℕ := 3 ^ 2022\n\n/-- The number of integers to be selected, namely `3 ^ 2021`. -/\ndef NumberToSelect : ℕ := 3 ^ 2021\n\n/-- Among any `3 ^ 2022` integers, there is a subset of exactly `3 ^ 2021`\nindices whose corresponding integer sum is divisible by `3 ^ 2021`. -/\ndef Target : Prop :=\n ∀ a : Fin NumberOfIntegers → ℤ,\n ∃ S : Finset (Fin NumberOfIntegers),\n S.card = NumberToSelect ∧\n (NumberToSelect : ℤ) ∣ ∑ i ∈ S, a i\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9ff2bc03-1a88-5833-97c4-b6032877b705", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0265eea2f93ab13ce9564fc53cb62e94fc25718daa3d23fd2f34373f8e4c1aa0", "task_path": "tasks/nmp3_9ff2bc03-1a88-5833-97c4-b6032877b705", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "9ff2bc03-1a88-5833-97c4-b6032877b705", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a01a8032-144f-5e11-a8d3-cb367d55940b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\left(a+b+\\frac{1}{c+1}\\right)\\left(b+c+\\frac{1}{a+1}\\right)\\left(c+a+\\frac{1}{b+1}\\right)\\ge\\frac{125}{8}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (a + b + (1 : ℝ) / (c + (1 : ℝ))) *\n (b + c + (1 : ℝ) / (a + (1 : ℝ))) *\n (c + a + (1 : ℝ) / (b + (1 : ℝ)))\n\n/-- The right-hand side of the inequality in the problem. -/\nnoncomputable def RHS : ℝ :=\n (125 : ℝ) / (8 : ℝ)\n\n/--\nFor all positive real numbers `a`, `b`, and `c` satisfying `a * b * c = 1`,\nthe product of the three indicated sums is at least `125 / 8`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = (1 : ℝ) →\n LHS a b c ≥ RHS\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a01a8032-144f-5e11-a8d3-cb367d55940b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "63d60dce5baf96ac817ac3ae99acfb67561f1f82d4f1b887f05cab17916a1c1b", "task_path": "tasks/nmp3_a01a8032-144f-5e11-a8d3-cb367d55940b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a01a8032-144f-5e11-a8d3-cb367d55940b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a04a5ed3-238f-5eda-b247-c22ef528b0fd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- \\bigl(a^{3}+b^{3}+c^{3}\\bigr)^{2}\\ge (a^{4}+b^{4}+c^{4})\\,(ab+bc+ca)\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-variable cubic/quartic inequality\n\nSource problem: Let `a`, `b`, `c > 0`. Prove that\n`(a^3 + b^3 + c^3)^2 ≥ (a^4 + b^4 + c^4) (ab + bc + ca)`.\n\nThe variables are interpreted as positive real numbers. The target is stated\nas a proposition and is not proved here.\n-/\n\nnamespace Problem\n\n/-- The assertion of the source problem, universally quantified over positive\nreal numbers `a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n (a ^ 3 + b ^ 3 + c ^ 3) ^ 2 ≥\n (a ^ 4 + b ^ 4 + c ^ 4) * (a * b + b * c + c * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a04a5ed3-238f-5eda-b247-c22ef528b0fd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ba56885eef8729402133ec1fcef5cc919a9a41c3d76c1b419b9535c850c805fa", "task_path": "tasks/nmp3_a04a5ed3-238f-5eda-b247-c22ef528b0fd", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a04a5ed3-238f-5eda-b247-c22ef528b0fd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a04e1a58-187d-5192-942b-9110efd6b6b4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that $a+b+c=3$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\sqrt{\\frac{a+b}{c+ab}}\\ge 3.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The cyclic sum\n`√((a + b) / (c + a*b)) + √((b + c) / (a + b*c)) + √((c + a) / (b + c*a))`\nspecialized to the three cyclic shifts of `(a, b, c)`. -/\nnoncomputable def cyclicSqrtSum (a b c : ℝ) : ℝ :=\n Real.sqrt ((a + b) / (c + a * b)) +\n Real.sqrt ((b + c) / (a + b * c)) +\n Real.sqrt ((c + a) / (b + c * a))\n\n/-- Under the constraints `a, b, c > 0` and `a + b + c = 3`, the cyclic\nsquare-root sum is at least `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = (3 : ℝ) →\n (3 : ℝ) ≤ cyclicSqrtSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a04e1a58-187d-5192-942b-9110efd6b6b4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "178671a1a9c8bdc1496eca52ffc8d10d113d849a44b758f38d9265e81ec667a5", "task_path": "tasks/nmp3_a04e1a58-187d-5192-942b-9110efd6b6b4", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a04e1a58-187d-5192-942b-9110efd6b6b4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a04fc10f-86eb-55b3-bd6e-34fe7a0dc274", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\triangle ABC$ and $\\triangle A'B'C'$ be two triangles with side lengths $a,b,c$ and $a',b',c'$ respectively. Denote by $A,B,C$ (resp. $A',B',C'$) the angles opposite $a,b,c$ (resp. $a',b',c'$), and let $R$ be the circumradius of $\\triangle ABC$. Prove that \n-- \\[\n-- \\frac{1}{b+c-a}+\\frac{1}{c+a-b}+\\frac{1}{a+b-c}\\;\\ge\\;\\frac{1}{R}\\Bigl(\\frac{\\cos A'}{\\sin A}+\\frac{\\cos B'}{\\sin B}+\\frac{\\cos C'}{\\sin C}\\Bigr)\\, .\n-- \\] \n-- (All side lengths are positive and satisfy the triangle inequalities.)\nimport Mathlib\n\n/-!\n# Formal statement of the two-triangle inequality\n\nThe source problem concerns two Euclidean triangles `ABC` and `A'B'C'`.\nWe encode each triangle as an `Affine.Triangle` in the Euclidean plane. The\nvertices are indexed so that `0 = A`, `1 = B`, and `2 = C`. The side lengths\n`a`, `b`, and `c` are the lengths of `BC`, `CA`, and `AB`, respectively, and\nthe angles `A`, `B`, and `C` are the corresponding Euclidean angles at the\nvertices with the same names. The circumradius is Mathlib's circumradius of\nthe triangle regarded as a `2`-simplex.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used to interpret the two triangles. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The length `a` of side `BC` of `ABC`. -/\ndef sideA (T : Affine.Triangle ℝ Plane) : ℝ :=\n dist (T.points 1) (T.points 2)\n\n/-- The length `b` of side `CA` of `ABC`. -/\ndef sideB (T : Affine.Triangle ℝ Plane) : ℝ :=\n dist (T.points 2) (T.points 0)\n\n/-- The length `c` of side `AB` of `ABC`. -/\ndef sideC (T : Affine.Triangle ℝ Plane) : ℝ :=\n dist (T.points 0) (T.points 1)\n\n/-- The angle `A` opposite side `a`, i.e. the angle `BAC`. -/\ndef angleA (T : Affine.Triangle ℝ Plane) : ℝ :=\n EuclideanGeometry.angle (T.points 1) (T.points 0) (T.points 2)\n\n/-- The angle `B` opposite side `b`, i.e. the angle `CBA`. -/\ndef angleB (T : Affine.Triangle ℝ Plane) : ℝ :=\n EuclideanGeometry.angle (T.points 2) (T.points 1) (T.points 0)\n\n/-- The angle `C` opposite side `c`, i.e. the angle `ACB`. -/\ndef angleC (T : Affine.Triangle ℝ Plane) : ℝ :=\n EuclideanGeometry.angle (T.points 0) (T.points 2) (T.points 1)\n\n/-- The circumradius `R` of the triangle `ABC`. -/\ndef circumradius (T : Affine.Triangle ℝ Plane) : ℝ :=\n T.circumradius\n\n/-- The stated side-length hypotheses: all three side lengths are positive and\nthe three strict triangle inequalities hold. -/\ndef sideLengthsValid (T : Affine.Triangle ℝ Plane) : Prop :=\n 0 < sideA T ∧ 0 < sideB T ∧ 0 < sideC T ∧\n sideA T < sideB T + sideC T ∧\n sideB T < sideC T + sideA T ∧\n sideC T < sideA T + sideB T\n\n/-- The left-hand side of the asserted inequality. -/\ndef inequalityLHS (T : Affine.Triangle ℝ Plane) : ℝ :=\n 1 / (sideB T + sideC T - sideA T) +\n 1 / (sideC T + sideA T - sideB T) +\n 1 / (sideA T + sideB T - sideC T)\n\n/-- The right-hand side of the asserted inequality. -/\ndef inequalityRHS\n (T T' : Affine.Triangle ℝ Plane) : ℝ :=\n (1 / circumradius T) *\n (Real.cos (angleA T') / Real.sin (angleA T) +\n Real.cos (angleB T') / Real.sin (angleB T) +\n Real.cos (angleC T') / Real.sin (angleC T))\n\n/-- The universal assertion of the source problem: for every pair of Euclidean\ntriangles whose side lengths are positive and satisfy the strict triangle\ninequalities, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ (ABC A'B'C' : Affine.Triangle ℝ Plane),\n sideLengthsValid ABC →\n sideLengthsValid A'B'C' →\n inequalityLHS ABC ≥ inequalityRHS ABC A'B'C'\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a04fc10f-86eb-55b3-bd6e-34fe7a0dc274", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "10dea57f8e228f7e727e111178348ef3927424322ccdeeebb82158471fd109e8", "task_path": "tasks/nmp3_a04fc10f-86eb-55b3-bd6e-34fe7a0dc274", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a04fc10f-86eb-55b3-bd6e-34fe7a0dc274", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a0e61ce4-c672-5673-a7fe-151d56130111", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be positive real numbers. Prove that \n-- \\[\n-- \\frac{\\sqrt{ab+c^{2}}}{a+b}+\\frac{\\sqrt{bc+a^{2}}}{b+c}+\\frac{\\sqrt{ca+b^{2}}}{c+a}\n-- \\ge\n-- \\sqrt{\\frac{a}{\\,b+c\\,}}+\\sqrt{\\frac{b}{\\,c+a\\,}}+\\sqrt{\\frac{c}{\\,a+b\\,}}.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formalization of the target inequality\n\nThe original problem asks to prove an inequality for three positive real numbers.\nThis file contains only the formal statement; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- First summand on the left-hand side:\n`sqrt(ab + c^2) / (a + b)`. -/\nnoncomputable def leftTermOne (a b c : ℝ) : ℝ :=\n Real.sqrt (a * b + c ^ 2) / (a + b)\n\n/-- Second summand on the left-hand side:\n`sqrt(bc + a^2) / (b + c)`. -/\nnoncomputable def leftTermTwo (a b c : ℝ) : ℝ :=\n Real.sqrt (b * c + a ^ 2) / (b + c)\n\n/-- Third summand on the left-hand side:\n`sqrt(ca + b^2) / (c + a)`. -/\nnoncomputable def leftTermThree (a b c : ℝ) : ℝ :=\n Real.sqrt (c * a + b ^ 2) / (c + a)\n\n/-- The complete left-hand side of the claimed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n leftTermOne a b c + leftTermTwo a b c + leftTermThree a b c\n\n/-- First summand on the right-hand side:\n`sqrt(a / (b + c))`. -/\nnoncomputable def rightTermOne (a b c : ℝ) : ℝ :=\n Real.sqrt (a / (b + c))\n\n/-- Second summand on the right-hand side:\n`sqrt(b / (c + a))`. -/\nnoncomputable def rightTermTwo (a b c : ℝ) : ℝ :=\n Real.sqrt (b / (c + a))\n\n/-- Third summand on the right-hand side:\n`sqrt(c / (a + b))`. -/\nnoncomputable def rightTermThree (a b c : ℝ) : ℝ :=\n Real.sqrt (c / (a + b))\n\n/-- The complete right-hand side of the claimed inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n rightTermOne a b c + rightTermTwo a b c + rightTermThree a b c\n\n/-- The pointwise inequality asserted by the problem. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete assertion to be proved: for all positive real numbers `a`, `b`,\nand `c`, the left-hand side is at least the right-hand side. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a0e61ce4-c672-5673-a7fe-151d56130111", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9dfd002a764a2d772936cf134417faec6018b7afb2963b61ec2e18caafd592b8", "task_path": "tasks/nmp3_a0e61ce4-c672-5673-a7fe-151d56130111", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a0e61ce4-c672-5673-a7fe-151d56130111", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a134d46d-a90b-5530-a727-8032487ef50f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots ,a_{2016}$ be integers with $\\displaystyle\\sum_{i=1}^{2016} a_i = 0$. Prove that there exist at least $2015$ distinct pairs $(i,j)$ with $i host i = true)).card = N ∧\n (Finset.univ.filter (fun i : Fin (2 * N) => host i = false)).card = N\n\n/-- The problem's `chat` relation for two guest seats `x` and `y`.\n\nThe first four disjuncts say that the two seats are at circular edge-distance at\nmost two: zero or one person is seated between them on one of the two arcs\n(the conjuncts check both orientations). The final two disjuncts say that\nthere are exactly two people on one arc and at least one of those two people is\na host; again both orientations are included. Distinctness is part of the\nrelation, since an unordered pair of guests consists of two different guests. -/\ndef Chat (N : ℕ) (host : Fin (2 * N) → Bool)\n (x y : Fin (2 * N)) : Prop :=\n x ≠ y ∧\n (cyclicSucc (2 * N) x = y ∨\n cyclicSucc (2 * N) (cyclicSucc (2 * N) x) = y ∨\n cyclicSucc (2 * N) y = x ∨\n cyclicSucc (2 * N) (cyclicSucc (2 * N) y) = x ∨\n (cyclicSucc (2 * N) (cyclicSucc (2 * N) (cyclicSucc (2 * N) x)) = y ∧\n (IsHost N host (cyclicSucc (2 * N) x) ∨\n IsHost N host (cyclicSucc (2 * N) (cyclicSucc (2 * N) x)))) ∨\n (cyclicSucc (2 * N) (cyclicSucc (2 * N) (cyclicSucc (2 * N) y)) = x ∧\n (IsHost N host (cyclicSucc (2 * N) y) ∨\n IsHost N host (cyclicSucc (2 * N) (cyclicSucc (2 * N) y)))))\n\n/-- An unordered pair `p` of seats is a chatting guest pair when it has a\nrepresentative `Sym2.mk x y` whose two seats are occupied by guests and whose\ntwo occupants chat. Using `Sym2` makes the pair unordered. -/\ndef IsChattingGuestPair (N : ℕ) (host : Fin (2 * N) → Bool)\n (p : Sym2 (Fin (2 * N))) : Prop :=\n ∃ x y : Fin (2 * N),\n p = Sym2.mk x y ∧ IsGuest N host x ∧ IsGuest N host y ∧ Chat N host x y\n\n/-- The finite set of all unordered pairs of guests that can chat. -/\nnoncomputable def chattingGuestPairs (N : ℕ) (host : Fin (2 * N) → Bool) :\n Finset (Sym2 (Fin (2 * N))) := by\n classical\n exact Finset.univ.filter (fun p : Sym2 (Fin (2 * N)) => IsChattingGuestPair N host p)\n\n/-- The assertion of the problem: for every `N ≥ 4`, every circular seating of\n`N` hosts and `N` guests has at least `N` unordered chatting guest pairs. -/\ndef Target : Prop :=\n ∀ (N : ℕ), 4 ≤ N →\n ∀ host : Fin (2 * N) → Bool,\n IsSeating N host → N ≤ (chattingGuestPairs N host).card\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a1be35da-747d-5bf4-890a-863414d0ff54", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c1cb526ed5e800fca8c80270b745820dd92e636b3695b6388bc61bec4e526b09", "task_path": "tasks/nmp3_a1be35da-747d-5bf4-890a-863414d0ff54", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a1be35da-747d-5bf4-890a-863414d0ff54", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a1d0679b-10ca-5a5f-a923-f4a1758a7af6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers. Prove that \n-- \\[\n-- (a-b)^2(b-c)^2(c-a)^2\\le (a^2+b^2+c^2)(a^4+b^4+c^4).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nProblem: for all real numbers `a`, `b`, `c`,\n\n`(a - b)^2 * (b - c)^2 * (c - a)^2 ≤ (a^2 + b^2 + c^2) * (a^4 + b^4 + c^4)`.\n\nThis file formalizes the statement only. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality:\n`(a - b)^2 (b - c)^2 (c - a)^2`. -/\ndef leftSide (a b c : ℝ) : ℝ :=\n (a - b) ^ 2 * (b - c) ^ 2 * (c - a) ^ 2\n\n/-- The right-hand side of the target inequality:\n`(a^2 + b^2 + c^2) (a^4 + b^4 + c^4)`. -/\ndef rightSide (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) * (a ^ 4 + b ^ 4 + c ^ 4)\n\n/-- The assertion to be proved: for every triple of real numbers `a`, `b`, `c`,\nthe square of the product of the pairwise differences is at most the product of\nthe sum of squares and the sum of fourth powers. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, leftSide a b c ≤ rightSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a1d0679b-10ca-5a5f-a923-f4a1758a7af6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fc609890aa0e2d5fa76e59a8d4417ae7aa77ef79f44ba0543090e14a55d7088d", "task_path": "tasks/nmp3_a1d0679b-10ca-5a5f-a923-f4a1758a7af6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a1d0679b-10ca-5a5f-a923-f4a1758a7af6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a1d43904-b506-5287-a0cf-39b102eb3ffd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- a,b,c are positive real numbers. Prove that \n-- \\[\n-- \\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}\\ge \\frac{2}{3}\\Bigl(\\frac{a}{b+c}+\\frac{b}{c+a}+\\frac{c}{a+b}\\Bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable positive-real inequality\n\nThe source problem asks to prove an inequality for all positive real numbers\n`a`, `b`, and `c`. The declaration below records the precise target\nproposition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The inequality from the problem, stated for arbitrary real numbers.\nIts hypotheses `0 < a`, `0 < b`, and `0 < c` are supplied by `Problem.Target`. -/\ndef MainInequality (a b c : ℝ) : Prop :=\n (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a) ≥\n ((2 : ℝ) / 3) * (a / (b + c) + b / (c + a) + c / (a + b))\n\n/-- The full source assertion: for all positive real numbers `a`, `b`, and `c`,\nthe displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → MainInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a1d43904-b506-5287-a0cf-39b102eb3ffd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2ba3fd9d3f2941b12d29ee377571cd21a68631849b89922a8a63701f3055d515", "task_path": "tasks/nmp3_a1d43904-b506-5287-a0cf-39b102eb3ffd", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a1d43904-b506-5287-a0cf-39b102eb3ffd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a1e04835-fda6-5845-9306-ae8c82c0eee0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers \\(a,b,c\\) prove that \n-- \\[\n-- \\frac{1}{b(a+b)}+\\frac{1}{c(b+c)}+\\frac{1}{a(c+a)}\\ge \\frac{27}{2\\,(a+b+c)^{2}}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`,\nthe cyclic sum of reciprocals is at least `27 / (2 * (a + b + c)^2)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n 1 / (b * (a + b)) + 1 / (c * (b + c)) + 1 / (a * (c + a)) ≥\n 27 / (2 * (a + b + c) ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a1e04835-fda6-5845-9306-ae8c82c0eee0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "daecb58dbeac6999fc760fcd7061bc82acfbcd151c2455c815b9396416d04649", "task_path": "tasks/nmp3_a1e04835-fda6-5845-9306-ae8c82c0eee0", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a1e04835-fda6-5845-9306-ae8c82c0eee0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a1e72c0e-dc27-5f29-a9b8-759ba15dbbcd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a^4+b^4+c^4=3$. Prove that \n-- \\[\n-- \\frac{2a^6}{a^5c^5+b^5c^5}+\\frac{2b^6}{b^5a^5+c^5a^5}+\\frac{2c^6}{c^5b^5+a^5b^5}\\ge 3.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (2 * a ^ 6) / (a ^ 5 * c ^ 5 + b ^ 5 * c ^ 5) +\n (2 * b ^ 6) / (b ^ 5 * a ^ 5 + c ^ 5 * a ^ 5) +\n (2 * c ^ 6) / (c ^ 5 * b ^ 5 + a ^ 5 * b ^ 5)\n\n/-- The admissibility conditions `a,b,c > 0` and `a^4 + b^4 + c^4 = 3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n (0 : ℝ) < a ∧\n (0 : ℝ) < b ∧\n (0 : ℝ) < c ∧\n a ^ 4 + b ^ 4 + c ^ 4 = (3 : ℝ)\n\n/-- The statement to be proved in the problem. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → (3 : ℝ) ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a1e72c0e-dc27-5f29-a9b8-759ba15dbbcd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8ed41f2b7ae644bcba48b4b59291651b07e10740fc386817011826866656207f", "task_path": "tasks/nmp3_a1e72c0e-dc27-5f29-a9b8-759ba15dbbcd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a1e72c0e-dc27-5f29-a9b8-759ba15dbbcd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a1f55ac7-e50e-56cc-9a6a-b5a683777fca", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $a,b,c$,\n-- \\[\n-- \\frac{\\sqrt{a^{12}+b^{12}}\\;\\sqrt[3]{\\,b^{12}+c^{12}\\,}\\;\\sqrt[6]{\\,c^{12}+a^{12}\\,}}{2}\\ge \n-- \\frac{a^{5}b^{7}+b^{8}c^{4}+c^{5}a^{7}}{3}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`, the square root of\n`a ^ 12 + b ^ 12`, the cube root of `b ^ 12 + c ^ 12`, and the sixth root of\n`c ^ 12 + a ^ 12` satisfy the stated inequality with the displayed polynomial\nright-hand side. The cube and sixth roots are represented by real powers with\nexponents `1 / 3` and `1 / 6`; all radicands are positive under the hypotheses. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n (Real.sqrt (a ^ 12 + b ^ 12) *\n Real.rpow (b ^ 12 + c ^ 12) (1 / 3 : ℝ) *\n Real.rpow (c ^ 12 + a ^ 12) (1 / 6 : ℝ)) / 2 ≥\n (a ^ 5 * b ^ 7 + b ^ 8 * c ^ 4 + c ^ 5 * a ^ 7) / 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a1f55ac7-e50e-56cc-9a6a-b5a683777fca", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0da0131a5ee0689993e1e844623757d0521c6c66a99be80a7470dfc7560c0bb3", "task_path": "tasks/nmp3_a1f55ac7-e50e-56cc-9a6a-b5a683777fca", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a1f55ac7-e50e-56cc-9a6a-b5a683777fca", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a21ea1da-383b-5421-8de1-2ff6e07cffe1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exists a subset $S$ of the positive integers such that every positive integer can be expressed as a difference of two elements of $S$ in exactly one way (i.e. for each $n\\in\\mathbb{Z}_{>0}$ there is a unique pair $a,b\\in S$ with $a>b$ and $a-b=n$).\nimport Mathlib\n\nnamespace Problem\n\n/-- A positive integer `n` has exactly one representation as a difference of two\nelements of `S`, with the larger element written first. -/\ndef UniqueDifferenceRepresentation (S : Set ℤ) (n : ℤ) : Prop :=\n ∃! p : ℤ × ℤ,\n p.1 ∈ S ∧ p.2 ∈ S ∧ p.1 > p.2 ∧ p.1 - p.2 = n\n\n/-- `S` is a set of positive integers in which every positive integer has exactly\none representation as a difference of two elements of `S`. -/\ndef IsUniqueDifferenceBasis (S : Set ℤ) : Prop :=\n (∀ s : ℤ, s ∈ S → 0 < s) ∧\n ∀ n : ℤ, 0 < n → UniqueDifferenceRepresentation S n\n\n/-- There exists a subset of the positive integers such that every positive\ninteger has a unique representation as a difference of two elements of the\nsubset, with the larger element written first. -/\ndef Target : Prop :=\n ∃ S : Set ℤ, IsUniqueDifferenceBasis S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a21ea1da-383b-5421-8de1-2ff6e07cffe1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "462fcfa31cea2ec99e0560fbfdc4628557196654764fd7161a097573f40103be", "task_path": "tasks/nmp3_a21ea1da-383b-5421-8de1-2ff6e07cffe1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a21ea1da-383b-5421-8de1-2ff6e07cffe1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a24bf7d4-3d86-5224-9860-070d84084719", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every $\\varepsilon>0$ there exists a positive integer $n$ such that the greatest prime divisor of $n^{2}+1$ is less than $\\varepsilon n$.\nimport Mathlib.Data.Nat.Find\nimport Mathlib.Data.Nat.Prime.Basic\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- A natural number `p` is the greatest prime divisor of `m` when it is prime,\ndivides `m`, and is at least every prime divisor of `m`. -/\ndef IsGreatestPrimeDivisor (m p : ℕ) : Prop :=\n p.Prime ∧ p ∣ m ∧ ∀ q : ℕ, q.Prime → q ∣ m → q ≤ p\n\n/-- The greatest prime divisor of a natural number `m`, defined as the largest\nprime divisor `p ≤ m`. For `m = 0` and `m = 1`, where there is no prime divisor,\nthe fallback value is `0`. For every `m > 1`, the theorem\n`greatestPrimeDivisor_isGreatest` below shows that this is exactly the greatest\nprime divisor. -/\nnoncomputable def greatestPrimeDivisor (m : ℕ) : ℕ :=\n Nat.findGreatest (fun p : ℕ => p.Prime ∧ p ∣ m) m\n\n/-- For every `m > 1`, `greatestPrimeDivisor m` satisfies the defining property\nof the greatest prime divisor. -/\ntheorem greatestPrimeDivisor_isGreatest {m : ℕ} (hm : 1 < m) :\n IsGreatestPrimeDivisor m (greatestPrimeDivisor m) := by\n have hm_pos : 0 < m := lt_trans Nat.zero_lt_one hm\n obtain ⟨q, hq_prime, hq_dvd⟩ := Nat.exists_prime_and_dvd (Nat.ne_of_gt hm)\n have hq_le : q ≤ m := Nat.le_of_dvd hm_pos hq_dvd\n have hP : (fun p : ℕ => p.Prime ∧ p ∣ m) (greatestPrimeDivisor m) :=\n Nat.findGreatest_spec (P := fun p : ℕ => p.Prime ∧ p ∣ m) hq_le ⟨hq_prime, hq_dvd⟩\n refine ⟨hP.1, hP.2, ?_⟩\n intro p hp_prime hp_dvd\n have hp_le : p ≤ m := Nat.le_of_dvd hm_pos hp_dvd\n exact Nat.le_findGreatest (P := fun p : ℕ => p.Prime ∧ p ∣ m) hp_le ⟨hp_prime, hp_dvd⟩\n\n/-- For every positive real `ε`, there is a positive integer `n` whose value\n`n ^ 2 + 1` has greatest prime divisor less than `ε * n`. -/\ndef Target : Prop :=\n ∀ ε : ℝ, 0 < ε →\n ∃ n : ℕ, 0 < n ∧\n ((greatestPrimeDivisor (n ^ 2 + 1) : ℕ) : ℝ) < ε * (n : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a24bf7d4-3d86-5224-9860-070d84084719", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "eb61700af79960950e577eef0f85ad017f5d5ba19f1a10f2f1a050b5ec396b98", "task_path": "tasks/nmp3_a24bf7d4-3d86-5224-9860-070d84084719", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a24bf7d4-3d86-5224-9860-070d84084719", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a257a3f9-83b3-50bd-b1fc-cf1798e9fa2e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exists a triangle that can be partitioned into 2005 congruent triangles.\nimport Mathlib.Geometry.Euclidean.Congruence\nimport Mathlib.Analysis.Convex.Hull\n\n/-!\n# Formal statement\n\nThe problem asks for the existence of a Euclidean triangle that admits a tiling\nby exactly 2005 mutually congruent (nondegenerate) triangles.\n\nThe plane is represented by `EuclideanSpace ℝ (Fin 2)`. A triangle is a set of\nthree non-collinear vertices together with the closed convex hull of those\nvertices. A partition is encoded by an indexed family of pieces: the closed\npieces cover the large triangle, and any two distinct pieces have disjoint\ntopological interiors. Thus common boundary points are allowed, as in the\nusual meaning of a dissection or tiling.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\nopen Set\n\n/-- The Euclidean plane used throughout the formalization. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A (nondegenerate) triangle, represented by its three ordered vertices and a\nproof that those vertices are not collinear. -/\nstructure Triangle where\n /-- The three vertices of the triangle. -/\n vertex : Fin 3 → Plane\n /-- The triangle is nondegenerate. -/\n not_collinear : ¬ Collinear ℝ (Set.range vertex)\n\nnamespace Triangle\n\n/-- The closed triangular region bounded by the three vertices. -/\ndef region (T : Triangle) : Set Plane :=\n convexHull ℝ (Set.range T.vertex)\n\n/-- Two triangles are congruent when some bijection of their vertex sets preserves\nall pairwise distances. In the Euclidean plane this is the usual notion of\ncongruence and permits reflections as well as rotations and translations. -/\ndef Congruent (T U : Triangle) : Prop :=\n ∃ e : Equiv.Perm (Fin 3), ∀ i j : Fin 3,\n dist (T.vertex i) (T.vertex j) = dist (U.vertex (e i)) (U.vertex (e j))\n\n/-- A triangle can be partitioned into exactly `n` mutually congruent triangles.\nThe family is indexed by `Fin n`, its closed regions cover the large triangle,\nthe interiors of distinct pieces are disjoint, and the regions are pairwise\ndistinct. The last condition makes the count of pieces explicit; it is\nmathematically automatic for a nondegenerate triangle with nonempty interior\nand disjoint interiors, but is stated directly to avoid relying on that fact\nin the formal definition. -/\ndef PartitionableIntoCongruentTriangles (T : Triangle) (n : ℕ) : Prop :=\n ∃ pieces : Fin n → Triangle,\n (∀ i j : Fin n, Triangle.Congruent (pieces i) (pieces j)) ∧\n (⋃ i : Fin n, (pieces i).region) = T.region ∧\n (∀ i j : Fin n, i ≠ j →\n Disjoint (interior (pieces i).region) (interior (pieces j).region)) ∧\n Function.Injective (fun i : Fin n => (pieces i).region)\n\nend Triangle\n\n/-- The target assertion: there exists a nondegenerate Euclidean triangle that\ncan be partitioned into exactly 2005 pairwise congruent nondegenerate triangles. -/\ndef Target : Prop :=\n ∃ T : Triangle, T.PartitionableIntoCongruentTriangles 2005\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a257a3f9-83b3-50bd-b1fc-cf1798e9fa2e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2544239fb05481dcb8b831408ae360ccf85250fb03dd9535c14afea37dc889ef", "task_path": "tasks/nmp3_a257a3f9-83b3-50bd-b1fc-cf1798e9fa2e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a257a3f9-83b3-50bd-b1fc-cf1798e9fa2e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a259bb9f-442f-5ca1-bf61-f1e100622bd0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots,a_n$ be real numbers. Prove that \n-- \n-- \\[\n-- \\sum_{i=1}^{n}\\sum_{j=1}^{n}\\frac{a_i\\,a_j}{\\,i+j\\,}\\;\\ge\\;0.\n-- \\] \n-- (The sum is taken over all ordered pairs $(i,j)$ with $1\\le i,j\\le n$.)\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The real value of the one-based index represented by `i : Fin n`. -/\ndef indexValue {n : ℕ} (i : Fin n) : ℝ :=\n ((i.val + 1 : ℕ) : ℝ)\n\n/-- The summand `a_i * a_j / (i + j)` using one-based indices. -/\ndef summand {n : ℕ} (a : Fin n → ℝ) (i j : Fin n) : ℝ :=\n a i * a j / (indexValue i + indexValue j)\n\n/-- The ordered double sum `∑_{i=1}^n ∑_{j=1}^n a_i * a_j / (i+j)`. -/\ndef doubleSum {n : ℕ} (a : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, ∑ j : Fin n, summand a i j\n\n/-- For every natural number `n` and every finite real sequence\n`a_1, ..., a_n`, the ordered double sum\n`∑_{i=1}^n ∑_{j=1}^n a_i * a_j / (i+j)` is nonnegative.\n\nThe source does not explicitly exclude `n = 0`; with the standard empty-sum\nconvention both finite sums are then empty. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (a : Fin n → ℝ), 0 ≤ doubleSum a\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a259bb9f-442f-5ca1-bf61-f1e100622bd0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "688a086a4c9e9e338bbc93dd4c3e952f8c30c66fdf17b89fcc7e0ad66dfe1c2b", "task_path": "tasks/nmp3_a259bb9f-442f-5ca1-bf61-f1e100622bd0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a259bb9f-442f-5ca1-bf61-f1e100622bd0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a282a293-0457-59c3-9a33-9bc45130adde", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{x}{y}\\cdot\\frac{\\sqrt{yz}}{\\,y+z\\,}\\ge\\frac32,\n-- \\] \n-- where the sum is taken over the three cyclic permutations $(x,y,z)$, $(y,z,x)$ and $(z,x,y)\\,.\nimport Mathlib\n\n/-!\n# Cyclic radical inequality\n\nThis file formalizes the statement of the problem in\n`problem.md`. It contains only the target proposition and the\nauxiliary definitions needed to state it; no proof of the target is\nprovided.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- One cyclic summand: `(x / y) * (Real.sqrt (y * z) / (y + z))`. -/\ndef cycTerm (x y z : ℝ) : ℝ :=\n (x / y) * (Real.sqrt (y * z) / (y + z))\n\n/-- The cyclic sum over `(x,y,z)`, `(y,z,x)`, and `(z,x,y)`. -/\ndef cyclicSum (x y z : ℝ) : ℝ :=\n cycTerm x y z + cycTerm y z x + cycTerm z x y\n\n/-- The assertion that for all positive reals `x`, `y`, and `z`, the cyclic\nsum is at least `3/2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z →\n (3 : ℝ) / 2 ≤ cyclicSum x y z\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a282a293-0457-59c3-9a33-9bc45130adde", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "da2d1a5afd8b8d46338a3b21bc1d2c78c3c97c0e462ef8fdc948aa21dc3a8007", "task_path": "tasks/nmp3_a282a293-0457-59c3-9a33-9bc45130adde", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a282a293-0457-59c3-9a33-9bc45130adde", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a28fc86c-5b20-55ef-b53e-7529a2fdac67", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb{R}\\to\\mathbb{R}$ satisfy \n-- $$f\\!\\left(\\frac{x+y}{2}\\right)\\le\\frac{f(x)+f(y)}{2}\\qquad\\forall\\,x,y\\in\\mathbb{R},$$ \n-- (i.e. $f$ is midpoint‑convex) and assume there exists a function $F$ on $\\mathbb{R}$ such that $F'(x)=f(x)$ for all $x$. Prove that $f$ is continuous on $\\mathbb{R}\\,.$\nimport Mathlib\n\n/-!\n# Formal statement: midpoint-convex functions with an antiderivative are continuous\n\nThis file records the proposition from `problem.md`. It does not prove the\nproposition; `Target` is a `Prop`-valued definition, as required for statement\nformalization.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A real-valued function is midpoint-convex when it satisfies Jensen's\ninequality at the midpoint of every pair of real numbers. -/\ndef MidpointConvex (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f ((x + y) / 2) ≤ (f x + f y) / 2\n\n/-- A real-valued function has an antiderivative when there exists a function\n`F : ℝ → ℝ` whose derivative at every real point `x` is `f x`. -/\ndef HasAntiderivative (f : ℝ → ℝ) : Prop :=\n ∃ F : ℝ → ℝ, ∀ x : ℝ, HasDerivAt F (f x) x\n\n/-- A real-valued function is continuous on all of `ℝ`. -/\ndef ContinuousOnReal (f : ℝ → ℝ) : Prop :=\n Continuous f\n\n/-- The complete assertion of the problem: every midpoint-convex function\n`f : ℝ → ℝ` that has an antiderivative on `ℝ` is continuous on `ℝ`. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ,\n MidpointConvex f →\n HasAntiderivative f →\n ContinuousOnReal f\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a28fc86c-5b20-55ef-b53e-7529a2fdac67", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0b22a25ce7161e30961c5264b248e7ef3cc7beef95d163ff8d46dee6bc7dff84", "task_path": "tasks/nmp3_a28fc86c-5b20-55ef-b53e-7529a2fdac67", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a28fc86c-5b20-55ef-b53e-7529a2fdac67", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a2a8d374-e263-5156-9f4e-bc71df463e6a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all distinct positive real numbers $a,b,c$,\n-- \\[\n-- \\frac{(a-b)^{2}}{(a-c)^{2}}+\\frac{(b-c)^{2}}{(b-a)^{2}}+\\frac{(c-a)^{2}}{(c-b)^{2}}\n-- \\;\\ge\\;\n-- \\frac{a+b}{a+c}+\\frac{b+c}{b+a}+\\frac{c+a}{c+b}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for a cyclic rational inequality\n\nThe source problem asks to prove, for all pairwise distinct positive real\nnumbers `a`, `b`, and `c`, the inequality\n\n`(a-b)^2/(a-c)^2 + (b-c)^2/(b-a)^2 + (c-a)^2/(c-b)^2\n ≥ (a+b)/(a+c) + (b+c)/(b+a) + (c+a)/(c+b)`.\n\nThis file only records the proposition; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n ((a - b) ^ 2) / ((a - c) ^ 2) +\n ((b - c) ^ 2) / ((b - a) ^ 2) +\n ((c - a) ^ 2) / ((c - b) ^ 2)\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a + b) / (a + c) + (b + c) / (b + a) + (c + a) / (c + b)\n\n/--\nFor all pairwise distinct positive real numbers `a`, `b`, and `c`, the\nleft-hand side is at least the right-hand side.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n a ≠ b →\n b ≠ c →\n c ≠ a →\n lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a2a8d374-e263-5156-9f4e-bc71df463e6a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "95a2ff6bf64263e117da3660e106a98daa545fcc4ec1e95dec733f9d078dfaf5", "task_path": "tasks/nmp3_a2a8d374-e263-5156-9f4e-bc71df463e6a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a2a8d374-e263-5156-9f4e-bc71df463e6a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a2ad912d-2359-580c-8e0f-2f7d31f4dcc1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb{R}$. Prove that \n-- \\[\n-- a(a+b)^{5}+b(b+c)^{5}+c(c+a)^{5}\\ge 0\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a * (a + b) ^ 5 + b * (b + c) ^ 5 + c * (c + a) ^ 5\n\n/--\nFor all real numbers `a`, `b`, and `c`, the sum\n`a * (a + b)^5 + b * (b + c)^5 + c * (c + a)^5` is nonnegative.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, lhs a b c ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a2ad912d-2359-580c-8e0f-2f7d31f4dcc1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ff84f02ff9e8f41982c3c6f5b3116cbf557453cc3897e86752d9afba6b81875e", "task_path": "tasks/nmp3_a2ad912d-2359-580c-8e0f-2f7d31f4dcc1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a2ad912d-2359-580c-8e0f-2f7d31f4dcc1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a2c7330f-9a00-556d-8044-b2ac57212944", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f(k)$ be the number of integers $n$ satisfying the following conditions: \n-- \n-- (i) $0\\le n<10^k$ (so $n$ is represented by a $k$‑digit decimal string, leading zeros allowed); \n-- \n-- (ii) the digits of $n$ can be permuted in some way to obtain an integer divisible by $11$. \n-- \n-- Prove that for every positive integer $m$,\n-- \\[\n-- f(2m)=10\\,f(2m-1).\n-- \\]\nmodule\n\npublic import Mathlib.Data.Nat.Digits.Lemmas\n\n/-!\n# A decimal-digit permutation problem\n\nThis file formalizes the statement of the problem, but does not prove it.\n-/\n\npublic section\n\nnamespace Problem\n\n/-- The canonical little-endian decimal digit list of `n`, padded with zeroes at\nthe high-order end so that the list has exactly `k` entries (when `n < 10 ^ k`).\nFor example, `decimalDigitsWithLeadingZeros 4 12 = [2, 1, 0, 0]`. -/\ndef decimalDigitsWithLeadingZeros (k n : ℕ) : List ℕ :=\n Nat.digits 10 n ++ List.replicate (k - (Nat.digits 10 n).length) 0\n\n/-- `n` has a `k`-digit decimal representation (leading zeroes allowed) whose\ndigits can be permuted to obtain a natural number divisible by `11`. -/\ndef PermutableToMultipleOf11 (k n : ℕ) : Prop :=\n ∃ digits : List ℕ,\n digits.Perm (decimalDigitsWithLeadingZeros k n) ∧\n (11 : ℕ) ∣ Nat.ofDigits 10 digits\n\n/-- `f k` is the number of natural numbers `n` with `0 ≤ n < 10 ^ k`\nwhose `k`-digit decimal strings (leading zeroes allowed) admit a permutation\nof their digits which represents a multiple of `11`. -/\nnoncomputable def f (k : ℕ) : ℕ := by\n classical\n exact ((Finset.range (10 ^ k)).filter\n (fun n : ℕ => PermutableToMultipleOf11 k n)).card\n\n/-- The assertion to be proved: for every positive integer `m`,\n`f (2m) = 10 * f (2m - 1)`. -/\ndef Target : Prop :=\n ∀ m : ℕ, 0 < m → f (2 * m) = 10 * f (2 * m - 1)\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a2c7330f-9a00-556d-8044-b2ac57212944", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "312898a73f7a3a5380c85c999dcdc6cef9465e0de5baeeeb92f1fe746c013dea", "task_path": "tasks/nmp3_a2c7330f-9a00-556d-8044-b2ac57212944", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a2c7330f-9a00-556d-8044-b2ac57212944", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a2df6df1-3e01-5007-a3dc-8c1c90425d06", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\ge0$ be real numbers such that $a^{2}+b^{2}+c^{2}+d^{2}=3$. Prove that \n-- $$3+abcd\\ge a+b+c+d.$$\nimport Mathlib\n\n/-!\n# Formal statement for the inequality problem\n\nThe source problem asks to prove the following statement over the real numbers:\nfor all nonnegative reals `a`, `b`, `c`, and `d` whose squares sum to `3`,\nthe inequality `3 + a*b*c*d ≥ a + b + c + d` holds.\n\nThis file only declares the target proposition; it deliberately contains no\nproof of that proposition.\n-/\n\nnamespace Problem\n\n/-- The target proposition: for all real numbers `a b c d ≥ 0` with\n`a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = 3`, one has\n`3 + a * b * c * d ≥ a + b + c + d`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c → 0 ≤ d →\n a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = 3 →\n 3 + a * b * c * d ≥ a + b + c + d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a2df6df1-3e01-5007-a3dc-8c1c90425d06", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dd5510dab1dfdfe539a11237eb3f6d080d583e50c2b5e2df6c61216940f3b2e6", "task_path": "tasks/nmp3_a2df6df1-3e01-5007-a3dc-8c1c90425d06", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a2df6df1-3e01-5007-a3dc-8c1c90425d06", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a2f60be2-45de-5109-ab0b-ba2e20b54c5f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $a,b,c$,\n-- \\[\n-- \\frac{a^{2}-ab}{\\,b+c\\,}+\\frac{b^{2}-bc}{\\,c+a\\,}+\\frac{c^{2}-ca}{\\,a+b\\,}\\ge\n-- \\frac13\\Bigl(\\sum_{\\text{cyc}}(a^{2}-ab)\\Bigr)\\Bigl(\\sum_{\\text{cyc}}\\frac1{b+c}\\Bigr).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The cyclic sum `∑_cyc (a² - ab)`, expanded for the ordered triple `(a,b,c)`. -/\ndef cyclicDifferenceSum (a b c : ℝ) : ℝ :=\n (a ^ 2 - a * b) + (b ^ 2 - b * c) + (c ^ 2 - c * a)\n\n/-- The cyclic sum `∑_cyc 1/(b+c)`, expanded for the ordered triple `(a,b,c)`. -/\ndef cyclicReciprocalSum (a b c : ℝ) : ℝ :=\n 1 / (b + c) + 1 / (c + a) + 1 / (a + b)\n\n/-- The left-hand side of the stated inequality. -/\ndef inequalityLeftHandSide (a b c : ℝ) : ℝ :=\n (a ^ 2 - a * b) / (b + c) +\n (b ^ 2 - b * c) / (c + a) +\n (c ^ 2 - c * a) / (a + b)\n\n/-- The right-hand side of the stated inequality. -/\ndef inequalityRightHandSide (a b c : ℝ) : ℝ :=\n (1 / 3 : ℝ) * cyclicDifferenceSum a b c * cyclicReciprocalSum a b c\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the cyclic inequality in the\nproblem holds. It is represented as a proposition rather than proved here.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n inequalityLeftHandSide a b c ≥ inequalityRightHandSide a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a2f60be2-45de-5109-ab0b-ba2e20b54c5f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3032e211f35d48797040506339cadc8914fc198c8778961856b7a8673ffb1f17", "task_path": "tasks/nmp3_a2f60be2-45de-5109-ab0b-ba2e20b54c5f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a2f60be2-45de-5109-ab0b-ba2e20b54c5f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a30b1b32-843e-57e1-8c33-ede0850d42c4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be real numbers. Prove that \n-- \\[\n-- x(x+y)^{3}+y(y+z)^{3}+z(z+x)^{3}\\ge \\frac{8}{27}\\,(x+y+z)^{4}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The pointwise inequality asserted in the problem, for arbitrary real\nnumbers `x`, `y`, and `z`. -/\ndef Inequality (x y z : ℝ) : Prop :=\n x * (x + y) ^ 3 + y * (y + z) ^ 3 + z * (z + x) ^ 3 ≥\n (8 / 27 : ℝ) * (x + y + z) ^ 4\n\n/-- The full universally quantified assertion of the problem: for every\nchoice of real numbers `x`, `y`, and `z`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a30b1b32-843e-57e1-8c33-ede0850d42c4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6b8e95e349442d402f7a79dbe71823b0353204e64571da5c809195dee851c721", "task_path": "tasks/nmp3_a30b1b32-843e-57e1-8c33-ede0850d42c4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a30b1b32-843e-57e1-8c33-ede0850d42c4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a3228805-78b0-5ebc-8eef-e4837d0cd4a0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A convex quadrilateral $ABCD$ is given and $O$ denotes the intersection point of its diagonals. If the perimeters of the four triangles $ABO$, $BCO$, $CDO$, and $DAO$ are equal, prove that $ABCD$ is a rhombus (i.e., $AB=BC=CD=DA$).\n/-\n# Formalization of the quadrilateral perimeter problem\n\nA convex quadrilateral `ABCD` has diagonals `AC` and `BD` meeting at `O`.\nIf the four triangles `ABO`, `BCO`, `CDO`, `DAO` have equal perimeters,\nthen `ABCD` is a rhombus, i.e. `AB = BC = CD = DA`.\n\nThis file contains only definitions (the statement as a `Prop`); no proof of\nthe target assertion is included.\n-/\n\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.Convex.Segment\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A point of the Euclidean plane, represented by its two real coordinates. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The signed two-dimensional cross product of two vectors. -/\ndef cross (u v : Point) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- The oriented turn at `B` along the polygonal path `A, B, C`. -/\ndef turn (A B C : Point) : ℝ := cross (B - A) (C - B)\n\n/-- The closed line segment with endpoints `X` and `Y`. -/\ndef segment (X Y : Point) : Set Point :=\n {P : Point | ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ P = X + t • (Y - X)}\n\n/-- The open line segment with endpoints `X` and `Y`. -/\ndef openSegment (X Y : Point) : Set Point :=\n {P : Point | ∃ t : ℝ, 0 < t ∧ t < 1 ∧ P = X + t • (Y - X)}\n\n/-- `ABCD` is a convex quadrilateral with its vertices listed in cyclic order.\n\nThe four consecutive turns are all nonzero and have the same sign. This is the\nstrict form of convexity: it excludes collinear consecutive triples and\nself-intersecting orderings of four points. -/\ndef IsConvexQuadrilateral (A B C D : Point) : Prop :=\n (0 < turn A B C ∧ 0 < turn B C D ∧ 0 < turn C D A ∧ 0 < turn D A B) ∨\n (turn A B C < 0 ∧ turn B C D < 0 ∧ turn C D A < 0 ∧ turn D A B < 0)\n\n/-- `O` is the (unique) intersection point of the diagonals `AC` and `BD`.\n\nBoth diagonal segments contain `O`, and their intersection consists only of\n`O`. Under convexity these diagonals meet in their interiors. -/\ndef IsIntersectionOfDiagonals (A B C D O : Point) : Prop :=\n O ∈ segment A C ∧ O ∈ segment B D ∧\n ∀ X : Point, X ∈ segment A C → X ∈ segment B D → X = O\n\n/-- The perimeter of the triangle with vertices `X`, `Y`, `Z`. -/\ndef trianglePerimeter (X Y Z : Point) : ℝ :=\n dist X Y + dist Y Z + dist Z X\n\n/-- The perimeters of the four triangles `ABO`, `BCO`, `CDO`, `DAO` are equal. -/\ndef EqualTrianglePerimeters (A B C D O : Point) : Prop :=\n trianglePerimeter A B O = trianglePerimeter B C O ∧\n trianglePerimeter B C O = trianglePerimeter C D O ∧\n trianglePerimeter C D O = trianglePerimeter D A O\n\n/-- `ABCD` is a rhombus in the sense specified by the problem: all four sides\nhave equal length, `AB = BC = CD = DA`. -/\ndef IsRhombus (A B C D : Point) : Prop :=\n dist A B = dist B C ∧ dist B C = dist C D ∧ dist C D = dist D A\n\n/-- The hypotheses of the problem for a convex quadrilateral `ABCD` whose\ndiagonals meet at `O`: all four adjacent triangles have equal perimeters. -/\ndef Admissible (A B C D O : Point) : Prop :=\n IsConvexQuadrilateral A B C D ∧\n IsIntersectionOfDiagonals A B C D O ∧\n EqualTrianglePerimeters A B C D O\n\n/-- The assertion of the problem: for every convex quadrilateral `ABCD` with\ndiagonal intersection `O`, equality of the four triangle perimeters forces\n`ABCD` to be a rhombus. -/\ndef Target : Prop :=\n ∀ (A B C D O : Point), Admissible A B C D O → IsRhombus A B C D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a3228805-78b0-5ebc-8eef-e4837d0cd4a0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "88052148f6545818fa61d9266a61fa072141e968bfab33e2b27211e0659821fb", "task_path": "tasks/nmp3_a3228805-78b0-5ebc-8eef-e4837d0cd4a0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a3228805-78b0-5ebc-8eef-e4837d0cd4a0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a3232740-ff9d-5323-9622-510a1e130058", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{a+b+1}+\\frac{1}{b+c+1}+\\frac{1}{c+a+1}\\le \n-- \\frac{1}{a+2}+\\frac{1}{b+2}+\\frac{1}{c+2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a cyclic inequality under a product constraint\n\nThe source problem quantifies over positive real numbers `a`, `b`, and `c`\nsatisfying `a * b * c = 1`, and asks to prove a cyclic sum inequality.\nThis file records the target proposition without proving it.\n-/\n\nnamespace Problem\n\n/-- A real number is strictly positive. -/\ndef Positive (x : ℝ) : Prop :=\n 0 < x\n\n/-- The product of `a`, `b`, and `c` is exactly one. -/\ndef ProductEqOne (a b c : ℝ) : Prop :=\n a * b * c = 1\n\n/-- The admissibility condition: `a`, `b`, and `c` are all strictly positive\nand their product is exactly one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Positive a ∧ Positive b ∧ Positive c ∧ ProductEqOne a b c\n\n/-- The left-hand side of the requested inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n 1 / (a + b + 1) + 1 / (b + c + 1) + 1 / (c + a + 1)\n\n/-- The right-hand side of the requested inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 1 / (a + 2) + 1 / (b + 2) + 1 / (c + 2)\n\n/-- The claimed non-strict inequality between the two cyclic sums. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≤ RHS a b c\n\n/-- The complete proposition asserted by the problem: for every admissible\ntriple of positive real numbers whose product is one, the cyclic inequality\nholds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a3232740-ff9d-5323-9622-510a1e130058", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d4f8e81feeba8c88a180082a24e01ff0c1cb6166900fd8da03a8d709481b33a5", "task_path": "tasks/nmp3_a3232740-ff9d-5323-9622-510a1e130058", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a3232740-ff9d-5323-9622-510a1e130058", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a33229e6-7a90-5971-ae2e-24a8184cb086", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $ab+bc+ca=1$. Prove that \n-- \\[\n-- (1-a)(1+\\sqrt{bc})+(1-b)(1+\\sqrt{ca})+(1-c)(1+\\sqrt{ab})\\le 2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the nonnegative-square-root inequality\n\nThe source problem asks, for nonnegative real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca = 1`, to prove an upper bound for a sum of three terms\ninvolving square roots of pairwise products.\n-/\n\nnamespace Problem\n\n/-- The hypotheses of the problem: `a`, `b`, and `c` are nonnegative reals\nand their pairwise products satisfy `ab + bc + ca = 1`. -/\ndef Assumptions (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + b * c + c * a = 1\n\n/-- The left-hand side appearing in the asserted inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (1 - a) * (1 + Real.sqrt (b * c)) +\n (1 - b) * (1 + Real.sqrt (c * a)) +\n (1 - c) * (1 + Real.sqrt (a * b))\n\n/-- The asserted pointwise inequality, before quantifying the variables. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≤ 2\n\n/-- The complete proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Assumptions a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a33229e6-7a90-5971-ae2e-24a8184cb086", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "aa9a25806c6d811d710a82384d6f947d9abcd59290405efe040b282899922c9d", "task_path": "tasks/nmp3_a33229e6-7a90-5971-ae2e-24a8184cb086", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a33229e6-7a90-5971-ae2e-24a8184cb086", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a3743ba5-954b-58cd-8b63-1d39aaaa078a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ and let $k\\in[0,2]$. Prove that \n-- \\[\n-- \\sqrt{a^{2}+kab+b^{2}}+\\sqrt{b^{2}+kbc+c^{2}}+\\sqrt{c^{2}+kca+a^{2}}\n-- \\le a+b+c+\\sqrt{a^{2}+b^{2}+c^{2}+k(ab+bc+ca)}\\, .\n-- \\] \n-- (Here $\\sum_{\\text{cyc}}$ denotes the cyclic sum over $a,b,c$.)\nimport Mathlib\n\n/-!\n# Formalization of the cyclic square-root inequality\n\nThe source problem asks, for positive real `a`, `b`, `c` and real `k` in the\nclosed interval `[0, 2]`, to prove an inequality involving three cyclic\nsquare-root terms and one symmetric square-root term.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality:\n`√(a² + k*a*b + b²) + √(b² + k*b*c + c²) + √(c² + k*c*a + a²)`. -/\nnoncomputable def cyclicSqrtSum (a b c k : ℝ) : ℝ :=\n Real.sqrt (a ^ 2 + k * a * b + b ^ 2) +\n Real.sqrt (b ^ 2 + k * b * c + c ^ 2) +\n Real.sqrt (c ^ 2 + k * c * a + a ^ 2)\n\n/-- The right-hand side of the inequality:\n`a + b + c + √(a² + b² + c² + k*(a*b + b*c + c*a))`. -/\nnoncomputable def symmetricSqrtSum (a b c k : ℝ) : ℝ :=\n a + b + c +\n Real.sqrt (a ^ 2 + b ^ 2 + c ^ 2 + k * (a * b + b * c + c * a))\n\n/-- The assertion requested by the problem. The variables `a`, `b`, `c`, and\n`k` are real; `a`, `b`, and `c` are strictly positive; and `k` lies in the\nclosed real interval `[0, 2]`. -/\ndef Target : Prop :=\n ∀ a b c k : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n k ∈ Set.Icc (0 : ℝ) 2 →\n cyclicSqrtSum a b c k ≤ symmetricSqrtSum a b c k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a3743ba5-954b-58cd-8b63-1d39aaaa078a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b7cfb1dd989e382993a9321c1b7b09ca6b1e39e1f38b239c12c7a8f5c0da6fbf", "task_path": "tasks/nmp3_a3743ba5-954b-58cd-8b63-1d39aaaa078a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a3743ba5-954b-58cd-8b63-1d39aaaa078a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a378a38d-1184-537d-bf68-d3e0d4fdad12", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ with $a+b+c=3$. Prove that \n-- $$4(a+b+c)^{3}\\ge 27\\big(ab^{2}+bc^{2}+ca^{2}+abc\\big).$$\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe problem asks to prove, for nonnegative real numbers `a`, `b`, and `c`\nwhose sum is `3`, that\n\n`4 * (a + b + c) ^ 3 ≥ 27 * (a * b ^ 2 + b * c ^ 2 + c * a ^ 2 + a * b * c)`.\n\nThis file contains only the formal statement, not a proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the real triple `(a, b, c)` from the problem:\nall three numbers are nonnegative and their sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a + b + c = 3\n\n/-- The assertion to be proved: for every admissible real triple `(a, b, c)`,\nthe stated quartic inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c →\n 4 * (a + b + c) ^ 3 ≥\n 27 * (a * b ^ 2 + b * c ^ 2 + c * a ^ 2 + a * b * c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a378a38d-1184-537d-bf68-d3e0d4fdad12", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "94a13abcb5eba9cb7d08b5c7483d74fa94e3af335b46bcf2a0bbebc3dacab3c3", "task_path": "tasks/nmp3_a378a38d-1184-537d-bf68-d3e0d4fdad12", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a378a38d-1184-537d-bf68-d3e0d4fdad12", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a39df2fe-593f-54a6-8ea0-1514c8ee45cd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Consider a convex quadrilateral $ABCD$ which has an inscribed circle. Let $I$ be the centre of this incircle, and assume $I$ does not lie on the diagonal $AC$. Let the diagonals $AC$ and $BD$ intersect at $E$. The line through $E$ perpendicular to $BD$ meets the lines $IA$ and $IC$ at points $P$ and $Q$, respectively. Prove that $PE = EQ$.\n/-\nFormal statement of the planar incircle/diagonal problem from `problem.md`.\n\nThis file only states the problem. It deliberately contains no proof of\n`Problem.Target`; the target is a proposition-valued definition.\n-/\n\nmodule\n\npublic import Mathlib.Analysis.Convex.Hull\npublic import Mathlib.Analysis.Convex.Segment\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Geometry.Euclidean.Sphere.Tangent\n\nopen scoped Affine RealInnerProductSpace\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The signed scalar cross product of two planar vectors. -/\nnoncomputable def cross2 (u v : Plane) : ℝ :=\n u 0 * v 1 - u 1 * v 0\n\n/-- `A`, `B`, `C`, `D` are the vertices, in cyclic order, of a strictly convex\n(and nondegenerate) quadrilateral. Either the four turns are all\ncounterclockwise or they are all clockwise. -/\ndef StrictConvexQuadrilateral (A B C D : Plane) : Prop :=\n (0 < cross2 (B - A) (C - A) ∧\n 0 < cross2 (C - B) (D - B) ∧\n 0 < cross2 (D - C) (A - C) ∧\n 0 < cross2 (A - D) (B - D)) ∨\n (cross2 (B - A) (C - A) < 0 ∧\n cross2 (C - B) (D - B) < 0 ∧\n cross2 (D - C) (A - C) < 0 ∧\n cross2 (A - D) (B - D) < 0)\n\n/-- `T` is the point at which the circle with center `I` and radius `r` is\ntangent to the side `AB`: `T` lies on the closed side segment, is at distance\n`r` from `I`, and the radius `IT` is perpendicular to the side `AB`. -/\ndef TangentAtSide (A B I T : Plane) (r : ℝ) : Prop :=\n T ∈ segment ℝ A B ∧ dist I T = r ∧ ⟪T -ᵥ I, B -ᵥ A⟫ = 0\n\n/-- The circle with center `I` is an inscribed circle of the convex\nquadrilateral `ABCD`: its closed disk is contained in the convex hull of the\nfour vertices, and it is tangent to each of the four side segments. -/\ndef HasInscribedCircle (A B C D I : Plane) : Prop :=\n ∃ r : ℝ,\n 0 < r ∧\n Metric.closedBall I r ⊆ convexHull ℝ ({A, B, C, D} : Set Plane) ∧\n (∃ T : Plane, TangentAtSide A B I T r) ∧\n (∃ T : Plane, TangentAtSide B C I T r) ∧\n (∃ T : Plane, TangentAtSide C D I T r) ∧\n (∃ T : Plane, TangentAtSide D A I T r)\n\n/-- The line through `E` perpendicular to the line `BD`, as an affine\nsubspace of the plane. -/\nnoncomputable def perpendicularLineThrough (E B D : Plane) : AffineSubspace ℝ Plane :=\n AffineSubspace.mk' E (line[ℝ, B, D]).directionᗮ\n\n/-- `X` is the unique intersection point of the two affine subspaces `L₁` and\n`L₂`. In the uses below both subspaces are lines. -/\ndef IsUniqueIntersection (L₁ L₂ : AffineSubspace ℝ Plane) (X : Plane) : Prop :=\n X ∈ L₁ ∧ X ∈ L₂ ∧ ∀ Y : Plane, Y ∈ L₁ → Y ∈ L₂ → Y = X\n\n/-- The diagonals `AC` and `BD` meet at `E`; this uses the usual convention that\na diagonal is the closed segment joining opposite vertices, and here the\nintersection is in the relative interior of both diagonals. -/\ndef DiagonalsIntersectAt (A B C D E : Plane) : Prop :=\n E ∈ openSegment ℝ A C ∧ E ∈ openSegment ℝ B D\n\n/-- The line through `E` perpendicular to `BD` meets the line `IA` at `X`.\nThe predicate includes uniqueness of the intersection point. -/\ndef PerpendicularMeetAt (E B D I A X : Plane) : Prop :=\n IsUniqueIntersection (perpendicularLineThrough E B D) (line[ℝ, I, A]) X\n\n/-- The full formal statement of the problem.\n\n`A`, `B`, `C`, `D` are a strictly convex quadrilateral in that cyclic order,\n`I` is the center of an inscribed circle, and `I` is not on the diagonal\nsegment `AC`. The diagonals `AC` and `BD` meet at `E`. The line through `E`\nperpendicular to `BD` is assumed to meet the lines `IA` and `IC` in the unique\npoints `P` and `Q`, respectively. The conclusion is `dist P E = dist E Q`,\ni.e. `PE = EQ`. -/\ndef Target : Prop :=\n ∀ (A B C D I : Plane),\n StrictConvexQuadrilateral A B C D →\n HasInscribedCircle A B C D I →\n I ∉ segment ℝ A C →\n ∀ (E : Plane),\n DiagonalsIntersectAt A B C D E →\n (∃ P : Plane, PerpendicularMeetAt E B D I A P) →\n (∃ Q : Plane, PerpendicularMeetAt E B D I C Q) →\n ∀ (P Q : Plane),\n PerpendicularMeetAt E B D I A P →\n PerpendicularMeetAt E B D I C Q →\n dist P E = dist E Q\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a39df2fe-593f-54a6-8ea0-1514c8ee45cd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8900b7e27510a6ab9121cd2a4c474cc3cee8bd26b62c0d7eeb24cf80845c1570", "task_path": "tasks/nmp3_a39df2fe-593f-54a6-8ea0-1514c8ee45cd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a39df2fe-593f-54a6-8ea0-1514c8ee45cd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a3a7d2fa-8373-5db5-af9b-ffa7b1e78f72", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a}{a+b}+\\frac{b}{b+c}}+\\sqrt{\\frac{b}{b+c}+\\frac{c}{c+a}}+\\sqrt{\\frac{c}{c+a}+\\frac{a}{a+b}}\\ge 3\\cdot\\frac{ab+bc+ca}{a^{2}+b^{2}+c^{2}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of a three-variable real inequality\n\nThe source problem asks to prove an inequality involving three positive real\nnumbers. These declarations record the expression and the assertion as\npropositions; no proof of the assertion is provided.\n-/\n\nnamespace Problem\n\n/-- The first square-root summand from the statement. -/\nnoncomputable def firstSqrt (a b c : ℝ) : ℝ :=\n Real.sqrt (a / (a + b) + b / (b + c))\n\n/-- The second square-root summand from the statement. -/\nnoncomputable def secondSqrt (a b c : ℝ) : ℝ :=\n Real.sqrt (b / (b + c) + c / (c + a))\n\n/-- The third square-root summand from the statement. -/\nnoncomputable def thirdSqrt (a b c : ℝ) : ℝ :=\n Real.sqrt (c / (c + a) + a / (a + b))\n\n/-- The complete left-hand side of the target inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n firstSqrt a b c + secondSqrt a b c + thirdSqrt a b c\n\n/-- The fraction `(ab + bc + ca) / (a² + b² + c²)` appearing on the right. -/\nnoncomputable def quotient (a b c : ℝ) : ℝ :=\n (a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The complete right-hand side of the target inequality. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n 3 * quotient a b c\n\n/-- The displayed inequality for a fixed triple `(a, b, c)`, without its\npositivity hypotheses. -/\nnoncomputable def inequality (a b c : ℝ) : Prop :=\n leftHandSide a b c ≥ rightHandSide a b c\n\n/--\nThe assertion in the source problem: for every triple of positive real numbers\n`a`, `b`, and `c`, the sum of the three displayed principal real square roots\nis at least three times `(ab + bc + ca) / (a² + b² + c²)`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a3a7d2fa-8373-5db5-af9b-ffa7b1e78f72", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ef5a27d170c3401373079164927efc87fd0198a8fd01d492e2d9bff945955f09", "task_path": "tasks/nmp3_a3a7d2fa-8373-5db5-af9b-ffa7b1e78f72", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a3a7d2fa-8373-5db5-af9b-ffa7b1e78f72", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a3ee7e54-f073-5b49-8e54-afdc8e5664d6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,\\dots,a_n\\ge 0$ and define the elementary symmetric polynomials \n-- \\[\n-- S_1=\\sum_{i=1}^n a_i,\\qquad \n-- S_2=\\sum_{1\\le i p.1 < p.2)).val.map\n (fun p : Fin n × Fin n => a p.1 + a p.2))\n\n/-- `n` is a power of two, allowing the conventional zeroth power `2 ^ 0 = 1`. -/\ndef IsPowerOfTwo (n : ℕ) : Prop :=\n ∃ k : ℕ, n = 2 ^ k\n\n/-- The hypothesis that the two indexed representatives have the same multiset\nof unordered pairwise sums but different multisets of original values. -/\ndef Hypotheses {n : ℕ} (a b : Fin n → ℝ) : Prop :=\n pairSumMultiset a = pairSumMultiset b ∧ valueMultiset a ≠ valueMultiset b\n\n/--\nIf two multisets of `n` real numbers have the same multiset of all unordered\npairwise sums, but are not the same multiset, then `n` is a power of two.\n-/\ndef Target : Prop :=\n ∀ (n : ℕ) (a b : Fin n → ℝ),\n pairSumMultiset a = pairSumMultiset b →\n valueMultiset a ≠ valueMultiset b →\n IsPowerOfTwo n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a436e689-f718-5065-bb0f-a460927d6727", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "309ee5a3af6b699b84a9909183b250f44e01545c3db5ea5f0ddcf125b9c6eaf7", "task_path": "tasks/nmp3_a436e689-f718-5065-bb0f-a460927d6727", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a436e689-f718-5065-bb0f-a460927d6727", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a4489987-6fbe-528a-927c-2e5af472bc40", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be nonnegative real numbers. Prove that \n-- \\[\n-- (a^2-bc)\\sqrt[3]{a^2+8bc}+(b^2-ca)\\sqrt[3]{b^2+8ca}+(c^2-ab)\\sqrt[3]{c^2+8ab}\\ge0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the nonnegative-real inequality\n\nThe original problem asks to prove, for all nonnegative real numbers\n`a`, `b`, and `c`, the inequality\n\n`(a^2 - b*c) * cbrt (a^2 + 8*b*c) + ... ≥ 0`.\n\nMathlib does not provide a dedicated real cube-root function. On nonnegative\ninputs the usual real cube root is `x ^ (1 / 3 : ℝ)` (where `^` is\n`Real.rpow`). All three radicands in the target are nonnegative under the\nstated hypotheses.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The three variables of the problem: `a`, `b`, and `c` are nonnegative reals. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The left-hand side of the displayed inequality.\n\nThe notation `x ^ ((1 : ℝ) / 3)` is the principal nonnegative real cube root\nwhen `x ≥ 0`. Each radicand occurring below is nonnegative whenever\n`Admissible a b c` holds. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 - b * c) * (a ^ 2 + 8 * b * c) ^ ((1 : ℝ) / 3) +\n (b ^ 2 - c * a) * (b ^ 2 + 8 * c * a) ^ ((1 : ℝ) / 3) +\n (c ^ 2 - a * b) * (c ^ 2 + 8 * a * b) ^ ((1 : ℝ) / 3)\n\n/-- The assertion stated in the problem, for all nonnegative real `a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → 0 ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a4489987-6fbe-528a-927c-2e5af472bc40", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d23ca88810256b986e830ec2bc0fe2f6c4f1b75dc97502be9edd7339c2af5017", "task_path": "tasks/nmp3_a4489987-6fbe-528a-927c-2e5af472bc40", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a4489987-6fbe-528a-927c-2e5af472bc40", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a455d441-f282-5c7e-bfc1-93f3320821ac", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb{R}$ such that $a^2+(b-c)^2\\neq0$, $b^2+(c-a)^2\\neq0$, $c^2+(a-b)^2\\neq0$. Prove that \n-- \\[\n-- \\frac{7a^2-4bc}{a^2+(b-c)^2}+\\frac{7b^2-4ca}{b^2+(c-a)^2}+\\frac{7c^2-4ab}{c^2+(a-b)^2}\\le 9.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the inequality problem\n\nThe source problem asks to prove a real-variable inequality under three\nexplicit non-vanishing denominator hypotheses. This file records the\nstatement only; it does not provide a proof.\n-/\n\nnamespace Problem\n\n/-- The denominator in the term whose distinguished squared variable is `x`\nand whose two remaining variables are `y` and `z`. -/\ndef Denominator (x y z : ℝ) : ℝ :=\n x ^ 2 + (y - z) ^ 2\n\n/-- The numerator in the term whose distinguished squared variable is `x`\nand whose remaining variables occur in the product `y * z`. -/\ndef Numerator (x y z : ℝ) : ℝ :=\n 7 * x ^ 2 - 4 * y * z\n\n/-- The first summand of the displayed left-hand side. -/\nnoncomputable def FirstTerm (a b c : ℝ) : ℝ :=\n Numerator a b c / Denominator a b c\n\n/-- The second summand of the displayed left-hand side. -/\nnoncomputable def SecondTerm (a b c : ℝ) : ℝ :=\n Numerator b c a / Denominator b c a\n\n/-- The third summand of the displayed left-hand side. -/\nnoncomputable def ThirdTerm (a b c : ℝ) : ℝ :=\n Numerator c a b / Denominator c a b\n\n/-- The entire left-hand side of the displayed inequality. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n FirstTerm a b c + SecondTerm a b c + ThirdTerm a b c\n\n/-- The three non-vanishing assumptions stated in the source problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Denominator a b c ≠ 0 ∧ Denominator b c a ≠ 0 ∧ Denominator c a b ≠ 0\n\n/-- The proposition asserted by the source problem: for all real `a`, `b`, and\n`c` satisfying the three displayed non-vanishing assumptions, the displayed\nsum is at most `9`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LeftHandSide a b c ≤ 9\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a455d441-f282-5c7e-bfc1-93f3320821ac", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6229b1350aba0a0f03245132bf81811d3b06ea59da86762fb53d0dadafc6c5ed", "task_path": "tasks/nmp3_a455d441-f282-5c7e-bfc1-93f3320821ac", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a455d441-f282-5c7e-bfc1-93f3320821ac", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a455d653-0059-5f16-8424-693f332b1da5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any integer $n$, there exists a unique polynomial $Q(x)=\\sum_{i=0}^m a_i x^i$ with each coefficient $a_i\\in\\{0,1,2,\\dots,9\\}$ such that $Q(-2)=Q(-5)=n$.\nimport Mathlib\n\n/-!\n# Formal statement of the digit-polynomial interpolation problem\n\nFor every integer `n`, there is a unique integer polynomial whose\ncoefficients are decimal digits and whose values at `-2` and `-5` are both\n`n`.\n\nThe polynomial is represented by `Polynomial ℤ`. Requiring every coefficient\nto lie in `{0, 1, ..., 9}` also forces the coefficient sequence to have finite\nsupport: in `Polynomial ℤ`, all but finitely many coefficients are zero.\n-/\n\nnamespace Problem\n\n/-- An integer is a decimal digit when it lies in the set `{0, 1, ..., 9}`. -/\ndef IsDigitCoefficient (a : ℤ) : Prop :=\n a ∈ Set.Icc (0 : ℤ) 9\n\n/-- A polynomial has decimal-digit coefficients when every one of its\ncoefficients (including the coefficients beyond its degree, which are zero)\nis a decimal digit. -/\ndef HasDigitCoefficients (Q : Polynomial ℤ) : Prop :=\n ∀ i : ℕ, IsDigitCoefficient (Q.coeff i)\n\n/-- The admissibility predicate for a polynomial, at a prescribed integer `n`:\nits coefficients are decimal digits and its evaluations at `-2` and `-5` are\nboth equal to `n`. -/\ndef Admissible (n : ℤ) (Q : Polynomial ℤ) : Prop :=\n HasDigitCoefficients Q ∧ Q.eval (-2) = n ∧ Q.eval (-5) = n\n\n/-- For every integer `n`, there exists a unique integer polynomial with\ndecimal-digit coefficients taking the same value `n` at `-2` and at `-5`. -/\ndef Target : Prop :=\n ∀ n : ℤ, ∃! Q : Polynomial ℤ, Admissible n Q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a455d653-0059-5f16-8424-693f332b1da5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fc4389d7af66e2bec2c11b2c637abfd6d7685fab7e98a2cb203e2fc88bdb856e", "task_path": "tasks/nmp3_a455d653-0059-5f16-8424-693f332b1da5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a455d653-0059-5f16-8424-693f332b1da5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a4684957-1497-5324-903a-a81b98d27e6a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x$ and $y$ be positive integers such that \n-- \\[\n-- [x+2,y+2]-[x+1,y+1]=[x+1,y+1]-[x,y],\n-- \\]\n-- where $[a,b]$ denotes the least common multiple of $a$ and $b$. Prove that one of the two numbers $x$ and $y$ divides the other.\nimport Mathlib\n\n/-!\n# Formalization of the lcm common-difference problem\n\nThe source problem asks us to prove, for positive integers `x` and `y` satisfying\n`[x+2,y+2] - [x+1,y+1] = [x+1,y+1] - [x,y]` (where `[a,b]` is the least common\nmultiple), that `x ∣ y` or `y ∣ x`.\n\nThe least common multiple of natural numbers is `Nat.lcm`. The differences in the\nsource equation are integer differences; the lcm values themselves are natural\nnumbers and are coerced to integers in `CommonDifference`.\n-/\n\nnamespace Problem\n\n/-- The hypothesis that the three consecutive least common multiples form an\narithmetic progression, expressed using `Nat.lcm` and integer subtraction. -/\ndef CommonDifference (x y : ℕ) : Prop :=\n ((Nat.lcm (x + 2) (y + 2) : ℤ) - (Nat.lcm (x + 1) (y + 1) : ℤ) =\n (Nat.lcm (x + 1) (y + 1) : ℤ) - (Nat.lcm x y : ℤ))\n\n/-- The desired conclusion: at least one of the two natural numbers divides the\nother. -/\ndef DividesOneOf (x y : ℕ) : Prop :=\n x ∣ y ∨ y ∣ x\n\n/-- The full assertion of the problem: for all positive integers `x` and `y`,\nif the three consecutive lcm values have equal successive differences, then one\nof `x` and `y` divides the other. -/\ndef Target : Prop :=\n ∀ x y : ℕ, 0 < x → 0 < y → CommonDifference x y → DividesOneOf x y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a4684957-1497-5324-903a-a81b98d27e6a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8422d791ef9ffd50204040cb17bfc8cf36837ebd0f3b29db5461da9160986af4", "task_path": "tasks/nmp3_a4684957-1497-5324-903a-a81b98d27e6a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a4684957-1497-5324-903a-a81b98d27e6a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a4bafc3e-b16a-5e65-b134-83a376096bd6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a tetrahedron $ABCD$, let $x=AB\\cdot CD$, $y=AC\\cdot BD$, and $z=AD\\cdot BC$, where $AB,AC,AD,BC,BD,CD$ denote the lengths of the edges of the tetrahedron. Prove that there exists a (non‑degenerate) triangle whose side lengths are $x$, $y$, and $z$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Basic\nimport Mathlib.LinearAlgebra.AffineSpace.Independent\n\n/-!\n# A triangle from the products of opposite edges of a tetrahedron\n\nThis file formalizes the statement of the problem. It does not provide a proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A non-degenerate tetrahedron with vertices `A`, `B`, `C`, and `D` in\nthree-dimensional Euclidean space. Concretely, the four vertices are affinely\nindependent over `ℝ`; in dimension three this means that they are not coplanar\nand in particular are pairwise distinct. -/\ndef IsNondegenerateTetrahedron\n (A B C D : EuclideanSpace ℝ (Fin 3)) : Prop :=\n AffineIndependent ℝ ![A, B, C, D]\n\n/-- There is a non-degenerate triangle in the Euclidean plane whose three side\nlengths are `x`, `y`, and `z`, in that order. Affine independence of the three\nvertices over `ℝ` says exactly that they are not collinear, so in particular the\nthree vertices are pairwise distinct. -/\ndef IsNondegenerateTriangleWithSideLengths (x y z : ℝ) : Prop :=\n ∃ P Q R : EuclideanSpace ℝ (Fin 2),\n AffineIndependent ℝ ![P, Q, R] ∧\n dist P Q = x ∧ dist Q R = y ∧ dist R P = z\n\n/-- The product `AB · CD` of the lengths of the opposite edges `AB` and `CD`. -/\ndef edgeProductAB_CD (A B C D : EuclideanSpace ℝ (Fin 3)) : ℝ :=\n dist A B * dist C D\n\n/-- The product `AC · BD` of the lengths of the opposite edges `AC` and `BD`. -/\ndef edgeProductAC_BD (A B C D : EuclideanSpace ℝ (Fin 3)) : ℝ :=\n dist A C * dist B D\n\n/-- The product `AD · BC` of the lengths of the opposite edges `AD` and `BC`. -/\ndef edgeProductAD_BC (A B C D : EuclideanSpace ℝ (Fin 3)) : ℝ :=\n dist A D * dist B C\n\n/-- **Target statement.** For every non-degenerate tetrahedron `ABCD` in\nthree-dimensional Euclidean space, if\n`x = AB · CD`, `y = AC · BD`, and `z = AD · BC`, then there exists a\nnon-degenerate triangle whose side lengths are `x`, `y`, and `z`. -/\ndef Target : Prop :=\n ∀ A B C D : EuclideanSpace ℝ (Fin 3),\n IsNondegenerateTetrahedron A B C D →\n IsNondegenerateTriangleWithSideLengths\n (edgeProductAB_CD A B C D)\n (edgeProductAC_BD A B C D)\n (edgeProductAD_BC A B C D)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a4bafc3e-b16a-5e65-b134-83a376096bd6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "db0c77587031c226dae7ffc134245f9d20a7767b906f7f20eb7b1f2ce8a2f51b", "task_path": "tasks/nmp3_a4bafc3e-b16a-5e65-b134-83a376096bd6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a4bafc3e-b16a-5e65-b134-83a376096bd6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a4bfa827-974e-5e67-9c40-bf08675475b4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ and $ab+bc+ca>0$. Prove \n-- \\[\n-- \\sum_{cyc}\\frac{b^{2}+bc+c^{2}}{a^{2}+bc}\\ge \\sum_{cyc}\\frac{a}{\\,b+c\\,}+3\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand cyclic sum\n`(b² + bc + c²)/(a² + bc) + (c² + ca + a²)/(b² + ca)\n + (a² + ab + b²)/(c² + ab)`. -/\ndef CyclicLHS (a b c : ℝ) : ℝ :=\n (b ^ 2 + b * c + c ^ 2) / (a ^ 2 + b * c) +\n (c ^ 2 + c * a + a ^ 2) / (b ^ 2 + c * a) +\n (a ^ 2 + a * b + b ^ 2) / (c ^ 2 + a * b)\n\n/-- The right-hand cyclic sum `a/(b+c) + b/(c+a) + c/(a+b)`. -/\ndef CyclicRHS (a b c : ℝ) : ℝ :=\n a / (b + c) + b / (c + a) + c / (a + b)\n\n/-- The assertion of the problem: for nonnegative real `a`, `b`, `c` with\n`ab + bc + ca > 0`, the cyclic sum on the left is at least the cyclic sum\non the right plus `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n 0 < a * b + b * c + c * a →\n CyclicLHS a b c ≥ CyclicRHS a b c + 3\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a4bfa827-974e-5e67-9c40-bf08675475b4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "aa42b78564c80ea44d67348ed77072cef2c5ddce7b10926a0fe8303d8edcf470", "task_path": "tasks/nmp3_a4bfa827-974e-5e67-9c40-bf08675475b4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a4bfa827-974e-5e67-9c40-bf08675475b4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a4ca2047-f51f-53b5-8626-6a36fe6e3ecb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P,Q\\in\\mathbb{R}[x]$ be relatively prime non‑constant polynomials. Prove that there are at most three real numbers $\\lambda$ for which $P+\\lambda Q$ is the square of a polynomial (i.e. $P+\\lambda Q=R^2$ for some $R\\in\\mathbb{R}[x]$).\nimport Mathlib.Algebra.Polynomial.Degree.Defs\nimport Mathlib.Basic.Real.Basic\nimport Mathlib.Data.Set.Card\nimport Mathlib.RingTheory.Coprime.Basic\n\n/-!\n# Formal statement\n\nLet `P Q : ℝ[x]` be relatively prime non-constant polynomials. The target\nasserts that there are at most three real numbers `λ` for which\n`P + λ • Q` (equivalently, `P + C λ * Q`) is the square of a polynomial\nin `ℝ[x]`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A polynomial over `ℝ` is non-constant when its `natDegree` is nonzero.\nThis excludes all constant polynomials, including the zero polynomial. -/\ndef IsNonconstantPolynomial (P : Polynomial ℝ) : Prop :=\n P.natDegree ≠ 0\n\n/-- A polynomial is a polynomial square when it is `R ^ 2` for some polynomial `R`. -/\ndef IsPolynomialSquare (P : Polynomial ℝ) : Prop :=\n ∃ R : Polynomial ℝ, P = R ^ 2\n\n/-- A real number `lambda` is admissible for `P` and `Q` when `P + λ Q`\nis the square of a polynomial. Here `Polynomial.C lambda * Q` is the\npolynomial obtained by multiplying every coefficient of `Q` by `lambda`. -/\ndef AdmissibleLambda (P Q : Polynomial ℝ) (lambda : ℝ) : Prop :=\n IsPolynomialSquare (P + Polynomial.C lambda * Q)\n\n/-- The set of all real `lambda` for which `lambda` is admissible for `P` and `Q`. -/\ndef AdmissibleLambdas (P Q : Polynomial ℝ) : Set ℝ :=\n {lambda : ℝ | AdmissibleLambda P Q lambda}\n\n/-- The assertion that a set of real numbers has at most three elements. -/\ndef AtMostThree (s : Set ℝ) : Prop :=\n s.Finite ∧ s.ncard ≤ 3\n\n/-- The main target: for every pair of relatively prime non-constant real\npolynomials `P` and `Q`, the set of `lambda : ℝ` for which `P + λ Q` is a\npolynomial square has at most three elements. -/\ndef Target : Prop :=\n ∀ (P Q : Polynomial ℝ),\n IsNonconstantPolynomial P →\n IsNonconstantPolynomial Q →\n IsCoprime P Q →\n AtMostThree (AdmissibleLambdas P Q)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a4ca2047-f51f-53b5-8626-6a36fe6e3ecb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "32da00238c6ea9259690985b763483888b5a4f3d5aee6befce9a86bb69d4cbe2", "task_path": "tasks/nmp3_a4ca2047-f51f-53b5-8626-6a36fe6e3ecb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a4ca2047-f51f-53b5-8626-6a36fe6e3ecb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a4ec9d1c-ed7b-5826-aedf-0e4281962805", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\ge0$ satisfy \n-- $$2(ab+ac+ad+bc+bd+cd)+abc+abd+acd+bcd=16.$$ \n-- Prove that \n-- $$a+b+c+d\\ge\\frac{2}{3}\\bigl(ab+ac+ad+bc+bd+cd\\bigr).$$\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the four-variable inequality problem\n\nThe source problem asks: for nonnegative real numbers `a`, `b`, `c`, and `d`\nsatisfying the displayed symmetric equation, prove the displayed lower bound on\n`a + b + c + d` in terms of the pairwise-product sum.\n\nThis file only records the statement. It intentionally contains no proof.\n-/\n\nnamespace Problem\n\n/-- The sum of the six pairwise products of `a`, `b`, `c`, and `d`. -/\ndef pairwiseSum (a b c d : ℝ) : ℝ :=\n a * b + a * c + a * d + b * c + b * d + c * d\n\n/-- The sum of the four triple products of `a`, `b`, `c`, and `d`. -/\ndef tripleSum (a b c d : ℝ) : ℝ :=\n a * b * c + a * b * d + a * c * d + b * c * d\n\n/-- The admissibility predicate from the problem: all four numbers are\nnonnegative and they satisfy\n`2(ab+ac+ad+bc+bd+cd) + abc+abd+acd+bcd = 16`. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 ≤ d ∧\n 2 * pairwiseSum a b c d + tripleSum a b c d = (16 : ℝ)\n\n/-- The inequality to be proved under the admissibility condition. -/\ndef Inequality (a b c d : ℝ) : Prop :=\n a + b + c + d ≥ (2 / 3 : ℝ) * pairwiseSum a b c d\n\n/-- The full universally quantified statement of the source problem. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Inequality a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a4ec9d1c-ed7b-5826-aedf-0e4281962805", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a450ca210309e0508aeed25ea42de14ac863e94f248469c6aeb5e8eab1b73c52", "task_path": "tasks/nmp3_a4ec9d1c-ed7b-5826-aedf-0e4281962805", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a4ec9d1c-ed7b-5826-aedf-0e4281962805", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a521715f-9c2f-507e-aa59-ae27554e62fb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) with \\(abc=1\\). Prove that \n-- \\[\n-- \\frac{1}{a^{2017}+a^{2015}+1}+\\frac{1}{b^{2017}+b^{2015}+1}+\\frac{1}{c^{2017}+c^{2015}+1}\\ge 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe source problem asks to prove, for all positive real numbers `a b c` with\n`a * b * c = 1`, that a sum of three reciprocal expressions is at least one.\nThe declarations below encapsulate the admissibility condition, the left-hand\nside, and the complete proposition to be proved.\n-/\n\nnamespace Problem\n\n/-- The hypotheses of the problem: `a`, `b`, and `c` are positive real numbers\nwhose product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n (0 : ℝ) < a ∧ (0 : ℝ) < b ∧ (0 : ℝ) < c ∧ a * b * c = (1 : ℝ)\n\n/-- One summand from the left-hand side:\n`1 / (x ^ 2017 + x ^ 2015 + 1)`. -/\nnoncomputable def Summand (x : ℝ) : ℝ :=\n (1 : ℝ) / (x ^ (2017 : ℕ) + x ^ (2015 : ℕ) + (1 : ℝ))\n\n/-- The complete left-hand side of the desired inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n Summand a + Summand b + Summand c\n\n/-- The problem's full assertion: for every triple of positive real numbers with\nproduct one, the stated sum is at least one. The exponents `2017` and `2015`\nare natural-number exponents and all arithmetic is real arithmetic. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ (1 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a521715f-9c2f-507e-aa59-ae27554e62fb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8ac09c43fd2a0aa4c57f5819795ea867782975167d2f46339347a270d96d3c49", "task_path": "tasks/nmp3_a521715f-9c2f-507e-aa59-ae27554e62fb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a521715f-9c2f-507e-aa59-ae27554e62fb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a55532aa-0e27-56f8-8743-c61058b420cb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a, b, c$ are positive real numbers satisfying $a^3+b^3+c^3+abc=4$, prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{(5a^2+bc)^2}{(a+b)(a+c)}\\ge\\frac{81}{a+b+c}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, `c`\nsatisfying `a^3 + b^3 + c^3 + a*b*c = 4`, the inequality\n\n`sum_cyc ((5*a^2 + b*c)^2 / ((a+b)*(a+c))) >= 81/(a+b+c)`.\n\nThe predicate `Problem.Target` below is the unproved mathematical assertion\nrequested by the source problem. Its body records the proposition; it is not\na proof of that proposition.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition on the real numbers `a`, `b`, and `c`:\neach is positive and `a^3 + b^3 + c^3 + a*b*c = 4`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 3 + b ^ 3 + c ^ 3 + a * b * c = 4\n\n/-- The cyclic sum on the left-hand side of the stated inequality. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n (5 * a ^ 2 + b * c) ^ 2 / ((a + b) * (a + c)) +\n (5 * b ^ 2 + c * a) ^ 2 / ((b + c) * (b + a)) +\n (5 * c ^ 2 + a * b) ^ 2 / ((c + a) * (c + b))\n\n/-- The right-hand side of the stated inequality. -/\nnoncomputable def RightSide (a b c : ℝ) : ℝ :=\n 81 / (a + b + c)\n\n/-- The full assertion of the source problem: for every triple of positive\nreal numbers satisfying `a^3 + b^3 + c^3 + a*b*c = 4`, the cyclic sum is at\nleast `81/(a+b+c)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → CyclicSum a b c ≥ RightSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a55532aa-0e27-56f8-8743-c61058b420cb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ffb1730b340698c8784a02a95336424ae4a51fd8e034a733fb99ac4a6b43daad", "task_path": "tasks/nmp3_a55532aa-0e27-56f8-8743-c61058b420cb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a55532aa-0e27-56f8-8743-c61058b420cb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a5949f51-f2a3-5998-b525-1c7eaeebaa90", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{\\sqrt[3]{a}}{b^{2}+bc+c^{2}}+\\frac{\\sqrt[3]{b}}{c^{2}+ac+a^{2}}+\\frac{\\sqrt[3]{c}}{a^{2}+ab+b^{2}}\\ge 1.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The real cube root of a real number, represented by the real power `x ^ (1/3)`.\nThe target only applies this to positive numbers, where this is the usual cube root. -/\ndef cubeRoot (x : ℝ) : ℝ := x ^ (1 / 3 : ℝ)\n\n/-- The three-term left-hand side of the stated inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n cubeRoot a / (b ^ 2 + b * c + c ^ 2) +\n cubeRoot b / (c ^ 2 + a * c + a ^ 2) +\n cubeRoot c / (a ^ 2 + a * b + b ^ 2)\n\n/-- The positivity and normalization assumptions imposed on `a`, `b`, and `c`. -/\ndef assumptions (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The statement to be proved: for all positive reals `a`, `b`, `c` with sum `3`,\nthe indicated cyclic sum is at least `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, assumptions a b c → lhs a b c ≥ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5949f51-f2a3-5998-b525-1c7eaeebaa90", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4118110898a29023d7a5d6b6a977e5370d2364bbc20ce6388ef43ad1dd3a08da", "task_path": "tasks/nmp3_a5949f51-f2a3-5998-b525-1c7eaeebaa90", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5949f51-f2a3-5998-b525-1c7eaeebaa90", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a5a249dd-517a-50ae-8694-d1ee4a6c3ab2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{a}{2b+1}+\\frac{b}{2c+1}+\\frac{c}{2a+1}\\le\\frac{1}{abc}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, `c` with `a + b + c = 3`,\nthe sum `a / (2b + 1) + b / (2c + 1) + c / (2a + 1)` is at most\n`1 / (a * b * c)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a + b + c = 3 →\n a / (2 * b + 1) + b / (2 * c + 1) + c / (2 * a + 1) ≤\n (1 : ℝ) / (a * b * c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5a249dd-517a-50ae-8694-d1ee4a6c3ab2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "73966bf17e53a27bb832a31370e0ddd2110321123baa643124225e5d7524bb42", "task_path": "tasks/nmp3_a5a249dd-517a-50ae-8694-d1ee4a6c3ab2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5a249dd-517a-50ae-8694-d1ee4a6c3ab2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a5a4bd42-0070-502c-8341-237bb8e38000", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{2}{1+\\sqrt2}\\le \n-- \\frac{a}{a+\\sqrt{2b^2+2c^2}}+\n-- \\frac{b}{b+\\sqrt{2c^2+2a^2}}+\n-- \\frac{c}{c+\\sqrt{2a^2+2b^2}}\n-- \\le 1.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the cyclic radical inequality\n\nFor positive real numbers `a`, `b`, and `c`, the problem asks to prove the\ntwo-sided estimate\n\n`2 / (1 + sqrt 2) ≤ a/(a + sqrt (2*b^2 + 2*c^2)) + ... ≤ 1`.\n\nNo proof of the assertion is included here; the declarations below only\nformalize the proposition.\n-/\n\nnamespace Problem\n\n/-- The first cyclic summand:\n`a / (a + sqrt (2*b^2 + 2*c^2))`. -/\nnoncomputable def firstSummand (a b c : ℝ) : ℝ :=\n a / (a + Real.sqrt (2 * b ^ 2 + 2 * c ^ 2))\n\n/-- The second cyclic summand:\n`b / (b + sqrt (2*c^2 + 2*a^2))`. -/\nnoncomputable def secondSummand (a b c : ℝ) : ℝ :=\n b / (b + Real.sqrt (2 * c ^ 2 + 2 * a ^ 2))\n\n/-- The third cyclic summand:\n`c / (c + sqrt (2*a^2 + 2*b^2))`. -/\nnoncomputable def thirdSummand (a b c : ℝ) : ℝ :=\n c / (c + Real.sqrt (2 * a ^ 2 + 2 * b ^ 2))\n\n/-- The cyclic sum appearing in the problem. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n firstSummand a b c + secondSummand a b c + thirdSummand a b c\n\n/-- The lower bound `2 / (1 + sqrt 2)`. -/\nnoncomputable def lowerConstant : ℝ :=\n 2 / (1 + Real.sqrt 2)\n\n/-- The complete two-sided assertion requested by the problem.\n\nThe same universally quantified positive real variables occur in both\ninequalities in the conclusion. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n lowerConstant ≤ cyclicSum a b c ∧ cyclicSum a b c ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5a4bd42-0070-502c-8341-237bb8e38000", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1c3a9992686e5384a9fe87a6e2f2c72b9ad48a9dd05904b00bc1e01c64e30d82", "task_path": "tasks/nmp3_a5a4bd42-0070-502c-8341-237bb8e38000", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5a4bd42-0070-502c-8341-237bb8e38000", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a5bca5c3-5d18-56c0-ae95-6ca00fd3cd9e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers such that $abc=1$. Prove that \n-- \\[\n-- \\frac{12a+7}{2a^{2}+1}+\\frac{12b+7}{2b^{2}+1}+\\frac{12c+7}{2c^{2}+1}\\le 19.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`\nwith `a * b * c = 1`, the stated sum of rational expressions is at most `19`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n (12 * a + 7) / (2 * a ^ 2 + 1) +\n (12 * b + 7) / (2 * b ^ 2 + 1) +\n (12 * c + 7) / (2 * c ^ 2 + 1) ≤ 19\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5bca5c3-5d18-56c0-ae95-6ca00fd3cd9e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "10de7d54797e670d90ad9a5c3518e6f6fdd6005fbf90265f726b1eecaa36e69e", "task_path": "tasks/nmp3_a5bca5c3-5d18-56c0-ae95-6ca00fd3cd9e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5bca5c3-5d18-56c0-ae95-6ca00fd3cd9e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a5ca00b9-f023-51b4-8781-671c9d7f9983", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In any triangle $ABC$, prove that \n-- \\[\n-- \\sum_{cyc}\\frac{\\sin^{2}B+\\sin^{2}C}{\\sin^{2}\\!\\left(\\frac{A}{2}\\right)}\\ge 18,\n-- \\] \n-- where the sum is taken cyclically over $(A,B,C)$.\nimport Mathlib\n\n/-!\n# Cyclic trigonometric inequality for the angles of a triangle\n\nThis file formalizes the statement (not a proof) of the problem. The angles\n`A`, `B`, and `C` are represented by real numbers in radians. A nondegenerate\ntriangle is encoded by the standard conditions that its three angles are\nstrictly positive and sum to `π`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The summand corresponding to the cyclic position `(A, B, C)`:\n`(sin² B + sin² C) / sin² (A / 2)`. -/\ndef cyclicTerm (A B C : ℝ) : ℝ :=\n ((Real.sin B) ^ 2 + (Real.sin C) ^ 2) / (Real.sin (A / 2)) ^ 2\n\n/-- The cyclic sum of the three displayed summands. -/\ndef cyclicSum (A B C : ℝ) : ℝ :=\n cyclicTerm A B C + cyclicTerm B C A + cyclicTerm C A B\n\n/-- The target statement: for every triple of (radian) angles that are strictly\npositive and sum to `π`, the cyclic sum is at least `18`. -/\ndef Target : Prop :=\n ∀ A B C : ℝ,\n 0 < A →\n 0 < B →\n 0 < C →\n A + B + C = Real.pi →\n cyclicSum A B C ≥ 18\n\nend Problem\n\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5ca00b9-f023-51b4-8781-671c9d7f9983", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "635aaba774275e2afe70b8284c5604a6d0d2814496022729f80ed64e50664f09", "task_path": "tasks/nmp3_a5ca00b9-f023-51b4-8781-671c9d7f9983", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5ca00b9-f023-51b4-8781-671c9d7f9983", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a5dcd599-b878-568f-bc41-d2e9c9156aea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(a_i)_{i\\ge 0}$ be an infinite sequence with each $a_i\\in\\{-1,1\\}$. Prove that there exist non‑negative integers $n$ and $k$ such that \n-- \\[\n-- \\Bigl|\\sum_{i=0}^{n}\\prod_{j=0}^{k}a_{i+j}\\Bigr|=2017\\,.\n-- \\] \n-- (The product $\\prod_{j=0}^{k}a_{i+j}$ is taken over $k+1$ consecutive terms, so $k\\ge 0$.)\nimport Mathlib\n\n/-!\n# Formalization of the sign-sequence problem\n\nThe source problem asks us to prove, for every infinite sequence `a : ℕ → ℤ`\nwhose terms are all either `-1` or `1`, that some block-sum of consecutive\nproducts equals `2017` in absolute value. Here `k` is the number of shifts\nafter the first factor, so the product for fixed `i` and `k` contains exactly\n`k + 1` factors, indexed by `j = 0, …, k`. Likewise the outer sum for fixed\n`n` contains exactly `n + 1` terms, indexed by `i = 0, …, n`.\n\nThis file states the assertion as a proposition-valued definition. It does\nnot contain a proof.\n-/\n\nnamespace Problem\n\n/-- An infinite integer sequence each of whose terms is either `-1` or `1`. -/\ndef IsSignSequence (a : ℕ → ℤ) : Prop :=\n ∀ i : ℕ, a i = -1 ∨ a i = 1\n\n/-- The product of the `k + 1` consecutive terms starting at index `i`. -/\ndef consecutiveProduct (a : ℕ → ℤ) (i k : ℕ) : ℤ :=\n ∏ j ∈ Finset.range (k + 1), a (i + j)\n\n/-- The sum of the consecutive products starting at indices `0` through `n`. -/\ndef consecutiveProductSum (a : ℕ → ℤ) (n k : ℕ) : ℤ :=\n ∑ i ∈ Finset.range (n + 1), consecutiveProduct a i k\n\n/--\nThe full assertion of the problem: for every infinite sign sequence, there\nexist natural numbers `n` and `k` such that the absolute value of the sum of\nthe products of the `k + 1` consecutive terms, over the block starting at\n`i = 0` through `i = n`, is `2017`.\n-/\ndef Target : Prop :=\n ∀ a : ℕ → ℤ,\n IsSignSequence a →\n ∃ n k : ℕ,\n |consecutiveProductSum a n k| = (2017 : ℤ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5dcd599-b878-568f-bc41-d2e9c9156aea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fd8aadd8cd5d99d7ba98ff2b0bcc2a2c4ae1afd1ba108b52be1f1f12388e2d29", "task_path": "tasks/nmp3_a5dcd599-b878-568f-bc41-d2e9c9156aea", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5dcd599-b878-568f-bc41-d2e9c9156aea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a5e2477f-324a-5ac4-8f64-b75d144a66b1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, $c$ be the side‑lengths of a triangle. Prove that \n-- \\[\n-- \\frac{a(b+c)}{a^{2}+bc}+\\frac{b(c+a)}{b^{2}+ca}+\\frac{c(a+b)}{c^{2}+ab}+\\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}\\le 4.\n-- \\] \n-- (Here $a,b,c>0$ and $a0$ satisfy $a^2+b^2+c^2=3$. Prove that for every positive integer $n$,\n-- \\[\n-- a^{4n}+b^{4n}+c^{4n}+a^{n}b^{n}+b^{n}c^{n}+c^{n}a^{n}\\ge 6\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement\n\nLet `a`, `b`, and `c` be positive real numbers satisfying\n`a^2 + b^2 + c^2 = 3`. The target asserts that, for every positive\ninteger `n`, the displayed symmetric expression is at least `6`.\n-/\n\nnamespace Problem\n\n/-- The expression whose lower bound is asserted in the problem. -/\ndef lhs (a b c : ℝ) (n : ℕ) : ℝ :=\n a ^ (4 * n) + b ^ (4 * n) + c ^ (4 * n)\n + a ^ n * b ^ n + b ^ n * c ^ n + c ^ n * a ^ n\n\n/-- The assertion of the problem, with all hypotheses and quantifiers explicit. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = 3 →\n ∀ (n : ℕ), 0 < n → lhs a b c n ≥ 6\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5e61416-74bf-5608-a537-2c706ff1d7b2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "843d1672dfb05bf266aaced7fc210eb3cb382739e3be8c45ba08c9345b3b52eb", "task_path": "tasks/nmp3_a5e61416-74bf-5608-a537-2c706ff1d7b2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a5e61416-74bf-5608-a537-2c706ff1d7b2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a60b59c5-cc6b-5bf1-a079-d17b7f4cf2cf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $x$, $y$, and $w$,\n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{2w(2y-x)-2xy}{x\\,(y+w)}\\;\\ge\\;\\sum_{\\text{cyc}}\\Bigl(\\frac{y-x}{y+x}\\Bigr)^{2},\n-- \\]\n-- where the cyclic sum is taken over the three ordered triples $(x,y,w)$, $(y,w,x)$, $(w,x,y)\\,. $\nimport Mathlib\n\n/-!\n# Formalization of a cyclic real-variable inequality\n\nThe source problem asks to prove, for all positive real numbers `x`, `y`, and `w`,\n\n`Σ_cyc (2*w*(2*y - x) - 2*x*y) / (x*(y + w))\n ≥ Σ_cyc ((y - x)/(y + x))^2`,\n\nwhere the cyclic sum runs over `(x,y,w)`, `(y,w,x)`, and `(w,x,y)`.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum of a three-variable real expression over\n`(x, y, w)`, `(y, w, x)`, and `(w, x, y)`. -/\ndef cyclicSum (f : ℝ → ℝ → ℝ → ℝ) (x y w : ℝ) : ℝ :=\n f x y w + f y w x + f w x y\n\n/-- The left-hand cyclic summand, as a function of one ordered triple. -/\nnoncomputable def leftSummand (x y w : ℝ) : ℝ :=\n (2 * w * (2 * y - x) - 2 * x * y) / (x * (y + w))\n\n/-- The right-hand cyclic summand, as a function of one ordered triple. -/\nnoncomputable def rightSummand (x y _w : ℝ) : ℝ :=\n ((y - x) / (y + x)) ^ 2\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def leftSide (x y w : ℝ) : ℝ :=\n cyclicSum leftSummand x y w\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rightSide (x y w : ℝ) : ℝ :=\n cyclicSum rightSummand x y w\n\n/-- The proposition stated in the problem: for all positive reals `x`, `y`, and `w`,\nthe cyclic inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ x y w : ℝ, 0 < x → 0 < y → 0 < w → leftSide x y w ≥ rightSide x y w\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a60b59c5-cc6b-5bf1-a079-d17b7f4cf2cf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6d984a6a5f272fd94f52477878b084c220a2c0bf14ad7286bc8c54f61d877abd", "task_path": "tasks/nmp3_a60b59c5-cc6b-5bf1-a079-d17b7f4cf2cf", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a60b59c5-cc6b-5bf1-a079-d17b7f4cf2cf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a6446c2f-51e0-5dbb-b7f4-ab230f98508d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$, with at most one of them equal to $0$. Prove that \n-- \\[\n-- \\frac{1}{a+b}+\\frac{1}{b+c}+\\frac{1}{c+a}\\;\\ge\\;\n-- \\frac{a}{a^{2}+bc}+\\frac{b}{b^{2}+ca}+\\frac{c}{c^{2}+ab}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the nonnegative three-variable inequality\n\nThis file records the statement of the problem as an unproved proposition. The\nvariables are real numbers. The hypothesis that at most one of them is zero is\nrepresented by the pairwise condition that no two of them are simultaneously\nzero; together with nonnegativity this implies that all displayed\ndenominators are nonzero.\n-/\n\nnamespace Problem\n\n/-- At most one of `a`, `b`, and `c` is equal to zero. -/\ndef AtMostOneZero (a b c : ℝ) : Prop :=\n ¬ (a = 0 ∧ b = 0) ∧\n ¬ (a = 0 ∧ c = 0) ∧\n ¬ (b = 0 ∧ c = 0)\n\n/-- The admissibility hypotheses of the problem: the three real numbers are\nnonnegative and at most one of them is zero. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ AtMostOneZero a b c\n\n/-- The left-hand side of the claimed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / (a + b) + 1 / (b + c) + 1 / (c + a)\n\n/-- The right-hand side of the claimed inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n a / (a ^ 2 + b * c) + b / (b ^ 2 + c * a) + c / (c ^ 2 + a * b)\n\n/-- The asserted inequality for fixed real numbers. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full universally quantified statement to be proved. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6446c2f-51e0-5dbb-b7f4-ab230f98508d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "44567e989bda9e164d0f8a6a7d8b5d67477d7786a683dcdc7cb37d620725581c", "task_path": "tasks/nmp3_a6446c2f-51e0-5dbb-b7f4-ab230f98508d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6446c2f-51e0-5dbb-b7f4-ab230f98508d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a65bf89c-82f4-594e-aae8-a338ba4b07f4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\ge0$ with $a+b+c+d=1$. Prove that \n-- \\[\n-- \\sqrt{a+\\frac{(b-c)^2}{6}+\\frac{(c-d)^2}{6}+\\frac{(d-b)^2}{6}}+\\sqrt b+\\sqrt c+\\sqrt d\\le2.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, `c`, and `d`\nwhose sum is one, an upper bound for a sum of four square roots.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem.\n\n`Real.sqrt` is the principal nonnegative real square root. On the admissible domain of\n`Problem.Target`, the arguments `b`, `c`, and `d` are nonnegative; the first radicand is\nalso nonnegative because it is `a` plus three nonnegative squared terms divided by `6`. -/\nnoncomputable def lhs (a b c d : ℝ) : ℝ :=\n Real.sqrt\n (a + (b - c) ^ 2 / (6 : ℝ) + (c - d) ^ 2 / (6 : ℝ) +\n (d - b) ^ 2 / (6 : ℝ)) +\n Real.sqrt b + Real.sqrt c + Real.sqrt d\n\n/-- The proposition asserted by the source problem. It is a universal statement over\nall real quadruples `(a, b, c, d)` satisfying the stated nonnegativity and normalization\nassumptions. -/\ndef Target : Prop :=\n ∀ (a b c d : ℝ),\n 0 ≤ a → 0 ≤ b → 0 ≤ c → 0 ≤ d → a + b + c + d = (1 : ℝ) →\n lhs a b c d ≤ (2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a65bf89c-82f4-594e-aae8-a338ba4b07f4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "831e5a41385b9f7de63ffd17122d6e99161165e5839b71193738338ad120c63c", "task_path": "tasks/nmp3_a65bf89c-82f4-594e-aae8-a338ba4b07f4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a65bf89c-82f4-594e-aae8-a338ba4b07f4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a6b8ce75-35d5-5ba5-8592-f99f29711223", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute triangle. Construct a point $X$ on the opposite side of line $AB$ from $C$ and a point $Y$ on the opposite side of line $AC$ from $B$ such that $BX=AC$, $CY=AB$, and $AX=AY$. Let $A'$ be the reflection of $A$ across the perpendicular bisector of $BC$. Suppose that $X$ and $Y$ lie on different sides of the line $AA'$. Prove that the four points $A,\\;A',\\;X,\\;Y$ are concyclic.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\n\n/-!\n# Formalization of the geometry problem\n\nThe ambient plane is `EuclideanSpace ℝ (Fin 2)`. Directions, dot products,\noriented cross products, distances, and affine combinations all use the\nstandard real Euclidean structure.\n\nThe source problem concerns an acute triangle `ABC`, points `X` and `Y`\nconstructed in prescribed open half-planes and satisfying three distance\nequalities, the reflection `A'` of `A` across the perpendicular bisector of\n`BC`, and the hypothesis that `X` and `Y` are in opposite open half-planes\nbounded by `AA'`. The target says that `A`, `A'`, `X`, and `Y` are concyclic.\n-/\n\nnamespace Problem\n\n/-- Points of the Euclidean plane used throughout the formalization. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The oriented area (two-dimensional cross product) of two vectors. -/\ndef cross (u v : Point) : ℝ :=\n u 0 * v 1 - u 1 * v 0\n\n/-- Strictly opposite open half-planes determined by the affine line through\n`P` and `Q`. The oriented cross products of the direction vector `Q - P`\nwith `R - P` and with `S - P` must have opposite (necessarily nonzero)\nsigns. -/\ndef OppositeSideOfLine (P Q R S : Point) : Prop :=\n cross (Q - P) (R - P) * cross (Q - P) (S - P) < 0\n\n/-- `A`, `B`, and `C` form a nondegenerate acute triangle.\n\nNoncollinearity is recorded by a nonzero oriented area. At each vertex, the\ndot product of the two side vectors is positive; together with\nnoncollinearity this says that each interior angle is strictly less than a\nright angle. -/\ndef IsAcuteTriangle (A B C : Point) : Prop :=\n cross (B - A) (C - A) ≠ 0 ∧\n 0 < inner ℝ (B - A) (C - A) ∧\n 0 < inner ℝ (A - B) (C - B) ∧\n 0 < inner ℝ (A - C) (B - C)\n\n/-- The reflection of `A` across the perpendicular bisector of `BC`.\n\nIf `M` is the midpoint of `BC` and `n = C - B` is a normal vector to the\nperpendicular bisector, reflection in that bisector is\n`A - 2 * ((A - M) · n / (n · n)) • n`. When `B = C` the formula has a\nzero divisor, but the nondegenerate triangle hypothesis in `Target` excludes\nthat case. -/\nnoncomputable def reflectAcrossPerpendicularBisector (A B C : Point) : Point :=\n let M : Point := (1 / 2 : ℝ) • (B + C)\n let n : Point := C - B\n A - (2 * (inner ℝ (A - M) n / inner ℝ n n)) • n\n\n/-- Four points are concyclic when there is a genuine (positive-radius)\ncircle containing all four of them. -/\ndef Concyclic (A A' X Y : Point) : Prop :=\n ∃ O : Point, ∃ r : ℝ,\n 0 < r ∧\n dist O A = r ∧\n dist O A' = r ∧\n dist O X = r ∧\n dist O Y = r\n\n/-- The complete admissibility conditions on a configuration `(A,B,C,X,Y,A')`.\n\nThe order follows the source: the triangle is acute; `X` and `Y` lie in the\nprescribed open half-planes; the three segment-length equalities hold; `A'`\nis the stated reflection; and finally `X` and `Y` lie on opposite sides of\nthe line `AA'`. This predicate deliberately does not include concyclicity. -/\ndef AdmissibleConfiguration (A B C X Y A' : Point) : Prop :=\n IsAcuteTriangle A B C ∧\n OppositeSideOfLine A B C X ∧\n OppositeSideOfLine A C B Y ∧\n dist B X = dist A C ∧\n dist C Y = dist A B ∧\n dist A X = dist A Y ∧\n A' = reflectAcrossPerpendicularBisector A B C ∧\n OppositeSideOfLine A A' X Y\n\n/-- The assertion stated by the source problem.\n\nThe quantification is over an acute triangle `ABC`, admissible constructed\npoints `X` and `Y`, and the reflected point `A'`. The side conditions and\ndistance equalities are hypotheses, as is the condition that `X` and `Y` lie\non different sides of `AA'`. The conclusion is concyclicity of\n`A`, `A'`, `X`, and `Y`.\n\nAs is usual for a geometry problem phrased with \"construct\" followed by\n\"suppose\" and \"prove\", this is a conditional statement about every\nconfiguration satisfying the construction clauses. It does not assert that\nan admissible configuration exists or is unique. -/\ndef Target : Prop :=\n ∀ (A B C : Point) (X Y : Point) (A' : Point),\n AdmissibleConfiguration A B C X Y A' → Concyclic A A' X Y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6b8ce75-35d5-5ba5-8592-f99f29711223", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9e1fcc7657fcf004f9bd0798e484a99c49a83ba3ee51e1fd13dd5e1fc7d7ea52", "task_path": "tasks/nmp3_a6b8ce75-35d5-5ba5-8592-f99f29711223", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6b8ce75-35d5-5ba5-8592-f99f29711223", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a6bfc25f-cb41-567e-8d21-ddfa8e752fe2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m_a$, $m_b$, and $m_c$ be the medians of a triangle with side lengths $a$, $b$, and $c$. Prove that \n-- \\[\n-- m_a+m_b+m_c\\;\\ge\\;\\frac32\\sqrt{\\,2(ab+ac+bc)-a^2-b^2-c^2\\,}.\n-- \\]\nimport Mathlib\n\n/-!\n# The median inequality for a triangle\n\nThis file formalizes the statement (not a proof) of the following problem:\nfor the three medians of a triangle with side lengths `a`, `b`, and `c`,\n\n`m_a + m_b + m_c ≥ (3 / 2) * sqrt (2 * (a*b + a*c + b*c) - a^2 - b^2 - c^2)`.\n\nThe triangle is represented by three points in the Euclidean plane. Its side\nlengths and medians are defined as Euclidean distances, so that the median\nlengths in the statement are actual segment lengths rather than independent\nparameters.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real vector space with two\ncoordinates. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A nondegenerate triangle: three points which are not collinear. -/\ndef IsNondegenerateTriangle (A B C : Point) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Point)\n\n/-- The midpoint of the segment joining `X` and `Y`. -/\nnoncomputable def segmentMidpoint (X Y : Point) : Point :=\n ((1 / 2 : ℝ) • X + (1 / 2 : ℝ) • Y)\n\n/-- The length of side `BC`, conventionally denoted `a`. -/\nnoncomputable def sideA (_A B C : Point) : ℝ :=\n dist B C\n\n/-- The length of side `AC`, conventionally denoted `b`. -/\nnoncomputable def sideB (A _B C : Point) : ℝ :=\n dist A C\n\n/-- The length of side `AB`, conventionally denoted `c`. -/\nnoncomputable def sideC (A B _C : Point) : ℝ :=\n dist A B\n\n/-- The length of the median from `A` to the midpoint of `BC`, denoted `m_a`. -/\nnoncomputable def medianA (A B C : Point) : ℝ :=\n dist A (segmentMidpoint B C)\n\n/-- The length of the median from `B` to the midpoint of `AC`, denoted `m_b`. -/\nnoncomputable def medianB (A B C : Point) : ℝ :=\n dist B (segmentMidpoint A C)\n\n/-- The length of the median from `C` to the midpoint of `AB`, denoted `m_c`. -/\nnoncomputable def medianC (A B C : Point) : ℝ :=\n dist C (segmentMidpoint A B)\n\n/-- The sum `m_a + m_b + m_c` of the three median lengths. -/\nnoncomputable def medianSum (A B C : Point) : ℝ :=\n medianA A B C + medianB A B C + medianC A B C\n\n/-- The side lengths of the triangle `A B C` are `a`, `b`, and `c`,\nrespectively. -/\ndef HasSideLengths (A B C : Point) (a b c : ℝ) : Prop :=\n sideA A B C = a ∧ sideB A B C = b ∧ sideC A B C = c\n\n/-- The right-hand side of the claimed inequality, as a function of the three\nside lengths. -/\nnoncomputable def medianInequalityRhs (a b c : ℝ) : ℝ :=\n (3 / 2 : ℝ) *\n Real.sqrt (2 * (a * b + a * c + b * c) - a ^ 2 - b ^ 2 - c ^ 2)\n\n/-- The assertion of the problem: for every nondegenerate triangle in the\nEuclidean plane, with side lengths `a`, `b`, `c` and median lengths\n`m_a`, `m_b`, `m_c`, the median-length inequality holds. -/\ndef Target : Prop :=\n ∀ (A B C : Point) (a b c : ℝ),\n IsNondegenerateTriangle A B C →\n HasSideLengths A B C a b c →\n medianSum A B C ≥ medianInequalityRhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6bfc25f-cb41-567e-8d21-ddfa8e752fe2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dd886d9649edbb9759dd41163fb71f978e7571a7d2ce74b1bcfff7fc651074c6", "task_path": "tasks/nmp3_a6bfc25f-cb41-567e-8d21-ddfa8e752fe2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6bfc25f-cb41-567e-8d21-ddfa8e752fe2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a6c5c280-c329-5f5d-ac29-31cf026f0b9e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\ge0$ with $a+b+c+d=4$. Prove that \n-- \\[\n-- a^{2}bc+b^{2}cd+c^{2}da+d^{2}ab\\le 4.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The cyclic homogeneous left-hand side of the inequality. -/\ndef lhs (a b c d : ℝ) : ℝ :=\n a ^ 2 * b * c + b ^ 2 * c * d + c ^ 2 * d * a + d ^ 2 * a * b\n\n/-- The assertion in the problem: for all nonnegative real numbers whose sum is\nfour, the given cyclic expression is at most four. -/\ndef Target : Prop :=\n ∀ (a b c d : ℝ),\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n 0 ≤ d →\n a + b + c + d = (4 : ℝ) →\n lhs a b c d ≤ (4 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6c5c280-c329-5f5d-ac29-31cf026f0b9e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a036bd4cccff77f41b77229cef54321556fcb18dbf862d5057ecb274b89140d3", "task_path": "tasks/nmp3_a6c5c280-c329-5f5d-ac29-31cf026f0b9e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6c5c280-c329-5f5d-ac29-31cf026f0b9e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a6df7d74-d805-5ec1-9bc6-80c9de0a2973", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c\\ge 0$ satisfying $a^{3}+b^{3}+c^{3}+abc=12$, prove that \n-- \\[\n-- \\frac{19\\,(a^{2}+b^{2}+c^{2})+6\\,(ab+bc+ca)}{a+b+c}\\ge 36.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of a nonnegative-variable inequality\n\nThe source problem asks to prove an inequality for real numbers `a, b, c` which\nare nonnegative and satisfy `a^3 + b^3 + c^3 + abc = 12`.\n\nThe statement is recorded as a proposition-valued definition; no proof of the\ninequality is part of this formalization task.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions from the problem: `a`, `b`, and `c` are\nnonnegative real numbers satisfying `a^3 + b^3 + c^3 + abc = 12`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧\n a ^ 3 + b ^ 3 + c ^ 3 + a * b * c = 12\n\n/-- The asserted inequality for a triple of real numbers. The expression is\nthe exact left-hand side in the source, using real division. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (19 * (a ^ 2 + b ^ 2 + c ^ 2) +\n 6 * (a * b + b * c + c * a)) / (a + b + c) ≥ 36\n\n/-- The complete statement to be proved: for every triple of nonnegative real\nnumbers satisfying `a^3 + b^3 + c^3 + abc = 12`, the displayed quotient is at\nleast `36`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6df7d74-d805-5ec1-9bc6-80c9de0a2973", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d0e622029ab477a156801559c90fb9a280ad8c8461adbde156648e8b85c0f525", "task_path": "tasks/nmp3_a6df7d74-d805-5ec1-9bc6-80c9de0a2973", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6df7d74-d805-5ec1-9bc6-80c9de0a2973", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a6ea5c9a-616b-5e85-b941-b827536f4c22", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If a, b, c are real numbers, prove that \n-- \\[\n-- (-a+b+c)^2\\,(a-b+c)^2\\,(a+b-c)^2\\;\\ge\\;(-a^2+b^2+c^2)\\,(a^2-b^2+c^2)\\,(a^2+b^2-c^2)\\,. \n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Statement: product-of-squares inequality\n\nThis module formalizes the assertion from the problem: for all real numbers\n`a`, `b`, and `c`, the product of the three squared linear forms\n`-a + b + c`, `a - b + c`, and `a + b - c` is at least the product of the\nthree corresponding quadratic forms `-a^2 + b^2 + c^2`,\n`a^2 - b^2 + c^2`, and `a^2 + b^2 - c^2`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (-a + b + c) ^ 2 * (a - b + c) ^ 2 * (a + b - c) ^ 2\n\n/-- The right-hand side of the inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (-a ^ 2 + b ^ 2 + c ^ 2) *\n (a ^ 2 - b ^ 2 + c ^ 2) *\n (a ^ 2 + b ^ 2 - c ^ 2)\n\n/-- For all real `a`, `b`, and `c`, the product of the three squared linear\nforms is at least the product of the three quadratic forms. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6ea5c9a-616b-5e85-b941-b827536f4c22", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9ea6c5e4cccc5cd71dfec176eb1f0f1dca7d5d357040e5e06465c00510fa197b", "task_path": "tasks/nmp3_a6ea5c9a-616b-5e85-b941-b827536f4c22", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6ea5c9a-616b-5e85-b941-b827536f4c22", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a6ecd707-f63b-5628-b818-b40abd2af562", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a convex quadrilateral. Let $N$ be the midpoint of side $BC$, and assume that $\\measuredangle AND=135^{\\circ}$. Prove that \n-- $$AB+CD+\\frac{\\sqrt2}{2}\\,BC\\ge AD\\,.$$\n/-\nFormal statement of the convex-quadrilateral inequality from `problem.md`.\n\nThe source problem is a `prove` task. The declaration `Problem.Target` is the\nproposition to be proved; it is deliberately a `Prop`-valued definition and is not\ngiven a proof here.\n-/\n\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Analysis.Convex.Hull\n\nopen scoped EuclideanGeometry\nopen Set\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used for the quadrilateral and its side lengths. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The signed area determinant (twice the oriented area) of the triangle\n`A B C`, expressed in coordinates on `ℝ²`. -/\ndef det (A B C : Plane) : ℝ :=\n (B 0 - A 0) * (C 1 - A 1) - (B 1 - A 1) * (C 0 - A 0)\n\n/-- The four points are in strict convex position: each point is outside the\nconvex hull of the other three. -/\ndef StrictConvexPosition (A B C D : Plane) : Prop :=\n A ∉ convexHull ℝ ({B, C, D} : Set Plane) ∧\n B ∉ convexHull ℝ ({A, C, D} : Set Plane) ∧\n C ∉ convexHull ℝ ({A, B, D} : Set Plane) ∧\n D ∉ convexHull ℝ ({A, B, C} : Set Plane)\n\n/-- `A B C D` is a nondegenerate convex quadrilateral whose vertices occur in\nthe cyclic order `A, B, C, D` (either clockwise or counterclockwise).\n\nStrict convex position rules out collinear triples and a vertex lying inside the\ntriangle formed by the other three. The common strict sign of the four\nconsecutive signed triangle areas fixes the cyclic order. -/\ndef ConvexQuadrilateral (A B C D : Plane) : Prop :=\n StrictConvexPosition A B C D ∧\n ((0 < det A B C ∧ 0 < det B C D ∧ 0 < det C D A ∧ 0 < det D A B) ∨\n (det A B C < 0 ∧ det B C D < 0 ∧ det C D A < 0 ∧ det D A B < 0))\n\n/-- The proposition stated by the problem: for every convex quadrilateral\n`A B C D`, if `N` is the midpoint of side `B C` and the unoriented angle\n`∠ A N D` is `135°`, then\n`AB + CD + (√2 / 2) * BC ≥ AD`.\n\nAll segment lengths are Euclidean distances. The angle `135°` is represented\nby `3 * Real.pi / 4` radians, matching Mathlib's unoriented angle range\n`[0, π]`. -/\ndef Target : Prop :=\n ∀ (A B C D N : Plane),\n ConvexQuadrilateral A B C D →\n N = midpoint ℝ B C →\n EuclideanGeometry.angle A N D = 3 * Real.pi / 4 →\n dist A B + dist C D + (Real.sqrt 2 / 2) * dist B C ≥ dist A D\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6ecd707-f63b-5628-b818-b40abd2af562", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6537de2b5db24dbf316e3e70cd193d7e5f1070b0d949f74a2c476a79ba9c8e41", "task_path": "tasks/nmp3_a6ecd707-f63b-5628-b818-b40abd2af562", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6ecd707-f63b-5628-b818-b40abd2af562", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a6f1b3fd-b062-5500-8c93-9dce77ebd4a1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k$ be a fixed positive integer. Define two sequences $\\{A_n\\}$ and $\\{B_n\\}$ by \n-- \\[\n-- A_1=k,\\qquad A_2=k,\\qquad A_{n+2}=A_n\\,A_{n+1}\\quad(n\\ge1),\n-- \\] \n-- \\[\n-- B_1=1,\\qquad B_2=k,\\qquad B_{n+2}=\\frac{B_{n+1}^3+1}{B_n}\\quad(n\\ge1).\n-- \\] \n-- Prove that for every positive integer $n$, the product $A_{2n}\\,B_{n+3}$ is an integer.\nimport Mathlib\n\n/-!\n# Formalization of the sequence/integrality problem\n\nThe source problem fixes a positive integer `k` and defines two sequences\n`A_n` and `B_n`. The sequence `A` is integer-valued and the recurrence\ndefining `B` involves division, so `B` is represented as a rational-valued\nsequence.\n\nAll indices in the source problem are positive. The definitions below are\ntotal on `ℕ`; indices `0` are arbitrary conventional extensions and are never\nused in the target statement.\n-/\n\nnamespace Problem\n\n/-- The integer sequence `A`, indexed so that `A k 1 = k`.\nThe recursive step covers precisely indices `n + 3` with `n : ℕ`, i.e.\nindices at least `3`, which is the source recurrence for the positive index\n`n + 1`. -/\ndef A (k : ℤ) : ℕ → ℤ\n | 0 => 0\n | 1 => k\n | 2 => k\n | n + 3 => A k (n + 1) * A k (n + 2)\n\n/-- The rational sequence `B`, indexed so that `B k 1 = 1` and `B k 2 = k`.\nThe value at `3` is the first value produced by the recurrence, and the\nrecursive step covers all later indices. -/\ndef B (k : ℤ) : ℕ → ℚ\n | 0 => 0\n | 1 => 1\n | 2 => (k : ℚ)\n | 3 => (((k : ℚ) ^ 3 + 1) / 1)\n | n + 4 => ((B k (n + 3)) ^ 3 + 1) / B k (n + 2)\n\n/-- The first initial condition of `A`: `A_1 = k`. -/\ntheorem A_one (k : ℤ) : A k 1 = k := rfl\n\n/-- The second initial condition of `A`: `A_2 = k`. -/\ntheorem A_two (k : ℤ) : A k 2 = k := rfl\n\n/-- The recurrence for `A`, for every positive index `n`. -/\ntheorem A_rec (k : ℤ) (n : ℕ) (hn : 1 ≤ n) :\n A k (n + 2) = A k n * A k (n + 1) := by\n rcases n with _ | n\n · omega\n · rfl\n\n/-- The first initial condition of `B`: `B_1 = 1`. -/\ntheorem B_one (k : ℤ) : B k 1 = 1 := rfl\n\n/-- The second initial condition of `B`: `B_2 = k`. -/\ntheorem B_two (k : ℤ) : B k 2 = (k : ℚ) := rfl\n\n/-- The recurrence for `B`, for every positive index `n`. -/\ntheorem B_rec (k : ℤ) (n : ℕ) (hn : 1 ≤ n) :\n B k (n + 2) = ((B k (n + 1)) ^ 3 + 1) / B k n := by\n rcases n with _ | n\n · omega\n · rcases n with _ | n\n · norm_num [B]\n · rfl\n\n/-- The product `A_{2n} * B_{n+3}`, computed in `ℚ`. -/\ndef Product (k : ℤ) (n : ℕ) : ℚ :=\n (A k (2 * n) : ℚ) * B k (n + 3)\n\n/-- A rational number is an integer when it is the image of some integer. -/\ndef IsInteger (q : ℚ) : Prop :=\n ∃ z : ℤ, (z : ℚ) = q\n\n/-- For a fixed integer `k`, the claim that for every positive integer `n`\nthe rational product `A_{2n} * B_{n+3}` is an integer. -/\ndef TargetFor (k : ℤ) : Prop :=\n ∀ n : ℕ, 0 < n → IsInteger (Product k n)\n\n/-- The assertion of the problem: for every positive integer `k`, the claim\n`TargetFor k` holds. -/\ndef Target : Prop :=\n ∀ k : ℤ, 0 < k → TargetFor k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6f1b3fd-b062-5500-8c93-9dce77ebd4a1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6358f7b070507bff678728c8c58cafc5393e9d86cc95f78cb82db662672c6b42", "task_path": "tasks/nmp3_a6f1b3fd-b062-5500-8c93-9dce77ebd4a1", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a6f1b3fd-b062-5500-8c93-9dce77ebd4a1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a72edf3e-42c3-5979-9aaf-0989b24c4e82", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(a_i)_{i\\ge1}$ be a sequence of real numbers satisfying \n-- \\[\n-- a_{i+j}\\le a_i+a_j\\qquad\\text{for all integers }i,j\\ge1.\n-- \\] \n-- Prove that for every positive integer $n$,\n-- \\[\n-- a_1+\\frac{a_2}{2}+\\frac{a_3}{3}+\\cdots+\\frac{a_n}{n}\\ge a_n.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- A real-valued sequence indexed by the positive integers is subadditive on\npositive indices when `a (i + j) ≤ a i + a j` for every `i, j ≥ 1`. -/\ndef SubadditiveOnPositives (a : ℕ → ℝ) : Prop :=\n ∀ i j : ℕ, 1 ≤ i → 1 ≤ j → a (i + j) ≤ a i + a j\n\n/-- The finite sum `a 1 / 1 + a 2 / 2 + ... + a n / n`, written as a finite\nsum over `k ∈ {1, ..., n}`. -/\nnoncomputable def weightedPrefixSum (a : ℕ → ℝ) (n : ℕ) : ℝ :=\n ∑ k ∈ Finset.Icc 1 n, a k / (k : ℝ)\n\n/-- The inequality asserted for a fixed positive integer `n`. -/\ndef weightedPrefixSumGe (a : ℕ → ℝ) (n : ℕ) : Prop :=\n a n ≤ weightedPrefixSum a n\n\n/-- The complete assertion of the problem: every real sequence subadditive on\nthe positive integers satisfies the weighted-prefix-sum inequality for every\npositive integer `n`. -/\ndef Target : Prop :=\n ∀ (a : ℕ → ℝ), SubadditiveOnPositives a →\n ∀ n : ℕ, 1 ≤ n → weightedPrefixSumGe a n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a72edf3e-42c3-5979-9aaf-0989b24c4e82", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7175cbd334cfa64beb0816343c559dd298174b82ee2fd98d7250cb32036a621f", "task_path": "tasks/nmp3_a72edf3e-42c3-5979-9aaf-0989b24c4e82", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a72edf3e-42c3-5979-9aaf-0989b24c4e82", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a7575349-2b0e-5ad8-9f13-a7bf6e2242b1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(H=\\{\\lfloor i\\sqrt2\\rfloor:i\\in\\mathbb Z_{>0}\\}=\\{1,2,4,5,7,\\dots\\}\\). Prove that there exists an absolute constant \\(C>0\\) such that for every positive integer \\(n\\), any subset \\(A\\subseteq\\{1,2,\\dots,n\\}\\) with \\(|A|\\ge C\\sqrt n\\) contains two distinct elements \\(a,b\\) satisfying \\(a-b\\in H\\).\nimport Mathlib\n\nnamespace Problem\n\n/-- The set `H = {⌊i * sqrt 2⌋ : i > 0}` from the problem, regarded as a set of\nintegers so that integer differences of natural numbers can be tested for membership. -/\ndef H : Set ℤ :=\n {h | ∃ i : ℕ, 0 < i ∧ h = ⌊(i : ℝ) * Real.sqrt 2⌋}\n\n/--\nThe assertion of the problem: there is an absolute constant `C > 0` such that every\npositive integer `n` and every subset `A` of `{1, ..., n}` with cardinality at least\n`C * sqrt n` contain two distinct elements whose (integer) difference lies in `H`.\n-/\ndef Target : Prop :=\n ∃ C : ℝ, 0 < C ∧\n ∀ n : ℕ, 0 < n →\n ∀ A : Finset ℕ,\n (∀ a : ℕ, a ∈ A → a ∈ Set.Icc (1 : ℕ) n) →\n C * Real.sqrt (n : ℝ) ≤ (A.card : ℝ) →\n ∃ a : ℕ, a ∈ A ∧\n ∃ b : ℕ, b ∈ A ∧\n a ≠ b ∧ ((a : ℤ) - (b : ℤ)) ∈ H\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7575349-2b0e-5ad8-9f13-a7bf6e2242b1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "66f26f24c38ed379cd5225690f6af0474f06f1b7c8ab56b18821be2d5ba5a6f1", "task_path": "tasks/nmp3_a7575349-2b0e-5ad8-9f13-a7bf6e2242b1", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7575349-2b0e-5ad8-9f13-a7bf6e2242b1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a772f1d2-fc0c-5696-bb5c-4c9b2cfc6446", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy \n-- $$a^{2}+b^{2}+c^{2}+abc=4.$$ \n-- Prove the double inequality \n-- $$0\\le ab+bc+ca-abc\\le2.$$\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement: a positive-real double inequality\n\nThe source problem states that if `a`, `b`, and `c` are positive and satisfy\n`a^2 + b^2 + c^2 + a*b*c = 4`, then\n`0 ≤ a*b + b*c + c*a - a*b*c ≤ 2`.\n\nThis file declares the statement as a proposition. It does not prove it.\n-/\n\nnamespace Problem\n\n/-- The three strict positivity assumptions on `a`, `b`, and `c`. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The equation `a^2 + b^2 + c^2 + a*b*c = 4`. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 + a * b * c = 4\n\n/-- The expression `ab + bc + ca - abc` occurring in the requested bounds. -/\ndef BoundExpression (a b c : ℝ) : ℝ :=\n a * b + b * c + c * a - a * b * c\n\n/-- The lower bound `0 ≤ ab + bc + ca - abc`. -/\ndef LowerBound (a b c : ℝ) : Prop :=\n 0 ≤ BoundExpression a b c\n\n/-- The upper bound `ab + bc + ca - abc ≤ 2`. -/\ndef UpperBound (a b c : ℝ) : Prop :=\n BoundExpression a b c ≤ 2\n\n/-- The asserted double inequality, as a predicate on `a`, `b`, and `c`. -/\ndef DoubleInequality (a b c : ℝ) : Prop :=\n LowerBound a b c ∧ UpperBound a b c\n\n/-- The complete source statement: for all real `a`, `b`, and `c`, the positivity\nassumptions and the constraint imply the double inequality. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → Constraint a b c → DoubleInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a772f1d2-fc0c-5696-bb5c-4c9b2cfc6446", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "89ea568d9679175918dbe3d736a760bb49a13b0bcb10c4a3db0f33e8f1073b75", "task_path": "tasks/nmp3_a772f1d2-fc0c-5696-bb5c-4c9b2cfc6446", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a772f1d2-fc0c-5696-bb5c-4c9b2cfc6446", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a7852f53-efe3-5580-9e44-9427e1597df4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any integer $n$, there exists a unique polynomial $Q(x)$ with coefficients in $\\{0,1,2,\\dots,9\\}$ such that $Q(-2)=Q(-5)=n$.\nimport Mathlib.Algebra.Polynomial.Eval.Defs\n\n/-!\n# Formal statement of a digit-polynomial interpolation problem\n\nThe source problem asks to prove that every integer is the common value at\n`-2` and `-5` of a unique polynomial whose coefficients are decimal digits.\n\nThe polynomial is represented as an element of `ℤ[X]`. A decimal digit is\nrepresented by an integer `d` satisfying `0 ≤ d` and `d ≤ 9`.\n-/\n\nnamespace Problem\n\n/-- The set of decimal digits, regarded as a set of integer coefficients. -/\ndef DigitSet : Set ℤ := {d : ℤ | 0 ≤ d ∧ d ≤ 9}\n\n/-- `IsDigitPolynomial Q` says that every coefficient of `Q` lies in\n`{0, 1, 2, ..., 9}`. Coefficients outside the support are zero, so this\ncondition also constrains the degree implicitly. -/\ndef IsDigitPolynomial (Q : Polynomial ℤ) : Prop :=\n ∀ k : ℕ, Polynomial.coeff Q k ∈ DigitSet\n\n/-- For every integer `n`, there is a unique integer polynomial `Q` whose\ncoefficients are decimal digits and which satisfies `Q(-2) = Q(-5) = n`. -/\ndef Target : Prop :=\n ∀ n : ℤ,\n ∃! Q : Polynomial ℤ,\n IsDigitPolynomial Q ∧ Polynomial.eval (-2 : ℤ) Q = n ∧ Polynomial.eval (-5 : ℤ) Q = n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7852f53-efe3-5580-9e44-9427e1597df4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fd3644cc9bbff0313af96beea7f7e347b87872d365ff345697bb1162d877296c", "task_path": "tasks/nmp3_a7852f53-efe3-5580-9e44-9427e1597df4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7852f53-efe3-5580-9e44-9427e1597df4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a7a78c16-8adf-5b04-bb7d-253e2898d593", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle, and let $m_a,m_b,m_c$ be the corresponding medians (i.e., $m_a$ is the median to side $a$, $m_b$ to side $b$, $m_c$ to side $c$). Prove that \n-- \\[\n-- b c\\,m_a + c a\\,m_b + a b\\,m_c \\;\\ge\\; 4\\,m_a m_b m_c.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\n/-!\n# Triangle median inequality\n\nThis file formalizes the statement of the following problem:\n\nLet `a`, `b`, and `c` be the side lengths of a triangle, and let `m_a`, `m_b`,\nand `m_c` be the corresponding medians. Prove that\n`b * c * m_a + c * a * m_b + a * b * m_c ≥ 4 * m_a * m_b * m_c`.\n\nThe median lengths are represented by the standard median formula. For example,\nif `a` is the side opposite the vertex from which `m_a` is drawn, then\n`m_a = sqrt (2*b^2 + 2*c^2 - a^2) / 2`.\n-/\n\nnamespace Problem\n\n/-- `a`, `b`, and `c` are the side lengths of a nondegenerate Euclidean triangle.\n\nThe positivity conditions record that these are genuine side lengths, and the three\nstrict inequalities are the strict triangle inequalities. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a < b + c ∧ b < c + a ∧ c < a + b\n\n/-- The length of the median to the side whose length is `a`, where `b` and `c`\nare the lengths of the other two sides.\n\nThis is the median-length formula\n`m_a = sqrt (2*b^2 + 2*c^2 - a^2) / 2`. -/\nnoncomputable def medianToSide (a b c : ℝ) : ℝ :=\n Real.sqrt (2 * b ^ 2 + 2 * c ^ 2 - a ^ 2) / 2\n\n/-- The tuple `(a, b, c, m_a, m_b, m_c)` consists of the side lengths of a\nnondegenerate triangle together with the corresponding median lengths.\n\nIn particular, `m_a` is the median to side `a`, whose adjacent side lengths are\n`b` and `c`; the other two median equations are the cyclic analogues. -/\nnoncomputable def IsTriangleWithCorrespondingMedians\n (a b c ma mb mc : ℝ) : Prop :=\n IsTriangleSideLengths a b c ∧\n ma = medianToSide a b c ∧\n mb = medianToSide b c a ∧\n mc = medianToSide c a b\n\n/-- The assertion to be proved: for every nondegenerate triangle with side lengths\n`a`, `b`, and `c` and corresponding median lengths `m_a`, `m_b`, and `m_c`,\n`b*c*m_a + c*a*m_b + a*b*m_c ≥ 4*m_a*m_b*m_c`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c ma mb mc : ℝ,\n IsTriangleWithCorrespondingMedians a b c ma mb mc →\n b * c * ma + c * a * mb + a * b * mc ≥ 4 * ma * mb * mc\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7a78c16-8adf-5b04-bb7d-253e2898d593", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "278396f6108f21ddb9a950778bc2d1ad6f138131146f9e5407dc4550a4426cb9", "task_path": "tasks/nmp3_a7a78c16-8adf-5b04-bb7d-253e2898d593", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7a78c16-8adf-5b04-bb7d-253e2898d593", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a7b31a2a-9554-520d-aec0-423b255972a0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that \n-- \\[\n-- \\frac{a^{2}}{b^{3}a+b^{4}}+\\frac{b^{2}}{c^{3}b+c^{4}}+\\frac{c^{2}}{a^{3}c+a^{4}}\\ge\\frac{9}{2\\,(a^{2}+b^{2}+c^{2})}\n-- \\]\n-- holds for all positive real numbers $a,b,c\\,. $\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (a ^ 2 : ℝ) / (b ^ 3 * a + b ^ 4) +\n (b ^ 2 : ℝ) / (c ^ 3 * b + c ^ 4) +\n (c ^ 2 : ℝ) / (a ^ 3 * c + a ^ 4)\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n (9 : ℝ) / (2 * (a ^ 2 + b ^ 2 + c ^ 2))\n\n/-- For all positive real numbers `a`, `b`, and `c`, the stated cyclic sum is at\nleast `9 / (2 * (a^2 + b^2 + c^2))`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → LHS a b c ≥ RHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7b31a2a-9554-520d-aec0-423b255972a0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "76eaa30ce3a09a210d7ae3746d892e8214ab44f95711fec000eed42d73b7447a", "task_path": "tasks/nmp3_a7b31a2a-9554-520d-aec0-423b255972a0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7b31a2a-9554-520d-aec0-423b255972a0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a7bd7c0e-1f0a-5cd9-a5aa-e75a6e50c930", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- a,b,c>0. Prove that \n-- \\[\n-- \\frac{1}{2a^{2}+bc}+\\frac{1}{2b^{2}+ca}+\\frac{1}{2c^{2}+ab}\\le \\frac{(a+b+c)^{2}}{(ab+bc+ca)^{2}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThis file formalizes the inequality stated in `problem.md`. It only states the\nproposition; it deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality:\n`1 / (2a^2 + bc) + 1 / (2b^2 + ca) + 1 / (2c^2 + ab)`. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / ((2 : ℝ) * a ^ 2 + b * c) +\n 1 / ((2 : ℝ) * b ^ 2 + c * a) +\n 1 / ((2 : ℝ) * c ^ 2 + a * b)\n\n/-- The right-hand side of the inequality:\n`(a + b + c)^2 / (ab + bc + ca)^2`. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a + b + c) ^ 2 / (a * b + b * c + c * a) ^ 2\n\n/-- For every triple of positive real numbers `a`, `b`, and `c`, the stated\nleft-hand side is at most the stated right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7bd7c0e-1f0a-5cd9-a5aa-e75a6e50c930", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dfcb6bf954404b77b018ef15e7a26be62a7fc9cc08727e67d26a82454a39b5fb", "task_path": "tasks/nmp3_a7bd7c0e-1f0a-5cd9-a5aa-e75a6e50c930", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7bd7c0e-1f0a-5cd9-a5aa-e75a6e50c930", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a7cf51c8-4950-591a-ad6e-fee4d887c7d2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\). Prove that \n-- \\[\n-- \\sum_{\\text{cyc}} \\frac{1}{b^{2}+c^{2}+2(ab+bc+ca)}\\;\\ge\\;\n-- \\sum_{\\text{cyc}} \\frac{1}{a^{2}+b^{2}+c^{2}+ab+ca+3bc}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: cyclic reciprocal inequality\n\nThis file records the statement of the problem. It introduces the cyclic-sum\nnotation used by the problem and defines the two sides of the requested\ninequality. No proof of the inequality is supplied here.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum of a three-variable expression `f`:\n`f a b c + f b c a + f c a b`. -/\ndef CyclicSum (f : ℝ → ℝ → ℝ → ℝ) (a b c : ℝ) : ℝ :=\n f a b c + f b c a + f c a b\n\n/-- The denominator in the first cyclic summand:\n`b^2 + c^2 + 2(ab + bc + ca)`. -/\ndef LeftDenominator (a b c : ℝ) : ℝ :=\n b ^ 2 + c ^ 2 + 2 * (a * b + b * c + c * a)\n\n/-- The denominator in the second cyclic summand:\n`a^2 + b^2 + c^2 + ab + ca + 3bc`. -/\ndef RightDenominator (a b c : ℝ) : ℝ :=\n a ^ 2 + b ^ 2 + c ^ 2 + a * b + c * a + 3 * (b * c)\n\n/-- The left-hand side of the inequality, with cyclic summation over\n`(a,b,c)`, `(b,c,a)`, and `(c,a,b)`. -/\nnoncomputable def LeftSide (a b c : ℝ) : ℝ :=\n CyclicSum (fun x y z => 1 / LeftDenominator x y z) a b c\n\n/-- The right-hand side of the inequality, with cyclic summation over\n`(a,b,c)`, `(b,c,a)`, and `(c,a,b)`. -/\nnoncomputable def RightSide (a b c : ℝ) : ℝ :=\n CyclicSum (fun x y z => 1 / RightDenominator x y z) a b c\n\n/-- The inequality asserted in the problem, for fixed positive reals. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LeftSide a b c ≥ RightSide a b c\n\n/-- The full assertion of the problem: for all positive real `a`, `b`, and `c`,\nthe cyclic reciprocal sum on the left is at least the cyclic reciprocal sum on\nthe right. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7cf51c8-4950-591a-ad6e-fee4d887c7d2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "08780e5197f6ce4c97ca9ab7ead1767330451eb89933296b216956e9dabe0189", "task_path": "tasks/nmp3_a7cf51c8-4950-591a-ad6e-fee4d887c7d2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7cf51c8-4950-591a-ad6e-fee4d887c7d2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a7d3be9f-2aae-50b0-afc4-d16561e22ec5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a+b+c=ab+bc+ca$. Prove that \n-- \\[\n-- (a^2+bc+1)(b^2+ac+1)(c^2+ab+1)\\ge 9\\,(a^2+b^2+c^2).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the inequality problem\n\nThe source problem quantifies over positive real numbers `a`, `b`, and `c`\nsatisfying `a + b + c = a * b + b * c + c * a`, and asks for a proof of the\nnon-strict inequality\n`(a^2 + b*c + 1) * (b^2 + a*c + 1) * (c^2 + a*b + 1)`\n`≥ 9 * (a^2 + b^2 + c^2)`.\n\nThe assertion is represented as a proposition-valued definition; no proof is\nsupplied.\n-/\n\nnamespace Problem\n\n/-- All three variables are strictly positive. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The sum-product equality imposed on the three variables. -/\ndef SumProductEq (a b c : ℝ) : Prop :=\n a + b + c = a * b + b * c + c * a\n\n/-- The hypotheses of the problem: `a`, `b`, and `c` are positive real\nnumbers and satisfy `a + b + c = a b + b c + c a`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Positive a b c ∧ SumProductEq a b c\n\n/-- The left-hand side of the target inequality. -/\ndef LeftSide (a b c : ℝ) : ℝ :=\n (a ^ 2 + b * c + 1) * (b ^ 2 + a * c + 1) * (c ^ 2 + a * b + 1)\n\n/-- The right-hand side of the target inequality. -/\ndef RightSide (a b c : ℝ) : ℝ :=\n 9 * (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The inequality claimed for every admissible triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LeftSide a b c ≥ RightSide a b c\n\n/-- The complete statement to be proved: for all real `a`, `b`, and `c`,\nthe positivity and sum-product hypotheses imply the stated inequality. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7d3be9f-2aae-50b0-afc4-d16561e22ec5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "35982c63ab38b8afed5916ca3b20bebddc543f590b72676a9cf24b5b24a8bfde", "task_path": "tasks/nmp3_a7d3be9f-2aae-50b0-afc4-d16561e22ec5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7d3be9f-2aae-50b0-afc4-d16561e22ec5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a7e3ea73-af7c-577c-85b3-7c04b0f5a4f6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are positive real numbers, prove that \n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\ge \n-- \\sqrt{\\frac{a^{2}+1}{\\,b^{2}+1\\,}}+\n-- \\sqrt{\\frac{b^{2}+1}{\\,c^{2}+1\\,}}+\n-- \\sqrt{\\frac{c^{2}+1}{\\,a^{2}+1\\,}}\\,.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formal statement\n\nThe problem asserts, for all positive real numbers `a`, `b`, and `c`, the\ninequality\n\n`a / b + b / c + c / a ≥\n sqrt ((a^2 + 1) / (b^2 + 1)) +\n sqrt ((b^2 + 1) / (c^2 + 1)) +\n sqrt ((c^2 + 1) / (a^2 + 1))`.\n\nThe declaration below records the proposition to be proved. It contains no\nproof.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and\n`c`, the stated cyclic square-root inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a / b + b / c + c / a ≥\n Real.sqrt ((a ^ 2 + 1) / (b ^ 2 + 1)) +\n Real.sqrt ((b ^ 2 + 1) / (c ^ 2 + 1)) +\n Real.sqrt ((c ^ 2 + 1) / (a ^ 2 + 1))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7e3ea73-af7c-577c-85b3-7c04b0f5a4f6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7e1c6d8c65f94252a1bf5f25e6416c28c2a10103505e9172876caab1891ec501", "task_path": "tasks/nmp3_a7e3ea73-af7c-577c-85b3-7c04b0f5a4f6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7e3ea73-af7c-577c-85b3-7c04b0f5a4f6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a7f96fa3-50d9-5ddc-93a5-569e17f23429", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a convex quadrilateral with area $S$. Denote the side lengths by $AB=k$, $BC=l$, $CD=m$, $DA=n$, and let the interior angles be $\\angle A=2a$, $\\angle B=2b$, $\\angle C=2c$, $\\angle D=2d$. \n-- Let $T$ be the semiperimeter, $T=\\dfrac{k+l+m+n}{2}$. Define \n-- \\[\n-- 2t=\\bigl|(k+m)-(l+n)\\bigr|\\qquad\\bigl(\\text{i.e. }t=\\dfrac{|(AB+CD)-(BC+DA)|}{2}\\bigr),\n-- \\]\n-- \\[\n-- \\alpha=\\sum_{\\text{cyc}}\\tan a=\\tan a+\\tan b+\\tan c+\\tan d,\n-- \\qquad \n-- \\beta=\\sum_{\\text{cyc}}\\cot a=\\cot a+\\cot b+\\cot c+\\cot d.\n-- \\] \n-- Prove that \n-- \\[\n-- S=\\frac{T^{2}}{\\beta}\\;-\\;\\frac{t^{2}}{\\alpha}.\n-- \\]\nmodule\n\npublic import Mathlib.Analysis.Complex.Trigonometric\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\n/-!\n# The quadrilateral area formula\n\nThis file formalizes the statement of the problem as a proposition-valued\ndefinition. No proof of the proposition is supplied. A point of the plane is\nrepresented by `EuclideanSpace ℝ (Fin 2)`, and the four vertices of the\nquadrilateral are a function `p : Fin 4 → Plane`, with `p 0`, `p 1`, `p 2`,\nand `p 3` playing the roles of `A`, `B`, `C`, and `D`, respectively.\n-/\n\n@[expose] public section\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used for the quadrilateral. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The oriented determinant (2D cross product) of two planar vectors. -/\ndef cross (u v : Plane) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- The signed turn at `A`, using the incoming edge `DA` and outgoing edge `AB`. -/\ndef turnAtA (p : Fin 4 → Plane) : ℝ :=\n cross (p 0 - p 3) (p 1 - p 0)\n\n/-- The signed turn at `B`, using the signed `A`-to-`B` and `B`-to-`C` vectors. -/\ndef turnAtB (p : Fin 4 → Plane) : ℝ :=\n cross (p 1 - p 0) (p 2 - p 1)\n\n/-- The signed turn at `C`, using the signed `B`-to-`C` and `C`-to-`D` vectors. -/\ndef turnAtC (p : Fin 4 → Plane) : ℝ :=\n cross (p 2 - p 1) (p 3 - p 2)\n\n/-- The signed turn at `D`, using the incoming edge `CD` and outgoing edge `DA`. -/\ndef turnAtD (p : Fin 4 → Plane) : ℝ :=\n cross (p 3 - p 2) (p 0 - p 3)\n\n/-- The quadrilateral `A B C D` is strictly convex and its vertices occur in\ncyclic order, in either the counterclockwise or the clockwise orientation. -/\ndef StrictlyConvexQuadrilateral (p : Fin 4 → Plane) : Prop :=\n (0 < turnAtA p ∧ 0 < turnAtB p ∧ 0 < turnAtC p ∧ 0 < turnAtD p) ∨\n (turnAtA p < 0 ∧ turnAtB p < 0 ∧ turnAtC p < 0 ∧ turnAtD p < 0)\n\n/-- Twice the signed area given by the shoelace formula. -/\ndef doubleSignedArea (p : Fin 4 → Plane) : ℝ :=\n cross (p 0) (p 1) + cross (p 1) (p 2) +\n cross (p 2) (p 3) + cross (p 3) (p 0)\n\n/-- The area of the quadrilateral, given by the absolute value of the\nshoelace formula divided by two. -/\ndef area (p : Fin 4 → Plane) : ℝ := |doubleSignedArea p| / 2\n\n/-- The length of side `AB`. -/\ndef sideAB (p : Fin 4 → Plane) : ℝ := dist (p 0) (p 1)\n\n/-- The length of side `BC`. -/\ndef sideBC (p : Fin 4 → Plane) : ℝ := dist (p 1) (p 2)\n\n/-- The length of side `CD`. -/\ndef sideCD (p : Fin 4 → Plane) : ℝ := dist (p 2) (p 3)\n\n/-- The length of side `DA`. This is `dist (p 3) (p 0)`, the same as `dist (p 0) (p 3)`. -/\ndef sideDA (p : Fin 4 → Plane) : ℝ := dist (p 3) (p 0)\n\n/-- The semiperimeter `T = (k + l + m + n) / 2`. -/\ndef semiperimeter (p : Fin 4 → Plane) : ℝ :=\n (sideAB p + sideBC p + sideCD p + sideDA p) / 2\n\n/-- The unsigned side-length imbalance `|(AB + CD) - (BC + DA)|`,\nwhich is exactly the left-hand side `2t`. -/\ndef twoT (p : Fin 4 → Plane) : ℝ :=\n |(sideAB p + sideCD p) - (sideBC p + sideDA p)|\n\n/-- The quantity `t`, characterized by `2t = |(AB + CD) - (BC + DA)|`. -/\ndef t (p : Fin 4 → Plane) : ℝ := twoT p / 2\n\n/-- The interior angle at `A`, namely the angle from ray `AD` to ray `AB`. -/\ndef interiorAngleA (p : Fin 4 → Plane) : ℝ :=\n EuclideanGeometry.angle (p 3) (p 0) (p 1)\n\n/-- The interior angle at `B`, namely the angle from ray `BA` to ray `BC`. -/\ndef interiorAngleB (p : Fin 4 → Plane) : ℝ :=\n EuclideanGeometry.angle (p 0) (p 1) (p 2)\n\n/-- The interior angle at `C`, namely the angle from ray `CB` to ray `CD`. -/\ndef interiorAngleC (p : Fin 4 → Plane) : ℝ :=\n EuclideanGeometry.angle (p 1) (p 2) (p 3)\n\n/-- The interior angle at `D`, namely the angle from ray `DC` to ray `DA`. -/\ndef interiorAngleD (p : Fin 4 → Plane) : ℝ :=\n EuclideanGeometry.angle (p 2) (p 3) (p 0)\n\n/-- The half-angle `a`, defined by `∠A = 2a`. -/\ndef a (p : Fin 4 → Plane) : ℝ := interiorAngleA p / 2\n\n/-- The half-angle `b`, defined by `∠B = 2b`. -/\ndef b (p : Fin 4 → Plane) : ℝ := interiorAngleB p / 2\n\n/-- The half-angle `c`, defined by `∠C = 2c`. -/\ndef c (p : Fin 4 → Plane) : ℝ := interiorAngleC p / 2\n\n/-- The half-angle `d`, defined by `∠D = 2d`. -/\ndef d (p : Fin 4 → Plane) : ℝ := interiorAngleD p / 2\n\n/-- The sum `alpha = tan a + tan b + tan c + tan d`. -/\ndef alpha (p : Fin 4 → Plane) : ℝ :=\n Real.tan (a p) + Real.tan (b p) + Real.tan (c p) + Real.tan (d p)\n\n/-- The sum `beta = cot a + cot b + cot c + cot d`. -/\ndef beta (p : Fin 4 → Plane) : ℝ :=\n Real.cot (a p) + Real.cot (b p) + Real.cot (c p) + Real.cot (d p)\n\n/-- The claimed identity for a fixed cyclic quadrilateral. -/\ndef FormulaHolds (p : Fin 4 → Plane) : Prop :=\n area p = (semiperimeter p) ^ 2 / beta p - (t p) ^ 2 / alpha p\n\n/-- The proposition asserted by the problem: for every strictly convex\nquadrilateral `A B C D` (with vertices in cyclic order in either orientation),\nthe identity `S = T^2 / beta - t^2 / alpha` holds. -/\ndef Target : Prop :=\n ∀ p : Fin 4 → Plane, StrictlyConvexQuadrilateral p → FormulaHolds p\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7f96fa3-50d9-5ddc-93a5-569e17f23429", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c803a33ec28384dffbd2efd2e8a763ff8865b807b7f5db219e2e93ee34cf14d3", "task_path": "tasks/nmp3_a7f96fa3-50d9-5ddc-93a5-569e17f23429", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7f96fa3-50d9-5ddc-93a5-569e17f23429", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a7fe991d-ffad-599a-937a-7a5a6e1a22ef", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for each positive integer $n$, there exists a positive integer (in base 10) with exactly $n$ decimal digits, none of which is $0$, such that the integer is divisible by the sum of its digits.\nimport Mathlib.Data.Nat.Digits.Lemmas\n\n/-!\n# Formal statement\n\nThe source problem asks, for every positive integer `n`, for the existence of a\npositive base-10 integer with exactly `n` decimal digits, no digit equal to zero,\nand divisibility by the sum of its decimal digits.\n\nThe declarations below formalize the admissibility predicate and the complete\nexistential statement. `Nat.digits 10 m` is Mathlib's little-endian list of the\ncanonical base-10 digits of `m`; in particular, for positive `m` it has no leading\nzero, so its length is exactly the number of decimal digits.\n-/\n\nnamespace Problem\n\n/-- The decimal digits of `m`, in little-endian order, as supplied by Mathlib. -/\ndef decimalDigits (m : ℕ) : List ℕ :=\n Nat.digits 10 m\n\n/-- The sum of the decimal digits of `m`. -/\ndef decimalDigitSum (m : ℕ) : ℕ :=\n (decimalDigits m).sum\n\n/-- `m` has exactly `n` decimal digits. -/\ndef HasExactlyNDecimalDigits (n m : ℕ) : Prop :=\n (decimalDigits m).length = n\n\n/-- None of the decimal digits of `m` is zero. -/\ndef HasNoZeroDecimalDigit (m : ℕ) : Prop :=\n ∀ d : ℕ, d ∈ decimalDigits m → d ≠ 0\n\n/-- The admissibility predicate for a witness for a prescribed digit count `n`. -/\ndef IsAdmissibleWitness (n m : ℕ) : Prop :=\n 0 < m ∧ HasExactlyNDecimalDigits n m ∧ HasNoZeroDecimalDigit m ∧\n decimalDigitSum m ∣ m\n\n/-- The full assertion of the problem: for every positive `n`, there exists a\npositive base-10 integer with exactly `n` digits, all nonzero, whose digit sum\ndivides it. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ∃ m : ℕ, IsAdmissibleWitness n m\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7fe991d-ffad-599a-937a-7a5a6e1a22ef", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "848b72b897d21c69611e59ce2d8a3c3f75b3743ba847fdbf6293f4643cbad0ea", "task_path": "tasks/nmp3_a7fe991d-ffad-599a-937a-7a5a6e1a22ef", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a7fe991d-ffad-599a-937a-7a5a6e1a22ef", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a8066357-ca6e-5553-be8b-bd14a1a75fcb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $\\theta,\\phi\\in[0,2\\pi]$ and $\\alpha,\\beta\\ge 1$, prove that \n-- \\[\n-- \\sqrt{1-\\frac{\\cos\\theta}{\\alpha}}\\;\\le\\;\\sqrt{1-\\frac{\\cos(\\theta-\\phi)}{\\alpha\\beta}}+\\sqrt{1-\\frac{\\cos\\phi}{\\beta}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThis module formalizes the inequality stated in `problem.md`. It intentionally\ncontains only a declaration of the proposition, not a proof.\n-/\n\nnamespace Problem\n\n/-- For all real angles `θ` and `φ` in `[0, 2π]` and all real `α, β ≥ 1`,\nthe stated square-root inequality holds. Square roots are the usual principal\nreal square roots. -/\ndef Target : Prop :=\n ∀ (θ φ α β : ℝ),\n θ ∈ Set.Icc (0 : ℝ) (2 * Real.pi) →\n φ ∈ Set.Icc (0 : ℝ) (2 * Real.pi) →\n 1 ≤ α →\n 1 ≤ β →\n Real.sqrt (1 - Real.cos θ / α) ≤\n Real.sqrt (1 - Real.cos (θ - φ) / (α * β)) +\n Real.sqrt (1 - Real.cos φ / β)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8066357-ca6e-5553-be8b-bd14a1a75fcb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0723e562e5728cd7053b561c594a3dfcaa1d8d9e18784d0d7a795a165f0d2e80", "task_path": "tasks/nmp3_a8066357-ca6e-5553-be8b-bd14a1a75fcb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8066357-ca6e-5553-be8b-bd14a1a75fcb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a80d2cc9-6f83-5153-9c3f-9724b531470c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y$ be positive integers such that $2xy+y^{2}-1$ divides $x^{2}$. Prove that $2x$ divides $y^{2}-1$, i.e. $\\displaystyle\\frac{y^{2}-1}{2x}\\in\\mathbb Z\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the target problem\n\nThe original problem asks to prove an implication about positive integers.\nWe formalize divisibility in `ℤ`, which is equivalent to asserting that the\ndisplayed quotient is an integer. Positivity of `x` and `y` is retained as\nexplicit hypotheses.\n-/\n\nnamespace Problem\n\n/--\nFor all positive integers `x` and `y`, if `2 * x * y + y ^ 2 - 1` divides\n`x ^ 2`, then `2 * x` divides `y ^ 2 - 1`.\n\nThe conclusion `(2 * x) ∣ (y ^ 2 - 1)` is the standard integer divisibility\nform of the source statement that `(y ^ 2 - 1) / (2 * x)` is an integer.\n-/\ndef Target : Prop :=\n ∀ x y : ℤ,\n 0 < x →\n 0 < y →\n (2 * x * y + y ^ 2 - 1) ∣ x ^ 2 →\n (2 * x) ∣ (y ^ 2 - 1)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a80d2cc9-6f83-5153-9c3f-9724b531470c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b0a42bfeae5ad7f7f264aed8be3b3a65ef003d8d420120838366a3b640b4b8db", "task_path": "tasks/nmp3_a80d2cc9-6f83-5153-9c3f-9724b531470c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a80d2cc9-6f83-5153-9c3f-9724b531470c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a819f8e1-0862-55f6-ae6e-967660db9c5f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for any integer $n\\ge 3$, if we choose $n$ vertices of a regular polygon with $2n-1$ vertices, then among the chosen vertices there exist three that form an isosceles triangle.\nimport Mathlib\n\n/-!\n# Selected vertices of a regular polygon contain an isosceles triangle\n\nThis file formalizes the statement of the problem:\n\nFor every integer `n ≥ 3`, any choice of `n` vertices of a regular polygon\nwith `2 * n - 1` vertices contains three chosen vertices which form an\nisosceles triangle.\n\nA regular polygon is represented by its finite set of vertices `V : Finset ℂ`\nin the complex plane. The predicate `IsRegularPolygon` says that `V` has the\nrequired number of distinct vertices and that its points are equally spaced on\na circle with some center, positive radius, and rotational phase. The chosen\nvertices are represented by a finite subset `S ⊆ V` of cardinality `n`.\nDistances are the usual Euclidean distances on `ℂ`.\n-/\n\nnamespace Problem\n\n/-- The point at vertex `k` of the regular `m`-gon with the specified center,\nradius, and rotational phase. The `m` vertices occur at angles\n`phase + 2 * π * k / m`, for `k : Fin m`. -/\nnoncomputable def RegularPolygonVertex (m : ℕ) (center : ℂ) (radius phase : ℝ)\n (k : Fin m) : ℂ :=\n center +\n ((radius *\n Real.cos (phase + 2 * Real.pi * (k.val : ℝ) / (m : ℝ)) : ℝ) : ℂ) +\n (((radius *\n Real.sin (phase + 2 * Real.pi * (k.val : ℝ) / (m : ℝ)) : ℝ) : ℂ) *\n Complex.I)\n\n/-- A finite set `V : Finset ℂ` is the vertex set of a regular `m`-gon when\n`m ≥ 3`, it has exactly `m` vertices, and it is exactly the set of points\n`RegularPolygonVertex m center radius phase k` for some center, positive\nradius, and phase. -/\nnoncomputable def IsRegularPolygon (m : ℕ) (V : Finset ℂ) : Prop :=\n 3 ≤ m ∧ V.card = m ∧\n ∃ (center : ℂ) (radius phase : ℝ),\n 0 < radius ∧\n ∀ z : ℂ,\n z ∈ V ↔\n ∃ k : Fin m, z = RegularPolygonVertex m center radius phase k\n\n/-- Three points of the plane form an isosceles triangle when they are\npairwise distinct and at least two of the three Euclidean side lengths are\nequal. The \"at least two equal sides\" interpretation includes equilateral\ntriangles. -/\ndef IsIsoscelesTriangle (a b c : ℂ) : Prop :=\n a ≠ b ∧ a ≠ c ∧ b ≠ c ∧\n (dist a b = dist a c ∨\n dist a b = dist b c ∨\n dist a c = dist b c)\n\n/-- The target assertion: for every natural number `n` with `3 ≤ n`, for\nevery regular polygon with `2 * n - 1` vertices and every choice of `n` of its\nvertices, there are three distinct chosen vertices forming an isosceles\ntriangle. -/\ndef Target : Prop :=\n ∀ n : ℕ, 3 ≤ n →\n ∀ V : Finset ℂ,\n IsRegularPolygon (2 * n - 1) V →\n ∀ S : Finset ℂ,\n S ⊆ V →\n S.card = n →\n ∃ a b c : ℂ,\n a ∈ S ∧ b ∈ S ∧ c ∈ S ∧ IsIsoscelesTriangle a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a819f8e1-0862-55f6-ae6e-967660db9c5f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "937685255e57a992e38159b8d8c03ba98fe83c565e496b1fbf31d615c5524f4e", "task_path": "tasks/nmp3_a819f8e1-0862-55f6-ae6e-967660db9c5f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a819f8e1-0862-55f6-ae6e-967660db9c5f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a8534da0-a886-575f-bdfb-e2ce098759fb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{a\\bigl(c+a-2b\\bigr)}{ab+1}\\ge0.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The cyclic sum on the left-hand side of the inequality. Starting from the\nterm `a * (c + a - 2 * b) / (a * b + 1)`, the two further terms are obtained by\nthe cyclic permutation `a ↦ b ↦ c ↦ a`. -/\ndef cyclicLHS (a b c : ℝ) : ℝ :=\n a * (c + a - 2 * b) / (a * b + 1) +\n b * (a + b - 2 * c) / (b * c + 1) +\n c * (b + c - 2 * a) / (c * a + 1)\n\n/-- The positivity part of the hypotheses: `a`, `b`, and `c` are all positive. -/\ndef positiveHyp (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The sum part of the hypotheses: `a + b + c = 3`. -/\ndef sumHyp (a b c : ℝ) : Prop :=\n a + b + c = 3\n\n/-- The complete admissibility condition for a triple `(a, b, c)`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n positiveHyp a b c ∧ sumHyp a b c\n\n/-- The target inequality for a triple `(a, b, c)`. -/\ndef cyclicInequality (a b c : ℝ) : Prop :=\n cyclicLHS a b c ≥ 0\n\n/-- The complete proposition asserted by the problem: for every real triple\nsatisfying the admissibility hypotheses, the cyclic sum is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → cyclicInequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8534da0-a886-575f-bdfb-e2ce098759fb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7351251f31afc72732863950d81ac1535ea18de844a2acddd47882179789cd0c", "task_path": "tasks/nmp3_a8534da0-a886-575f-bdfb-e2ce098759fb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8534da0-a886-575f-bdfb-e2ce098759fb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a86ed2b0-2bd8-5e5c-99e9-39bf311f4796", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{a^{2}}{1+2ab}+\\frac{b^{2}}{1+2bc}+\\frac{c^{2}}{1+2ca}\\ge \n-- \\frac{a}{ab+b+1}+\\frac{b}{bc+c+1}+\\frac{c}{ca+a+1}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nFor all positive real numbers `a`, `b`, and `c` whose product is `1`, the\nstated sum of three rational expressions is at least the stated second sum.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n (a ^ 2 / (1 + 2 * a * b) +\n b ^ 2 / (1 + 2 * b * c) +\n c ^ 2 / (1 + 2 * c * a)) ≥\n a / (a * b + b + 1) +\n b / (b * c + c + 1) +\n c / (c * a + a + 1)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a86ed2b0-2bd8-5e5c-99e9-39bf311f4796", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0a1a55cf6c7d62453f92c2975663cf18eada3bfd18cc610252efad90b3cbf385", "task_path": "tasks/nmp3_a86ed2b0-2bd8-5e5c-99e9-39bf311f4796", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a86ed2b0-2bd8-5e5c-99e9-39bf311f4796", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a8716c10-26f0-5f7a-b0bb-808d0bdae262", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c\\in\\mathbb{R}$, prove that \n-- \\[\n-- \\bigl(ab(a+b)+bc(b+c)+ca(c+a)\\bigr)^2\\ge 4\\,(ab+bc+ca)\\,\\bigl((ab)^2+(bc)^2+(ca)^2\\bigr)\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the real-variable inequality\n\nFor real numbers `a`, `b`, and `c`, the problem asks to prove\n\n`(ab(a+b) + bc(b+c) + ca(c+a))^2 ≥\n 4 (ab + bc + ca) ((ab)^2 + (bc)^2 + (ca)^2)`.\n\nNo assumptions on `a`, `b`, or `c` other than that they are real are needed.\nThe assertion itself is represented as a proposition-valued definition; no\nproof of it is part of this statement-formalization task.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality, with `ab` meaning `a * b`, etc. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a * b * (a + b) + b * c * (b + c) + c * a * (c + a)\n\n/-- The right-hand side of the inequality, with `ab` meaning `a * b`, etc. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 4 * (a * b + b * c + c * a) *\n ((a * b) ^ 2 + (b * c) ^ 2 + (c * a) ^ 2)\n\n/-- The quantified inequality assertion from the problem. -/\ndef inequality (a b c : ℝ) : Prop :=\n lhs a b c ^ 2 ≥ rhs a b c\n\n/--\nGiven arbitrary real numbers `a`, `b`, and `c`, the displayed inequality holds.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8716c10-26f0-5f7a-b0bb-808d0bdae262", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7dc6fa57e0001dd8bd6c3fb308aa87da0f0c2653a2f941549b0d172ddb86c0b5", "task_path": "tasks/nmp3_a8716c10-26f0-5f7a-b0bb-808d0bdae262", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8716c10-26f0-5f7a-b0bb-808d0bdae262", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a87e5ab9-aec7-583f-8fce-c72e62047f4b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ be real numbers such that not two of them are zero. Prove that \n-- \\[\n-- \\frac{a}{b+c}+\\frac{b}{c+a}+\\frac{c}{a+b}+\\frac{a^{2}b+b^{2}c+c^{2}a}{ab^{2}+bc^{2}+ca^{2}}\\ge\\frac52 .\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- No two of the three real numbers `a`, `b`, and `c` are simultaneously zero.\nEquivalently, at most one of them is zero. -/\ndef NoTwoZero (a b c : ℝ) : Prop :=\n ¬ (a = 0 ∧ b = 0) ∧ ¬ (b = 0 ∧ c = 0) ∧ ¬ (c = 0 ∧ a = 0)\n\n/-- The three real numbers are all nonnegative. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The admissibility assumptions of the problem: the variables are real,\nnonnegative, and at most one of them is zero. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ NoTwoZero a b c\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def Lhs (a b c : ℝ) : ℝ :=\n a / (b + c) + b / (c + a) + c / (a + b) +\n (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a) /\n (a * b ^ 2 + b * c ^ 2 + c * a ^ 2)\n\n/-- The assertion to be proved: for all nonnegative reals `a`, `b`, `c`\nwith no two of them zero, the displayed left-hand side is at least `5 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Lhs a b c ≥ (5 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a87e5ab9-aec7-583f-8fce-c72e62047f4b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "577bbf0d9616b613928745faade86434484115334cd46c4859695cad71f9ea00", "task_path": "tasks/nmp3_a87e5ab9-aec7-583f-8fce-c72e62047f4b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a87e5ab9-aec7-583f-8fce-c72e62047f4b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a8970319-0570-5a0e-8df1-a920e9be7de9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $ab+bc+ca=3$. Prove that\n-- \\[\n-- \\sqrt{\\frac{a}{a+3}}+\\sqrt{\\frac{b}{b+3}}+\\sqrt{\\frac{c}{c+3}}\\le\\frac32\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypothesis from the problem: the three real numbers are positive and\nsatisfy `ab + bc + ca = 3`. -/\ndef Constraint (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = (3 : ℝ)\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a / (a + (3 : ℝ))) +\n Real.sqrt (b / (b + (3 : ℝ))) +\n Real.sqrt (c / (c + (3 : ℝ)))\n\n/-- The inequality asserted for a fixed triple `(a, b, c)`. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ (3 : ℝ) / 2\n\n/-- The full statement: for all positive real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca = 3`, the sum of the three square roots is at most\n`3 / 2`. -/\nnoncomputable def Target : Prop :=\n ∀ (a b c : ℝ), Constraint a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8970319-0570-5a0e-8df1-a920e9be7de9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "df05b74218d6bbbdae7d8b099de90647a260718003ebc23816624edb3dba43be", "task_path": "tasks/nmp3_a8970319-0570-5a0e-8df1-a920e9be7de9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8970319-0570-5a0e-8df1-a920e9be7de9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a89cdf67-310c-5de1-8337-1be3c490df0f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ with $x+y+z=1$. Prove that \n-- \\[\n-- \\frac{xy}{\\sqrt{xy+yz}}+\\frac{yz}{\\sqrt{yz+zx}}+\\frac{zx}{\\sqrt{zx+xy}}\n-- \\le \\frac{3}{4}\\sqrt{3(x+y)(y+z)(z+x)}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic square-root inequality\n\nThe source problem asks to prove an inequality for positive real numbers\n`x`, `y`, `z` whose sum is `1`. The statement is packaged as a proposition\nreturned by `Problem.Target`; no proof is supplied here.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef lhs (x y z : ℝ) : ℝ :=\n x * y / Real.sqrt (x * y + y * z) +\n y * z / Real.sqrt (y * z + z * x) +\n z * x / Real.sqrt (z * x + x * y)\n\n/-- The right-hand side of the inequality in the source problem. -/\ndef rhs (x y z : ℝ) : ℝ :=\n (3 / 4 : ℝ) * Real.sqrt ((3 : ℝ) * (x + y) * (y + z) * (z + x))\n\n/--\nThe assertion of the problem: for all positive reals `x`, `y`, `z` with\n`x + y + z = 1`, the cyclic square-root sum is at most the stated\nright-hand side.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z → x + y + z = 1 →\n lhs x y z ≤ rhs x y z\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a89cdf67-310c-5de1-8337-1be3c490df0f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "410d54b72799849bca677ff620ce4c25e0a352a7483332fb81b27478598a0f73", "task_path": "tasks/nmp3_a89cdf67-310c-5de1-8337-1be3c490df0f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a89cdf67-310c-5de1-8337-1be3c490df0f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a8ee736c-a42c-5152-86d7-a65b9d6f70dc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ with $b+c$, $c+a$, $a+b>0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\sqrt[3]{\\frac{a}{\\,b+c\\,}}\\ge 2.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formalization of a cyclic cube-root inequality\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, and `c`\nwhose pairwise sums are positive,\n\n`∑_cyc (a / (b + c))^(1/3) ≥ 2`.\n\nThe expression `Real.rpow x ((1 : ℝ) / 3)` is Mathlib's real power. On the nonnegative\narguments appearing in this problem it is the ordinary nonnegative real cube\nroot. The denominator side conditions ensure that all three fractions are\ndefined and nonnegative (in fact, positive when the numerator is positive).\n-/\n\nnamespace Problem\n\n/-- The real cube root, represented using Mathlib's real power by the exponent\n`1 / 3`. In this problem it is only applied to nonnegative arguments. -/\nnoncomputable def cubeRoot (x : ℝ) : ℝ :=\n Real.rpow x ((1 : ℝ) / 3)\n\n/-- Admissibility conditions from the problem: `a`, `b`, and `c` are\nnonnegative, and every pairwise sum is strictly positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n (0 : ℝ) ≤ a ∧ (0 : ℝ) ≤ b ∧ (0 : ℝ) ≤ c ∧\n (0 : ℝ) < b + c ∧ (0 : ℝ) < c + a ∧ (0 : ℝ) < a + b\n\n/-- The cyclic sum\n`(a/(b+c))^(1/3) + (b/(c+a))^(1/3) + (c/(a+b))^(1/3)`. -/\nnoncomputable def cyclicCubeRootSum (a b c : ℝ) : ℝ :=\n cubeRoot (a / (b + c)) +\n cubeRoot (b / (c + a)) +\n cubeRoot (c / (a + b))\n\n/-- The assertion to be proved in the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → (2 : ℝ) ≤ cyclicCubeRootSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8ee736c-a42c-5152-86d7-a65b9d6f70dc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "278f6997b64237000642074cbf0b22ff1826c4379f99a49c7474a2be343ac01b", "task_path": "tasks/nmp3_a8ee736c-a42c-5152-86d7-a65b9d6f70dc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8ee736c-a42c-5152-86d7-a65b9d6f70dc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a8f3dab1-d667-5c7f-ad16-dc0b04ba4719", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(a_n)_{n\\ge 1}$ be a sequence of positive real numbers. Assume there exists a constant $M>0$ such that for every $n\\ge1$\n-- \\[\n-- a_1^{2}+a_2^{2}+\\dots +a_n^{2}0$, depending only on $M$, such that for every $n\\ge1$\n-- \\[\n-- a_1+a_2+\\dots +a_n (a i) ^ 2) < M * (a (n + 1)) ^ 2\n\n/-- For a prescribed constant `M'`, this is the linear-sum estimate\n`a_1 + ⋯ + a_n < M' a_{n+1}`, asserted for all positive indices `n`. -/\ndef LinearSumCondition (a : ℕ → ℝ) (M' : ℝ) : Prop :=\n ∀ n : ℕ, 1 ≤ n →\n ((Finset.Icc 1 n).sum fun i => a i) < M' * a (n + 1)\n\n/-- `IsUniformBoundFor M M'` says that the single constant `M' > 0` works for\nevery positive sequence satisfying the square-sum hypothesis with the same\nparameter `M`. Thus `M'` may depend on `M`, but not on the sequence. -/\ndef IsUniformBoundFor (M M' : ℝ) : Prop :=\n 0 < M' ∧\n ∀ a : ℕ → ℝ,\n PositiveSequence a →\n SquareSumCondition a M → LinearSumCondition a M'\n\n/-- The target theorem: for every prescribed `M > 0`, there exists `M' > 0`\ndepending only on `M` such that every positive sequence satisfying\n`a_1^2 + ⋯ + a_n^2 < M a_{n+1}^2` for all `n ≥ 1` also satisfies\n`a_1 + ⋯ + a_n < M' a_{n+1}` for all `n ≥ 1`. -/\ndef Target : Prop :=\n ∀ M : ℝ, 0 < M → ∃ M' : ℝ, IsUniformBoundFor M M'\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8f3dab1-d667-5c7f-ad16-dc0b04ba4719", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "284d1c6eb790899ebfadac8560833f173a40d6475490a7feee1515b25a894d8c", "task_path": "tasks/nmp3_a8f3dab1-d667-5c7f-ad16-dc0b04ba4719", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8f3dab1-d667-5c7f-ad16-dc0b04ba4719", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a8f9034d-7368-51d8-b507-c7cd4c7a9415", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A,B,C$ be the vertices of a triangle such that $A$, $B$, and $C$ all lie in the interior of a given circle $\\Omega$. Prove that there exists a choice of two of the vertices (for example, $A$ and $B$) for which there are infinitely many circles $\\omega$ satisfying the three conditions:\n-- 1. $\\omega$ is contained in $\\Omega$ (its whole interior lies inside $\\Omega$);\n-- 2. $\\omega$ passes through the two chosen vertices;\n-- 3. the remaining vertex of the triangle lies in the interior of $\\omega$.\nimport Mathlib\n\n/-!\n# Formal statement of the geometry problem\n\nThe problem is stated for three non-collinear points `A`, `B`, `C` in the\ninterior of a circle `Ω` in the Euclidean plane. We represent a circle by\nits centre and a positive radius. Its interior is the corresponding open\nmetric ball, and a point lies on the circle exactly when its distance from\nthe centre equals the radius.\n\nThe target is a proposition, not a proof. The conclusion says that at\nleast one of the three unordered choices of two vertices has infinitely\nmany circles through those two vertices, contained in `Ω`, and containing\nthe remaining vertex in its interior.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A circle in the plane, represented by its centre and positive radius. The\nrepresentation is unique for a nondegenerate circle. -/\nstructure Circle where\n center : Plane\n radius : ℝ\n radius_pos : 0 < radius\n\nnamespace Circle\n\n/-- The (open) interior of a circle, i.e. the open disk bounded by it. -/\ndef interior (ω : Circle) : Set Plane :=\n Metric.ball ω.center ω.radius\n\n/-- The circumference of a circle. -/\ndef circumference (ω : Circle) : Set Plane :=\n Metric.sphere ω.center ω.radius\n\n/-- A point is in the interior of a circle. -/\ndef InteriorContains (ω : Circle) (P : Plane) : Prop :=\n P ∈ ω.interior\n\n/-- A circle passes through a point when the point lies on its circumference. -/\ndef PassesThrough (ω : Circle) (P : Plane) : Prop :=\n P ∈ ω.circumference\n\n/-- The whole open disk bounded by `ω` is contained in the open disk bounded\nby `Ω`. This is the chosen formal reading of \"`ω` is contained in `Ω` (its\nwhole interior lies inside `Ω`)\". -/\ndef IsContainedIn (ω Ω : Circle) : Prop :=\n ω.interior ⊆ Ω.interior\n\nend Circle\n\n/-- Three planar points are the vertices of a (nondegenerate) triangle when\nthey are not collinear. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n ¬ _root_.Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- There are infinitely many circles that are contained in `Ω`, pass through\n`P` and `Q`, and have `R` in their interior. Thus `(P, Q)` is a chosen pair\nof triangle vertices and `R` is the remaining vertex. -/\ndef PairHasInfinitelyManyCircles\n (Ω : Circle) (P Q R : Plane) : Prop :=\n Set.Infinite\n { ω : Circle |\n ω.IsContainedIn Ω ∧\n ω.PassesThrough P ∧\n ω.PassesThrough Q ∧\n ω.InteriorContains R }\n\n/-- The three possible unordered choices of two vertices of a triangle with\nvertices `A`, `B`, and `C`. The constructors name the chosen pair; the third\nvertex is then the remaining one. -/\ninductive PairChoice : Type where\n | ab\n | ac\n | bc\n\nnamespace PairChoice\n\n/-- The first vertex of the chosen unordered pair (in the fixed conventional\norder used by the corresponding constructor). -/\ndef first (c : PairChoice) (A B _C : Plane) : Plane :=\n match c with\n | ab => A\n | ac => A\n | bc => B\n\n/-- The second vertex of the chosen unordered pair. -/\ndef second (c : PairChoice) (_A B C : Plane) : Plane :=\n match c with\n | ab => B\n | ac => C\n | bc => C\n\n/-- The vertex of the triangle not belonging to the chosen pair. -/\ndef remaining (c : PairChoice) (A B C : Plane) : Plane :=\n match c with\n | ab => C\n | ac => B\n | bc => A\n\nend PairChoice\n\n/-- There exists one of the three possible unordered choices of two vertices\nfor which infinitely many admissible circles exist. The admissibility of a\ncircle is `PairHasInfinitelyManyCircles` for the chosen pair and the remaining\nvertex. -/\ndef SomePairHasInfinitelyManyCircles\n (Ω : Circle) (A B C : Plane) : Prop :=\n ∃ c : PairChoice,\n PairHasInfinitelyManyCircles Ω\n (c.first A B C) (c.second A B C) (c.remaining A B C)\n\n/-- The formal target: for every non-collinear triangle whose three vertices\nlie in the interior of a given circle `Ω`, there exists a choice of two vertices\nfor which infinitely many circles are contained in `Ω`, pass through the chosen\npair, and contain the remaining vertex in their interior. -/\ndef Target : Prop :=\n ∀ (A B C : Plane) (Ω : Circle),\n IsTriangle A B C →\n Ω.InteriorContains A →\n Ω.InteriorContains B →\n Ω.InteriorContains C →\n SomePairHasInfinitelyManyCircles Ω A B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8f9034d-7368-51d8-b507-c7cd4c7a9415", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8ac3aa2009dc1c4854c4d0d81a781562af0e701723817675cf49c32c17d95d11", "task_path": "tasks/nmp3_a8f9034d-7368-51d8-b507-c7cd4c7a9415", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a8f9034d-7368-51d8-b507-c7cd4c7a9415", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a9136d19-dec2-5a78-a2a6-6bf9a3ca1c81", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are positive real numbers, prove that \n-- \\[\n-- \\frac{a}{\\,b+5c\\,}+\\frac{b}{\\,c+a\\,}+\\frac{c}{\\,a+b\\,}>\\frac45.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe original problem asks to prove, for all positive real numbers `a`, `b`, `c`,\nthat\n\n`a / (b + 5 * c) + b / (c + a) + c / (a + b) > 4 / 5`.\n\nThe assertion is represented as a proposition-valued definition. No proof is\nprovided at the statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`,\n`a / (b + 5c) + b / (c + a) + c / (a + b) > 4 / 5`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a / (b + 5 * c) + b / (c + a) + c / (a + b) > (4 : ℝ) / 5\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a9136d19-dec2-5a78-a2a6-6bf9a3ca1c81", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4c7c6a78599c315959e764037824d5aa36837436856c5e2d85926683dcc33396", "task_path": "tasks/nmp3_a9136d19-dec2-5a78-a2a6-6bf9a3ca1c81", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a9136d19-dec2-5a78-a2a6-6bf9a3ca1c81", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a953b21b-e125-58e1-a020-b7296528d85a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A$ be a finite set of positive integers. Prove that there exists a finite set $B$ of positive integers such that $A\\subseteq B$ and \n-- \\[\n-- \\prod_{x\\in B} x \\;=\\; \\sum_{x\\in B} x^2\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- A finite set of natural numbers is a finite set of positive integers when\nall of its members are positive. Using `Finset ℕ` rules out duplicate elements,\nso the data really is a finite set. -/\ndef IsFinitePositiveSet (A : Finset ℕ) : Prop :=\n ∀ x ∈ A, 0 < x\n\n/-- The product-sum equation from the problem, for a finite set `B`. -/\ndef SatisfiesProductSumEquation (B : Finset ℕ) : Prop :=\n (∏ x ∈ B, x) = ∑ x ∈ B, x ^ 2\n\n/-- A finite set `B` is an admissible witness for `A` when `B` consists of\npositive integers, contains `A`, and satisfies the required product-sum\nequation. -/\ndef IsWitness (A B : Finset ℕ) : Prop :=\n IsFinitePositiveSet B ∧ A ⊆ B ∧ SatisfiesProductSumEquation B\n\n/-- The assertion of the problem: for every finite set `A` of positive\nintegers, there is a finite set `B` of positive integers containing `A` and\nsatisfying `∏ x ∈ B, x = ∑ x ∈ B, x ^ 2`. -/\ndef Target : Prop :=\n ∀ A : Finset ℕ, IsFinitePositiveSet A →\n ∃ B : Finset ℕ, IsWitness A B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a953b21b-e125-58e1-a020-b7296528d85a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6b42b6490044cd60ef85167e25dd5748efa75ec41f8161fef4820afe5cc6a98b", "task_path": "tasks/nmp3_a953b21b-e125-58e1-a020-b7296528d85a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a953b21b-e125-58e1-a020-b7296528d85a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a958872d-7937-5cf5-b8fb-a003acef7c78", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all real numbers $x,\\;y,\\;z,\\;t$ the inequality \n-- \\[\n-- \\sqrt{(x^2+xy+y^2)(z^2+zt+t^2)}+\\sqrt{(y^2-yz+z^2)(x^2-xt+t^2)}\\;\\ge\\;(x+z)(y+t)\n-- \\] \n-- holds.\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The radicand of the first square-root term:\n`(x ^ 2 + x * y + y ^ 2) * (z ^ 2 + z * t + t ^ 2)`. -/\ndef firstRadicand (x y z t : ℝ) : ℝ :=\n (x ^ 2 + x * y + y ^ 2) * (z ^ 2 + z * t + t ^ 2)\n\n/-- The radicand of the second square-root term:\n`(y ^ 2 - y * z + z ^ 2) * (x ^ 2 - x * t + t ^ 2)`. -/\ndef secondRadicand (x y z t : ℝ) : ℝ :=\n (y ^ 2 - y * z + z ^ 2) * (x ^ 2 - x * t + t ^ 2)\n\n\n/-- The quadratic form `x ^ 2 + x * y + y ^ 2` is nonnegative on the reals. -/\ntheorem quadraticFormAdd_nonneg (x y : ℝ) :\n 0 ≤ x ^ 2 + x * y + y ^ 2 := by\n nlinarith [sq_nonneg (x + y / 2), sq_nonneg y]\n\n/-- The quadratic form `x ^ 2 - x * y + y ^ 2` is nonnegative on the reals. -/\ntheorem quadraticFormSub_nonneg (x y : ℝ) :\n 0 ≤ x ^ 2 - x * y + y ^ 2 := by\n nlinarith [sq_nonneg (x - y / 2), sq_nonneg y]\n\n/-- The first radicand is nonnegative, so its real square root is defined in the\nusual sense. -/\ntheorem firstRadicand_nonneg (x y z t : ℝ) :\n 0 ≤ firstRadicand x y z t := by\n exact mul_nonneg (quadraticFormAdd_nonneg x y) (quadraticFormAdd_nonneg z t)\n\n/-- The second radicand is nonnegative, so its real square root is defined in the\nusual sense. -/\ntheorem secondRadicand_nonneg (x y z t : ℝ) :\n 0 ≤ secondRadicand x y z t := by\n exact mul_nonneg (quadraticFormSub_nonneg y z) (quadraticFormSub_nonneg x t)\n\n/-- The left-hand side of the asserted inequality. -/\ndef inequalityLHS (x y z t : ℝ) : ℝ :=\n Real.sqrt (firstRadicand x y z t) + Real.sqrt (secondRadicand x y z t)\n\n/-- The right-hand side of the asserted inequality. -/\ndef inequalityRHS (x y z t : ℝ) : ℝ :=\n (x + z) * (y + t)\n\n/-- The asserted inequality, for fixed real numbers `x`, `y`, `z`, and `t`. -/\ndef InequalityHolds (x y z t : ℝ) : Prop :=\n inequalityLHS x y z t ≥ inequalityRHS x y z t\n\n/-- The full universal assertion from the problem. -/\ndef Target : Prop :=\n ∀ x y z t : ℝ, InequalityHolds x y z t\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a958872d-7937-5cf5-b8fb-a003acef7c78", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ff6a234e1fd0e27b7a7894b1afc6098b1f1e52af8173ff408e7fda0b0e2cfb81", "task_path": "tasks/nmp3_a958872d-7937-5cf5-b8fb-a003acef7c78", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a958872d-7937-5cf5-b8fb-a003acef7c78", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_a989832e-ccb2-551a-8d31-7ebb8246c7e7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers \\(a,b,c,d\\) the inequality\n-- \\[\n-- a^{4}+b^{4}+c^{4}+d^{4}+2abcd\\;\\ge\\;a^{2}b^{2}+a^{2}c^{2}+a^{2}d^{2}+b^{2}c^{2}+b^{2}d^{2}+c^{2}d^{2}\n-- \\]\n-- holds.\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the four-variable quartic inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, `c`,\nand `d`, that\n\n`a^4 + b^4 + c^4 + d^4 + 2abcd ≥\n a^2b^2 + a^2c^2 + a^2d^2 + b^2c^2 + b^2d^2 + c^2d^2`.\n\nWe record the proposition as a definition. No proof is supplied here.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef LHS (a b c d : ℝ) : ℝ :=\n a ^ 4 + b ^ 4 + c ^ 4 + d ^ 4 + 2 * a * b * c * d\n\n/-- The right-hand side of the inequality in the source problem. -/\ndef RHS (a b c d : ℝ) : ℝ :=\n a ^ 2 * b ^ 2 + a ^ 2 * c ^ 2 + a ^ 2 * d ^ 2 +\n b ^ 2 * c ^ 2 + b ^ 2 * d ^ 2 + c ^ 2 * d ^ 2\n\n/-- The asserted non-strict inequality, without restrictions on its arguments. -/\ndef Inequality (a b c d : ℝ) : Prop :=\n LHS a b c d ≥ RHS a b c d\n\n/--\nThe complete proposition from the problem: for every quadruple of positive real\nnumbers `a`, `b`, `c`, `d`, the displayed inequality holds.\n-/\ndef Target : Prop :=\n ∀ (a b c d : ℝ),\n 0 < a → 0 < b → 0 < c → 0 < d → LHS a b c d ≥ RHS a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a989832e-ccb2-551a-8d31-7ebb8246c7e7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "289e581bf92a605a69894c72e02dab8f8974a8d21fc7b3d88ec1a1e5df6e962e", "task_path": "tasks/nmp3_a989832e-ccb2-551a-8d31-7ebb8246c7e7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "a989832e-ccb2-551a-8d31-7ebb8246c7e7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aa0c7ea0-5c78-509e-bf68-3eba10c25f5e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p(x)$ be a polynomial with integer coefficients. Let $k\\ge 6$ be an integer and let $x_1,x_2,\\dots,x_k$ be distinct integers such that $p(x_i)\\in\\{1,2,\\dots,k-1\\}$ for each $i=1,\\dots,k$. Prove that \n-- $$p(x_1)=p(x_2)=\\cdots=p(x_k).$$\nimport Mathlib\n\nnamespace Problem\n\n/--\nFor every integer-coefficient polynomial `p`, every integer `k ≥ 6`, and every\ninjective `k`-term family `x` of integers, if each evaluated value `p (x i)` lies\nin the integer interval `{1, ..., k - 1}`, then all these evaluated values are\nequal.\n-/\ndef Target : Prop :=\n ∀ (p : Polynomial ℤ) (k : ℕ) (hk : (6 : ℕ) ≤ k)\n (x : Fin k → ℤ) (hx : Function.Injective x)\n (hval : ∀ i : Fin k,\n p.eval (x i) ∈ Finset.Icc (1 : ℤ) ((k : ℤ) - 1)),\n ∀ i j : Fin k, p.eval (x i) = p.eval (x j)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa0c7ea0-5c78-509e-bf68-3eba10c25f5e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ce27754c8658f9179accbb46b598bc2e9a39ba68ae89d54e53a660dada856df3", "task_path": "tasks/nmp3_aa0c7ea0-5c78-509e-bf68-3eba10c25f5e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa0c7ea0-5c78-509e-bf68-3eba10c25f5e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aa1e9d15-47b1-58ff-a055-8a3cfb47fa67", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c>0$ with $abc=1$, prove that \n-- $$\\frac{a}{\\sqrt{3+2c+ca}}+\\frac{b}{\\sqrt{3+2a+ab}}+\\frac{c}{\\sqrt{3+2b+bc}}\\ge \\sqrt{\\frac{3}{2}}\\,.$$\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable inequality\n\nThe original problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwith `abc = 1`, the inequality\n\n`a / sqrt (3 + 2*c + c*a) + b / sqrt (3 + 2*a + a*b)\n + c / sqrt (3 + 2*b + b*c) ≥ sqrt (3/2)`.\n\nThis file only states the problem. It does not assume or prove it.\n-/\n\nnamespace Problem\n\n/-- The first summand in the left-hand side of the problem statement. -/\nnoncomputable def FirstTerm (a c : ℝ) : ℝ :=\n a / Real.sqrt (3 + 2 * c + c * a)\n\n/-- The second summand in the left-hand side of the problem statement. -/\nnoncomputable def SecondTerm (a b : ℝ) : ℝ :=\n b / Real.sqrt (3 + 2 * a + a * b)\n\n/-- The third summand in the left-hand side of the problem statement. -/\nnoncomputable def ThirdTerm (b c : ℝ) : ℝ :=\n c / Real.sqrt (3 + 2 * b + b * c)\n\n/-- The left-hand side of the inequality, as the sum of its three summands. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n FirstTerm a c + SecondTerm a b + ThirdTerm b c\n\n/-- The right-hand side `sqrt (3/2)` of the inequality. -/\nnoncomputable def RightHandSide : ℝ :=\n Real.sqrt (3 / 2)\n\n/-- The admissibility assumptions on the three variables: they are positive real\nnumbers whose product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The assertion to be proved: for all positive real numbers `a`, `b`, and `c`\nwhose product is `1`, the left-hand side is at least `sqrt (3/2)`.\n\nThe three positivity assumptions and the product assumption are stated as\nsuccessive implications, preserving their role as hypotheses over universally\nquantified real variables. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a * b * c = 1 →\n LeftHandSide a b c ≥ RightHandSide\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa1e9d15-47b1-58ff-a055-8a3cfb47fa67", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f84d9e387f0c3f01abbbd34943ba64b5e829f70125f3d6de571ee577c07f8af1", "task_path": "tasks/nmp3_aa1e9d15-47b1-58ff-a055-8a3cfb47fa67", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa1e9d15-47b1-58ff-a055-8a3cfb47fa67", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aa2603ab-04f7-5cd0-ad8a-dca22dc7a707", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For an interior point $D$ of a triangle $ABC$, let $E=BD\\cap AC$ and $F=CD\\cap AB$. Suppose the four points $A,E,D,F$ are concyclic; denote by $\\Gamma_D$ the circle through them. Prove that as $D$ varies, all the circles $\\Gamma_D$ share a second common point distinct from $A$.\nimport Mathlib.Analysis.Convex.Topology\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Sphere.Basic\n\n/-!\n# Formal statement: a common second point for a family of Miquel circles\n\nThis file formalizes the statement of the problem, but does not prove it. The\nambient plane is the real Euclidean plane `EuclideanSpace ℝ (Fin 2)`.\n-/\n\nnoncomputable section\n\nopen Set\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `A`, `B`, and `C` form a genuine (nondegenerate) triangle, i.e. they are\nnot collinear. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- `D` is a point in the (strict) interior of the triangle with vertices\n`A`, `B`, and `C`. -/\ndef InTriangleInterior (A B C D : Plane) : Prop :=\n D ∈ interior (convexHull ℝ ({A, B, C} : Set Plane))\n\n/-- `X` is the unique intersection point of the affine lines `PQ` and `RS`.\nEquivalently, the intersection of the two lines is the singleton `{X}`. -/\ndef IsLineIntersection (X P Q R S : Plane) : Prop :=\n X ∈ line[ℝ, P, Q] ∧ X ∈ line[ℝ, R, S] ∧\n ∀ Y : Plane, Y ∈ line[ℝ, P, Q] → Y ∈ line[ℝ, R, S] → Y = X\n\n/-- A genuine circle, represented by a positive-radius Euclidean sphere, passes\nthrough each of the four listed points. -/\ndef IsCircleThrough (Γ : EuclideanGeometry.Sphere Plane)\n (P Q R S : Plane) : Prop :=\n 0 < Γ.radius ∧ P ∈ Γ ∧ Q ∈ Γ ∧ R ∈ Γ ∧ S ∈ Γ\n\n/-- The assertion that `Γ` is the circle through `A`, `E`, `D`, `F` used in\nthe problem: the four points are concyclic and `Γ` is a positive-radius circle\nthrough all four of them. -/\ndef IsGammaD (A E D F : Plane) (Γ : EuclideanGeometry.Sphere Plane) : Prop :=\n EuclideanGeometry.Concyclic ({A, E, D, F} : Set Plane) ∧\n IsCircleThrough Γ A E D F\n\n/-- For a fixed triangle `ABC`, there is a point `Q`, different from `A`, that\nlies on every circle `Γ_D` arising from a point `D` in the interior of `ABC`\nfor which the constructed points `E = BD ∩ AC` and `F = CD ∩ AB` make\n`A, E, D, F` concyclic. -/\ndef HasCommonSecondPoint (A B C : Plane) : Prop :=\n ∃ Q : Plane, Q ≠ A ∧\n ∀ (D E F : Plane) (Γ : EuclideanGeometry.Sphere Plane),\n InTriangleInterior A B C D →\n IsLineIntersection E B D A C →\n IsLineIntersection F C D A B →\n IsGammaD A E D F Γ →\n Q ∈ Γ\n\n/-- The full formal target: every genuine triangle has a second point common\nto all the circles `Γ_D` obtained as `D` varies under the stated conditions. -/\ndef Target : Prop :=\n ∀ A B C : Plane, IsTriangle A B C → HasCommonSecondPoint A B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa2603ab-04f7-5cd0-ad8a-dca22dc7a707", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "708312e4bf0c1a99a249a1b356d4c90ff18d7527fe30a3d9ecec8100a45143b2", "task_path": "tasks/nmp3_aa2603ab-04f7-5cd0-ad8a-dca22dc7a707", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa2603ab-04f7-5cd0-ad8a-dca22dc7a707", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aa276cd3-f8ae-5f2e-a098-f8561d6f601a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be the complete graph on $n+2$ vertices. Its edges are colored with an arbitrary number of colors, with the condition that each color appears on at most $n$ edges. Prove that $G$ contains a triangle whose three edges all have distinct colors (a “colorful triangle”).\nimport Mathlib.Combinatorics.SimpleGraph.Coloring.EdgeLabeling\nimport Mathlib.Data.Set.Card\n\n/-!\n# Colorful triangles in edge-colored complete graphs\n\nThe source problem asks for a formal statement of the following assertion: if the\nedges of the complete graph on `n + 2` vertices are colored so that no color is\nused on more than `n` edges, then there is a triangle whose three edge colors are\npairwise distinct.\n-/\n\nnamespace Problem\n\nuniverse u\n\n/-- The edge color of an unordered pair of distinct vertices in a complete graph. -/\ndef topEdgeColor {V : Type*} {Color : Type*} (C : SimpleGraph.TopEdgeLabeling V Color)\n (x y : V) (hxy : x ≠ y) : Color :=\n C.get x y (by simpa using hxy)\n\n/-- The number of edges of the complete graph on `n + 2` vertices that receive a given color. -/\nnoncomputable def colorClassCard {n : ℕ} {Color : Type u}\n (C : SimpleGraph.TopEdgeLabeling (Fin (n + 2)) Color) (color : Color) : ℕ :=\n Set.ncard {e : (⊤ : SimpleGraph (Fin (n + 2))).edgeSet | C e = color}\n\n/-- Every color is used on at most `n` edges of the complete graph on `n + 2` vertices. -/\ndef BoundedColorClasses {n : ℕ} {Color : Type u}\n (C : SimpleGraph.TopEdgeLabeling (Fin (n + 2)) Color) : Prop :=\n ∀ color : Color, colorClassCard C color ≤ n\n\n/-- The complete graph contains three pairwise distinct vertices whose three edge colors\nare pairwise distinct. -/\ndef HasColorfulTriangle {n : ℕ} {Color : Type u}\n (C : SimpleGraph.TopEdgeLabeling (Fin (n + 2)) Color) : Prop :=\n ∃ (x y z : Fin (n + 2)) (hxy : x ≠ y) (hxz : x ≠ z) (hyz : y ≠ z),\n topEdgeColor C x y hxy ≠ topEdgeColor C x z hxz ∧\n topEdgeColor C x y hxy ≠ topEdgeColor C y z hyz ∧\n topEdgeColor C x z hxz ≠ topEdgeColor C y z hyz\n\n/-- The assertion of the problem: for every natural number `n`, every edge-coloring of the\ncomplete graph on `n + 2` vertices whose color classes have size at most `n` contains a\ntriangle with three pairwise distinct edge colors. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (Color : Type u) (C : SimpleGraph.TopEdgeLabeling (Fin (n + 2)) Color),\n BoundedColorClasses C → HasColorfulTriangle C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa276cd3-f8ae-5f2e-a098-f8561d6f601a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ce6a72ec2e346b2c3bc4acaf0775432c742f38ea8ad80841eeec64e8a5a3c247", "task_path": "tasks/nmp3_aa276cd3-f8ae-5f2e-a098-f8561d6f601a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa276cd3-f8ae-5f2e-a098-f8561d6f601a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aa3c9f03-6146-5962-8aa3-45586e73db16", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be non‑negative real numbers such that $ab+ac+bc\\neq0$. Prove that\n-- \\[\n-- \\frac{a^{3}+b^{3}+c^{3}}{ab+ac+bc}\\le\n-- \\frac{a^{3}}{b^{2}+bc+c^{2}}+\\frac{b^{3}}{a^{2}+ac+c^{2}}+\\frac{c^{3}}{a^{2}+ab+b^{2}}\n-- \\le\\frac{a^{5}+b^{5}+c^{5}}{a^{2}b^{2}+a^{2}c^{2}+b^{2}c^{2}}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of a three-variable real inequality\n\nThe source problem asks to prove a double inequality for non-negative real\nnumbers `a`, `b`, and `c` satisfying `a*b + a*c + b*c ≠ 0`.\n\nThe declarations below record only the mathematical statement; no proof of the\ntarget proposition is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility assumptions on the real triple `(a, b, c)` from the\nnon-negativity condition and the condition `a*b + a*c + b*c ≠ 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + a * c + b * c ≠ 0\n\n/-- The left-hand inequality in the asserted double inequality. -/\ndef LowerInequality (a b c : ℝ) : Prop :=\n (a ^ 3 + b ^ 3 + c ^ 3) / (a * b + a * c + b * c) ≤\n a ^ 3 / (b ^ 2 + b * c + c ^ 2) +\n b ^ 3 / (a ^ 2 + a * c + c ^ 2) +\n c ^ 3 / (a ^ 2 + a * b + b ^ 2)\n\n/-- The right-hand inequality in the asserted double inequality. -/\ndef UpperInequality (a b c : ℝ) : Prop :=\n a ^ 3 / (b ^ 2 + b * c + c ^ 2) +\n b ^ 3 / (a ^ 2 + a * c + c ^ 2) +\n c ^ 3 / (a ^ 2 + a * b + b ^ 2) ≤\n (a ^ 5 + b ^ 5 + c ^ 5) /\n (a ^ 2 * b ^ 2 + a ^ 2 * c ^ 2 + b ^ 2 * c ^ 2)\n\n/-- The complete double inequality, with its common middle expression. -/\ndef DoubleInequality (a b c : ℝ) : Prop :=\n LowerInequality a b c ∧ UpperInequality a b c\n\n/-- The proposition asserted by the source problem: for every admissible\nnon-negative real triple, both inequalities of the displayed chain hold. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → DoubleInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa3c9f03-6146-5962-8aa3-45586e73db16", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "79a85b4bffd55856944bbc3676dde6f34336d1c32ec1e9e5722b9fbd33d27121", "task_path": "tasks/nmp3_aa3c9f03-6146-5962-8aa3-45586e73db16", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa3c9f03-6146-5962-8aa3-45586e73db16", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aa465d3f-5cfe-50f8-bcc4-f1a4b291e143", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In an EGMO exam there are three exercises, each scored with an integer from 0 to 7 inclusive. Among 49 participants, prove that there exist two participants such that for each of the three exercises the first participant’s score is at least as large as the second participant’s score.\nimport Mathlib.Data.Fin.Basic\nimport Mathlib.Data.Int.Basic\n\n/-!\n# EGMO exam: a three-exercise dominance pair among 49 participants\n\nThis file formalizes the statement of the problem. It does not contain a proof\nof the assertion; `Problem.Target` is a proposition-valued definition.\n-/\n\nnamespace Problem\n\n/-- The three exercises of the exam. -/\nabbrev Exercise : Type := Fin 3\n\n/-- The 49 participants are indexed by the finite type `Fin 49`. -/\nabbrev Participant : Type := Fin 49\n\n/-- Scores are integers (the admissible range is imposed separately). -/\nabbrev Score : Type := Int\n\n/-- A complete scoring of all participants in all exercises. -/\nabbrev Scoring : Type := Participant → Exercise → Score\n\n/-- Every participant receives an integer score from 0 to 7 inclusive in every\none of the three exercises. -/\ndef ScoresInRange (score : Scoring) : Prop :=\n ∀ (p : Participant) (e : Exercise), 0 ≤ score p e ∧ score p e ≤ 7\n\n/-- Participant `first` has a score at least as large as participant `second`\nin each of the three exercises. -/\ndef Dominates (score : Scoring) (first second : Participant) : Prop :=\n ∀ e : Exercise, score second e ≤ score first e\n\n/-- There are two distinct participants such that the first dominates the\nsecond in all three exercises. -/\ndef HasDominatingPair (score : Scoring) : Prop :=\n ∃ first second : Participant,\n first ≠ second ∧ Dominates score first second\n\n/-- The complete assertion of the problem: for every valid scoring of the 49\nparticipants, there is a distinct ordered pair in which the first participant's\nthree scores are each at least the second participant's corresponding score. -/\ndef Target : Prop :=\n ∀ score : Scoring, ScoresInRange score → HasDominatingPair score\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa465d3f-5cfe-50f8-bcc4-f1a4b291e143", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c622931a6910fb9019a3ee06e1627a1bb37d33ef2299d396b53a1191a90f7184", "task_path": "tasks/nmp3_aa465d3f-5cfe-50f8-bcc4-f1a4b291e143", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa465d3f-5cfe-50f8-bcc4-f1a4b291e143", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aa5506ef-9ef7-5617-8326-9445f2c4ccbc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a triangle $ABC$ with incircle $(I)$ touching $BC$, $CA$, and $AB$ at $D$, $E$, and $F$ respectively. Let $H$ be the orthocenter of $\\triangle ABC$, let $J$ be the orthocenter of $\\triangle AEF$, and let $M$ be the foot of the perpendicular from $D$ to line $EF$. Prove that the points $H$, $J$, and $M$ are collinear.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.MongePoint\nimport Mathlib.Geometry.Euclidean.Incenter.Basic\nimport Mathlib.Geometry.Euclidean.Projection\n\nnoncomputable section\nopen scoped Affine\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, represented as the real inner-product space `ℝ²`. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The first named vertex `A` of a bundled triangle. -/\ndef vertexA (t : Affine.Triangle ℝ Plane) : Plane := t.points 0\n\n/-- The second named vertex `B` of a bundled triangle. -/\ndef vertexB (t : Affine.Triangle ℝ Plane) : Plane := t.points 1\n\n/-- The third named vertex `C` of a bundled triangle. -/\ndef vertexC (t : Affine.Triangle ℝ Plane) : Plane := t.points 2\n\n/-- The (internal) incircle `(I)` of `ABC`, as the insphere of the bundled triangle. -/\ndef incircle (t : Affine.Triangle ℝ Plane) : EuclideanGeometry.Sphere Plane :=\n t.insphere\n\n/-- The incenter, i.e. the centre of the incircle `(I)`. -/\ndef incenterI (t : Affine.Triangle ℝ Plane) : Plane :=\n t.incenter\n\n/-- `D`, the point where the incircle touches `BC`, represented by the touchpoint on the face\nopposite `A` (index `0`). -/\ndef touchpointD (t : Affine.Triangle ℝ Plane) : Plane :=\n t.touchpoint ∅ 0\n\n/-- `E`, the point where the incircle touches `CA`, represented by the touchpoint on the face\nopposite `B` (index `1`). -/\ndef touchpointE (t : Affine.Triangle ℝ Plane) : Plane :=\n t.touchpoint ∅ 1\n\n/-- `F`, the point where the incircle touches `AB`, represented by the touchpoint on the face\nopposite `C` (index `2`). -/\ndef touchpointF (t : Affine.Triangle ℝ Plane) : Plane :=\n t.touchpoint ∅ 2\n\n/-- The line through `B` and `C`. -/\nabbrev sideBC (t : Affine.Triangle ℝ Plane) : AffineSubspace ℝ Plane :=\n line[ℝ, vertexB t, vertexC t]\n\n/-- The line through `C` and `A`. -/\nabbrev sideCA (t : Affine.Triangle ℝ Plane) : AffineSubspace ℝ Plane :=\n line[ℝ, vertexA t, vertexC t]\n\n/-- The line through `A` and `B`. -/\nabbrev sideAB (t : Affine.Triangle ℝ Plane) : AffineSubspace ℝ Plane :=\n line[ℝ, vertexA t, vertexB t]\n\ntheorem touchpointD_mem_sideBC (t : Affine.Triangle ℝ Plane) :\n touchpointD t ∈ sideBC t := by\n have h := t.touchpoint_mem_affineSpan (∅ : Finset (Fin 3)) 0\n rw [Affine.Simplex.range_faceOpposite_points] at h\n have hset : ({0}ᶜ : Set (Fin 3)) = ({1, 2} : Set (Fin 3)) := by\n ext i\n fin_cases i <;> simp\n rw [hset, Set.image_pair] at h\n simpa [touchpointD, sideBC, vertexB, vertexC] using h\n\ntheorem touchpointE_mem_sideCA (t : Affine.Triangle ℝ Plane) :\n touchpointE t ∈ sideCA t := by\n have h := t.touchpoint_mem_affineSpan (∅ : Finset (Fin 3)) 1\n rw [Affine.Simplex.range_faceOpposite_points] at h\n have hset : ({1}ᶜ : Set (Fin 3)) = ({0, 2} : Set (Fin 3)) := by\n ext i\n fin_cases i <;> simp\n rw [hset, Set.image_pair] at h\n simpa [touchpointE, sideCA, vertexA, vertexC] using h\n\ntheorem touchpointF_mem_sideAB (t : Affine.Triangle ℝ Plane) :\n touchpointF t ∈ sideAB t := by\n have h := t.touchpoint_mem_affineSpan (∅ : Finset (Fin 3)) 2\n rw [Affine.Simplex.range_faceOpposite_points] at h\n have hset : ({2}ᶜ : Set (Fin 3)) = ({0, 1} : Set (Fin 3)) := by\n ext i\n fin_cases i <;> simp\n rw [hset, Set.image_pair] at h\n simpa [touchpointF, sideAB, vertexA, vertexB] using h\n\n\n/-- The affine span of the face opposite `A` is the supporting line `BC`. -/\ntheorem affineSpan_faceOpposite_zero_eq_sideBC (t : Affine.Triangle ℝ Plane) :\n affineSpan ℝ (Set.range (t.faceOpposite 0).points) = sideBC t := by\n rw [Affine.Simplex.range_faceOpposite_points]\n have hset : ({0}ᶜ : Set (Fin 3)) = ({1, 2} : Set (Fin 3)) := by\n ext i\n fin_cases i <;> simp\n rw [hset, Set.image_pair]\n rfl\n\n/-- The affine span of the face opposite `B` is the supporting line `CA`. -/\ntheorem affineSpan_faceOpposite_one_eq_sideCA (t : Affine.Triangle ℝ Plane) :\n affineSpan ℝ (Set.range (t.faceOpposite 1).points) = sideCA t := by\n rw [Affine.Simplex.range_faceOpposite_points]\n have hset : ({1}ᶜ : Set (Fin 3)) = ({0, 2} : Set (Fin 3)) := by\n ext i\n fin_cases i <;> simp\n rw [hset, Set.image_pair]\n rfl\n\n/-- The affine span of the face opposite `C` is the supporting line `AB`. -/\ntheorem affineSpan_faceOpposite_two_eq_sideAB (t : Affine.Triangle ℝ Plane) :\n affineSpan ℝ (Set.range (t.faceOpposite 2).points) = sideAB t := by\n rw [Affine.Simplex.range_faceOpposite_points]\n have hset : ({2}ᶜ : Set (Fin 3)) = ({0, 1} : Set (Fin 3)) := by\n ext i\n fin_cases i <;> simp\n rw [hset, Set.image_pair]\n rfl\n\n/-- `D` lies between `B` and `C` on side `BC`. -/\ntheorem touchpointD_sbtw_BC (t : Affine.Triangle ℝ Plane) :\n Sbtw ℝ (vertexB t) (touchpointD t) (vertexC t) := by\n simpa [vertexB, vertexC, touchpointD] using\n (t.sbtw_touchpoint_empty (i₁ := 1) (i₂ := 0) (i₃ := 2)\n (by decide) (by decide) (by decide))\n\n/-- `E` lies between `C` and `A` on side `CA`. -/\ntheorem touchpointE_sbtw_CA (t : Affine.Triangle ℝ Plane) :\n Sbtw ℝ (vertexC t) (touchpointE t) (vertexA t) := by\n simpa [vertexC, vertexA, touchpointE] using\n (t.sbtw_touchpoint_empty (i₁ := 2) (i₂ := 1) (i₃ := 0)\n (by decide) (by decide) (by decide))\n\n/-- `F` lies between `A` and `B` on side `AB`. -/\ntheorem touchpointF_sbtw_AB (t : Affine.Triangle ℝ Plane) :\n Sbtw ℝ (vertexA t) (touchpointF t) (vertexB t) := by\n simpa [vertexA, vertexB, touchpointF] using\n (t.sbtw_touchpoint_empty (i₁ := 0) (i₂ := 2) (i₃ := 1)\n (by decide) (by decide) (by decide))\n\n/-- `D` lies on the incircle. -/\ntheorem touchpointD_mem_incircle (t : Affine.Triangle ℝ Plane) :\n touchpointD t ∈ incircle t := by\n simpa [touchpointD, incircle] using t.touchpoint_mem_insphere 0\n\n/-- `E` lies on the incircle. -/\ntheorem touchpointE_mem_incircle (t : Affine.Triangle ℝ Plane) :\n touchpointE t ∈ incircle t := by\n simpa [touchpointE, incircle] using t.touchpoint_mem_insphere 1\n\n/-- `F` lies on the incircle. -/\ntheorem touchpointF_mem_incircle (t : Affine.Triangle ℝ Plane) :\n touchpointF t ∈ incircle t := by\n simpa [touchpointF, incircle] using t.touchpoint_mem_insphere 2\n\n/-- The incircle is tangent to side `BC` at `D`. -/\ntheorem touchpointD_tangent_sideBC (t : Affine.Triangle ℝ Plane) :\n (incircle t).IsTangentAt (touchpointD t) (sideBC t) := by\n rw [← affineSpan_faceOpposite_zero_eq_sideBC]\n simpa [touchpointD, incircle] using t.isTangentAt_insphere_touchpoint 0\n\n/-- The incircle is tangent to side `CA` at `E`. -/\ntheorem touchpointE_tangent_sideCA (t : Affine.Triangle ℝ Plane) :\n (incircle t).IsTangentAt (touchpointE t) (sideCA t) := by\n rw [← affineSpan_faceOpposite_one_eq_sideCA]\n simpa [touchpointE, incircle] using t.isTangentAt_insphere_touchpoint 1\n\n/-- The incircle is tangent to side `AB` at `F`. -/\ntheorem touchpointF_tangent_sideAB (t : Affine.Triangle ℝ Plane) :\n (incircle t).IsTangentAt (touchpointF t) (sideAB t) := by\n rw [← affineSpan_faceOpposite_two_eq_sideAB]\n simpa [touchpointF, incircle] using t.isTangentAt_insphere_touchpoint 2\n\n/-- The points `A`, `E`, and `F` are not collinear, so they form a genuine triangle. -/\ntheorem not_collinear_AEF (t : Affine.Triangle ℝ Plane) :\n ¬ Collinear ℝ ({vertexA t, touchpointE t, touchpointF t} : Set Plane) := by\n intro hcol\n have hE : touchpointE t ∈ sideCA t := touchpointE_mem_sideCA t\n have hF : touchpointF t ∈ sideAB t := touchpointF_mem_sideAB t\n have hAneE : vertexA t ≠ touchpointE t := by\n simpa [touchpointE, vertexA] using (t.touchpoint_empty_ne_point 1 0).symm\n have hlineAE : line[ℝ, vertexA t, touchpointE t] = sideCA t := by\n exact affineSpan_pair_eq_of_right_mem_of_ne hE hAneE.symm\n have hAneF : vertexA t ≠ touchpointF t := by\n simpa [touchpointF, vertexA] using (t.touchpoint_empty_ne_point 2 0).symm\n have hFlineAE : touchpointF t ∈ line[ℝ, vertexA t, touchpointE t] := by\n exact hcol.mem_affineSpan_of_mem_of_ne (by simp) (by simp) (by simp) hAneE\n have hFlineCA : touchpointF t ∈ sideCA t := by\n rw [← hlineAE]\n exact hFlineAE\n have hinf : sideAB t ⊓ sideCA t = affineSpan ℝ ({vertexA t} : Set Plane) := by\n have h := t.independent.inf_affineSpan_eq_affineSpan_inter\n ({0, 1} : Set (Fin 3)) ({0, 2} : Set (Fin 3))\n rw [Set.image_pair, Set.image_pair] at h\n have hinter : ({0, 1} : Set (Fin 3)) ∩ ({0, 2} : Set (Fin 3)) = {0} := by\n ext i\n fin_cases i <;> simp\n rw [hinter, Set.image_singleton] at h\n simpa [sideAB, sideCA, vertexA, vertexB, vertexC] using h\n have hFmem : touchpointF t ∈ sideAB t ⊓ sideCA t := ⟨hF, hFlineCA⟩\n rw [hinf] at hFmem\n have hFA : touchpointF t = vertexA t :=\n (AffineSubspace.mem_affineSpan_singleton ℝ Plane).1 hFmem\n exact hAneF hFA.symm\n\n/-- Since `A`, `E`, and `F` are noncollinear, in particular `E` and `F` are distinct. -/\ntheorem touchpointE_ne_touchpointF (t : Affine.Triangle ℝ Plane) :\n touchpointE t ≠ touchpointF t := by\n exact ne₂₃_of_not_collinear (not_collinear_AEF t)\n\n/-- The bundled triangle with vertices `A`, `E`, and `F`. -/\ndef triangleAEF (t : Affine.Triangle ℝ Plane) : Affine.Triangle ℝ Plane :=\n { points := ![vertexA t, touchpointE t, touchpointF t]\n independent := by\n rw [affineIndependent_iff_not_collinear_set]\n exact not_collinear_AEF t }\n\n/-- The orthocenter `H` of triangle `ABC`. -/\ndef orthocenterABC (t : Affine.Triangle ℝ Plane) : Plane :=\n t.orthocenter\n\n/-- The orthocenter `J` of triangle `AEF`. -/\ndef orthocenterAEF (t : Affine.Triangle ℝ Plane) : Plane :=\n (triangleAEF t).orthocenter\n\n/-- Each altitude of triangle `ABC` passes through `H`. -/\ntheorem orthocenterABC_mem_altitude (t : Affine.Triangle ℝ Plane) (i : Fin 3) :\n orthocenterABC t ∈ t.altitude i := by\n simpa [orthocenterABC] using t.orthocenter_mem_altitude (i₁ := i)\n\n/-- Each altitude of triangle `AEF` passes through `J`. -/\ntheorem orthocenterAEF_mem_altitude (t : Affine.Triangle ℝ Plane) (i : Fin 3) :\n orthocenterAEF t ∈ (triangleAEF t).altitude i := by\n simpa [orthocenterAEF] using (triangleAEF t).orthocenter_mem_altitude (i₁ := i)\n\n/-- The line through `E` and `F`. -/\nabbrev lineEF (t : Affine.Triangle ℝ Plane) : AffineSubspace ℝ Plane :=\n line[ℝ, touchpointE t, touchpointF t]\n\n/-- `M`, the foot of the perpendicular from `D` to line `EF`, as the orthogonal projection\nof `D` onto `lineEF`. -/\ndef footM (t : Affine.Triangle ℝ Plane) : Plane :=\n (EuclideanGeometry.orthogonalProjection (lineEF t) (touchpointD t) : Plane)\n\n/-- The point `M` lies on the line `EF`. -/\ntheorem footM_mem_lineEF (t : Affine.Triangle ℝ Plane) : footM t ∈ lineEF t := by\n exact EuclideanGeometry.orthogonalProjection_mem (s := lineEF t) (p := touchpointD t)\n\n/-- The segment from `D` to its foot `M` is orthogonal to the direction of line `EF`. -/\ntheorem touchpointD_vsub_footM_mem_direction_orthogonal (t : Affine.Triangle ℝ Plane) :\n (touchpointD t -ᵥ footM t) ∈ (lineEF t).directionᗮ := by\n exact EuclideanGeometry.vsub_orthogonalProjection_mem_direction_orthogonal\n (s := lineEF t) (p := touchpointD t)\n\n/-- The assertion that `H`, `J`, and `M` are collinear. -/\ndef CollinearHJM (t : Affine.Triangle ℝ Plane) : Prop :=\n Collinear ℝ ({orthocenterABC t, orthocenterAEF t, footM t} : Set Plane)\n\n/-- The statement of the problem: for every triangle `ABC` in the Euclidean plane, with its\nincircle touchpoints `D`, `E`, `F`, the associated points `H`, `J`, and `M` are collinear. -/\ndef Target : Prop :=\n ∀ t : Affine.Triangle ℝ Plane, CollinearHJM t\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa5506ef-9ef7-5617-8326-9445f2c4ccbc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "04b491ceb1fa04052c6c0b22765588f8e979f69f0f70dd833f34314c3764b346", "task_path": "tasks/nmp3_aa5506ef-9ef7-5617-8326-9445f2c4ccbc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa5506ef-9ef7-5617-8326-9445f2c4ccbc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aa6f71e5-7a52-57fb-8273-fb7cdd2124dc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for a function $f:\\mathbb{R}\\to\\mathbb{R}$ the two functional equations \n-- \\[\n-- f(x+y)=f(x)+f(y)\\qquad\\text{and}\\qquad f(x+y+xy)=f(x)+f(y)+f(xy)\\qquad(x,y\\in\\mathbb{R})\n-- \\]\n-- are equivalent; i.e. each holds for all real $x,y$ if and only if the other does.\nimport Mathlib\n\nnamespace Problem\n\n/-- The first functional equation: `f (x + y) = f x + f y` for every real `x` and `y`. -/\ndef AdditiveEquation (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x + y) = f x + f y\n\n/-- The second functional equation:\n`f (x + y + x * y) = f x + f y + f (x * y)` for every real `x` and `y`. -/\ndef ShiftedProductEquation (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x + y + x * y) = f x + f y + f (x * y)\n\n/-- For every function `f : ℝ → ℝ`, the first functional equation holds for all real\n`x, y` if and only if the second one does. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, AdditiveEquation f ↔ ShiftedProductEquation f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa6f71e5-7a52-57fb-8273-fb7cdd2124dc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ec5e628c64d237e2898d716ca9e4c47c710b6ae847c35881c159da5fdafa68a7", "task_path": "tasks/nmp3_aa6f71e5-7a52-57fb-8273-fb7cdd2124dc", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa6f71e5-7a52-57fb-8273-fb7cdd2124dc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aa82730d-d413-5aca-a546-52f4f4aa9d26", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c,d>0$ with $abcd=1$, prove that \n-- \\[\n-- \\frac{a^9}{a^8+5}+\\frac{b^9}{b^8+5}+\\frac{c^9}{c^8+5}+\\frac{d^9}{d^8+5}\\ge\\frac{a+b+c+d}{6}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility assumptions on the four positive real variables. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧ a * b * c * d = 1\n\n/-- The left-hand side of the asserted inequality, using natural-number powers. -/\nnoncomputable def lhs (a b c d : ℝ) : ℝ :=\n a ^ (9 : ℕ) / (a ^ (8 : ℕ) + 5) +\n b ^ (9 : ℕ) / (b ^ (8 : ℕ) + 5) +\n c ^ (9 : ℕ) / (c ^ (8 : ℕ) + 5) +\n d ^ (9 : ℕ) / (d ^ (8 : ℕ) + 5)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c d : ℝ) : ℝ :=\n (a + b + c + d) / 6\n\n/-- The pointwise inequality claimed in the problem. -/\nnoncomputable def Inequality (a b c d : ℝ) : Prop :=\n lhs a b c d ≥ rhs a b c d\n\n/-- The complete universally quantified statement of the problem. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Inequality a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa82730d-d413-5aca-a546-52f4f4aa9d26", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "29142ccc9e6b458a34f03f302f45b7a4dc02e1bde6176d67c0c1dff567b21bfb", "task_path": "tasks/nmp3_aa82730d-d413-5aca-a546-52f4f4aa9d26", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa82730d-d413-5aca-a546-52f4f4aa9d26", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aa891995-7f47-5966-88bd-705c203f8853", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that the equation $7^x = 1 + y^2 + z^2$ has no solutions in positive integers $x$, $y$, and $z$.\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks to prove that the equation\n\n`7 ^ x = 1 + y ^ 2 + z ^ 2`\n\nhas no solutions in positive integers `x`, `y`, and `z`.\n\nThis file only records the mathematical assertion as a proposition. It does\nnot contain a proof of the assertion.\n-/\n\nnamespace Problem\n\n/-- The Diophantine equation appearing in the problem, over the natural numbers. -/\ndef Equation (x y z : ℕ) : Prop :=\n (7 : ℕ) ^ x = 1 + y ^ 2 + z ^ 2\n\n/-- `x`, `y`, and `z` are positive natural-number solutions of the equation. -/\ndef IsPositiveIntegerSolution (x y z : ℕ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ Equation x y z\n\n/-- The equation `7 ^ x = 1 + y ^ 2 + z ^ 2` has no solutions in positive\nnatural numbers `x`, `y`, and `z`. -/\ndef Target : Prop :=\n ¬ ∃ (x y z : ℕ), IsPositiveIntegerSolution x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa891995-7f47-5966-88bd-705c203f8853", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "79ee5ff644293bbc2e0a36612dfe5699471f776c46dfa440ba35481d6f052b68", "task_path": "tasks/nmp3_aa891995-7f47-5966-88bd-705c203f8853", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa891995-7f47-5966-88bd-705c203f8853", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aa9d9c5b-d766-56e1-a3a4-e14cc94fcf75", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there are infinitely many positive integers $a,b,c$ such that each of the four numbers $a+b+c$, $ab+ac+bc$, $a^2+b^2+c^2$, and $abc$ is a perfect square.\nimport Mathlib\n\n/-!\n# Formalization of the infinitely-many-perfect-squares problem\n\nWe formalize the assertion that there are infinitely many positive integer\ntriples `(a, b, c)` for which the four symmetric expressions\n`a + b + c`, `a * b + a * c + b * c`, `a ^ 2 + b ^ 2 + c ^ 2`, and\n`a * b * c` are perfect squares.\n\nThe target is stated as a `Prop`-valued definition, not proved here.\n-/\n\nnamespace Problem\n\n/-- A natural number is a perfect square when it is the square of a natural\nnumber. This is the natural-number version of \"perfect square\" relevant to\nthe four expressions in the problem. -/\ndef IsPerfectSquare (n : ℕ) : Prop :=\n ∃ k : ℕ, n = k ^ 2\n\n/-- The admissibility predicate for a positive integer triple `(a,b,c)`: all\nthree entries are positive and each of the four specified expressions is a\nperfect square. -/\ndef AdmissibleTriple (a b c : ℕ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n IsPerfectSquare (a + b + c) ∧\n IsPerfectSquare (a * b + a * c + b * c) ∧\n IsPerfectSquare (a ^ 2 + b ^ 2 + c ^ 2) ∧\n IsPerfectSquare (a * b * c)\n\n/-- The set of admissible ordered positive integer triples. -/\ndef SolutionSet : Set (ℕ × ℕ × ℕ) :=\n {p | AdmissibleTriple p.1 p.2.1 p.2.2}\n\n/-- The target assertion: the set of admissible triples is infinite. -/\ndef Target : Prop :=\n Set.Infinite SolutionSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa9d9c5b-d766-56e1-a3a4-e14cc94fcf75", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "633f5c2fd19c298ac3de0d38348e8ffc0f45d8a0f373a22731dca8e8e2e1b84b", "task_path": "tasks/nmp3_aa9d9c5b-d766-56e1-a3a4-e14cc94fcf75", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aa9d9c5b-d766-56e1-a3a4-e14cc94fcf75", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aac43bba-86b7-5e3d-8750-838a644d5c2c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any integer $n\\ge 3$, a set of $n$ points in the plane that are not all collinear determines at least $n$ distinct straight lines.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Basic\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\n/-!\n# The Sylvester-Gallai counting bound\n\nThis file formalizes the statement of the problem: every non-collinear finite point\nset in the real Euclidean plane with at least three points determines at least as\nmany distinct straight lines as it has points.\n-/\n\nnamespace Problem\n\n/-- The ambient real Euclidean plane, represented by two real coordinates. -/\nabbrev PlanePoint : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A straight line determined by a finite point set: an affine span of two distinct\npoints of the set. -/\ndef IsDeterminedLine (S : Finset PlanePoint)\n (L : AffineSubspace ℝ PlanePoint) : Prop :=\n ∃ p ∈ S, ∃ q ∈ S, p ≠ q ∧ L = affineSpan ℝ ({p, q} : Set PlanePoint)\n\n/-- The finite set of distinct straight lines determined by two distinct points of\n`S`. Ordering of the chosen pair is forgotten by taking an image in a finset. -/\nnoncomputable def determinedLines (S : Finset PlanePoint) :\n Finset (AffineSubspace ℝ PlanePoint) := by\n classical\n exact (S ×ˢ S).filter (fun pq => pq.1 ≠ pq.2) |>.image\n (fun pq => affineSpan ℝ ({pq.1, pq.2} : Set PlanePoint))\n\n/-- Membership in `determinedLines` is exactly the predicate of being an affine span\nof two distinct points of the set. -/\ntheorem mem_determinedLines_iff (S : Finset PlanePoint)\n (L : AffineSubspace ℝ PlanePoint) :\n L ∈ determinedLines S ↔ IsDeterminedLine S L := by\n classical\n change L ∈ ((S ×ˢ S).filter (fun pq => pq.1 ≠ pq.2)).image\n (fun pq => affineSpan ℝ ({pq.1, pq.2} : Set PlanePoint)) ↔\n IsDeterminedLine S L\n rw [IsDeterminedLine]\n simp only [Finset.mem_image, Finset.mem_filter, Finset.mem_product, Prod.exists]\n constructor\n · rintro ⟨p, q, ⟨⟨hp, hq⟩, hpq⟩, hL⟩\n exact ⟨p, hp, q, hq, hpq, hL.symm⟩\n · rintro ⟨p, hp, q, hq, hpq, hL⟩\n exact ⟨p, q, ⟨⟨hp, hq⟩, hpq⟩, hL.symm⟩\n\n/-- For every integer `n ≥ 3`, every set of `n` points in the real Euclidean\nplane that is not collinear determines at least `n` distinct straight lines. -/\ndef Target : Prop :=\n ∀ (n : ℤ) (S : Finset PlanePoint),\n (3 : ℤ) ≤ n →\n (S.card : ℤ) = n →\n ¬ Collinear ℝ (S : Set PlanePoint) →\n n ≤ ((determinedLines S).card : ℤ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aac43bba-86b7-5e3d-8750-838a644d5c2c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a8fe006c2cdd23c624fbedd078ee2a17d0ebe35c5c70add49e0f7a27ff386dde", "task_path": "tasks/nmp3_aac43bba-86b7-5e3d-8750-838a644d5c2c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aac43bba-86b7-5e3d-8750-838a644d5c2c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aaceaeb9-e8f9-575d-9e77-c5df560bd7e6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$ and $c$ be non‑negative numbers such that $ab+ac+bc\\neq0$. Prove that \n-- \\[\n-- \\frac{a^{2}}{\\sqrt{\\,b^{2}-bc+c^{2}\\,}}+\\frac{b^{2}}{\\sqrt{\\,a^{2}-ac+c^{2}\\,}}+\\frac{c^{2}}{\\sqrt{\\,a^{2}-ab+b^{2}\\,}}\\ge a+b+c\\;.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the three-variable square-root inequality\n\nThe source problem asks to prove an inequality for non-negative real numbers\n`a`, `b`, and `c` satisfying `a*b + a*c + b*c ≠ 0`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The pairwise-product condition `ab + ac + bc ≠ 0`. -/\ndef PairwiseProductSumNonzero (a b c : ℝ) : Prop :=\n a * b + a * c + b * c ≠ 0\n\n/-- The admissibility hypotheses of the problem: `a`, `b`, and `c` are\nnon-negative and `ab + ac + bc ≠ 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ PairwiseProductSumNonzero a b c\n\n/-- The left-hand side of the asserted inequality. -/\ndef LeftSide (a b c : ℝ) : ℝ :=\n a ^ 2 / Real.sqrt (b ^ 2 - b * c + c ^ 2) +\n b ^ 2 / Real.sqrt (a ^ 2 - a * c + c ^ 2) +\n c ^ 2 / Real.sqrt (a ^ 2 - a * b + b ^ 2)\n\n/-- The right-hand side of the asserted inequality. -/\ndef RightSide (a b c : ℝ) : ℝ :=\n a + b + c\n\n/-- The complete mathematical assertion of the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n PairwiseProductSumNonzero a b c →\n LeftSide a b c ≥ RightSide a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aaceaeb9-e8f9-575d-9e77-c5df560bd7e6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "959b51bb1a96a3948837f8c6658d6b294406b8faf8071199f74dc88f9979c4f3", "task_path": "tasks/nmp3_aaceaeb9-e8f9-575d-9e77-c5df560bd7e6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aaceaeb9-e8f9-575d-9e77-c5df560bd7e6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aadffecc-f3e6-590c-a5dd-219501d0327d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For a finite set X of positive integers define \n-- \\[\n-- \\Sigma(X)=\\sum_{x\\in X}\\arctan\\frac1x.\n-- \\] \n-- Given a finite set S of positive integers with \\(\\Sigma(S)<\\frac{\\pi}{2}\\), prove that there exists a finite set T of positive integers such that \\(S\\subset T\\) and \\(\\Sigma(T)=\\frac{\\pi}{2}\\).\nimport Mathlib\n\n/-!\n# Formal statement of the arctangent-extension problem\n\nThe problem concerns finite sets of positive integers. A finite set is\nrepresented by `Finset ℕ`; the positivity condition is packaged in the\nsubtype `PositiveIntegerFinset`, so that `Sigma` is only applied to sets for\nwhich `1 / x` is the reciprocal of a positive integer.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The type of finite sets of positive integers.\n\nA term consists of a `Finset ℕ` together with a proof that each of its\nelements is strictly positive. -/\ndef PositiveIntegerFinset : Type :=\n { X : Finset ℕ // ∀ x ∈ X, 0 < x }\n\n/-- For a finite set `X` of positive integers, `Sigma X` is\n`∑_{x ∈ X} arctan (1 / x)`, with the arctangent taken in radians. -/\nnoncomputable def Sigma (X : PositiveIntegerFinset) : ℝ :=\n ∑ x ∈ X.1, Real.arctan ((1 : ℝ) / (x : ℝ))\n\n/-- The assertion of the problem: every finite set `S` of positive integers\nwhose arctangent sum is less than `π / 2` is properly contained in a finite set\n`T` of positive integers whose arctangent sum is exactly `π / 2`. -/\ndef Target : Prop :=\n ∀ S : PositiveIntegerFinset,\n Sigma S < Real.pi / 2 →\n ∃ T : PositiveIntegerFinset,\n S.1 ⊂ T.1 ∧ Sigma T = Real.pi / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aadffecc-f3e6-590c-a5dd-219501d0327d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f55fbe4bbb376d24ffb7e29696af674bcc269399eb9fe1fcbf40341da8b58a80", "task_path": "tasks/nmp3_aadffecc-f3e6-590c-a5dd-219501d0327d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aadffecc-f3e6-590c-a5dd-219501d0327d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ab29716b-2226-52e6-ba7f-aff9a0344fc7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all triples of positive rational numbers $(a,b,c)$ such that the three numbers $a+\\frac{c}{b}$, $b+\\frac{a}{c}$, and $c+\\frac{b}{a}$ are all integers.\nimport Mathlib.Data.Rat.Defs\n\n/-!\n# Formalization of an algebraic classification problem\n\nThe source problem asks for all triples `(a, b, c)` of positive rational\nnumbers for which the three cyclic expressions `a + c / b`, `b + a / c`,\nand `c + b / a` are integers.\n\nThis file records the admissibility predicate for a proposed triple, the\nproposed complete answer, and the statement that the proposed answer is\ncomplete in both directions. It deliberately contains no proof of the\nclassification.\n-/\n\nnamespace Problem\n\n/-- A rational number is an integer when it is the cast of some integer. -/\ndef IsInteger (q : ℚ) : Prop :=\n ∃ z : ℤ, q = (z : ℚ)\n\n/--\nA triple `(a, b, c)` of rational numbers is admissible when all three\nentries are positive and the three displayed cyclic expressions are\nintegers.\n-/\ndef Admissible (a b c : ℚ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n IsInteger (a + c / b) ∧\n IsInteger (b + a / c) ∧\n IsInteger (c + b / a)\n\n/--\nThe proposed complete answer: exactly the positive integral diagonal\ntriples `(n, n, n)`.\n-/\ndef Answer (a b c : ℚ) : Prop :=\n ∃ n : ℕ, 0 < n ∧ a = (n : ℚ) ∧ b = (n : ℚ) ∧ c = (n : ℚ)\n\n/-- A predicate on rational triples is a complete answer precisely when it\nholds exactly for the admissible triples (both directions). -/\ndef IsCompleteAnswer (P : ℚ → ℚ → ℚ → Prop) : Prop :=\n ∀ a b c : ℚ, Admissible a b c ↔ P a b c\n\n/-- The proposed diagonal answer is complete. -/\ndef AnswerCorrect : Prop :=\n IsCompleteAnswer Answer\n\n/-- The target proposition of the source problem, stated directly as both\ndirections of the complete classification of all admissible triples. -/\ndef Target : Prop :=\n ∀ a b c : ℚ, Admissible a b c ↔ Answer a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab29716b-2226-52e6-ba7f-aff9a0344fc7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c0db0606c5f1d3825f3fca2c7a0ff76eece727da7ea24751e6a8760d0871e29f", "task_path": "tasks/nmp3_ab29716b-2226-52e6-ba7f-aff9a0344fc7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab29716b-2226-52e6-ba7f-aff9a0344fc7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ab3bb365-6814-5161-9475-5a054e4540bf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{a}{b^{2}+c^{2}+a}+\\frac{b}{c^{2}+a^{2}+b}+\\frac{c}{a^{2}+b^{2}+c}\\le 1.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The three strict positivity hypotheses from the problem, in the source order. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The product hypothesis `abc = 1` from the problem. -/\ndef ProductOne (a b c : ℝ) : Prop :=\n a * b * c = (1 : ℝ)\n\n/-- The left-hand side of the inequality in the problem. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a / (b ^ 2 + c ^ 2 + a) +\n b / (c ^ 2 + a ^ 2 + b) +\n c / (a ^ 2 + b ^ 2 + c)\n\n/-- The inequality conclusion from the problem, for a fixed triple `a`, `b`, `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ (1 : ℝ)\n\n/-- The assertion to be proved: for all positive real numbers `a`, `b`, and `c`\nwith `abc = 1`, the stated sum is at most one. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Positive a b c → ProductOne a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab3bb365-6814-5161-9475-5a054e4540bf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "58aac9246cf8113e75a658467cc4dae5c20d21903fce820445fa900a5d10cd8d", "task_path": "tasks/nmp3_ab3bb365-6814-5161-9475-5a054e4540bf", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab3bb365-6814-5161-9475-5a054e4540bf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ab3f536f-2e88-546c-843a-d6aef87418c2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb{R}\\to\\mathbb{R}$ be a function satisfying \n-- 1. $f(1)=1$, \n-- 2. $f(a+b)=f(a)+f(b)$ for all $a,b\\in\\mathbb{R}$, \n-- 3. $f(x)\\,f\\!\\big(\\frac{1}{x}\\big)=1$ for all $x\\neq0$. \n-- \n-- Prove that $f(x)=x$ for every real $x$.\nimport Mathlib\n\n/-!\n# Formalization of the additive and reciprocal-preserving function problem\n\nThe source problem concerns functions `f : ℝ → ℝ` satisfying three hypotheses,\nand asks to prove that every such function is the identity.\n-/\n\nnamespace Problem\n\n/-- Hypothesis 1: the function takes the value one at one. -/\ndef ConditionOne (f : ℝ → ℝ) : Prop :=\n f (1 : ℝ) = (1 : ℝ)\n\n/-- Hypothesis 2: the function is additive on all of `ℝ`. -/\ndef ConditionTwo (f : ℝ → ℝ) : Prop :=\n ∀ a b : ℝ, f (a + b) = f a + f b\n\n/-- Hypothesis 3: the function preserves reciprocal multiplication on nonzero inputs. -/\ndef ConditionThree (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, x ≠ 0 → f x * f ((1 : ℝ) / x) = (1 : ℝ)\n\n/-- The admissibility predicate collecting the three hypotheses of the problem. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ConditionOne f ∧ ConditionTwo f ∧ ConditionThree f\n\n/-- The conclusion claimed by the source problem, for a fixed function. -/\ndef Conclusion (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, f x = x\n\n/-- The full assertion to be proved: every admissible function is the identity. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, Admissible f → Conclusion f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab3f536f-2e88-546c-843a-d6aef87418c2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "65feb961bec3656ca36f5da29f1f2363210dc7f7d3902e0e11dcf1c0c7bf7639", "task_path": "tasks/nmp3_ab3f536f-2e88-546c-843a-d6aef87418c2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab3f536f-2e88-546c-843a-d6aef87418c2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ab5209ae-0439-5259-8238-484df05f9154", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{(1+a)^2}+\\frac{1}{(1+b)^2}+\\frac{1}{(1+c)^2}+\\frac{1}{1+a+b+c}\\ge 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The numbers `a`, `b`, and `c` are positive real numbers whose product is `1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n 1 / (1 + a) ^ 2 + 1 / (1 + b) ^ 2 + 1 / (1 + c) ^ 2 +\n 1 / (1 + a + b + c)\n\n/-- The inequality assertion for a fixed admissible triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ 1\n\n/--\nFor every positive real triple `(a, b, c)` with `abc = 1`, the stated\nleft-hand side is at least `1`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab5209ae-0439-5259-8238-484df05f9154", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e4ffaa2ee4f7a3e8750e5520b478bcb0e2caf52d4784cefe113ffffe774a42f5", "task_path": "tasks/nmp3_ab5209ae-0439-5259-8238-484df05f9154", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab5209ae-0439-5259-8238-484df05f9154", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ab526697-0500-5e51-94e6-336a6127fdcb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\sqrt{\\frac{2a}{\\,b^2+c^2\\,}}+\\sqrt{\\frac{2b}{\\,c^2+a^2\\,}}+\\sqrt{\\frac{2c}{\\,a^2+b^2\\,}}\\ge \\frac{9}{ab+bc+ca}\\,.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The three positive real parameters are admissible when they are all positive\nand their product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n Real.sqrt ((2 : ℝ) * a / (b ^ (2 : ℕ) + c ^ (2 : ℕ))) +\n Real.sqrt ((2 : ℝ) * b / (c ^ (2 : ℕ) + a ^ (2 : ℕ))) +\n Real.sqrt ((2 : ℝ) * c / (a ^ (2 : ℕ) + b ^ (2 : ℕ)))\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n (9 : ℝ) / (a * b + b * c + c * a)\n\n/-- The displayed inequality, before imposing the admissibility hypotheses. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ RHS a b c\n\n/-- The full universally quantified statement of the problem: for all positive\nreal numbers `a`, `b`, and `c` with `a * b * c = 1`, the displayed non-strict\nreal inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab526697-0500-5e51-94e6-336a6127fdcb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0b723e46d02af119c09c6e0bda169428b80aee85301a2be2c987bda5a543445b", "task_path": "tasks/nmp3_ab526697-0500-5e51-94e6-336a6127fdcb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab526697-0500-5e51-94e6-336a6127fdcb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ab8e783a-18a3-5fbe-a82f-993197c456b1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\frac{a^3+b^3+c^3}{3abc}+\\frac{a(b+c)}{b^2+c^2}+\\frac{b(c+a)}{c^2+a^2}+\\frac{c(a+b)}{a^2+b^2}\\ge 4.\n-- \\]\nimport Mathlib.Data.Real.Basic\n\nnamespace Problem\n\n/-- The assertion that for all positive real numbers `a`, `b`, and `c`, the stated\nsum of rational expressions is at least `4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (a ^ 3 + b ^ 3 + c ^ 3) / (3 * a * b * c)\n + a * (b + c) / (b ^ 2 + c ^ 2)\n + b * (c + a) / (c ^ 2 + a ^ 2)\n + c * (a + b) / (a ^ 2 + b ^ 2)\n ≥ 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab8e783a-18a3-5fbe-a82f-993197c456b1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "98ef27aab291f7a3f60873a28f6d9f9362a01990d2273174fa2b19b8a64be858", "task_path": "tasks/nmp3_ab8e783a-18a3-5fbe-a82f-993197c456b1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab8e783a-18a3-5fbe-a82f-993197c456b1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ab919c78-a704-5d7c-aeee-8bc687ba4478", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For a positive integer $n$, let $\\tau(n)$ denote the number of its positive divisors. A positive integer $n$ is called **good** if $\\tau(m)<\\tau(n)$ for every integer $m$ with $1\\le m arr\n | e :: es, arr => runMoves es (applyMove arr e)\n\n/-- The final arrangement after a list of moves starting from the initial one. -/\ndef finalArrangement (moves : List (Fin 2006)) : Equiv.Perm (Fin 2006) :=\n runMoves moves initialArrangement\n\n/--\nA partition of `{1, ..., 2006}` into `1003` distinct unordered pairs.\nThe outer `Finset` records distinct unordered pairs; unique membership says\nthat every number occurs in exactly one member, and each member has two\nelements.\n-/\ndef PairPartition (P : Finset (Finset (Fin 2006))) : Prop :=\n P.card = 1003 ∧\n (∀ pair : Finset (Fin 2006), pair ∈ P → pair.card = 2) ∧\n (∀ x : Fin 2006, ∃! pair : Finset (Fin 2006), pair ∈ P ∧ x ∈ pair)\n\n/-- At the move along edge `e`, the two swapped occupants are a paired pair. -/\ndef pairSwappedAt (P : Finset (Finset (Fin 2006)))\n (arr : Equiv.Perm (Fin 2006)) (e : Fin 2006) : Prop :=\n {arr e, arr (nextPos e)} ∈ P\n\n/--\nAlong the given list of moves, beginning with arrangement `arr`, at least one\nmove swaps the two elements of one of the unordered pairs in `P`.\n-/\ndef someMoveSwapsPair (P : Finset (Finset (Fin 2006))) :\n List (Fin 2006) → Equiv.Perm (Fin 2006) → Prop\n | [], _ => False\n | e :: es, arr =>\n pairSwappedAt P arr e ∨ someMoveSwapsPair P es (applyMove arr e)\n\n/--\nThe arrangement after the list of moves is such that every number has moved\n13 positions clockwise from its initial position.\n-/\ndef endsAtClockwiseShift13 (moves : List (Fin 2006)) : Prop :=\n ∀ number : Fin 2006,\n (finalArrangement moves).symm number = clockwiseShift13 number\n\n/--\nFor every partition into `1003` unordered pairs and every sequence of circular\nadjacent swaps after which every number is 13 positions clockwise of its\ninitial position, at least one move swaps the two numbers of a pair.\n-/\ndef Target : Prop :=\n ∀ (P : Finset (Finset (Fin 2006))) (moves : List (Fin 2006)),\n PairPartition P →\n endsAtClockwiseShift13 moves →\n someMoveSwapsPair P moves initialArrangement\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab9b4ccf-83d6-52d2-8674-5f54ad2c79aa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fe3b0f50a579741fc578be49b35ae36416e8e6efe711ab332d773bd528236c3f", "task_path": "tasks/nmp3_ab9b4ccf-83d6-52d2-8674-5f54ad2c79aa", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ab9b4ccf-83d6-52d2-8674-5f54ad2c79aa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_abc5b497-dab5-54fc-b74f-6b4fadbe2017", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$, no two of which are zero. Prove that \n-- \\[\n-- \\frac{a(b+c)}{a^2+2bc}+\\frac{b(c+a)}{b^2+2ca}+\\frac{c(a+b)}{c^2+2ab}\\ge 1+\\frac{ab+bc+ca}{a^2+b^2+c^2}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the nonnegative three-variable inequality\n\nThe source problem asks to prove an inequality for nonnegative real numbers\n`a`, `b`, and `c`, with the condition that no two of them are both zero.\n-/\n\nnamespace Problem\n\n/-- The hypotheses of the problem: `a`, `b`, and `c` are nonnegative real\nnumbers and no pair among them consists of two zeros. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧\n ¬ (a = 0 ∧ b = 0) ∧\n ¬ (b = 0 ∧ c = 0) ∧\n ¬ (c = 0 ∧ a = 0)\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * (b + c) / (a ^ 2 + 2 * b * c) +\n b * (c + a) / (b ^ 2 + 2 * c * a) +\n c * (a + b) / (c ^ 2 + 2 * a * b)\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 1 + (a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The proposition asserted by the problem, for all admissible `a`, `b`, `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "abc5b497-dab5-54fc-b74f-6b4fadbe2017", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "add48e085e9df69f5979f27d2df89cd8ee6ad899575e021193096d13cdf21107", "task_path": "tasks/nmp3_abc5b497-dab5-54fc-b74f-6b4fadbe2017", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "abc5b497-dab5-54fc-b74f-6b4fadbe2017", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_abc81992-19e2-522b-b712-3f0ff2fc415a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\sqrt{\\frac{3a^{2}}{7a^{2}+5(b+c)^{2}}}\\le 1,\n-- \\] \n-- i.e. \n-- \\[\n-- \\sqrt{\\frac{3a^{2}}{7a^{2}+5(b+c)^{2}}}+\\sqrt{\\frac{3b^{2}}{7b^{2}+5(c+a)^{2}}}+\\sqrt{\\frac{3c^{2}}{7c^{2}+5(a+b)^{2}}}\\le 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The cyclic summand\n`sqrt (3 * a ^ 2 / (7 * a ^ 2 + 5 * (b + c) ^ 2))`. -/\nnoncomputable def summand (a b c : ℝ) : ℝ :=\n Real.sqrt ((3 : ℝ) * a ^ 2 / ((7 : ℝ) * a ^ 2 + (5 : ℝ) * (b + c) ^ 2))\n\n/-- The left-hand side of the cyclic inequality, written out explicitly. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n summand a b c + summand b c a + summand c a b\n\n/-- For all positive real numbers `a`, `b`, and `c`, the cyclic sum of the\nthree displayed square-root terms is at most `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → cyclicSum a b c ≤ (1 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "abc81992-19e2-522b-b712-3f0ff2fc415a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4c7b94eb12cb4a09b7d4f10a1d6897a5659a25fccd6f559fc067270735e3cc32", "task_path": "tasks/nmp3_abc81992-19e2-522b-b712-3f0ff2fc415a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "abc81992-19e2-522b-b712-3f0ff2fc415a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ac56551b-0830-5e5a-b9b2-43a422644092", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given real numbers $a,b,c\\ge 0$, with no two of them equal to $0$, prove that \n-- \\[\n-- \\frac{a^{3}(b+c)}{(a^{2}+bc)(b^{2}+c^{2})}+\\frac{b^{3}(c+a)}{(b^{2}+ca)(c^{2}+a^{2})}+\\frac{c^{3}(a+b)}{(c^{2}+ab)(a^{2}+b^{2})}\\ge \\frac{(a+b+c)^{2}}{2(ab+bc+ca)}\\,.\n-- \\]\n/-\nFormal statement of the inequality problem in `problem.md`.\n\nThe original problem asks to prove an inequality for nonnegative real numbers\n`a`, `b`, `c`, no two of which are both zero.\n-/\nimport Mathlib\n\nnamespace Problem\n\n/-- The three variables are all nonnegative real numbers. -/\ndef Nonnegative (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- No pair among `a`, `b`, `c` consists of two zero numbers. -/\ndef NoTwoZero (a b c : ℝ) : Prop :=\n ¬ (a = 0 ∧ b = 0) ∧ ¬ (b = 0 ∧ c = 0) ∧ ¬ (c = 0 ∧ a = 0)\n\n/-- The admissibility assumptions stated in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Nonnegative a b c ∧ NoTwoZero a b c\n\n/-- The left-hand side of the required inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 3 * (b + c) / ((a ^ 2 + b * c) * (b ^ 2 + c ^ 2)) +\n b ^ 3 * (c + a) / ((b ^ 2 + c * a) * (c ^ 2 + a ^ 2)) +\n c ^ 3 * (a + b) / ((c ^ 2 + a * b) * (a ^ 2 + b ^ 2))\n\n/-- The right-hand side of the required inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a + b + c) ^ 2 / (2 * (a * b + b * c + c * a))\n\n/-- The proposition asserted by the problem: for every admissible triple of real\nnumbers, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ (a : ℝ) (b : ℝ) (c : ℝ),\n Admissible a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ac56551b-0830-5e5a-b9b2-43a422644092", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "672f9152d78ebaf9d2724e88433271bbaf0dc82dc08d0ac4edcf36328fbf0245", "task_path": "tasks/nmp3_ac56551b-0830-5e5a-b9b2-43a422644092", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ac56551b-0830-5e5a-b9b2-43a422644092", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ac5da9f1-39a3-58b3-8edc-72a77cd91a4f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:[0,1]\\to[0,1]$ be a continuous function (hence $f$ has at least one fixed point). Define a sequence $(u_n)$ by choosing an arbitrary $u_1\\in[0,1]$ and, for each integer $n\\ge1$, setting \n-- $$u_{n+1}= \\Bigl(1-\\frac1n\\Bigr)u_n+\\frac1n\\,f(u_n).$$ \n-- Prove that $(u_n)$ converges to a fixed point of $f$, i.e. $\\displaystyle\\lim_{n\\to\\infty}u_n = x$ for some $x\\in[0,1]$ with $f(x)=x\\,. $\nimport Mathlib\n\n/-!\n# Formal statement\n\nThis file records the theorem stated in `problem.md`. The target is a\nproposition, not a proof: it says that every continuous self-map of the closed\nunit interval, together with every sequence satisfying the prescribed\none-step recursion from some initial point in the interval, converges to a\nfixed point of the map.\n\nThe original sequence is indexed by integers `n ≥ 1`. In Lean this is the\npositive natural number type `ℕ+` (definitionally `{n : ℕ // 0 < n}`), whose\norder and `atTop` filter express `n → ∞`.\n-/\n\nnamespace Problem\n\n/-- The closed unit interval `[0, 1]`, viewed as a subset of the real line. -/\ndef unitInterval : Set ℝ := Set.Icc (0 : ℝ) 1\n\n/-- A function on the reals represents a continuous function `[0,1] → [0,1]`\nwhen it is continuous on `[0,1]` and maps `[0,1]` over itself. -/\ndef IsContinuousSelfMap (f : ℝ → ℝ) : Prop :=\n ContinuousOn f unitInterval ∧ Set.MapsTo f unitInterval unitInterval\n\n/-- A real number is a fixed point in the domain `[0,1]` of `f`. -/\ndef IsFixedPoint (f : ℝ → ℝ) (x : ℝ) : Prop :=\n x ∈ unitInterval ∧ f x = x\n\n/-- The sequence is indexed by the positive natural numbers. Its initial\nvalue is `u₁`, and for every `n ≥ 1` it satisfies the recursion from the\nproblem. Here the division is real division: `n` is coerced from `ℕ+` to `ℝ`\nin the denominator. -/\ndef IsAdmissibleSequence (f : ℝ → ℝ) (u₁ : ℝ) (u : ℕ+ → ℝ) : Prop :=\n u 1 = u₁ ∧\n ∀ n : ℕ+,\n u (n + 1) =\n (1 - (1 : ℝ) / (n : ℝ)) * u n +\n ((1 : ℝ) / (n : ℝ)) * f (u n)\n\n/-- The complete assertion of the problem: for every continuous self-map\n`f : [0,1] → [0,1]`, every `u₁ ∈ [0,1]`, and every sequence satisfying the\nspecified recursion, the sequence converges in `ℝ` to some `x ∈ [0,1]` that is\na fixed point of `f`. -/\ndef Target : Prop :=\n ∀ (f : ℝ → ℝ),\n IsContinuousSelfMap f →\n ∀ (u₁ : ℝ), u₁ ∈ unitInterval →\n ∀ (u : ℕ+ → ℝ),\n IsAdmissibleSequence f u₁ u →\n ∃ x : ℝ, IsFixedPoint f x ∧ Filter.Tendsto u Filter.atTop (nhds x)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ac5da9f1-39a3-58b3-8edc-72a77cd91a4f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3fb418ed0b451404de4a85bc13c3b734aa5342a19cb393cafb54f349eb1cd8e1", "task_path": "tasks/nmp3_ac5da9f1-39a3-58b3-8edc-72a77cd91a4f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ac5da9f1-39a3-58b3-8edc-72a77cd91a4f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ac64ec72-e520-510e-8cc7-33b44e31828e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ be real numbers such that at most one of them is zero (i.e., no two of them are simultaneously zero). Prove that \n-- \\[\n-- \\frac{a^{2}}{a^{2}+ab+b^{2}}+\\frac{b^{2}}{b^{2}+bc+c^{2}}+\\frac{c^{2}}{c^{2}+ca+a^{2}}\\ge1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the real three-variable inequality\n\nThe source problem asks to prove an inequality in three nonnegative real numbers\nunder the condition that at most one of them is zero. The target is stated as\na proposition-valued definition; no proof is supplied here.\n-/\n\nnamespace Problem\n\n/-- At most one of `a`, `b`, and `c` is zero, expressed equivalently as the\ncondition that no two of the three numbers are simultaneously zero. -/\ndef AtMostOneZero (a b c : ℝ) : Prop :=\n ¬(a = 0 ∧ b = 0) ∧ ¬(b = 0 ∧ c = 0) ∧ ¬(c = 0 ∧ a = 0)\n\n/-- The admissibility assumptions of the problem: the three numbers are\nnonnegative and at most one of them is zero. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ AtMostOneZero a b c\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 2 / (a ^ 2 + a * b + b ^ 2) +\n b ^ 2 / (b ^ 2 + b * c + c ^ 2) +\n c ^ 2 / (c ^ 2 + c * a + a ^ 2)\n\n/-- The desired inequality for a fixed triple of real numbers. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ 1\n\n/-- The complete mathematical assertion of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ac64ec72-e520-510e-8cc7-33b44e31828e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8c8f565459a1ec0edd5abded96b5eb7578ab897e698807b1125c4f8b0c8faf9f", "task_path": "tasks/nmp3_ac64ec72-e520-510e-8cc7-33b44e31828e", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ac64ec72-e520-510e-8cc7-33b44e31828e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_acb1719c-f220-5e55-9924-6ce8e93ca672", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute triangle. Denote the side lengths by $a=BC$, $b=CA$, $c=AB$. \n-- Let $M$ be the midpoint of $BC$. \n-- Let $N$ be the trisection point of $AC$ that is nearer to $C$ (so $CN=\\frac{AC}{3}$ and $AN=\\frac{2AC}{3}$). \n-- Let $P$ be the intersection of ray $NM$ with line $AB$ (i.e. $P=NM\\cap AB$). \n-- Assume the angles satisfy \n-- \\[\n-- 2\\angle C\\;\\ge\\;\\angle PBM-\\angle PMB\\,.\n-- \\] \n-- Prove that \n-- \\[\n-- \\frac{c^{2}}{2}+\\frac{ab}{3}\\;\\ge\\;AM\\cdot BN\\,.\n-- \\]\nimport Mathlib.Geometry.Euclidean.Triangle\nimport Mathlib.LinearAlgebra.AffineSpace.Midpoint\nimport Mathlib.Analysis.Convex.Between\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the statement. Points of a real Euclidean\naffine space are represented by the vector space `EuclideanSpace ℝ (Fin 2)`. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The triangle `ABC` is acute: its three vertices are distinct and each of its\nthree (unoriented) interior angles is strictly smaller than a right angle. -/\ndef IsAcuteTriangle (A B C : Plane) : Prop :=\n A ≠ B ∧ B ≠ C ∧ C ≠ A ∧\n EuclideanGeometry.angle B A C < Real.pi / 2 ∧\n EuclideanGeometry.angle C B A < Real.pi / 2 ∧\n EuclideanGeometry.angle A C B < Real.pi / 2\n\n/-- `M` is the midpoint of the segment `BC`. -/\ndef IsMidpoint (M B C : Plane) : Prop :=\n M = midpoint ℝ B C\n\n/-- `N` is the trisection point of `AC` that is nearer to `C`. Equivalently,\n`N = C + (1 / 3) • (A - C)`, which places `N` on the segment `AC` with\n`CN = AC / 3` and `AN = 2 * AC / 3`. -/\ndef IsTrisectionNearC (A C N : Plane) : Prop :=\n N = C +ᵥ ((1 / 3 : ℝ) • (A -ᵥ C)) ∧\n dist C N = dist A C / 3 ∧\n dist A N = 2 * dist A C / 3\n\n/-- `X` lies on the ray starting at `N` and passing through `M`. The parameter\nis nonnegative, so `t = 0` gives `N` and `t = 1` gives `M`. -/\ndef InRayFromThrough (X N M : Plane) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ X = N +ᵥ (t • (M -ᵥ N))\n\n/-- `P` is the intersection of the ray `NM` with the line `AB`: it lies on both,\nand every point lying on both is equal to `P`. -/\ndef IsRayLineIntersection (A B N M P : Plane) : Prop :=\n InRayFromThrough P N M ∧\n P ∈ line[ℝ, A, B] ∧\n ∀ Q : Plane, InRayFromThrough Q N M → Q ∈ line[ℝ, A, B] → Q = P\n\n/-- The side `a = BC`. -/\ndef SideA (_A B C : Plane) : ℝ :=\n dist B C\n\n/-- The side `b = CA`. -/\ndef SideB (A _B C : Plane) : ℝ :=\n dist C A\n\n/-- The side `c = AB`. -/\ndef SideC (A B _C : Plane) : ℝ :=\n dist A B\n\n/-- The inequality asserted by the problem, with the side lengths written in\nterms of the vertices and with the segment lengths rendered as Euclidean\ndistances. -/\ndef Inequality (A B C M N : Plane) : Prop :=\n (SideC A B C ^ 2) / 2 + (SideA A B C * SideB A B C) / 3 ≥\n (dist A M) * (dist B N)\n\n/-- The full statement: for every acute triangle `ABC`, with `M` the midpoint of\n`BC`, `N` the trisection point of `AC` nearer to `C`, and `P` the intersection of\nray `NM` with line `AB`, if `2∠C ≥ ∠PBM - ∠PMB`, then\n`c²/2 + ab/3 ≥ AM * BN`. -/\ndef Target : Prop :=\n ∀ A B C : Plane,\n IsAcuteTriangle A B C →\n ∀ M : Plane,\n IsMidpoint M B C →\n ∀ N : Plane,\n IsTrisectionNearC A C N →\n ∀ P : Plane,\n IsRayLineIntersection A B N M P →\n (2 * EuclideanGeometry.angle A C B ≥\n EuclideanGeometry.angle P B M - EuclideanGeometry.angle P M B) →\n Inequality A B C M N\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "acb1719c-f220-5e55-9924-6ce8e93ca672", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7a1577ad5071c3fabd561e3bca16f3c7b01476d3ce62df0ce29d6e0652fb8c8f", "task_path": "tasks/nmp3_acb1719c-f220-5e55-9924-6ce8e93ca672", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "acb1719c-f220-5e55-9924-6ce8e93ca672", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_acbe1574-d30f-5714-867a-a82868f5f2e6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be non‑negative real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\sqrt{a^{3}+2bc}+\\sqrt{b^{3}+2ca}+\\sqrt{c^{3}+2ab}\\ge 3\\sqrt{3}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the claimed inequality for nonnegative reals `a`, `b`, and `c`. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n Real.sqrt (a ^ 3 + 2 * b * c) +\n Real.sqrt (b ^ 3 + 2 * c * a) +\n Real.sqrt (c ^ 3 + 2 * a * b)\n\n/-- The right-hand side of the claimed inequality. -/\nnoncomputable def rightHandSide : ℝ :=\n 3 * Real.sqrt 3\n\n/-- The assertion stated in the problem: for all nonnegative real numbers `a`, `b`, and `c`\nwith `a + b + c = 3`, the given square-root sum is at least `3 * sqrt 3`. -/\nnoncomputable def Target : Prop :=\n ∀ (a b c : ℝ),\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a + b + c = 3 →\n leftHandSide a b c ≥ rightHandSide\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "acbe1574-d30f-5714-867a-a82868f5f2e6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1b1677ac29d6ba167a9315c575aa107868c2ecd1b01036d6b93f24b8061b21fd", "task_path": "tasks/nmp3_acbe1574-d30f-5714-867a-a82868f5f2e6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "acbe1574-d30f-5714-867a-a82868f5f2e6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_acd61cd2-3bdd-519a-9a3c-268c174162bb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A convex quadrilateral $ABCD$ satisfies $AB\\cdot CD = BC\\cdot DA$. Point $X$ lies inside $ABCD$ such that \n-- \\[\n-- \\angle XAB = \\angle XCD\\qquad\\text{and}\\qquad \\angle XBC = \\angle XDA .\n-- \\]\n-- Prove that \n-- \\[\n-- \\angle BXA + \\angle DXC = 180^\\circ .\n-- \\]\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Analysis.Convex.Basic\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Topology.Algebra.Module.FiniteDimension\n\nnoncomputable section\n\nopen Set\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane used for the problem. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The signed area (two-dimensional determinant) of two displacement vectors. -/\ndef cross (u v : Plane) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- `A`, `B`, `C`, and `D` are the vertices, in that cyclic order, of a strictly\nconvex nondegenerate quadrilateral. The four consecutive triples all have the\nsame strict orientation. -/\ndef ConvexQuadrilateral (A B C D : Plane) : Prop :=\n (0 < cross (B - A) (C - B) ∧\n 0 < cross (C - B) (D - C) ∧\n 0 < cross (D - C) (A - D) ∧\n 0 < cross (A - D) (B - A)) ∨\n (cross (B - A) (C - B) < 0 ∧\n cross (C - B) (D - C) < 0 ∧\n cross (D - C) (A - D) < 0 ∧\n cross (A - D) (B - A) < 0)\n\n/-- `X` lies in the topological interior of the convex hull of the four vertices,\ni.e. strictly inside the quadrilateral (not on its boundary). -/\ndef StrictlyInside (A B C D X : Plane) : Prop :=\n X ∈ interior (convexHull ℝ ({A, B, C, D} : Set Plane))\n\n/-- The side-length product condition `AB * CD = BC * DA`. -/\ndef SideProductCondition (A B C D : Plane) : Prop :=\n dist A B * dist C D = dist B C * dist D A\n\n/-- The two angle equalities from the problem. -/\ndef AngleConditions (A B C D X : Plane) : Prop :=\n EuclideanGeometry.angle X A B = EuclideanGeometry.angle X C D ∧\n EuclideanGeometry.angle X B C = EuclideanGeometry.angle X D A\n\n/-- The desired conclusion `∠BXA + ∠DXC = 180°`, with angles measured in radians. -/\ndef Conclusion (A B C D X : Plane) : Prop :=\n EuclideanGeometry.angle B X A + EuclideanGeometry.angle D X C = Real.pi\n\n/-- All hypotheses of the problem for a fixed tuple of points. -/\ndef Premises (A B C D X : Plane) : Prop :=\n ConvexQuadrilateral A B C D ∧\n StrictlyInside A B C D X ∧\n SideProductCondition A B C D ∧\n AngleConditions A B C D X\n\n/-- The complete universally quantified assertion to be proved. -/\ndef Target : Prop :=\n ∀ A B C D X : Plane, Premises A B C D X → Conclusion A B C D X\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "acd61cd2-3bdd-519a-9a3c-268c174162bb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "34ef8e2052d5c68f87c7bcda6e40e3b9573f76067036da445725613e842cfb7b", "task_path": "tasks/nmp3_acd61cd2-3bdd-519a-9a3c-268c174162bb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "acd61cd2-3bdd-519a-9a3c-268c174162bb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ad158380-8415-56cc-90c8-a28ffe49baa9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb{Q}^+\\to\\mathbb{Q}^+$ satisfy \n-- \n-- \\[\n-- f(x+y)\\le f(x)+f(y)\\qquad\\text{for all }x,y\\in\\mathbb{Q}^+,\n-- \\]\n-- \n-- \\[\n-- f(xy)=f(x)f(y)\\qquad\\text{for all }x,y\\in\\mathbb{Q}^+,\n-- \\]\n-- \n-- and $f(2000)=1$. Prove that $f(2004)\\le 1$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The positive rationals, represented as rational numbers strictly greater than zero. -/\nabbrev QPos : Type := {q : ℚ // 0 < q}\n\nnamespace QPos\n\n/-- Addition of positive rationals. -/\ndef add (x y : QPos) : QPos :=\n ⟨x.1 + y.1, add_pos x.2 y.2⟩\n\n/-- Multiplication of positive rationals. -/\ndef mul (x y : QPos) : QPos :=\n ⟨x.1 * y.1, mul_pos x.2 y.2⟩\n\n/-- The positive rational `1`. -/\ndef one : QPos :=\n ⟨1, by norm_num⟩\n\n/-- The positive rational represented by a positive natural number. -/\ndef ofNat (n : ℕ) (hn : 0 < n) : QPos :=\n ⟨(n : ℚ), by exact_mod_cast hn⟩\n\nend QPos\n\n/-- Subadditivity of a map from the positive rationals to themselves. -/\ndef Subadditive (f : QPos → QPos) : Prop :=\n ∀ x y : QPos, (f (QPos.add x y)).1 ≤ (f x).1 + (f y).1\n\n/-- Multiplicativity of a map from the positive rationals to themselves. -/\ndef Multiplicative (f : QPos → QPos) : Prop :=\n ∀ x y : QPos, f (QPos.mul x y) = QPos.mul (f x) (f y)\n\n/-- The positive rational `2000`. -/\ndef q2000 : QPos :=\n QPos.ofNat 2000 (by norm_num)\n\n/-- The positive rational `2004`. -/\ndef q2004 : QPos :=\n QPos.ofNat 2004 (by norm_num)\n\n/-- The full assertion of the problem: every subadditive and multiplicative\n`f : ℚ⁺ → ℚ⁺` with `f 2000 = 1` satisfies `f 2004 ≤ 1`. -/\ndef Target : Prop :=\n ∀ f : QPos → QPos,\n Subadditive f →\n Multiplicative f →\n f q2000 = QPos.one →\n (f q2004).1 ≤ (1 : ℚ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad158380-8415-56cc-90c8-a28ffe49baa9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a446a6180d48b0462a537194f9f47a33e29d084180b8c0fa51ce47cae215bfea", "task_path": "tasks/nmp3_ad158380-8415-56cc-90c8-a28ffe49baa9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad158380-8415-56cc-90c8-a28ffe49baa9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ad3ecab9-301a-5901-8919-be204bc0dc2c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given an integer $k>0$, prove that there exist infinitely many integer tuples $(a,b)$ such that $|a|>1$, $|b|>1$, and $ab+a+b$ divides $a^2+b^2+k$.\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nFor every positive integer `k`, there are infinitely many ordered pairs of\nintegers `(a, b)` with `|a| > 1`, `|b| > 1`, and\n`a * b + a + b ∣ a ^ 2 + b ^ 2 + k`.\n-/\n\nnamespace Problem\n\n/-- The admissibility predicate for an ordered pair of integers `(a, b)` at a\nfixed integer parameter `k`: both coordinates have absolute value greater than\none, and `a * b + a + b` divides `a ^ 2 + b ^ 2 + k`. -/\ndef Admissible (k a b : ℤ) : Prop :=\n |a| > 1 ∧ |b| > 1 ∧ (a * b + a + b) ∣ (a ^ 2 + b ^ 2 + k)\n\n/-- The set of all admissible ordered pairs of integers for a fixed `k`. -/\ndef AdmissiblePairs (k : ℤ) : Set (ℤ × ℤ) :=\n {p | Admissible k p.1 p.2}\n\n/-- For every positive integer `k`, the set of admissible ordered pairs of\nintegers is infinite. -/\ndef Target : Prop :=\n ∀ k : ℤ, 0 < k → (AdmissiblePairs k).Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad3ecab9-301a-5901-8919-be204bc0dc2c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8e486cf8ee2c9702429a2f0e161380833a314ca78835105ef8cd02a79890d4a0", "task_path": "tasks/nmp3_ad3ecab9-301a-5901-8919-be204bc0dc2c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad3ecab9-301a-5901-8919-be204bc0dc2c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ad4eeb81-0583-56db-a6d7-d13d415cf0c8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that the sequence \n-- \\[\n-- a_n=(n!-1)n!+1 = (n!)^2-n!+1\\qquad (n\\in\\mathbb{Z}_{>0})\n-- \\]\n-- contains infinitely many composite numbers; i.e., there are infinitely many positive integers \\(n\\) for which \\(a_n\\) is not prime.\nmodule\n\npublic import Mathlib.Data.Nat.Factorial.Basic\npublic import Mathlib.Data.Nat.Prime.Basic\npublic import Mathlib.Data.Set.Finite.Basic\npublic import Mathlib.Algebra.Order.Ring.Canonical\npublic import Mathlib.Algebra.Order.Group.Nat\n\n/-!\n# Formal statement: infinitely many non-prime terms of a factorial sequence\n\nThe source problem defines\n`a_n = (n! - 1) * n! + 1 = (n!)^2 - n! + 1`\nfor positive integers `n`, and asks us to prove that infinitely many of these\nterms are composite, explicitly clarified as infinitely many positive `n` for\nwhich `a_n` is not prime.\n\nThis file declares the sequence, the admissibility predicate, and the main\ntarget proposition. It contains no proof of the target.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The term `a_n`, written in the factored form displayed first in the source.\n\nThe domain is all natural numbers because the positivity condition `0 < n` is\nrecorded separately in `Admissible`; the value at `n = 0` is only a harmless\nextension of the auxiliary function and is not admitted by the target.\n-/\ndef a (n : ℕ) : ℕ :=\n (n.factorial - 1) * n.factorial + 1\n\n/-- The expanded form of the term displayed in the source. -/\ndef aExpanded (n : ℕ) : ℕ :=\n n.factorial ^ 2 - n.factorial + 1\n\n/-- The two displayed expressions define the same natural-number sequence. -/\ntheorem a_eq_aExpanded (n : ℕ) : a n = aExpanded n := by\n rw [a, aExpanded, tsub_one_mul, pow_two]\n\n/-- Admissibility of an index: `n` is a positive integer and the corresponding\nterm `a_n` is not prime.\n\nThe source explicitly identifies the sought composite terms with terms for\nwhich `a_n` is not prime (“i.e.”); following that clarification, the formal\npredicate uses `¬ Nat.Prime`. -/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧ ¬ Nat.Prime (a n)\n\n/-- The main proposition: there are infinitely many positive integers `n` such\nthat `a_n` is not prime. Infinitude is expressed as infinitude of the set of\nadmissible natural-number indices. -/\ndef Target : Prop :=\n Set.Infinite {n : ℕ | Admissible n}\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad4eeb81-0583-56db-a6d7-d13d415cf0c8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "682547986cde0a85af1700563b293e59b18c8bd4e65b75f6cc3f956c14e2050d", "task_path": "tasks/nmp3_ad4eeb81-0583-56db-a6d7-d13d415cf0c8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad4eeb81-0583-56db-a6d7-d13d415cf0c8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ad64e186-3ddf-56c7-a9df-917345663461", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive. Prove that \n-- \\[\n-- \\frac{y^2-yz+z^2}{3x^2+2(y-z)^2}+\\frac{z^2-zx+x^2}{3y^2+2(z-x)^2}+\\frac{x^2-xy+y^2}{3z^2+2(x-y)^2}\\ge 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-variable cyclic inequality\n\nThe original problem asks to prove a cyclic inequality for positive reals.\nThe assertion is represented as a proposition-valued definition; no proof is\nsupplied at this stage.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the cyclic inequality in the problem. -/\nnoncomputable def LeftHandSide (x y z : ℝ) : ℝ :=\n (y ^ 2 - y * z + z ^ 2) / (3 * x ^ 2 + 2 * (y - z) ^ 2) +\n (z ^ 2 - z * x + x ^ 2) / (3 * y ^ 2 + 2 * (z - x) ^ 2) +\n (x ^ 2 - x * y + y ^ 2) / (3 * z ^ 2 + 2 * (x - y) ^ 2)\n\n/-- For all positive real `x`, `y`, and `z`, the cyclic expression in the\nproblem is at least `1`. -/\ndef Target : Prop :=\n ∀ (x y z : ℝ), 0 < x → 0 < y → 0 < z → LeftHandSide x y z ≥ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad64e186-3ddf-56c7-a9df-917345663461", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c54490e16817589ec5549233f6a0a24435ee7b90ac0c57a9d6fe6959f0768316", "task_path": "tasks/nmp3_ad64e186-3ddf-56c7-a9df-917345663461", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad64e186-3ddf-56c7-a9df-917345663461", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ad667a03-db59-5407-b9fe-dd3398a98738", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(p\\) and \\(q\\) be odd primes such that \n-- \n-- 1. \\(2\\) is a quadratic non‑residue modulo \\(q\\) (i.e. \\(\\left(\\frac{2}{q}\\right)=-1\\)), and \n-- 2. \\(\\displaystyle \\frac{q^{\\,p-1}-1}{p}\\) is a perfect square integer. \n-- \n-- Prove that \\((p,q)=(5,3)\\) (i.e. \\(p=5\\) and \\(q=3\\)).\nimport Mathlib.NumberTheory.LegendreSymbol.Basic\n\n/-!\n# Formal statement for the pair `(p, q) = (5, 3)` problem\n\nThe original problem asks to prove that the only odd primes `p` and `q` satisfying\n`(2 / q) = -1` and such that `(q ^ (p - 1) - 1) / p` is a perfect square\nare `p = 5` and `q = 3`.\n\nThis file only records the statement. It deliberately contains no proof of it.\n-/\n\nnamespace Problem\n\n/-- An integer is a perfect square exactly when it is the square of an integer. -/\ndef IsPerfectSquareInteger (n : ℤ) : Prop :=\n ∃ k : ℤ, n = k ^ 2\n\n/-- The exact integer value of `(q ^ (p - 1) - 1) / p`.\n\nThe divisibility condition in `QuotientIsPerfectSquareInteger` records that this\nfraction is an integer. Thus the division sign below is exact integer division,\nnot natural-number floor division and not division in a field. -/\ndef IntegerQuotient (p q : ℕ) : ℤ :=\n (((q : ℤ) ^ (p - 1) - 1) / (p : ℤ))\n\n/-- The second numbered hypothesis: `(q ^ (p - 1) - 1) / p` is an integer that is a\nperfect square. -/\ndef QuotientIsPerfectSquareInteger (p q : ℕ) : Prop :=\n (p : ℤ) ∣ ((q : ℤ) ^ (p - 1) - 1) ∧\n IsPerfectSquareInteger (IntegerQuotient p q)\n\n/-- The first numbered hypothesis, written as the Legendre-symbol condition\n`(2 / q) = -1`. The prime proof is an argument so that the Legendre symbol can use\nits `Fact q.Prime` instance. -/\ndef TwoIsQuadraticNonresidue (q : ℕ) (hq : q.Prime) : Prop :=\n @legendreSym q ⟨hq⟩ 2 = -1\n\n/-- The hypotheses of the problem for a pair of natural numbers `p` and `q`:\n`p` and `q` are odd primes, `2` is a quadratic non-residue modulo `q`, and\n`(q ^ (p - 1) - 1) / p` is a perfect-square integer.\n\nThis is a `Prop`-valued structure so that each original hypothesis has a named\nfield. The field `q_prime` is also the `Fact q.Prime` instance used by the\nLegendre-symbol field. -/\nstructure AdmissiblePair (p q : ℕ) : Prop where\n p_prime : p.Prime\n q_prime : q.Prime\n p_odd : Odd p\n q_odd : Odd q\n legendre_two : @legendreSym q ⟨q_prime⟩ 2 = -1\n quotient_square : QuotientIsPerfectSquareInteger p q\n\n/-- The original statement: every pair of odd primes satisfying the two displayed\nconditions has `p = 5` and `q = 3`. -/\ndef Target : Prop :=\n ∀ p q : ℕ, AdmissiblePair p q → p = 5 ∧ q = 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad667a03-db59-5407-b9fe-dd3398a98738", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ab145e63a199de16728d1f8310353a0909b152796d992cd30f107ca18f8e0504", "task_path": "tasks/nmp3_ad667a03-db59-5407-b9fe-dd3398a98738", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad667a03-db59-5407-b9fe-dd3398a98738", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ad6f4c39-d3cf-5225-9793-5ef58e6738ae", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) be the side lengths of a triangle (so \\(a+b>c,\\;b+c>a,\\;c+a>b\\)). Prove that \n-- \\[\n-- \\frac{a^{3}(a+b)}{a^{2}+b^{2}}+\\frac{b^{3}(b+c)}{b^{2}+c^{2}}+\\frac{c^{3}(c+a)}{c^{2}+a^{2}}\\;\\ge\\;a^{2}+b^{2}+c^{2}\\;.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The positivity assumptions on the three side lengths. -/\ndef PositiveSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The strict triangle inequality `a + b > c`. -/\ndef TriangleInequalityAB (a b c : ℝ) : Prop :=\n a + b > c\n\n/-- The strict triangle inequality `b + c > a`. -/\ndef TriangleInequalityBC (a b c : ℝ) : Prop :=\n b + c > a\n\n/-- The strict triangle inequality `c + a > b`. -/\ndef TriangleInequalityCA (a b c : ℝ) : Prop :=\n c + a > b\n\n/-- The three strict triangle inequalities listed in the problem. -/\ndef TriangleInequalities (a b c : ℝ) : Prop :=\n TriangleInequalityAB a b c ∧\n TriangleInequalityBC a b c ∧\n TriangleInequalityCA a b c\n\n/-- The admissibility predicate for `a`, `b`, and `c`: they are positive real\nnumbers satisfying the three strict triangle inequalities. -/\ndef TriangleSideLengths (a b c : ℝ) : Prop :=\n PositiveSideLengths a b c ∧ TriangleInequalities a b c\n\n/-- The first fraction in the left-hand side:\n`a^3 (a + b) / (a^2 + b^2)`. -/\nnoncomputable def FirstTerm (a b : ℝ) : ℝ :=\n a ^ (3 : ℕ) * (a + b) / (a ^ (2 : ℕ) + b ^ (2 : ℕ))\n\n/-- The second fraction in the left-hand side:\n`b^3 (b + c) / (b^2 + c^2)`. -/\nnoncomputable def SecondTerm (b c : ℝ) : ℝ :=\n b ^ (3 : ℕ) * (b + c) / (b ^ (2 : ℕ) + c ^ (2 : ℕ))\n\n/-- The third fraction in the left-hand side:\n`c^3 (c + a) / (c^2 + a^2)`. -/\nnoncomputable def ThirdTerm (c a : ℝ) : ℝ :=\n c ^ (3 : ℕ) * (c + a) / (c ^ (2 : ℕ) + a ^ (2 : ℕ))\n\n/-- The left-hand side of the claimed inequality, using real-valued powers and\ndivision. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n FirstTerm a b + SecondTerm b c + ThirdTerm c a\n\n/-- The right-hand side of the claimed inequality. -/\ndef RightHandSide (a b c : ℝ) : ℝ :=\n a ^ (2 : ℕ) + b ^ (2 : ℕ) + c ^ (2 : ℕ)\n\n/-- The claimed non-strict inequality, for arbitrary real `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LeftHandSide a b c ≥ RightHandSide a b c\n\n/-- The full assertion: for all real `a`, `b`, and `c`, if they are positive\nside lengths of a triangle, then the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, TriangleSideLengths a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad6f4c39-d3cf-5225-9793-5ef58e6738ae", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "76d6910e5d7c70a01baeec1aec4563d5fd5ff640bc26bbfa49f4c261319ff722", "task_path": "tasks/nmp3_ad6f4c39-d3cf-5225-9793-5ef58e6738ae", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad6f4c39-d3cf-5225-9793-5ef58e6738ae", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ad7c4039-1533-5b07-b559-401de37781ac", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Call a positive integer $n$ **special** if there exist non‑negative integers $a,b$ such that $n=2^{a}\\,3^{b}$. Prove that for any positive integer $k$, the interval $(k^{2},\\,k^{2}+2k+1)=(k^{2},\\,(k+1)^{2})$ contains at most two special numbers.\nimport Mathlib\n\nnamespace Problem\n\n/-- A positive integer is special when it is of the form `2 ^ a * 3 ^ b`\nfor some nonnegative integers `a` and `b`. -/\ndef Special (n : ℕ) : Prop :=\n 0 < n ∧ ∃ a b : ℕ, n = 2 ^ a * 3 ^ b\n\n/-- The finite set of special natural numbers in the open interval\n`(k ^ 2, (k + 1) ^ 2)`. -/\nnoncomputable def specialsInInterval (k : ℕ) : Finset ℕ := by\n classical\n exact (Finset.Ioo (k ^ 2) ((k + 1) ^ 2)).filter (fun n => Special n)\n\n/-- For every positive integer `k`, the open interval\n`(k ^ 2, k ^ 2 + 2 * k + 1) = (k ^ 2, (k + 1) ^ 2)` contains at most two\nspecial numbers. -/\ndef Target : Prop :=\n ∀ k : ℕ, 0 < k → (specialsInInterval k).card ≤ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad7c4039-1533-5b07-b559-401de37781ac", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "40ded2105047722312042b6d0c63b6199d8b15d73c57eaf0180a668259ed0230", "task_path": "tasks/nmp3_ad7c4039-1533-5b07-b559-401de37781ac", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad7c4039-1533-5b07-b559-401de37781ac", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ad94629d-d934-5dc7-bdb7-60c7286001c5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>3$ be an odd positive integer with prime factorization $n=\\displaystyle\\prod_{i=1}^{k}p_i^{\\alpha_i}$, where the $p_i$ are distinct primes and $\\alpha_i\\ge1$. Define \n-- \n-- \\[\n-- m=n\\prod_{i=1}^{k}\\Bigl(1-\\frac1{p_i}\\Bigr)=\\varphi(n).\n-- \\]\n-- \n-- Prove that there exists a prime $P$ such that $P\\mid 2^{m}-1$ but $P\\nmid n\\,. $\nimport Mathlib.Data.Nat.Totient\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The assertion that `n = ∏ i, (p i) ^ (α i)` is a prime factorization of `n`,\nwith all `p i` prime, pairwise distinct, and all exponents `α i` positive. -/\ndef IsPrimeFactorization (n k : ℕ) (p α : Fin k → ℕ) : Prop :=\n (∀ i : Fin k, Nat.Prime (p i)) ∧\n (∀ i j : Fin k, i ≠ j → p i ≠ p j) ∧\n (∀ i : Fin k, 1 ≤ α i) ∧\n n = ∏ i : Fin k, p i ^ α i\n\n/-- The expression `m = n ∏ᵢ (1 - 1 / pᵢ)`, interpreted in `ℚ` so that the\nreciprocals and the product are exact. -/\ndef TotientProduct (n k : ℕ) (p : Fin k → ℕ) (m : ℕ) : Prop :=\n (m : ℚ) = (n : ℚ) * ∏ i : Fin k, (1 - ((p i : ℚ))⁻¹)\n\n/-- For every odd integer `n > 3`, with a prime factorization\n`n = ∏ᵢ pᵢ ^ αᵢ` and with `m = n ∏ᵢ (1 - 1 / pᵢ) = φ(n)`, there is a prime\n`P` dividing `2 ^ m - 1` which does not divide `n`. -/\ndef Target : Prop :=\n ∀ (n k : ℕ) (p α : Fin k → ℕ) (m : ℕ),\n 3 < n →\n Odd n →\n IsPrimeFactorization n k p α →\n TotientProduct n k p m →\n m = Nat.totient n →\n ∃ P : ℕ,\n Nat.Prime P ∧\n P ∣ (2 ^ m - 1) ∧\n ¬ (P ∣ n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad94629d-d934-5dc7-bdb7-60c7286001c5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "81f052f591a618dbba974ccf18098bf422d978e07e805906181f839ffd045263", "task_path": "tasks/nmp3_ad94629d-d934-5dc7-bdb7-60c7286001c5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad94629d-d934-5dc7-bdb7-60c7286001c5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ad986df6-18e3-59cf-8818-b790d99828c9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots,a_n$ be positive real numbers such that $\\displaystyle\\sum_{i=1}^{n}a_i=1$, where the indices are taken cyclically (i.e. $a_{n+1}=a_1$). Prove that \n-- \\[\n-- \\Bigl(\\sum_{i=1}^{n}a_i a_{i+1}\\Bigr)\\Bigl(\\sum_{i=1}^{n}\\frac{a_i}{a_{i+1}^{2}+a_{i+1}}\\Bigr)\\ge\\frac{n}{\\,n+1\\,}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a cyclic inequality for positive real numbers\n\nThe source problem asks to prove an inequality for a finite positive real\nsequence whose terms sum to one and whose indices are interpreted cyclically.\nThe declarations below only state the proposition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The cyclic successor of an index `i : Fin n`, for positive `n`.\n\nFor `n = 1` this is the identity map. In general, the underlying natural\nnumber `(i.val + 1) % n` is the index `i + 1` with indices wrapped around\nafter `n - 1`. -/\ndef cyclicSucc {n : ℕ} (hn : 0 < n) (i : Fin n) : Fin n :=\n ⟨(i.val + 1) % n, Nat.mod_lt (i.val + 1) hn⟩\n\n/-- The hypotheses of the source problem: all terms are positive and their\nsum is exactly one. -/\ndef Admissible (n : ℕ) (_hn : 0 < n) (a : Fin n → ℝ) : Prop :=\n (∀ i : Fin n, 0 < a i) ∧ (∑ i : Fin n, a i = 1)\n\n/-- The first factor, `∑ᵢ aᵢ aᵢ₊₁`, with cyclic indexing. -/\ndef firstFactor (n : ℕ) (hn : 0 < n) (a : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, a i * a (cyclicSucc hn i)\n\n/-- The second factor,\n`∑ᵢ aᵢ / (aᵢ₊₁² + aᵢ₊₁)`, with cyclic indexing. -/\nnoncomputable def secondFactor (n : ℕ) (hn : 0 < n) (a : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, a i / ((a (cyclicSucc hn i)) ^ 2 + a (cyclicSucc hn i))\n\n/-- The right-hand side `n / (n + 1)`, coerced from natural `n` to a real\nnumber. -/\nnoncomputable def rightSide (n : ℕ) : ℝ :=\n (n : ℝ) / ((n : ℝ) + 1)\n\n/-- The asserted inequality for a fixed positive integer `n` and a fixed\nsequence `a : Fin n → ℝ`. -/\ndef Inequality (n : ℕ) (hn : 0 < n) (a : Fin n → ℝ) : Prop :=\n firstFactor n hn a * secondFactor n hn a ≥ rightSide n\n\n/-- The complete universally quantified statement of the source problem:\nfor every positive integer `n` and every positive real sequence `a` of length\n`n` summing to one, the cyclic product inequality holds. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (hn : 0 < n) (a : Fin n → ℝ),\n Admissible n hn a → Inequality n hn a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad986df6-18e3-59cf-8818-b790d99828c9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3a76b0a6b4d358ec0180a1c57ff9b379923b850e4d1c503734292bdb7ad0804f", "task_path": "tasks/nmp3_ad986df6-18e3-59cf-8818-b790d99828c9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ad986df6-18e3-59cf-8818-b790d99828c9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_adc59f05-616b-5b58-986e-bf8f5db46f8b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a bicentric quadrilateral (a convex quadrilateral that has both an incircle and a circumcircle). Denote by $I$ the center of its incircle, by $O$ the center of its circumcircle, and let $X=AC\\cap BD$ be the intersection point of its diagonals. Prove that $I$, $O$, and $X$ are collinear.\n/-\nFormal statement of the bicentric-quadrilateral theorem.\n\nThe ambient plane is the standard two-dimensional real Euclidean space. A point is\nsimply a point of that vector space; no separate affine point type is needed.\n\nNo theorem is proved here: `Problem.Target` is a proposition-valued definition\nwhose body is the statement to be proved.\n-/\n\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.Convex.Between\nimport Mathlib.Analysis.Convex.Topology\nimport Mathlib.Geometry.Euclidean.Sphere.Tangent\n\nnoncomputable section\n\nopen Set\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, identified with `ℝ².` -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The signed twice-area (determinant) of two plane vectors. -/\ndef det2 (u v : Plane) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/--\n`A`, `B`, `C`, `D` are the successive vertices of a strictly convex quadrilateral,\nin either clockwise or counterclockwise order. The four consecutive turns of the\nclosed polygon `A → B → C → D → A` all have the same strict sign. Equivalently,\nthe quadrilateral has no three collinear vertices, no zero side, and is simple and\nconvex with its vertices in the displayed order.\n-/\ndef IsConvexQuadrilateral (A B C D : Plane) : Prop :=\n A ≠ B ∧ A ≠ C ∧ A ≠ D ∧ B ≠ C ∧ B ≠ D ∧ C ≠ D ∧\n (((0 : ℝ) < det2 (B - A) (C - B) ∧\n (0 : ℝ) < det2 (C - B) (D - C) ∧\n (0 : ℝ) < det2 (D - C) (A - D) ∧\n (0 : ℝ) < det2 (A - D) (B - A)) ∨\n (det2 (B - A) (C - B) < 0 ∧\n det2 (C - B) (D - C) < 0 ∧\n det2 (D - C) (A - D) < 0 ∧\n det2 (A - D) (B - A) < 0))\n\n/-- A positive-radius sphere is an incircle of the quadrilateral `A B C D` when its\ncenter lies in the interior of the quadrilateral, and it is tangent to each side\nline at a point in the relative interior of the corresponding side segment. -/\ndef IsIncircle (s : EuclideanGeometry.Sphere Plane) (A B C D : Plane) : Prop :=\n 0 < s.radius ∧\n (∃ t : Plane, t ∈ openSegment ℝ A B ∧\n s.IsTangentAt t (affineSpan ℝ ({A, B} : Set Plane))) ∧\n (∃ t : Plane, t ∈ openSegment ℝ B C ∧\n s.IsTangentAt t (affineSpan ℝ ({B, C} : Set Plane))) ∧\n (∃ t : Plane, t ∈ openSegment ℝ C D ∧\n s.IsTangentAt t (affineSpan ℝ ({C, D} : Set Plane))) ∧\n (∃ t : Plane, t ∈ openSegment ℝ D A ∧\n s.IsTangentAt t (affineSpan ℝ ({D, A} : Set Plane))) ∧\n s.center ∈ interior (convexHull ℝ ({A, B, C, D} : Set Plane))\n\n/-- The quadrilateral `A B C D` has an incircle. -/\ndef HasIncircle (A B C D : Plane) : Prop :=\n ∃ s : EuclideanGeometry.Sphere Plane, IsIncircle s A B C D\n\n/-- `I` is the center of an incircle of `A B C D`. -/\ndef IsIncircleCenter (A B C D I : Plane) : Prop :=\n ∃ s : EuclideanGeometry.Sphere Plane, IsIncircle s A B C D ∧ s.center = I\n\n/-- A positive-radius sphere is a circumcircle of `A B C D` when all four vertices\nlie on it. -/\ndef IsCircumcircle (s : EuclideanGeometry.Sphere Plane) (A B C D : Plane) : Prop :=\n 0 < s.radius ∧ A ∈ s ∧ B ∈ s ∧ C ∈ s ∧ D ∈ s\n\n/-- The quadrilateral `A B C D` has a circumcircle. -/\ndef HasCircumcircle (A B C D : Plane) : Prop :=\n ∃ s : EuclideanGeometry.Sphere Plane, IsCircumcircle s A B C D\n\n/-- `O` is the center of a circumcircle of `A B C D`. -/\ndef IsCircumcircleCenter (A B C D O : Plane) : Prop :=\n ∃ s : EuclideanGeometry.Sphere Plane, IsCircumcircle s A B C D ∧ s.center = O\n\n/-- A bicentric quadrilateral is a convex quadrilateral possessing both an\nincircle and a circumcircle. -/\ndef IsBicentricQuadrilateral (A B C D : Plane) : Prop :=\n IsConvexQuadrilateral A B C D ∧ HasIncircle A B C D ∧ HasCircumcircle A B C D\n\n/-- `X` is the unique common point of the diagonal segments `AC` and `BD`. -/\ndef IsDiagonalIntersection (A B C D X : Plane) : Prop :=\n X ∈ segment ℝ A C ∧ X ∈ segment ℝ B D ∧\n ∀ Y : Plane, Y ∈ segment ℝ A C → Y ∈ segment ℝ B D → Y = X\n\n/-- The bicentric-quadrilateral theorem: the center `I` of an incircle, the center\n`O` of a circumcircle, and the intersection `X` of the diagonals are collinear. -/\ndef Target : Prop :=\n ∀ (A B C D : Plane),\n IsBicentricQuadrilateral A B C D →\n ∀ (I : Plane), IsIncircleCenter A B C D I →\n ∀ (O : Plane), IsCircumcircleCenter A B C D O →\n ∀ (X : Plane), IsDiagonalIntersection A B C D X →\n Collinear ℝ ({I, O, X} : Set Plane)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "adc59f05-616b-5b58-986e-bf8f5db46f8b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b98d57e2716dbd02287372767278f7aa8b90e963a981b5fec145852d8e637225", "task_path": "tasks/nmp3_adc59f05-616b-5b58-986e-bf8f5db46f8b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "adc59f05-616b-5b58-986e-bf8f5db46f8b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ae0a5d2b-997f-5390-9f40-ab9092b99a39", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be nonnegative real numbers such that $a+b+c>0$. Prove that \n-- \\[\n-- \\frac{bc}{(2a+b+3c)^2}+\\frac{ca}{(2b+c+3a)^2}+\\frac{ab}{(2c+a+3b)^2}\\le\\frac1{12}\\,. \n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the nonnegative-real inequality\n\nThe source problem asks to prove, for all nonnegative real numbers `a`, `b`, `c`\nwith positive sum, the given cyclic inequality. The declarations below record\nthat claim as a proposition; no proof is supplied in this statement-only task.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (b * c) / (2 * a + b + 3 * c) ^ 2 +\n (c * a) / (2 * b + c + 3 * a) ^ 2 +\n (a * b) / (2 * c + a + 3 * b) ^ 2\n\n/-- The source problem's hypotheses: `a`, `b`, and `c` are nonnegative and\ntheir sum is strictly positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a + b + c\n\n/-- The inequality asserted by the source problem, universally quantified over\nall admissible `a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≤ (1 : ℝ) / 12\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ae0a5d2b-997f-5390-9f40-ab9092b99a39", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "86fdca733838ab573374d206cdc87c838779a7308c8ab78cd9142083e695060a", "task_path": "tasks/nmp3_ae0a5d2b-997f-5390-9f40-ab9092b99a39", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ae0a5d2b-997f-5390-9f40-ab9092b99a39", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ae247c74-cfc7-558d-b569-fac2a1eb37e9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$ and $b$ be positive integers such that $|a-b|$ is a prime number. Prove that there exist infinitely many positive integers $n$ for which $(a^n + a + 1)(b^n + b + 1)$ is not a perfect square.\nimport Mathlib\n\n/-!\n# Formalization of an infinitude statement about non-square products\n\nThe source problem fixes positive natural numbers `a` and `b` whose absolute\ndifference is prime, and asks for infinitely many positive natural numbers `n`\nfor which `(a^n + a + 1) * (b^n + b + 1)` is not a perfect square.\n-/\n\nnamespace Problem\n\n/-- A natural number `N` is a perfect square if it is the square of a natural\nnumber. -/\ndef IsPerfectSquareNat (N : ℕ) : Prop :=\n ∃ m : ℕ, N = m ^ 2\n\n/-- The product appearing in the problem. -/\ndef ProductExpression (a b n : ℕ) : ℕ :=\n (a ^ n + a + 1) * (b ^ n + b + 1)\n\n/-- The product obtained at the index `n` is not a perfect square. -/\ndef ProductIsNotPerfectSquare (a b n : ℕ) : Prop :=\n ¬ IsPerfectSquareNat (ProductExpression a b n)\n\n/-- The assumptions on `a` and `b`: both are positive and their absolute\ndifference is prime. `Nat.dist a b` is the natural-number absolute difference\n`|a - b|`. -/\ndef PrimeDistancePositivePair (a b : ℕ) : Prop :=\n 0 < a ∧ 0 < b ∧ Nat.Prime (Nat.dist a b)\n\n/-- The complete assertion of the problem: for every pair of positive natural\nnumbers whose absolute difference is prime, there are infinitely many positive\nnatural indices `n` at which the product is not a perfect square. -/\ndef Target : Prop :=\n ∀ a b : ℕ, PrimeDistancePositivePair a b →\n Set.Infinite {n : ℕ | 0 < n ∧ ProductIsNotPerfectSquare a b n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ae247c74-cfc7-558d-b569-fac2a1eb37e9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "439ed66ef216a3f3c7634afac1167843c3bb8c4f442c1ff6cd2d771fa849ebdc", "task_path": "tasks/nmp3_ae247c74-cfc7-558d-b569-fac2a1eb37e9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ae247c74-cfc7-558d-b569-fac2a1eb37e9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ae38f887-bf8c-5596-9fcf-e457ee75fecd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any positive real numbers $a,b,c$, prove that\n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\ge 3+\\frac{6\\,(a-c)^2}{(a+b+c)^2}.\n-- \\]\nimport Mathlib\n\n/-!\nFormal statement of the inequality problem.\n\nFor all positive real numbers `a`, `b`, and `c`,\n`a / b + b / c + c / a ≥ 3 + 6 * (a - c)^2 / (a + b + c)^2`.\n-/\n\nnamespace Problem\n\n/-- The assertion stated in the problem.\n\nThe quantifier ranges over all real triples; the three hypotheses `0 < a`,\n`0 < b`, and `0 < c` express that `a`, `b`, and `c` are positive real\nnumbers. All divisions are division in `ℝ`, and `^ 2` is the natural-number\npower. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n a / b + b / c + c / a ≥\n 3 + (6 * (a - c) ^ 2) / (a + b + c) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ae38f887-bf8c-5596-9fcf-e457ee75fecd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1f9f9c03183db9a141ea1b1bde0584db35e2de21634f95106b8a366b8e91cda1", "task_path": "tasks/nmp3_ae38f887-bf8c-5596-9fcf-e457ee75fecd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ae38f887-bf8c-5596-9fcf-e457ee75fecd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ae4c7baf-5080-5119-b74c-df3a1123c0dc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers such that $ab+bc+ca=1$. Prove that \n-- \\[\n-- abc\\,(a+\\sqrt{a^{2}+1})\\,(b+\\sqrt{b^{2}+1})\\,(c+\\sqrt{c^{2}+1})\\le 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the given inequality problem\n\nThe original problem asks to prove a universal implication: for all positive\nreal numbers `a`, `b`, and `c` satisfying `ab + bc + ca = 1`, the displayed\nproduct is at most `1`.\n-/\n\nnamespace Problem\n\n/-- The assertion from the problem.\n\nFor all positive real numbers `a`, `b`, and `c` with\n`a * b + b * c + c * a = 1`, we have\n`a * b * c * (a + sqrt (a^2 + 1)) * (b + sqrt (b^2 + 1)) *\n(c + sqrt (c^2 + 1)) ≤ 1`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n a * b + b * c + c * a = 1 →\n a * b * c * (a + Real.sqrt (a ^ 2 + 1)) *\n (b + Real.sqrt (b ^ 2 + 1)) *\n (c + Real.sqrt (c ^ 2 + 1)) ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ae4c7baf-5080-5119-b74c-df3a1123c0dc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0f222708e64ae0c5916943331ab45a78da3460b0a4f1f33506c2ff7cee8bc103", "task_path": "tasks/nmp3_ae4c7baf-5080-5119-b74c-df3a1123c0dc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ae4c7baf-5080-5119-b74c-df3a1123c0dc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ae853e3f-b421-57a6-9f7a-bf4c0edb0380", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ satisfy $xy+yz+zx=1$. Prove that \n-- \\[\n-- \\frac1{\\sqrt{x^3+x}}+\\frac1{\\sqrt{y^3+y}}+\\frac1{\\sqrt{z^3+z}}\\ge\\frac9{2\\sqrt{x+y+z}}\\,.\n-- \\] \n-- (Equivalently $\\displaystyle\\sum_{cyc}\\frac1{\\sqrt{x(x+y)(x+z)}}\\ge\\frac9{2\\sqrt{x+y+z}}$.)\nimport Mathlib\n\n/-!\n# Formal statement for a cyclic radical inequality\n\nThe source problem assumes three positive real numbers whose pairwise\nproducts sum to one, and asks for a lower bound on a cyclic sum of\nreciprocals of square roots.\n\nThe primary displayed inequality is recorded by `Problem.Target`.\nThe parenthetical cyclic form is represented by `Problem.CyclicLHS`;\nunder `Problem.Admissible`, its terms are equal to the corresponding\nterms of `Problem.DisplayedLHS`, because\n`x ^ 3 + x = x * (x + y) * (x + z)` when\n`x * y + y * z + z * x = 1` (and cyclically).\n-/\n\nnamespace Problem\n\n/-- The strict positivity part of the hypotheses: all of `x`, `y`, and `z`\nare positive real numbers. -/\ndef Positive (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The pairwise-product constraint from the hypotheses:\n`x*y + y*z + z*x = 1`. -/\ndef Constraint (x y z : ℝ) : Prop :=\n x * y + y * z + z * x = 1\n\n/-- The full hypotheses of the problem: `x`, `y`, and `z` are positive and\nsatisfy `x*y + y*z + z*x = 1`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n Positive x y z ∧ Constraint x y z\n\n/-- The left-hand side of the displayed inequality:\n`1 / sqrt (x^3 + x) + 1 / sqrt (y^3 + y) + 1 / sqrt (z^3 + z)`. -/\nnoncomputable def DisplayedLHS (x y z : ℝ) : ℝ :=\n 1 / Real.sqrt (x ^ 3 + x) +\n 1 / Real.sqrt (y ^ 3 + y) +\n 1 / Real.sqrt (z ^ 3 + z)\n\n/-- The common right-hand side of both forms of the inequality:\n`9 / (2 * sqrt (x + y + z))`. -/\nnoncomputable def RHS (x y z : ℝ) : ℝ :=\n 9 / (2 * Real.sqrt (x + y + z))\n\n/-- The left-hand side of the parenthetical cyclic form:\n`sum_cyc 1 / sqrt (x * (x + y) * (x + z))`. -/\nnoncomputable def CyclicLHS (x y z : ℝ) : ℝ :=\n 1 / Real.sqrt (x * (x + y) * (x + z)) +\n 1 / Real.sqrt (y * (y + z) * (y + x)) +\n 1 / Real.sqrt (z * (z + x) * (z + y))\n\n/-- The assertion to be proved: for all positive real `x`, `y`, `z`\nsatisfying `x*y + y*z + z*x = 1`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n Admissible x y z →\n RHS x y z ≤ DisplayedLHS x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ae853e3f-b421-57a6-9f7a-bf4c0edb0380", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "80173eeeb40c4078188aee4e35cf22080775afb0884f7ae2b8fd7fc45d3f1b46", "task_path": "tasks/nmp3_ae853e3f-b421-57a6-9f7a-bf4c0edb0380", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ae853e3f-b421-57a6-9f7a-bf4c0edb0380", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ae93e80d-c70b-54f1-9cdc-3429ac099212", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb{R}\\to\\mathbb{R}$ satisfy $f(x+y+xy)=f(x)+f(y)+f(xy)$ for all real numbers $x,y$. Prove that $f(x+y)=f(x)+f(y)$ for all real $x,y$.\nimport Mathlib\n\n/-!\n# Formalization of the functional-equation problem\n\nThe source problem asks to prove that every real-valued function on the reals\nsatisfying\n`f (x + y + x*y) = f x + f y + f (x*y)` for all real `x`, `y`\nis additive, i.e. satisfies `f (x + y) = f x + f y` for all real `x`, `y`.\n\nThe target is stated as a proposition. No proof is supplied here.\n-/\n\nnamespace Problem\n\n/-- A function `f : ℝ → ℝ` satisfies the hypothesis functional equation of the problem:\nfor every real `x` and `y`,\n`f (x + y + x*y) = f x + f y + f (x*y)`. -/\ndef SatisfiesFunctionalEquation (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x + y + x * y) = f x + f y + f (x * y)\n\n/-- A function `f : ℝ → ℝ` is additive on the real numbers:\nfor every real `x` and `y`, `f (x + y) = f x + f y`. -/\ndef AdditiveOnReal (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x + y) = f x + f y\n\n/-- The concrete statement to be proved: every function from `ℝ` to `ℝ` satisfying\n`f (x + y + x*y) = f x + f y + f (x*y)` for all real `x`, `y` is additive. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, SatisfiesFunctionalEquation f → AdditiveOnReal f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ae93e80d-c70b-54f1-9cdc-3429ac099212", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "be6dbcf28895f252db04c6c8b9405f02852eb82d15aa146c6c2fe2d5fc5795a5", "task_path": "tasks/nmp3_ae93e80d-c70b-54f1-9cdc-3429ac099212", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ae93e80d-c70b-54f1-9cdc-3429ac099212", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aeac0362-e1cd-5267-99f7-d9d1fb8bf9dc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given three real numbers $a,b,c$ satisfying $ab+bc+ca=3$, prove that \n-- \\[\n-- 0\\le \\frac{a+1}{a^{2}-a+1}+\\frac{b+1}{b^{2}-b+1}+\\frac{c+1}{c^{2}-c+1}\\le6.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable rational inequality\n\nThe source problem asks us to prove a two-sided bound for a symmetric sum of\nfractions, under the constraint `ab + bc + ca = 3` on three real variables.\nThis file records the statement only; it does not supply a proof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- One summand of the expression in the problem. -/\ndef summand (x : ℝ) : ℝ :=\n (x + 1) / (x ^ 2 - x + 1)\n\n/-- The left-hand side of the claimed two-sided inequality. -/\ndef leftHandSide (a b c : ℝ) : ℝ :=\n summand a + summand b + summand c\n\n/-- The hypothesis imposed on the three real variables. -/\ndef constraint (a b c : ℝ) : Prop :=\n a * b + b * c + c * a = 3\n\n/-- The lower inequality in the source problem, for fixed `a`, `b`, and `c`. -/\ndef lowerBound (a b c : ℝ) : Prop :=\n 0 ≤ leftHandSide a b c\n\n/-- The upper inequality in the source problem, for fixed `a`, `b`, and `c`. -/\ndef upperBound (a b c : ℝ) : Prop :=\n leftHandSide a b c ≤ 6\n\n/-- The complete proposition requested by the problem: for every three real\nnumbers satisfying `ab + bc + ca = 3`, the displayed sum lies between `0` and\n`6`, inclusively. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), constraint a b c → lowerBound a b c ∧ upperBound a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aeac0362-e1cd-5267-99f7-d9d1fb8bf9dc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "478a0fbc16d0915e7f9223e863ff6ccd2e07066759292b2814480637bb2f2267", "task_path": "tasks/nmp3_aeac0362-e1cd-5267-99f7-d9d1fb8bf9dc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aeac0362-e1cd-5267-99f7-d9d1fb8bf9dc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aed26df2-0931-53ca-9baa-ed32a038e78a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- There is a calculator with a display and two buttons: one replaces the displayed value $x$ by $-1/x$ (the “$-1/x$” button, which cannot be pressed when $x=0$), and the other replaces $x$ by $x+1$ (the “$x+1$” button). The display can show any rational number. Initially the display shows $0$. After the calculator is dropped, the two buttons have been pressed a total of $N$ times in some order, producing some rational value on the screen. Prove that, starting from that value, it is always possible to return the display to $0$ by pressing the buttons at most $3N$ more times.\nimport Mathlib.Data.Rat.Defs\nimport Mathlib.Data.List.Basic\n\n/-!\n# Calculator reachability and returnability\n\nThis file formalizes the statement of the calculator problem. The display\nholds a rational number. There are exactly two buttons: one sends `x` to\n`-1 / x` (and is unavailable at `0`), and one sends `x` to `x + 1`.\n-/\n\nnamespace Problem\n\n/-- The two buttons on the calculator. -/\ninductive Button : Type\n | negInv\n | addOne\n deriving DecidableEq, Repr\n\n/-- The partial state transition induced by a button.\n\nThe `negInv` button is undefined at zero, represented by `none`. The\n`addOne` button is total. -/\ndef Button.apply : Button → ℚ → Option ℚ\n | .negInv, x => if x = 0 then none else some (-1 / x)\n | .addOne, x => some (x + 1)\n\n/-- Apply a finite sequence of buttons to a starting value.\n\nThe result is `none` exactly when some button in the sequence is pressed at a\nvalue where it is unavailable. -/\ndef applyButtons : ℚ → List Button → Option ℚ\n | x, [] => some x\n | x, button :: rest =>\n match Button.apply button x with\n | none => none\n | some next => applyButtons next rest\n\n/-- `ReachableInFrom start n finish` means that, starting at `start`, there is\na valid sequence of exactly `n` button presses whose final display is\n`finish`. -/\ndef ReachableInFrom (start finish : ℚ) (n : ℕ) : Prop :=\n ∃ buttons : List Button,\n buttons.length = n ∧ applyButtons start buttons = some finish\n\n/-- `ReachableWithinFrom start n finish` means that, starting at `start`, there\nis a valid sequence of at most `n` button presses whose final display is\n`finish`. -/\ndef ReachableWithinFrom (start finish : ℚ) (n : ℕ) : Prop :=\n ∃ buttons : List Button,\n buttons.length ≤ n ∧ applyButtons start buttons = some finish\n\n/-- The display values obtainable from the initial display `0` after exactly\n`n` valid button presses. -/\ndef ReachableIn (n : ℕ) : ℚ → Prop :=\n fun finish => ReachableInFrom 0 finish n\n\n/-- The display values obtainable from the initial display `0` after at most\n`n` valid button presses. -/\ndef ReachableWithin (n : ℕ) : ℚ → Prop :=\n fun finish => ReachableWithinFrom 0 finish n\n\n/-- `ReturnsToZeroWithin x k` means that, from display value `x`, one can\nreturn to `0` using a valid sequence of at most `k` button presses. -/\ndef ReturnsToZeroWithin (x : ℚ) (k : ℕ) : Prop :=\n ReachableWithinFrom x 0 k\n\n/-- The assertion in the problem: every value reachable from `0` after exactly\n`N` valid button presses can be returned to `0` in at most `3 * N` further\nvalid button presses. -/\ndef Target : Prop :=\n ∀ (N : ℕ) (x : ℚ),\n ReachableIn N x → ReturnsToZeroWithin x (3 * N)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aed26df2-0931-53ca-9baa-ed32a038e78a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "46b27d97d350556b72eba0742e7cffecb8dff7a8e347bf385a5903665a2adbc3", "task_path": "tasks/nmp3_aed26df2-0931-53ca-9baa-ed32a038e78a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aed26df2-0931-53ca-9baa-ed32a038e78a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aeec7de9-b0d3-5057-a0c5-3d9e1a15d1b7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that the Diophantine equation $x^3+y^3+z^3+t^3=1999$ has infinitely many integer solutions, i.e. there exist infinitely many quadruples $(x,y,z,t)\\in\\mathbb Z^4$ satisfying the equation.\nimport Mathlib\n\nnamespace Problem\n\n/-- An integer quadruple `(x, y, z, t)` is a solution of the Diophantine equation\n`x^3 + y^3 + z^3 + t^3 = 1999`. -/\ndef IsSolution (x y z t : ℤ) : Prop :=\n x ^ 3 + y ^ 3 + z ^ 3 + t ^ 3 = (1999 : ℤ)\n\n/-- The set of all integer quadruples satisfying `x^3 + y^3 + z^3 + t^3 = 1999`. -/\ndef SolutionSet : Set (ℤ × ℤ × ℤ × ℤ) :=\n {p | IsSolution p.1 p.2.1 p.2.2.1 p.2.2.2}\n\n/-- The Diophantine equation `x^3 + y^3 + z^3 + t^3 = 1999` has infinitely many\ninteger solutions, represented as infinitude of the set of admissible quadruples. -/\ndef Target : Prop :=\n SolutionSet.Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aeec7de9-b0d3-5057-a0c5-3d9e1a15d1b7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "32a294c20c2ed29d37d56accef72c1d70774fb199a9690f9ec4b2475b0e140f1", "task_path": "tasks/nmp3_aeec7de9-b0d3-5057-a0c5-3d9e1a15d1b7", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aeec7de9-b0d3-5057-a0c5-3d9e1a15d1b7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_aefc809d-22aa-5619-8ce1-c9f431e87611", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For non‑negative real numbers $a,b,c$ satisfying $a+b+c=1$, prove that \n-- \\[\n-- \\sqrt{a+b^{2}}+\\sqrt{b+c^{2}}+\\sqrt{c+a^{2}}\\le\\frac{11}{5}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\nThis file records the target assertion of the problem. It intentionally\ncontains only a declaration of the proposition, not a proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real parameters: each is\nnon-negative and their sum is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a + b + c = 1\n\n/-- The assertion to be proved: for all non-negative real numbers `a`, `b`, `c`\nwith `a + b + c = 1`, the stated sum of square roots is at most `11 / 5`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c →\n Real.sqrt (a + b ^ 2) + Real.sqrt (b + c ^ 2) +\n Real.sqrt (c + a ^ 2) ≤ (11 : ℝ) / 5\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aefc809d-22aa-5619-8ce1-c9f431e87611", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ec4023dc70b06dd9da5ed7b600ad125b8cfc641bf47326eb5427d9f3b39bc6a1", "task_path": "tasks/nmp3_aefc809d-22aa-5619-8ce1-c9f431e87611", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "aefc809d-22aa-5619-8ce1-c9f431e87611", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_af221642-90a8-5f3e-86df-5083ecc44aec", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers such that $x+y+z=1$. Prove that \n-- \\[\n-- \\frac{x^2}{24x^2-16x+3}+\\frac{y^2}{24y^2-16y+3}+\\frac{z^2}{24z^2-16z+3}\\le 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe original problem asks one to prove a universal inequality over positive real\nnumbers `x`, `y`, and `z` whose sum is `1`.\n-/\n\nnamespace Problem\n\n/-- The denominator `24*t^2 - 16*t + 3` appearing in each summand. -/\ndef denominator (t : ℝ) : ℝ :=\n (24 : ℝ) * t ^ 2 - (16 : ℝ) * t + (3 : ℝ)\n\n/-- The summand `t^2 / (24*t^2 - 16*t + 3)`. -/\nnoncomputable def summand (t : ℝ) : ℝ :=\n t ^ 2 / denominator t\n\n/--\nFor all positive real numbers `x`, `y`, and `z` with `x + y + z = 1`, the sum\nof the three displayed rational expressions is at most `1`.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x + y + z = 1 →\n summand x + summand y + summand z ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "af221642-90a8-5f3e-86df-5083ecc44aec", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d1b8c64f47bf3994d9b7596f3a439581be7de001d44d0943a8090d08b5b1869e", "task_path": "tasks/nmp3_af221642-90a8-5f3e-86df-5083ecc44aec", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "af221642-90a8-5f3e-86df-5083ecc44aec", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_af37b81e-c256-5498-9ae8-c98a92ad4f8a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let (O,R) be a circle with centre O and radius R. Let A, B, C be points on the circle such that AC = 2·AB. Let P be the point exterior to the circle satisfying PC ⟂ CO and PA ⟂ OA (equivalently, PA and PC are the tangents to the circle at A and C). Let the line PB intersect the circle again at I (I ≠ B). Prove that CI = IB.\nimport Mathlib\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The ambient Euclidean plane, represented by the real coordinate plane. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A point `X` lies on the circle with centre `O` and radius `R`. -/\ndef OnCircle (O : Plane) (R : ℝ) (X : Plane) : Prop :=\n dist X O = R\n\n/-- A point `X` is exterior to the circle with centre `O` and radius `R`. -/\ndef OutsideCircle (O : Plane) (R : ℝ) (X : Plane) : Prop :=\n R < dist X O\n\n/-- The angle `XYZ` is a right angle, encoded by orthogonality of its two sides. -/\ndef Perpendicular (X Y Z : Plane) : Prop :=\n inner ℝ (X - Y) (Z - Y) = 0\n\n/-- `X`, `Y`, and `Z` are collinear, encoded by membership of `Z` in the\naffine line through `X` and `Y`. -/\ndef CollinearThree (X Y Z : Plane) : Prop :=\n ∃ t : ℝ, Z = X + t • (Y - X)\n\n/-- The statement of the problem: under the stated circle, chord, tangent, and\nsecond-intersection hypotheses, the chord lengths `CI` and `IB` are equal. -/\ndef Target : Prop :=\n ∀ (O : Plane) (R : ℝ) (A B C P I : Plane),\n 0 < R →\n OnCircle O R A →\n OnCircle O R B →\n OnCircle O R C →\n dist A C = 2 * dist A B →\n OutsideCircle O R P →\n Perpendicular P C O →\n Perpendicular P A O →\n OnCircle O R I →\n I ≠ B →\n CollinearThree P B I →\n dist C I = dist I B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "af37b81e-c256-5498-9ae8-c98a92ad4f8a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "56be515f27dae946d4998332845db8ab6ce53e5fec0a109cce061dbd441abeb1", "task_path": "tasks/nmp3_af37b81e-c256-5498-9ae8-c98a92ad4f8a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "af37b81e-c256-5498-9ae8-c98a92ad4f8a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_af46ecca-37f6-511e-9118-72439f7caf09", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that for all real numbers $x,y$,\n-- $$f\\bigl(f(x)f(y)-1\\bigr)=xy-1\\,.$$\nimport Mathlib\n\n/-!\n# Formalization of a real functional equation\n\nThe source problem asks for all functions `f : ℝ → ℝ` satisfying\n\n`f (f x * f y - 1) = x * y - 1` for every pair of real numbers `x, y`.\n\nThis file gives the admissibility predicate, a predicate saying that a proposed\nset of functions is exactly the full answer set, and the closed target using the\nproposed answer consisting of the identity function.\n-/\n\nnamespace Problem\n\n/-- A function `f : ℝ → ℝ` is admissible when it satisfies the functional\nequation for every pair of real numbers `x` and `y`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (f x * f y - 1) = x * y - 1\n\n/-- A proposed set `candidate` is a complete answer precisely when it contains\nevery admissible function and no inadmissible function. The two conjuncts are\nthe completeness and soundness directions of the classification. -/\ndef IsCompleteAnswer (candidate : Set (ℝ → ℝ)) : Prop :=\n (∀ f : ℝ → ℝ, f ∈ candidate → Admissible f) ∧\n (∀ f : ℝ → ℝ, Admissible f → f ∈ candidate)\n\n/-- The proposed answer set consists exactly of the identity function. -/\ndef ProposedAnswer : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | ∀ x : ℝ, f x = x}\n\n/-- The target proposition: the proposed identity-function answer is the complete\nset of solutions of the functional equation. -/\ndef Target : Prop :=\n IsCompleteAnswer ProposedAnswer\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "af46ecca-37f6-511e-9118-72439f7caf09", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "88a1e60a4d47c11b64a9f111e61309603dd3a3b111188c34203c1db4ce29d8f4", "task_path": "tasks/nmp3_af46ecca-37f6-511e-9118-72439f7caf09", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "af46ecca-37f6-511e-9118-72439f7caf09", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_af6e2057-c6ed-5c34-b0d3-c4f451f53a42", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^3+b^3+c^3}{3abc}+\\frac{a(b+c)}{b^2+c^2}+\\frac{b(c+a)}{c^2+a^2}+\\frac{c(a+b)}{a^2+b^2}\\ge 4.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The full left-hand side of the stated inequality.\n\nFor positive real numbers `a`, `b`, and `c`, this is\n\\[\n\\frac{a^3+b^3+c^3}{3abc}\n+\\frac{a(b+c)}{b^2+c^2}\n+\\frac{b(c+a)}{c^2+a^2}\n+\\frac{c(a+b)}{a^2+b^2}.\n\\]\n-/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 3 + b ^ 3 + c ^ 3) / (3 * a * b * c)\n + a * (b + c) / (b ^ 2 + c ^ 2)\n + b * (c + a) / (c ^ 2 + a ^ 2)\n + c * (a + b) / (a ^ 2 + b ^ 2)\n\n/-- The assertion to be proved: for every triple of positive real numbers\n`a`, `b`, and `c`, the left-hand side is at least `4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "af6e2057-c6ed-5c34-b0d3-c4f451f53a42", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e12cb086651ddc865fc98f8fe66c2a2a9a7084a6c10b6bebe738975fb52e4af3", "task_path": "tasks/nmp3_af6e2057-c6ed-5c34-b0d3-c4f451f53a42", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "af6e2057-c6ed-5c34-b0d3-c4f451f53a42", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_af786242-0a39-55f6-9c50-480ba9958e35", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- $$a^2+b^2+c^2\\ge \\sqrt{\\,3\\bigl(a^3b+b^3c+c^3a\\bigr)}\\,. $$\nimport Mathlib\n\n/-!\n# Formal statement for the supplied inequality problem\n\nThe original problem asks to prove, for all positive real numbers `a`, `b`, and\n`c`, that\n\n`a^2 + b^2 + c^2 >= sqrt (3 * (a^3 * b + b^3 * c + c^3 * a))`.\n\nThe proposition is recorded as a `Prop`-valued definition. No proof is\nincluded, in accordance with the statement-formalization task.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved: for every triple of positive real numbers\n`a`, `b`, `c`,\n`a^2 + b^2 + c^2 ≥ √(3 * (a^3 * b + b^3 * c + c^3 * a))`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 ≥\n Real.sqrt ((3 : ℝ) * (a ^ 3 * b + b ^ 3 * c + c ^ 3 * a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "af786242-0a39-55f6-9c50-480ba9958e35", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "197fc2ac78b75ce46b1542508618e1616631d14741b7ec1b506622abea8aeeef", "task_path": "tasks/nmp3_af786242-0a39-55f6-9c50-480ba9958e35", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "af786242-0a39-55f6-9c50-480ba9958e35", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_af94e081-732e-5903-836c-cee79c161a47", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- 3\\left(\\frac{a+2b}{c}+\\frac{b+2c}{a}+\\frac{c+2a}{b}\\right)\\ge \n-- \\frac{13\\left(a^{2}+b^{2}+c^{2}\\right)}{ab+bc+ca}+14\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissible triples in the source statement: all three variables are positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def inequalityLHS (a b c : ℝ) : ℝ :=\n 3 * ((a + 2 * b) / c + (b + 2 * c) / a + (c + 2 * a) / b)\n\n/-- The right-hand side of the target inequality, before moving the constant. -/\nnoncomputable def inequalityRHS (a b c : ℝ) : ℝ :=\n 13 * (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a) + 14\n\n/-- The full assertion of the problem: for every positive real triple `(a, b, c)`,\nthe stated non-strict inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → inequalityLHS a b c ≥ inequalityRHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "af94e081-732e-5903-836c-cee79c161a47", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "44a59d921b6f3989bb113877dbae4e79dcd1434e5cbe5a03f799712fcc4cd8b9", "task_path": "tasks/nmp3_af94e081-732e-5903-836c-cee79c161a47", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "af94e081-732e-5903-836c-cee79c161a47", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_afc0e935-3be0-51b1-8a93-5e5a57d01174", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exists a constant $K$ such that for any sequence of positive numbers $a_1,a_2,a_3,\\dots$, the inequality \n-- \\[\n-- \\sum_{n=1}^{\\infty}\\frac{n}{a_1+a_2+\\cdots+a_n}\\;\\le\\;K\\sum_{n=1}^{\\infty}\\frac{1}{a_n}\n-- \\] \n-- holds.\nimport Mathlib\n\n/-!\n# Formalization of the stated inequality\n\nThe original problem asks for a finite constant `K` such that, for every\nsequence of strictly positive real numbers, an inequality between two\ninfinite series holds. The terms of the series are nonnegative, but the\nseries need not converge, so the infinite sums are represented as extended\nnonnegative sums in `ℝ≥0∞`. Lean's natural-number index `n` represents the\noriginal index `n + 1`.\n-/\n\nnamespace Problem\n\nopen scoped BigOperators NNReal ENNReal\n\n/-- The finite partial sum `a 0 + ... + a n`, which is\n`a_1 + ... + a_{n+1}` in the original one-based indexing. -/\nnoncomputable def partialSum (a : ℕ → ℝ) (n : ℕ) : ℝ :=\n (Finset.range (n + 1)).sum a\n\n/-- The term at original index `n + 1`,\n`(n + 1) / (a_1 + ... + a_{n+1})`, from the left-hand series, regarded as\nan extended nonnegative real. -/\nnoncomputable def lhsTerm (a : ℕ → ℝ) (n : ℕ) : ℝ≥0∞ :=\n ENNReal.ofReal (((n + 1 : ℕ) : ℝ) / partialSum a n)\n\n/-- The term at original index `n + 1`, `1 / a_{n+1}`, from the right-hand\nseries, regarded as an extended nonnegative real. -/\nnoncomputable def rhsTerm (a : ℕ → ℝ) (n : ℕ) : ℝ≥0∞ :=\n ENNReal.ofReal (1 / a n)\n\n/-- The whole left-hand infinite series as an extended nonnegative sum. -/\nnoncomputable def lhsSeries (a : ℕ → ℝ) : ℝ≥0∞ :=\n ∑' n : ℕ, lhsTerm a n\n\n/-- The whole right-hand infinite series as an extended nonnegative sum. -/\nnoncomputable def rhsSeries (a : ℕ → ℝ) : ℝ≥0∞ :=\n ∑' n : ℕ, rhsTerm a n\n\n/-- A sequence of positive numbers: every term is strictly positive. -/\ndef AdmissibleSequence (a : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, 0 < a n\n\n/-- For a fixed real constant `K`, the displayed inequality holds for every\nsequence of positive numbers. The factor `ENNReal.ofReal K` is the natural\nembedding of the real coefficient into extended nonnegative reals; any\nconstant that can make the inequality true is necessarily positive. -/\nnoncomputable def MainInequality (K : ℝ) : Prop :=\n ∀ a : ℕ → ℝ,\n AdmissibleSequence a →\n lhsSeries a ≤ ENNReal.ofReal K * rhsSeries a\n\n/-- The assertion of the problem: there exists a finite real constant `K`\nfor which the displayed inequality holds for every sequence of strictly\npositive real numbers. -/\nnoncomputable def Target : Prop :=\n ∃ K : ℝ, MainInequality K\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "afc0e935-3be0-51b1-8a93-5e5a57d01174", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ccff86d4f42a33839e730140bc29231fbf2540cc6abdd451dbb5e9749a62c19a", "task_path": "tasks/nmp3_afc0e935-3be0-51b1-8a93-5e5a57d01174", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "afc0e935-3be0-51b1-8a93-5e5a57d01174", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_afc9f64d-ea28-5a38-883a-8d0c34686f57", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\frac1{\\sqrt{8a^2+bc}}+\\frac1{\\sqrt{8b^2+ca}}+\\frac1{\\sqrt{8c^2+ab}}\\ge1.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the three-variable square-root inequality\n\nThe problem asks to prove, for all strictly positive real numbers `a`, `b`, and `c`\nwhose sum is 3, that\n`1 / sqrt (8*a^2 + b*c) + 1 / sqrt (8*b^2 + c*a) + 1 / sqrt (8*c^2 + a*b) ≥ 1`.\n-/\n\nnamespace Problem\n\n/-- The target proposition of the problem.\n\nThe variables `a`, `b`, and `c` range over the real numbers. The hypotheses\n`0 < a`, `0 < b`, and `0 < c` encode the strict positivity condition, and\n`a + b + c = 3` encodes the sum condition. `Real.sqrt` denotes the principal\nnonnegative real square root. The conclusion is the displayed three-term\ninequality. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = (3 : ℝ) →\n (1 : ℝ) ≤\n (1 : ℝ) / Real.sqrt ((8 : ℝ) * a ^ 2 + b * c) +\n (1 : ℝ) / Real.sqrt ((8 : ℝ) * b ^ 2 + c * a) +\n (1 : ℝ) / Real.sqrt ((8 : ℝ) * c ^ 2 + a * b)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "afc9f64d-ea28-5a38-883a-8d0c34686f57", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f7dd2b4148a9f7bc88ca82909f512128037e0fba2f6b91439be72f2f90ca01a0", "task_path": "tasks/nmp3_afc9f64d-ea28-5a38-883a-8d0c34686f57", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "afc9f64d-ea28-5a38-883a-8d0c34686f57", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_afdbcf42-049f-527f-9984-3b7cfd9cb0ab", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers \\(a,b,c\\) satisfying \\(abc\\ge 1\\), prove that \n-- \\[\n-- \\frac{1}{a^{3}+b^{2}+c^{2}}+\\frac{1}{a^{2}+b^{3}+c^{2}}+\\frac{1}{a^{2}+b^{2}+c^{3}}\\le 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c` satisfying `a * b * c ≥ 1`,\nthe sum of the three indicated reciprocal expressions is at most `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c ≥ 1 →\n 1 / (a ^ 3 + b ^ 2 + c ^ 2) +\n 1 / (a ^ 2 + b ^ 3 + c ^ 2) +\n 1 / (a ^ 2 + b ^ 2 + c ^ 3) ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "afdbcf42-049f-527f-9984-3b7cfd9cb0ab", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "37b50e72380a477aed6e5d74136e7c7361dd8c911ef8b3e277c1df528df70d22", "task_path": "tasks/nmp3_afdbcf42-049f-527f-9984-3b7cfd9cb0ab", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "afdbcf42-049f-527f-9984-3b7cfd9cb0ab", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b0066868-9098-520c-ad55-c2b80745d90f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $abc=1$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{1}{a^{3}(b+c)}\\ge\\frac32\\sum_{\\text{cyc}}\\frac{ab}{a^{5}+b^{5}+ab}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand cyclic sum\n`1 / (a^3 * (b + c)) + 1 / (b^3 * (c + a)) + 1 / (c^3 * (a + b))`. -/\nnoncomputable def cyclicLHS (a b c : ℝ) : ℝ :=\n 1 / (a ^ 3 * (b + c)) + 1 / (b ^ 3 * (c + a)) + 1 / (c ^ 3 * (a + b))\n\n/-- The right-hand cyclic sum\n`ab/(a^5+b^5+ab) + bc/(b^5+c^5+bc) + ca/(c^5+a^5+ca)`,\nmultiplied by `3/2`. -/\nnoncomputable def cyclicRHS (a b c : ℝ) : ℝ :=\n (3 / 2 : ℝ) *\n (a * b / (a ^ 5 + b ^ 5 + a * b) +\n b * c / (b ^ 5 + c ^ 5 + b * c) +\n c * a / (c ^ 5 + a ^ 5 + c * a))\n\n/-- The admissibility condition `a > 0`, `b > 0`, `c > 0`, and `abc = 1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The assertion: for all positive real `a`, `b`, `c` with `abc = 1`, the\ncyclic left-hand side is at least the cyclic right-hand side. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → cyclicLHS a b c ≥ cyclicRHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b0066868-9098-520c-ad55-c2b80745d90f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0482ab6bfd2706a1195a4159f4343f2c5d19083382a6f79f5a521e3d68d3c2cc", "task_path": "tasks/nmp3_b0066868-9098-520c-ad55-c2b80745d90f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b0066868-9098-520c-ad55-c2b80745d90f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b0304ea6-8de3-5864-aa56-24f75a4fdd82", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a tetrahedron such that each of its four faces can be contained in a circle of radius $1$ (i.e. the minimal covering circle of each triangular face has radius $\\le 1$). Prove that the tetrahedron can be placed inside a sphere of radius $\\displaystyle\\frac{3}{2\\sqrt2}\\,$.\n/-\nFormalization of the tetrahedron covering-circle problem.\n\nThe ambient Euclidean three-space is represented by `EuclideanSpace ℝ (Fin 3)`.\nA (nondegenerate) tetrahedron is represented by an `Affine.Simplex ℝ E3 3`, whose\nfour points are affinely independent. The four triangular faces are the\nopposite faces `T.faceOpposite i`.\n\nThe target is an unproved proposition. The declarations below spell out the\nnotions of a triangular face lying in a circle, the minimal covering-circle\nradius, and containment of the tetrahedron in a closed ball.\n-/\n\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.Convex.Hull\nimport Mathlib.Geometry.Euclidean.Simplex\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean three-dimensional space. -/\nabbrev E3 : Type := EuclideanSpace ℝ (Fin 3)\n\n/-- The radius `3 / (2 * sqrt 2)` appearing in the conclusion. -/\ndef enclosingSphereRadius : ℝ := (3 : ℝ) / (2 * Real.sqrt 2)\n\n/--\nA triangular face can be contained in a circle of the given radius. The circle\nis required to lie in the affine plane of the triangle; this is expressed by\nrequiring its center to belong to the affine span of the three vertices. The\nclosed disk bounded by the circle contains the whole filled triangle.\n-/\ndef TriangleCanBeContainedInCircle\n (t : Affine.Triangle ℝ E3) (radius : ℝ) : Prop :=\n 0 ≤ radius ∧\n ∃ center : E3,\n center ∈ affineSpan ℝ (Set.range t.points) ∧\n convexHull ℝ (Set.range t.points) ⊆ Metric.closedBall center radius\n\n/--\n`IsMinimalCoveringCircleOfTriangle t center radius` records that `center` and\n`radius` give a covering circle of the triangle whose radius is no larger than\nthat of every other covering circle in the plane of the triangle.\n-/\ndef IsMinimalCoveringCircleOfTriangle\n (t : Affine.Triangle ℝ E3) (center : E3) (radius : ℝ) : Prop :=\n 0 ≤ radius ∧\n center ∈ affineSpan ℝ (Set.range t.points) ∧\n convexHull ℝ (Set.range t.points) ⊆ Metric.closedBall center radius ∧\n ∀ (center' : E3) (radius' : ℝ),\n 0 ≤ radius' →\n center' ∈ affineSpan ℝ (Set.range t.points) →\n convexHull ℝ (Set.range t.points) ⊆ Metric.closedBall center' radius' →\n radius ≤ radius'\n\n/--\nA triangle has a minimal covering circle whose radius is at most `bound`.\nThis is the formal version of the parenthetical explanation in the source.\n-/\ndef TriangleHasMinimalCoveringCircleOfRadiusAtMost\n (t : Affine.Triangle ℝ E3) (bound : ℝ) : Prop :=\n ∃ (center : E3) (radius : ℝ),\n IsMinimalCoveringCircleOfTriangle t center radius ∧ radius ≤ bound\n\n/--\nThe minimal covering-circle radius of a triangle, defined as the infimum of the\nradii of circles in the triangle's affine plane whose closed disks contain the\ntriangle's convex hull. For a nondegenerate triangle this infimum is attained,\nas recorded by `IsMinimalCoveringCircleOfTriangle`.\n-/\ndef triangleMinimalCoveringRadius (t : Affine.Triangle ℝ E3) : ℝ :=\n sInf {radius : ℝ | TriangleCanBeContainedInCircle t radius}\n\n/-- The minimal covering-circle radius of the face opposite vertex `i`. -/\ndef faceMinimalCoveringRadius\n (T : Affine.Simplex ℝ E3 3) (i : Fin 4) : ℝ :=\n triangleMinimalCoveringRadius (T.faceOpposite i)\n\n/-- Each of the four triangular faces can be contained in a circle of radius one. -/\ndef TetrahedronFacesCanBeCoveredByUnitCircles\n (T : Affine.Simplex ℝ E3 3) : Prop :=\n ∀ i : Fin 4, TriangleCanBeContainedInCircle (T.faceOpposite i) 1\n\n/-- Each of the four triangular faces has minimal covering-circle radius at most one. -/\ndef TetrahedronFacesHaveMinimalCoveringRadiusAtMostOne\n (T : Affine.Simplex ℝ E3 3) : Prop :=\n ∀ i : Fin 4, TriangleHasMinimalCoveringCircleOfRadiusAtMost (T.faceOpposite i) 1\n\n/--\nThe tetrahedron represented by `T` can be placed inside a closed ball of the\ngiven radius. Its (filled) convex hull is required to be contained in the ball.\n-/\ndef TetrahedronCanBePlacedInClosedBall\n (T : Affine.Simplex ℝ E3 3) (radius : ℝ) : Prop :=\n ∃ center : E3,\n convexHull ℝ (Set.range T.points) ⊆ Metric.closedBall center radius\n\n/--\nThe main statement: every nondegenerate tetrahedron in Euclidean three-space,\nall of whose four triangular faces can be covered by unit circles, is contained\nin a closed ball of radius `3 / (2 * sqrt 2)`.\n-/\ndef Target : Prop :=\n ∀ T : Affine.Simplex ℝ E3 3,\n TetrahedronFacesCanBeCoveredByUnitCircles T →\n TetrahedronCanBePlacedInClosedBall T enclosingSphereRadius\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b0304ea6-8de3-5864-aa56-24f75a4fdd82", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d010c54eade2bc4dd900130f08feda0b87a50890c704be4fab1122518e1a8d30", "task_path": "tasks/nmp3_b0304ea6-8de3-5864-aa56-24f75a4fdd82", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b0304ea6-8de3-5864-aa56-24f75a4fdd82", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b04d9441-b188-5e35-aa4d-0cbd9f6a34f1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Consider the infinite square grid (the plane tiled by unit square cells). A finite set of cells is colored black; all other cells are white. Assume that for each black cell the number of orthogonal (side) adjacent white cells is even (i.e., 0, 2, or 4). Prove that the white cells can be colored red or green so that every black cell has the same number of red and green adjacent white cells.\nimport Mathlib\n\n/-!\n# Formal statement: balancing red and green neighbours of a finite black set\n\nThis file formalizes the statement of the problem. The infinite square grid is\nrepresented by the integer lattice `Int × Int`; two cells are orthogonal\nneighbours when their coordinate difference is one unit in exactly one\ncoordinate. The finite black set is a `Finset`, and its complement consists of\nthe white cells. A white-cell colouring is a total function from the subtype of\nwhite cells to a two-element colour type, so each white cell receives exactly\none of the two colours.\n\nNo proof of `Target` is supplied here; `Target` is the proposition asserted by\nthe problem.\n-/\n\nnamespace Problem\n\n/-- A cell in the infinite square grid is an ordered pair of integer coordinates. -/\nabbrev Cell : Type := Int × Int\n\n/-- The two colours available for white cells. -/\ninductive CellColor : Type\n | red : CellColor\n | green : CellColor\n deriving DecidableEq\n\n/-- The four cells sharing a side with `p`: east, west, north, south. -/\ndef orthogonalNeighbors (p : Cell) : Finset Cell :=\n {(p.1 + 1, p.2), (p.1 - 1, p.2), (p.1, p.2 + 1), (p.1, p.2 - 1)}\n\n/-- A cell is white exactly when it is not one of the black cells. -/\nabbrev IsWhite (black : Finset Cell) (p : Cell) : Prop :=\n p ∉ black\n\n/-- The orthogonal neighbours of `p` that are white. -/\ndef whiteNeighbors (black : Finset Cell) (p : Cell) : Finset Cell :=\n (orthogonalNeighbors p).filter (fun q : Cell => IsWhite black q)\n\n/-- The number of orthogonal white neighbours of `p`. -/\ndef whiteNeighborCount (black : Finset Cell) (p : Cell) : Nat :=\n (whiteNeighbors black p).card\n\n/-- Every black cell has an even number of orthogonally adjacent white cells.\nWith four possible side-neighbours, this is exactly the source condition that\nthe number is `0`, `2`, or `4`. -/\ndef blackWhiteDegreeEven (black : Finset Cell) : Prop :=\n ∀ p : Cell, p ∈ black → Even (whiteNeighborCount black p)\n\n/-- The number of orthogonal white neighbours of `p` that receive `color`.\n\nThe colouring is defined only on white cells. The `if` test ensures that a\nneighbour in the black set is never counted, and the proof carried by the\nsubtype records precisely that the cell is outside `black`. -/\ndef countWhiteNeighborsOfColor (black : Finset Cell)\n (coloring : {q : Cell // IsWhite black q} → CellColor)\n (color : CellColor) (p : Cell) : Nat :=\n ((orthogonalNeighbors p).filter fun q : Cell =>\n if h : IsWhite black q then coloring ⟨q, h⟩ = color else false).card\n\n/-- The number of red orthogonal white neighbours of `p`. -/\ndef redAdjacentWhiteCount (black : Finset Cell)\n (coloring : {q : Cell // IsWhite black q} → CellColor) (p : Cell) : Nat :=\n countWhiteNeighborsOfColor black coloring CellColor.red p\n\n/-- The number of green orthogonal white neighbours of `p`. -/\ndef greenAdjacentWhiteCount (black : Finset Cell)\n (coloring : {q : Cell // IsWhite black q} → CellColor) (p : Cell) : Nat :=\n countWhiteNeighborsOfColor black coloring CellColor.green p\n\n/-- A black cell is balanced when it has equally many red and green\northogonally adjacent white cells. -/\ndef blackCellBalanced (black : Finset Cell)\n (coloring : {q : Cell // IsWhite black q} → CellColor) (p : Cell) : Prop :=\n redAdjacentWhiteCount black coloring p =\n greenAdjacentWhiteCount black coloring p\n\n/-- The assertion of the problem: for every finite set `black` of cells, if\nevery black cell has an even number of orthogonal white neighbours, then there\nis a red/green colouring of all white cells such that every black cell has the\nsame number of red and green orthogonal white neighbours. -/\ndef Target : Prop :=\n ∀ black : Finset Cell,\n blackWhiteDegreeEven black →\n ∃ coloring : {q : Cell // IsWhite black q} → CellColor,\n ∀ p : Cell, p ∈ black → blackCellBalanced black coloring p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b04d9441-b188-5e35-aa4d-0cbd9f6a34f1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2fc3086d93e2f9046cf5a76bc5a271109fc2876e987c6a133cca905fd04f091f", "task_path": "tasks/nmp3_b04d9441-b188-5e35-aa4d-0cbd9f6a34f1", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b04d9441-b188-5e35-aa4d-0cbd9f6a34f1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b04ee60a-ab12-5251-9e71-f3c11292f481", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that for all real numbers $x$ and $y$\n-- \\[\n-- f\\bigl(x+yf(x)\\bigr)=f(x)+x\\,f(y).\n-- \\]\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\npublic section\n\n/-!\n# Formalization of a real functional equation\n\nThe source problem asks for all functions `f : ℝ → ℝ` satisfying\n\n`f (x + y * f x) = f x + x * f y`\n\nfor every pair of real numbers `x` and `y`.\n\nThe declarations below separate the admissibility condition (the functional\nequation), the notion of a sound and complete answer set, and the concrete\nproposed answer consisting exactly of the zero function and the identity\nfunction. The latter is recorded as a proposition to be proved, not assumed.\n-/\n\nnamespace Problem\n\n/-- The identically zero function `ℝ → ℝ`. -/\ndef ZeroFunction : ℝ → ℝ :=\n fun _ => 0\n\n/-- The identity function `ℝ → ℝ`. -/\ndef IdentityFunction : ℝ → ℝ :=\n fun x => x\n\n/--\nA function `f : ℝ → ℝ` is admissible precisely when it satisfies the\nfunctional equation for every pair of real numbers `x` and `y`.\n-/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x + y * f x) = f x + x * f y\n\n/-- Soundness of a proposed answer set: every member satisfies the equation. -/\ndef AnswerSound (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, f ∈ S → Admissible f\n\n/-- Completeness of a proposed answer set: every admissible function is a member. -/\ndef AnswerComplete (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, Admissible f → f ∈ S\n\n/--\nA set `S` is a complete answer to the original \"find all\" problem exactly when\nit is both sound and complete with respect to `Admissible`.\n-/\ndef AnswerCorrect (S : Set (ℝ → ℝ)) : Prop :=\n AnswerSound S ∧ AnswerComplete S\n\n/-- The proposed complete solution set: the zero function and the identity function. -/\ndef ProposedAnswer : Set (ℝ → ℝ) :=\n {f | f = ZeroFunction ∨ f = IdentityFunction}\n\n/--\nThe formal target statement: the proposed answer consists exactly of all\nfunctions `ℝ → ℝ` satisfying the original functional equation.\n-/\ndef Target : Prop :=\n AnswerCorrect ProposedAnswer\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b04ee60a-ab12-5251-9e71-f3c11292f481", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ac93b4227cd8130994492015112b7db1a2b1fb07346458ef14b12164b8dcdaef", "task_path": "tasks/nmp3_b04ee60a-ab12-5251-9e71-f3c11292f481", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b04ee60a-ab12-5251-9e71-f3c11292f481", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b08a0df6-6b21-525a-a896-7ba932e20464", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $N$ be a natural number with exactly $54$ decimal digits, each digit being $0$ or $1$ (so the leading digit is $1$). Let $r$ be the remainder when $N$ is divided by \n-- \\[\n-- 33\\cdot34\\cdot35\\cdot36\\cdot37\\cdot38\\cdot39.\n-- \\] \n-- Prove that $r>100000\\;(=10^5)$.\nimport Mathlib\n\n/-!\n# Formal statement of the 54-digit binary-decimal remainder problem\n\nThe original problem asks us to prove a lower bound on the remainder of a\n54-digit natural number whose decimal digits are all `0` or `1`, upon\ndivision by `33 * 34 * 35 * 36 * 37 * 38 * 39`.\n-/\n\nnamespace Problem\n\n/-- The decimal digits of `N`, in little-endian order (least significant\ndigit first), as provided by `Nat.digits` in base `10`. -/\ndef decimalDigits (N : ℕ) : List ℕ := Nat.digits 10 N\n\n/-- The divisor `33 · 34 · 35 · 36 · 37 · 38 · 39` from the problem. -/\ndef modulus : ℕ := 33 * 34 * 35 * 36 * 37 * 38 * 39\n\n/-- The remainder `r` when `N` is divided by the problem's modulus. -/\ndef remainder (N : ℕ) : ℕ := N % modulus\n\n/-- `N` is a natural number with exactly 54 decimal digits, each digit being\n`0` or `1`, and with leading digit `1`.\n\n`decimalDigits N` is little-endian, so its length is the number of decimal\ndigits and the head of its reverse is the leading (most significant) digit.\nRequiring the leading digit to be `1` records the source's parenthetical and\nrules out a leading zero. -/\ndef Is54DigitBinary (N : ℕ) : Prop :=\n (decimalDigits N).length = 54 ∧\n (∀ d : ℕ, d ∈ decimalDigits N → d = 0 ∨ d = 1) ∧\n (decimalDigits N).reverse.head? = some 1\n\n/-- The assertion to be proved: for every natural number `N` having exactly\n54 decimal digits, all of which are `0` or `1` (hence with leading digit `1`),\nthe remainder of `N` on division by `33 * 34 * 35 * 36 * 37 * 38 * 39` is\nstrictly greater than `100000`. -/\ndef Target : Prop :=\n ∀ N : ℕ, Is54DigitBinary N → remainder N > 100000\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b08a0df6-6b21-525a-a896-7ba932e20464", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d83ff7bba891f2ca4f538d97396a476454e2ffec15d983d9b08895520c8e2e4b", "task_path": "tasks/nmp3_b08a0df6-6b21-525a-a896-7ba932e20464", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b08a0df6-6b21-525a-a896-7ba932e20464", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b0e475b0-6731-5260-8401-28240e48e4ce", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Bob starts with a single pile of 100 rocks. In each turn he selects a pile and splits it into two non‑empty piles of his choice. He continues until there are 100 piles, each containing one rock. Prove that at some intermediate stage there exists a collection of 30 piles whose total number of rocks is exactly 60.\nimport Mathlib.Algebra.BigOperators.Group.Multiset.Basic\n\n/-!\n# Bob's pile-splitting process\n\nThis file formalizes the statement of the problem, not its proof. A stage is a\nmultiset of positive pile sizes; the multiset records the distinct piles, and\npiles with the same size are represented by their multiplicity.\n-/\n\nnamespace Problem\n\n/-- A legal one-turn transition: one pile of size `n` is removed and replaced by\ntwo nonempty piles of sizes `a` and `b`, where `a + b = n`. -/\ndef Split (before after : Multiset ℕ) : Prop :=\n ∃ n : ℕ, n ∈ before ∧\n ∃ a b : ℕ, 0 < a ∧ 0 < b ∧ a + b = n ∧\n after = (before.erase n) + ({a, b} : Multiset ℕ)\n\n/-- A complete splitting process. There are 100 stages, indexed by\n`0, …, 99`. Stage 0 is the initial pile of 100 rocks, stage 99 consists of\n100 one-rock piles, and every consecutive pair of stages is related by one\nlegal split. -/\ndef SplittingProcess (stages : Fin 100 → Multiset ℕ) : Prop :=\n stages 0 = ({100} : Multiset ℕ) ∧\n stages (Fin.last 99) = Multiset.replicate 100 1 ∧\n ∀ i : Fin 99, Split (stages i.castSucc) (stages i.succ)\n\n/-- A stage contains a collection of 30 distinct piles whose sizes sum to 60.\nThe multiset `collection` is a submultiset of `stage`, so it chooses actual\npiles from the stage without identifying piles of equal size. -/\ndef HasThirtyPilesSumSixty (stage : Multiset ℕ) : Prop :=\n ∃ collection : Multiset ℕ,\n collection ≤ stage ∧\n collection.card = 30 ∧\n collection.sum = 60\n\n/-- At a genuinely intermediate stage (after at least one split and before\nthe final one-rock stage), there is a collection of 30 piles summing to 60. -/\ndef HasIntermediateThirtyPilesSumSixty (stages : Fin 100 → Multiset ℕ) : Prop :=\n ∃ i : Fin 100, 0 < i.val ∧ i.val < 99 ∧\n HasThirtyPilesSumSixty (stages i)\n\n/-- The asserted statement: for every complete legal sequence of splits from\none pile of 100 rocks to 100 one-rock piles, some intermediate stage contains\n30 piles whose total number of rocks is exactly 60. -/\ndef Target : Prop :=\n ∀ stages : Fin 100 → Multiset ℕ,\n SplittingProcess stages → HasIntermediateThirtyPilesSumSixty stages\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b0e475b0-6731-5260-8401-28240e48e4ce", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d3191c6984577c57d0bf4e94e0314c8834c66b741ba4e5bd94b4e923176df913", "task_path": "tasks/nmp3_b0e475b0-6731-5260-8401-28240e48e4ce", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b0e475b0-6731-5260-8401-28240e48e4ce", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b0e8b567-8b83-5b72-b035-1ad021a4f8ab", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a_1,\\dots,a_n\\) and \\(b_1,\\dots,b_n\\) be non‑negative real numbers, where \\(n\\ge 2\\) is an integer. Prove that \n-- \\[\n-- \\Biggl(\\sum_{i=1}^{n} a_i\\sum_{\\substack{j=1\\\\ j\\neq i}}^{n} b_j\\Biggr)^{\\,n-1}\n-- \\;\\ge\\;\n-- (n-1)^{\\,n-1}\\Biggl(\\sum_{i=1}^{n} a_i\\Biggr)^{\\,n-2}\n-- \\Biggl(\\sum_{i=1}^{n} a_i\\prod_{\\substack{j=1\\\\ j\\neq i}}^{n} b_j\\Biggr)\\,.\n-- \\]\nimport Mathlib\n\n/-!\nFormal statement of the non-negative real inequality from `problem.md`.\n\nThe source asks to prove, for every integer `n ≥ 2` and all non-negative\nreal sequences `a` and `b` of length `n`,\n\n`(∑ i, a i * ∑ (j ≠ i), b j)^(n-1) ≥\n (n-1)^(n-1) * (∑ i, a i)^(n-2) * (∑ i, a i * ∏ (j ≠ i), b j)`.\n\nNo proof is supplied here; `Target` is the proposition to be proved.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The sum of `b j` over all indices `j` other than `i`. The index type is\n`Fin n`, representing `1, ..., n`. -/\ndef InnerSum {n : ℕ} (b : Fin n → ℝ) (i : Fin n) : ℝ :=\n Finset.sum (Finset.univ.erase i) b\n\n/-- The product of `b j` over all indices `j` other than `i`. The index type\nis `Fin n`, representing `1, ..., n`. -/\ndef InnerProd {n : ℕ} (b : Fin n → ℝ) (i : Fin n) : ℝ :=\n Finset.prod (Finset.univ.erase i) b\n\n/-- The left-hand side of the displayed inequality. -/\ndef LeftSide {n : ℕ} (a b : Fin n → ℝ) : ℝ :=\n (∑ i : Fin n, a i * InnerSum b i) ^ (n - 1)\n\n/-- The right-hand side of the displayed inequality. -/\ndef RightSide {n : ℕ} (a b : Fin n → ℝ) : ℝ :=\n (((n - 1 : ℕ) : ℝ) ^ (n - 1)) *\n (∑ i : Fin n, a i) ^ (n - 2) *\n (∑ i : Fin n, a i * InnerProd b i)\n\n/-- The displayed inequality itself, for a fixed length and sequences. -/\ndef Inequality {n : ℕ} (a b : Fin n → ℝ) : Prop :=\n LeftSide a b ≥ RightSide a b\n\n/-- The assertion of the problem: the displayed inequality holds for every\nnatural number `n ≥ 2` and every pair of non-negative real sequences indexed\nby `Fin n`. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 2 ≤ n →\n ∀ (a b : Fin n → ℝ),\n (∀ i : Fin n, 0 ≤ a i) →\n (∀ i : Fin n, 0 ≤ b i) →\n Inequality a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b0e8b567-8b83-5b72-b035-1ad021a4f8ab", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "19f599525114ccb68f6f2168d9c1e69fd08e01027e6fa6604e148543ecfb735b", "task_path": "tasks/nmp3_b0e8b567-8b83-5b72-b035-1ad021a4f8ab", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b0e8b567-8b83-5b72-b035-1ad021a4f8ab", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b12a4c06-cc1a-5353-9a5d-b45ec1290555", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,\\;y,\\;z>0$. Prove that \n-- \n-- \\[\n-- \\frac{x^{2}}{3y^{2}+3z^{2}+2(x-y)(x-z)}\n-- +\\frac{y^{2}}{3z^{2}+3x^{2}+2(y-z)(y-x)}\n-- +\\frac{z^{2}}{3x^{2}+3y^{2}+2(z-x)(z-y)}\n-- \\;\\ge\\;\\frac12\\, .\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of a cyclic rational inequality\n\nThis file states the inequality from the problem. It contains no proof of\nthe inequality; the proposition is packaged as a `Prop`-valued definition so\nthat the statement can be checked independently of a solution.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The denominator of the first summand. -/\ndef denominatorX (x y z : ℝ) : ℝ :=\n 3 * y ^ 2 + 3 * z ^ 2 + 2 * (x - y) * (x - z)\n\n/-- The denominator of the second summand. -/\ndef denominatorY (x y z : ℝ) : ℝ :=\n 3 * z ^ 2 + 3 * x ^ 2 + 2 * (y - z) * (y - x)\n\n/-- The denominator of the third summand. -/\ndef denominatorZ (x y z : ℝ) : ℝ :=\n 3 * x ^ 2 + 3 * y ^ 2 + 2 * (z - x) * (z - y)\n\n/-- The first summand. -/\ndef termX (x y z : ℝ) : ℝ :=\n x ^ 2 / denominatorX x y z\n\n/-- The second summand. -/\ndef termY (x y z : ℝ) : ℝ :=\n y ^ 2 / denominatorY x y z\n\n/-- The third summand. -/\ndef termZ (x y z : ℝ) : ℝ :=\n z ^ 2 / denominatorZ x y z\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (x y z : ℝ) : ℝ :=\n termX x y z + termY x y z + termZ x y z\n\n/-- The positivity assumptions on the three variables. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The asserted comparison, for fixed positive values of the variables. -/\ndef Inequality (x y z : ℝ) : Prop :=\n lhs x y z ≥ (1 : ℝ) / 2\n\n/-- The complete target assertion. -/\ndef Target : Prop :=\n ∀ (x y z : ℝ), Admissible x y z → Inequality x y z\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b12a4c06-cc1a-5353-9a5d-b45ec1290555", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "99ef1cebf4278dc4cb1b4673d78ed531103de9664e8690431df4bc20f88e479d", "task_path": "tasks/nmp3_b12a4c06-cc1a-5353-9a5d-b45ec1290555", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b12a4c06-cc1a-5353-9a5d-b45ec1290555", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b136aaa1-137c-5637-9723-92a22b72d83a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}\\ge \\frac{a}{\\sqrt{a^{2}+8bc}}+\\frac{b}{\\sqrt{b^{2}+8ac}}+\\frac{c}{\\sqrt{c^{2}+8ab}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe problem asks, for positive real numbers `a`, `b`, and `c`, to prove\n\\[\n \\frac{a^2+b^2+c^2}{ab+bc+ca}\n \\ge\n \\frac{a}{\\sqrt{a^2+8bc}}\n +\\frac{b}{\\sqrt{b^2+8ac}}\n +\\frac{c}{\\sqrt{c^2+8ab}}.\n\\]\n-/\n\nnamespace Problem\n\n/-- The assertion in the problem: for all positive real numbers `a`, `b`, `c`,\nthe stated inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c →\n (a ^ 2 + b ^ 2 + c ^ 2) /\n (a * b + b * c + c * a) ≥\n a / Real.sqrt (a ^ 2 + 8 * b * c) +\n b / Real.sqrt (b ^ 2 + 8 * a * c) +\n c / Real.sqrt (c ^ 2 + 8 * a * b)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b136aaa1-137c-5637-9723-92a22b72d83a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "da145047691e3beb9d3aa0b99c05b44919ffb4d77eae06e9be3bb940dae6984e", "task_path": "tasks/nmp3_b136aaa1-137c-5637-9723-92a22b72d83a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b136aaa1-137c-5637-9723-92a22b72d83a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b14c7f21-7065-5e23-81d4-2cb9695d47be", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Provide an example of a symmetric, homogeneous polynomial $P(x,y,z)$ of degree $6$ with real coefficients such that \n-- (a) $P(x,1,0)\\ge0$ for every real $x$; \n-- (b) $P(x,1,1)\\ge0$ for every real $x$; \n-- (c) there exist real numbers $a,b,c$ with $P(a,b,c)<0$.\nimport Mathlib.Basic.Real.Basic\nimport Mathlib.RingTheory.MvPolynomial.Homogeneous\nimport Mathlib.RingTheory.MvPolynomial.Symmetric.Defs\n\n/-!\n# Formal statement: a symmetric sextic in three variables with prescribed signs\n\nThe original problem asks for an example of a real symmetric homogeneous\npolynomial `P(x,y,z)` of degree `6` satisfying three conditions. We represent\nthe polynomial as an element of `MvPolynomial (Fin 3) Real`, with the variable\nindices `0`, `1`, `2` corresponding to `x`, `y`, `z`, respectively.\n\nThis file contains statement definitions only. In particular, no example\npolynomial is supplied and no proof of existence is asserted as a theorem.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The type of real-coefficient polynomials in the three variables `x`, `y`, `z`. -/\nabbrev RealPolynomial3 : Type := MvPolynomial (Fin 3) Real\n\n/-- Evaluate a polynomial at `(x,y,z)`, where index `0` is `x`, index `1` is `y`,\nand index `2` is `z`. -/\ndef evalAt (P : RealPolynomial3) (x y z : Real) : Real :=\n MvPolynomial.eval ![x, y, z] P\n\n/-- `P` is a nonzero symmetric homogeneous polynomial of total degree `6`.\nThe `totalDegree = 6` component excludes the zero polynomial, for which\n`MvPolynomial.IsHomogeneous P 6` would otherwise hold vacuously. -/\ndef IsSymmetricHomogeneousDegreeSix (P : RealPolynomial3) : Prop :=\n P.IsSymmetric ∧ P.IsHomogeneous 6 ∧ P.totalDegree = 6\n\n/-- Condition (a): `P(x,1,0) ≥ 0` for every real `x`. -/\ndef ConditionA (P : RealPolynomial3) : Prop :=\n ∀ x : Real, 0 ≤ evalAt P x 1 0\n\n/-- Condition (b): `P(x,1,1) ≥ 0` for every real `x`. -/\ndef ConditionB (P : RealPolynomial3) : Prop :=\n ∀ x : Real, 0 ≤ evalAt P x 1 1\n\n/-- Condition (c): some real triple `(a,b,c)` makes `P(a,b,c)` negative. -/\ndef ConditionC (P : RealPolynomial3) : Prop :=\n ∃ a b c : Real, evalAt P a b c < 0\n\n/-- The admissibility predicate for an example: `P` has the requested symmetry,\nhomogeneity, degree, and satisfies conditions (a), (b), and (c). -/\ndef IsAdmissible (P : RealPolynomial3) : Prop :=\n IsSymmetricHomogeneousDegreeSix P ∧ ConditionA P ∧ ConditionB P ∧ ConditionC P\n\n/-- A proposed polynomial is a correct answer exactly when it is admissible. -/\ndef AnswerCorrect (P : RealPolynomial3) : Prop :=\n IsAdmissible P\n\n/-- The proposition that the requested example exists. -/\ndef Target : Prop :=\n ∃ P : RealPolynomial3, AnswerCorrect P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b14c7f21-7065-5e23-81d4-2cb9695d47be", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4957247b9958848c22925d553ba248342f32c4793585c683d97ec4c593a730d4", "task_path": "tasks/nmp3_b14c7f21-7065-5e23-81d4-2cb9695d47be", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b14c7f21-7065-5e23-81d4-2cb9695d47be", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b16ceec4-2568-5c49-a68e-76c4f715bf40", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for positive real numbers $a,b,c$,\n-- \\[\n-- a\\sqrt{a^{2}+2bc}+b\\sqrt{b^{2}+2ac}+c\\sqrt{c^{2}+2ab}\\ge \\sqrt{3}\\,(ab+bc+ca).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nFor positive real numbers `a`, `b`, and `c`, the problem asks to prove\n\n`a * sqrt (a^2 + 2bc) + b * sqrt (b^2 + 2ac) + c * sqrt (c^2 + 2ab)\n ≥ sqrt 3 * (ab + bc + ca)`.\n\nThe principal real square root is represented by `Real.sqrt`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * Real.sqrt (a ^ 2 + 2 * b * c) +\n b * Real.sqrt (b ^ 2 + 2 * a * c) +\n c * Real.sqrt (c ^ 2 + 2 * a * b)\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n Real.sqrt 3 * (a * b + b * c + c * a)\n\n/-- The assertion to be proved: for all positive real numbers `a`, `b`, and `c`,\nthe given square-root inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → rhs a b c ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b16ceec4-2568-5c49-a68e-76c4f715bf40", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b24861078a2fd0a693a150e92eced86096574a8d3636fe7b6c195dff08c0f9cc", "task_path": "tasks/nmp3_b16ceec4-2568-5c49-a68e-76c4f715bf40", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b16ceec4-2568-5c49-a68e-76c4f715bf40", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b17f9cac-6a61-5433-a8c5-7da185958a66", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $ab+bc+ca+2abc=1$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{1}{(2a+1)^2}+2abc\\ge 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a cyclic inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nsatisfying `a*b + b*c + c*a + 2*a*b*c = 1`, that\n\n`1/(2*a+1)^2 + 1/(2*b+1)^2 + 1/(2*c+1)^2 + 2*a*b*c >= 1`.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition imposed on the real parameters in the source\nproblem: all three are positive and `ab + bc + ca + 2abc = 1`. -/\ndef Hypothesis (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a * b + b * c + c * a + 2 * a * b * c = 1\n\n/-- The cyclic sum `∑_cyc 1 / (2a + 1)^2`, expanded as the three terms\ncorresponding to `a`, `b`, and `c`. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n 1 / (2 * a + 1) ^ 2 +\n 1 / (2 * b + 1) ^ 2 +\n 1 / (2 * c + 1) ^ 2\n\n/-- The left-hand side of the asserted inequality: the cyclic sum plus `2abc`. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n CyclicSum a b c + 2 * a * b * c\n\n/-- The assertion to be proved: for every triple of positive reals satisfying\n`ab + bc + ca + 2abc = 1`, the displayed cyclic sum plus `2abc` is at least\n`1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Hypothesis a b c → LHS a b c ≥ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b17f9cac-6a61-5433-a8c5-7da185958a66", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f02e8c9f163e44e87a93a3f064e15e7f77392564c97ed505db9fec857f0d4d0e", "task_path": "tasks/nmp3_b17f9cac-6a61-5433-a8c5-7da185958a66", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b17f9cac-6a61-5433-a8c5-7da185958a66", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b1a010e7-c0a9-5b08-972f-93fa5b77845e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 3$ be an integer. Prove that the set \n-- $$X=\\{1,2,3,\\dots ,n^{2}-n\\}$$ \n-- can be expressed as the disjoint union of two non‑empty subsets $A$ and $B$ such that neither $A$ nor $B$ contains $n$ distinct elements \n-- $$a_{1}10^{9}$ be a prime such that $4p+1$ is also prime. Prove that the decimal expansion of $\\displaystyle\\frac{1}{4p+1}$ contains every digit $0,1,\\dots,9$ at least once.\nimport Mathlib.Data.Rat.Floor\nimport Mathlib.Data.Nat.Prime.Defs\n\n/-!\n# Decimal expansion of the reciprocal of `4 * p + 1`\n\nThis file formalizes the statement of the problem. It defines the digits of\nthe canonical infinite decimal expansion of a rational number and states,\nwithout proving, the requested universal assertion.\n-/\n\nnamespace Problem\n\n/-- The `(position + 1)`-st digit after the decimal point in the canonical\ninfinite decimal expansion of `x`.\n\nFor `0 ≤ x < 1`, this is the units digit of\n`⌊x * 10 ^ (position + 1)⌋`, which is exactly the next decimal digit produced\nby long division. The result is packaged as an element of `Fin 10`. -/\nnoncomputable def decimalDigit (x : ℚ) (position : ℕ) : Fin 10 :=\n ⟨⌊x * (10 : ℚ) ^ (position + 1)⌋₊ % 10, Nat.mod_lt _ (by decide)⟩\n\n/-- The decimal expansion of `x` contains every digit `0, 1, ..., 9` at least\nonce. The quantified positions are the positions after the decimal point. -/\ndef ContainsEveryDecimalDigit (x : ℚ) : Prop :=\n ∀ digit : Fin 10, ∃ position : ℕ, decimalDigit x position = digit\n\n/-- The full quantified assertion of the problem: for every natural prime\n`p` strictly greater than `10 ^ 9` for which `4 * p + 1` is also prime, the\ndecimal expansion of `1 / (4 * p + 1)` contains every digit `0, 1, ..., 9` at\nleast once. -/\ndef Target : Prop :=\n ∀ p : ℕ,\n 10 ^ 9 < p →\n Nat.Prime p →\n Nat.Prime (4 * p + 1) →\n ContainsEveryDecimalDigit ((1 : ℚ) / ((4 * p + 1 : ℕ) : ℚ))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b25b09c5-f7fa-5bfb-958b-ccf3316c40f7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "671ed930b973b028b0703c8e6f6093853ed11a3a9ae4916ab8166a78d6b82f9f", "task_path": "tasks/nmp3_b25b09c5-f7fa-5bfb-958b-ccf3316c40f7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b25b09c5-f7fa-5bfb-958b-ccf3316c40f7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b26b6df0-af8d-5643-adf4-020b4a523a07", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be the side lengths of a triangle (so $a+b>c$, $a+c>b$, $b+c>a$). Let $r_a,r_b,r_c$ denote the exradii opposite $A,B,C$ respectively, where $r_a=\\dfrac{\\Delta}{s-a}$ with $s=\\frac{a+b+c}{2}$ and $\\Delta$ the area of the triangle. Let $m_a,m_b,m_c$ denote the lengths of the medians from $A,B,C$, where $m_a=\\frac12\\sqrt{2b^2+2c^2-a^2}$ (and cyclically). Prove that\n-- $$r_a+r_b+r_c\\;\\ge\\;m_a+m_b+m_c.$$\nimport Mathlib.Analysis.Real.Sqrt\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The semiperimeter `s = (a + b + c) / 2` of a triangle with side lengths `a`, `b`, `c`. -/\ndef semiperimeter (a b c : ℝ) : ℝ :=\n (a + b + c) / 2\n\n/-- The area of a triangle with side lengths `a`, `b`, `c`, expressed by Heron's formula.\n\nFor positive numbers satisfying the strict triangle inequalities, this is the ordinary\n(non-oriented) area of the unique Euclidean triangle with those side lengths. -/\ndef triangleArea (a b c : ℝ) : ℝ :=\n Real.sqrt (semiperimeter a b c *\n (semiperimeter a b c - a) *\n (semiperimeter a b c - b) *\n (semiperimeter a b c - c))\n\n/-- The exradius opposite the vertex `A` (opposite side `a`): `r_a = Δ / (s - a) etc. -/\ndef exradiusA (a b c : ℝ) : ℝ :=\n triangleArea a b c / (semiperimeter a b c - a)\n\n/-- The exradius opposite the vertex `B` (opposite side `b`). -/\ndef exradiusB (a b c : ℝ) : ℝ :=\n triangleArea a b c / (semiperimeter a b c - b)\n\n/-- The exradius opposite the vertex `C` (opposite side `c`). -/\ndef exradiusC (a b c : ℝ) : ℝ :=\n triangleArea a b c / (semiperimeter a b c - c)\n\n/-- The median from vertex `A`: `m_a = (1 / 2) * sqrt (2 b² + 2 c² - a²)`. -/\ndef medianA (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * b ^ 2 + 2 * c ^ 2 - a ^ 2)\n\n/-- The median from vertex `B`. -/\ndef medianB (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * c ^ 2 + 2 * a ^ 2 - b ^ 2)\n\n/-- The median from vertex `C`. -/\ndef medianC (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * a ^ 2 + 2 * b ^ 2 - c ^ 2)\n\n/-- The sum `r_a + r_b + r_c` of the three exradii. -/\ndef exradiusSum (a b c : ℝ) : ℝ :=\n exradiusA a b c + exradiusB a b c + exradiusC a b c\n\n/-- The sum `m_a + m_b + m_c` of the three medians. -/\ndef medianSum (a b c : ℝ) : ℝ :=\n medianA a b c + medianB a b c + medianC a b c\n\n/-- The three strict positivity assumptions on the side lengths. -/\ndef SideLengthsPositive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The three strict triangle inequalities supplied in the problem. -/\ndef StrictTriangleInequalities (a b c : ℝ) : Prop :=\n a + b > c ∧ a + c > b ∧ b + c > a\n\n/-- The hypothesis that positive reals `a`, `b`, `c` are the side lengths of a\n(non-degenerate) triangle. The positivity conditions and the three displayed\ninequalities are exactly those supplied in the problem. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n SideLengthsPositive a b c ∧ StrictTriangleInequalities a b c\n\n/-- The assertion to be proved: for all positive side lengths of a triangle, the sum of\nthe three exradii is at least the sum of the three medians. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsTriangleSideLengths a b c →\n exradiusSum a b c ≥ medianSum a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b26b6df0-af8d-5643-adf4-020b4a523a07", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1bc45a7e6faa3fb99197090ec0db7132abe24548654fb1e228164dfa40fbd6ae", "task_path": "tasks/nmp3_b26b6df0-af8d-5643-adf4-020b4a523a07", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b26b6df0-af8d-5643-adf4-020b4a523a07", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b26bf750-3689-5249-8c56-3d72322dc0a7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c,d>0\\) satisfy \\(abcd=1\\) and \n-- \\[\n-- a+b+c+d>\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{d}+\\frac{d}{a}.\n-- \\]\n-- Prove that \n-- \\[\n-- a+b+c+d<\\frac{b}{a}+\\frac{c}{b}+\\frac{d}{c}+\\frac{a}{d}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypothesis predicate for real numbers `a b c d`: all four are strictly\npositive, their product is one, and the first four-term ratio sum is strictly\nless than the four-term sum. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧\n a * b * c * d = 1 ∧\n a / b + b / c + c / d + d / a < a + b + c + d\n\n/-- The conclusion requested by the problem, for real numbers `a b c d`. -/\ndef Conclusion (a b c d : ℝ) : Prop :=\n a + b + c + d < b / a + c / b + d / c + a / d\n\n/-- The complete universally quantified statement: whenever positive real\nnumbers `a b c d` have product one and satisfy the displayed strict inequality,\nthe reverse-oriented ratio-sum inequality holds. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Conclusion a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b26bf750-3689-5249-8c56-3d72322dc0a7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "19a0dfb3dc8bc91e6be31f901a0b4a80a81b27f2868496fbd785587c10749cdc", "task_path": "tasks/nmp3_b26bf750-3689-5249-8c56-3d72322dc0a7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b26bf750-3689-5249-8c56-3d72322dc0a7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b27ddefe-237a-523e-834b-7ac5866fffbc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be positive real numbers. Prove that \n-- \\[\n-- 9\\bigl(a^{4}+b^{4}+c^{4}\\bigr)^{2}\\;\\ge\\;\\bigl(a^{5}+b^{5}+c^{5}\\bigr)\\,\\bigl(a+b+c\\bigr)^{3}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion: for all positive real numbers `a`, `b`, and `c`, the\ninequality `9 (a^4 + b^4 + c^4)^2 ≥ (a^5 + b^5 + c^5) (a + b + c)^3`\nholds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n 9 * (a ^ 4 + b ^ 4 + c ^ 4) ^ 2 ≥\n (a ^ 5 + b ^ 5 + c ^ 5) * (a + b + c) ^ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b27ddefe-237a-523e-834b-7ac5866fffbc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "49980c8d9eb73c845e573ff3954b5a80e2fa84e932c1419292b967b6a9b9ef93", "task_path": "tasks/nmp3_b27ddefe-237a-523e-834b-7ac5866fffbc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b27ddefe-237a-523e-834b-7ac5866fffbc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b29d5a86-09a5-5ad4-acce-a624543818fa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle with incircle $(I)$ and circumcircle $(O)$. \n-- Let $D$, $E$, $F$ be the points where $(I)$ touches $BC$, $CA$, and $AB$, respectively. \n-- Let $H$ be the foot of the perpendicular from $D$ to $EF$ (i.e. $DH\\perp EF$). \n-- Let $M$ be the point on $(O)$ such that $AM$ is a diameter of $(O)$. \n-- Prove that the points $I$, $H$, and $M$ are collinear.\nimport Mathlib\n\n/-!\n# Formal statement of the incircle / intouch / diameter problem\n\nWe work in the Euclidean plane represented by `ℝ × ℝ`. All geometric\nnotions used in the statement are defined explicitly below, so that the\ntarget proposition records both the hypotheses and the conclusion of the\nproblem without invoking an unproved assertion.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A point of the Euclidean plane, represented by its Cartesian coordinates. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- The displacement vector from `Y` to `X`. -/\ndef delta (X Y : Point) : Point :=\n (X.1 - Y.1, X.2 - Y.2)\n\n/-- The Euclidean dot product of two displacement vectors. -/\ndef dot2 (u v : Point) : ℝ :=\n u.1 * v.1 + u.2 * v.2\n\n/-- The oriented area (twice the signed area) determinant of two vectors. -/\ndef det2 (u v : Point) : ℝ :=\n u.1 * v.2 - u.2 * v.1\n\n/-- The square of the Euclidean distance between two points. -/\ndef distSq (X Y : Point) : ℝ :=\n (X.1 - Y.1) ^ 2 + (X.2 - Y.2) ^ 2\n\n/-- Three points are collinear when the triangle they span has zero area. -/\ndef Collinear (X Y Z : Point) : Prop :=\n det2 (delta Y X) (delta Z X) = 0\n\n/-- The line through `X` and `Y` is perpendicular to the line through `P` and `Q`. -/\ndef Perpendicular (X Y P Q : Point) : Prop :=\n dot2 (delta Y X) (delta Q P) = 0\n\n/-- `X` is the midpoint of the segment joining `Y` and `Z`. -/\ndef Midpoint (X Y Z : Point) : Prop :=\n X.1 = (Y.1 + Z.1) / 2 ∧ X.2 = (Y.2 + Z.2) / 2\n\n/-- `X` lies in the open segment joining `Y` and `Z`. -/\ndef StrictlyOnSegment (X Y Z : Point) : Prop :=\n ∃ t : ℝ,\n 0 < t ∧ t < 1 ∧\n X.1 = (1 - t) * Y.1 + t * Z.1 ∧\n X.2 = (1 - t) * Y.2 + t * Z.2\n\n/-- `X` lies in the strict interior of the triangle `ABC`. -/\ndef TriangleInterior (A B C X : Point) : Prop :=\n ∃ u v w : ℝ,\n 0 < u ∧ 0 < v ∧ 0 < w ∧ u + v + w = 1 ∧\n X.1 = u * A.1 + v * B.1 + w * C.1 ∧\n X.2 = u * A.2 + v * B.2 + w * C.2\n\n/-- The three vertices `A`, `B`, `C` form a nondegenerate triangle. -/\ndef IsTriangle (A B C : Point) : Prop :=\n ¬ Collinear A B C\n\n/-- `(I)` is the incircle of triangle `ABC`, with contact points `D`, `E`, `F`\non `BC`, `CA`, `AB`, respectively. The center `I` is strictly inside the\ntriangle, each contact point is in the relative interior of its side, the\nradius to each contact point is perpendicular to that side, and the three\nradii are equal. -/\ndef IsIncircleWithTouchpoints\n (I D E F A B C : Point) : Prop :=\n TriangleInterior A B C I ∧\n StrictlyOnSegment D B C ∧\n StrictlyOnSegment E C A ∧\n StrictlyOnSegment F A B ∧\n Perpendicular I D B C ∧\n Perpendicular I E C A ∧\n Perpendicular I F A B ∧\n (0 : ℝ) < distSq I D ∧\n distSq I D = distSq I E ∧\n distSq I E = distSq I F\n\n/-- `(O)` is the circumcircle of triangle `ABC`, with centre `O`: the three\nvertices lie at one common positive distance from `O`. -/\ndef IsCircumcircle (O A B C : Point) : Prop :=\n (0 : ℝ) < distSq O A ∧\n distSq O A = distSq O B ∧\n distSq O A = distSq O C\n\n/-- `AM` is a diameter of the circle with centre `O`. Equivalently, `O` is\nthe midpoint of `A` and `M`, and `M` is the other point of the circle on the\nline through `A` and `O`. -/\ndef IsDiameterEndpoint (O A M : Point) : Prop :=\n Midpoint O A M ∧\n A ≠ M ∧\n distSq O M = distSq O A\n\n/-- `H` is the perpendicular foot from `X` to the line through `P` and `Q`.\nThe condition `P ≠ Q` makes `PQ` a genuine line. -/\ndef IsPerpendicularFoot (X H P Q : Point) : Prop :=\n P ≠ Q ∧\n Collinear P Q H ∧\n Perpendicular H X P Q\n\n/-- The complete proposition asserted by the problem: for every nondegenerate\ntriangle `ABC` with incircle centre `I` and contact points `D`, `E`, `F`, with\ncircumcentre `O`, with `H` the perpendicular foot from `D` to line `EF`, and\nwith `M` the endpoint opposite `A` on the circumcircle, the points `I`, `H`, and\n`M` are collinear. -/\ndef Target : Prop :=\n ∀ (A B C I O D E F H M : Point),\n IsTriangle A B C →\n IsIncircleWithTouchpoints I D E F A B C →\n IsCircumcircle O A B C →\n IsPerpendicularFoot D H E F →\n IsDiameterEndpoint O A M →\n Collinear I H M\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b29d5a86-09a5-5ad4-acce-a624543818fa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "39b8fa9dbcc355d98a19572548472a83f30a61ec1a4fb00bd49961b186cb11a5", "task_path": "tasks/nmp3_b29d5a86-09a5-5ad4-acce-a624543818fa", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b29d5a86-09a5-5ad4-acce-a624543818fa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b2a3ee89-aa9d-5aa3-8896-4c98c34e6fdb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\{s_i\\}_{i=1}^\\infty$ and $\\{t_i\\}_{i=1}^\\infty$ be infinite, non‑constant sequences of rational numbers (i.e. not all terms are equal). Suppose that for every pair of indices $i,j$ the product \n-- \\[\n-- (s_i-s_j)(t_i-t_j)\n-- \\] \n-- is an integer. Prove that there exists a rational number $r$ such that for all $i,j$ both \n-- \\[\n-- (s_i-s_j)r\\quad\\text{and}\\quad\\frac{t_i-t_j}{r}\n-- \\] \n-- are integers.\nimport Mathlib\n\n/-!\n# Formalization of the rational-sequence splitting problem\n\nThe source problem speaks of sequences indexed by the positive integers\n`i = 1, 2, ...`. We represent the index type by `ℕ+`. A rational number is\ncalled an integer here when it is the image of some integer under the canonical\nembedding `ℤ → ℚ`.\n-/\n\nnamespace Problem\n\n/-- A rational number is an integer if it is the cast of an integer. -/\ndef IsInteger (q : ℚ) : Prop :=\n ∃ z : ℤ, q = (z : ℚ)\n\n/-- A sequence is non-constant when two of its terms are unequal. This is\nthe source phrase \"not all terms are equal\". -/\ndef Nonconstant (u : ℕ+ → ℚ) : Prop :=\n ∃ i j : ℕ+, u i ≠ u j\n\n/-- The assumptions of the problem for two rational sequences `s` and `t`:\nboth are non-constant, and every pairwise product of differences is an\ninteger. -/\ndef Hypotheses (s t : ℕ+ → ℚ) : Prop :=\n Nonconstant s ∧\n Nonconstant t ∧\n ∀ i j : ℕ+, IsInteger ((s i - s j) * (t i - t j))\n\n/-- The conclusion of the problem: there is a nonzero rational `r` for which\nall first differences times `r` and all second differences divided by `r` are\nintegers. Nonzeroness is the definedness condition implicit in the quotient\n`(t i - t j) / r`. -/\ndef Conclusion (s t : ℕ+ → ℚ) : Prop :=\n ∃ r : ℚ, r ≠ 0 ∧\n ∀ i j : ℕ+,\n IsInteger ((s i - s j) * r) ∧\n IsInteger ((t i - t j) / r)\n\n/-- The complete assertion of the source problem. -/\ndef Target : Prop :=\n ∀ s t : ℕ+ → ℚ, Hypotheses s t → Conclusion s t\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b2a3ee89-aa9d-5aa3-8896-4c98c34e6fdb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "61739f16077bf8d64d839bfd833201383b0f20ae065845e644e31fca5ecafd1f", "task_path": "tasks/nmp3_b2a3ee89-aa9d-5aa3-8896-4c98c34e6fdb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b2a3ee89-aa9d-5aa3-8896-4c98c34e6fdb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b2c1e42a-dc9c-57b3-aa28-9d75a0e1be4c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\{c_i\\}_{i=0}^{\\infty}$ be a sequence of non‑negative real numbers with $c_{2017}>0$. Define a sequence of polynomials by \n-- \\[\n-- P_{-1}(x)=0,\\qquad P_0(x)=1,\\qquad P_{n+1}(x)=xP_n(x)+c_nP_{\\,n-1}(x)\\qquad(n\\ge0).\n-- \\] \n-- Prove that there is no integer $n>2017$ and real number $c$ such that \n-- \\[\n-- P_{2n}(x)=P_n\\!\\bigl(x^{2}+c\\bigr)\\quad\\text{for all real }x .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the polynomial recursion problem\n\nThe source problem fixes a sequence of non-negative real numbers `c_i`,\ndefines the polynomials `P_n` by a second-order recurrence, and asks to\nprove that no pair `(n, c)` with integer `n > 2017` and real `c` makes\n`P_{2n}(x) = P_n(x^2 + c)` hold for every real `x`.\n\nThis file records the mathematical statement as a proposition. It does\nnot contain a proof of the proposition.\n-/\n\nnamespace Problem\n\n/-- The initial polynomial `P_{-1}` from the source problem. -/\nnoncomputable def PNegOne (_c : ℕ → ℝ) : Polynomial ℝ :=\n 0\n\n/-- The explicit value of the initial polynomial `P_{-1}`. -/\ntheorem PNegOne_eq_zero (c : ℕ → ℝ) : PNegOne c = 0 := rfl\n\n/-- The auxiliary pair `(P_{n-1}, P_n)` of consecutive polynomials.\n\nThe recursion starts with `(P_{-1}, P_0) = (0, 1)`. At each step the\ncoefficient called `c_n` in the problem is the one used to pass from\n`(P_{n-1}, P_n)` to `(P_n, P_{n+1})`. -/\nnoncomputable def polynomialPair (c : ℕ → ℝ) : ℕ → Polynomial ℝ × Polynomial ℝ\n | 0 => (PNegOne c, 1)\n | n + 1 =>\n let p := polynomialPair c n\n (p.2, Polynomial.X * p.2 + Polynomial.C (c n) * p.1)\n\n/-- `P c n` is the polynomial `P_n` from the problem, for `n ≥ 0`.\n\nThe definition is obtained as the second component of the consecutive-pair\nconstruction above, so it has the supplied initial condition `P_0 = 1`\nand satisfies the supplied recurrence for every `n ≥ 0`. -/\nnoncomputable def P (c : ℕ → ℝ) (n : ℕ) : Polynomial ℝ :=\n (polynomialPair c n).2\n\n/-- One step of the consecutive-pair recursion. -/\ntheorem polynomialPair_succ (c : ℕ → ℝ) (n : ℕ) :\n polynomialPair c (n + 1) =\n ((polynomialPair c n).2,\n Polynomial.X * (polynomialPair c n).2 +\n Polynomial.C (c n) * (polynomialPair c n).1) := by\n simp [polynomialPair]\n\n/-- The initial value `P_0 = 1`. -/\ntheorem P_zero (c : ℕ → ℝ) : P c 0 = 1 := by\n simp [P, polynomialPair]\n\n/-- The value `P_1 = x`, obtained from `P_0 = 1`, `P_{-1} = 0`, and the\nrecursion at `n = 0`. -/\ntheorem P_one (c : ℕ → ℝ) : P c 1 = Polynomial.X := by\n simp [P, polynomialPair, PNegOne]\n\n/-- The recurrence for consecutive polynomials. For the step producing\n`P_{n+1}`, the first component `(polynomialPair c n).1` is `P_{n-1}`\n(with `P_{-1} = 0` when `n = 0`). -/\ntheorem P_recurrence (c : ℕ → ℝ) (n : ℕ) :\n P c (n + 1) =\n Polynomial.X * P c n +\n Polynomial.C (c n) * (polynomialPair c n).1 := by\n simp [P, polynomialPair]\n\n/-- The coefficient sequence is non-negative at every index. -/\ndef CoefficientsNonnegative (c : ℕ → ℝ) : Prop :=\n ∀ i : ℕ, 0 ≤ c i\n\n/-- The distinguished coefficient at index `2017` is strictly positive. -/\ndef Coefficient2017Positive (c : ℕ → ℝ) : Prop :=\n 0 < c 2017\n\n/-- The polynomial identity asserted by the source problem. The equality\nis required at every real input `x`, and the parameter of the shifted\npolynomial is a real number `d` (the problem also uses the symbol `c`\nfor this parameter, which is renamed here to avoid shadowing the\ncoefficient sequence). -/\ndef PolynomialIdentity (c : ℕ → ℝ) (n : ℕ) (d : ℝ) : Prop :=\n ∀ x : ℝ,\n Polynomial.eval x (P c (2 * n)) =\n Polynomial.eval (x ^ 2 + d) (P c n)\n\n/-- There is an admissible integer index `n > 2017` and a real constant\n`d` for which the displayed polynomial identity holds for every real `x`.\n\nBecause `n > 2017` already implies that the index is non-negative, the\ninteger `n` is represented by a natural number. -/\ndef CounterexampleExists (c : ℕ → ℝ) : Prop :=\n ∃ n : ℕ, 2017 < n ∧ ∃ d : ℝ, PolynomialIdentity c n d\n\n/-- The complete assertion to be proved: for every sequence of\nnon-negative real coefficients whose coefficient at index `2017` is\nstrictly positive, no admissible pair `(n, d)` with natural/integer\n`n > 2017` and real `d` satisfies the polynomial identity. -/\ndef Target : Prop :=\n ∀ c : ℕ → ℝ,\n CoefficientsNonnegative c → Coefficient2017Positive c →\n ¬ CounterexampleExists c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b2c1e42a-dc9c-57b3-aa28-9d75a0e1be4c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5f70bee79ac5709fdaf30ff9455bbc3de89f2caf698ca323ffdc364b9daa2770", "task_path": "tasks/nmp3_b2c1e42a-dc9c-57b3-aa28-9d75a0e1be4c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b2c1e42a-dc9c-57b3-aa28-9d75a0e1be4c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b2dc93fa-749a-5b57-af3b-1f90db8c91d8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=1$. Prove that \n-- \\[\n-- \\frac{a}{a^{3}+b^{2}c+c^{2}b}+\\frac{b}{b^{3}+c^{2}a+a^{2}c}+\\frac{c}{c^{3}+a^{2}b+b^{2}a}\\le 1+\\frac{8}{27abc}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nThe problem asks to prove an inequality for positive real numbers `a`, `b`, and\n`c` satisfying `a + b + c = 1`. This file records the assertion as a\nproposition; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / (a ^ 3 + b ^ 2 * c + c ^ 2 * b)\n + b / (b ^ 3 + c ^ 2 * a + a ^ 2 * c)\n + c / (c ^ 3 + a ^ 2 * b + b ^ 2 * a)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 1 + 8 / (27 * a * b * c)\n\n/--\nFor all positive real numbers `a`, `b`, and `c` satisfying `a + b + c = 1`,\nthe stated left-hand side is at most the stated right-hand side.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a + b + c = 1 →\n lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b2dc93fa-749a-5b57-af3b-1f90db8c91d8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a5612a6f5a1b8b5aef027f139130897ab95f75c24a0e944fd6c6a9548361ae8b", "task_path": "tasks/nmp3_b2dc93fa-749a-5b57-af3b-1f90db8c91d8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b2dc93fa-749a-5b57-af3b-1f90db8c91d8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b2f39085-1edc-52af-8e71-b310cdf06630", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that\n-- \\[\n-- \\frac{a^{3}b}{c^{2}\\bigl(a^{2}+bc\\bigr)}+\\frac{b^{3}c}{a^{2}\\bigl(b^{2}+ca\\bigr)}+\\frac{c^{3}a}{b^{2}\\bigl(c^{2}+ab\\bigr)}\n-- \\;\\ge\\;\n-- \\frac{a^{2}}{a^{2}+bc}+\\frac{b^{2}}{b^{2}+ca}+\\frac{c^{2}}{c^{2}+ab}\\, .\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the displayed inequality. -/\ndef LHS (a b c : ℝ) : ℝ :=\n a ^ 3 * b / (c ^ 2 * (a ^ 2 + b * c)) +\n b ^ 3 * c / (a ^ 2 * (b ^ 2 + c * a)) +\n c ^ 3 * a / (b ^ 2 * (c ^ 2 + a * b))\n\n/-- The right-hand side of the displayed inequality. -/\ndef RHS (a b c : ℝ) : ℝ :=\n a ^ 2 / (a ^ 2 + b * c) +\n b ^ 2 / (b ^ 2 + c * a) +\n c ^ 2 / (c ^ 2 + a * b)\n\n/-- The positivity hypotheses `a > 0`, `b > 0`, and `c > 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The displayed inequality for a fixed triple `(a, b, c)`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ RHS a b c\n\n/-- The full universally quantified assertion: for every positive reals\n`a`, `b`, and `c`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b2f39085-1edc-52af-8e71-b310cdf06630", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5c562e9d2bc69756224a91963e39d70a1c4bf859d38a7d0ec78db60596294117", "task_path": "tasks/nmp3_b2f39085-1edc-52af-8e71-b310cdf06630", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b2f39085-1edc-52af-8e71-b310cdf06630", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b3427787-73eb-5a60-a0ef-56a4700388ec", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with $ab+bc+ca>0$. Prove that \n-- \\[\n-- \\frac{a^{2}(b+c)}{b^{3}+abc+c^{3}}+\\frac{b^{2}(c+a)}{c^{3}+abc+a^{3}}+\\frac{c^{2}(a+b)}{a^{3}+abc+b^{3}}\\ge 2.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The cyclic summand appearing in the target inequality:\n`x^2 * (y + z) / (y^3 + x*y*z + z^3)`. -/\ndef cyclicTerm (x y z : ℝ) : ℝ :=\n x ^ 2 * (y + z) / (y ^ 3 + x * y * z + z ^ 3)\n\n/-- The left-hand side of the inequality in the problem statement. -/\ndef inequalityLHS (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The assertion of the problem: for all nonnegative real `a`, `b`, and `c`\nwhose pairwise products satisfy `ab + bc + ca > 0`, the cyclic sum is at least 2. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a * b + b * c + c * a > 0 →\n inequalityLHS a b c ≥ 2\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3427787-73eb-5a60-a0ef-56a4700388ec", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "efc573b42101c4a01304b0839ce3614e54899df71ef271ca9522553725a43f95", "task_path": "tasks/nmp3_b3427787-73eb-5a60-a0ef-56a4700388ec", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3427787-73eb-5a60-a0ef-56a4700388ec", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b3853819-8757-5bf3-83f5-89a73128d439", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose that $x$, $y$, and $z$ are positive integers satisfying $xy = z^{2}+1$. Prove that there exist integers $a$, $b$, $c$, and $d$ such that \n-- $$x = a^{2}+b^{2},\\qquad y = c^{2}+d^{2},\\qquad z = ac+bd.$$\nimport Mathlib\n\n/-!\n# Statement formalization: sums of two squares and products equal to a square plus one\n\nThe original problem asks to prove that, for positive integers `x`, `y`, and `z`\nwith `x * y = z ^ 2 + 1`, there are integers `a`, `b`, `c`, and `d` such that\n`x = a ^ 2 + b ^ 2`, `y = c ^ 2 + d ^ 2`, and `z = a * c + b * d`.\n\nThe declarations below state this assertion as a proposition. No proof is\nsupplied at this statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem.\n\nThe hypotheses `x`, `y`, and `z` are integers together with strict positivity,\nso they are exactly the positive integers in the problem. The witnesses `a`,\n`b`, `c`, and `d` are integers, with no positivity or other restriction. Both\nthe hypothesis equation and the three conclusion equalities are evaluated in\n`ℤ`, so no coercions between number systems are needed. -/\ndef Target : Prop :=\n ∀ x y z : ℤ,\n 0 < x →\n 0 < y →\n 0 < z →\n x * y = z ^ 2 + 1 →\n ∃ a b c d : ℤ,\n x = a ^ 2 + b ^ 2 ∧\n y = c ^ 2 + d ^ 2 ∧\n z = a * c + b * d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3853819-8757-5bf3-83f5-89a73128d439", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "020c7e6cc2b8a4d5230ca2ddf535e65ddc908c230e8286594e7d74d926e4395c", "task_path": "tasks/nmp3_b3853819-8757-5bf3-83f5-89a73128d439", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3853819-8757-5bf3-83f5-89a73128d439", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b3a1dc29-e546-5047-9a11-08f648fd7f70", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any positive integer $n$, prove that there exists a polynomial $P(x)$ of degree $n$ with integer coefficients such that the $n+1$ numbers $P(0),P(1),\\dots,P(n)$ are pairwise distinct powers of $2$.\nimport Mathlib.Algebra.Polynomial.Degree.Defs\nimport Mathlib.Algebra.Polynomial.Eval.Defs\n\n/-!\n# Formal statement\n\nFor every positive integer `n`, there exists a polynomial with integer\ncoefficients and exact degree `n` whose values at `0, 1, ..., n` are\npairwise distinct powers of two.\n\nThe target is represented as a proposition rather than proved here.\n-/\n\nnamespace Problem\n\n/-- An integer is a (nonnegative natural-exponent) power of two. -/\ndef IsPowerOfTwoInt (z : ℤ) : Prop :=\n ∃ k : ℕ, z = (2 : ℤ) ^ k\n\n/-- The values of `P` at the integers `0, 1, ..., n` are pairwise distinct. -/\ndef PairwiseDistinctOnInitialRange (n : ℕ) (P : Polynomial ℤ) : Prop :=\n Function.Injective\n (fun i : Fin (n + 1) => Polynomial.eval ((i : ℕ) : ℤ) P)\n\n/-- For every positive integer `n`, there is an integer-coefficient polynomial\nof exact degree `n` whose values at `0, 1, ..., n` are pairwise distinct\npowers of two. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n →\n ∃ P : Polynomial ℤ,\n Polynomial.natDegree P = n ∧\n (∀ i : Fin (n + 1),\n Problem.IsPowerOfTwoInt (Polynomial.eval ((i : ℕ) : ℤ) P)) ∧\n Problem.PairwiseDistinctOnInitialRange n P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3a1dc29-e546-5047-9a11-08f648fd7f70", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cb436cbe8cb92ea6bd8c2f2ca8b452d78380a7377e46e23966527e3438b950d6", "task_path": "tasks/nmp3_b3a1dc29-e546-5047-9a11-08f648fd7f70", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3a1dc29-e546-5047-9a11-08f648fd7f70", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b3c6c39f-6569-5f81-88b4-cf4813e67d27", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\mathbb{Z}_{>0}$ denote the set of positive integers. \n-- Consider a function $f:\\mathbb{Z}_{>0}\\to\\mathbb{Z}_{>0}$. For $m,n\\in\\mathbb{Z}_{>0}$ write $f^{\\,n}(m)=\\underbrace{f\\bigl(f(\\dots f}_{n\\text{ times}}(m)\\dots)\\bigr)$. \n-- \n-- Suppose $f$ satisfies \n-- \n-- 1. for all $m,n\\in\\mathbb{Z}_{>0}$, $\\displaystyle\\frac{f^{\\,n}(m)-m}{n}\\in\\mathbb{Z}_{>0}$; \n-- \n-- 2. the complement of the image of $f$ is finite, i.e. $\\mathbb{Z}_{>0}\\setminus\\{f(n)\\mid n\\in\\mathbb{Z}_{>0}\\}$ is a finite set. \n-- \n-- Prove that the sequence $f(1)-1,\\;f(2)-2,\\;f(3)-3,\\;\\dots$ is periodic.\nimport Mathlib\n\n/-!\n# Formal statement: periodic differences under a positive-integer map\n\nThe source problem quantifies over positive integers and a self-map of the\npositive integers. We use `ℕ+` for the positive integers and `ℤ` for integer\ndifferences and exact divisibility.\n-/\n\nnamespace Problem\n\n/-- The positive integers, used as both the domain and codomain of `f`. -/\nabbrev PositiveInteger : Type := ℕ+\n\n/-- The `n`-fold iterate of `f`, where the exponent `n` is a positive integer. -/\ndef Iterate (f : PositiveInteger → PositiveInteger) (n : PositiveInteger)\n (m : PositiveInteger) : PositiveInteger :=\n Nat.iterate f (n : ℕ) m\n\n/--\nThe first hypothesis: for every positive `m` and `n`, the difference\n`f^[n](m) - m` is a positive integer multiple of `n`. This is the exact\ninteger-divisibility and positivity content of the source condition\n`(f^[n](m) - m) / n ∈ ℤ_{>0}`.\n-/\ndef GrowthCondition (f : PositiveInteger → PositiveInteger) : Prop :=\n ∀ m n : PositiveInteger,\n ∃ q : ℤ, 0 < q ∧\n (Iterate f n m : ℤ) - (m : ℤ) = (n : ℤ) * q\n\n/-- The second hypothesis: the complement of the image of `f` is finite. -/\ndef FiniteImageComplement (f : PositiveInteger → PositiveInteger) : Prop :=\n Set.Finite {n : PositiveInteger | n ∉ Set.range f}\n\n/-- The sequence whose `n`-th term is `f(n) - n`, evaluated in `ℤ`. -/\ndef DifferenceSequence (f : PositiveInteger → PositiveInteger)\n (n : PositiveInteger) : ℤ :=\n (f n : ℤ) - (n : ℤ)\n\n/-- The sequence `n ↦ f(n) - n` is periodic with some positive period. -/\ndef PeriodicDifferenceSequence (f : PositiveInteger → PositiveInteger) : Prop :=\n ∃ p : PositiveInteger, ∀ n : PositiveInteger,\n DifferenceSequence f (n + p) = DifferenceSequence f n\n\n/--\nThe complete assertion of the problem: every function `f` on positive integers\nsatisfying the two displayed hypotheses has a periodic difference sequence.\n-/\ndef Target : Prop :=\n ∀ f : PositiveInteger → PositiveInteger,\n GrowthCondition f → FiniteImageComplement f → PeriodicDifferenceSequence f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3c6c39f-6569-5f81-88b4-cf4813e67d27", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "db34bc2a92adb14b43311283290fa7dcf7b17bf4a425ea5fb52fa3751dcfcfd9", "task_path": "tasks/nmp3_b3c6c39f-6569-5f81-88b4-cf4813e67d27", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3c6c39f-6569-5f81-88b4-cf4813e67d27", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b3c857f5-34c0-561f-b43f-def87d734848", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a convex quadrilateral. Suppose the side lengths satisfy $AB+CD=\\sqrt{2}\\,AC$ and $BC+AD=\\sqrt{2}\\,BD$. Prove that $ABCD$ is a parallelogram (i.e., $AB\\parallel CD$ and $BC\\parallel AD$).\n/-\nFormal statement of the quadrilateral problem.\n\nThe source problem is:\n\n Let ABCD be a convex quadrilateral. Suppose the side lengths satisfy\n AB + CD = sqrt(2) AC and BC + AD = sqrt(2) BD. Prove that ABCD is a\n parallelogram (i.e., AB is parallel to CD and BC is parallel to AD).\n\nNo mathematical proof is supplied; `Problem.Target` is the proposition to be\nproved.\n-/\n\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Basic\n\nopen scoped Affine\n\nnamespace Problem\n\n/-- The ambient Euclidean plane used throughout the statement. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Twice the signed area of the oriented triangle with vertices `A`, `B`, `C`.\nThis is the determinant of the vectors `B - A` and `C - A` in coordinates. -/\ndef orientedArea (A B C : Point) : ℝ :=\n (B 0 - A 0) * (C 1 - A 1) - (B 1 - A 1) * (C 0 - A 0)\n\n/-- The four points are in strict convex position and occur in the cyclic order\n`A`, `B`, `C`, `D` (or the reverse order). Equivalently, every one of the four\ntriples has the same nonzero orientation. This includes the usual\nnondegeneracy and distinctness conditions for a (strict) convex quadrilateral. -/\ndef StrictlyConvexInOrder (A B C D : Point) : Prop :=\n (0 < orientedArea A B C ∧\n 0 < orientedArea A B D ∧\n 0 < orientedArea A C D ∧\n 0 < orientedArea B C D) ∨\n (orientedArea A B C < 0 ∧\n orientedArea A B D < 0 ∧\n orientedArea A C D < 0 ∧\n orientedArea B C D < 0)\n\n/-- `ABCD` is a convex quadrilateral, with the vertices listed in their cyclic\norder. We use the standard strict interpretation of a convex quadrilateral:\nfour distinct vertices and no three collinear. -/\ndef IsConvexQuadrilateral (A B C D : Point) : Prop :=\n StrictlyConvexInOrder A B C D\n\n/-- The first metric hypothesis: `AB + CD = sqrt(2) * AC`. -/\ndef FirstLengthCondition (A B C D : Point) : Prop :=\n dist A B + dist C D = Real.sqrt 2 * dist A C\n\n/-- The second metric hypothesis: `BC + AD = sqrt(2) * BD`. -/\ndef SecondLengthCondition (A B C D : Point) : Prop :=\n dist B C + dist A D = Real.sqrt 2 * dist B D\n\n/-- The supporting lines through `A`, `B` and through `C`, `D` are parallel. -/\ndef SegmentParallel (A B C D : Point) : Prop :=\n line[ℝ, A, B] ∥ line[ℝ, C, D]\n\n/-- `ABCD` is a parallelogram in the precise sense requested: the pair of\nopposite sides `AB`, `CD` are parallel and the pair `BC`, `AD` are parallel. -/\ndef IsParallelogram (A B C D : Point) : Prop :=\n line[ℝ, A, B] ∥ line[ℝ, C, D] ∧\n line[ℝ, B, C] ∥ line[ℝ, A, D]\n\n/-- The complete assertion of the problem, as a proposition to be proved:\nfor every convex quadrilateral `ABCD` in the Euclidean plane, if\n`AB + CD = sqrt(2) * AC` and `BC + AD = sqrt(2) * BD`, then `ABCD` is a\nparallelogram. -/\ndef Target : Prop :=\n ∀ (A B C D : Point),\n IsConvexQuadrilateral A B C D →\n FirstLengthCondition A B C D →\n SecondLengthCondition A B C D →\n IsParallelogram A B C D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3c857f5-34c0-561f-b43f-def87d734848", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c737183fd7e83ee2eb83103623abc93940af8f2ff1cd4e6fdfb52123f5e78b3f", "task_path": "tasks/nmp3_b3c857f5-34c0-561f-b43f-def87d734848", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3c857f5-34c0-561f-b43f-def87d734848", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b3e5a0d8-2d4c-5443-9026-81747bedeb02", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there exist infinitely many positive integers $n$ such that $n^{2}+1$ divides $n!$.\nimport Mathlib\n\nnamespace Problem\n\n/-- A positive integer `n` is admissible when `n² + 1` divides `n!`. -/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧ (n ^ 2 + 1) ∣ Nat.factorial n\n\n/-- There exist infinitely many positive integers `n` such that `n² + 1` divides `n!`. -/\ndef Target : Prop :=\n Set.Infinite {n : ℕ | Admissible n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3e5a0d8-2d4c-5443-9026-81747bedeb02", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "85fb0d0a6b0953bbff88e685079497c1b60125d1ce4f3b91e07a8241cc1ce3ec", "task_path": "tasks/nmp3_b3e5a0d8-2d4c-5443-9026-81747bedeb02", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3e5a0d8-2d4c-5443-9026-81747bedeb02", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b3e602c2-ab72-5522-abc6-8bf631bfeb22", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers such that $a+b+c=1$. Prove that \n-- \\[\n-- \\frac{a}{a^{2}+1}+\\frac{b}{b^{2}+1}+\\frac{c}{c^{2}+1}\\le\\frac{9}{10}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem: for all real numbers `a`, `b`, and `c`\nwith `a + b + c = 1`, the given rational expression is at most `9 / 10`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), a + b + c = 1 →\n a / (a ^ 2 + 1) + b / (b ^ 2 + 1) + c / (c ^ 2 + 1) ≤ (9 : ℝ) / 10\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3e602c2-ab72-5522-abc6-8bf631bfeb22", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1d76b8a9b71ec410d3956f27b0932aefc25043fb9009fb09c4c641b833450b1d", "task_path": "tasks/nmp3_b3e602c2-ab72-5522-abc6-8bf631bfeb22", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b3e602c2-ab72-5522-abc6-8bf631bfeb22", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b43b5397-1d9f-57d4-a50f-9075c7df7ab3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers satisfying $a^{2}+b^{2}+c^{2}\\le 3$. Prove that \n-- \\[\n-- a^{2}+b^{2}+c^{2}+3abc\\le 2(a+b+c).\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The assertion from the problem: for all positive reals `a`, `b`, and `c`\nsatisfying `a^2 + b^2 + c^2 ≤ 3`, the inequality\n`a^2 + b^2 + c^2 + 3abc ≤ 2(a + b + c)` holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 ≤ 3 →\n a ^ 2 + b ^ 2 + c ^ 2 + 3 * (a * b * c) ≤ 2 * (a + b + c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b43b5397-1d9f-57d4-a50f-9075c7df7ab3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "13858c91b72d6e5d45147c30b82f66fc40b848938969060be34640c75bb75303", "task_path": "tasks/nmp3_b43b5397-1d9f-57d4-a50f-9075c7df7ab3", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b43b5397-1d9f-57d4-a50f-9075c7df7ab3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b43b92cd-6165-5528-8d4a-e16c4fff14a6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any real numbers $a,b,c$ the following inequality holds \n-- \\[\n-- \\bigl(a^{2}-(b-c)^{2}\\bigr)\\bigl(b^{2}-(c-a)^{2}\\bigr)\\bigl(c^{2}-(a-b)^{2}\\bigr)\\ge(-a^{2}+b^{2}+c^{2})(a^{2}-b^{2}+c^{2})(a^{2}+b^{2}-c^{2})\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 - (b - c) ^ 2) * (b ^ 2 - (c - a) ^ 2) * (c ^ 2 - (a - b) ^ 2)\n\n/-- The right-hand side of the inequality in the problem. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (-(a ^ 2) + b ^ 2 + c ^ 2) * (a ^ 2 - b ^ 2 + c ^ 2) *\n (a ^ 2 + b ^ 2 - c ^ 2)\n\n/-- The inequality asserted for a fixed triple of real numbers. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- For every triple of real numbers `a`, `b`, and `c`, the product of the three\nfactors `a^2 - (b-c)^2`, `b^2 - (c-a)^2`, and `c^2 - (a-b)^2` is at least the\nproduct `(-a^2+b^2+c^2)(a^2-b^2+c^2)(a^2+b^2-c^2)`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b43b92cd-6165-5528-8d4a-e16c4fff14a6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0236cd7f56ebd1c793305a2245bcde0147466d547ed369aa2585a1a87c946aae", "task_path": "tasks/nmp3_b43b92cd-6165-5528-8d4a-e16c4fff14a6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b43b92cd-6165-5528-8d4a-e16c4fff14a6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b456eba7-6564-5ed3-af71-82a68f6d0b0b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be a simple graph with $2n+1$ vertices ($n\\ge 1$). Assume that for every set $S$ of $n$ vertices there exists a vertex $v\\notin S$ that is adjacent to all vertices of $S$. Prove that $G$ contains a vertex which is adjacent to all of the other $2n$ vertices (i.e. a universal vertex of degree $2n$).\nimport Mathlib.Combinatorics.SimpleGraph.Basic\n\n/-!\n# Formal statement of the graph problem\n\nThe source problem asks for a proof of the following assertion. A finite simple\ngraph on `2 * n + 1` vertices, with `n >= 1`, has a universal vertex whenever\nevery `n`-element set of vertices has a common neighbor outside the set.\n\nThis file records only the proposition to be proved. It deliberately contains\nno proof of that proposition.\n-/\n\nnamespace Problem\n\n/-- A vertex `v` is universal when it is adjacent to every other vertex. -/\ndef IsUniversalVertex {V : Type*} (G : SimpleGraph V) (v : V) : Prop :=\n ∀ w : V, w ≠ v → G.Adj v w\n\n/-- The graph has a vertex adjacent to all of its other vertices. -/\ndef HasUniversalVertex {V : Type*} (G : SimpleGraph V) : Prop :=\n ∃ v : V, IsUniversalVertex G v\n\n/-- Every `n`-element set of vertices has a common neighbor outside the set. -/\ndef HasCommonNeighborProperty {V : Type*} (n : ℕ) (G : SimpleGraph V) : Prop :=\n ∀ S : Finset V, S.card = n →\n ∃ v : V, v ∉ S ∧ ∀ u : V, u ∈ S → G.Adj v u\n\n/-- The hypotheses of the source problem: `n >= 1`, exactly `2 * n + 1`\nvertices, and the common-neighbor condition for all `n`-element vertex sets. -/\ndef Assumptions {V : Type*} [Fintype V] (n : ℕ) (G : SimpleGraph V) : Prop :=\n 1 ≤ n ∧ Fintype.card V = 2 * n + 1 ∧ HasCommonNeighborProperty n G\n\n/-- The full assertion of the source problem: every finite simple graph satisfying\nthe stated hypotheses has a universal vertex. -/\ndef Target : Prop :=\n ∀ (V : Type*) [Fintype V],\n ∀ (n : ℕ) (G : SimpleGraph V),\n Assumptions n G → HasUniversalVertex G\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b456eba7-6564-5ed3-af71-82a68f6d0b0b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1e3ee86443389ad8b846871afc6050dc628f3fe349e12d9b499699570f9c1720", "task_path": "tasks/nmp3_b456eba7-6564-5ed3-af71-82a68f6d0b0b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b456eba7-6564-5ed3-af71-82a68f6d0b0b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b47a7fb6-773a-5e1f-b89e-75dd3b12ef88", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all real numbers $x,y,z$,\n-- \\[\n-- 3\\sum_{\\text{cyc}}x^{4}+7\\Big(\\sum_{\\text{cyc}}x^{2}y^{2}-\\sum_{\\text{cyc}}x^{2}yz\\Big)\\ge 9\\Big(\\sum_{\\text{cyc}}x^{3}y-\\sum_{\\text{cyc}}xy^{3}\\Big).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic real-variable inequality\n\nThe source problem asks to prove, for all real numbers `x`, `y`, and `z`, the\ninequality\n\n`3 * ∑cyc x^4 + 7 * (∑cyc x^2*y^2 - ∑cyc x^2*y*z)\n ≥ 9 * (∑cyc x^3*y - ∑cyc x*y^3)`.\n\nFor three variables, `∑cyc f x y z` is represented as\n`f x y z + f y z x + f z x y`.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum of a three-variable expression over the cycle\n`x → y → z → x`. -/\ndef CyclicSum (f : ℝ → ℝ → ℝ → ℝ) (x y z : ℝ) : ℝ :=\n f x y z + f y z x + f z x y\n\n/-- `∑cyc x^4`. -/\ndef CyclicSumFourth (x y z : ℝ) : ℝ :=\n CyclicSum (fun a _ _ => a ^ 4) x y z\n\n/-- `∑cyc x^2 y^2`. -/\ndef CyclicSumSqMulSq (x y z : ℝ) : ℝ :=\n CyclicSum (fun a b _ => a ^ 2 * b ^ 2) x y z\n\n/-- `∑cyc x^2 y z`. -/\ndef CyclicSumSqMulMul (x y z : ℝ) : ℝ :=\n CyclicSum (fun a b c => a ^ 2 * b * c) x y z\n\n/-- `∑cyc x^3 y`. -/\ndef CyclicSumCubeMul (x y z : ℝ) : ℝ :=\n CyclicSum (fun a b _ => a ^ 3 * b) x y z\n\n/-- `∑cyc x y^3`. -/\ndef CyclicSumMulCube (x y z : ℝ) : ℝ :=\n CyclicSum (fun a b _ => a * b ^ 3) x y z\n\n/-- The assertion of the source problem: for all real `x`, `y`, and `z`,\n`3 * ∑cyc x^4 + 7 * (∑cyc x^2*y^2 - ∑cyc x^2*y*z)\n ≥ 9 * (∑cyc x^3*y - ∑cyc x*y^3)`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 3 * CyclicSumFourth x y z\n + 7 * (CyclicSumSqMulSq x y z - CyclicSumSqMulMul x y z)\n ≥ 9 * (CyclicSumCubeMul x y z - CyclicSumMulCube x y z)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b47a7fb6-773a-5e1f-b89e-75dd3b12ef88", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "91faf003af052647d6ceb1f368c991a3c668093a160ddb097d7ba0838f057598", "task_path": "tasks/nmp3_b47a7fb6-773a-5e1f-b89e-75dd3b12ef88", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b47a7fb6-773a-5e1f-b89e-75dd3b12ef88", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b4861751-1964-58c7-bfcd-d99de04c7831", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k$ and $n$ be integers with $0\\le k\\le n-2$. \n-- Let $L$ be a set of $n$ lines in the plane such that no two are parallel and no three are concurrent. \n-- Denote by $I$ the set of all intersection points of lines in $L$. \n-- Let $O$ be a point in the plane that does not lie on any line of $L$. \n-- A point $X\\in I$ is colored red if the open line segment $OX$ intersects at most $k$ lines of $L$. \n-- Prove that $I$ contains at least $\\displaystyle\\frac{(k+1)(k+2)}2$ red points.\nimport Mathlib\n\n/-!\n# Formal statement of the red-intersection lower-bound problem\n\nThis file models the real affine plane as `ℝ × ℝ`. A (non-vertical or\nvertical) affine line is represented by a nonzero normal vector `(a, b)` and\nan equation `a * x + b * y + c = 0`.\n-/\n\nnamespace Problem\n\n/-- The real affine plane, represented by Cartesian coordinates. -/\nabbrev Plane : Type := ℝ × ℝ\n\n/-- A nondegenerate affine line in the plane, represented by an affine linear\nequation with a nonzero normal vector. -/\nstructure AffineLine where\n a : ℝ\n b : ℝ\n c : ℝ\n nondegenerate : a ≠ 0 ∨ b ≠ 0\n\nnamespace AffineLine\n\n/-- The carrier set of an affine line. -/\ndef Carrier (l : AffineLine) : Set Plane :=\n {p | l.a * p.fst + l.b * p.snd + l.c = 0}\n\n/-- Two affine lines are parallel when their normal vectors are proportional.\nFor distinct geometric lines this is the usual notion of parallelism; the\ndefinition also regards coincident affine lines as parallel. -/\ndef Parallel (l₁ l₂ : AffineLine) : Prop :=\n l₁.a * l₂.b - l₂.a * l₁.b = 0\n\nend AffineLine\n\n/-- No two distinct members of `L` are parallel. -/\ndef NoTwoParallel (L : Finset AffineLine) : Prop :=\n ∀ ⦃l₁ : AffineLine⦄, l₁ ∈ L →\n ∀ ⦃l₂ : AffineLine⦄, l₂ ∈ L → l₁ ≠ l₂ → ¬ AffineLine.Parallel l₁ l₂\n\n/-- Three affine lines are concurrent when they have a common point. -/\ndef Concurrent (l₁ l₂ l₃ : AffineLine) : Prop :=\n ∃ p : Plane, p ∈ l₁.Carrier ∧ p ∈ l₂.Carrier ∧ p ∈ l₃.Carrier\n\n/-- No three distinct members of `L` are concurrent. -/\ndef NoThreeConcurrent (L : Finset AffineLine) : Prop :=\n ∀ ⦃l₁ : AffineLine⦄, l₁ ∈ L →\n ∀ ⦃l₂ : AffineLine⦄, l₂ ∈ L →\n ∀ ⦃l₃ : AffineLine⦄, l₃ ∈ L →\n l₁ ≠ l₂ → l₁ ≠ l₃ → l₂ ≠ l₃ → ¬ Concurrent l₁ l₂ l₃\n\n/-- A point lies in the intersection set `I` exactly when it lies on two\ndistinct lines of `L`. Under the no-three-concurrent hypothesis this is\nprecisely the set of all pairwise intersection points. -/\ndef IsIntersectionPoint (L : Finset AffineLine) (X : Plane) : Prop :=\n ∃ l₁ : AffineLine, l₁ ∈ L ∧\n ∃ l₂ : AffineLine, l₂ ∈ L ∧ l₁ ≠ l₂ ∧\n X ∈ l₁.Carrier ∧ X ∈ l₂.Carrier\n\n/-- The set `I` of all intersection points of lines in `L`. -/\ndef IntersectionPoints (L : Finset AffineLine) : Set Plane :=\n {X | IsIntersectionPoint L X}\n\n/-- The open line segment between two points. The parameters are taken to be\nstrictly between zero and one, so both endpoints are excluded. -/\ndef OpenSegment (O X : Plane) : Set Plane :=\n {Y | ∃ t : ℝ, 0 < t ∧ t < 1 ∧ Y = (1 - t) • O + t • X}\n\n/-- An affine line meets the open segment `OX`. -/\ndef CrossesOpenSegment (l : AffineLine) (O X : Plane) : Prop :=\n ∃ Y : Plane, Y ∈ OpenSegment O X ∧ Y ∈ l.Carrier\n\n/-- The number of lines of `L` that meet the open segment `OX`. -/\nnoncomputable def CrossingLineCount\n (L : Finset AffineLine) (O X : Plane) : ℕ := by\n classical\n exact (L.filter (fun l : AffineLine => CrossesOpenSegment l O X)).card\n\n/-- A point `X` is red when it lies in `I` and the open segment `OX` meets at\nmost `k` lines of `L`. -/\ndef IsRed (L : Finset AffineLine) (O : Plane) (k : ℤ) (X : Plane) : Prop :=\n X ∈ IntersectionPoints L ∧ (CrossingLineCount L O X : ℤ) ≤ k\n\n/-- The set of red points in `I`. -/\ndef RedPoints (L : Finset AffineLine) (O : Plane) (k : ℤ) : Set Plane :=\n {X | IsRed L O k X}\n\n/-- The integer lower bound `(k+1)(k+2)/2` from the problem. For the values\nof `k` occurring in the theorem, the product is even and division is exact. -/\ndef RequiredRedCount (k : ℤ) : ℤ :=\n (k + 1) * (k + 2) / 2\n\n/-- A set has at least `m` points if it contains a finite subset with `m`\nelements. This formulation avoids any separate finiteness convention for\ninfinite sets. -/\ndef HasAtLeast (s : Set Plane) (m : ℤ) : Prop :=\n ∃ t : Finset Plane, (↑t : Set Plane) ⊆ s ∧ m ≤ (t.card : ℤ)\n\n/-- The main formal target: for all integers `k,n` with `0 ≤ k ≤ n-2`, every\nset `L` of `n` lines in general position (no two parallel and no three\nconcurrent), and every point `O` on none of the lines, the set `I` of\nintersection points contains at least `(k+1)(k+2)/2` red points. -/\ndef Target : Prop :=\n ∀ k n : ℤ, 0 ≤ k → k ≤ n - 2 →\n ∀ L : Finset AffineLine, (L.card : ℤ) = n →\n NoTwoParallel L → NoThreeConcurrent L →\n ∀ O : Plane, (∀ l : AffineLine, l ∈ L → O ∉ l.Carrier) →\n HasAtLeast (RedPoints L O k) (RequiredRedCount k)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b4861751-1964-58c7-bfcd-d99de04c7831", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "34a87fdfe8ab413b8aa7425130a88b1dec090787b3f90e3de45f7acca8989766", "task_path": "tasks/nmp3_b4861751-1964-58c7-bfcd-d99de04c7831", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b4861751-1964-58c7-bfcd-d99de04c7831", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b4fbfef1-5100-5da3-af41-2584064bad59", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) satisfy \\(ab+bc+ca=a+b+c\\). Prove that \n-- \\[\n-- \\sqrt{c(a+b)^3+1}\\;+\\;\\sqrt{a(b+c)^3+1}\\;+\\;\\sqrt{b(c+a)^3+1}\\;\\ge\\;1+8abc\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality statement\n\nThe original problem asks to prove, for all positive real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca = a + b + c`, the non-strict inequality\n\n`sqrt (c * (a + b)^3 + 1) + sqrt (a * (b + c)^3 + 1)\n + sqrt (b * (c + a)^3 + 1) >= 1 + 8 * a * b * c`.\n\nThis file records the statement as a proposition; it intentionally supplies no proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n Real.sqrt (c * (a + b) ^ 3 + 1) +\n Real.sqrt (a * (b + c) ^ 3 + 1) +\n Real.sqrt (b * (c + a) ^ 3 + 1)\n\n/-- The right-hand side of the target inequality. -/\ndef rightHandSide (a b c : ℝ) : ℝ :=\n 1 + 8 * a * b * c\n\n/-- The hypotheses on `a`, `b`, and `c`: they are positive and satisfy\n`ab + bc + ca = a + b + c`. -/\ndef admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = a + b + c\n\n/-- The complete proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, admissible a b c → leftHandSide a b c ≥ rightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b4fbfef1-5100-5da3-af41-2584064bad59", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a82cd52ec5b35b2fafe2d53c8b13359c27a74ebcf8ed3af5d0751acef1eed0f0", "task_path": "tasks/nmp3_b4fbfef1-5100-5da3-af41-2584064bad59", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b4fbfef1-5100-5da3-af41-2584064bad59", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b53c34ae-7ff7-5772-9d9e-9b35a63e50b8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{7-6a}{2+a^{2}}+\\frac{7-6b}{2+b^{2}}+\\frac{7-6c}{2+c^{2}}\\ge 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose product is `1`, that the given sum of three rational expressions is\nat least `1`.\n\nThis file only states the target proposition. It deliberately contains no\nproof of the target.\n-/\n\nnamespace Problem\n\n/-- The common admissible domain in the problem: all three variables are\npositive real numbers and their product is one. -/\ndef Admissible\n (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (7 - 6 * a) / (2 + a ^ 2)\n + (7 - 6 * b) / (2 + b ^ 2)\n + (7 - 6 * c) / (2 + c ^ 2)\n\n/-- The assertion, for a fixed triple, that the left-hand side is at least\none. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n 1 ≤ lhs a b c\n\n/-- The full universally quantified target of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b53c34ae-7ff7-5772-9d9e-9b35a63e50b8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "33f71244600fc33e581e45bc316873f9a418b6ddbd1c91330f446f6b7eb8298a", "task_path": "tasks/nmp3_b53c34ae-7ff7-5772-9d9e-9b35a63e50b8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b53c34ae-7ff7-5772-9d9e-9b35a63e50b8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b567a976-aad5-5a6c-a6c2-6f4e9ff881cd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given an integer \\(n>3\\), prove that there exists a set \\(S\\) of \\(n\\) pairwise distinct positive integers such that for any two different non‑empty subsets \\(A,B\\subseteq S\\) the two numbers \n-- \n-- \\[\n-- \\frac{\\displaystyle\\sum_{x\\in A}x}{|A|}\\qquad\\text{and}\\qquad\\frac{\\displaystyle\\sum_{x\\in B}x}{|B|}\n-- \\]\n-- \n-- are composite integers and are relatively prime (i.e., \\(\\gcd\\big(\\frac{\\sum_{x\\in A}x}{|A|},\\frac{\\sum_{x\\in B}x}{|B|}\\big)=1\\)).\nimport Mathlib\n\n/-!\n# Formal statement for the composite pairwise-coprime subset averages problem\n\nThe original problem asks, for every integer `n > 3`, for a set `S` of `n`\npairwise distinct positive integers such that the average of every nonempty\nfinite subset of `S` is a composite integer, and the averages of any two\ndistinct nonempty subsets are relatively prime.\n\nWe represent a finite set of positive integers by a `Finset ℕ`, together with\nthe explicit positivity condition. Integrality of an average is expressed by\ndivisibility of the subset sum by the cardinality of that subset.\n-/\n\nnamespace Problem\n\n/-- A natural number is composite when it is a product of two natural numbers\nboth greater than one. This excludes `0`, `1`, and the primes. -/\ndef IsCompositeNat (m : ℕ) : Prop :=\n ∃ a b : ℕ, 1 < a ∧ 1 < b ∧ m = a * b\n\n/-- The sum of the elements of a finite set of natural numbers. -/\ndef SubsetSum (A : Finset ℕ) : ℕ :=\n A.sum (fun x : ℕ => x)\n\n/-- The cardinality of a finite set of natural numbers. -/\ndef SubsetCard (A : Finset ℕ) : ℕ :=\n A.card\n\n/-- The numerical expression `(sum over A) / |A|`, using natural-number\ndivision. Under `HasIntegerAverage A` this is the exact integer average. -/\ndef Average (A : Finset ℕ) : ℕ :=\n SubsetSum A / SubsetCard A\n\n/-- The sum of the elements of `A` is exactly divisible by the number of\nelements of `A`, so that the displayed average is an integer. -/\ndef HasIntegerAverage (A : Finset ℕ) : Prop :=\n SubsetCard A ∣ SubsetSum A\n\n/-- The average of `A` is a composite integer: it is an integer and, as a\nnatural number, it is composite. -/\ndef IsCompositeAverage (A : Finset ℕ) : Prop :=\n HasIntegerAverage A ∧ IsCompositeNat (Average A)\n\n/-- The elements of the finite set are pairwise distinct. This is the\nexplicit distinctness condition in the source statement. -/\ndef PairwiseDistinct (S : Finset ℕ) : Prop :=\n S.val.Nodup\n\n/-- Two natural numbers are relatively prime when their gcd is one. -/\ndef RelativelyPrime (m n : ℕ) : Prop :=\n Nat.gcd m n = 1\n\n/-- Admissibility of a candidate finite set `S` for a prescribed cardinality\n`n`: `S` has `n` pairwise distinct positive integers, and every two distinct\nnonempty subsets of `S` have composite integer averages that are relatively\nprime. -/\ndef AdmissibleSet (n : ℤ) (S : Finset ℕ) : Prop :=\n PairwiseDistinct S ∧\n (S.card : ℤ) = n ∧\n (∀ x : ℕ, x ∈ S → 0 < x) ∧\n (∀ A B : Finset ℕ,\n A ⊆ S →\n B ⊆ S →\n A.Nonempty →\n B.Nonempty →\n A ≠ B →\n IsCompositeAverage A ∧\n IsCompositeAverage B ∧\n RelativelyPrime (Average A) (Average B))\n\n/-- The full assertion of the problem: for every integer `n > 3`, there is a\nset `S` of `n` pairwise distinct positive integers whose distinct nonempty\nfinite subsets have composite integer averages, with every two such averages\nrelatively prime. -/\ndef Target : Prop :=\n ∀ n : ℤ, 3 < n → ∃ S : Finset ℕ, AdmissibleSet n S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b567a976-aad5-5a6c-a6c2-6f4e9ff881cd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b93e6b281cfb5fb0b88ffda36d2c271b976e3f7f1ff4bd0f232f439b5751dc22", "task_path": "tasks/nmp3_b567a976-aad5-5a6c-a6c2-6f4e9ff881cd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b567a976-aad5-5a6c-a6c2-6f4e9ff881cd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b56c6f51-15bb-520f-a60e-89b4f8a782e5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that $a^2+b^2+c^2=3$. Prove that \n-- \\[\n-- \\left(\\frac{1}{a^2+b^2}+\\frac{1}{b^2+c^2}+\\frac{1}{c^2+a^2}\\right)^{\\!3}\\ge\n-- \\frac{81}{4\\bigl(a+b+c+3\\bigr)}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The inequality stated in the problem, for positive real numbers `a`, `b`, and `c`\nwhose squared sum is `3`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = 3 →\n (1 / (a ^ 2 + b ^ 2) +\n 1 / (b ^ 2 + c ^ 2) +\n 1 / (c ^ 2 + a ^ 2)) ^ 3 ≥\n 81 / (4 * (a + b + c + 3))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b56c6f51-15bb-520f-a60e-89b4f8a782e5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "83f4d1288b74a2896830172eff95069a17d043a13bd7414fcc703d41715786f8", "task_path": "tasks/nmp3_b56c6f51-15bb-520f-a60e-89b4f8a782e5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b56c6f51-15bb-520f-a60e-89b4f8a782e5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b56cfc2f-eea4-5480-a9f7-20156705fd5b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The altitudes of an acute triangle $ABC$ intersect at $H$. The tangent line at $H$ to the circumcircle of $\\triangle BHC$ meets $AB$ at $Q$ and $AC$ at $P$. The circumcircles of $\\triangle ABC$ and $\\triangle APQ$ intersect again at $K\\neq A$. The tangent lines to the circumcircle of $\\triangle APQ$ at $A$ and at $K$ intersect at $T$. Prove that the line $TH$ passes through the midpoint of $BC\\,. $\nimport Mathlib\n\n/-!\n# Formal statement of a Euclidean geometry problem\n\nThe problem is stated in the real Euclidean plane. The definitions below spell\nout the elementary incidence, circle, tangency, altitude, and midpoint notions\nused in the problem, and `Problem.Target` is the resulting proposition.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean plane used to formalize the problem. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The real inner product of two vectors in the plane. -/\ndef Dot (X Y : Plane) : ℝ := inner ℝ X Y\n\n/-- A circle in the plane, represented by its center and radius. -/\nstructure Circle where\n center : Plane\n radius : ℝ\n\n/-- A point lies on a circle when its distance from the center is the radius. -/\ndef Circle.Mem (omega : Circle) (X : Plane) : Prop :=\n dist X omega.center = omega.radius\n\n/-- The full line through two distinct points, written parametrically. -/\ndef LineThrough (A B : Plane) : Set Plane :=\n {X : Plane | ∃ t : ℝ, X = A + t • (B - A)}\n\n/-- The tangent line at `A` to the circle `omega`, defined as the line through\n`A` perpendicular to the radius from the center to `A`. -/\ndef TangentLine (omega : Circle) (A : Plane) : Set Plane :=\n {X : Plane | Dot (X - A) (A - omega.center) = 0}\n\n/-- Two sets meet uniquely at `X`. -/\ndef IsUniqueIntersection (s t : Set Plane) (X : Plane) : Prop :=\n X ∈ s ∧ X ∈ t ∧ ∀ Y : Plane, Y ∈ s → Y ∈ t → Y = X\n\n/-- `omega` is the (unique) circumcircle of the noncollinear triple `A, B, C`. -/\ndef IsCircumcircle (omega : Circle) (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane) ∧\n Circle.Mem omega A ∧\n Circle.Mem omega B ∧\n Circle.Mem omega C ∧\n ∀ eta : Circle,\n Circle.Mem eta A → Circle.Mem eta B → Circle.Mem eta C → eta = omega\n\n/-- `A` and `K` are exactly the two common points of the two circles. -/\ndef IsSecondIntersection (omega₁ omega₂ : Circle) (A K : Plane) : Prop :=\n K ≠ A ∧\n Circle.Mem omega₁ A ∧\n Circle.Mem omega₂ A ∧\n Circle.Mem omega₁ K ∧\n Circle.Mem omega₂ K ∧\n ∀ X : Plane,\n Circle.Mem omega₁ X → Circle.Mem omega₂ X → X = A ∨ X = K\n\n/-- A triangle is acute when it is noncollinear and all three of its interior\nangles are strictly smaller than a right angle, expressed by positive dot\nproducts of the two side vectors at each vertex. -/\ndef AcuteTriangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane) ∧\n 0 < Dot (B - A) (C - A) ∧\n 0 < Dot (A - B) (C - B) ∧\n 0 < Dot (A - C) (B - C)\n\n/-- `H` lies on all three altitudes of the triangle `A, B, C`: the line through\n`A` and `H` is perpendicular to `BC`, and cyclically. -/\ndef IsOrthocenter (A B C H : Plane) : Prop :=\n Dot (H - A) (C - B) = 0 ∧\n Dot (H - B) (C - A) = 0 ∧\n Dot (H - C) (B - A) = 0\n\n/-- The assertion to be proved.\n\nFor every acute triangle `ABC` with orthocenter `H`, suppose the tangent to the\ncircumcircle of `BHC` at `H` meets the line `AB` at `Q` and the line `AC` at\n`P`. Suppose `K` is the second intersection of the circumcircles of `ABC` and\n`APQ`, and the tangents to the circumcircle of `APQ` at `A` and `K` meet at\n`T`. Then the line `TH` passes through the midpoint of `BC`. -/\ndef Target : Prop :=\n ∀ (A B C H P Q K T : Plane),\n AcuteTriangle A B C →\n IsOrthocenter A B C H →\n (∃ omegaBHC : Circle,\n IsCircumcircle omegaBHC B H C ∧\n IsUniqueIntersection (TangentLine omegaBHC H) (LineThrough A B) Q ∧\n IsUniqueIntersection (TangentLine omegaBHC H) (LineThrough A C) P) →\n (∃ omegaABC : Circle,\n ∃ omegaAPQ : Circle,\n IsCircumcircle omegaABC A B C ∧\n IsCircumcircle omegaAPQ A P Q ∧\n IsSecondIntersection omegaABC omegaAPQ A K ∧\n IsUniqueIntersection (TangentLine omegaAPQ A) (TangentLine omegaAPQ K) T) →\n midpoint ℝ B C ∈ LineThrough T H\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b56cfc2f-eea4-5480-a9f7-20156705fd5b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ca9a13aacf0c33a4e7bfdb84c52a5a50b55190fe3e3eaa1b01713fde45f38642", "task_path": "tasks/nmp3_b56cfc2f-eea4-5480-a9f7-20156705fd5b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b56cfc2f-eea4-5480-a9f7-20156705fd5b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b57b7877-f9cb-53f5-a9c0-57a7e78e2c2a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots,a_n>0$ and \n-- \\[\n-- a_1+\\frac{n-2}{\\,n-1\\,}\\bigl(a_2+a_3+\\dots +a_n\\bigr)=1,\\qquad n\\ge 3.\n-- \\] \n-- Prove that \n-- \\[\n-- \\frac{1}{2n-5}\\,\\frac{1}{a_1^{2}}\\sum_{i=2}^{n}\\frac{1}{a_i}\n-- +\\sum_{i=2}^{n}\\Biggl(\\frac{1}{a_i}\\sum_{\\substack{j=1\\\\j\\neq i}}^{n}\\frac{1}{a_j}\\Biggr)\n-- \\;\\ge\\;\\frac{2\\,(n-2)\\,(n-1)^{4}}{2n-5}\\, .\n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\n/-!\nFormalization of the statement in `problem.md`.\n\nThe original problem concerns a finite positive real sequence\n`a_1,...,a_n`, with a normalization condition, and asks for a lower bound\nfor a sum of reciprocals. We represent the finite sequence by a function\n`a : ℕ → ℝ` and use `Finset.Icc` to restrict every sum to the indices that\noccur in the problem. Values of `a` outside `{1, ..., n}` are irrelevant.\n-/\n\nnamespace Problem\n\n/-- The positivity hypothesis `a_1, a_2, ..., a_n > 0`. -/\ndef PositiveOnRange (n : ℕ) (a : ℕ → ℝ) : Prop :=\n ∀ i : ℕ, 1 ≤ i → i ≤ n → 0 < a i\n\n/-- The condition\n`a_1 + ((n - 2) / (n - 1)) * (a_2 + ... + a_n) = 1`. -/\ndef Normalization (n : ℕ) (a : ℕ → ℝ) : Prop :=\n a 1 + (((n : ℝ) - 2) / ((n : ℝ) - 1)) *\n (∑ i ∈ Finset.Icc 2 n, a i) = 1\n\n/-- The left-hand side of the stated inequality. -/\nnoncomputable def LHS (n : ℕ) (a : ℕ → ℝ) : ℝ :=\n (1 / ((2 : ℝ) * (n : ℝ) - 5)) * (1 / ((a 1) ^ 2)) *\n (∑ i ∈ Finset.Icc 2 n, 1 / a i)\n + ∑ i ∈ Finset.Icc 2 n,\n (1 / a i) *\n (∑ j ∈ (Finset.Icc 1 n).filter (fun j : ℕ => j ≠ i), 1 / a j)\n\n/-- The right-hand side of the stated inequality. -/\nnoncomputable def RHS (n : ℕ) : ℝ :=\n (2 * ((n : ℝ) - 2) * ((n : ℝ) - 1) ^ 4) /\n ((2 : ℝ) * (n : ℝ) - 5)\n\n/-- The complete assertion to be proved: for every natural number `n ≥ 3`\nand every positive real sequence `a_1, ..., a_n` satisfying the normalization\ncondition, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 3 ≤ n → ∀ (a : ℕ → ℝ),\n PositiveOnRange n a →\n Normalization n a →\n RHS n ≤ LHS n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b57b7877-f9cb-53f5-a9c0-57a7e78e2c2a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "70ced53c08e42c8eec5a759ec0e599c20e63ecc34614ff9eeab5eda3fb6c5208", "task_path": "tasks/nmp3_b57b7877-f9cb-53f5-a9c0-57a7e78e2c2a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b57b7877-f9cb-53f5-a9c0-57a7e78e2c2a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b57ea187-447e-5336-8f80-14e9d95f953f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c>0$ and $p,q\\ge0$ with $p+q>0$, prove that \n-- \\[\n-- \\sqrt{\\frac{a^5}{pa^2b+qc^3}}+\\sqrt{\\frac{b^5}{pb^2c+qa^3}}+\\sqrt{\\frac{c^5}{pc^2a+qb^3}}\n-- \\ge\n-- \\sqrt{\\frac{3\\,(a^2+b^2+c^2)}{p+q}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for positive real `a`, `b`, `c` and\nnonnegative real `p`, `q` with `p + q > 0`, the stated three-term radical\ninequality.\n\nThe declarations below only record the mathematical statement. In\nparticular, `Problem.Target` is a proposition-valued definition and is not\nproved here.\n-/\n\nnamespace Problem\n\n/-- The three radical summands and the right-hand side are bundled into the\ntarget below. This definition gives the first summand exactly as\n`sqrt (a^5 / (p*a^2*b + q*c^3))`. -/\nnoncomputable def firstSummand (a b c p q : ℝ) : ℝ :=\n Real.sqrt (a ^ 5 / (p * a ^ 2 * b + q * c ^ 3))\n\n/-- The second radical summand,\n`sqrt (b^5 / (p*b^2*c + q*a^3))`. -/\nnoncomputable def secondSummand (a b c p q : ℝ) : ℝ :=\n Real.sqrt (b ^ 5 / (p * b ^ 2 * c + q * a ^ 3))\n\n/-- The third radical summand,\n`sqrt (c^5 / (p*c^2*a + q*b^3))`. -/\nnoncomputable def thirdSummand (a b c p q : ℝ) : ℝ :=\n Real.sqrt (c ^ 5 / (p * c ^ 2 * a + q * b ^ 3))\n\n/-- The left-hand side of the inequality: the sum of the three displayed\nradical terms. -/\nnoncomputable def inequalityLHS (a b c p q : ℝ) : ℝ :=\n firstSummand a b c p q + secondSummand a b c p q + thirdSummand a b c p q\n\n/-- The right-hand side of the inequality:\n`sqrt (3*(a^2+b^2+c^2)/(p+q))`. -/\nnoncomputable def inequalityRHS (a b c p q : ℝ) : ℝ :=\n Real.sqrt (3 * (a ^ 2 + b ^ 2 + c ^ 2) / (p + q))\n\n/-- The complete quantified assertion of the source problem: for all real\n`a, b, c, p, q`, if `a, b, c` are positive, `p` and `q` are nonnegative,\nand `p + q` is positive, then the displayed left-hand side is at least the\ndisplayed right-hand side. -/\ndef Target : Prop :=\n ∀ (a b c p q : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n 0 ≤ p →\n 0 ≤ q →\n 0 < p + q →\n inequalityLHS a b c p q ≥ inequalityRHS a b c p q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b57ea187-447e-5336-8f80-14e9d95f953f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "926e6676e7c698824967c04b44b9b4a64fd619a7c3190fe45f64d8714c665a0c", "task_path": "tasks/nmp3_b57ea187-447e-5336-8f80-14e9d95f953f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b57ea187-447e-5336-8f80-14e9d95f953f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b5829ce6-4dd8-5544-978c-334122a0c010", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\ge 0\\). Prove that \n-- \\[\n-- a\\sqrt{a^{2}+bc}+b\\sqrt{b^{2}+ca}+c\\sqrt{c^{2}+ab}\\ge (a+b+c)\\sqrt{\\frac13\\Bigl(a^{2}+b^{2}+c^{2}+ab+bc+ca\\Bigr)}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the stated inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * Real.sqrt (a ^ 2 + b * c) +\n b * Real.sqrt (b ^ 2 + c * a) +\n c * Real.sqrt (c ^ 2 + a * b)\n\n/-- The right-hand side of the stated inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a + b + c) *\n Real.sqrt\n ((1 / 3 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2 + a * b + b * c + c * a))\n\n/-- The assertion: for all nonnegative real numbers `a`, `b`, and `c`, the\nleft-hand side is at least the right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5829ce6-4dd8-5544-978c-334122a0c010", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "53addc5a391bebf53c52f994838bfb70951f03aa4769844e89d679adebe20272", "task_path": "tasks/nmp3_b5829ce6-4dd8-5544-978c-334122a0c010", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5829ce6-4dd8-5544-978c-334122a0c010", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b5926315-3c1d-51af-9d17-97701cf61990", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ satisfy $a+b+c+d=2$. Prove that \n-- \\[\n-- \\frac{1}{1+3a^{2}}+\\frac{1}{1+3b^{2}}+\\frac{1}{1+3c^{2}}+\\frac{1}{1+3d^{2}}\\ge\\frac{16}{7}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the four-variable reciprocal quadratic inequality\n\nThe source problem asks us to prove: if `a`, `b`, `c`, and `d` are positive\nreal numbers whose sum is `2`, then the sum of the four reciprocals\n`1 / (1 + 3*x^2)`, for `x = a,b,c,d`, is at least `16 / 7`.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions in the source problem: all four real\nparameters are strictly positive and their sum is exactly `2`. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧ a + b + c + d = 2\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def reciprocalSum (a b c d : ℝ) : ℝ :=\n 1 / (1 + 3 * a ^ 2) + 1 / (1 + 3 * b ^ 2) +\n 1 / (1 + 3 * c ^ 2) + 1 / (1 + 3 * d ^ 2)\n\n/-- The full assertion of the source problem, universally quantified over all\npositive real quadruples with sum `2`. This is a proposition, not a proof. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n Admissible a b c d →\n reciprocalSum a b c d ≥ (16 : ℝ) / 7\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5926315-3c1d-51af-9d17-97701cf61990", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e757a872c2f54ba85f71ab0e4466bb8c624fe67f0dab13004071224089b06b26", "task_path": "tasks/nmp3_b5926315-3c1d-51af-9d17-97701cf61990", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5926315-3c1d-51af-9d17-97701cf61990", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b5c5d1e5-05c3-588b-a927-819d85d4cf75", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. Show that if $p$ is a prime dividing $5^{4n}-5^{3n}+5^{2n}-5^{n}+1$, then $p\\equiv1\\pmod4$.\nimport Mathlib\n\n/-!\n# Prime divisors of `5^(4n) - 5^(3n) + 5^(2n) - 5^n + 1`\n\nThis file formalizes the statement of the problem. The expression under\nconsideration is represented as an integer, so that its alternating signs are\nliteral integer subtraction. A prime divisor is represented by a natural\nnumber `p` and the divisibility relation is taken in `ℤ`.\n-/\n\nnamespace Problem\n\n/-- The value `5^(4n) - 5^(3n) + 5^(2n) - 5^n + 1`, as an integer. -/\ndef Value (n : ℕ) : ℤ :=\n (5 : ℤ) ^ (4 * n) - (5 : ℤ) ^ (3 * n) + (5 : ℤ) ^ (2 * n) -\n (5 : ℤ) ^ n + 1\n\n/-- The assertion of the problem: for every positive integer `n`, every prime\n`p` dividing `5^(4n) - 5^(3n) + 5^(2n) - 5^n + 1` satisfies `p ≡ 1 (mod 4)`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ∀ p : ℕ, Nat.Prime p →\n (p : ℤ) ∣ Value n → p ≡ 1 [MOD 4]\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5c5d1e5-05c3-588b-a927-819d85d4cf75", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "972e9d86ae60b20437b74de0f66c89668838e1ffec9f3015f72eecc6b54b6040", "task_path": "tasks/nmp3_b5c5d1e5-05c3-588b-a927-819d85d4cf75", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5c5d1e5-05c3-588b-a927-819d85d4cf75", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b5c5fb4c-a69b-5e5e-8d68-5f05d084dbcc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $x^2y+y^2z+z^2x=3$ with $x,y,z>0$, prove that \n-- \\[\n-- \\frac{1}{x(y+z)}+\\frac{1}{y(z+x)}+\\frac{1}{z(x+y)}\\ge\\frac{3}{2}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic inequality problem\n\nThe problem asks to prove an inequality for all positive real triples\n`(x, y, z)` satisfying the cyclic constraint\n`x^2 y + y^2 z + z^2 x = 3`.\n\nThis file records the assertion as a proposition; it deliberately contains no\nproof of that assertion.\n-/\n\nnamespace Problem\n\n/-- The constraint `x^2 y + y^2 z + z^2 x = 3`. -/\ndef CyclicConstraint (x y z : ℝ) : Prop :=\n (x ^ 2) * y + (y ^ 2) * z + (z ^ 2) * x = 3\n\n/-- The left-hand side\n`1 / (x (y + z)) + 1 / (y (z + x)) + 1 / (z (x + y))`. -/\nnoncomputable def CyclicReciprocalSum (x y z : ℝ) : ℝ :=\n 1 / (x * (y + z)) + 1 / (y * (z + x)) + 1 / (z * (x + y))\n\n/-- For every positive real triple satisfying `x^2 y + y^2 z + z^2 x = 3`,\nthe cyclic reciprocal sum is at least `3 / 2`. -/\nnoncomputable def Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n CyclicConstraint x y z →\n CyclicReciprocalSum x y z ≥ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5c5fb4c-a69b-5e5e-8d68-5f05d084dbcc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a95d488540a16eb1d22eebb96d6f7c9e7e5decee8c68a832cf830ce4335a2f34", "task_path": "tasks/nmp3_b5c5fb4c-a69b-5e5e-8d68-5f05d084dbcc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5c5fb4c-a69b-5e5e-8d68-5f05d084dbcc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b5c8f9d1-69ad-5465-bac6-c91844241927", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{(a^4b^9+b^4c^9+c^4a^9)^4}{27a^9b^9c^9}\\ge\\frac1{b^4c^4}+\\frac1{c^4a^4}+\\frac1{a^4b^4}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, `c`\nsatisfying `a * b * c = 1`, the displayed inequality. This file records only\nthe mathematical assertion as propositions and supporting definitions; it\ncontains no proof of the assertion.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (a ^ 4 * b ^ 9 + b ^ 4 * c ^ 9 + c ^ 4 * a ^ 9) ^ 4 /\n ((27 : ℝ) * a ^ 9 * b ^ 9 * c ^ 9)\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 1 / (b ^ 4 * c ^ 4) + 1 / (c ^ 4 * a ^ 4) + 1 / (a ^ 4 * b ^ 4)\n\n/-- The inequality asserted by the problem, using real powers, multiplication,\ndivision, and order as written in the source. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ RHS a b c\n\n/-- The positivity condition `a > 0`, `b > 0`, and `c > 0`. -/\ndef PositiveHyp (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The product condition `a * b * c = 1`. -/\ndef ProductHyp (a b c : ℝ) : Prop :=\n a * b * c = 1\n\n/-- The combined hypotheses of the problem: positivity and product one. -/\ndef Hypotheses (a b c : ℝ) : Prop :=\n PositiveHyp a b c ∧ ProductHyp a b c\n\n/-- The full universal statement: for every positive real triple whose product\nis one, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Hypotheses a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5c8f9d1-69ad-5465-bac6-c91844241927", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2a65a356b3412bd3c6090d646c8c2d14f3a80a3d2875118f528a1d9b60c858cf", "task_path": "tasks/nmp3_b5c8f9d1-69ad-5465-bac6-c91844241927", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5c8f9d1-69ad-5465-bac6-c91844241927", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b5dcc75c-3d29-5f46-8a10-da0fb062fc08", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that \n-- \\[\n-- a^{2}b^{2}+b^{2}c^{2}+c^{2}a^{2}=abc.\n-- \\]\n-- Prove that \n-- \\[\n-- \\sqrt{\\frac{b+c}{1+a}}+\\sqrt{\\frac{c+a}{1+b}}+\\sqrt{\\frac{a+b}{1+c}}\\le\\frac{3}{\\sqrt2}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three variables `a`, `b`, and `c` are positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The constraint `a^2 b^2 + b^2 c^2 + c^2 a^2 = abc`. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2 = a * b * c\n\n/-- The admissibility condition from the problem: positivity together with the\ndisplayed constraint. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Problem.PositiveTriple a b c ∧ Problem.Constraint a b c\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n Real.sqrt ((b + c) / (1 + a)) +\n Real.sqrt ((c + a) / (1 + b)) +\n Real.sqrt ((a + b) / (1 + c))\n\n/-- The asserted upper bound `3 / sqrt 2`. -/\nnoncomputable def RHS : ℝ :=\n 3 / Real.sqrt 2\n\n/-- The inequality asserted in the problem, for a fixed admissible triple. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n Problem.LHS a b c ≤ Problem.RHS\n\n/-- The complete statement: for every positive real `a`, `b`, `c` satisfying\n`a^2 b^2 + b^2 c^2 + c^2 a^2 = abc`, the displayed square-root sum is at most\n`3 / sqrt 2`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Problem.Admissible a b c → Problem.Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5dcc75c-3d29-5f46-8a10-da0fb062fc08", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fc04c41a0bf8b35c36db294d177f42b021841e3e5c5b7d02f492eec44f9bd63e", "task_path": "tasks/nmp3_b5dcc75c-3d29-5f46-8a10-da0fb062fc08", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5dcc75c-3d29-5f46-8a10-da0fb062fc08", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b5e1c27b-e58b-58a8-b5d5-68430fc69092", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exist infinitely many triples \\((a,b,c)\\) of integers satisfying \n-- \\[\n-- 9a^{3}+4b^{3}-48c^{3}+36abc=1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: infinitely many integer solutions of a cubic equation\n\nThis file records the proposition from `problem.md`. It introduces no\nassumptions beyond the integer domain and the equation stated in the problem.\n-/\n\nnamespace Problem\n\n/-- The cubic Diophantine equation\n`9 * a ^ 3 + 4 * b ^ 3 - 48 * c ^ 3 + 36 * a * b * c = 1`. -/\ndef Equation (a b c : ℤ) : Prop :=\n 9 * a ^ 3 + 4 * b ^ 3 - 48 * c ^ 3 + 36 * a * b * c = 1\n\n/-- The set of ordered integer triples `(a, b, c)` satisfying the equation. -/\ndef SolutionSet : Set (ℤ × ℤ × ℤ) :=\n {p | Equation p.1 p.2.1 p.2.2}\n\n/-- There are infinitely many ordered triples of integers satisfying the\ncubic equation displayed in the problem. -/\ndef Target : Prop :=\n SolutionSet.Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5e1c27b-e58b-58a8-b5d5-68430fc69092", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6e9d853cabcc831969ce15b11669497455100063fdfbe77b2068a8a26cc0f548", "task_path": "tasks/nmp3_b5e1c27b-e58b-58a8-b5d5-68430fc69092", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b5e1c27b-e58b-58a8-b5d5-68430fc69092", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b659b1dc-a487-5268-b121-b59181815a32", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer and let $a,b,c,d\\ge0$ satisfy $a+b+c+d=2$. Prove that \n-- \\[\n-- \\frac{a^{n}+b^{n}+c^{n}+d^{n}+2^{\\,3-n}}{3}\\;\\ge\\;\\Bigl(\\frac{a+b+c}{3}\\Bigr)^{n}\n-- +\\Bigl(\\frac{b+c+d}{3}\\Bigr)^{n}\n-- +\\Bigl(\\frac{c+d+a}{3}\\Bigr)^{n}\n-- +\\Bigl(\\frac{d+a+b}{3}\\Bigr)^{n}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the four-variable power-mean inequality\n\nThe source problem asks, for every positive natural number `n` and every\nnonnegative real quadruple `a, b, c, d` whose sum is `2`, to prove a stated\ninequality. We record only the proposition, not a proof.\n\nThe expression `2^(3-n)` is interpreted as the integer power on the reals\n(`zpow`), so that it is meaningful also when `n > 3`; in particular it equals\n`8 / 2^n`. All four base variables and the denominators are real.\n-/\n\nnamespace Problem\n\n/-- The quantity `2^(3-n)` from the left-hand side, interpreted using an\ninteger exponent. -/\nnoncomputable def twoPowThreeSub (n : ℕ) : ℝ :=\n (2 : ℝ) ^ ((3 : ℤ) - (n : ℤ))\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (n : ℕ) (a b c d : ℝ) : ℝ :=\n (a ^ n + b ^ n + c ^ n + d ^ n + twoPowThreeSub n) / (3 : ℝ)\n\n/-- The right-hand side of the inequality in the problem. -/\nnoncomputable def rhs (n : ℕ) (a b c d : ℝ) : ℝ :=\n ((a + b + c) / (3 : ℝ)) ^ n\n + ((b + c + d) / (3 : ℝ)) ^ n\n + ((c + d + a) / (3 : ℝ)) ^ n\n + ((d + a + b) / (3 : ℝ)) ^ n\n\n/-- The asserted inequality, after fixing `n` and the quadruple `a,b,c,d`. -/\nnoncomputable def Inequality (n : ℕ) (a b c d : ℝ) : Prop :=\n lhs n a b c d ≥ rhs n a b c d\n\n/-- The complete proposition asserted by the problem: for every positive\ninteger `n` and every nonnegative real quadruple with sum `2`, the inequality\nholds. -/\nnoncomputable def Target : Prop :=\n ∀ (n : ℕ) (a b c d : ℝ),\n 0 < n →\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n 0 ≤ d →\n a + b + c + d = (2 : ℝ) →\n Inequality n a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b659b1dc-a487-5268-b121-b59181815a32", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0ff8ceca65b46e53d31c72d265c6a567aba1b2b14e81fa75221b68e622e56ed7", "task_path": "tasks/nmp3_b659b1dc-a487-5268-b121-b59181815a32", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b659b1dc-a487-5268-b121-b59181815a32", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b65bcef0-5a5d-52d7-bf79-bad146e49877", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=2$. Prove that \n-- \\[\n-- \\frac{1}{a^{2}+b^{2}}+\\frac{1}{b^{2}+c^{2}}+\\frac{1}{c^{2}+a^{2}}\\ge\\frac{5}{2}\\,.\n-- \\] \n-- (The sum is taken cyclically.)\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The cyclic sum\n`1 / (a ^ 2 + b ^ 2) + 1 / (b ^ 2 + c ^ 2) + 1 / (c ^ 2 + a ^ 2)`. -/\nnoncomputable def CyclicReciprocalSum (a b c : ℝ) : ℝ :=\n 1 / (a ^ 2 + b ^ 2) + 1 / (b ^ 2 + c ^ 2) + 1 / (c ^ 2 + a ^ 2)\n\n/--\nFor all positive real numbers `a`, `b`, and `c` with `a + b + c = 2`,\nthe cyclic reciprocal sum is at least `5 / 2`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 2 →\n CyclicReciprocalSum a b c ≥ (5 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b65bcef0-5a5d-52d7-bf79-bad146e49877", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "755ab8abb7d67c3e1a4642afe3714cd5ece4529512ef06553a098385fdca2a48", "task_path": "tasks/nmp3_b65bcef0-5a5d-52d7-bf79-bad146e49877", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b65bcef0-5a5d-52d7-bf79-bad146e49877", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b66e66a9-a565-5d86-a312-769fc405fec0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{a^{4}+b+c}+\\frac{1}{b^{4}+a+c}+\\frac{1}{c^{4}+a+b}\\le\\frac{3}{a+b+c}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility condition for the variables in the problem:\n`a`, `b`, and `c` are positive real numbers whose product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The inequality asserted in the problem for given real numbers `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n 1 / (a ^ 4 + b + c) +\n 1 / (b ^ 4 + a + c) +\n 1 / (c ^ 4 + a + b) ≤\n 3 / (a + b + c)\n\n/-- The complete statement: for all positive real numbers `a`, `b`, and `c`\nwith `a * b * c = 1`, the asserted cyclic inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b66e66a9-a565-5d86-a312-769fc405fec0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "519591fbd6d8e355a5ecb4d949e0be3f0fb2efaf69a7b5891df91dd5110787f1", "task_path": "tasks/nmp3_b66e66a9-a565-5d86-a312-769fc405fec0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b66e66a9-a565-5d86-a312-769fc405fec0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b6728578-4940-5521-b54d-626d2b24500b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^3+b^3+c^3+3abc=6$. Prove that \n-- \\[\n-- \\frac{1}{a^3}+\\frac{1}{b^3}+\\frac{1}{c^3}+3\\ge 2\\,(a^3+b^3+c^3).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The positivity hypothesis `a, b, c > 0` from the problem statement. -/\ndef PositiveInputs (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The constraint `a^3 + b^3 + c^3 + 3abc = 6` from the problem statement. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a ^ 3 + b ^ 3 + c ^ 3 + 3 * a * b * c = 6\n\n/-- The admissibility conditions imposed on `a`, `b`, and `c`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositiveInputs a b c ∧ Constraint a b c\n\n/--\nThe assertion to be proved: if positive real numbers `a`, `b`, and `c`\nsatisfy `a^3 + b^3 + c^3 + 3abc = 6`, then\n`1/a^3 + 1/b^3 + 1/c^3 + 3 ≥ 2 (a^3 + b^3 + c^3)`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n (1 / (a ^ 3) + 1 / (b ^ 3) + 1 / (c ^ 3) + 3 : ℝ) ≥\n 2 * (a ^ 3 + b ^ 3 + c ^ 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b6728578-4940-5521-b54d-626d2b24500b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "675904d544a92820104f40a05073fe2392ac5f1a98783e37dbd11fc5ff6cd0d8", "task_path": "tasks/nmp3_b6728578-4940-5521-b54d-626d2b24500b", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b6728578-4940-5521-b54d-626d2b24500b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b693f79c-1ed2-5700-90ea-aec26b3aaea7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers such that $xyz=1$. Prove that \n-- \\[\n-- \\frac{x}{y^{2}+2}+\\frac{y}{z^{2}+2}+\\frac{z}{x^{2}+2}\\ge 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissible data for the problem: three positive real numbers whose\nproduct is one. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x * y * z = 1\n\n/--\nFor every triple of positive real numbers `x`, `y`, `z` satisfying `x * y * z = 1`,\nthe cyclic sum `x / (y ^ 2 + 2) + y / (z ^ 2 + 2) + z / (x ^ 2 + 2)` is at least one.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n Admissible x y z →\n x / (y ^ 2 + (2 : ℝ)) + y / (z ^ 2 + (2 : ℝ)) +\n z / (x ^ 2 + (2 : ℝ)) ≥ (1 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b693f79c-1ed2-5700-90ea-aec26b3aaea7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "97b49a8e50f6868f7897d2a51b215073e14cef1a77774ae78e07c6f5752e1795", "task_path": "tasks/nmp3_b693f79c-1ed2-5700-90ea-aec26b3aaea7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b693f79c-1ed2-5700-90ea-aec26b3aaea7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b699770c-9df8-5346-b3cd-712bba13adb3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{\\sqrt{a^2+ab+b^2}+\\sqrt{b^2+bc+c^2}}{\\sqrt{c^2+ca+a^2}}\n-- +\\frac{\\sqrt{b^2+bc+c^2}+\\sqrt{c^2+ca+a^2}}{\\sqrt{a^2+ab+b^2}}\n-- +\\frac{\\sqrt{a^2+ab+b^2}+\\sqrt{c^2+ca+a^2}}{\\sqrt{b^2+bc+c^2}}\n-- \\le \\frac{2\\,(a^2+b^2+c^2)^2}{a^2b^2+b^2c^2+c^2a^2}\\,. \n-- \\] \n-- Equivalently, \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{\\sqrt{a^2+ab+b^2}+\\sqrt{b^2+bc+c^2}}{\\sqrt{c^2+ca+a^2}}\n-- \\le \\frac{2\\,(a^2+b^2+c^2)^2}{a^2b^2+b^2c^2+c^2a^2}\\,,\n-- \\] \n-- where the sum is taken over the three cyclic permutations of $(a,b,c)$.\nimport Mathlib\n\n/-!\n# Formalization of the cyclic square-root inequality\n\nThe source problem asks to prove an inequality for positive real numbers.\nThe expression on the left is represented as a sum of three copies of one\ncyclic term, corresponding exactly to the three cyclic permutations of\n`(a, b, c)`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- One summand of the cyclic sum in the source statement.\n\nFor the ordered triple `(a, b, c)` this is\n`(sqrt (a^2 + a*b + b^2) + sqrt (b^2 + b*c + c^2)) /\n sqrt (c^2 + c*a + a^2)`.\n-/\ndef cyclicTerm (a b c : ℝ) : ℝ :=\n (Real.sqrt (a ^ 2 + a * b + b ^ 2) +\n Real.sqrt (b ^ 2 + b * c + c ^ 2)) /\n Real.sqrt (c ^ 2 + c * a + a ^ 2)\n\n/-- The left-hand side: the sum of the cyclic term over the three cyclic\npermutations `(a,b,c)`, `(b,c,a)`, and `(c,a,b)` of `(a,b,c)`. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The right-hand side of the source inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (2 * (a ^ 2 + b ^ 2 + c ^ 2) ^ 2) /\n (a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2)\n\n/-- The complete assertion of the problem: for all positive real `a`, `b`,\nand `c`, the cyclic square-root sum is at most the displayed rational\nexpression. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n cyclicSum a b c ≤ rhs a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b699770c-9df8-5346-b3cd-712bba13adb3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d548a97e7cd5b673d4cb92763bbdde43e88570b99df1e51af11bb519d1452aae", "task_path": "tasks/nmp3_b699770c-9df8-5346-b3cd-712bba13adb3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b699770c-9df8-5346-b3cd-712bba13adb3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b69c4b5a-0619-5471-82b2-30440e701ea9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be non‑negative real numbers. Prove that \n-- \\[\n-- a\\sqrt{a^{2}+4b^{2}+4c^{2}}+b\\sqrt{b^{2}+4c^{2}+4a^{2}}+c\\sqrt{c^{2}+4a^{2}+4b^{2}}\\ge (a+b+c)^{2}.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The radicand in the first summand:\n`a^2 + 4 b^2 + 4 c^2`. -/\ndef radicandA (a b c : ℝ) : ℝ :=\n a ^ 2 + 4 * b ^ 2 + 4 * c ^ 2\n\n/-- The radicand in the second summand:\n`b^2 + 4 c^2 + 4 a^2`. -/\ndef radicandB (a b c : ℝ) : ℝ :=\n b ^ 2 + 4 * c ^ 2 + 4 * a ^ 2\n\n/-- The radicand in the third summand:\n`c^2 + 4 a^2 + 4 b^2`. -/\ndef radicandC (a b c : ℝ) : ℝ :=\n c ^ 2 + 4 * a ^ 2 + 4 * b ^ 2\n\n/-- The left-hand side of the claimed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a * Real.sqrt (radicandA a b c) +\n b * Real.sqrt (radicandB a b c) +\n c * Real.sqrt (radicandC a b c)\n\n/-- The right-hand side of the claimed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (a + b + c) ^ 2\n\n/--\nFor all nonnegative real numbers `a`, `b`, and `c`, the stated sum of three\nsquare-root terms is at least `(a + b + c)^2`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b69c4b5a-0619-5471-82b2-30440e701ea9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "38a49284612f33f9b96cdfd92f6b9528ae4ebba8da31ec0bf6d5a72b0cfea86c", "task_path": "tasks/nmp3_b69c4b5a-0619-5471-82b2-30440e701ea9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b69c4b5a-0619-5471-82b2-30440e701ea9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b6ad7abf-7e4c-59b9-aa96-2ba2b929d18a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all real numbers $x>0$, prove that \n-- \\[\n-- \\frac{x}{x^2+1}\\;<\\;e^{\\,x^2/2}\\int_{x}^{\\infty}e^{-t^2/2}\\,dt\\,.\n-- \\]\nimport Mathlib\n\n/-!\nFormal statement of the inequality\n`x / (x^2 + 1) < exp (x^2 / 2) * ∫_x^∞ exp (-t^2 / 2) dt`\nfor every real `x > 0`.\n-/\n\nopen MeasureTheory\n\nnamespace Problem\n\n/-- The Gaussian tail integral from `x` to `+∞`:\n`∫_x^∞ exp (-t^2 / 2) dt`, represented as the Lebesgue integral over `Set.Ioi x`. -/\nnoncomputable def gaussianTail (x : ℝ) : ℝ :=\n ∫ t in Set.Ioi x, Real.exp (-(t ^ 2) / 2) ∂volume\n\n/-- For every real number `x > 0`, one has\n`x / (x^2 + 1) < exp (x^2 / 2) * ∫_x^∞ exp (-t^2 / 2) dt`. -/\ndef Target : Prop :=\n ∀ x : ℝ, 0 < x →\n x / (x ^ 2 + 1) < Real.exp (x ^ 2 / 2) * gaussianTail x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b6ad7abf-7e4c-59b9-aa96-2ba2b929d18a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e87594a3280ed017a774b38054453b6bc39e5f19e6a8743f7cc456738c1c95ca", "task_path": "tasks/nmp3_b6ad7abf-7e4c-59b9-aa96-2ba2b929d18a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b6ad7abf-7e4c-59b9-aa96-2ba2b929d18a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b6d2e319-faec-5d94-88b9-0e1e5098a485", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers with $a+b+c=1$. Prove that \n-- \\[\n-- (ab+bc+ca)\\Bigl(\\frac{a}{b^2+b}+\\frac{b}{c^2+c}+\\frac{c}{a^2+a}\\Bigr)\\ge\\frac34\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe original problem asks to prove an inequality for three positive real numbers\nwhose sum is one. This file records the statement only; it contains no proof.\n-/\n\nnamespace Problem\n\n/-- Admissibility conditions for the three real numbers in the problem:\neach is strictly positive and their sum is exactly one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 1\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a * b + b * c + c * a) *\n (a / (b ^ 2 + b) + b / (c ^ 2 + c) + c / (a ^ 2 + a))\n\n/-- The asserted lower bound for the left-hand side. -/\ndef Claim (a b c : ℝ) : Prop :=\n lhs a b c ≥ (3 : ℝ) / 4\n\n/-- The full universally quantified statement requested by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Claim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b6d2e319-faec-5d94-88b9-0e1e5098a485", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c47ae4f427ac6568ff0f288b8b403664c9a5383d23ee864bae3c82570146ef41", "task_path": "tasks/nmp3_b6d2e319-faec-5d94-88b9-0e1e5098a485", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b6d2e319-faec-5d94-88b9-0e1e5098a485", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b6dc8d96-9293-57a4-a625-926cb922131a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a^2+b^2+c^2=3$. Prove that \n-- $$21+18abc\\ge 13(ab+bc+ca).$$\nimport Mathlib\n\n/-!\n# Formal statement of a three-variable real inequality\n\nThe source problem asks to prove the following assertion.\n\nLet `a`, `b`, and `c` be positive real numbers satisfying\n`a ^ 2 + b ^ 2 + c ^ 2 = 3`. Then\n`21 + 18 * a * b * c ≥ 13 * (a * b + b * c + c * a)`.\n\nThe declarations below state exactly this universal implication. In\nparticular, they distinguish strict positivity from nonnegativity and use\nreal arithmetic throughout. No proof of the assertion is included.\n-/\n\nnamespace Problem\n\n/-- The hypothesis that all three variables are strictly positive real\nnumbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n (0 : ℝ) < a ∧ (0 : ℝ) < b ∧ (0 : ℝ) < c\n\n/-- The hypothesis that the sum of the three squared variables is `3`. -/\ndef SquareSumConstraint (a b c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 = (3 : ℝ)\n\n/-- The polynomial inequality asserted in the conclusion. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (21 : ℝ) + (18 : ℝ) * a * b * c ≥\n (13 : ℝ) * (a * b + b * c + c * a)\n\n/-- The full formal assertion: for every triple of positive real numbers\nwhose squared coordinates sum to `3`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n PositiveTriple a b c →\n SquareSumConstraint a b c →\n Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b6dc8d96-9293-57a4-a625-926cb922131a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ca9b17660a5ec795d6165afd6fed8ab944a16fe3cdfb24bfcafd8c1b1411dfa5", "task_path": "tasks/nmp3_b6dc8d96-9293-57a4-a625-926cb922131a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b6dc8d96-9293-57a4-a625-926cb922131a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b6fb11e5-64d3-56d6-93af-13739b78f0c7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $abc=1$. Prove that \n-- \\[\n-- \\sqrt{2a+1}+\\sqrt{2b+1}+\\sqrt{2c+1}\\le \\sqrt{(2a+1)(2b+1)(2c+1)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a three-variable inequality under the constraint `abc = 1`\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and\n`c` satisfying `a*b*c = 1`, that\n\n`sqrt (2*a+1) + sqrt (2*b+1) + sqrt (2*c+1)\n ≤ sqrt ((2*a+1)*(2*b+1)*(2*c+1))`.\n\nThe declaration `Problem.Target` below packages exactly this universally\nquantified assertion. It is a proposition-valued definition; no proof is\nprovided at this statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition from the source: `a`, `b`, and `c` are\npositive real numbers whose product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (2 * a + 1) + Real.sqrt (2 * b + 1) + Real.sqrt (2 * c + 1)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n Real.sqrt ((2 * a + 1) * (2 * b + 1) * (2 * c + 1))\n\n/-- The full universally quantified statement of the source problem: for every\ntriple of positive reals with product one, the sum of the three square roots is\nat most the square root of their product. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b6fb11e5-64d3-56d6-93af-13739b78f0c7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "deb25df28112c2d40b99eef440b9bfffd0d66faba9b61d8de7c4027fc0c0bc55", "task_path": "tasks/nmp3_b6fb11e5-64d3-56d6-93af-13739b78f0c7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b6fb11e5-64d3-56d6-93af-13739b78f0c7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b70830fd-77c0-558d-8917-ce55e825804c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\sum_{cyc}\\frac{a^{3}}{a^{2}+b^{2}}\\;\\ge\\;\\frac{\\sqrt{3\\,(a^{2}+b^{2}+c^{2})}}{2}.\n-- \\] \n-- (The sum is taken cyclically: $\\frac{a^{3}}{a^{2}+b^{2}}+\\frac{b^{3}}{b^{2}+c^{2}}+\\frac{c^{3}}{c^{2}+a^{2}}$.)\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The cyclic sum\n`a^3 / (a^2 + b^2) + b^3 / (b^2 + c^2) + c^3 / (c^2 + a^2)`. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n a ^ 3 / (a ^ 2 + b ^ 2) +\n b ^ 3 / (b ^ 2 + c ^ 2) +\n c ^ 3 / (c ^ 2 + a ^ 2)\n\n/-- For all positive real numbers `a`, `b`, and `c`, the cyclic sum of the three\nfractions is at least one half of the square root of\n`3 * (a^2 + b^2 + c^2)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n cyclicSum a b c ≥ Real.sqrt (3 * (a ^ 2 + b ^ 2 + c ^ 2)) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b70830fd-77c0-558d-8917-ce55e825804c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0fc639cd3b6741767336d52c46a4f113d60a1de1e6e535db3f5efe354e510ed4", "task_path": "tasks/nmp3_b70830fd-77c0-558d-8917-ce55e825804c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b70830fd-77c0-558d-8917-ce55e825804c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b712964c-8b7f-5571-af55-e977a3e3b75f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$. Prove that \n-- \\[\n-- \\bigl(b^2c^2+c^2a^2+a^2b^2\\bigr)^2\\ge 3abc\\bigl(a^2b^3+b^2c^3+c^2a^3\\bigr)\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the nonnegative three-variable inequality\n\nThe source problem asks to prove, for all nonnegative real numbers `a`, `b`, and `c`,\nthat\n\\[\n (b^2 c^2 + c^2 a^2 + a^2 b^2)^2\n \\ge 3abc(a^2 b^3 + b^2 c^3 + c^2 a^3).\n\\]\nThe declarations below record the mathematical statement without asserting a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality:\n`(b^2 c^2 + c^2 a^2 + a^2 b^2)^2`. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2 + a ^ 2 * b ^ 2) ^ 2\n\n/-- The right-hand side of the displayed inequality:\n`3abc(a^2 b^3 + b^2 c^3 + c^2 a^3)`. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (3 : ℝ) * a * b * c * (a ^ 2 * b ^ 3 + b ^ 2 * c ^ 3 + c ^ 2 * a ^ 3)\n\n/-- The complete assertion of the problem: for all nonnegative real `a`, `b`, and `c`,\nthe left-hand side is at least the right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b712964c-8b7f-5571-af55-e977a3e3b75f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "561deb9d69ca2681e40189a14df96bfc99c39c166cab4ea0b3f2b53414734a3e", "task_path": "tasks/nmp3_b712964c-8b7f-5571-af55-e977a3e3b75f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b712964c-8b7f-5571-af55-e977a3e3b75f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b7165365-08e0-5b0c-998b-585dec782a3e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers satisfying $a^{2}+b^{2}+c^{2}=3$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a^{3}+1}{\\,b+1\\,}}+\\sqrt{\\frac{b^{3}+1}{\\,c+1\\,}}+\\sqrt{\\frac{c^{3}+1}{\\,a+1\\,}}\\ge 3,\n-- \\] \n-- with equality only at $a=b=c=1$.\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic radical inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwith `a^2 + b^2 + c^2 = 3`, the cyclic inequality\n\n`sqrt ((a^3 + 1) / (b + 1)) +\n sqrt ((b^3 + 1) / (c + 1)) +\n sqrt ((c^3 + 1) / (a + 1)) ≥ 3`\n\nand to characterize its equality case as exactly `a = b = c = 1`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the cyclic radical inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n Real.sqrt ((a ^ 3 + 1) / (b + 1)) +\n Real.sqrt ((b ^ 3 + 1) / (c + 1)) +\n Real.sqrt ((c ^ 3 + 1) / (a + 1))\n\n/-- The point `(1, 1, 1)`, written as the conjunction of coordinate equalities. -/\ndef equalityPoint (a b c : ℝ) : Prop :=\n a = 1 ∧ b = 1 ∧ c = 1\n\n/--\nThe full assertion of the source problem: for all positive real triples satisfying\n`a^2 + b^2 + c^2 = 3`, the cyclic radical sum is at least `3`, and equality in\nthat inequality holds exactly at `(1, 1, 1)`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = 3 →\n leftHandSide a b c ≥ 3 ∧\n (leftHandSide a b c = 3 ↔ equalityPoint a b c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b7165365-08e0-5b0c-998b-585dec782a3e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "59bc224a87674498c578ab0df99bfc935574a17c70bd4a4110930952686556e7", "task_path": "tasks/nmp3_b7165365-08e0-5b0c-998b-585dec782a3e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b7165365-08e0-5b0c-998b-585dec782a3e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b73391f8-737d-5282-ab82-7d391f750971", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers \\(x,\\;y,\\;z\\) prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{x(y+z)}{(x+2y+2z)^{2}}\\le \\sum_{\\text{cyc}}\\frac{(x+y)(x+y+2z)}{(3x+3y+4z)^{2}}\\,,\n-- \\] \n-- i.e. \n-- \\[\n-- \\frac{x(y+z)}{(x+2y+2z)^{2}}+\\frac{y(z+x)}{(y+2z+2x)^{2}}+\\frac{z(x+y)}{(z+2x+2y)^{2}}\n-- \\le\n-- \\frac{(x+y)(x+y+2z)}{(3x+3y+4z)^{2}}+\\frac{(y+z)(y+z+2x)}{(3y+3z+4x)^{2}}+\\frac{(z+x)(z+x+2y)}{(3z+3x+4y)^{2}}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand cyclic sum in the problem. -/\ndef lhs (x y z : ℝ) : ℝ :=\n x * (y + z) / (x + 2 * y + 2 * z) ^ 2 +\n y * (z + x) / (y + 2 * z + 2 * x) ^ 2 +\n z * (x + y) / (z + 2 * x + 2 * y) ^ 2\n\n/-- The right-hand cyclic sum in the problem. -/\ndef rhs (x y z : ℝ) : ℝ :=\n (x + y) * (x + y + 2 * z) / (3 * x + 3 * y + 4 * z) ^ 2 +\n (y + z) * (y + z + 2 * x) / (3 * y + 3 * z + 4 * x) ^ 2 +\n (z + x) * (z + x + 2 * y) / (3 * z + 3 * x + 4 * y) ^ 2\n\n/-- The pointwise inequality asserted by the problem. -/\ndef Inequality (x y z : ℝ) : Prop :=\n lhs x y z ≤ rhs x y z\n\n/-- The predicate that all three variables are strictly positive. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- For every triple of positive real numbers, the left-hand cyclic sum is at most\nthe right-hand cyclic sum. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → Inequality x y z\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b73391f8-737d-5282-ab82-7d391f750971", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3f0d98d536586483241117e68f5eb1dee34e0b0aff25865dd9da0603fe94224a", "task_path": "tasks/nmp3_b73391f8-737d-5282-ab82-7d391f750971", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b73391f8-737d-5282-ab82-7d391f750971", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b73e2144-4ae8-5aae-8d0c-a11bad1288f9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A point K is taken inside parallelogram ABCD such that the midpoint of side AD is equidistant from K and C, and the midpoint of side CD is equidistant from K and A. Let N be the midpoint of segment BK. Prove that ∠NAK = ∠NCK.\nmodule\n\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Analysis.Convex.Topology\npublic import Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\n/-!\n# Formal statement: a parallelogram midpoint-angle configuration\n\nThe problem is stated in the Euclidean plane. The declarations below introduce\nthe geometric configuration as an explicit predicate and then state the claimed\nangle equality. No proof of the claim is supplied.\n-/\n\n@[expose] public section\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/--\n`A`, `B`, `C`, `D` are the vertices, in order, of a parallelogram.\n\nA quadrilateral is a parallelogram exactly when its diagonals bisect one\nanother, i.e. the midpoint of `AC` is the midpoint of `BD`.\n-/\ndef IsParallelogram (A B C D : Plane) : Prop :=\n midpoint ℝ A C = midpoint ℝ B D\n\n/--\n`K` lies strictly inside the parallelogram with vertices `A`, `B`, `C`, `D`.\n\nThe filled parallelogram is represented as the convex hull of its four vertices,\nand strict containment is represented by membership in its topological interior.\n-/\ndef StrictlyInsideParallelogram (A B C D K : Plane) : Prop :=\n IsParallelogram A B C D ∧\n K ∈ interior (convexHull ℝ ({A, B, C, D} : Set Plane))\n\n/-- The midpoint of side `AD` is equidistant from `K` and `C`. -/\ndef MidpointADEquidistant (A C D K : Plane) : Prop :=\n dist (midpoint ℝ A D) K = dist (midpoint ℝ A D) C\n\n/-- The midpoint of side `CD` is equidistant from `K` and `A`. -/\ndef MidpointCDEquidistant (A C D K : Plane) : Prop :=\n dist (midpoint ℝ C D) K = dist (midpoint ℝ C D) A\n\n/-- `N` is the midpoint of segment `BK`. -/\ndef NIsMidpointBK (B K N : Plane) : Prop :=\n N = midpoint ℝ B K\n\n/--\nThe full geometric configuration of the problem, including the construction of\n`N` as the midpoint of `BK`.\n-/\ndef Configuration (A B C D K N : Plane) : Prop :=\n StrictlyInsideParallelogram A B C D K ∧\n MidpointADEquidistant A C D K ∧\n MidpointCDEquidistant A C D K ∧\n NIsMidpointBK B K N\n\n/-- The angle equality claimed in the problem, with its four relevant points. -/\ndef ClaimedAngleEquality (A C K N : Plane) : Prop :=\n EuclideanGeometry.angle N A K = EuclideanGeometry.angle N C K\n\n/--\nThe assertion to be proved: in every configuration as above, the (undirected)\nangle `∠NAK` at `A` equals the (undirected) angle `∠NCK` at `C`.\n-/\ndef Target : Prop :=\n ∀ A B C D K N : Plane,\n Configuration A B C D K N →\n ClaimedAngleEquality A C K N\n\nend Problem\n\nend\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b73e2144-4ae8-5aae-8d0c-a11bad1288f9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6f133d03ff2e1b81bb470e3ee39afc89d2087b902145c06ad4243559208a7ffa", "task_path": "tasks/nmp3_b73e2144-4ae8-5aae-8d0c-a11bad1288f9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b73e2144-4ae8-5aae-8d0c-a11bad1288f9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b7592b2d-4b39-55c5-a547-119e25a1f092", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:(1,\\infty)\\to\\mathbb{R}$ be a differentiable function satisfying \n-- \\[\n-- f'(x)=\\frac{x^{2}-\\bigl(f(x)\\bigr)^{2}}{x^{2}\\bigl(\\bigl(f(x)\\bigr)^{2}+1\\bigr)}\\qquad\\text{for all }x>1.\n-- \\] \n-- Prove that \n-- \\[\n-- \\displaystyle\\lim_{x\\to\\infty}f(x)=\\infty .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the differential-equation problem\n\nThe original problem concerns a differentiable real-valued function on the\nopen interval `(1, ∞)`. In Lean a function on an interval is represented by\na total function `ℝ → ℝ`; the interval is enforced by using\n`DifferentiableOn` and `derivWithin` only on `Set.Ioi 1`. Values outside\nthat interval are irrelevant to the statement.\n-/\n\nnamespace Problem\n\n/-- The source domain `(1, ∞)`. -/\nabbrev domain : Set ℝ := Set.Ioi (1 : ℝ)\n\n/-- The right-hand side of the differential equation, as a function of the\nindependent variable `x` and the value `y = f x`. All operations are the\nreal operations (in particular, `/` is real division). -/\nnoncomputable def rhs (x y : ℝ) : ℝ :=\n (x ^ (2 : ℕ) - y ^ (2 : ℕ)) / (x ^ (2 : ℕ) * (y ^ (2 : ℕ) + (1 : ℝ)))\n\n/-- The function has a derivative on the whole original domain `(1, ∞)`.\nDifferentiability is taken relative to the interval; no condition is imposed\noutside the interval. -/\nnoncomputable def DifferentiableOnDomain (f : ℝ → ℝ) : Prop :=\n DifferentiableOn ℝ f (domain)\n\n/-- The differential equation holds at every point `x > 1`, with the\nderivative understood as the derivative of the restriction to `(1, ∞)`. -/\nnoncomputable def SatisfiesDifferentialEquation (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, 1 < x → derivWithin f domain x = rhs x (f x)\n\n/-- Admissibility is the conjunction of differentiability on `(1, ∞)` and the\ndifferential equation at every point of that interval. -/\nnoncomputable def Admissible (f : ℝ → ℝ) : Prop :=\n DifferentiableOnDomain f ∧ SatisfiesDifferentialEquation f\n\n/-- The claimed limit: as `x → ∞`, `f x → ∞`. In Lean this is the filter\nstatement that `f` tends to `atTop` in the codomain along `atTop` in the\ndomain. -/\nnoncomputable def TendsToInfinity (f : ℝ → ℝ) : Prop :=\n Filter.Tendsto f (Filter.atTop : Filter ℝ) (Filter.atTop : Filter ℝ)\n\n/-- Formal target of the problem: every admissible `f` tends to `+∞`. -/\nnoncomputable def Target : Prop :=\n ∀ f : ℝ → ℝ, Admissible f → TendsToInfinity f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b7592b2d-4b39-55c5-a547-119e25a1f092", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "902acc6983ddfafc5e2d5e4e06d0a693547d73ee01a0ad8d5721abaf1b73ef9c", "task_path": "tasks/nmp3_b7592b2d-4b39-55c5-a547-119e25a1f092", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b7592b2d-4b39-55c5-a547-119e25a1f092", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b7614df0-93ff-503a-b792-648803cf241a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d,e$ be positive numbers such that \n-- $$abc+abd+abe+acd+ace+ade+bcd+bce+bde+cde=10.$$ \n-- Prove that \n-- \\[\n-- 1+\\frac{13}{a+b+c+d+e}\\ge\\frac{36}{ab+ac+ad+ae+bc+bd+be+cd+ce+de}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the five-variable inequality problem\n\nThe source problem asks to prove, for five positive real numbers whose ten\nthreefold products sum to `10`, an inequality involving the sum of the five\nnumbers and the sum of their ten pairwise products.\n-/\n\nnamespace Problem\n\n/-- The sum of the ten pairwise products of the five variables. -/\ndef pairSum (a b c d e : ℝ) : ℝ :=\n a * b + a * c + a * d + a * e +\n b * c + b * d + b * e +\n c * d + c * e +\n d * e\n\n/-- The sum of the ten threefold products of the five variables. -/\ndef tripleSum (a b c d e : ℝ) : ℝ :=\n a * b * c + a * b * d + a * b * e +\n a * c * d + a * c * e + a * d * e +\n b * c * d + b * c * e + b * d * e +\n c * d * e\n\n/-- The sum of the five variables. -/\ndef totalSum (a b c d e : ℝ) : ℝ :=\n a + b + c + d + e\n\n/-- The assertion of the problem: for all positive real numbers `a, b, c, d, e`\nwith `abc + abd + abe + acd + ace + ade + bcd + b * c * e + bde + cde = 10`,\nthe stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c d e : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 0 < d →\n 0 < e →\n tripleSum a b c d e = 10 →\n 1 + (13 : ℝ) / totalSum a b c d e ≥\n (36 : ℝ) / pairSum a b c d e\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b7614df0-93ff-503a-b792-648803cf241a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2375e627e566e8559ca7dcd70f54007bbd0a1de5f3ea3886788d65da06d3215c", "task_path": "tasks/nmp3_b7614df0-93ff-503a-b792-648803cf241a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b7614df0-93ff-503a-b792-648803cf241a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b785f966-6f82-51cb-b7b6-97d576aa9db0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for any finite sequence of decimal digits (i.e., any positive integer $N$ with no leading zero), there exists a natural number $n$ such that the decimal expansion of $2^n$ begins with those digits.\nimport Mathlib.Data.Nat.Digits.Lemmas\n\n/-!\n# Decimal leading digits of powers of two\n\nThis file formalizes the statement of the problem, without proving it.\n-/\n\nnamespace Problem\n\n/-- The decimal digits of a natural number, written most significant digit first.\n\n`Nat.digits 10 n` is little-endian, so reversing it gives the usual decimal\nexpansion (with no leading zero when `n > 0`). For `n = 0` it is the empty\nlist, which is Mathlib's convention for the digits of zero. -/\ndef decimalDigits (n : ℕ) : List ℕ :=\n (Nat.digits 10 n).reverse\n\n/-- The usual decimal expansion of `n` begins with the decimal digits of `N`. -/\ndef BeginsWithDigits (n N : ℕ) : Prop :=\n List.IsPrefix (decimalDigits N) (decimalDigits n)\n\n/-- For every positive integer `N` (equivalently, for every finite sequence of\ndecimal digits with no leading zero), some power `2 ^ n` has a decimal\nexpansion beginning with the digits of `N`.\n\nThe exponent `n` is a natural number in Lean's usual sense and may be zero.\n-/\ndef Target : Prop :=\n ∀ N : ℕ, 0 < N → ∃ n : ℕ, BeginsWithDigits (2 ^ n) N\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b785f966-6f82-51cb-b7b6-97d576aa9db0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6453037efb5d56518e8d5a229b3da26ad2dbc81eb9b5af416320ffbb77ce5170", "task_path": "tasks/nmp3_b785f966-6f82-51cb-b7b6-97d576aa9db0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b785f966-6f82-51cb-b7b6-97d576aa9db0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b794b0ad-80f8-5424-98ae-7307f78f1386", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle. On each side construct an outward isosceles triangle: $\\triangle BCA'$ on side $BC$ with $A'B=A'C$, $\\triangle CAB'$ on side $CA$ with $B'C=B'A$, and $\\triangle ABC'$ on side $AB$ with $C'A=C'B$. Suppose the three apex angles satisfy \n-- \\[\n-- \\angle A'+\\angle B'+\\angle C'=360^\\circ .\n-- \\] \n-- Prove that \n-- \\[\n-- 2\\angle A'B'C'=\\angle AB'C .\n-- \\] \n-- (Here $\\angle A'$ denotes $\\angle B A' C$, etc., and $\\angle AB'C$ is the angle with vertex $B'$ formed by $B'A$ and $B'C$.)\nmodule\n\npublic import Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\n\n/-!\nFormalization of the triangle problem in `problem.md`.\n\nThe ambient Euclidean plane is represented by `EuclideanSpace ℝ (Fin 2)`.\nAngles are the ordinary undirected angles from mathlib, measured in radians.\n-/\n\nopen scoped EuclideanGeometry\n\nnoncomputable section\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The Euclidean plane used for the geometry problem. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Twice the signed area of the ordered triangle `(P, Q, R)`, computed as the\ntwo-dimensional cross product of `Q - P` and `R - P`. Its sign records on\nwhich side of the oriented line through `P` and `Q` the point `R` lies. -/\ndef cross (P Q R : Plane) : ℝ :=\n (Q 0 - P 0) * (R 1 - P 1) - (Q 1 - P 1) * (R 0 - P 0)\n\n/-- `A`, `B`, and `C` form a nondegenerate triangle. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n cross A B C ≠ 0\n\n/-- The points `R` and `S` lie strictly on opposite sides of the line through\nthe distinct points `P` and `Q`. -/\ndef OppositeSidesOfLine (P Q R S : Plane) : Prop :=\n cross P Q R * cross P Q S < 0\n\n/-- The triangle with apex `Apex` and base `P Q` is nondegenerate, isosceles\nwith equal legs from the apex, and is constructed outward with respect to the\nreference vertex `R`: its apex lies on the side of line `P Q` opposite `R`. -/\ndef OutwardIsoscelesTriangle (Apex P Q R : Plane) : Prop :=\n dist Apex P = dist Apex Q ∧ OppositeSidesOfLine P Q Apex R\n\n/-- The configuration consisting of a triangle `ABC` and three outward\nisosceles triangles on its sides `BC`, `CA`, and `AB`, with apexes `A'`, `B'`,\nand `C'` respectively. -/\ndef ExternalIsoscelesConfiguration (A B C A' B' C' : Plane) : Prop :=\n IsTriangle A B C ∧\n OutwardIsoscelesTriangle A' B C A ∧\n OutwardIsoscelesTriangle B' C A B ∧\n OutwardIsoscelesTriangle C' A B C\n\n/-- The undirected angle `∠ P V Q`, with vertex `V`. -/\ndef apexAngle (P Q V : Plane) : ℝ := ∠ P V Q\n\n/-- One full turn, `360°`, in radians. -/\ndef fullTurn : ℝ := 2 * Real.pi\n\n/-- The sum of the three apex angles of the outward isosceles triangles is\n`360°`. Here the apex angles are `∠ B A' C`, `∠ C B' A`, and `∠ A C' B`. -/\ndef ApexAngleSum (A B C A' B' C' : Plane) : Prop :=\n apexAngle B C A' + apexAngle C A B' + apexAngle A B C' = fullTurn\n\n/-- The angle relation asserted by the problem: twice the undirected angle\n`∠ A' B' C'` equals the undirected angle `∠ A B' C`. -/\ndef AngleConclusion (A C A' B' C' : Plane) : Prop :=\n 2 * ∠ A' B' C' = ∠ A B' C\n\n/-- The complete assertion of the problem: for every nondegenerate triangle\n`ABC` with outward isosceles triangles on its three sides, if the three apex\nangles sum to `360°`, then twice the angle `∠ A' B' C'` equals the angle\n`∠ A B' C`. -/\ndef Target : Prop :=\n ∀ A B C A' B' C' : Plane,\n ExternalIsoscelesConfiguration A B C A' B' C' →\n ApexAngleSum A B C A' B' C' →\n AngleConclusion A C A' B' C'\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b794b0ad-80f8-5424-98ae-7307f78f1386", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "81b8a11b1516652611eb4bbdf1e19b1481abae8f3ba97c97511811169177a112", "task_path": "tasks/nmp3_b794b0ad-80f8-5424-98ae-7307f78f1386", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b794b0ad-80f8-5424-98ae-7307f78f1386", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b7ae27ae-8835-523c-8c1d-1047d0a8332b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p(x)\\in\\mathbb Z[x]$ be an irreducible polynomial and let $q$ be a fixed prime. For each integer $n\\ge1$ define $a_n$ to be the number of residue classes $x\\pmod{q^n}$ satisfying \n-- $$p(x)\\equiv0\\pmod{q^n}.$$ \n-- Prove that there exists an integer $M$ such that the sequence $\\{a_n\\}_{n\\ge M}$ is constant; i.e. $a_n=a_M$ for all $n\\ge M$.\nimport Mathlib\n\nnamespace Problem\n\n/-- `x : ZMod m` is a root of `p` modulo `m`. -/\ndef IsRootModulo (p : Polynomial ℤ) (m : ℕ) (x : ZMod m) : Prop :=\n Polynomial.eval₂ (Int.castRingHom (ZMod m)) x p = 0\n\n/-- Number of residue classes modulo a nonzero modulus `m` that are roots of `p`. -/\nnoncomputable def residueClassRootCount\n (p : Polynomial ℤ) (m : ℕ) [NeZero m] : ℕ := by\n classical\n exact Fintype.card {x : ZMod m // IsRootModulo p m x}\n\n/-- The count `a_n` for modulus `q ^ n`, where `q` is nonzero (in applications, prime). -/\nnoncomputable def primePowerRootCount\n (p : Polynomial ℤ) (q n : ℕ) (hq : q ≠ 0) : ℕ := by\n letI : NeZero (q ^ n) := ⟨pow_ne_zero n hq⟩\n exact residueClassRootCount p (q ^ n)\n\n/-- The sequence `a_n` associated to `p` and a nonzero modulus base `q`. -/\nnoncomputable def rootCountSequence\n (p : Polynomial ℤ) (q : ℕ) (hq : q ≠ 0) : ℕ → ℕ :=\n fun n => primePowerRootCount p q n hq\n\n/-- The tail of a sequence of natural numbers, indexed by positive integers, is constant\nfrom a positive integer `M` -/\ndef TailConstantFrom (a : ℕ → ℕ) (M : ℤ) : Prop :=\n ∀ n : ℤ, 1 ≤ n → M ≤ n → a n.toNat = a M.toNat\n\n/-- Target statement: for every irreducible integer polynomial `p` and every prime `q`,\nsome positive integer `M` gives constancy of the prime-power root counts for all indices\nat least `M`. -/\ndef Target : Prop :=\n ∀ (p : Polynomial ℤ) (_hp : Irreducible p) (q : ℕ) (hq : Nat.Prime q),\n ∃ M : ℤ, 1 ≤ M ∧\n TailConstantFrom (rootCountSequence p q (Nat.Prime.ne_zero hq)) M\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b7ae27ae-8835-523c-8c1d-1047d0a8332b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "67d7f6d2f7b3a3cd8964795e0e6dfa373b5cf90b9a3b5668efeda14585b302cc", "task_path": "tasks/nmp3_b7ae27ae-8835-523c-8c1d-1047d0a8332b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b7ae27ae-8835-523c-8c1d-1047d0a8332b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b7b4e2b4-bde0-5eaf-b364-c01c7bcb4231", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle (all angles acute so the square roots are real) satisfying \n-- \\[\n-- \\sqrt{\\tan A}+\\sqrt{\\tan B}+\\sqrt{\\tan C}\n-- =\\sqrt{\\cot\\frac A2}+\\sqrt{\\cot\\frac B2}+\\sqrt{\\cot\\frac C2}.\n-- \\] \n-- Prove that $\\triangle ABC$ is equilateral (i.e. $A=B=C=\\tfrac{\\pi}{3}$).\nimport Mathlib\n\n/-!\nFormalization of the statement: an acute triangle all of whose angle measures\nsatisfy the displayed square-root identity must be equilateral.\n\nThe variables `A`, `B`, and `C` denote the radian measures of the three angles,\nnot the vertices themselves.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The three positive angle measures of a nondegenerate Euclidean triangle,\nmeasured in radians. -/\ndef IsTriangleAngles (A B C : ℝ) : Prop :=\n 0 < A ∧ 0 < B ∧ 0 < C ∧ A + B + C = Real.pi\n\n/-- All three angle measures are strictly acute. -/\ndef AreAcuteAngles (A B C : ℝ) : Prop :=\n A < Real.pi / 2 ∧ B < Real.pi / 2 ∧ C < Real.pi / 2\n\n/-- `A`, `B`, and `C` are the angle measures of an acute triangle. -/\ndef IsAcuteTriangleAngles (A B C : ℝ) : Prop :=\n IsTriangleAngles A B C ∧ AreAcuteAngles A B C\n\n/-- The displayed square-root identity from the problem.\n\n`Real.sqrt` is the nonnegative real square root. Under the acute-angle\nhypotheses the arguments are nonnegative, so this is the ordinary real square\nroot appearing in the source statement. -/\ndef SatisfiesAngleSqrtEquation (A B C : ℝ) : Prop :=\n Real.sqrt (Real.tan A) + Real.sqrt (Real.tan B) + Real.sqrt (Real.tan C) =\n Real.sqrt (Real.cot (A / 2)) + Real.sqrt (Real.cot (B / 2)) +\n Real.sqrt (Real.cot (C / 2))\n\n/-- The angle measures of an equilateral triangle, in radians. -/\ndef IsEquilateralTriangleAngles (A B C : ℝ) : Prop :=\n A = Real.pi / 3 ∧ B = Real.pi / 3 ∧ C = Real.pi / 3\n\n/-- The complete assertion: every acute Euclidean triangle whose angle measures\nsatisfy the displayed identity is equilateral. -/\ndef Target : Prop :=\n ∀ A B C : ℝ,\n IsAcuteTriangleAngles A B C →\n SatisfiesAngleSqrtEquation A B C → IsEquilateralTriangleAngles A B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b7b4e2b4-bde0-5eaf-b364-c01c7bcb4231", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "616e738bca4e64c5d4f9506ccaf52c9a609d3a6e56a61dd67ce48328100444e5", "task_path": "tasks/nmp3_b7b4e2b4-bde0-5eaf-b364-c01c7bcb4231", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b7b4e2b4-bde0-5eaf-b364-c01c7bcb4231", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b819e120-1f47-569a-92b5-c695f4951577", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\left(\\frac{1}{a+\\sqrt{a^{2}+bc}}\\right)^{2}\n-- +\\left(\\frac{1}{b+\\sqrt{b^{2}+ac}}\\right)^{2}\n-- +\\left(\\frac{1}{c+\\sqrt{c^{2}+ab}}\\right)^{2}\n-- >\\frac{(a+b)^{2}+(b+c)^{2}+(c+a)^{2}}\n-- {(a+b+c)(a+b)(b+c)(c+a)}\\,. \n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the inequality stated in `problem.md`.\n\nFor positive real numbers `a`, `b`, and `c`, the assertion compares a sum of\nthree squared reciprocal expressions involving principal real square roots with\na rational expression built from sums of the variables.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the stated inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n (1 / (a + Real.sqrt (a ^ 2 + b * c))) ^ 2 +\n (1 / (b + Real.sqrt (b ^ 2 + a * c))) ^ 2 +\n (1 / (c + Real.sqrt (c ^ 2 + a * b))) ^ 2\n\n/-- The right-hand side of the stated inequality. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n (((a + b) ^ 2 + (b + c) ^ 2 + (c + a) ^ 2) /\n ((a + b + c) * (a + b) * (b + c) * (c + a)))\n\n/--\nThe complete universal statement from the problem: for every triple of positive\nreal numbers `a`, `b`, `c`, the left-hand side is strictly greater than the\nright-hand side.\n-/\nnoncomputable def Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n leftHandSide a b c > rightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b819e120-1f47-569a-92b5-c695f4951577", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2ab78534ed6b45e5cb614063e11f9ad200510dd23542cc3393f01215eae77323", "task_path": "tasks/nmp3_b819e120-1f47-569a-92b5-c695f4951577", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b819e120-1f47-569a-92b5-c695f4951577", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b874c5ec-9a4d-5c1f-98b8-5c468acc6716", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers such that $a,b,c\\in\\Bigl(\\frac1{\\sqrt6},\\,+\\infty\\Bigr)$ and $a^{2}+b^{2}+c^{2}=1$. Prove that \n-- \\[\n-- \\frac{1+a^{2}}{\\sqrt{\\,2a^{2}+3ab-c^{2}\\,}}+\\frac{1+b^{2}}{\\sqrt{\\,2b^{2}+3bc-a^{2}\\,}}+\\frac{1+c^{2}}{\\sqrt{\\,2c^{2}+3ca-b^{2}\\,}}\\ge 2\\,(a+b+c)\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a cyclic square-root inequality\n\nThe source problem asks for a proof of an inequality for three real numbers,\neach strictly greater than `1 / sqrt 6`, whose squares sum to one. The declaration `Problem.Target` below is\nthe proposition to be proved; it is intentionally not accompanied by a proof.\n-/\n\nnamespace Problem\n\n/-- The lower endpoint `1 / sqrt 6` appearing in the source problem. -/\nnoncomputable def threshold : ℝ := 1 / Real.sqrt 6\n\n/-- Admissibility predicate for the three variables in the source problem.\n\nEach variable is strictly greater than `1 / sqrt 6`, and the sum of their\nsquares is `1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n (threshold < a ∧ threshold < b ∧ threshold < c) ∧\n a ^ 2 + b ^ 2 + c ^ 2 = 1\n\n/-- The radicand in the first summand. -/\ndef radicandA (a b c : ℝ) : ℝ :=\n 2 * a ^ 2 + 3 * a * b - c ^ 2\n\n/-- The radicand in the second summand. -/\ndef radicandB (a b c : ℝ) : ℝ :=\n 2 * b ^ 2 + 3 * b * c - a ^ 2\n\n/-- The radicand in the third summand. -/\ndef radicandC (a b c : ℝ) : ℝ :=\n 2 * c ^ 2 + 3 * c * a - b ^ 2\n\n/-- The first summand of the left-hand side. -/\nnoncomputable def summandA (a b c : ℝ) : ℝ :=\n (1 + a ^ 2) / Real.sqrt (radicandA a b c)\n\n/-- The second summand of the left-hand side. -/\nnoncomputable def summandB (a b c : ℝ) : ℝ :=\n (1 + b ^ 2) / Real.sqrt (radicandB a b c)\n\n/-- The third summand of the left-hand side. -/\nnoncomputable def summandC (a b c : ℝ) : ℝ :=\n (1 + c ^ 2) / Real.sqrt (radicandC a b c)\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def leftSide (a b c : ℝ) : ℝ :=\n summandA a b c + summandB a b c + summandC a b c\n\n/-- The right-hand side of the inequality in the source problem. -/\ndef rightSide (a b c : ℝ) : ℝ :=\n 2 * (a + b + c)\n\n/-- The asserted non-strict inequality for a fixed admissible triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n leftSide a b c ≥ rightSide a b c\n\n/-- The complete proposition asserted by the source problem: for every real\ntriple satisfying the stated hypotheses, the cyclic square-root inequality\nholds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b874c5ec-9a4d-5c1f-98b8-5c468acc6716", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a85875fa23248b25beb6ac0a3387a696339330fabe36608ed178f348c6dee313", "task_path": "tasks/nmp3_b874c5ec-9a4d-5c1f-98b8-5c468acc6716", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b874c5ec-9a4d-5c1f-98b8-5c468acc6716", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b87d80ca-1066-55d3-90c9-2333e0d67183", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{3a^3+13abc}{(b+c)^3}+\\frac{3b^3+13abc}{(c+a)^3}+\\frac{3c^3+13abc}{(a+b)^3}\\ge 6.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nFor positive real numbers `a`, `b`, and `c`, prove that\n\\[\n\\frac{3a^3+13abc}{(b+c)^3}\n+\\frac{3b^3+13abc}{(c+a)^3}\n+\\frac{3c^3+13abc}{(a+b)^3}\\ge 6.\n\\]\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality, as a function of `a`, `b`, `c`. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (3 * a ^ 3 + 13 * a * b * c) / (b + c) ^ 3 +\n (3 * b ^ 3 + 13 * a * b * c) / (c + a) ^ 3 +\n (3 * c ^ 3 + 13 * a * b * c) / (a + b) ^ 3\n\n/-- The statement to be proved: for all positive real `a`, `b`, `c`, the required\nsum is at least `6`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n lhs a b c ≥ 6\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b87d80ca-1066-55d3-90c9-2333e0d67183", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "af7b5a32b8dba544935a86fc415cc26495d69f80d40662c401b5a019cc3e7a92", "task_path": "tasks/nmp3_b87d80ca-1066-55d3-90c9-2333e0d67183", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b87d80ca-1066-55d3-90c9-2333e0d67183", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b88f8d5c-66c2-5880-b57c-42712b3f7692", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that the Diophantine equation \n-- \\[\n-- 7^x = 1 + y^2 + z^2\n-- \\]\n-- has no solutions in positive integers \\(x,\\;y,\\;z\\).\nimport Mathlib\n\nnamespace Problem\n\n/-- A solution of `7^x = 1 + y^2 + z^2` in positive integers. -/\ndef IsPositiveSolution (x y z : ℕ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧\n (7 : ℕ) ^ x = 1 + y ^ 2 + z ^ 2\n\n/-- The Diophantine equation `7^x = 1 + y^2 + z^2` has no solution\nin positive integers `x`, `y`, and `z`. -/\ndef Target : Prop :=\n ¬ ∃ x y z : ℕ, IsPositiveSolution x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b88f8d5c-66c2-5880-b57c-42712b3f7692", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f158f7313aefb58991c4975c359b1e7d3dfe0e871b25904e30d375964a136cca", "task_path": "tasks/nmp3_b88f8d5c-66c2-5880-b57c-42712b3f7692", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b88f8d5c-66c2-5880-b57c-42712b3f7692", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b8d199de-34ea-5c9f-8e89-52938f117df6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{a}{\\,1+a+b^{2}\\,}\\ge\\frac34,\n-- \\] \n-- where the sum is taken cyclically: $\\frac{a}{1+a+b^2}+\\frac{b}{1+b+c^2}+\\frac{c}{1+c+a^2}\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the cyclic inequality problem\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, `c`\nwhose sum is `3`, the cyclic inequality\n\n`a / (1 + a + b^2) + b / (1 + b + c^2) + c / (1 + c + a^2) >= 3 / 4`.\n\nThis file records the admissibility predicate, the cyclic sum, and the target\nproposition as a `Prop`-valued definition. It deliberately contains no proof\nof the target.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition on the variables: `a`, `b`, and `c` are\nnonnegative real numbers with sum `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n (0 ≤ a) ∧ (0 ≤ b) ∧ (0 ≤ c) ∧ (a + b + c = 3)\n\n/-- The cyclic sum from the statement, with the three summands written out in\nthe order specified in the source. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n a / (1 + a + b ^ 2) + b / (1 + b + c ^ 2) + c / (1 + c + a ^ 2)\n\n/-- The target assertion: for every triple of nonnegative real numbers with sum\n`3`, the cyclic sum is at least `3 / 4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → CyclicSum a b c ≥ (3 : ℝ) / 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b8d199de-34ea-5c9f-8e89-52938f117df6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1034386175900fb6e8115bdd8c3256535a1328e9d97686945bee3240ada80ee0", "task_path": "tasks/nmp3_b8d199de-34ea-5c9f-8e89-52938f117df6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b8d199de-34ea-5c9f-8e89-52938f117df6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b8e54aee-86f0-5f93-bfb7-b55c81f0ce74", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sum_{cyc}\\frac{a(b+c)}{b^{2}+bc+c^{2}}\\ge \n-- \\frac{a^{2}b+b^{2}c+c^{2}a}{ab^{2}+bc^{2}+ca^{2}}+\n-- \\frac{ab^{2}+bc^{2}+ca^{2}}{a^{2}b+b^{2}c+c^{2}a}\\, .\n-- \\] \n-- (The cyclic sum runs over $(a,b,c)$, $(b,c,a)$ and $(c,a,b)$.)\nimport Mathlib\n\n/-!\n# Formal statement of a cyclic inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthe cyclic inequality stated in `Problem.Target` below. This file only records\nthe mathematical assertion as a proposition; it intentionally contains no\nproof of it.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The three-term cyclic sum\n`f a b c + f b c a + f c a b`. -/\ndef cyclicSum (a b c : ℝ) (f : ℝ → ℝ → ℝ → ℝ) : ℝ :=\n f a b c + f b c a + f c a b\n\n/-- One summand of the left-hand cyclic sum, namely\n`a * (b + c) / (b ^ 2 + b * c + c ^ 2)`. -/\ndef leftCyclicTerm (a b c : ℝ) : ℝ :=\n a * (b + c) / (b ^ 2 + b * c + c ^ 2)\n\n/-- The cyclic sum on the left-hand side of the problem. -/\ndef leftSide (a b c : ℝ) : ℝ :=\n cyclicSum a b c leftCyclicTerm\n\n/-- The first displayed numerator on the right-hand side:\n`a ^ 2 * b + b ^ 2 * c + c ^ 2 * a`. -/\ndef firstRightNumerator (a b c : ℝ) : ℝ :=\n a ^ 2 * b + b ^ 2 * c + c ^ 2 * a\n\n/-- The first displayed denominator on the right-hand side:\n`a * b ^ 2 + b * c ^ 2 + c * a ^ 2`. -/\ndef firstRightDenominator (a b c : ℝ) : ℝ :=\n a * b ^ 2 + b * c ^ 2 + c * a ^ 2\n\n/-- The right-hand side of the problem: the two displayed reciprocal\nfractions. -/\ndef rightSide (a b c : ℝ) : ℝ :=\n firstRightNumerator a b c / firstRightDenominator a b c +\n firstRightDenominator a b c / firstRightNumerator a b c\n\n/-- The full assertion of the source problem: for all positive real numbers\n`a`, `b`, and `c`, the cyclic sum on the left is at least the two-term\nexpression on the right. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n leftSide a b c ≥ rightSide a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b8e54aee-86f0-5f93-bfb7-b55c81f0ce74", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5e0d1921d07635daf62bd6606682e32a2208c91894980083297d0f8a52135cf3", "task_path": "tasks/nmp3_b8e54aee-86f0-5f93-bfb7-b55c81f0ce74", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b8e54aee-86f0-5f93-bfb7-b55c81f0ce74", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b90fa26f-4e5d-5d5e-a248-9a94fe4c950b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy \n-- \\[\n-- \\frac{1}{b^{2}+c^{2}+1}+\\frac{1}{c^{2}+a^{2}+1}+\\frac{1}{a^{2}+b^{2}+1}\\ge1.\n-- \\] \n-- Prove that \n-- \\[\n-- b^{2}+3\\ge2b\\,(a+c).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem quantifies over positive real numbers `a`, `b`, and `c`\nsatisfying a reciprocal-square inequality and asks for the stated quadratic\ninequality as the conclusion. The target below records the complete universal\nimplication; it is a proposition, not a proof.\n-/\n\nnamespace Problem\n\n/-- The assumptions of the problem: `a`, `b`, and `c` are positive and their\nreciprocal-square sum is at least one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n 1 / (b ^ 2 + c ^ 2 + 1) +\n 1 / (c ^ 2 + a ^ 2 + 1) +\n 1 / (a ^ 2 + b ^ 2 + 1) ≥ 1\n\n/-- The asserted conclusion of the problem. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n b ^ 2 + 3 ≥ 2 * b * (a + c)\n\n/-- The complete statement to be proved: every positive real triple satisfying\nthe reciprocal-square hypothesis also satisfies the requested inequality. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b90fa26f-4e5d-5d5e-a248-9a94fe4c950b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b10f6eabb9330506d580ad53c5a81598be6bfa049c83989ef27026bcb98c932a", "task_path": "tasks/nmp3_b90fa26f-4e5d-5d5e-a248-9a94fe4c950b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b90fa26f-4e5d-5d5e-a248-9a94fe4c950b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b9208ea1-6cfa-5dc0-89bb-61e3a1aaa509", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$ and $b$ be non‑negative integers and define \n-- $$q=\\frac{a^2+b^2}{ab+1}.$$ \n-- Assume $q$ is an integer. Prove that \n-- $$q=\\bigl(\\gcd(a,b)\\bigr)^2\\,.$$\nimport Mathlib\n\n/-!\nFormalization of the statement:\n\nLet `a` and `b` be non-negative integers and define\n`q = (a^2 + b^2) / (a*b + 1)`. Assume `q` is an integer. Prove that\n`q = (gcd a b)^2`.\n\nThe declaration `Problem.Target` is a proposition, not a proof. Natural\nnumbers `ℕ` encode the non-negative integers, and the quotient is interpreted\nin `ℚ`. The hypothesis that `q` is an integer is represented by membership in\nthe image of `ℤ` in `ℚ`.\n-/\n\nnamespace Problem\n\n/-- The rational number `q = (a^2 + b^2) / (a*b + 1)` attached to natural\nnumbers `a` and `b`. -/\ndef q (a b : ℕ) : ℚ :=\n ((a : ℚ) ^ 2 + (b : ℚ) ^ 2) / ((a : ℚ) * (b : ℚ) + 1)\n\n/-- A rational number is an integer when it is the image of some integer. -/\ndef IsInteger (r : ℚ) : Prop :=\n ∃ z : ℤ, r = (z : ℚ)\n\n/-- The statement to be proved: for all non-negative integers `a` and `b`, if\n`q = (a^2 + b^2)/(a*b+1)` is an integer, then\n`q = (gcd(a,b))^2`. -/\ndef Target : Prop :=\n ∀ a b : ℕ, IsInteger (q a b) → q a b = ((Nat.gcd a b : ℕ) : ℚ) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b9208ea1-6cfa-5dc0-89bb-61e3a1aaa509", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "24c789cf8d3f9ba94a9e7d54269f1697cc6a074236cfd63993249b0121657bb6", "task_path": "tasks/nmp3_b9208ea1-6cfa-5dc0-89bb-61e3a1aaa509", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b9208ea1-6cfa-5dc0-89bb-61e3a1aaa509", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b92728d1-ee1d-52d8-a0c9-5f9c8f6b9e24", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G=(V,E)$ be a simple connected graph with $|V|=n\\ge2$ vertices and $|E|=m$ edges. A partition $(V_1,V_2)$ of $V$ is called *separating* if $V_1\\neq\\varnothing$, $V_2\\neq\\varnothing$, $V_1\\cup V_2=V$, $V_1\\cap V_2=\\varnothing$, and both induced subgraphs $G[V_1]$ and $G[V_2]$ are connected. Prove that $G$ has at least $m$ separating partitions.\nimport Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected\nimport Mathlib.Combinatorics.SimpleGraph.Finite\nimport Mathlib.Data.Fintype.Powerset\nimport Mathlib.Data.Finset.Sym\n\n/-!\n# Separating partitions of a finite simple connected graph\n\nThis file formalizes the statement of the problem. A two-block partition is\nrepresented as an unordered pair of finite vertex sets, using `Sym2`. The\npredicate `IsSeparatingPartitionAt` records the defining conditions for an\nordered pair of blocks; `IsSeparatingPartition` then regards the two blocks as\ninterchangeable.\n-/\n\nnamespace Problem\n\nuniverse u\n\nvariable {V : Type u}\n\n/-- The two finite blocks `A` and `B` form a valid separating partition of the\nvertex set of `G`. The induced graphs on both blocks are required to be\nconnected in the sense of `SimpleGraph.Connected`. -/\ndef IsSeparatingPartitionAt (G : SimpleGraph V) (A B : Finset V) : Prop :=\n (A : Set V).Nonempty ∧\n (B : Set V).Nonempty ∧\n (A : Set V) ∪ (B : Set V) = Set.univ ∧\n (A : Set V) ∩ (B : Set V) = ∅ ∧\n (G.induce (A : Set V)).Connected ∧\n (G.induce (B : Set V)).Connected\n\n/-- An unordered two-block partition of the vertex set of `G` is separating if\none (equivalently, either) ordering of its two blocks satisfies\n`IsSeparatingPartitionAt`. -/\ndef IsSeparatingPartition (G : SimpleGraph V) (P : Sym2 (Finset V)) : Prop :=\n ∃ A B : Finset V, P = s(A, B) ∧ IsSeparatingPartitionAt G A B\n\n/-- The number of edges of a finite simple graph, in the form of the cardinality\nof its edge finset. The classical choice of decidability instances only makes\nthe finite edge set available as a finset; it adds no mathematical hypothesis. -/\nnoncomputable def edgeCount [Fintype V] (G : SimpleGraph V) : ℕ := by\n classical\n exact G.edgeFinset.card\n\n/-- The finite set of all separating partitions of a finite graph, where a\npartition is represented by the unordered pair of its two vertex blocks. -/\nnoncomputable def separatingPartitions [Fintype V]\n (G : SimpleGraph V) : Finset (Sym2 (Finset V)) := by\n classical\n exact Finset.univ.filter (IsSeparatingPartition G)\n\n/-- The formal target of the problem: if `V` has `n` vertices with `n ≥ 2`,\n`G` is a simple connected graph with `m` edges, then `G` has at least `m`\n(unordered) separating partitions. -/\ndef Target : Prop :=\n ∀ (V : Type u) [Fintype V] (G : SimpleGraph V) (n m : ℕ),\n Fintype.card V = n →\n 2 ≤ n →\n edgeCount G = m →\n G.Connected →\n m ≤ (separatingPartitions G).card\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b92728d1-ee1d-52d8-a0c9-5f9c8f6b9e24", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9139c0f7c881e27c1079c6e39fd2153ffca2ab11d781562ffead80c4d36c6472", "task_path": "tasks/nmp3_b92728d1-ee1d-52d8-a0c9-5f9c8f6b9e24", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b92728d1-ee1d-52d8-a0c9-5f9c8f6b9e24", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b93eeaf3-d891-5134-bcc8-9a95be41e4b0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Two players alternately replace the stars in the expression \n-- \n-- \\[*x^{2000}+*x^{1999}+ \\dots + *x + 1\\] \n-- \n-- by real numbers. Thus each coefficient of $x^{2000},x^{1999},\\dots ,x$ is initially an asterisk and the constant term is fixed at $1$. After all $2000$ asterisks have been replaced, the resulting polynomial $P(x)$ is examined. The player who makes the last move **loses** if $P(x)$ has a real root $t$ with $|t|<1$, and **wins** otherwise. Give a winning strategy for one of the players.\nimport Mathlib\n\n/-!\n# Formal statement: a coefficient-replacement game\n\nThe problem concerns the polynomial whose unknown coefficients of\n`x^2000, x^1999, ..., x` are replaced, one per move, by real numbers. The\nconstant coefficient is fixed to `1`. This file states the game and the\nassertion that one of the two players has a winning strategy. It does not\nprovide or prove a strategy.\n-/\n\nnamespace Problem\n\n/-- The number of initially unknown coefficients (the asterisks). -/\ndef numberOfStars : ℕ := 2000\n\n/-- An index for one of the initially unknown coefficients. The index `i`\ncorresponds to the coefficient of `x ^ (i.val + 1)`, so the indices range\nover the coefficients of `x`, `x^2`, ..., `x^2000`. -/\nabbrev CoefficientIndex : Type := Fin numberOfStars\n\n/-- A turn index. There is exactly one turn for each asterisk. -/\nabbrev TurnIndex : Type := Fin numberOfStars\n\n/-- The two players. `first` makes moves `0, 2, 4, ...`, and `second`\nmakes moves `1, 3, 5, ...` (using zero-based turn numbers). -/\ninductive Player where\n | first\n | second\nderiving DecidableEq, Repr\n\n/-- A move chooses one star (represented by its coefficient index) and\nreplaces it by a real number. -/\nstructure Move where\n coefficient : CoefficientIndex\n value : ℝ\n\n/-- A deterministic strategy for a player, represented as a function from\nthe chronological list of previous moves to that player's next move.\nLegality of the returned move is imposed separately by `IsLegalStrategy`. -/\nabbrev Strategy (_p : Player) : Type := List Move → Move\n\n/-- The player whose turn it is at a zero-based move/turn number. -/\ndef playerAtTurn (n : ℕ) : Player :=\n if n % 2 = 0 then Player.first else Player.second\n\n/-- The player owning a turn in a completed play. -/\ndef turnOwner (k : TurnIndex) : Player :=\n playerAtTurn k.val\n\n/-- Since there are `2000` (an even number of) moves, the second player\nmakes the last move. -/\ndef lastMover : Player :=\n playerAtTurn (numberOfStars - 1)\n\n/-- A history is legal when it has at most `2000` moves and no coefficient\nhas been chosen twice. -/\ndef LegalHistory (h : List Move) : Prop :=\n h.length ≤ numberOfStars ∧ (h.map Move.coefficient).Nodup\n\n/-- A strategy is legal when, at every legal position where its player is to\nmove and a star remains, it selects a coefficient that has not yet been\nreplaced. -/\ndef IsLegalStrategy (p : Player) (σ : Strategy p) : Prop :=\n ∀ h : List Move,\n LegalHistory h →\n h.length < numberOfStars →\n playerAtTurn h.length = p →\n (σ h).coefficient ∉ h.map Move.coefficient\n\n/-- A completed play consists of a permutation recording which coefficient is\nreplaced on each turn, together with the real number placed in that\ncoefficient. The bijection guarantees that all the `2000` asterisks are\nreplaced exactly once. -/\nstructure CompletedPlay where\n coefficientAtTurn : TurnIndex ≃ CoefficientIndex\n valueAtTurn : TurnIndex → ℝ\n\n/-- The move made on a given turn of a completed play. -/\ndef CompletedPlay.move (g : CompletedPlay) (k : TurnIndex) : Move :=\n ⟨g.coefficientAtTurn k, g.valueAtTurn k⟩\n\n/-- The chronological list of moves before turn `k`. -/\ndef historyBefore (moves : TurnIndex → Move) (k : TurnIndex) : List Move :=\n List.ofFn (fun j : Fin k.val =>\n moves ⟨j.val, Nat.lt_trans j.isLt k.isLt⟩)\n\n/-- The value finally assigned to the coefficient of `x ^ (i.val + 1)`. -/\nnoncomputable def CompletedPlay.coefficientValue\n (g : CompletedPlay) (i : CoefficientIndex) : ℝ :=\n g.valueAtTurn (g.coefficientAtTurn.symm i)\n\n/-- The polynomial\n`1 + c_1 x + c_2 x^2 + ... + c_2000 x^2000`.\nThe displayed descending order in the problem is immaterial for the\npolynomial's values and roots. -/\nnoncomputable def polynomialFromCoefficients\n (c : CoefficientIndex → ℝ) : Polynomial ℝ :=\n Polynomial.C 1 +\n ∑ i : CoefficientIndex,\n Polynomial.C (c i) * Polynomial.X ^ (i.val + 1)\n\n/-- The final polynomial `P(x)` resulting from a completed play. -/\nnoncomputable def CompletedPlay.polynomial (g : CompletedPlay) : Polynomial ℝ :=\n polynomialFromCoefficients g.coefficientValue\n\n/-- `P` has a real root `t` with `|t| < 1`. -/\ndef HasRealRootWithAbsLtOne (P : Polynomial ℝ) : Prop :=\n ∃ t : ℝ, Polynomial.eval t P = 0 ∧ |t| < 1\n\n/-- The last mover loses exactly when the final polynomial has a real root in\nthe open unit disc. -/\ndef LastMoverLoses (g : CompletedPlay) : Prop :=\n HasRealRootWithAbsLtOne g.polynomial\n\n/-- The last mover wins exactly when there is no such root. -/\ndef LastMoverWins (g : CompletedPlay) : Prop :=\n ¬ LastMoverLoses g\n\n/-- The outcome rule. A player wins exactly when either that player made the\nlast move and the last mover wins, or the other player made the last move and\nthe last mover loses. -/\ndef PlayerWins (p : Player) (g : CompletedPlay) : Prop :=\n (p = lastMover ∧ LastMoverWins g) ∨\n (p ≠ lastMover ∧ LastMoverLoses g)\n\n/-- A completed play follows a strategy for `p` when, on every turn owned by\n`p`, the chosen move is the one prescribed by the strategy from the earlier\nchronological moves. The opponent's moves are unrestricted (apart from being\nlegal completed-play moves). -/\ndef FollowsStrategy (p : Player) (σ : Strategy p) (g : CompletedPlay) : Prop :=\n ∀ k : TurnIndex,\n turnOwner k = p → g.move k = σ (historyBefore g.move k)\n\n/-- A winning strategy for `p`: it is legal at every legal position and\nevery completed play consistent with it makes `p` win. -/\ndef IsWinningStrategy (p : Player) (σ : Strategy p) : Prop :=\n IsLegalStrategy p σ ∧\n ∀ g : CompletedPlay,\n FollowsStrategy p σ g → PlayerWins p g\n\n/-- The correctness predicate for a proposed answer consisting of a player\nand a deterministic strategy for that player. -/\ndef WinningStrategyCorrect (p : Player) (σ : Strategy p) : Prop :=\n IsWinningStrategy p σ\n\n/-- The target assertion: one of the two players has a winning strategy in\nthis finite perfect-information game. -/\ndef Target : Prop :=\n ∃ p : Player, ∃ σ : Strategy p, WinningStrategyCorrect p σ\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b93eeaf3-d891-5134-bcc8-9a95be41e4b0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cf3a441183d23e254050f2d996209882157c9ad90e409b34a58bfcf563938814", "task_path": "tasks/nmp3_b93eeaf3-d891-5134-bcc8-9a95be41e4b0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b93eeaf3-d891-5134-bcc8-9a95be41e4b0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b9453477-bd24-5b79-841e-110f91e7fe3a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that\n-- \\[\n-- \\frac{ab(a^2+b^2)}{a^2+b^2+ac+bc}+\\frac{bc(b^2+c^2)}{b^2+c^2+ba+ca}+\\frac{ca(c^2+a^2)}{c^2+a^2+cb+ab}\\le \\frac{a^2+b^2+c^2}{2}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The first summand on the left-hand side of the displayed inequality. -/\ndef term1 (a b c : ℝ) : ℝ :=\n a * b * (a ^ 2 + b ^ 2) /\n (a ^ 2 + b ^ 2 + a * c + b * c)\n\n/-- The second summand on the left-hand side of the displayed inequality. -/\ndef term2 (a b c : ℝ) : ℝ :=\n b * c * (b ^ 2 + c ^ 2) /\n (b ^ 2 + c ^ 2 + b * a + c * a)\n\n/-- The third summand on the left-hand side of the displayed inequality. -/\ndef term3 (a b c : ℝ) : ℝ :=\n c * a * (c ^ 2 + a ^ 2) /\n (c ^ 2 + a ^ 2 + c * b + a * b)\n\n/-- The full left-hand side of the displayed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n term1 a b c + term2 a b c + term3 a b c\n\n/-- The right-hand side of the displayed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) / (2 : ℝ)\n\n/-- The assertion: for all positive real numbers `a`, `b`, and `c`, the displayed\nthree-term sum is at most `(a^2 + b^2 + c^2) / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≤ rhs a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b9453477-bd24-5b79-841e-110f91e7fe3a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0af44a1ce7ce8d6b853c3a5c0073d4696040dfda3a7c77d729dff11883807670", "task_path": "tasks/nmp3_b9453477-bd24-5b79-841e-110f91e7fe3a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b9453477-bd24-5b79-841e-110f91e7fe3a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b94f539f-ef3b-5771-880d-fc3e7b640be3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,\\;b,\\;c\\) be positive real numbers such that \n-- \\(3(a^{2}+b^{2}+c^{2})+ab+bc+ca=12.\\) \n-- Prove that \n-- \\[\n-- \\frac{a}{\\sqrt{a+b}}+\\frac{b}{\\sqrt{b+c}}+\\frac{c}{\\sqrt{c+a}}\\le\\frac{3}{\\sqrt2}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the inequality problem\n\nThe source problem asks for a proof that a certain inequality holds for every\ntriple of positive real numbers satisfying the given constraint.\n-/\n\nnamespace Problem\n\n/-- The constraint\n`3 * (a ^ 2 + b ^ 2 + c ^ 2) + a * b + b * c + c * a = 12`. -/\ndef Constraint (a b c : ℝ) : Prop :=\n 3 * (a ^ 2 + b ^ 2 + c ^ 2) + a * b + b * c + c * a = 12\n\n/-- The admissible triples are exactly the positive real triples satisfying\nthe problem's constraint. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ Constraint a b c\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def Lhs (a b c : ℝ) : ℝ :=\n a / Real.sqrt (a + b) + b / Real.sqrt (b + c) + c / Real.sqrt (c + a)\n\n/-- The full mathematical assertion to be proved: for every triple of positive\nreal numbers satisfying the constraint, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Lhs a b c ≤ 3 / Real.sqrt 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b94f539f-ef3b-5771-880d-fc3e7b640be3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0806e6c19257dadc071165ae829098f8c8162dd04d88dbfb69b0784f16bd95c1", "task_path": "tasks/nmp3_b94f539f-ef3b-5771-880d-fc3e7b640be3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b94f539f-ef3b-5771-880d-fc3e7b640be3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b953a9a8-a38c-5f66-b3f8-b131d85ae45c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>2$ be an integer. Identify the plane $\\mathbb{R}^2$ with the complex numbers. Let $f:\\mathbb{R}^2\\to\\mathbb{R}$ be a function such that for any regular $n$‑gon $A_1A_2\\cdots A_n$ in the plane, \n-- \\[\n-- f(A_1)+f(A_2)+\\dots+f(A_n)=0.\n-- \\] \n-- Prove that $f$ is the zero function.\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A finite sequence of points of the complex plane is the ordered list of\nvertices of a nondegenerate regular `n`-gon if it is obtained from a circle of\npositive radius by taking the vertices at equal angular increments of `2 * pi / n`\nin one of the two cyclic directions. The real parameter `phase` chooses the\nfirst vertex, and `orientation = 1` or `orientation = -1` chooses the direction. -/\ndef IsRegularNGon (n : ℕ) (A : Fin n → ℂ) : Prop :=\n ∃ (center : ℂ) (radius phase : ℝ) (orientation : ℤ),\n 0 < radius ∧\n (orientation = 1 ∨ orientation = -1) ∧\n Function.Injective A ∧\n ∀ k : Fin n,\n A k = center + (radius : ℂ) *\n Complex.exp ((((phase + (orientation : ℝ) *\n (2 * Real.pi * (k : ℝ) / (n : ℝ))) : ℝ) : ℂ) * Complex.I)\n\n/-- The hypothesis that the sum of the values of `f` on the vertices of every\nregular `n`-gon is zero. -/\ndef RegularPolygonSumZero (n : ℕ) (f : ℂ → ℝ) : Prop :=\n ∀ A : Fin n → ℂ, Problem.IsRegularNGon n A → (∑ k : Fin n, f (A k)) = 0\n\n/-- The assertion of the problem: for every natural number `n > 2`, every\nfunction from the complex plane to the real line whose sum over the vertices of\nevery regular `n`-gon is zero must be identically zero. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (_hn : 2 < n) (f : ℂ → ℝ),\n Problem.RegularPolygonSumZero n f → ∀ x : ℂ, f x = 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b953a9a8-a38c-5f66-b3f8-b131d85ae45c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ea60c76dace0693b82759f6ca94756e0b21e0775919d1cde76b3ecb58ef0d8a4", "task_path": "tasks/nmp3_b953a9a8-a38c-5f66-b3f8-b131d85ae45c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b953a9a8-a38c-5f66-b3f8-b131d85ae45c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b9756eca-33d3-5dc8-aa54-2e1168194a03", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there are infinitely many pairs of distinct primes \\((m,n)\\) such that \n-- \\[\n-- 3^n \\equiv 3 \\pmod m,\\qquad 3^m \\equiv 3 \\pmod n.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility predicate for an ordered pair of distinct primes `(m, n)`\nsatisfying both congruences `3 ^ n ≡ 3 [MOD m]` and `3 ^ m ≡ 3 [MOD n]`. -/\ndef IsSolution (m n : ℕ) : Prop :=\n Nat.Prime m ∧ Nat.Prime n ∧ m ≠ n ∧\n Nat.ModEq m (3 ^ n) 3 ∧ Nat.ModEq n (3 ^ m) 3\n\n/-- The set of ordered pairs satisfying the two congruences. -/\ndef SolutionSet : Set (ℕ × ℕ) :=\n {p | IsSolution p.1 p.2}\n\n/-- There are infinitely many ordered pairs of distinct primes satisfying the\ntwo displayed congruences. -/\ndef Target : Prop :=\n Set.Infinite SolutionSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b9756eca-33d3-5dc8-aa54-2e1168194a03", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b8689fdaa949874aaf579b3cc1084d003c238108cb5bfcf777d30c8a99bca495", "task_path": "tasks/nmp3_b9756eca-33d3-5dc8-aa54-2e1168194a03", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b9756eca-33d3-5dc8-aa54-2e1168194a03", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b98ba459-34a0-5de1-b5c5-3b9b0a5f645e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove the inequality \n-- \\[\n-- \\frac{a^2}{b^2}+\\frac{b^2}{c^2}+\\frac{c^2}{a^2}\\ge\n-- \\left(\\frac{a+c}{b+c}\\right)^{2}+\\left(\\frac{b+a}{c+a}\\right)^{2}+\\left(\\frac{c+b}{a+b}\\right)^{2}\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality:\n`a^2 / b^2 + b^2 / c^2 + c^2 / a^2`. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 2 / b ^ 2 + b ^ 2 / c ^ 2 + c ^ 2 / a ^ 2\n\n/-- The right-hand side of the inequality:\n`((a + c)/(b + c))^2 + ((b + a)/(c + a))^2 + ((c + b)/(a + b))^2`. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n ((a + c) / (b + c)) ^ 2 +\n ((b + a) / (c + a)) ^ 2 +\n ((c + b) / (a + b)) ^ 2\n\n/-- For all positive real numbers `a`, `b`, and `c`, the claimed inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b98ba459-34a0-5de1-b5c5-3b9b0a5f645e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "469fc5c147decee16533a5ca0527c0e2fad5c7170e0b7b8ffef649140701f22d", "task_path": "tasks/nmp3_b98ba459-34a0-5de1-b5c5-3b9b0a5f645e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b98ba459-34a0-5de1-b5c5-3b9b0a5f645e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b98f3c2e-84bd-5ce7-a94e-fa72166dc2ed", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For non‑negative real numbers $a,b,c$ satisfying $a+b+c=3$, prove that \n-- $$3\\bigl(a^4+b^4+c^4\\bigr)+33\\ge 14\\bigl(a^2+b^2+c^2\\bigr).$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissible triples: three non-negative real numbers whose sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a + b + c = 3\n\n/-- The inequality asserted in the problem, universally quantified over all admissible triples. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c →\n 3 * (a ^ 4 + b ^ 4 + c ^ 4) + 33 ≥ 14 * (a ^ 2 + b ^ 2 + c ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b98f3c2e-84bd-5ce7-a94e-fa72166dc2ed", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4d9fe2969385d111f04d19002a95332fc2fdf1353d1406f5eb92a855a7825927", "task_path": "tasks/nmp3_b98f3c2e-84bd-5ce7-a94e-fa72166dc2ed", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b98f3c2e-84bd-5ce7-a94e-fa72166dc2ed", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b9ae6158-f522-5b7f-beb5-abd46a649119", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots,a_n>0$ be real numbers with $a_1a_2\\cdots a_n=1$ (where $n\\in\\mathbb N$). Prove that \n-- \\[\n-- \\frac{1}{a_1}+\\frac{1}{a_2}+\\dots+\\frac{1}{a_n}+\\frac{4n}{\\,n+a_1+a_2+\\dots+a_n\\,}\\ge n+2.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the inequality problem in `problem.md`.\n\nThe source uses the standard convention that `n ∈ ℕ` in the phrase\n`a₁, a₂, ..., aₙ` means a positive natural number. Thus the finite index\ntype is `Fin n` together with the hypothesis `1 ≤ n`.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The admissible data for the problem: a positive natural number `n` and\npositive real numbers indexed by `1, ..., n` whose product is one. -/\ndef Admissible (n : ℕ) (a : Fin n → ℝ) : Prop :=\n 1 ≤ n ∧ (∀ i : Fin n, 0 < a i) ∧ (∏ i : Fin n, a i = 1)\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (n : ℕ) (a : Fin n → ℝ) : ℝ :=\n (∑ i : Fin n, (a i)⁻¹) +\n (4 * (n : ℝ)) / ((n : ℝ) + ∑ i : Fin n, a i)\n\n/-- The right-hand side of the asserted inequality. -/\ndef rhs (n : ℕ) : ℝ :=\n (n : ℝ) + 2\n\n/-- The proposition to be proved: for every positive integer `n` and every\npositive `n`-tuple of reals with product `1`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (a : Fin n → ℝ),\n Admissible n a → lhs n a ≥ rhs n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b9ae6158-f522-5b7f-beb5-abd46a649119", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "85db5cf0261fa2bf4271d6f1f32b8106d19081ec379a48f4119528b4274b8178", "task_path": "tasks/nmp3_b9ae6158-f522-5b7f-beb5-abd46a649119", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b9ae6158-f522-5b7f-beb5-abd46a649119", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b9cd9d50-bb04-5ba1-9d6a-9ecfd8f7be94", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are positive real numbers and $k$ is a real number such that\n-- \\[\n-- \\frac{a}{b^2(b+c)^3}+\\frac{b}{c^2(c+a)^3}+\\frac{c}{a^2(a+b)^3}\\le\\frac{k}{(ab+bc+ca)^2},\n-- \\]\n-- prove that\n-- \\[\n-- \\frac{a}{b+c}+\\frac{b}{c+a}+\\frac{c}{a+b}\\le\\frac{4k}{9}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and\n`c` and every real number `k`, that the stated upper bound assumption implies\nthe stated upper bound on the Nesbitt-type sum.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem.\n\nFor all real numbers `a`, `b`, `c`, and `k`, if `a`, `b`, and `c` are\npositive and the first displayed inequality holds, then the second displayed\ninequality holds. All divisions are divisions in `ℝ`.\n-/\ndef Target : Prop :=\n ∀ (a b c k : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n a / ((b ^ 2) * ((b + c) ^ 3)) +\n b / ((c ^ 2) * ((c + a) ^ 3)) +\n c / ((a ^ 2) * ((a + b) ^ 3)) ≤\n k / ((a * b + b * c + c * a) ^ 2) →\n a / (b + c) + b / (c + a) + c / (a + b) ≤ (4 * k) / 9\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b9cd9d50-bb04-5ba1-9d6a-9ecfd8f7be94", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "deef5b02e2d7b6e4e77773fc552324cc1a8bdda2f5e56c5a31055bfce435a353", "task_path": "tasks/nmp3_b9cd9d50-bb04-5ba1-9d6a-9ecfd8f7be94", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b9cd9d50-bb04-5ba1-9d6a-9ecfd8f7be94", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_b9d5e3cb-1d33-5b37-835e-f0e1e23882e0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The positive integers $a_0, a_1, a_2, \\dots, a_{3030}$ satisfy \n-- \\[\n-- 2a_{n+2}=a_{n+1}+4a_n\\qquad\\text{for }n=0,1,2,\\dots,3028.\n-- \\] \n-- Prove that at least one of the numbers $a_0, a_1, a_2, \\dots, a_{3030}$ is divisible by $2^{2020}$.\nimport Mathlib.Data.Nat.Basic\n\n/-!\n# Formalization of the positive-integer recurrence problem\n\nThe problem concerns a finite sequence `a₀, …, a₃₀₃₀` of positive natural numbers.\nThe recurrence is imposed for `n = 0, …, 3028`, and the conclusion is that one\nof the displayed entries is divisible by `2 ^ 2020`.\n-/\n\nnamespace Problem\n\n/-- The entries `a₀, …, a₃₀₃₀` are positive natural numbers. -/\ndef PositiveEntries (a : Fin 3031 → ℕ) : Prop :=\n ∀ i : Fin 3031, 0 < a i\n\n/-- The recurrence `2 a_{n+2} = a_{n+1} + 4 a_n` for `n = 0, …, 3028`.\n\nFor `n : Fin 3029`, the terms `n.succ.succ`, `n.succ.castSucc`, and\n`Fin.castAdd 2 n` are respectively the indices `n + 2`, `n + 1`, and `n`\nviewed in `Fin 3031`. -/\ndef SatisfiesRecurrence (a : Fin 3031 → ℕ) : Prop :=\n ∀ n : Fin 3029,\n 2 * a n.succ.succ =\n a n.succ.castSucc + 4 * a (Fin.castAdd 2 n)\n\n/-- The sequence satisfies both hypotheses of the problem. -/\ndef Admissible (a : Fin 3031 → ℕ) : Prop :=\n PositiveEntries a ∧ SatisfiesRecurrence a\n\n/-- At least one of `a₀, …, a₃₀₃₀` is divisible by `2 ^ 2020`. -/\ndef HasRequiredDivisibleEntry (a : Fin 3031 → ℕ) : Prop :=\n ∃ i : Fin 3031, (2 ^ 2020 : ℕ) ∣ a i\n\n/-- The assertion to be proved: every positive integer sequence of length `3031`\nsatisfying the stated recurrence has a term divisible by `2 ^ 2020`. -/\ndef Target : Prop :=\n ∀ a : Fin 3031 → ℕ, Admissible a → HasRequiredDivisibleEntry a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b9d5e3cb-1d33-5b37-835e-f0e1e23882e0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fe5c1ec0e778760f5ec97f91c90c576b0c7432b5ddb5e75ac11d0f2a95fc9b63", "task_path": "tasks/nmp3_b9d5e3cb-1d33-5b37-835e-f0e1e23882e0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "b9d5e3cb-1d33-5b37-835e-f0e1e23882e0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ba18c038-82c2-52ba-9076-ba7ada86315d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ satisfy $xy+yz+zx+xyz=4$. Prove that\n-- $$3\\left(\\frac1{\\sqrt{x}}+\\frac1{\\sqrt{y}}+\\frac1{\\sqrt{z}}\\right)^2\\ge (x+2)(y+2)(z+2).$$\nimport Mathlib\n\n/-!\n Statement formalization for:\n\n Let x, y, z > 0 satisfy xy + yz + zx + xyz = 4. Prove that\n 3 (1/√x + 1/√y + 1/√z)^2 ≥ (x + 2)(y + 2)(z + 2).\n\n This file only declares the proposition; it does not prove it.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The positivity and constraint assumptions imposed on the real variables. -/\ndef Hypothesis (x y z : ℝ) : Prop :=\n x > 0 ∧ y > 0 ∧ z > 0 ∧ x * y + y * z + z * x + x * y * z = 4\n\n/-- The inequality asserted under `Hypothesis`. -/\ndef Conclusion (x y z : ℝ) : Prop :=\n 3 * (1 / Real.sqrt x + 1 / Real.sqrt y + 1 / Real.sqrt z) ^ 2 ≥\n (x + 2) * (y + 2) * (z + 2)\n\n/-- The complete implication stated in the problem, for positive real `x`, `y`, `z`\nsatisfying `xy + yz + zx + xyz = 4`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Hypothesis x y z → Conclusion x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba18c038-82c2-52ba-9076-ba7ada86315d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ab0282216d93c0e8b650a6d2b89dc9ffa3aa52b445b2654a279c98d4651d07e5", "task_path": "tasks/nmp3_ba18c038-82c2-52ba-9076-ba7ada86315d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba18c038-82c2-52ba-9076-ba7ada86315d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ba1923c8-dbc5-53e1-824b-be7f9e382ae0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$, prove \n-- $$3\\sum_{\\text{cyc}}\\frac{(a^2+bc)(b+c)}{b^2+bc+c^2}\\ge 4\\sum_{\\text{cyc}}a,$$ \n-- where $\\sum_{\\text{cyc}}$ denotes the cyclic sum over $a,b,c$.\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the cyclic rational inequality\n\nThe source problem asks one to prove, for positive real numbers `a`, `b`, and `c`,\nthe inequality\n\n`3 * (sum_cyc ((a^2 + b*c) * (b+c) / (b^2 + b*c + c^2))) ≥ 4 * (a+b+c)`.\n\nThe declarations below merely state the proposition; no proof is supplied.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\nnoncomputable section\n\n/-- One summand of the cyclic sum: the summand displayed with current variables\n`(a,b,c)` is `(a^2 + bc)(b+c)/(b^2 + bc + c^2)`. -/\ndef cyclicTerm (a b c : ℝ) : ℝ :=\n ((a ^ 2 + b * c) * (b + c)) / (b ^ 2 + b * c + c ^ 2)\n\n/-- The cyclic sum of `cyclicTerm` over the ordered triple `(a,b,c)`. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- For all positive real numbers `a`, `b`, and `c`,\n`3 * sum_cyc ((a^2+bc)(b+c)/(b^2+bc+c^2)) ≥ 4 * sum_cyc a`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n (4 : ℝ) * (a + b + c) ≤ (3 : ℝ) * cyclicSum a b c\n\nend\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba1923c8-dbc5-53e1-824b-be7f9e382ae0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ed4858bc788d595a10bb435d254e9063a14a676ca6dd7ebcbd59b132af31d994", "task_path": "tasks/nmp3_ba1923c8-dbc5-53e1-824b-be7f9e382ae0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba1923c8-dbc5-53e1-824b-be7f9e382ae0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ba1f0a89-defe-58d0-ab35-dff6640d3ef6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $W\\in\\mathbb{R}[x]$ be a polynomial with real coefficients such that $W(x)>0$ for every $x\\in(a,b)$, where $a (n : ℤ))) = k ^ 4\n\n/-- The assertion of the problem: every finite set of 1985 positive natural\nnumbers, all of whose prime divisors are at most 23, contains a four-element\nsubset whose product is a fourth power. -/\ndef Target : Prop :=\n ∀ M : Finset ℕ,\n M.card = 1985 →\n (∀ n : ℕ, n ∈ M → 0 < n) →\n (∀ n : ℕ, n ∈ M → HasOnlySmallPrimeDivisors n) →\n ContainsFourthPowerFourSubset M\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba500ca1-6d70-543f-928e-b99712eb3d43", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4801be5eed5445f663e4f54e71f48c67b5070ab6f8d0cda8174a2f27e2fec599", "task_path": "tasks/nmp3_ba500ca1-6d70-543f-928e-b99712eb3d43", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba500ca1-6d70-543f-928e-b99712eb3d43", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ba61d235-af1f-54ce-85d4-283220d20aab", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c,d\\in\\mathbb R\\) satisfy \n-- \\[\n-- a\\ge b\\ge 1\\ge c\\ge d,\\qquad a+b+c+d=4 .\n-- \\] \n-- Prove that \n-- \\[\n-- (3a^{2}-2)(a-1)^{2}+(3b^{2}-2)(b-1)^{2}+(3c^{2}-2)(c-1)^{2}+(3d^{2}-2)(d-1)^{2}\\ge0 .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility conditions on the real numbers `a`, `b`, `c`, and `d`\nfrom the problem statement. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n a ≥ b ∧ b ≥ 1 ∧ (1 : ℝ) ≥ c ∧ c ≥ d ∧ a + b + c + d = 4\n\n/-- The left-hand side of the inequality asserted in the problem statement. -/\ndef LHS (a b c d : ℝ) : ℝ :=\n (3 * a ^ 2 - 2) * (a - 1) ^ 2 +\n (3 * b ^ 2 - 2) * (b - 1) ^ 2 +\n (3 * c ^ 2 - 2) * (c - 1) ^ 2 +\n (3 * d ^ 2 - 2) * (d - 1) ^ 2\n\n/-- The complete assertion of the problem: for every ordered quadruple of real\nnumbers satisfying the stated ordering and sum conditions, the displayed\nsum of four terms is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → LHS a b c d ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba61d235-af1f-54ce-85d4-283220d20aab", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "18b06bc81925456ca611baeefc9f90c8e45160750474bcad7ff21614518c057f", "task_path": "tasks/nmp3_ba61d235-af1f-54ce-85d4-283220d20aab", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba61d235-af1f-54ce-85d4-283220d20aab", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ba675e6c-34ce-590e-8144-2cee91ed8f9f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(x,y,z>0\\). Prove that\n-- \\[\n-- \\frac{(y+z-x)^2}{y^2+z^2}+\\frac{(z+x-y)^2}{z^2+x^2}+\\frac{(x+y-z)^2}{x^2+y^2}\\ge\\frac32.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the positive-variable cyclic inequality\n\nThe source problem asks to prove a lower bound for a sum of three rational\nexpressions involving positive real numbers. The statement is recorded as a\n`Prop`; no proof is supplied here.\n-/\n\nnamespace Problem\n\n/-- For all strictly positive real numbers `x`, `y`, and `z`, the sum of the\nthree displayed squared ratios is at least `3 / 2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z →\n (y + z - x) ^ 2 / (y ^ 2 + z ^ 2) +\n (z + x - y) ^ 2 / (z ^ 2 + x ^ 2) +\n (x + y - z) ^ 2 / (x ^ 2 + y ^ 2) ≥\n (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba675e6c-34ce-590e-8144-2cee91ed8f9f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b0663dbd9ce972d9db8a0be48f05f4d1bea402a0d6c85e56d5335f29a9df2ee7", "task_path": "tasks/nmp3_ba675e6c-34ce-590e-8144-2cee91ed8f9f", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba675e6c-34ce-590e-8144-2cee91ed8f9f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ba864c72-1085-5a86-89f7-e2ba084cac6b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb{R}$ satisfy \n-- \\[\n-- a^{4}+b^{4}+c^{4}=a+b+c .\n-- \\] \n-- Prove that \n-- \\[\n-- a^{3}+b^{3}+c^{3}\\le 2+abc .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for an inequality over the real numbers\n\nThis file records the statement of the problem but does not provide a proof.\n-/\n\nnamespace Problem\n\n/-- The hypothesis that real numbers `a`, `b`, and `c` satisfy\n`a^4 + b^4 + c^4 = a + b + c`. -/\ndef Hypothesis (a b c : ℝ) : Prop :=\n a ^ 4 + b ^ 4 + c ^ 4 = a + b + c\n\n/-- The asserted conclusion `a^3 + b^3 + c^3 ≤ 2 + abc`. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n a ^ 3 + b ^ 3 + c ^ 3 ≤ 2 + a * b * c\n\n/-- The full universal statement: for all real `a`, `b`, and `c`, if\n`a^4 + b^4 + c^4 = a + b + c`, then `a^3 + b^3 + c^3 ≤ 2 + abc`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Hypothesis a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba864c72-1085-5a86-89f7-e2ba084cac6b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8fdac1344414595d0ffeb3a304a15f7f8a49be0a1c463536184b2a9be9298d71", "task_path": "tasks/nmp3_ba864c72-1085-5a86-89f7-e2ba084cac6b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba864c72-1085-5a86-89f7-e2ba084cac6b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ba878c13-ba87-5348-b57b-72865306f0e9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c>0$ prove that \n-- \\[\n-- \\frac{a^3+abc}{(2a+b+c)^2}+\\frac{b^3+abc}{(2b+c+a)^2}+\\frac{c^3+abc}{(2c+a+b)^2}\\ge \\frac{9abc}{8(ab+bc+ca)}\\,.\n-- \\]\n/-\nFormalization of the inequality stated in `problem.md`.\n\nThe source asks to prove, for positive real numbers `a`, `b`, and `c`, that\n (a^3 + abc)/(2a + b + c)^2\n + (b^3 + abc)/(2b + c + a)^2\n + (c^3 + abc)/(2c + a + b)^2\n ≥ 9abc/(8(ab + bc + ca)).\n-/\n\nimport Mathlib\n\nnamespace Problem\n\n/-- The first summand on the left-hand side of the stated inequality. -/\nnoncomputable def firstTerm (a b c : ℝ) : ℝ :=\n (a ^ 3 + a * b * c) / (2 * a + b + c) ^ 2\n\n/-- The second summand on the left-hand side of the stated inequality. -/\nnoncomputable def secondTerm (a b c : ℝ) : ℝ :=\n (b ^ 3 + a * b * c) / (2 * b + c + a) ^ 2\n\n/-- The third summand on the left-hand side of the stated inequality. -/\nnoncomputable def thirdTerm (a b c : ℝ) : ℝ :=\n (c ^ 3 + a * b * c) / (2 * c + a + b) ^ 2\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n firstTerm a b c + secondTerm a b c + thirdTerm a b c\n\n/-- The right-hand side of the inequality in the problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (9 * a * b * c) / (8 * (a * b + b * c + c * a))\n\n/--\nThe complete assertion: for all positive real numbers `a`, `b`, and `c`,\nthe stated left-hand side is at least the stated right-hand side.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba878c13-ba87-5348-b57b-72865306f0e9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9f7dd4b1c6b8d0a1c5c2fc40f78d3f4780d84bf32be23f42794bd324b88691f1", "task_path": "tasks/nmp3_ba878c13-ba87-5348-b57b-72865306f0e9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba878c13-ba87-5348-b57b-72865306f0e9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ba8a8fd1-ea96-5842-a686-0b0fb1733927", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be positive real numbers such that $abcd=1$. Prove that \n-- \\[\n-- \\frac{1+ab}{1+a}+\\frac{1+bc}{1+b}+\\frac{1+cd}{1+c}+\\frac{1+da}{1+d}\\ge 4.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility condition on the four real parameters: they are all\npositive and their product is one. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧ a * b * c * d = 1\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c d : ℝ) : ℝ :=\n (1 + a * b) / (1 + a) +\n (1 + b * c) / (1 + b) +\n (1 + c * d) / (1 + c) +\n (1 + d * a) / (1 + d)\n\n/-- The universal statement of the problem: for every quadruple of positive\nreal numbers whose product is one, the displayed sum is at least four. -/\nnoncomputable def Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → lhs a b c d ≥ 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba8a8fd1-ea96-5842-a686-0b0fb1733927", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "82755210b5dfdf27ae17afecc9b3d32fbbafb6dd212557d3e953263efbe0e222", "task_path": "tasks/nmp3_ba8a8fd1-ea96-5842-a686-0b0fb1733927", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba8a8fd1-ea96-5842-a686-0b0fb1733927", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ba8b593f-8a1b-5085-a7bb-96701d86740b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that the set of ratios \n-- \\[\n-- \\left\\{\\frac{\\varphi(n+1)}{\\varphi(n)}\\;:\\;n\\in\\mathbb{N}\\right\\}\n-- \\]\n-- where $\\varphi$ is Euler’s totient function, is dense in the positive real numbers $(0,\\infty)$.\nimport Mathlib.Data.Nat.Totient\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Density of consecutive Euler-totient ratios\n\nThis file states the problem as a proposition. It contains no proof of that\nproposition.\n-/\n\nnamespace Problem\n\n/-- The ratio `φ(n + 1) / φ(n)`, regarded as a real number.\n\nOnly positive `n` are intended as arguments; in the set below the denominator\nis therefore nonzero. The casts occur before the division so that this is the\nordinary division of real numbers, not natural-number division. -/\nnoncomputable def totientRatio (n : ℕ) : ℝ :=\n (Nat.totient (n + 1) : ℝ) / (Nat.totient n : ℝ)\n\n/-- The set `{φ(n + 1) / φ(n) : n ∈ ℕ}`, with the usual convention that the\nnatural numbers in the index are positive. -/\nnoncomputable def ratioSet : Set ℝ :=\n {x : ℝ | ∃ n : ℕ, 0 < n ∧ x = totientRatio n}\n\n/-- A subset `S` of `ℝ` is dense in the positive reals when every nonempty open\ninterval contained in `(0, ∞)` contains a point of `S`. -/\ndef DenseInPositiveReals (S : Set ℝ) : Prop :=\n ∀ a b : ℝ, 0 < a → a < b →\n ∃ x : ℝ, x ∈ S ∧ a < x ∧ x < b\n\n/-- The statement of the problem: the set of consecutive totient ratios is\ndense in the positive real numbers. -/\ndef Target : Prop :=\n DenseInPositiveReals ratioSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba8b593f-8a1b-5085-a7bb-96701d86740b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "416116b6eb3035ad8c8c771c2b5ce653039e1b1dc4fbe6122bb8a959d10db5bd", "task_path": "tasks/nmp3_ba8b593f-8a1b-5085-a7bb-96701d86740b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba8b593f-8a1b-5085-a7bb-96701d86740b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ba99f1b1-d705-56e5-8e4f-d00af8ca54de", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $\\displaystyle\\frac1a+\\frac1b+\\frac1c=3$. Prove that \n-- \\[\n-- \\frac{a}{b^{2}+c^{2}}+\\frac{b}{c^{2}+a^{2}}+\\frac{c}{a^{2}+b^{2}}\n-- \\;\\ge\\;\n-- \\frac32\\left(\\frac{a+b+c}{ab+bc+ca}\\right)^{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe problem asks to prove, for positive real numbers `a`, `b`, and `c`\nsatisfying `1/a + 1/b + 1/c = 3`, the inequality\n`a/(b^2+c^2) + b/(c^2+a^2) + c/(a^2+b^2) ≥\n (3/2) * ((a+b+c)/(ab+bc+ca))^2`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a / (b ^ 2 + c ^ 2) + b / (c ^ 2 + a ^ 2) + c / (a ^ 2 + b ^ 2)\n\n/-- The right-hand side of the target inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (3 / 2 : ℝ) * (((a + b + c) / (a * b + b * c + c * a)) ^ 2)\n\n/-- The reciprocal-sum constraint in the problem. -/\ndef reciprocalConstraint (a b c : ℝ) : Prop :=\n 1 / a + 1 / b + 1 / c = (3 : ℝ)\n\n/-- The proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n reciprocalConstraint a b c →\n lhs a b c ≥ rhs a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba99f1b1-d705-56e5-8e4f-d00af8ca54de", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0c6bb62bbc972d28ee0b79c8a4a7236af92bcce7f53fb731787dd0bae7914928", "task_path": "tasks/nmp3_ba99f1b1-d705-56e5-8e4f-d00af8ca54de", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ba99f1b1-d705-56e5-8e4f-d00af8ca54de", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bac1b193-86b8-537f-8a7d-6014d7d93641", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a prime $p$ such that $3\\nmid(p-1)$, determine all positive integers $x$, $y$, $z$ satisfying \n-- \\[\n-- x^{3}\\bigl(y^{3}+z^{3}\\bigr)=p\\,(xyz+1)\\,. \n-- \\]\nimport Mathlib.Data.Nat.Prime.Basic\n\n/-!\n# Formal statement of the Diophantine classification problem\n\nFor a prime `p` with `3 ∤ (p - 1)`, classify all positive integers `x`, `y`, `z`\nsatisfying\n`x^3 * (y^3 + z^3) = p * (x * y * z + 1)`.\n\nThe file separates the displayed equation, the full admissibility predicate,\nthe proposed answer relation, and the two-direction correctness predicate for\nan answer. `Problem.Target` is the asserted classification; no proof of it is\nprovided here.\n-/\n\nnamespace Problem\n\n/-- The displayed equation, at a fixed natural number `p`. -/\ndef Equation (p x y z : ℕ) : Prop :=\n x ^ 3 * (y ^ 3 + z ^ 3) = p * (x * y * z + 1)\n\n/-- The positivity condition on the three variables being classified. -/\ndef PositiveTriple (x y z : ℕ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z\n\n/-- The equation together with positivity, for a fixed parameter `p`. -/\ndef Solution (p x y z : ℕ) : Prop :=\n PositiveTriple x y z ∧ Equation p x y z\n\n/--\nThe full admissibility predicate from the problem: `p` is prime,\n`3 ∤ (p - 1)`, and `x`, `y`, `z` are positive solutions of the equation.\n-/\ndef Admissible (p x y z : ℕ) : Prop :=\n Nat.Prime p ∧ ¬ (3 ∣ (p - 1)) ∧ Solution p x y z\n\n/--\nThe proposed complete answer for a fixed parameter `p`: `x = 1`, and `y`, `z`\nare the two orderings of a consecutive positive pair whose sum is `p`.\n\nThe explicit positivity conjuncts ensure that this relation only lists positive\ntriples. For `p = 2`, the consecutive-pair conditions have no natural-number\nsolution, matching the fact that the even prime contributes no admissible\ntriples.\n-/\ndef Answer (p x y z : ℕ) : Prop :=\n PositiveTriple x y z ∧\n x = 1 ∧\n ((y + z = p ∧ y + 1 = z) ∨\n (y + z = p ∧ z + 1 = y))\n\n/--\n`AnswerCorrect A` is the two-direction statement that an answer relation `A`\nis exactly the admissible-tuple relation, under the original prime hypothesis\non `p`. The forward direction says every tuple listed by `A` is admissible;\nthe reverse direction says every admissible tuple is listed by `A`.\n-/\ndef AnswerCorrect (A : ℕ → ℕ → ℕ → ℕ → Prop) : Prop :=\n ∀ p : ℕ, Nat.Prime p → ¬ (3 ∣ (p - 1)) →\n ∀ x y z : ℕ, A p x y z ↔ Admissible p x y z\n\n/-- The target proposition: `Answer` is a complete and sound classification. -/\ndef Target : Prop :=\n AnswerCorrect Answer\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bac1b193-86b8-537f-8a7d-6014d7d93641", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7b1deda1b380380ae189cd312cb6889e2b5d0e71f8fb93875c391a316d941356", "task_path": "tasks/nmp3_bac1b193-86b8-537f-8a7d-6014d7d93641", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bac1b193-86b8-537f-8a7d-6014d7d93641", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bafbe818-e1f0-569b-9b08-ed25a590f496", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let lines $BC$ and $EF$ be parallel. Let $D$ be a point on segment $BC$ distinct from $B$ and $C$. Let $I$ be the intersection of lines $BF$ and $CE$. Denote by $K$ the circumcircle of $\\triangle CDE$ and by $L$ the circumcircle of $\\triangle BDF$. The circles $K$ and $L$ are tangent to the line $EF$ at $E$ and $F$, respectively. Let $A\\neq D$ be the second intersection of $K$ and $L$. Let $Q\\neq D$ be the second intersection of line $DF$ with $K$, and let $R\\neq D$ be the second intersection of line $DE$ with $L$. Define $M$ as the intersection of lines $EQ$ and $FR$. Prove that the points $I$, $A$, and $M$ are collinear.\nimport Mathlib.Analysis.Convex.Between\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Sphere.Tangent\n\n/-!\n# Formal statement of the three-collinearity geometry problem\n\nThis file fixes the ambient object to the real Euclidean plane and records the\nconstruction and conclusion of the problem. It deliberately contains no proof\nof the target proposition.\n-/\n\nnoncomputable section\n\nopen scoped Affine RealInnerProductSpace\nopen EuclideanGeometry\n\nnamespace Problem\n\n/-- The ambient Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The affine line through two points. -/\nabbrev LineThrough (x y : Plane) : AffineSubspace ℝ Plane :=\n affineSpan ℝ ({x, y} : Set Plane)\n\n/--\n`LinesParallel x₁ x₂ y₁ y₂` says that the two genuine affine lines through\n`x₁,x₂` and through `y₁,y₂` are parallel.\n-/\ndef LinesParallel (x₁ x₂ y₁ y₂ : Plane) : Prop :=\n x₁ ≠ x₂ ∧ y₁ ≠ y₂ ∧ (LineThrough x₁ x₂ ∥ LineThrough y₁ y₂)\n\n/--\n`IsLineIntersection p x₁ x₂ y₁ y₂` says that the two genuine affine lines\nthrough `x₁,x₂` and through `y₁,y₂` have `p` as their unique intersection.\n-/\ndef IsLineIntersection (p x₁ x₂ y₁ y₂ : Plane) : Prop :=\n x₁ ≠ x₂ ∧ y₁ ≠ y₂ ∧\n p ∈ LineThrough x₁ x₂ ∧ p ∈ LineThrough y₁ y₂ ∧\n ∀ z : Plane, z ∈ LineThrough x₁ x₂ → z ∈ LineThrough y₁ y₂ → z = p\n\n/--\n`IsCircumcircle S x y z` says that `x,y,z` form a noncollinear triangle and\nthat `S` is the unique circle (sphere in the ambient plane) passing through\nits three vertices.\n-/\ndef IsCircumcircle (S : Sphere Plane) (x y z : Plane) : Prop :=\n ¬ Collinear ℝ ({x, y, z} : Set Plane) ∧\n x ∈ S ∧ y ∈ S ∧ z ∈ S ∧\n ∀ T : Sphere Plane, x ∈ T → y ∈ T → z ∈ T → T = S\n\n/--\n`IsSecondIntersectionCircles S T p x` records that `p` and `x` are exactly the\ntwo intersection points of the circles `S` and `T`, with `x` the second one.\n-/\ndef IsSecondIntersectionCircles (S T : Sphere Plane) (p x : Plane) : Prop :=\n p ∈ S ∧ p ∈ T ∧ x ∈ S ∧ x ∈ T ∧ x ≠ p ∧\n ∀ y : Plane, y ∈ S → y ∈ T → y = p ∨ y = x\n\n/--\n`IsSecondIntersectionLineCircle S d f q` records that the circle `S` and the\nline through `d` and `f` meet exactly in `d` and `q`, with `q` the second\nintersection point.\n-/\ndef IsSecondIntersectionLineCircle (S : Sphere Plane) (d f q : Plane) : Prop :=\n d ≠ f ∧ d ∈ S ∧ q ∈ S ∧ q ∈ LineThrough d f ∧ q ≠ d ∧\n ∀ z : Plane, z ∈ S → z ∈ LineThrough d f → z = d ∨ z = q\n\n/--\nThe complete configuration asserted in the problem before the final\ncollinearity conclusion. The point `I` is the unique intersection of `BF` and\n`CE`; `K` and `L` are the unique circumcircles of `CDE` and `BDF`\nrespectively, tangent to `EF` at `E` and `F`; then `A`, `Q`, `R`, and `M` are\nthe specified second intersections and intersection.\n-/\ndef Configuration\n (B C D E F I A Q R M : Plane) (K L : Sphere Plane) : Prop :=\n LinesParallel B C E F ∧\n Sbtw ℝ B D C ∧\n IsLineIntersection I B F C E ∧\n IsCircumcircle K C D E ∧\n IsCircumcircle L B D F ∧\n K.IsTangentAt E (LineThrough E F) ∧\n L.IsTangentAt F (LineThrough E F) ∧\n IsSecondIntersectionCircles K L D A ∧\n IsSecondIntersectionLineCircle K D F Q ∧\n IsSecondIntersectionLineCircle L D E R ∧\n IsLineIntersection M E Q F R\n\n/--\nThe target assertion: for every configuration in the real Euclidean plane as\ndescribed in the problem, the points `I`, `A`, and `M` are collinear.\n-/\ndef Target : Prop :=\n ∀ (B C D E F I : Plane) (K L : Sphere Plane) (A Q R M : Plane),\n Configuration B C D E F I A Q R M K L →\n Collinear ℝ ({I, A, M} : Set Plane)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bafbe818-e1f0-569b-9b08-ed25a590f496", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "80df29be7cec7394117b5f48cb1b80b5d168a95eb04373c55db3e5f9f12e31cc", "task_path": "tasks/nmp3_bafbe818-e1f0-569b-9b08-ed25a590f496", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bafbe818-e1f0-569b-9b08-ed25a590f496", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bb282d80-781a-577c-9999-3c890923de70", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(A\\) be a set of positive integers containing at least two elements. Suppose that for any two distinct elements \\(a,b\\in A\\) with \\(a>b\\) the integer \n-- \\[\n-- \\frac{[a,b]}{a-b}\n-- \\]\n-- also belongs to \\(A\\), where \\([a,b]\\) denotes the least common multiple of \\(a\\) and \\(b\\). Prove that \\(A\\) contains exactly two elements.\nimport Mathlib.Data.Nat.GCD.Basic\nimport Mathlib.Data.Rat.Defs\nimport Mathlib.Data.Set.Basic\n\n/-!\n# Formal statement of the positive-integer lcm-quotient problem\n\nThe problem asks for a proof that any set `A` of positive integers with at least\ntwo elements and closed under `(a, b) ↦ lcm(a, b) / (a - b)` (for distinct\n`a, b ∈ A` with `a > b`) has exactly two elements.\n\nThe quotient is represented exactly in `ℚ`: for every admissible pair, there is\na natural number `c ∈ A` whose rational cast is equal to\n`lcm(a, b) / (a - b)`. This makes explicit that no natural-number floor division\nis being used when the quotient is not integral.\n-/\n\nnamespace Problem\n\n/-- `A` is a set of positive integers: every natural number in `A` is nonzero. -/\ndef PositiveIntegerSet (A : Set ℕ) : Prop :=\n ∀ n : ℕ, n ∈ A → 0 < n\n\n/-- `A` contains at least two distinct elements. -/\ndef ContainsAtLeastTwo (A : Set ℕ) : Prop :=\n ∃ a : ℕ, ∃ b : ℕ, a ∈ A ∧ b ∈ A ∧ a ≠ b\n\n/-- `A` has exactly two elements, expressed by exhibiting them and showing that\nevery element of `A` is one of the two. -/\ndef ContainsExactlyTwo (A : Set ℕ) : Prop :=\n ∃ a : ℕ, ∃ b : ℕ,\n a ∈ A ∧ b ∈ A ∧ a ≠ b ∧\n ∀ x : ℕ, x ∈ A → x = a ∨ x = b\n\n/-- For naturals `a` and `b`, the exact quotient `lcm(a, b) / (a - b)` is a\nnatural number belonging to `A`. The equality is stated in `ℚ`, so this predicate\nincludes the requirement that the quotient be integral. It is only used under\nthe hypothesis `b < a`, which guarantees that the denominator is nonzero. -/\ndef LcmQuotientIn (A : Set ℕ) (a b : ℕ) : Prop :=\n ∃ c : ℕ, c ∈ A ∧\n (c : ℚ) = (Nat.lcm a b : ℚ) / ((a - b : ℕ) : ℚ)\n\n/-- The closure condition: for any two distinct elements `a, b ∈ A` with\n`a > b`, the integer quotient `lcm(a, b) / (a - b)` belongs to `A`. -/\ndef LcmQuotientClosed (A : Set ℕ) : Prop :=\n ∀ a b : ℕ, a ∈ A → b ∈ A → a ≠ b → b < a →\n LcmQuotientIn A a b\n\n/-- The hypotheses of the problem for a set `A`. -/\ndef Admissible (A : Set ℕ) : Prop :=\n PositiveIntegerSet A ∧ ContainsAtLeastTwo A ∧ LcmQuotientClosed A\n\n/-- The assertion to be proved: every admissible set `A` of positive integers\ncontains exactly two elements. -/\ndef Target : Prop :=\n ∀ A : Set ℕ, Admissible A → ContainsExactlyTwo A\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bb282d80-781a-577c-9999-3c890923de70", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d9aeb1e672b128839e0cd2dada326ac5a2ab51fc54534aef35bdb46be7d373c8", "task_path": "tasks/nmp3_bb282d80-781a-577c-9999-3c890923de70", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bb282d80-781a-577c-9999-3c890923de70", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bb2a12fe-44f7-5062-8cd7-0dcbd43acf4f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A,B\\in\\mathbb Z^{\\,n\\times n}$ be two integer matrices with non‑negative entries such that \n-- \\[\n-- AB=J-I,\n-- \\]\n-- where $J$ denotes the $n\\times n$ matrix whose every entry is $1$ (so $J-I$ has $1$’s off the diagonal and $0$’s on the diagonal). Prove that $AB=BA$ (in fact $BA=J-I$).\nimport Mathlib\n\n/-!\n# Formal statement: non-negative integer matrix equation `AB = J - I`\n\nThe source problem asks to prove that if `A` and `B` are non-negative integer\n`n × n` matrices with `A * B = J - I`, where `J` is the all-ones matrix and `I`\nis the identity matrix, then `A * B = B * A`; in fact, `B * A = J - I`.\n-/\n\nnamespace Problem\n\n/-- The all-ones integer `n × n` matrix, denoted `J` in the source problem. -/\ndef allOnes (n : ℕ) : Matrix (Fin n) (Fin n) ℤ :=\n fun _ _ => 1\n\n/-- All entries of an integer matrix are non-negative. -/\ndef NonnegativeEntries {n : ℕ} (M : Matrix (Fin n) (Fin n) ℤ) : Prop :=\n ∀ i j : Fin n, 0 ≤ M i j\n\n/-- The full assertion of the source problem.\n\nFor every natural number `n` and every pair of integer `n × n` matrices `A`, `B`\nwhose entries are all non-negative and which satisfy `A * B = J - I`, the\nmatrices commute, and moreover `B * A = J - I`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (A B : Matrix (Fin n) (Fin n) ℤ),\n NonnegativeEntries A →\n NonnegativeEntries B →\n A * B = allOnes n - (1 : Matrix (Fin n) (Fin n) ℤ) →\n A * B = B * A ∧\n B * A = allOnes n - (1 : Matrix (Fin n) (Fin n) ℤ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bb2a12fe-44f7-5062-8cd7-0dcbd43acf4f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0b16b18f982d825940527ffd042f97f8bd3702eacc62b236a8e09912beee258d", "task_path": "tasks/nmp3_bb2a12fe-44f7-5062-8cd7-0dcbd43acf4f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bb2a12fe-44f7-5062-8cd7-0dcbd43acf4f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bb2b1d06-4b2d-599c-84b8-6c9e65461c0a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If \\(a,b,c\\ge0\\) and \\(16(ab+bc+ca)+33abc=81\\), prove that \\(\\sqrt a+\\sqrt b+\\sqrt c\\ge3\\).\nimport Mathlib\n\n/-!\n# Formal statement for the nonnegative-variable inequality\n\nThe source problem asks to prove that from the nonnegativity of `a`, `b`, and\n`c` together with the constraint\n`16 * (a * b + b * c + c * a) + 33 * a * b * c = 81`,\nit follows that `Real.sqrt a + Real.sqrt b + Real.sqrt c ≥ 3`.\n\nThe statements below formalize the original assertion and its logical\ncomponents. No proof of the assertion is supplied.\n-/\n\nnamespace Problem\n\n/-- The nonnegativity hypotheses appearing in the source problem. -/\ndef NonnegativeTriple (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The algebraic constraint appearing in the source problem. -/\ndef Constraint (a b c : ℝ) : Prop :=\n 16 * (a * b + b * c + c * a) + 33 * a * b * c = 81\n\n/-- The desired lower bound on the sum of the principal real square roots. -/\ndef SqrtSumLowerBound (a b c : ℝ) : Prop :=\n 3 ≤ Real.sqrt a + Real.sqrt b + Real.sqrt c\n\n/-- The assertion to be proved: for all real nonnegative `a`, `b`, and `c`,\nif `16(ab + bc + ca) + 33abc = 81`, then\n`sqrt a + sqrt b + sqrt c ≥ 3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n NonnegativeTriple a b c →\n Constraint a b c →\n SqrtSumLowerBound a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bb2b1d06-4b2d-599c-84b8-6c9e65461c0a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7a84c6a8b6c7780d1b3eac655fe3dbcbfb03dd593abca4efaeb2d55eecb571d4", "task_path": "tasks/nmp3_bb2b1d06-4b2d-599c-84b8-6c9e65461c0a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bb2b1d06-4b2d-599c-84b8-6c9e65461c0a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bb8c1ad7-a4de-548d-b6bc-a35fe8dfe33e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $a^2+b^2+c^2+abc=4$. Prove that \n-- \\[\n-- 2\\bigl(a^2b^2+b^2c^2+c^2a^2\\bigr)+abc\\bigl(a^2b+b^2c+c^2a\\bigr)\\le8+a^2b^2c^2\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nSource problem: for nonnegative real numbers `a`, `b`, and `c` satisfying\n`a^2 + b^2 + c^2 + a*b*c = 4`, prove the stated polynomial inequality.\n\nThis file records the proposition only; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The source assumption that all three variables are nonnegative. -/\ndef Nonnegative (a : ℝ) (b : ℝ) (c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The source constraint `a^2 + b^2 + c^2 + abc = 4`. -/\ndef Constraint (a : ℝ) (b : ℝ) (c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 + a * b * c = 4\n\n/-- The asserted inequality, with the left-hand side and right-hand side\nspelled out in the same order as in the source. -/\ndef Claim (a : ℝ) (b : ℝ) (c : ℝ) : Prop :=\n 2 * (a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2)\n + a * b * c * (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a)\n ≤ 8 + a ^ 2 * b ^ 2 * c ^ 2\n\n/-- The complete universally quantified statement of the problem. -/\ndef Target : Prop :=\n ∀ (a : ℝ) (b : ℝ) (c : ℝ),\n Nonnegative a b c → Constraint a b c → Claim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bb8c1ad7-a4de-548d-b6bc-a35fe8dfe33e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "80d420df8845426ee0cb087f264566a2aa4c83572991b8b643d48d83ab1851d7", "task_path": "tasks/nmp3_bb8c1ad7-a4de-548d-b6bc-a35fe8dfe33e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bb8c1ad7-a4de-548d-b6bc-a35fe8dfe33e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bb93d233-a880-510c-bc70-8c05eab563ba", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- a^3+b^3+c^3+3\\ge 2\\,(a^2+b^2+c^2).\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c` satisfying\n`a * b * c = 1`, to prove the inequality\n`a^3 + b^3 + c^3 + 3 ≥ 2 * (a^2 + b^2 + c^2)`.\n\nThis file records the assertion as a proposition-valued definition; it does\nnot assert or prove that proposition. -/\n\nnamespace Problem\n\n/-- The proposition stating the inequality from the problem, universally\nquantified over positive real numbers whose product is one. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n a ^ 3 + b ^ 3 + c ^ 3 + 3 ≥ 2 * (a ^ 2 + b ^ 2 + c ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bb93d233-a880-510c-bc70-8c05eab563ba", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3063c00ab5e92225e070d3cd8436e5f18a973e7ae7c69c041bd9e1f1f23ad7f5", "task_path": "tasks/nmp3_bb93d233-a880-510c-bc70-8c05eab563ba", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bb93d233-a880-510c-bc70-8c05eab563ba", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bbbb616f-e918-5a44-8f0d-6dcb4dabb407", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be non‑negative real numbers with $ab+bc+ca>0$. Prove that \n-- \\[\n-- \\frac{a^{2}+bc}{\\,b^{2}+c^{2}\\,}+\\frac{b^{2}+ca}{\\,c^{2}+a^{2}\\,}+\\frac{c^{2}+ab}{\\,a^{2}+b^{2}\\,}\\ge \\frac52\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: cyclic inequality for non-negative reals\n\nThis file records the statement of the problem, not a proof of it.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real numbers: each is\nnon-negative, and `ab + bc + ca` is strictly positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a * b + b * c + c * a\n\n/-- The left-hand side appearing in the inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (a ^ 2 + b * c) / (b ^ 2 + c ^ 2)\n + (b ^ 2 + c * a) / (c ^ 2 + a ^ 2)\n + (c ^ 2 + a * b) / (a ^ 2 + b ^ 2)\n\n/-- The assertion to be proved: for every triple of non-negative reals with\n`ab + bc + ca > 0`, the indicated cyclic sum is at least `5 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ (5 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bbbb616f-e918-5a44-8f0d-6dcb4dabb407", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6517537d7797841360994d45ab2b293984fe15b0815ce83da48f9d6fe4b34386", "task_path": "tasks/nmp3_bbbb616f-e918-5a44-8f0d-6dcb4dabb407", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bbbb616f-e918-5a44-8f0d-6dcb4dabb407", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bbc03e62-ddc7-50f8-a144-5c86aa446299", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any triangle $ABC$ (i.e. $A,B,C>0$ and $A+B+C=\\pi$) the following inequality holds \n-- \\[\n-- \\sin^2A+\\sin^2B+\\sin^2C\\;\\ge\\;\\sin A\\sin2A+\\sin B\\sin2B+\\sin C\\sin2C\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a trigonometric triangle inequality\n\nThe problem asks to prove, for all positive real angles `A`, `B`, `C` whose sum\nis `π`, that the sum of the squares of the sines is at least the sum of\n`sin A * sin (2A)`, `sin B * sin (2B)`, and `sin C * sin (2C)`.\n-/\n\nnamespace Problem\n\n/-- The positivity condition on the three triangle angles. -/\ndef PositiveAngles (A B C : ℝ) : Prop :=\n 0 < A ∧ 0 < B ∧ 0 < C\n\n/-- The triangle angle-sum condition. -/\ndef AngleSum (A B C : ℝ) : Prop :=\n A + B + C = Real.pi\n\n/-- The angle conditions imposed by the problem: `A`, `B`, and `C` are\npositive real angles and their sum is `π`. -/\ndef TriangleAngles (A B C : ℝ) : Prop :=\n PositiveAngles A B C ∧ AngleSum A B C\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def leftHandSide (A B C : ℝ) : ℝ :=\n (Real.sin A) ^ 2 + (Real.sin B) ^ 2 + (Real.sin C) ^ 2\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def rightHandSide (A B C : ℝ) : ℝ :=\n Real.sin A * Real.sin (2 * A) +\n Real.sin B * Real.sin (2 * B) +\n Real.sin C * Real.sin (2 * C)\n\n/-- The complete assertion: for every real `A`, `B`, `C`, if the three angles\nare positive and sum to `π`, then the stated inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ A B C : ℝ, TriangleAngles A B C → leftHandSide A B C ≥ rightHandSide A B C\n\nend Problem\n\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bbc03e62-ddc7-50f8-a144-5c86aa446299", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0f4591c67763f9d23c2823ef6d01c2b976e188bfa575583acd65f5824260f4ff", "task_path": "tasks/nmp3_bbc03e62-ddc7-50f8-a144-5c86aa446299", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bbc03e62-ddc7-50f8-a144-5c86aa446299", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bbe1f676-68b0-5916-91ea-d3fd145dc687", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose that $m=nq$, where $n$ and $q$ are positive integers. Prove that \n-- \\[\n-- \\sum_{k=0}^{n-1}\\binom{\\gcd(n,k)\\,q}{\\gcd(n,k)}\n-- \\]\n-- is divisible by $m$.\nimport Mathlib\n\n/-!\n# Formal statement of the divisibility problem\n\nThe source problem states that if `m = n * q` with `m`, `n`, and `q` natural\nnumbers and `n`, `q` positive, then the sum with summand\n\n`choose (gcd n k * q) (gcd n k)`\n\nfor `k = 0, ..., n - 1` is divisible by `m`.\n-/\n\nnamespace Problem\n\n/-- The `k`-th summand in the displayed sum. -/\ndef summand (n q k : ℕ) : ℕ :=\n Nat.choose (Nat.gcd n k * q) (Nat.gcd n k)\n\n/-- The finite sum occurring in the statement of the problem. -/\ndef sum (n q : ℕ) : ℕ :=\n (Finset.range n).sum (fun k => summand n q k)\n\n/-- The assertion to be proved: for positive integers `n` and `q`, if `m = n * q`,\nthen `m` divides the displayed sum. -/\ndef Target : Prop :=\n ∀ (m n q : ℕ), 0 < n → 0 < q → m = n * q → m ∣ sum n q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bbe1f676-68b0-5916-91ea-d3fd145dc687", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a23b3b361d27771fddfae30c2bb8155db37c231b463708b133d3ea45347a6e30", "task_path": "tasks/nmp3_bbe1f676-68b0-5916-91ea-d3fd145dc687", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bbe1f676-68b0-5916-91ea-d3fd145dc687", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bc215b64-1ded-57e1-894b-2a9dc7de81f5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be real numbers. Prove that \n-- \\[\n-- x(x+y)^{3}+y(y+z)^{3}+z(z+x)^{3}\\ge \\frac{8}{27}(x+y+z)^{4}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef LHS (x y z : ℝ) : ℝ :=\n x * (x + y) ^ 3 + y * (y + z) ^ 3 + z * (z + x) ^ 3\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def RHS (x y z : ℝ) : ℝ :=\n (8 / 27 : ℝ) * (x + y + z) ^ 4\n\n/-- The universally quantified assertion stated in the source problem. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, LHS x y z ≥ RHS x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bc215b64-1ded-57e1-894b-2a9dc7de81f5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4dbf321610382281524d23041bf29ba872e5f050b95f6e4f28c50be8335cb4c1", "task_path": "tasks/nmp3_bc215b64-1ded-57e1-894b-2a9dc7de81f5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bc215b64-1ded-57e1-894b-2a9dc7de81f5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bc21a094-be33-5658-8a1b-e871db9d14cc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m$ and $n$ be non‑zero integers of the same parity. Suppose that $m^{2}-n^{2}+1$ divides $n^{2}-1$. Prove that $m^{2}-n^{2}+1$ is a perfect square.\nimport Mathlib.Data.Int.Basic\nimport Mathlib.Algebra.Ring.Parity\n\n/-!\n# Formalization of the integer same-parity divisibility problem\n\nThe source problem asks to prove that, for nonzero integers `m` and `n` of the\nsame parity, if `m ^ 2 - n ^ 2 + 1` divides `n ^ 2 - 1`, then\n`m ^ 2 - n ^ 2 + 1` is a perfect square.\n-/\n\nnamespace Problem\n\n/-- Two integers have the same parity when their difference is even. -/\ndef SameParity (m n : ℤ) : Prop :=\n ∃ k : ℤ, m - n = 2 * k\n\n/-- An integer is a perfect square when it is the square of an integer. -/\ndef PerfectSquare (z : ℤ) : Prop :=\n ∃ q : ℤ, z = q ^ 2\n\n/-- The expression `m ^ 2 - n ^ 2 + 1` occurring as the divisor. -/\ndef DivisorExpression (m n : ℤ) : ℤ :=\n m ^ 2 - n ^ 2 + 1\n\n/-- The hypotheses of the problem, packaged as an admissibility predicate. -/\ndef Hypothesis (m n : ℤ) : Prop :=\n m ≠ 0 ∧ n ≠ 0 ∧ SameParity m n ∧ DivisorExpression m n ∣ n ^ 2 - 1\n\n/-- The assertion to be proved: the stated hypotheses imply that the divisor is\na perfect square. -/\ndef Target : Prop :=\n ∀ (m n : ℤ), Hypothesis m n → PerfectSquare (DivisorExpression m n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bc21a094-be33-5658-8a1b-e871db9d14cc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "13839a61cb4df991fd4dfc6945c3a910ab15e21311bb4c79df150a72782aaba7", "task_path": "tasks/nmp3_bc21a094-be33-5658-8a1b-e871db9d14cc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bc21a094-be33-5658-8a1b-e871db9d14cc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bc2d5827-dd63-572c-afb7-875215eb61d2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb R\\to\\mathbb R$ be continuous. We say that $f$ **crosses the $x$‑axis at** $a\\in\\mathbb R$ if $f(a)=0$ and for every neighbourhood $U$ of $a$ there exist points $b,c\\in U$ with $f(b)<0$ and $f(c)>0$. Characterize all subsets $M\\subset\\mathbb R$ for which there exists a continuous function $f$ that crosses the $x$‑axis at every point of $M\\,. $\nimport Mathlib\n\nnamespace Problem\n\nopen scoped Topology\n\n/--\nA function `f : ℝ → ℝ` crosses the `x`-axis at `a` when `f a = 0` and\nevery neighbourhood of `a` (a set belonging to the neighbourhood filter `𝓝 a`)\ncontains a point where `f` is negative and a point where `f` is positive.\n-/\ndef CrossesXAxisAt (f : ℝ → ℝ) (a : ℝ) : Prop :=\n f a = 0 ∧\n ∀ U : Set ℝ, U ∈ 𝓝 a →\n ∃ b c : ℝ, b ∈ U ∧ c ∈ U ∧ f b < 0 ∧ f c > 0\n\n/--\nThe subset `M : Set ℝ` is admissible when some continuous real-valued function\ncrosses the `x`-axis at every point of `M`.\n-/\ndef AdmissibleSet (M : Set ℝ) : Prop :=\n ∃ f : ℝ → ℝ, Continuous f ∧ ∀ a : ℝ, a ∈ M → CrossesXAxisAt f a\n\n/-- The proposed complete classification: the nowhere dense subsets of `ℝ`. -/\ndef ProposedAnswer : Set (Set ℝ) :=\n {M : Set ℝ | IsNowhereDense M}\n\n/--\nA proposed family of subsets is a complete answer precisely when it consists\nof exactly the admissible subsets of `ℝ` (both directions of classification).\n-/\ndef CompleteAnswer (answer : Set (Set ℝ)) : Prop :=\n ∀ M : Set ℝ, M ∈ answer ↔ AdmissibleSet M\n\n/--\nThe target assertion: the nowhere dense subsets of `ℝ` are exactly the subsets\nat which some continuous function crosses the `x`-axis at every point.\n-/\ndef Target : Prop :=\n CompleteAnswer ProposedAnswer\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bc2d5827-dd63-572c-afb7-875215eb61d2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5e91eebffc1fae18585eb21453815d0c7c09606d7451cf69e610913a1da068b0", "task_path": "tasks/nmp3_bc2d5827-dd63-572c-afb7-875215eb61d2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bc2d5827-dd63-572c-afb7-875215eb61d2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bc4d26ec-0a38-5092-8406-5bab75a31306", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $2017$ positive real numbers $a_1,a_2,\\dots ,a_{2017}$. For each $n>2017$, define \n-- \\[\n-- a_n=\\max\\{a_{i_1}a_{i_2}a_{i_3}\\mid i_1+i_2+i_3=n,\\;1\\le i_1\\le i_2\\le i_3\\le n-1\\}.\n-- \\] \n-- Prove that there exist a positive integer $m\\le 2017$ and a positive integer $N>4m$ such that \n-- \\[\n-- a_n\\,a_{n-4m}=a_{n-2m}^2\\qquad\\text{for every }n>N.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the recursively defined sequence problem\n\nThis file states, but does not prove, the proposition from `problem.md`.\n\nThe original sequence is indexed by positive integers. We represent it as a\nfunction `a : ℕ → ℝ`; the value at `0` is irrelevant and is never used.\n-/\n\nnamespace Problem\n\n/-- The initial data are positive: `a i > 0` for `1 ≤ i ≤ 2017`. -/\ndef InitialPositive (a : ℕ → ℝ) : Prop :=\n ∀ i : ℕ, 1 ≤ i → i ≤ 2017 → 0 < a i\n\n/-- The product of the three sequence terms indexed by an ordered triple. -/\ndef TripleProduct (a : ℕ → ℝ) (i₁ i₂ i₃ : ℕ) : ℝ :=\n a i₁ * a i₂ * a i₃\n\n/--\nThe ordered triples appearing in the defining maximum. In addition to the\ndisplayed ordering, the finite range `i₃ ≤ n - 1` is retained explicitly.\n-/\ndef TripleAdmissible (n i₁ i₂ i₃ : ℕ) : Prop :=\n 1 ≤ i₁ ∧ i₁ ≤ i₂ ∧ i₂ ≤ i₃ ∧ i₃ ≤ n - 1 ∧ i₁ + i₂ + i₃ = n\n\n/--\n`a n` is the maximum of the triple products occurring at index `n`.\n\nInstead of constructing a finite set and invoking `Finset.max'`, we state the\ntwo defining properties of a maximum in a linear order: every admissible triple\nproduct is at most `a n`, and some admissible triple attains `a n`.\n-/\ndef IsTripleMaximum (a : ℕ → ℝ) (n : ℕ) : Prop :=\n (∀ i₁ i₂ i₃ : ℕ,\n TripleAdmissible n i₁ i₂ i₃ → TripleProduct a i₁ i₂ i₃ ≤ a n) ∧\n (∃ i₁ i₂ i₃ : ℕ,\n TripleAdmissible n i₁ i₂ i₃ ∧ a n = TripleProduct a i₁ i₂ i₃)\n\n/-- The recursive maximum rule is imposed at every index strictly past 2017. -/\ndef SatisfiesRecurrence (a : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, 2017 < n → IsTripleMaximum a n\n\n/--\nA sequence satisfying the given initial values and the recursive maximum rule\nat every index `n > 2017`.\n-/\ndef IsRecursiveSequence (a : ℕ → ℝ) : Prop :=\n InitialPositive a ∧ SatisfiesRecurrence a\n\n/--\nThe asserted eventual second-difference (in multiplicative form) relation:\nthere are positive integers `m ≤ 2017` and `N > 4m` such that\n`a n * a (n - 4m) = a (n - 2m)^2` for all `n > N`.\n-/\ndef EventuallySquareRelation (a : ℕ → ℝ) : Prop :=\n ∃ m : ℕ, 0 < m ∧ m ≤ 2017 ∧\n ∃ N : ℕ, 0 < N ∧ 4 * m < N ∧\n ∀ n : ℕ, N < n →\n a n * a (n - 4 * m) = (a (n - 2 * m)) ^ 2\n\n/-- The full mathematical statement of the problem. -/\ndef Target : Prop :=\n ∀ a : ℕ → ℝ, IsRecursiveSequence a → EventuallySquareRelation a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bc4d26ec-0a38-5092-8406-5bab75a31306", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "884250aa99368998d1dd6f9096cf22e5c49200db13b4148a26fc15438b1dc72f", "task_path": "tasks/nmp3_bc4d26ec-0a38-5092-8406-5bab75a31306", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bc4d26ec-0a38-5092-8406-5bab75a31306", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bc4f4e72-ae30-5f71-93de-49d36c47d59a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $x,y,z$ are real numbers with $x+y+z>0$ and $xy+yz+zx\\ge0$, prove that \n-- \\[\n-- \\Bigl(\\sum_{\\text{cyc}}x\\,(y-z)^2\\Bigr)^{\\!3}\\ge54\\prod_{\\text{cyc}}x\\,(y-z)^2,\n-- \\]\n-- where $\\displaystyle\\sum_{\\text{cyc}}x\\,(y-z)^2\n-- =x(y-z)^2+y(z-x)^2+z(x-y)^2$ and \n-- $\\displaystyle\\prod_{\\text{cyc}}x\\,(y-z)^2\n-- =x(y-z)^2\\;y(z-x)^2\\;z(x-y)^2$.\nimport Mathlib\n\n/-!\n# Formalization of the cyclic inequality problem\n\nThe source problem asks one to prove, for real numbers `x`, `y`, and `z`\nsatisfying `x + y + z > 0` and `xy + yz + zx ≥ 0`, the inequality\n\n`(Σ_cyc x (y - z)^2)^3 ≥ 54 * Π_cyc x (y - z)^2`.\n\nThe two cyclic operators are expanded explicitly below exactly as in the\nproblem statement. `Target` is the resulting closed proposition; it is a\ndeclaration of the statement only, not a proof.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum appearing in the problem:\n`x * (y - z)^2 + y * (z - x)^2 + z * (x - y)^2`. -/\ndef cyclicSum (x y z : ℝ) : ℝ :=\n x * (y - z) ^ 2 + y * (z - x) ^ 2 + z * (x - y) ^ 2\n\n/-- The cyclic product appearing in the problem:\n`(x(y-z)^2) * (y(z-x)^2) * (z(x-y)^2)`. -/\ndef cyclicProduct (x y z : ℝ) : ℝ :=\n (x * (y - z) ^ 2) * (y * (z - x) ^ 2) * (z * (x - y) ^ 2)\n\n/-- For all real `x`, `y`, `z` with positive total sum and nonnegative\npairwise-product sum, the cube of the cyclic sum is at least `54` times the\ncyclic product. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n x + y + z > 0 →\n x * y + y * z + z * x ≥ 0 →\n (cyclicSum x y z) ^ 3 ≥ 54 * cyclicProduct x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bc4f4e72-ae30-5f71-93de-49d36c47d59a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6cd90a608d1827e7bff8b61623fb3aee5eb5f082e413dace3a1626222d33fea9", "task_path": "tasks/nmp3_bc4f4e72-ae30-5f71-93de-49d36c47d59a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bc4f4e72-ae30-5f71-93de-49d36c47d59a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bc72f2d3-a7bf-5ca7-bf20-fedc85b5f22e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers such that $abc\\ge 1$. Prove that \n-- $$a+b+c\\;\\ge\\;\\frac{1+a}{\\,1+b\\,}+\\frac{1+b}{\\,1+c\\,}+\\frac{1+c}{\\,1+a\\,}.$$\nimport Mathlib\n\n/-!\n# Formal statement for an inequality in three positive real variables\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`\nwhose product is at least one, an inequality involving three cyclic fractions.\nThe assertion is recorded as a proposition-valued definition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility assumptions from the problem: `a`, `b`, and `c` are\npositive real numbers and their product is at least one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 1 ≤ a * b * c\n\n/-- The claimed inequality, evaluated at real numbers `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a + b + c ≥ (1 + a) / (1 + b) + (1 + b) / (1 + c) + (1 + c) / (1 + a)\n\n/-- The complete assertion of the source problem. The three real variables are\nquantified in the same order as in the source, and the admissibility hypotheses\nare required for every choice of variables. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bc72f2d3-a7bf-5ca7-bf20-fedc85b5f22e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3e2f44b952a29edb17f60394c1ed1ba4ee5bdbd1ca91fa39fecd2648bedd6b6a", "task_path": "tasks/nmp3_bc72f2d3-a7bf-5ca7-bf20-fedc85b5f22e", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bc72f2d3-a7bf-5ca7-bf20-fedc85b5f22e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bcb8d5e0-f963-5b40-99ef-e03d3f73cf86", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P_1,P_2,\\dots ,P_6$ be six points in the plane such that no three are collinear and all $\\binom{6}{2}=15$ distances $|P_iP_j|$ are distinct. Prove that there exists a segment $P_iP_j$ which is the shortest side of some triangle formed by three of the points and also the longest side of (possibly another) triangle formed by three of the points.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\n/-!\n# Formalization of the six-point extremal-segment problem\n\nThe plane is represented by `EuclideanSpace ℝ (Fin 2)`. The six labeled\npoints are represented by a function `P : Fin 6 → PlanePoint`. A triangle is\nrepresented by a three-element `Finset` of indices whose image under `P` is\nnot collinear.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane `ℝ²`. -/\nabbrev PlanePoint : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Six point positions satisfy the hypothesis that no three distinct points\nare collinear. -/\ndef NoThreeCollinear (P : Fin 6 → PlanePoint) : Prop :=\n ∀ i j k : Fin 6,\n i ≠ j → i ≠ k → j ≠ k →\n ¬ Collinear ℝ ({P i, P j, P k} : Set PlanePoint)\n\n/-- The fifteen pairwise distances are pairwise distinct. Canonical ordered\nrepresentatives `i < j` and `k < l` are used for the unordered pairs. -/\ndef AllPairwiseDistancesDistinct (P : Fin 6 → PlanePoint) : Prop :=\n ∀ i j k l : Fin 6,\n i < j → k < l → (i, j) ≠ (k, l) →\n dist (P i) (P j) ≠ dist (P k) (P l)\n\n/-- A three-element set of indices forms a (nondegenerate) triangle under `P`. -/\ndef FormsTriangle (P : Fin 6 → PlanePoint) (s : Finset (Fin 6)) : Prop :=\n s.card = 3 ∧ ¬ Collinear ℝ (P '' (s : Set (Fin 6)))\n\n/-- The segment `P i P j` is a shortest side of some triangle determined by\nthree of the six points. -/\ndef IsShortestSideOfSomeTriangle (P : Fin 6 → PlanePoint) (i j : Fin 6) : Prop :=\n ∃ s : Finset (Fin 6),\n FormsTriangle P s ∧\n i ∈ s ∧ j ∈ s ∧\n ∀ a b : Fin 6,\n a ∈ s → b ∈ s → a ≠ b →\n dist (P i) (P j) ≤ dist (P a) (P b)\n\n/-- The segment `P i P j` is a longest side of some triangle determined by\nthree of the six points. -/\ndef IsLongestSideOfSomeTriangle (P : Fin 6 → PlanePoint) (i j : Fin 6) : Prop :=\n ∃ s : Finset (Fin 6),\n FormsTriangle P s ∧\n i ∈ s ∧ j ∈ s ∧\n ∀ a b : Fin 6,\n a ∈ s → b ∈ s → a ≠ b →\n dist (P a) (P b) ≤ dist (P i) (P j)\n\n/-- The conclusion: some segment is simultaneously a shortest side of one\ntriangle and a longest side of one (possibly the same, possibly another)\ntriangle. -/\ndef ExistsExtremalSegment (P : Fin 6 → PlanePoint) : Prop :=\n ∃ i j : Fin 6,\n i ≠ j ∧\n IsShortestSideOfSomeTriangle P i j ∧\n IsLongestSideOfSomeTriangle P i j\n\n/-- The full mathematical assertion of the problem. -/\ndef Target : Prop :=\n ∀ P : Fin 6 → PlanePoint,\n NoThreeCollinear P →\n AllPairwiseDistancesDistinct P →\n ExistsExtremalSegment P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bcb8d5e0-f963-5b40-99ef-e03d3f73cf86", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3e196089c18df90aa3f2baf197f75da948e856318487247ce675e73e89bdbed7", "task_path": "tasks/nmp3_bcb8d5e0-f963-5b40-99ef-e03d3f73cf86", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bcb8d5e0-f963-5b40-99ef-e03d3f73cf86", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bcdaa5cb-cea0-5f0b-a089-675173cc8484", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$ with $abc=1$, prove that \n-- \\[\n-- \\left(a+\\frac{1}{b}\\right)^{2}+\\left(b+\\frac{1}{c}\\right)^{2}+\\left(c+\\frac{1}{a}\\right)^{2}\\ge 6\\bigl(a+b+c-1\\bigr).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion: for all positive real numbers `a`, `b`, and `c` satisfying\n`a * b * c = 1`, the displayed sum of squares is at least\n`6 * (a + b + c - 1)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n (a + 1 / b) ^ 2 + (b + 1 / c) ^ 2 + (c + 1 / a) ^ 2 ≥\n 6 * (a + b + c - 1)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bcdaa5cb-cea0-5f0b-a089-675173cc8484", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "df4dc44115b74ccec594af12778b2f161672c55659a0223746657e04dcbee50b", "task_path": "tasks/nmp3_bcdaa5cb-cea0-5f0b-a089-675173cc8484", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bcdaa5cb-cea0-5f0b-a089-675173cc8484", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bceb4f41-8171-56d4-8970-37ade29a1e65", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For \\(n\\in\\mathbb N,\\ n\\ge 2,\\) and positive real numbers \\(a_1,a_2,\\dots ,a_n>0\\) satisfying \\(a_1a_2\\cdots a_n=1,\\) prove that \n-- \\[\n-- \\frac{a_1^{3n+1}}{a_1^{3n}+3n-4}+\\frac{a_2^{3n+1}}{a_2^{3n}+3n-4}+\\cdots+\\frac{a_n^{3n+1}}{a_n^{3n}+3n-4}\\ge \\frac{a_1+a_2+\\cdots+a_n}{3n-3}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nopen scoped BigOperators\n\n/-- The asserted sum inequality for a fixed natural number `n` and a real\n`n`-tuple `a`. The tuple is indexed by `Fin n`, so its entries correspond\nto `a_1, ..., a_n`, and the finite sums range over all `n` entries. -/\ndef SumInequality (n : ℕ) (a : Fin n → ℝ) : Prop :=\n (∑ i : Fin n,\n (a i) ^ (3 * n + 1) /\n ((a i) ^ (3 * n) + ((3 * n : ℝ) - 4))) ≥\n (∑ i : Fin n, a i) / ((3 * n : ℝ) - 3)\n\n/-- The full assertion of the problem: for every natural number `n ≥ 2` and\nevery positive real `n`-tuple whose product is one, the sum inequality\nholds. -/\ndef Target : Prop :=\n ∀ n : ℕ, 2 ≤ n → ∀ a : Fin n → ℝ,\n (∀ i : Fin n, 0 < a i) →\n (∏ i : Fin n, a i = 1) →\n SumInequality n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bceb4f41-8171-56d4-8970-37ade29a1e65", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7649c2ad043f6c07cb4c8b5ba1f2b0b68f1c6b3d47b9997fd82437aa707b2098", "task_path": "tasks/nmp3_bceb4f41-8171-56d4-8970-37ade29a1e65", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bceb4f41-8171-56d4-8970-37ade29a1e65", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bcfeb636-4f06-5880-810d-cc6315ab92d9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose 49 students each take a contest consisting of three problems. On each problem a student can score an integer number of points from 0 to 7 inclusive. Prove that there exist two distinct students A and B such that for each of the three problems the score of one of them is at least the score of the other (i.e., either A’s three scores are componentwise ≥ B’s three scores, or B’s three scores are componentwise ≥ A’s three scores).\n/-\n Formal statement of the 49-students / 3-problems / scores-0-to-7 problem.\n\n The assertion is represented as a proposition-valued definition. No proof of\n the target is supplied here; this file only records the precise claim.\n-/\nimport Mathlib\n\nnamespace Problem\n\n/-- The 49 students, indexed by `Fin 49`. -/\nabbrev Student : Type := Fin 49\n\n/-- The three contest problems, indexed by `Fin 3`. -/\nabbrev ProblemNumber : Type := Fin 3\n\n/-- A raw score is an integer. For admissible contest data it is constrained\nto lie between `0` and `7` by `ValidScores`. -/\nabbrev Score : Type := ℤ\n\n/-- A score table is admissible when every one of the three scores of every\none of the 49 students is an integer between `0` and `7`, inclusive. -/\ndef ValidScores (score : Student → ProblemNumber → Score) : Prop :=\n ∀ (student : Student) (problem : ProblemNumber),\n 0 ≤ score student problem ∧ score student problem ≤ 7\n\n/-- Student `A` has componentwise score at least that of student `B` on all\nthree problems. -/\ndef ComponentwiseGE (score : Student → ProblemNumber → Score)\n (A B : Student) : Prop :=\n ∀ problem : ProblemNumber, score B problem ≤ score A problem\n\n/-- The complete target claim: for every admissible score table of 49\nstudents on three problems, there are two distinct students whose three-score\nvectors are comparable componentwise (in one of the two possible directions). -/\ndef Target : Prop :=\n ∀ score : Student → ProblemNumber → Score,\n ValidScores score →\n ∃ A B : Student,\n A ≠ B ∧ (ComponentwiseGE score A B ∨ ComponentwiseGE score B A)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bcfeb636-4f06-5880-810d-cc6315ab92d9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ad1278989f23261880579631975a49455b70c024d8adc130a11a5e287b04404f", "task_path": "tasks/nmp3_bcfeb636-4f06-5880-810d-cc6315ab92d9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bcfeb636-4f06-5880-810d-cc6315ab92d9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bd170617-7072-5e16-94c2-603119a07f94", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ satisfy \n-- \\[\n-- \\frac1{a+1}+\\frac1{b+1}+\\frac1{c+1}+\\frac1{d+1}=3.\n-- \\]\n-- Prove that \n-- \\[\n-- \\sqrt[3]{abc}+\\sqrt[3]{bcd}+\\sqrt[3]{cda}+\\sqrt[3]{dab}\\le\\frac{4}{3}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The principal real cube root. On nonnegative `x` this is the real power\n`x ^ (1 / 3)`; on negative `x` it is defined by odd symmetry. In `Target` all\nfour arguments are products of positive reals, hence lie in the nonnegative\nbranch. -/\nnoncomputable def cubeRoot (x : ℝ) : ℝ :=\n if 0 ≤ x then x ^ (1 / 3 : ℝ) else -((-x) ^ (1 / 3 : ℝ))\n\n/-- The assertion in the problem: for all positive reals `a`, `b`, `c`, and\n`d` whose reciprocal sum after adding one is `3`, the sum of the four cube\nroots of the indicated threefold products is at most `4 / 3`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d →\n (1 / (a + 1) + 1 / (b + 1) + 1 / (c + 1) + 1 / (d + 1) = 3) →\n cubeRoot (a * b * c) + cubeRoot (b * c * d) +\n cubeRoot (c * d * a) + cubeRoot (d * a * b) ≤ (4 / 3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bd170617-7072-5e16-94c2-603119a07f94", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ba0ee10b62d7a307ae39f80ceaa15b894be5b420fb5fb48bd06b8c8cc0881742", "task_path": "tasks/nmp3_bd170617-7072-5e16-94c2-603119a07f94", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bd170617-7072-5e16-94c2-603119a07f94", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bd3cb9db-003a-50e7-80b2-49b146a3e953", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be nonnegative real numbers such that $a+b+c = 2$. Prove that \n-- \\[\n-- (a^3+b^3)(b^3+c^3)(c^3+a^3)\\le 2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the nonnegative-real inequality problem\n\nThe source problem asks to prove that if `a`, `b`, and `c` are nonnegative\nreal numbers with sum `2`, then the product of the three pairwise sums of cubes\nis at most `2`. The proposition is stated as a definition rather than proved,\nas required for this statement-formalization task.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved: for all nonnegative real `a`, `b`, `c`\nwhose sum is `2`, one has\n`(a^3 + b^3) * (b^3 + c^3) * (c^3 + a^3) ≤ 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a + b + c = (2 : ℝ) →\n (a ^ 3 + b ^ 3) * (b ^ 3 + c ^ 3) * (c ^ 3 + a ^ 3) ≤ (2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bd3cb9db-003a-50e7-80b2-49b146a3e953", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "11eacd4d13110791867243a17bdac5540b0acabb451d9860135625dac5c4d1f0", "task_path": "tasks/nmp3_bd3cb9db-003a-50e7-80b2-49b146a3e953", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bd3cb9db-003a-50e7-80b2-49b146a3e953", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bd738028-38cc-5b4a-978c-9f712ba04405", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For a positive integer $a$, define the sequence $F_n^{(a)}$ by $F_1^{(a)}=1$, $F_2^{(a)}=a$, and $F_n^{(a)}=F_{n-1}^{(a)}+F_{n-2}^{(a)}$ for $n>2$. A positive integer $m$ is called **fibonatic** if $m=F_n^{(a)}$ for some positive integer $a$ and some integer $n>3$. Prove that there are infinitely many positive integers that are not fibonatic.\nimport Mathlib\n\nnamespace Problem\n\n/-- The sequence `F_n^{(a)}` from the problem, indexed by natural numbers.\nThe values at `0` are arbitrary and are not used by the definition of\n`Fibonatic`; for positive indices it has the prescribed initial values and\nFibonacci-type recurrence. -/\ndef FibSeq (a : ℕ) : ℕ → ℕ\n | 0 => 0\n | 1 => 1\n | 2 => a\n | n + 3 => FibSeq a (n + 2) + FibSeq a (n + 1)\n\n/-- A positive integer `m` is fibonatic if it occurs as `F_n^{(a)}` for a\npositive integer `a` and an integer `n > 3`. -/\ndef Fibonatic (m : ℕ) : Prop :=\n 0 < m ∧ ∃ a : ℕ, ∃ n : ℕ, 0 < a ∧ 3 < n ∧ FibSeq a n = m\n\n/-- The set of positive integers which are not fibonatic. -/\ndef NonFibonaticSet : Set ℕ :=\n {m : ℕ | 0 < m ∧ ¬ Fibonatic m}\n\n/-- There are infinitely many positive integers that are not fibonatic. -/\ndef Target : Prop :=\n Set.Infinite NonFibonaticSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bd738028-38cc-5b4a-978c-9f712ba04405", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "20134d9c87053301e0c5e07360ba09b65f3776f51e50493c5cb284bab5acaa28", "task_path": "tasks/nmp3_bd738028-38cc-5b4a-978c-9f712ba04405", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bd738028-38cc-5b4a-978c-9f712ba04405", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bd7dcb72-a943-5826-9e79-833a7250fafb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>1$ be an integer and let $A$ be an $n\\times n$ matrix with rational entries ($A\\in M_n(\\mathbb{Q})$) such that $A\\neq I$. Let $p$ be a prime with $p>n+1$. Prove that \n-- $$A^p+A^{p-1}+\\cdots+A\\neq pI.$$\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The statement: for every integer `n > 1`, every `n × n` matrix `A` over `ℚ`\nwith `A ≠ I`, and every prime `p > n + 1`, the sum\n`A ^ p + A ^ (p - 1) + ⋯ + A` is not equal to `p I`. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 1 < n →\n ∀ (A : Matrix (Fin n) (Fin n) ℚ), A ≠ (1 : Matrix (Fin n) (Fin n) ℚ) →\n ∀ (p : ℕ), Nat.Prime p → n + 1 < p →\n (∑ i ∈ Finset.Icc 1 p, A ^ i) ≠\n (p : ℚ) • (1 : Matrix (Fin n) (Fin n) ℚ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bd7dcb72-a943-5826-9e79-833a7250fafb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "63ad3080e8e2f72dace715074f75e14fa56204aa50a493e791d4385fdff869c9", "task_path": "tasks/nmp3_bd7dcb72-a943-5826-9e79-833a7250fafb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bd7dcb72-a943-5826-9e79-833a7250fafb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bd8fb53c-35e0-53c9-b205-e0a302fe544b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$ and $b$ be positive integers. Prove that the integer \n-- \\[\n-- a^{2}+\\Big\\lceil\\frac{4a^{2}}{b}\\Big\\rceil\n-- \\]\n-- is never a perfect square. (Here $\\lceil z\\rceil$ denotes the least integer $\\ge z$.)\nimport Mathlib\n\nnamespace Problem\n\n/-- The integer expression from the problem:\n`a ^ 2 + ⌈4 * a ^ 2 / b⌉`, where `a` and `b` are positive integers,\nthe quotient is formed in the reals, and `Int.ceil` is the least integer\ngreater than or equal to that quotient. -/\nnoncomputable def expression (a b : ℤ) : ℤ :=\n a ^ 2 + Int.ceil (4 * (a : ℝ) ^ 2 / (b : ℝ))\n\n/-- An integer is a perfect square if it is the square of an integer. -/\ndef IsPerfectSquare (n : ℤ) : Prop :=\n ∃ c : ℤ, c ^ 2 = n\n\n/-- The asserted theorem: for all positive integers `a` and `b`, the integer\n`a ^ 2 + ⌈4 * a ^ 2 / b⌉` is never a perfect square. -/\ndef Target : Prop :=\n ∀ a b : ℤ, 0 < a → 0 < b → ¬ IsPerfectSquare (expression a b)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bd8fb53c-35e0-53c9-b205-e0a302fe544b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d983becf660ab37ea7fea18145a8f49a487b4283775d673ca9180f2dc05f5e91", "task_path": "tasks/nmp3_bd8fb53c-35e0-53c9-b205-e0a302fe544b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bd8fb53c-35e0-53c9-b205-e0a302fe544b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bd9ddea4-15a3-56a5-a3a1-8a3df8da1567", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there are infinitely many positive integers $n$ such that $n^2+1$ divides $n!$.\nimport Mathlib\n\n/-!\nFormalization of the statement:\n\n\"There are infinitely many positive integers n such that n² + 1 divides n!.\"\n\nThis file only declares the proposition; it does not contain a proof.\n-/\n\nnamespace Problem\n\n/-- A positive integer `n` is admissible when `n ^ 2 + 1` divides `n!`. -/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧ (n ^ 2 + 1) ∣ Nat.factorial n\n\n/-- There are infinitely many positive integers `n` for which `n ^ 2 + 1`\ndivides `n!`. -/\ndef Target : Prop :=\n Set.Infinite {n : ℕ | Admissible n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bd9ddea4-15a3-56a5-a3a1-8a3df8da1567", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2530b1059e4579a5a0fd888bb877570a4fbf5051edf10d66ddab071acb117cb2", "task_path": "tasks/nmp3_bd9ddea4-15a3-56a5-a3a1-8a3df8da1567", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bd9ddea4-15a3-56a5-a3a1-8a3df8da1567", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bdb75390-7ec2-5ee7-9579-38c24a4f38bd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, $c$ be positive real numbers. Prove that \n-- \\[\n-- \\bigl(a^{3}+b^{3}+c^{3}\\bigr)^{5}\\;\\ge\\;9\\bigl(a^{4}b+b^{4}c+c^{4}a\\bigr)^{3}.\n-- \\]\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n@[expose] public section\n\n/-!\n# Formalization of the target inequality\n\nThe problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\n\n`(a^3 + b^3 + c^3)^5 ≥ 9 * (a^4 * b + b^4 * c + c^4 * a)^3`.\n\nThis file only formalizes the proposition; it supplies no proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a ^ 3 + b ^ 3 + c ^ 3) ^ 5\n\n/-- The right-hand side of the target inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 9 * (a ^ 4 * b + b ^ 4 * c + c ^ 4 * a) ^ 3\n\n/-- The asserted inequality without the positivity hypotheses. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete proposition asserted by the problem: the inequality holds for every positive\nreal triple `(a, b, c)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bdb75390-7ec2-5ee7-9579-38c24a4f38bd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6c57f9545f4f8aface4e58a1f2afa256457e841482fd2dae947eb86cd2d29085", "task_path": "tasks/nmp3_bdb75390-7ec2-5ee7-9579-38c24a4f38bd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bdb75390-7ec2-5ee7-9579-38c24a4f38bd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bdbffbaf-50cf-5bd6-a99c-7354d8ee9089", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every positive integer $n$,\n-- \\[\n-- d(n)\\,\\bigl(n^{2}-n\\bigr)\\;\\ge\\; \\bigl(\\sigma(n)-n\\bigr)\\,\\bigl(\\sigma(n)-1\\bigr),\n-- \\]\n-- where $d(n)$ denotes the number of positive divisors of $n$ and $\\sigma(n)$ (denoted $o(n)$ in the original post) denotes the sum of the positive divisors of $n$.\nimport Mathlib\n\n/-!\n# Formal statement: divisor-count / divisor-sum inequality\n\nThe original problem asks to prove, for every positive integer `n`,\n`d(n) * (n^2 - n) ≥ (σ(n) - n) * (σ(n) - 1)`, where `d(n)` is the\nnumber of positive divisors of `n` and `σ(n)` is the sum of the positive\ndivisors of `n`.\n\nThe assertion is represented as the proposition-valued definition\n`Problem.Target`; no proof of it is supplied here.\n-/\n\nnamespace Problem\n\n/-- `d(n)`, the number of positive divisors of the natural number `n`. -/\ndef divisorCount (n : ℕ) : ℕ :=\n (Nat.divisors n).card\n\n/-- `σ(n)`, the sum of the positive divisors of the natural number `n`. -/\ndef divisorSum (n : ℕ) : ℕ :=\n ∑ d ∈ Nat.divisors n, d\n\n/-- The assertion from the problem: for every positive integer `n`,\n`d(n) * (n ^ 2 - n) ≥ (σ(n) - n) * (σ(n) - 1)`.\n\nHere `d` and `σ` are `Problem.divisorCount` and `Problem.divisorSum`,\nrespectively. All quantities are natural numbers. The hypothesis `0 < n`\nensures that these are the positive-divisor count and sum, and that the\nnatural-number subtractions agree with the nonnegative integer differences\nin the source statement. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n →\n divisorCount n * (n ^ 2 - n) ≥ (divisorSum n - n) * (divisorSum n - 1)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bdbffbaf-50cf-5bd6-a99c-7354d8ee9089", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cada05c0b21c11c260317894464fe68500ca066bb724229fa04d543612f803be", "task_path": "tasks/nmp3_bdbffbaf-50cf-5bd6-a99c-7354d8ee9089", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bdbffbaf-50cf-5bd6-a99c-7354d8ee9089", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bdc120ed-f8e3-536d-a671-b26dbc195bf0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a sequence of real numbers, a move consists of choosing two terms and replacing each with their arithmetic mean. Show that there exists a sequence of 2015 distinct real numbers such that, after any possible first move on the sequence, there is a finite continuation of moves that results in a constant sequence (all terms equal).\nimport Mathlib\n\n/-!\n# Formalization of the 2015 distinct-real-number averaging problem\n\nThe source problem concerns a finite sequence of real numbers. A move selects\ntwo distinct positions and replaces both selected entries by their arithmetic\nmean. The target asserts that there is a pairwise-distinct sequence of length\n2015 such that, after every possible first move, some finite continuation of\nmoves makes all entries equal.\n-/\n\nnamespace Problem\n\n/-- A finite real sequence of length `n`, indexed by `Fin n`. -/\nabbrev Sequence (n : ℕ) : Type := Fin n → ℝ\n\n/-- A single averaging move on a finite real sequence: choose two distinct\npositions `i` and `j`, and replace both selected entries by their arithmetic\nmean `(s i + s j) / 2`; all other entries are unchanged. -/\ndef Move {n : ℕ} (s t : Sequence n) : Prop :=\n ∃ i j : Fin n,\n i ≠ j ∧\n t i = (s i + s j) / (2 : ℝ) ∧\n t j = (s i + s j) / (2 : ℝ) ∧\n ∀ k : Fin n, k ≠ i → k ≠ j → t k = s k\n\n/-- A finite sequence is constant when all of its entries are equal. -/\ndef IsConstant {n : ℕ} (s : Sequence n) : Prop :=\n ∃ r : ℝ, ∀ i : Fin n, s i = r\n\n/-- `t` is reachable from `s` by a finite continuation of averaging moves.\nThis is the reflexive-transitive closure of `Move`; it includes the empty\ncontinuation, although an empty continuation is impossible as the outcome of\nthe problem's first move for a pairwise-distinct 2015-term sequence. -/\ndef FiniteContinuation {n : ℕ} (s t : Sequence n) : Prop :=\n Relation.ReflTransGen (Move (n := n)) s t\n\n/-- The assertion of the source problem: there exists a sequence of 2015\npairwise distinct real numbers such that, for every possible first move, a\nfinite continuation of moves leads to a constant sequence. -/\ndef Target : Prop :=\n ∃ a : Sequence 2015,\n Function.Injective a ∧\n ∀ b : Sequence 2015,\n Move a b →\n ∃ c : Sequence 2015,\n FiniteContinuation b c ∧ IsConstant c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bdc120ed-f8e3-536d-a671-b26dbc195bf0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ca4b879b2dbe988a16a78190b520cb69db42c2918d536795c16e82c077cb269d", "task_path": "tasks/nmp3_bdc120ed-f8e3-536d-a671-b26dbc195bf0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bdc120ed-f8e3-536d-a671-b26dbc195bf0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bdccf7e8-df32-55d6-b6c7-00a631214647", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\frac{a}{\\sqrt{a^{2}+8bc}}+\\frac{b}{\\sqrt{b^{2}+8ca}}+\\frac{c}{\\sqrt{c^{2}+8ab}}<2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the positive-real inequality\n\nThe source problem asks to prove that, for every triple of positive real numbers\n`a`, `b`, and `c`, the given three-term sum of square-root denominators is\nstrictly less than `2`.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The first summand: `a / sqrt (a^2 + 8bc)`. -/\ndef firstSummand (a b c : ℝ) : ℝ :=\n a / Real.sqrt (a ^ 2 + 8 * b * c)\n\n/-- The second summand: `b / sqrt (b^2 + 8ca)`. -/\ndef secondSummand (a b c : ℝ) : ℝ :=\n b / Real.sqrt (b ^ 2 + 8 * c * a)\n\n/-- The third summand: `c / sqrt (c^2 + 8ab)`. -/\ndef thirdSummand (a b c : ℝ) : ℝ :=\n c / Real.sqrt (c ^ 2 + 8 * a * b)\n\n/-- The left-hand side of the source inequality. -/\ndef leftHandSide (a b c : ℝ) : ℝ :=\n firstSummand a b c + secondSummand a b c + thirdSummand a b c\n\n/-- For all positive real numbers `a`, `b`, and `c`,\n`a / sqrt (a² + 8bc) + b / sqrt (b² + 8ca) + c / sqrt (c² + 8ab) < 2`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → leftHandSide a b c < 2\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bdccf7e8-df32-55d6-b6c7-00a631214647", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4c3316d1c97461e49c36f33b7e56267843dca57ad9149ac3ac67f3e87ba03f41", "task_path": "tasks/nmp3_bdccf7e8-df32-55d6-b6c7-00a631214647", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bdccf7e8-df32-55d6-b6c7-00a631214647", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bdeacfe9-adfd-53b9-9815-3b999585c513", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $ab+bc+ca=1$. Prove that \n-- $$a^4b^2+b^4c^2+c^4a^2+\\frac{5}{9}\\ge 2abc\\,(a+b+c).$$\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a ^ 4 * b ^ 2 + b ^ 4 * c ^ 2 + c ^ 4 * a ^ 2 + (5 : ℝ) / 9\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 2 * a * b * c * (a + b + c)\n\n/-- The admissibility assumptions on the three real variables. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = 1\n\n/-- The inequality asserted under the admissibility assumptions. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ RHS a b c\n\n/-- The complete universally quantified statement of the problem. -/\nnoncomputable def Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bdeacfe9-adfd-53b9-9815-3b999585c513", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f8c3b76cfcf79573a6cc18ca3618577f81fa95d5883f6cbca323806e1a93a92a", "task_path": "tasks/nmp3_bdeacfe9-adfd-53b9-9815-3b999585c513", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bdeacfe9-adfd-53b9-9815-3b999585c513", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bea28d63-257d-59f0-84c9-39d81b8fc3d5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{a}{b^{2}+2}\\ge 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the cyclic inequality\n\nFor positive real numbers `a`, `b`, and `c` whose sum is `3`, the problem asks to\nprove the cyclic inequality\n`a / (b^2 + 2) + b / (c^2 + 2) + c / (a^2 + 2) ≥ 1`.\n-/\n\nnamespace Problem\n\n/-- The admissibility assumptions on a triple of real numbers: all three entries\nare strictly positive and their sum is exactly `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = (3 : ℝ)\n\n/-- The cyclic sum `a / (b^2 + 2) + b / (c^2 + 2) + c / (a^2 + 2)`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n a / (b ^ 2 + (2 : ℝ)) + b / (c ^ 2 + (2 : ℝ)) + c / (a ^ 2 + (2 : ℝ))\n\n/-- The assertion to be proved: for every admissible positive real triple with\nsum `3`, the cyclic sum is at least `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → cyclicSum a b c ≥ (1 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bea28d63-257d-59f0-84c9-39d81b8fc3d5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2ac0c48725fefdb60a9ae41045b2ec00b3e757b13f44804f35de0ea3c604ee27", "task_path": "tasks/nmp3_bea28d63-257d-59f0-84c9-39d81b8fc3d5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bea28d63-257d-59f0-84c9-39d81b8fc3d5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_beb800bc-e41e-585e-bec0-7c3c713e5451", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots ,a_n$ be positive real numbers and let $n\\ge2$ be an integer. Prove that \n-- \\[\n-- \\left(\\frac{\\displaystyle\\sum_{j=1}^{n}\\bigl(\\prod_{k=1}^{j}a_k\\bigr)^{\\frac1j}}{\\displaystyle\\sum_{j=1}^{n}a_j}\\right)^{\\frac1n}\n-- +\\frac{\\displaystyle\\bigl(\\prod_{i=1}^{n}a_i\\bigr)^{\\frac1n}}{\\displaystyle\\sum_{j=1}^{n}\\bigl(\\prod_{k=1}^{j}a_k\\bigr)^{\\frac1j}}\n-- \\le\\frac{n+1}{n}\\,. \n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The `j`-th partial product `∏_{k=1}^{j} a_k`, where the Lean index\n`j : Fin n` represents the original index `j + 1`. -/\nnoncomputable def partialProduct {n : ℕ} (a : Fin n → ℝ) (j : Fin n) : ℝ :=\n ∏ k : Fin (j.val + 1),\n a ⟨k.val, Nat.lt_of_lt_of_le k.isLt (Nat.succ_le_of_lt j.isLt)⟩\n\n/-- The `j`-th summand `(∏_{k=1}^{j} a_k)^(1/j)`, with `j : Fin n`\nrepresenting the original positive integer `j + 1`. -/\nnoncomputable def partialGeometricTerm {n : ℕ} (a : Fin n → ℝ) (j : Fin n) : ℝ :=\n Real.rpow (partialProduct a j) ((1 : ℝ) / ((j.val + 1 : ℕ) : ℝ))\n\n/-- The sum `∑_{j=1}^{n} (∏_{k=1}^{j} a_k)^(1/j)`; it is the numerator of\n the first fraction and the denominator of the second fraction. -/\nnoncomputable def partialGeometricSum {n : ℕ} (a : Fin n → ℝ) : ℝ :=\n ∑ j : Fin n, partialGeometricTerm a j\n\n/-- The denominator `∑_{j=1}^{n} a_j`. -/\nnoncomputable def sumA {n : ℕ} (a : Fin n → ℝ) : ℝ :=\n ∑ j : Fin n, a j\n\n/-- The total geometric mean `(∏_{i=1}^{n} a_i)^(1/n)`. -/\nnoncomputable def totalGeometricMean {n : ℕ} (a : Fin n → ℝ) : ℝ :=\n Real.rpow (∏ i : Fin n, a i) ((1 : ℝ) / (n : ℝ))\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs {n : ℕ} (a : Fin n → ℝ) : ℝ :=\n Real.rpow (partialGeometricSum a / sumA a) ((1 : ℝ) / (n : ℝ)) +\n totalGeometricMean a / partialGeometricSum a\n\n/-- The right-hand side `(n+1)/n` of the asserted inequality. -/\nnoncomputable def rhs (n : ℕ) : ℝ :=\n ((n : ℝ) + 1) / (n : ℝ)\n\n/-- The full universal statement: for every integer `n ≥ 2` and every positive\nreal sequence `a_1, …, a_n`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 2 ≤ n → ∀ (a : Fin n → ℝ),\n (∀ i : Fin n, 0 < a i) → lhs a ≤ rhs n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "beb800bc-e41e-585e-bec0-7c3c713e5451", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a750fa7247bd7281a925450ba7630e30e3a0e33583f33192262f457632ab1276", "task_path": "tasks/nmp3_beb800bc-e41e-585e-bec0-7c3c713e5451", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "beb800bc-e41e-585e-bec0-7c3c713e5451", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_beb80d97-9a2a-5b42-9a25-19b402d5652c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ be real numbers such that $a+b+c=2$. Prove that \n-- \\[\n-- a^{2}+b^{2}+c^{2}\\;\\ge\\;2\\bigl(a^{3}b^{3}+b^{3}c^{3}+c^{3}a^{3}\\bigr)+9a^{2}b^{2}c^{2}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the nonnegative-real inequality\n\nThe source problem asks to prove, for real numbers `a`, `b`, and `c` that are\nall nonnegative and satisfy `a + b + c = 2`, the inequality\n`a^2 + b^2 + c^2 ≥ 2 (a^3 b^3 + b^3 c^3 + c^3 a^3) + 9 a^2 b^2 c^2`.\n\nThis file records the proposition to be proved. It does not provide a proof.\n-/\n\nnamespace Problem\n\n/-- The three source variables are real numbers and are all nonnegative. -/\ndef NonnegativeTriple (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The normalization constraint imposed by the source problem. -/\ndef SumEqTwo (a b c : ℝ) : Prop :=\n a + b + c = 2\n\n/-- The inequality whose proof is requested by the source problem. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 ≥\n 2 * (a ^ 3 * b ^ 3 + b ^ 3 * c ^ 3 + c ^ 3 * a ^ 3) +\n 9 * a ^ 2 * b ^ 2 * c ^ 2\n\n/-- The complete assertion of the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, NonnegativeTriple a b c → SumEqTwo a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "beb80d97-9a2a-5b42-9a25-19b402d5652c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "98bccadb36e810b4de808af8bdfd0ef405d2bbb075905707d41611bc58e89b90", "task_path": "tasks/nmp3_beb80d97-9a2a-5b42-9a25-19b402d5652c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "beb80d97-9a2a-5b42-9a25-19b402d5652c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bedd2211-75b3-521e-b163-40f3b6344602", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb N\\to\\mathbb N$ satisfy $f(n+1)>f(f(n))$ for all $n\\in\\mathbb N$. Prove that $f(n)=n$ for every $n\\in\\mathbb N$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypothesis of the problem: a function `f : ℕ → ℕ` satisfies\n`f (n + 1) > f (f n)` for every natural number `n`. -/\ndef Admissible (f : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, f (n + 1) > f (f n)\n\n/-- The claimed conclusion: `f n = n` for every natural number `n`. -/\ndef Conclusion (f : ℕ → ℕ) : Prop :=\n ∀ n : ℕ, f n = n\n\n/-- The full assertion to be proved: every function `f : ℕ → ℕ` satisfying\nthe given inequality is the identity function on `ℕ`. -/\ndef Target : Prop :=\n ∀ f : ℕ → ℕ, Admissible f → Conclusion f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bedd2211-75b3-521e-b163-40f3b6344602", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d538c8fbd9485939db6f3b75522b59fa8d27d421d02f85ea9190f30ce5245669", "task_path": "tasks/nmp3_bedd2211-75b3-521e-b163-40f3b6344602", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bedd2211-75b3-521e-b163-40f3b6344602", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bee0fd02-6a75-5d9e-8543-cc06e57bbb13", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- T is a point in the plane of triangle $ABC$ such that $\\angle ATB=\\angle BTC=\\angle CTA=120^\\circ$. Prove that the lines symmetric to $AT$, $BT$, and $CT$ with respect to $BC$, $CA$, and $AB$, respectively, are concurrent.\nimport Mathlib\n\n/-!\n# Formalization of the three-reflection concurrency problem\n\nThe source problem concerns a point `T` in a Euclidean plane at which the three\nrays to the vertices of a nondegenerate triangle make pairwise `120°` angles.\nIt asks to prove that the reflections of the three lines `AT`, `BT`, and `CT`\nin the opposite side lines are concurrent.\n\nThis file states the unproved assertion as the proposition `Problem.Target`.\nNo proof of `Problem.Target` is supplied.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\nuniverse u v\n\nopen scoped EuclideanGeometry\n\n/-- One hundred twenty degrees, measured in radians. -/\ndef angle120 : ℝ := 2 * Real.pi / 3\n\n/-- The translation space of a Euclidean plane: a two-dimensional real inner\nproduct space. (`FiniteDimensional` is stated explicitly so that this is a\ngenuine dimension condition, not Lean's default value for `finrank` on an\ninfinite-dimensional space.) -/\ndef IsEuclideanPlane (V : Type u) [NormedAddCommGroup V] [InnerProductSpace ℝ V] : Prop :=\n FiniteDimensional ℝ V ∧ Module.finrank ℝ V = 2\n\n/-- `A`, `B`, and `C` are the vertices of a nondegenerate triangle. -/\ndef IsTriangle (V : Type u) (P : Type v)\n [AddCommGroup V] [Module ℝ V] [AddTorsor V P] (A B C : P) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set P)\n\n/-- The three angles at `T` specified in the problem are all `120°`. -/\ndef HasAngles120 (V : Type u) (P : Type v)\n [NormedAddCommGroup V] [InnerProductSpace ℝ V]\n [MetricSpace P] [NormedAddTorsor V P] (A B C T : P) : Prop :=\n EuclideanGeometry.angle A T B = angle120 ∧\n EuclideanGeometry.angle B T C = angle120 ∧\n EuclideanGeometry.angle C T A = angle120\n\n/-- The reflection of the line through `X` and `T` in the line through `Y`\nand `Z`. This is the image of the whole affine line under the orthogonal\nreflection in the mirror line. -/\ndef ReflectedLine (V : Type u) (P : Type v)\n [NormedAddCommGroup V] [InnerProductSpace ℝ V]\n [MetricSpace P] [NormedAddTorsor V P] (X T Y Z : P) : AffineSubspace ℝ P :=\n (line[ℝ, X, T]).map (EuclideanGeometry.reflection (line[ℝ, Y, Z]))\n\n/-- Three affine subspaces are concurrent when they have a common point. -/\ndef Concurrent (V : Type u) (P : Type v)\n [AddCommGroup V] [Module ℝ V] [AddTorsor V P]\n (L₁ L₂ L₃ : AffineSubspace ℝ P) : Prop :=\n ∃ X : P, X ∈ L₁ ∧ X ∈ L₂ ∧ X ∈ L₃\n\n/-- The assertion from the source problem: in every Euclidean plane, for every\nnondegenerate triangle `ABC` and every point `T` such that the angles `ATB`,\n`BTC`, and `CTA` are all `120°`, the reflections of `AT`, `BT`, and `CT` in\n`BC`, `CA`, and `AB`, respectively, are concurrent. -/\ndef Target : Prop :=\n ∀ (V : Type u) (P : Type v)\n [NormedAddCommGroup V] [InnerProductSpace ℝ V]\n [MetricSpace P] [NormedAddTorsor V P],\n IsEuclideanPlane V →\n ∀ (A B C T : P),\n IsTriangle V P A B C →\n HasAngles120 V P A B C T →\n Concurrent V P\n (ReflectedLine V P A T B C)\n (ReflectedLine V P B T C A)\n (ReflectedLine V P C T A B)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bee0fd02-6a75-5d9e-8543-cc06e57bbb13", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "71edf17e298807c3f154bb66ca0860dc2e5ac5e665061c54ae3b9ba59884634b", "task_path": "tasks/nmp3_bee0fd02-6a75-5d9e-8543-cc06e57bbb13", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bee0fd02-6a75-5d9e-8543-cc06e57bbb13", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_beed5661-aaf8-5cda-9178-910cc7248237", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}} \\frac{(2a-b-c)(b+c)}{b^2+c^2}\\ge 0.\n-- \\]\nmodule\npublic import Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the cyclic inequality\n\nFor positive real numbers `a`, `b`, and `c`, the source problem asks for\n\\[\n\\sum_{\\mathrm{cyc}} \\frac{(2a-b-c)(b+c)}{b^2+c^2} \\ge 0.\n\\]\nThe cyclic sum is expanded explicitly in `cyclicSum`.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The common admissibility hypothesis `a > 0`, `b > 0`, and `c > 0`. -/\ndef PositiveDomain (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The summand `(2a - b - c) * (b + c) / (b^2 + c^2)` of the cyclic sum. -/\nnoncomputable def cycTerm (a b c : ℝ) : ℝ :=\n ((2 * a - b - c) * (b + c)) / (b ^ 2 + c ^ 2)\n\n/-- The cyclic sum with its three terms written out explicitly:\nthe summands are obtained by cycling `(a, b, c) → (b, c, a) → (c, a, b)`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n cycTerm a b c + cycTerm b c a + cycTerm c a b\n\n/-- The assertion from the problem: for all positive real `a`, `b`, and `c`,\nthe cyclic sum of `(2a-b-c)(b+c)/(b^2+c^2)` is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveDomain a b c → 0 ≤ cyclicSum a b c\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "beed5661-aaf8-5cda-9178-910cc7248237", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6ac28cff328be809f0f63792a40d1be41615bde9d4d2a92ba02c2efcab4f07c8", "task_path": "tasks/nmp3_beed5661-aaf8-5cda-9178-910cc7248237", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "beed5661-aaf8-5cda-9178-910cc7248237", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bf17f2c5-adb6-5e8c-a2e7-6d73919c1941", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\in\\mathbb{R}_{0}^{+}$ such that $xy+yz+zx>0$. Prove that \n-- \\[\n-- \\frac{1}{x^{2}+y^{2}}+\\frac{1}{y^{2}+z^{2}}+\\frac{1}{z^{2}+x^{2}}+\\frac{1}{x^{2}+y^{2}+z^{2}}\n-- \\;\\ge\\;\n-- \\frac{12}{(x+y+z)^{2}}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the nonnegative-real inequality problem\n\nThe source problem asks to prove, for nonnegative real numbers `x`, `y`, and `z`\nsatisfying `xy + yz + zx > 0`, the inequality\n\n`1/(x^2+y^2) + 1/(y^2+z^2) + 1/(z^2+x^2) + 1/(x^2+y^2+z^2) ≥ 12/(x+y+z)^2`.\n\nThis file only states the problem; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The three domain restrictions saying that `x`, `y`, and `z` lie in `ℝ₀⁺`. -/\ndef NonnegativeTriple (x y z : ℝ) : Prop :=\n 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z\n\n/-- The hypotheses of the problem: nonnegative real `x`, `y`, `z` with\n`xy + yz + zx > 0`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n NonnegativeTriple x y z ∧ 0 < x * y + y * z + z * x\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n 1 / (x ^ 2 + y ^ 2) +\n 1 / (y ^ 2 + z ^ 2) +\n 1 / (z ^ 2 + x ^ 2) +\n 1 / (x ^ 2 + y ^ 2 + z ^ 2)\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def rhs (x y z : ℝ) : ℝ :=\n 12 / (x + y + z) ^ 2\n\n/-- The full universal proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → lhs x y z ≥ rhs x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bf17f2c5-adb6-5e8c-a2e7-6d73919c1941", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b9d07e7025dbcc644a9105577dbc6a5cd91c70a17c47355af27278fe63f1f890", "task_path": "tasks/nmp3_bf17f2c5-adb6-5e8c-a2e7-6d73919c1941", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "bf17f2c5-adb6-5e8c-a2e7-6d73919c1941", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_bf828cdd-c62e-5b6a-b677-17733e0b4966", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- There are $n\\ge2$ finite sets $A_1,A_2,\\dots,A_n$. Prove that there exist $n-1$ sets $B_1,B_2,\\dots,B_{n-1}$ such that \n-- \n-- 1. $\\displaystyle\\bigcup_{i=1}^n A_i=\\bigcup_{i=1}^{n-1} B_i,$ \n-- \n-- 2. $B_i\\cap B_j=\\varnothing$ for all $1\\le i1,\\qquad a_{n+1}=a_n+p(a_n)\\ \\text{ for all }n\\ge1 .\n-- \\]\n-- \n-- Prove that there exists an index $n$ such that $a_n$ is a perfect square.\nimport Mathlib.Data.Nat.MaxPrimeFac\n\n/-!\n# Largest prime factor iteration\n\nThis file formalizes the statement of the following problem.\n\nLet `p(c)` be the largest prime factor of a positive integer `c`. Suppose that\n`a : ℕ → ℕ` satisfies `a 1 > 1` and\n`a (n + 1) = a n + p (a n)` for every `n ≥ 1`. Then some positive-indexed\nterm `a n` is a perfect square.\n\nThe original sequence is indexed by positive integers. We represent it as a\nfunction `a : ℕ → ℕ`; all values at positive indices are constrained by the\nassumptions and conclusion, while the value at the unused index `0` is irrelevant.\n-/\n\nnamespace Problem\n\n/-- A natural number `m` is a perfect square if it is `k ^ 2` for some natural\nnumber `k`. This is the usual notion, including `0` and `1` as squares. -/\ndef IsPerfectSquare (m : ℕ) : Prop :=\n ∃ k : ℕ, m = k ^ 2\n\n/-- `q` is the largest prime factor of `c`: it is prime, divides `c`, and every\nprime divisor of `c` is at most `q`. This predicate is only meaningful when a\nprime factor exists; for `c > 1` it holds exactly for the largest prime factor. -/\ndef IsLargestPrimeFactor (c q : ℕ) : Prop :=\n q.Prime ∧ q ∣ c ∧ ∀ r : ℕ, r.Prime → r ∣ c → r ≤ q\n\n/-- The total version of the largest-prime-factor function used in the\nrecurrence. Mathlib's `Nat.maxPrimeFac c` is the genuine largest prime factor\nwhen `1 < c`. On the exceptional inputs `0` and `1` it is assigned the default\nvalue `c`; those inputs cannot occur in an admissible sequence. -/\ndef largestPrimeFactor (c : ℕ) : ℕ :=\n Nat.maxPrimeFac c\n\n/-- For `c > 1`, `largestPrimeFactor c` is indeed the largest prime factor of\n`c` according to the explicit predicate `IsLargestPrimeFactor`. -/\ntheorem largestPrimeFactor_isLargest {c : ℕ} (hc : 1 < c) :\n IsLargestPrimeFactor c (largestPrimeFactor c) := by\n refine ⟨?_, ?_, ?_⟩\n · exact Nat.prime_maxPrimeFac_of_one_lt hc\n · exact Nat.maxPrimeFac_dvd\n · intro r hr hrdvd\n exact Nat.le_maxPrimeFac (Nat.zero_lt_of_lt hc).ne' hr hrdvd\n\n/-- The admissibility conditions on the sequence, with the positive indexing of\nthe source problem. -/\ndef IsAdmissibleSequence (a : ℕ → ℕ) : Prop :=\n (∀ n : ℕ, 1 ≤ n → 0 < a n) ∧\n 1 < a 1 ∧\n ∀ n : ℕ, 1 ≤ n → a (n + 1) = a n + largestPrimeFactor (a n)\n\n/-- In an admissible sequence every positive-indexed term is greater than one,\nso in the recurrence `largestPrimeFactor` is always applied in its\nunambiguous regime. -/\ntheorem IsAdmissibleSequence.one_lt_terms {a : ℕ → ℕ}\n (ha : IsAdmissibleSequence a) :\n ∀ n : ℕ, 1 ≤ n → 1 < a n := by\n intro n hn\n induction n, hn using Nat.le_induction with\n | base => exact ha.2.1\n | succ n hn ih =>\n have hrec := ha.2.2 n hn\n have hfac_gt_one : 1 < largestPrimeFactor (a n) := by\n rw [largestPrimeFactor, Nat.one_lt_maxPrimeFac_iff]\n exact ih\n have hfac_pos : 0 < largestPrimeFactor (a n) :=\n Nat.zero_lt_of_lt hfac_gt_one\n calc\n 1 < a n := ih\n _ < a n + largestPrimeFactor (a n) := Nat.lt_add_of_pos_right hfac_pos\n _ = a (n + 1) := hrec.symm\n\n/-- At every occurrence in the recurrence, `largestPrimeFactor` satisfies the\nexplicit defining property of the largest prime factor. -/\ntheorem IsAdmissibleSequence.largestPrimeFactor_spec {a : ℕ → ℕ}\n (ha : IsAdmissibleSequence a) :\n ∀ n : ℕ, 1 ≤ n →\n IsLargestPrimeFactor (a n) (largestPrimeFactor (a n)) := by\n intro n hn\n exact largestPrimeFactor_isLargest (IsAdmissibleSequence.one_lt_terms ha n hn)\n\n/-- The assertion to be proved: every positive-integer sequence satisfying\n`a 1 > 1` and `a (n + 1) = a n + p (a n)` for all `n ≥ 1` has a term, at a\npositive index, which is a perfect square. -/\ndef Target : Prop :=\n ∀ a : ℕ → ℕ,\n IsAdmissibleSequence a →\n ∃ n : ℕ, 1 ≤ n ∧ IsPerfectSquare (a n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c019e54a-791c-5be4-a3b2-85bd90f05801", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "05353b0a99e621c05d7868d0b6d65810394cadef64fe3c5daddf9542b010919b", "task_path": "tasks/nmp3_c019e54a-791c-5be4-a3b2-85bd90f05801", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c019e54a-791c-5be4-a3b2-85bd90f05801", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c034bb28-1968-5456-b9b3-49aa75ff519c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(a_1,a_2,\\dots)$ be any permutation of the positive integers. Prove that there are infinitely many positive integers $i$ such that \n-- \\[\n-- \\gcd(a_i,a_{i+1})\\le\\frac34\\,i.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- A sequence indexed by the positive integers is a permutation of the positive\nintegers exactly when it is a bijection `ℕ+ → ℕ+`. -/\ndef IsPermutationOfPositiveIntegers (a : ℕ+ → ℕ+) : Prop :=\n Function.Bijective a\n\n/-- The index `i` satisfies the inequality displayed in the problem. The value\n`3 / 4` is interpreted exactly in `ℚ`, and the integer gcd is cast to `ℚ` for the\ncomparison. -/\ndef GoodIndex (a : ℕ+ → ℕ+) (i : ℕ+) : Prop :=\n ((Nat.gcd (a i : ℕ) (a (i + 1) : ℕ) : ℕ) : ℚ) ≤ (3 / 4 : ℚ) * (i : ℚ)\n\n/-- The set of positive indices satisfying the displayed inequality is infinite. -/\ndef InfinitelyManyGoodIndices (a : ℕ+ → ℕ+) : Prop :=\n Set.Infinite {i : ℕ+ | GoodIndex a i}\n\n/-- The assertion of the problem: for every permutation of the positive integers,\nthere are infinitely many positive indices `i` for which\n`gcd(a_i, a_{i+1}) ≤ (3/4) * i`. -/\ndef Target : Prop :=\n ∀ a : ℕ+ → ℕ+, IsPermutationOfPositiveIntegers a → InfinitelyManyGoodIndices a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c034bb28-1968-5456-b9b3-49aa75ff519c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9840d03f3ba8b780fff1bb933e24866b63047f1d75cd97df0c6cf13a87045e64", "task_path": "tasks/nmp3_c034bb28-1968-5456-b9b3-49aa75ff519c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c034bb28-1968-5456-b9b3-49aa75ff519c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c035f206-c8ea-5624-bc22-5f556178ef80", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- There are 12 delegates at a conference. Friendship is mutual and a delegate is not a friend with himself. It is known that for any two distinct delegates there is at least one other delegate who is a common friend of the two. Prove that some delegate has at least five friends (i.e., has degree ≥ 5 in the friendship graph).\nimport Mathlib.Combinatorics.SimpleGraph.Finite\n\n/-!\n# Formalization of the conference friendship problem\n\nThere are twelve delegates. Friendship is a simple graph: symmetric and\nirreflexive. Every two distinct delegates have a common friend distinct from\nboth. The conclusion is that some delegate has degree at least five.\n-/\n\nnamespace Problem\n\n/-- The type of delegates: there are exactly twelve delegates. -/\nabbrev Delegate : Type := Fin 12\n\n/-- A friendship graph on the twelve delegates is a simple graph. The\n`SimpleGraph` structure bundles mutual friendship and the absence of\nself-friendship. -/\nabbrev FriendshipGraph : Type := SimpleGraph Delegate\n\n/-- `u` is a common friend of the distinct delegates `v` and `w`, and is\ndifferent from both of them. The two adjacency conjuncts say that `u` is a\nfriend of `v` and a friend of `w`. -/\ndef IsCommonFriend (G : FriendshipGraph) (u v w : Delegate) : Prop :=\n u ≠ v ∧ u ≠ w ∧ G.Adj u v ∧ G.Adj u w\n\n/-- Every two distinct delegates have at least one other delegate who is a\ncommon friend of both. -/\ndef HasCommonFriendProperty (G : FriendshipGraph) : Prop :=\n ∀ v w : Delegate, v ≠ w → ∃ u : Delegate, IsCommonFriend G u v w\n\n/-- The delegate `v` has at least five friends, i.e. degree at least five in\nthe friendship graph. -/\nnoncomputable def HasAtLeastFiveFriends (G : FriendshipGraph) (v : Delegate) : Prop := by\n classical\n exact 5 ≤ G.degree v\n\n/-- The assertion to be proved: in every twelve-delegate friendship graph in\nwhich every pair of distinct delegates has a common friend distinct from both,\nsome delegate has at least five friends. -/\nnoncomputable def Target : Prop := by\n classical\n exact ∀ G : FriendshipGraph, HasCommonFriendProperty G →\n ∃ v : Delegate, HasAtLeastFiveFriends G v\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c035f206-c8ea-5624-bc22-5f556178ef80", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "881772e3a9462a34890daac7c8c4e5d8a4a83f0a2059c3bf8e4ef1c20d8c04db", "task_path": "tasks/nmp3_c035f206-c8ea-5624-bc22-5f556178ef80", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c035f206-c8ea-5624-bc22-5f556178ef80", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c036709c-6a13-5ac1-95d6-f03c548e60e9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a(b^2+bc-ca-c^2)}{b^2+ca+ab}\n-- +\\frac{b(c^2+ca-ab-a^2)}{c^2+ab+bc}\n-- +\\frac{c(a^2+ab-bc-b^2)}{a^2+bc+ca}\n-- \\le 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable real inequality\n\nThis file records the assertion as a proposition-valued definition. No proof of\nthe assertion is supplied.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`, the displayed cyclic sum is\nat most zero. All divisions are divisions in `ℝ`; the positivity hypotheses\nensure that the displayed denominators are nonzero. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (a * (b ^ 2 + b * c - c * a - c ^ 2)) /\n (b ^ 2 + c * a + a * b)\n + (b * (c ^ 2 + c * a - a * b - a ^ 2)) /\n (c ^ 2 + a * b + b * c)\n + (c * (a ^ 2 + a * b - b * c - b ^ 2)) /\n (a ^ 2 + b * c + c * a) ≤\n 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c036709c-6a13-5ac1-95d6-f03c548e60e9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f2d43b6a06e18bceb2b9de3159261bed728641f4dccd2ac14ac2a50c97e052a7", "task_path": "tasks/nmp3_c036709c-6a13-5ac1-95d6-f03c548e60e9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c036709c-6a13-5ac1-95d6-f03c548e60e9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c03aa4eb-3e2e-5815-9316-010c3b1d5aa6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{1}{a\\bigl(a^{2}+b+c\\bigr)}+\\frac{1}{b\\bigl(b^{2}+c+a\\bigr)}+\\frac{1}{c\\bigl(c^{2}+a+b\\bigr)}\\ge \\frac{a^{2}+b^{2}+c^{2}}{3}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the cyclic reciprocal inequality\n\nThe source problem asks to prove, for positive reals `a`, `b`, and `c`\nwhose sum is `3`, the inequality\n\n`1 / (a * (a ^ 2 + b + c)) + 1 / (b * (b ^ 2 + c + a)) +\n 1 / (c * (c ^ 2 + a + b)) ≥ (a ^ 2 + b ^ 2 + c ^ 2) / (3 : ℝ)`.\n\nThis file records the statement only; it deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (1 : ℝ) / (a * (a ^ 2 + b + c)) +\n (1 : ℝ) / (b * (b ^ 2 + c + a)) +\n (1 : ℝ) / (c * (c ^ 2 + a + b))\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) / (3 : ℝ)\n\n/-- The hypotheses `a, b, c > 0` and `a + b + c = 3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = (3 : ℝ)\n\n/-- The complete assertion to be proved, universally quantified over positive\nreal triples with sum `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c03aa4eb-3e2e-5815-9316-010c3b1d5aa6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "45b11bfecb5f7ad3fb1cbeb3c84adbdaefe46b06c8107b69eb15fc2a46e0a150", "task_path": "tasks/nmp3_c03aa4eb-3e2e-5815-9316-010c3b1d5aa6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c03aa4eb-3e2e-5815-9316-010c3b1d5aa6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c042102f-4cbb-502f-9002-1bf384f8171a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be real numbers satisfying $a\\ge b\\ge c\\ge d\\ge0$ and $a^{2}+b^{2}+c^{2}+d^{2}=4$. Prove that \n-- $$abcd+(a-d)^{2}\\ge1.$$\nimport Mathlib\n\n/-!\n# Formal statement for the real-variable inequality problem\n\nThe source problem asks us to prove, for all real numbers `a b c d` satisfying\n`a ≥ b ≥ c ≥ d ≥ 0` and `a^2 + b^2 + c^2 + d^2 = 4`, that\n`a * b * c * d + (a - d)^2 ≥ 1`.\n-/\n\nnamespace Problem\n\n/-- The hypothesis that the four real numbers are ordered nonnegatively and lie\non the sphere of radius `2` centered at the origin. -/\ndef Hypothesis (a b c d : ℝ) : Prop :=\n a ≥ b ∧ b ≥ c ∧ c ≥ d ∧ d ≥ 0 ∧\n a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = 4\n\n/-- The asserted conclusion of the source problem. -/\ndef Claim (a b c d : ℝ) : Prop :=\n a * b * c * d + (a - d) ^ 2 ≥ 1\n\n/-- The full universal statement to be proved. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Hypothesis a b c d → Claim a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c042102f-4cbb-502f-9002-1bf384f8171a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "439c91244a69ef1648a362e81924c98aa79d7442a0b4822f85dc0d85e476a8c4", "task_path": "tasks/nmp3_c042102f-4cbb-502f-9002-1bf384f8171a", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c042102f-4cbb-502f-9002-1bf384f8171a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c0571038-f4c3-53dd-9d1b-c59448d985fe", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that\n-- $$2\\Big(\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\Big)+\\frac{5abc}{(a+b+c)^3-22abc}\\ge 7\\,.$$\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\n\n`2 (a / b + b / c + c / a) + 5abc / ((a + b + c)^3 - 22abc) ≥ 7`.\n\nThe denominator is written as an ordinary real expression. No separate\nnonzero-denominator hypothesis is imposed: positivity of the denominator follows\nfrom the stated positivity assumptions and the AM-GM inequality.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 2 * (a / b + b / c + c / a) +\n (5 * a * b * c) / ((a + b + c) ^ 3 - 22 * a * b * c)\n\n/-- The proposition asserted by the source problem: for all positive real\n`a`, `b`, and `c`, the displayed left-hand side is at least `7`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → 7 ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c0571038-f4c3-53dd-9d1b-c59448d985fe", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4aacb8612279202ca3159fb88294129309b22fefddecdce410d91751a0790321", "task_path": "tasks/nmp3_c0571038-f4c3-53dd-9d1b-c59448d985fe", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c0571038-f4c3-53dd-9d1b-c59448d985fe", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c05f6e3c-c67c-526e-801d-209a37048bd2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers such that $\\displaystyle\\prod_{\\text{cyc}}\\bigl(3a^{2}+(b-c)^{2}\\bigr)\\neq0$. Prove that \n-- \\[\n-- \\frac{a^{2}-bc}{3a^{2}+(b-c)^{2}}+\\frac{b^{2}-ca}{3b^{2}+(c-a)^{2}}+\\frac{c^{2}-ab}{3c^{2}+(a-b)^{2}}\\le\\frac34.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The first cyclic factor `3 * a^2 + (b - c)^2` in the denominator product. -/\ndef denomA (a b c : ℝ) : ℝ :=\n 3 * a ^ 2 + (b - c) ^ 2\n\n/-- The second cyclic factor `3 * b^2 + (c - a)^2` in the denominator product. -/\ndef denomB (a b c : ℝ) : ℝ :=\n 3 * b ^ 2 + (c - a) ^ 2\n\n/-- The third cyclic factor `3 * c^2 + (a - b)^2` in the denominator product. -/\ndef denomC (a b c : ℝ) : ℝ :=\n 3 * c ^ 2 + (a - b) ^ 2\n\n/-- The cyclic product appearing in the hypothesis of the problem. -/\ndef cyclicDenominatorProduct (a b c : ℝ) : ℝ :=\n denomA a b c * denomB a b c * denomC a b c\n\n/-- The first summand of the left-hand side. -/\ndef termA (a b c : ℝ) : ℝ :=\n (a ^ 2 - b * c) / denomA a b c\n\n/-- The second summand of the left-hand side. -/\ndef termB (a b c : ℝ) : ℝ :=\n (b ^ 2 - c * a) / denomB a b c\n\n/-- The third summand of the left-hand side. -/\ndef termC (a b c : ℝ) : ℝ :=\n (c ^ 2 - a * b) / denomC a b c\n\n/-- The complete left-hand side of the desired inequality. -/\ndef inequalityLHS (a b c : ℝ) : ℝ :=\n termA a b c + termB a b c + termC a b c\n\n/-- The formal statement of the problem: for all real `a`, `b`, and `c`, if the\ncyclic product of the three displayed denominators is nonzero, then the displayed\ncyclic sum is at most `3 / 4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n cyclicDenominatorProduct a b c ≠ 0 →\n inequalityLHS a b c ≤ (3 : ℝ) / 4\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c05f6e3c-c67c-526e-801d-209a37048bd2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bf8d430ce04ede43467bc6cf2fb89a143a5296d37a5d69bc3e7f203459f17c04", "task_path": "tasks/nmp3_c05f6e3c-c67c-526e-801d-209a37048bd2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c05f6e3c-c67c-526e-801d-209a37048bd2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c0d6a5e4-009e-51a3-90ea-aa8d77e59677", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}} \\frac{a^{2}-bc}{2b^{2}-3bc+2c^{2}}\\ge 0,\n-- \\] \n-- where the sum is taken over the cyclic permutations of $(a,b,c)$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The single cyclic summand\n`(a ^ 2 - b * c) / (2 * b ^ 2 - 3 * b * c + 2 * c ^ 2)`. -/\nnoncomputable def cyclicTerm (a b c : ℝ) : ℝ :=\n (a ^ 2 - b * c) / (2 * b ^ 2 - 3 * b * c + 2 * c ^ 2)\n\n/-- The cyclic sum of `cyclicTerm` over the three cyclic permutations of\n`(a, b, c)`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The assertion of the problem: for all positive real `a`, `b`, and `c`,\nthe cyclic sum is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → 0 ≤ cyclicSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c0d6a5e4-009e-51a3-90ea-aa8d77e59677", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ad43cf408e22c33af96568d067b6d2f2f01445c981f287e335ff9deec1f3ab27", "task_path": "tasks/nmp3_c0d6a5e4-009e-51a3-90ea-aa8d77e59677", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c0d6a5e4-009e-51a3-90ea-aa8d77e59677", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c0f8c260-64d2-50d2-bf8f-f9efe145a382", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a+b+c=3$. Prove that\n-- \\[\n-- \\frac1{\\sqrt{a+b+2ab}}+\\frac1{\\sqrt{b+c+2bc}}+\\frac1{\\sqrt{c+a+2ca}}\n-- \\le \\frac{3}{\\sqrt{ab+bc+ca+abc}}\\,.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\nnamespace Problem\n\n/-- The admissible triples in the problem: `a`, `b`, and `c` are all positive\nreal numbers and their sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / Real.sqrt (a + b + 2 * a * b) +\n 1 / Real.sqrt (b + c + 2 * b * c) +\n 1 / Real.sqrt (c + a + 2 * c * a)\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 3 / Real.sqrt (a * b + b * c + c * a + a * b * c)\n\n/-- The inequality asserted by the problem, for arbitrary real `a`, `b`, and `c`.\nThis definition isolates the algebraic formula from its admissibility conditions. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ rhs a b c\n\n/-- The full target proposition: for every positive real triple `a`, `b`, `c`\nwith `a + b + c = 3`, the stated three-term inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c0f8c260-64d2-50d2-bf8f-f9efe145a382", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ddc6b8bdf6cea1e5e4cc25eba59f841a1f2d5cb2f874e6573bf2af4b821272c5", "task_path": "tasks/nmp3_c0f8c260-64d2-50d2-bf8f-f9efe145a382", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c0f8c260-64d2-50d2-bf8f-f9efe145a382", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c1209353-6577-5dce-9b61-1ea737509904", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be non‑negative real numbers. Prove that \n-- \\[\n-- \\sqrt[3]{\\frac{(2a+b)(2b+c)(2c+a)}{27}}\\;\\ge\\;\\sqrt{\\frac{ab+bc+ca}{3}}\\; .\n-- \\]\n/-\n Statement formalization for:\n\n Let $a,b,c$ be non-negative real numbers. Prove that\n $$\\sqrt[3]{\\frac{(2a+b)(2b+c)(2c+a)}{27}} \\ge \\sqrt{\\frac{ab+bc+ca}{3}}.$$\n\n This file only records the mathematical statement as a `Prop`; it contains no proof\n of the target inequality. The auxiliary lemmas below only justify that the roots\n used in the statement are applied to non-negative real numbers, as in the source.\n-/\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\nimport Mathlib.Analysis.Real.Sqrt\n\nnamespace Problem\n\n/-- The principal real cube root.\n\nFor every non-negative real `x`, `cbrt x` is the unique non-negative real `y` with\n`y ^ 3 = x`. It is represented by the real power `x ^ (1 / 3)`; every use below has a\nnon-negative radicand (the hypotheses `0 ≤ a`, `0 ≤ b`, `0 ≤ c` make the numerator a\nproduct of three non-negative factors).\n-/\nnoncomputable def cbrt (x : ℝ) : ℝ := x ^ ((1 : ℝ) / 3)\n\n/-- For a non-negative argument, the auxiliary `cbrt` is non-negative. -/\nlemma cbrt_nonneg {x : ℝ} (hx : 0 ≤ x) : 0 ≤ cbrt x := by\n exact Real.rpow_nonneg hx _\n\n/-- Cubing the auxiliary `cbrt` of a non-negative argument returns the argument. -/\nlemma cbrt_pow_three {x : ℝ} (hx : 0 ≤ x) : cbrt x ^ 3 = x := by\n unfold cbrt\n rw [← Real.rpow_natCast]\n rw [← Real.rpow_mul hx]\n norm_num\n\n/-- Uniqueness of the real cube root: if `x` is non-negative and `y ^ 3 = x`, then\n`y = cbrt x`. In particular, `cbrt x` is the unique non-negative real cube root of `x`. -/\nlemma cbrt_unique {x y : ℝ} (hx : 0 ≤ x) (hy : y ^ 3 = x) : y = cbrt x := by\n have h3 : Odd (3 : ℕ) := by norm_num [Nat.odd_iff]\n apply h3.pow_injective\n show y ^ 3 = (cbrt x) ^ 3\n rw [hy, cbrt_pow_three hx]\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n cbrt (((2 * a + b) * (2 * b + c) * (2 * c + a)) / (27 : ℝ))\n\n/-- The right-hand side of the inequality in the problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n Real.sqrt ((a * b + b * c + c * a) / (3 : ℝ))\n\n/-- The radicand of the cube root in the problem is non-negative under the stated\nhypotheses. -/\nlemma lhs_radicand_nonneg {a b c : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (hc : 0 ≤ c) :\n 0 ≤ ((2 * a + b) * (2 * b + c) * (2 * c + a)) / (27 : ℝ) := by\n positivity\n\n/-- The radicand of the square root in the problem is non-negative under the stated\nhypotheses. -/\nlemma rhs_radicand_nonneg {a b c : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (hc : 0 ≤ c) :\n 0 ≤ (a * b + b * c + c * a) / (3 : ℝ) := by\n positivity\n\n/-- The inequality asserted by the problem for fixed real numbers `a`, `b`, and `c`.\n\nThis is the raw conclusion predicate; the non-negativity hypotheses are attached in\n`Problem.Target`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full statement of the problem: for all non-negative real numbers `a`, `b`, and `c`,\nthe cube root of `(2a+b)(2b+c)(2c+a)/27` is at least the square root of\n`(ab+bc+ca)/3`.\n\nThe three non-negativity hypotheses are the implications from `0 ≤ a`, `0 ≤ b`, and\n`0 ≤ c`; the conclusion is `Problem.Inequality a b c`. No relation among `a`, `b`, and\n`c` other than their individual non-negativity is assumed. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c1209353-6577-5dce-9b61-1ea737509904", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d430ddb9f33235c7a42dca54a6ee14eb270fdb2dbdcda930cd898f69a3444bd8", "task_path": "tasks/nmp3_c1209353-6577-5dce-9b61-1ea737509904", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c1209353-6577-5dce-9b61-1ea737509904", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c17948d9-8e49-5745-abab-db6715799f9b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,x,y,z\\ge0$ be real numbers such that $a+b+c=x+y+z$. Prove that \n-- \\[\n-- ax(a+x)+by(b+y)+cz(c+z)\\ge3\\bigl(abc+xyz\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a nonnegative-variable inequality\n\nThe source problem asks to prove, for all nonnegative real numbers\n`a, b, c, x, y, z` satisfying `a + b + c = x + y + z`, the inequality\n\n`a*x*(a+x) + b*y*(b+y) + c*z*(c+z) ≥ 3*(a*b*c + x*y*z)`.\n\nThis file only records the mathematical assertion as a proposition; it does\nnot provide a proof.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved.\n\nThe six variables are real numbers. Each is assumed nonnegative, and the two\nthree-term sums are assumed equal. The conclusion is the stated inequality. -/\ndef Target : Prop :=\n ∀ a b c x y z : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n 0 ≤ x → 0 ≤ y → 0 ≤ z →\n a + b + c = x + y + z →\n a * x * (a + x) + b * y * (b + y) + c * z * (c + z) ≥\n 3 * (a * b * c + x * y * z)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c17948d9-8e49-5745-abab-db6715799f9b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "430fb81fbf9a1ae2a122ff914ef8b657f6d8d321ace02dd977765e2ebfa4ff73", "task_path": "tasks/nmp3_c17948d9-8e49-5745-abab-db6715799f9b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c17948d9-8e49-5745-abab-db6715799f9b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c18f8a6b-25cf-5b0e-8a6e-ca2e3e79f2ec", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- $$\\frac{1}{2a^{2}+bc}+\\frac{1}{2b^{2}+ca}+\\frac{1}{2c^{2}+ab}\\le\\Big(\\frac{a+b+c}{ab+bc+ca}\\Big)^{2}\\,.$$\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`, the cyclic reciprocal\ninequality holds. All additions, multiplications, divisions, and powers in the\nstatement use the field operations on `ℝ`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c →\n 1 / (2 * a ^ 2 + b * c) +\n 1 / (2 * b ^ 2 + c * a) +\n 1 / (2 * c ^ 2 + a * b) ≤\n ((a + b + c) / (a * b + b * c + c * a)) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c18f8a6b-25cf-5b0e-8a6e-ca2e3e79f2ec", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "af50874ca4aaa6b80a3f06092619111ec2976965e68db9751416291b4e31232d", "task_path": "tasks/nmp3_c18f8a6b-25cf-5b0e-8a6e-ca2e3e79f2ec", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c18f8a6b-25cf-5b0e-8a6e-ca2e3e79f2ec", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c1976f67-c8ec-5c9c-8776-9481db206935", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k,l,m$ be non‑zero real numbers. Prove that \n-- \\[\n-- \\left(\\frac{k^{3}m}{l}\\right)^{2}+\\left(\\frac{l^{3}k}{m}\\right)^{2}+\\left(\\frac{m^{3}l}{k}\\right)^{2}\n-- \\;\\ge\\;\n-- k^{4}\\bigl(3km-2l^{2}\\bigr)\\;+\\;l^{4}\\bigl(3kl-2m^{2}\\bigr)\\;+\\;m^{4}\\bigl(3lm-2k^{2}\\bigr).\\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the inequality problem\n\nThe statement concerns three nonzero real numbers `k`, `l`, and `m`.\nThe expressions `LHS` and `RHS` below are the two sides of the displayed\ninequality, and `Target` records the universal assertion for all nonzero\nreal choices of the three variables.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def LHS (k l m : ℝ) : ℝ :=\n (k ^ 3 * m / l) ^ 2 +\n (l ^ 3 * k / m) ^ 2 +\n (m ^ 3 * l / k) ^ 2\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def RHS (k l m : ℝ) : ℝ :=\n k ^ 4 * (3 * k * m - 2 * l ^ 2) +\n l ^ 4 * (3 * k * l - 2 * m ^ 2) +\n m ^ 4 * (3 * l * m - 2 * k ^ 2)\n\n/-- The asserted inequality for a fixed triple of real numbers. -/\nnoncomputable def Inequality (k l m : ℝ) : Prop :=\n LHS k l m ≥ RHS k l m\n\n/-- The complete original assertion: the inequality holds for every triple of\nnonzero real numbers. -/\nnoncomputable def Target : Prop :=\n ∀ (k l m : ℝ), k ≠ 0 → l ≠ 0 → m ≠ 0 → Inequality k l m\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c1976f67-c8ec-5c9c-8776-9481db206935", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ae4ec2e9437e17df017075a3a20041a7e3e1eb145c70696bc6817b8b7eb874b0", "task_path": "tasks/nmp3_c1976f67-c8ec-5c9c-8776-9481db206935", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c1976f67-c8ec-5c9c-8776-9481db206935", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c1f62f28-b270-5a5c-ba15-935b412457cb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $S=\\{1,2,\\dots ,n\\}$ with $n\\ge 3$, and let $f\\colon S^{k}\\to S$ satisfy \n-- \\[\n-- \\text{if }a=(a_{1},\\dots ,a_{k}),\\;b=(b_{1},\\dots ,b_{k})\\in S^{k}\\text{ and }a_{i}\\neq b_{i}\\text{ for every }i=1,\\dots ,k,\n-- \\text{ then }f(a)\\neq f(b).\n-- \\] \n-- Prove that $f$ depends on only one coordinate; i.e. there exist an index $i\\in\\{1,\\dots ,k\\}$ and a function $g\\colon S\\to S$ (necessarily a bijection) such that \n-- \\[\n-- f(x_{1},\\dots ,x_{k})=g(x_{i})\\qquad\\text{for all }(x_{1},\\dots ,x_{k})\\in S^{k}.\n-- \\]\nimport Mathlib.Data.Fin.Basic\n\n/-!\n# Formal statement of the problem\n\nThe problem takes `S = {1, 2, ..., n}`. We represent this set literally as\nthe subtype of natural numbers `m` satisfying `1 ≤ m` and `m ≤ n`. Likewise,\nthe index set `{1, ..., k}` is represented by the subtype of natural numbers\n`i` satisfying `1 ≤ i` and `i ≤ k`. Thus a `k`-tuple from `S` is represented\nby a function from the latter index type to `S n`.\n-/\n\nnamespace Problem\n\n/-- The set `S = {1, 2, ..., n}` as a subtype of the natural numbers. -/\nabbrev S (n : ℕ) : Type := {m : ℕ // 1 ≤ m ∧ m ≤ n}\n\n/-- The index set `{1, 2, ..., k}` as a subtype of the natural numbers. -/\nabbrev Index (k : ℕ) : Type := {i : ℕ // 1 ≤ i ∧ i ≤ k}\n\n/-- Two tuples are coordinatewise different when their entries differ in every\ncoordinate. -/\ndef CoordinatewiseDifferent {n k : ℕ} (a b : Index k → S n) : Prop :=\n ∀ i : Index k, a i ≠ b i\n\n/-- The hypothesis imposed on `f`: coordinatewise-different tuples have\ndifferent images. -/\ndef SeparationProperty {n k : ℕ} (f : (Index k → S n) → S n) : Prop :=\n ∀ a b : Index k → S n,\n CoordinatewiseDifferent a b → f a ≠ f b\n\n/-- The conclusion: `f` is a function of one coordinate, and the corresponding\nunary function on `S` is bijective. -/\ndef DependsOnOneCoordinate {n k : ℕ} (f : (Index k → S n) → S n) : Prop :=\n ∃ i : Index k, ∃ g : S n → S n,\n Function.Bijective g ∧\n ∀ x : Index k → S n, f x = g (x i)\n\n/-- The full universally quantified assertion of the problem: for every\nnatural number `k` (the intended positive values are the nontrivial case),\nevery natural number `n ≥ 3`, and every function `f : S^k → S` satisfying the\nseparation hypothesis, `f` is a function of one coordinate, via a bijective\nunary function on `S`. The quantifier for `k` ranges over all natural numbers;\nwhen `k = 0` there is no function satisfying `SeparationProperty`, since the\nunique empty tuple may be compared with itself and the coordinatewise premise\nis vacuous. -/\ndef Target : Prop :=\n ∀ (n k : ℕ), 3 ≤ n →\n ∀ f : (Index k → S n) → S n,\n SeparationProperty f → DependsOnOneCoordinate f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c1f62f28-b270-5a5c-ba15-935b412457cb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "19310546a3a121893a3d18ed7c076fb89e2050e84b974218ec0505aae9b62b6b", "task_path": "tasks/nmp3_c1f62f28-b270-5a5c-ba15-935b412457cb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c1f62f28-b270-5a5c-ba15-935b412457cb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c233f9ac-519f-59ce-b09d-bb41172d766a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any positive integer $d$, prove that there exist infinitely many positive integers $n$ such that $d\\cdot n! - 1$ is a composite number (i.e., not prime).\nimport Mathlib\n\n/-!\n# Formal statement\n\nFor every positive integer `d`, there are infinitely many positive integers `n`\nfor which `d * n! - 1` is not prime.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition for a candidate `n`, for a fixed positive `d`.\n\nThe source parenthetically identifies \"composite\" with \"not prime\", so the\nnumerical condition is formalized as `¬ Nat.Prime (d * n.factorial - 1)`.\nThe conjunction `0 < n` records that only positive integers `n` are counted.\n-/\ndef Admissible (d n : ℕ) : Prop :=\n 0 < n ∧ ¬ Nat.Prime (d * n.factorial - 1)\n\n/-- For every positive integer `d`, the positive integers `n` satisfying\n`Admissible d n` form an infinite set. -/\ndef Target : Prop :=\n ∀ d : ℕ, 0 < d → Set.Infinite {n : ℕ | Admissible d n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c233f9ac-519f-59ce-b09d-bb41172d766a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8152174ec32d194c59a39f5eee59065a55fba3c63293b2a4259cccc5c4e6f47e", "task_path": "tasks/nmp3_c233f9ac-519f-59ce-b09d-bb41172d766a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c233f9ac-519f-59ce-b09d-bb41172d766a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c2767ac1-a5eb-511f-b4fc-4a44f5567604", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- We have $2n$ positive integers whose sum is a multiple of $n$. An operation consists of choosing exactly $n$ of the integers and adding the same positive integer to each of the chosen $n$ numbers. Prove that, starting from the given $2n$ numbers, it is always possible to make all $2n$ numbers equal using at most $2n-1$ operations.\nimport Mathlib\n\n/-!\n# Formalization of a finite additive-operation problem\n\nWe are given `2 * n` positive integers whose sum is divisible by `n`.\nOne operation chooses exactly `n` distinct positions and adds one positive\ninteger, the same for every chosen position, to the entries at those positions.\nThe target asserts that for every admissible initial configuration there is a\nfinite sequence of at most `2 * n - 1` such operations making all entries equal.\n-/\n\nnamespace Problem\n\n/-- One allowed operation on a configuration of `2 * n` integers.\n\nThe operation chooses exactly `n` distinct positions and adds a single positive\ninteger `increment` to all chosen positions. Positions outside `chosen` are\nleft unchanged. -/\nstructure Operation (n : Nat) where\n chosen : Finset (Fin (2 * n))\n card_chosen : chosen.card = n\n increment : Int\n increment_pos : 0 < increment\n\n/-- Apply one operation to a configuration. -/\ndef Operation.apply {n : Nat} (op : Operation n)\n (a : Fin (2 * n) → Int) : Fin (2 * n) → Int :=\n fun i => a i + if i ∈ op.chosen then op.increment else 0\n\n/-- Apply a chronological list of operations to a configuration. -/\ndef applyOperations {n : Nat} (ops : List (Operation n))\n (a : Fin (2 * n) → Int) : Fin (2 * n) → Int :=\n ops.foldl (fun current op => op.apply current) a\n\n/-- All entries of a configuration are equal. -/\ndef FinalEqual {n : Nat} (a : Fin (2 * n) → Int) : Prop :=\n ∃ c : Int, ∀ i : Fin (2 * n), a i = c\n\n/-- Every one of the `2 * n` entries is positive. -/\ndef PositiveEntries {n : Nat} (a : Fin (2 * n) → Int) : Prop :=\n ∀ i : Fin (2 * n), 0 < a i\n\n/-- The sum of the `2 * n` entries is an integer multiple of `n`. -/\ndef SumMultipleOfN (n : Nat) (a : Fin (2 * n) → Int) : Prop :=\n (n : Int) ∣ ∑ i : Fin (2 * n), a i\n\n/-- The hypotheses on the initial configuration:\n`n` is positive, all `2 * n` entries are positive, and their sum is a multiple\nof `n` (integer divisibility). -/\ndef AdmissibleInput (n : Nat) (a : Fin (2 * n) → Int) : Prop :=\n 0 < n ∧ PositiveEntries a ∧ SumMultipleOfN n a\n\n/-- A configuration can be made equal using at most `k` allowed operations. -/\ndef ReachableInAtMost (n : Nat) (a : Fin (2 * n) → Int) (k : Nat) : Prop :=\n ∃ ops : List (Operation n),\n ops.length ≤ k ∧ FinalEqual (applyOperations ops a)\n\n/-- The asserted theorem as a proposition.\n\nFor every positive natural number `n` and every admissible configuration of\n`2 * n` positive integers, there exists a finite sequence of at most\n`2 * n - 1` allowed operations whose result has all entries equal. -/\ndef Target : Prop :=\n ∀ (n : Nat) (a : Fin (2 * n) → Int),\n AdmissibleInput n a → ReachableInAtMost n a (2 * n - 1)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c2767ac1-a5eb-511f-b4fc-4a44f5567604", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7d9091862188d187fa6c5adf8286d9ae073a5d7bd081ea325e749ea2b1f2b33b", "task_path": "tasks/nmp3_c2767ac1-a5eb-511f-b4fc-4a44f5567604", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c2767ac1-a5eb-511f-b4fc-4a44f5567604", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c28c7fae-b590-57e0-8b12-43b5f05460b4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 3$ be an integer and let $X=\\{1,2,\\dots,n^{2}-n\\}$. Prove that $X$ can be partitioned into two disjoint subsets $A$ and $B$ such that neither $A$ nor $B$ contains $n$ distinct numbers $a_{1} 1\n\n/-- The function `x ↦ x + 1`. -/\ndef identityPlusOne : ℝ → ℝ :=\n fun x : ℝ => x + 1\n\n/-- The two functions proposed by the complete answer. -/\ndef IsProposedSolution (f : ℝ → ℝ) : Prop :=\n f = constantOne ∨ f = identityPlusOne\n\n/-- The proposed complete answer as a set of real-valued functions. -/\ndef ProposedSolutionSet : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | IsProposedSolution f}\n\n/-- A set `S` of real-valued functions is a complete answer when it is exactly the\nset of admissible functions. The first conjunct is the soundness direction and the\nsecond conjunct is the completeness direction. -/\ndef IsCompleteAnswer (S : Set (ℝ → ℝ)) : Prop :=\n (∀ f : ℝ → ℝ, f ∈ S → IsSolution f) ∧\n (∀ f : ℝ → ℝ, IsSolution f → f ∈ S)\n\n/-- The answer-correctness assertion for the proposed complete answer. -/\ndef Target : Prop :=\n IsCompleteAnswer ProposedSolutionSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c28d9e33-623f-5647-a611-c38701806433", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bd82770f89d86f6d17a156423b0c9c5a1529c11f40a48a2ffff830d700a25bcf", "task_path": "tasks/nmp3_c28d9e33-623f-5647-a611-c38701806433", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c28d9e33-623f-5647-a611-c38701806433", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c295adc9-1ebd-5fb2-b564-a5527054086d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\ge 0\\) satisfy \\(a^{2}+b^{2}+c^{2}=1\\). Prove that \n-- \\[\n-- \\frac{1}{3+a^{2}-2bc}+\\frac{1}{3+b^{2}-2ca}+\\frac{1}{3+c^{2}-2ab}\\le \\frac{9}{8}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the nonnegative-variable inequality\n\nThe source problem asks us to prove, for real numbers `a`, `b`, and `c` that are\nnonnegative and satisfy `a^2 + b^2 + c^2 = 1`, the inequality\n`1 / (3 + a^2 - 2bc) + 1 / (3 + b^2 - 2ca) + 1 / (3 + c^2 - 2ab) ≤ 9 / 8`.\n-/\n\nnamespace Problem\n\n/-- The three nonnegativity assumptions together with the quadratic constraint\nfrom the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a ^ 2 + b ^ 2 + c ^ 2 = 1\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n 1 / (3 + a ^ 2 - 2 * b * c) +\n 1 / (3 + b ^ 2 - 2 * c * a) +\n 1 / (3 + c ^ 2 - 2 * a * b)\n\n/-- The assertion to be proved: for all nonnegative real `a`, `b`, and `c`\nwith `a^2 + b^2 + c^2 = 1`, the indicated sum of reciprocals is at most `9/8`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≤ (9 : ℝ) / 8\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c295adc9-1ebd-5fb2-b564-a5527054086d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0478b6a05da33f554631a54297389a391097eb2761350ea3baf7711e126587e2", "task_path": "tasks/nmp3_c295adc9-1ebd-5fb2-b564-a5527054086d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c295adc9-1ebd-5fb2-b564-a5527054086d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c2d90640-d0dd-5489-9c83-30bfeb976424", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given any set of 9 points in the plane with no three collinear, prove that for each point \\(P\\) of the set the number of triangles whose vertices are among the other eight points and that contain \\(P\\) in their interior is an even integer.\nimport Mathlib\n\n/-!\n# Formalization of the nine-point triangle-parity problem\n\nThe plane is represented by `ℝ × ℝ`. A triangle is represented by the\n(unordered) three-element `Finset` of its vertices. A point lies in the\nstrict interior of a triangle exactly when it has three strictly positive\nbarycentric coordinates with respect to the triangle's vertices.\n-/\n\nnamespace Problem\n\n/-- A point of the Euclidean plane, in Cartesian coordinates. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- The determinant test for collinearity of three points in `ℝ × ℝ`. -/\ndef Collinear (A : Point) (B : Point) (C : Point) : Prop :=\n (B.1 - A.1) * (C.2 - A.2) - (B.2 - A.2) * (C.1 - A.1) = 0\n\n/-- A point is strictly inside triangle `ABC` when `ABC` is nondegenerate and\nthe point has three strictly positive barycentric coordinates summing to one. -/\ndef StrictlyInsideTriangle (P : Point) (A : Point) (B : Point) (C : Point) : Prop :=\n ¬ Collinear A B C ∧\n ∃ α : ℝ, ∃ β : ℝ, ∃ γ : ℝ,\n 0 < α ∧ 0 < β ∧ 0 < γ ∧ α + β + γ = 1 ∧\n P = (α * A.1 + β * B.1 + γ * C.1,\n α * A.2 + β * B.2 + γ * C.2)\n\n/-- A three-element vertex set `T` contains `P` in the strict interior of the\ntriangle formed by its vertices. -/\ndef TriangleContainsPoint (P : Point) (T : Finset Point) : Prop :=\n T.card = 3 ∧\n ∃ A : Point, A ∈ T ∧\n ∃ B : Point, B ∈ T ∧\n ∃ C : Point, C ∈ T ∧\n A ≠ B ∧ A ≠ C ∧ B ≠ C ∧ StrictlyInsideTriangle P A B C\n\n/-- The unordered triangles with vertices in `S \\ {P}` that strictly contain\n`P` in their interior. -/\nnoncomputable def trianglesContaining (S : Finset Point) (P : Point) : Finset (Finset Point) := by\n classical\n exact ((S.erase P).powersetCard 3).filter (fun T : Finset Point =>\n TriangleContainsPoint P T)\n\n/-- The number of triangles with vertices among the other points of `S` that\nstrictly contain `P` in their interior. -/\nnoncomputable def triangleCount (S : Finset Point) (P : Point) : ℕ :=\n (trianglesContaining S P).card\n\n/-- No three distinct points of `S` are collinear. -/\ndef NoThreeCollinear (S : Finset Point) : Prop :=\n ∀ A : Point, A ∈ S →\n ∀ B : Point, B ∈ S →\n ∀ C : Point, C ∈ S →\n A ≠ B → A ≠ C → B ≠ C → ¬ Collinear A B C\n\n/-- The assertion of the problem: for every nine-element set of points in the\nplane in general position, and for every point `P` of the set, the number of\ntriangles formed by the other eight points and containing `P` in their strict\ninterior is even. -/\ndef Target : Prop :=\n ∀ S : Finset Point,\n S.card = 9 →\n NoThreeCollinear S →\n ∀ P : Point, P ∈ S → Even (triangleCount S P)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c2d90640-d0dd-5489-9c83-30bfeb976424", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2b29bb4b24b0ab44d7283e8f133b92d40ee529d9676623151f87e877cbe28d64", "task_path": "tasks/nmp3_c2d90640-d0dd-5489-9c83-30bfeb976424", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c2d90640-d0dd-5489-9c83-30bfeb976424", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c2e2ace7-5c8e-592d-842e-e87ab5428e16", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an isosceles triangle with $AC=BC$. Let $N$ be a point inside the triangle such that $2\\angle ANB=180^\\circ+\\angle ACB$. Let $D$ be the intersection of line $BN$ with the line through $C$ parallel to $AN$. Let $P$ be the intersection of the angle bisectors of $\\angle CAN$ and $\\angle ABN$. Prove that $DP\\perp AN\\,. $\n/-\nFormalization of the geometry problem in `problem.md`.\n\nThe ambient plane is the real Euclidean plane `EuclideanSpace ℝ (Fin 2)`.\nUndirected angles are Mathlib's real-valued radian angles. The equation\n`2 ∠ANB = 180° + ∠ACB` is therefore written as\n`2 * ∠ANB = Real.pi + ∠ACB`.\n\nNo proof of the target is supplied here: `Problem.Target` is a proposition.\n-/\n\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.InnerProductSpace.Orthogonal\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.LinearAlgebra.AffineSpace.Independent\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean plane. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A nondegenerate triangle: its three vertices are affinely independent. -/\ndef IsNondegenerateTriangle (A B C : Point) : Prop :=\n AffineIndependent ℝ ![A, B, C]\n\n/-- The triangle is isosceles with `AC = BC`. -/\ndef IsIsoscelesAtC (A B C : Point) : Prop :=\n dist A C = dist B C\n\n/-- `N` is strictly inside the (nondegenerate) triangle with vertices `A`, `B`, `C`.\nThis is expressed by positive barycentric coordinates summing to one. -/\ndef IsStrictlyInsideTriangle (A B C N : Point) : Prop :=\n ∃ a b c : ℝ,\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 1 ∧\n N = a • A + b • B + c • C\n\n/-- The given condition on the angles, with `180°` represented by `Real.pi` radians. -/\ndef AngleCondition (A B C N : Point) : Prop :=\n (2 : ℝ) * EuclideanGeometry.angle A N B =\n Real.pi + EuclideanGeometry.angle A C B\n\n/-- The internal angle-bisector ray of `∠ x y z`, based at `y`. A point belongs\nto it when it lies in the cone on the two sides of the angle and makes equal\nundirected angles with those two sides. The vertex `y` itself is included. -/\ndef internalAngleBisectorRay (x y z : Point) : Set Point :=\n {p : Point |\n p = y ∨\n (EuclideanGeometry.angle x y p = EuclideanGeometry.angle p y z ∧\n ∃ a b : ℝ,\n 0 ≤ a ∧ 0 ≤ b ∧ (0 < a ∨ 0 < b) ∧\n p -ᵥ y = a • (x -ᵥ y) + b • (z -ᵥ y))}\n\n/-- `X` is the unique intersection point of two sets of points. -/\ndef IsUniqueSetIntersection (X : Point) (s t : Set Point) : Prop :=\n X ∈ s ∧ X ∈ t ∧ ∀ Y : Point, Y ∈ s → Y ∈ t → Y = X\n\n/-- `X` is the unique intersection point of two affine lines. -/\ndef IsUniqueAffineLineIntersection (X : Point)\n (l₁ l₂ : AffineSubspace ℝ Point) : Prop :=\n X ∈ l₁ ∧ X ∈ l₂ ∧ ∀ Y : Point, Y ∈ l₁ → Y ∈ l₂ → Y = X\n\n/-- The line through `C` with the same direction as the line `AN`,\nso it is parallel to `AN`. -/\ndef parallelLineThroughC (C A N : Point) : AffineSubspace ℝ Point :=\n AffineSubspace.mk' C ((line[ℝ, A, N]).direction)\n\n/-- `D` is the intersection of line `BN` with the line through `C` parallel to `AN`. -/\ndef IsIntersectionBNAndParallelThroughC (D A B C N : Point) : Prop :=\n IsUniqueAffineLineIntersection D (line[ℝ, B, N]) (parallelLineThroughC C A N)\n\n/-- `P` is the intersection of the internal angle bisectors of `∠CAN` and `∠ABN`. -/\ndef IsIntersectionOfAngleBisectors (P A B C N : Point) : Prop :=\n IsUniqueSetIntersection P (internalAngleBisectorRay C A N)\n (internalAngleBisectorRay A B N)\n\n/-- The lines `DP` and `AN` are perpendicular. Nondegeneracy of both pairs of\npoints is included explicitly so that the statement concerns genuine lines. -/\ndef DPPerpendicularAN (D P A N : Point) : Prop :=\n D ≠ P ∧ A ≠ N ∧\n Submodule.IsOrtho ((line[ℝ, D, P]).direction) ((line[ℝ, A, N]).direction)\n\n/-- The complete formal statement of the problem. -/\ndef Target : Prop :=\n ∀ A B C N D P : Point,\n IsNondegenerateTriangle A B C →\n IsIsoscelesAtC A B C →\n IsStrictlyInsideTriangle A B C N →\n AngleCondition A B C N →\n IsIntersectionBNAndParallelThroughC D A B C N →\n IsIntersectionOfAngleBisectors P A B C N →\n DPPerpendicularAN D P A N\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c2e2ace7-5c8e-592d-842e-e87ab5428e16", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ad914150c632cf8fa550d8ece8e823e9b365446ac84c5d8058e8ff3081319783", "task_path": "tasks/nmp3_c2e2ace7-5c8e-592d-842e-e87ab5428e16", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c2e2ace7-5c8e-592d-842e-e87ab5428e16", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c2e6e82c-cc0a-55b8-b249-3bacbdd4b65b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a triangle $ABC$, let the semicircles with diameters $BC$, $CA$, and $AB$ be drawn on the respective sides. Let the altitudes $AD$, $BE$, $CF$ intersect these semicircles at points $Z$, $M$, $N$, where $Z$ lies inside $\\triangle ABC$ and $M,N$ lie outside it. Define \n-- $$M' = AB\\cap ZM,\\qquad N' = AC\\cap ZN,$$ \n-- and let $K$ be the intersection of $MN'$ and $M'N$. Prove that $$KM = KN\\,. $$\nimport Mathlib\n\n/-!\n# Formal statement of a planar geometry problem\n\nThe problem is stated in Euclidean plane coordinates. All geometric\npredicates used below are defined explicitly; no theorem is assumed.\n-/\n\nnamespace Problem\n\n/-- A point in the real Euclidean plane. -/\nstructure Point where\n x : ℝ\n y : ℝ\n\nnamespace Point\n\n/-- Difference of two points, regarded as a vector. -/\ndef sub (P Q : Point) : Point :=\n ⟨P.x - Q.x, P.y - Q.y⟩\n\n/-- Affine combination with coefficients that are intended to sum to one. -/\ndef affine (α β γ : ℝ) (A B C : Point) : Point :=\n ⟨α * A.x + β * B.x + γ * C.x,\n α * A.y + β * B.y + γ * C.y⟩\n\nend Point\n\n/-- The two-dimensional cross product (oriented area determinant). -/\ndef cross (P Q : Point) : ℝ :=\n P.x * Q.y - P.y * Q.x\n\n/-- The Euclidean dot product. -/\ndef dot (P Q : Point) : ℝ :=\n P.x * Q.x + P.y * Q.y\n\n/-- Three points are collinear. Degenerate choices are allowed, but the\nmathematical hypotheses below exclude the ones that would make a line\nundefined. -/\ndef Collinear (P Q R : Point) : Prop :=\n cross (Point.sub Q P) (Point.sub R P) = 0\n\n/-- The lines `PQ` and `RS` are perpendicular. -/\ndef Perpendicular (P Q R S : Point) : Prop :=\n dot (Point.sub Q P) (Point.sub S R) = 0\n\n/-- The lines `PQ` and `RS` are parallel (possibly degenerate). -/\ndef Parallel (P Q R S : Point) : Prop :=\n cross (Point.sub Q P) (Point.sub S R) = 0\n\n/-- `X` lies on the line through `P` and `Q`. -/\ndef OnLine (P Q X : Point) : Prop :=\n Collinear P Q X\n\n/-- The unique intersection of the nonparallel lines `PQ` and `RS` is `X`.\nThe nonparallel condition also excludes the case where either displayed line\nhas coincident defining points. -/\ndef IsLineIntersection (P Q R S X : Point) : Prop :=\n Collinear P Q X ∧ Collinear R S X ∧ ¬ Parallel P Q R S\n\n/-- `D` is the foot of the altitude from `A` to the line `BC`. -/\ndef AltitudeFoot (A B C D : Point) : Prop :=\n Collinear B C D ∧ Perpendicular A D B C\n\n/-- A triangle has three noncollinear vertices. -/\ndef NondegenerateTriangle (A B C : Point) : Prop :=\n ¬ Collinear A B C\n\n/-- Strict interior of the triangle with vertices `A`, `B`, and `C`, written\nusing positive barycentric coordinates. -/\ndef InsideTriangle (A B C X : Point) : Prop :=\n ∃ α β γ : ℝ,\n 0 < α ∧ 0 < β ∧ 0 < γ ∧ α + β + γ = 1 ∧\n X = Point.affine α β γ A B C\n\n/-- Closed triangle, including its sides. -/\ndef InClosedTriangle (A B C X : Point) : Prop :=\n ∃ α β γ : ℝ,\n 0 ≤ α ∧ 0 ≤ β ∧ 0 ≤ γ ∧ α + β + γ = 1 ∧\n X = Point.affine α β γ A B C\n\n/-- Strict exterior of the triangle: not even on its boundary. -/\ndef OutsideTriangle (A B C X : Point) : Prop :=\n ¬ InClosedTriangle A B C X\n\n/-- Squared Euclidean distance, used to avoid an unnecessary square-root\ninterface. -/\ndef sqDistance (P Q : Point) : ℝ :=\n (P.x - Q.x) ^ 2 + (P.y - Q.y) ^ 2\n\n/-- Euclidean distance. -/\nnoncomputable def distance (P Q : Point) : ℝ :=\n Real.sqrt (sqDistance P Q)\n\n/-- `X` lies on the circle having `P Q` as a diameter. -/\ndef OnCircleWithDiameter (P Q X : Point) : Prop :=\n dot (Point.sub X P) (Point.sub X Q) = 0\n\n/-- `X` is on the same side of line `PQ` as `R`, or on line `PQ` itself. -/\ndef SameClosedHalfPlane (P Q R X : Point) : Prop :=\n 0 ≤ cross (Point.sub Q P) (Point.sub X P) *\n cross (Point.sub Q P) (Point.sub R P)\n\n/-- A closed semicircular arc with diameter `PQ`, regarded as a set of points.\nThe witness `R` off line `PQ` selects one of the two possible semicircles. -/\ndef IsSemicircleWithDiameter (P Q : Point) (s : Set Point) : Prop :=\n ∃ R : Point,\n ¬ Collinear P Q R ∧\n s = {X : Point | OnCircleWithDiameter P Q X ∧ SameClosedHalfPlane P Q R X}\n\n/-- The formal target: for every admissible triangle and every choice of the\nthree drawn semicircles, if the altitude intersections, the two auxiliary\npoints, and `K` are as in the statement, then `KM = KN`. -/\ndef Target : Prop :=\n ∀ (A B C D E F Z M N M' N' K : Point)\n (sBC sCA sAB : Set Point),\n NondegenerateTriangle A B C →\n AltitudeFoot A B C D →\n AltitudeFoot B C A E →\n AltitudeFoot C A B F →\n IsSemicircleWithDiameter B C sBC →\n IsSemicircleWithDiameter C A sCA →\n IsSemicircleWithDiameter A B sAB →\n Z ∈ sBC →\n M ∈ sCA →\n N ∈ sAB →\n OnLine A D Z →\n OnLine B E M →\n OnLine C F N →\n InsideTriangle A B C Z →\n OutsideTriangle A B C M →\n OutsideTriangle A B C N →\n IsLineIntersection A B Z M M' →\n IsLineIntersection A C Z N N' →\n IsLineIntersection M N' M' N K →\n distance K M = distance K N\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c2e6e82c-cc0a-55b8-b249-3bacbdd4b65b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d756a9709744a60ff5125b2679b4e9bf87ed120536f1af3c8256fd894789ed66", "task_path": "tasks/nmp3_c2e6e82c-cc0a-55b8-b249-3bacbdd4b65b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c2e6e82c-cc0a-55b8-b249-3bacbdd4b65b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c3564393-08f7-5e1e-bcbf-7c60ef1a3a19", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive numbers satisfying $x+y+z=1$. Define \n-- $$a=\\sqrt{x^{2}+xy+y^{2}},\\qquad b=\\sqrt{y^{2}+yz+z^{2}},\\qquad c=\\sqrt{z^{2}+zx+x^{2}}.$$ \n-- Prove that \n-- $$ab+bc+ca\\ge1.$$\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for `problem.md`\n\nLet `x, y, z` be positive real numbers with `x + y + z = 1`.\nDefine\n`a = sqrt (x^2 + x*y + y^2)`,\n`b = sqrt (y^2 + y*z + z^2)`, and\n`c = sqrt (z^2 + z*x + x^2)`.\nThe target asserts `ab + bc + ca ≥ 1`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The quantity `a = sqrt (x^2 + x*y + y^2)` from the problem. -/\ndef a (x y : ℝ) : ℝ :=\n Real.sqrt (x ^ 2 + x * y + y ^ 2)\n\n/-- The quantity `b = sqrt (y^2 + y*z + z^2)` from the problem. -/\ndef b (y z : ℝ) : ℝ :=\n Real.sqrt (y ^ 2 + y * z + z ^ 2)\n\n/-- The quantity `c = sqrt (z^2 + z*x + x^2)` from the problem. -/\ndef c (z x : ℝ) : ℝ :=\n Real.sqrt (z ^ 2 + z * x + x ^ 2)\n\n/-- The assertion to be proved: for all positive real `x, y, z` with sum `1`,\nthe quantities `a`, `b`, and `c` defined from them satisfy `ab + bc + ca ≥ 1`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x + y + z = 1 →\n 1 ≤ a x y * b y z + b y z * c z x + c z x * a x y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c3564393-08f7-5e1e-bcbf-7c60ef1a3a19", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "946cc7f58a589d3f8d9ccd7d023740c3613c0e5342bc405d9304f1e009317f45", "task_path": "tasks/nmp3_c3564393-08f7-5e1e-bcbf-7c60ef1a3a19", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c3564393-08f7-5e1e-bcbf-7c60ef1a3a19", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c3afaf7e-49c3-5a2b-812f-c525da556762", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers. Prove that \n-- \\[\n-- \\bigl(x+y+z\\bigr)\\Bigl(\\frac1x+\\frac1y+\\frac1z\\Bigr)\\ge 9+\\sqrt[3]{\\frac{54\\,(x-y)^2\\,(y-z)^2\\,(z-x)^2}{x^2y^2z^2}}\\,.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\nnamespace Problem\n\n/-- The left-hand side of the claimed inequality:\n`(x + y + z) * (1/x + 1/y + 1/z)`. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n (x + y + z) * ((1 : ℝ) / x + (1 : ℝ) / y + (1 : ℝ) / z)\n\n/-- The radicand in the claimed inequality:\n`54 * (x-y)^2 * (y-z)^2 * (z-x)^2 / (x^2 * y^2 * z^2)`. -/\nnoncomputable def radicand (x y z : ℝ) : ℝ :=\n (54 : ℝ) * (x - y) ^ (2 : ℕ) * (y - z) ^ (2 : ℕ) *\n (z - x) ^ (2 : ℕ) /\n (x ^ (2 : ℕ) * y ^ (2 : ℕ) * z ^ (2 : ℕ))\n\n/-- The real cube root, represented using real exponent one third.\nOn the nonnegative radicand occurring in the problem, this is the usual\nprincipal real cube root. -/\nnoncomputable def cubeRoot (a : ℝ) : ℝ :=\n Real.rpow a (1 / 3 : ℝ)\n\n/-- The assertion from the problem: for all positive real numbers `x`, `y`,\nand `z`, `(x + y + z) * (1/x + 1/y + 1/z)` is at least\n`9 + cbrt(54 * (x-y)^2 * (y-z)^2 * (z-x)^2 / (x^2 * y^2 * z^2))`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z →\n lhs x y z ≥ (9 : ℝ) + cubeRoot (radicand x y z)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c3afaf7e-49c3-5a2b-812f-c525da556762", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a56f69174a3211502814b695a682434dd1df8fce5abc930afa209f608fb74469", "task_path": "tasks/nmp3_c3afaf7e-49c3-5a2b-812f-c525da556762", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c3afaf7e-49c3-5a2b-812f-c525da556762", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c3bcdaa5-3954-5cd1-bccf-5e033c5ae821", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be positive real numbers such that $abcd=1$. Prove that \n-- \\[\n-- \\frac1a+\\frac1b+\\frac1c+\\frac1d+\\frac9{a+b+c+d}\\ge\\frac{25}{4}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThis module states the inequality problem from `problem.md`. It intentionally\ncontains only the formal proposition, not a proof.\n-/\n\nnamespace Problem\n\n/-- The complete assertion: for all positive real numbers `a`, `b`, `c`, and\n`d` whose product is one, the displayed sum is at least `25 / 4`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d →\n a * b * c * d = 1 →\n (1 / a + 1 / b + 1 / c + 1 / d + 9 / (a + b + c + d) ≥ (25 : ℝ) / 4)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c3bcdaa5-3954-5cd1-bccf-5e033c5ae821", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0e9d2c2f96462f2877832dd2937f11c2db515bed9ed5cc9c98f79fb6e45de75f", "task_path": "tasks/nmp3_c3bcdaa5-3954-5cd1-bccf-5e033c5ae821", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c3bcdaa5-3954-5cd1-bccf-5e033c5ae821", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c3cead71-ec40-5241-a786-517a2b3f97de", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a (non‑degenerate) triangle with angles $A$, $B$, $C$. Prove that \n-- \\[\n-- \\frac{\\sin\\frac{A}{2}+\\sin\\frac{B}{2}+\\sin\\frac{C}{2}}{1+\\sin\\frac{A}{2}\\sin\\frac{B}{2}\\sin\\frac{C}{2}}<\\sqrt2\\;.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The real numbers `A`, `B`, and `C` are the angle measures, in radians, of a\nnon-degenerate Euclidean triangle: each is strictly positive and their sum is\n`π`. Every such ordered triple is realized by a non-degenerate triangle, and\nconversely every non-degenerate triangle has such angle measures. -/\ndef NondegenerateTriangleAngles (A B C : ℝ) : Prop :=\n 0 < A ∧ 0 < B ∧ 0 < C ∧ A + B + C = Real.pi\n\n/-- The assertion of the problem: for every non-degenerate triangle, with angle\nmeasures `A`, `B`, and `C` in radians, the displayed quotient is strictly less\nthan `sqrt 2`. -/\nnoncomputable def Target : Prop :=\n ∀ (A B C : ℝ),\n NondegenerateTriangleAngles A B C →\n (Real.sin (A / (2 : ℝ)) + Real.sin (B / (2 : ℝ)) +\n Real.sin (C / (2 : ℝ))) /\n ((1 : ℝ) + Real.sin (A / (2 : ℝ)) * Real.sin (B / (2 : ℝ)) *\n Real.sin (C / (2 : ℝ))) <\n Real.sqrt (2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c3cead71-ec40-5241-a786-517a2b3f97de", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cd49aaaa95292000641c5b3b17a90d3a0ac0cda0f5af4a39d3721d3308a7ac14", "task_path": "tasks/nmp3_c3cead71-ec40-5241-a786-517a2b3f97de", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c3cead71-ec40-5241-a786-517a2b3f97de", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c3f4d746-7962-5713-b8c4-9b55cea49a0f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose that $a,b,c$ are positive real numbers. Prove that \n-- \\[\n-- \\sqrt{\\frac{2a}{\\,b+c\\,}}+\\sqrt{\\frac{2b}{\\,c+a\\,}}+\\sqrt{\\frac{2c}{\\,a+b\\,}}\\le \\sqrt{3\\Big(\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\Big)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nThe problem asks to prove, for every triple of positive real numbers `a`, `b`, `c`,\nthe inequality\n`sqrt (2*a/(b+c)) + sqrt (2*b/(c+a)) + sqrt (2*c/(a+b))\n ≤ sqrt (3*(a/b + b/c + c/a))`.\n\nThis file only formalizes the assertion; it does not provide a proof.\n-/\n\nnamespace Problem\n\n/-- The inequality asserted in the problem, for a fixed positive triple of reals. -/\ndef Inequality (a b c : ℝ) : Prop :=\n Real.sqrt ((2 : ℝ) * a / (b + c)) +\n Real.sqrt ((2 : ℝ) * b / (c + a)) +\n Real.sqrt ((2 : ℝ) * c / (a + b)) ≤\n Real.sqrt (3 * (a / b + b / c + c / a))\n\n/-- The complete problem assertion: for all positive reals `a`, `b`, and `c`,\nthe stated square-root inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c3f4d746-7962-5713-b8c4-9b55cea49a0f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "281aad098fb5e4373887a88e2b3ff6377c639c34e170f70abd879baf2164f4c8", "task_path": "tasks/nmp3_c3f4d746-7962-5713-b8c4-9b55cea49a0f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c3f4d746-7962-5713-b8c4-9b55cea49a0f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c41da3bd-5842-5d31-bb76-eb2050e40edc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\ge 0\\) (with \\(b+c>0,\\;c+a>0,\\;a+b>0\\)). Prove that \n-- \\[\n-- \\frac{2a^{2}+5bc}{(b+c)^{2}}+\\frac{2b^{2}+5ca}{(c+a)^{2}}+\\frac{2c^{2}+5ab}{(a+b)^{2}}\\ge\\frac{21}{4}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, `c`\nsatisfying the three nontrivial pair-sum conditions, the cyclic inequality\nwith right-hand side `21 / 4`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (2 * a ^ 2 + 5 * b * c) / (b + c) ^ 2 +\n (2 * b ^ 2 + 5 * c * a) / (c + a) ^ 2 +\n (2 * c ^ 2 + 5 * a * b) / (a + b) ^ 2\n\n/-- The assertion to be proved: the stated cyclic inequality holds for all\nnonnegative real triples for which all three denominators are positive. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n b + c > 0 → c + a > 0 → a + b > 0 →\n lhs a b c ≥ (21 : ℝ) / 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c41da3bd-5842-5d31-bb76-eb2050e40edc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6a40d4378908f9dc186dae36bdf3bb14459d51d5e238977895941a3e2b8ae85f", "task_path": "tasks/nmp3_c41da3bd-5842-5d31-bb76-eb2050e40edc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c41da3bd-5842-5d31-bb76-eb2050e40edc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c45d311e-285e-5a56-bc07-10fa1687f4da", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exist infinitely many natural numbers $n$ such that $(n^2+1)\\nmid n!$, i.e. $n!$ is not divisible by $n^2+1$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The natural numbers `n` for which `n^2 + 1` does not divide `n!`. -/\ndef Admissible (n : ℕ) : Prop :=\n ¬ ((n ^ 2 + 1) ∣ Nat.factorial n)\n\n/-- There are infinitely many natural numbers `n` such that `n^2 + 1` does not\ndivide `n!`. -/\ndef Target : Prop :=\n Set.Infinite {n : ℕ | Admissible n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c45d311e-285e-5a56-bc07-10fa1687f4da", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c7c53e3652a73cf4629bd17ea626b7e8ec5420d24a8257d2c25bafa8eb04320f", "task_path": "tasks/nmp3_c45d311e-285e-5a56-bc07-10fa1687f4da", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c45d311e-285e-5a56-bc07-10fa1687f4da", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c496158c-1f35-59fd-bcca-53239d6d50eb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In a convex pentagon $ABCDE$, assume $\\angle ABC = \\angle ADE$ and $\\angle AEC = \\angle ADB$. Prove that $\\angle BAC = \\angle DAE$.\n/-\nFormal statement for the convex-pentagon angle problem.\n\nThe original problem asks to prove an equality of three-point angles in a convex\npentagon. This file only records the statement as propositions; it intentionally\ncontains no proof of the target.\n-/\n\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Analysis.InnerProductSpace.PiL2\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used for all points in the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The two-dimensional cross product (determinant) of two plane vectors. -/\ndef cross (u v : Plane) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- The five listed vertices as a function indexed by `Fin 5`. -/\ndef pentagonVertex (A B C D E : Plane) : Fin 5 → Plane := ![A, B, C, D, E]\n\n/--\nThe condition that `A B C D E` is a strictly convex pentagon traversed\ncounterclockwise. For each directed side, every non-endpoint vertex lies\nstrictly to the left of that side.\n-/\ndef IsCCWConvexPentagon (A B C D E : Plane) : Prop :=\n ∀ i j : Fin 5, j ≠ i → j ≠ finRotate 5 i →\n 0 < cross\n (pentagonVertex A B C D E (finRotate 5 i) - pentagonVertex A B C D E i)\n (pentagonVertex A B C D E j - pentagonVertex A B C D E i)\n\n/--\nThe condition that `A B C D E` is a strictly convex pentagon traversed\nclockwise. For each directed side, every non-endpoint vertex lies strictly\nto the right of that side.\n-/\ndef IsCWConvexPentagon (A B C D E : Plane) : Prop :=\n ∀ i j : Fin 5, j ≠ i → j ≠ finRotate 5 i →\n cross\n (pentagonVertex A B C D E (finRotate 5 i) - pentagonVertex A B C D E i)\n (pentagonVertex A B C D E j - pentagonVertex A B C D E i) < 0\n\n/-- The five named vertices of the pentagon are pairwise distinct. -/\ndef PentagonVerticesDistinct (A B C D E : Plane) : Prop :=\n Function.Injective (pentagonVertex A B C D E)\n\n/--\n`A B C D E` is a convex pentagon, with the vertices in the listed cyclic order.\nThe vertices are required to be pairwise distinct. The disjunction allows\neither orientation, since the original wording does not distinguish clockwise\nfrom counterclockwise. The side-support inequalities formalize strict\nconvexity and nondegeneracy.\n-/\ndef ConvexPentagon (A B C D E : Plane) : Prop :=\n PentagonVerticesDistinct A B C D E ∧\n (IsCCWConvexPentagon A B C D E ∨ IsCWConvexPentagon A B C D E)\n\n/-- The first angle hypothesis of the problem: `∠ABC = ∠ADE`. -/\ndef FirstAngleEquality (A B C D E : Plane) : Prop :=\n EuclideanGeometry.angle A B C = EuclideanGeometry.angle A D E\n\n/-- The second angle hypothesis of the problem: `∠AEC = ∠ADB`. -/\ndef SecondAngleEquality (A B C D E : Plane) : Prop :=\n EuclideanGeometry.angle A E C = EuclideanGeometry.angle A D B\n\n/-- The conclusion requested by the problem: `∠BAC = ∠DAE`. -/\ndef DesiredAngleEquality (A B C D E : Plane) : Prop :=\n EuclideanGeometry.angle B A C = EuclideanGeometry.angle D A E\n\n/-- All hypotheses of the problem, including convexity and the two angle equalities. -/\ndef Hypotheses (A B C D E : Plane) : Prop :=\n ConvexPentagon A B C D E ∧\n FirstAngleEquality A B C D E ∧\n SecondAngleEquality A B C D E\n\n/--\nThe full statement: for every convex pentagon `ABCDE`, if `∠ABC = ∠ADE` and\n`∠AEC = ∠ADB`, then `∠BAC = ∠DAE`.\n-/\ndef Target : Prop :=\n ∀ A B C D E : Plane, Hypotheses A B C D E → DesiredAngleEquality A B C D E\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c496158c-1f35-59fd-bcca-53239d6d50eb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fd5255b540d408e7870438406347bc924b4a9d86ec050256d0099ed9dd9d0a91", "task_path": "tasks/nmp3_c496158c-1f35-59fd-bcca-53239d6d50eb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c496158c-1f35-59fd-bcca-53239d6d50eb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c4a94526-7d16-5172-8935-14a3cf5616d0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers satisfying $ab+bc+ca=3$. Prove that \n-- \\[\n-- \\frac{1}{\\sqrt{1+a^{2}}}+\\frac{1}{\\sqrt{1+b^{2}}}\\ge \\frac{1}{\\sqrt{1+c^{2}}}\\,. \n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the inequality problem in `problem.md`.\n\nThe problem asks to prove, for all positive real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca = 3`, that\n`1 / sqrt (1 + a^2) + 1 / sqrt (1 + b^2) ≥ 1 / sqrt (1 + c^2)`.\nNo proof is supplied here: `Target` is the proposition to be proved.\n-/\n\nnamespace Problem\n\n/-- The proposition stated in the source problem: for all positive reals\n`a`, `b`, and `c` with `ab + bc + ca = 3`, the stated sum of reciprocal\nsquare roots is at least the third reciprocal square root. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b + b * c + c * a = 3 →\n 1 / Real.sqrt (1 + a ^ 2)\n + 1 / Real.sqrt (1 + b ^ 2)\n ≥ 1 / Real.sqrt (1 + c ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c4a94526-7d16-5172-8935-14a3cf5616d0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e24e7c9450aafd07904fc76da20d0499a1def3f18fac57ed60125e47bf28b75d", "task_path": "tasks/nmp3_c4a94526-7d16-5172-8935-14a3cf5616d0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c4a94526-7d16-5172-8935-14a3cf5616d0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c4c077aa-dd1b-5aa5-aa9f-71f6588b61c0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a$, $b$, $c$ are positive real numbers, prove that \n-- \\[\n-- \\frac{4(a^{2}+b^{2}+c^{2})}{(a+b+c)^{2}}+\\frac{ab}{a^{2}+ab+b^{2}}+\\frac{bc}{b^{2}+bc+c^{2}}+\\frac{ca}{c^{2}+ca+a^{2}}\\ge\\frac{7}{3}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the proposed real inequality\n\nThe source problem asks one to prove an inequality for three positive real\nnumbers. We separate the left-hand side into its four summands so that the\nformal statement and its clause-by-clause alignment are explicit.\n-/\n\nnamespace Problem\n\n/-- The first summand:\n`4 * (a ^ 2 + b ^ 2 + c ^ 2) / (a + b + c) ^ 2`.\n\nThe division is the ordinary division operation on `ℝ`; in the target all\ndenominators are nonzero because `a`, `b`, and `c` are assumed positive. -/\nnoncomputable def sumSquaresTerm (a b c : ℝ) : ℝ :=\n (4 * (a ^ 2 + b ^ 2 + c ^ 2)) / (a + b + c) ^ 2\n\n/-- The second summand `a * b / (a ^ 2 + a * b + b ^ 2)`. -/\nnoncomputable def abTerm (a b : ℝ) : ℝ :=\n (a * b) / (a ^ 2 + a * b + b ^ 2)\n\n/-- The third summand `b * c / (b ^ 2 + b * c + c ^ 2)`. -/\nnoncomputable def bcTerm (b c : ℝ) : ℝ :=\n (b * c) / (b ^ 2 + b * c + c ^ 2)\n\n/-- The fourth summand `c * a / (c ^ 2 + c * a + a ^ 2)`. -/\nnoncomputable def caTerm (c a : ℝ) : ℝ :=\n (c * a) / (c ^ 2 + c * a + a ^ 2)\n\n/-- The complete left-hand side of the displayed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n sumSquaresTerm a b c + abTerm a b + bcTerm b c + caTerm c a\n\n/-- Admissibility of the parameters: `a`, `b`, and `c` are positive real\nnumbers. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The assertion of the problem: for every three positive real numbers\n`a`, `b`, and `c`, the displayed left-hand side is at least `7 / 3`.\n\nThis is a proposition-valued declaration; no proof is supplied at the\nstatement-formalization stage. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ (7 : ℝ) / 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c4c077aa-dd1b-5aa5-aa9f-71f6588b61c0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "487bd6605b095fa9be402da7d1137e7530d9b4e8275f79dae7f14b0320698c50", "task_path": "tasks/nmp3_c4c077aa-dd1b-5aa5-aa9f-71f6588b61c0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c4c077aa-dd1b-5aa5-aa9f-71f6588b61c0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c4de9ecf-f2ba-5548-8353-aebfa7407b63", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for every prime number $p$ and for every integer $r$, there exists a non‑negative integer $n$ such that \n-- \\[\n-- \\binom{2n}{n}\\equiv r\\pmod p.\n-- \\]\nimport Mathlib.Data.Int.ModEq\nimport Mathlib.Data.Nat.Choose.Basic\nimport Mathlib.Data.Nat.Prime.Basic\n\n/-!\n# Central binomial coefficients modulo primes\n\nThe source problem asserts that every residue class modulo every prime is\nrepresented by a central binomial coefficient `C(2 * n, n)` for some\nnon-negative integer `n`.\n-/\n\nnamespace Problem\n\n/--\nFor every prime `p` and every integer `r`, there exists a non-negative integer\n`n` such that the central binomial coefficient `C(2 * n, n)` is congruent to\n`r` modulo `p`.\n-/\ndef Target : Prop :=\n ∀ (p : ℕ), Nat.Prime p → ∀ (r : ℤ),\n ∃ (n : ℕ), (Nat.choose (2 * n) n : ℤ) ≡ r [ZMOD (p : ℤ)]\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c4de9ecf-f2ba-5548-8353-aebfa7407b63", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3f9f3e4f0a6b3f16ee7da7740dc874257436551715382226b1be0fe05ef3f5a2", "task_path": "tasks/nmp3_c4de9ecf-f2ba-5548-8353-aebfa7407b63", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c4de9ecf-f2ba-5548-8353-aebfa7407b63", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c520eb07-e3fe-5842-8ba9-0fc47dcf7938", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ be real numbers such that $ab+bc+ca>0$. Prove that \n-- \\[\n-- \\frac{a^2+bc}{b^2+c^2}+\\frac{b^2+ca}{c^2+a^2}+\\frac{c^2+ab}{a^2+b^2}\\ge\\frac52\\,. \n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\nnoncomputable section\n\n/-- Admissibility assumptions from the problem: `a`, `b`, and `c` are\nnonnegative real numbers and satisfy `ab + bc + ca > 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a * b + b * c + c * a\n\n/-- The left-hand side of the inequality in the problem. -/\ndef SumExpression (a b c : ℝ) : ℝ :=\n (a ^ 2 + b * c) / (b ^ 2 + c ^ 2) +\n (b ^ 2 + c * a) / (c ^ 2 + a ^ 2) +\n (c ^ 2 + a * b) / (a ^ 2 + b ^ 2)\n\n/-- The asserted lower bound on `SumExpression`. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n (5 : ℝ) / 2 ≤ SumExpression a b c\n\n/-- The complete mathematical assertion of the problem. The universal\nquantifiers bind the universally quantified real numbers described in the\nproblem, and `Admissible` collects the stated side conditions. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Conclusion a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c520eb07-e3fe-5842-8ba9-0fc47dcf7938", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "611b090353770fcf897bf2ebb0c98ee496bfe56de848ffb3de0a4b8cfce5efc2", "task_path": "tasks/nmp3_c520eb07-e3fe-5842-8ba9-0fc47dcf7938", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c520eb07-e3fe-5842-8ba9-0fc47dcf7938", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c52a21c9-aa84-5ee4-a8b0-9264b6e429c9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be a positive integer. Define a sequence $(a_n)_{n\\ge1}$ by the condition that for every positive integer $n$,\n-- \\[\n-- \\sum_{d\\mid n} a_d = p^{\\,n}.\n-- \\]\n-- Prove that for each natural number $n$, the term $a_n$ is divisible by $n$ (i.e. $n\\mid a_n$).\nimport Mathlib.NumberTheory.Divisors\n\n/-!\n# Formalization of the divisor-sum sequence problem\n\nThe source problem considers a positive integer `p` and the sequence\n`(a_n)_{n ≥ 1}` determined by\n\n`∑_{d ∣ n} a_d = p^n` for every positive integer `n`,\n\nand asks to prove that `n ∣ a_n` for every positive natural number `n`.\n-/\n\nnamespace Problem\n\n/-- A positive integer parameter, represented by a natural number with a positivity proof. -/\ndef PositiveInteger (p : ℕ) : Prop :=\n 0 < p\n\n/-- The condition defining the sequence over its intended positive indices. The value at `0`\nis irrelevant; no equation is imposed there because the original sequence starts at `n = 1`. -/\ndef DivisorSumCondition (p : ℕ) (a : ℕ → ℤ) : Prop :=\n ∀ n : ℕ, 0 < n → ∑ d ∈ Nat.divisors n, a d = (p : ℤ) ^ n\n\n/-- The requested divisibility conclusion at every positive index. -/\ndef DivisibleByIndex (a : ℕ → ℤ) : Prop :=\n ∀ n : ℕ, 0 < n → (n : ℤ) ∣ a n\n\n/-- The full assertion: for every positive integer `p`, every integer sequence satisfying the\ndivisor-sum recurrence has its `n`-th term divisible by `n` at every positive index `n`. -/\ndef Target : Prop :=\n ∀ p : ℕ, PositiveInteger p →\n ∀ a : ℕ → ℤ, DivisorSumCondition p a → DivisibleByIndex a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c52a21c9-aa84-5ee4-a8b0-9264b6e429c9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "435c57bd4477ef3d5272fd336945b1801d94f20070ec4fefb869445622d85669", "task_path": "tasks/nmp3_c52a21c9-aa84-5ee4-a8b0-9264b6e429c9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c52a21c9-aa84-5ee4-a8b0-9264b6e429c9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c5496c19-1cac-53f0-b855-242b55316acc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In the plane, let $O$ be the center (centroid) of an equilateral triangle $ABC$. Let points $P$ and $Q$ satisfy $\\overrightarrow{OQ}=2\\overrightarrow{PO}$. Prove that \n-- \\[\n-- |PA|+|PB|+|PC|\\le |QA|+|QB|+|QC|.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane, represented by two real coordinates. -/\nabbrev PlanePoint : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `ABC` is a nondegenerate equilateral triangle. The three side lengths are\nequal and the common side length is positive. -/\ndef IsEquilateralTriangle (A B C : PlanePoint) : Prop :=\n 0 < dist A B ∧ dist A B = dist B C ∧ dist B C = dist C A\n\n/-- `O` is the centroid of the triangle with vertices `A`, `B`, and `C`.\nThis is the coordinate/affine average of the three vertices. -/\ndef IsCentroid (A B C O : PlanePoint) : Prop :=\n O = (1 / 3 : ℝ) • (A + B + C)\n\n/-- The vector condition `OQ = 2 PO`, interpreted in the standard affine\ncoordinate representation of the Euclidean plane. -/\ndef VectorRelation (O P Q : PlanePoint) : Prop :=\n Q - O = (2 : ℝ) • (O - P)\n\n/-- The sum of the distances from `X` to the three vertices. -/\ndef SumDistances (X A B C : PlanePoint) : ℝ :=\n dist X A + dist X B + dist X C\n\n/-- The complete assertion of the problem: for every nondegenerate equilateral\ntriangle `ABC` with centroid `O`, and every pair of points `P`, `Q` satisfying\n`OQ = 2 PO`, the sum of distances from `P` to the vertices is at most the\ncorresponding sum for `Q`. -/\ndef Target : Prop :=\n ∀ (A B C O P Q : PlanePoint),\n IsEquilateralTriangle A B C →\n IsCentroid A B C O →\n VectorRelation O P Q →\n SumDistances P A B C ≤ SumDistances Q A B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5496c19-1cac-53f0-b855-242b55316acc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e41eb5fd16108f112ea5612fac59de3d89827230446b6d520a9a1cb3f22144e6", "task_path": "tasks/nmp3_c5496c19-1cac-53f0-b855-242b55316acc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5496c19-1cac-53f0-b855-242b55316acc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c55e3e14-41b7-5136-b2b8-a87673039b9e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c>0$ and $a+b+c=3$, prove that \n-- \\[\n-- \\sum_{cyc}\\frac{a^2}{7a^2+9a+bc}\\le\\frac{a^2+b^2+c^2}{17}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic rational inequality\n\nThe original problem assumes that `a`, `b`, and `c` are positive real numbers\nwith sum `3`, and asks for the proof of the displayed cyclic inequality.\nThe assertion is packaged as a `Prop`-valued definition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- One summand of the cyclic sum, with cyclic variables in the order `(a,b,c)`. -/\nnoncomputable def CyclicTerm (a b c : ℝ) : ℝ :=\n a ^ 2 / (7 * a ^ 2 + 9 * a + b * c)\n\n/-- The left-hand side\n`a^2/(7a^2+9a+bc) + b^2/(7b^2+9b+ca) + c^2/(7c^2+9c+ab)`. -/\nnoncomputable def CyclicLHS (a b c : ℝ) : ℝ :=\n CyclicTerm a b c + CyclicTerm b c a + CyclicTerm c a b\n\n/-- The right-hand side `(a^2+b^2+c^2)/17`. -/\nnoncomputable def CyclicRHS (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) / 17\n\n/-- The assertion to be proved: for all positive reals `a`, `b`, `c` whose sum\nis `3`, the cyclic sum is at most `(a^2+b^2+c^2)/17`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a + b + c = 3 →\n CyclicLHS a b c ≤ CyclicRHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c55e3e14-41b7-5136-b2b8-a87673039b9e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "70e86e31d6b582366675855c992168b6d09464018749bc1fe60d60b58f5f0fc7", "task_path": "tasks/nmp3_c55e3e14-41b7-5136-b2b8-a87673039b9e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c55e3e14-41b7-5136-b2b8-a87673039b9e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c55e7698-dcfc-5078-a62a-6fb81ae5e209", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that $a+b+c=1$. Prove that \n-- \\[\n-- \\frac{a}{2b^{2}+c}+\\frac{b}{2c^{2}+a}+\\frac{c}{2a^{2}+b}\\ge\\frac95,\n-- \\] \n-- with equality if and only if $a=b=c=\\frac13$.\nimport Mathlib\n\n/-!\n# Formal statement for a cyclic rational inequality\n\nThe original problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose sum is one, the lower bound\n\n`a / (2 * b ^ 2 + c) + b / (2 * c ^ 2 + a) + c / (2 * a ^ 2 + b) ≥ 9 / 5`,\n\nand that equality holds exactly at `a = b = c = 1 / 3`.\n\nThis file only states the proposition; it does not supply a proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The admissibility conditions from the problem: `a`, `b`, and `c` are\nstrictly positive reals with sum equal to one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n (0 : ℝ) < a ∧ (0 : ℝ) < b ∧ (0 : ℝ) < c ∧ a + b + c = (1 : ℝ)\n\n/-- The left-hand side of the asserted inequality. All divisions are\ndivisions in `ℝ`. -/\ndef LHS (a b c : ℝ) : ℝ :=\n a / ((2 : ℝ) * b ^ 2 + c) + b / ((2 : ℝ) * c ^ 2 + a) +\n c / ((2 : ℝ) * a ^ 2 + b)\n\n/-- The equality case `a = b = c = 1/3`, expressed as a predicate on the\nthree real variables. -/\ndef EqualityPoint (a b c : ℝ) : Prop :=\n a = (1 : ℝ) / 3 ∧ b = (1 : ℝ) / 3 ∧ c = (1 : ℝ) / 3\n\n/-- The complete assertion of the problem: for every positive real triple\nwith sum one, the cyclic sum is at least `9/5`, and equality in that bound\nholds if and only if all three variables equal `1/3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n LHS a b c ≥ (9 : ℝ) / 5 ∧\n (LHS a b c = (9 : ℝ) / 5 ↔ EqualityPoint a b c)\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c55e7698-dcfc-5078-a62a-6fb81ae5e209", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "501dcbb350ecab3c190e0d49235d6b33596cb22d5a65652487e96780c93d5bb4", "task_path": "tasks/nmp3_c55e7698-dcfc-5078-a62a-6fb81ae5e209", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c55e7698-dcfc-5078-a62a-6fb81ae5e209", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c5823056-f05c-5cf1-9b7e-5816de75876b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- a,b,c are positive real numbers such that \n-- $$a^3+b^3+c^3+abc=ab+bc+ca+1.$$ \n-- Prove that \n-- $$a+b+c\\ge a^2+b^2+c^2.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`\nsatisfying `a^3 + b^3 + c^3 + a*b*c = a*b + b*c + c*a + 1`, one has\n`a + b + c ≥ a^2 + b^2 + c^2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 3 + b ^ 3 + c ^ 3 + a * b * c =\n a * b + b * c + c * a + 1 →\n a + b + c ≥ a ^ 2 + b ^ 2 + c ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5823056-f05c-5cf1-9b7e-5816de75876b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ce0ddc2ca7bf753af85ca3af7c8a892d365f62d97a8159b07b3db13c113425de", "task_path": "tasks/nmp3_c5823056-f05c-5cf1-9b7e-5816de75876b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5823056-f05c-5cf1-9b7e-5816de75876b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c5a8da59-532f-5753-896a-99543e9a801d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1>0$, $a_2>0$, and for $n\\ge 2$ define \n-- \\[\n-- a_{n+1}=\\frac{2}{a_n+a_{n-1}}.\n-- \\] \n-- Show that the sequence $\\{a_n\\}$ is convergent.\nimport Mathlib\n\n/-!\n# Convergence of a recursively defined sequence\n\nThis file formalizes the statement of the problem. The original sequence is\nindexed by the positive integers, so we model it as a function `ℕ+ → ℝ`.\nIt is not a proof of the statement.\n-/\n\nnamespace Problem\n\n/-- The first initial condition: the term `a 1` is positive. -/\ndef FirstTermPositive (a : ℕ+ → ℝ) : Prop :=\n a 1 > 0\n\n/-- The second initial condition: the term `a 2` is positive. -/\ndef SecondTermPositive (a : ℕ+ → ℝ) : Prop :=\n a 2 > 0\n\n/--\nThe recurrence `a_{n+1} = 2 / (a_n + a_{n-1})` for every positive integer\n`n` with `n ≥ 2`.\n-/\ndef SatisfiesRecurrence (a : ℕ+ → ℝ) : Prop :=\n ∀ n : ℕ+, (2 : ℕ+) ≤ n → a (n + 1) = (2 : ℝ) / (a n + a (n - 1))\n\n/--\nThe admissibility predicate for a sequence `a : ℕ+ → ℝ`: the first two terms\nare positive and the recurrence holds for every positive integer `n ≥ 2`.\n-/\ndef SequenceAdmissible (a : ℕ+ → ℝ) : Prop :=\n FirstTermPositive a ∧ SecondTermPositive a ∧ SatisfiesRecurrence a\n\n/-- A sequence `a : ℕ+ → ℝ` is convergent if it has a real limit at infinity. -/\ndef SequenceConvergent (a : ℕ+ → ℝ) : Prop :=\n ∃ L : ℝ, Filter.Tendsto a Filter.atTop (nhds L)\n\n/--\nThe target assertion: every positive-integer-indexed real sequence satisfying\nthe initial positivity conditions and the recurrence is convergent.\n-/\ndef Target : Prop :=\n ∀ a : ℕ+ → ℝ, SequenceAdmissible a → SequenceConvergent a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5a8da59-532f-5753-896a-99543e9a801d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2932cb39ac210ddd77662450ea67e0a72131d283aa21a159c68988ce2b4887fd", "task_path": "tasks/nmp3_c5a8da59-532f-5753-896a-99543e9a801d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5a8da59-532f-5753-896a-99543e9a801d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c5aab51e-855a-5243-ab5a-52bb48528316", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(f:\\mathbb{R}\\to\\mathbb{N}\\) satisfy \n-- \\[\n-- f\\!\\left(x+\\frac{1}{f(y)}\\right)=f\\!\\left(y+\\frac{1}{f(x)}\\right)\\qquad\\text{for all }x,y\\in\\mathbb{R}.\n-- \\] \n-- Prove that there exists a positive integer that is not taken as a value of \\(f\\) (i.e. \\(f\\) is not surjective onto \\(\\mathbb{N}\\)).\nimport Mathlib\n\n/-!\n# Formalization of a functional-equation problem\n\nThe source problem uses `ℕ` for the positive integers: the conclusion asks for\na positive integer that is not attained by `f`, and the functional equation\ncontains `1 / f(y)`. We therefore take the codomain to be `ℕ+`, Mathlib's\nsubtype of positive natural numbers.\n-/\n\nnamespace Problem\n\n/-- The functional equation from the problem, with the values of `f` coerced\nfrom positive natural numbers to real numbers before taking the reciprocal. -/\ndef FunctionalEquation (f : ℝ → ℕ+) : Prop :=\n ∀ x y : ℝ,\n f (x + (1 : ℝ) / ((f y : ℕ) : ℝ)) =\n f (y + (1 : ℝ) / ((f x : ℕ) : ℝ))\n\n/-- A strictly positive integer is not taken as a value by `f`. -/\ndef PositiveValueMissed (f : ℝ → ℕ+) : Prop :=\n ∃ n : ℕ, 0 < n ∧ ∀ x : ℝ, (f x : ℕ) ≠ n\n\n/-- Equivalently, `f` is not surjective onto the positive natural numbers. -/\ndef NotSurjectiveOntoPositiveIntegers (f : ℝ → ℕ+) : Prop :=\n ¬ Function.Surjective f\n\n/-- The assertion to be proved: every `f : ℝ → ℕ+` satisfying the functional\nequation misses at least one positive integer value. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℕ+, FunctionalEquation f → PositiveValueMissed f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5aab51e-855a-5243-ab5a-52bb48528316", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "decae0d3315ab14cb7296a575e572f1c389da4b852fa97a30e220ff4790ddf32", "task_path": "tasks/nmp3_c5aab51e-855a-5243-ab5a-52bb48528316", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5aab51e-855a-5243-ab5a-52bb48528316", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c5d48b17-76c3-5d16-b2e3-79caf5148d30", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\left(\\frac{a}{b+c}+\\frac{b}{c+a}+\\frac{c}{a+b}-\\frac52\\right)^2+2\\;\\ge\\;\\frac{24abc}{(a+b)(b+c)(c+a)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive real inequality\n\nThe source problem asks one to prove an inequality for three positive real\nnumbers `a`, `b`, and `c`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a / (b + c) + b / (c + a) + c / (a + b) - (5 : ℝ) / 2) ^ (2 : ℕ) +\n (2 : ℝ)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (24 : ℝ) * a * b * c / ((a + b) * (b + c) * (c + a))\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the expression\n`(a / (b + c) + b / (c + a) + c / (a + b) - 5 / 2)^2 + 2`\nis at least `24 * a * b * c / ((a + b) * (b + c) * (c + a))`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5d48b17-76c3-5d16-b2e3-79caf5148d30", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "200ca5c8ae51075ec0ce8d81b40648da3c9150128e773ba1b4ff9deff02482c3", "task_path": "tasks/nmp3_c5d48b17-76c3-5d16-b2e3-79caf5148d30", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5d48b17-76c3-5d16-b2e3-79caf5148d30", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c5f6934b-8048-59cc-8f22-0030140bf615", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there is no function $f:\\mathbb{R}^+\\to\\mathbb{R}^+$ satisfying \n-- \\[f(x+y+f(x))=x+x^{2}\\,f\\!\\Big(\\frac{1}{x+y}\\Big)\\] \n-- for all positive real numbers $x$ and $y$.\nimport Mathlib\n\n/-!\n# Formalization of the no-function problem for positive reals\n\nThe problem asks to prove that no function from the positive real numbers\nto themselves satisfies\n\n`f (x + y + f x) = x + x ^ 2 * f (1 / (x + y))`\n\nfor every positive real `x` and `y`.\n-/\n\nnamespace Problem\n\n/-- The positive real numbers, represented as a subtype of `ℝ`. -/\ndef PositiveReal : Type := {r : ℝ // 0 < r}\n\n/-- The argument `x + y + f x` of the outer occurrence of `f` on the left. -/\ndef lhsArgument (f : PositiveReal → PositiveReal) (x y : PositiveReal) :\n PositiveReal :=\n ⟨x.1 + y.1 + (f x).1, by\n have hx : 0 < x.1 := x.2\n have hy : 0 < y.1 := y.2\n have hfx : 0 < (f x).1 := (f x).2\n positivity⟩\n\n/-- The argument `1 / (x + y)` of the occurrence of `f` on the right. -/\nnoncomputable def rhsArgument (x y : PositiveReal) : PositiveReal :=\n ⟨1 / (x.1 + y.1), by\n have hx : 0 < x.1 := x.2\n have hy : 0 < y.1 := y.2\n positivity⟩\n\n/-- The right-hand side `x + x ^ 2 * f (1 / (x + y))`, as a positive real. -/\nnoncomputable def rhs (f : PositiveReal → PositiveReal) (x y : PositiveReal) : PositiveReal :=\n ⟨x.1 + x.1 ^ 2 * (f (rhsArgument x y)).1, by\n have hx : 0 < x.1 := x.2\n have hf : 0 < (f (rhsArgument x y)).1 := (f (rhsArgument x y)).2\n positivity⟩\n\n/-- The functional equation, quantified over all positive real `x` and `y`. -/\ndef Equation (f : PositiveReal → PositiveReal) : Prop :=\n ∀ x y : PositiveReal, f (lhsArgument f x y) = rhs f x y\n\n/-- The assertion that no function from positive reals to positive reals satisfies\nthe stated functional equation. -/\ndef Target : Prop := ¬ ∃ f : PositiveReal → PositiveReal, Equation f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5f6934b-8048-59cc-8f22-0030140bf615", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4d421be83cae1462b17e9e1ccc918eccc518075168399f1c30911fe235fed5e8", "task_path": "tasks/nmp3_c5f6934b-8048-59cc-8f22-0030140bf615", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5f6934b-8048-59cc-8f22-0030140bf615", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c5fd56c4-93df-5a88-9112-f6ba9ef29d1d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Write the natural numbers $1,2,3,\\dots$ in a line from left to right. \n-- At the $m$‑th minute (for $m=1,2,3,\\dots$) divide the current line into consecutive blocks of $m$ numbers each (the first block consists of the leftmost $m$ numbers, the second block the next $m$, etc.). \n-- Leave the first block unchanged. In every other block move the first element of the block to its end and shift all other elements one place to the left (i.e. perform a left‑rotation of length $m$ on each block except the first). \n-- Prove that every natural number is moved only a finite number of times during the infinite process.\n/-\nFormalization of the process described in `problem.md`.\n\nThe current line is represented by a function `ℕ → ℕ+`, where the argument is\nthe zero-based position in the line and the value is the positive natural-number\nlabel at that position. The labels in `ℕ+` (`PNat`) match the line\n`1, 2, 3, ...`.\n\nAt formal time `t` (so that the next minute is minute `t + 1`), the line is\n`lineAfter t`, and the operation at the next minute partitions the positions\ninto consecutive blocks of size `t + 1`, leaves block number zero unchanged,\nand left-rotates every later block.\n-/\n\nimport Mathlib.Data.PNat.Basic\nimport Mathlib.Data.Set.Finite.Basic\n\nset_option autoImplicit false\n\nnamespace Problem\n\n/-- The initial line: position `i` contains the label `i + 1`. -/\ndef InitialLine (position : ℕ) : ℕ+ :=\n Nat.succPNat position\n\n/-- The index of the block containing `position`, for blocks of size `blockSize`. -/\ndef blockIndex (blockSize : ℕ+) (position : ℕ) : ℕ :=\n position / (blockSize : ℕ)\n\n/-- The zero-based offset of `position` inside its block. -/\ndef blockOffset (blockSize : ℕ+) (position : ℕ) : ℕ :=\n position % (blockSize : ℕ)\n\n/-- The old position whose entry is placed at `position` by the left rotation.\nBlock zero is unchanged. In every other block, the new first entry comes from\nthe old second entry, and so on, while the new last entry comes from the old\nfirst entry. -/\ndef sourceOfNewPosition (blockSize : ℕ+) (position : ℕ) : ℕ :=\n if position < (blockSize : ℕ) then\n position\n else\n blockIndex blockSize position * (blockSize : ℕ) +\n (blockOffset blockSize position + 1) % (blockSize : ℕ)\n\n/-- Apply one round of the process with the indicated block size. The first\nblock is fixed; every later block is left-rotated. -/\ndef rotateBlocks (blockSize : ℕ+) (line : ℕ → ℕ+) : ℕ → ℕ+ :=\n fun position => line (sourceOfNewPosition blockSize position)\n\n/-- `lineAfter t` is the line after `t` complete minutes. Thus the step from\n`lineAfter t` to `lineAfter (t + 1)` is minute `t + 1`, whose block size is\n`t + 1`. -/\ndef lineAfter : ℕ → (ℕ → ℕ+)\n | 0 => InitialLine\n | t + 1 => rotateBlocks (Nat.succPNat t) (lineAfter t)\n\n/-- The label `number` is moved during formal step `step` (that is, during\nminute `step + 1`) if its occurrence before that minute is at a different\nposition from its occurrence after that minute. In this process each label\noccurs exactly once, so this is precisely the movement of that number. -/\ndef MovedDuringStep (step : ℕ) (number : ℕ+) : Prop :=\n ∃ positionBefore positionAfter : ℕ,\n lineAfter step positionBefore = number ∧\n lineAfter (step + 1) positionAfter = number ∧\n positionBefore ≠ positionAfter\n\n/-- A positive natural number is moved at only finitely many steps of the\ninfinite process. -/\ndef MovesOnlyFinitelyOften (number : ℕ+) : Prop :=\n Set.Finite {step : ℕ | MovedDuringStep step number}\n\n/-- The assertion to be proved: every natural number `1, 2, 3, ...` is moved\nat only finitely many minutes of the infinite process. -/\ndef Target : Prop :=\n ∀ number : ℕ+, MovesOnlyFinitelyOften number\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5fd56c4-93df-5a88-9112-f6ba9ef29d1d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "14fad78cb2f3f008521e50adff1fbba8c9fe9daa1bf308a25c8717853134fd62", "task_path": "tasks/nmp3_c5fd56c4-93df-5a88-9112-f6ba9ef29d1d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c5fd56c4-93df-5a88-9112-f6ba9ef29d1d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c6085bc7-442b-5a21-8259-ec9fa73616e6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- $$8(x^2+y^2+z^2)^3\\ge 9(x+y)(y+z)(z+x)(x^3+y^3+z^3).$$\nimport Mathlib\n\n/-!\nFormal statement of the inequality problem.\n\nThe original problem asks to prove, for all positive real numbers `x`, `y`, `z`,\nthe inequality\n`8 (x ^ 2 + y ^ 2 + z ^ 2)^3 ≥\n 9 (x + y) (y + z) (z + x) (x ^ 3 + y ^ 3 + z ^ 3)`.\n-/\n\nnamespace Problem\n\n/-- The universal inequality assertion of the problem.\n\nFor every triple of strictly positive real numbers `x`, `y`, and `z`, the\nleft-hand side is at least the right-hand side. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n 8 * (x ^ 2 + y ^ 2 + z ^ 2) ^ 3 ≥\n 9 * (x + y) * (y + z) * (z + x) *\n (x ^ 3 + y ^ 3 + z ^ 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c6085bc7-442b-5a21-8259-ec9fa73616e6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ad3938c2108b3ef7e999cf6c139bed1afeab3e976e2db9547e98ed641301d385", "task_path": "tasks/nmp3_c6085bc7-442b-5a21-8259-ec9fa73616e6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c6085bc7-442b-5a21-8259-ec9fa73616e6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c6167d12-99a6-56b5-beef-6e09af4fba3a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A$ be a non‑empty set of positive integers. Suppose there exist positive integers $b_1,\\dots,b_n$ and $c_1,\\dots,c_n$ such that \n-- \n-- * for each $i$, the set $b_iA+c_i=\\{\\,b_i a + c_i\\mid a\\in A\\,\\}$ is a subset of $A$, and \n-- * for $i\\neq j$ the sets $b_iA+c_i$ and $b_jA+c_j$ are disjoint. \n-- \n-- Prove that \n-- \\[\n-- \\frac1{b_1}+\\frac1{b_2}+\\cdots+\\frac1{b_n}\\le 1\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the affine-image reciprocal bound\n\nThe problem concerns a nonempty set `A` of positive natural numbers and a\nfinite family of affine maps `a ↦ b_i * a + c_i` whose images lie in `A`\nand are pairwise disjoint. The target asserts the reciprocal sum bound.\n-/\n\nnamespace Problem\n\n/-- The image `b • A + c = {b * a + c | a ∈ A}` as a set of natural numbers. -/\ndef affineImage (A : Set ℕ) (b c : ℕ) : Set ℕ :=\n {x : ℕ | ∃ a : ℕ, a ∈ A ∧ x = b * a + c}\n\n/-- `A` is a nonempty set of positive integers. -/\ndef IsPositiveIntegerSet (A : Set ℕ) : Prop :=\n A.Nonempty ∧ ∀ a : ℕ, a ∈ A → 0 < a\n\n/-- The hypotheses of the problem for the finite family indexed by `Fin n`. -/\ndef Admissible (A : Set ℕ) (n : ℕ) (b c : Fin n → ℕ) : Prop :=\n IsPositiveIntegerSet A ∧\n (∀ i : Fin n, 0 < b i) ∧\n (∀ i : Fin n, 0 < c i) ∧\n (∀ i : Fin n, affineImage A (b i) (c i) ⊆ A) ∧\n (∀ i j : Fin n, i ≠ j →\n Disjoint (affineImage A (b i) (c i)) (affineImage A (b j) (c j)))\n\n/-- The assertion to be proved: for every positive-integer set `A` and every\nadmissible finite family of positive affine maps with pairwise disjoint images,\nthe sum of reciprocals of the multipliers is at most one. -/\ndef Target : Prop :=\n ∀ (A : Set ℕ) (n : ℕ) (b c : Fin n → ℕ),\n Admissible A n b c →\n (∑ i : Fin n, (1 : ℝ) / (b i : ℝ)) ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c6167d12-99a6-56b5-beef-6e09af4fba3a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6ba29c51f86ff2a377761185c9c519fb341d65d3e2e4b2a59b18f02cdb5fe7ba", "task_path": "tasks/nmp3_c6167d12-99a6-56b5-beef-6e09af4fba3a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c6167d12-99a6-56b5-beef-6e09af4fba3a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c6180386-aafc-5b86-805b-a79e3a6fbbb5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be an odd prime. Prove that there exists an integer $a$ with $11$ be an integer and let $a_0,a_1,\\dots,a_n$ be non‑negative real numbers. Define \n-- \\[\n-- S_k=\\sum_{i=0}^{k}\\binom{k}{i}a_i\\qquad(k=0,1,\\dots,n).\n-- \\] \n-- Prove that \n-- \\[\n-- \\frac1n\\sum_{k=0}^{\\,n-1}S_k^{2}-\\frac1{n^{2}}\\Bigl(\\sum_{k=0}^{\\,n}S_k\\Bigr)^{2}\\le\\frac{4}{45}\\bigl(S_n-S_0\\bigr)^{2}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- For `n : ℕ` and a family `a : Fin (n + 1) → ℝ`, this is the quantity\n`S_k = ∑_{i=0}^{k} binom(k,i) a_i`, for `k : Fin (n + 1)`. -/\ndef S (n : ℕ) (a : Fin (n + 1) → ℝ) (k : Fin (n + 1)) : ℝ :=\n ∑ i ∈ Finset.univ.filter (fun i : Fin (n + 1) => (i : ℕ) ≤ (k : ℕ)),\n (Nat.choose (k : ℕ) (i : ℕ) : ℝ) * a i\n\n/-- The assertion of the problem: for every integer `n > 1` and every\nnon-negative real family `a_0, …, a_n`, the stated variance-type inequality\nholds, where `S_k` is defined by a finite binomial transform. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 1 < n →\n ∀ a : Fin (n + 1) → ℝ,\n (∀ i : Fin (n + 1), 0 ≤ a i) →\n (1 / (n : ℝ)) *\n (∑ k : Fin n,\n (S n a ⟨(k : ℕ), Nat.lt_succ_of_lt k.isLt⟩) ^ 2)\n - (1 / ((n : ℝ) ^ 2)) *\n (∑ k : Fin (n + 1), S n a k) ^ 2\n ≤ (4 / 45) *\n (S n a ⟨n, Nat.lt_succ_self n⟩ -\n S n a ⟨0, Nat.succ_pos n⟩) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c61cc1b1-0887-5d09-adc2-79ef4f5bae8e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a4d108d0659400c0880b6645a6eaad60414ca673c026f8553f519a23ca5a1f60", "task_path": "tasks/nmp3_c61cc1b1-0887-5d09-adc2-79ef4f5bae8e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c61cc1b1-0887-5d09-adc2-79ef4f5bae8e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c62219eb-22eb-5fd6-973d-d1ed5300acf7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$. Prove that \n-- \\[\n-- a\\sqrt{a^{2}+3bc}+b\\sqrt{b^{2}+3ca}+c\\sqrt{c^{2}+3ab}\\;\\ge\\;2(ab+bc+ca)\\,.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the nonnegative-real square-root inequality\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, and `c`,\nthe inequality\n`a * sqrt (a^2 + 3bc) + b * sqrt (b^2 + 3ca) + c * sqrt (c^2 + 3ab)\n ≥ 2 * (ab + bc + ca)`.\n\nThe square root is Mathlib's real principal square root, `Real.sqrt`.\n-/\n\nnamespace Problem\n\n/-- The assertion of the source problem: for all nonnegative real numbers `a`, `b`,\nand `c`, the stated square-root inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n 2 * (a * b + b * c + c * a) ≤\n a * Real.sqrt (a ^ 2 + 3 * b * c) +\n b * Real.sqrt (b ^ 2 + 3 * c * a) +\n c * Real.sqrt (c ^ 2 + 3 * a * b)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c62219eb-22eb-5fd6-973d-d1ed5300acf7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9a0155da709e2db7705fe349da67caef51bacb12fccc78ce24a73282d3b9ff23", "task_path": "tasks/nmp3_c62219eb-22eb-5fd6-973d-d1ed5300acf7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c62219eb-22eb-5fd6-973d-d1ed5300acf7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c622afba-8fd5-57a1-9667-022cf6eb6b21", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy \\[(a+b)(b+c)(c+a)=1.\\] Prove that \n-- \\[\n-- \\sqrt{ab(a+b)}+\\sqrt{bc(b+c)}+\\sqrt{ca(c+a)}\\;\\ge\\;2^{\\frac13}\\sqrt{ab+bc+ca}\\,.\n-- \\]\n/-\nFormalization of the following inequality problem.\n\nLet `a`, `b`, `c > 0` satisfy `(a + b) * (b + c) * (c + a) = 1`.\nProve that\n`sqrt (a * b * (a + b)) + sqrt (b * c * (b + c)) + sqrt (c * a * (c + a))\n ≥ 2 ^ (1 / 3) * sqrt (a * b + b * c + c * a)`.\n\nThe declarations below state the universally quantified proposition; no proof is\nsupplied at this stage.\n-/\n\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\nset_option autoImplicit false\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the claimed inequality. -/\ndef LHS (a b c : ℝ) : ℝ :=\n Real.sqrt (a * b * (a + b)) +\n Real.sqrt (b * c * (b + c)) +\n Real.sqrt (c * a * (c + a))\n\n/-- The constant `2 ^ (1/3)` appearing on the right-hand side. -/\ndef TwoPowOneThird : ℝ :=\n Real.rpow 2 ((1 : ℝ) / 3)\n\n/-- The right-hand side of the claimed inequality. -/\ndef RHS (a b c : ℝ) : ℝ :=\n TwoPowOneThird * Real.sqrt (a * b + b * c + c * a)\n\n/-- The strict positivity assumptions `a > 0`, `b > 0`, `c > 0`. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The side condition `(a + b) * (b + c) * (c + a) = 1`. -/\ndef Constraint (a b c : ℝ) : Prop :=\n (a + b) * (b + c) * (c + a) = 1\n\n/-- All assumptions of the problem: positivity and the product constraint. -/\ndef Hypothesis (a b c : ℝ) : Prop :=\n PositiveTriple a b c ∧ Constraint a b c\n\n/-- The asserted inequality, for fixed values of `a`, `b`, and `c`. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n LHS a b c ≥ RHS a b c\n\n/-- The implication from the hypotheses to the inequality for fixed `a`, `b`, `c`. -/\ndef TargetFor (a b c : ℝ) : Prop :=\n Hypothesis a b c → Conclusion a b c\n\n/-- The full universally quantified assertion of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, TargetFor a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c622afba-8fd5-57a1-9667-022cf6eb6b21", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f9a6c7e1424ef150ab966baa88f05dc4cb1e38337628a09f50deb3b06e9c3c55", "task_path": "tasks/nmp3_c622afba-8fd5-57a1-9667-022cf6eb6b21", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c622afba-8fd5-57a1-9667-022cf6eb6b21", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c6484db6-e6c8-59d2-99b7-030abeda7ebb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any three positive real numbers \\(a,\\;b,\\;c\\) prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{a^{3}(a+b)(a+c)}{(b+c)^{3}}\\;\\ge\\;\\frac{(a+b+c)^{2}}{6}\\,,\n-- \\] \n-- where the sum is taken cyclically over \\(a,b,c\\).\nimport Mathlib\n\n/-!\n# Formalization of a cyclic three-variable inequality\n\nThe source problem asks to prove, for all positive real numbers `a b c`,\n\n`∑_cyc a^3 * (a + b) * (a + c) / (b + c)^3 ≥ (a + b + c)^2 / 6`.\n\nThe cyclic sum is represented explicitly as the sum of the three terms obtained\nfrom `(a, b, c)`, `(b, c, a)`, and `(c, a, b)`. The target is stated as a\n`Prop`-valued definition; no proof is asserted in this statement-formalization\nfile.\n-/\n\nnamespace Problem\n\n/-- The summand of the cyclic sum for the distinguished variable `a`, with\n`b` and `c` the other two variables. -/\nnoncomputable def CyclicTerm (a b c : ℝ) : ℝ :=\n a ^ 3 * (a + b) * (a + c) / (b + c) ^ 3\n\n/-- The cyclic sum over `a`, `b`, and `c`, written in the order\n`(a,b,c)`, `(b,c,a)`, `(c,a,b)`. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n CyclicTerm a b c + CyclicTerm b c a + CyclicTerm c a b\n\n/-- The assertion of the source problem: for every triple of positive real\nnumbers, the cyclic sum is at least `(a + b + c)^2 / 6`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n CyclicSum a b c ≥ (a + b + c) ^ 2 / 6\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c6484db6-e6c8-59d2-99b7-030abeda7ebb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b567156cc548e57ecc539805ceacd7de5e9c26d5ae5e48c9ee9ea2f75d477447", "task_path": "tasks/nmp3_c6484db6-e6c8-59d2-99b7-030abeda7ebb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c6484db6-e6c8-59d2-99b7-030abeda7ebb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c6496bde-a2de-5a7e-bf46-f2f67d1106cb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a tetrahedron such that at each vertex the three planar angles of the faces meeting at that vertex sum to $180^\\circ$; i.e. \n-- \\[\n-- \\angle BAC+\\angle CAD+\\angle DAB=180^\\circ,\\quad\n-- \\angle CBA+\\angle ABD+\\angle DBC=180^\\circ,\n-- \\]\n-- and similarly for vertices $C$ and $D$. Prove that the four faces $ABC$, $ABD$, $ACD$, $BCD$ are congruent triangles.\n/-\n Formal statement for the tetrahedron face-angle problem.\n\n The source asks: in a tetrahedron all three planar face angles at each\n vertex sum to `180°`; prove that its four faces are congruent triangles.\n We state the assertion as a proposition-valued definition; no proof is\n supplied here.\n-/\n\nimport Mathlib.Geometry.Euclidean.Congruence\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\nnoncomputable section\n\nopen scoped EuclideanGeometry Congruent\n\nnamespace Problem\n\n/-- The ambient Euclidean three-space. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 3)\n\n/-- Two labelled triangles in Euclidean three-space are congruent if some\npermutation of the vertices of the first makes all corresponding pairwise\ndistances equal to those of the second. This is the usual unlabelled\nnotion of Euclidean triangle congruence. -/\ndef FaceCongruent (A B C D E F : Point) : Prop :=\n ∃ σ : Equiv.Perm (Fin 3),\n Congruent (fun i : Fin 3 => ![A, B, C] (σ i))\n (fun i : Fin 3 => ![D, E, F] i)\n\n/-- `ABCD` is a tetrahedron: its four vertices are affinely independent in\nEuclidean three-space (equivalently, they are distinct and not coplanar). -/\ndef Tetrahedron (A B C D : Point) : Prop :=\n AffineIndependent ℝ ![A, B, C, D]\n\n/-- The three face angles at vertex `A` sum to `Real.pi`. They come\nrespectively from the faces `ABC`, `ACD`, and `ADB`. -/\ndef AngleSumAtA (A B C D : Point) : Prop :=\n ∠ B A C + ∠ C A D + ∠ D A B = Real.pi\n\n/-- The three face angles at vertex `B` sum to `π`. They come respectively\nfrom the faces `ABC`, `ABD`, and `BCD`. -/\ndef AngleSumAtB (A B C D : Point) : Prop :=\n ∠ C B A + ∠ A B D + ∠ D B C = Real.pi\n\n/-- The three face angles at vertex `C` sum to `π`. They come respectively\nfrom the faces `ABC`, `ACD`, and `BCD`. -/\ndef AngleSumAtC (A B C D : Point) : Prop :=\n ∠ A C B + ∠ A C D + ∠ B C D = Real.pi\n\n/-- The three face angles at vertex `D` sum to `π`. They come respectively\nfrom the faces `ABD`, `ACD`, and `BCD`. -/\ndef AngleSumAtD (A B C D : Point) : Prop :=\n ∠ A D B + ∠ A D C + ∠ B D C = Real.pi\n\n/-- The hypothesis that at every vertex the three incident face angles sum\nto `Real.pi`. -/\ndef VertexAngleSums (A B C D : Point) : Prop :=\n AngleSumAtA A B C D ∧ AngleSumAtB A B C D ∧\n AngleSumAtC A B C D ∧ AngleSumAtD A B C D\n\n/-- All six pairwise congruences among the four faces `ABC`, `ABD`, `ACD`,\nand `BCD`. -/\ndef AllFacesCongruent (A B C D : Point) : Prop :=\n FaceCongruent A B C A B D ∧\n FaceCongruent A B C A C D ∧\n FaceCongruent A B C B C D ∧\n FaceCongruent A B D A C D ∧\n FaceCongruent A B D B C D ∧\n FaceCongruent A C D B C D\n\n/-- The combined hypotheses of the source problem: `ABCD` is a tetrahedron,\nand at each of its four vertices the three incident planar face angles sum to\n`Real.pi`. -/\ndef Hypotheses (A B C D : Point) : Prop :=\n Tetrahedron A B C D ∧ VertexAngleSums A B C D\n\n/-- The formal assertion: for every tetrahedron `ABCD` whose three incident\nface angles at every vertex sum to `Real.pi`, its four faces are pairwise\ncongruent triangles. -/\ndef Target : Prop :=\n ∀ A B C D : Point,\n Hypotheses A B C D → AllFacesCongruent A B C D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c6496bde-a2de-5a7e-bf46-f2f67d1106cb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b189b9583f05aa99c1890de7f33d6457c3230f613218431e40c21316c746b6cb", "task_path": "tasks/nmp3_c6496bde-a2de-5a7e-bf46-f2f67d1106cb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c6496bde-a2de-5a7e-bf46-f2f67d1106cb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c64f962e-9e42-571a-ba1f-c46896496808", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{a}{b^{2}+1}+\\frac{b}{c^{2}+1}+\\frac{c}{a^{2}+1}\\ge\\frac{3}{2}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion that for all positive real numbers `a`, `b`, and `c` satisfying\n`a * b * c = 1`, the sum `a / (b^2 + 1) + b / (c^2 + 1) + c / (a^2 + 1)` is at\nleast `3 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n a / (b ^ 2 + 1) + b / (c ^ 2 + 1) + c / (a ^ 2 + 1) ≥ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c64f962e-9e42-571a-ba1f-c46896496808", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4f593cc5285d8a1e792e3e87535101597062850dc5acaf0214f7b9b2d52f7df3", "task_path": "tasks/nmp3_c64f962e-9e42-571a-ba1f-c46896496808", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c64f962e-9e42-571a-ba1f-c46896496808", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c6840cbc-4cfb-5725-a051-3955bad4eeab", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- We say distinct positive integers $a_1,a_2,\\dots,a_n$ are “good’’ if \n-- \\[\n-- \\sum_{i=1}^n a_i=\\sum_{1\\le i Nat.gcd a b, by\n intro a b\n exact Nat.gcd_comm a b⟩ p\n\n/-- The sum of the gcds over all unordered pairs of distinct elements of `S`. -/\ndef gcdPairSum (S : Finset ℕ) : ℕ :=\n Finset.sum (S.sym2.filter (fun p : Sym2 ℕ => ¬ p.IsDiag)) (fun p => pairGcd p)\n\n/-- The sum of all elements of `S`. -/\ndef elementSum (S : Finset ℕ) : ℕ :=\n Finset.sum S (fun a => a)\n\n/-- Every element of a finite set of natural numbers is positive. -/\ndef AllPositive (S : Finset ℕ) : Prop :=\n ∀ a ∈ S, 0 < a\n\n/-- A finite set of natural numbers satisfies the defining equality from the\nproblem: its element sum equals the sum of the gcds of its unordered pairs of\ndistinct elements. -/\ndef SatisfiesGoodEquation (S : Finset ℕ) : Prop :=\n elementSum S = gcdPairSum S\n\n/-- A finite set of natural numbers is good when all of its elements are positive\nand it satisfies the defining sum equality. Distinctness is automatic because a\n`Finset` cannot contain duplicate elements. -/\ndef IsGood (S : Finset ℕ) : Prop :=\n AllPositive S ∧ SatisfiesGoodEquation S\n\n/-- There exists a good set of `n` distinct positive integers. -/\ndef HasGoodSetOfCard (n : ℕ) : Prop :=\n 0 < n ∧ ∃ S : Finset ℕ, S.card = n ∧ IsGood S\n\n/-- The set of positive cardinalities for which a good finite set exists. -/\ndef GoodCardinalities : Set ℕ :=\n {n : ℕ | HasGoodSetOfCard n}\n\n/-- The problem's assertion: for infinitely many positive integers `n`, there exists\nsuch a set of `n` distinct positive integers. -/\ndef Target : Prop :=\n Set.Infinite GoodCardinalities\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c6840cbc-4cfb-5725-a051-3955bad4eeab", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8ed9616cbeee72bd89f5a53d249ae89a767d64283f82f0cb7287e8a2eb9f8744", "task_path": "tasks/nmp3_c6840cbc-4cfb-5725-a051-3955bad4eeab", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c6840cbc-4cfb-5725-a051-3955bad4eeab", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c69d3c66-d50e-5981-b7e1-677472c1afdc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\in\\mathbb Z_{>0}$ be such that there exist five consecutive integers $a,a+1,a+2,a+3,a+4$ with $n\\nmid a+i$ for each $i=0,1,2,3,4$, but $n\\mid a(a+1)(a+2)(a+3)(a+4)$. Prove that there also exist four consecutive integers $b,b+1,b+2,b+3$ such that $n\\nmid b+i$ for $i=0,1,2,3$ and $n\\mid b(b+1)(b+2)(b+3)\\,. $\nimport Mathlib\n\n/-!\n# Formalization of a problem about consecutive integers and divisibility\n\nThe original problem is a statement about positive integer moduli `n` and five /\nfour consecutive integer factors. We formalize the target as a `Prop`; no proof\nis supplied.\n-/\n\nnamespace Problem\n\n/-- The product of the `k` consecutive integers beginning at `a`:\n`a * (a + 1) * ... * (a + (k - 1))`. -/\ndef consecutiveProduct (a : ℤ) (k : ℕ) : ℤ :=\n ∏ i ∈ Finset.range k, (a + (i : ℤ))\n\n/-- `a, a+1, ..., a+k-1` are `k` consecutive integers, none of which is\ndivisible by `n`, while their product is divisible by `n`. -/\ndef HasConsecutiveWitness (n : ℤ) (k : ℕ) (a : ℤ) : Prop :=\n (∀ i ∈ Finset.range k, ¬ n ∣ a + (i : ℤ)) ∧\n n ∣ consecutiveProduct a k\n\n/-- The hypothesis of the problem: there is a block of five consecutive\nintegers with the stated nondivisibility and divisibility properties. -/\ndef FiveConsecutiveHypothesis (n : ℤ) : Prop :=\n ∃ a : ℤ, HasConsecutiveWitness n 5 a\n\n/-- The conclusion required by the problem: there is a block of four\nconsecutive integers with the stated nondivisibility and divisibility\nproperties. -/\ndef FourConsecutiveConclusion (n : ℤ) : Prop :=\n ∃ b : ℤ, HasConsecutiveWitness n 4 b\n\n/-- The complete formal statement of the problem: for every positive integer\n`n`, if some five consecutive integers satisfy the stated conditions, then some\nfour consecutive integers satisfy the analogous conditions. -/\ndef Target : Prop :=\n ∀ n : ℤ, 0 < n → FiveConsecutiveHypothesis n → FourConsecutiveConclusion n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c69d3c66-d50e-5981-b7e1-677472c1afdc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "41c43b8098cc68de049e8a977905720b2e3a06503cf1786250e38a936c7d246e", "task_path": "tasks/nmp3_c69d3c66-d50e-5981-b7e1-677472c1afdc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c69d3c66-d50e-5981-b7e1-677472c1afdc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c6cb1728-b273-5315-a652-506ec2cca7ea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Consider two circles $S_1$ and $S_2$ intersecting at points $A$ and $B$. Let $Q$ be a point on $S_1$ that lies outside $S_2$. Let $D$ be the second intersection of line $QA$ with $S_2$ (different from $A$) and let $C$ be the second intersection of line $QB$ with $S_2$ (different from $B$). Let $P$ be the intersection of the tangents to $S_1$ at $A$ and $B$. Prove that the line $QP$ bisects segment $CD$.\nimport Mathlib\n\n/-!\n# Formal statement of the two-circle / tangent / midpoint theorem\n\nThe ambient plane is the real Euclidean plane `EuclideanSpace ℝ (Fin 2)`.\n\nThe main declaration, `Problem.Target`, is the proposition asserted by the\nproblem. It is a statement only; no proof is supplied here.\n-/\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- A point in the real Euclidean plane. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A nondegenerate circle, represented by its centre and positive radius. -/\nstructure Circle where\n center : Point\n radius : ℝ\n radius_pos : 0 < radius\n\n/-- The point `X` lies on the circle `γ`. -/\ndef OnCircle (γ : Circle) (X : Point) : Prop :=\n dist X γ.center = γ.radius\n\n/-- The point `X` is strictly outside the circle `γ`. -/\ndef OutsideCircle (γ : Circle) (X : Point) : Prop :=\n γ.radius < dist X γ.center\n\n/-- The affine tangent line to `γ` at `A`, described by the usual\nperpendicularity condition with the radius `A - center`. The intended use is\nwhen `A` lies on `γ`. -/\ndef OnTangentAt (γ : Circle) (A X : Point) : Prop :=\n inner ℝ (X - A) (A - γ.center) = 0\n\n/-- `D` is the second intersection of the line through `Q` and `A` with `γ`,\nwith the first intersection being `A`. The final conjunct makes the phrase\n\"second intersection\" explicit: every point of both the line and the circle is\neither `A` or `D`. -/\ndef IsSecondIntersection (γ : Circle) (A Q D : Point) : Prop :=\n A ≠ D ∧\n OnCircle γ A ∧\n OnCircle γ D ∧\n D ∈ line[ℝ, Q, A] ∧\n ∀ X : Point, X ∈ line[ℝ, Q, A] → OnCircle γ X → X = A ∨ X = D\n\n/-- `P` is the unique intersection of the tangents to `γ` at `A` and at `B`. -/\ndef IsTangentIntersection (γ : Circle) (A B P : Point) : Prop :=\n OnTangentAt γ A P ∧\n OnTangentAt γ B P ∧\n ∀ X : Point, OnTangentAt γ A X → OnTangentAt γ B X → X = P\n\n/-- The two circles `S₁` and `S₂` intersect exactly at the two distinct points\n`A` and `B`. -/\ndef CirclesIntersectAt (S₁ S₂ : Circle) (A B : Point) : Prop :=\n A ≠ B ∧\n OnCircle S₁ A ∧ OnCircle S₂ A ∧\n OnCircle S₁ B ∧ OnCircle S₂ B ∧\n ∀ X : Point, OnCircle S₁ X → OnCircle S₂ X → X = A ∨ X = B\n\n/-- The line through `Q` and `P` bisects the segment with endpoints `C` and `D`,\ni.e. it contains their midpoint. -/\ndef LineBisectsSegment (Q P C D : Point) : Prop :=\n midpoint ℝ C D ∈ line[ℝ, Q, P]\n\n/-- The proposition stated by the problem: for two circles `S₁` and `S₂`\nmeeting exactly at `A` and `B`, for a point `Q` on `S₁` outside `S₂`, for the\nsecond intersections `D` of `QA` and `C` of `QB` with `S₂`, and for the\nintersection `P` of the tangents to `S₁` at `A` and `B`, the line `QP` passes\nthrough the midpoint of `CD`. -/\ndef Target : Prop :=\n ∀ (S₁ S₂ : Circle) (A B Q D C P : Point),\n CirclesIntersectAt S₁ S₂ A B →\n OnCircle S₁ Q →\n OutsideCircle S₂ Q →\n IsSecondIntersection S₂ A Q D →\n IsSecondIntersection S₂ B Q C →\n IsTangentIntersection S₁ A B P →\n LineBisectsSegment Q P C D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c6cb1728-b273-5315-a652-506ec2cca7ea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2443bb7a4c9d620114f0ed59f6b94a8387200a855745570bc1baa15d2b717ea0", "task_path": "tasks/nmp3_c6cb1728-b273-5315-a652-506ec2cca7ea", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c6cb1728-b273-5315-a652-506ec2cca7ea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c7267b91-265c-51ad-9d4c-e34493937bec", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\frac{(a+b)^3}{ab^2}+\\frac{(b+c)^3}{bc^2}+\\frac{(c+a)^3}{ca^2}\\ge 12\\left(\\frac{a^2+b^2+c^2}{ab+bc+ca}+1\\right).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n (a + b) ^ 3 / (a * b ^ 2) +\n (b + c) ^ 3 / (b * c ^ 2) +\n (c + a) ^ 3 / (c * a ^ 2)\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def RightHandSide (a b c : ℝ) : ℝ :=\n 12 * ((a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a) + 1)\n\n/--\n For every triple of positive real numbers `a`, `b`, and `c`, the stated\n cyclic rational inequality holds.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n LeftHandSide a b c ≥ RightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c7267b91-265c-51ad-9d4c-e34493937bec", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4cba074ccdc8a7a4e753faaec392f1da472c27280fd2978b0186aa8d3ed1197e", "task_path": "tasks/nmp3_c7267b91-265c-51ad-9d4c-e34493937bec", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c7267b91-265c-51ad-9d4c-e34493937bec", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c730c125-a48c-53c7-b4f0-d894ea9829e4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle (i.e., $a,b,c>0$ and $a+b>c$, $b+c>a$, $c+a>b$). Prove that \n-- \\[\n-- \\frac{a^{3}+b^{3}}{\\,b^{2}-bc+c^{2}\\,}+\\frac{b^{3}+c^{3}}{\\,c^{2}-ca+a^{2}\\,}+\\frac{c^{3}+a^{3}}{\\,a^{2}-ab+b^{2}\\,}\\ge 2\\,(a+b+c)\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The three positive real numbers `a`, `b`, and `c` are side lengths of a\n(nondegenerate) triangle, expressed by the three strict triangle inequalities. -/\ndef TriangleSide (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 3 + b ^ 3) / (b ^ 2 - b * c + c ^ 2) +\n (b ^ 3 + c ^ 3) / (c ^ 2 - c * a + a ^ 2) +\n (c ^ 3 + a ^ 3) / (a ^ 2 - a * b + b ^ 2)\n\n/-- The right-hand side of the inequality in the problem. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 2 * (a + b + c)\n\n/-- The displayed inequality, for arbitrary real `a`, `b`, and `c`. -/\ndef TriangleInequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete assertion: every triple of positive real numbers satisfying\nthe strict triangle inequalities satisfies the displayed inequality. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, TriangleSide a b c → TriangleInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c730c125-a48c-53c7-b4f0-d894ea9829e4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e3aa1768121657bd22172c00dd7fd5d2d29715699f2a73446967f68a2b8440e8", "task_path": "tasks/nmp3_c730c125-a48c-53c7-b4f0-d894ea9829e4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c730c125-a48c-53c7-b4f0-d894ea9829e4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c7588906-51c1-522c-8003-519ac77caebb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that \n-- \n-- \\[\n-- \\lim_{n\\to\\infty} \\; n\\int_{0}^{\\infty}\\frac{dx}{\\displaystyle\\prod_{k=1}^{n}\\Bigl(1+\\frac{x}{k}\\Bigr)^{k}} \\;=\\;1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the limit problem\n\nThe target is the assertion transformed into a proposition in Lean. It does\nnot contain a proof.\n-/\n\nnamespace Problem\n\nopen Filter MeasureTheory Topology\n\n/-- The integrand for the `n`-th term:\n`1 / ∏_{k=1}^n (1 + x/k)^k`, with the product over the natural numbers\n`k` in `Finset.Icc 1 n`, coerced to real numbers. -/\nnoncomputable def integrand (n : ℕ) (x : ℝ) : ℝ :=\n 1 / (Finset.Icc 1 n).prod (fun k : ℕ => (1 + x / (k : ℝ)) ^ k)\n\n/-- The `n`-th term of the sequence:\n`n * ∫_0^∞ dx / ∏_{k=1}^n (1 + x/k)^k`. -/\nnoncomputable def sequence (n : ℕ) : ℝ :=\n (n : ℝ) * ∫ (x : ℝ) in Set.Ioi (0 : ℝ), integrand n x\n\n/-- The stated limit assertion. -/\ndef Target : Prop :=\n Filter.Tendsto sequence Filter.atTop (nhds (1 : ℝ))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c7588906-51c1-522c-8003-519ac77caebb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8bc4820b31150f167992669b0e950807ca5029a30da89877d24fcb0d495f5c3f", "task_path": "tasks/nmp3_c7588906-51c1-522c-8003-519ac77caebb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c7588906-51c1-522c-8003-519ac77caebb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c75e2113-5e4e-598a-be37-a6bde783b5b7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 4$ be an integer and let real numbers $x_1,x_2,\\dots,x_n,x_{n+1},x_{n+2}$ satisfy $x_{n+1}=x_1$ and $x_{n+2}=x_2$. Suppose there exists a constant $a>0$ such that \n-- \\[\n-- x_i^2 \\;=\\; a \\;+\\; x_{i+1}x_{i+2}\\qquad\\text{for all }1\\le i\\le n .\n-- \\]\n-- Prove that at least two of the numbers $x_1,x_2,\\dots,x_n$ are negative.\nimport Mathlib\n\n/-!\n# Formal statement for a cyclic quadratic recurrence\n\nThe original problem uses real numbers `x₁, …, x_{n+2}` with `x_{n+1} = x₁`\nand `x_{n+2} = x₂`, and asks to prove that at least two of\n`x₁, …, xₙ` are negative under a cyclic quadratic relation.\n\nThe Lean representation below indexes the `n + 2` real numbers by\n`Fin (n + 2)`, with index `k` corresponding to the original number\n`x_{k+1}`. Thus indices `0, …, n-1` are exactly the original\n`x₁, …, xₙ`.\n-/\n\nnamespace Problem\n\n/-- The equation `x_i² = a + x_{i+1} x_{i+2}`, for `1 ≤ i ≤ n`,\nwritten using zero-based indices. The element `i : Fin n` represents\nthe original index `i.val + 1`. -/\ndef CyclicEquation (n : ℕ) (x : Fin (n + 2) → ℝ) (a : ℝ) : Prop :=\n ∀ i : Fin n,\n (x ⟨i.val, by omega⟩) ^ 2 =\n a + x ⟨i.val + 1, by omega⟩ * x ⟨i.val + 2, by omega⟩\n\n/-- At least two of the first `n` terms `x₁, …, xₙ` are negative.\nTwo distinct positions are required, rather than merely two possibly\nequal entries of the list. -/\ndef AtLeastTwoNegative (n : ℕ) (x : Fin (n + 2) → ℝ) : Prop :=\n ∃ i j : Fin n,\n i ≠ j ∧\n (x ⟨i.val, by omega⟩) < 0 ∧\n (x ⟨j.val, by omega⟩) < 0\n\n/-- The complete universal statement of the problem. For every integer\n`n ≥ 4` and every finite real sequence indexed by `x₁, …, x_{n+2}`,\nif the cyclic extension conditions hold and if there exists a positive\nconstant `a` satisfying all `n` equations, then at least two of\n`x₁, …, xₙ` are negative. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 4 ≤ n →\n ∀ (x : Fin (n + 2) → ℝ),\n x ⟨n, by omega⟩ = x ⟨0, by omega⟩ →\n x ⟨n + 1, by omega⟩ = x ⟨1, by omega⟩ →\n (∃ a : ℝ, 0 < a ∧ CyclicEquation n x a) →\n AtLeastTwoNegative n x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c75e2113-5e4e-598a-be37-a6bde783b5b7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5421d2c8a07258c63d21f004b4e04e2097fd4f340b0322e106ce03b8d16865e4", "task_path": "tasks/nmp3_c75e2113-5e4e-598a-be37-a6bde783b5b7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c75e2113-5e4e-598a-be37-a6bde783b5b7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c7676afb-e9a3-5a5f-9737-43c817a440e9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, $c$ be non‑negative numbers such that $ab+bc+ca+abc=4$. Prove that \n-- \\[\n-- \\sqrt{1+24a}+\\sqrt{1+24b}+\\sqrt{1+24c}\\ge 15.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\n/-!\n# Statement: a square-root inequality under a symmetric constraint\n\nThis file records the problem statement only. It does not contain a proof of\nthe target proposition.\n-/\n\nnamespace Problem\n\n/-- The admissible triples in the problem: `a`, `b`, and `c` are non-negative\nreal numbers satisfying `ab + bc + ca + abc = 4`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + b * c + c * a + a * b * c = 4\n\n/-- The expression appearing on the left-hand side of the desired inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (1 + 24 * a) + Real.sqrt (1 + 24 * b) + Real.sqrt (1 + 24 * c)\n\n/-- The desired inequality, stated for a fixed triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n 15 ≤ lhs a b c\n\n/-- The complete proposition asserted by the problem: for every non-negative\nreal triple satisfying `ab + bc + ca + abc = 4`, the sum of the three square\nroots is at least `15`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c7676afb-e9a3-5a5f-9737-43c817a440e9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "98f7de106ae8890f78601ad403986df4df3bd0341d15e49ed3827a058dd13782", "task_path": "tasks/nmp3_c7676afb-e9a3-5a5f-9737-43c817a440e9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c7676afb-e9a3-5a5f-9737-43c817a440e9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c79d0016-b4d1-5157-b7b4-6758ce8a09c3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$. Prove that \n-- \\[\n-- \\sqrt{a^{2}+ab+bc}+\\sqrt{b^{2}+bc+ca}+\\sqrt{c^{2}+ca+ab}\\ge 3\\sqrt{ab+bc+ca}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the nonnegative-variable square-root inequality\n\nThe source problem asks, for all nonnegative real numbers `a`, `b`, and `c`, to prove\n\n`sqrt (a^2 + a*b + b*c) + sqrt (b^2 + b*c + c*a) +\n sqrt (c^2 + c*a + a*b) ≥ 3 * sqrt (a*b + b*c + c*a)`.\n\nThis file records the assertion as a proposition; it deliberately contains no proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source statement. -/\ndef lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a ^ 2 + a * b + b * c) +\n Real.sqrt (b ^ 2 + b * c + c * a) +\n Real.sqrt (c ^ 2 + c * a + a * b)\n\n/-- The right-hand side of the inequality in the source statement. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 3 * Real.sqrt (a * b + b * c + c * a)\n\n/-- For all nonnegative real `a`, `b`, and `c`, the stated square-root sum is at\nleast three times the square root of `a*b + b*c + c*a`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c79d0016-b4d1-5157-b7b4-6758ce8a09c3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "52624572b49989506a7f0d4144ebcebc18349465d036407e439dea4a60b178ff", "task_path": "tasks/nmp3_c79d0016-b4d1-5157-b7b4-6758ce8a09c3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c79d0016-b4d1-5157-b7b4-6758ce8a09c3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c7bc3766-86d6-5555-ba53-4aaa1eb3ad29", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c>0$ and $a+b+c=1$, prove that\n-- \\[\n-- \\frac{a^2+b^2+2}{(1+a)(b+c)}+\\frac{b^2+c^2+2}{(1+b)(c+a)}+\\frac{c^2+a^2+2}{(1+c)(a+b)}\\ge\\frac{15}{2}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable cyclic inequality\n\nThe source problem asks to prove a real-variable inequality under the\nassumptions that `a`, `b`, and `c` are positive and sum to `1`.\n-/\n\nnamespace Problem\n\n/-- The domain/admissibility assumptions of the problem:\n`a`, `b`, and `c` are positive real numbers whose sum is `1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 1\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + 2) / ((1 + a) * (b + c)) +\n (b ^ 2 + c ^ 2 + 2) / ((1 + b) * (c + a)) +\n (c ^ 2 + a ^ 2 + 2) / ((1 + c) * (a + b))\n\n/-- The full target proposition: for every triple of positive real numbers\nwhose sum is `1`, the cyclic left-hand side is at least `15 / 2`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → lhs a b c ≥ (15 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c7bc3766-86d6-5555-ba53-4aaa1eb3ad29", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "44d8693416aea1300f07882d1913b44ddc0895f1d412bfc71cf30cf7e308149f", "task_path": "tasks/nmp3_c7bc3766-86d6-5555-ba53-4aaa1eb3ad29", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c7bc3766-86d6-5555-ba53-4aaa1eb3ad29", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c81e95c3-c395-5f77-8ade-b0a793e24b81", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{ab}{a^{2}+ab+b^{2}}+\\frac{bc}{b^{2}+bc+c^{2}}+\\frac{ca}{c^{2}+ca+a^{2}}+\\frac{a+b+c}{\\sqrt[3]{abc}}\\ge 4.\n-- \\]\nmodule\n\npublic import Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formal statement for the cyclic inequality problem\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthe displayed inequality. The expression `∛(abc)` is represented by the real\npower `Real.rpow (a * b * c) ((1 : ℝ) / (3 : ℝ))`, which is the\nreal cube root on the positive domain imposed on `a`, `b`, and `c`.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The full assertion of the problem.\n\nFor all real numbers `a`, `b`, and `c` which are strictly positive, the cyclic\nsum of the three displayed rational terms, plus `(a + b + c)` divided by the\nreal cube root of `(a * b * c)`, is at least `4`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c →\n a * b / (a ^ (2 : ℕ) + a * b + b ^ (2 : ℕ)) +\n b * c / (b ^ (2 : ℕ) + b * c + c ^ (2 : ℕ)) +\n c * a / (c ^ (2 : ℕ) + c * a + a ^ (2 : ℕ)) +\n (a + b + c) / Real.rpow (a * b * c) ((1 : ℝ) / (3 : ℝ)) ≥\n (4 : ℝ)\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c81e95c3-c395-5f77-8ade-b0a793e24b81", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6e4b17f1017bc27767d0510e86873d9ce69e2538f1d9d4e78225dbf689f199b8", "task_path": "tasks/nmp3_c81e95c3-c395-5f77-8ade-b0a793e24b81", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c81e95c3-c395-5f77-8ade-b0a793e24b81", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c88d89a3-136e-562e-990b-bd2cff85b1c1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a fixed non‑negative integer. Suppose integers $a_0,a_1,\\dots,a_n$ satisfy $i-n\\le a_i\\le i$ for every $i=0,1,\\dots,n$. Prove that there exists a non‑empty subset $I\\subseteq\\{0,1,\\dots,n\\}$ such that \n-- \\[\n-- \\sum_{i\\in I}a_i=0\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the zero-sum subset problem\n\nThe source problem asks, for every nonnegative integer `n` and every integer\nsequence `a_0, ..., a_n` whose `i`-th term lies between `i - n` and `i`,\nto prove that some nonempty subset of the indices has zero sum.\n\nThis file only states the target; it deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The hypothesis that the integer sequence `a` indexed by `0, ..., n`\nsatisfies `i - n ≤ a_i ≤ i` for every index `i`. -/\ndef Bounds (n : ℕ) (a : Fin (n + 1) → ℤ) : Prop :=\n ∀ i : Fin (n + 1),\n ((i : ℕ) : ℤ) - (n : ℤ) ≤ a i ∧ a i ≤ ((i : ℕ) : ℤ)\n\n/-- A finset `I` of indices in `{0, ..., n}` is a nonempty zero-sum index set\nfor `a` when the sum of the selected entries is zero. -/\ndef IsZeroSumNonemptySubset (n : ℕ) (a : Fin (n + 1) → ℤ)\n (I : Finset (Fin (n + 1))) : Prop :=\n I.Nonempty ∧ ∑ i ∈ I, a i = 0\n\n/-- There exists a nonempty subset of the index set with zero sum. -/\ndef ZeroSumSubsetExists (n : ℕ) (a : Fin (n + 1) → ℤ) : Prop :=\n ∃ I : Finset (Fin (n + 1)), IsZeroSumNonemptySubset n a I\n\n/-- The complete assertion of the source problem: for every nonnegative\ninteger `n` and every integer sequence `a : Fin (n + 1) → ℤ` satisfying\n`i - n ≤ a i ≤ i` at every index, there is a nonempty finset of indices\nwhose corresponding entries sum to zero. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (a : Fin (n + 1) → ℤ),\n Bounds n a → ZeroSumSubsetExists n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c88d89a3-136e-562e-990b-bd2cff85b1c1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4813a3e07c9b65d01224bbc67cd154f968d85a15df2bcac8aa65323f030e9066", "task_path": "tasks/nmp3_c88d89a3-136e-562e-990b-bd2cff85b1c1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c88d89a3-136e-562e-990b-bd2cff85b1c1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c89df7fe-c700-5315-a244-fdae6dd9e42c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\in\\mathbb N_{+}$. For each $1\\le i,j,k\\le n$ let $a_{ijk}\\in\\{-1,1\\}$. Prove that there exist signs $x_1,\\dots,x_n$, $y_1,\\dots,y_n$, $z_1,\\dots,z_n\\in\\{-1,1\\}$ such that \n-- \\[\n-- \\Bigl|\\sum_{i=1}^{n}\\sum_{j=1}^{n}\\sum_{k=1}^{n} a_{ijk}\\,x_i y_j z_k\\Bigr|>\\frac{n^{2}}{3}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- Arrays of coefficients indexed by `Fin n × Fin n × Fin n`, taking integer-valued\nsigns `-1` or `1`. -/\nabbrev CoefficientArray (n : ℕ) : Type := Fin n → Fin n → Fin n → ℤ\n\n/-- A vector of integer-valued signs indexed by `Fin n`. -/\nabbrev SignVector (n : ℕ) : Type := Fin n → ℤ\n\n/-- Every entry of a coefficient array belongs to `{-1, 1}`. -/\ndef IsCoefficientArray {n : ℕ} (a : CoefficientArray n) : Prop :=\n ∀ i j k : Fin n, a i j k = -1 ∨ a i j k = 1\n\n/-- Every entry of a sign vector belongs to `{-1, 1}`. -/\ndef IsSignVector {n : ℕ} (x : SignVector n) : Prop :=\n ∀ i : Fin n, x i = -1 ∨ x i = 1\n\n/-- The trilinear sum `∑ᵢ ∑ⱼ ∑ₖ aᵢⱼₖ xᵢ yⱼ zₖ`, computed over the integers. -/\ndef TripleSum (n : ℕ) (a : CoefficientArray n) (x y z : SignVector n) : ℤ :=\n ∑ i : Fin n, ∑ j : Fin n, ∑ k : Fin n, a i j k * x i * y j * z k\n\n/-- The assertion of the problem: for every positive integer `n` and every\n`{-1,1}`-valued three-dimensional coefficient array, there are `{-1,1}`-valued\nsign vectors `x`, `y`, and `z` for which the absolute value of the trilinear sum\nis strictly greater than the real number `n^2 / 3`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n →\n ∀ a : CoefficientArray n, IsCoefficientArray a →\n ∃ x y z : SignVector n,\n IsSignVector x ∧ IsSignVector y ∧ IsSignVector z ∧\n |((TripleSum n a x y z : ℤ) : ℝ)| > (n : ℝ) ^ 2 / 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c89df7fe-c700-5315-a244-fdae6dd9e42c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f658d0e6825e3484c554556d9e0670191af0dfc9db0dddd80a0288f6d370ddc4", "task_path": "tasks/nmp3_c89df7fe-c700-5315-a244-fdae6dd9e42c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c89df7fe-c700-5315-a244-fdae6dd9e42c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c8a47e94-0415-5be2-9d70-c6885ee5779f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $X$ be a non‑empty finite set and let $A_1,A_2,\\dots ,A_k\\subseteq X$ satisfy \n-- \n-- 1. $|A_i|\\le 3$ for $i=1,\\dots ,k$, \n-- \n-- 2. every element of $X$ belongs to at least $4$ of the sets $A_1,\\dots ,A_k$. \n-- \n-- Prove that there exists a subcollection of at most $\\displaystyle\\Big\\lfloor\\frac{3k}{7}\\Big\\rfloor$ of the sets $A_i$ whose union equals $X$.\nimport Mathlib.Data.Set.Card\nimport Mathlib.Data.Finset.Card\n\n/-!\n# Formal statement: a three-uniform-ish covering subcollection bound\n\nThe problem asks: for a non-empty finite set `X` and sets `A_1, …, A_k ⊆ X`\nsuch that each `A_i` has cardinality at most `3` and each `x ∈ X` lies in at\nleast four of the `A_i`, there is a subcollection of at most `⌊3k/7⌋` of the\n`A_i` whose union is `X`.\n\nThis file supplies the admissibility and correctness predicates and states\nthe asserted universal implication as an unproved `Prop`-valued definition.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\nuniverse u\n\n/-- The number of indices `i : Fin k` for which `x ∈ A i`. -/\nnoncomputable def Multiplicity {X : Type u} {k : ℕ} (A : Fin k → Set X) (x : X) : ℕ :=\n by\n classical\n exact (Finset.univ.filter fun i : Fin k => x ∈ A i).card\n\n/-- Clause 1: every set `A i` has at most three elements. -/\ndef SmallSets {X : Type u} {k : ℕ} (A : Fin k → Set X) : Prop :=\n ∀ i : Fin k, (A i).ncard ≤ 3\n\n/-- Clause 2: every element of `X` belongs to at least four of the sets `A i`. -/\ndef LargeMultiplicity {X : Type u} {k : ℕ} (A : Fin k → Set X) : Prop :=\n ∀ x : X, 4 ≤ Multiplicity A x\n\n/-- The two hypotheses of the problem for a finite family indexed by `Fin k`. -/\ndef Admissible {X : Type u} {k : ℕ} (A : Fin k → Set X) : Prop :=\n SmallSets A ∧ LargeMultiplicity A\n\n/-- `A` has a subcollection, indexed by `S : Finset (Fin k)`, of size at most\n`m` whose union is all of `X`. -/\ndef CoverableBy {X : Type u} {k : ℕ} (A : Fin k → Set X) (m : ℕ) : Prop :=\n ∃ S : Finset (Fin k), S.card ≤ m ∧ (⋃ i ∈ S, A i) = Set.univ\n\n/-- The assertion of the problem: for every non-empty finite type `X`, every\nnatural number `k`, and every family `A : Fin k → Set X`, if all members of the\nfamily have at most three elements and every point of `X` has multiplicity at\nleast four, then some subfamily of at most `⌊3k/7⌋` sets covers `X`. -/\ndef Target : Prop :=\n ∀ (X : Type u) [Fintype X] [Nonempty X] (k : ℕ) (A : Fin k → Set X),\n Admissible A → CoverableBy A (3 * k / 7)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c8a47e94-0415-5be2-9d70-c6885ee5779f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "766857c0d4e9322cbbf9a956ae946ae6652f6c2f7fbf56f3bf2ca1efeb6244f3", "task_path": "tasks/nmp3_c8a47e94-0415-5be2-9d70-c6885ee5779f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c8a47e94-0415-5be2-9d70-c6885ee5779f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c8bd597f-4343-5041-b5ae-ed8bb4232ad2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x$ and $y$ be positive integers such that both $y(x+1)$ and $x(y+1)$ are perfect squares. Prove that exactly one of $x$ and $y$ is a perfect square (i.e., one of them is a perfect square and the other is not).\nimport Mathlib\n\n/-!\n# Formal statement: exactly one perfect square\n\nThe source problem asks to prove, for positive integers `x` and `y` satisfying\nthat `y * (x + 1)` and `x * (y + 1)` are perfect squares, that exactly one of\n`x` and `y` is a perfect square.\n\nThis file contains only the statement as a proposition; it does not assert a\nproof of that proposition.\n-/\n\nnamespace Problem\n\n/-- A natural number is a perfect square when it is the square of a natural\nnumber. Since the problem's variables are positive, this is equivalent to\nbeing the square of an integer. -/\ndef IsPerfectSquare (n : ℕ) : Prop :=\n IsSquare n\n\n/-- The two numbers `x` and `y` have the property that exactly one of them is\na perfect square. -/\ndef ExactlyOneIsPerfectSquare (x y : ℕ) : Prop :=\n (IsPerfectSquare x ∧ ¬ IsPerfectSquare y) ∨\n (¬ IsPerfectSquare x ∧ IsPerfectSquare y)\n\n/-- Formalization of the full original assertion.\n\nFor every pair of positive integers `x` and `y`, if both `y * (x + 1)` and\n`x * (y + 1)` are perfect squares, then exactly one of `x` and `y` is a\nperfect square. -/\ndef Target : Prop :=\n ∀ x y : ℕ,\n 0 < x →\n 0 < y →\n IsPerfectSquare (y * (x + 1)) →\n IsPerfectSquare (x * (y + 1)) →\n ExactlyOneIsPerfectSquare x y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c8bd597f-4343-5041-b5ae-ed8bb4232ad2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4d738954f89e18609f05b9791ce132fd405deaad94fadd980b92f2eb930f30fa", "task_path": "tasks/nmp3_c8bd597f-4343-5041-b5ae-ed8bb4232ad2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c8bd597f-4343-5041-b5ae-ed8bb4232ad2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c8beb468-fce0-51ce-aeec-2c1982b25f45", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be the side lengths of a triangle (i.e. $a0\\) and \\(ab+bc+ca=1\\), prove that \n-- \\[\n-- \\frac{2+a(a+b+c)}{a^{2}+2bc}+\\frac{2+b(a+b+c)}{b^{2}+2ca}+\\frac{2+c(a+b+c)}{c^{2}+2ab}\\le 9\\,(a^{2}+b^{2}+c^{2}) .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the stated cyclic inequality\n\nThe source problem asks one to prove, for positive real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca = 1`, the cyclic rational inequality displayed in the\nproblem statement. `Problem.Target` below records the resulting universal\nproposition. It is a proposition-valued definition, not a proof of the inequality.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The `a`-term on the left-hand side:\n`(2 + a (a + b + c)) / (a^2 + 2 b c)`. -/\ndef termA (a b c : ℝ) : ℝ :=\n (2 + a * (a + b + c)) / (a ^ 2 + 2 * b * c)\n\n/-- The `b`-term on the left-hand side:\n`(2 + b (a + b + c)) / (b^2 + 2 c a)`. -/\ndef termB (a b c : ℝ) : ℝ :=\n (2 + b * (a + b + c)) / (b ^ 2 + 2 * c * a)\n\n/-- The `c`-term on the left-hand side:\n`(2 + c (a + b + c)) / (c^2 + 2 a b)`. -/\ndef termC (a b c : ℝ) : ℝ :=\n (2 + c * (a + b + c)) / (c ^ 2 + 2 * a * b)\n\n/-- The left-hand side of the inequality: the sum of the three cyclic terms. -/\ndef lhs (a b c : ℝ) : ℝ :=\n termA a b c + termB a b c + termC a b c\n\n/-- The right-hand side of the inequality: `9 (a^2 + b^2 + c^2)`. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 9 * (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The three strict positivity hypotheses `a > 0`, `b > 0`, and `c > 0`. -/\ndef Positivity (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The source side condition `ab + bc + ca = 1`. -/\ndef SideCondition (a b c : ℝ) : Prop :=\n a * b + b * c + c * a = 1\n\n/-- The displayed inequality, with its left- and right-hand sides made explicit. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ rhs a b c\n\n/-- The proposition asserted by the source problem: for all real `a`, `b`, and `c`\nwhich are positive and satisfy `ab + bc + ca = 1`, the stated cyclic sum is at most\n`9 (a^2 + b^2 + c^2)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Positivity a b c →\n SideCondition a b c →\n Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c8cde28e-9656-5ba2-b843-4b177034cea9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "605365b2900537776323b68ab4e2f979d209aa04ca7301d2909c9392e5e83b5c", "task_path": "tasks/nmp3_c8cde28e-9656-5ba2-b843-4b177034cea9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c8cde28e-9656-5ba2-b843-4b177034cea9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c8ea0f11-a996-5c52-ba3f-c24df07f4ae6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be a simple graph (people are vertices and two people are adjacent if they know each other) with the following properties:\n-- 1. $G$ contains no $K_5$ (no set of five mutually acquainted people).\n-- 2. Every two $K_3$ subgraphs (triangles, i.e., 3‑cliques) of $G$ have at least one vertex in common.\n-- \n-- Prove that there exists a set of at most two vertices whose removal destroys all $K_3$ subgraphs of $G$; equivalently, after removing two (or fewer) people, no 3‑clique remains.\n/-\nFormal statement of the K5-free pairwise-intersecting-triangles problem.\n\nThe source asks, for a simple graph in which there is no K5 and in which every\ntwo K3 subgraphs share a vertex, to prove that deleting at most two vertices\nleaves no K3 subgraph.\n-/\n\nimport Mathlib.Combinatorics.SimpleGraph.Clique\nimport Mathlib.Combinatorics.SimpleGraph.Maps\nimport Mathlib.Data.Set.Card\n\nnamespace Problem\n\n/-- A triangle (K3) is a set of three vertices which is a `3`-clique. -/\ndef IsTriangle {V : Type*} (G : SimpleGraph V) (s : Finset V) : Prop :=\n G.IsNClique 3 s\n\n/-- `G` contains no `K5`, i.e. no set of five pairwise-adjacent vertices. -/\ndef NoK5 {V : Type*} (G : SimpleGraph V) : Prop :=\n G.CliqueFree 5\n\n/-- Every two triangles of `G` have at least one vertex in common. -/\ndef PairwiseIntersectingTriangles {V : Type*} (G : SimpleGraph V) : Prop :=\n ∀ ⦃s t : Finset V⦄, IsTriangle G s → IsTriangle G t →\n ∃ v : V, v ∈ s ∧ v ∈ t\n\n/-- The induced graph obtained from `G` after deleting all vertices in `S`. -/\ndef DeleteVertexSet {V : Type*} (G : SimpleGraph V) (S : Set V) :\n SimpleGraph (Sᶜ : Set V) :=\n G.induce (Sᶜ : Set V)\n\n/-- After deleting `S`, no triangle remains in the induced graph. -/\ndef TriangleFreeAfterDeleting {V : Type*} (G : SimpleGraph V) (S : Set V) : Prop :=\n (DeleteVertexSet G S).CliqueFree 3\n\n/--\nThere is a set of at most two vertices whose deletion leaves no triangle.\n\nThe extended cardinal `Set.encard` is used so that the condition `S.encard ≤ 2`\ncorrectly says that `S` is finite with at most two elements; no finiteness of\nthe ambient vertex type is needed or assumed.\n-/\ndef HasTriangleRemovalSetOfAtMostTwo {V : Type*} (G : SimpleGraph V) : Prop :=\n ∃ S : Set V, S.encard ≤ 2 ∧ TriangleFreeAfterDeleting G S\n\n/--\nThe target assertion: every simple graph with no `K5` and with pairwise\nintersecting triangles has a vertex set of size at most two whose deletion\ndestroys all triangles.\n-/\ndef Target : Prop :=\n ∀ {V : Type*}, ∀ (G : SimpleGraph V),\n NoK5 G → PairwiseIntersectingTriangles G → HasTriangleRemovalSetOfAtMostTwo G\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c8ea0f11-a996-5c52-ba3f-c24df07f4ae6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "077659ab7f8d447aa89f79d9bef8dfea4928905a22e085e7392b4ce53747038b", "task_path": "tasks/nmp3_c8ea0f11-a996-5c52-ba3f-c24df07f4ae6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c8ea0f11-a996-5c52-ba3f-c24df07f4ae6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c8f933cd-7277-531a-adde-6df800119bd0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given non‑negative real numbers $a,b,c$ satisfying $ab+bc+ca>0$, prove that \n-- \\[\n-- \\frac{a+b-2c}{\\,b+c\\,}+\\frac{b+c-2a}{\\,c+a\\,}+\\frac{c+a-2b}{\\,a+b\\,}\\ge 0.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypothesis that `a`, `b`, and `c` are non-negative real numbers satisfying\n`a * b + b * c + c * a > 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a * b + b * c + c * a\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (a + b - 2 * c) / (b + c) +\n (b + c - 2 * a) / (c + a) +\n (c + a - 2 * b) / (a + b)\n\n/-- The asserted statement: for every admissible triple of real numbers, the\nleft-hand side of the displayed inequality is non-negative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → 0 ≤ LHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c8f933cd-7277-531a-adde-6df800119bd0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "939f48628289ab391c174f9ffa063d88cadb54991500629884bcc158ff80eadd", "task_path": "tasks/nmp3_c8f933cd-7277-531a-adde-6df800119bd0", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c8f933cd-7277-531a-adde-6df800119bd0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c9022780-89f8-5264-a3f9-39675018d930", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{2}{3\\sqrt3}\\,\\sqrt{\\frac{(a+b+c)^3}{abc}}\\;\\ge\\;\n-- \\frac{a(b+c)}{a^{2}+2bc}+\\frac{b(c+a)}{b^{2}+2ca}+\\frac{c(a+b)}{c^{2}+2ab}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality in `problem.md`\n\nFor positive real numbers `a`, `b`, and `c`, the assertion is\n\n`(2 / (3 * sqrt 3)) * sqrt ((a + b + c)^3 / (a * b * c))\n ≥ a * (b + c) / (a^2 + 2 * b * c)\n + b * (c + a) / (b^2 + 2 * c * a)\n + c * (a + b) / (c^2 + 2 * a * b)`.\n\nAll arithmetic is over the real numbers, division is real division, `Real.sqrt`\nis the nonnegative real square root, and `^` is natural-number exponentiation.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (2 / (3 * Real.sqrt 3)) *\n Real.sqrt (((a + b + c) ^ 3) / (a * b * c))\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n a * (b + c) / (a ^ 2 + 2 * b * c) +\n b * (c + a) / (b ^ 2 + 2 * c * a) +\n c * (a + b) / (c ^ 2 + 2 * a * b)\n\n/-- The statement to be proved: for all positive real `a`, `b`, `c`, the\nleft-hand side is at least the right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → rhs a b c ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c9022780-89f8-5264-a3f9-39675018d930", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "52652c2ed58bc6e5fe47f95d7d491091a779afc7b47ffc4c50dbd3770cec1f02", "task_path": "tasks/nmp3_c9022780-89f8-5264-a3f9-39675018d930", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c9022780-89f8-5264-a3f9-39675018d930", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c905b82d-c0af-5918-8fa1-95b050f668fb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given that $a,b,c,d$ are positive real numbers with $a+b+c+d=4$, prove that \n-- \\[\n-- (1+3a)(1+3b)(1+3c)(1+3d)\\le 125+131\\,abcd.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The admissible quadruples in the problem: four positive real numbers whose sum is 4. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧ a + b + c + d = 4\n\n/-- The left-hand side of the asserted inequality. -/\ndef lhs (a b c d : ℝ) : ℝ :=\n (1 + 3 * a) * (1 + 3 * b) * (1 + 3 * c) * (1 + 3 * d)\n\n/-- The right-hand side of the asserted inequality. -/\ndef rhs (a b c d : ℝ) : ℝ :=\n 125 + 131 * (a * b * c * d)\n\n/--\nFor every quadruple of positive real numbers with sum 4, the product\n`(1 + 3a)(1 + 3b)(1 + 3c)(1 + 3d)` is at most `125 + 131abcd`.\n-/\ndef Target : Prop :=\n ∀ (a b c d : ℝ), Admissible a b c d → lhs a b c d ≤ rhs a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c905b82d-c0af-5918-8fa1-95b050f668fb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "55fc3838c2f11200ee2a2f15debc6d94dd7ac5a49580bcff2d71bd9064906f60", "task_path": "tasks/nmp3_c905b82d-c0af-5918-8fa1-95b050f668fb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c905b82d-c0af-5918-8fa1-95b050f668fb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c948c857-050c-59f2-b184-62e34c62636c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb{R}$. Prove that \n-- \\[\n-- 4(a^4+b^4+c^4)+23(a^2b^2+b^2c^2+c^2a^2)\\ge 18(a^3b+b^3c+c^3a)+9(a^2bc+ab^2c+abc^2).\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for all real numbers `a`, `b`, and `c`, the\nnon-strict inequality\n\n`4(a^4 + b^4 + c^4) + 23(a^2 b^2 + b^2 c^2 + c^2 a^2)\n ≥ 18(a^3 b + b^3 c + c^3 a) + 9(a^2 b c + a b^2 c + a b c^2)`.\n\nThis file states the assertion as a proposition-valued definition. No proof is\nprovided at the statement-formalization stage.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n 4 * (a ^ 4 + b ^ 4 + c ^ 4) +\n 23 * (a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2)\n\n/-- The right-hand side of the inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 18 * (a ^ 3 * b + b ^ 3 * c + c ^ 3 * a) +\n 9 * (a ^ 2 * b * c + a * b ^ 2 * c + a * b * c ^ 2)\n\n/-- The assertion to be proved: the stated inequality holds for every real\n`a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c948c857-050c-59f2-b184-62e34c62636c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "109801e4785d5e345a4aa92ff20ea428c20105e16c2fa13d0f38b13a17c81450", "task_path": "tasks/nmp3_c948c857-050c-59f2-b184-62e34c62636c", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c948c857-050c-59f2-b184-62e34c62636c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c94a8f3a-f56a-5873-a204-641f049ca5be", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle (hence $a,b,c>0$ and $a+b>c$, $b+c>a$, $c+a>b$). Prove that \n-- \\[\n-- a^2b+b^2c+c^2a \\;\\ge\\; \\frac{\\sqrt[3]{abc}\\,(a+b+c)^2}{3}\\, .\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formal statement: an inequality for the side lengths of a triangle\n\nThe source problem asks us to prove, for positive real numbers `a`, `b`, and `c`\nsatisfying the three strict triangle inequalities, that\n`a²b + b²c + c²a` is at least the displayed expression involving the real cube\nroot of `abc`.\n\nNo proof of the target is provided here; `Problem.Target` is the proposition to\nbe proved.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The three positive real numbers `a`, `b`, and `c` satisfy the strict side-length\nconditions of a nondegenerate triangle. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n a > 0 ∧ b > 0 ∧ c > 0 ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The principal real cube root of a nonnegative real number, expressed as the\nreal power with exponent `1 / 3`. Under the target's hypotheses, `a * b * c` is\npositive, so this is the usual positive real cube root from the source statement. -/\nnoncomputable def realCubeRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 3 : ℝ)\n\n/-- The assertion to be proved: for every triple of positive real numbers satisfying\nthe strict triangle inequalities, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n IsTriangleSideLengths a b c →\n a ^ (2 : ℕ) * b + b ^ (2 : ℕ) * c + c ^ (2 : ℕ) * a ≥\n realCubeRoot (a * b * c) * (a + b + c) ^ (2 : ℕ) / (3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c94a8f3a-f56a-5873-a204-641f049ca5be", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fa618e344892e9db40f79f0604ded7889beeb7b3dfeda318ea16e6c333f95e77", "task_path": "tasks/nmp3_c94a8f3a-f56a-5873-a204-641f049ca5be", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c94a8f3a-f56a-5873-a204-641f049ca5be", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c969d61b-e5e7-5418-9c11-e0bfac974824", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $D$, $E$, $F$ be points on the sides $BC$, $CA$, $AB$ of triangle $ABC$. Let $X$, $Y$, $Z$ be points on the segments $AD$, $BE$, $CF$, respectively, such that \n-- \n-- \\[\n-- \\frac{AX}{AD}+\\frac{BY}{BE}+\\frac{CZ}{CF}=1 .\n-- \\]\n-- \n-- Through $A$, $B$, $C$ draw lines parallel respectively to $YZ$, $ZX$, $XY$; denote these lines by $QR$, $RP$, $PQ$, and let their intersections form triangle $PQR$ (so $QR\\parallel YZ$, $RP\\parallel ZX$, $PQ\\parallel XY$). \n-- \n-- Prove that \n-- \n-- \\[\n-- [ABC]^2=[PQR]\\cdot[XYZ],\n-- \\]\n-- \n-- where $[T]$ denotes the area of triangle $T$.\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A point in the Euclidean plane, represented in standard orthonormal\ncoordinates. -/\nabbrev PlanePoint : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Twice the signed area of the triangle `ABC`, computed from its standard\ncoordinates by a determinant. -/\ndef twiceSignedArea (A B C : PlanePoint) : ℝ :=\n (B 0 - A 0) * (C 1 - A 1) - (B 1 - A 1) * (C 0 - A 0)\n\n/-- The usual nonnegative area `[ABC]` of a triangle. -/\ndef triangleArea (A B C : PlanePoint) : ℝ :=\n |twiceSignedArea A B C| / 2\n\n/-- A nondegenerate triangle. -/\ndef NondegenerateTriangle (A B C : PlanePoint) : Prop :=\n 0 < triangleArea A B C\n\n/-- `P` lies on the closed segment from `Q` to `R`. -/\ndef OnClosedSegment (P Q R : PlanePoint) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ P = Q + t • (R - Q)\n\n/-- `P` lies on the line determined by `Q` and `R`. This is used only when\n`Q` and `R` are distinct. -/\ndef OnLineThrough (P Q R : PlanePoint) : Prop :=\n ∃ t : ℝ, P = Q + t • (R - Q)\n\n/-- The nonzero vector `u` is parallel to the nonzero vector `v`. -/\ndef ParallelDirections (u v : PlanePoint) : Prop :=\n u ≠ 0 ∧ v ≠ 0 ∧ ∃ c : ℝ, u = c • v\n\n/-- The points `D`, `E`, `F` lie on the closed sides `BC`, `CA`, `AB`. -/\ndef SidePoints (A B C D E F : PlanePoint) : Prop :=\n OnClosedSegment D B C ∧\n OnClosedSegment E C A ∧\n OnClosedSegment F A B\n\n/-- The points `X`, `Y`, `Z` lie on the closed segments `AD`, `BE`, `CF`. -/\ndef SegmentPoints (A B C D E F X Y Z : PlanePoint) : Prop :=\n OnClosedSegment X A D ∧\n OnClosedSegment Y B E ∧\n OnClosedSegment Z C F\n\n/-- The scalar length-ratio condition\n`AX / AD + BY / BE + CZ / CF = 1`. -/\ndef DistanceRatioEquation\n (A B C D E F X Y Z : PlanePoint) : Prop :=\n dist A X / dist A D + dist B Y / dist B E + dist C Z / dist C F = 1\n\n/-- All hypotheses stated before the construction of `PQR`: `ABC` is a\nnondegenerate triangle, `D`, `E`, `F` are on the sides, `X`, `Y`, `Z` are on\nthe indicated segments, and the distance-ratio equation holds. -/\ndef ConfigurationHypotheses\n (A B C D E F X Y Z : PlanePoint) : Prop :=\n NondegenerateTriangle A B C ∧\n SidePoints A B C D E F ∧\n SegmentPoints A B C D E F X Y Z ∧\n DistanceRatioEquation A B C D E F X Y Z\n\n/-- `PQR` is the triangle whose sides are obtained by drawing through `A`,\n`B`, and `C` lines parallel respectively to `YZ`, `ZX`, and `XY`: the side\n`QR` passes through `A` and is parallel to `YZ`, the side `RP` passes through\n`B` and is parallel to `ZX`, and the side `PQ` passes through `C` and is\nparallel to `XY`. Nondegeneracy of `PQR` and the nonzero direction conditions\nensure that these are genuine lines; together they also force `XYZ` to be\nnoncollinear. -/\ndef IsParallelTriangleConstruction\n (A B C X Y Z P Q R : PlanePoint) : Prop :=\n NondegenerateTriangle P Q R ∧\n OnLineThrough A Q R ∧\n OnLineThrough B R P ∧\n OnLineThrough C P Q ∧\n ParallelDirections (R - Q) (Z - Y) ∧\n ParallelDirections (P - R) (X - Z) ∧\n ParallelDirections (Q - P) (Y - X)\n\n/-- The area identity asserted by the problem. -/\ndef AreaIdentity\n (A B C X Y Z P Q R : PlanePoint) : Prop :=\n triangleArea A B C ^ 2 = triangleArea P Q R * triangleArea X Y Z\n\n/-- The complete statement of the problem: for every choice of the points\nsatisfying the segment and distance-ratio hypotheses and whenever `PQR` is the\ntriangle formed by the three prescribed parallel lines, the area identity\n`[ABC]^2 = [PQR] * [XYZ]` holds. -/\ndef Target : Prop :=\n ∀ (A B C D E F X Y Z P Q R : PlanePoint),\n ConfigurationHypotheses A B C D E F X Y Z →\n IsParallelTriangleConstruction A B C X Y Z P Q R →\n AreaIdentity A B C X Y Z P Q R\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c969d61b-e5e7-5418-9c11-e0bfac974824", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2d058351afaccb2173f7fdac3abc4015aa770d4623f13a5729367361968c1fe6", "task_path": "tasks/nmp3_c969d61b-e5e7-5418-9c11-e0bfac974824", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c969d61b-e5e7-5418-9c11-e0bfac974824", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c98328cf-94db-51db-a0af-5a84eff9c391", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A natural number $n$ is given. Prove that \n-- $$\\sum_{\\substack{p\\text{ prime}\\\\ n\\le p\\le n^2}}\\frac{1}{p}<2,$$ \n-- where the sum is taken over all primes $p$ satisfying $n\\le p\\le n^2$.\nimport Mathlib\n\n/-!\n# Formalization of the prime reciprocal sum bound\n\nThe problem asks to prove that for an arbitrary natural number `n`, the sum of\nthe reciprocals of all primes `p` satisfying `n ≤ p ≤ n ^ 2` is strictly less\nthan `2`.\n-/\n\nnamespace Problem\n\n/-- The finite set of primes in the closed natural-number interval `[n, n ^ 2]`. -/\ndef primesInInterval (n : ℕ) : Finset ℕ :=\n (Finset.Icc n (n ^ 2)).filter Nat.Prime\n\n/-- The sum of the reciprocals of the primes in the interval `[n, n ^ 2]`,\nregarded as a real number. -/\nnoncomputable def primeReciprocalSum (n : ℕ) : ℝ :=\n ∑ p ∈ primesInInterval n, (1 : ℝ) / (p : ℝ)\n\n/-- The assertion for one fixed natural number `n`: the reciprocal-prime sum\nover `[n, n ^ 2]` is strictly less than `2`. -/\ndef BoundAt (n : ℕ) : Prop :=\n primeReciprocalSum n < 2\n\n/-- The assertion that for every natural number `n`, the sum of the\nreciprocals of the primes `p` with `n ≤ p ≤ n ^ 2` is strictly less than `2`. -/\ndef Target : Prop :=\n ∀ n : ℕ, BoundAt n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c98328cf-94db-51db-a0af-5a84eff9c391", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7d75649c804fb6f432671f84f63cae99fe65096e9f00281865b59ef5f348ba8f", "task_path": "tasks/nmp3_c98328cf-94db-51db-a0af-5a84eff9c391", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c98328cf-94db-51db-a0af-5a84eff9c391", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c9951648-14e9-532e-94a6-f0373522e8ce", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\sqrt{\\frac{(a^{2}+bc)(b^{2}+ac)}{(a+c)(b+c)}}\\ge a+b+c.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-!\nThe source asks to prove the following cyclic inequality for positive real\nnumbers `a`, `b`, and `c`:\n\n\\[\n\\sum_{\\mathrm{cyc}}\n \\sqrt{\\frac{(a^2+bc)(b^2+ac)}{(a+c)(b+c)}}\n\\ge a+b+c.\n\\]\n\nThe three summands are represented explicitly, in cyclic order, by `cycSum`.\n-/\n\n/-- One cyclic summand of the displayed inequality. -/\ndef cycTerm (a b c : ℝ) : ℝ :=\n Real.sqrt (((a ^ 2 + b * c) * (b ^ 2 + a * c)) / ((a + c) * (b + c)))\n\n/-- The cyclic sum, expanded as `(a,b,c)`, `(b,c,a)`, and `(c,a,b)`. -/\ndef cycSum (a b c : ℝ) : ℝ :=\n cycTerm a b c + cycTerm b c a + cycTerm c a b\n\n/-- The complete target assertion of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → cycSum a b c ≥ a + b + c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c9951648-14e9-532e-94a6-f0373522e8ce", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b0dd477ff3d10abcde5b538728b03530b7e23b3044a0883fe19adf3b28dad12d", "task_path": "tasks/nmp3_c9951648-14e9-532e-94a6-f0373522e8ce", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c9951648-14e9-532e-94a6-f0373522e8ce", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c99c9faa-24f3-5873-91a5-c905efe812fe", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{a^{2}b}{\\,4-bc\\,}+\\frac{b^{2}c}{\\,4-ca\\,}+\\frac{c^{2}a}{\\,4-ab\\,}\\le 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility constraints from the problem: `a`, `b`, and `c` are\nnonnegative real numbers whose sum is `3`. -/\ndef IsAdmissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a + b + c = 3\n\n/-- The left-hand side of the stated inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 2 * b / (4 - b * c) +\n b ^ 2 * c / (4 - c * a) +\n c ^ 2 * a / (4 - a * b)\n\n/-- The asserted inequality: for all nonnegative real `a`, `b`, and `c`\nwith `a + b + c = 3`, the displayed sum is at most `1`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), IsAdmissible a b c → lhs a b c ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c99c9faa-24f3-5873-91a5-c905efe812fe", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a01b391faf5a3c73c0ccba66652fb9419ef31a2a6d62c3990360aaffdd12f74e", "task_path": "tasks/nmp3_c99c9faa-24f3-5873-91a5-c905efe812fe", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c99c9faa-24f3-5873-91a5-c905efe812fe", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c9a4285f-a2cc-5d7b-8e90-fdb46d1716c5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge 0$. Prove that \n-- \\[\n-- \\sum_{\\mathrm{cyc}}(y-z)^2\\bigl(7x^2-y^2-z^2\\bigr)^2\\ge 112\\,(x-y)^2(y-z)^2(z-x)^2 .\n-- \\] \n-- (Here $\\sum_{\\mathrm{cyc}}$ denotes the cyclic sum over $(x,y,z)$ and $\\prod_{\\mathrm{cyc}}(y-z)^2=(x-y)^2(y-z)^2(z-x)^2$.)\nimport Mathlib\n\n/-!\n# Formalization of the cyclic polynomial inequality\n\nThis file states the inequality from `problem.md`. It does not prove the\ninequality; the target is represented as a proposition-valued definition.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum\n`(y-z)^2(7x^2-y^2-z^2)^2 + (z-x)^2(7y^2-z^2-x^2)^2\n + (x-y)^2(7z^2-x^2-y^2)^2`. -/\ndef cyclicSum (x y z : ℝ) : ℝ :=\n (y - z) ^ 2 * (7 * x ^ 2 - y ^ 2 - z ^ 2) ^ 2 +\n (z - x) ^ 2 * (7 * y ^ 2 - z ^ 2 - x ^ 2) ^ 2 +\n (x - y) ^ 2 * (7 * z ^ 2 - x ^ 2 - y ^ 2) ^ 2\n\n/-- The product `(x-y)^2 (y-z)^2 (z-x)^2` appearing on the right-hand side. -/\ndef productOfSquares (x y z : ℝ) : ℝ :=\n (x - y) ^ 2 * (y - z) ^ 2 * (z - x) ^ 2\n\n/-- The assertion in the problem: for all nonnegative real `x`, `y`, and `z`,\nthe cyclic sum is at least `112` times the product of the squared differences. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 ≤ x → 0 ≤ y → 0 ≤ z →\n 112 * productOfSquares x y z ≤ cyclicSum x y z\n\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c9a4285f-a2cc-5d7b-8e90-fdb46d1716c5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f85cba4855bbf6ba19b701151f99e9011cae803d3a8e2a8a1d872e3a457a2c79", "task_path": "tasks/nmp3_c9a4285f-a2cc-5d7b-8e90-fdb46d1716c5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c9a4285f-a2cc-5d7b-8e90-fdb46d1716c5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c9d5fefd-2250-5ddd-bf6e-19543f384818", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers satisfying \n-- $$a^3+b^3+c^3+abc=ab+bc+ca+1.$$ \n-- Prove that \n-- $$a+b+c+3abc\\ge a^2b+b^2c+c^2a+a^2c+c^2b+b^2a.$$\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the cubic inequality problem\n\nThe original problem asks, for strictly positive real numbers `a`, `b`, and `c`\nsatisfying `a^3 + b^3 + c^3 + abc = ab + bc + ca + 1`, to prove the\nnon-strict inequality\n`a + b + c + 3abc ≥ a^2 b + b^2 c + c^2 a + a^2 c + c^2 b + b^2 a`.\n\nFollowing the statement-formalization instructions, `Target` is a proposition\nwhose body records the assertion; no proof is supplied here.\n-/\n\nnamespace Problem\n\n/-- `a`, `b`, and `c` are strictly positive real numbers. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The cubic constraint `a^3 + b^3 + c^3 + abc = ab + bc + ca + 1`. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a ^ 3 + b ^ 3 + c ^ 3 + a * b * c =\n a * b + b * c + c * a + 1\n\n/-- The non-strict inequality requested as the conclusion. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a + b + c + 3 * a * b * c ≥\n a ^ 2 * b + b ^ 2 * c + c ^ 2 * a +\n a ^ 2 * c + c ^ 2 * b + b ^ 2 * a\n\n/-- The complete assertion of the problem: for all positive real `a`, `b`, `c`\nsatisfying the cubic constraint, the requested inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Positive a b c → Constraint a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c9d5fefd-2250-5ddd-bf6e-19543f384818", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "78cc2bff0844e55fac04ed07bd333905c7e386977d999107b531aab053a97acb", "task_path": "tasks/nmp3_c9d5fefd-2250-5ddd-bf6e-19543f384818", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c9d5fefd-2250-5ddd-bf6e-19543f384818", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_c9eb379b-2377-516e-b951-e23ff1ba48ee", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $T$ be a tournament (i.e. a complete directed graph in which for each pair of distinct vertices exactly one of the two possible directed edges is present) on $799$ vertices. Prove that there exist two disjoint subsets $A,B\\subseteq V(T)$ with $|A|=|B|=7$ such that for every $a\\in A$ and $b\\in B$ the edge is directed from $a$ to $b$ (equivalently, each team in $A$ defeated each team in $B$).\nmodule\n\npublic import Mathlib.Data.Set.Card\npublic import Mathlib.Data.Fintype.Card\n\n/-!\n# Formal statement: a tournament on 799 vertices has disjoint 7-sets\n with all cross edges directed from the first to the second\n\nThe source problem asks to prove that every tournament on exactly 799\nvertices contains two disjoint subsets `A` and `B`, each of cardinality 7,\nsuch that every edge between a vertex of `A` and a vertex of `B` points\nfrom the `A`-vertex to the `B`-vertex.\n\nThis file contains only the formal statement (as a `Prop`-valued\ndefinition); no proof is supplied.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\nuniverse u\n\n/-- A tournament on a vertex type `V`, represented by its directed edge\nrelation. The source's parenthetical definition constrains precisely the\npairs of distinct vertices: for each such pair exactly one of the two possible\ndirected edges is present. It imposes no condition on self-edges, and none is\nneeded for the cross-edge conclusion about disjoint sets. -/\nstructure Tournament (V : Type u) where\n /-- The directed-edge relation of the tournament. -/\n edge : V → V → Prop\n /-- Between any two distinct vertices there is exactly one directed edge. -/\n exactly_one_direction : ∀ ⦃v w : V⦄, v ≠ w →\n (edge v w ∧ ¬ edge w v) ∨ (¬ edge v w ∧ edge w v)\n\n/-- A tournament `T` has two disjoint 7-element vertex sets `A` and `B`\nsuch that every edge between them points from `A` to `B`. -/\ndef HasDisjointSevenSets (V : Type u) [Fintype V] (T : Tournament V) : Prop :=\n ∃ A B : Set V,\n A.ncard = 7 ∧\n B.ncard = 7 ∧\n Disjoint A B ∧\n (∀ a : V, a ∈ A → ∀ b : V, b ∈ B → T.edge a b)\n\n/-- The assertion of the source problem: every tournament on exactly\n799 vertices has disjoint 7-element sets `A` and `B` with every cross edge\ndirected from `A` to `B`. -/\ndef Target : Prop :=\n ∀ (V : Type*) [Fintype V],\n Fintype.card V = 799 →\n ∀ T : Tournament V, HasDisjointSevenSets V T\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c9eb379b-2377-516e-b951-e23ff1ba48ee", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f338b4c4357379f7635a717d8d1a489b875c590eb0ffe5297d835fe80a8b78c2", "task_path": "tasks/nmp3_c9eb379b-2377-516e-b951-e23ff1ba48ee", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "c9eb379b-2377-516e-b951-e23ff1ba48ee", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ca1ffb29-1a0c-55d6-9b03-1df6a53c1162", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any positive integer $n$, the product $n(n+1)(n+2)(n+3)$ is never a perfect cube.\nimport Mathlib\n\n/-!\n# Formalization of the proposed problem\n\nFor every positive integer `n`, the product\n`n * (n + 1) * (n + 2) * (n + 3)` is not a perfect cube.\n\nThe statement is represented as a proposition-valued definition; this file does\nnot assert a proof of it.\n-/\n\nnamespace Problem\n\n/-- A natural number is a perfect cube if it is the cube of a natural number. -/\ndef IsPerfectCube (m : ℕ) : Prop :=\n ∃ k : ℕ, m = k ^ 3\n\n/-- The product appearing in the problem, as a function of `n`. -/\ndef Product (n : ℕ) : ℕ :=\n n * (n + 1) * (n + 2) * (n + 3)\n\n/-- The full universal assertion: every positive integer `n` has the property\nthat `n(n+1)(n+2)(n+3)` is not a perfect cube. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ¬ IsPerfectCube (Product n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ca1ffb29-1a0c-55d6-9b03-1df6a53c1162", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0a874fc5219b65466131219927547e103231cbf41918de4406d6d2f39c734245", "task_path": "tasks/nmp3_ca1ffb29-1a0c-55d6-9b03-1df6a53c1162", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ca1ffb29-1a0c-55d6-9b03-1df6a53c1162", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ca38d156-485f-5421-bb04-c273f6a15790", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- $$x^4y+y^4z+z^4x+xyz\\bigl(x^3+y^3+z^3\\bigr)\\ge (x+y+z)(3xyz-1).$$\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe source problem asks to prove, for positive real numbers `x`, `y`, and `z`,\nthe inequality\n`x^4*y + y^4*z + z^4*x + x*y*z*(x^3+y^3+z^3)\n ≥ (x+y+z)*(3*x*y*z - 1)`.\n\nThis file records only the statement; it deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\ndef lhs (x y z : ℝ) : ℝ :=\n x ^ 4 * y + y ^ 4 * z + z ^ 4 * x +\n x * y * z * (x ^ 3 + y ^ 3 + z ^ 3)\n\n/-- The right-hand side of the target inequality. -/\ndef rhs (x y z : ℝ) : ℝ :=\n (x + y + z) * (3 * x * y * z - 1)\n\n/-- The claimed inequality, as a predicate on three real numbers. -/\ndef Inequality (x y z : ℝ) : Prop :=\n lhs x y z ≥ rhs x y z\n\n/-- The full universally quantified statement of the source problem. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ca38d156-485f-5421-bb04-c273f6a15790", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "33f7bdd9d74272f3ee250faa477885c080c541a283b7972e6e6b3ce11a4988c0", "task_path": "tasks/nmp3_ca38d156-485f-5421-bb04-c273f6a15790", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ca38d156-485f-5421-bb04-c273f6a15790", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ca4eb18b-a17e-54a9-8996-f77c6b259d97", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there is no function $f:(0,\\infty)\\to(0,\\infty)$ satisfying \n-- $$f\\bigl(f(x)+y\\bigr)=f(x)+3x+yf(y)$$ \n-- for all positive real numbers $x$ and $y\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the no-solution functional-equation problem\n\nThe original problem asks to prove that no function from the positive reals\nto the positive reals satisfies\n\n f (f x + y) = f(x) + 3x + y f(y)\n\nfor all positive real numbers `x` and `y`.\n-/\n\nnamespace Problem\n\n/-- The positive real numbers, represented as a subtype of `ℝ`. -/\ndef PositiveReal : Type := {x : ℝ // 0 < x}\n\n/-- A function `f : (0, ∞) → (0, ∞)` satisfies the functional equation\n`f (f x + y) = f x + 3x + y f y` for all positive real `x` and `y`.\n\nThe argument `f x + y` is an element of the positive reals because both\n`f x` and `y` are positive. The displayed equality is an equality of real\nnumbers after coercing the two sides from the subtype of positive reals. -/\ndef SatisfiesFunctionalEquation (f : PositiveReal → PositiveReal) : Prop :=\n ∀ x y : PositiveReal,\n (f ⟨(f x).val + y.val,\n add_pos (f x).property y.property⟩).val =\n (f x).val + 3 * x.val + y.val * (f y).val\n\n/-- There exists a function from the positive reals to the positive reals\nsatisfying the stated functional equation. -/\ndef HasSolution : Prop :=\n ∃ f : PositiveReal → PositiveReal, SatisfiesFunctionalEquation f\n\n/-- The assertion to be proved: there is no function `f : (0, ∞) → (0, ∞)`\nsatisfying `f (f x + y) = f x + 3x + y f y` for all positive real `x` and `y`. -/\ndef Target : Prop := ¬ HasSolution\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ca4eb18b-a17e-54a9-8996-f77c6b259d97", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "815a9c9641d1160cf06de0ced0a7288725840a776aa3a4ead2fd7da7dda14dd3", "task_path": "tasks/nmp3_ca4eb18b-a17e-54a9-8996-f77c6b259d97", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ca4eb18b-a17e-54a9-8996-f77c6b259d97", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ca5c4c62-2c65-58cb-87d5-6ecf1fbabf22", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ be real numbers such that \n-- \\[\n-- \\frac{1-c}{a^{2}+b^{2}+1}+\\frac{1-a}{b^{2}+c^{2}+1}+\\frac{1-b}{c^{2}+a^{2}+1}\\le0.\n-- \\] \n-- Prove that \n-- \\[\n-- a^{3}+b^{3}+c^{3}\\ge a^{2}+b^{2}+c^{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a real-variable inequality\n\nThe source problem asks one to prove, for all nonnegative real numbers `a`, `b`,\nand `c` satisfying a displayed cyclic reciprocal inequality, that\n`a ^ 3 + b ^ 3 + c ^ 3 ≥ a ^ 2 + b ^ 2 + c ^ 2`.\n\nThe definitions below expose the admissibility predicate, the conclusion, and\nthe full universally quantified target separately. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- A real number is nonnegative. -/\ndef Nonnegative (x : ℝ) : Prop :=\n 0 ≤ x\n\n/-- The cyclic reciprocal inequality appearing in the source problem. -/\ndef CyclicInequality (a b c : ℝ) : Prop :=\n (1 - c) / (a ^ 2 + b ^ 2 + 1) +\n (1 - a) / (b ^ 2 + c ^ 2 + 1) +\n (1 - b) / (c ^ 2 + a ^ 2 + 1) ≤ 0\n\n/-- The admissibility predicate for a triple `(a, b, c)`: all entries are\nnonnegative real numbers and the cyclic reciprocal inequality holds. -/\ndef Hypothesis (a b c : ℝ) : Prop :=\n Nonnegative a ∧ Nonnegative b ∧ Nonnegative c ∧\n CyclicInequality a b c\n\n/-- The desired inequality between the sum of cubes and the sum of squares. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n a ^ 3 + b ^ 3 + c ^ 3 ≥ a ^ 2 + b ^ 2 + c ^ 2\n\n/-- The complete universal statement that the source problem asks to prove. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Hypothesis a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ca5c4c62-2c65-58cb-87d5-6ecf1fbabf22", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7ca2092e84df4c85f54c8f39d22bff5eda43e40cbff4d819d7730eacf989eb03", "task_path": "tasks/nmp3_ca5c4c62-2c65-58cb-87d5-6ecf1fbabf22", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ca5c4c62-2c65-58cb-87d5-6ecf1fbabf22", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ca9724c9-91c0-5532-9f53-59e7d9c1e2ae", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that every positive integer can be expressed as a sum of terms of the form $2^{a}3^{b}$ (where $a,b\\ge 0$ are integers) such that none of the terms divides any other term.\nimport Mathlib.Data.Finset.Basic\nimport Mathlib.Algebra.BigOperators.Group.Finset.Basic\nimport Mathlib.Data.Nat.Prime.Basic\n\n/-!\n# Formal statement for a representation problem\n\nEvery positive integer is required to be a finite sum of numbers of the\nform `2^a * 3^b`, with `a, b : ℕ`, such that the summands form an\nantichain under divisibility.\n-/\n\nnamespace Problem\n\n/-- A natural number is a term of the permitted form when it is `2^a * 3^b`\nfor some nonnegative integer exponents `a` and `b`. The nonnegative integers\nare represented by `ℕ`. -/\ndef IsPowerOfTwoThree (m : ℕ) : Prop :=\n ∃ a : ℕ, ∃ b : ℕ, m = 2 ^ a * 3 ^ b\n\n/-- A finite set of natural numbers has no divisibility among distinct\nmembers: whenever one member divides another member, the two members are\nequal. Since the numbers are in a `Finset`, this says that no term divides\na different term. -/\ndef PairwiseNoDivisibility (s : Finset ℕ) : Prop :=\n ∀ x : ℕ, x ∈ s → ∀ y : ℕ, y ∈ s → x ∣ y → x = y\n\n/-- Every positive integer is a finite sum of terms of the form `2^a * 3^b`\n(`a, b : ℕ`) such that no term divides any other distinct term. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ∃ s : Finset ℕ,\n (∀ m : ℕ, m ∈ s → IsPowerOfTwoThree m) ∧\n s.sum (fun m : ℕ => m) = n ∧\n PairwiseNoDivisibility s\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ca9724c9-91c0-5532-9f53-59e7d9c1e2ae", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d22fe6663274f873bb5988ccb905e28a3e29e580ad6d004c02cbe9cf4279561e", "task_path": "tasks/nmp3_ca9724c9-91c0-5532-9f53-59e7d9c1e2ae", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ca9724c9-91c0-5532-9f53-59e7d9c1e2ae", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ca9a2def-ae9a-594c-b0ba-37ed4d1a0817", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\sqrt{x(y+z)}\\bigl(y^{2}+z^{2}-x^{2}-yz\\bigr)\\ge0.\n-- \\]\n-- (Equivalently, $\\sqrt{x(y+z)}(y^{2}+z^{2}-x^{2}-yz)+\\sqrt{y(z+x)}(z^{2}+x^{2}-y^{2}-zx)+\\sqrt{z(x+y)}(x^{2}+y^{2}-z^{2}-xy)\\ge0$.)\nmodule\n\n/-\nFormal statement of the cyclic inequality problem.\n\nThe variables are real numbers satisfying the three nonnegativity hypotheses.\n`cyclicTerm x y z` is the term whose first factor is\n`Real.sqrt (x * (y + z))` and whose second factor is\n`y ^ 2 + z ^ 2 - x ^ 2 - y * z`.\n\nThe three exhibited summands are\n`cyclicTerm x y z`, `cyclicTerm y z x`, and `cyclicTerm z x y`, in that order.\n-/\n\npublic import Mathlib.Analysis.Real.Sqrt\n\nnamespace Problem\n\n@[expose] public section\n\n/-- One summand of the cyclic sum:\n`sqrt (x * (y + z)) * (y ^ 2 + z ^ 2 - x ^ 2 - y * z)`. -/\nnoncomputable def cyclicTerm (x y z : ℝ) : ℝ :=\n Real.sqrt (x * (y + z)) * (y ^ 2 + z ^ 2 - x ^ 2 - y * z)\n\n/-- The cyclic sum displayed in the problem:\n`cyclicTerm x y z + cyclicTerm y z x + cyclicTerm z x y`. -/\nnoncomputable def cyclicSum (x y z : ℝ) : ℝ :=\n cyclicTerm x y z + cyclicTerm y z x + cyclicTerm z x y\n\n/-- The assertion to be proved: for all nonnegative real `x`, `y`, and `z`,\nthe cyclic sum is nonnegative. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 ≤ x → 0 ≤ y → 0 ≤ z → 0 ≤ cyclicSum x y z\n\nend\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ca9a2def-ae9a-594c-b0ba-37ed4d1a0817", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0fd38d697492fb975323dffa5a212872daa710a8d419408767d74a3691143a7f", "task_path": "tasks/nmp3_ca9a2def-ae9a-594c-b0ba-37ed4d1a0817", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ca9a2def-ae9a-594c-b0ba-37ed4d1a0817", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_caa7a1bb-71c1-5aa0-ba8a-8378d0a4a65b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $M$ and $N$ be two points inside triangle $ABC$ such that \n-- \\[\n-- \\angle MAB = \\angle NAC \\quad\\text{and}\\quad \\angle MBA = \\angle NBC.\n-- \\] \n-- Prove that \n-- \\[\n-- \\frac{AM\\cdot AN}{AB\\cdot AC}\\;+\\;\\frac{BM\\cdot BN}{BA\\cdot BC}\\;+\\;\\frac{CM\\cdot CN}{CA\\cdot CB}=1.\n-- \\]\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.Convex.Topology\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\n/-!\n# Formalization of an isogonal-conjugate distance identity\n\nThe source problem is the following. Let `M` and `N` be interior points of a\nnondegenerate triangle `ABC` in the Euclidean plane, and suppose that\n`∠MAB = ∠NAC` and `∠MBA = ∠NBC`. Then\n`AM * AN / (AB * AC) + BM * BN / (BA * BC) + CM * CN / (CA * CB) = 1`.\n\nThe declaration `Problem.Target` below is the corresponding universally\nquantified proposition. This file contains the statement only; no proof of the\ntarget is supplied.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- Points in the Euclidean plane, represented as `ℝ²`. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `X` lies in the (strict) interior of the triangle with vertices `A`, `B`,\nand `C`. The triangle region is represented by the convex hull of its three\nvertices, and strictness is represented by taking the topological interior. -/\ndef LiesInsideTriangle (A B C X : Point) : Prop :=\n X ∈ interior (convexHull ℝ ({A, B, C} : Set Point))\n\n/-- The main universally quantified assertion. The three vertices are assumed\nto be affinely independent, which is the standard nondegeneracy condition for a\ntriangle in the plane. Both `M` and `N` are assumed to be in the strict interior\nof the triangle, and the two displayed angle equalities are assumed. The\ncandidate conclusion is the displayed distance identity.\n\nAll distances are Euclidean distances; all divisions and products of distances\nare in `ℝ`. -/\ndef Target : Prop :=\n ∀ A B C M N : Point,\n AffineIndependent ℝ ![A, B, C] →\n LiesInsideTriangle A B C M →\n LiesInsideTriangle A B C N →\n EuclideanGeometry.angle M A B = EuclideanGeometry.angle N A C →\n EuclideanGeometry.angle M B A = EuclideanGeometry.angle N B C →\n (dist A M * dist A N) / (dist A B * dist A C) +\n (dist B M * dist B N) / (dist B A * dist B C) +\n (dist C M * dist C N) / (dist C A * dist C B) = 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "caa7a1bb-71c1-5aa0-ba8a-8378d0a4a65b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bd75d252d0e712cfb23fb134bdae44e81c677d87c41b22f3951a7447beb5402e", "task_path": "tasks/nmp3_caa7a1bb-71c1-5aa0-ba8a-8378d0a4a65b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "caa7a1bb-71c1-5aa0-ba8a-8378d0a4a65b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_caa8d4fd-90d9-5821-b3c7-4686fc6bdd28", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- \\[\n-- \\sqrt{\\frac{(x+y)(y+z)}{(x+y+z)^{2}}}+\n-- \\sqrt{\\frac{(y+z)(z+x)}{(x+y+z)^{2}}}+\n-- \\sqrt{\\frac{(z+x)(x+y)}{(x+y+z)^{2}}}\\ge\n-- 1+\\frac{27}{8}\\,\\frac{(x+y)(y+z)(z+x)}{(x+y+z)^{3}}\\,.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement\n\nThis file formalizes the inequality from `problem.md`. The variables are real\nnumbers satisfying the three strict positivity assumptions from the source.\nThe declaration below is a proposition; it is not proved here.\n-/\n\nnamespace Problem\n\n/-- The inequality stated in the problem, for positive real `x`, `y`, and `z`. -/\nnoncomputable def Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z →\n Real.sqrt (((x + y) * (y + z)) / (x + y + z) ^ 2) +\n Real.sqrt (((y + z) * (z + x)) / (x + y + z) ^ 2) +\n Real.sqrt (((z + x) * (x + y)) / (x + y + z) ^ 2) ≥\n 1 + (27 / 8 : ℝ) * (((x + y) * (y + z) * (z + x)) / (x + y + z) ^ 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "caa8d4fd-90d9-5821-b3c7-4686fc6bdd28", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "598cc484663291dcc2947ceeee251da78e78bf0dc435d9bc0a79e5f48e23b5e8", "task_path": "tasks/nmp3_caa8d4fd-90d9-5821-b3c7-4686fc6bdd28", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "caa8d4fd-90d9-5821-b3c7-4686fc6bdd28", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cacc56e7-3949-5258-8c22-4762ca3a680f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m$ and $n$ be relatively prime integers with $m>1$ and $n>1$. Prove that there exist positive integers $a$, $b$, and $c$ such that \n-- \\[m^{a}=1+n^{b}c\\]\n-- and $\\gcd(n,c)=1$ (i.e., $n$ and $c$ are relatively prime).\nimport Mathlib\n\n/-!\n# Formal statement for the relatively-prime-power representation problem\n\nLet `m` and `n` be relatively prime integers, both greater than one. The\nproblem asks for a proof that there exist positive integers `a`, `b`, and `c`\nsuch that `m ^ a = 1 + n ^ b * c` and `gcd n c = 1`.\n\n`m` and `n` are formalized as integers. The positive integers `a`, `b`, and\n`c` are formalized as natural numbers together with proofs that each is\npositive. The resulting equation is an integer equation. Integer gcd is\n`Int.gcd`, whose values are natural numbers.\n-/\n\nnamespace Problem\n\n/-- The integer-gcd formulation of relative primality. For integers `x` and\n`y`, this says that `gcd x y = 1`, where `Int.gcd` is the natural-number gcd of\ntheir absolute values. -/\ndef IntRelPrime (x y : ℤ) : Prop :=\n Int.gcd x y = 1\n\n/-- The witness assertion in the problem: there exist positive integers `a`,\n`b`, and `c` satisfying the displayed equation and with `n` coprime to `c`. -/\ndef HasPositiveWitness (m n : ℤ) : Prop :=\n ∃ a b c : ℕ,\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n m ^ a = 1 + n ^ b * (c : ℤ) ∧\n IntRelPrime n (c : ℤ)\n\n/-- The full universal assertion of the problem.\n\nFor every pair of relatively prime integers `m` and `n` with `m > 1` and\n`n > 1`, there exist positive integers `a`, `b`, and `c` such that\n`m ^ a = 1 + n ^ b * c` and `gcd n c = 1`. -/\ndef Target : Prop :=\n ∀ m n : ℤ,\n 1 < m → 1 < n → IntRelPrime m n → HasPositiveWitness m n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cacc56e7-3949-5258-8c22-4762ca3a680f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3e39e9059aacf55295b5d5c188e0d88db9d6f5cb22715eeda7b9f027e0be13e2", "task_path": "tasks/nmp3_cacc56e7-3949-5258-8c22-4762ca3a680f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cacc56e7-3949-5258-8c22-4762ca3a680f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cad7f814-0673-55d7-baca-82e0a2d88b40", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there exist infinitely many composite positive integers $n$ such that $n$ divides $2^{\\frac{n-1}{2}}+1$.\nimport Mathlib\n\n/-!\n# Infinitely many composite Euler pseudoprimes of a prescribed sign\n\nThis file formalizes the statement of the problem. It deliberately contains\nno proof of the target proposition.\n-/\n\nnamespace Problem\n\n/-- A natural number is composite when it is greater than one and is not prime.\n\nThis makes the phrase \"positive integer\" explicit through the inequality\n`1 < n`; every composite natural number is in particular positive. -/\ndef IsComposite (n : ℕ) : Prop :=\n 1 < n ∧ ¬ Nat.Prime n\n\n/-- The admissibility predicate for the problem.\n\nThe exponent is interpreted using natural-number division, as written in the\nsource: `(n - 1) / 2`. For composite `n`, the divisibility condition forces\n`n` to be odd, so this agrees with the usual integer half-exponent\n`(n - 1) / 2` on every admissible value. -/\ndef Admissible (n : ℕ) : Prop :=\n IsComposite n ∧ n ∣ ((2 : ℕ) ^ ((n - 1) / 2) + 1)\n\n/-- There exist infinitely many composite positive integers `n` such that\n`n` divides `2 ^ ((n - 1) / 2) + 1`. -/\ndef Target : Prop :=\n Set.Infinite {n : ℕ | Admissible n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cad7f814-0673-55d7-baca-82e0a2d88b40", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c01a49edf31c61c2a870af84f3e64d2779ff19e376ba8ab48a5a6ec562c96acc", "task_path": "tasks/nmp3_cad7f814-0673-55d7-baca-82e0a2d88b40", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cad7f814-0673-55d7-baca-82e0a2d88b40", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_caf08824-7581-5660-bbad-250326dec13a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\Bigl(\\sum_{\\text{cyc}}\\sqrt{\\frac{(a+b)(a+c)}{bc}}\\Bigr)(ab+bc+ca)\\ge 2(a+b+c)^2.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\nnamespace Problem\n\n/-- The assertion that `a`, `b`, and `c` are all strictly positive real numbers. -/\ndef IsPositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- One cyclic summand\n`sqrt (((a + b) * (a + c)) / (b * c))`. -/\nnoncomputable def cyclicTerm (a b c : ℝ) : ℝ :=\n Real.sqrt (((a + b) * (a + c)) / (b * c))\n\n/-- The cyclic sum over the three cyclic permutations of `(a, b, c)`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The inequality asserted for a fixed triple of positive real numbers. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n cyclicSum a b c * (a * b + b * c + c * a) ≥\n 2 * (a + b + c) ^ 2\n\n/-- The complete universally quantified statement of the problem. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, IsPositiveTriple a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "caf08824-7581-5660-bbad-250326dec13a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3f4caedba5770523d046b14383e4375dd98beece39777d5907f3a13012fae5e7", "task_path": "tasks/nmp3_caf08824-7581-5660-bbad-250326dec13a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "caf08824-7581-5660-bbad-250326dec13a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cb1ff431-845e-5c87-bf66-4b865937a036", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers \\(a,b,c\\) satisfying \\(ab+bc+ca\\le 1\\), prove that \n-- \\[\n-- a+b+c+\\sqrt3\\;\\ge\\;8abc\\!\\left(\\frac1{a^2+1}+\\frac1{b^2+1}+\\frac1{c^2+1}\\right).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility conditions stated in the problem: `a`, `b`, and `c` are\npositive real numbers and `ab + bc + ca ≤ 1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a ≤ 1\n\n/-- The desired inequality, with all divisions interpreted in the real numbers. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a + b + c + Real.sqrt 3 ≥\n 8 * a * b * c *\n (1 / (a ^ 2 + 1) + 1 / (b ^ 2 + 1) + 1 / (c ^ 2 + 1))\n\n/-- The full universal assertion of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cb1ff431-845e-5c87-bf66-4b865937a036", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "96eaefdabe0adca47fa073e60cc11e4b15e9d0f7054a2c8c9791ff0fbd4aa145", "task_path": "tasks/nmp3_cb1ff431-845e-5c87-bf66-4b865937a036", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cb1ff431-845e-5c87-bf66-4b865937a036", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cb33d981-1bcf-56e2-9ae5-38d0a6989dd3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_12$. Two players, Ana and Banana, play a game as follows. An integer $n\\ge k$ is written on a blackboard. The players move alternately, Ana moving first. On a move a player replaces the current number $m$ by an integer $m'$ satisfying $k\\le m' 2` and positions\n`n ≥ k`; this is represented literally using integers and the subtype of\nintegers at least `k`.\n-/\n\nnamespace Problem\n\n/-- The admissible game positions for a fixed integer lower bound `k`: all\nintegers `n` with `k ≤ n`. -/\ndef GamePosition (k : ℤ) : Type :=\n {n : ℤ // k ≤ n}\n\n/-- A legal move from an admissible position `m` to an admissible position\n`m'`: the new integer is strictly smaller than the old one and is coprime to\nit. The lower-bound condition `k ≤ m'` is carried by the subtype\n`GamePosition k`. -/\ndef Move (k : ℤ) (m m' : GamePosition k) : Prop :=\n m'.val < m.val ∧ Int.gcd m.val m'.val = 1\n\n/-- Banana wins as the second player from the admissible position `n`.\n\nThis is the recursive game-theoretic condition for a second-player win. If\nAna has no legal first move, the universal condition is vacuous and Banana\nwins, because the player unable to move loses. If Ana moves from `n` to `m`,\nthen Banana must have a legal reply from `m` to some `m'`, and from `m'`\n(where Ana is again the player to move) Banana must again have a winning\nstrategy. Recursion is well-founded because the `GamePosition` value strictly\ndecreases along every legal move. -/\ndef Good (k : ℤ) (n : GamePosition k) : Prop :=\n ∀ m : GamePosition k, Move k n m →\n ∃ m' : GamePosition k, ∃ _hm' : Move k m m', Good k m'\ntermination_by Int.toNat (n.val - k)\ndecreasing_by\n have hn : k ≤ n.val := n.property\n have hm : k ≤ m.val := m.property\n have h1 : m.val < n.val := (‹Move k n m›).1\n have h2 : m'.val < m.val := (‹Move k m m'›).1\n omega\n\n/-- A position is bad exactly when it is not good, i.e. when Banana does not\nhave a winning strategy. -/\ndef Bad (k : ℤ) (n : GamePosition k) : Prop :=\n ¬ Good k n\n\n/-- The hypothesis that the two integers `n` and `n'` have exactly the same\nprime divisors among the primes at most `k`. -/\ndef SameSmallPrimeDivisors (k n n' : ℤ) : Prop :=\n ∀ p : ℕ, Nat.Prime p → (p : ℤ) ≤ k → ((p : ℤ) ∣ n ↔ (p : ℤ) ∣ n')\n\n/-- The conclusion that the two admissible positions have the same status:\neither both are good, or both are bad. -/\ndef SameStatus (k : ℤ) (n n' : GamePosition k) : Prop :=\n (Good k n ∧ Good k n') ∨ (Bad k n ∧ Bad k n')\n\n/-- Formal statement of the source problem: for every integer `k > 2`, and all\nintegers `n, n' ≥ k`, if `n` and `n'` have the same prime divisors at most `k`,\nthen they are either both good or both bad. -/\ndef Target : Prop :=\n ∀ (k : ℤ), 2 < k →\n ∀ (n n' : ℤ), ∀ (_hn : k ≤ n), ∀ (_hn' : k ≤ n'),\n SameSmallPrimeDivisors k n n' →\n SameStatus k ⟨n, _hn⟩ ⟨n', _hn'⟩\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cb50b253-b089-5db4-becb-9024ef4bf030", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e0aec529bc57b0d1b267c301b9e5c66d428fc62c5d538fc07845e46345a31b17", "task_path": "tasks/nmp3_cb50b253-b089-5db4-becb-9024ef4bf030", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cb50b253-b089-5db4-becb-9024ef4bf030", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cb63da71-1683-5f24-a714-a2544d570ea0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given six positive numbers $a,b,c,d,e,f$ with $a \\sqrt{3(S+T)\\Bigl(S(bd+bf+df)+T(ac+ae+ce)\\Bigr)}.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\n/-!\n# Formalization of the six-variable inequality\n\nThe source problem asks to prove a strict real inequality for six positive\nnumbers in strictly increasing order. The target is stated as a proposition;\nno proof is supplied here.\n-/\n\nnamespace Problem\n\n/-- The sum `S = a + c + e` from the source problem. -/\ndef S (a c e : ℝ) : ℝ :=\n a + c + e\n\n/-- The sum `T = b + d + f` from the source problem. -/\ndef T (b d f : ℝ) : ℝ :=\n b + d + f\n\n/-- The left-hand side `2 * S * T` of the desired inequality. -/\ndef lhs (a b c d e f : ℝ) : ℝ :=\n 2 * S a c e * T b d f\n\n/-- The right-hand side\n`sqrt (3 * (S + T) * (S * (b*d + b*f + d*f) + T * (a*c + a*e + c*e)))`\nof the desired inequality. -/\nnoncomputable def rhs (a b c d e f : ℝ) : ℝ :=\n Real.sqrt\n (3 * (S a c e + T b d f) *\n (S a c e * (b * d + b * f + d * f) +\n T b d f * (a * c + a * e + c * e)))\n\n/-- The assertion of the source problem: for all positive real numbers\n`a < b < c < d < e < f`, the strict inequality `lhs > rhs` holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c d e f : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d → 0 < e → 0 < f →\n a < b → b < c → c < d → d < e → e < f →\n lhs a b c d e f > rhs a b c d e f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cb63da71-1683-5f24-a714-a2544d570ea0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b9875b08a93de53ba2bdac2991b2bb44d1f329032e964d5d01064e748bd7160e", "task_path": "tasks/nmp3_cb63da71-1683-5f24-a714-a2544d570ea0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cb63da71-1683-5f24-a714-a2544d570ea0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cb687b99-64db-54f9-a8ee-2545ef6d99b2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be positive integers such that \n-- $$a 0\n | n + 1 => 10 * Prefix digits n + (digits n).val\n\n/-- `m` has a prime divisor strictly greater than `bound`. -/\ndef HasPrimeDivisorGreaterThan (bound m : ℕ) : Prop :=\n ∃ p : ℕ, Nat.Prime p ∧ bound < p ∧ p ∣ m\n\n/-- The assertion of the problem: for every infinite sequence of non-zero decimal\ndigits, at some non-empty prefix the current integer has a prime divisor greater\nthan 100. -/\ndef Target : Prop :=\n ∀ digits : ℕ → DecimalDigit,\n ∃ n : ℕ, 0 < n ∧ HasPrimeDivisorGreaterThan 100 (Prefix digits n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cb80edc4-5422-5532-8d46-aed0b2018d39", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "81433841171e2a216e914209837e352697e0df1cb57b57548cf24eb20bb82456", "task_path": "tasks/nmp3_cb80edc4-5422-5532-8d46-aed0b2018d39", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cb80edc4-5422-5532-8d46-aed0b2018d39", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cb97e5b3-69e9-58ae-9696-c6ea02a32406", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $AA_1$, $BB_1$, $CC_1$ be the altitudes of an acute‑angled, non‑isosceles triangle $ABC$, and let $A_2$, $B_2$, $C_2$ be the points where the excircles opposite $A$, $B$, $C$ touch the sides $BC$, $CA$, $AB$, respectively. Prove that the line $B_1C_1$ is tangent to the incircle of $ABC$ if and only if $A_1$ lies on the circumcircle of $\\triangle A_2B_2C_2\\,. $\nimport Mathlib\n\n/-!\n# Formal statement of a triangle tangency/concyclicity criterion\n\nThis file fixes a coordinate model for the Euclidean plane and states the\niff claimed in `problem.md`. It only defines the geometric objects and the\ntarget proposition; no proof of the target is supplied.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- Cartesian coordinates for the Euclidean plane. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- The dot product of two displacement vectors. -/\ndef dot (u v : Point) : ℝ := u.1 * v.1 + u.2 * v.2\n\n/-- The signed two-dimensional cross product (twice the signed area). -/\ndef cross (u v : Point) : ℝ := u.1 * v.2 - u.2 * v.1\n\n/-- Vector subtraction. -/\ndef vsub (u v : Point) : Point := (u.1 - v.1, u.2 - v.2)\n\n/-- Vector addition. -/\ndef vadd (u v : Point) : Point := (u.1 + v.1, u.2 + v.2)\n\n/-- Scalar multiplication of a vector. -/\ndef smul (r : ℝ) (u : Point) : Point := (r * u.1, r * u.2)\n\n/-- Squared Euclidean norm. -/\ndef sqNorm (u : Point) : ℝ := u.1 ^ 2 + u.2 ^ 2\n\n/-- Squared Euclidean distance. -/\ndef sqDist (P Q : Point) : ℝ := sqNorm (vsub P Q)\n\n/-- Euclidean distance in the coordinate plane. -/\ndef dist (P Q : Point) : ℝ := Real.sqrt (sqDist P Q)\n\n/-- The length of side `BC`, opposite the vertex `A`. -/\ndef sideA (_A B C : Point) : ℝ := dist B C\n\n/-- The length of side `CA`, opposite the vertex `B`. -/\ndef sideB (A _B C : Point) : ℝ := dist C A\n\n/-- The length of side `AB`, opposite the vertex `C`. -/\ndef sideC (A B _C : Point) : ℝ := dist A B\n\n/-- The perimeter of triangle `ABC`. -/\ndef perimeter (A B C : Point) : ℝ := sideA A B C + sideB A B C + sideC A B C\n\n/-- The semiperimeter of triangle `ABC`. -/\ndef semiperimeter (A B C : Point) : ℝ := perimeter A B C / 2\n\n/-- Twice the signed area of triangle `ABC`. -/\ndef twiceSignedArea (A B C : Point) : ℝ := cross (vsub B A) (vsub C A)\n\n/-- The three vertices are non-collinear, so form a genuine triangle. -/\ndef IsNondegenerateTriangle (A B C : Point) : Prop :=\n twiceSignedArea A B C ≠ 0\n\n/-- All three interior angles are strictly acute. -/\ndef IsAcuteTriangle (A B C : Point) : Prop :=\n 0 < dot (vsub B A) (vsub C A) ∧\n 0 < dot (vsub C B) (vsub A B) ∧\n 0 < dot (vsub A C) (vsub B C)\n\n/-- No two side lengths of the triangle are equal. -/\ndef IsNonIsoscelesTriangle (A B C : Point) : Prop :=\n sideA A B C ≠ sideB A B C ∧\n sideA A B C ≠ sideC A B C ∧\n sideB A B C ≠ sideC A B C\n\n/-- The triangle is nondegenerate, acute-angled and non-isosceles. -/\ndef AcuteNonIsoscelesTriangle (A B C : Point) : Prop :=\n IsNondegenerateTriangle A B C ∧\n IsAcuteTriangle A B C ∧\n IsNonIsoscelesTriangle A B C\n\n/-- The orthogonal projection of `P` onto the line through distinct `Q` and `R`. -/\ndef orthogonalProjection (P Q R : Point) : Point :=\n let d : Point := vsub R Q\n let t : ℝ := dot (vsub P Q) d / sqNorm d\n vadd Q (smul t d)\n\n/-- The foot `A₁` of the altitude from `A` to `BC`. -/\ndef altitudeFootA (A B C : Point) : Point :=\n orthogonalProjection A B C\n\n/-- The foot `B₁` of the altitude from `B` to `CA`. -/\ndef altitudeFootB (A B C : Point) : Point :=\n orthogonalProjection B C A\n\n/-- The foot `C₁` of the altitude from `C` to `AB`. -/\ndef altitudeFootC (A B C : Point) : Point :=\n orthogonalProjection C A B\n\n/-- The contact point of the excircle opposite `A` with side `BC`.\nThe formula puts it on segment `BC`, at distances `s - c` from `B` and\n`s - b` from `C`, where `a = |BC|`, `b = |CA|`, `c = |AB|`, and `s`\nis the semiperimeter. -/\ndef excircleTouchA (A B C : Point) : Point :=\n vadd B (smul ((semiperimeter A B C - sideC A B C) / sideA A B C)\n (vsub C B))\n\n/-- The contact point of the excircle opposite `B` with side `CA`.\nIt is at distance `s - a` from `C` and `s - c` from `A`. -/\ndef excircleTouchB (A B C : Point) : Point :=\n vadd C (smul ((semiperimeter A B C - sideA A B C) / sideB A B C)\n (vsub A C))\n\n/-- The contact point of the excircle opposite `C` with side `AB`.\nIt is at distance `s - b` from `A` and `s - a` from `B`. -/\ndef excircleTouchC (A B C : Point) : Point :=\n vadd A (smul ((semiperimeter A B C - sideB A B C) / sideC A B C)\n (vsub B A))\n\n/-- Affine combination with three scalar weights. -/\ndef weighted3 (wA wB wC : ℝ) (A B C : Point) : Point :=\n vadd (smul wA A) (vadd (smul wB B) (smul wC C))\n\n/-- The incenter, in Cartesian barycentric coordinates with weights\n`a : b : c` on `A : B : C`. -/\ndef incenter (A B C : Point) : Point :=\n weighted3\n (sideA A B C / perimeter A B C)\n (sideB A B C / perimeter A B C)\n (sideC A B C / perimeter A B C)\n A B C\n\n/-- The inradius, written as area over semiperimeter. -/\ndef inradius (A B C : Point) : ℝ :=\n |twiceSignedArea A B C| / perimeter A B C\n\n/-- A circle, represented by its center and radius. -/\nstructure Circle where\n center : Point\n radius : ℝ\n\n/-- The incircle of triangle `ABC`. -/\ndef incircle (A B C : Point) : Circle :=\n { center := incenter A B C, radius := inradius A B C }\n\n/-- A point lies on a circle when its squared distance to the center equals\nthe square of the radius. -/\ndef OnCircle (Γ : Circle) (P : Point) : Prop :=\n sqDist P Γ.center = Γ.radius ^ 2\n\n/-- `X` lies on the (unique) circumcircle of the non-collinear triangle\nwith vertices `P`, `Q`, `R`. This is expressed by the existence of the\nunique positive-radius circle through all four points. -/\ndef OnCircumcircle (X P Q R : Point) : Prop :=\n ∃ Γ : Circle,\n Γ.radius > 0 ∧\n OnCircle Γ P ∧ OnCircle Γ Q ∧ OnCircle Γ R ∧\n (∀ Γ' : Circle,\n Γ'.radius > 0 →\n OnCircle Γ' P → OnCircle Γ' Q → OnCircle Γ' R →\n Γ' = Γ) ∧\n OnCircle Γ X\n\n/-- The line through `P` and `Q` is tangent to the circle `Γ`.\nThe circle is required to have positive radius and the two points defining\nthe line are required to be distinct. The distance from the center to the\nline is compared with the radius after squaring. -/\ndef LineTangentCircle (P Q : Point) (Γ : Circle) : Prop :=\n P ≠ Q ∧\n 0 < Γ.radius ∧\n (cross (vsub Q P) (vsub Γ.center P)) ^ 2 =\n Γ.radius ^ 2 * sqDist P Q\n\n/-- The per-triangle tangency/concyclicity statement, with all six auxiliary\npoints and the incircle constructed from `A`, `B`, `C`. -/\ndef TangencyCriterion (A B C : Point) : Prop :=\n let A₁ : Point := altitudeFootA A B C\n let B₁ : Point := altitudeFootB A B C\n let C₁ : Point := altitudeFootC A B C\n let A₂ : Point := excircleTouchA A B C\n let B₂ : Point := excircleTouchB A B C\n let C₂ : Point := excircleTouchC A B C\n LineTangentCircle B₁ C₁ (incircle A B C) ↔\n OnCircumcircle A₁ A₂ B₂ C₂\n\n/-- The full universal statement of the problem: for every acute,\nnon-isosceles triangle `ABC`, the line through the feet of the altitudes from\n`B` and `C` is tangent to the incircle if and only if the foot of the altitude\nfrom `A` lies on the circumcircle of the triangle of the three opposite\nexcircle contact points. -/\ndef Target : Prop :=\n ∀ A B C : Point,\n AcuteNonIsoscelesTriangle A B C →\n TangencyCriterion A B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cb97e5b3-69e9-58ae-9696-c6ea02a32406", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a30065532edc2ef7247461cb24ba3e33e11ec7ab490464520399e2286ab71cbf", "task_path": "tasks/nmp3_cb97e5b3-69e9-58ae-9696-c6ea02a32406", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cb97e5b3-69e9-58ae-9696-c6ea02a32406", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cba05be4-c555-56a2-84f1-20c02cb68cc5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A,B\\in\\mathcal M_n(\\mathbb C)$ satisfy $A^2+B^2=2AB$. Prove that for every complex number $x$,\n-- \\[\n-- \\det(A-xI_n)=\\det(B-xI_n).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks to prove that two `n × n` complex matrices `A` and `B`\nsatisfying `A ^ 2 + B ^ 2 = 2 • (A * B)` have equal characteristic determinants\nat every complex value `x`. This file states that assertion as a `Prop`-valued\ndefinition; it deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The matrix equation `A ^ 2 + B ^ 2 = 2AB`. -/\ndef Hypothesis (n : ℕ) (A B : Matrix (Fin n) (Fin n) ℂ) : Prop :=\n A ^ 2 + B ^ 2 = (2 : ℂ) • (A * B)\n\n/-- The conclusion that the two characteristic determinants agree at every\ncomplex value `x`. -/\ndef CharacteristicDeterminantsAgree\n (n : ℕ) (A B : Matrix (Fin n) (Fin n) ℂ) : Prop :=\n ∀ x : ℂ,\n Matrix.det (A - x • (1 : Matrix (Fin n) (Fin n) ℂ)) =\n Matrix.det (B - x • (1 : Matrix (Fin n) (Fin n) ℂ))\n\n/-- Main target: for every natural number `n`, every pair of `n × n` complex\nmatrices `A` and `B` satisfying `A ^ 2 + B ^ 2 = 2AB`, and every complex `x`,\nthe determinants of `A - xI` and `B - xI` are equal. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (A B : Matrix (Fin n) (Fin n) ℂ),\n Hypothesis n A B → CharacteristicDeterminantsAgree n A B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cba05be4-c555-56a2-84f1-20c02cb68cc5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "85b24aa116f23467ad7d2d7ba6e82069f4c77362460f132baa91af6e1d21c490", "task_path": "tasks/nmp3_cba05be4-c555-56a2-84f1-20c02cb68cc5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cba05be4-c555-56a2-84f1-20c02cb68cc5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cbd60439-2e7d-5e97-977c-8a02438f5a95", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For each integer $1\\le i\\le 9$ and each $T\\in\\mathbb N$, let $d_i(T)$ denote the total number of times the digit $i$ appears when all multiples of $1829$ between $1$ and $T$ inclusive are written in base 10. Prove that there exist infinitely many $T\\in\\mathbb N$ such that the multiset $\\{d_1(T),d_2(T),\\dots,d_9(T)\\}$ contains exactly two distinct values.\nmodule\n\npublic import Mathlib\n\n@[expose] public section\n\n/-!\n# Formal statement of the 1829 digit-occurrence problem\n\nThis file states the problem without proving it. The target is a `Prop`-valued\ndefinition. We use `Nat.digits 10 n`, Mathlib's canonical base-10 digit list,\nwhich contains no leading zeroes and is in little-endian order. Only the\nnumber of occurrences of a digit is used, so the order is irrelevant.\n-/\n\nnamespace Problem\n\n/-- The number of occurrences of the decimal digit `i` in the canonical\nbase-10 expansion of the natural number `n`. For `n = 0`, `Nat.digits 10 n`\nis the empty list; all numbers summed over below are positive. -/\ndef digitOccurrencesInDecimal (i n : ℕ) : ℕ :=\n (Nat.digits 10 n).count i\n\n/-- The finite set of positive multiples of `1829` lying in the interval\n`[1, T]`. -/\ndef multiplesOf1829UpTo (T : ℕ) : Finset ℕ :=\n (Finset.Icc 1 T).filter (fun n : ℕ => 1829 ∣ n)\n\n/-- `d_i(T)`: the total number of occurrences of digit `i` when every multiple\nof `1829` in `[1, T]` is written in base 10. -/\ndef digitCount (i T : ℕ) : ℕ :=\n (multiplesOf1829UpTo T).sum (fun n : ℕ => digitOccurrencesInDecimal i n)\n\n/-- The multiset `{d_1(T), d_2(T), ..., d_9(T)}` from the problem. -/\ndef digitCountMultiset (T : ℕ) : Multiset ℕ :=\n (Finset.Icc 1 9).val.map (fun i : ℕ => digitCount i T)\n\n/-- The set of distinct values appearing in\n`{d_1(T), d_2(T), ..., d_9(T)}`. -/\ndef distinctDigitCountValues (T : ℕ) : Finset ℕ :=\n (digitCountMultiset T).toFinset\n\n/-- The admissibility condition on `T`: the multiset of the nine digit counts\nhas exactly two distinct values. -/\ndef AdmissibleT (T : ℕ) : Prop :=\n (distinctDigitCountValues T).card = 2\n\n/-- The assertion to be proved: there are infinitely many natural numbers `T`\nfor which the multiset `{d_1(T), ..., d_9(T)}` contains exactly two distinct\nvalues. -/\ndef Target : Prop :=\n Set.Infinite {T : ℕ | AdmissibleT T}\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cbd60439-2e7d-5e97-977c-8a02438f5a95", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "996f23a5230bc1c3e1efa41a8009379aeb3f4033ef15a9fab7258e708b5045de", "task_path": "tasks/nmp3_cbd60439-2e7d-5e97-977c-8a02438f5a95", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cbd60439-2e7d-5e97-977c-8a02438f5a95", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cbe21a45-9244-58ba-a98b-1009c77414a4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(A,B,C\\) be the angles of an acute triangle (\\(A,B,C>0\\), \\(A+B+C=\\pi\\)). Prove that \n-- \\[\n-- \\sqrt{1-\\sin A\\sin B}+\\sqrt{1-\\sin B\\sin C}+\\sqrt{1-\\sin C\\sin A}\\ge\\frac32\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: an inequality for the angles of an acute triangle\n\nThe source problem asks for a proof of the inequality\n\n`sqrt (1 - sin A * sin B) + sqrt (1 - sin B * sin C)\n + sqrt (1 - sin C * sin A) ≥ 3 / 2`\n\nfor all angles `A, B, C` of an acute triangle.\n\nThe unproved mathematical assertion is represented by the proposition-valued\ndefinition `Problem.Target`. No proof of it is supplied.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- `A`, `B`, and `C` are the three (strictly) acute angles of a triangle,\nmeasured in radians. Thus each angle is strictly between `0` and `π / 2`,\nand the three angles sum to `π`. -/\ndef IsAcuteTriangleAngles (A B C : ℝ) : Prop :=\n 0 < A ∧ 0 < B ∧ 0 < C ∧\n A + B + C = Real.pi ∧\n A < Real.pi / 2 ∧ B < Real.pi / 2 ∧ C < Real.pi / 2\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef inequalityLHS (A B C : ℝ) : ℝ :=\n Real.sqrt (1 - Real.sin A * Real.sin B) +\n Real.sqrt (1 - Real.sin B * Real.sin C) +\n Real.sqrt (1 - Real.sin C * Real.sin A)\n\n/-- The assertion to be proved: for every acute triangle with angles `A`, `B`,\nand `C`, the displayed sum of square roots is at least `3 / 2`. -/\ndef Target : Prop :=\n ∀ A B C : ℝ, IsAcuteTriangleAngles A B C →\n (3 : ℝ) / 2 ≤ inequalityLHS A B C\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cbe21a45-9244-58ba-a98b-1009c77414a4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9fdd8e2d766f5548c777fefa8aa934cf184571a2838cdeea797e8b3ff403a90c", "task_path": "tasks/nmp3_cbe21a45-9244-58ba-a98b-1009c77414a4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cbe21a45-9244-58ba-a98b-1009c77414a4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cbe89300-99af-5050-af45-13e24bab2df3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the lengths of the sides of an acute‑angled triangle. Prove that \n-- \\[\n-- \\sum_{\\text{sym}}a^{2}b-\\sum a^{3}\\le\n-- \\sqrt{\\Bigl(\\sum a^{2}\\Bigr)\\Bigl(2\\sum a^{2}b^{2}-\\sum a^{4}\\Bigr)},\n-- \\] \n-- where $\\sum a^{2}=a^{2}+b^{2}+c^{2}$, $\\sum a^{3}=a^{3}+b^{3}+c^{3}$, $\\sum a^{2}b^{2}=a^{2}b^{2}+b^{2}c^{2}+c^{2}a^{2}$, $\\sum a^{4}=a^{4}+b^{4}+c^{4}$, and $\\displaystyle\\sum_{\\text{sym}}a^{2}b=a^{2}b+a^{2}c+b^{2}a+b^{2}c+c^{2}a+c^{2}b\\,. $\nimport Mathlib\n\n/-!\n# Formal statement of the acute-triangle inequality\n\nThe source problem asks to prove, for the side lengths `a`, `b`, and `c` of an\nacute-angled triangle,\n\n`sum_sym a^2 b - sum a^3 <= sqrt ((sum a^2) * (2 * sum a^2 b^2 - sum a^4))`.\n\nAll sums are expanded explicitly below. The target is the universally\nquantified implication asserting the inequality under the side-length and\nacute-angle hypotheses.\n-/\n\nnamespace Problem\n\n/-- The real numbers `a`, `b`, and `c` are side lengths of a nondegenerate\nacute-angled triangle.\n\nThe three strict triangle inequalities express nondegeneracy. For a\nnondegenerate triangle, the three strict inequalities\n`a^2 < b^2 + c^2`, `b^2 < c^2 + a^2`, and `c^2 < a^2 + b^2` are exactly the\nconditions that the three angles are acute (by the law of cosines). -/\ndef IsAcuteTriangleSides (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b ∧\n a ^ 2 < b ^ 2 + c ^ 2 ∧\n b ^ 2 < c ^ 2 + a ^ 2 ∧\n c ^ 2 < a ^ 2 + b ^ 2\n\n/-- The symmetric sum `∑_sym a^2 b`, expanded as the six distinct terms\n`a^2 b + a^2 c + b^2 a + b^2 c + c^2 a + c^2 b`. -/\ndef symSumSqMul (a b c : ℝ) : ℝ :=\n a ^ 2 * b + a ^ 2 * c + b ^ 2 * a + b ^ 2 * c + c ^ 2 * a + c ^ 2 * b\n\n/-- The cyclic sum `∑ a^2 = a^2 + b^2 + c^2`. -/\ndef sumSq (a b c : ℝ) : ℝ :=\n a ^ 2 + b ^ 2 + c ^ 2\n\n/-- The cyclic sum `∑ a^3 = a^3 + b^3 + c^3`. -/\ndef sumCube (a b c : ℝ) : ℝ :=\n a ^ 3 + b ^ 3 + c ^ 3\n\n/-- The cyclic sum `∑ a^2 b^2 = a^2 b^2 + b^2 c^2 + c^2 a^2`. -/\ndef sumSqSq (a b c : ℝ) : ℝ :=\n a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2\n\n/-- The cyclic sum `∑ a^4 = a^4 + b^4 + c^4`. -/\ndef sumFourth (a b c : ℝ) : ℝ :=\n a ^ 4 + b ^ 4 + c ^ 4\n\n/-- The inequality asserted in the source problem for fixed side lengths\n`a`, `b`, and `c`, under the assumption that they are the side lengths of an\nacute-angled triangle. -/\ndef AcuteTriangleInequality (a b c : ℝ) : Prop :=\n IsAcuteTriangleSides a b c →\n symSumSqMul a b c - sumCube a b c ≤\n Real.sqrt\n (sumSq a b c * (2 * sumSqSq a b c - sumFourth a b c))\n\n/-- The full universally quantified statement of the problem: for all real\nnumbers `a`, `b`, and `c`, if they are the side lengths of an acute-angled\ntriangle, then the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, AcuteTriangleInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cbe89300-99af-5050-af45-13e24bab2df3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0bd587a12a0c48523dac2cb2e8e97c93093a18c11e9367dc0675dd3c8e70b876", "task_path": "tasks/nmp3_cbe89300-99af-5050-af45-13e24bab2df3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cbe89300-99af-5050-af45-13e24bab2df3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cc0721c9-336b-5d19-bbb5-2bdd6bc26df3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be nonnegative real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\sqrt[3]{3a^{2}+2ab+3b^{2}}+\\sqrt[3]{3b^{2}+2bc+3c^{2}}+\\sqrt[3]{3c^{2}+2ca+3a^{2}}\\ge 6.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- Real exponentiation by the real number `1/3`. On nonnegative inputs this is the\nprincipal real cube root. -/\nnoncomputable def cubeRoot (x : ℝ) : ℝ :=\n Real.rpow x ((1 : ℝ) / 3)\n\n/-- The admissibility condition on the triple `(a, b, c)`: all entries are\nnonnegative real numbers and their sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a + b + c = 3\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n cubeRoot (3 * a ^ 2 + 2 * a * b + 3 * b ^ 2) +\n cubeRoot (3 * b ^ 2 + 2 * b * c + 3 * c ^ 2) +\n cubeRoot (3 * c ^ 2 + 2 * c * a + 3 * a ^ 2)\n\n/-- The inequality asserted by the problem for a fixed triple `(a, b, c)`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ 6\n\n/-- The assertion of the problem: for every admissible nonnegative real\ntriple `(a, b, c)`, the sum of the three cube roots is at least `6`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc0721c9-336b-5d19-bbb5-2bdd6bc26df3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a1593327f133f8069ece65df5a4ee94040d00c2b8c5335bd0c2f6c62eb8e768c", "task_path": "tasks/nmp3_cc0721c9-336b-5d19-bbb5-2bdd6bc26df3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc0721c9-336b-5d19-bbb5-2bdd6bc26df3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cc1c23be-2bfe-5e06-b61e-37544ec53121", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{a}{a+b+1}+\\frac{b}{b+c+1}+\\frac{c}{c+a+1}\\le 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility conditions for the variables in the problem:\n`a`, `b`, and `c` are positive real numbers whose sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The inequality asserted in the problem, with the variables ranging over `ℝ`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a / (a + b + 1) + b / (b + c + 1) + c / (c + a + 1) ≤ 1\n\n/-- The full universal form of the assertion to be proved: for every triple of\npositive real numbers `a`, `b`, `c` satisfying `a + b + c = 3`, the displayed\ncyclic inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc1c23be-2bfe-5e06-b61e-37544ec53121", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "46748619d3738de2a280ef57be9aa628e7d1215f5d5b056b9a64128e42144e1f", "task_path": "tasks/nmp3_cc1c23be-2bfe-5e06-b61e-37544ec53121", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc1c23be-2bfe-5e06-b61e-37544ec53121", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cc496a26-5fcc-5e11-926b-7aa6b74f3c4c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a^{2}+b^{2}+c^{2}=3$. Prove that \n-- \\[\n-- \\frac{a^{3}+abc}{(b+c)^{2}}+\\frac{b^{3}+abc}{(a+c)^{2}}+\\frac{c^{3}+abc}{(a+b)^{2}}\\ge \\frac{3}{2}\\,. \n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the inequality problem\n\nThis file contains only statement-level declarations. The target proposition is\na definition whose body is the asserted inequality; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The left-hand side appearing in the inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (a ^ 3 + a * b * c) / (b + c) ^ 2 +\n (b ^ 3 + a * b * c) / (a + c) ^ 2 +\n (c ^ 3 + a * b * c) / (a + b) ^ 2\n\n/-- The assertion of the problem: for all positive real `a`, `b`, `c` satisfying\n`a^2 + b^2 + c^2 = 3`, the displayed left-hand side is at least `3/2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = 3 →\n (3 : ℝ) / 2 ≤ LHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc496a26-5fcc-5e11-926b-7aa6b74f3c4c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "01a26948e3f9fee6930251c22f19206746011756c04b8c71a5821174ea563a14", "task_path": "tasks/nmp3_cc496a26-5fcc-5e11-926b-7aa6b74f3c4c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc496a26-5fcc-5e11-926b-7aa6b74f3c4c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cc4da2a5-5c57-5a37-89b1-7321484597ff", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- The squares of an $m\\times n$ board (with $m,n\\ge2$) are labeled with the integers $1,2,\\dots,mn$ such that any two consecutive labels $i$ and $i+1$ occupy squares that share a side. Prove that there exists an integer $k$ ($1\\le k\\le mn-3$) for which the squares labelled $k$ and $k+3$ also share a side.\nimport Mathlib\n\n/-!\n# Statement formalization: adjacent labels three apart on a rectangular board\n\nThis file states the target proposition from `problem.md`. It contains no proof of\nthe proposition. An `m × n` board is represented by the type `Fin m × Fin n` of\nits squares; labels are integer-valued functions satisfying the stated bijectivity\nand adjacency properties.\n-/\n\nnamespace Problem\n\n/-- The squares of an `m × n` board, indexed by row and column. -/\nabbrev Square (m n : ℕ) : Type := Fin m × Fin n\n\n/--\nTwo board squares share a side exactly when they lie in the same row and their\ncolumn indices differ by one, or they lie in the same column and their row indices\ndiffer by one.\n-/\ndef SideAdjacent (m n : ℕ) (p q : Square m n) : Prop :=\n (p.1 = q.1 ∧\n (p.2.val + 1 = q.2.val ∨ q.2.val + 1 = p.2.val)) ∨\n (p.2 = q.2 ∧\n (p.1.val + 1 = q.1.val ∨ q.1.val + 1 = p.1.val))\n\n/--\nA labeling of the `m × n` board by the integers `1, …, m * n`: every square\nreceives a label in that integer interval, and every integer in that interval is\nthe label of a unique square.\n-/\ndef IsLabeling (m n : ℕ) (L : Square m n → ℤ) : Prop :=\n (∀ p : Square m n, 1 ≤ L p ∧ L p ≤ (m * n : ℤ)) ∧\n (∀ i : ℤ, 1 ≤ i → i ≤ (m * n : ℤ) →\n ∃! p : Square m n, L p = i)\n\n/--\nEvery ordered pair of squares whose labels are consecutive integers (the second\nlabel being one greater than the first) consists of squares sharing a side.\n-/\ndef ConsecutiveLabelsAdjacent (m n : ℕ) (L : Square m n → ℤ) : Prop :=\n ∀ p q : Square m n, L p + 1 = L q → SideAdjacent m n p q\n\n/--\nThere is an integer `k` with `1 ≤ k ≤ m * n - 3` such that the squares carrying\nlabels `k` and `k + 3` share a side.\n-/\ndef HasAdjacentLabelsThreeApart (m n : ℕ) (L : Square m n → ℤ) : Prop :=\n ∃ k : ℤ, 1 ≤ k ∧ k ≤ (m * n : ℤ) - 3 ∧\n ∃ p q : Square m n,\n L p = k ∧ L q = k + 3 ∧ SideAdjacent m n p q\n\n/--\nThe assertion to be proved: for every rectangular board with both side lengths\nat least two, and for every labeling of its squares by `1, …, m * n` in which\nconsecutive labels occupy side-adjacent squares, there exists an integer `k` in\nthe stated range for which the squares labeled `k` and `k + 3` share a side.\n-/\ndef Target : Prop :=\n ∀ (m n : ℕ), 2 ≤ m → 2 ≤ n →\n ∀ L : Square m n → ℤ,\n IsLabeling m n L →\n ConsecutiveLabelsAdjacent m n L →\n HasAdjacentLabelsThreeApart m n L\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc4da2a5-5c57-5a37-89b1-7321484597ff", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5461308e82c0097476ef77f8dc8e66d306fb45df2e62075b35b0a6e92191ae9b", "task_path": "tasks/nmp3_cc4da2a5-5c57-5a37-89b1-7321484597ff", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc4da2a5-5c57-5a37-89b1-7321484597ff", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cc4fe8ad-0876-5d91-85c8-ac41c910f23c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute triangle. Let $AD$ and $BE$ be the altitudes from $A$ and $B$, with $D\\in BC$ and $E\\in AC$. Let $\\omega_{AD}$ and $\\omega_{BE}$ be the circles with diameters $AD$ and $BE$, respectively, and let $S,T$ be their two intersection points. Prove that \n-- \\[\n-- \\angle ACS = \\angle BCT.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean plane used for the problem. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A triangle `ABC` is acute when each of its three interior angles is strictly less\nthan a right angle. This also rules out degeneracy (coincident vertices and\ncollinearity). -/\ndef AcuteTriangle (A B C : Point) : Prop :=\n EuclideanGeometry.angle A B C < Real.pi / 2 ∧\n EuclideanGeometry.angle B C A < Real.pi / 2 ∧\n EuclideanGeometry.angle C A B < Real.pi / 2\n\n/-- `D` is the foot on the side `BC` of the altitude from `A`: it lies on the\nclosed segment from `B` to `C`, and the vector `AD` is perpendicular to `BC`. -/\ndef IsAltitudeFoot (A D B C : Point) : Prop :=\n D ∈ segment ℝ B C ∧ inner ℝ (A - D) (B - C) = 0\n\n/-- The circle having the segment joining `X` and `Y` as a diameter. -/\ndef circleWithDiameter (X Y : Point) : EuclideanGeometry.Sphere Point :=\n EuclideanGeometry.Sphere.ofDiameter X Y\n\n/-- `S` and `T` are precisely the two intersection points of the two circles:\nthey are distinct, both lie on each circle, and every common point is one of\nthem. This is an unordered description of the pair of intersection points. -/\ndef AreTheTwoIntersectionPoints\n (ω₁ ω₂ : EuclideanGeometry.Sphere Point) (S T : Point) : Prop :=\n S ≠ T ∧\n S ∈ ω₁ ∧ S ∈ ω₂ ∧\n T ∈ ω₁ ∧ T ∈ ω₂ ∧\n ∀ X : Point, X ∈ ω₁ → X ∈ ω₂ → X = S ∨ X = T\n\n/-- The statement of the problem: in an acute triangle `ABC`, if `D` and `E`\nare the feet of the altitudes from `A` and `B`, and if `S` and `T` are the two\nintersection points of the circles with diameters `AD` and `BE`, then\n`∠ACS = ∠BCT`. -/\ndef Target : Prop :=\n ∀ (A B C D E S T : Point),\n AcuteTriangle A B C →\n IsAltitudeFoot A D B C →\n IsAltitudeFoot B E A C →\n AreTheTwoIntersectionPoints\n (circleWithDiameter A D) (circleWithDiameter B E) S T →\n EuclideanGeometry.angle A C S = EuclideanGeometry.angle B C T\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc4fe8ad-0876-5d91-85c8-ac41c910f23c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f84860bdeaa4008e5b4a931a333c3aa0a2b19e7c2ccf6452103d734fbc38a08a", "task_path": "tasks/nmp3_cc4fe8ad-0876-5d91-85c8-ac41c910f23c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc4fe8ad-0876-5d91-85c8-ac41c910f23c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cc675195-a093-54d4-a1d0-6c6217689dd6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $a,b,c$,\n-- \\[\n-- \\sum_{cyc}\\frac{a}{a+\\sqrt{a^{2}+3bc}}\\le 1,\n-- \\]\n-- with equality if and only if $a=b=c$.\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The cyclic sum appearing in the problem:\n`a / (a + sqrt (a^2 + 3bc)) + b / (b + sqrt (b^2 + 3ca))\n + c / (c + sqrt (c^2 + 3ab))`. -/\ndef CyclicSum (a b c : ℝ) : ℝ :=\n a / (a + Real.sqrt (a ^ 2 + 3 * b * c)) +\n b / (b + Real.sqrt (b ^ 2 + 3 * c * a)) +\n c / (c + Real.sqrt (c ^ 2 + 3 * a * b))\n\n/-- The equality condition `a = b = c`, represented as the conjunction of the\ntwo adjacent equalities. -/\ndef AllEqual (a b c : ℝ) : Prop :=\n a = b ∧ b = c\n\n/-- The complete assertion of the problem: for all positive real numbers\n`a`, `b`, and `c`, the cyclic sum is at most one, and it equals one exactly\nwhen `a = b = c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n CyclicSum a b c ≤ 1 ∧ (CyclicSum a b c = 1 ↔ AllEqual a b c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc675195-a093-54d4-a1d0-6c6217689dd6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "49f4d08c5dd5f778ae7d3279a1fd79dfbaa367458dae832f48f1d8ed5be7e5d4", "task_path": "tasks/nmp3_cc675195-a093-54d4-a1d0-6c6217689dd6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc675195-a093-54d4-a1d0-6c6217689dd6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cc76b175-d866-5ddb-b0bd-609025f9aabb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$, $b$, $c$ be positive numbers such that $a^{4}+b^{4}+c^{4}=3$. Prove that \n-- \\[\n-- \\frac{a^{2}}{2b+c}+\\frac{b^{2}}{2c+a}+\\frac{c^{2}}{2a+b}\\ge 1.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the problem\n\nThe problem asks to prove an inequality for three positive real numbers whose\nfourth powers sum to 3. The declarations below encode only the proposition to\nbe proved; no proof of the proposition is supplied.\n-/\n\nnamespace Problem\n\n/-- The three real numbers are strictly positive. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The fourth powers of the three real numbers sum to 3. -/\ndef FourthPowerSumEqThree (a b c : ℝ) : Prop :=\n a ^ 4 + b ^ 4 + c ^ 4 = 3\n\n/-- The admissibility conditions on the three real numbers: they are positive\nand the sum of their fourth powers is 3. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositiveTriple a b c ∧ FourthPowerSumEqThree a b c\n\n/-- The left-hand side of the inequality asserted in the problem. All\noperations and divisions are those of the real numbers. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n a ^ 2 / (2 * b + c) +\n b ^ 2 / (2 * c + a) +\n c ^ 2 / (2 * a + b)\n\n/-- The inequality asserted in the problem, for arbitrary real `a`, `b`, `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LeftHandSide a b c ≥ 1\n\n/-- The full mathematical assertion of the problem: for every triple of\npositive real numbers satisfying `a^4 + b^4 + c^4 = 3`, the indicated sum is\nat least 1. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc76b175-d866-5ddb-b0bd-609025f9aabb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0272a2e3ff6870466abc2ca3c53e5b82c2cb8680c96a7138165250f070fe4f0e", "task_path": "tasks/nmp3_cc76b175-d866-5ddb-b0bd-609025f9aabb", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc76b175-d866-5ddb-b0bd-609025f9aabb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cc8abfac-b27d-5f74-81a0-2a90f2b34e7d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Three nonnegative real numbers $r_1,\\;r_2,\\;r_3$ are written on a blackboard. There exist integers $a_1,\\;a_2,\\;a_3$, not all zero, such that \n-- $$a_1r_1 + a_2r_2 + a_3r_3 = 0.$$ \n-- An allowed operation is: choose two numbers $x\\le y$ among those on the board, erase $y$, and write $y-x$ in its place. Prove that after a finite number of such operations one of the three numbers on the board will be $0$.\nimport Mathlib\n\n/-!\n# Formal statement of the blackboard subtraction problem\n\nThree real numbers are represented by a board `Fin 3 → ℝ`. The three\npositions `0`, `1`, and `2` correspond to the three entries `r₁`, `r₂`, and\n`r₃` (in any order fixed before the operations are chosen).\n\nAn allowed operation chooses two distinct board positions `i` and `j` whose\ncurrent entries satisfy `s i ≤ s j`, erases the entry at `j`, and replaces it\nby `s j - s i`. The declaration `HasZeroAfter` describes the result of a\nfinite number of such operations.\n-/\n\nnamespace Problem\n\n/-- A board consists of three real numbers. Position `0`, `1`, and `2`\ncorrespond to `r₁`, `r₂`, and `r₃`. -/\nabbrev Board : Type := Fin 3 → ℝ\n\n/-- All three entries of a board are nonnegative. -/\ndef NonnegativeBoard (r : Board) : Prop :=\n ∀ i : Fin 3, 0 ≤ r i\n\n/-- The entries admit a nontrivial integer linear relation\n`a₁ r₁ + a₂ r₂ + a₃ r₃ = 0`. -/\ndef IntegerLinearRelation (r : Board) : Prop :=\n ∃ a₁ a₂ a₃ : ℤ,\n (a₁ ≠ 0 ∨ a₂ ≠ 0 ∨ a₃ ≠ 0) ∧\n (a₁ : ℝ) * r 0 + (a₂ : ℝ) * r 1 + (a₃ : ℝ) * r 2 = 0\n\n/-- One allowed operation: choose two distinct positions `i` and `j` with\n`s i ≤ s j`, erase the entry at `j`, and replace it by `s j - s i`. -/\ndef AllowedStep (s t : Board) : Prop :=\n ∃ i j : Fin 3,\n i ≠ j ∧ s i ≤ s j ∧\n ∀ k : Fin 3,\n t k = if k = j then s j - s i else s k\n\n/-- A board has at least one zero entry. -/\ndef HasZero (s : Board) : Prop :=\n ∃ i : Fin 3, s i = 0\n\n/-- `HasZeroAfter s n` says that, starting from board `s`, after exactly `n`\nallowed operations (chosen existentially) one of the three entries is zero.\nThe case `n = 0` covers a board that already has a zero entry. -/\ndef HasZeroAfter (s : Board) : ℕ → Prop\n | 0 => HasZero s\n | n + 1 => ∃ t : Board, AllowedStep s t ∧ HasZeroAfter t n\n\n/-- Some finite number of allowed operations reaches a board with a zero\nentry. -/\ndef EventuallyHasZero (s : Board) : Prop :=\n ∃ n : ℕ, HasZeroAfter s n\n\n/-- The assertion of the problem: for every nonnegative board whose three\nentries have a nontrivial integer linear relation, some finite sequence of\nallowed operations reaches a board having a zero entry. -/\ndef Target : Prop :=\n ∀ r : Board,\n NonnegativeBoard r →\n IntegerLinearRelation r →\n EventuallyHasZero r\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc8abfac-b27d-5f74-81a0-2a90f2b34e7d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "53259c07daad1bdc275fbaa8f25525131427af4b27138c4d3a53d746a0982e64", "task_path": "tasks/nmp3_cc8abfac-b27d-5f74-81a0-2a90f2b34e7d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cc8abfac-b27d-5f74-81a0-2a90f2b34e7d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ccd0c0f5-9616-556b-9b06-5de97fe8d253", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there do not exist positive integers $m$ and $n$ such that \n-- \\[\n-- m(m+1)(m+2)(m+3)=n(n+1)^{2}(n+2)^{3}(n+3)^{4}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The product on the left-hand side of the claimed identity, as a function of `m`. -/\ndef leftHandSide (m : ℕ) : ℕ :=\n m * (m + 1) * (m + 2) * (m + 3)\n\n/-- The product on the right-hand side of the claimed identity, as a function of `n`. -/\ndef rightHandSide (n : ℕ) : ℕ :=\n n * (n + 1) ^ 2 * (n + 2) ^ 3 * (n + 3) ^ 4\n\n/-- The equality between the two sides of the claimed identity. -/\ndef EquationHolds (m n : ℕ) : Prop :=\n leftHandSide m = rightHandSide n\n\n/-- `m` and `n` are positive integer solutions of the claimed identity. -/\ndef PositiveIntegerSolution (m n : ℕ) : Prop :=\n 0 < m ∧ 0 < n ∧ EquationHolds m n\n\n/-- There do not exist positive integers `m` and `n` satisfying the claimed identity. -/\ndef Target : Prop :=\n ¬ ∃ m n : ℕ, PositiveIntegerSolution m n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ccd0c0f5-9616-556b-9b06-5de97fe8d253", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "110184927e3f6a07a64d96bc1f143738ea78401b435744e80783f65515df8bfa", "task_path": "tasks/nmp3_ccd0c0f5-9616-556b-9b06-5de97fe8d253", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ccd0c0f5-9616-556b-9b06-5de97fe8d253", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ccf96fe9-0c66-5f64-90b4-35a24df6b6e4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ such that $x^{2}+y^{2}+z^{2}+2xyz=1$. Prove that \n-- \\[\n-- x^{2}+y^{2}+z^{2}+xy+yz+zx\\le\\frac{3}{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the positive-real inequality problem\n\nThe source problem asks to prove, for positive real numbers `x`, `y`, and `z`\nsatisfying `x^2 + y^2 + z^2 + 2xyz = 1`, the inequality\n`x^2 + y^2 + z^2 + xy + yz + zx ≤ 3/2`.\n-/\n\nnamespace Problem\n\n/-- The constraint `x^2 + y^2 + z^2 + 2xyz = 1`. -/\ndef Constraint (x y z : ℝ) : Prop :=\n x ^ 2 + y ^ 2 + z ^ 2 + 2 * x * y * z = 1\n\n/-- The left-hand side of the asserted inequality. -/\ndef inequalityLHS (x y z : ℝ) : ℝ :=\n x ^ 2 + y ^ 2 + z ^ 2 + x * y + y * z + z * x\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def inequalityRHS : ℝ :=\n (3 : ℝ) / 2\n\n/-- The admissibility assumptions on `x`, `y`, and `z`: positivity together\nwith the displayed constraint. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ Constraint x y z\n\n/-- The conclusion asserted under the admissibility hypotheses. -/\ndef Inequality (x y z : ℝ) : Prop :=\n inequalityLHS x y z ≤ inequalityRHS\n\n/-- The full statement: for every triple of positive real numbers satisfying\n`x^2 + y^2 + z^2 + 2xyz = 1`, the displayed upper bound holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ccf96fe9-0c66-5f64-90b4-35a24df6b6e4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c45fd96ae7d60b0e659d96a7d08e7cbb503e873c9b8549c772fd07d9b3476a2d", "task_path": "tasks/nmp3_ccf96fe9-0c66-5f64-90b4-35a24df6b6e4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ccf96fe9-0c66-5f64-90b4-35a24df6b6e4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cd1078b4-7226-5322-b6e7-5c84b3c7e485", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n \\ge a_1 > a_2 > \\dots > a_k$ be positive integers such that $\\operatorname{lcm}(a_i,a_j)\\le n$ for all $i,j$. Prove that $i\\,a_i \\le n$ for every $i=1,2,\\dots,k$.\nimport Mathlib\n\n/-!\n# Formalization of the source problem\n\nThe source problem is the following implication. Let\n`n ≥ a₁ > a₂ > ⋯ > aₖ` be positive integers such that\n`lcm(aᵢ, aⱼ) ≤ n` for every `i, j`. Then `i * aᵢ ≤ n` for every\n`i = 1, …, k`.\n\nWe index the finite sequence by `Fin k`; the zero-based index `i` is\ntherefore the one-based position `i.val + 1` in the statement's conclusion.\n-/\n\nnamespace Problem\n\n/-- The sequence `a : Fin k → ℕ` is positive and strictly decreasing. -/\ndef PositiveStrictlyDecreasing {k : ℕ} (a : Fin k → ℕ) : Prop :=\n (∀ i : Fin k, 0 < a i) ∧ StrictAnti a\n\n/-- Every pairwise least common multiple of the sequence terms is at most `n`. -/\ndef PairwiseLcmBound (n k : ℕ) (a : Fin k → ℕ) : Prop :=\n ∀ i j : Fin k, Nat.lcm (a i) (a j) ≤ n\n\n/-- The assumptions of the problem, with an explicit proof that the sequence is nonempty\nso that its first term is available. -/\ndef Admissible (n k : ℕ) (hk : 0 < k) (a : Fin k → ℕ) : Prop :=\n 0 < n ∧\n PositiveStrictlyDecreasing a ∧\n a ⟨0, hk⟩ ≤ n ∧\n PairwiseLcmBound n k a\n\n/-- The conclusion: at each one-based position `i`, the product `i * aᵢ` is at most `n`. -/\ndef Conclusion (n k : ℕ) (a : Fin k → ℕ) : Prop :=\n ∀ i : Fin k, ((i : ℕ) + 1) * a i ≤ n\n\n/-- The full assertion of the source problem: for every nonempty finite positive strictly\ndecreasing integer sequence bounded above by `n`, whose pairwise least common multiples\nare at most `n`, the stated product bound holds at every position. -/\ndef Target : Prop :=\n ∀ (n k : ℕ) (hk : 0 < k) (a : Fin k → ℕ),\n Admissible n k hk a → Conclusion n k a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cd1078b4-7226-5322-b6e7-5c84b3c7e485", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "06aed097c158f83fcbefaf33b31509a023ebe6cef63bf3e51b27ab3f9d0b5d2f", "task_path": "tasks/nmp3_cd1078b4-7226-5322-b6e7-5c84b3c7e485", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cd1078b4-7226-5322-b6e7-5c84b3c7e485", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cd23e05e-dc45-5767-a6cb-c85c8dab95a4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{3a^{4}+1}{3ab+c^{3}}+\\frac{3b^{4}+1}{3bc+a^{3}}+\\frac{3c^{4}+1}{3ac+b^{3}}\\ge 3.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the positive-variable cyclic inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose product is one, that a certain cyclic sum is at least three.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the variables: all three are positive and\ntheir product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- One cyclic summand `(3*x^4 + 1) / (3*x*y + z^3)`. -/\nnoncomputable def Term (x y z : ℝ) : ℝ :=\n ((3 : ℝ) * x ^ 4 + 1) / ((3 : ℝ) * x * y + z ^ 3)\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n Term a b c + Term b c a + Term c a b\n\n/-- The proposition asserted by the problem: for every positive real triple\n`(a,b,c)` with `abc=1`, the cyclic sum is at least `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cd23e05e-dc45-5767-a6cb-c85c8dab95a4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d6e5d0568fe98802ba5bf4713f128d557aefdff9a4611450264cdcdfb6ff39c1", "task_path": "tasks/nmp3_cd23e05e-dc45-5767-a6cb-c85c8dab95a4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cd23e05e-dc45-5767-a6cb-c85c8dab95a4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cd4f6333-5712-5e07-a689-fa8eeb210c6b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle with $AB\\neq AC$ and let $\\omega$ be its circumcircle. Let $I$ be the incenter of $ABC$, and let $D$ be the point where the incircle touches $BC$. The circle with diameter $AI$ meets $\\omega$ again at $K$. The line $AI$ meets $\\omega$ again at $M$. Prove that $K$, $D$, and $M$ are collinear.\nimport Mathlib\n\nnoncomputable section\n\n/-!\n# Formalization of a planar triangle/incircle collinearity problem\n\nThe source problem is a single assertion about a non-isosceles triangle: the\nsecond intersection of the circumcircle with the circle having diameter `AI`,\nthe incircle touchpoint on `BC`, and the second intersection of line `AI` with\nthe circumcircle are collinear.\n\nWe use explicit Cartesian coordinates in the real Euclidean plane. All of the\nauxiliary incidence/tangency predicates are defined below; no geometry\npredicate is left uninterpreted.\n-/\n\nnamespace Problem\n\n/-- A point of the real Euclidean plane, written in Cartesian coordinates. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- Difference of two planar points, regarded as a vector. -/\ndef vecSub (p q : Point) : Point := (p.1 - q.1, p.2 - q.2)\n\n/-- The Euclidean dot product of two planar vectors. -/\ndef dot (p q : Point) : ℝ := p.1 * q.1 + p.2 * q.2\n\n/-- The two-dimensional cross product (oriented area determinant). -/\ndef cross (p q : Point) : ℝ := p.1 * q.2 - p.2 * q.1\n\n/-- The square of the Euclidean distance between two points. -/\ndef distSq (p q : Point) : ℝ := (p.1 - q.1) ^ 2 + (p.2 - q.2) ^ 2\n\n/-- The Euclidean distance between two points. -/\ndef eDist (p q : Point) : ℝ := Real.sqrt (distSq p q)\n\n/-- Three points are collinear when the vectors from the first point to the\nother two have zero cross product. -/\ndef Collinear (p q r : Point) : Prop :=\n cross (vecSub q p) (vecSub r p) = 0\n\n/-- The affine line through two points, parametrized as `p + t(q-p)`. -/\ndef LineThrough (p q : Point) : Set Point :=\n {x | ∃ t : ℝ,\n x = (p.1 + t * (q.1 - p.1), p.2 + t * (q.2 - p.2))}\n\n/-- Membership in the closed segment with endpoints `p` and `q`. -/\ndef OnSegment (p q x : Point) : Prop :=\n ∃ t : ℝ,\n 0 ≤ t ∧ t ≤ 1 ∧\n x = (p.1 + t * (q.1 - p.1), p.2 + t * (q.2 - p.2))\n\n/-- Strict membership in the (open) triangle with vertices `a`, `b`, `c`,\nexpressed using strictly positive barycentric coordinates. -/\ndef InsideTriangle (a b c x : Point) : Prop :=\n ∃ u v w : ℝ,\n 0 < u ∧ 0 < v ∧ 0 < w ∧ u + v + w = 1 ∧\n x = (u * a.1 + v * b.1 + w * c.1,\n u * a.2 + v * b.2 + w * c.2)\n\n/-- `a`, `b`, `c` form a genuine (nondegenerate) triangle. -/\ndef IsTriangle (a b c : Point) : Prop :=\n ¬ Collinear a b c\n\n/-- The square of the distance from `x` to the line through `p` and `q`.\nThe formula is the usual squared cross-product divided by the squared length\nof a direction vector. It is used only when `p ≠ q` (which follows from the\nnondegeneracy hypotheses below). -/\ndef lineDistSq (p q x : Point) : ℝ :=\n (cross (vecSub q p) (vecSub x p)) ^ 2 / distSq p q\n\n/-- The distance from `x` to the line through `p` and `q`. -/\ndef distToLine (p q x : Point) : ℝ :=\n Real.sqrt (lineDistSq p q x)\n\n/-- `i` is the incenter of triangle `abc`: it is strictly inside the triangle\nand has equal distances to the three side lines. -/\ndef IsIncenter (a b c i : Point) : Prop :=\n InsideTriangle a b c i ∧\n distToLine a b i = distToLine a c i ∧\n distToLine a b i = distToLine b c i\n\n/-- The inradius, computed as the distance from the incenter `i` to the side\nline `bc` (all three such distances are equal under `IsIncenter`). -/\ndef IncircleRadius (_a b c i : Point) : ℝ :=\n distToLine b c i\n\n/-- `x` lies on the incircle of triangle `abc` centered at `i`. -/\ndef OnIncircle (a b c i x : Point) : Prop :=\n eDist i x = IncircleRadius a b c i\n\n/-- `d` is the incircle touchpoint on side `bc`: it lies on the closed\nsegment `bc`, lies on the incircle, and the radius `id` is perpendicular to\nthe side line `bc`. -/\ndef IsIncircleTouchpoint (a b c i d : Point) : Prop :=\n OnSegment b c d ∧\n OnIncircle a b c i d ∧\n dot (vecSub i d) (vecSub c b) = 0\n\n/-- A genuine circle, represented by its center and positive radius. -/\nstructure Circle where\n center : Point\n radius : ℝ\n radius_pos : 0 < radius\n\nnamespace Circle\n\n/-- Membership in a circle. -/\ndef mem (ω : Circle) (x : Point) : Prop :=\n distSq x ω.center = ω.radius ^ 2\n\n/-- The carrier set of a circle. -/\ndef toSet (ω : Circle) : Set Point :=\n {x | mem ω x}\n\nend Circle\n\n/-- `ω` is the circumcircle of triangle `abc`: it is a genuine circle through\nall three vertices. The nondegeneracy of `abc` is stated separately in the\nmain target, and it makes this circle unique. -/\ndef IsCircumcircle (a b c : Point) (ω : Circle) : Prop :=\n Circle.mem ω a ∧ Circle.mem ω b ∧ Circle.mem ω c\n\n/-- The circle with diameter `pq`, characterized by Thales' angle condition:\n`x` lies on the circle exactly when `(x-p)` is perpendicular to `(x-q)`. -/\ndef CircleWithDiameter (p q : Point) : Set Point :=\n {x | dot (vecSub x p) (vecSub x q) = 0}\n\n/-- `x` is the second (that is, the unique other) intersection of the sets\n`s` and `t`, with `base` singled out as the first intersection. -/\ndef IsSecondIntersection (s t : Set Point) (base x : Point) : Prop :=\n base ∈ s ∧ base ∈ t ∧\n x ∈ s ∧ x ∈ t ∧ x ≠ base ∧\n ∀ y : Point, y ∈ s → y ∈ t → y ≠ base → y = x\n\n/-- The assertion of the problem. The quantified data are the vertices\n`A, B, C`, the circumcircle `ω`, the incenter `I`, the touchpoint `D`, and\nthe two second intersections `K` and `M`. All hypotheses from the source\ntext are represented, and the conclusion is that `K`, `D`, `M` are collinear. -/\ndef Target : Prop :=\n ∀ (A B C : Point) (ω : Circle) (I D K M : Point),\n IsTriangle A B C →\n eDist A B ≠ eDist A C →\n IsCircumcircle A B C ω →\n IsIncenter A B C I →\n IsIncircleTouchpoint A B C I D →\n IsSecondIntersection (CircleWithDiameter A I) ω.toSet A K →\n IsSecondIntersection (LineThrough A I) ω.toSet A M →\n Collinear K D M\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cd4f6333-5712-5e07-a689-fa8eeb210c6b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6369d837b24ce491bc1eb7c65f0b770af5c0d961c237e64b812e4d70a32737f4", "task_path": "tasks/nmp3_cd4f6333-5712-5e07-a689-fa8eeb210c6b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cd4f6333-5712-5e07-a689-fa8eeb210c6b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cd782398-2f01-57ed-a8cd-1d9cb4274ac5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ and $ab+bc+ca=1$. Prove that \n-- \\[\n-- (a^2+bc)(b^2+ca)(c^2+ab)\\ge\\frac{8}{27}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility conditions for the variables in the problem:\n`a`, `b`, and `c` are positive real numbers satisfying `ab + bc + ca = 1`. -/\ndef admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = 1\n\n/-- The expression whose lower bound is asserted in the problem. -/\ndef productExpression (a b c : ℝ) : ℝ :=\n (a ^ 2 + b * c) * (b ^ 2 + c * a) * (c ^ 2 + a * b)\n\n/-- The full statement of the problem: for all positive real `a`, `b`, and `c`\nwith `ab + bc + ca = 1`, the product `(a^2 + bc)(b^2 + ca)(c^2 + ab)` is at\nleast `8/27`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n admissible a b c →\n productExpression a b c ≥ (8 : ℝ) / 27\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cd782398-2f01-57ed-a8cd-1d9cb4274ac5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6614c4437db36a096effa83450cdf4ad03e746a6d9aa7e2bce860fea68d4bbdd", "task_path": "tasks/nmp3_cd782398-2f01-57ed-a8cd-1d9cb4274ac5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cd782398-2f01-57ed-a8cd-1d9cb4274ac5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ce1a839a-f0c1-50e6-a774-87556a388746", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $7\\bigl[ab(a+b)+bc(b+c)+ca(c+a)\\bigr]-6abc=36$. Prove that \n-- \\[\n-- \\bigl(a^2+ab+b^2\\bigr)\\bigl(b^2+bc+c^2\\bigr)\\bigl(c^2+ca+a^2\\bigr)\\le27.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the nonnegative-real inequality problem\n\nThe source problem asks for a proof of a universal implication over nonnegative\nreal numbers. This file contains only the formal statement: `Target` is the\nproposition to be proved, not a proof of it.\n-/\n\nnamespace Problem\n\n/--\nThe admissibility condition from the problem: `a`, `b`, and `c` are\nnonnegative, and\n`7[ab(a+b) + bc(b+c) + ca(c+a)] - 6abc = 36`.\n-/\ndef Admissible (a b c : ℝ) : Prop :=\n (0 : ℝ) ≤ a ∧ (0 : ℝ) ≤ b ∧ (0 : ℝ) ≤ c ∧\n (7 : ℝ) * (a * b * (a + b) + b * c * (b + c) + c * a * (c + a)) -\n (6 : ℝ) * a * b * c = (36 : ℝ)\n\n/-- The product inequality asserted as the conclusion of the problem. -/\ndef Inequality (a b c : ℝ) : Prop :=\n (a ^ 2 + a * b + b ^ 2) * (b ^ 2 + b * c + c ^ 2) *\n (c ^ 2 + c * a + a ^ 2) ≤ (27 : ℝ)\n\n/--\nThe complete proposition asserted by the problem: for every real triple\nsatisfying `Admissible`, the stated product `Inequality` holds.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ce1a839a-f0c1-50e6-a774-87556a388746", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "aaefa54518519bcbb5613bef6045b3a8c762c934ecde5c00e57f3553c94ee4c5", "task_path": "tasks/nmp3_ce1a839a-f0c1-50e6-a774-87556a388746", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ce1a839a-f0c1-50e6-a774-87556a388746", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ce27c9d9-6f09-571e-a07f-6f7422d8b64e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c>0$ are the side lengths of a triangle (i.e. $a0$ and $\\alpha>\\frac12$ such that for every positive integer $n$ there is a subset $A\\subseteq\\{1,2,\\dots,n\\}$ with $|A|\\ge c\\,n^{\\alpha}$ and for any distinct $x,y\\in A$ the difference $x-y$ is not a perfect square.\nimport Mathlib\n\n/-!\n# Formal statement for the square-difference subset problem\n\nThe target is the existential assertion from `problem.md`. No proof of the\nassertion is supplied here: `Problem.Target` is a proposition-valued definition.\n-/\n\nnamespace Problem\n\n/-- A finite set of natural numbers has no nonzero square difference when all\nordered pairs of distinct elements are considered. The difference is taken in\n`ℤ`, so that the order of subtraction is represented without truncated natural\nsubtraction; a negative integer is not a square in `ℤ`. -/\ndef HasNoSquareDifference (A : Finset ℕ) : Prop :=\n ∀ x ∈ A, ∀ y ∈ A, x ≠ y → ¬ IsSquare ((x : ℤ) - (y : ℤ))\n\n/-- The subset of `{1, 2, ..., n}` whose existence is asserted for fixed\nconstants `c` and `α` and a fixed `n`. -/\ndef HasLargeNoSquareDifferenceSubset (c α : ℝ) (n : ℕ) : Prop :=\n ∃ A : Finset ℕ,\n A ⊆ Finset.Icc 1 n ∧\n c * (n : ℝ) ^ α ≤ (A.card : ℝ) ∧\n HasNoSquareDifference A\n\n/-- There exist constants `c > 0` and `α > 1/2` such that, for every positive\ninteger `n`, there is a subset `A ⊆ {1, ..., n}` of cardinality at least\n`c * n ^ α` in which no difference of two distinct elements is a perfect square. -/\ndef Target : Prop :=\n ∃ c : ℝ, ∃ α : ℝ,\n 0 < c ∧ 1 / 2 < α ∧\n ∀ n : ℕ, 0 < n → HasLargeNoSquareDifferenceSubset c α n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ce2c397b-3469-5563-b25d-5e8adf7a0c46", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7f891bdff89b21f30f1bec2708baa48a5da4d1953a854361019e0b28f56362cb", "task_path": "tasks/nmp3_ce2c397b-3469-5563-b25d-5e8adf7a0c46", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ce2c397b-3469-5563-b25d-5e8adf7a0c46", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ceb71fae-c044-5e0f-8daf-f1f46770bcd2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. On a $2n\\times 2n$ board $3n$ squares are marked. Prove that there exist $n$ rows and $n$ columns whose union contains all of the marked squares (i.e., by deleting exactly $n$ rows and $n$ columns one can remove all marked squares).\nimport Mathlib.Data.Finset.Card\nimport Mathlib.Data.Fin.Basic\n\n/-!\n# Formal statement: covering the marked squares of a `2n × 2n` board\n\nThe board is represented by the product type `Fin (2 * n) × Fin (2 * n)`.\nA marked set is a `Finset` of board squares; hence `3 * n` marked squares\nmeans that this finset has cardinality `3 * n`.\n-/\n\nnamespace Problem\n\n/-- The type of squares on a `2 * n` by `2 * n` board. The first coordinate\nis the row and the second coordinate is the column. -/\nabbrev Board (n : ℕ) : Type := Fin (2 * n) × Fin (2 * n)\n\n/-- The conclusion of the problem for a fixed positive `n` and marked set `M`:\nthere are exactly `n` rows and exactly `n` columns whose union contains every\nsquare in `M`. -/\ndef CoveringConclusion (n : ℕ) (M : Finset (Board n)) : Prop :=\n ∃ rows cols : Finset (Fin (2 * n)),\n rows.card = n ∧\n cols.card = n ∧\n ∀ square ∈ M, square.1 ∈ rows ∨ square.2 ∈ cols\n\n/-- Restatement of the parenthetical formulation: deleting exactly `n` rows\nand exactly `n` columns removes every marked square. The sets `rows` and\n`columns` here are the deleted sets. -/\ndef DeletionConclusion (n : ℕ) (M : Finset (Board n)) : Prop :=\n ∃ deletedRows deletedCols : Finset (Fin (2 * n)),\n deletedRows.card = n ∧\n deletedCols.card = n ∧\n ∀ square ∈ M, square.1 ∈ deletedRows ∨ square.2 ∈ deletedCols\n\n/-- The full assertion: for every positive integer `n`, every set of exactly\n`3n` squares on a `2n × 2n` board is contained in the union of some `n` rows\nand some `n` columns. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n →\n ∀ M : Finset (Board n),\n M.card = 3 * n → CoveringConclusion n M\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ceb71fae-c044-5e0f-8daf-f1f46770bcd2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2c01e983a9577258390faa9db305003b63b8bb605d02076b9bf566b0ea5d0a32", "task_path": "tasks/nmp3_ceb71fae-c044-5e0f-8daf-f1f46770bcd2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ceb71fae-c044-5e0f-8daf-f1f46770bcd2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cf2c93ef-5365-567e-a05e-77809147b9ea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. Let $x_1,\\dots,x_n$ and $y_1,\\dots,y_n$ be positive real numbers satisfying \n-- \\[\n-- x_1\\ge x_2\\ge\\cdots\\ge x_n>0,\\qquad\n-- y_1\\ge y_2\\ge\\cdots\\ge y_n>0,\n-- \\] \n-- and for every $k=1,2,\\dots,n$,\n-- \\[\n-- x_1x_2\\cdots x_k\\;\\ge\\;y_1y_2\\cdots y_k.\n-- \\] \n-- Prove that \n-- \\[\n-- \\sum_{i=1}^n x_i\\;\\ge\\;\\sum_{i=1}^n y_i.\n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- All entries of a length-`n` real sequence are positive. -/\ndef PositiveEntries (n : ℕ) (x : Fin n → ℝ) : Prop :=\n ∀ i : Fin n, 0 < x i\n\n/-- A length-`n` real sequence is nonincreasing in its indexing order. -/\ndef Nonincreasing (n : ℕ) (x : Fin n → ℝ) : Prop :=\n ∀ i j : Fin n, i ≤ j → x j ≤ x i\n\n/-- The product of the first `k` entries of a length-`n` real sequence.\n\nThe proof `hk : k ≤ n` witnesses that the first `k` positions exist. Since\n`Fin n` is zero-indexed, this product is the original product\n`x_1 * ... * x_k`. -/\ndef PrefixProduct (n : ℕ) (x : Fin n → ℝ) (k : ℕ) (hk : k ≤ n) : ℝ :=\n ∏ i : Fin k, x (Fin.castLE hk i)\n\n/-- The pointwise dominance of all prefix products of lengths `1` through `n`. -/\ndef PrefixProductDominates (n : ℕ) (x y : Fin n → ℝ) : Prop :=\n ∀ (k : ℕ) (_hk_lower : 1 ≤ k) (hk_upper : k ≤ n),\n PrefixProduct n x k hk_upper ≥ PrefixProduct n y k hk_upper\n\n/-- The conclusion comparing the full sums. -/\ndef SumComparison (n : ℕ) (x y : Fin n → ℝ) : Prop :=\n (∑ i : Fin n, x i) ≥ (∑ i : Fin n, y i)\n\n/-- The hypotheses of the problem, excluding the positivity of the index `n`. -/\ndef Admissible (n : ℕ) (x y : Fin n → ℝ) : Prop :=\n PositiveEntries n x ∧\n PositiveEntries n y ∧\n Nonincreasing n x ∧\n Nonincreasing n y ∧\n PrefixProductDominates n x y\n\n/-- The full universally quantified assertion of the problem. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 0 < n →\n ∀ (x y : Fin n → ℝ),\n Admissible n x y → SumComparison n x y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cf2c93ef-5365-567e-a05e-77809147b9ea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2f686d43eee436205a6b0a8f936223072807c70657c99f193bd5d50901612e02", "task_path": "tasks/nmp3_cf2c93ef-5365-567e-a05e-77809147b9ea", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cf2c93ef-5365-567e-a05e-77809147b9ea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cf97a3bd-51d3-574c-a2fd-b006b051ef05", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\sqrt{a^2-a+1}+\\sqrt{b^2-b+1}+\\sqrt{c^2-c+1}\\ge a+b+c.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The complete assertion of the problem: for all positive real numbers `a`, `b`,\nand `c` satisfying `abc = 1`, the stated sum of square roots is at least\n`a + b + c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a * b * c = 1 →\n Real.sqrt (a ^ 2 - a + 1) + Real.sqrt (b ^ 2 - b + 1) +\n Real.sqrt (c ^ 2 - c + 1) ≥ a + b + c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cf97a3bd-51d3-574c-a2fd-b006b051ef05", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "eabf201ef2ca531bdb1c69c92eb7c2e82511f9bb2068e20740d25f2e7c4801f5", "task_path": "tasks/nmp3_cf97a3bd-51d3-574c-a2fd-b006b051ef05", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cf97a3bd-51d3-574c-a2fd-b006b051ef05", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cfde50bf-2853-520a-ad49-ea10a3bdf37d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ with $abcd=1$. Prove that \n-- \\[\n-- \\frac{1}{a^{2}}+\\frac{1}{b^{2}}+\\frac{1}{c^{2}}+\\frac{1}{d^{2}}+\\frac{48}{ab+ac+ad+bc+bd+cd}\\ge 12.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The sum of all six pairwise products of four real numbers. -/\ndef pairwiseProductSum (a b c d : ℝ) : ℝ :=\n a * b + a * c + a * d + b * c + b * d + c * d\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c d : ℝ) : ℝ :=\n (1 : ℝ) / (a ^ 2) + (1 : ℝ) / (b ^ 2) + (1 : ℝ) / (c ^ 2) + (1 : ℝ) / (d ^ 2) +\n (48 : ℝ) / pairwiseProductSum a b c d\n\n/-- The assertion in the problem: for all positive reals `a`, `b`, `c`, `d`\nwhose product is `1`, the stated expression is at least `12`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d →\n a * b * c * d = (1 : ℝ) →\n lhs a b c d ≥ (12 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cfde50bf-2853-520a-ad49-ea10a3bdf37d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "368ec328852d67053af9a3535ef034833ef837c913ad21ed13422f740215fe85", "task_path": "tasks/nmp3_cfde50bf-2853-520a-ad49-ea10a3bdf37d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cfde50bf-2853-520a-ad49-ea10a3bdf37d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cfe12844-1f0a-580b-a5d9-45f33f454a8e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle (i.e. $a,b,c>0$ and $a+b>c,\\;b+c>a,\\;c+a>b$). Prove that \n-- \\[\n-- \\frac{a(a+b)}{a^{2}+b^{2}}+\\frac{b(b+c)}{b^{2}+c^{2}}+\\frac{c(c+a)}{c^{2}+a^{2}}\\le 2+\\frac{ab+bc+ca}{a^{2}+b^{2}+c^{2}}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility condition for the side lengths of a (nondegenerate) triangle:\n`a`, `b`, and `c` are positive and satisfy the three strict triangle inequalities. -/\ndef IsTriangleSideTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The displayed inequality of the problem, with real-valued arithmetic. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a * (a + b) / (a ^ 2 + b ^ 2) +\n b * (b + c) / (b ^ 2 + c ^ 2) +\n c * (c + a) / (c ^ 2 + a ^ 2)\n ≤ 2 + (a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The assertion to be proved: for every real triple satisfying the triangle-side\nconditions, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsTriangleSideTriple a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cfe12844-1f0a-580b-a5d9-45f33f454a8e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "85c9ac46a23a353e602e3acc38864ae830b40aa02dd734be5709dd4c9783bd87", "task_path": "tasks/nmp3_cfe12844-1f0a-580b-a5d9-45f33f454a8e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cfe12844-1f0a-580b-a5d9-45f33f454a8e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cfe1660d-fdfc-53cf-8ac5-0b39d9409e60", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for positive real numbers \\(a,b,c\\),\n-- \\[\n-- \\frac{1}{a}+\\frac{1}{b}+\\frac{1}{c}\\;\\ge\\;\\frac{b+c}{a^{2}+bc}+\\frac{c+a}{b^{2}+ca}+\\frac{a+b}{c^{2}+ab}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nFor positive real numbers `a`, `b`, and `c`, prove that\n\n`1 / a + 1 / b + 1 / c ≥\n (b + c) / (a ^ 2 + b * c) +\n (c + a) / (b ^ 2 + c * a) +\n (a + b) / (c ^ 2 + a * b)`.\n-/\n\nnamespace Problem\n\n/-- The proposition asserted by the problem: for all positive real numbers\n`a`, `b`, and `c`, the displayed reciprocal sum is at least the displayed\ncyclic rational sum. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n 1 / a + 1 / b + 1 / c ≥\n (b + c) / (a ^ 2 + b * c) +\n (c + a) / (b ^ 2 + c * a) +\n (a + b) / (c ^ 2 + a * b)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cfe1660d-fdfc-53cf-8ac5-0b39d9409e60", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "adc1b865da16d46b530e3ef3b664292cebdb2cceed9fc2f05b5ba1d408d71ac8", "task_path": "tasks/nmp3_cfe1660d-fdfc-53cf-8ac5-0b39d9409e60", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cfe1660d-fdfc-53cf-8ac5-0b39d9409e60", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cfe7593e-87f2-55d5-93b8-c4ac49b739a7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that for all real numbers $x,y$,\n-- \\[\n-- x^{2}f(x)+y^{2}f(y)-(x+y)f(xy)=(x-y)^{2}f(x+y)\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the functional-equation problem\n\nThe source problem asks for all functions f : ℝ → ℝ satisfying\n\n x^2 f(x) + y^2 f(y) - (x + y) f(xy) = (x - y)^2 f(x + y)\n\nfor every pair of real numbers x and y.\n\nThis file records the admissibility predicate for a candidate function, the\nmeaning of a complete answer set (both directions of the classification), and\nthe resulting find-all target. The target is a proposition; no proof of it is\nincluded here.\n-/\n\nnamespace Problem\n\n/-- The functional equation of the source problem, for a fixed function `f`. -/\ndef FunctionalEquation (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ,\n x ^ 2 * f x + y ^ 2 * f y - (x + y) * f (x * y)\n = (x - y) ^ 2 * f (x + y)\n\n/-- A function is admissible exactly when it satisfies the required equation\nfor every real pair `(x, y)`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n FunctionalEquation f\n\n/-- A proposed set `S` of real functions is a complete answer to the\n\"find all\" problem exactly when it has no extraneous members and omits no\nadmissible function. Both classification directions are stated explicitly. -/\ndef AnswerCorrect (S : Set (ℝ → ℝ)) : Prop :=\n (∀ f : ℝ → ℝ, f ∈ S → Admissible f) ∧\n (∀ f : ℝ → ℝ, Admissible f → f ∈ S)\n\n/-- The set of all real linear functions, written as `x ↦ c * x`. -/\ndef LinearFunctions : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | ∃ c : ℝ, f = fun x : ℝ => c * x}\n\n/-- The complete solution of the source problem: the admissible functions are\nprecisely the real linear functions. This is the unproved target proposition. -/\ndef Target : Prop :=\n AnswerCorrect LinearFunctions\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cfe7593e-87f2-55d5-93b8-c4ac49b739a7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cc364ed4fd83d9f7e1816fefe839ad3cd1b962abfa7cc6a3507ab33d1a9afe65", "task_path": "tasks/nmp3_cfe7593e-87f2-55d5-93b8-c4ac49b739a7", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cfe7593e-87f2-55d5-93b8-c4ac49b739a7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cff01199-1e7d-5837-85f7-b60c56bb43a2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In a tennis tournament, $2n$ players take part. Each pair of players plays exactly one game against each other, and only one game is played each day. Each player arrives at the hotel on the day of his first game and departs on the day of his last game. Prove that, regardless of the schedule of the games, there is at least one player who must stay at the hotel for at least $n^{2}+n-1$ days.\nimport Mathlib\n\n/-!\n# A round-robin tennis tournament and hotel stays\n\nThis file formalizes the statement of the problem. It deliberately contains\nonly definitions of the objects in the problem and a proposition-valued\ndeclaration for the desired assertion; no proof of the assertion is supplied.\n-/\n\nnamespace Problem\n\n/-- The players of a tournament with `2 * n` participants. -/\nabbrev Player (n : ℕ) : Type := Fin (2 * n)\n\n/-- The unordered pairs of distinct players. These are exactly the games that\nmust be played in a round-robin tournament. -/\nabbrev Match (n : ℕ) : Type := {e : Sym2 (Player n) // ¬ e.IsDiag}\n\n/-- A schedule assigns to every distinct unordered pair of players a calendar\nday, with no two different games assigned to the same day. Calendar days are\nrepresented by natural numbers; no assumption is made that every day has a\ngame, and the numbering may start at any value. -/\nstructure Schedule (n : ℕ) where\n day : Match n → ℕ\n day_injective : Function.Injective day\n\nnamespace Schedule\n\n/-- The finite set of days on which a given player plays. -/\nnoncomputable def gameDays {n : ℕ} (S : Schedule n) (p : Player n) : Finset ℕ :=\n (Finset.univ.filter (fun m : Match n => p ∈ m.1)).image S.day\n\n/-- The first day on which a player plays. The fallback value `0` is irrelevant\nfor a tournament with at least one player, where each player has at least one\ngame. -/\nnoncomputable def firstDay {n : ℕ} (S : Schedule n) (p : Player n) : ℕ :=\n if h : (S.gameDays p).Nonempty then (S.gameDays p).min' h else 0\n\n/-- The last day on which a player plays. The fallback value `0` is irrelevant\nfor a tournament with at least one player, where each player has at least one\ngame. -/\nnoncomputable def lastDay {n : ℕ} (S : Schedule n) (p : Player n) : ℕ :=\n if h : (S.gameDays p).Nonempty then (S.gameDays p).max' h else 0\n\n/-- The number of days from a player's arrival on the day of the format's\nfirst game through departure on the day of the last game, inclusive. -/\nnoncomputable def stayLength {n : ℕ} (S : Schedule n) (p : Player n) : ℕ :=\n S.lastDay p - S.firstDay p + 1\n\nend Schedule\n\n/-- The assertion of the problem: for every positive integer `n`, and for every\nschedule of the complete round-robin tournament on `2 * n` players, at least one\nplayer's inclusive stay from first to last game is at least `n ^ 2 + n - 1`\ndays. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ∀ S : Schedule n,\n ∃ p : Player n, n ^ 2 + n - 1 ≤ S.stayLength p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cff01199-1e7d-5837-85f7-b60c56bb43a2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5c20b70ea7e8837174fd081ca84c9fe987a5274a696f47f58ec884e48fed085d", "task_path": "tasks/nmp3_cff01199-1e7d-5837-85f7-b60c56bb43a2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cff01199-1e7d-5837-85f7-b60c56bb43a2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_cff828e2-9d99-5c40-baf5-fed1c9513128", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. For each lattice point $(x,y)$ with non‑negative integers $x,y$ satisfying $x+y simp\n\n/-- The lattice points `(x,y)` of the problem: nonnegative integers with `x + y < n`. -/\nabbrev LatticePoint (n : ℕ) : Type :=\n { p : ℕ × ℕ // p.1 + p.2 < n }\n\nnamespace LatticePoint\n\n/-- The `x`-coordinate of a lattice point. -/\ndef x {n : ℕ} (p : LatticePoint n) : ℕ := p.val.1\n\n/-- The `y`-coordinate of a lattice point. -/\ndef y {n : ℕ} (p : LatticePoint n) : ℕ := p.val.2\n\n/-- A lattice point with `x+y apply Fin.ext <;> simp\n\nnoncomputable instance instFintype (n : ℕ) : Fintype (LatticePoint n) :=\n Fintype.ofEquiv _ (equivBounded n).symm\n\nend LatticePoint\n\n/-- A colouring is red-downward-closed: whenever `(x,y)` is red, every point\n`(x',y')` with `x' ≤ x` and `y' ≤ y` is red. -/\ndef RedDownwardClosed {n : ℕ} (f : LatticePoint n → Color) : Prop :=\n ∀ p q : LatticePoint n,\n q.x ≤ p.x → q.y ≤ p.y → f p = Color.red → f q = Color.red\n\nnoncomputable instance redDownwardClosedDecidable {n : ℕ} : DecidablePred (@RedDownwardClosed n) := by\n intro f\n unfold RedDownwardClosed\n infer_instance\n\n/-- An admissible red/blue colouring of all lattice points with `x+y c.val p = Color.blue)\n\n/-- A finite set of points has pairwise distinct `x`-coordinates. -/\ndef HasDistinctXCoordinates {n : ℕ} (s : Finset (LatticePoint n)) : Prop :=\n ∀ p ∈ s, ∀ q ∈ s, p.x = q.x → p = q\n\n/-- A finite set of points has pairwise distinct `y`-coordinates. -/\ndef HasDistinctYCoordinates {n : ℕ} (s : Finset (LatticePoint n)) : Prop :=\n ∀ p ∈ s, ∀ q ∈ s, p.y = q.y → p = q\n\n/-- A choice counted by `A`: an `n`-element set of blue points with distinct\n`x`-coordinates. -/\ndef IsBlueSelectionByX {n : ℕ} (c : Colouring n) (s : Finset (LatticePoint n)) : Prop :=\n s.card = n ∧ s ⊆ bluePoints c ∧ HasDistinctXCoordinates s\n\n/-- A choice counted by `B`: an `n`-element set of blue points with distinct\n`y`-coordinates. -/\ndef IsBlueSelectionByY {n : ℕ} (c : Colouring n) (s : Finset (LatticePoint n)) : Prop :=\n s.card = n ∧ s ⊆ bluePoints c ∧ HasDistinctYCoordinates s\n\nnoncomputable instance isBlueSelectionByXDecidable {n : ℕ} (c : Colouring n) :\n DecidablePred (IsBlueSelectionByX c) := by\n intro s\n unfold IsBlueSelectionByX HasDistinctXCoordinates\n infer_instance\n\nnoncomputable instance isBlueSelectionByYDecidable {n : ℕ} (c : Colouring n) :\n DecidablePred (IsBlueSelectionByY c) := by\n intro s\n unfold IsBlueSelectionByY HasDistinctYCoordinates\n infer_instance\n\n/-- The type of `n`-element blue point sets with pairwise distinct `x`-coordinates. -/\nabbrev BlueSelectionsByX {n : ℕ} (c : Colouring n) : Type :=\n { s : Finset (LatticePoint n) // IsBlueSelectionByX c s }\n\n/-- The type of `n`-element blue point sets with pairwise distinct `y`-coordinates. -/\nabbrev BlueSelectionsByY {n : ℕ} (c : Colouring n) : Type :=\n { s : Finset (LatticePoint n) // IsBlueSelectionByY c s }\n\nnoncomputable instance blueSelectionsByXFintype {n : ℕ} (c : Colouring n) :\n Fintype (BlueSelectionsByX c) := by\n unfold BlueSelectionsByX\n infer_instance\n\nnoncomputable instance blueSelectionsByYFintype {n : ℕ} (c : Colouring n) :\n Fintype (BlueSelectionsByY c) := by\n unfold BlueSelectionsByY\n infer_instance\n\n/-- `A` is the number of ways to choose `n` blue points with distinct\n`x`-coordinates from a fixed admissible colouring. -/\nnoncomputable def A (n : ℕ) (c : Colouring n) : ℕ :=\n Fintype.card (BlueSelectionsByX c)\n\n/-- `B` is the number of ways to choose `n` blue points with distinct\n`y`-coordinates from a fixed admissible colouring. -/\nnoncomputable def B (n : ℕ) (c : Colouring n) : ℕ :=\n Fintype.card (BlueSelectionsByY c)\n\n/-- The statement of the problem: for every positive integer `n` and every\nadmissible colouring, the two numbers `A` and `B` are equal. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ∀ c : Colouring n, A n c = B n c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cff828e2-9d99-5c40-baf5-fed1c9513128", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e85157f7b52726267dc039ee08806dcf50b1647b67b00e9f14e7d657a931cdc9", "task_path": "tasks/nmp3_cff828e2-9d99-5c40-baf5-fed1c9513128", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "cff828e2-9d99-5c40-baf5-fed1c9513128", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d037100c-1b67-5cfb-a4b6-174ab3e6a2fe", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ be real numbers such that no two of them are zero. Prove that \n-- \\[\n-- \\frac{a(4b+4c-a)}{b^{2}+c^{2}}+\\frac{b(4c+4a-b)}{c^{2}+a^{2}}+\\frac{c(4a+4b-c)}{a^{2}+b^{2}}\\le\\frac{21}{2}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks, for nonnegative real numbers `a`, `b`, and `c`\nwith no pair both equal to zero, to prove an upper bound for a rational\nexpression. The proposition is recorded as a definition of type `Prop`;\nno proof is supplied in this statement-formalization task.\n-/\n\nnamespace Problem\n\n/-- The condition that no two of `a`, `b`, and `c` are both zero.\n\nEquivalently, each of the three pairs contains at least one nonzero member.\nIn particular this is exactly what is needed to make all three denominators\nin the target expression nonzero under the nonnegativity assumptions. -/\ndef NoTwoZero (a b c : ℝ) : Prop :=\n (a ≠ 0 ∨ b ≠ 0) ∧ (b ≠ 0 ∨ c ≠ 0) ∧ (c ≠ 0 ∨ a ≠ 0)\n\n/-- The admissibility predicate from the source problem: `a`, `b`, and `c`\nare nonnegative real numbers and no two of them are zero. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ NoTwoZero a b c\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a * (4 * b + 4 * c - a) / (b ^ 2 + c ^ 2) +\n b * (4 * c + 4 * a - b) / (c ^ 2 + a ^ 2) +\n c * (4 * a + 4 * b - c) / (a ^ 2 + b ^ 2)\n\n/-- The assertion to be proved: for every admissible triple of real numbers,\nthe left-hand side is at most `21 / 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≤ (21 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d037100c-1b67-5cfb-a4b6-174ab3e6a2fe", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b409a7bc486e1cc22d11523f8a7881a3836a42dab38de0fd3a1039d959026c93", "task_path": "tasks/nmp3_d037100c-1b67-5cfb-a4b6-174ab3e6a2fe", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d037100c-1b67-5cfb-a4b6-174ab3e6a2fe", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d08d7c3f-6813-54a2-95af-73154509642c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- (a+b+c)^3\\,(a^2+bc)\\,(b^2+ac)\\,(c^2+ab)\\ge 27\\,abc\\,(a^2+b^2)\\,(b^2+c^2)\\,(c^2+a^2)\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: a three-variable real inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthe displayed inequality. The declaration below records exactly that target\nas a proposition; it does not assert or prove the proposition.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`,\n`(a+b+c)^3 (a^2+bc) (b^2+ac) (c^2+ab) ≥ 27 abc (a^2+b^2) (b^2+c^2) (c^2+a^2)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n (a + b + c) ^ 3 * (a ^ 2 + b * c) * (b ^ 2 + a * c) *\n (c ^ 2 + a * b) ≥\n 27 * a * b * c * (a ^ 2 + b ^ 2) * (b ^ 2 + c ^ 2) *\n (c ^ 2 + a ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d08d7c3f-6813-54a2-95af-73154509642c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5b7f94ce0bfdc0aacefde185c4b37fd1bf56702f04184c37d981691589933780", "task_path": "tasks/nmp3_d08d7c3f-6813-54a2-95af-73154509642c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d08d7c3f-6813-54a2-95af-73154509642c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d100abc2-6d70-516d-b9a9-c8a4a2e23631", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $ab+bc+ca+2abc=1$. Prove that \n-- \\[\n-- \\frac1{(1+2a)^2}+\\frac1{(1+2b)^2}+\\frac1{(1+2c)^2}+2abc\\ge 1.\n-- \\]\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n@[expose] public section\n\n/-!\nFormalization of the inequality problem in `problem.md`.\n\nThe source does not explicitly name the number system. We interpret the\nvariables as real numbers, which is the standard reading of this kind of\ninequality problem and is recorded in `ambiguities.json`.\n-/\n\nnamespace Problem\n\n/-- The positivity assumptions `a > 0`, `b > 0`, and `c > 0`. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The constraint `ab + bc + ca + 2abc = 1`. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a * b + b * c + c * a + 2 * a * b * c = 1\n\n/-- The hypotheses of the problem: positivity and the algebraic constraint. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Positive a b c ∧ Constraint a b c\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n 1 / (1 + 2 * a) ^ 2 + 1 / (1 + 2 * b) ^ 2 +\n 1 / (1 + 2 * c) ^ 2 + 2 * a * b * c\n\n/-- The proposition to prove: for all positive real `a`, `b`, `c` satisfying\n`ab + bc + ca + 2abc = 1`, the stated sum is at least `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ 1\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d100abc2-6d70-516d-b9a9-c8a4a2e23631", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "913ac0e76d583105e338a729346b6692834ad77bb698d657bf019afc0746d5db", "task_path": "tasks/nmp3_d100abc2-6d70-516d-b9a9-c8a4a2e23631", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d100abc2-6d70-516d-b9a9-c8a4a2e23631", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d101a3b6-a3b3-5ef9-b29c-fabdd0faa594", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^{3}+bc^{2}}{a^{3}+a^{2}c}+\\frac{b^{3}+ca^{2}}{b^{3}+b^{2}a}+\\frac{c^{3}+ab^{2}}{c^{3}+c^{2}b}\\ge 3\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The first summand in the inequality:\n`(a ^ 3 + b * c ^ 2) / (a ^ 3 + a ^ 2 * c)`. -/\nnoncomputable def firstSummand (a b c : ℝ) : ℝ :=\n (a ^ 3 + b * c ^ 2) / (a ^ 3 + a ^ 2 * c)\n\n/-- The second summand in the inequality:\n`(b ^ 3 + c * a ^ 2) / (b ^ 3 + b ^ 2 * a)`. -/\nnoncomputable def secondSummand (a b c : ℝ) : ℝ :=\n (b ^ 3 + c * a ^ 2) / (b ^ 3 + b ^ 2 * a)\n\n/-- The third summand in the inequality:\n`(c ^ 3 + a * b ^ 2) / (c ^ 3 + c ^ 2 * b)`. -/\nnoncomputable def thirdSummand (a b c : ℝ) : ℝ :=\n (c ^ 3 + a * b ^ 2) / (c ^ 3 + c ^ 2 * b)\n\n/-- The complete left-hand side of the inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n firstSummand a b c + secondSummand a b c + thirdSummand a b c\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`,\nthe given sum of three rational expressions is at least `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n leftHandSide a b c ≥ (3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d101a3b6-a3b3-5ef9-b29c-fabdd0faa594", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fcba9c6cf7ddadffe411cf6a47e7d2b7a2e0ceaedcefb6d5288a80bfc83374a7", "task_path": "tasks/nmp3_d101a3b6-a3b3-5ef9-b29c-fabdd0faa594", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d101a3b6-a3b3-5ef9-b29c-fabdd0faa594", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d1104688-e3c8-56fa-b5d1-4669076e6180", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $0 x₁\n | n + 1 => seq x₁ n + (seq x₁ n / (((n + 1 : ℕ) : ℝ))) ^ 2\n\n/-- The initial-value condition `0 < x₁ < 1`. -/\ndef AdmissibleInitial (x₁ : ℝ) : Prop :=\n 0 < x₁ ∧ x₁ < 1\n\n/-- The reindexed sequence converges to the finite real number `a`. -/\ndef ConvergesTo (x₁ a : ℝ) : Prop :=\n Filter.Tendsto (fun n : ℕ => seq x₁ n) Filter.atTop (nhds a)\n\n/-- The asymptotic residual identity from the problem. The original index\n`n` is represented here by `n + 1`, because `seq x₁ n` denotes `x_{n+1}`. -/\ndef ResidualConvergesTo (x₁ a : ℝ) : Prop :=\n Filter.Tendsto\n (fun n : ℕ => (((n + 1 : ℕ) : ℝ) * (a - seq x₁ n)))\n Filter.atTop (nhds (a ^ 2))\n\n/-- There exists a finite real limit of the sequence determined by `x₁`. -/\ndef LimitExists (x₁ : ℝ) : Prop :=\n ∃ a : ℝ, ConvergesTo x₁ a\n\n/-- The complete limiting conclusion for one fixed initial value: one and the\nsame finite real number `a` is the limit and satisfies the residual identity. -/\ndef FullConclusion (x₁ : ℝ) : Prop :=\n ∃ a : ℝ, ConvergesTo x₁ a ∧ ResidualConvergesTo x₁ a\n\n/-- The full assertion of the source problem. It is universally quantified\nover every real initial value strictly between `0` and `1`; the finite limit\n`a` and the residual identity are then asserted for the same `a`. -/\ndef Target : Prop :=\n ∀ x₁ : ℝ, AdmissibleInitial x₁ → FullConclusion x₁\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d1104688-e3c8-56fa-b5d1-4669076e6180", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0fce9e4ef2801cdf86f611f990bb0670d3cbc9c3d269a9d66ba86ff06819bd6c", "task_path": "tasks/nmp3_d1104688-e3c8-56fa-b5d1-4669076e6180", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d1104688-e3c8-56fa-b5d1-4669076e6180", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d148827b-1e42-56fd-bfff-29116416a9bb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb{N}\\to\\mathbb{N}$ be a strictly increasing function such that $f(2)=2$ and $f(mn)=f(m)f(n)$ for every pair of relatively prime positive integers $m$ and $n$. Prove that $f(n)=n$ for every positive integer $n$.\nimport Mathlib\n\nnamespace Problem\n\n/-- A function `f : ℕ → ℕ` is strictly increasing on the natural numbers. -/\ndef StrictlyIncreasing (f : ℕ → ℕ) : Prop :=\n ∀ m n : ℕ, m < n → f m < f n\n\n/-- The multiplicativity hypothesis, restricted to pairs of positive,\nrelatively prime natural numbers. -/\ndef MultiplicativeOnCoprimePos (f : ℕ → ℕ) : Prop :=\n ∀ m n : ℕ, 0 < m → 0 < n → Nat.Coprime m n →\n f (m * n) = f m * f n\n\n/-- The complete set of hypotheses imposed on `f` in the problem. -/\ndef Admissible (f : ℕ → ℕ) : Prop :=\n StrictlyIncreasing f ∧ f 2 = 2 ∧ MultiplicativeOnCoprimePos f\n\n/-- The assertion to be proved: every admissible `f` is the identity on\npositive natural numbers. -/\ndef Target : Prop :=\n ∀ f : ℕ → ℕ, Admissible f → ∀ n : ℕ, 0 < n → f n = n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d148827b-1e42-56fd-bfff-29116416a9bb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f8658842e146cc0e1f52ed35fa128f5f7aab72ab83c0cc4e9aa63172e0679c7c", "task_path": "tasks/nmp3_d148827b-1e42-56fd-bfff-29116416a9bb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d148827b-1e42-56fd-bfff-29116416a9bb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d183a7b4-e549-56d1-87eb-ffd23756891c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z,t>0$. Prove that \n-- $$x^2+y^2+z^2+t^2+xyzt+1\\;\\ge\\;xy+yz+zt+tx+xz+yt.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef lhs (x y z t : ℝ) : ℝ :=\n x ^ 2 + y ^ 2 + z ^ 2 + t ^ 2 + x * y * z * t + 1\n\n/-- The right-hand side of the inequality in the source problem. -/\ndef rhs (x y z t : ℝ) : ℝ :=\n x * y + y * z + z * t + t * x + x * z + y * t\n\n/--\nThe universally quantified statement of the source problem: for all positive real\nnumbers `x`, `y`, `z`, and `t`, the stated sum is at least the stated right-hand side.\n-/\ndef Target : Prop :=\n ∀ x y z t : ℝ,\n 0 < x → 0 < y → 0 < z → 0 < t →\n lhs x y z t ≥ rhs x y z t\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d183a7b4-e549-56d1-87eb-ffd23756891c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cf09505028dbac27bca00b2c99e256503305e688260b0ac33f5c547d72b4bd13", "task_path": "tasks/nmp3_d183a7b4-e549-56d1-87eb-ffd23756891c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d183a7b4-e549-56d1-87eb-ffd23756891c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d19cde58-c405-572b-b561-26f1b9d97a8a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\ge a^2+b^2+c^2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks one to prove, for positive real numbers `a`, `b`, and `c`\nwith sum `3`, that\n`a / b + b / c + c / a ≥ a ^ 2 + b ^ 2 + c ^ 2`.\n\nThe target is represented as a proposition-valued definition. No proof of the\ninequality is supplied.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved: for all positive real `a`, `b`, and `c` whose\nsum is `3`, we have `a / b + b / c + c / a ≥ a ^ 2 + b ^ 2 + c ^ 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a + b + c = 3 →\n a / b + b / c + c / a ≥ a ^ 2 + b ^ 2 + c ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d19cde58-c405-572b-b561-26f1b9d97a8a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8b1133f7348335f914bf62655080ba6b67b83ee33c807cee5edf3352ccd3864a", "task_path": "tasks/nmp3_d19cde58-c405-572b-b561-26f1b9d97a8a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d19cde58-c405-572b-b561-26f1b9d97a8a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d1a5d434-14d4-5de2-9cff-1de633f89790", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(a_n)_{n=1}^{\\infty}$ be a sequence of positive real numbers and define $\\displaystyle\\alpha_n=\\frac{a_1+a_2+\\cdots+a_n}{n}$, the arithmetic mean of the first $n$ terms. Prove that for every positive integer $N$,\n-- \\[\n-- \\sum_{n=1}^{N}\\alpha_{n}^{2}\\le 4\\sum_{n=1}^{N}a_{n}^{2}.\n-- \\]\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The arithmetic mean of the first `n` terms of a real sequence indexed by\n`ℕ`. The problem indexes sequences from `1`; the value at `n = 0` is not\nused, and division by the real coercion of `0` is the junk value `0`. -/\nnoncomputable def arithmeticMean (a : ℕ → ℝ) (n : ℕ) : ℝ :=\n (∑ k ∈ Finset.Icc 1 n, a k) / (n : ℝ)\n\n/-- A sequence indexed by positive natural numbers consists of positive real\nnumbers. The value at index `0` is irrelevant and is not constrained. -/\ndef IsPositiveSequence (a : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, 1 ≤ n → 0 < a n\n\n/-- The assertion from the problem: for every positive integer `N`, the sum\nof the squares of the arithmetic means of the first `n` terms, for\n`n = 1, ..., N`, is at most four times the sum of the squares of the first\n`N` terms of the original positive real sequence. -/\ndef Target : Prop :=\n ∀ (a : ℕ → ℝ), IsPositiveSequence a →\n ∀ N : ℕ, 0 < N →\n (∑ n ∈ Finset.Icc 1 N, (arithmeticMean a n) ^ 2) ≤\n 4 * (∑ n ∈ Finset.Icc 1 N, (a n) ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d1a5d434-14d4-5de2-9cff-1de633f89790", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bde84e71896782ef9eac66f95447fdb284b2fe10327201a8ad265d3ec6921a87", "task_path": "tasks/nmp3_d1a5d434-14d4-5de2-9cff-1de633f89790", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d1a5d434-14d4-5de2-9cff-1de633f89790", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d1a6a927-6991-513d-b4f3-6c162d443221", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all real numbers $x,\\;y,\\;z$, prove that \n-- \\[\n-- 3\\bigl(x^4+y^4+z^4-x^3y-y^3z-z^3x\\bigr)\\;\\ge\\;x^2(y-z)^2+y^2(z-x)^2+z^2(x-y)^2\\,.\n-- \\]\nimport Mathlib.Data.Real.Basic\n\n/-!\n# Formal statement of the target inequality\n\nThe source problem asks, for all real numbers `x`, `y`, and `z`, to prove\n`3 * (x^4 + y^4 + z^4 - x^3*y - y^3*z - z^3*x)`\nis at least\n`x^2*(y-z)^2 + y^2*(z-x)^2 + z^2*(x-y)^2`.\n-/\n\nnamespace Problem\n\n/-- The full universally quantified inequality from the problem statement. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 3 * (x ^ 4 + y ^ 4 + z ^ 4 - x ^ 3 * y - y ^ 3 * z - z ^ 3 * x) ≥\n x ^ 2 * (y - z) ^ 2 + y ^ 2 * (z - x) ^ 2 + z ^ 2 * (x - y) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d1a6a927-6991-513d-b4f3-6c162d443221", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c81bb06636409cca9dd45c6040cf09772a66316b517ecee05f1a2536d1c8c9ea", "task_path": "tasks/nmp3_d1a6a927-6991-513d-b4f3-6c162d443221", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d1a6a927-6991-513d-b4f3-6c162d443221", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d1ca45da-465b-500a-899e-f06289602d39", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $T$ be a finite set of positive integers greater than $1$. A subset $S\\subseteq T$ is called good if for every $t\\in T$ there exists $s\\in S$ such that $\\gcd(s,t)>1$. Prove that the number of good subsets of $T$ is odd.\nimport Mathlib.Algebra.Ring.Parity\nimport Mathlib.Data.Finset.Powerset\nimport Mathlib.Data.Nat.GCD.Basic\n\n/-!\n# Formalization of the odd-number-of-good-subsets problem.\n\nThe problem concerns a finite set `T` of positive integers greater than `1`.\nA subset `S` of `T` is good when every element of `T` has a non-coprime\nwitness in `S`. The target asserts that the number of good subsets of `T`\nis odd.\n-/\n\nnamespace Problem\n\n/-- The hypothesis that a finite set of natural numbers consists of positive\nintegers greater than `1`.\n\nThe ambient type `ℕ` represents the positive integers from the problem after\nthe condition `1 < t` is imposed; the conjunct `0 < t` records the source\nphrase \"positive\" explicitly. -/\ndef FiniteSetOfPositiveIntegersGreaterThanOne (T : Finset ℕ) : Prop :=\n ∀ t : ℕ, t ∈ T → 0 < t ∧ 1 < t\n\n/-- `GoodSubset T S` says that `S` is a subset of `T` and that every `t ∈ T`\nhas an element `s ∈ S` with `gcd s t > 1`. -/\ndef GoodSubset (T S : Finset ℕ) : Prop :=\n S ⊆ T ∧ ∀ t : ℕ, t ∈ T → ∃ s : ℕ, s ∈ S ∧ 1 < Nat.gcd s t\n\n/-- The finite set of all good subsets of `T`, obtained by filtering the\npowerset of `T` by the admissibility predicate `GoodSubset T`. -/\nnoncomputable def goodSubsets (T : Finset ℕ) : Finset (Finset ℕ) := by\n classical\n exact T.powerset.filter (fun S => GoodSubset T S)\n\n/-- The number of good subsets of a finite set `T`. -/\nnoncomputable def numberOfGoodSubsets (T : Finset ℕ) : ℕ :=\n (goodSubsets T).card\n\n/-- The statement to be proved: for every finite set `T` of positive integers\ngreater than `1`, the number of good subsets of `T` is odd. -/\ndef Target : Prop :=\n ∀ T : Finset ℕ,\n FiniteSetOfPositiveIntegersGreaterThanOne T →\n Odd (numberOfGoodSubsets T)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d1ca45da-465b-500a-899e-f06289602d39", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6fc0401c7a7d18f47a7f34dfef3cd5d1aae283d678e927fc5102962021f3e1e1", "task_path": "tasks/nmp3_d1ca45da-465b-500a-899e-f06289602d39", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d1ca45da-465b-500a-899e-f06289602d39", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d1d16e24-cac2-56bd-b057-77851af947c3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c>0$ prove that \n-- \\[\n-- \\Bigl(\\frac{a}{\\sqrt{a(b+c)}}+\\frac{b}{\\sqrt{b(c+a)}}\\Bigr)^{2}\n-- +\\Bigl(\\frac{b}{\\sqrt{b(c+a)}}+\\frac{c}{\\sqrt{c(a+b)}}\\Bigr)^{2}\n-- +\\Bigl(\\frac{c}{\\sqrt{c(a+b)}}+\\frac{a}{\\sqrt{a(b+c)}}\\Bigr)^{2}\n-- \\ge 6.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality in `problem.md`\n\nThe source asks to prove an inequality for three positive real numbers `a`, `b`, and `c`.\nThis file records the statement only; it does not contain a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (a / Real.sqrt (a * (b + c)) + b / Real.sqrt (b * (c + a))) ^ 2\n + (b / Real.sqrt (b * (c + a)) + c / Real.sqrt (c * (a + b))) ^ 2\n + (c / Real.sqrt (c * (a + b)) + a / Real.sqrt (a * (b + c))) ^ 2\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the sum of the three indicated\nsquares is at least `6`.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → 6 ≤ LHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d1d16e24-cac2-56bd-b057-77851af947c3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "21c9f00a797371f6d9f947e0a9a59537e5f10c2febe70e8ec70a91d8ffaa88b9", "task_path": "tasks/nmp3_d1d16e24-cac2-56bd-b057-77851af947c3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d1d16e24-cac2-56bd-b057-77851af947c3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d1e85bf7-c29e-5856-b530-64676e8627b1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- There are $N\\ge 3$ points in the plane. Among all pairwise distances between these points there are at most $n$ distinct distances. Prove that $N\\le (n+1)^{2}\\,.$\nimport Mathlib\n\n/-!\n# Distinct distances in the plane\n\nThis file formalizes the statement of the distinct-distance bound\n`N ≤ (n + 1)^2` for a finite set of points in the Euclidean plane.\nNo proof of the target proposition is included.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane, represented by two real coordinates. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The finite set of distances between distinct points of a finite point set `S`.\n\nThe ordered pairs are restricted to `S.offDiag`; applying `dist` and then taking\nthe finset image removes repetitions, so this is exactly the set of distinct\npairwise distances. -/\nnoncomputable def pairwiseDistances (S : Finset Plane) : Finset ℝ :=\n S.offDiag.image fun p : Plane × Plane => dist p.1 p.2\n\n/-- A finite point set `S` is admissible for the parameters `N` and `n` when it has\n`N` points, at least three of them, and at most `n` distinct pairwise distances. -/\ndef Admissible (N n : ℕ) (S : Finset Plane) : Prop :=\n 3 ≤ N ∧ S.card = N ∧ (pairwiseDistances S).card ≤ n\n\n/-- The assertion of the problem: for every `N ≥ 3` and every finite set of `N`\npoints in the Euclidean plane, if the set has at most `n` distinct pairwise\ndistances, then `N ≤ (n + 1)^2`. The points are represented by a `Finset`, so\nthey are automatically distinct. -/\ndef Target : Prop :=\n ∀ (N n : ℕ) (S : Finset Plane),\n 3 ≤ N →\n S.card = N →\n (pairwiseDistances S).card ≤ n →\n N ≤ (n + 1) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d1e85bf7-c29e-5856-b530-64676e8627b1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d80d0e658988493139fb22e7287c8fa4999ed45ea258df3eb367cae0c7d663f9", "task_path": "tasks/nmp3_d1e85bf7-c29e-5856-b530-64676e8627b1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d1e85bf7-c29e-5856-b530-64676e8627b1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d21f24f1-ba4f-55ac-8b8c-69c8fa1d3416", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle and let $D$ be a point on side $BC$. A line through $D$ meets side $AB$ at $X$ and the ray $AC$ at $Y$. Let $\\omega$ be the circumcircle of $\\triangle ABC$, and let the circumcircle of $\\triangle BXD$ intersect $\\omega$ again at $Z\\neq B$. The lines $ZD$ and $ZY$ meet $\\omega$ again at $V$ and $W$, respectively. Prove that $AB = VW\\,.\nmodule\n\npublic import Mathlib.Geometry.Euclidean.Sphere.SecondInter\npublic import Mathlib.Analysis.Convex.Segment\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\n\npublic section\n\nnoncomputable section\n\nnamespace Problem\n\nopen scoped EuclideanGeometry RealInnerProductSpace\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Three points are non-collinear, i.e. they form a genuine triangle. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- The closed segment with endpoints `A` and `B`. -/\ndef OnClosedSegment (A B P : Plane) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ P = AffineMap.lineMap A B t\n\n/-- The ray starting at `A` and passing through `B` (including `A`). -/\ndef OnRay (A B P : Plane) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ P = AffineMap.lineMap A B t\n\n/-- An affine subspace that is a genuine one-dimensional affine line. -/\ndef IsAffineLine (L : AffineSubspace ℝ Plane) : Prop :=\n Module.finrank ℝ L.direction = 1\n\n/-- A sphere (circle in the plane) is the circumcircle of the triangle `ABC`. -/\ndef IsCircumcircle (ω : EuclideanGeometry.Sphere Plane) (A B C : Plane) : Prop :=\n A ∈ ω ∧ B ∈ ω ∧ C ∈ ω ∧\n ∀ σ : EuclideanGeometry.Sphere Plane, A ∈ σ → B ∈ σ → C ∈ σ → σ = ω\n\n/-- `B` and `Z` are precisely the two common points of the distinct circles `ω` and `γ`,\nas required by the phrase that `γ` meets `ω` again at `Z ≠ B`. -/\ndef IsOtherCircleIntersection (ω γ : EuclideanGeometry.Sphere Plane) (B Z : Plane) : Prop :=\n Z ≠ B ∧ ω ≠ γ ∧\n ∀ Q : Plane, Q ∈ ω ∧ Q ∈ γ ↔ Q = B ∨ Q = Z\n\n/-- `V` is precisely the second intersection of the line through `Z` and `D` with `ω`. -/\ndef IsSecondLineIntersection (ω : EuclideanGeometry.Sphere Plane) (Z D V : Plane) : Prop :=\n V ≠ Z ∧\n ∀ Q : Plane, Q ∈ ω ∧ Q ∈ line[ℝ, Z, D] ↔ Q = Z ∨ Q = V\n\n/-- The complete configuration appearing in the problem. The unnamed line in the problem\nis represented by the affine line `L`. -/\ndef Configuration (A B C D : Plane) (L : AffineSubspace ℝ Plane) (X Y : Plane)\n (ω γ : EuclideanGeometry.Sphere Plane) (Z V W : Plane) : Prop :=\n IsTriangle A B C ∧\n OnClosedSegment B C D ∧\n IsAffineLine L ∧\n D ∈ L ∧\n X ∈ L ∧\n OnClosedSegment A B X ∧\n (∀ Q : Plane, Q ∈ L → OnClosedSegment A B Q → Q = X) ∧\n Y ∈ L ∧\n OnRay A C Y ∧\n (∀ Q : Plane, Q ∈ L → OnRay A C Q → Q = Y) ∧\n IsCircumcircle ω A B C ∧\n IsTriangle B X D ∧\n IsCircumcircle γ B X D ∧\n IsOtherCircleIntersection ω γ B Z ∧\n IsSecondLineIntersection ω Z D V ∧\n IsSecondLineIntersection ω Z Y W\n\n/-- The theorem stated in the problem: in every such configuration, `AB = VW`. -/\ndef Target : Prop :=\n ∀ (A B C D : Plane) (L : AffineSubspace ℝ Plane) (X Y : Plane)\n (ω γ : EuclideanGeometry.Sphere Plane) (Z V W : Plane),\n Configuration A B C D L X Y ω γ Z V W → dist A B = dist V W\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d21f24f1-ba4f-55ac-8b8c-69c8fa1d3416", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7590362fbe4f9d396a5b7ce5c0f8f452762fe2754b144e5016bc1099b771c781", "task_path": "tasks/nmp3_d21f24f1-ba4f-55ac-8b8c-69c8fa1d3416", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d21f24f1-ba4f-55ac-8b8c-69c8fa1d3416", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d244eb2d-7b72-53d9-808b-a495a24124c0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with $a+b+c>0$. Prove that \n-- \\[\n-- \\frac{(2a+b+c)^2}{2a^2+(b+c)^2}+\\frac{(2b+c+a)^2}{2b^2+(c+a)^2}+\\frac{(2c+a+b)^2}{2c^2+(a+b)^2}\\le 4+\\frac{12(ab+bc+ca)}{(a+b+c)^2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic rational inequality\n\nThis file states the inequality from the supplied problem. It contains no\nproof of the inequality; `Target` is a proposition-valued definition.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The first summand `(2a+b+c)^2 / (2a^2+(b+c)^2)`. -/\ndef termA (a b c : ℝ) : ℝ :=\n (2 * a + b + c) ^ 2 / (2 * a ^ 2 + (b + c) ^ 2)\n\n/-- The second summand `(2b+c+a)^2 / (2b^2+(c+a)^2)`. -/\ndef termB (a b c : ℝ) : ℝ :=\n (2 * b + c + a) ^ 2 / (2 * b ^ 2 + (c + a) ^ 2)\n\n/-- The third summand `(2c+a+b)^2 / (2c^2+(a+b)^2)`. -/\ndef termC (a b c : ℝ) : ℝ :=\n (2 * c + a + b) ^ 2 / (2 * c ^ 2 + (a + b) ^ 2)\n\n/-- The left-hand side of the stated inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n termA a b c + termB a b c + termC a b c\n\n/-- The right-hand side `4 + 12(ab+bc+ca)/(a+b+c)^2`. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 4 + 12 * (a * b + b * c + c * a) / (a + b + c) ^ 2\n\n/-- The nonnegativity and positive-sum hypotheses from the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a + b + c\n\n/-- The complete inequality assertion for all admissible real triples. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n 0 < a + b + c →\n lhs a b c ≤ rhs a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d244eb2d-7b72-53d9-808b-a495a24124c0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "680bc2e9ef0c2884c9d81cdc481b770b1190db54136925b2cd5cbcfc2f95d593", "task_path": "tasks/nmp3_d244eb2d-7b72-53d9-808b-a495a24124c0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d244eb2d-7b72-53d9-808b-a495a24124c0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d2738f92-43ff-56c3-b392-bb555851c4ba", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{a^4}{(a+b)(a^2+b^2)}+\\frac{b^4}{(b+c)(b^2+c^2)}+\\frac{c^4}{(c+a)(c^2+a^2)}\\ge\\frac{a^2+b^2+c^2}{4}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 4 / ((a + b) * (a ^ 2 + b ^ 2)) +\n b ^ 4 / ((b + c) * (b ^ 2 + c ^ 2)) +\n c ^ 4 / ((c + a) * (c ^ 2 + a ^ 2))\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2) / 4\n\n/-- For all positive real numbers `a`, `b`, and `c` whose sum is `3`, the stated\nsum of three rational expressions is at least `(a ^ 2 + b ^ 2 + c ^ 2) / 4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a + b + c = 3 →\n lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2738f92-43ff-56c3-b392-bb555851c4ba", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e56edb18ade971de910ecf20a7e646221331aac31538e827a5dddb53a0c120d4", "task_path": "tasks/nmp3_d2738f92-43ff-56c3-b392-bb555851c4ba", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2738f92-43ff-56c3-b392-bb555851c4ba", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d2838fcf-6957-528c-ada1-415810b66177", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle (i.e. $a,b,c>0$ and $a+b>c$, $b+c>a$, $c+a>b$). Prove that \n-- \\[\n-- \\frac{1}{a^{2}+bc}+\\frac{1}{b^{2}+ca}+\\frac{1}{c^{2}+ab}\\;\\ge\\;\n-- \\frac{2(a+b+c)^{2}}{3\\,(a^{2}+b^{2}+c^{2})}\\Biggl(\\frac{1}{(a+b)^{2}}+\\frac{1}{(b+c)^{2}}+\\frac{1}{(c+a)^{2}}\\Biggr).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The real numbers `a`, `b`, and `c` are the side lengths of a\nnondegenerate triangle: they are strictly positive and satisfy all three\nstrict triangle inequalities. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The inequality asserted in the problem, for side lengths `a`, `b`, and `c`. -/\ndef TriangleInequality (a b c : ℝ) : Prop :=\n ((1 : ℝ) / (a ^ 2 + b * c) +\n (1 : ℝ) / (b ^ 2 + c * a) +\n (1 : ℝ) / (c ^ 2 + a * b))\n ≥\n ((2 : ℝ) * (a + b + c) ^ 2 /\n ((3 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2))) *\n (((1 : ℝ) / ((a + b) ^ 2)) +\n ((1 : ℝ) / ((b + c) ^ 2)) +\n ((1 : ℝ) / ((c + a) ^ 2)))\n\n/-- The full statement: for every triple of side lengths of a nondegenerate\ntriangle, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsTriangleSideLengths a b c → TriangleInequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2838fcf-6957-528c-ada1-415810b66177", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "78613db9fc71159369a16924ab74d79f1b7fb7ab95f320f888936033634d6b1f", "task_path": "tasks/nmp3_d2838fcf-6957-528c-ada1-415810b66177", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2838fcf-6957-528c-ada1-415810b66177", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d2964b95-25ef-5a3a-84a9-d3781acdfda6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\{a_n\\}_{n\\ge1}$ be a bounded real sequence satisfying \n-- \\[\n-- a_n \\;<\\; \\sum_{k=n}^{2n+2006} \\frac{a_k}{k+1} \\;+\\; \\frac{1}{2n+2007}\n-- \\qquad\\text{for all }n=1,2,3,\\dots .\n-- \\] \n-- Prove that $a_n < \\dfrac{1}{n}$ for every $n\\ge1$.\nimport Mathlib\n\n/-!\n# Formal statement of the sequence inequality problem\n\nThe original problem considers a real sequence indexed by the positive natural numbers.\nWe represent it as a function `a : ℕ → ℝ` and impose both the boundedness assumption\nand the displayed inequality only at positive indices. The infinite sum in the\nstatement is a finite sum over the natural interval `k = n, ..., 2*n + 2006`, with\neach term interpreted as a real number.\n-/\n\nnamespace Problem\n\n/-- The sequence is bounded on its intended domain `n ≥ 1`. We use the standard\nabsolute-value formulation of boundedness, with a nonnegative real bound. -/\ndef BoundedOnPositiveIndices (a : ℕ → ℝ) : Prop :=\n ∃ M : ℝ, 0 ≤ M ∧ ∀ n : ℕ, 1 ≤ n → |a n| ≤ M\n\n/-- The displayed hypothesis, for every positive integer `n`. -/\ndef InequalityHypothesis (a : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, 1 ≤ n →\n a n <\n (∑ k ∈ Finset.Icc n (2 * n + 2006),\n a k / ((k + 1 : ℕ) : ℝ)) +\n (1 : ℝ) / ((2 * n + 2007 : ℕ) : ℝ)\n\n/-- The combined assumptions of the problem. -/\ndef Assumptions (a : ℕ → ℝ) : Prop :=\n BoundedOnPositiveIndices a ∧ InequalityHypothesis a\n\n/-- The claimed conclusion, again over positive indices only. -/\ndef Conclusion (a : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, 1 ≤ n → a n < (1 : ℝ) / (n : ℝ)\n\n/-- The full mathematical assertion: every bounded real sequence satisfying the\ndisplayed inequality for all positive `n` satisfies the claimed estimate. -/\ndef Target : Prop :=\n ∀ a : ℕ → ℝ, Assumptions a → Conclusion a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2964b95-25ef-5a3a-84a9-d3781acdfda6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7aeefad46af39f95746dd005bcec7feb418c076678592c79347cba1a4eeb683c", "task_path": "tasks/nmp3_d2964b95-25ef-5a3a-84a9-d3781acdfda6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2964b95-25ef-5a3a-84a9-d3781acdfda6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d2c592f7-7eb6-5c64-88b2-07cb55986987", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $D$ be a point in the interior of $\\triangle ABC$ such that there exist positive numbers $a,b,c,d$ with \n-- $$AB=ab,\\quad AC=ac,\\quad AD=ad,\\quad BC=bc,\\quad BD=bd,\\quad CD=cd.$$ \n-- Prove that \n-- $$\\angle ABD+\\angle ACD=\\frac{\\pi}{3}\\,.$$\n/-\n Formal statement of the problem in `problem.md`.\n\n We model the Euclidean plane as `EuclideanSpace ℝ (Fin 2)`. For points\n `A B C D`, `TriangleInterior A B C D` says that `D` is in the topological\n interior of the convex hull of `{A, B, C}` (the interior of the triangular\n region with vertices `A`, `B`, and `C`). `SideLengthFactorization` records\n the existence of the four positive real numbers `a`, `b`, `c`, `d` with the\n six prescribed side-length factorizations.\n-/\n\nimport Mathlib.Analysis.Convex.Hull\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The ambient Euclidean plane. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `D` lies in the interior of the triangle with vertices `A`, `B`, and `C`. -/\ndef TriangleInterior (A B C D : Point) : Prop :=\n D ∈ interior (convexHull ℝ ({A, B, C} : Set Point))\n\n/-- There exist positive real numbers `a`, `b`, `c`, and `d` such that the six\ndistances among `A`, `B`, `C`, and `D` have the prescribed products. -/\ndef SideLengthFactorization (A B C D : Point) : Prop :=\n ∃ a b c d : ℝ,\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧\n dist A B = a * b ∧\n dist A C = a * c ∧\n dist A D = a * d ∧\n dist B C = b * c ∧\n dist B D = b * d ∧\n dist C D = c * d\n\n/-- The assertion to be proved: if `D` is interior to triangle `ABC` and the\nsix pairwise distances admit the stated positive multiplicative\nfactorization, then the sum of the angles `∠ABD` and `∠ACD` is `π / 3`. -/\ndef Target : Prop :=\n ∀ A B C D : Point,\n TriangleInterior A B C D →\n SideLengthFactorization A B C D →\n EuclideanGeometry.angle A B D + EuclideanGeometry.angle A C D = Real.pi / 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2c592f7-7eb6-5c64-88b2-07cb55986987", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d2afed7d6eacbdd84953222e476443366e3fd816e67a68447475db57dd78fb19", "task_path": "tasks/nmp3_d2c592f7-7eb6-5c64-88b2-07cb55986987", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2c592f7-7eb6-5c64-88b2-07cb55986987", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d2da8a34-3fa4-593f-be96-b400d8627f44", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $a,b,c$ are positive real numbers such that for every positive integer $n$, \n-- \\[\n-- \\lfloor an\\rfloor+\\lfloor bn\\rfloor=\\lfloor cn\\rfloor .\n-- \\] \n-- Prove that at least one of $a,b,c$ is an integer.\nimport Mathlib\n\n/-!\n# Formalization of the floor-equation problem\n\nThe source problem asks to prove that, if positive real numbers `a`, `b`, and `c`\nsatisfy `⌊a n⌋ + ⌊b n⌋ = ⌊c n⌋` for every positive integer `n`, then at least one\nof `a`, `b`, and `c` is an integer.\n-/\n\nnamespace Problem\n\n/-- A real number is an integer when it is the image of some integer under the\ncanonical coercion `ℤ → ℝ`. -/\ndef IsInteger (x : ℝ) : Prop :=\n ∃ z : ℤ, x = (z : ℝ)\n\n/-- The floor equation holds for every positive integer `n`. -/\ndef FloorEquation (a b c : ℝ) : Prop :=\n ∀ n : ℕ, 0 < n →\n ⌊a * (n : ℝ)⌋ + ⌊b * (n : ℝ)⌋ = ⌊c * (n : ℝ)⌋\n\n/-- The full statement to be proved: for all positive real `a`, `b`, `c`, if the\nfloor equation holds for every positive integer `n`, then at least one of\n`a`, `b`, `c` is an integer. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c →\n FloorEquation a b c →\n IsInteger a ∨ IsInteger b ∨ IsInteger c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2da8a34-3fa4-593f-be96-b400d8627f44", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a8988becad6d84bdfc2ba9d095271692e0d93b7b157bda14fb3dbb4c7db6c311", "task_path": "tasks/nmp3_d2da8a34-3fa4-593f-be96-b400d8627f44", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2da8a34-3fa4-593f-be96-b400d8627f44", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d2dab5f9-9231-519b-8221-3f0e7102f5d9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $abc=1$. Prove that \n-- \\[\n-- \\frac{(a^3-1)(b^3-1)}{b^3}+\\frac{(b^3-1)(c^3-1)}{c^3}+\\frac{(c^3-1)(a^3-1)}{a^3}\\le 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Statement: a cyclic inequality under a product constraint\n\nThis file records the exact assertion of the problem as an unproved\nproposition-valued definition. No proof of the assertion is supplied here.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. All arithmetic is real arithmetic,\nso `/` is the usual (total) division operation on `ℝ`. -/\nnoncomputable def inequalityLHS (a b c : ℝ) : ℝ :=\n ((a ^ 3 - 1) * (b ^ 3 - 1)) / (b ^ 3) +\n ((b ^ 3 - 1) * (c ^ 3 - 1)) / (c ^ 3) +\n ((c ^ 3 - 1) * (a ^ 3 - 1)) / (a ^ 3)\n\n/-- The exact target assertion: for all positive real numbers `a`, `b`, and `c`\nwhose product is `1`, the displayed cyclic sum is nonpositive. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → a * b * c = 1 →\n inequalityLHS a b c ≤ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2dab5f9-9231-519b-8221-3f0e7102f5d9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9f582f5347669927a62bd9774c430e7160306859fe5c010ae8d90c5a9c814b36", "task_path": "tasks/nmp3_d2dab5f9-9231-519b-8221-3f0e7102f5d9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2dab5f9-9231-519b-8221-3f0e7102f5d9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d2ed9d07-dfc1-5c1f-a888-26ce0be46f36", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$ prove that \n-- \\[\n-- \\frac {1}{(a^2+2bc)(b+c)^2}+\\frac {1}{(b^2+2ca)(c+a)^2}+\\frac {1}{(c^2+2ab)(a+b)^2}\\le \\frac {9}{4\\,(ab+bc+ca)^2}.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the inequality stated in `problem.md`.\n\nFor positive real numbers `a`, `b`, and `c`, the sum\n\n`1 / ((a^2 + 2bc) * (b+c)^2) + ...`\n\nis at most `9 / (4 * (ab+bc+ca)^2)`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / ((a ^ 2 + 2 * b * c) * (b + c) ^ 2)\n + 1 / ((b ^ 2 + 2 * c * a) * (c + a) ^ 2)\n + 1 / ((c ^ 2 + 2 * a * b) * (a + b) ^ 2)\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 9 / (4 * (a * b + b * c + c * a) ^ 2)\n\n/--\nThe complete assertion: for every triple of positive real numbers `a`, `b`,\nand `c`, the left-hand side is at most the right-hand side.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2ed9d07-dfc1-5c1f-a888-26ce0be46f36", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0021245b0b457da9eb0b94e87a073220c21dd83fb2aecd6ae49789cbe63c2984", "task_path": "tasks/nmp3_d2ed9d07-dfc1-5c1f-a888-26ce0be46f36", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d2ed9d07-dfc1-5c1f-a888-26ce0be46f36", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d30c2d38-df87-5e83-a216-c0d403c2d2ca", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a+b+c=abc$. Prove that \n-- \\[\n-- \\frac{a^{2}}{b^{2}}+\\frac{b^{2}}{c^{2}}+\\frac{c^{2}}{a^{2}}\\ge \\sqrt{\\,a^{2}+b^{2}+c^{2}\\,}.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nsatisfying `a + b + c = a * b * c`, that\n\n`a^2 / b^2 + b^2 / c^2 + c^2 / a^2 ≥ Real.sqrt (a^2 + b^2 + c^2)`.\n\nThis file records the complete universally quantified assertion as a proposition.\nNo proof is supplied in this statement-formalization task.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real numbers: all are positive and\nthey satisfy the constraint `a + b + c = a * b * c`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = a * b * c\n\n/-- The inequality asserted in the problem, with real division and the real square\nroot. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a ^ 2 / b ^ 2 + b ^ 2 / c ^ 2 + c ^ 2 / a ^ 2 ≥\n Real.sqrt (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The full target statement: for every triple of positive real numbers satisfying\n`a + b + c = a * b * c`, the asserted inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d30c2d38-df87-5e83-a216-c0d403c2d2ca", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ad425fcaba8fe583ebabe45d1cf8791fc65ececb2f355fa02bd1cbc787149719", "task_path": "tasks/nmp3_d30c2d38-df87-5e83-a216-c0d403c2d2ca", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d30c2d38-df87-5e83-a216-c0d403c2d2ca", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d32ae602-d13f-523d-8e84-4f3817eea910", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be an odd prime. For any integer $a$ define \n-- \\[\n-- S_a=\\sum_{j=1}^{p-1}\\frac{a^j}{j}\\,.\n-- \\] \n-- Let $m,n\\in\\mathbb Z$ be such that $S_3+S_4-3S_2=\\frac{m}{n}$. Prove that $p\\mid m$ (i.e. the numerator of $S_3+S_4-3S_2$ is divisible by $p$).\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- For an odd prime parameter `p` and an integer `a`, this is the rational sum\n`S_a = ∑_{j=1}^{p-1} a^j / j`, with all arithmetic taking place in `ℚ`. -/\ndef S (p : ℕ) (a : ℤ) : ℚ :=\n ∑ j ∈ Finset.Icc 1 (p - 1), (a : ℚ) ^ j / (j : ℚ)\n\n/-- The particular rational expression `S_3 + S_4 - 3 S_2` from the problem. -/\ndef combination (p : ℕ) : ℚ :=\n S p 3 + S p 4 - 3 * S p 2\n\n/-- The canonical integer numerator of `S_3 + S_4 - 3 S_2`. -/\ndef numerator (p : ℕ) : ℤ :=\n (combination p).num\n\n/-- The canonical numerator of `S_3 + S_4 - 3 S_2` is divisible by `p`. -/\ndef numeratorDivisible (p : ℕ) : Prop :=\n (p : ℤ) ∣ numerator p\n\n/-- An integer fraction `m / n` represents the rational number `q`, with the\nimplicit requirement that the denominator be nonzero. -/\ndef represents (q : ℚ) (m n : ℤ) : Prop :=\n n ≠ 0 ∧ q = (m : ℚ) / (n : ℚ)\n\n/-- The assertion of the problem. For every odd prime `p`, both equivalent\nforms of the conclusion are recorded: every nonzero integer fraction `m / n`\nrepresenting `S_3 + S_4 - 3 * S_2` has numerator `m` divisible by `p`, and\nthe canonical reduced numerator of `S_3 + S_4 - 3 * S_2` is divisible by `p`. -/\ndef Target : Prop :=\n ∀ (p : ℕ), Nat.Prime p → Odd p →\n (∀ (m n : ℤ), represents (combination p) m n → (p : ℤ) ∣ m) ∧\n numeratorDivisible p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d32ae602-d13f-523d-8e84-4f3817eea910", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "607ca1359be697715b4cdb5637819586d16abce04d1a63266991c0eb1f72b0cb", "task_path": "tasks/nmp3_d32ae602-d13f-523d-8e84-4f3817eea910", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d32ae602-d13f-523d-8e84-4f3817eea910", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d32fabae-1654-57d7-879b-b3e1da3d22cf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a^2+b^2+c^2=3$. Prove that \n-- \\[\n-- a^2\\frac{a-b^5}{a+b^5}+b^2\\frac{b-c^5}{b+c^5}+c^2\\frac{c-a^5}{c+a^5}\\ge0\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe source asks one to prove a cyclic inequality for positive real numbers\nwhose squares sum to 3.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the cyclic inequality. -/\nnoncomputable def IneqLHS (a b c : ℝ) : ℝ :=\n a ^ 2 * ((a - b ^ 5) / (a + b ^ 5)) +\n b ^ 2 * ((b - c ^ 5) / (b + c ^ 5)) +\n c ^ 2 * ((c - a ^ 5) / (c + a ^ 5))\n\n/-- The assertion to be proved: for all positive real `a`, `b`, and `c`\nsatisfying `a ^ 2 + b ^ 2 + c ^ 2 = 3`, the cyclic expression is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = 3 →\n IneqLHS a b c ≥ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d32fabae-1654-57d7-879b-b3e1da3d22cf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "441e50c5f24aa8f80063889922165f7a3a4609ebf3317f30756b225169940a48", "task_path": "tasks/nmp3_d32fabae-1654-57d7-879b-b3e1da3d22cf", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d32fabae-1654-57d7-879b-b3e1da3d22cf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d35e7b78-ad15-5c5a-ad6f-1c4ca2a81bee", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{1}{5(a^{2}+b^{2})-ab}+\\frac{1}{5(a^{2}+c^{2})-ac}+\\frac{1}{5(b^{2}+c^{2})-bc}\\ge \\frac{1}{a^{2}+b^{2}+c^{2}}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The strict positivity hypotheses `a > 0`, `b > 0`, and `c > 0`. -/\ndef PosTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / (5 * (a ^ 2 + b ^ 2) - a * b) +\n 1 / (5 * (a ^ 2 + c ^ 2) - a * c) +\n 1 / (5 * (b ^ 2 + c ^ 2) - b * c)\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 1 / (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`, the stated\nsum of reciprocal denominators is at least the reciprocal of `a ^ 2 + b ^ 2 + c ^ 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PosTriple a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d35e7b78-ad15-5c5a-ad6f-1c4ca2a81bee", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e97f4dff59816c840c6f3009538e161ed10be220d553501263ca428c27713e8e", "task_path": "tasks/nmp3_d35e7b78-ad15-5c5a-ad6f-1c4ca2a81bee", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d35e7b78-ad15-5c5a-ad6f-1c4ca2a81bee", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d38aa399-41bc-55ba-b511-fbb2975daa3c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers. Prove that \n-- \\[\n-- \\bigl(a^2+2ab+3b^2\\bigr)\\bigl(b^2+2bc+3c^2\\bigr)\\bigl(c^2+2ca+3a^2\\bigr)\\ge 8\\,(a^2+ab+bc)\\,(b^2+bc+ca)\\,(c^2+ca+ab)\\, .\n-- \\]\nimport Mathlib.Data.Real.Basic\n\n/-!\n# Formal statement for the three-variable polynomial inequality\n\nThe source problem asks to prove, for all real numbers `a`, `b`, and `c`, that\n\n`(a^2 + 2ab + 3b^2) * (b^2 + 2bc + 3c^2) * (c^2 + 2ca + 3a^2)`\nis at least\n`8 * (a^2 + ab + bc) * (b^2 + bc + ca) * (c^2 + ca + ab)`.\n\nThe declarations below only state the proposition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The first factor on the left-hand side: `a^2 + 2ab + 3b^2`. -/\ndef lhsFactor1 (a b : ℝ) : ℝ := a ^ 2 + 2 * a * b + 3 * b ^ 2\n\n/-- The second factor on the left-hand side: `b^2 + 2bc + 3c^2`. -/\ndef lhsFactor2 (b c : ℝ) : ℝ := b ^ 2 + 2 * b * c + 3 * c ^ 2\n\n/-- The third factor on the left-hand side: `c^2 + 2ca + 3a^2`. -/\ndef lhsFactor3 (c a : ℝ) : ℝ := c ^ 2 + 2 * c * a + 3 * a ^ 2\n\n/-- The complete left-hand side of the source inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n lhsFactor1 a b * lhsFactor2 b c * lhsFactor3 c a\n\n/-- The first factor on the right-hand side: `a^2 + ab + bc`. -/\ndef rhsFactor1 (a b c : ℝ) : ℝ := a ^ 2 + a * b + b * c\n\n/-- The second factor on the right-hand side: `b^2 + bc + ca`. -/\ndef rhsFactor2 (a b c : ℝ) : ℝ := b ^ 2 + b * c + c * a\n\n/-- The third factor on the right-hand side: `c^2 + ca + ab`. -/\ndef rhsFactor3 (a b c : ℝ) : ℝ := c ^ 2 + c * a + a * b\n\n/-- The complete right-hand side of the source inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 8 * rhsFactor1 a b c * rhsFactor2 a b c * rhsFactor3 a b c\n\n/--\nThe target proposition: for every triple of real numbers `a`, `b`, and `c`,\nthe product of the three left factors is at least eight times the product of\nthe three right factors.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d38aa399-41bc-55ba-b511-fbb2975daa3c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "98c960ca22f9be55dd9047f2ec0ba73659bb12b6d703c0a521eb10959ea6ad8f", "task_path": "tasks/nmp3_d38aa399-41bc-55ba-b511-fbb2975daa3c", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d38aa399-41bc-55ba-b511-fbb2975daa3c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d39a8b47-912a-5a8e-88bc-01d682f34e99", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Starting with the polynomial $x^2+x+2014$, two players alternately modify its coefficients. Calvin moves first and may increase or decrease the coefficient of $x$ by $1$. Hobbes then may increase or decrease the constant term by $1$. The players continue taking turns. Calvin wins as soon as the polynomial $x^2+ax+b$ on the board has integer roots (both roots are integers). Prove that Calvin has a winning strategy.\nimport Mathlib.Algebra.Polynomial.Basic\n\n/-!\n# A game on quadratic polynomials with integer roots\n\nThis file formalizes the statement of the following problem.\n\nStarting with the polynomial `x^2 + x + 2014`, Calvin and Hobbes alternate\nmoves. On each Calvin move the coefficient of `x` changes by exactly `±1`;\non each Hobbes move the constant coefficient changes by exactly `±1`. Calvin\nmoves first. Calvin wins as soon as the polynomial on the board has two\ninteger roots (counted with multiplicity). The formal target asserts that\nCalvin has a winning strategy.\n\nThe formalization uses finite histories of game states. A `CalvinStrategy` is\nany function from a finite history to one of Calvin's legal moves, and a\n`HobbesStrategy` is any function from a finite history to one of Hobbes's legal\nmoves. The history of play is generated recursively by alternating the two\ntransition functions. A state is winning when its polynomial factors into\ntwo linear factors over `ℤ`. `CalvinWinsAgainst` says that, for the play\ngenerated by the two strategies, there is a *first* time at which the board is\nwinning. The main target then has exactly the form \"there exists a Calvin\nstrategy such that for every Hobbes strategy, some finite first winning time\nexists\".\n-/\n\nopen Polynomial\n\nnamespace Problem\n\n/-- The polynomial on the board when the coefficient of `x` is `a` and the\nconstant coefficient is `b`. -/\nnoncomputable def boardPolynomial (a b : ℤ) : ℤ[X] :=\n X ^ 2 + C a * X + C b\n\n/-- The board polynomial has two integer roots, counted with multiplicity.\n\nThis is expressed by factorization into two linear factors over the integers.\nThe two roots are allowed to coincide, as is standard when roots are counted\nwith multiplicity. -/\ndef HasIntegerRoots (a b : ℤ) : Prop :=\n ∃ r s : ℤ, boardPolynomial a b = (X - C r) * (X - C s)\n\n/-- The initial polynomial `x^2 + x + 2014`. -/\nnoncomputable def initialPolynomial : ℤ[X] :=\n Problem.boardPolynomial 1 2014\n\n/-- The player whose turn it is. -/\ninductive Turn where\n | calvin\n | hobbes\n deriving DecidableEq, Repr\n\n/-- A game position consists of the two current coefficients and the player\nwhose turn it is. -/\nstructure GameState where\n a : ℤ\n b : ℤ\n turn : Turn\n deriving Repr\n\n/-- The current board polynomial of a game state. -/\nnoncomputable def GameState.boardPolynomial (s : GameState) : ℤ[X] :=\n Problem.boardPolynomial s.a s.b\n\n/-- The current board has two integer roots. -/\ndef GameState.HasIntegerRoots (s : GameState) : Prop :=\n Problem.HasIntegerRoots s.a s.b\n\n/-- A game state in which Calvin is to move. -/\ndef calvinTurn (a b : ℤ) : GameState :=\n { a := a, b := b, turn := Turn.calvin }\n\n/-- A game state in which Hobbes is to move. -/\ndef hobbesTurn (a b : ℤ) : GameState :=\n { a := a, b := b, turn := Turn.hobbes }\n\n/-- The initial board state: the polynomial `x^2 + x + 2014`, with Calvin to\nmove first. -/\ndef initialState : GameState :=\n calvinTurn 1 2014\n\n/-- The two possible Calvin moves: increase or decrease the coefficient of\n`x` by one. -/\ninductive CalvinMove where\n | increase\n | decrease\n deriving DecidableEq, Repr\n\nnamespace CalvinMove\n\n/-- The new coefficient of `x` after a Calvin move. -/\ndef applyA (m : CalvinMove) (a : ℤ) : ℤ :=\n match m with\n | increase => a + 1\n | decrease => a - 1\n\nend CalvinMove\n\n/-- The two possible Hobbes moves: increase or decrease the constant\ncoefficient by one. -/\ninductive HobbesMove where\n | increase\n | decrease\n deriving DecidableEq, Repr\n\nnamespace HobbesMove\n\n/-- The new constant coefficient after a Hobbes move. -/\ndef applyB (m : HobbesMove) (b : ℤ) : ℤ :=\n match m with\n | increase => b + 1\n | decrease => b - 1\n\nend HobbesMove\n\n/-- Apply Calvin's move to a state, changing only the coefficient of `x` and\npassing the turn to Hobbes. -/\ndef afterCalvin (s : GameState) (m : CalvinMove) : GameState :=\n { a := m.applyA s.a, b := s.b, turn := Turn.hobbes }\n\n/-- Apply Hobbes's move to a state, changing only the constant coefficient and\npassing the turn to Calvin. -/\ndef afterHobbes (s : GameState) (m : HobbesMove) : GameState :=\n { a := s.a, b := m.applyB s.b, turn := Turn.calvin }\n\n/-- A finite history of game states, stored most recent first. -/\nabbrev History : Type := List GameState\n\n/-- A deterministic Calvin strategy: from the complete finite history it\nselects one of Calvin's two legal moves. It is only consulted at histories\nwhose current state has Calvin to move. -/\nabbrev CalvinStrategy : Type := History → CalvinMove\n\n/-- A deterministic Hobbes strategy: from the complete finite history it\nselects one of Hobbes's two legal moves. It is only consulted at histories\nwhose current state has Hobbes to move. -/\nabbrev HobbesStrategy : Type := History → HobbesMove\n\n/-- Extend a nonempty history by one state, according to whose turn is current\nin the most recent state. -/\ndef advance (σ : CalvinStrategy) (τ : HobbesStrategy) (h : History) : History :=\n match h with\n | [] => []\n | s :: _ =>\n match s.turn with\n | Turn.calvin => afterCalvin s (σ h) :: h\n | Turn.hobbes => afterHobbes s (τ h) :: h\n\n/-- The history after `n` moves in the play generated by the two strategies.\nThe history at time `0` is the one-element history containing `initialState`. -/\ndef playHistory (σ : CalvinStrategy) (τ : HobbesStrategy) : ℕ → History\n | 0 => [initialState]\n | n + 1 => advance σ τ (playHistory σ τ n)\n\n/-- The current state after `n` moves in the generated play. -/\ndef stateAt (σ : CalvinStrategy) (τ : HobbesStrategy) (n : ℕ) : Option GameState :=\n (playHistory σ τ n).head?\n\n/-- The generated play has integer roots at time `n`. -/\ndef HasIntegerRootsAt (σ : CalvinStrategy) (τ : HobbesStrategy) (n : ℕ) : Prop :=\n ∃ s : GameState, stateAt σ τ n = some s ∧ s.HasIntegerRoots\n\n/-- Time `n` is the first time at which the generated play has integer roots:\nthe board has integer roots at `n` and at no earlier time. -/\ndef FirstIntegerRootsAt (σ : CalvinStrategy) (τ : HobbesStrategy) (n : ℕ) : Prop :=\n HasIntegerRootsAt σ τ n ∧\n ∀ k : ℕ, k < n → ¬ HasIntegerRootsAt σ τ k\n\n/-- Calvin wins against Hobbes's strategy `τ` when, in the generated play,\nthere is a first finite time at which the board has integer roots. -/\ndef CalvinWinsAgainst (σ : CalvinStrategy) (τ : HobbesStrategy) : Prop :=\n ∃ n : ℕ, FirstIntegerRootsAt σ τ n\n\n/-- `σ` is a winning Calvin strategy when Calvin wins against every possible\ndeterministic Hobbes strategy. -/\ndef IsWinningStrategy (σ : CalvinStrategy) : Prop :=\n ∀ τ : HobbesStrategy, CalvinWinsAgainst σ τ\n\n/-- Calvin has a winning strategy from the initial state. -/\ndef CalvinHasWinningStrategy : Prop :=\n ∃ σ : CalvinStrategy, IsWinningStrategy σ\n\n/-- The formal target of the problem: Calvin has a winning strategy in the\ncoefficient game starting from `x^2 + x + 2014`. -/\ndef Target : Prop :=\n CalvinHasWinningStrategy\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d39a8b47-912a-5a8e-88bc-01d682f34e99", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0a2aac2fce6f74e0e55e44a1230764b60a0d8e5c9d458a9a74a70d97837f84e6", "task_path": "tasks/nmp3_d39a8b47-912a-5a8e-88bc-01d682f34e99", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d39a8b47-912a-5a8e-88bc-01d682f34e99", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d3a28c6b-c183-50ff-b78e-7195412fc6df", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are real numbers such that $ab+bc+ca>0$, prove that \n-- \\[\n-- 8\\Bigg(\\frac{a}{a+b}+\\frac{b}{b+c}+\\frac{c}{c+a}\\Bigg)+\\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}\\ge 13\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the inequality problem\n\nThe source problem asks to prove, for all real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca > 0`, that\n\n`8 * (a / (a + b) + b / (b + c) + c / (c + a))\n + (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a) ≥ 13`.\n\nThe hypothesis implies that `a + b`, `b + c`, and `c + a` are all\nnonzero, so these real divisions agree with ordinary mathematical division\non every admissible triple. No denominator-nonzero assumption is added to\nthe target.\n\nNo answer or proof is supplied here; `Problem.Target` is the proposition to be\nproved.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition `ab + bc + ca > 0` on the real parameters. -/\ndef Admissible (a b c : ℝ) : Prop :=\n a * b + b * c + c * a > 0\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 8 * (a / (a + b) + b / (b + c) + c / (c + a)) +\n (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a)\n\n/-- The full formal target: for every triple of real numbers satisfying\n`ab + bc + ca > 0`, the displayed left-hand side is at least `13`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ 13\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d3a28c6b-c183-50ff-b78e-7195412fc6df", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "76d7a8d3441af8ecb021ccd2503fc7a8fcb969fc5bac83934a3ccf878bd56344", "task_path": "tasks/nmp3_d3a28c6b-c183-50ff-b78e-7195412fc6df", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d3a28c6b-c183-50ff-b78e-7195412fc6df", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d3b6c9e9-f0c8-526e-b0cc-0dd304df72e3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c,d>0$ and $abcd=1$, prove that \n-- $$a^4b+b^4c+c^4d+d^4a\\ge a+b+c+d.$$\nimport Mathlib\n\nnamespace Problem\n\n/--\nFor all positive real numbers `a`, `b`, `c`, and `d` whose product is `1`,\nthe cyclic fourth-power inequality holds:\n`a^4 * b + b^4 * c + c^4 * d + d^4 * a ≥ a + b + c + d`.\n-/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n 0 < d →\n a * b * c * d = 1 →\n a ^ 4 * b + b ^ 4 * c + c ^ 4 * d + d ^ 4 * a ≥\n a + b + c + d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d3b6c9e9-f0c8-526e-b0cc-0dd304df72e3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "29f75e5b8f3a359ee5e479eda426d752680b8a24d3bc2b9c002007d3333ebb73", "task_path": "tasks/nmp3_d3b6c9e9-f0c8-526e-b0cc-0dd304df72e3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d3b6c9e9-f0c8-526e-b0cc-0dd304df72e3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d42b3207-43d6-536d-99e5-bc64292f8c8b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers satisfying $abc=1$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{1}{a(a+b)}\\ge \\frac{3}{2}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic inequality problem\n\nLet `a`, `b`, and `c` be positive real numbers with `a * b * c = 1`.\nThe target below states the cyclic sum inequality\n`1 / (a * (a + b)) + 1 / (b * (b + c)) + 1 / (c * (c + a)) ≥ 3 / 2`.\n\nThis file only records the statement; it does not provide a proof.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum\n`1 / (a * (a + b)) + 1 / (b * (b + c)) + 1 / (c * (c + a))`.\nThe cyclic order of the variables is `a`, then `b`, then `c`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n 1 / (a * (a + b)) + 1 / (b * (b + c)) + 1 / (c * (c + a))\n\n/-- The complete assertion: for all positive real numbers `a`, `b`, and `c`\nwith `a * b * c = 1`, the cyclic sum is at least `3 / 2`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n cyclicSum a b c ≥ (3 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d42b3207-43d6-536d-99e5-bc64292f8c8b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "21c928b9f64c95e62106ce82a0b3a945cdaeba4f936ebf8fdc9d8b8b51a65fb4", "task_path": "tasks/nmp3_d42b3207-43d6-536d-99e5-bc64292f8c8b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d42b3207-43d6-536d-99e5-bc64292f8c8b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d44451e3-baa0-5ff4-9bfe-4268352c94a2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p>5$ be a prime. Suppose there exists an integer $k$ such that $p\\mid k^{2}+5$. Prove that there exist positive integers $m,n$ satisfying \n-- $$p^{2}=m^{2}+5n^{2}\\,. $$\nimport Mathlib\n\n/-!\n# Formal statement of the prime/quadratic-form problem\n\nThe original problem asks: if `p > 5` is prime and `p` divides `k^2 + 5`\nfor some integer `k`, then `p^2` has a representation `m^2 + 5 n^2` with\npositive integers `m` and `n`.\n\nThis file formalizes that assertion as the proposition `Problem.Target`.\nNo proof of the assertion is supplied.\n-/\n\nnamespace Problem\n\n/-- The hypothesis on `p`: it is prime and strictly greater than `5`. -/\ndef PrimeGreaterThanFive (p : ℕ) : Prop :=\n Nat.Prime p ∧ 5 < p\n\n/--\nThe congruence hypothesis: there is an integer `k` such that `p` divides\n`k^2 + 5`. The divisibility is stated in `ℤ`, since `k` is an integer.\n-/\ndef ExistsIntegerRootOfNegativeFive (p : ℕ) : Prop :=\n ∃ k : ℤ, (p : ℤ) ∣ k ^ 2 + 5\n\n/--\nThe desired conclusion: there are positive natural numbers `m` and `n`\nwith `p^2 = m^2 + 5 n^2`.\n-/\ndef HasPositiveRepresentation (p : ℕ) : Prop :=\n ∃ m n : ℕ, 0 < m ∧ 0 < n ∧ p ^ 2 = m ^ 2 + 5 * n ^ 2\n\n/--\nThe complete assertion of the problem: for every natural number `p` that is\nprime and satisfies `p > 5`, if `k^2 + 5` is divisible by `p` for some integer\n`k`, then there exist positive integers `m` and `n` with\n`p^2 = m^2 + 5 n^2`.\n-/\ndef Target : Prop :=\n ∀ p : ℕ,\n PrimeGreaterThanFive p →\n ExistsIntegerRootOfNegativeFive p →\n HasPositiveRepresentation p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d44451e3-baa0-5ff4-9bfe-4268352c94a2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "43a1f9318400b2beb1ba2c322b5c5d97cfa8794ce9be87bd015b267760fb7490", "task_path": "tasks/nmp3_d44451e3-baa0-5ff4-9bfe-4268352c94a2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d44451e3-baa0-5ff4-9bfe-4268352c94a2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d4663654-a2a6-5fe2-a10b-fabed8419126", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers such that $a^2+b^2+c^2=3$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{a^{3}}{3a+2b^{3}}\\ge\\frac35.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for a cyclic real-variable inequality\n\nThe source problem asks to prove, for all strictly positive real numbers\n`a`, `b`, and `c` satisfying `a^2 + b^2 + c^2 = 3`, the cyclic sum\n`a^3 / (3*a + 2*b^3) + b^3 / (3*b + 2*c^3) + c^3 / (3*c + 2*a^3)`\nis at least `3/5`.\n\nThe assertion is packaged as a proposition-valued definition. There is no\nproof term for the assertion in this file.\n-/\n\nnamespace Problem\n\n/-- One summand of the cyclic sum, with the denominator using the next\nvariable in the cycle `(a, b, c)`. -/\nnoncomputable def CycTerm (a b : ℝ) : ℝ :=\n a ^ 3 / (3 * a + 2 * b ^ 3)\n\n/-- The cyclic sum\n`a^3/(3a + 2b^3) + b^3/(3b + 2c^3) + c^3/(3c + 2a^3)`. -/\nnoncomputable def CycSum (a b c : ℝ) : ℝ :=\n CycTerm a b + CycTerm b c + CycTerm c a\n\n/-- The target proposition: for every strictly positive real triple satisfying\n`a^2 + b^2 + c^2 = 3`, the cyclic sum is at least `3/5`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = 3 →\n CycSum a b c ≥ (3 : ℝ) / 5\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d4663654-a2a6-5fe2-a10b-fabed8419126", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d2c60fb4eb12a6929a256c75e3deb6cf61d1dd804333e67ce4d0d83651e6abe6", "task_path": "tasks/nmp3_d4663654-a2a6-5fe2-a10b-fabed8419126", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d4663654-a2a6-5fe2-a10b-fabed8419126", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d478b8a0-40cf-5893-bea1-9cf3ce941321", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $abc=1$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{1}{(a^{4}+1)(b+c)^{3}}\\le\\frac{3}{16}.\n-- \\] \n-- (The cyclic sum is taken over $(a,b,c)$, $(b,c,a)$ and $(c,a,b)$.)\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic inequality problem\n\nThe source problem asks to prove, for positive reals `a`, `b`, `c` with\n`a * b * c = 1`, that the specified cyclic sum is at most `3 / 16`.\nThis file records the exact proposition as a `Prop`-valued definition; it does\nnot assert or prove the proposition.\n-/\n\nnamespace Problem\n\n/-- One term of the cyclic sum, with the distinguished variable `a`:\n\n`1 / ((a ^ 4 + 1) * (b + c) ^ 3)`.\n-/\nnoncomputable def cyclicTerm (a b c : ℝ) : ℝ :=\n 1 / ((a ^ 4 + 1) * (b + c) ^ 3)\n\n/-- The cyclic sum over `(a, b, c)`, `(b, c, a)`, and `(c, a, b)`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The hypotheses from the problem: `a`, `b`, and `c` are positive and\ntheir product is `1`. -/\ndef IsAdmissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The proposition requested by the problem: for every admissible triple of\nreal numbers, the cyclic sum is at most `3 / 16`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsAdmissible a b c → cyclicSum a b c ≤ (3 : ℝ) / 16\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d478b8a0-40cf-5893-bea1-9cf3ce941321", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "44ffaea17bdd83753bb69d0c94338ac3ccdadabefd805e5d1cb4f3d85d07a243", "task_path": "tasks/nmp3_d478b8a0-40cf-5893-bea1-9cf3ce941321", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d478b8a0-40cf-5893-bea1-9cf3ce941321", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d479af42-7a59-5c5a-8bd6-61b558daee1a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there are infinitely many rational triples $(a,b,c)$ such that $a+b+c = abc = 6$.\nimport Mathlib\n\n/-!\n# Infinitely many rational triples with sum and product equal to 6\n\nThis file formalizes the statement of the problem. An ordered rational\ntriple `(a,b,c)` is represented by a nested product `ℚ × ℚ × ℚ`. The\ntarget asserts that the set of such triples satisfying both equations is\ninfinite.\n-/\n\nnamespace Problem\n\n/-- Ordered triples of rational numbers. -/\nabbrev RationalTriple : Type := ℚ × ℚ × ℚ\n\n/-- The equation `a + b + c = 6` for rational numbers `a`, `b`, and `c`. -/\ndef SumEqualsSix (a b c : ℚ) : Prop :=\n a + b + c = 6\n\n/-- The equation `a * b * c = 6` for rational numbers `a`, `b`, and `c`. -/\ndef ProductEqualsSix (a b c : ℚ) : Prop :=\n a * b * c = 6\n\n/-- The predicate that a rational triple `(a,b,c)` satisfies\n`a + b + c = 6` and `a * b * c = 6`. -/\ndef Admissible (t : RationalTriple) : Prop :=\n SumEqualsSix t.1 t.2.1 t.2.2 ∧ ProductEqualsSix t.1 t.2.1 t.2.2\n\n/-- The set of all rational triples satisfying the two required equations. -/\ndef SolutionSet : Set RationalTriple :=\n {t | Admissible t}\n\n/-- There are infinitely many rational triples `(a,b,c)` such that\n`a + b + c = 6` and `a * b * c = 6`. -/\ndef Target : Prop :=\n Set.Infinite SolutionSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d479af42-7a59-5c5a-8bd6-61b558daee1a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3b4aea276bc17f8817bc69aabbb9abff844c76da5002b37c56d064ec47fc059d", "task_path": "tasks/nmp3_d479af42-7a59-5c5a-8bd6-61b558daee1a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d479af42-7a59-5c5a-8bd6-61b558daee1a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d482f65f-3ffc-52ea-be16-be89a95703d8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{1}{\\sqrt{\\frac{1}{b^2}+\\frac{3}{c^2}}}+\\frac{1}{\\sqrt{\\frac{1}{c^2}+\\frac{3}{a^2}}}+\\frac{1}{\\sqrt{\\frac{1}{a^2}+\\frac{3}{b^2}}}\\le\\frac{\\sqrt{3(ab+bc+ca)}}{2}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a three-variable square-root inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthe inequality\n`1 / sqrt (1 / b^2 + 3 / c^2) + ... ≤ sqrt (3 * (a*b + b*c + c*a)) / 2`.\n\nThe declarations below only state the problem. The target is a `Prop`-valued\ndefinition, not a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n 1 / Real.sqrt ((1 : ℝ) / b ^ 2 + (3 : ℝ) / c ^ 2) +\n 1 / Real.sqrt ((1 : ℝ) / c ^ 2 + (3 : ℝ) / a ^ 2) +\n 1 / Real.sqrt ((1 : ℝ) / a ^ 2 + (3 : ℝ) / b ^ 2)\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n Real.sqrt (3 * (a * b + b * c + c * a)) / (2 : ℝ)\n\n/-- The assertion of the source problem: for every positive real triple `(a,b,c)`,\nthe stated inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → LHS a b c ≤ RHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d482f65f-3ffc-52ea-be16-be89a95703d8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "93093ad80334c972f3fee1b3e4dc4b1ee1ec76b360275ab38ecb803f2c16ab83", "task_path": "tasks/nmp3_d482f65f-3ffc-52ea-be16-be89a95703d8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d482f65f-3ffc-52ea-be16-be89a95703d8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d4935932-cf45-58f7-bd9a-53cd88948fbb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a}{\\sqrt{a^{2}+2bc}}+\\frac{b}{\\sqrt{b^{2}+2ac}}+\\frac{c}{\\sqrt{c^{2}+2ab}}\\le\\frac{a+b+c}{\\sqrt{ab+bc+ca}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the positive-real square-root inequality\n\nThe source problem asks to prove, for all positive reals `a`, `b`, and `c`,\n\n`a / sqrt (a^2 + 2bc) + b / sqrt (b^2 + 2ac) + c / sqrt (c^2 + 2ab)\n ≤ (a + b + c) / sqrt (ab + bc + ca)`.\n\nThe declarations below record the admissibility predicate, the two sides of\nthe asserted inequality, and the complete universally quantified proposition.\nNo proof of the proposition is supplied.\n-/\n\nnamespace Problem\n\n/-- The positivity hypotheses `a > 0`, `b > 0`, and `c > 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / Real.sqrt (a ^ 2 + 2 * b * c) +\n b / Real.sqrt (b ^ 2 + 2 * a * c) +\n c / Real.sqrt (c ^ 2 + 2 * a * b)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a + b + c) / Real.sqrt (a * b + b * c + c * a)\n\n/-- The universal statement of the problem: for all positive reals `a`, `b`,\nand `c`, the displayed square-root inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d4935932-cf45-58f7-bd9a-53cd88948fbb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "019d25650eda0c4a328c3b3d473438e5b013c3018acb276a2d15d5066adeb17e", "task_path": "tasks/nmp3_d4935932-cf45-58f7-bd9a-53cd88948fbb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d4935932-cf45-58f7-bd9a-53cd88948fbb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d4bbb9ea-533c-50ee-838e-ac342368a3fb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A strip of width w is the set of all points lying on or between two parallel lines a distance w apart. Let S be a set of n ( n ≥ 3) points in the plane such that any three distinct points of S can be covered by a strip of width 1. Prove that S can be covered by a strip of width 2.\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/--\nThe closed strip determined by the unit normal `u`, center-line offset `c`, and\nwidth `w`. It consists of all points whose scalar projection on `u` lies in\n`[c - w / 2, c + w / 2]`. Equivalently, it is the set of points on or between\nthe two parallel lines `⟪u, p⟫ = c - w / 2` and `⟪u, p⟫ = c + w / 2`.\n-/\ndef Strip (u : Plane) (c w : ℝ) : Set Plane :=\n {p : Plane | |inner ℝ u p - c| ≤ w / 2}\n\n/-- `IsStripOfWidth w A` says that `A` is exactly a closed strip of width `w`. -/\ndef IsStripOfWidth (w : ℝ) (A : Set Plane) : Prop :=\n 0 ≤ w ∧ ∃ (u : Plane) (c : ℝ), ‖u‖ = 1 ∧ A = Strip u c w\n\n/-- A set of points can be covered by a closed strip of width `w`. -/\ndef CanBeCoveredByStrip (w : ℝ) (A : Set Plane) : Prop :=\n ∃ B : Set Plane, IsStripOfWidth w B ∧ A ⊆ B\n\n/--\nThe condition that every three distinct points of the finite point set `S` can\nbe covered by a strip of width `1`. A choice of three distinct points is\nrepresented by a three-element `Finset` contained in `S`.\n-/\ndef EveryThreePointsCoverableByUnitStrip (S : Finset Plane) : Prop :=\n ∀ T : Finset Plane,\n T ⊆ S → T.card = 3 → CanBeCoveredByStrip 1 (T : Set Plane)\n\n/--\nThe assertion of the problem: for every finite set `S` of `n` points in the\nEuclidean plane, with `n ≥ 3`, if every three distinct points of `S` can be\ncovered by a strip of width `1`, then all of `S` can be covered by a strip of\nwidth `2`.\n-/\ndef Target : Prop :=\n ∀ (n : ℕ) (S : Finset Plane),\n 3 ≤ n →\n S.card = n →\n EveryThreePointsCoverableByUnitStrip S →\n CanBeCoveredByStrip 2 (S : Set Plane)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d4bbb9ea-533c-50ee-838e-ac342368a3fb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "07bfb6700ded63de7f54fb3bbc9c0359eedfad439d6a8d5879aa21805f9c035e", "task_path": "tasks/nmp3_d4bbb9ea-533c-50ee-838e-ac342368a3fb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d4bbb9ea-533c-50ee-838e-ac342368a3fb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d4d226f4-5553-52bd-9fe8-4c276712640c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\sqrt{\\frac{b+c}{a^3+1}}+\\sqrt{\\frac{c+a}{b^3+1}}+\\sqrt{\\frac{a+b}{c^3+1}}\\ge\\frac{9}{a+b+c}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nFor positive real numbers `a`, `b`, and `c` satisfying `a * b * c = 1`,\nprove\n`sqrt ((b + c) / (a ^ 3 + 1)) + sqrt ((c + a) / (b ^ 3 + 1)) +\n sqrt ((a + b) / (c ^ 3 + 1)) ≥ 9 / (a + b + c)`.\n\nThe declaration `Problem.Target` is the proposition to be proved; it is not\nprovided with a proof here.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the real variables: all three are positive\nand their product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n Real.sqrt ((b + c) / (a ^ 3 + 1)) +\n Real.sqrt ((c + a) / (b ^ 3 + 1)) +\n Real.sqrt ((a + b) / (c ^ 3 + 1))\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n 9 / (a + b + c)\n\n/-- The asserted inequality for fixed admissible `a`, `b`, and `c`. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n leftHandSide a b c ≥ rightHandSide a b c\n\n/-- The full assertion of the problem: for every triple of positive real\nnumbers with product one, the stated inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d4d226f4-5553-52bd-9fe8-4c276712640c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7cc719f0d72a3f67ca3756ab049c1eb46d99b9919882d422f56040aac7174106", "task_path": "tasks/nmp3_d4d226f4-5553-52bd-9fe8-4c276712640c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d4d226f4-5553-52bd-9fe8-4c276712640c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d4da8482-14e1-5423-9438-72b48e638820", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose that each integer is coloured with one of four colours (red, blue, green, or yellow). Let $x$ and $y$ be odd integers with $|x|\\neq|y|$. Prove that there exist two integers of the same colour whose difference is equal to $x$, $y$, $x+y$, or $x-y$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The four colours named in the problem. -/\ninductive Color where\n | red\n | blue\n | green\n | yellow\n deriving DecidableEq\n\n/-- The conclusion predicate: some two distinct integers have the same colour and\ntheir ordered difference is one of `x`, `y`, `x + y`, or `x - y`. -/\ndef MonochromaticDifference (coloring : ℤ → Color) (x y : ℤ) : Prop :=\n ∃ a b : ℤ,\n a ≠ b ∧\n coloring a = coloring b ∧\n (a - b = x ∨ a - b = y ∨ a - b = x + y ∨ a - b = x - y)\n\n/-- In every colouring of all integers with the four colours, for all odd integers\n`x` and `y` with `|x| ≠ |y|`, there are two distinct integers of the same colour\nwhose difference is `x`, `y`, `x + y`, or `x - y`. -/\ndef Target : Prop :=\n ∀ (coloring : ℤ → Color) (x y : ℤ),\n Odd x → Odd y → |x| ≠ |y| → MonochromaticDifference coloring x y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d4da8482-14e1-5423-9438-72b48e638820", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b8d3fb4269ee02c62c29f27ac932dcd3ce6e3a2f3e017b9e895e8c4cbec66b9f", "task_path": "tasks/nmp3_d4da8482-14e1-5423-9438-72b48e638820", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d4da8482-14e1-5423-9438-72b48e638820", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d4decf17-2af6-57b4-978d-8217e7a56264", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for positive reals $a,b,c$, \n-- \\[\n-- \\frac{a^2}{b+c}+\\frac{b^2}{c+a}+\\frac{c^2}{a+b}\\ge \\frac{3}{2}\\cdot \\frac{a^3+b^3+c^3}{a^2+b^2+c^2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement: an inequality for positive real numbers\n\nThe source problem asks to prove, for all positive reals `a`, `b`, and `c`,\nthe inequality\n\n`a^2 / (b + c) + b^2 / (c + a) + c^2 / (a + b)\n ≥ (3 / 2) * ((a^3 + b^3 + c^3) / (a^2 + b^2 + c^2))`.\n\nThis file records only the proposition to be established; it contains no proof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a ^ 2 / (b + c) + b ^ 2 / (c + a) + c ^ 2 / (a + b)\n\n/-- The right-hand side of the inequality in the source problem. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (3 / 2 : ℝ) * ((a ^ 3 + b ^ 3 + c ^ 3) / (a ^ 2 + b ^ 2 + c ^ 2))\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the stated left-hand side is at\nleast the stated right-hand side. All three quantities are real numbers, all\nthree positivity assumptions are strict, and the final inequality is non-strict.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend\n\nend Problem\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d4decf17-2af6-57b4-978d-8217e7a56264", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2308c824d07f431d273a3fdbc91372062db889a912a14231af8693066a124a93", "task_path": "tasks/nmp3_d4decf17-2af6-57b4-978d-8217e7a56264", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d4decf17-2af6-57b4-978d-8217e7a56264", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d5050edd-0644-5b4d-a450-484cc81bb3f4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 2023$ be an integer. Prove that there exists a permutation $(p_1,p_2,\\dots,p_n)$ of the numbers $1,2,\\dots,n$ such that \n-- \\[\n-- p_1+2p_2+3p_3+\\dots+np_n\n-- \\]\n-- is divisible by $n$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The weighted sum `p_1 + 2 * p_2 + ... + n * p_n`, where a permutation\n`p` of `Fin n` encodes `(p_1, ..., p_n)` by having `p ⟨i, _⟩` represent\n`p_{i+1}`. Both the positions and the values are shifted from `Fin n` to\nthe set `{1, ..., n}`. -/\ndef weightedSum (n : ℕ) (p : Equiv.Perm (Fin n)) : ℕ :=\n ∑ i : Fin n, (i.val + 1) * ((p i).val + 1)\n\n/-- A permutation of `1, ..., n`, encoded as a permutation of `Fin n`, is\nadmissible when its weighted sum is divisible by `n`. -/\ndef IsAdmissiblePermutation (n : ℕ) (p : Equiv.Perm (Fin n)) : Prop :=\n n ∣ weightedSum n p\n\n/-- For every integer `n ≥ 2023`, there is a permutation `(p_1, ..., p_n)` of\n`1, ..., n` whose weighted sum `p_1 + 2 p_2 + ... + n p_n` is divisible by `n`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 2023 ≤ n → ∃ p : Equiv.Perm (Fin n), IsAdmissiblePermutation n p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d5050edd-0644-5b4d-a450-484cc81bb3f4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "beb0ed485a6e9aef02ba32c66dd3605dc9079d14e53d4292b70f91e837cd05da", "task_path": "tasks/nmp3_d5050edd-0644-5b4d-a450-484cc81bb3f4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d5050edd-0644-5b4d-a450-484cc81bb3f4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d5185506-f2b9-5500-bd87-a939e4d6e671", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P(x)=x^{2004}-x^{2002}+3$. Prove that for all positive real numbers $a,b,c$,\n-- $$P(a)P(b)P(c)\\ge 9(ab+bc+ca).$$\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the inequality involving `x ^ 2004 - x ^ 2002 + 3`\n\nThis file records the statement of the source problem, not a proof of it.\n-/\n\nnamespace Problem\n\n/-- The polynomial appearing in the problem, evaluated at a real number. -/\ndef P (x : ℝ) : ℝ := x ^ 2004 - x ^ 2002 + 3\n\n/-- For all positive real numbers `a`, `b`, and `c`, the product\n`P a * P b * P c` is at least `9 * (a * b + b * c + c * a)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n P a * P b * P c ≥ 9 * (a * b + b * c + c * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d5185506-f2b9-5500-bd87-a939e4d6e671", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8d61a428042ac395fe39200b67d60f2863407d4d665147fb183c191c71c36b46", "task_path": "tasks/nmp3_d5185506-f2b9-5500-bd87-a939e4d6e671", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d5185506-f2b9-5500-bd87-a939e4d6e671", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d5476a96-5285-5d06-9e07-03cbc9321b79", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Assume that the polynomial $(x+1)^n-1$ is divisible by a monic polynomial $P(x)=x^{k}+c_{k-1}x^{k-1}+c_{k-2}x^{k-2}+\\dots +c_{1}x+c_{0}$, where $k$ is an even positive integer and all coefficients $c_{k-1},c_{k-2},\\dots ,c_{1},c_{0}$ are odd integers. Prove that $k+1$ divides $n$.\nimport Mathlib\n\n/-!\n# Formal statement of the polynomial divisibility problem\n\nThe source problem considers an integer polynomial\n`P(x) = x^k + c_{k-1} x^{k-1} + ... + c_1 x + c_0` of even positive\ndegree `k`, all of whose lower coefficients are odd. If `P` divides\n`(x + 1)^n - 1`, then `k + 1` divides `n`.\n\nWe formalize polynomial divisibility in `ℤ[X]`, the natural ring for a\nmonic polynomial with integer coefficients. The proposition itself is\nstated without a proof, as required.\n-/\n\nnamespace Problem\n\nopen Polynomial\n\n/--\n`IsMonicOddDegreePolynomial k P` says that `P` is exactly a monic polynomial\nof degree `k` over the integers whose coefficients in degrees `0, ..., k-1`\nare all odd.\n\nWhen `P` is written as\n`P(X) = X^k + c_{k-1}X^{k-1} + ... + c_1X + c_0`,\nthe coefficients `c_i` are represented by `P.coeff i` for `i < k`.\nThe monicity and degree condition `P.Monic ∧ P.natDegree = k` supplies the\nleading coefficient `1` and excludes any terms above degree `k`.\n-/\ndef IsMonicOddDegreePolynomial (k : ℕ) (P : Polynomial ℤ) : Prop :=\n P.Monic ∧ P.natDegree = k ∧ ∀ i : ℕ, i < k → Odd (P.coeff i)\n\n/--\n`Admissible n k P` collects all hypotheses of the problem:\n`k` is a positive even natural number, `P` is a monic integer polynomial of\ndegree `k` with all lower coefficients odd, and `P` divides\n`(X + 1)^n - 1` in `ℤ[X]`.\n-/\ndef Admissible (n k : ℕ) (P : Polynomial ℤ) : Prop :=\n 0 < k ∧\n Even k ∧\n IsMonicOddDegreePolynomial k P ∧\n P ∣ (((Polynomial.X + 1 : Polynomial ℤ) ^ n) - 1)\n\n/--\nThe formal target: for every natural exponent `n` (including `n = 0`, since\nthe source states no positivity condition on `n`), every positive even degree\n`k`, and every admissible monic integer polynomial `P` of degree `k`, the\nconclusion `k + 1 ∣ n` holds.\n-/\ndef Target : Prop :=\n ∀ (n k : ℕ) (P : Polynomial ℤ),\n Admissible n k P → (k + 1 : ℕ) ∣ n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d5476a96-5285-5d06-9e07-03cbc9321b79", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6d749976334b5c12e4d7e9e270ce39d39eef486c9b4b1a318409924a0a7c71fe", "task_path": "tasks/nmp3_d5476a96-5285-5d06-9e07-03cbc9321b79", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d5476a96-5285-5d06-9e07-03cbc9321b79", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d579379c-3d10-5e78-b581-76a6d94cc8d5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a+2b}{a+2c}+\\frac{b+2c}{b+2a}+\\frac{c+2a}{c+2b}\\ge \\sqrt{\\frac{5\\,(a^2+b^2+c^2)}{ab+bc+ca}+4}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove an inequality for three positive real numbers.\nThe declarations below introduce the two sides of the inequality and state the\nuniversally quantified proposition. No proof is supplied at this stage.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a + (2 : ℝ) * b) / (a + (2 : ℝ) * c) +\n (b + (2 : ℝ) * c) / (b + (2 : ℝ) * a) +\n (c + (2 : ℝ) * a) / (c + (2 : ℝ) * b)\n\n/-- The radicand on the right-hand side of the target inequality. -/\nnoncomputable def radicand (a b c : ℝ) : ℝ :=\n (5 : ℝ) * (a ^ 2 + b ^ 2 + c ^ 2) /\n (a * b + b * c + c * a) + 4\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n Real.sqrt (radicand a b c)\n\n/-- For all positive real numbers `a`, `b`, and `c`, the sum of the three\nfractions is at least the square root on the right-hand side of the source\nproblem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d579379c-3d10-5e78-b581-76a6d94cc8d5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d3df085bff7e92569be18a9a6361e3bc35fc85d3449e97cc55bd1fbe7263a183", "task_path": "tasks/nmp3_d579379c-3d10-5e78-b581-76a6d94cc8d5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d579379c-3d10-5e78-b581-76a6d94cc8d5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d57a2b49-95e1-5929-b9b9-8bc8551bc14b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be real numbers such that $a^{2}+b^{2}+c^{2}+d^{2}=1$. Prove that \n-- \\[\n-- \\frac{1}{1-ab}+\\frac{1}{1-ac}+\\frac{1}{1-ad}+\\frac{1}{1-bc}+\\frac{1}{1-bd}+\\frac{1}{1-cd}\\le 8\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nLet `a b c d` be real numbers satisfying `a^2 + b^2 + c^2 + d^2 = 1`.\nThe problem asks to prove that the sum of the six reciprocals\n`1 / (1 - x*y)`, over the unordered pairs among `a,b,c,d`, is at most `8`.\n-/\n\nnamespace Problem\n\n/-- The constraint that the four real numbers lie on the unit three-sphere. -/\ndef Constraint (a b c d : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = 1\n\n/-- The six-term sum appearing in the left-hand side of the inequality.\n\nThe terms are written in the same order as in the problem statement. Under\n`Problem.Constraint`, every denominator is nonzero (indeed positive), so the\nuse of Lean's total real division exactly represents the displayed rational\nexpression on its intended domain. -/\nnoncomputable def LeftHandSide (a b c d : ℝ) : ℝ :=\n 1 / (1 - a * b) +\n 1 / (1 - a * c) +\n 1 / (1 - a * d) +\n 1 / (1 - b * c) +\n 1 / (1 - b * d) +\n 1 / (1 - c * d)\n\n/-- The full proposition to be proved: for all real `a,b,c,d` satisfying\n`a^2 + b^2 + c^2 + d^2 = 1`, the six-term sum is at most `8`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Constraint a b c d → LeftHandSide a b c d ≤ 8\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d57a2b49-95e1-5929-b9b9-8bc8551bc14b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dcaa249486a428ee0474ebd14f39f74c556831e9131c8ee68c6f835f86b49633", "task_path": "tasks/nmp3_d57a2b49-95e1-5929-b9b9-8bc8551bc14b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d57a2b49-95e1-5929-b9b9-8bc8551bc14b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d5a5253d-f3e7-5568-9ea4-1e0acad7dc9f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a convex quadrilateral with $O=AC\\cap BD$ (the intersection of its diagonals). Suppose that \n-- $$AB+CD=AD+BC,$$ \n-- the triangles $AOB$ and $COD$ have the same perimeter, and the triangles $BOC$ and $AOD$ have the same perimeter. Prove that $ABCD$ is a rhombus (i.e., $AB=BC=CD=DA$).\nmodule\n\npublic import Mathlib.Analysis.Convex.Segment\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Geometry.Euclidean.Basic\n\n@[expose] public section\n\n/-!\n# Formal statement of the quadrilateral problem\n\nThe ambient Euclidean plane is represented by `EuclideanSpace ℝ (Fin 2)`.\nAll distances are the usual Euclidean distances supplied by the norm on\nthis space, and `segment` denotes a closed line segment.\n\nThe source problem has one assertion to prove. `Problem.Target` is the\ncorresponding proposition. No proof of it is supplied here.\n-/\n\nnoncomputable section\n\nopen Set\nopen scoped Convex\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the formalization. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The oriented area (two-dimensional determinant) of two vectors. -/\ndef cross2 (u v : Point) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- The signed area of the triangle `XYZ`, up to a factor of two. -/\ndef turn (X Y Z : Point) : ℝ := cross2 (Y - X) (Z - X)\n\n/-- The four vertices `A`, `B`, `C`, `D` are pairwise distinct. -/\ndef PairwiseDistinct (A B C D : Point) : Prop :=\n A ≠ B ∧ A ≠ C ∧ A ≠ D ∧ B ≠ C ∧ B ≠ D ∧ C ≠ D\n\n/--\n`A`, `B`, `C`, `D` are the vertices, in cyclic order, of a nondegenerate\nconvex quadrilateral. Either the counterclockwise or the clockwise\norientation is allowed.\n\nFor a nondegenerate quadrilateral, having all four signed turns strictly\nnonzero and of the same sign is equivalent to being simple and strictly\nconvex with the vertices in the stated cyclic order.\n-/\ndef ConvexQuadrilateral (A B C D : Point) : Prop :=\n PairwiseDistinct A B C D ∧\n ((turn A B C > 0 ∧ turn B C D > 0 ∧ turn C D A > 0 ∧ turn D A B > 0) ∨\n (turn A B C < 0 ∧ turn B C D < 0 ∧ turn C D A < 0 ∧ turn D A B < 0))\n\n/--\n`O` is the intersection of the closed diagonal segments `AC` and `BD`:\nthe intersection set is exactly the singleton `{O}`.\n-/\ndef IsDiagonalIntersection (A B C D O : Point) : Prop :=\n (segment ℝ A C ∩ segment ℝ B D : Set Point) = {O}\n\n/-- The perimeter of the triangle with vertices `X`, `Y`, `Z`. -/\ndef TrianglePerimeter (X Y Z : Point) : ℝ :=\n dist X Y + dist Y Z + dist Z X\n\n/-- The side-length condition `AB + CD = AD + BC`. -/\ndef SideLengthSumCondition (A B C D : Point) : Prop :=\n dist A B + dist C D = dist A D + dist B C\n\n/-- The first pair of triangles has equal perimeter. -/\ndef FirstTrianglePerimeterCondition (A B C D O : Point) : Prop :=\n TrianglePerimeter A O B = TrianglePerimeter C O D\n\n/-- The second pair of triangles has equal perimeter. -/\ndef SecondTrianglePerimeterCondition (A B C D O : Point) : Prop :=\n TrianglePerimeter B O C = TrianglePerimeter A O D\n\n/-- All hypotheses of the source problem, in the order in which they occur. -/\ndef Assumptions (A B C D O : Point) : Prop :=\n ConvexQuadrilateral A B C D ∧\n IsDiagonalIntersection A B C D O ∧\n SideLengthSumCondition A B C D ∧\n FirstTrianglePerimeterCondition A B C D O ∧\n SecondTrianglePerimeterCondition A B C D O\n\n/-- `A`, `B`, `C`, `D` form a rhombus when the four consecutive side lengths\nare equal: `AB = BC = CD = DA`. -/\ndef IsRhombus (A B C D : Point) : Prop :=\n dist A B = dist B C ∧ dist B C = dist C D ∧ dist C D = dist D A\n\n/--\nThe complete assertion of the problem: for every convex quadrilateral whose\ndiagonals meet at `O`, if `AB + CD = AD + BC` and the two stated pairs of\ntriangles have equal perimeters, then the same quadrilateral is a rhombus.\n-/\ndef Target : Prop :=\n ∀ A B C D O : Point,\n ConvexQuadrilateral A B C D →\n IsDiagonalIntersection A B C D O →\n SideLengthSumCondition A B C D →\n FirstTrianglePerimeterCondition A B C D O →\n SecondTrianglePerimeterCondition A B C D O →\n IsRhombus A B C D\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d5a5253d-f3e7-5568-9ea4-1e0acad7dc9f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "727b5d0a46a383416b008648c0c4931af23d44e4ba21fafc7e19484d789ea6e4", "task_path": "tasks/nmp3_d5a5253d-f3e7-5568-9ea4-1e0acad7dc9f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d5a5253d-f3e7-5568-9ea4-1e0acad7dc9f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d5cccf77-4bef-5dc5-9ba0-3c7a36a18903", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for each integer $n\\ge 2$ there exists a set $S$ of $n$ integers such that for every distinct $a,b\\in S$ we have $(a-b)^2\\mid ab$.\nimport Mathlib\n\n/-!\n# Formalization of the integer-set divisibility problem\n\nThe source problem asks: for every integer `n ≥ 2`, there is a set `S` of\n`n` integers such that, for every pair of distinct elements `a, b ∈ S`, the\nsquare of their difference divides their product.\n\nA `Finset ℤ` is used for a finite set of integers, and its cardinality is\ncompared with the integer `n` after coercion to `ℤ`.\n-/\n\nnamespace Problem\n\n/-- The pairwise divisibility condition on a finite set of integers. -/\ndef PairwiseDivisible (S : Finset ℤ) : Prop :=\n ∀ a ∈ S, ∀ b ∈ S, a ≠ b → (a - b) ^ 2 ∣ a * b\n\n/-- `S` is a set of `n` integers satisfying the problem's pairwise condition. -/\ndef IsSolution (n : ℤ) (S : Finset ℤ) : Prop :=\n (S.card : ℤ) = n ∧ PairwiseDivisible S\n\n/-- The full assertion: for every integer `n ≥ 2`, there exists a finite set\nof `n` integers in which every two distinct elements satisfy the stated\ndivisibility relation. -/\ndef Target : Prop :=\n ∀ n : ℤ, 2 ≤ n → ∃ S : Finset ℤ, IsSolution n S\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d5cccf77-4bef-5dc5-9ba0-3c7a36a18903", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b51cbe198a8ba9df98dd10fa344e82bb9f00f08f844c1bbdd5d1108c309c6369", "task_path": "tasks/nmp3_d5cccf77-4bef-5dc5-9ba0-3c7a36a18903", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d5cccf77-4bef-5dc5-9ba0-3c7a36a18903", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d5f9df4b-ca0e-5d06-9f35-22798e048215", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Fix a prime number $p>5$. Let $a,b,c$ be integers such that no two of $a,b,c$ differ by a multiple of $p$ (i.e. $a,b,c$ are distinct modulo $p$). Let $i,j,k$ be non‑negative integers satisfying $i+j+k\\equiv0\\pmod{p-1}$. Suppose that for every integer $x$ the integer \n-- \\[\n-- (x-a)(x-b)(x-c)\\Big[(x-a)^i(x-b)^j(x-c)^k-1\\Big]\n-- \\] \n-- is divisible by $p$. Prove that $p-1$ divides each of $i$, $j$, and $k$.\nimport Mathlib\n\n/-!\n# Formalization of the stated number-theory problem\n\nThe problem fixes a prime `p > 5`, integers `a`, `b`, `c` whose residues\nmodulo `p` are pairwise distinct, and natural numbers `i`, `j`, `k` with\n`i + j + k ≡ 0 (mod p - 1)`. Under the assumption that a certain integer\npolynomial expression is divisible by `p` for every integer `x`, the\nconclusion is that `p - 1` divides each of `i`, `j`, and `k`.\n\nThis file records the statement as a proposition. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The three residues `a`, `b`, `c` are pairwise distinct modulo `p`.\nEquivalently, no pairwise difference is divisible by `p`.\n\nThe formulation uses integer divisibility, which is equivalent to equality\nof residues in `ZMod p` because `p ≠ 0` follows from `p.Prime`. -/\ndef PairwiseDistinctMod (p : ℕ) (a b c : ℤ) : Prop :=\n ¬ ((p : ℤ) ∣ a - b) ∧\n ¬ ((p : ℤ) ∣ b - c) ∧\n ¬ ((p : ℤ) ∣ a - c)\n\n/-- The divisibility hypothesis on the polynomial expression.\n\nFor every integer `x`, the integer\n`(x-a)(x-b)(x-c) * ((x-a)^i * (x-b)^j * (x-c)^k - 1)`\nis divisible by `p`. -/\ndef PolynomialDivisibilityCondition\n (p : ℕ) (a b c : ℤ) (i j k : ℕ) : Prop :=\n ∀ x : ℤ,\n (p : ℤ) ∣\n (x - a) * (x - b) * (x - c) *\n ((x - a) ^ i * (x - b) ^ j * (x - c) ^ k - 1)\n\n/-- All hypotheses of the problem, bundled together.\n\nThe exponents `i`, `j`, `k` are natural numbers, corresponding to the\nproblem's non-negative integers. The congruence\n`i + j + k ≡ 0 (mod p - 1)` is expressed as divisibility of the natural\nnumber `i + j + k` by the natural number `p - 1`. -/\ndef Admissible (p : ℕ) (a b c : ℤ) (i j k : ℕ) : Prop :=\n p.Prime ∧\n 5 < p ∧\n PairwiseDistinctMod p a b c ∧\n (p - 1) ∣ i + j + k ∧\n PolynomialDivisibilityCondition p a b c i j k\n\n/-- The conclusion that `p - 1` divides each of the three exponents. -/\ndef Conclusion (p : ℕ) (i j k : ℕ) : Prop :=\n (p - 1) ∣ i ∧ (p - 1) ∣ j ∧ (p - 1) ∣ k\n\n/-- The complete proposition to be proved: for every prime `p > 5`, every\ninteger triple `a`, `b`, `c` with pairwise distinct residues modulo `p`,\nand every triple of natural numbers `i`, `j`, `k` satisfying the stated\ncongruence and polynomial divisibility condition, `p - 1` divides each of\n`i`, `j`, and `k`. -/\ndef Target : Prop :=\n ∀ (p : ℕ) (a b c : ℤ) (i j k : ℕ),\n Admissible p a b c i j k → Conclusion p i j k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d5f9df4b-ca0e-5d06-9f35-22798e048215", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "21bf2e64001a28598e30280c47604a2dcc0dc685e25de1e755e329b03efa1faa", "task_path": "tasks/nmp3_d5f9df4b-ca0e-5d06-9f35-22798e048215", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d5f9df4b-ca0e-5d06-9f35-22798e048215", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d63140dc-e5bf-55f2-958b-1c14b82972cc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a>b>c>d$ be positive integers and suppose that \n-- \\[\n-- ac+bd=(b+d+a-c)(b+d-a+c).\n-- \\] \n-- Prove that $ab+cd$ is not a prime number.\nimport Mathlib\n\n/-!\n# Formalization of the problem statement\n\nLet `a > b > c > d` be positive integers satisfying\n`a * c + b * d = (b + d + a - c) * (b + d - a + c)`.\nThe problem asks to prove that `a * b + c * d` is not prime.\n\nThe variables are natural numbers, while the displayed identity is evaluated in the\nintegers. This distinction matters because the factor `b + d - a + c` need not be\nnonnegative, so representing subtraction by truncated natural-number subtraction would\nnot express the given equation.\n-/\n\nnamespace Problem\n\n/-- The positivity and strict ordering assumptions on the four positive integers. -/\ndef PositiveOrdered (a b c d : ℕ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧\n d < c ∧ c < b ∧ b < a\n\n/-- The displayed identity, interpreted in the integers so that subtraction is exact. -/\ndef ACPlusBD_eq (a b c d : ℕ) : Prop :=\n (a : ℤ) * (c : ℤ) + (b : ℤ) * (d : ℤ) =\n ((b : ℤ) + (d : ℤ) + (a : ℤ) - (c : ℤ)) *\n ((b : ℤ) + (d : ℤ) - (a : ℤ) + (c : ℤ))\n\n/-- The complete hypothesis of the problem: positive integers in the given strict order\nsatisfying the displayed identity. -/\ndef Admissible (a b c d : ℕ) : Prop :=\n PositiveOrdered a b c d ∧ ACPlusBD_eq a b c d\n\n/-- The desired conclusion for fixed `a, b, c, d`: `a * b + c * d` is not prime. -/\ndef Conclusion (a b c d : ℕ) : Prop :=\n ¬ Nat.Prime (a * b + c * d)\n\n/-- The formal target of the problem, with all quantifiers and assumptions explicit. -/\ndef Target : Prop :=\n ∀ a b c d : ℕ, Admissible a b c d → Conclusion a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d63140dc-e5bf-55f2-958b-1c14b82972cc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "25e1be7f0d054fb0fd51131395f759a7524b9dbf0b2efa0e581746fdf285189a", "task_path": "tasks/nmp3_d63140dc-e5bf-55f2-958b-1c14b82972cc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d63140dc-e5bf-55f2-958b-1c14b82972cc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d64297f5-ccb3-5138-84c9-0bf07d45349a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If \\(a,b,c,d\\) are real numbers such that \\(a+b+c+d=4\\), prove that \n-- \\[\n-- \\frac1{4-3a+3a^{2}}+\\frac1{4-3b+3b^{2}}+\\frac1{4-3c+3c^{2}}+\\frac1{4-3d+3d^{2}}\\le 1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the four-variable reciprocal inequality\n\nThe source problem asks one to prove, for real numbers `a`, `b`, `c`, and `d`\nsatisfying `a + b + c + d = 4`, that the sum of the four displayed reciprocal\nterms is at most `1`.\n-/\n\nnamespace Problem\n\n/--\nThe proposition asserted by the problem: for all real numbers `a`, `b`, `c`,\nand `d` whose sum is `4`, the sum of the four reciprocal expressions is at most\n`1`. In Lean, division by zero is total, but the denominators here are in fact\npositive for every real input; no extra nonzero-denominator assumption is added\nbecause the source problem states none.\n-/\ndef Target : Prop :=\n ∀ a b c d : ℝ, a + b + c + d = 4 →\n (1 / (4 - 3 * a + 3 * a ^ 2) +\n 1 / (4 - 3 * b + 3 * b ^ 2) +\n 1 / (4 - 3 * c + 3 * c ^ 2) +\n 1 / (4 - 3 * d + 3 * d ^ 2)) ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d64297f5-ccb3-5138-84c9-0bf07d45349a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e7bb9c288d796f67a3bac9949397aa74fbab08dffa51a4227ca8360761d976b9", "task_path": "tasks/nmp3_d64297f5-ccb3-5138-84c9-0bf07d45349a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d64297f5-ccb3-5138-84c9-0bf07d45349a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d651c515-4812-5e24-a1c4-3419f70159a7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P\\in\\mathbb Z[x]$ be a non‑constant polynomial with $P(0)\\neq0$. Prove that there are infinitely many distinct primes $p$ such that $p\\mid P(2^n)$ for at least one positive integer $n$.\nimport Mathlib\n\n/-!\n# Formalization of a theorem on prime divisors of integer polynomials at powers of two\n\nThe source problem asks to prove that, for every nonconstant integer polynomial\n`P` with `P(0) ≠ 0`, infinitely many primes `p` divide `P(2^n)` for some\npositive integer `n`.\n-/\n\nnamespace Problem\n\n/-- An integer polynomial is nonconstant if its natural degree is nonzero.\nFor the zero polynomial this is false, as expected for a constant polynomial. -/\ndef NonconstantIntegerPolynomial (P : Polynomial ℤ) : Prop :=\n P.natDegree ≠ 0\n\n/-- A natural number `p` is a prime divisor of some value `P(2^n)` with\n`n` a positive integer. Divisibility is the usual divisibility relation in\nthe integers, after embedding the prime `p` into `ℤ`. -/\ndef PrimeDividesSomePositivePowerValue (P : Polynomial ℤ) (p : ℕ) : Prop :=\n Nat.Prime p ∧ ∃ n : ℕ, 0 < n ∧ (p : ℤ) ∣ P.eval ((2 : ℤ) ^ n)\n\n/-- The target assertion: for every nonconstant polynomial `P : ℤ[x]` with\nnonzero constant coefficient, the set of primes dividing at least one value\n`P(2^n)` at a positive exponent `n` is infinite. -/\ndef Target : Prop :=\n ∀ P : Polynomial ℤ,\n NonconstantIntegerPolynomial P →\n P.eval (0 : ℤ) ≠ 0 →\n Set.Infinite {p : ℕ | PrimeDividesSomePositivePowerValue P p}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d651c515-4812-5e24-a1c4-3419f70159a7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "153b8740589c1f86b0a0b5a37a8aa2048d6925583ddb01ca72ddf0e758537790", "task_path": "tasks/nmp3_d651c515-4812-5e24-a1c4-3419f70159a7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d651c515-4812-5e24-a1c4-3419f70159a7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d66140ac-b95f-5c7c-b731-da01ce1fda2f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x$, $y$, $z$ be non‑negative real numbers such that $x+y+z=3$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\sqrt{\\frac{x}{1+2yz}}\\;\\ge\\;\\sqrt{3}\\,.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\nnamespace Problem\n\n/-- The admissibility condition for the variables in the problem:\n`x`, `y`, and `z` are nonnegative real numbers whose sum is `3`. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z ∧ x + y + z = (3 : ℝ)\n\n/-- One cyclic summand `sqrt (x / (1 + 2*y*z))`. -/\nnoncomputable def cycTerm (x y z : ℝ) : ℝ :=\n Real.sqrt (x / (1 + 2 * y * z))\n\n/-- The cyclic sum\n`sqrt (x / (1 + 2*y*z)) + sqrt (y / (1 + 2*z*x)) + sqrt (z / (1 + 2*x*y))`. -/\nnoncomputable def cycSum (x y z : ℝ) : ℝ :=\n cycTerm x y z + cycTerm y z x + cycTerm z x y\n\n/-- The proposition asserted by the problem: for every triple of nonnegative\nreal numbers with sum `3`, the cyclic sum is at least `sqrt 3`. -/\nnoncomputable def Target : Prop :=\n ∀ x y z : ℝ, Admissible x y z → cycSum x y z ≥ Real.sqrt (3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d66140ac-b95f-5c7c-b731-da01ce1fda2f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f6eaee27a5057dbdfadf1b81ab8cfffe74b6bdfa291e0470b0b59005245fdecd", "task_path": "tasks/nmp3_d66140ac-b95f-5c7c-b731-da01ce1fda2f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d66140ac-b95f-5c7c-b731-da01ce1fda2f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d669f854-fedd-53b6-9f55-aafc5b5aaf12", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a, x, b, y, c, z$ be real numbers such that $a > x \\ge 0$, $b > y \\ge 0$, and $c > z \\ge 0$. Prove that \n-- \\[\n-- \\Big((a+b+c)^3-(x+y+z)^3\\Big)\\left(\\frac1{a^3-x^3}+\\frac1{b^3-y^3}+\\frac1{c^3-z^3}\\right)\\ge 81.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the six-variable real inequality\n\nThe source problem asks to prove an inequality for real numbers\n`a, x, b, y, c, z` satisfying the three chained inequalities\n`a > x ≥ 0`, `b > y ≥ 0`, and `c > z ≥ 0`.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef LHS (a x b y c z : ℝ) : ℝ :=\n ((a + b + c) ^ 3 - (x + y + z) ^ 3) *\n (1 / (a ^ 3 - x ^ 3) +\n 1 / (b ^ 3 - y ^ 3) +\n 1 / (c ^ 3 - z ^ 3))\n\n/-- One chained condition `u > v ≥ 0`, expanded into a conjunction. -/\ndef PairAdmissible (u v : ℝ) : Prop :=\n u > v ∧ v ≥ 0\n\n/-- The three hypotheses `a > x ≥ 0`, `b > y ≥ 0`, and `c > z ≥ 0`. -/\ndef Admissible (a x b y c z : ℝ) : Prop :=\n PairAdmissible a x ∧ PairAdmissible b y ∧ PairAdmissible c z\n\n/-- The inequality conclusion of the source problem. -/\ndef Claim (a x b y c z : ℝ) : Prop :=\n LHS a x b y c z ≥ 81\n\n/--\nThe assertion to be proved: for all real numbers `a, x, b, y, c, z`\nsatisfying `a > x ≥ 0`, `b > y ≥ 0`, and `c > z ≥ 0`, the stated product\nis at least `81`.\n-/\ndef Target : Prop :=\n ∀ a x b y c z : ℝ,\n Admissible a x b y c z →\n Claim a x b y c z\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d669f854-fedd-53b6-9f55-aafc5b5aaf12", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b35435570a74fd19bc498450d530a41fd83c5deb6bfed8f125ffdb08353591af", "task_path": "tasks/nmp3_d669f854-fedd-53b6-9f55-aafc5b5aaf12", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d669f854-fedd-53b6-9f55-aafc5b5aaf12", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d67075be-4fc2-557b-ba9c-b00cdfcfdee0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb R\\to\\mathbb R$ such that for all real numbers $x$ and $y$\n-- \\[\n-- f(xy-1)+f(x)f(y)=2xy-1.\n-- \\]\nmodule\npublic import Mathlib.Basic.Real.Basic\n\n@[expose] public section\n\nnamespace Problem\n\n/-- A real-valued function `f` is admissible when it satisfies\n`f (x * y - 1) + f x * f y = 2 * x * y - 1` for every pair of real numbers. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x * y - 1) + f x * f y = 2 * x * y - 1\n\n/-- The candidate function `f (x) = x`. -/\ndef identitySolution : ℝ → ℝ :=\n fun x : ℝ => x\n\n/-- The candidate function `f (x) = -(x ^ 2)`. -/\ndef negativeSquareSolution : ℝ → ℝ :=\n fun x : ℝ => -(x ^ 2)\n\n/-- The proposed complete set of solutions: the identity function and the\nnegative-square function. -/\ndef proposedSolutionSet : Set (ℝ → ℝ) :=\n {f | f = identitySolution ∨ f = negativeSquareSolution}\n\n/-- A proposed set `S` is a complete answer to the \"find all\" problem when\nboth classification directions hold: every function in `S` is admissible, and\nevery admissible function belongs to `S`. -/\ndef CompleteAnswer (S : Set (ℝ → ℝ)) : Prop :=\n (∀ f : ℝ → ℝ, f ∈ S → Admissible f) ∧\n (∀ f : ℝ → ℝ, Admissible f → f ∈ S)\n\n/-- The formal target: the proposed set is exactly the collection of all\nfunctions satisfying the original functional equation. -/\ndef Target : Prop :=\n CompleteAnswer proposedSolutionSet\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d67075be-4fc2-557b-ba9c-b00cdfcfdee0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1f92934c6ab87cbcbdbd5cdc46d333580be8e8ef77b29b9b9e4fa7af28ebaad1", "task_path": "tasks/nmp3_d67075be-4fc2-557b-ba9c-b00cdfcfdee0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d67075be-4fc2-557b-ba9c-b00cdfcfdee0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d718c894-7f7d-5ec5-ac48-b627552deae3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{a^{2}+a+1}+\\frac{1}{b^{2}+b+1}+\\frac{1}{c^{2}+c+1}\\ge 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\n For all positive real numbers `a`, `b`, and `c` with `a * b * c = 1`,\n the sum of the three displayed reciprocal quadratic terms is at least `1`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n 1 / (a ^ 2 + a + 1) + 1 / (b ^ 2 + b + 1) + 1 / (c ^ 2 + c + 1) ≥ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d718c894-7f7d-5ec5-ac48-b627552deae3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "512a2ff3d9d8e4c3ab8caae218bd9eb36baa45232e36c85928cb998f24606bf3", "task_path": "tasks/nmp3_d718c894-7f7d-5ec5-ac48-b627552deae3", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d718c894-7f7d-5ec5-ac48-b627552deae3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d72b813a-7406-5bf3-b9ca-07dabec627f9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m,n$ be positive integers with $m\\ge n\\ge2022$. Let $a_1,\\dots,a_n$ and $b_1,\\dots,b_n$ be real numbers. Prove that the number of ordered pairs $(i,j)$ with $1\\le i,j\\le n$ satisfying \n-- \\[\n-- \\bigl|a_i+b_j-ij\\bigr|\\le m\n-- \\]\n-- does not exceed $3\\,n\\sqrt{\\,m\\log n\\,}\\,$ (where $\\log$ denotes the natural logarithm).\nimport Mathlib\n\n/-!\n# Formal statement for the ordered-pair counting problem\n\nThe source problem asks for a proof of an upper bound on the number of ordered\npairs `(i, j)` in `{1, ..., n}²` satisfying an absolute-value inequality.\n\nWe model the finite families `a_1, ..., a_n` and `b_1, ..., b_n` as functions\n`Fin n → ℝ`. The index `i` in the source is represented by `i.val + 1`.\n-/\n\nnamespace Problem\n\n/-- An ordered pair of indices from `{1, ..., n} × {1, ..., n}`, represented\nby a pair of elements of `Fin n`. -/\nabbrev IndexPair (n : ℕ) : Type := Fin n × Fin n\n\n/-- The inequality defining a qualifying ordered pair from the problem.\n\nIf `p = (i, j)` with `i, j : Fin n`, then `p.1.val + 1` and `p.2.val + 1`\nare precisely the corresponding source indices in `{1, ..., n}`. -/\ndef AdmissiblePair (m : ℕ) {n : ℕ} (a b : Fin n → ℝ) (p : IndexPair n) : Prop :=\n |a p.1 + b p.2 - ((p.1.val : ℝ) + 1) * ((p.2.val : ℝ) + 1)| ≤ (m : ℝ)\n\n/-- The number of ordered pairs `(i, j)` with `1 ≤ i, j ≤ n` that satisfy the\nabsolute-value inequality. This is the cardinality of the filtered finite type\nof ordered index pairs. -/\nnoncomputable def qualifyingPairCount (m : ℕ) {n : ℕ} (a b : Fin n → ℝ) : ℕ := by\n classical\n exact ((Finset.univ : Finset (IndexPair n)).filter (AdmissiblePair m a b)).card\n\n/-- The complete assertion of the problem: for every positive integers `m, n`\nwith `m ≥ n ≥ 2022`, and every two real families `a` and `b` indexed by\n`{1, ..., n}`, the number of qualifying ordered pairs is at most\n`3 n sqrt (m log n)`, where `log` is the natural logarithm. -/\ndef Target : Prop :=\n ∀ (m n : ℕ),\n 0 < m →\n 0 < n →\n n ≤ m →\n 2022 ≤ n →\n ∀ a b : Fin n → ℝ,\n (qualifyingPairCount m a b : ℝ) ≤\n (3 : ℝ) * (n : ℝ) * Real.sqrt ((m : ℝ) * Real.log (n : ℝ))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d72b813a-7406-5bf3-b9ca-07dabec627f9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1db6cd396f450cf0a8980a3792cd6ae31d09df974f6ef0d4222fc897efc6b6d4", "task_path": "tasks/nmp3_d72b813a-7406-5bf3-b9ca-07dabec627f9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d72b813a-7406-5bf3-b9ca-07dabec627f9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d732b87f-a1fd-5465-8985-ad5464dc927a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>3$ be an integer and let $x_1,x_2,\\dots,x_n$ be positive real numbers such that $\\displaystyle\\prod_{i=1}^n x_i=1$. Prove that \n-- \\[\n-- \\frac{1}{1+x_1+x_1x_2}+\\frac{1}{1+x_2+x_2x_3}+\\cdots+\\frac{1}{1+x_n+x_nx_1}>1,\n-- \\] \n-- where the indices are taken cyclically ($x_{n+1}=x_1$).\nimport Mathlib\n\n/-!\n# Formalization of a cyclic product inequality\n\nThis file states the assertion from the problem: for every integer `n > 3` and\nevery positive real `n`-tuple with product `1`, a certain cyclic sum is\nstrictly greater than `1`.\n-/\n\nnamespace Problem\n\n/-- The cyclic successor on `Fin n`: it sends the last index `n - 1` to `0`\nand every other index `i` to `i + 1`. -/\ndef cyclicSucc {n : ℕ} (i : Fin n) : Fin n :=\n ⟨(i.val + 1) % n, by\n have hn : 0 < n := Nat.lt_of_le_of_lt (Nat.zero_le i.val) i.isLt\n exact Nat.mod_lt (i.val + 1) hn⟩\n\n/-- The `i`-th summand of the cyclic sum in the problem. -/\nnoncomputable def summand {n : ℕ} (x : Fin n → ℝ) (i : Fin n) : ℝ :=\n (1 : ℝ) / ((1 : ℝ) + x i + x i * x (cyclicSucc i))\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def cyclicSum {n : ℕ} (x : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, summand x i\n\n/-- The full universally quantified assertion of the problem.\n\nThe order of binders mirrors the problem: first `n` is chosen with `n > 3`, then\nthe positive real tuple `x` indexed by `Fin n` is chosen subject to positivity and\nproduct one. The conclusion is the strict inequality for the cyclic sum. -/\nnoncomputable def Target : Prop :=\n ∀ (n : ℕ), 3 < n → ∀ (x : Fin n → ℝ),\n (∀ i : Fin n, 0 < x i) →\n (∏ i : Fin n, x i = (1 : ℝ)) →\n cyclicSum x > (1 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d732b87f-a1fd-5465-8985-ad5464dc927a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2968dada9d1b282e6120f88ed4b4c8bfbfd800d577a2901cbe545cdeebb75c22", "task_path": "tasks/nmp3_d732b87f-a1fd-5465-8985-ad5464dc927a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d732b87f-a1fd-5465-8985-ad5464dc927a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d73ca422-67b1-5c5d-85eb-5143166152e9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle and let $L$, $M$, $N$ be the midpoints of $BC$, $CA$, $AB$, respectively. \n-- A point $P$ inside $ABC$ satisfies \n-- \\[\n-- \\frac{PL}{BC}=\\frac{PM}{CA}=\\frac{PN}{AB}.\n-- \\] \n-- Let $D$, $E$, $F$ be the second intersections of the lines $AP$, $BP$, $CP$ with the circumcircle of $ABC$ (the points distinct from $A$, $B$, $C$). \n-- \n-- Prove that the circumcenters of the six triangles \n-- \\[\n-- \\triangle APF,\\ \\triangle APE,\\ \\triangle BPF,\\ \\triangle BPD,\\ \\triangle CPD,\\ \\triangle CPE\n-- \\]\n-- lie on a common circle.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Sphere.Basic\nimport Mathlib.Analysis.Convex.Hull\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\n/-!\n# Formalization of the geometry problem\n\nThe ambient plane is represented by `EuclideanSpace ℝ (Fin 2)`. The main\ndeclaration is `Problem.Target`; it is a proposition, not a proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `A`, `B`, `C` are the three distinct non-collinear vertices of a triangle.\nThe non-collinearity condition is expressed using Mathlib's `Collinear`. -/\ndef TriangleShape (A B C : Plane) : Prop :=\n A ≠ B ∧ A ≠ C ∧ B ≠ C ∧ ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- The point `P` lies in the strict interior of the triangle with vertices\n`A`, `B`, `C`. -/\ndef InsideTriangle (A B C P : Plane) : Prop :=\n P ∈ interior (convexHull ℝ ({A, B, C} : Set Plane))\n\n/-- `L`, `M`, `N` are respectively the midpoints of the sides `BC`, `CA`, and\n`AB`. -/\ndef AreSideMidpoints (A B C L M N : Plane) : Prop :=\n L = midpoint ℝ B C ∧ M = midpoint ℝ C A ∧ N = midpoint ℝ A B\n\n/-- The three normalized distances from `P` to the side midpoints are equal.\nAll distances are Euclidean distances in the plane and the division is real\ndivision. -/\ndef MidpointDistanceRatioCondition (A B C L M N P : Plane) : Prop :=\n dist P L / dist B C = dist P M / dist C A ∧\n dist P M / dist C A = dist P N / dist A B\n\n/-- The complete hypothesis of the problem: `ABC` is a nondegenerate triangle,\n`L`, `M`, `N` are its side midpoints, `P` is strictly inside the triangle, and\nthe three normalized distances are equal. -/\ndef AdmissibleConfiguration (A B C L M N P : Plane) : Prop :=\n TriangleShape A B C ∧\n AreSideMidpoints A B C L M N ∧\n InsideTriangle A B C P ∧\n MidpointDistanceRatioCondition A B C L M N P\n\n/-- `Z` lies on the infinite line through `X` and `Y`. -/\ndef OnLineThrough (X Y Z : Plane) : Prop :=\n ∃ t : ℝ, Z = t • (Y - X) + X\n\n/-- `X` lies on the circumcircle of triangle `ABC`. The circumcircle is\nrepresented as the locus of points equidistant from a common center `O` that\nis also equidistant from `A`, `B`, and `C`. -/\ndef OnCircumcircle (A B C X : Plane) : Prop :=\n ∃ O : Plane, ∃ r : ℝ,\n 0 < r ∧\n dist O A = r ∧\n dist O B = r ∧\n dist O C = r ∧\n dist O X = r\n\n/-- `Z` is the second intersection of the line through `X` and `Y` with the\ncircumcircle of `ABC`. Here `X` is the vertex of the circle on that line.\nThe final uniqueness clause expresses that this is *the* second intersection,\nnot merely some other intersection. -/\ndef IsSecondIntersection (A B C X Y Z : Plane) : Prop :=\n OnLineThrough X Y Z ∧\n OnCircumcircle A B C Z ∧\n Z ≠ X ∧\n ∀ W : Plane,\n OnLineThrough X Y W → OnCircumcircle A B C W → W = X ∨ W = Z\n\n/-- `O` is the circumcenter of the triangle with vertices `X`, `Y`, and `Z`.\nThe uniqueness clause records that a circumcenter is the unique point\nequidistant from all three vertices. -/\ndef IsCircumcenter (X Y Z O : Plane) : Prop :=\n dist O X = dist O Y ∧\n dist O X = dist O Z ∧\n ∀ O' : Plane,\n dist O' X = dist O' Y → dist O' X = dist O' Z → O' = O\n\n/-- A set of points in the plane lies on one nondegenerate circle. -/\ndef OnCommonCircle (S : Set Plane) : Prop :=\n ∃ O : Plane, ∃ r : ℝ, 0 < r ∧ ∀ X : Plane, X ∈ S → dist O X = r\n\n/-- The formal target of the problem: for every nondegenerate triangle `ABC`,\nevery strictly interior point `P` satisfying the three normalized midpoint\ndistance equalities, and every choice of the second intersections `D`, `E`, `F`\nof `AP`, `BP`, `CP` with the circumcircle, the six listed circumcenters lie on\none common circle. -/\ndef Target : Prop :=\n ∀ A B C L M N P D E F : Plane,\n AdmissibleConfiguration A B C L M N P →\n IsSecondIntersection A B C A P D →\n IsSecondIntersection A B C B P E →\n IsSecondIntersection A B C C P F →\n ∃ O₁ O₂ O₃ O₄ O₅ O₆ : Plane,\n IsCircumcenter A P F O₁ ∧\n IsCircumcenter A P E O₂ ∧\n IsCircumcenter B P F O₃ ∧\n IsCircumcenter B P D O₄ ∧\n IsCircumcenter C P D O₅ ∧\n IsCircumcenter C P E O₆ ∧\n OnCommonCircle ({O₁, O₂, O₃, O₄, O₅, O₆} : Set Plane)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d73ca422-67b1-5c5d-85eb-5143166152e9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "50d559fcd79a7cc819b4aaf6743a7c160050009aeaa9180fc9b746fdb2be2440", "task_path": "tasks/nmp3_d73ca422-67b1-5c5d-85eb-5143166152e9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d73ca422-67b1-5c5d-85eb-5143166152e9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d7c65fdb-209c-5cf4-8f22-bf0c258e6db0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\in\\mathbb N$. Prove that there are no natural numbers $x$ and $y$ such that \n-- \\[\n-- \\sqrt{n}+\\sqrt{\\,n+1\\,}\\;<\\;\\sqrt{x}+\\sqrt{y}\\;<\\;\\sqrt{4n+2}\\,. \n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the nested square-root inequality problem\n\nThe problem asks, for every natural number `n`, to prove that no pair of natural\nnumbers `x`, `y` makes the sum `sqrt x + sqrt y` lie strictly between\n`sqrt n + sqrt (n + 1)` and `sqrt (4n + 2)`.\n-/\n\nnamespace Problem\n\n/-- The lower endpoint `sqrt n + sqrt (n + 1)`, viewed as a real number. -/\nnoncomputable def lowerBound (n : ℕ) : ℝ :=\n Real.sqrt (n : ℝ) + Real.sqrt ((n : ℝ) + 1)\n\n/-- The sum `sqrt x + sqrt y`, viewed as a real number. -/\nnoncomputable def rootSum (x y : ℕ) : ℝ :=\n Real.sqrt (x : ℝ) + Real.sqrt (y : ℝ)\n\n/-- The upper endpoint `sqrt (4n + 2)`, viewed as a real number. -/\nnoncomputable def upperBound (n : ℕ) : ℝ :=\n Real.sqrt (4 * (n : ℝ) + 2)\n\n/-- The strict two-sided inequality from the problem statement. -/\ndef StrictlyBetweenBounds (n x y : ℕ) : Prop :=\n lowerBound n < rootSum x y ∧ rootSum x y < upperBound n\n\n/-- The full assertion: for every natural `n`, there do not exist natural `x`\nand `y` whose root sum lies strictly between the two displayed endpoints. -/\ndef Target : Prop :=\n ∀ n : ℕ, ¬ ∃ x y : ℕ, StrictlyBetweenBounds n x y\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d7c65fdb-209c-5cf4-8f22-bf0c258e6db0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "59b8dfbd1851636fc41bec85504a07734c2996b04cd0eea559f95bdea8cffeed", "task_path": "tasks/nmp3_d7c65fdb-209c-5cf4-8f22-bf0c258e6db0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d7c65fdb-209c-5cf4-8f22-bf0c258e6db0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d7f6fae4-3b9e-582e-b6f4-6674ecffc83e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be a prime of the form $p=4k+1$. Prove that there exists a prime $q<\\sqrt p$ such that \n-- $$q^{\\,p-1}\\not\\equiv1\\pmod{p^2}\\,. $$\nimport Mathlib.Data.Nat.Prime.Basic\nimport Mathlib.Data.Nat.ModEq\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formalization of the prime/square-modulus problem\n\nThe source problem asks one to prove that for every prime `p` of the form\n`4 * k + 1`, there is a prime `q` below the real square root of `p` whose\n`(p - 1)`-st power is not congruent to `1` modulo `p ^ 2`.\n-/\n\nnamespace Problem\n\n/-- A natural number is a prime of the form `4 * k + 1` for some natural\nnumber `k`. -/\ndef PrimeOfFormFourKPlusOne (p : ℕ) : Prop :=\n Nat.Prime p ∧ ∃ k : ℕ, p = 4 * k + 1\n\n/-- A number `q` is a prime lying strictly below the real square root of `p`. -/\ndef PrimeBelowSqrt (p q : ℕ) : Prop :=\n Nat.Prime q ∧ (q : ℝ) < Real.sqrt (p : ℝ)\n\n/-- The congruence in the conclusion fails: `q ^ (p - 1)` is not congruent\nto `1` modulo `p ^ 2`. -/\ndef NotCongruentOneModSquare (p q : ℕ) : Prop :=\n ¬ (q ^ (p - 1) ≡ 1 [MOD p ^ 2])\n\n/-- The complete assertion of the problem: for every prime `p = 4 * k + 1`,\nthere exists a prime `q` with `q < sqrt p` such that\n`q ^ (p - 1)` is not congruent to `1` modulo `p ^ 2`. -/\ndef Target : Prop :=\n ∀ p : ℕ, PrimeOfFormFourKPlusOne p →\n ∃ q : ℕ, PrimeBelowSqrt p q ∧ NotCongruentOneModSquare p q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d7f6fae4-3b9e-582e-b6f4-6674ecffc83e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cfed9fa950689425e557eb3b1fdc8ae287460856df5554897b17b0f61b75a3cc", "task_path": "tasks/nmp3_d7f6fae4-3b9e-582e-b6f4-6674ecffc83e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d7f6fae4-3b9e-582e-b6f4-6674ecffc83e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d80ed288-2c16-5240-afff-5a5b974044ca", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exist infinitely many positive integers $a$ such that the Diophantine equation \n-- $$p^{a} - 1 = 2 (n!)^{2}$$\n-- has no solution in a prime $p$ and a positive integer $n$.\nimport Mathlib\n\n/-!\n# Formal statement for: infinitely many exponents with no prime/factorial solution\n\nThe original problem asks to prove that there are infinitely many positive\nintegers `a` for which the Diophantine equation\n`p ^ a - 1 = 2 * (n!) ^ 2`\nhas no solution with `p` prime and `n` a positive integer.\n\nThe equation is interpreted over the integers. The variables `p` and `n`\nrange over natural numbers, with primality of `p` and positivity of `n`\nimposed explicitly.\n-/\n\nnamespace Problem\n\n/-- The Diophantine equation\n`p ^ a - 1 = 2 * (n!) ^ 2`, interpreted in the integers. -/\ndef Equation (a p n : ℕ) : Prop :=\n (p : ℤ) ^ a - 1 = 2 * ((Nat.factorial n : ℤ) ^ 2)\n\n/-- `a` admits a solution of the equation in a prime `p` and a positive\ninteger `n`. -/\ndef HasSolution (a : ℕ) : Prop :=\n ∃ p n : ℕ, Nat.Prime p ∧ 0 < n ∧ Equation a p n\n\n/-- `a` admits no solution of the equation in a prime `p` and a positive\ninteger `n`. -/\ndef HasNoSolution (a : ℕ) : Prop :=\n ¬ HasSolution a\n\n/-- There exist infinitely many positive integers `a` such that\n`p ^ a - 1 = 2 * (n!) ^ 2` has no solution with `p` prime and `n` positive. -/\ndef Target : Prop :=\n Set.Infinite {a : ℕ | 0 < a ∧ HasNoSolution a}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d80ed288-2c16-5240-afff-5a5b974044ca", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5d21d9b652fd10e0f969c12b61109f0d43a51276532a8c4bc3382bc9cd029587", "task_path": "tasks/nmp3_d80ed288-2c16-5240-afff-5a5b974044ca", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d80ed288-2c16-5240-afff-5a5b974044ca", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d81f985e-c09e-52c8-aea1-c149d37bd7f8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c,d>0$ and $abcd=1$. Prove that \n-- $$3(a^4+b^4+c^4+d^4)+24\\ge\\bigl(ab+bc+cd+da+ac+bd\\bigr)^2.$$\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the four-variable inequality\n\nThe source problem asks to prove an inequality for four positive real numbers\nwhose product is one. The assertion is recorded as a proposition-valued\ndefinition, as requested for this statement-formalization task.\n-/\n\nnamespace Problem\n\n/-- The sum of the six pairwise products appearing on the right-hand side. -/\ndef pairSum (a b c d : ℝ) : ℝ :=\n a * b + b * c + c * d + d * a + a * c + b * d\n\n/-- The sum of the fourth powers appearing on the left-hand side. -/\ndef fourthPowerSum (a b c d : ℝ) : ℝ :=\n a ^ (4 : ℕ) + b ^ (4 : ℕ) + c ^ (4 : ℕ) + d ^ (4 : ℕ)\n\n/-- The complete assertion: for all positive reals `a`, `b`, `c`, and `d`\nwith product one, `3 (a^4 + b^4 + c^4 + d^4) + 24` is at least the square\nof the sum of their six pairwise products. -/\ndef Target : Prop :=\n ∀ (a b c d : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n 0 < d →\n a * b * c * d = 1 →\n 3 * fourthPowerSum a b c d + 24 ≥ (pairSum a b c d) ^ (2 : ℕ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d81f985e-c09e-52c8-aea1-c149d37bd7f8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d31e2746d4a77cde380618e5402a8f4425308e16aa96288f401668185935c3f9", "task_path": "tasks/nmp3_d81f985e-c09e-52c8-aea1-c149d37bd7f8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d81f985e-c09e-52c8-aea1-c149d37bd7f8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d82a09d9-e624-51f1-8f40-9bedddaecd75", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b$ be positive integers such that \n-- \\[\n-- \\frac{a+1}{b}+\\frac{b+1}{a}\n-- \\] \n-- is an integer. Prove that \n-- \\[\n-- \\frac{a+b}{\\gcd(a,b)^2}\n-- \\] \n-- is a Fibonacci number.\nimport Mathlib.Data.Nat.Fib.Basic\nimport Mathlib.Data.Nat.GCD.Basic\nimport Mathlib.Data.Rat.Defs\n\nnamespace Problem\n\n/-- The value `(a+1)/b + (b+1)/a`, regarded as a rational number. -/\ndef expressionValue (a b : ℕ) : ℚ :=\n ((a : ℚ) + 1) / (b : ℚ) + ((b : ℚ) + 1) / (a : ℚ)\n\n/-- The hypothesis that `(a+1)/b + (b+1)/a` is an integer. -/\ndef HasIntegralExpression (a b : ℕ) : Prop :=\n ∃ k : ℤ, expressionValue a b = (k : ℚ)\n\n/-- A rational number is a Fibonacci number when it equals `Nat.fib n` for some `n`. -/\ndef IsFibonacciNumber (q : ℚ) : Prop :=\n ∃ n : ℕ, q = (Nat.fib n : ℚ)\n\n/-- The number `(a+b)/gcd(a,b)^2`, regarded as a rational number. -/\ndef fibonacciQuotient (a b : ℕ) : ℚ :=\n ((a : ℚ) + (b : ℚ)) / ((Nat.gcd a b : ℚ) ^ 2)\n\n/-- The assertion of the problem: for all positive integers `a` and `b`, if\n`(a+1)/b + (b+1)/a` is an integer, then `(a+b)/gcd(a,b)^2` is a Fibonacci number. -/\ndef Target : Prop :=\n ∀ a b : ℕ, 0 < a → 0 < b → HasIntegralExpression a b →\n IsFibonacciNumber (fibonacciQuotient a b)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d82a09d9-e624-51f1-8f40-9bedddaecd75", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8e861502ac26dc7973a2b1f60a3f03ac9afae4590ea4f87f757a0a7b345687a3", "task_path": "tasks/nmp3_d82a09d9-e624-51f1-8f40-9bedddaecd75", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d82a09d9-e624-51f1-8f40-9bedddaecd75", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d83d5339-9f59-5f31-9b6b-1027ee01cb72", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$. Prove that \n-- \\[\n-- 27\\prod_{\\text{cyc}}(a^{2}+3bc)\\,\\sum_{\\text{cyc}}a^{2}\\;\\ge\\;64\\Bigl(\\sum_{\\text{cyc}}ab\\Bigr)^{4}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\nFormalization of the inequality in `problem.md`.\n\nThe notation `∏_cyc` is expanded in the cyclic order with variables `a`, `b`, `c`.\nThus the three factors are `a^2 + 3*b*c`, `b^2 + 3*c*a`, and `c^2 + 3*a*b`.\nThe notation `∑_cyc a^2` is `a^2 + b^2 + c^2`, and `∑_cyc ab` is\n`a*b + b*c + c*a`.\n-/\n\nnamespace Problem\n\n/-- The cyclic product `∏_cyc (a^2 + 3*b*c)`. -/\ndef cyclicProduct (a b c : ℝ) : ℝ :=\n (a ^ 2 + 3 * b * c) * (b ^ 2 + 3 * c * a) * (c ^ 2 + 3 * a * b)\n\n/-- The cyclic sum `∑_cyc a^2`. -/\ndef cyclicSumSq (a b c : ℝ) : ℝ :=\n a ^ 2 + b ^ 2 + c ^ 2\n\n/-- The cyclic sum `∑_cyc a*b`. -/\ndef cyclicSumMul (a b c : ℝ) : ℝ :=\n a * b + b * c + c * a\n\n/-- The left-hand side of the asserted inequality. -/\ndef inequalityLHS (a b c : ℝ) : ℝ :=\n 27 * cyclicProduct a b c * cyclicSumSq a b c\n\n/-- The right-hand side of the asserted inequality. -/\ndef inequalityRHS (a b c : ℝ) : ℝ :=\n 64 * (cyclicSumMul a b c) ^ 4\n\n/-- The pointwise inequality asserted for nonnegative `a`, `b`, and `c`. -/\ndef inequalityHolds (a b c : ℝ) : Prop :=\n inequalityLHS a b c ≥ inequalityRHS a b c\n\n/--\nThe full statement: for all nonnegative real numbers `a`, `b`, and `c`,\n`27 * ∏_cyc (a^2 + 3*b*c) * ∑_cyc a^2 ≥ 64 * (∑_cyc a*b)^4`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → inequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d83d5339-9f59-5f31-9b6b-1027ee01cb72", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3033368a8e9bdac0cadd00ebfbe95360a2a2325a60b57507665e40a03a58079f", "task_path": "tasks/nmp3_d83d5339-9f59-5f31-9b6b-1027ee01cb72", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d83d5339-9f59-5f31-9b6b-1027ee01cb72", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d85d34c3-d985-58de-90c8-6600cc1487a2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge4$ be a positive integer such that $n\\mid(2^n-2)$. Prove that the integer $\\displaystyle\\frac{2^n-2}{n}$ is not prime (i.e., it is composite).\nimport Mathlib\n\nnamespace Problem\n\n/--\nThe admissibility conditions on the positive integer `n` in the problem:\n`n` is positive, `n ≥ 4`, and `n` divides `2 ^ n - 2`.\n-/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧ 4 ≤ n ∧ n ∣ (2 ^ n - 2)\n\n/--\nThe integer quotient `(2 ^ n - 2) / n` from the problem, represented using\nnatural-number division. Under `Admissible n`, the divisibility condition\nmakes this the exact integer quotient.\n-/\ndef quotient (n : ℕ) : ℕ :=\n (2 ^ n - 2) / n\n\n/--\nThe statement to be proved: for every positive integer `n ≥ 4` such that\n`n` divides `2 ^ n - 2`, the quotient `(2 ^ n - 2) / n` is not prime\n(equivalently, in the intended range, it is composite).\n-/\ndef Target : Prop :=\n ∀ n : ℕ, Admissible n → ¬ Nat.Prime (quotient n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d85d34c3-d985-58de-90c8-6600cc1487a2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "628b0a9b417dc9614bdb07843c8654d6f3dfe01d23e3299aac14d0cb35808785", "task_path": "tasks/nmp3_d85d34c3-d985-58de-90c8-6600cc1487a2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d85d34c3-d985-58de-90c8-6600cc1487a2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d8cbd784-2132-56f3-859e-87728bbff7ce", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are non‑negative real numbers and no two of them are zero, prove that \n-- \\[\n-- \\frac{1}{\\sqrt{b^{2}-bc+c^{2}}}+\\frac{1}{\\sqrt{c^{2}-ca+a^{2}}}+\\frac{1}{\\sqrt{a^{2}-ab+b^{2}}}\\ge\\frac{6}{a+b+c}\\,.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\n/-!\n# Formal statement of the nonnegative-real three-variable inequality\n\nThis file records the exact proposition asserted in the source problem. The\ndeclarations are proposition-valued; no proof of the inequality is supplied.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The admissibility hypotheses for the three real numbers in the problem.\n\nThe phrase \"no two of them are zero\" is represented literally as the three\npairwise conditions saying that no pair consists of two zero entries. Thus at\nmost one of `a`, `b`, and `c` may be zero. -/\ndef IsAdmissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧\n ¬ (a = 0 ∧ b = 0) ∧\n ¬ (a = 0 ∧ c = 0) ∧\n ¬ (b = 0 ∧ c = 0)\n\n/-- The left-hand side of the displayed inequality. -/\ndef leftSide (a b c : ℝ) : ℝ :=\n 1 / Real.sqrt (b ^ 2 - b * c + c ^ 2) +\n 1 / Real.sqrt (c ^ 2 - c * a + a ^ 2) +\n 1 / Real.sqrt (a ^ 2 - a * b + b ^ 2)\n\n/-- The right-hand side of the displayed inequality. -/\ndef rightSide (a b c : ℝ) : ℝ :=\n 6 / (a + b + c)\n\n/-- The full assertion of the source problem: for every triple of admissible\nnonnegative real numbers, the left-hand side is at least the right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n IsAdmissible a b c →\n rightSide a b c ≤ leftSide a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d8cbd784-2132-56f3-859e-87728bbff7ce", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "987a8b78739328db3c72a17c83b54622bd7f53afec9dfcc366cfe8f1a66ced24", "task_path": "tasks/nmp3_d8cbd784-2132-56f3-859e-87728bbff7ce", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d8cbd784-2132-56f3-859e-87728bbff7ce", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d900c248-abca-5a65-9544-9f1390efd29e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Points $P_1,P_2,\\dots,P_7$ lie respectively on the sides $BC, CA, AB, BC, CA, AB, BC$ of triangle $ABC$. They satisfy \n-- \\[\n-- \\angle P_1P_2C=\\angle AP_2P_3=\\angle P_3P_4B=\\angle CP_4P_5=\\angle P_5P_6A=\\angle BP_6P_7=60^\\circ .\n-- \\] \n-- Prove that $P_1=P_7\\,$ (i.e., the two points on $BC$ coincide).\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Analysis.Convex.Segment\nimport Mathlib.Analysis.InnerProductSpace.PiL2\n\n/-!\n# Formalization of the seven-point $60^\\circ$ configuration\n\nThis file states the problem in the Euclidean plane. A point lies on a side when it\nlies in the closed segment between the corresponding pair of vertices. Angles are\nMathlib's unoriented Euclidean angles, measured in radians; hence `60°` is `π / 3`.\n-/\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\nopen Real\n\nnamespace Problem\n\n/-- The ambient Euclidean plane used for the problem. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `OnSide X Y Z` means that `X` lies on the closed side segment `YZ`. -/\ndef OnSide (X Y Z : Plane) : Prop := X ∈ segment ℝ Y Z\n\n/-- The vertices `A`, `B`, `C` form a nondegenerate triangle, i.e. they are not\ncollinear. -/\ndef IsTriangle (A B C : Plane) : Prop := AffineIndependent ℝ ![A, B, C]\n\n/-- The hypotheses of the problem for a triangle `ABC` and the seven points `P₁, …, P₇`.\n\nThe vertices form a nondegenerate triangle (`IsTriangle A B C`), the seven points\nlie on the prescribed closed sides, and the six displayed angles are each `π / 3`\nradians. -/\ndef IsConfiguration\n (A B C P1 P2 P3 P4 P5 P6 P7 : Plane) : Prop :=\n IsTriangle A B C ∧\n OnSide P1 B C ∧\n OnSide P2 C A ∧\n OnSide P3 A B ∧\n OnSide P4 B C ∧\n OnSide P5 C A ∧\n OnSide P6 A B ∧\n OnSide P7 B C ∧\n ∠ P1 P2 C = π / 3 ∧\n ∠ A P2 P3 = π / 3 ∧\n ∠ P3 P4 B = π / 3 ∧\n ∠ C P4 P5 = π / 3 ∧\n ∠ P5 P6 A = π / 3 ∧\n ∠ B P6 P7 = π / 3\n\n/-- The assertion of the problem: every configuration of the stated kind forces the\ntwo points `P₁` and `P₇` on side `BC` to coincide. -/\ndef Target : Prop :=\n ∀ (A B C P1 P2 P3 P4 P5 P6 P7 : Plane),\n IsConfiguration A B C P1 P2 P3 P4 P5 P6 P7 → P1 = P7\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d900c248-abca-5a65-9544-9f1390efd29e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "04c63d89f2d8418541ad44190099079a0f933c561b67e6f0290e0bd47de43149", "task_path": "tasks/nmp3_d900c248-abca-5a65-9544-9f1390efd29e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d900c248-abca-5a65-9544-9f1390efd29e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d92227bc-14aa-5bc9-af4f-74a506ee344e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c>0$ with $\\displaystyle\\frac1a+\\frac1b+\\frac1c=3$, prove that \n-- $$15abc+3\\;\\ge\\;2\\Bigl(\\sqrt{8a^{2}+bc}+\\sqrt{8b^{2}+ca}+\\sqrt{8c^{2}+ab}\\Bigr).$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypotheses imposed on the three positive real parameters:\n`a > 0`, `b > 0`, `c > 0`, and `1 / a + 1 / b + 1 / c = 3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 1 / a + 1 / b + 1 / c = 3\n\n/-- The inequality asserted for admissible real parameters `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n 15 * a * b * c + 3 ≥\n 2 * (Real.sqrt (8 * a ^ 2 + b * c) +\n Real.sqrt (8 * b ^ 2 + c * a) +\n Real.sqrt (8 * c ^ 2 + a * b))\n\n/-- The complete universal statement of the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d92227bc-14aa-5bc9-af4f-74a506ee344e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "80c4b4d99a6ece3298bff7e58a0af18ae0585d2d1513af6425417d123a60e15a", "task_path": "tasks/nmp3_d92227bc-14aa-5bc9-af4f-74a506ee344e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d92227bc-14aa-5bc9-af4f-74a506ee344e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d9640d94-22be-5dfe-b62d-7d123233a63b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\sqrt{a^{3}}\\,b+\\sqrt{b^{3}}\\,c+\\sqrt{c^{3}}\\,a\\le 3.\n-- \\] \n-- (Equivalently $a^{\\frac32}b+b^{\\frac32}c+c^{\\frac32}a\\le3$.)\nimport Mathlib\n\nnamespace Problem\n\n/--\nThe target assertion of the problem: for every triple of positive real numbers\nwhose sum is `3`, the cyclic expression is at most `3`.\n\nThe square-root form is the form displayed in the problem statement. The\nparenthetical fractional-power form is equivalent on the positive domain, but\nthe displayed square-root expression is what is formalized here.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 3 →\n Real.sqrt (a ^ 3) * b +\n Real.sqrt (b ^ 3) * c +\n Real.sqrt (c ^ 3) * a ≤ (3 : ℝ)\n\n/--\nThe left-hand side in the parenthetical fractional-power form. On the\npositive domain of the problem this is equal to the square-root left-hand\nside used in `Problem.Target`.\n-/\nnoncomputable def RpowLhs (a b c : ℝ) : ℝ :=\n Real.rpow a ((3 : ℝ) / 2) * b +\n Real.rpow b ((3 : ℝ) / 2) * c +\n Real.rpow c ((3 : ℝ) / 2) * a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d9640d94-22be-5dfe-b62d-7d123233a63b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9bf65ef190eecdb8f7146de47b396fb920e8bf45f80ce31a6a5bc22c03bab9d9", "task_path": "tasks/nmp3_d9640d94-22be-5dfe-b62d-7d123233a63b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d9640d94-22be-5dfe-b62d-7d123233a63b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d96def99-8ddd-5d74-8ce5-9a9ddf3f97f9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a$ and $b$ be distinct positive integers. Start with an empty board. The following infinite process is performed:\n-- \n-- (i) If there exists a pair of equal numbers on the board, choose such a pair $(x,x)$ and replace it by the two numbers $x+a$ and $x+b$.\n-- \n-- (ii) If no pair of equal numbers exists on the board, write two copies of $0$ on the board.\n-- \n-- Prove that, regardless of the choices made in operation (i), operation (ii) can be performed only a finite number of times.\nimport Mathlib\n\n/-!\n# Formalization of the board process\n\nThe board is represented as a multiset of natural numbers. A multiset records\nexactly the multiplicities of the numbers on the board, so replacing one of two\nequal entries removes two occurrences of that value and inserts the two shifted\nvalues.\n\nThe main declaration `Problem.Target` is a proposition; no proof of it is given\nhere.\n-/\n\nnamespace Problem\n\n/-- The type of finite boards. A board records numbers with multiplicity. -/\nabbrev Board : Type := Multiset ℕ\n\n/-- A board has a pair of equal numbers exactly when some value occurs at least\ntwice. -/\ndef HasEqualPair (B : Board) : Prop :=\n ∃ x : ℕ, 2 ≤ B.count x\n\n/-- Remove two occurrences of `x` from a board and insert `x + a` and `x + b`.\nThe caller is responsible for the condition that two occurrences of `x` exist;\nthat condition is part of `Step`. -/\ndef ReplacePair (B : Board) (x a b : ℕ) : Board :=\n (B.erase x).erase x + Multiset.ofList [x + a, x + b]\n\n/-- One transition of the process. Either the current board has an equal pair,\none such pair `(x, x)` is selected, and that pair is replaced by `x + a` and\n`x + b`; or the current board has no equal pair and two copies of `0` are\nadded. -/\ndef Step (a b : ℕ) (B C : Board) : Prop :=\n (HasEqualPair B ∧ ∃ x : ℕ, 2 ≤ B.count x ∧ C = ReplacePair B x a b) ∨\n (¬ HasEqualPair B ∧ C = B + Multiset.ofList [0, 0])\n\n/-- `FollowsProcess a b B` says that `B` is an infinite board sequence starting\nfrom the empty board and satisfying the transition rule at every step. -/\ndef FollowsProcess (a b : ℕ) (B : ℕ → Board) : Prop :=\n B 0 = (0 : Board) ∧ ∀ n : ℕ, Step a b (B n) (B (n + 1))\n\n/-- A step is a zero-writing step when no equal pair is present in the current\nboard and the next board is obtained by adding two copies of `0`. -/\ndef ZeroWriteStep (B C : Board) : Prop :=\n ¬ HasEqualPair B ∧ C = B + Multiset.ofList [0, 0]\n\n/-- The assertion of the problem: for distinct positive integers `a` and `b`,\nand for every infinite board sequence following the process from the empty\nboard, the set of times at which operation (ii) is used is finite. -/\ndef Target : Prop :=\n ∀ (a b : ℕ), 0 < a → 0 < b → a ≠ b →\n ∀ (B : ℕ → Board), FollowsProcess a b B →\n {n : ℕ | ZeroWriteStep (B n) (B (n + 1))}.Finite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d96def99-8ddd-5d74-8ce5-9a9ddf3f97f9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "42e7e08a6b89fce6bfb09adae71ffac5607d8cfcfca842911b690b6f203cc6ee", "task_path": "tasks/nmp3_d96def99-8ddd-5d74-8ce5-9a9ddf3f97f9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d96def99-8ddd-5d74-8ce5-9a9ddf3f97f9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d9d1267c-d818-5d55-baa9-5a30b0b35a8a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $a,b,c>0$, prove that \n-- \\[\n-- abc\\,(a+2)(b+2)(c+2)\\le\\left[1+\\frac{2}{3}(ab+bc+ca)\\right]^3.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The inequality asserted in the problem.\n\nFor all positive real numbers `a`, `b`, and `c`, the product\n`a b c (a + 2) (b + 2) (c + 2)` is at most\n`(1 + (2 / 3) * (a b + b c + c a)) ^ 3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c * (a + 2) * (b + 2) * (c + 2) ≤\n (1 + (2 / 3) * (a * b + b * c + c * a)) ^ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d9d1267c-d818-5d55-baa9-5a30b0b35a8a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0f02e12497cece0dbad73aec9e5d0b07d047719f1320db8536b20de0815e9016", "task_path": "tasks/nmp3_d9d1267c-d818-5d55-baa9-5a30b0b35a8a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d9d1267c-d818-5d55-baa9-5a30b0b35a8a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_d9e32872-7c75-5506-915a-b842c1d4d3ba", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k,M$ be positive integers such that $k-1$ is not square‑free (i.e. there exists a prime $p$ with $p^{2}\\mid k-1$). Prove that there exists a positive real number $\\alpha$ such that for every positive integer $n$,\n-- \\[\n-- \\gcd\\!\\bigl(\\,\\lfloor \\alpha\\,k^{n}\\rfloor,\\;M\\,\\bigr)=1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the statement\n\nThe original problem asks to prove that for positive integers `k` and `M`\nwith `k - 1` not square-free, there is a positive real `α` such that\n`gcd (⌊α * k^n⌋, M) = 1` for every positive integer `n`.\n-/\n\nnamespace Problem\n\n/-- `m` has a prime whose square divides it. This is the parenthetical\nmeaning of `k - 1` not being square-free in the problem. -/\ndef HasPrimeSquareDivisor (m : ℕ) : Prop :=\n ∃ p : ℕ, Nat.Prime p ∧ p ^ 2 ∣ m\n\n/-- A real number `α` is admissible for the pair `(k, M)` when it is\npositive and, for every positive integer `n`, the gcd of the integer floor\nof `α * k^n` with `M` is one. -/\ndef AdmissibleAlpha (k M : ℕ) (α : ℝ) : Prop :=\n 0 < α ∧\n ∀ n : ℕ, 0 < n →\n Int.gcd ⌊α * ((k : ℝ) ^ n)⌋ (M : ℤ) = 1\n\n/-- The full assertion of the problem. -/\ndef Target : Prop :=\n ∀ k M : ℕ, 0 < k → 0 < M → HasPrimeSquareDivisor (k - 1) →\n ∃ α : ℝ, AdmissibleAlpha k M α\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d9e32872-7c75-5506-915a-b842c1d4d3ba", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "534d212921e7e503ced98315e49a4483e41c36200574932d7e5d0c608fd873b9", "task_path": "tasks/nmp3_d9e32872-7c75-5506-915a-b842c1d4d3ba", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "d9e32872-7c75-5506-915a-b842c1d4d3ba", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_da06638d-a327-5d07-ac5f-6cbb91de5695", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P$, $Q$, and $R$ be points on sides $BC$, $CA$, and $AB$, respectively, of an acute triangle $ABC$ such that $\\triangle PQR$ is equilateral and has minimal area among all equilateral triangles whose vertices lie on the three sides of $ABC$. Prove that the three lines through $A$, $B$, $C$ perpendicular respectively to $QR$, $RP$, and $PQ$ are concurrent.\nimport Mathlib\n\n/-!\n# Formalization of the equilateral-inscribed-triangle concurrency problem\n\nThis file states, but does not prove, the target theorem. The Euclidean plane is\nrepresented by `EuclideanSpace ℝ (Fin 2)`. All geometric notions used in the\nproblem are expanded into explicit definitions so that the target statement does\nnot depend on an omitted existence or uniqueness argument.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane, represented by the real two-dimensional Euclidean space. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The real inner product of two plane vectors. -/\ndef Dot (u v : Plane) : ℝ := inner ℝ u v\n\n/-- `x` lies on the closed segment from `a` to `b`. Endpoints are included. -/\ndef OnSegment (x a b : Plane) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ x = a + t • (b - a)\n\n/-- The nondegenerate triangle with vertices `p`, `q`, and `r` is equilateral. -/\ndef IsEquilateral (p q r : Plane) : Prop :=\n dist p q = dist q r ∧ dist q r = dist r p ∧ 0 < dist p q\n\n/-- The non-oriented Euclidean area of triangle `p q r`.\n\nThe formula is `sqrt (|pq|^2 |pr|^2 - (pq · pr)^2) / 2`, the usual\nbase-height/parallelogram-area formula in the plane. -/\ndef TriangleArea (p q r : Plane) : ℝ :=\n Real.sqrt ((dist p q) ^ 2 * (dist p r) ^ 2 - (Dot (q - p) (r - p)) ^ 2) / 2\n\n/-- Triangle `a b c` is acute, expressed by the three vertex angle dot products\nbeing strictly positive. This also entails that the three vertices are distinct\nand not collinear. -/\ndef AcuteTriangle (a b c : Plane) : Prop :=\n 0 < Dot (b - a) (c - a) ∧\n 0 < Dot (c - b) (a - b) ∧\n 0 < Dot (a - c) (b - c)\n\n/-- The line through `a` perpendicular to the line through `u` and `v`, as a set\nof points. Its direction is orthogonal to the direction vector `v - u`. -/\ndef PerpendicularLineThrough (a u v : Plane) : Set Plane :=\n {x : Plane | Dot (x - a) (v - u) = 0}\n\n/-- `p`, `q`, and `r` are vertices of an equilateral triangle lying respectively\non the closed sides `BC`, `CA`, and `AB` of triangle `ABC`. -/\ndef EquilateralTriangleOnSides (a b c p q r : Plane) : Prop :=\n OnSegment p b c ∧\n OnSegment q c a ∧\n OnSegment r a b ∧\n IsEquilateral p q r\n\n/-- Triangle `p q r` has area no larger than every equilateral triangle having\nits corresponding vertices on the closed sides `BC`, `CA`, and `AB`. The fact\nthat `p q r` itself is an admissible equilateral triangle is supplied separately\nby `EquilateralTriangleOnSides` in `Target`. -/\ndef MinimalAreaAmongEquilateralTrianglesOnSides\n (a b c p q r : Plane) : Prop :=\n ∀ (p' q' r' : Plane),\n EquilateralTriangleOnSides a b c p' q' r' →\n TriangleArea p q r ≤ TriangleArea p' q' r'\n\n/-- The three lines through `A`, `B`, and `C`, perpendicular respectively to\n`QR`, `RP`, and `PQ`, have a common point. -/\ndef ConcurrentPerpendiculars (a b c p q r : Plane) : Prop :=\n ∃ x : Plane,\n x ∈ PerpendicularLineThrough a q r ∧\n x ∈ PerpendicularLineThrough b r p ∧\n x ∈ PerpendicularLineThrough c p q\n\n/-- Formal target: for every acute triangle `ABC` and every triple of points\n`P`, `Q`, and `R` lying respectively on `BC`, `CA`, and `AB`, if `PQR` is an\nequilateral triangle of minimal area among all equilateral triangles whose\nvertices lie on those three sides, then the three specified perpendicular lines\nare concurrent. -/\ndef Target : Prop :=\n ∀ (a b c : Plane),\n AcuteTriangle a b c →\n ∀ (p q r : Plane),\n OnSegment p b c →\n OnSegment q c a →\n OnSegment r a b →\n IsEquilateral p q r →\n MinimalAreaAmongEquilateralTrianglesOnSides a b c p q r →\n ConcurrentPerpendiculars a b c p q r\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "da06638d-a327-5d07-ac5f-6cbb91de5695", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "289036dbeb6e497e01364a6ba2b23dc501b83e53ab6e9675371442c8ecbe9fda", "task_path": "tasks/nmp3_da06638d-a327-5d07-ac5f-6cbb91de5695", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "da06638d-a327-5d07-ac5f-6cbb91de5695", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_da3d3498-8b64-5b1c-9b3f-1fdc37ebe077", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a scalene triangle with $\\angle A = 60^{\\circ}$. Let $E$ and $F$ be the feet of the internal angle bisectors of $\\angle ABC$ and $\\angle ACB$, respectively, and let $I$ be the incenter of $\\triangle ABC$. Let $P$ and $Q$ be distinct points such that $\\triangle PEF$ and $\\triangle QEF$ are equilateral. If $O$ is the circumcenter of $\\triangle APQ$, prove that $\\overline{OI}\\perp\\overline{BC}\\,. $\nimport Mathlib\n\n/-!\n# Formalization of a planar geometry problem\n\nThe original problem is a statement about a scalene triangle `ABC` in the Euclidean\nplane with `∠A = 60°`. We model the plane as the real Euclidean vector space\n`EuclideanSpace ℝ (Fin 2)`, and phrase every geometric object by an explicit predicate.\n\nNo proof of the target proposition is included; `Problem.Target` is the proposition\nasserted by the problem.\n-/\n\nnoncomputable section\n\nopen scoped EuclideanGeometry RealInnerProductSpace\n\nnamespace Problem\n\n/-- The ambient Euclidean plane used throughout the formalization. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A nondegenerate triangle whose three side lengths are pairwise distinct. -/\ndef IsScaleneTriangle (A B C : Point) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Point) ∧\n dist A B ≠ dist B C ∧ dist B C ≠ dist C A ∧ dist C A ≠ dist A B\n\n/-- The angle at `A` in triangle `ABC` is exactly `60°` (that is, `π / 3` radians). -/\ndef AngleAIsSixty (A B C : Point) : Prop :=\n EuclideanGeometry.angle B A C = Real.pi / 3\n\n/-- `E` is the foot of the internal angle bisector from vertex `B` to the opposite side\n`AC`. Thus `E` lies strictly between `A` and `C`, and the rays `BA` and `BC` make\nequal angles with `BE`. -/\ndef IsInternalAngleBisectorFoot (A B C E : Point) : Prop :=\n Sbtw ℝ A E C ∧\n EuclideanGeometry.angle A B E = EuclideanGeometry.angle E B C\n\n/-- `I` is the incenter of triangle `ABC`, expressed in barycentric coordinates with\nweights the lengths of the opposite sides. For a nondegenerate triangle this is the\nusual internal incenter. -/\ndef IsIncenter (I A B C : Point) : Prop :=\n let a := dist B C\n let b := dist C A\n let c := dist A B\n I = (a + b + c)⁻¹ • (a • A + b • B + c • C)\n\n/-- Three points form a nondegenerate equilateral triangle when all three side lengths\nare equal and all three vertices are distinct. -/\ndef IsEquilateral (X Y Z : Point) : Prop :=\n X ≠ Y ∧ Y ≠ Z ∧ Z ≠ X ∧\n dist X Y = dist Y Z ∧ dist Y Z = dist Z X\n\n/-- `O` is the (unique) circumcenter of triangle `APQ`: the three vertices are\nnoncollinear, `O` is equidistant from them, and the equidistant center is unique. -/\ndef IsCircumcenter (O A P Q : Point) : Prop :=\n ¬ Collinear ℝ ({A, P, Q} : Set Point) ∧\n 0 < dist O A ∧\n dist O A = dist O P ∧\n dist O P = dist O Q ∧\n ∀ O' : Point,\n dist O' A = dist O' P → dist O' P = dist O' Q → O' = O\n\n/-- The lines through `X,Y` and through `Z,W` are perpendicular. Both lines are\nrequired to be nondegenerate, and perpendicularity is expressed by vanishing inner\nproduct of their direction vectors. -/\ndef PerpendicularLines (X Y Z W : Point) : Prop :=\n X ≠ Y ∧ Z ≠ W ∧ inner ℝ (Y - X) (W - Z) = 0\n\n/-- The conclusion of the problem: line `OI` is perpendicular to line `BC`. -/\ndef Conclusion (O I B C : Point) : Prop :=\n PerpendicularLines O I B C\n\n/-- The target assertion of the problem. The quantifiers follow the order in which the\nobjects are introduced in the source: first the triangle `ABC`, then the bisector feet\n`E,F`, then the incenter `I`, then the equilateral apices `P,Q`, and finally the\ncircumcenter `O`. The hypotheses introduced at each stage are attached directly to the\ncorrespondingly scoped variables. -/\ndef Target : Prop :=\n ∀ A B C : Point,\n IsScaleneTriangle A B C →\n AngleAIsSixty A B C →\n ∀ E F : Point,\n IsInternalAngleBisectorFoot A B C E →\n IsInternalAngleBisectorFoot A C B F →\n ∀ I : Point,\n IsIncenter I A B C →\n ∀ P Q : Point,\n P ≠ Q →\n IsEquilateral P E F →\n IsEquilateral Q E F →\n ∀ O : Point,\n IsCircumcenter O A P Q →\n Conclusion O I B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "da3d3498-8b64-5b1c-9b3f-1fdc37ebe077", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "603b3268eae3404a9131bf04b93a4a926503e110a34c2199c6fef5a1f10a26d0", "task_path": "tasks/nmp3_da3d3498-8b64-5b1c-9b3f-1fdc37ebe077", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "da3d3498-8b64-5b1c-9b3f-1fdc37ebe077", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_da907d86-409b-51ad-9534-ccf77f2c2970", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A group of 100 kids has a deck of 101 cards numbered 0, 1, 2, …, 100. Each kid, in turn, shuffles the deck, then draws the cards one by one. After drawing each card that is not the last one in the deck, the kid computes the average of the numbers on the cards drawn so far and writes this average on the blackboard. Thus each kid writes down 100 numbers (the first being the number on the first drawn card). Prove that among the 10 000 numbers written on the blackboard there are at least two equal numbers.\nimport Mathlib\n\nnamespace Problem\n\n/-- The 101 cards are labelled by their numbers `0, …, 100`. -/\nabbrev Card : Type := Fin 101\n\n/-- The 100 children. -/\nabbrev Kid : Type := Fin 100\n\n/-- A child records one average for each nonempty proper initial segment of the deck:\nthere are 100 possibilities, indexed by `0, …, 99`. Index `n` means that the first\n`n + 1` cards have been drawn. -/\nabbrev PrefixIndex : Type := Fin 100\n\n/-- The card label at a given position of a shuffled deck. -/\ndef draw (order : Equiv.Perm Card) (position : Fin 101) : ℕ :=\n (order position).val\n\n/-- The sum of the labels of the first `n + 1` cards in a shuffled deck, regarded\nas an exact rational number. -/\ndef prefixSum (order : Equiv.Perm Card) (n : PrefixIndex) : ℚ :=\n ∑ i : Fin (n.val + 1), (draw order ⟨i.val, by omega⟩ : ℚ)\n\n/-- The average written after the first `n + 1` cards have been drawn. -/\ndef prefixAverage (order : Equiv.Perm Card) (n : PrefixIndex) : ℚ :=\n prefixSum order n / (n.val + 1 : ℚ)\n\n/-- The number written by a given child after a given number of cards. -/\ndef writtenNumber (orders : Kid → Equiv.Perm Card) (kid : Kid)\n (n : PrefixIndex) : ℚ :=\n prefixAverage (orders kid) n\n\n/-- The complete family of numbers written on the blackboard, indexed by the pair\n(which child, which recorded prefix). -/\ndef writtenNumbers (orders : Kid → Equiv.Perm Card) : Kid × PrefixIndex → ℚ :=\n fun p => writtenNumber orders p.1 p.2\n\n/-- The first recorded average is exactly the number on the first card drawn. -/\ntheorem prefixAverage_zero (order : Equiv.Perm Card) :\n prefixAverage order (0 : PrefixIndex) = (draw order (0 : Fin 101) : ℚ) := by\n simp [prefixAverage, prefixSum, draw]\n\n/-- There are two different recorded entries (possibly from the same child or from\ndifferent children) whose values are equal. -/\ndef HasRepeatedWrittenNumber (orders : Kid → Equiv.Perm Card) : Prop :=\n ∃ p q : Kid × PrefixIndex, p ≠ q ∧ writtenNumbers orders p = writtenNumbers orders q\n\n/-- The number of entries on the blackboard is the cardinality of the index type:\n100 children times 100 recorded prefixes. -/\ndef numberOfWrittenNumbers : ℕ := Fintype.card (Kid × PrefixIndex)\n\n/-- The index type has exactly 10,000 elements, as asserted in the problem. -/\ntheorem numberOfWrittenNumbers_eq : numberOfWrittenNumbers = 10000 := by\n simp [numberOfWrittenNumbers, Kid, PrefixIndex]\n\n/-- **Target statement.** For every possible shuffle chosen by each of the 100\nchildren, among the 10,000 recorded prefix averages there are at least two equal\nentries. -/\ndef Target : Prop :=\n ∀ orders : Kid → Equiv.Perm Card, HasRepeatedWrittenNumber orders\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "da907d86-409b-51ad-9534-ccf77f2c2970", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "de120577e97e181fe801e1c43f62fa7961dbd8c7d87b43f9f810740b658cdef4", "task_path": "tasks/nmp3_da907d86-409b-51ad-9534-ccf77f2c2970", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "da907d86-409b-51ad-9534-ccf77f2c2970", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_da9f7a22-ebac-5f62-b470-6821cf9899fa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c,d>0$ and $abcd = 1$, prove that \n-- $$a^4 b + b^4 c + c^4 d + d^4 a \\ge a + b + c + d\\,.$$\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The assumptions of the problem: four positive real numbers whose product is one. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧ a * b * c * d = 1\n\n/-- The asserted inequality, with the four variables in their original order. -/\ndef Inequality (a b c d : ℝ) : Prop :=\n a ^ 4 * b + b ^ 4 * c + c ^ 4 * d + d ^ 4 * a ≥ a + b + c + d\n\n/-- The complete universal statement of the problem. -/\ndef Target : Prop :=\n ∀ (a b c d : ℝ), Admissible a b c d → Inequality a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "da9f7a22-ebac-5f62-b470-6821cf9899fa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5589ae98b0de68d2dfc4afc02dfe1cddc02397e37e1dfe39c86300899f05c752", "task_path": "tasks/nmp3_da9f7a22-ebac-5f62-b470-6821cf9899fa", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "da9f7a22-ebac-5f62-b470-6821cf9899fa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_daa01de2-c6e4-5405-aaee-d3ba80b23364", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\in\\mathbb R$ with $x\\neq1$, $y\\neq1$, $z\\neq1$ and $xyz=-1$. Prove that \n-- \\[\n-- \\frac{1}{(x-1)^4}+\\frac{1}{(y-1)^4}+\\frac{1}{(z-1)^4}\\ge\\frac{3}{16}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks for a proof of an inequality for three real numbers\nwhose product is `-1` and none of which is equal to `1`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n (1 : ℝ) / ((x - 1) ^ 4) + (1 : ℝ) / ((y - 1) ^ 4) + (1 : ℝ) / ((z - 1) ^ 4)\n\n/-- The admissibility conditions stated in the source problem. -/\ndef Admissible (x y z : ℝ) : Prop :=\n x ≠ 1 ∧ y ≠ 1 ∧ z ≠ 1 ∧ x * y * z = -1\n\n/-- The inequality conclusion of the source problem. -/\ndef Inequality (x y z : ℝ) : Prop :=\n lhs x y z ≥ (3 : ℝ) / 16\n\n/--\nFor all real numbers `x`, `y`, and `z`, if none of them equals `1` and\n`x * y * z = -1`, then the sum of the reciprocals of the fourth powers of `x - 1`, `y - 1`, and\n`z - 1` is at least `3 / 16`.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ, x ≠ 1 → y ≠ 1 → z ≠ 1 → x * y * z = (-1 : ℝ) →\n lhs x y z ≥ (3 : ℝ) / 16\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "daa01de2-c6e4-5405-aaee-d3ba80b23364", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "58674d86e279e8687e90ee8db9a723641525c517ce306c6d7d3a216ae9c961a4", "task_path": "tasks/nmp3_daa01de2-c6e4-5405-aaee-d3ba80b23364", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "daa01de2-c6e4-5405-aaee-d3ba80b23364", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_daa59e2d-4b6d-5489-bb1a-19ec7039d593", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers \\(a,b,c\\) prove that \n-- \\[\n-- \\sum_{\\text{cyc}} a^{3}+9\\sum_{\\text{cyc}} a^{2}b+6\\sum_{\\text{cyc}} a^{2}\n-- \\;\\ge\\;\n-- 3\\sum_{\\text{cyc}}ab(a+b)+12abc+6\\sum_{\\text{cyc}}ab,\n-- \\] \n-- where \\(\\sum_{\\text{cyc}} a^{3}=a^{3}+b^{3}+c^{3},\\;\\sum_{\\text{cyc}} a^{2}b=a^{2}b+b^{2}c+c^{2}a,\\;\\sum_{\\text{cyc}} a^{2}=a^{2}+b^{2}+c^{2},\\;\\sum_{\\text{cyc}}ab=ab+bc+ca.\\)\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic real inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe inequality\n\n`∑cyc a^3 + 9 ∑cyc a^2 b + 6 ∑cyc a^2\n ≥ 3 ∑cyc ab(a+b) + 12abc + 6 ∑cyc ab`.\n\nThe cyclic sums used below are made explicit. In particular, the source\nexplicitly defines `∑cyc a^2 b` as `a^2 b + b^2 c + c^2 a`, and the cyclic\nsum of `ab(a+b)` is expanded in the same cyclic order.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum `∑cyc a^3`, namely `a^3 + b^3 + c^3`. -/\ndef cycCubeSum (a b c : ℝ) : ℝ :=\n a ^ 3 + b ^ 3 + c ^ 3\n\n/-- The cyclic sum `∑cyc a^2 b`, namely `a^2 b + b^2 c + c^2 a`. -/\ndef cycSqMulSum (a b c : ℝ) : ℝ :=\n a ^ 2 * b + b ^ 2 * c + c ^ 2 * a\n\n/-- The cyclic sum `∑cyc a^2`, namely `a^2 + b^2 + c^2`. -/\ndef cycSquareSum (a b c : ℝ) : ℝ :=\n a ^ 2 + b ^ 2 + c ^ 2\n\n/-- The cyclic sum `∑cyc ab`, namely `ab + bc + ca`. -/\ndef cycMulSum (a b c : ℝ) : ℝ :=\n a * b + b * c + c * a\n\n/-- The cyclic sum `∑cyc ab(a+b)`, expanded as\n`ab(a+b) + bc(b+c) + ca(c+a)`. -/\ndef cycMulAddSum (a b c : ℝ) : ℝ :=\n a * b * (a + b) + b * c * (b + c) + c * a * (c + a)\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n cycCubeSum a b c + 9 * cycSqMulSum a b c + 6 * cycSquareSum a b c\n\n/-- The right-hand side of the displayed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 3 * cycMulAddSum a b c + 12 * (a * b * c) + 6 * cycMulSum a b c\n\n/-- For all positive real numbers `a`, `b`, and `c`, the displayed cyclic\ninequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "daa59e2d-4b6d-5489-bb1a-19ec7039d593", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "23afa57be48f11e5c79995ad19ffccf70badc1d906ea3c0fada26ecbc732336f", "task_path": "tasks/nmp3_daa59e2d-4b6d-5489-bb1a-19ec7039d593", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "daa59e2d-4b6d-5489-bb1a-19ec7039d593", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_daa8f28b-a962-59de-a122-d9a84234cf79", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$. Prove that \n-- \\[\n-- a^{3}+b^{3}+c^{3}+3abc\\;\\ge\\;ab\\sqrt{2(a^{2}+b^{2})}+bc\\sqrt{2(b^{2}+c^{2})}+ca\\sqrt{2(c^{2}+a^{2})}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe problem asks to prove a nonnegative-real inequality involving cube terms\nand square roots. The assertion is packaged as a proposition-valued\ndefinition; no proof is supplied here.\n-/\n\nnamespace Problem\n\n/--\nFor all nonnegative real numbers `a`, `b`, and `c`,\n`a^3 + b^3 + c^3 + 3abc` is at least\n`ab * sqrt (2 * (a^2 + b^2)) +\n bc * sqrt (2 * (b^2 + c^2)) +\n ca * sqrt (2 * (c^2 + a^2))`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n a ^ 3 + b ^ 3 + c ^ 3 + 3 * a * b * c ≥\n a * b * Real.sqrt (2 * (a ^ 2 + b ^ 2)) +\n b * c * Real.sqrt (2 * (b ^ 2 + c ^ 2)) +\n c * a * Real.sqrt (2 * (c ^ 2 + a ^ 2))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "daa8f28b-a962-59de-a122-d9a84234cf79", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "354e9999444e6436ec7953a0817969206037b331074f22963d85349836b2d954", "task_path": "tasks/nmp3_daa8f28b-a962-59de-a122-d9a84234cf79", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "daa8f28b-a962-59de-a122-d9a84234cf79", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dab7047f-8e44-5a1b-9023-0c3601abe848", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $R_1,R_2,\\dots,R_m$ be a collection of subsets (routes) of a finite set $S$ (stops) such that \n-- \n-- 1. $|R_i|\\ge 4$ for every $i$, and \n-- 2. $|R_i\\cap R_j|=1$ for every distinct $i,j$. \n-- \n-- Prove that there exists a partition $S=S_1\\cup S_2$, $S_1\\cap S_2=\\varnothing$, (equivalently, a 2‑coloring of the stops) such that each route $R_i$ contains at least one element of $S_1$ and at least one element of $S_2$.\nimport Mathlib\n\n/-!\n# Formal statement: a two-colouring of a finite linear route family\n\nThe source problem asks for the existence of a partition of a finite stop set into\ntwo parts such that every route meets both parts, under the assumptions that every\nroute has at least four stops and any two distinct routes meet in exactly one stop.\nThis file records the statement as a proposition-valued definition; no proof is\nprovided here.\n-/\n\nuniverse u\n\nnamespace Problem\n\n/-- The index set of the route family is `Fin m`, so `m` is the finite number of\nroutes (and may be zero under this formalization).\n\n`RouteFamilyAdmissible S R` says: `S` is finite, all route sets `R i` are subsets\nof `S`, every route has cardinality at least four, and distinct routes have\nintersection cardinality exactly one. Cardinalities are `Set.ncard`, which is the\nnatural-number cardinality for finite sets. -/\ndef RouteFamilyAdmissible (α : Type u) (m : ℕ)\n (S : Set α) (R : Fin m → Set α) : Prop :=\n S.Finite ∧\n (∀ i : Fin m, R i ⊆ S) ∧\n (∀ i : Fin m, 4 ≤ (R i).ncard) ∧\n (∀ i j : Fin m, i ≠ j → (R i ∩ R j).ncard = 1)\n\n/-- A pair `(S₁, S₂)` is a two-part partition of `S` that splits every route when\nit covers `S`, has empty intersection, and every route meets each of the two\nparts. -/\ndef IsRouteSplittingPartition (α : Type u) (m : ℕ)\n (S : Set α) (R : Fin m → Set α) (S₁ S₂ : Set α) : Prop :=\n S = S₁ ∪ S₂ ∧\n S₁ ∩ S₂ = ∅ ∧\n (∀ i : Fin m, (R i ∩ S₁).Nonempty ∧ (R i ∩ S₂).Nonempty)\n\n/-- The formal target of the problem: for every finite stop set and every indexed\nfamily of routes satisfying the two size conditions, there exists such a\nroute-splitting partition. -/\ndef Target : Prop :=\n ∀ (α : Type u) (m : ℕ) (S : Set α) (R : Fin m → Set α),\n RouteFamilyAdmissible α m S R →\n ∃ S₁ S₂ : Set α, IsRouteSplittingPartition α m S R S₁ S₂\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dab7047f-8e44-5a1b-9023-0c3601abe848", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c00167abf4b46a0d23c7e7f7e88238e06d1bd9cbebd9490dcc47a401f6e58aaf", "task_path": "tasks/nmp3_dab7047f-8e44-5a1b-9023-0c3601abe848", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dab7047f-8e44-5a1b-9023-0c3601abe848", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dabd3d2b-2ef1-5c8b-9d22-d7e845eb0d29", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $x$, $y$, $z$, the following inequality holds:\n-- \\[\n-- \\sqrt{\\frac{y+z}{2x}}+\\sqrt{\\frac{z+x}{2y}}+\\sqrt{\\frac{x+y}{2z}}\n-- \\;\\ge\\;\n-- \\sqrt{\\frac{2x}{y+z}}+\\sqrt{\\frac{2y}{z+x}}+\\sqrt{\\frac{2z}{x+y}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nFor positive real numbers `x`, `y`, and `z`, prove that\n\n`sqrt ((y + z) / (2 * x)) + sqrt ((z + x) / (2 * y)) +\n sqrt ((x + y) / (2 * z))\n ≥\n sqrt ((2 * x) / (y + z)) + sqrt ((2 * y) / (z + x)) +\n sqrt ((2 * z) / (x + y))`.\n\nThe assertion is represented by proposition-valued definitions; no proof is\nprovided in this statement-formalization task.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def leftSide (x y z : ℝ) : ℝ :=\n Real.sqrt ((y + z) / (2 * x)) +\n Real.sqrt ((z + x) / (2 * y)) +\n Real.sqrt ((x + y) / (2 * z))\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def rightSide (x y z : ℝ) : ℝ :=\n Real.sqrt ((2 * x) / (y + z)) +\n Real.sqrt ((2 * y) / (z + x)) +\n Real.sqrt ((2 * z) / (x + y))\n\n/-- The inequality for a fixed triple of real numbers. -/\ndef Inequality (x y z : ℝ) : Prop :=\n leftSide x y z ≥ rightSide x y z\n\n/-- The inequality stated in the problem, for all positive real numbers\n`x`, `y`, etc. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dabd3d2b-2ef1-5c8b-9d22-d7e845eb0d29", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "000534c1a8d3d9a62ad340436ce8a50fa7c58723f19458f20c0f9dd04863efbd", "task_path": "tasks/nmp3_dabd3d2b-2ef1-5c8b-9d22-d7e845eb0d29", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dabd3d2b-2ef1-5c8b-9d22-d7e845eb0d29", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dadcfd35-9c9f-5e8b-a9dd-0170772c6751", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\in\\mathbb R$ satisfy \n-- \\[\n-- 9\\bigl(x^{2}+y^{2}+z^{2}\\bigr)\\ge 10\\bigl(xy+yz+zx\\bigr).\n-- \\] \n-- Prove that \n-- \\[\n-- \\bigl(x^{2}+y^{2}+z^{2}-xy-yz-zx\\bigr)^{3}\\ge (x-y)(y-z)(z-x)(x-2y)(y-2z)(z-2x).\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The hypothesis imposed on the real numbers `x`, `y`, and `z` in the problem. -/\ndef Assumption (x y z : ℝ) : Prop :=\n 9 * (x ^ 2 + y ^ 2 + z ^ 2) ≥ 10 * (x * y + y * z + z * x)\n\n/-- The quantity `x^2 + y^2 + z^2 - xy - yz - zx` occurring on the left. -/\ndef QuadraticBase (x y z : ℝ) : ℝ :=\n x ^ 2 + y ^ 2 + z ^ 2 - x * y - y * z - z * x\n\n/-- The six-factor product occurring on the right. -/\ndef ProductRHS (x y z : ℝ) : ℝ :=\n (x - y) * (y - z) * (z - x) * (x - 2 * y) * (y - 2 * z) * (z - 2 * x)\n\n/-- The conclusion asserted under `Assumption x y z`. -/\ndef Conclusion (x y z : ℝ) : Prop :=\n (QuadraticBase x y z) ^ 3 ≥ ProductRHS x y z\n\n/-- The complete universally quantified statement of the problem. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, Assumption x y z → Conclusion x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dadcfd35-9c9f-5e8b-a9dd-0170772c6751", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d2f01b2c4056a126e4bb94fb163be30c49a7a6b8318eb54d6daf89bb9d7221aa", "task_path": "tasks/nmp3_dadcfd35-9c9f-5e8b-a9dd-0170772c6751", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dadcfd35-9c9f-5e8b-a9dd-0170772c6751", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dae6f5ce-9206-5324-b77f-d7a221b06c07", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb{R}\\to\\mathbb{R}$ be a continuous function such that for every real $x$\n-- \\[\n-- f(x+f(x))=f(x).\n-- \\]\n-- Prove that $f$ is constant; i.e., there exists $c\\in\\mathbb{R}$ with $f(x)=c$ for all $x\\in\\mathbb{R}$.\nimport Mathlib\n\n/-!\n# Formalization of the problem statement\n\nThe original problem asks to prove that any continuous real-valued function\non `ℝ` satisfying `f (x + f x) = f x` for every `x` must be constant.\nThe declarations below only encode the statement; they are not proofs.\n-/\n\nnamespace Problem\n\n/-- The pointwise functional equation `f (x + f x) = f x` for every real `x`. -/\ndef SatisfiesFunctionalEquation (f : ℝ → ℝ) : Prop :=\n ∀ x : ℝ, f (x + f x) = f x\n\n/-- The two hypotheses of the problem: continuity of `f` and the functional\nequation `f (x + f x) = f x` at every real `x`. -/\ndef ContinuousAndSatisfiesFunctionalEquation (f : ℝ → ℝ) : Prop :=\n Continuous f ∧ SatisfiesFunctionalEquation f\n\n/-- The conclusion that `f` is constant. The problem explicitly defines this\nas the existence of a real `c` such that `f x = c` for every real `x`. -/\ndef IsConstant (f : ℝ → ℝ) : Prop :=\n ∃ c : ℝ, ∀ x : ℝ, f x = c\n\n/-- The full assertion to be proved: every continuous real-valued function on\n`ℝ` satisfying `f (x + f x) = f x` for all real `x` is constant. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, ContinuousAndSatisfiesFunctionalEquation f → IsConstant f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dae6f5ce-9206-5324-b77f-d7a221b06c07", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9ab2d06aa1e6e5ad4e0ae1efa6cab83035c3ab00867e05e17443a520c3940c8b", "task_path": "tasks/nmp3_dae6f5ce-9206-5324-b77f-d7a221b06c07", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dae6f5ce-9206-5324-b77f-d7a221b06c07", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_daf6fcf2-55d7-5e87-8e70-614874847b64", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,\\;y,\\;z$ be real numbers satisfying $x\\ge y\\ge z>0$. Prove that \n-- \\[\n-- \\frac{x^{2}y}{z}+\\frac{y^{2}z}{x}+\\frac{z^{2}x}{y}\\ge x^{2}+y^{2}+z^{2}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion from the problem: for all real numbers `x`, `y`, and `z`\nsatisfying `x ≥ y ≥ z > 0`, the stated cyclic inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, x ≥ y → y ≥ z → z > 0 →\n x ^ 2 * y / z + y ^ 2 * z / x + z ^ 2 * x / y ≥\n x ^ 2 + y ^ 2 + z ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "daf6fcf2-55d7-5e87-8e70-614874847b64", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5af5a6e4db201a422c1c2b03fd4b92cff51b32de8ea4b03bc5b7207ec6f8ecd9", "task_path": "tasks/nmp3_daf6fcf2-55d7-5e87-8e70-614874847b64", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "daf6fcf2-55d7-5e87-8e70-614874847b64", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dafb493c-b587-5c77-bbb9-febb06630efb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exist infinitely many positive integers $n$ such that \n-- $$n\\mid 2^{\\,2^n+1}+1\\qquad\\text{but}\\qquad n\\nmid 2^n+1.$$\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nThe problem asks to prove that there are infinitely many positive natural numbers\n`n` satisfying both\n\n* `n ∣ 2 ^ (2 ^ n + 1) + 1`, and\n* `n ∤ 2 ^ n + 1`.\n\nThe target is stated as a proposition only; no proof of it is supplied here.\n-/\n\nnamespace Problem\n\n/-- The admissibility predicate for an integer `n` in the problem.\n\nThe first conjunct records that the original statement quantifies over positive\nintegers. The remaining conjuncts are the two divisibility requirements,\nwith natural-number exponentiation and natural-number divisibility. -/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧\n (n ∣ 2 ^ (2 ^ n + 1) + 1) ∧\n ¬ (n ∣ 2 ^ n + 1)\n\n/-- The set of positive integers satisfying the two divisibility conditions. -/\ndef Solutions : Set ℕ :=\n {n : ℕ | Admissible n}\n\n/-- The complete proposition asserted by the problem: the set of admissible\npositive integers is infinite. -/\ndef Target : Prop :=\n Solutions.Infinite\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dafb493c-b587-5c77-bbb9-febb06630efb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "24df3d7c6b6001df6d1c1f511445645c3c2224c1fd9dd888b29bebb64700d3d6", "task_path": "tasks/nmp3_dafb493c-b587-5c77-bbb9-febb06630efb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dafb493c-b587-5c77-bbb9-febb06630efb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_db14d5eb-36c7-5e9a-95c7-c3cd11487dd7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) satisfy \\(a^{2}+b^{2}+c^{2}=a+b+c\\). Prove that \n-- \\[\n-- (a+b+c-1)\\bigl(ab+bc+ca-1\\bigr)\\le 4abc.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`\nsatisfying `a ^ 2 + b ^ 2 + c ^ 2 = a + b + c`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = a + b + c →\n (a + b + c - 1) * (a * b + b * c + c * a - 1) ≤\n (4 : ℝ) * (a * b * c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db14d5eb-36c7-5e9a-95c7-c3cd11487dd7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4cff83bab8e570e34b85d98632b77f70ec895cbb73cc48a386f35bbee199cb0c", "task_path": "tasks/nmp3_db14d5eb-36c7-5e9a-95c7-c3cd11487dd7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db14d5eb-36c7-5e9a-95c7-c3cd11487dd7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_db15b92d-1664-5e65-b5cc-08d552c8caac", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- a^{3}+b^{3}+c^{3}+3abc\\;\\ge\\;ab\\sqrt{2a^{2}+2b^{2}}+bc\\sqrt{2b^{2}+2c^{2}}+ca\\sqrt{2c^{2}+2a^{2}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target assertion\n\nThe source problem asks for a proof over positive real numbers `a`, `b`, and `c`\nof the cubic inequality displayed in `problem.md`.\n-/\n\nnamespace Problem\n\n/-- The admissible triples: `a`, `b`, and `c` are all positive real numbers. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The asserted inequality, for a fixed triple of real numbers. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a ^ 3 + b ^ 3 + c ^ 3 + 3 * a * b * c ≥\n a * b * Real.sqrt (2 * a ^ 2 + 2 * b ^ 2) +\n b * c * Real.sqrt (2 * b ^ 2 + 2 * c ^ 2) +\n c * a * Real.sqrt (2 * c ^ 2 + 2 * a ^ 2)\n\n/-- The full universally quantified assertion of the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db15b92d-1664-5e65-b5cc-08d552c8caac", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9a0d033a8cd5ab8d34578b02843a22b73c6d772ec5c2495bb3691d0b9aaa0d5e", "task_path": "tasks/nmp3_db15b92d-1664-5e65-b5cc-08d552c8caac", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db15b92d-1664-5e65-b5cc-08d552c8caac", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_db234da6-a87e-5b17-9f63-fd14beead2ea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $ABCD$ is a parallelogram and $O$ is a point inside this parallelogram such that $\\angle AOB + \\angle DOC = 180^\\circ$. Prove that $\\angle ODC = \\angle OBC$.\nmodule\n\npublic import Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Analysis.Convex.Topology\n\n/-!\n# Formal statement for a parallelogram angle problem\n\nSuppose `ABCD` is a parallelogram and `O` is a point strictly inside it.\nIf the sum of the angles `∠AOB` and `∠DOC` is `180°`, then `∠ODC = ∠OBC`.\n\nThe Euclidean plane is represented by `EuclideanSpace ℝ (Fin 2)`. Angles are\nMathlib's unoriented angles in the interval `[0, π]`, and `180°` is represented\nby `Real.pi`.\n-/\n\n@[expose] public section\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The points `A`, `B`, `C`, and `D`, taken in that cyclic order, form a\nparallelogram. Concretely, the directed side vector from `A` to `B` equals the\ndirected side vector from `D` to `C`. -/\ndef IsParallelogram (A B C D : EuclideanSpace ℝ (Fin 2)) : Prop :=\n B - A = C - D\n\n/-- A point `O` lies strictly inside the parallelogram with vertices\n`A`, `B`, `C`, and `D`, i.e. in the topological interior of their convex hull. -/\ndef InsideParallelogram (A B C D O : EuclideanSpace ℝ (Fin 2)) : Prop :=\n O ∈ interior (convexHull ℝ ({A, B, C, D} : Set (EuclideanSpace ℝ (Fin 2))))\n\n/-- The formalized target proposition. For every parallelogram `ABCD` in the\nEuclidean plane and every point `O` strictly inside it, if\n`∠AOB + ∠DOC = 180°`, then `∠ODC = ∠OBC`. -/\ndef Target : Prop :=\n ∀ A B C D O : EuclideanSpace ℝ (Fin 2),\n IsParallelogram A B C D →\n InsideParallelogram A B C D O →\n EuclideanGeometry.angle A O B + EuclideanGeometry.angle D O C = Real.pi →\n EuclideanGeometry.angle O D C = EuclideanGeometry.angle O B C\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db234da6-a87e-5b17-9f63-fd14beead2ea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3e5c615bf225b8c5dccabbfe4d0bd8b19884631eedd7b6f5dbfaf6d81aee3609", "task_path": "tasks/nmp3_db234da6-a87e-5b17-9f63-fd14beead2ea", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db234da6-a87e-5b17-9f63-fd14beead2ea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_db283196-2aa3-559f-a280-41ff81e921ce", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c>0$, prove that \n-- \\[\n-- 2\\Bigg(\\frac{a}{\\,b+2c\\,}+\\frac{b}{\\,c+2a\\,}+\\frac{c}{\\,a+2b\\,}\\Bigg)\\ge\n-- \\frac{a(b+c)}{a^{2}+ab+bc}+\\frac{b(c+a)}{b^{2}+bc+ca}+\\frac{c(a+b)}{c^{2}+ca+ab}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable cyclic inequality\n\nThe problem asks, for positive real numbers `a`, `b`, and `c`, to prove a\nsingle cyclic inequality. The declarations below record the exact left-hand\nside, the exact right-hand side, and the resulting universally quantified\nproposition. The target is stated as a `Prop`; no proof is supplied here.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the requested inequality:\n`2 * (a / (b + 2c) + b / (c + 2a) + c / (a + 2b))`. -/\ndef lhs (a b c : ℝ) : ℝ :=\n 2 * (a / (b + 2 * c) + b / (c + 2 * a) + c / (a + 2 * b))\n\n/-- The right-hand side of the requested inequality:\n`a(b+c)/(a^2+ab+bc) + b(c+a)/(b^2+bc+ca) + c(a+b)/(c^2+ca+ab)`. -/\ndef rhs (a b c : ℝ) : ℝ :=\n a * (b + c) / (a ^ 2 + a * b + b * c) +\n b * (c + a) / (b ^ 2 + b * c + c * a) +\n c * (a + b) / (c ^ 2 + c * a + a * b)\n\n/-- The assertion to be proved: for all positive real numbers `a`, `b`, and\n`c`, the left-hand side is at least the right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db283196-2aa3-559f-a280-41ff81e921ce", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "11fa2770575dc4add91f0d9cb97f678316c5a24f09858df63d466e99e44a7214", "task_path": "tasks/nmp3_db283196-2aa3-559f-a280-41ff81e921ce", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db283196-2aa3-559f-a280-41ff81e921ce", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_db44a406-085f-508c-a78e-6cb6e224e39b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given positive integers $a,c$ and an integer $b$, prove that there exists a positive integer $x$ such that \n-- \\[a^x + x \\equiv b \\pmod c,\\] \n-- i.e. $c\\mid a^x + x - b$.\nimport Mathlib\n\n/-!\n# Formalization of the congruence problem\n\nThe source problem asks to prove that for every pair of positive integers `a`, `c`\nand every integer `b`, some positive natural number `x` satisfies\n`c ∣ a ^ x + x - b`.\n-/\n\nnamespace Problem\n\n/-- The congruence condition from the problem, expressed as an integer divisibility.\nHere `a`, `c`, and `x` are natural numbers, while `b` is an integer. -/\ndef CongruenceHolds (a c x : ℕ) (b : ℤ) : Prop :=\n (c : ℤ) ∣ (a : ℤ) ^ x + (x : ℤ) - b\n\n/-- A positive integer `x` is a solution for the given `a`, `c`, and `b`. -/\ndef IsSolution (a c : ℕ) (b : ℤ) (x : ℕ) : Prop :=\n 0 < x ∧ CongruenceHolds a c x b\n\n/-- Given positive integers `a`, `c` and an integer `b`, there exists a positive\ninteger `x` such that `a ^ x + x ≡ b (mod c)`. -/\ndef Target : Prop :=\n ∀ (a c : ℕ), 0 < a → 0 < c → ∀ b : ℤ,\n ∃ x : ℕ, IsSolution a c b x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db44a406-085f-508c-a78e-6cb6e224e39b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4c2dc30ba24c29341adaed7c8fc54d3e2935e1a2c0c3ca1cdb2b28b0cf6fd0f2", "task_path": "tasks/nmp3_db44a406-085f-508c-a78e-6cb6e224e39b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db44a406-085f-508c-a78e-6cb6e224e39b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_db5554c0-65b4-5b58-ac00-b3dfead8003e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P$ be a point in the interior of a simple closed curve $C$ in the plane (i.e., a continuous closed curve that does not intersect itself). Prove that there exist two points $A,B\\in C$ such that $P$ is the midpoint of the segment $\\overline{AB}$.\nimport Mathlib\n\n/-!\n# A chord through any interior point of a simple closed plane curve\n\nThe source problem asks to prove that for every point `P` in the interior of a\nsimple closed curve `C` there are points `A` and `B` on `C` for which `P` is\nthe midpoint of the segment `AB`.\n\nWe model the Euclidean plane as `ℂ`. A simple closed curve is represented as\nthe range of a continuous injective map from the circle `Circle`. The interior\nof such a curve is the bounded connected component of its complement in the\nplane (the Jordan interior).\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane, represented by the complex numbers. -/\nabbrev Plane : Type := ℂ\n\n/--\nA subset `C` of the plane is a simple closed curve if it is the image of the\ncircle under a continuous injective parametrization. Injectivity expresses\nthat the curve does not intersect itself.\n-/\ndef IsSimpleClosedCurve (C : Set Plane) : Prop :=\n ∃ γ : Circle → Plane, Continuous γ ∧ Function.Injective γ ∧ C = Set.range γ\n\n/--\n`P` lies in the interior of the simple closed curve `C`.\n\nFor a Jordan curve, the complement of the curve has one bounded and one\nunbounded connected component; the bounded component is the interior. This\ndefinition says exactly that `P` is outside the curve and that its connected\ncomponent in the complement is bounded.\n-/\ndef IsInteriorPoint (C : Set Plane) (P : Plane) : Prop :=\n P ∉ C ∧ Bornology.IsBounded (connectedComponentIn Cᶜ P)\n\n/-- `P` is the midpoint of the segment with endpoints `A` and `B`. -/\ndef IsMidpoint (P A B : Plane) : Prop :=\n P = (1 / 2 : ℝ) • (A + B)\n\n/--\nThe assertion of the source problem: every point in the interior of a simple\nclosed plane curve is the midpoint of a chord whose endpoints lie on the curve.\n-/\ndef Target : Prop :=\n ∀ (C : Set Plane) (P : Plane),\n IsSimpleClosedCurve C → IsInteriorPoint C P →\n ∃ A B : Plane, A ∈ C ∧ B ∈ C ∧ IsMidpoint P A B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db5554c0-65b4-5b58-ac00-b3dfead8003e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "23c2fdfa9cfeee3374f59c0c3816149f45e141f8cf8ebd6e353afa163f109bdc", "task_path": "tasks/nmp3_db5554c0-65b4-5b58-ac00-b3dfead8003e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db5554c0-65b4-5b58-ac00-b3dfead8003e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_db6126d6-92dd-5264-8c4f-683320e4d64b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ and $k$ be positive integers. Prove that for any real numbers $a_1,\\dots,a_n$ satisfying $1\\le a_i\\le 2^k$ one has \n-- \\[\n-- \\sum_{i=1}^{n}\\frac{a_i}{\\sqrt{a_1^2+\\dots+a_i^2}}\\le 4\\sqrt{kn}\\, .\n-- \\]\nimport Mathlib\n\nnoncomputable section\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The square of the prefix of `a` with indices `0, ..., i`.\n\nThe tuple is indexed by `Fin n`; therefore the `Fin n` index `i` corresponds\nto the source index `i + 1`, and `Finset.Iic i` corresponds exactly to the\nsource terms `a_1, ..., a_{i+1}`. -/\ndef PrefixSq {n : ℕ} (a : Fin n → ℝ) (i : Fin n) : ℝ :=\n ∑ j ∈ Finset.Iic i, (a j) ^ 2\n\n/-- The admissibility condition `1 ≤ a_i ≤ 2^k` for every source index `i`. -/\ndef Admissible (n k : ℕ) (a : Fin n → ℝ) : Prop :=\n ∀ i : Fin n, 1 ≤ a i ∧ a i ≤ (2 : ℝ) ^ k\n\n/-- The left-hand side `∑_{i=1}^n a_i / sqrt(a_1^2 + ... + a_i^2)`. -/\ndef LeftSide {n : ℕ} (a : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, a i / Real.sqrt (PrefixSq a i)\n\n/-- The right-hand side `4 * sqrt(k n)`. -/\ndef RightSide (n k : ℕ) : ℝ :=\n 4 * Real.sqrt (((k * n : ℕ) : ℝ))\n\n/-- The inequality asserted for a fixed natural pair `(n, k)` and real tuple `a`. -/\ndef Inequality (n k : ℕ) (a : Fin n → ℝ) : Prop :=\n LeftSide a ≤ RightSide n k\n\n/-- The complete universal statement: for positive integers `n` and `k`, every\nreal tuple `a : Fin n → ℝ` satisfying `1 ≤ a_i ≤ 2^k` for all `i` obeys the\nrequired inequality. -/\ndef Target : Prop :=\n ∀ (n k : ℕ), 0 < n → 0 < k → ∀ a : Fin n → ℝ,\n Admissible n k a → Inequality n k a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db6126d6-92dd-5264-8c4f-683320e4d64b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "20dea2781f4183c12ce54e1152232044cd04e9b1ab88f97728b19ac9940c6727", "task_path": "tasks/nmp3_db6126d6-92dd-5264-8c4f-683320e4d64b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db6126d6-92dd-5264-8c4f-683320e4d64b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_db734708-52bc-5d98-ada4-030ee0f3ae2b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^{3}+b^{3}+c^{3}}{3abc}+\\frac{a(b+c)}{b^{2}+c^{2}}+\\frac{b(c+a)}{c^{2}+a^{2}}+\\frac{c(a+b)}{a^{2}+b^{2}}\\ge 4,\n-- \\] \n-- with equality if and only if $a=b=c\\,. $\nimport Mathlib.Basic.Real.Basic\n\n/-!\nThis module formalizes the statement of the problem, not its proof.\n\nFor positive real numbers `a`, `b`, and `c`, the claim is that the displayed\nleft-hand side is at least `4`, and that equality holds exactly in the\nsymmetric case `a = b = c`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 3 + b ^ 3 + c ^ 3) / (3 * a * b * c)\n + a * (b + c) / (b ^ 2 + c ^ 2)\n + b * (c + a) / (c ^ 2 + a ^ 2)\n + c * (a + b) / (a ^ 2 + b ^ 2)\n\n/-- The equality case singled out by the problem: `a = b = c`. -/\ndef equalityCase (a b c : ℝ) : Prop :=\n a = b ∧ b = c\n\n/--\nThe complete assertion of the problem: for every triple of positive real\nnumbers, the displayed expression is at least `4`, and it is exactly `4`\nprecisely when `a = b = c`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n lhs a b c ≥ 4 ∧ (lhs a b c = 4 ↔ equalityCase a b c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db734708-52bc-5d98-ada4-030ee0f3ae2b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b9bec303a2bfbf1cb1f91988b5de2b8686124a9088c4bfff453c3b37fb594558", "task_path": "tasks/nmp3_db734708-52bc-5d98-ada4-030ee0f3ae2b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db734708-52bc-5d98-ada4-030ee0f3ae2b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_db83ad73-0974-5afb-b77a-95edaca18beb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $x$, $y$ and $z$ are positive real numbers such that $xyz = 1$, prove that \n-- $$17\\bigl(x^3+y^3+z^3-3\\bigr)\\le 10\\bigl(x^4+y^4+z^4-3\\bigr).$$\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The assertion in the problem: for all positive real numbers `x`, `y`, and `z`\nwith `xyz = 1`, the stated cubic/quartic inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x * y * z = 1 →\n 17 * (x ^ 3 + y ^ 3 + z ^ 3 - 3) ≤\n 10 * (x ^ 4 + y ^ 4 + z ^ 4 - 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db83ad73-0974-5afb-b77a-95edaca18beb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "02814c46edc26bbb16f74ee58d49b5d18c7485801504efc6068e18f4880908a6", "task_path": "tasks/nmp3_db83ad73-0974-5afb-b77a-95edaca18beb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "db83ad73-0974-5afb-b77a-95edaca18beb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dbbb3877-36d6-5f0c-bf78-2547ab7c955a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>3$ be an integer and let $x_1,x_2,\\dots,x_n$ be positive real numbers satisfying $x_1x_2\\cdots x_n=1$. Prove that \n-- \\[\n-- \\sum_{i=1}^{n}\\frac{1}{\\,1+x_i+x_i x_{i+1}\\,}>1,\n-- \\]\n-- where the indices are taken cyclically (i.e., $x_{n+1}=x_1$).\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The cyclic successor of an index `i : Fin n`, assuming `n` is positive.\nFor an index representing position `j` (with `0` corresponding to `x_1`),\nthis is the index of the next position, wrapping from `n - 1` back to `0`. -/\ndef cyclicSucc {n : ℕ} (hn : 0 < n) (i : Fin n) : Fin n :=\n ⟨(i.val + 1) % n, Nat.mod_lt _ hn⟩\n\n/-- The assertion from the problem: for every natural number `n > 3` and every\ncyclically indexed `n`-tuple of positive reals with product `1`, the stated\ncyclic sum is strictly greater than `1`. -/\ndef Target : Prop :=\n ∀ (n : ℕ), (hn : 3 < n) →\n ∀ x : Fin n → ℝ,\n (∀ i : Fin n, 0 < x i) →\n (∏ i : Fin n, x i = 1) →\n (∑ i : Fin n,\n (1 : ℝ) / (1 + x i + x i * x (cyclicSucc (by omega) i))) > 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbbb3877-36d6-5f0c-bf78-2547ab7c955a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f9ee1e56a5dbce2fe0785c5fc740d8b2dd80204c95a09f6ce57e3f9abb15aa93", "task_path": "tasks/nmp3_dbbb3877-36d6-5f0c-bf78-2547ab7c955a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbbb3877-36d6-5f0c-bf78-2547ab7c955a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dbc232ed-e141-5676-81a5-704ac086aa8b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $L_n$ denote the $n$th term of the Lucas sequence, defined by $L_0=2$, $L_1=1$, and $L_{n+1}=L_n+L_{n-1}$ for $n\\ge1$. Let $(a_n)_{n\\ge1}$ be a sequence of integers satisfying \n-- \\[\n-- \\sum_{d\\mid n} a_d = L_n\\qquad\\text{for every positive integer }n.\n-- \\]\n-- Prove that $n\\mid a_n$ for all $n\\ge1$.\n/-\nFormalization of the statement in `problem.md`.\n\nThe original problem defines the Lucas sequence and considers an integer-valued\nsequence on the positive integers whose divisor sums are the corresponding\nLucas numbers. It asks for a proof that every term is divisible by its index.\n\nNo proof is supplied here: `Problem.Target` is the proposition to be proved.\n-/\n\nimport Mathlib\n\nnamespace Problem\n\n/-- The positive natural numbers, used as the exact index set `n ≥ 1` for the\nsequence `(a_n)` and for the conclusion of the problem. -/\ndef PositiveIndex : Type := {n : ℕ // 1 ≤ n}\n\n/-- The Lucas sequence with initial values `L_0 = 2`, `L_1 = 1` and recurrence\n`L_{n+2} = L_{n+1} + L_n`. This is the recurrence in the problem after\nreindexing its recurrence parameter: taking the problem's `n ≥ 1` to be `n + 1`\ngives `L_{(n + 1) + 1} = L_{n + 1} + L_n`. -/\ndef Lucas : ℕ → ℤ\n | 0 => 2\n | 1 => 1\n | n + 2 => Lucas (n + 1) + Lucas n\n\n@[simp] theorem Lucas_zero : Lucas 0 = 2 := rfl\n\n@[simp] theorem Lucas_one : Lucas 1 = 1 := rfl\n\n@[simp] theorem Lucas_add_two (n : ℕ) : Lucas (n + 2) = Lucas (n + 1) + Lucas n := rfl\n\n/-- The divisor-sum admissibility predicate for the sequence `(a_n)`.\n\nFor each positive index `n`, the finite sum of `a d` over the positive natural\ndivisors `d` of `n` equals `Lucas n`. The summands are indexed using the\nattached subtype of `Nat.divisors n`, which provides each divisor together with\nits membership proof. -/\ndef Admissible (a : PositiveIndex → ℤ) : Prop :=\n ∀ n : PositiveIndex,\n (∑ d ∈ (Nat.divisors n.val).attach,\n a ⟨d.val, Nat.pos_of_mem_divisors d.property⟩) = Lucas n.val\n\n/-- The conclusion asserted by the problem: every positive index `n` divides\nthe corresponding integer term `a_n`. Divisibility is taken in the integers,\nwith the positive natural index coerced to `ℤ`. -/\ndef DivisibilityConclusion (a : PositiveIndex → ℤ) : Prop :=\n ∀ n : PositiveIndex, (n.val : ℤ) ∣ a n\n\n/-- The complete statement to be proved. For every integer-valued sequence\nindexed by the positive integers, if its divisor sums are the Lucas numbers,\nthen every term is divisible by its index. -/\ndef Target : Prop :=\n ∀ (a : PositiveIndex → ℤ), Admissible a → DivisibilityConclusion a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbc232ed-e141-5676-81a5-704ac086aa8b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "330887f38cbb740972778255d0ac9516232ab392fe0f47f895eaa3d3bfbb35bc", "task_path": "tasks/nmp3_dbc232ed-e141-5676-81a5-704ac086aa8b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbc232ed-e141-5676-81a5-704ac086aa8b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dbc42ee3-edf8-5a0a-8037-4accdf58df65", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\alpha,\\beta,\\gamma$ be the angles of an acute triangle (so $0<\\alpha,\\beta,\\gamma<\\tfrac{\\pi}{2}$ and $\\alpha+\\beta+\\gamma=\\pi$). Prove that \n-- \\[\n-- \\frac{\\cos^{2}\\alpha}{\\cos^{2}\\beta}+\\frac{\\cos^{2}\\beta}{\\cos^{2}\\gamma}+\\frac{\\cos^{2}\\gamma}{\\cos^{2}\\alpha}\\ge 4\\bigl(\\cos^{2}\\alpha+\\cos^{2}\\beta+\\cos^{2}\\gamma\\bigr).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three real numbers `α`, `β`, and `γ` are the angles (in radians) of an\nacute triangle: each lies strictly between `0` and `π / 2`, and their sum is `π`. -/\ndef IsAcuteTriangleAngles (α β γ : ℝ) : Prop :=\n 0 < α ∧ α < Real.pi / 2 ∧\n 0 < β ∧ β < Real.pi / 2 ∧\n 0 < γ ∧ γ < Real.pi / 2 ∧\n α + β + γ = Real.pi\n\n/-- The inequality asserted in the problem for arbitrary real numbers `α`, `β`,\nand `γ`. All divisions are divisions in `ℝ`, and all powers are natural powers. -/\ndef AcuteTriangleInequality (α β γ : ℝ) : Prop :=\n Real.cos α ^ 2 / Real.cos β ^ 2 +\n Real.cos β ^ 2 / Real.cos γ ^ 2 +\n Real.cos γ ^ 2 / Real.cos α ^ 2 ≥\n 4 * (Real.cos α ^ 2 + Real.cos β ^ 2 + Real.cos γ ^ 2)\n\n/-- The complete statement to be proved: for every triple of real numbers that\nare the angles of an acute triangle, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ α β γ : ℝ, IsAcuteTriangleAngles α β γ → AcuteTriangleInequality α β γ\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbc42ee3-edf8-5a0a-8037-4accdf58df65", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4bb7eea29a430013229f32007fc7fa82e176bbc4bcd9a60fd2c5222dfab9e286", "task_path": "tasks/nmp3_dbc42ee3-edf8-5a0a-8037-4accdf58df65", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbc42ee3-edf8-5a0a-8037-4accdf58df65", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dbc8fa74-28d5-5c3a-8670-0379441f4de2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute triangle with circumcenter $O$ and circumradius $R$. Let $A'$ be the second intersection of line $AO$ with the circumcircle of $\\triangle BOC$, let $B'$ be the second intersection of line $BO$ with the circumcircle of $\\triangle COA$, and let $C'$ be the second intersection of line $CO$ with the circumcircle of $\\triangle AOB$. Prove that \n-- \\[OA'\\cdot OB'\\cdot OC'\\ge 8R^{3}.\\]\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Circumcenter\nimport Mathlib.Geometry.Euclidean.Simplex\nimport Mathlib.Geometry.Euclidean.Sphere.SecondInter\n\n/-!\n# Formalization of the triangle circumcenter inequality\n\nThe problem is stated in the Euclidean plane. We use `EuclideanSpace ℝ (Fin 2)`\nfor the plane and Mathlib's affine triangles and circumcenter/circumradius API.\n\nThe auxiliary predicates below spell out the two geometric constructions appearing\nin the problem: the circumcircle through three points and the second intersection\nof a line through a point of that circle. The final declaration `Problem.Target`\nis the closed proposition asserted by the problem.\n-/\n\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The Euclidean plane used in the problem. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A (nondegenerate) triangle in the Euclidean plane. -/\nabbrev Triangle : Type := Affine.Triangle ℝ Plane\n\n/-- `IsCircumcircle p q r s` says that `s` is the unique circle through `p`, `q`,\nand `r`. In the plane this is the circumcircle of a noncollinear triple. -/\ndef IsCircumcircle (p q r : Plane) (s : EuclideanGeometry.Sphere Plane) : Prop :=\n p ∈ s ∧ q ∈ s ∧ r ∈ s ∧\n ∀ s' : EuclideanGeometry.Sphere Plane, p ∈ s' → q ∈ s' → r ∈ s' → s' = s\n\n/-- `IsSecondIntersection s p q x` says that `x` is the second intersection of\nthe line through `p` and `q` with the circle `s`, the first intersection being\nthe point `p` of the circle. Thus `x` lies on both the line and the circle and\nis different from `p`. -/\ndef IsSecondIntersection (s : EuclideanGeometry.Sphere Plane) (p q x : Plane) : Prop :=\n p ∈ s ∧ x ∈ s ∧ x ∈ line[ℝ, p, q] ∧ x ≠ p\n\n/-- `A'` is the second intersection of line `AO` with the circumcircle of\ntriangle `BOC`. -/\ndef IsAPrime (t : Triangle) (x : Plane) : Prop :=\n ∃ s : EuclideanGeometry.Sphere Plane,\n IsCircumcircle (t.points 1) (t.circumcenter) (t.points 2) s ∧\n IsSecondIntersection s t.circumcenter (t.points 0) x\n\n/-- `B'` is the second intersection of line `BO` with the circumcircle of\ntriangle `COA`. -/\ndef IsBPrime (t : Triangle) (x : Plane) : Prop :=\n ∃ s : EuclideanGeometry.Sphere Plane,\n IsCircumcircle (t.points 2) (t.circumcenter) (t.points 0) s ∧\n IsSecondIntersection s t.circumcenter (t.points 1) x\n\n/-- `C'` is the second intersection of line `CO` with the circumcircle of\ntriangle `AOB`. -/\ndef IsCPrime (t : Triangle) (x : Plane) : Prop :=\n ∃ s : EuclideanGeometry.Sphere Plane,\n IsCircumcircle (t.points 0) (t.circumcenter) (t.points 1) s ∧\n IsSecondIntersection s t.circumcenter (t.points 2) x\n\n/-- The assertion for a fixed acute triangle `t`: for every choice of the\nconstructed points `A'`, `B'`, `C'`, `OA' * OB' * OC' ≥ 8 * R^3`, where `O`\nand `R` are the circumcenter and circumradius of `t`. -/\ndef Claim (t : Triangle) : Prop :=\n t.AcuteAngled →\n ∀ A' B' C' : Plane,\n IsAPrime t A' → IsBPrime t B' → IsCPrime t C' →\n dist t.circumcenter A' * dist t.circumcenter B' * dist t.circumcenter C' ≥\n 8 * t.circumradius ^ 3\n\n/-- The formal statement of the problem: every acute triangle in the Euclidean\nplane satisfies the stated circumcenter inequality. -/\ndef Target : Prop :=\n ∀ t : Triangle, Claim t\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbc8fa74-28d5-5c3a-8670-0379441f4de2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "58015c588458e00adf95dd889f719a67bddf6b33c635209e4c65e8c5ea5cbc48", "task_path": "tasks/nmp3_dbc8fa74-28d5-5c3a-8670-0379441f4de2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbc8fa74-28d5-5c3a-8670-0379441f4de2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dbdb2426-b72d-571b-99ed-279d64d6bc02", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a$, $b$, and $c$, prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{a^{3}}{2a^{2}+b^{2}+c^{2}}\\;\\ge\\;\\sum_{\\text{cyc}}\\frac{a^{2}}{2a+b+c}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a cyclic real inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`,\na cyclic sum inequality. The declarations below deliberately only state the\nassertion; no proof of it is provided in this formalization task.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand cyclic sum from the problem. -/\ndef CyclicLHS (a b c : ℝ) : ℝ :=\n a ^ 3 / (2 * a ^ 2 + b ^ 2 + c ^ 2) +\n b ^ 3 / (2 * b ^ 2 + c ^ 2 + a ^ 2) +\n c ^ 3 / (2 * c ^ 2 + a ^ 2 + b ^ 2)\n\n/-- The right-hand cyclic sum from the problem. -/\ndef CyclicRHS (a b c : ℝ) : ℝ :=\n a ^ 2 / (2 * a + b + c) +\n b ^ 2 / (2 * b + c + a) +\n c ^ 2 / (2 * c + a + b)\n\n/-- The inequality asserted in the source problem, for all positive real\n`a`, `b`, and `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → CyclicRHS a b c ≤ CyclicLHS a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbdb2426-b72d-571b-99ed-279d64d6bc02", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0bc19fe57169add0d53334c6c25c51aecbd9b5ace620352892393ddf54620580", "task_path": "tasks/nmp3_dbdb2426-b72d-571b-99ed-279d64d6bc02", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbdb2426-b72d-571b-99ed-279d64d6bc02", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dbe64906-e6bb-5630-a526-b1be9c8f85cf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all continuous functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that $f(x)=f\\bigl(x+f(x)\\bigr)$ for every real $x$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility predicate for the original problem.\n\nA function `f : ℝ → ℝ` is admissible when it is continuous and satisfies\n`f x = f (x + f x)` at every real `x`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n Continuous f ∧ ∀ x : ℝ, f x = f (x + f x)\n\n/-- A candidate classification of the answer: all constant real-valued functions. -/\ndef IsConstantFunction (f : ℝ → ℝ) : Prop :=\n ∃ c : ℝ, ∀ x : ℝ, f x = c\n\n/-- A predicate `P` is a complete answer when it holds for exactly the admissible\nfunctions. The two conjuncts record both directions of the classification. -/\ndef AnswerCorrect (P : (ℝ → ℝ) → Prop) : Prop :=\n (∀ f : ℝ → ℝ, P f → Problem.Admissible f) ∧\n (∀ f : ℝ → ℝ, Problem.Admissible f → P f)\n\n/-- The target statement: the complete answer to the problem consists exactly of\nthe constant functions. It asserts both that every constant function is admissible\nand that every admissible function is constant. -/\ndef Target : Prop :=\n Problem.AnswerCorrect Problem.IsConstantFunction\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbe64906-e6bb-5630-a526-b1be9c8f85cf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b608a249c0edea84cadec4009d3cadfcbc4518595229e8d80999fb6d62d73834", "task_path": "tasks/nmp3_dbe64906-e6bb-5630-a526-b1be9c8f85cf", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbe64906-e6bb-5630-a526-b1be9c8f85cf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dbe75667-0181-507e-acac-b2091ff5bc7b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb{R}$. Prove that \n-- \\[\n-- a^4+b^4+c^4-abc(a+b+c)+(a^2+b^2+c^2)(ab+bc+ca)\\ge\\frac52\\,(a^3b+b^3c+c^3a)\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- Left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 4 + b ^ 4 + c ^ 4 - a * b * c * (a + b + c) +\n (a ^ 2 + b ^ 2 + c ^ 2) * (a * b + b * c + c * a)\n\n/-- Right-hand side of the target inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n ((5 : ℝ) / 2) * (a ^ 3 * b + b ^ 3 * c + c ^ 3 * a)\n\n/-- The assertion to be proved: for all real `a`, `b`, and `c`, the stated\nleft-hand side is at least the stated right-hand side. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbe75667-0181-507e-acac-b2091ff5bc7b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "25e917502c29d5d09e721fe6129d660d9fd2e4753318f3d977173fdacaf1fcf1", "task_path": "tasks/nmp3_dbe75667-0181-507e-acac-b2091ff5bc7b", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dbe75667-0181-507e-acac-b2091ff5bc7b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dc083cc5-1280-55e1-9214-43f0cc0ab89f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ satisfy $xyz=1$. Prove that \n-- \\[\n-- \\frac{x}{x+y^{2}+z^{4}}+\\frac{y}{y+z^{2}+x^{4}}+\\frac{z}{z+x^{2}+y^{4}}\\le 1\\,.\n-- \\] \n-- (The sum is taken cyclically.)\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the cyclic inequality in the problem statement. -/\ndef cyclicLHS (x y z : ℝ) : ℝ :=\n x / (x + y ^ 2 + z ^ 4) +\n y / (y + z ^ 2 + x ^ 4) +\n z / (z + x ^ 2 + y ^ 4)\n\n/-- The formal statement of the inequality problem: for all positive real\nnumbers `x`, `y`, and `z` whose product is `1`, the cyclic sum is at most `1`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z → x * y * z = 1 →\n cyclicLHS x y z ≤ 1\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dc083cc5-1280-55e1-9214-43f0cc0ab89f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d01c4dab65918d038a3ddb5c83ea2caa2c98ab63f5aea38b3e517a5632c93e7a", "task_path": "tasks/nmp3_dc083cc5-1280-55e1-9214-43f0cc0ab89f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dc083cc5-1280-55e1-9214-43f0cc0ab89f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dc24e5f4-d4ff-50f5-a8c2-3fd55ab46afe", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(a_n)_{n=0}^{\\infty}$ be a sequence of integers satisfying \n-- \\[0\\le a_n+7a_{n+1}+10a_{n+2}\\le 9\\qquad\\text{for all }n\\ge0.\\] \n-- Prove that there exists $n_0\\in\\mathbb N$ such that $a_n=0$ for every $n\\ge n_0$.\nmodule\n\npublic import Mathlib.Data.Int.Basic\n\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The constraint imposed on an integer sequence by the problem. -/\ndef Admissible (a : ℕ → ℤ) : Prop :=\n ∀ n : ℕ,\n 0 ≤ a n + 7 * a (n + 1) + 10 * a (n + 2) ∧\n a n + 7 * a (n + 1) + 10 * a (n + 2) ≤ 9\n\n/-- An integer sequence is eventually zero. -/\ndef EventuallyZero (a : ℕ → ℤ) : Prop :=\n ∃ n0 : ℕ, ∀ n : ℕ, n0 ≤ n → a n = 0\n\n/-- The assertion asked for in the problem. -/\ndef Target : Prop :=\n ∀ a : ℕ → ℤ, Admissible a → EventuallyZero a\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dc24e5f4-d4ff-50f5-a8c2-3fd55ab46afe", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bab5b9cbf597894e418223287dc44ee5916843d77db09244244c2e203b330a74", "task_path": "tasks/nmp3_dc24e5f4-d4ff-50f5-a8c2-3fd55ab46afe", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dc24e5f4-d4ff-50f5-a8c2-3fd55ab46afe", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dc29d6ce-fde1-550c-b88b-324b850134c8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- (a+b^{2})(b+c^{2})(c+a^{2})\\le 13.\n-- \\]\nimport Mathlib\n\n/-!\nFormal statement for the problem:\n\nLet `a`, `b`, `c` be positive real numbers such that `a + b + c = 3`.\nProve that `(a + b^2) * (b + c^2) * (c + a^2) ≤ 13`.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three real parameters in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The left-hand side of the asserted inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a + b ^ 2) * (b + c ^ 2) * (c + a ^ 2)\n\n/-- The asserted upper bound on the expression from the problem. -/\ndef BoundHolds (a b c : ℝ) : Prop :=\n lhs a b c ≤ 13\n\n/--\nThe complete universally quantified assertion: for every triple of positive\nreal numbers whose sum is `3`, the stated product is at most `13`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → BoundHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dc29d6ce-fde1-550c-b88b-324b850134c8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "06ad18abdceffa008459a82ec55272a8a3deb545ad3814727ffad125d3372613", "task_path": "tasks/nmp3_dc29d6ce-fde1-550c-b88b-324b850134c8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dc29d6ce-fde1-550c-b88b-324b850134c8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dc63f8ec-fb81-50a3-9fc0-4c6c1c91630a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for all positive real numbers $a,b,c$,\n-- \\[\n-- \\frac{(a-b)(3a+b)}{a^{2}+b^{2}}+\\frac{(b-c)(3b+c)}{b^{2}+c^{2}}+\\frac{(c-a)(3c+a)}{c^{2}+a^{2}}\\ge 0.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality, evaluated at real numbers `a`, `b`, and `c`. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a - b) * ((3 : ℝ) * a + b) / (a ^ 2 + b ^ 2) +\n (b - c) * ((3 : ℝ) * b + c) / (b ^ 2 + c ^ 2) +\n (c - a) * ((3 : ℝ) * c + a) / (c ^ 2 + a ^ 2)\n\n/-- For all positive real numbers `a`, `b`, and `c`, the three-term expression\nis nonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → 0 ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dc63f8ec-fb81-50a3-9fc0-4c6c1c91630a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "89c865405f8da8db6bc2aadb3376a9f110117c4ae2b496967648b1727a7f2312", "task_path": "tasks/nmp3_dc63f8ec-fb81-50a3-9fc0-4c6c1c91630a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dc63f8ec-fb81-50a3-9fc0-4c6c1c91630a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dca53a54-4be1-5a1f-a899-d3e1a24f1515", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\ge0$ satisfy $a^{2}+b^{2}+c^{2}+d^{2}=4$ and $a\\ge b\\ge c\\ge d$. Prove that \n-- \\[\n-- \\sqrt{abcd}+\\frac34\\,(a-d)^{2}\\ge1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the nonnegative ordered four-variable inequality\n\nThe source problem asks to prove, for nonnegative real numbers\n`a ≥ b ≥ c ≥ d` whose squares sum to `4`, that\n`sqrt (a * b * c * d) + (3 / 4) * (a - d)^2 ≥ 1`.\n-/\n\nnamespace Problem\n\n/-- The hypotheses of the source problem.\n\nThe variables are real numbers, all nonnegative, ordered as\n`a ≥ b ≥ c ≥ d`, and their squares sum to `4`.\n-/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 ≤ d ∧\n a ≥ b ∧ b ≥ c ∧ c ≥ d ∧\n a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = 4\n\n/-- The asserted inequality for four real numbers. -/\ndef Inequality (a b c d : ℝ) : Prop :=\n Real.sqrt (a * b * c * d) + (3 / 4 : ℝ) * (a - d) ^ 2 ≥ 1\n\n/-- The complete universally quantified statement of the source problem. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Inequality a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dca53a54-4be1-5a1f-a899-d3e1a24f1515", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3dd28965641cee8cebf65d936792bbc040d38d2f947165da5760e359b7c18844", "task_path": "tasks/nmp3_dca53a54-4be1-5a1f-a899-d3e1a24f1515", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dca53a54-4be1-5a1f-a899-d3e1a24f1515", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dca92e26-25e1-5f58-93bd-676c89ade7ea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that \n-- $$\\frac{a^3}{b^2}+\\frac{b^3}{c^2}+\\frac{c^3}{a^2}+3\\ge 2\\,(a^2+b^2+c^2).$$\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissible triples of real numbers for the problem:\n`a`, `b`, and `c` are all positive and their sum is `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The left-hand side of the asserted inequality. -/\ndef leftHandSide (a b c : ℝ) : ℝ :=\n a ^ 3 / b ^ 2 + b ^ 3 / c ^ 2 + c ^ 3 / a ^ 2 + 3\n\n/-- The right-hand side of the asserted inequality. -/\ndef rightHandSide (a b c : ℝ) : ℝ :=\n 2 * (a ^ 2 + b ^ 2 + c ^ 2)\n\n/-- The asserted inequality, for a fixed triple. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n leftHandSide a b c ≥ rightHandSide a b c\n\n/-- The full universally quantified proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → InequalityHolds a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dca92e26-25e1-5f58-93bd-676c89ade7ea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2923444c0b4adae085a22599518ccb57b428c605f3b6e03e36e2e4ad9683fb23", "task_path": "tasks/nmp3_dca92e26-25e1-5f58-93bd-676c89ade7ea", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dca92e26-25e1-5f58-93bd-676c89ade7ea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dcae952a-a958-574e-a814-d9c996878f78", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers. Prove that \n-- \\[\n-- \\sqrt{x^2-xy+y^2}+\\sqrt{y^2-yz+z^2}+\\sqrt{z^2-zx+x^2}+9\\sqrt[3]{xyz}\\le 4(x+y+z).\n-- \\]\n/-\nFormalization of the inequality in `problem.md`.\n\nThe original problem asks, for positive real numbers `x`, `y`, and `z`, to prove\n`sqrt (x^2 - x*y + y^2) + sqrt (y^2 - y*z + z^2) +\n sqrt (z^2 - z*x + x^2) + 9 * cbrt (x*y*z) <= 4 * (x+y+z)`.\n\nThere is no real cube-root function named `Real.cbrt` in the pinned Mathlib\nversion, so `realCubeRoot` is the principal cube root, written using real\npowers. On the positive hypotheses of the target, its argument `x*y*z` is\npositive, so this is the usual positive real cube root.\n-/\n\nimport Mathlib\n\nnamespace Problem\n\n/-- The quadratic expression `a^2 - a*b + b^2` appearing under a square root. -/\ndef cyclicQuadratic (a b : ℝ) : ℝ :=\n a ^ 2 - a * b + b ^ 2\n\n/-- The nonnegative square-root term `sqrt (a^2 - a*b + b^2)`. -/\nnoncomputable def cyclicSqrt (a b : ℝ) : ℝ :=\n Real.sqrt (cyclicQuadratic a b)\n\n/-- The principal real cube root of `a`, defined as the odd extension of the\nreal power `a^(1/3)` from nonnegative inputs.\n\nFor the target, `a = x*y*z` is positive, so the first branch applies and this\nis the usual positive real cube root. -/\nnoncomputable def realCubeRoot (a : ℝ) : ℝ :=\n if 0 ≤ a then\n Real.rpow a ((1 : ℝ) / 3)\n else\n -Real.rpow (-a) ((1 : ℝ) / 3)\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def leftSide (x y z : ℝ) : ℝ :=\n cyclicSqrt x y + cyclicSqrt y z + cyclicSqrt z x\n + 9 * realCubeRoot (x * y * z)\n\n/-- The right-hand side of the inequality. -/\ndef rightSide (x y z : ℝ) : ℝ :=\n 4 * (x + y + z)\n\n/-- The assertion of the original problem: for all positive real `x`, `y`, and\n`z`, the stated inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n leftSide x y z ≤ rightSide x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dcae952a-a958-574e-a814-d9c996878f78", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ea5f97bc817dcc25cb2078c789c8980e90c73453b7cb8fd7b12a9719b621de3a", "task_path": "tasks/nmp3_dcae952a-a958-574e-a814-d9c996878f78", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dcae952a-a958-574e-a814-d9c996878f78", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dce8e5f1-435f-5f1a-9434-ccdcd6df3e8c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) satisfy \\(a^{2}+b^{2}+c^{2}=1\\). Prove that \n-- \n-- \\[\n-- \\frac{a}{a^{3}+bc}+\\frac{b}{b^{3}+ca}+\\frac{c}{c^{3}+ab}>3\\,.\n-- \\] \n-- (The sum is cyclic.)\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility conditions for the variables in the problem:\n`a`, `b`, and `c` are positive real numbers whose squares sum to one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 2 + b ^ 2 + c ^ 2 = 1\n\n/-- The cyclic sum appearing on the left-hand side of the displayed inequality. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n a / (a ^ 3 + b * c) + b / (b ^ 3 + c * a) + c / (c ^ 3 + a * b)\n\n/-- The proposition asserted by the problem: for every positive real triple with\n`a^2 + b^2 + c^2 = 1`, the displayed cyclic sum is strictly greater than `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → CyclicSum a b c > 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dce8e5f1-435f-5f1a-9434-ccdcd6df3e8c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "16bd63787fdef6233d43cff1534d325561976071db54efcefd83281e6e910cad", "task_path": "tasks/nmp3_dce8e5f1-435f-5f1a-9434-ccdcd6df3e8c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dce8e5f1-435f-5f1a-9434-ccdcd6df3e8c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dd105a0e-d09e-5c47-aa32-9f194c1a47e8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$, with not more than one of them equal to $0$. Prove that \n-- \\[\n-- \\frac{b+c}{2a^{2}+bc}+\\frac{c+a}{2b^{2}+ca}+\\frac{a+b}{2c^{2}+ab}\\ge\\frac{6}{a+b+c}\\, .\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the three-variable real inequality\n\nThis file contains only the statement of the problem, not a proof.\nThe variables are real numbers. The condition \"not more than one of them\nequal to 0\" is represented by requiring that no pair consists of two zeros.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- No two of `a`, `b`, and `c` are both zero. -/\ndef AtMostOneZero (a b c : ℝ) : Prop :=\n ¬ (a = 0 ∧ b = 0) ∧ ¬ (c = 0 ∧ a = 0) ∧ ¬ (b = 0 ∧ c = 0)\n\n/-- The admissible triples in the problem: nonnegative reals with at most one zero. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ AtMostOneZero a b c\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (b + c) / (2 * a ^ 2 + b * c) +\n (c + a) / (2 * b ^ 2 + c * a) +\n (a + b) / (2 * c ^ 2 + a * b)\n\n/-- The right-hand side of the displayed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 6 / (a + b + c)\n\n/-- The inequality asserted in the problem for a fixed triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full universally quantified statement to be proved. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dd105a0e-d09e-5c47-aa32-9f194c1a47e8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d48533dd003a89ecb785cb7c84b5a0aa0c79fdaa90acb0574c59a55c8d7c7b7d", "task_path": "tasks/nmp3_dd105a0e-d09e-5c47-aa32-9f194c1a47e8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dd105a0e-d09e-5c47-aa32-9f194c1a47e8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dd16c0bb-facf-5f35-8afa-e254b5fdda00", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- \\[\n-- (x+y+z)^2\\bigl(x^2y^2+y^2z^2+z^2x^2\\bigr)\\ge \\frac{27}{64}\\Bigl[(x+y)^2(y+z)^2(z+x)^2+\\frac{37}{27}(x-y)^2(y-z)^2(z-x)^2\\Bigr].\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the problem statement\n\nThe original problem asks to prove, for all positive real numbers `x`, `y`, and `z`,\nthe polynomial inequality\n\n`(x+y+z)^2 (x^2 y^2 + y^2 z^2 + z^2 x^2)\n ≥ (27/64) ((x+y)^2 (y+z)^2 (z+x)^2\n + (37/27) (x-y)^2 (y-z)^2 (z-x)^2)`.\n\nThis file records the assertion as a `Prop`-valued definition. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The assertion from the problem: for every triple of positive real numbers\n`x`, `y`, and `z`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n (x + y + z) ^ 2 * (x ^ 2 * y ^ 2 + y ^ 2 * z ^ 2 + z ^ 2 * x ^ 2) ≥\n ((27 : ℝ) / 64) *\n ((x + y) ^ 2 * (y + z) ^ 2 * (z + x) ^ 2 +\n ((37 : ℝ) / 27) * (x - y) ^ 2 * (y - z) ^ 2 * (z - x) ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dd16c0bb-facf-5f35-8afa-e254b5fdda00", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1ea15a8128de39518ffbc9923b878a0a22be4a9336f49481814c41657ac3b24d", "task_path": "tasks/nmp3_dd16c0bb-facf-5f35-8afa-e254b5fdda00", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dd16c0bb-facf-5f35-8afa-e254b5fdda00", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dd28a4b7-a85f-5e4c-a611-3ab828ffc1a4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots,a_n$ be integers with $a_i\\le 1$ for all $i$ and $a_1+\\dots+a_n\\ge 1$. A subsequence (i.e., any selection of some of the terms) is called interesting if the sum of its terms equals $1$. For each interesting subsequence of length $k$, write the number $(k-1)!(n-k)!$ on a blackboard. Prove that the sum of all numbers written is $n!$.\nimport Mathlib\n\n/-!\n# Formal statement: weighted enumeration of unit-sum subsequences\n\nThe source problem asks for a proof that, under the stated constraints on a\nfinite integer sequence, the sum of the blackboard weights attached to all index\nselections whose selected terms sum to `1` equals `n!`.\n-/\n\nnamespace Problem\n\n/-- An index set `s` is an interesting subsequence of `a` when the sum of the\nselected terms is exactly `1`. A subsequence is represented by its set of\nselected indices, as specified in the problem by \"any selection of some of the\nterms\"; repetitions are not part of a subsequence. -/\ndef Interesting {n : ℕ} (a : Fin n → ℤ) (s : Finset (Fin n)) : Prop :=\n ∑ i ∈ s, a i = 1\n\n/-- The integer written on the blackboard for an index set `s` of length `k`\nis `(k - 1)! (n - k)!`. -/\ndef blackboardWeight (n : ℕ) (s : Finset (Fin n)) : ℕ :=\n Nat.factorial (s.card - 1) * Nat.factorial (n - s.card)\n\n/-- The finite set of all interesting subsequences of `a`. -/\ndef interestingSubsequences {n : ℕ} (a : Fin n → ℤ) : Finset (Finset (Fin n)) :=\n letI : DecidablePred (Interesting a) := by\n intro s\n unfold Interesting\n infer_instance\n (Finset.univ : Finset (Finset (Fin n))).filter (Interesting a)\n\n/-- The total of all numbers written on the blackboard. It is a sum over\ndistinct index selections; each interesting selection contributes its weight\nonce. -/\ndef blackboardSum {n : ℕ} (a : Fin n → ℤ) : ℕ :=\n ∑ s ∈ interestingSubsequences a, blackboardWeight n s\n\n/-- The complete mathematical assertion of the problem: for every natural\nnumber `n` and every integer sequence `a : Fin n → ℤ` whose terms are all at\nmost `1` and whose total is at least `1`, the weighted sum over all index\nselections whose selected sum is `1` is `n!`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (a : Fin n → ℤ),\n (∀ i : Fin n, a i ≤ 1) →\n (∑ i : Fin n, a i ≥ 1) →\n blackboardSum a = Nat.factorial n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dd28a4b7-a85f-5e4c-a611-3ab828ffc1a4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0555354ac2eed5896406abf4ee0c4350683081dfbe0398139053fc757537c1a5", "task_path": "tasks/nmp3_dd28a4b7-a85f-5e4c-a611-3ab828ffc1a4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dd28a4b7-a85f-5e4c-a611-3ab828ffc1a4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dd91adf0-7d9c-53e4-854e-23b081548ef1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=3$. Prove that\n-- \\[\n-- \\frac{1}{8+a^{2}b}+\\frac{1}{8+b^{2}c}+\\frac{1}{8+c^{2}a}\\ge\\frac13\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion in the source problem: for all positive real numbers `a`, `b`, and `c`\nwhose sum is `3`, the stated cyclic sum of reciprocals is at least `1 / 3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 3 →\n (1 / (8 + a ^ 2 * b) +\n 1 / (8 + b ^ 2 * c) +\n 1 / (8 + c ^ 2 * a) : ℝ) ≥ (1 / 3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dd91adf0-7d9c-53e4-854e-23b081548ef1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "69e58245c525b74b4600c04175b2d7fd4e70e5329b14b8290c1c6dac78dc729c", "task_path": "tasks/nmp3_dd91adf0-7d9c-53e4-854e-23b081548ef1", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dd91adf0-7d9c-53e4-854e-23b081548ef1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dd9bee6e-265f-539e-8f6c-fe766f98dcc1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a convex quadrilateral. Prove that there exists a square $A'B'C'D'$ (the vertices may be ordered clockwise or counter‑clockwise) such that $A\\neq A',\\;B\\neq B',\\;C\\neq C',\\;D\\neq D'$ and the four lines $AA',\\,BB',\\,CC',\\,DD'$ are concurrent.\nimport Mathlib\n\n/-!\n# Formal statement for the square/concurrency quadrilateral problem\n\nThe Euclidean plane is represented by `EuclideanSpace ℝ (Fin 2)`. A point of\nthis type is also used as a vector, which is the usual identification of the\nplane with its translation vector space. All geometric predicates below are\ndefined from coordinates, so no unproved geometric facts are introduced.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane, identified with its two-dimensional real vector space. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The determinant (oriented area form) of two planar vectors. -/\ndef det2 (u v : Point) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- The Euclidean dot product of two planar vectors. -/\ndef dot2 (u v : Point) : ℝ := u 0 * v 0 + u 1 * v 1\n\n/-- The signed orientation of the ordered triple `(A, B, C)`. -/\ndef orient (A B C : Point) : ℝ := det2 (B - A) (C - A)\n\n/-- An ordered quadrilateral `ABCD` is strictly convex when its four vertices\noccur cyclically and every side has the other two vertices strictly on the same\nside. Either cyclic orientation (counter-clockwise or clockwise) is allowed. -/\ndef IsConvexQuadrilateral (A B C D : Point) : Prop :=\n (0 < orient A B C ∧ 0 < orient A B D ∧\n 0 < orient B C A ∧ 0 < orient B C D ∧\n 0 < orient C D A ∧ 0 < orient C D B ∧\n 0 < orient D A B ∧ 0 < orient D A C) ∨\n (orient A B C < 0 ∧ orient A B D < 0 ∧\n orient B C A < 0 ∧ orient B C D < 0 ∧\n orient C D A < 0 ∧ orient C D B < 0 ∧\n orient D A B < 0 ∧ orient D A C < 0)\n\n/-- `IsSquare A B C D` says that, in the displayed cyclic order, `ABCD` is a\nnondegenerate square. The side vectors `u = B - A` and `v = C - B` have equal\nsquared length and are perpendicular. The sign of `det2 u v` is unrestricted,\nso both clockwise and counter-clockwise vertex orders are admitted. -/\ndef IsSquare (A B C D : Point) : Prop :=\n ∃ (u v : Point),\n u ≠ 0 ∧ v ≠ 0 ∧\n dot2 u v = 0 ∧ dot2 u u = dot2 v v ∧\n B = A + u ∧ C = B + v ∧ D = C - u ∧ A = D - v\n\n/-- The full affine line through two planar points. This is the usual line\nwhen the two points are distinct; nondegeneracy is imposed where a line through\ntwo named points is used. -/\ndef LineThrough (X Y : Point) : Set Point :=\n {P : Point | ∃ t : ℝ, P = (1 - t) • X + t • Y}\n\n/-- The four lines `A A'`, `B B'`, `C C'`, and `D D'` are concurrent. -/\ndef Concurrent (A A' B B' C C' D D' : Point) : Prop :=\n ∃ P : Point,\n P ∈ LineThrough A A' ∧\n P ∈ LineThrough B B' ∧\n P ∈ LineThrough C C' ∧ P ∈ LineThrough D D'\n\n/-- The assertion of the problem: every strictly convex quadrilateral `ABCD`\nadmits a square `A'B'C'D'`, in either cyclic orientation, whose corresponding\nvertices differ from those of the quadrilateral and for which\n`AA'`, `BB'`, `CC'`, and `DD'` are concurrent. -/\ndef Target : Prop :=\n ∀ (A B C D : Point),\n IsConvexQuadrilateral A B C D →\n ∃ (A' B' C' D' : Point),\n IsSquare A' B' C' D' ∧\n A ≠ A' ∧ B ≠ B' ∧ C ≠ C' ∧ D ≠ D' ∧\n Concurrent A A' B B' C C' D D'\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dd9bee6e-265f-539e-8f6c-fe766f98dcc1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4279a31321981954efe973ab06595c1c062216814d490f1dabfe73609d20b99a", "task_path": "tasks/nmp3_dd9bee6e-265f-539e-8f6c-fe766f98dcc1", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dd9bee6e-265f-539e-8f6c-fe766f98dcc1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ddc09d5a-985f-5404-be27-913aefa3bcc9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f_1,f_2,\\dots$ be a sequence of non‑increasing functions $f_i:\\mathbb N\\to\\mathbb N$. Prove that there exist indices $i0$ be real numbers such that $ab+bc+ca=3$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{a^{3}}{bc\\,(b+c)^{3}}\\ge\\frac{3}{8}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a cyclic algebraic inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, `c`\nsatisfying `a b + b c + c a = 3`, the cyclic inequality\n`∑_cyc a^3 / (b c (b+c)^3) ≥ 3/8`.\n-/\n\nnamespace Problem\n\n/-- One summand of the cyclic sum:\n`a^3 / (b * c * (b + c)^3)`. -/\nnoncomputable def CyclicTerm (a b c : ℝ) : ℝ :=\n a ^ 3 / (b * c * (b + c) ^ 3)\n\n/-- The cyclic sum over the three cyclic permutations `(a,b,c)`, `(b,c,a)`,\nand `(c,a,b)`. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n CyclicTerm a b c + CyclicTerm b c a + CyclicTerm c a b\n\n/-- The complete assertion of the problem: for all positive real numbers\n`a`, `b`, and `c` with `a * b + b * c + c * a = 3`, the cyclic sum is at\nleast `3/8`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b + b * c + c * a = 3 →\n CyclicSum a b c ≥ (3 : ℝ) / 8\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ddf6461a-2eb0-5cb4-b9f2-992eea8ccc8d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "00a998de3c7de1a978541ed398f8bb475af55d3ade8a3802a5108f9a1e792bf1", "task_path": "tasks/nmp3_ddf6461a-2eb0-5cb4-b9f2-992eea8ccc8d", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ddf6461a-2eb0-5cb4-b9f2-992eea8ccc8d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_de0c378f-502a-57e6-9db0-6ac992dd0b32", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:P(\\mathbb N)\\to\\mathbb N$ be a function. For a subset $A\\subseteq\\mathbb N$, call $f$ *$A$‑predicting* if the set \n-- \\[\n-- \\{\\,x\\in\\mathbb N\\mid x\\notin A\\text{ and }f(A\\cup\\{x\\})\\neq x\\,\\}\n-- \\]\n-- is finite. Prove that there exists a single function $f$ which is $A$‑predicting for **every** $A\\subseteq\\mathbb N$.\nimport Mathlib.Data.Set.Finite.Basic\n\n/-!\n# Formalization of the NMP3 problem\n\nThe problem asks for the existence of a single function\n`f : Set ℕ → ℕ` that is `A`-predicting for every subset `A` of `ℕ`.\n-/\n\nnamespace Problem\n\n/-- A function `f : 𝒫(ℕ) → ℕ` is `A`-predicting when the set of all\n`x : ℕ` with `x ∉ A` and `f (A ∪ {x}) ≠ x` is finite. -/\ndef APredicting (f : Set ℕ → ℕ) (A : Set ℕ) : Prop :=\n Set.Finite {x : ℕ | x ∉ A ∧ f (A ∪ {x}) ≠ x}\n\n/-- There exists one function `f : 𝒫(ℕ) → ℕ` that is `A`-predicting for\nevery subset `A ⊆ ℕ`. -/\ndef Target : Prop :=\n ∃ f : Set ℕ → ℕ, ∀ A : Set ℕ, APredicting f A\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "de0c378f-502a-57e6-9db0-6ac992dd0b32", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2eea6d0017e966947c899a02dd6b0c6bfc9fb23e5bae6946cfca0cc4d3020d00", "task_path": "tasks/nmp3_de0c378f-502a-57e6-9db0-6ac992dd0b32", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "de0c378f-502a-57e6-9db0-6ac992dd0b32", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_de58a480-661e-54de-b5bb-8cddbe1e77d0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A sequence of $100$ real numbers $(a_1,a_2,\\dots,a_{100})$ has the property that for every choice of $8$ distinct terms there exists a choice of $9$ (not necessarily distinct from the first $8$) terms whose average equals the average of those $8$ terms. Prove that all $100$ terms are equal; i.e., the sequence is constant.\nimport Mathlib\n\n/-!\n# Formal statement of the 100-term averaging problem\n\nA sequence of 100 real numbers has the property that, for every choice of\n8 distinct terms, some choice of 9 terms (which may overlap the chosen 8)\nhas the same average as those 8 terms. The statement asserts that such a\nsequence must be constant.\n\nThe original problem speaks of choosing terms of a sequence. We model terms\nby their positions, so a choice of distinct terms is a finite subset of\n`Fin 100` with the prescribed cardinality. The nine chosen terms are modeled\nas a finite subset of cardinality nine: thus they are distinct positions, but\nthere is no condition requiring them to be disjoint from the original eight.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The arithmetic mean of the terms indexed by a finite set of positions. -/\nnoncomputable def average (s : Finset (Fin 100)) (a : Fin 100 → ℝ) : ℝ :=\n (s.sum fun i => a i) / (s.card : ℝ)\n\n/--\n`IsAdmissible a` says that every choice of 8 distinct terms of the sequence\n`a` has the same average as some choice of 9 distinct terms; the latter choice\nis allowed to overlap the chosen 8 terms.\n-/\ndef IsAdmissible (a : Fin 100 → ℝ) : Prop :=\n ∀ s : Finset (Fin 100), s.card = 8 →\n ∃ t : Finset (Fin 100), t.card = 9 ∧ average t a = average s a\n\n/-- A sequence is constant when all of its 100 terms are equal. -/\ndef Constant (a : Fin 100 → ℝ) : Prop :=\n ∀ i j : Fin 100, a i = a j\n\n/--\nThe assertion asked to be proved: every sequence of 100 real numbers with the\nstated averaging property is constant.\n-/\ndef Target : Prop :=\n ∀ a : Fin 100 → ℝ, IsAdmissible a → Constant a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "de58a480-661e-54de-b5bb-8cddbe1e77d0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6442a75a02a33d76d83cdcaeea5e6a85747476da9792745440774a17b74ad3a1", "task_path": "tasks/nmp3_de58a480-661e-54de-b5bb-8cddbe1e77d0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "de58a480-661e-54de-b5bb-8cddbe1e77d0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_de9d927a-67ab-5d05-b65a-f7303601b9c8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\in\\mathbb R^+$ satisfy $x+y+z=xyz$. Prove that \n-- \\[\n-- \\sqrt{x^2+y^2}+\\sqrt{y^2+z^2}+\\sqrt{z^2+x^2}+3\\sqrt6\\le\\sqrt8\\,xyz.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem: for all strictly positive real numbers `x`, `y`, and\n`z` satisfying `x + y + z = x * y * z`, the stated square-root inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x + y + z = x * y * z →\n Real.sqrt (x ^ 2 + y ^ 2) +\n Real.sqrt (y ^ 2 + z ^ 2) +\n Real.sqrt (z ^ 2 + x ^ 2) +\n 3 * Real.sqrt 6 ≤\n Real.sqrt 8 * (x * y * z)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "de9d927a-67ab-5d05-b65a-f7303601b9c8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ed30ddce983f173c9aa98852d423bb484c76bb2569607c7f516c61486c0f084f", "task_path": "tasks/nmp3_de9d927a-67ab-5d05-b65a-f7303601b9c8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "de9d927a-67ab-5d05-b65a-f7303601b9c8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_deecbc98-150e-5d49-be80-ead6f1873ded", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- (a+b+c)^5\\ge 27\\,(ab+bc+ca)\\,(ab^2+bc^2+ca^2)\\,. \n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the three-variable real inequality\n\nThe source problem asks, under the strict positivity assumptions on `a`, `b`, and `c`,\nto prove a single quintic inequality involving the elementary symmetric-type factor\n`ab + bc + ca` and the cyclic factor `ab^2 + bc^2 + ca^2`.\n-/\n\nnamespace Problem\n\n/-- The assertion of the source problem: for all positive real numbers `a`, `b`, `c`,\nwe have\n`(a + b + c)^5 ≥ 27 * (ab + bc + ca) * (ab^2 + bc^2 + ca^2)`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n (a + b + c) ^ 5 ≥\n 27 * (a * b + b * c + c * a) * (a * b ^ 2 + b * c ^ 2 + c * a ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "deecbc98-150e-5d49-be80-ead6f1873ded", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "720d89a87ed1ec13d102f78109b58cbd2dc2a773f13523dfd14c79d06392f3a5", "task_path": "tasks/nmp3_deecbc98-150e-5d49-be80-ead6f1873ded", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "deecbc98-150e-5d49-be80-ead6f1873ded", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_df163060-2155-51c2-ad3f-f2f67631d547", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb R\\to\\mathbb R$ such that \n-- \\[\n-- f\\bigl(f(x)+y\\bigr)=f\\bigl(f(x)-y\\bigr)+4f(x)\\,y\n-- \\qquad\\text{for all real }x,y.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a real-valued functional equation\n\nThe source problem asks for all functions `f : ℝ → ℝ` satisfying\n\n`f (f x + y) = f (f x - y) + 4 * f x * y`\n\nfor every real `x` and `y`.\n\nThis file records the admissibility predicate, a candidate answer, and the\npredicate expressing that a proposed set of functions is the complete answer.\nNo proof of the candidate answer is included; the declarations are statements.\n-/\n\nnamespace Problem\n\n/-- The admissibility predicate for the functional equation in the problem.\n\nThe equation is required to hold for every pair of real numbers `x` and `y`.\nMultiplication in `4 * f x * y` is real multiplication, and all additions and\nsubtractions are real addition and subtraction. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (f x + y) = f (f x - y) + 4 * f x * y\n\n/-- A proposed complete answer set: all functions `x ↦ x ^ 2 + c`, together\nwith the identically zero function. -/\ndef CandidateSolutions : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | (∃ c : ℝ, ∀ x : ℝ, f x = x ^ 2 + c) ∨ (∀ x : ℝ, f x = 0)}\n\n/-- A set `S` of functions is a complete answer exactly when, for every possible\nfunction `f`, membership in `S` is equivalent to satisfying the original\nfunctional equation. Both directions of classification are included: every\nmember of `S` is admissible, and every admissible function belongs to `S`. -/\ndef IsCompleteAnswer (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, f ∈ S ↔ Admissible f\n\n/-- The principal target proposition for the source problem. The displayed body\ngives both directions explicitly: a function belongs to the concrete candidate\nsolution set if and only if it is admissible. This is a proposition to be\nestablished, not a proof of that proposition. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, f ∈ CandidateSolutions ↔ Admissible f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "df163060-2155-51c2-ad3f-f2f67631d547", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "993754494f83d11cbabc20fc28f201c1ae3374444469a3e855877f7ebc2da91a", "task_path": "tasks/nmp3_df163060-2155-51c2-ad3f-f2f67631d547", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "df163060-2155-51c2-ad3f-f2f67631d547", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_df45dc5f-d5f5-53e6-9003-f0146a10ebdd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $ab+bc+ca=1$. Prove that \n-- \\[\n-- \\sqrt{33a^{2}+16}+\\sqrt{33b^{2}+16}+\\sqrt{33c^{2}+16}\\le 9\\,(a+b+c)\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the stated inequality\n\nThe problem asks to prove, for nonnegative real numbers `a`, `b`, and `c`\nsatisfying `a*b + b*c + c*a = 1`, that\n\n`sqrt (33*a^2 + 16) + sqrt (33*b^2 + 16) + sqrt (33*c^2 + 16)\n ≤ 9*(a + b + c)`.\n\nThe declarations below record the admissibility conditions and the target\nproposition. No proof of the target is supplied.\n-/\n\nnamespace Problem\n\n/-- The hypotheses of the problem: all three variables are nonnegative and `ab + bc + ca = 1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + b * c + c * a = 1\n\n/-- The desired inequality, for fixed values of `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n Real.sqrt (33 * a ^ 2 + 16) +\n Real.sqrt (33 * b ^ 2 + 16) +\n Real.sqrt (33 * c ^ 2 + 16) ≤\n 9 * (a + b + c)\n\n/-- The complete statement to be proved: for every real triple satisfying the\nproblem's nonnegativity and normalization hypotheses, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "df45dc5f-d5f5-53e6-9003-f0146a10ebdd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d115754ac6c97cd40156e88be71319eab5b2bc4e5d80626e1e3127ed55ebabc8", "task_path": "tasks/nmp3_df45dc5f-d5f5-53e6-9003-f0146a10ebdd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "df45dc5f-d5f5-53e6-9003-f0146a10ebdd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_df6f6f92-eafa-5291-b2d7-85ff40a3ac8a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 2$ be an integer. Prove that for any real numbers $a_1,a_2,\\dots ,a_n$ satisfying \n-- \\[\n-- a_1^2+a_2^2+\\cdots +a_n^2=n,\n-- \\]\n-- the inequality \n-- \\[\n-- \\sum_{1\\le i (x : ℝ))\n\n/-- The finite set of all nonempty subsets of `A`. -/\ndef nonemptySubsets (A : Finset ℤ) : Finset (Finset ℤ) :=\n A.powerset.filter (fun S : Finset ℤ => S.Nonempty)\n\n/-- The collection of all distinct values of `sigma S` as `S` ranges over the\nnonempty subsets of `A`. -/\ndef distinctSubsetSums (A : Finset ℤ) : Finset ℝ :=\n (nonemptySubsets A).image subsetSum\n\n/-- A nonempty finite class of real-number sums has largest-to-smallest ratio\nat most two. The positivity of the smallest element makes the real ratio\nwell-defined; under the source hypotheses all integers in `A` and hence all\nnonempty subset sums are positive. -/\ndef classRatioAtMostTwo (C : Finset ℝ) : Prop :=\n ∃ hC : C.Nonempty,\n 0 < C.min' hC ∧\n ((C.max' hC : ℝ) / (C.min' hC : ℝ) ≤ (2 : ℝ))\n\n/-- `blocks` is a partition of the finite set `U`: every block is nonempty,\nevery block is contained in `U`, and each element of `U` lies in exactly one\nblock. -/\ndef IsPartitionOf (U : Finset ℝ) (blocks : Finset (Finset ℝ)) : Prop :=\n (∀ C ∈ blocks, C.Nonempty) ∧\n (∀ C ∈ blocks, C ⊆ U) ∧\n (∀ x ∈ U, ∃! C : Finset ℝ, C ∈ blocks ∧ x ∈ C)\n\n/-- `blocks` is a partition of `U` into exactly `n` classes. -/\ndef IsPartitionInto (n : ℕ) (U : Finset ℝ)\n (blocks : Finset (Finset ℝ)) : Prop :=\n blocks.card = n ∧ IsPartitionOf U blocks\n\n/-- Every block in a family of classes satisfies the largest-to-smallest ratio\nbound at most two. -/\ndef BlocksHaveRatioBound (blocks : Finset (Finset ℝ)) : Prop :=\n ∀ C ∈ blocks, classRatioAtMostTwo C\n\n/-- The conclusion of the source problem for a fixed natural number `n` and a\nfinite set `A` of positive integers. -/\ndef HasRequiredPartition (n : ℕ) (A : Finset ℤ) : Prop :=\n ∃ blocks : Finset (Finset ℝ),\n IsPartitionInto n (distinctSubsetSums A) blocks ∧\n BlocksHaveRatioBound blocks\n\n/-- The source problem with its parameters and hypotheses: `A` has cardinality\n`n`, and every element of `A` is positive. -/\ndef Claim (n : ℕ) (A : Finset ℤ) : Prop :=\n (∀ a ∈ A, 0 < a) →\n A.card = n →\n HasRequiredPartition n A\n\n/-- The full formal statement: for every natural number `n` and every finite set\n`A` of positive integers with cardinality `n`, the distinct real sums over\nnonempty subsets of `A` can be partitioned into exactly `n` nonempty classes,\neach with largest-to-smallest real ratio at most two. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (A : Finset ℤ), Claim n A\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dfc3ad24-b849-558d-bd98-e5571b3b7bd1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "97f4bf9db9a01f64b7f6d775303eaf2ff2dbfebd02ff70f7d44e9ead4d381b63", "task_path": "tasks/nmp3_dfc3ad24-b849-558d-bd98-e5571b3b7bd1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dfc3ad24-b849-558d-bd98-e5571b3b7bd1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dfc54b8f-d090-5d93-90c7-5e9551b79d99", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. Prove that the integer $(2^n-1)(3^n-1)$ is never a perfect square.\nimport Mathlib\n\n/-!\nThis file formalizes the statement of the following problem.\n\nLet `n` be a positive integer. Prove that the integer\n`(2^n - 1) * (3^n - 1)` is never a perfect square.\n\nNo proof of the assertion is included: `Problem.Target` is the\nproposition to be proved.\n-/\n\nnamespace Problem\n\n/-- The integer `(2^n - 1) * (3^n - 1)`, with `n` a natural-number exponent. -/\ndef Expression (n : ℕ) : ℤ :=\n ((2 : ℤ) ^ n - 1) * ((3 : ℤ) ^ n - 1)\n\n/-- An integer is a perfect square when it is the square of an integer. -/\ndef IsPerfectSquare (z : ℤ) : Prop :=\n ∃ m : ℤ, z = m ^ 2\n\n/-- The assertion of the problem: for every positive integer `n`, the integer\n`(2^n - 1) * (3^n - 1)` is not a perfect square. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ¬ IsPerfectSquare (Expression n)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dfc54b8f-d090-5d93-90c7-5e9551b79d99", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3c44414ccaa60ea35d7320b55e23195ddcb2131ee846d0d215856725e7296bbd", "task_path": "tasks/nmp3_dfc54b8f-d090-5d93-90c7-5e9551b79d99", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dfc54b8f-d090-5d93-90c7-5e9551b79d99", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dfd91d2c-f7e4-5f90-95d4-f74457317514", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be the side lengths of an acute‑angled triangle and let \\(S\\) denote its area. Prove that \n-- \\[\n-- 4\\sqrt{3}\\,S\\;\\ge\\;4(ab+bc+ca)\\;-\\;3\\bigl(a^{2}+b^{2}+c^{2}\\bigr).\n-- \\]\nimport Mathlib.Geometry.Euclidean.Triangle\nimport Mathlib.Analysis.InnerProductSpace.PiL2\n\n/-!\n# Formal statement of the acute-triangle area inequality\n\nThe problem is about a planar Euclidean triangle whose three interior angles are\nstrictly acute, with side lengths `a`, `b`, `c` and area `S`. We represent a\ntriangle by three points in `EuclideanSpace ℝ (Fin 2)`. Its (unsigned) area is\ncomputed by the usual absolute shoelace/determinant formula.\n-/\n\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The unsigned area of the planar triangle with vertices `x`, `y`, and `z`,\ncomputed as half the absolute value of the determinant of two edge vectors. -/\nnoncomputable def triangleArea (x y z : EuclideanSpace ℝ (Fin 2)) : ℝ :=\n |(y 0 - x 0) * (z 1 - x 1) - (y 1 - x 1) * (z 0 - x 0)| / 2\n\n/-- `IsAcuteTriangleWithArea a b c S` says that there are three points in the\nEuclidean plane whose pairwise distances are `a`, `b`, and `c`, whose three\ninterior angles are all strictly less than `π / 2`, and whose unsigned area is\n`S`. The positive-area condition records that these are the vertices of a\nnondegenerate triangle. -/\ndef IsAcuteTriangleWithArea (a b c S : ℝ) : Prop :=\n ∃ x y z : EuclideanSpace ℝ (Fin 2),\n a = dist x y ∧\n b = dist y z ∧\n c = dist z x ∧\n ∠ x y z < Real.pi / 2 ∧\n ∠ y z x < Real.pi / 2 ∧\n ∠ z x y < Real.pi / 2 ∧\n 0 < triangleArea x y z ∧\n S = triangleArea x y z\n\n/-- The assertion to be proved: for every acute planar triangle with side\nlengths `a`, `b`, `c` and area `S`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c S : ℝ,\n IsAcuteTriangleWithArea a b c S →\n 4 * Real.sqrt 3 * S ≥\n 4 * (a * b + b * c + c * a) - 3 * (a ^ 2 + b ^ 2 + c ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dfd91d2c-f7e4-5f90-95d4-f74457317514", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a34ab5730bda90729754606181caee4c5e41509a29f4c762c9316139f8720093", "task_path": "tasks/nmp3_dfd91d2c-f7e4-5f90-95d4-f74457317514", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dfd91d2c-f7e4-5f90-95d4-f74457317514", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dfecb02e-15bf-5b4e-af04-72dc1ca60a01", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $B$ be a point on a circle $S_1$, and let $A\\neq B$ be a point on the tangent to $S_1$ at $B$. Let $C$ be a point not on $S_1$ such that the segment $AC$ meets $S_1$ at two distinct points. Let $S_2$ be the circle tangent to $AC$ at $C$ and tangent to $S_1$ at a point $D$ that lies on the opposite side of $AC$ from $B$. Prove that the circumcenter of $\\triangle BCD$ lies on the circumcircle of $\\triangle ABC$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Sphere.Basic\n\n/-!\n# Formalization of the tangency/circumcenter geometry statement\n\nThe ambient space is the Euclidean plane `ℝ²`, represented as\n`EuclideanSpace ℝ (Fin 2)`. Circles are `EuclideanGeometry.Sphere`s with\npositive radius. The statement itself is the predicate `Problem.Target`.\n-/\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the formalization. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The oriented two-dimensional cross product (determinant) of two vectors. -/\ndef cross (u v : Plane) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- Twice the oriented area of the triangle `(A,B,C)`. It is zero exactly for\ncollinear `A`, `B`, `C`. -/\ndef orientedArea (A B C : Plane) : ℝ := cross (B - A) (C - A)\n\n/-- Three planar points are noncollinear. -/\ndef Noncollinear (A B C : Plane) : Prop := orientedArea A B C ≠ 0\n\n/-- A point lies on the closed segment with endpoints `A` and `C`. -/\ndef OnSegment (A C P : Plane) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ P = (1 - t) • A + t • C\n\n/-- A sphere of positive radius, i.e. a genuine circle in the plane. -/\ndef IsCircle (S : EuclideanGeometry.Sphere Plane) : Prop := 0 < S.radius\n\n/-- The line through `X` and `Y` is tangent to the circle `S` at `Y`: `X ≠ Y`,\n`Y` lies on `S`, and every point of that line which also lies on `S` is `Y`.\nEquivalently, the intersection of the line and the circle is the single point\n`Y`. -/\ndef LineTangentToCircleAt\n (S : EuclideanGeometry.Sphere Plane) (X Y : Plane) : Prop :=\n X ≠ Y ∧ Y ∈ S ∧\n ∀ Z : Plane, orientedArea X Y Z = 0 → Z ∈ S → Z = Y\n\n/-- Two circles are tangent at `D`: they meet at `D` and have no other common\npoint. This formulation covers both internal and external tangency. -/\ndef CirclesTangentAt\n (S₁ S₂ : EuclideanGeometry.Sphere Plane) (D : Plane) : Prop :=\n D ∈ S₁ ∧ D ∈ S₂ ∧ ∀ Z : Plane, Z ∈ S₁ → Z ∈ S₂ → Z = D\n\n/-- The closed segment `AC` meets the circle `S` in at least two distinct\npoints. A line meets a circle in at most two points, so this is the stated\ntwo-point intersection condition. -/\ndef SegmentMeetsCircleInTwoDistinctPoints\n (S : EuclideanGeometry.Sphere Plane) (A C : Plane) : Prop :=\n ∃ P Q : Plane,\n P ≠ Q ∧ OnSegment A C P ∧ OnSegment A C Q ∧ P ∈ S ∧ Q ∈ S\n\n/-- `B` and `D` lie in the two open half-planes determined by the line `AC`.\nThe condition is strict, so neither point lies on the line `AC`. -/\ndef StrictlyOppositeSidesOfLine (A C B D : Plane) : Prop :=\n orientedArea A C B * orientedArea A C D < 0\n\n/-- A circle of positive radius with center `O` passing through the noncollinear\npoints `A`, `B`, and `C`, i.e. the circumcircle of triangle `ABC`. -/\ndef IsCircumcircle\n (O : Plane) (r : ℝ) (A B C : Plane) : Prop :=\n Noncollinear A B C ∧ 0 < r ∧ dist O A = r ∧ dist O B = r ∧ dist O C = r\n\n/-- `O` is a circumcenter of triangle `A B C`: it is the center of a positive\nradius circle through all three vertices. -/\ndef IsCircumcenter (O A B C : Plane) : Prop :=\n ∃ r : ℝ, IsCircumcircle O r A B C\n\n/-- `O` is *the* circumcenter of triangle `A B C`, including uniqueness among\nall centers of positive-radius circles through the three vertices. -/\ndef IsTheCircumcenter (O A B C : Plane) : Prop :=\n IsCircumcenter O A B C ∧\n ∀ O' : Plane, IsCircumcenter O' A B C → O' = O\n\n/-- `(O, r)` is *the* circumcircle of triangle `A B C`, including uniqueness\nof the center and radius among all positive-radius circles through the three\nvertices. -/\ndef IsTheCircumcircle (O : Plane) (r : ℝ) (A B C : Plane) : Prop :=\n IsCircumcircle O r A B C ∧\n ∀ (O' : Plane) (r' : ℝ), IsCircumcircle O' r' A B C → O' = O ∧ r' = r\n\n/-- The point `X` lies on the circumcircle of triangle `A B C`. -/\ndef OnCircumcircleOf (X A B C : Plane) : Prop :=\n ∃ O : Plane, ∃ r : ℝ, IsTheCircumcircle O r A B C ∧ dist O X = r\n\n/-- The conclusion of the problem: the circumcenter of `B C D` lies on the\ncircumcircle of `A B C`. Both definite descriptions are encoded by their\nexistence and uniqueness conditions. -/\ndef CircumcenterLiesOnCircumcircleOf (A B C D : Plane) : Prop :=\n ∃ O : Plane,\n IsTheCircumcenter O B C D ∧ OnCircumcircleOf O A B C\n\n/-- The complete formal statement of the problem. -/\ndef Target : Prop :=\n ∀ (S₁ : EuclideanGeometry.Sphere Plane) (B : Plane) (A : Plane) (C : Plane)\n (S₂ : EuclideanGeometry.Sphere Plane) (D : Plane),\n IsCircle S₁ →\n B ∈ S₁ →\n A ≠ B →\n LineTangentToCircleAt S₁ A B →\n C ∉ S₁ →\n SegmentMeetsCircleInTwoDistinctPoints S₁ A C →\n IsCircle S₂ →\n C ∈ S₂ →\n LineTangentToCircleAt S₂ A C →\n CirclesTangentAt S₁ S₂ D →\n StrictlyOppositeSidesOfLine A C B D →\n CircumcenterLiesOnCircumcircleOf A B C D\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dfecb02e-15bf-5b4e-af04-72dc1ca60a01", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f53a88b4a634cc8b324b11d07e687cfb72b98c753511d1689696c11b9f087032", "task_path": "tasks/nmp3_dfecb02e-15bf-5b4e-af04-72dc1ca60a01", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dfecb02e-15bf-5b4e-af04-72dc1ca60a01", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_dff78cc9-9f14-5420-b47d-198f18487c85", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 3$ be an integer. Prove that for every integer $k$ with $1\\le k\\le \\binom{n}{2}$ there exists a set $A$ of $n$ distinct positive integers such that the set \n-- $$B=\\{\\gcd(x,y):x,y\\in A,\\;x\\neq y\\}$$ \n-- contains exactly $k$ distinct elements.\nimport Mathlib\n\nnamespace Problem\n\n/-- The set `B` from the problem, for a finite set A of natural numbers:\nthe set of all gcds of two distinct elements of A. -/\ndef pairGcdSet (A : Finset ℕ) : Finset ℕ :=\n ((A.product A).filter (fun p : ℕ × ℕ => p.1 ≠ p.2)).image\n (fun p : ℕ × ℕ => Nat.gcd p.1 p.2)\n\n/-- A finite set A is an admissible choice for the pair (n, k) when A has\nexactly n positive elements, with the elements of A regarded as distinct\nbecause A is a finset, and the set of pairwise gcds has exactly k elements. -/\ndef Admissible (n k : ℕ) (A : Finset ℕ) : Prop :=\n (∀ x : ℕ, x ∈ A → 0 < x) ∧\n A.card = n ∧\n (pairGcdSet A).card = k\n\n/-- The assertion of the problem: for every natural number n at least 3 and\nevery natural number k between 1 and the binomial coefficient n choose 2,\nthere is a finite set of n positive integers whose set of pairwise gcds has\nexactly k elements. -/\ndef Target : Prop :=\n ∀ n : ℕ, 3 ≤ n →\n ∀ k : ℕ, 1 ≤ k → k ≤ Nat.choose n 2 →\n ∃ A : Finset ℕ, Admissible n k A\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dff78cc9-9f14-5420-b47d-198f18487c85", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "37de4062f24db7b8f15ce583bc11d0c20faaaf247b5c2a2db082bf67deb863bc", "task_path": "tasks/nmp3_dff78cc9-9f14-5420-b47d-198f18487c85", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "dff78cc9-9f14-5420-b47d-198f18487c85", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e0684707-0531-5a8a-825b-2dd0314833ad", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle with side lengths $a=BC$, $b=CA$, $c=AB$ and let $G$ be its centroid. Prove that for any point $P$ in the plane of the triangle \n-- \\[\n-- a\\,PA^{3}+b\\,PB^{3}+c\\,PC^{3}\\ge 3abc\\,PG.\n-- \\]\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\n/-!\nFormalization of the statement:\n\nLet `ABC` be a triangle with side lengths `a = BC`, `b = CA`, `c = AB`\nand centroid `G`. Prove that for every point `P` in the plane of the\ntriangle,\n`a * PA^3 + b * PB^3 + c * PC^3 ≥ 3 * a * b * c * PG`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real two-dimensional Euclidean space. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The three points `A`, `B`, `C` form a (nondegenerate) triangle exactly when\nthey are not collinear. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- The centroid of a triangle with vertices `A`, `B`, `C`, expressed using an\norigin and the affine average of the position vectors. -/\ndef centroid (A B C : Plane) : Plane :=\n (1 / 3 : ℝ) • (A + B + C)\n\n/-- The side length `a = BC`. -/\ndef sideA (B C : Plane) : ℝ :=\n dist B C\n\n/-- The side length `b = CA`. -/\ndef sideB (C A : Plane) : ℝ :=\n dist C A\n\n/-- The side length `c = AB`. -/\ndef sideC (A B : Plane) : ℝ :=\n dist A B\n\n/-- The left-hand side of the claimed inequality. -/\ndef weightedCubicDistances (A B C P : Plane) : ℝ :=\n sideA B C * dist P A ^ 3 + sideB C A * dist P B ^ 3 +\n sideC A B * dist P C ^ 3\n\n/-- The right-hand side length factor `3abc` of the claimed inequality. -/\ndef threeTimesProductOfSides (A B C : Plane) : ℝ :=\n 3 * sideA B C * sideB C A * sideC A B\n\n/-- The right-hand side of the claimed inequality. -/\ndef centroidDistanceTerm (A B C P : Plane) : ℝ :=\n threeTimesProductOfSides A B C * dist P (centroid A B C)\n\n/-- The assertion of the problem: for every nondegenerate triangle `ABC` and\nevery point `P` in its plane,\n`a * PA^3 + b * PB^3 + c * PC^3 ≥ 3 * a * b * c * PG`,\nwhere `G` is the centroid of `ABC`. -/\ndef Target : Prop :=\n ∀ A B C : Plane,\n IsTriangle A B C →\n ∀ P : Plane,\n weightedCubicDistances A B C P ≥ centroidDistanceTerm A B C P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0684707-0531-5a8a-825b-2dd0314833ad", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ab737a7c9ab3e9c91cb1323648d9a7ff99bf0525a8e83cfc4f7191db7c089b22", "task_path": "tasks/nmp3_e0684707-0531-5a8a-825b-2dd0314833ad", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0684707-0531-5a8a-825b-2dd0314833ad", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e08d7617-9ce4-58f1-a162-5b55a3832169", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $x,y,z\\ge0$ such that $x^{2}+y^{2}+z^{2}=1$, prove that \n-- \\[\n-- \\Bigl(x^{2}y+y^{2}z+z^{2}x\\Bigr)\\Bigl(\\frac{1}{\\sqrt{1+x^{2}}}+\\frac{1}{\\sqrt{1+y^{2}}}+\\frac{1}{\\sqrt{1+z^{2}}}\\Bigr)\\le\\frac{3}{2}\\,. \n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\n/-!\n# Formal statement for the nonnegative-variable inequality\n\nThis file states, without proving it, the inequality in `problem.md`.\nAll variables are real numbers. `Real.sqrt` is Mathlib's principal\nnonnegative square root, and all division and powers below are real\noperations.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n (x ^ 2 * y + y ^ 2 * z + z ^ 2 * x) *\n (1 / Real.sqrt (1 + x ^ 2) +\n 1 / Real.sqrt (1 + y ^ 2) +\n 1 / Real.sqrt (1 + z ^ 2))\n\n/--\nThe assertion to be proved: for all nonnegative real numbers `x`, `y`, and `z`\nsatisfying `x ^ 2 + y ^ 2 + z ^ 2 = 1`, the expression\n`(x ^ 2 * y + y ^ 2 * z + z ^ 2 * x)` times the sum of the three reciprocal\nsquare roots is at most `3 / 2`.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 ≤ x →\n 0 ≤ y →\n 0 ≤ z →\n x ^ 2 + y ^ 2 + z ^ 2 = 1 →\n lhs x y z ≤ (3 / 2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e08d7617-9ce4-58f1-a162-5b55a3832169", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c324beb02ef4ff31194eb00fb59a44506e0ea0bbb263a3e9db8f04034075f1e9", "task_path": "tasks/nmp3_e08d7617-9ce4-58f1-a162-5b55a3832169", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e08d7617-9ce4-58f1-a162-5b55a3832169", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e0949f5f-b894-5ffe-b60b-338defe0ed36", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $M$ and $N$ be the midpoints of the sides $AB$ and $AC$ of an acute‑angled triangle $ABC$. Let $P$ be the foot of the perpendicular from $N$ onto $BC$, and let $A_1$ be the midpoint of $MP$. Define $B_1$ and $C_1$ analogously (cyclically) by using the midpoints of the other sides and the corresponding feet of perpendiculars onto the opposite side. If the three lines $AA_1$, $BB_1$, $CC_1$ are concurrent, prove that triangle $ABC$ is isosceles.\n/-\nFormal statement of the geometry problem.\n\nThe ambient Euclidean plane is represented by `EuclideanSpace ℝ (Fin 2)`. All\nconstructions are total functions on points; on the nondegenerate triangles to which the\ntarget applies, the formulae are the usual midpoint and orthogonal-projection formulae.\n\nNo proof of the target proposition is supplied here: `Problem.Target` is a proposition-valued\ndefinition, as required for statement formalization.\n-/\n\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Basic\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the formalization. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The midpoint of the segment joining `X` and `Y`. -/\nnoncomputable def segmentMidpoint (X Y : Point) : Point :=\n midpoint ℝ X Y\n\n/-- The orthogonal projection (foot of the perpendicular) of `Z` onto the line through\n`X` and `Y`. This is the usual affine projection formula. -/\nnoncomputable def foot (X Y Z : Point) : Point :=\n X + (inner ℝ (Z - X) (Y - X) / inner ℝ (Y - X) (Y - X)) • (Y - X)\n\n/-- The point `M`, the midpoint of the side `XY`. For the original triangle it is the\nmidpoint of `AB`, i.e. `M A B`. -/\nnoncomputable def M (X Y : Point) : Point :=\n segmentMidpoint X Y\n\n/-- The point `N`, the midpoint of the side `XZ`. For the original triangle it is the\nmidpoint of `AC`, i.e. `N A C`. -/\nnoncomputable def N (X Z : Point) : Point :=\n segmentMidpoint X Z\n\n/-- The foot `P` associated with the cyclic ordered triple `(X,Y,Z)`: it is the foot of the\nperpendicular from the midpoint of `XZ` to the line through `Y` and `Z`. For the original\ntriangle this is the foot from `N A C` onto the line `BC`, i.e. `P A B C`. -/\nnoncomputable def P (X Y Z : Point) : Point :=\n foot Y Z (N X Z)\n\n/-- The point `A₁`: the midpoint of `M A B` and `P A B C`. -/\nnoncomputable def A1 (A B C : Point) : Point :=\n segmentMidpoint (M A B) (P A B C)\n\n/-- The point `B₁`, obtained by the cyclic replacement `(A,B,C) ↦ (B,C,A)`. -/\nnoncomputable def B1 (A B C : Point) : Point :=\n segmentMidpoint (M B C) (P B C A)\n\n/-- The point `C₁`, obtained by the cyclic replacement `(A,B,C) ↦ (C,A,B)`. -/\nnoncomputable def C1 (A B C : Point) : Point :=\n segmentMidpoint (M C A) (P C A B)\n\n/-- The triangle with vertices `A`, `B`, and `C` is acute-angled: the angle at each vertex\nis strictly less than a right angle. In terms of the Euclidean inner product this says\nthat the two side vectors emanating from each vertex have positive inner product. -/\ndef AcuteTriangle (A B C : Point) : Prop :=\n inner ℝ (B - A) (C - A) > 0 ∧\n inner ℝ (C - B) (A - B) > 0 ∧\n inner ℝ (A - C) (B - C) > 0\n\n/-- The triangle with vertices `A`, `B`, and `C` is isosceles, in the usual inclusive\nsense: at least two of its three side lengths are equal. -/\ndef IsoscelesTriangle (A B C : Point) : Prop :=\n dist A B = dist A C ∨\n dist A B = dist B C ∨\n dist A C = dist B C\n\n/-- The affine line through two points, represented as a set of points. If the two points\ncoincide this is the singleton containing that point, rather than a nondegenerate line. -/\ndef lineThrough (X Y : Point) : Set Point :=\n {Z : Point | ∃ t : ℝ, Z = X + t • (Y - X)}\n\n/-- The three lines `AA₁`, `BB₁`, and `CC₁` are concurrent: there exists a point lying on\neach of the three affine lines. -/\nnoncomputable def LinesConcurrent (A B C : Point) : Prop :=\n ∃ X : Point,\n X ∈ lineThrough A (A1 A B C) ∧\n X ∈ lineThrough B (B1 A B C) ∧\n X ∈ lineThrough C (C1 A B C)\n\n/-- The complete statement of the problem: for every acute-angled triangle `ABC`, if the\nthree constructed lines `AA₁`, `BB₁`, and `CC₁` are concurrent, then the triangle is\nisosceles. -/\nnoncomputable def Target : Prop :=\n ∀ A B C : Point,\n AcuteTriangle A B C →\n LinesConcurrent A B C →\n IsoscelesTriangle A B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0949f5f-b894-5ffe-b60b-338defe0ed36", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4af2f1c7db12877d3732a57498d6a47225ab4c0d136a23d4ae9e1ff8735af46a", "task_path": "tasks/nmp3_e0949f5f-b894-5ffe-b60b-338defe0ed36", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0949f5f-b894-5ffe-b60b-338defe0ed36", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e0a59286-b9b9-52b3-acc2-4e050038d2cf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ and $a+b+c=1$. Prove that \n-- \\[\n-- \\sqrt{a+b^{2}}+\\sqrt{b+c^{2}}+\\sqrt{c+a^{2}}\\ge2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-square-root inequality\n\nThe source problem asks, for real numbers `a`, `b`, and `c` which are all\nnonnegative and satisfy `a + b + c = 1`, to prove\n`sqrt (a + b^2) + sqrt (b + c^2) + sqrt (c + a^2) >= 2`.\n\nThe declaration below records the proposition to be proved. It does not\nprovide a proof.\n-/\n\nnamespace Problem\n\n/-- The proposition from the source problem: for all real `a`, `b`, and `c`\nwith `0 ≤ a`, `0 ≤ b`, `0 ≤ c`, and `a + b + c = 1`, the sum of the three\nreal square roots is at least `2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c → a + b + c = 1 →\n 2 ≤ Real.sqrt (a + b ^ 2) + Real.sqrt (b + c ^ 2) +\n Real.sqrt (c + a ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0a59286-b9b9-52b3-acc2-4e050038d2cf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "905642ba6d7b0ddf93b07732ce6972115e3420379d32d69e359914954dc9184b", "task_path": "tasks/nmp3_e0a59286-b9b9-52b3-acc2-4e050038d2cf", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0a59286-b9b9-52b3-acc2-4e050038d2cf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e0a7650a-98be-5531-a5cf-2249cac81209", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 100 people from 50 different countries, exactly two people per country, are seated around a circle. Prove that the people can be partitioned into two groups (i.e., colored with two colors) so that\n-- \n-- * no two people from the same country belong to the same group, and \n-- * no three consecutive seats on the circle are occupied by people from the same group.\nimport Mathlib\n\n/-!\n# Two-coloring a circular seating of paired nationalities\n\nThis file formalizes the statement of the following problem:\n\n100 people from 50 different countries, exactly two people per country, are\nseated around a circle. Prove that the people can be partitioned into two\ngroups so that people from the same country are in different groups and no\nthree consecutive seats around the circle have one group.\n\nThe people are represented by their seats, indexed by `Fin 100`. A country is\nrepresented by an element of `Fin 50`, and a seating is the function assigning\na country to each seat. A two-group partition is represented by a function\nfrom seats to `Bool`.\n-/\n\nnamespace Problem\n\n/-- The 100 seats, indexed cyclically around the circular table. -/\nabbrev Seat : Type := Fin 100\n\n/-- The 50 different countries. -/\nabbrev Country : Type := Fin 50\n\n/-- A seating records the country of the person occupying each seat. -/\nabbrev Seating : Type := Seat → Country\n\n/-- The next seat in cyclic order. Since `Seat = Fin 100`, adding one is\naddition modulo 100, so this wraps from seat 99 back to seat 0. -/\ndef NextSeat (seat : Seat) : Seat :=\n seat + (1 : Seat)\n\n/-- Every country is represented by exactly two of the 100 seated people. -/\ndef ExactlyTwoPerCountry (seating : Seating) : Prop :=\n ∀ country : Country,\n (Finset.univ.filter (fun seat : Seat => seating seat = country)).card = 2\n\n/-- The two people from each country are placed in different color classes. -/\ndef SameCountryDifferentGroups (seating : Seating) (color : Seat → Bool) : Prop :=\n ∀ seat1 seat2 : Seat,\n seat1 ≠ seat2 →\n seating seat1 = seating seat2 →\n color seat1 ≠ color seat2\n\n/-- No cyclic block of three consecutive seats is monochromatic. -/\ndef NoThreeConsecutiveSameGroup (color : Seat → Bool) : Prop :=\n ∀ start : Seat,\n ¬ (color start = color (NextSeat start) ∧\n color (NextSeat start) = color (NextSeat (NextSeat start)))\n\n/-- A coloring is admissible for a seating when it separates the two people\nfrom every country and has no monochromatic cyclic run of three seats. -/\ndef AdmissibleColoring (seating : Seating) (color : Seat → Bool) : Prop :=\n SameCountryDifferentGroups seating color ∧\n NoThreeConsecutiveSameGroup color\n\n/-- The asserted consequence: every seating with exactly two people per country\nadmits a two-coloring satisfying both required conditions. -/\ndef Target : Prop :=\n ∀ seating : Seating,\n ExactlyTwoPerCountry seating →\n ∃ color : Seat → Bool, AdmissibleColoring seating color\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0a7650a-98be-5531-a5cf-2249cac81209", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8b3ddca570658c1f5eb650d06fe8aacb28d82aadb192889875b96464e2e13772", "task_path": "tasks/nmp3_e0a7650a-98be-5531-a5cf-2249cac81209", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0a7650a-98be-5531-a5cf-2249cac81209", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e0c0f1f4-ced1-5b7f-9f4d-c77499d3f037", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- $$a^2+b^2+c^2+4\\Big(\\frac1{a+b}+\\frac1{b+c}+\\frac1{c+a}\\Big)\\ge \n-- ab+bc+ca+4\\Big(\\frac{ab(c^2+ab)}{(a+b)^2}+\\frac{bc(a^2+bc)}{(b+c)^2}+\\frac{ca(b^2+ca)}{(c+a)^2}\\Big).$$\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe problem asks to prove, for positive real numbers `a`, `b`, and `c` whose\nproduct is `1`, the inequality stated below. This file only records the\nproposition; it deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 2 + b ^ 2 + c ^ 2 +\n 4 * (1 / (a + b) + 1 / (b + c) + 1 / (c + a))\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n a * b + b * c + c * a +\n 4 * (a * b * (c ^ 2 + a * b) / (a + b) ^ 2 +\n b * c * (a ^ 2 + b * c) / (b + c) ^ 2 +\n c * a * (b ^ 2 + c * a) / (c + a) ^ 2)\n\n/-- The complete proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a * b * c = 1 →\n lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0c0f1f4-ced1-5b7f-9f4d-c77499d3f037", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "572d5e82c34122df4eb2bcd58eb204f19c8629d1f0f4bf498c075416ef7d8019", "task_path": "tasks/nmp3_e0c0f1f4-ced1-5b7f-9f4d-c77499d3f037", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0c0f1f4-ced1-5b7f-9f4d-c77499d3f037", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e0c2a59f-9b6c-5eef-9b90-a4d7b9955f25", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A family of sets F is called perfect if for every triple of sets X₁, X₂, X₃ ∈ F, at least one of the sets $(X₁\\setminus X₂)\\cap X₃$ or $(X₂\\setminus X₁)\\cap X₃$ is empty. Prove that if F is a perfect family consisting of subsets of a finite set U, then \n-- \\[\n-- |F|\\le |U|+1.\n-- \\]\nimport Mathlib.Data.Set.Card\n\n/-!\n# Perfect families of finite subsets\n\nThis file formalizes the statement of the problem. A family is represented as\na set of subsets of a fixed ambient type, and cardinalities of sets are expressed\nwith `Set.ncard`.\n-/\n\nnamespace Problem\n\nuniverse u\n\n/-- A family of sets is *perfect* when, for every ordered triple of members\n`X₁`, `X₂`, `X₃`, at least one of the two sets\n`(X₁ \\ X₂) ∩ X₃` and `(X₂ \\ X₁) ∩ X₃` is empty. -/\ndef IsPerfectFamily {α : Type u} (F : Set (Set α)) : Prop :=\n ∀ X₁ ∈ F, ∀ X₂ ∈ F, ∀ X₃ ∈ F,\n (X₁ \\ X₂) ∩ X₃ = ∅ ∨ (X₂ \\ X₁) ∩ X₃ = ∅\n\n/-- Every member of the family `F` is a subset of the ambient type `U`. -/\ndef FamilySubsetsOf {α : Type u} (F : Set (Set α)) (U : Set α) : Prop :=\n ∀ X ∈ F, X ⊆ U\n\n/-- The assertion of the problem: every perfect family of subsets of a finite\nset `U` has cardinality at most `|U| + 1`. The quantifier over `α` fixes the\nambient universe in which all sets live. -/\nnoncomputable def Target : Prop :=\n ∀ (α : Type u) (U : Set α) (F : Set (Set α)),\n U.Finite →\n FamilySubsetsOf F U →\n IsPerfectFamily F →\n F.ncard ≤ U.ncard + 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0c2a59f-9b6c-5eef-9b90-a4d7b9955f25", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c699bbb1611443ab356a6034f0f79b8a358349eb2b5f2f18447bf63c3f419b74", "task_path": "tasks/nmp3_e0c2a59f-9b6c-5eef-9b90-a4d7b9955f25", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0c2a59f-9b6c-5eef-9b90-a4d7b9955f25", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e0f4342e-797e-50b7-a39b-1f31ab9a34d4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c,d\\) be real numbers such that \n-- \\(a\\ge 0,\\qquad a+b\\ge 0,\\qquad 3a(a+b)\\ge (|c|+|d|)^2.\\) \n-- \n-- Prove that for all real numbers \\(x,y,z\\) the inequality \n-- \n-- \\[\n-- a(x^4+y^4+z^4)+b(x^2y^2+y^2z^2+z^2x^2)+c(x^3y+y^3z+z^3x)+d(xy^3+yz^3+zx^3)\n-- -\\,(a+b+c+d)\\,xyz(x+y+z)\\ge 0\n-- \\]\n-- \n-- holds.\nimport Mathlib\n\n/-!\n# Formal statement of the four-parameter real quartic inequality\n\nThe source problem asks for a proof of a universally quantified inequality under\nthree parameter hypotheses. The declarations below record the exact statement;\nthey do not contain a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the quartic inequality, normalized to have all terms on\nthe left. All parameters and variables are real numbers. -/\ndef lhs (a b c d x y z : ℝ) : ℝ :=\n a * (x ^ 4 + y ^ 4 + z ^ 4)\n + b * (x ^ 2 * y ^ 2 + y ^ 2 * z ^ 2 + z ^ 2 * x ^ 2)\n + c * (x ^ 3 * y + y ^ 3 * z + z ^ 3 * x)\n + d * (x * y ^ 3 + y * z ^ 3 + z * x ^ 3)\n - (a + b + c + d) * x * y * z * (x + y + z)\n\n/-- The three admissibility conditions imposed on the real parameters\n`a`, `b`, `c`, and `d`. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ a + b ∧ (|c| + |d|) ^ 2 ≤ 3 * a * (a + b)\n\n/-- The asserted universally quantified inequality for fixed admissible\nparameters. -/\ndef Conclusion (a b c d : ℝ) : Prop :=\n ∀ x y z : ℝ, 0 ≤ lhs a b c d x y z\n\n/-- The complete statement of the problem: for every quadruple of real numbers\nsatisfying the admissibility hypotheses, the quartic expression is nonnegative\nfor all real `x`, `y`, and `z`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Conclusion a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0f4342e-797e-50b7-a39b-1f31ab9a34d4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "417c7b478fcb7225639b741f1d7e740684125b6abae207885a28ae4337ad4538", "task_path": "tasks/nmp3_e0f4342e-797e-50b7-a39b-1f31ab9a34d4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e0f4342e-797e-50b7-a39b-1f31ab9a34d4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e13326b0-ee31-5ddc-ac94-1f90ad12964f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In the plane a set of $n\\ge 3$ points is given. Every pair of points is joined by a segment. Let $d$ be the length of the longest of these segments. A *diameter* of the set is any segment joining two points whose length equals $d$. Prove that the number of diameters of the given set is at most $n$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Data.Finset.Powerset\n\n/-!\n# Diameters of a finite planar point set\n\nThis file formalizes the statement of the following problem.\n\nIn the plane a set of `n ≥ 3` points is given. Every pair of points is joined\nby a segment. Let `d` be the length of the longest of these segments. A\ndiameter is any segment joining two points whose length equals `d`. Prove that\nthe number of diameters of the given set is at most `n`.\n\nThe declarations below only state the mathematical assertion. No proof is\nprovided.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real inner-product space of\ndimension two. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The length of the segment joining two points in the plane. -/\nnoncomputable def segmentLength (x y : Plane) : ℝ := dist x y\n\n/-- `IsLongestSegmentLength P d` says that `d` is attained by a segment whose\nendpoints are two distinct points of `P`, and no segment between two distinct\npoints of `P` is longer than `d`. -/\ndef IsLongestSegmentLength (P : Finset Plane) (d : ℝ) : Prop :=\n (∃ x ∈ P, ∃ y ∈ P, x ≠ y ∧ segmentLength x y = d) ∧\n ∀ x ∈ P, ∀ y ∈ P, x ≠ y → segmentLength x y ≤ d\n\n/-- A two-element subset `s` of the given finite point set is a diameter\nsegment for the longest length `d` precisely when the two distinct points in\n`s` are at distance `d`. -/\ndef IsDiameterSegment (P : Finset Plane) (d : ℝ) (s : Finset Plane) : Prop :=\n s ∈ P.powersetCard 2 ∧\n ∀ x ∈ s, ∀ y ∈ s, x ≠ y → segmentLength x y = d\n\n/-- The finite set of all diameter segments of `P`, where a segment is\nrepresented by its unordered set of two endpoints. -/\nnoncomputable def diameterSegments (P : Finset Plane) (d : ℝ) :\n Finset (Finset Plane) := by\n classical\n exact (P.powersetCard 2).filter fun s => IsDiameterSegment P d s\n\n/-- The number of diameter segments of `P`. -/\nnoncomputable def diameterCount (P : Finset Plane) (d : ℝ) : ℕ :=\n (diameterSegments P d).card\n\n/-- The complete formal statement of the problem: for every finite set `P` of\n`n ≥ 3` distinct points in the Euclidean plane, and every `d` that is the\nlength of a longest segment between points of `P`, the number of diameter\nsegments of `P` is at most `n`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (P : Finset Plane) (d : ℝ),\n 3 ≤ n → P.card = n → IsLongestSegmentLength P d → diameterCount P d ≤ n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e13326b0-ee31-5ddc-ac94-1f90ad12964f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b6f7dfba3b1a7b8af541b95c82ee20a87cb4c3fc21f7cf05c566355f321a0f29", "task_path": "tasks/nmp3_e13326b0-ee31-5ddc-ac94-1f90ad12964f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e13326b0-ee31-5ddc-ac94-1f90ad12964f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e1447d1a-c8c5-5856-b916-49de07dcf29b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^{2}+b^{2}+c^{2}=3$. Prove that \n-- \\[\n-- \\frac{a}{b(a+c)}+\\frac{b}{c(b+a)}+\\frac{c}{a(c+b)}\\ge\\frac32\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the inequality problem\n\nThe original problem asks to prove, for positive real numbers `a b c` whose\nsquares sum to `3`, the stated cyclic rational inequality.\n-/\n\nnamespace Problem\n\n/-- The hypotheses of the problem: `a`, `b`, and `c` are positive and their\nsquares sum to `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 2 + b ^ 2 + c ^ 2 = (3 : ℝ)\n\n/-- The left-hand side of the asserted inequality. The parentheses in the\ndenominators are kept explicit, matching the original expression. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a / (b * (a + c)) + b / (c * (b + a)) + c / (a * (c + b))\n\n/-- The asserted inequality, before imposing the admissibility hypotheses. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ (3 : ℝ) / 2\n\n/-- The complete universally quantified proposition to be proved. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1447d1a-c8c5-5856-b916-49de07dcf29b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2b3a67922bb184a4841393a1da6edef0fe399bf6a754379ef6a7152a80b5c23b", "task_path": "tasks/nmp3_e1447d1a-c8c5-5856-b916-49de07dcf29b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1447d1a-c8c5-5856-b916-49de07dcf29b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e157976f-b991-5acd-889e-d4daf4585310", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$ and define \n-- $$Q=\\frac{xyz}{(x+y)(y+z)(z+x)}.$$ \n-- Prove that \n-- $$2-10Q\\;\\ge\\;\\left(\\frac{x}{x+y}\\right)^2+\\left(\\frac{y}{y+z}\\right)^2+\\left(\\frac{z}{z+x}\\right)^2\\;\\ge\\;1-2Q.$$\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable inequality\n\nThe source problem asks, for positive real numbers `x`, `y`, and `z`, to prove\na two-sided inequality involving\n`Q = xyz / ((x + y)(y + z)(z + x))`.\n-/\n\nnamespace Problem\n\n/-- The quantity `Q` from the source problem. -/\nnoncomputable def Q (x y z : ℝ) : ℝ :=\n x * y * z / ((x + y) * (y + z) * (z + x))\n\n/-- The sum of squared ratios appearing in the source problem. -/\nnoncomputable def ratioSum (x y z : ℝ) : ℝ :=\n (x / (x + y)) ^ 2 + (y / (y + z)) ^ 2 + (z / (z + x)) ^ 2\n\n/--\nFor all positive real `x`, `y`, and `z`, the stated sum of squares is at most\n`2 - 10 Q` and at least `1 - 2 Q`.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n 2 - 10 * Q x y z ≥ ratioSum x y z ∧\n ratioSum x y z ≥ 1 - 2 * Q x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e157976f-b991-5acd-889e-d4daf4585310", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6eb513f567ef6caabd7df90efd7d6db616f2a8e699f8d688700d445571c5c748", "task_path": "tasks/nmp3_e157976f-b991-5acd-889e-d4daf4585310", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e157976f-b991-5acd-889e-d4daf4585310", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e179c603-f14e-5223-a432-59d1c6a8677e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $w(x)$ denote the largest odd divisor of the positive integer $x$. Suppose $a$ and $b$ are natural numbers with $\\gcd(a,b)=1$ such that both $a+w(b+1)$ and $b+w(a+1)$ are powers of two. Prove that $a+1$ and $b+1$ are themselves powers of two.\nimport Mathlib.Data.Nat.Factorization.Basic\n\n/-!\n# Formalization of the odd-divisor / powers-of-two problem\n\nThe source problem defines `w(x)` as the largest odd divisor of a positive\ninteger `x`, and then asks for a proof of a universal implication for coprime\nnatural numbers `a` and `b`.\n\nWe use the 2-adic factorization formula for the odd part. For a positive\nnatural number `x`, this is `x / 2 ^ v₂(x)`, i.e. all factors of `2` have been\nremoved. The definition is total on `ℕ`; the arguments at which the problem\nuses it are `a + 1` and `b + 1`, both positive.\n-/\n\nnamespace Problem\n\n/-- The largest odd divisor of a positive natural number `x`.\n\nConcretely, this removes from `x` the largest power of `2` dividing it. The\nformula is the usual definition on positive inputs; it is extended to `0` by\nthe total convention of the underlying operations, but `0` is never used as an\nargument in the statement of the problem. -/\ndef largestOddDivisor (x : ℕ) : ℕ :=\n x / 2 ^ Nat.factorization x 2\n\n/-- The source problem's notation `w(x)`, defined as the largest odd divisor\n(of a positive input). -/\ndef w (x : ℕ) : ℕ :=\n largestOddDivisor x\n\n/-- `n` is a power of two, allowing the zeroth power `2 ^ 0 = 1`. -/\ndef IsPowerOfTwo (n : ℕ) : Prop :=\n ∃ k : ℕ, n = 2 ^ k\n\n/-- The two hypotheses in the problem, for a fixed pair `(a, b)`: the numbers are\ncoprime and the two displayed sums are powers of two. -/\ndef Assumptions (a b : ℕ) : Prop :=\n Nat.Coprime a b ∧\n IsPowerOfTwo (a + w (b + 1)) ∧\n IsPowerOfTwo (b + w (a + 1))\n\n/-- The conclusion of the problem: both successors are powers of two. -/\ndef Conclusion (a b : ℕ) : Prop :=\n IsPowerOfTwo (a + 1) ∧ IsPowerOfTwo (b + 1)\n\n/-- The proposition asserted by the problem.\n\nFor all natural numbers `a` and `b`, if `gcd(a,b) = 1` and both\n`a + w(b + 1)` and `b + w(a + 1)` are powers of two, then `a + 1` and `b + 1`\nare powers of two. Here `w` is represented by `Problem.w`, which is the largest-odd-divisor\nfunction `Problem.largestOddDivisor`. -/\ndef Target : Prop :=\n ∀ a b : ℕ, Assumptions a b → Conclusion a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e179c603-f14e-5223-a432-59d1c6a8677e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a31fe43679e48ab4e4727e9e3ac8e7e374cd95ce1de0817398d638a117b98a9a", "task_path": "tasks/nmp3_e179c603-f14e-5223-a432-59d1c6a8677e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e179c603-f14e-5223-a432-59d1c6a8677e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e1878099-de33-5608-8508-0de98d3c41d6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1<a_2<\\dots0\\) be real numbers satisfying \\(a+b+c=a^{3}+b^{3}+c^{3}\\). Prove that \n-- \n-- \\[\n-- \\frac{a}{a^{2}+1}\\left(\\frac{b}{c}\\right)^{2}+\\frac{b}{b^{2}+1}\\left(\\frac{c}{a}\\right)^{2}+\\frac{c}{c^{2}+1}\\left(\\frac{a}{b}\\right)^{2}\\ge\\frac{a+b+c}{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`\nsatisfying `a + b + c = a ^ 3 + b ^ 3 + c ^ 3`, the inequality\n\n`(a / (a ^ 2 + 1)) * (b / c) ^ 2\n + (b / (b ^ 2 + 1)) * (c / a) ^ 2\n + (c / (c ^ 2 + 1)) * (a / b) ^ 2\n ≥ (a + b + c) / 2`.\n\nThis file states the target only; it does not supply a proof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissible triples in the source problem: three positive real numbers\nwhose sum equals the sum of their cubes. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b + c = a ^ (3 : ℕ) + b ^ (3 : ℕ) + c ^ (3 : ℕ)\n\n/-- The left-hand side of the desired inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a / (a ^ (2 : ℕ) + 1)) * (b / c) ^ (2 : ℕ) +\n (b / (b ^ (2 : ℕ) + 1)) * (c / a) ^ (2 : ℕ) +\n (c / (c ^ (2 : ℕ) + 1)) * (a / b) ^ (2 : ℕ)\n\n/-- The right-hand side of the desired inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (a + b + c) / 2\n\n/-- The full assertion to be proved: for every triple of positive reals satisfying\n`a + b + c = a ^ 3 + b ^ 3 + c ^ 3`, the stated lower bound holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ rhs a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1972bc6-f454-5dce-b817-179c9926779e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7c276802dd6c0c354f6d29c5736dedea8de6e828f4c811253a8983d004d7bed1", "task_path": "tasks/nmp3_e1972bc6-f454-5dce-b817-179c9926779e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1972bc6-f454-5dce-b817-179c9926779e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e1a472aa-7086-5722-9aad-a816611f01e9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$ satisfying $a^{2}+b^{2}+c^{2}=3$, prove that \n-- \\[\n-- (2-a)(2-b)(2-c)\\ge\\sqrt{abc}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a three-variable real inequality\n\nFor positive real numbers `a`, `b`, and `c` whose squares sum to `3`,\nthe problem asks for the assertion\n`(2 - a) * (2 - b) * (2 - c) ≥ Real.sqrt (a * b * c)`.\n-/\n\nnamespace Problem\n\n/-- \nThe target assertion: for all positive real numbers `a`, `b`, `c` satisfying\n`a^2 + b^2 + c^2 = 3`, the product `(2-a)(2-b)(2-c)` is at least\nthe square root of `a*b*c`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = 3 →\n (2 - a) * (2 - b) * (2 - c) ≥ Real.sqrt (a * b * c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1a472aa-7086-5722-9aad-a816611f01e9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ad5227e35137f9490fa2df8c3eef023cfbdcf50ca14744284ceacd3b8665217e", "task_path": "tasks/nmp3_e1a472aa-7086-5722-9aad-a816611f01e9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1a472aa-7086-5722-9aad-a816611f01e9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e1a975e8-7b31-518e-9884-5ae5b50a57d4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that \n-- \n-- 1. $f$ is injective (i.e. $x\\neq y\\implies f(x)\\neq f(y)$); \n-- \n-- 2. $f(x+f(f(-y)))=f(x)+f(f(y))$ for all real numbers $x,y$.\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of: find all injective functions satisfying a functional equation\n\nThe original problem asks for all functions `f : ℝ → ℝ` such that:\n\n1. `f` is injective;\n2. for every `x y : ℝ`, `f (x + f (f (-y))) = f x + f (f y)`.\n\nThe declaration `Admissible` records exactly the two conditions defining a\ncandidate function. `IsNegativeSlopeAffine` records the proposed answer family\n`f x = c - x`, with `c` an arbitrary real constant. `Target` states the\ncomplete classification: the admissible functions are precisely that family.\n-/\n\nnamespace Problem\n\n/-- The admissibility predicate for the functional equation problem.\n\nAn admissible function is an injective map `ℝ → ℝ` satisfying\n`f (x + f (f (-y))) = f x + f (f y)` for all real `x` and `y`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n Function.Injective f ∧\n ∀ x y : ℝ, f (x + f (f (-y))) = f x + f (f y)\n\n/-- The candidate answer family: functions of the form `x ↦ c - x` for some\nreal constant `c`. -/\ndef IsNegativeSlopeAffine (f : ℝ → ℝ) : Prop :=\n ∃ c : ℝ, ∀ x : ℝ, f x = c - x\n\n/-- Correctness of a proposed complete solution set for a `find all` problem.\nBoth directions are required: every proposed member is admissible, and every\nadmissible function belongs to the proposed set. -/\ndef AnswerCorrect (S : Set (ℝ → ℝ)) : Prop :=\n (∀ f : ℝ → ℝ, f ∈ S → Admissible f) ∧\n (∀ f : ℝ → ℝ, Admissible f → f ∈ S)\n\n/-- The statement that all admissible functions, and only those, are the\nnegative-slope affine functions `x ↦ c - x`. This is a proposition, not a\nproof of the classification. -/\ndef Target : Prop :=\n ∀ f : ℝ → ℝ, Admissible f ↔ IsNegativeSlopeAffine f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1a975e8-7b31-518e-9884-5ae5b50a57d4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bc69bdfc36e0c1ef39cad0fabddbdddbcee988b6aef65ac8b0d1f43fb9b5313c", "task_path": "tasks/nmp3_e1a975e8-7b31-518e-9884-5ae5b50a57d4", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1a975e8-7b31-518e-9884-5ae5b50a57d4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e1ad9c78-6e6b-5301-b46b-b76128c573ed", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(\\{a_n\\}\\) be a sequence of positive real numbers. Prove that \n-- \\[\n-- \\varlimsup_{n\\to\\infty}\\Bigl(\\frac{1+a_{n+1}}{a_n}\\Bigr)^{\\,n}\\ge e,\n-- \\]\n-- i.e. it is impossible for the limit superior to be strictly less than \\(e\\).\nmodule\npublic import Mathlib\n\n/-!\n# A lower bound for the limit superior of a ratio-power sequence\n\nThis file formalizes the proposition from `problem.md`. It contains no proof of the\nmathematical assertion: `Problem.Target` is a `Prop`-valued definition whose body is the\nstatement to be proved.\n-/\n\n@[expose] public section\n\nopen scoped ENNReal\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The sequence `a : ℕ → ℝ` consists of positive real numbers. -/\ndef IsPositiveSequence (a : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, 0 < a n\n\n/-- The `n`-th real expression `((1 + a (n+1)) / a n) ^ n` occurring under the limit\nsuperior. -/\ndef ratioPower (a : ℕ → ℝ) (n : ℕ) : ℝ :=\n ((1 + a (n + 1)) / a n) ^ n\n\n/-- The same sequence regarded as a sequence in the extended nonnegative reals. This\nretains the value `⊤` in the limit superior when the real terms are unbounded. -/\ndef ratioPowerENNReal (a : ℕ → ℝ) (n : ℕ) : ENNReal :=\n ENNReal.ofReal (ratioPower a n)\n\n/-- The limit superior of `((1 + a (n+1)) / a n) ^ n` as `n → ∞`, in the extended\nnonnegative real line. -/\ndef limsupRatioPower (a : ℕ → ℝ) : ENNReal :=\n Filter.limsup (ratioPowerENNReal a) Filter.atTop\n\n/-- The assertion of the problem: for every sequence of positive real numbers `a`, the\nlimit superior of `((1 + a (n+1)) / a n) ^ n` is at least `e = exp 1`. -/\ndef Target : Prop :=\n ∀ a : ℕ → ℝ,\n IsPositiveSequence a →\n ENNReal.ofReal (Real.exp 1) ≤ limsupRatioPower a\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1ad9c78-6e6b-5301-b46b-b76128c573ed", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0679b9c96979f4d548e8082dd16391200ab45df8d543d8f15860c2ec5a2daee0", "task_path": "tasks/nmp3_e1ad9c78-6e6b-5301-b46b-b76128c573ed", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1ad9c78-6e6b-5301-b46b-b76128c573ed", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e1b27bfb-be23-574c-91e3-eec1f42ce4bc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- a,b,c are positive real numbers. Prove that \n-- \\[\n-- (1+a+b+c)\\,(1+ab+ac+bc)\\;\\ge\\;4\\sqrt{\\,2\\,(a+bc)(b+ca)(c+ab)}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nFor all positive real numbers `a`, `b`, and `c`,\n`(1 + a + b + c) * (1 + a*b + a*c + b*c)` is at least\n`4 * Real.sqrt (2 * (a + b*c) * (b + c*a) * (c + a*b))`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n (1 + a + b + c) * (1 + a * b + a * c + b * c) ≥\n 4 * Real.sqrt (2 * ((a + b * c) * (b + c * a) * (c + a * b)))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1b27bfb-be23-574c-91e3-eec1f42ce4bc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a8c27ef5462f205fffbe4c8e1a839d448080549459da4f99d49a4f415d68d8cc", "task_path": "tasks/nmp3_e1b27bfb-be23-574c-91e3-eec1f42ce4bc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1b27bfb-be23-574c-91e3-eec1f42ce4bc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e1b2f42c-6124-501d-923f-2c21ee0d37fd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCDEF$ be a convex hexagon. Denote by $AB,BC,CD,DE,EF,FA$ its side lengths and by $AD,BE,CF$ the lengths of the three main diagonals. Suppose \n-- \\[\n-- AD = BC + EF,\\qquad BE = AF + CD,\\qquad CF = DE + AB.\n-- \\]\n-- Prove that \n-- \\[\n-- \\frac{AB}{DE}= \\frac{CD}{AF}= \\frac{EF}{BC}\\, .\n-- \\]\nimport Mathlib.Analysis.InnerProductSpace.PiL2\n\n/-!\n# Formalization of a convex-hexagon length problem\n\nThe problem concerns a convex hexagon `ABCDEF` in the Euclidean plane. Its\nthree main diagonals are `AD`, `BE`, and `CF`. The hypotheses relate those\ndiagonal lengths to sums of side lengths, and the conclusion is a chain of\nthree side-length ratios.\n\nThe proposition is represented by `Problem.Target`, a definition whose value is\nthe universally quantified implication. No proof of the proposition is supplied\nor required.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real inner-product space on two\ncoordinates. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The first coordinate of a point of the Euclidean plane. -/\ndef xCoord (P : Plane) : ℝ := P.ofLp 0\n\n/-- The second coordinate of a point of the Euclidean plane. -/\ndef yCoord (P : Plane) : ℝ := P.ofLp 1\n\n/-- Twice the signed area of the oriented triangle `ABC`. It is the\ntwo-dimensional cross product of the vectors `B - A` and `C - A`; it is\npositive exactly when `A`, `B`, `C` are in counterclockwise order and are not\ncollinear. -/\ndef orientedDoubleArea (A B C : Plane) : ℝ :=\n (xCoord B - xCoord A) * (yCoord C - yCoord A) -\n (yCoord B - yCoord A) * (xCoord C - xCoord A)\n\n/-- The Euclidean distance between two points, used for every side length and\nmain-diagonal length in the statement. -/\ndef segmentLength (A B : Plane) : ℝ := dist A B\n\n/-- The six named vertices viewed as a function on indices `0,1,2,3,4,5`. -/\ndef hexagonVertices (A B C D E F : Plane) : Fin 6 → Plane :=\n ![A, B, C, D, E, F]\n\n/-- The next vertex cyclically: `0 ↦ 1 ↦ 2 ↦ 3 ↦ 4 ↦ 5 ↦ 0`. -/\ndef nextVertex (i : Fin 6) : Fin 6 := finRotate 6 i\n\n/-- The vertices `A B C D E F` occur in counterclockwise order and are in\nstrictly convex position. In every directed side, every vertex other than the\ntwo endpoints lies strictly to the left of that side. This excludes collinear\nconsecutive triples and requires the named order to follow the boundary. -/\ndef IsCCWConvexHexagon (A B C D E F : Plane) : Prop :=\n ∀ i j : Fin 6,\n j ≠ i →\n j ≠ nextVertex i →\n orientedDoubleArea\n (hexagonVertices A B C D E F i)\n (hexagonVertices A B C D E F (nextVertex i))\n (hexagonVertices A B C D E F j) > 0\n\n/-- The same strict convex-position condition with the opposite boundary\norientation: the vertices `A B C D E F` occur clockwise, so every other vertex\nlies strictly to the right of every directed side. -/\ndef IsCWConvexHexagon (A B C D E F : Plane) : Prop :=\n ∀ i j : Fin 6,\n j ≠ i →\n j ≠ nextVertex i →\n orientedDoubleArea\n (hexagonVertices A B C D E F i)\n (hexagonVertices A B C D E F (nextVertex i))\n (hexagonVertices A B C D E F j) < 0\n\n/-- `ABCDEF` is a (strictly) convex hexagon with its six named vertices in\ncyclic boundary order. The vertices are explicitly required to be pairwise\ndistinct. Either the counterclockwise or the clockwise orientation is allowed,\nsince the source problem does not choose one. -/\ndef IsConvexHexagon (A B C D E F : Plane) : Prop :=\n Function.Injective (hexagonVertices A B C D E F) ∧\n (IsCCWConvexHexagon A B C D E F ∨ IsCWConvexHexagon A B C D E F)\n\n/-- The three length hypotheses from the problem, in the same order:\n`AD = BC + EF`, `BE = AF + CD`, and `CF = DE + AB`. -/\ndef LengthConditions (A B C D E F : Plane) : Prop :=\n segmentLength A D = segmentLength B C + segmentLength E F ∧\n segmentLength B E = segmentLength A F + segmentLength C D ∧\n segmentLength C F = segmentLength D E + segmentLength A B\n\n/-- The two adjacent equalities expressed by the displayed chain\n`AB / DE = CD / AF = EF / BC`. -/\ndef RatioConclusion (A B C D E F : Plane) : Prop :=\n segmentLength A B / segmentLength D E =\n segmentLength C D / segmentLength A F ∧\n segmentLength C D / segmentLength A F =\n segmentLength E F / segmentLength B C\n\n/-- The complete universally quantified statement to be proved: for every\nconvex hexagon `ABCDEF` satisfying the three diagonal/side sum conditions, the\nthree displayed side-length ratios are equal. -/\ndef Target : Prop :=\n ∀ (A B C D E F : Plane),\n IsConvexHexagon A B C D E F →\n LengthConditions A B C D E F →\n RatioConclusion A B C D E F\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1b2f42c-6124-501d-923f-2c21ee0d37fd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "917125f0a00db38e4c1a4de4d3d03470ea6d916a8bee18c0426d385141e10d15", "task_path": "tasks/nmp3_e1b2f42c-6124-501d-923f-2c21ee0d37fd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1b2f42c-6124-501d-923f-2c21ee0d37fd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e1e0f5aa-e348-5d12-ba9c-c4696c959d20", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that the only polynomial of odd degree satisfying $p(x^2-1)=p(x)^2-1$ for all $x$ is $p(x)=x$.\nimport Mathlib\n\n/-!\n# Formalization of the odd-degree polynomial functional equation\n\nThe source problem asks to show that the only real polynomial of odd degree\nsatisfying `p (x ^ 2 - 1) = (p x) ^ 2 - 1` for every real `x` is the\nidentity polynomial `p = X`.\n\nThis file states that assertion as a proposition-valued definition. It does\nnot provide a proof of the assertion.\n-/\n\nnamespace Problem\n\n/-- A real polynomial has odd (natural-number) degree. -/\ndef OddDegreePolynomial (p : Polynomial ℝ) : Prop :=\n Odd p.natDegree\n\n/-- The polynomial `p` satisfies the displayed functional equation at every\nreal input. -/\ndef SatisfiesFunctionalEquation (p : Polynomial ℝ) : Prop :=\n ∀ x : ℝ, p.eval (x ^ 2 - 1) = (p.eval x) ^ 2 - 1\n\n/-- The polynomial is the identity polynomial `X`, whose value at `x` is `x`. -/\ndef IsIdentityPolynomial (p : Polynomial ℝ) : Prop :=\n p = Polynomial.X\n\n/-- The admissibility predicate described in the source: odd degree together\nwith the functional equation for every real `x`. -/\ndef Admissible (p : Polynomial ℝ) : Prop :=\n OddDegreePolynomial p ∧ SatisfiesFunctionalEquation p\n\n/-- The uniqueness assertion of the source problem: every real polynomial of\nodd degree that satisfies the functional equation for all real inputs is the\nidentity polynomial. -/\ndef Target : Prop :=\n ∀ p : Polynomial ℝ, Admissible p → IsIdentityPolynomial p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1e0f5aa-e348-5d12-ba9c-c4696c959d20", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ff2f3c35df41664e60827444448173c7a76616b0ce37c88217922534f011f6f7", "task_path": "tasks/nmp3_e1e0f5aa-e348-5d12-ba9c-c4696c959d20", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1e0f5aa-e348-5d12-ba9c-c4696c959d20", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e1e90a28-8285-5ae4-be3a-213cc164709a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose there exists a nonempty set $X\\subset\\mathbb{R}$ and a function $f:X\\to X$ such that for every $x,y\\in X$,\n-- \\[\n-- f(x)+y\\in X\\quad\\iff\\quad x\\neq y.\n-- \\]\n-- Prove that the quantity $f(x)+x$ is constant as $x$ varies over $X$; i.e. there exists a real constant $C$ with $f(x)+x=C$ for all $x\\in X\\,.\nimport Mathlib\n\n/-!\n# Formalization of the problem statement\n\nThe source problem concerns a nonempty set `X ⊆ ℝ` and a self-map\n`f : X → X` satisfying\n\n`f x + y ∈ X ↔ x ≠ y`\n\nfor all `x y ∈ X`. The conclusion is that the diagonal sum `f x + x` is\nindependent of `x ∈ X`.\n\nThis file only states the problem. In particular, `Problem.Target` is a\n`Prop`-valued definition and is not proved here.\n-/\n\nnamespace Problem\n\n/-- The defining hypothesis on a set `X ⊆ ℝ` and a self-map `f : X → X`:\nfor all `x, y ∈ X`, the real number `f x + y` belongs to `X` exactly when\n`x` and `y` are distinct elements of `X`. -/\ndef Condition (X : Set ℝ) (f : X → X) : Prop :=\n ∀ x y : X, ((f x : ℝ) + (y : ℝ) ∈ X) ↔ (x : ℝ) ≠ (y : ℝ)\n\n/-- The asserted conclusion: there is a real constant `C` such that\n`f x + x = C` for every `x ∈ X`. -/\ndef ConstantDiagonalSum (X : Set ℝ) (f : X → X) : Prop :=\n ∃ C : ℝ, ∀ x : X, (f x : ℝ) + (x : ℝ) = C\n\n/-- The full theorem stated by the problem: for every nonempty set `X ⊆ ℝ`\nand every self-map `f : X → X` satisfying `Condition X f`, the diagonal sum\n`f x + x` is constant on `X`. -/\ndef Target : Prop :=\n ∀ (X : Set ℝ), X.Nonempty → ∀ f : X → X, Condition X f → ConstantDiagonalSum X f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1e90a28-8285-5ae4-be3a-213cc164709a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7e6466b6237579ef8ce30807ccca1babf0953db403984358803ce332537af5cd", "task_path": "tasks/nmp3_e1e90a28-8285-5ae4-be3a-213cc164709a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1e90a28-8285-5ae4-be3a-213cc164709a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e1f32e51-2f3a-5e40-b0f3-224c6371b0db", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k\\ge3$ be an odd integer. Prove that there exists a polynomial $f(x)$ of degree $k$ with rational coefficients such that \n-- \n-- * $f$ is integer‑valued (i.e. $f(m)\\in\\mathbb Z$ for every integer $m$); \n-- * at least one coefficient of $f$ (in the usual $x^i$ basis) is not an integer; \n-- * $f(0)=0$ and $f(1)=1$; \n-- \n-- and such that infinitely many positive integers $n$ have the property that whenever \n-- \n-- \\[\n-- n = f(x_1)+f(x_2)+\\dots+f(x_s),\\qquad x_1,\\dots,x_s\\in\\mathbb Z,\n-- \\]\n-- \n-- one must have $s\\ge 2^{\\,k}-1\\,. $\nimport Mathlib\n\n/-!\n# Formal statement for the odd-degree integer-valued polynomial problem\n\nThis file records the assertion of `problem.md` as a proposition. It does not\nprovide a proof. The rational polynomial `f` is a witness whose degree is\nexactly `k`; the remaining predicates spell out the hypotheses on `f` and the\nsum-representation property. All sums below are finite sums indexed by\n`Fin s`, matching the `s` integer arguments `x_1, ..., x_s` in the problem.\n-/\n\nnamespace Problem\n\n/-- A rational polynomial is integer-valued when its value at every integer\nargument is an integer (embedded in `ℚ`). -/\ndef IntegerValued (f : Polynomial ℚ) : Prop :=\n ∀ m : ℤ, ∃ z : ℤ, f.eval (m : ℚ) = (z : ℚ)\n\n/-- `f` has exact degree `k` in the ordinary sense. In Mathlib the degree of\nthe zero polynomial is `⊥`, so this also correctly excludes the zero polynomial\nwhen `k : ℕ`, and it is not a degree-at-most condition. -/\ndef HasDegreeExactly (k : ℕ) (f : Polynomial ℚ) : Prop :=\n f.degree = (k : WithBot ℕ)\n\n/-- Some coefficient in the usual monomial basis `1, x, x^2, ...` is not an\ninteger. Coefficients outside the degree are zero and hence play no role. -/\ndef HasNonIntegerCoefficient (f : Polynomial ℚ) : Prop :=\n ∃ i : ℕ, ∀ z : ℤ, f.coeff i ≠ (z : ℚ)\n\n/-- Every representation of `n` as a sum of exactly `s` values `f(x_i)`, with\nall `x_i : ℤ`, has length at least `bound`. The equality is in `ℚ`; all\nsummands and `n` are rational, so this is the natural field in which to state\nthe displayed equation. -/\ndef EveryRepresentationHasLengthAtLeast\n (f : Polynomial ℚ) (bound n : ℕ) : Prop :=\n ∀ (s : ℕ) (x : Fin s → ℤ),\n (n : ℚ) = ∑ i : Fin s, f.eval (((x i : ℤ) : ℚ)) →\n bound ≤ s\n\n/-- A positive integer `n` has the sum-length lower-bound property for `f`. -/\ndef PositiveIntegerWithSumLengthBound\n (f : Polynomial ℚ) (bound n : ℕ) : Prop :=\n 0 < n ∧ EveryRepresentationHasLengthAtLeast f bound n\n\n/-- There are infinitely many positive integers with the preceding property. -/\ndef InfinitelyManyPositiveIntegersWithSumLengthBound\n (f : Polynomial ℚ) (bound : ℕ) : Prop :=\n Set.Infinite {n : ℕ | PositiveIntegerWithSumLengthBound f bound n}\n\n/-- Admissibility of a candidate witness `f` for the conclusion at a fixed `k`.\nIt combines exact degree, integer-valuedness, a non-integral monomial\ncoefficient, the two prescribed values, and the infinitely-many-`n` condition\nwith bound `2^k - 1`. -/\ndef IsSolutionPolynomial (k : ℕ) (f : Polynomial ℚ) : Prop :=\n HasDegreeExactly k f ∧\n IntegerValued f ∧\n HasNonIntegerCoefficient f ∧\n f.eval (0 : ℚ) = (0 : ℚ) ∧\n f.eval (1 : ℚ) = (1 : ℚ) ∧\n InfinitelyManyPositiveIntegersWithSumLengthBound f (2 ^ k - 1)\n\n/-- The full problem assertion: for every natural number `k` with `k ≥ 3` and\n`k` odd, there exists a rational polynomial `f` satisfying all the stated\nconditions and the sum-length property. The hypotheses are ordered as in the\nsource sentence: first `3 ≤ k`, then `Odd k`. -/\ndef Target : Prop :=\n ∀ k : ℕ, 3 ≤ k → Odd k → ∃ f : Polynomial ℚ, IsSolutionPolynomial k f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1f32e51-2f3a-5e40-b0f3-224c6371b0db", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c641ac6b65b580f4444e2e7c15e09a5ba80ae18c7bb15e35a482d693ddbeecc5", "task_path": "tasks/nmp3_e1f32e51-2f3a-5e40-b0f3-224c6371b0db", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e1f32e51-2f3a-5e40-b0f3-224c6371b0db", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e205d98f-d11d-5f43-b761-b9e0583635b9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P\\in\\mathbb Z[x]$ be a nonconstant polynomial that has no integer zeros. Prove that there exists a positive integer $m\\le 3\\deg P$ such that $P(m)$ does not divide $P(m+1)\\,. $\nimport Mathlib\n\n/-!\nFormal statement of the polynomial divisibility problem.\n\nThe source asks: for every nonconstant integer polynomial with no integer\nzeros, there is a positive integer `m`, bounded by three times the degree of\nthe polynomial, for which `P(m)` does not divide `P(m + 1)`.\n-/\n\nnamespace Problem\n\n/-- `z` is an integer zero of the integer polynomial `P`. -/\ndef IsIntegerZero (P : Polynomial ℤ) (z : ℤ) : Prop :=\n P.eval z = 0\n\n/-- The polynomial `P` has no zeros in the integers. -/\ndef HasNoIntegerZeros (P : Polynomial ℤ) : Prop :=\n ∀ z : ℤ, ¬ IsIntegerZero P z\n\n/-- `P` is nonconstant, expressed as having positive natural degree. -/\ndef Nonconstant (P : Polynomial ℤ) : Prop :=\n 0 < P.natDegree\n\n/-- `m` is a positive integer at most three times the degree of `P`, and\n`P(m)` does not divide `P(m + 1)`. -/\ndef Witness (P : Polynomial ℤ) (m : ℕ) : Prop :=\n 0 < m ∧\n m ≤ 3 * P.natDegree ∧\n ¬ (P.eval (m : ℤ) ∣ P.eval (((m + 1 : ℕ) : ℤ)))\n\n/-- The full assertion of the problem: every nonconstant integer polynomial\nwith no integer zeros has a witness `m ≤ 3 * deg P`. -/\ndef Target : Prop :=\n ∀ P : Polynomial ℤ,\n Nonconstant P →\n HasNoIntegerZeros P →\n ∃ m : ℕ, Witness P m\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e205d98f-d11d-5f43-b761-b9e0583635b9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9768f2ac9b4bbc25c1712b9eb039613542ad878cdbf1df42201edd1f3b213649", "task_path": "tasks/nmp3_e205d98f-d11d-5f43-b761-b9e0583635b9", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e205d98f-d11d-5f43-b761-b9e0583635b9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e22c7f17-079f-52c1-b77a-836a0d32c713", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- There are $n\\ge2$ websites labeled $1,2,\\dots,n$. For each $i\\in\\{1,\\dots,n-1\\}$ there is already a directed link from $i$ to $i+1$. We may add further directed links, but a link may only go from a smaller‑numbered website to a larger‑numbered website. Prove that we can add at most $3(n-1)\\log_{2}\\!\\bigl(\\log_{2}n\\bigr)$ new links so that for every pair $1\\le i0$ satisfy $x+y+z=1$. Prove that \n-- \\[\n-- \\frac{x}{1+9xy}+\\frac{y}{1+9yz}+\\frac{z}{1+9xz}\\ge\\frac12\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe source problem asks, for positive real numbers `x`, `y`, and `z` whose sum is\n`1`, to prove the inequality\n`x / (1 + 9*x*y) + y / (1 + 9*y*z) + z / (1 + 9*x*z) ≥ 1/2`.\n\nThe declaration below records the full quantified proposition. No proof is\nprovided, as this file is a statement-formalization artifact.\n-/\n\nnamespace Problem\n\n/-- For all positive reals `x`, `y`, and `z` with `x + y + z = 1`, the sum\n`x / (1 + 9*x*y) + y / (1 + 9*y*z) + z / (1 + 9*x*z)` is at least `1/2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n x + y + z = 1 →\n x / (1 + 9 * x * y) + y / (1 + 9 * y * z) + z / (1 + 9 * x * z)\n ≥ (1 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e26b3e02-aacb-5fbd-ad1c-a9f1083aea18", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "40ef4652348495ca7e68db0bb8b7336ab0770e7870c862139eebdd7fbeb8f7d9", "task_path": "tasks/nmp3_e26b3e02-aacb-5fbd-ad1c-a9f1083aea18", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e26b3e02-aacb-5fbd-ad1c-a9f1083aea18", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e27059a4-4c70-51dc-a595-9ae102e50293", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ such that \n-- \n-- 1. $f(x+y)=f(x)+f(y)$ for all $x,y\\in\\mathbb{R}$, and \n-- \n-- 2. $f(x)\\,f\\!\\left(\\frac1x\\right)=1$ for all $x\\in\\mathbb{R}\\setminus\\{0\\}\\,. $\nimport Mathlib\n\nnamespace Problem\n\n/-- A real-valued function is admissible when it is additive on all of `ℝ` and\nsatisfies the reciprocal-product identity at every nonzero real number. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n (∀ x y : ℝ, f (x + y) = f x + f y) ∧\n (∀ x : ℝ, x ≠ 0 → f x * f ((1 : ℝ) / x) = (1 : ℝ))\n\n/-- A proposed set `S` is a complete answer to the problem when membership in `S`\nis equivalent, for every function `f : ℝ → ℝ`, to admissibility. The two\ndirections of this equivalence are the soundness and exhaustiveness requirements\nfor a complete classification. -/\ndef CompleteAnswerCorrect (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, f ∈ S ↔ Admissible f\n\n/-- The proposed two-element answer set consisting of the identity function and\nits negation. -/\ndef CandidateAnswer : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | f = (fun x : ℝ => x) ∨ f = (fun x : ℝ => -x)}\n\n/-- The formal target: the proposed answer set is exactly the set of all\nadmissible functions. -/\ndef Target : Prop :=\n CompleteAnswerCorrect CandidateAnswer\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e27059a4-4c70-51dc-a595-9ae102e50293", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b87c5bdca1adfcf703e318ac9c76809f7ffdfcf325e75c47880243b39e05e907", "task_path": "tasks/nmp3_e27059a4-4c70-51dc-a595-9ae102e50293", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e27059a4-4c70-51dc-a595-9ae102e50293", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e2849d12-3c21-5b08-8bd5-c7b88bd030f8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ satisfying \n-- \\[\n-- f(0)=0\\qquad\\text{and}\\qquad \n-- f\\!\\big((f(x))^{2}+(f(y))^{2}\\big)=x^{2}+y^{2}\\quad\\text{for all real }x,y.\n-- \\] \n-- (Here $f^{2}(x)$ in the original statement means $(f(x))^{2}$.)\nimport Mathlib\n\n/-!\n# Formalization of the functional equation problem\n\nThe source problem asks for all functions `f : ℝ → ℝ` satisfying\n\n`f 0 = 0` and\n`f ((f x)^2 + (f y)^2) = x^2 + y^2` for every real `x, y`.\n\nThis file records the admissibility condition, an explicit proposed complete\nanswer set, and the predicate saying that a proposed answer set is exactly the\nset of all admissible functions.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition from the problem: `f 0 = 0` and the displayed\nfunctional equation for every pair of real numbers. -/\ndef IsAdmissible (f : ℝ → ℝ) : Prop :=\n f 0 = 0 ∧\n ∀ x y : ℝ, f ((f x) ^ 2 + (f y) ^ 2) = x ^ 2 + y ^ 2\n\n/-- The proposed classification of all admissible functions: `f x = x` for\nevery nonnegative `x`, while on every negative `x` one may independently have\neither `f x = x` or `f x = -x` (with `f 0 = 0` recorded separately). -/\ndef IsCandidateSolution (f : ℝ → ℝ) : Prop :=\n f 0 = 0 ∧\n (∀ x : ℝ, 0 < x → f x = x) ∧\n (∀ x : ℝ, x < 0 → f x = x ∨ f x = -x)\n\n/-- The set of functions described by the proposed classification. -/\ndef CandidateSolutionSet : Set (ℝ → ℝ) :=\n {f | IsCandidateSolution f}\n\n/-- Soundness of a proposed answer set: every function it lists is admissible. -/\ndef IsSoundAnswer (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, f ∈ S → IsAdmissible f\n\n/-- Exhaustiveness of a proposed answer set: every admissible function is\nlisted in it. -/\ndef IsExhaustiveAnswer (S : Set (ℝ → ℝ)) : Prop :=\n ∀ f : ℝ → ℝ, IsAdmissible f → f ∈ S\n\n/-- Complete-answer correctness for a proposed set of functions: the proposed\nset contains exactly the admissible functions. Both directions are stated\nexplicitly. -/\ndef IsCompleteAnswer (S : Set (ℝ → ℝ)) : Prop :=\n IsSoundAnswer S ∧ IsExhaustiveAnswer S\n\n/-- The formal target of the original \"find all functions\" problem, using the\nexplicitly proposed classification above. -/\ndef Target : Prop :=\n IsCompleteAnswer CandidateSolutionSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e2849d12-3c21-5b08-8bd5-c7b88bd030f8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c298491213175e28490217ca030151e0f037ca8512825f0463a25d754e7a0a9e", "task_path": "tasks/nmp3_e2849d12-3c21-5b08-8bd5-c7b88bd030f8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e2849d12-3c21-5b08-8bd5-c7b88bd030f8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e28ee9e9-76c9-53d9-bae3-a5c223fe540d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $M,N,P$ be the midpoints of the sides $BC,CA,AB$ of a triangle $ABC$. The lines $AM, BN, CP$ intersect the circumcircle of $ABC$ again at points $A',B',C'$, respectively. Prove that if triangle $A'B'C'$ is equilateral, then triangle $ABC$ is also equilateral.\nimport Mathlib.Geometry.Euclidean.Basic\nimport Mathlib.Analysis.InnerProductSpace.PiL2\n\n/-!\n# Formalization of a planar triangle geometry problem\n\nThis file states the problem from `problem.md`: if the three second\nintersections of the medians of a triangle with its circumcircle form an\nequilateral triangle, then the original triangle is equilateral.\n\nThe target is stated as a proposition-valued definition. No proof of the\ntarget is supplied here.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used for the formal statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Three points are collinear when they satisfy a nontrivial affine relation.\nThus the relation also correctly says that two coincident points and a third\npoint are collinear. -/\ndef Collinear (A B C : Plane) : Prop :=\n ∃ a b c : ℝ,\n a + b + c = 0 ∧ a • A + b • B + c • C = 0 ∧ (a ≠ 0 ∨ b ≠ 0 ∨ c ≠ 0)\n\n/-- A nondegenerate triangle: three points that are not collinear. -/\ndef IsTriangle (A B C : Plane) : Prop :=\n ¬ Collinear A B C\n\n/-- An equilateral triangle, including the usual requirement that the three\nvertices form a nondegenerate triangle. The two displayed equalities say that\nall three side lengths are equal. -/\ndef IsEquilateral (A B C : Plane) : Prop :=\n IsTriangle A B C ∧ dist A B = dist B C ∧ dist B C = dist C A\n\n/-- The midpoint of side `BC`. -/\ndef midpointBC (B C : Plane) : Plane :=\n midpoint ℝ B C\n\n/-- The midpoint of side `CA`. -/\ndef midpointCA (C A : Plane) : Plane :=\n midpoint ℝ C A\n\n/-- The midpoint of side `AB`. -/\ndef midpointAB (A B : Plane) : Plane :=\n midpoint ℝ A B\n\n/-- `O` is the center of a circle of positive radius `r` passing through\n`A`, `B`, and `C`. -/\ndef IsCircumcircle (A B C O : Plane) (r : ℝ) : Prop :=\n 0 < r ∧ dist O A = r ∧ dist O B = r ∧ dist O C = r\n\n/-- `X` lies on the circumcircle of `A`, `B`, and `C`, expressed without\nchoosing a particular circumcenter. -/\ndef OnCircumcircle (A B C X : Plane) : Prop :=\n ∃ O : Plane, ∃ r : ℝ, IsCircumcircle A B C O r ∧ dist O X = r\n\n/-- `X` is the second intersection, other than `A`, of the line through `A`\nand `M` with the circumcircle of the triangle `ABC`. The last conjunct says\nthat there is at most one such second point, matching the definite article in\nthe source problem. -/\ndef IsSecondIntersection (A B C M X : Plane) : Prop :=\n X ≠ A ∧\n Collinear A M X ∧\n OnCircumcircle A B C X ∧\n ∀ Y : Plane,\n Y ≠ A →\n Collinear A M Y →\n OnCircumcircle A B C Y → Y = X\n\n/-- The original statement: let `M`, `N`, and `P` be the midpoints of `BC`,\n`CA`, and `AB` in a triangle `ABC`, and let `A'`, `B'`, and `C'` be the second\nintersections of `AM`, `BN`, and `CP` with the circumcircle of `ABC`. If\n`A'B'C'` is equilateral, then `ABC` is equilateral. -/\ndef Target : Prop :=\n ∀ A B C M N P A' B' C' : Plane,\n IsTriangle A B C →\n M = midpointBC B C →\n N = midpointCA C A →\n P = midpointAB A B →\n IsSecondIntersection A B C M A' →\n IsSecondIntersection B C A N B' →\n IsSecondIntersection C A B P C' →\n IsEquilateral A' B' C' → IsEquilateral A B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e28ee9e9-76c9-53d9-bae3-a5c223fe540d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "91b6cb29fb66871d6bed2731d11c3d82c71fc9c17fc7ebbb9555971480972629", "task_path": "tasks/nmp3_e28ee9e9-76c9-53d9-bae3-a5c223fe540d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e28ee9e9-76c9-53d9-bae3-a5c223fe540d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e2954705-4d4b-5aef-8828-5c9e0c14a95f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge0$ be real numbers such that $xy+yz+zx=1$. Prove that \n-- \\[\n-- \\frac{1}{\\sqrt{x+y}}+\\frac{1}{\\sqrt{y+z}}+\\frac{1}{\\sqrt{z+x}}\\ge 2+\\frac{1}{\\sqrt2}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks to prove, for nonnegative real numbers `x`, `y`, and `z`\nsatisfying `xy + yz + zx = 1`, the inequality\n\n`1 / sqrt (x + y) + 1 / sqrt (y + z) + 1 / sqrt (z + x)\n ≥ 2 + 1 / sqrt 2`.\n\nThis file records the assertion as a proposition-valued definition. No proof is\nprovided.\n-/\n\nnamespace Problem\n\n/-- The assertion from the problem statement. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n (0 : ℝ) ≤ x →\n (0 : ℝ) ≤ y →\n (0 : ℝ) ≤ z →\n x * y + y * z + z * x = (1 : ℝ) →\n (1 : ℝ) / Real.sqrt (x + y) +\n (1 : ℝ) / Real.sqrt (y + z) +\n (1 : ℝ) / Real.sqrt (z + x) ≥\n (2 : ℝ) + (1 : ℝ) / Real.sqrt (2 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e2954705-4d4b-5aef-8828-5c9e0c14a95f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b966c92b58e5d0b80bf8d5ca78582fc3e8c0e4ecee3e7b0b74f71f40583f8c72", "task_path": "tasks/nmp3_e2954705-4d4b-5aef-8828-5c9e0c14a95f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e2954705-4d4b-5aef-8828-5c9e0c14a95f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e2cc78d8-aac4-5a02-ae7e-612346efc9aa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any positive integer $n$, construct a set $X$ of $n$ distinct integers greater than $1$ such that for every non‑empty subset $S\\subseteq X$ the arithmetic mean \n-- \\[\n-- \\frac{1}{|S|}\\sum_{x\\in S}x\n-- \\]\n-- is an integer perfect power, i.e. can be written as $a^m$ for some integer $a>1$ and exponent $m\\ge 2$ (a square, cube, or higher power).\nimport Mathlib\n\n/-!\n# A set whose every nonempty subset has an integer perfect-power arithmetic mean\n\nThis file gives a declaration-level formalization of the statement in\n`problem.md`. It deliberately contains no proof of the existence assertion.\n-/\n\nnamespace Problem\n\n/-- An integer `z` is a perfect power in the sense of the problem: there are an\ninteger base `a > 1` and an integer exponent `m ≥ 2` with `z = a ^ m`. -/\ndef IsIntegerPerfectPower (z : ℤ) : Prop :=\n ∃ a : ℤ, ∃ m : ℕ, 1 < a ∧ 2 ≤ m ∧ z = a ^ m\n\n/-- The arithmetic mean of a finite set of integers is an integer perfect\npower. The mean is written as a rational number, so this does not use\ninteger division. The existential integer `z` records explicitly that the\nmean must be an integer, and `IsIntegerPerfectPower z` records the required\npower representation. For nonempty `S`, the denominator `S.card` is nonzero. -/\ndef HasIntegerPerfectPowerMean (S : Finset ℤ) : Prop :=\n ∃ z : ℤ,\n IsIntegerPerfectPower z ∧\n (S.sum (fun x : ℤ => x) : ℚ) / (S.card : ℚ) = (z : ℚ)\n\n/-- `X` is a valid constructed set for the value `n`: it has exactly `n`\ndistinct integers, all greater than one, and every nonempty finite subset of\n`X` has an integer perfect-power arithmetic mean. -/\ndef GoodSet (n : ℕ) (X : Finset ℤ) : Prop :=\n X.card = n ∧\n (∀ x : ℤ, x ∈ X → 1 < x) ∧\n (∀ S : Finset ℤ, S ⊆ X → S.Nonempty → HasIntegerPerfectPowerMean S)\n\n/-- For every positive integer `n`, there exists a valid set `X` of `n`\ndistinct integers greater than one such that every nonempty subset of `X` has\nan integer perfect-power arithmetic mean. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ∃ X : Finset ℤ, GoodSet n X\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e2cc78d8-aac4-5a02-ae7e-612346efc9aa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b7997d04e6529b339c84f40b79397fd45b9f9bf07296fce1a9de3668ef5dad20", "task_path": "tasks/nmp3_e2cc78d8-aac4-5a02-ae7e-612346efc9aa", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e2cc78d8-aac4-5a02-ae7e-612346efc9aa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e2e7723c-af66-5af2-8aaf-29f46c44df3c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer and let $A_1,A_2,\\dots,A_{n+1}$ be nonempty subsets of $\\{1,2,\\dots,n\\}$. Prove that there exist two nonempty disjoint index sets $I_1,I_2\\subseteq\\{1,2,\\dots,n+1\\}$ such that \n-- \\[\n-- \\bigcup_{i\\in I_1}A_i \\;=\\; \\bigcup_{j\\in I_2}A_j\\,.\n-- \\]\nimport Mathlib.Data.Finset.Basic\nimport Mathlib.Data.Set.Basic\n\nnamespace Problem\n\n/-- The union of the sets `A i` for indices `i` in the finite index set `I`. -/\ndef IndexUnion (n : ℕ) (A : Fin (n + 1) → Set (Fin n))\n (I : Finset (Fin (n + 1))) : Set (Fin n) :=\n {x | ∃ i : Fin (n + 1), i ∈ I ∧ x ∈ A i}\n\n/-- The full assertion of the problem.\n\nFor every positive integer `n` and every family of `n + 1` nonempty subsets\n`A i` of the `n`-element type `Fin n`, there are two nonempty disjoint\nfinite index sets `I₁`, `I₂` of indices in `Fin (n + 1)` whose corresponding\nunions of members of `A` are equal. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 0 < n →\n ∀ (A : Fin (n + 1) → Set (Fin n)),\n (∀ i : Fin (n + 1), (A i).Nonempty) →\n ∃ I₁ I₂ : Finset (Fin (n + 1)),\n I₁.Nonempty ∧\n I₂.Nonempty ∧\n Disjoint I₁ I₂ ∧\n IndexUnion n A I₁ = IndexUnion n A I₂\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e2e7723c-af66-5af2-8aaf-29f46c44df3c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0d77183fbef16a553fe76cb67c56e4130f30189e565c1c329136fa3506660e99", "task_path": "tasks/nmp3_e2e7723c-af66-5af2-8aaf-29f46c44df3c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e2e7723c-af66-5af2-8aaf-29f46c44df3c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e2f8951b-6194-5dad-902f-6083564183b5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- (a^2+2bc)(b^2+2ac)(c^2+2ab)\\ge abc\\,(a+2b)(b+2c)(c+2a)\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion from the problem: for all positive real numbers `a`, `b`, and `c`,\nthe product `(a^2 + 2bc)(b^2 + 2ac)(c^2 + 2ab)` is at least\n`abc (a + 2b)(b + 2c)(c + 2a)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (a ^ 2 + 2 * b * c) * (b ^ 2 + 2 * a * c) * (c ^ 2 + 2 * a * b) ≥\n a * b * c * (a + 2 * b) * (b + 2 * c) * (c + 2 * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e2f8951b-6194-5dad-902f-6083564183b5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1c53e4fe519b1096c40ed0ee742bd081a182a9760147e372eb06a21c1f861220", "task_path": "tasks/nmp3_e2f8951b-6194-5dad-902f-6083564183b5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e2f8951b-6194-5dad-902f-6083564183b5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e2fcb0a2-4264-5fc4-a33d-3f6b34f5ca91", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that the equation $a^4+2b^4=c^4$ has no solutions in positive integers.\nimport Mathlib\n\nnamespace Problem\n\n/-- The Diophantine equation from the problem, over the natural numbers. -/\ndef Equation (a b c : ℕ) : Prop :=\n a ^ 4 + 2 * b ^ 4 = c ^ 4\n\n/-- A tuple `(a, b, c)` is a solution in positive integers. -/\ndef PositiveSolution (a b c : ℕ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ Equation a b c\n\n/-- The assertion that the equation has no solution in positive integers. -/\ndef Target : Prop :=\n ¬ ∃ a b c : ℕ, PositiveSolution a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e2fcb0a2-4264-5fc4-a33d-3f6b34f5ca91", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d80a8c7336aef12fef2c4bb639b85048d190847ca0a65102ff668416488f2f13", "task_path": "tasks/nmp3_e2fcb0a2-4264-5fc4-a33d-3f6b34f5ca91", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e2fcb0a2-4264-5fc4-a33d-3f6b34f5ca91", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e30f7a9d-d770-5557-9b34-c13dbdb00f72", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any positive real numbers $a$, $b$, and $c$, prove that \n-- \\[\n-- \\frac{ab^{2}}{c(c+a)}+\\frac{bc^{2}}{a(a+b)}+\\frac{ca^{2}}{b(b+c)}\\ge\\frac{3}{2}\\cdot\\frac{a^{2}+b^{2}+c^{2}}{a+b+c}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and\n`c`, the inequality\n\n`(a*b^2)/(c*(c+a)) + (b*c^2)/(a*(a+b)) + (c*a^2)/(b*(b+c))\n >= (3/2) * (a^2+b^2+c^2)/(a+b+c)`.\n\nThis file records the mathematical assertion as a proposition-valued\ndefinition. It does not assert or prove the proposition.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the target inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a * b ^ 2) / (c * (c + a)) +\n (b * c ^ 2) / (a * (a + b)) +\n (c * a ^ 2) / (b * (b + c))\n\n/-- The right-hand side of the target inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (3 / 2 : ℝ) * ((a ^ 2 + b ^ 2 + c ^ 2) / (a + b + c))\n\n/-- The admissibility condition that the three real numbers are positive. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The full target statement: for every triple of positive real numbers, the\nstated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → lhs a b c ≥ rhs a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e30f7a9d-d770-5557-9b34-c13dbdb00f72", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2c8e0b4dce784f020d0d7d7220d7650a707a8fe2af71befc0a00fb40c88f71d3", "task_path": "tasks/nmp3_e30f7a9d-d770-5557-9b34-c13dbdb00f72", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e30f7a9d-d770-5557-9b34-c13dbdb00f72", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e321ab39-1749-5454-a882-c2d142570312", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f,g:[0,\\infty)\\to[0,\\infty)$ be continuous functions satisfying \n-- \n-- 1. $f(0)=g(0)=0$, \n-- 2. $g(x)\\neq0$ for every $x>0$, \n-- 3. $f\\bigl(x+g(f(x))\\bigr)=f(x)$ for all $x\\ge0$. \n-- \n-- Prove that $f(x)=0$ for every $x\\ge0\\,. $\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypotheses of the problem, for functions on the nonnegative reals.\n\nThe domain and codomain of both functions are represented by `NNReal`, the type of\nnonnegative real numbers, with its usual topology. -/\ndef Admissible (f g : NNReal → NNReal) : Prop :=\n Continuous f ∧\n Continuous g ∧\n f 0 = 0 ∧\n g 0 = 0 ∧\n (∀ x : NNReal, 0 < x → g x ≠ 0) ∧\n (∀ x : NNReal, f (x + g (f x)) = f x)\n\n/-- The assertion to be proved: every pair of admissible functions has `f`\nidentically zero on `[0, ∞)`. -/\ndef Target : Prop :=\n ∀ (f g : NNReal → NNReal), Admissible f g → ∀ x : NNReal, f x = 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e321ab39-1749-5454-a882-c2d142570312", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8c2c3654ad2a35c9ffe6697aaf83b40946e942c8705bc8af88cdcb2801b29087", "task_path": "tasks/nmp3_e321ab39-1749-5454-a882-c2d142570312", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e321ab39-1749-5454-a882-c2d142570312", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e33c72bb-8893-5cda-9d30-7461bb5e41d5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for all positive real numbers $x$, $y$, $z$,\n-- \\[\n-- \\sqrt{\\frac{x^{4}+y^{4}+z^{4}}{x^{2}y^{2}+x^{2}z^{2}+y^{2}z^{2}}}\\;+\\;\\sqrt{\\frac{2(xy+xz+yz)}{x^{2}+y^{2}+z^{2}}}\\;\\ge\\;1+\\sqrt{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThis file formalizes the inequality stated in `problem.md`. The real square root\n`Real.sqrt` is the nonnegative real square root from Mathlib.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `x`, `y`, and `z`, the sum of the two square\nroots displayed in the problem is at least `1 + sqrt 2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n Real.sqrt\n ((x ^ 4 + y ^ 4 + z ^ 4) /\n (x ^ 2 * y ^ 2 + x ^ 2 * z ^ 2 + y ^ 2 * z ^ 2)) +\n Real.sqrt\n ((2 * (x * y + x * z + y * z)) /\n (x ^ 2 + y ^ 2 + z ^ 2)) ≥\n 1 + Real.sqrt 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e33c72bb-8893-5cda-9d30-7461bb5e41d5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "39ddf6b153316b73386a304f96b621acedc320fbba69c2afa622e0fe1937ab22", "task_path": "tasks/nmp3_e33c72bb-8893-5cda-9d30-7461bb5e41d5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e33c72bb-8893-5cda-9d30-7461bb5e41d5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e365f466-6605-579c-9433-3a21db8d4e55", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If \\(a,b,c\\) are non‑negative real numbers such that \\(ab+bc+ca>0\\), prove that \n-- \\[\n-- \\frac{a^{2}}{a+b}+\\frac{b^{2}}{b+c}+\\frac{c^{2}}{c+a}+\\frac{3\\bigl(a^{2}+b^{2}+c^{2}\\bigr)-2\\bigl(ab+bc+ca\\bigr)}{2\\,(a+b+c)}\\ge 2\\sqrt{\\frac{a^{3}+b^{3}+c^{3}}{a+b+c}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the inequality\n\nThe source problem asks to prove an inequality for non-negative real numbers\n`a`, `b`, and `c` satisfying `a*b + b*c + c*a > 0`.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissibility hypotheses of the problem: the three real numbers are\nnon-negative and their pairwise-product sum is strictly positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a * b + b * c + c * a\n\n/-- The left-hand side of the inequality in the problem. -/\ndef LHS (a b c : ℝ) : ℝ :=\n a ^ 2 / (a + b) + b ^ 2 / (b + c) + c ^ 2 / (c + a) +\n (3 * (a ^ 2 + b ^ 2 + c ^ 2) - 2 * (a * b + b * c + c * a)) /\n (2 * (a + b + c))\n\n/-- The right-hand side of the inequality in the problem. -/\ndef RHS (a b c : ℝ) : ℝ :=\n 2 * Real.sqrt ((a ^ 3 + b ^ 3 + c ^ 3) / (a + b + c))\n\n/-- The assertion to be proved: for all non-negative real numbers `a`, `b`,\nand `c` with `a*b + b*c + c*a > 0`, the stated left-hand side is at least\nthe stated right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ RHS a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e365f466-6605-579c-9433-3a21db8d4e55", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ffdba7cb40cffa0210638fa1631fd38e6ff447e05b9428d4586d86a99c3434b8", "task_path": "tasks/nmp3_e365f466-6605-579c-9433-3a21db8d4e55", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e365f466-6605-579c-9433-3a21db8d4e55", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e3744a09-d3e9-55ab-b363-03bf76b6c4f5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a\\ge b\\ge c$ and $ac\\ge b^2$. Prove that \n-- \\[\n-- \\frac{1}{a^2+b^2}+\\frac{1}{b^2+c^2}+\\frac{1}{c^2+a^2}\n-- \\;\\ge\\;\n-- \\frac{1}{a^2+bc}+\\frac{1}{b^2+ca}+\\frac{1}{c^2+ab}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the stated inequality problem\n\nThe original problem asks to prove a real-variable inequality under the\nassumptions `a, b, c > 0`, `a ≥ b ≥ c`, and `a * c ≥ b ^ 2`.\nThe main proposition is `Problem.Target`; the supporting definitions make\nthe admissibility predicate and the two sides of the inequality explicit.\n-/\n\nnamespace Problem\n\n/-- The three variables are strictly positive. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The ordering condition `a ≥ b ≥ c`. -/\ndef Ordered (a b c : ℝ) : Prop :=\n a ≥ b ∧ b ≥ c\n\n/-- The additional product condition `a * c ≥ b ^ 2`. -/\ndef ProductCondition (a b c : ℝ) : Prop :=\n a * c ≥ b ^ 2\n\n/-- All hypotheses imposed on `a`, `b`, and `c` in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Positive a b c ∧ Ordered a b c ∧ ProductCondition a b c\n\n/-- The left-hand side of the claimed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / (a ^ 2 + b ^ 2) + 1 / (b ^ 2 + c ^ 2) + 1 / (c ^ 2 + a ^ 2)\n\n/-- The right-hand side of the claimed inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 1 / (a ^ 2 + b * c) + 1 / (b ^ 2 + c * a) + 1 / (c ^ 2 + a * b)\n\n/-- The inequality claimed by the problem, without its hypotheses. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete universally quantified proposition asserted by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3744a09-d3e9-55ab-b363-03bf76b6c4f5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cfd9e6f82ab653722d6679ffe152e2568039fff5bebcd0e716c8f491f53cd1de", "task_path": "tasks/nmp3_e3744a09-d3e9-55ab-b363-03bf76b6c4f5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3744a09-d3e9-55ab-b363-03bf76b6c4f5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e3a7c5b2-411c-5bb5-b8c7-98322b24749a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ and $k\\ge 0$. Prove that \n-- \\[\n-- (a+b+c)^5 \\ge \\frac{81}{\\,k+3\\,}\\,(ab+bc+ca)\\,\\big(k\\,abc + a^2b + b^2c + c^2a\\big).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nThe following inequality is asserted for every choice of four nonnegative real\nnumbers `a`, `b`, `c`, and `k`:\n`(a + b + c)^5 ≥ (81 / (k + 3)) * (a * b + b * c + c * a) *\n (k * (a * b * c) + a ^ 2 * b + b ^ 2 * c + c ^ 2 * a)`.\n-/\ndef Target : Prop :=\n ∀ (a : ℝ) (b : ℝ) (c : ℝ) (k : ℝ),\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n 0 ≤ k →\n (a + b + c) ^ 5 ≥\n (81 / (k + 3)) * (a * b + b * c + c * a) *\n (k * (a * b * c) + a ^ 2 * b + b ^ 2 * c + c ^ 2 * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3a7c5b2-411c-5bb5-b8c7-98322b24749a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c3976fcaf8c8e24dfcd5a21a2bd11fb35b03218720d512dea589d74c3933e6d1", "task_path": "tasks/nmp3_e3a7c5b2-411c-5bb5-b8c7-98322b24749a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3a7c5b2-411c-5bb5-b8c7-98322b24749a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e3ac6701-9440-50f8-adaf-f82949b2e60b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{a^{2}+b^{2}}{c\\,(a+b)}\\;\\ge\\;\\Bigl(\\sum_{\\text{cyc}}a^{2}\\Bigr)\\sqrt{\\frac{3}{abc\\,(a+b+c)}}\\,,\n-- \\] \n-- where $\\displaystyle\\sum_{\\text{cyc}}$ denotes the cyclic sum over $(a,b,c)$.\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The cyclic sum of a three-variable expression over the ordered triple\n`(a, b, c)`, namely `f a b c + f b c a + f c a b`. -/\ndef cyclicSum (f : ℝ → ℝ → ℝ → ℝ) (a b c : ℝ) : ℝ :=\n f a b c + f b c a + f c a b\n\n/-- The left-hand side of the target inequality:\n`Σ_cyc (a^2 + b^2) / (c * (a + b))`. -/\ndef lhs (a b c : ℝ) : ℝ :=\n cyclicSum (fun x y z => (x ^ 2 + y ^ 2) / (z * (x + y))) a b c\n\n/-- The cyclic sum `Σ_cyc a^2`, which is `a^2 + b^2 + c^2`. -/\ndef sumSq (a b c : ℝ) : ℝ :=\n cyclicSum (fun x _ _ => x ^ 2) a b c\n\n/-- The right-hand side of the target inequality:\n`(Σ_cyc a^2) * sqrt (3 / (a * b * c * (a + b + c)))`. -/\ndef rhs (a b c : ℝ) : ℝ :=\n sumSq a b c * Real.sqrt (3 / (a * b * c * (a + b + c)))\n\n/-- The admissibility condition that `a`, `b`, and `c` are positive real numbers. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The inequality asserted in the problem for fixed positive `a`, `b`, and `c`. -/\ndef InequalityHolds (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full statement to be proved: for all positive real numbers `a`, `b`, and\n`c`, the cyclic-sum inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3ac6701-9440-50f8-adaf-f82949b2e60b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4bd15227fd573c2d6629857a7b434a0be2a4d949068b5f07e028307f585cc272", "task_path": "tasks/nmp3_e3ac6701-9440-50f8-adaf-f82949b2e60b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3ac6701-9440-50f8-adaf-f82949b2e60b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e3c78820-d5b9-5189-a79a-951b0fa262ec", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\frac{a^5}{b^2(a^2+b^2)}+\\frac{b^5}{c^2(b^2+c^2)}+\\frac{c^5}{a^2(c^2+a^2)}\n-- \\ge \\frac{a+b+c}{2}+\\frac{2(a-c)^2}{a+b+c}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a ^ 5 / (b ^ 2 * (a ^ 2 + b ^ 2)) +\n b ^ 5 / (c ^ 2 * (b ^ 2 + c ^ 2)) +\n c ^ 5 / (a ^ 2 * (c ^ 2 + a ^ 2))\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a + b + c) / 2 + 2 * (a - c) ^ 2 / (a + b + c)\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the cyclic sum on the\nleft is at least the right-hand side stated in the problem.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3c78820-d5b9-5189-a79a-951b0fa262ec", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "072a1b016671b6ccc29829776449066ec28c32e8548766d619e5c9741edd2f3d", "task_path": "tasks/nmp3_e3c78820-d5b9-5189-a79a-951b0fa262ec", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3c78820-d5b9-5189-a79a-951b0fa262ec", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e3c99df5-5e52-5607-bc35-4eab86f8ad36", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers. Prove that \n-- $$8\\bigl(a^2+b^2+c^2\\bigr)^2\\ge (a+b+c)\\Bigl(a^3+b^3+c^3+7(ab^2+bc^2+ca^2)\\Bigr).$$\nimport Mathlib\n\nnamespace Problem\n\n/--\nThe inequality stated in the problem: for all real numbers `a`, `b`, and `c`,\n`8 * (a^2 + b^2 + c^2)^2` is at least\n`(a + b + c) * (a^3 + b^3 + c^3 + 7 * (a*b^2 + b*c^2 + c*a^2))`.\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 8 * (a ^ 2 + b ^ 2 + c ^ 2) ^ 2 ≥\n (a + b + c) * (a ^ 3 + b ^ 3 + c ^ 3 + 7 * (a * b ^ 2 + b * c ^ 2 + c * a ^ 2))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3c99df5-5e52-5607-bc35-4eab86f8ad36", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4cdc0d0dfc3a434b239f8104d3a73c81ae213648565c64dbd9ae4f597f0b2d47", "task_path": "tasks/nmp3_e3c99df5-5e52-5607-bc35-4eab86f8ad36", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3c99df5-5e52-5607-bc35-4eab86f8ad36", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e3d2c6dd-d273-59f0-9506-e380ccc8d4ff", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{(a+b)(b+c)(c+a)}{8abc}\\ge \\frac{a}{\\sqrt{a^{2}+8bc}}+\\frac{b}{\\sqrt{b^{2}+8ca}}+\\frac{c}{\\sqrt{c^{2}+8ab}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target assertion\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove the\ndisplayed inequality. The declaration below records that assertion as a\nproposition-valued definition. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`,\n`((a+b)(b+c)(c+a)) / (8abc)` is at least\n`a / sqrt(a^2 + 8bc) + b / sqrt(b^2 + 8ca) + c / sqrt(c^2 + 8ab)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n (a + b) * (b + c) * (c + a) / (8 * a * b * c) ≥\n a / Real.sqrt (a ^ 2 + 8 * b * c) +\n b / Real.sqrt (b ^ 2 + 8 * c * a) +\n c / Real.sqrt (c ^ 2 + 8 * a * b)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3d2c6dd-d273-59f0-9506-e380ccc8d4ff", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3c00ac5d920501033da1f76e6d74e0cc9886f376948e75f27f214e430fd343bb", "task_path": "tasks/nmp3_e3d2c6dd-d273-59f0-9506-e380ccc8d4ff", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3d2c6dd-d273-59f0-9506-e380ccc8d4ff", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e3fdedbc-a6a3-5cd4-9dd6-4ece460ce89f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{1}{a^{2}b+b^{2}c+c^{2}a}+\\frac{7}{12\\,(ab^{2}+bc^{2}+ca^{2})}\\ge\n-- \\frac{19}{7\\,(a^{3}+b^{3}+c^{3})+15abc}\\,. \n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the positive-real cyclic inequality\n\nThe original problem asks to prove an inequality for positive real numbers\n`a`, `b`, and `c`. The assertion is represented as a proposition-valued\ndefinition; no proof is included here.\n-/\n\nnamespace Problem\n\n/-- The inequality asserted in the problem, for positive real `a`, `b`, `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (1 : ℝ) / (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a) +\n (7 : ℝ) / ((12 : ℝ) * (a * b ^ 2 + b * c ^ 2 + c * a ^ 2)) ≥\n (19 : ℝ) / ((7 : ℝ) * (a ^ 3 + b ^ 3 + c ^ 3) + (15 : ℝ) * (a * b * c))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3fdedbc-a6a3-5cd4-9dd6-4ece460ce89f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f357e7f6539a395e6b36f5c7f307011c3f73b49c3e25ce6662eb254472d10083", "task_path": "tasks/nmp3_e3fdedbc-a6a3-5cd4-9dd6-4ece460ce89f", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e3fdedbc-a6a3-5cd4-9dd6-4ece460ce89f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e42f6f5e-ff12-5b1e-b331-796047de9d85", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Define the sequence $(L_n)$ by $L_0=2$, $L_1=1$, and $L_{n+1}=L_n+L_{n-1}$ for $n\\ge 1$. Prove that if $n\\mid L_n$ with $n>6$, then $18\\mid n$.\nimport Mathlib\n\n/-!\n# Lucas-number divisibility statement\n\nThis file formalizes the statement of the problem without proving the target.\nThe Lucas sequence is represented by `Problem.lucas`, and the assertion to be\nproved is `Problem.Target`.\n-/\n\nnamespace Problem\n\n/-- The Lucas sequence defined by `L 0 = 2`, `L 1 = 1`, and\n`L (n + 2) = L (n + 1) + L n`. -/\ndef lucas : Nat → Nat\n | 0 => 2\n | 1 => 1\n | n + 2 => lucas (n + 1) + lucas n\n\n@[simp]\ntheorem lucas_zero : lucas 0 = 2 := rfl\n\n@[simp]\ntheorem lucas_one : lucas 1 = 1 := rfl\n\n@[simp]\ntheorem lucas_add_two (n : Nat) : lucas (n + 2) = lucas (n + 1) + lucas n := rfl\n\n/-- The recurrence in the original indexing: for every `n ≥ 1`,\n`L (n + 1) = L n + L (n - 1)`. -/\ntheorem lucas_recurrence (n : Nat) (hn : 1 ≤ n) :\n lucas (n + 1) = lucas n + lucas (n - 1) := by\n cases n with\n | zero => omega\n | succ k =>\n cases k with\n | zero => rfl\n | succ k => exact lucas_add_two (k + 1)\n\n/-- The target claim: every natural number `n` that divides the `n`th Lucas\nnumber and is greater than `6` is divisible by `18`. -/\ndef Target : Prop :=\n ∀ n : Nat, n ∣ lucas n → 6 < n → 18 ∣ n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e42f6f5e-ff12-5b1e-b331-796047de9d85", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a2e61fad8b99e32c9f8e3e70105395a032e3f746e46b0ff3d12274f26725353e", "task_path": "tasks/nmp3_e42f6f5e-ff12-5b1e-b331-796047de9d85", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e42f6f5e-ff12-5b1e-b331-796047de9d85", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e43354d6-a4fa-5b58-9a8e-c360091068cc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a(b+c)}{b^2+c^2}+\\frac{b(c+a)}{c^2+a^2}+\\frac{c(a+b)}{a^2+b^2}+3 \\ge 4\\left(\\frac{ab}{ab+c^2}+\\frac{bc}{bc+a^2}+\\frac{ca}{ca+b^2}\\right).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- For every triple of positive real numbers `a`, `b`, and `c`, the stated\nthree-term rational inequality holds. All divisions are real divisions and the\nfinal comparison is non-strict. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n a * (b + c) / (b ^ 2 + c ^ 2) +\n b * (c + a) / (c ^ 2 + a ^ 2) +\n c * (a + b) / (a ^ 2 + b ^ 2) +\n (3 : ℝ) ≥\n (4 : ℝ) *\n (a * b / (a * b + c ^ 2) +\n b * c / (b * c + a ^ 2) +\n c * a / (c * a + b ^ 2))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e43354d6-a4fa-5b58-9a8e-c360091068cc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d2bea96a7f8238d87ddcbdc231397770a18050e1becb1220d852261767860b04", "task_path": "tasks/nmp3_e43354d6-a4fa-5b58-9a8e-c360091068cc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e43354d6-a4fa-5b58-9a8e-c360091068cc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e43f68cf-5984-5d11-98c3-c3698d5a69e5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $n\\ge 1$, let \n-- \\[\n-- a_n=1+\\sqrt{2}+\\sqrt[3]{3}+\\dots+\\sqrt[n]{n}\\;,\n-- \\] \n-- where $\\sqrt[k]{k}=k^{1/k}$. Prove that \n-- \\[\n-- \\displaystyle\\sum_{k=1}^{n}\\frac{k^{1/k}}{a_k^{2}}\\;<\\;&\\frac{2n+1+(\\log n)^{2}}{\\,n+1+\\tfrac12(\\log n)^{2}\\,}.\n-- \\] \n-- Here $\\log$ denotes the natural logarithm.\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\nimport Mathlib.Analysis.SpecialFunctions.Log.Basic\nimport Mathlib.Algebra.BigOperators.Group.Finset.Basic\nimport Mathlib.Data.Finset.Interval\n\n/-!\n# Formal statement of the inequality involving the sums of `k ^ (1 / k)`\n\nThe original problem defines `a n = ∑ k = 1, ..., n, k ^ (1 / k)` for\npositive natural `n`, and asks to prove the displayed strict inequality.\nThe declarations below only state the problem; they do not prove it.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The real summand `k ^ (1 / k)`, written using the real power operation. -/\ndef rootTerm (k : ℕ) : ℝ :=\n Real.rpow (k : ℝ) (1 / (k : ℝ))\n\n/-- The partial sum `a_n = 1 + sqrt 2 + ... + n^(1/n)`, encoded as\n`∑ k ∈ Finset.Icc 1 n, k ^ (1 / k)`. -/\ndef a (n : ℕ) : ℝ :=\n Finset.sum (Finset.Icc 1 n) (fun k : ℕ => rootTerm k)\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (n : ℕ) : ℝ :=\n Finset.sum (Finset.Icc 1 n) (fun k : ℕ => rootTerm k / (a k) ^ 2)\n\n/-- The right-hand side of the displayed inequality. -/\ndef rhs (n : ℕ) : ℝ :=\n (2 * (n : ℝ) + 1 + (Real.log (n : ℝ)) ^ 2) /\n ((n : ℝ) + 1 + (1 / 2 : ℝ) * (Real.log (n : ℝ)) ^ 2)\n\n/-- The strict inequality asserted for every natural number `n ≥ 1`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 1 ≤ n → lhs n < rhs n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e43f68cf-5984-5d11-98c3-c3698d5a69e5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "06580711ed6bea90ad035b9a6fc43bbe61f235bfb5a352df649dcad2db63bb40", "task_path": "tasks/nmp3_e43f68cf-5984-5d11-98c3-c3698d5a69e5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e43f68cf-5984-5d11-98c3-c3698d5a69e5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e444cd03-42bd-556c-8a48-f93eef8aa2b6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $ab+bc+ca\\le3abc$. Prove that \n-- \\[\n-- \\sqrt{\\frac{a^2+b^2}{a+b}}+\\sqrt{\\frac{b^2+c^2}{b+c}}+\\sqrt{\\frac{c^2+a^2}{c+a}}+3\\le\\sqrt{2}\\big(\\sqrt{a+b}+\\sqrt{b+c}+\\sqrt{c+a}\\big).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The three positive-variable hypotheses, grouped as one predicate. -/\ndef Positive (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The hypothesis `ab + bc + ca ≤ 3abc`. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a * b + b * c + c * a ≤ (3 : ℝ) * a * b * c\n\n/-- The left-hand side sum of the three radical fractions in the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n Real.sqrt ((a ^ 2 + b ^ 2) / (a + b)) +\n Real.sqrt ((b ^ 2 + c ^ 2) / (b + c)) +\n Real.sqrt ((c ^ 2 + a ^ 2) / (c + a))\n\n/-- The sum of the three square-root terms inside the parentheses on the right. -/\nnoncomputable def rhsBase (a b c : ℝ) : ℝ :=\n Real.sqrt (a + b) + Real.sqrt (b + c) + Real.sqrt (c + a)\n\n/-- The displayed inequality, as a predicate of `a`, `b`, and `c`. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n lhs a b c + 3 ≤ Real.sqrt 2 * rhsBase a b c\n\n/--\nThe assertion in the problem: for all positive real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca ≤ 3abc`, the displayed radical inequality holds.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Positive a b c → Constraint a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e444cd03-42bd-556c-8a48-f93eef8aa2b6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f6183469b86d952cafa6bd90bdc17296af1672bb8734f4e6f1fbea05a5df0689", "task_path": "tasks/nmp3_e444cd03-42bd-556c-8a48-f93eef8aa2b6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e444cd03-42bd-556c-8a48-f93eef8aa2b6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e45903ae-e0f3-54ac-a60f-1ab2750cd9f3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{y(x+y)}{2y+z+x}\\ge \\frac{27}{16}\\,\\frac{(y+z)(z+x)(x+y)}{(x+y+z)^{2}}\\,.\n-- \\] \n-- Here $\\displaystyle\\sum_{\\text{cyc}}$ denotes the cyclic sum over $(x,y,z)$.\nimport Mathlib\n\n/-!\n# Formalization of the cyclic inequality\n\nThis file states the inequality from `problem.md`. It contains no proof of the\ninequality; `Problem.Target` is a `Prop`-valued definition whose body is the\nmathematical assertion to be proved.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand cyclic sum\n`y(x+y)/(2y+z+x) + z(y+z)/(2z+x+y) + x(z+x)/(2x+y+z)`. -/\ndef cyclicSum (x y z : ℝ) : ℝ :=\n y * (x + y) / (2 * y + z + x) +\n z * (y + z) / (2 * z + x + y) +\n x * (z + x) / (2 * x + y + z)\n\n/-- The right-hand side of the stated inequality. -/\ndef rhs (x y z : ℝ) : ℝ :=\n (27 / 16 : ℝ) * ((y + z) * (z + x) * (x + y) / (x + y + z) ^ 2)\n\n/-- The full assertion: for all positive real `x`, `y`, and `z`, the cyclic\nleft-hand sum is at least the stated right-hand side. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z → cyclicSum x y z ≥ rhs x y z\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e45903ae-e0f3-54ac-a60f-1ab2750cd9f3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "de0efb15052a04258913646c9ab7415bf40b4fb0ea787fcd56350679b7b11165", "task_path": "tasks/nmp3_e45903ae-e0f3-54ac-a60f-1ab2750cd9f3", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e45903ae-e0f3-54ac-a60f-1ab2750cd9f3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e473a21e-ec84-55a8-a057-7d347c0a5566", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\triangle ABC$ be an acute triangle. Prove that \n-- \\[\n-- \\frac{\\cos A\\,\\cos B}{\\sin 2C}+\\frac{\\cos B\\,\\cos C}{\\sin 2A}+\\frac{\\cos C\\,\\cos A}{\\sin 2B}\\ge\\frac{\\sqrt3}{2}\\,. \n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The three interior angle measures (in radians) of a nondegenerate acute triangle. -/\ndef IsAcuteTriangleAngles (A B C : ℝ) : Prop :=\n 0 < A ∧ 0 < B ∧ 0 < C ∧\n A < Real.pi / 2 ∧ B < Real.pi / 2 ∧ C < Real.pi / 2 ∧\n A + B + C = Real.pi\n\n/-- The left-hand side of the inequality in the problem. -/\ndef TriangleInequalityLHS (A B C : ℝ) : ℝ :=\n (Real.cos A * Real.cos B) / Real.sin (2 * C) +\n (Real.cos B * Real.cos C) / Real.sin (2 * A) +\n (Real.cos C * Real.cos A) / Real.sin (2 * B)\n\n/-- The inequality asserted for every acute triangle. -/\ndef Target : Prop :=\n ∀ A B C : ℝ,\n IsAcuteTriangleAngles A B C →\n Real.sqrt 3 / 2 ≤ TriangleInequalityLHS A B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e473a21e-ec84-55a8-a057-7d347c0a5566", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "77559753d5a86dc0afe2493426369415a785e8f43624931a0a90bc2538277be3", "task_path": "tasks/nmp3_e473a21e-ec84-55a8-a057-7d347c0a5566", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e473a21e-ec84-55a8-a057-7d347c0a5566", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e4844bdb-1d5b-56ea-8e73-7c6e87c4e414", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $a+b+c=1$ and $\\alpha\\ge0$. Prove that \n-- \\[\n-- (ab+ac+bc)\\Bigl(\\frac{a}{b^{2}+\\alpha b}+\\frac{b}{c^{2}+\\alpha c}+\\frac{c}{a^{2}+\\alpha a}\\Bigr)\\ge\\frac{3}{1+3\\alpha}\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/--\nThe assertion that for all positive real numbers `a`, `b`, and `c` whose sum is\none, and for all nonnegative real numbers `alpha`, the stated cyclic inequality\nholds.\n-/\ndef Target : Prop :=\n ∀ (a b c alpha : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n a + b + c = 1 →\n 0 ≤ alpha →\n (a * b + a * c + b * c) *\n (a / (b ^ 2 + alpha * b) +\n b / (c ^ 2 + alpha * c) +\n c / (a ^ 2 + alpha * a)) ≥\n 3 / (1 + 3 * alpha)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e4844bdb-1d5b-56ea-8e73-7c6e87c4e414", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b3523d0e7d00b0b478a81dced3b58053a0f386cf80454926e5e0b57981d91ca7", "task_path": "tasks/nmp3_e4844bdb-1d5b-56ea-8e73-7c6e87c4e414", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e4844bdb-1d5b-56ea-8e73-7c6e87c4e414", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e48fa2c2-474b-513a-b534-4a901483ab8a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a, b, c$ be positive real numbers. Show that \n-- \\[\n-- \\sqrt{\\frac{2a}{b+c}}+\\sqrt{\\frac{2b}{c+a}}+\\sqrt{\\frac{2c}{a+b}}\n-- \\le \\sqrt{3\\Bigl(\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\Bigr)}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a three-variable real inequality\n\nThe source asks to prove an inequality for positive real numbers `a`, `b`, and\n`c`. The declaration below records the complete universally quantified\nproposition, with real division and the principal real square root.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`,\n`√(2a/(b+c)) + √(2b/(c+a)) + √(2c/(a+b)) ≤ √(3(a/b + b/c + c/a))`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n Real.sqrt (2 * a / (b + c)) +\n Real.sqrt (2 * b / (c + a)) +\n Real.sqrt (2 * c / (a + b)) ≤\n Real.sqrt (3 * (a / b + b / c + c / a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e48fa2c2-474b-513a-b534-4a901483ab8a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fd7130c7ab1f9c83cdc2729ad572d0408fb5c7a105eef158bc7763093f504bfd", "task_path": "tasks/nmp3_e48fa2c2-474b-513a-b534-4a901483ab8a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e48fa2c2-474b-513a-b534-4a901483ab8a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e4abff18-48dd-5616-a8ac-5a81415a13fa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ with $ab+bc+ca>0$. Prove that \n-- \\[\n-- \\sqrt{\\frac{(a^2+bc)(b+c)}{a^2+2bc}}+\n-- \\sqrt{\\frac{(b^2+ca)(c+a)}{b^2+2ca}}+\n-- \\sqrt{\\frac{(c^2+ab)(a+b)}{c^2+2ab}}\n-- \\;\\le\\;\n-- 3\\sqrt{\\frac{a+b+c}{2}}\\,.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The three variables are nonnegative real numbers. -/\ndef NonnegativeTriple (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c\n\n/-- The pairwise-sum hypothesis `ab + bc + ca > 0`. -/\ndef PairwiseSumPositive (a b c : ℝ) : Prop :=\n 0 < a * b + b * c + c * a\n\n/-- The full hypothesis of the problem: `a`, `b`, and `c` are nonnegative,\nand `ab + bc + ca > 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n NonnegativeTriple a b c ∧ PairwiseSumPositive a b c\n\n/-- The summand with distinguished variable `a`, namely\n`sqrt (((a^2 + bc)(b+c)) / (a^2 + 2bc))`. -/\ndef Summand (a b c : ℝ) : ℝ :=\n Real.sqrt (((a ^ 2 + b * c) * (b + c)) / (a ^ 2 + 2 * b * c))\n\n/-- The left-hand side of the claimed inequality, consisting of the three\ncyclic summands. -/\ndef leftHandSide (a b c : ℝ) : ℝ :=\n Summand a b c + Summand b c a + Summand c a b\n\n/-- The right-hand side of the claimed inequality,\n`3 * sqrt ((a + b + c) / 2)`. -/\ndef rightHandSide (a b c : ℝ) : ℝ :=\n 3 * Real.sqrt ((a + b + c) / 2)\n\n/-- The assertion claimed in the problem: for every nonnegative real triple\nwith positive pairwise sum, the cyclic radical sum is at most\n`3 * sqrt ((a + b + c) / 2)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → leftHandSide a b c ≤ rightHandSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e4abff18-48dd-5616-a8ac-5a81415a13fa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "19887ab2b139e828c959ff504a439cc7af186a830f0dc97e8e13576835d7a071", "task_path": "tasks/nmp3_e4abff18-48dd-5616-a8ac-5a81415a13fa", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e4abff18-48dd-5616-a8ac-5a81415a13fa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e4b485b3-7cd4-58ec-a0fb-fd8412d41b5b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p(x)$ be a polynomial with real coefficients such that $p(0)=p(n)$. Prove that there exist at least $n$ ordered pairs of real numbers $(x,y)$ satisfying $p(x)=p(y)$ and $y-x$ is a positive integer.\nimport Mathlib\n\n/-!\n# Formal statement: polynomial values and positive-integer-spaced pairs\n\nThe source problem asks to prove that if a real polynomial `p` satisfies\n`p 0 = p n`, then there are at least `n` ordered real pairs `(x, y)` for which\n`p x = p y` and `y - x` is a positive integer.\n\nThe statement is recorded as a proposition-valued definition. No proof is\nsupplied, and the definitions below do not assume the desired conclusion.\n-/\n\nnamespace Problem\n\n/-- `(x, y)` is an admissible ordered pair for the real polynomial `p` when\n`p x = p y` and `y - x` is a positive integer. -/\ndef IsAdmissiblePair (p : Polynomial ℝ) (q : ℝ × ℝ) : Prop :=\n p.eval q.1 = p.eval q.2 ∧\n ∃ m : ℕ, 0 < m ∧ q.2 - q.1 = (m : ℝ)\n\n/-- `p` has at least `n` distinct admissible ordered pairs.\n\nThe condition is expressed by an injective family indexed by `Fin n`. This is\nequivalent to the usual cardinality assertion and also works when the set of\nall admissible pairs is infinite. -/\ndef HasAtLeastNAdmissiblePairs (n : ℕ) (p : Polynomial ℝ) : Prop :=\n ∃ f : Fin n → ℝ × ℝ,\n Function.Injective f ∧ ∀ i : Fin n, IsAdmissiblePair p (f i)\n\n/-- The assertion to be proved.\n\nFor every natural number `n` and every real polynomial `p`, if\n`p.eval 0 = p.eval n`, then there exist at least `n` distinct ordered pairs\n`(x, y)` of real numbers such that `p.eval x = p.eval y` and `y - x` is a\npositive integer.\n\nThe formalization quantifies over all `n : ℕ`. Thus it also includes the\nboundary case `n = 0`, whose conclusion is vacuous; every nontrivial instance\nis the case `n ≥ 1`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (p : Polynomial ℝ),\n p.eval (0 : ℝ) = p.eval (n : ℝ) →\n HasAtLeastNAdmissiblePairs n p\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e4b485b3-7cd4-58ec-a0fb-fd8412d41b5b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "feb6244fddeef2c13082a232254eecbf1a35305372d5b116a77a7ce0b72ea2f0", "task_path": "tasks/nmp3_e4b485b3-7cd4-58ec-a0fb-fd8412d41b5b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e4b485b3-7cd4-58ec-a0fb-fd8412d41b5b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e50a21b8-e1ef-5403-941c-7efcb557bb86", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Prove that \n-- $$a\\sqrt{ac}+b\\sqrt{ab}+c\\sqrt{bc}+3\\ge 2(ab+bc+ca).$$\nimport Mathlib\n\n/-!\n# Formal statement\n\nSource problem: Let `a`, `b`, `c` be positive real numbers with\n`a + b + c = 3`. Prove that\n`a * sqrt (a * c) + b * sqrt (a * b) + c * sqrt (b * c) + 3 ≥\n 2 * (a * b + b * c + c * a)`.\n\nThe declaration below records the universally quantified assertion. It is a\n`Prop`-valued definition, not a proof.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem, with all quantification and hypotheses explicit. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a → 0 < b → 0 < c →\n a + b + c = 3 →\n a * Real.sqrt (a * c) + b * Real.sqrt (a * b) +\n c * Real.sqrt (b * c) + 3 ≥\n 2 * (a * b + b * c + c * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e50a21b8-e1ef-5403-941c-7efcb557bb86", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "27819b7df6e33ebcdc093008efc02e7b5bdf01d600935531830782aa0abb9a49", "task_path": "tasks/nmp3_e50a21b8-e1ef-5403-941c-7efcb557bb86", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e50a21b8-e1ef-5403-941c-7efcb557bb86", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e5314047-6db0-5953-970d-8948e85a8d79", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose the sequence of nonnegative integers $a_1,a_2,\\dots,a_{1997}$ satisfies \n-- \\[\n-- a_i + a_j \\le a_{i+j} \\le a_i + a_j + 1\n-- \\] \n-- for all $i,j\\ge1$ with $i+j\\le1997$. Prove that there exists a real number $x$ such that $a_n=\\lfloor n x\\rfloor$ for every $n=1,2,\\dots,1997\\,$ (where $\\lfloor\\cdot\\rfloor$ denotes the greatest integer $\\le\\,$the argument).\nimport Mathlib\n\n/-!\n# Formalization of the 1997 floor-sequence problem\n\nThe source asks to prove that every finite nonnegative integer sequence\n`a₁, …, a₁₉₉₇` satisfying the subadditivity inequalities\n`a_i + a_j ≤ a_{i+j} ≤ a_i + a_j + 1` has a real slope whose floor\nrepresentations recover all the displayed terms.\n-/\n\nnamespace Problem\n\n/-- The index type for the displayed finite sequence: the natural numbers\n`n` with `1 ≤ n` and `n ≤ N`. -/\ndef Index (N : ℕ) : Type := { n : ℕ // 1 ≤ n ∧ n ≤ N }\n\n/-- The index `i + j`, when the source hypothesis `i + j ≤ N` holds. -/\ndef Index.add {N : ℕ} (i j : Index N) (hij : i.1 + j.1 ≤ N) :\n Index N :=\n ⟨i.1 + j.1, by\n constructor\n · have hi : 1 ≤ i.1 := i.property.1\n have hj : 1 ≤ j.1 := j.property.1\n omega\n · exact hij⟩\n\n/-- A finite nonnegative-integer sequence indexed from `1` through `N`. -/\ndef Sequence (N : ℕ) : Type := Index N → ℕ\n\n/-- The inequality hypothesis on a finite sequence. It is imposed only for\nindices `i,j ≥ 1` whose sum is still at most `N`. -/\ndef Admissible {N : ℕ} (a : Sequence N) : Prop :=\n ∀ (i j : Index N) (hij : i.1 + j.1 ≤ N),\n a i + a j ≤ a (Index.add i j hij) ∧\n a (Index.add i j hij) ≤ a i + a j + 1\n\n/-- The conclusion: a single real `x` represents every displayed term as\n`a_n = ⌊n x⌋`. -/\ndef HasFloorRepresentation {N : ℕ} (a : Sequence N) : Prop :=\n ∃ x : ℝ, ∀ n : Index N, (a n : ℤ) = Int.floor ((n.1 : ℝ) * x)\n\n/-- The complete assertion of the problem for the fixed length `1997`. -/\ndef Target : Prop :=\n ∀ a : Sequence 1997, Admissible a → HasFloorRepresentation a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e5314047-6db0-5953-970d-8948e85a8d79", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "510a62f44b5d71cc111a6a377a81e366c2276a7a8be5386c2141e9505cbffd0f", "task_path": "tasks/nmp3_e5314047-6db0-5953-970d-8948e85a8d79", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e5314047-6db0-5953-970d-8948e85a8d79", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e555f14f-c806-597b-a66d-b27f2c6a4344", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A$ be a finite ring and $a,b\\in A$ such that $(ab-1)b=0$. Prove that $b(ab-1)=0$.\nimport Mathlib\n\nuniverse u\n\nnamespace Problem\n\n/--\nLet `A` be a finite ring and let `a b : A`. If `(a * b - 1) * b = 0`,\nthen `b * (a * b - 1) = 0`.\n\nThe ring is represented by Mathlib's `Ring` typeclass, so multiplication is\nassociative and the ring is unital, but not assumed commutative. Finiteness\nis represented by `Fintype A`.\n-/\ndef Target : Prop :=\n ∀ (A : Type u) [Ring A] [Fintype A] (a b : A),\n (a * b - 1) * b = 0 → b * (a * b - 1) = 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e555f14f-c806-597b-a66d-b27f2c6a4344", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6406e4880f124ce9a9f58f37f0d881ada447cbd8faeca477eb4120ace5664b9a", "task_path": "tasks/nmp3_e555f14f-c806-597b-a66d-b27f2c6a4344", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e555f14f-c806-597b-a66d-b27f2c6a4344", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e5e6a3fb-fc74-50df-9a65-e016344815f1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(a_n)_{n\\ge 0}$ be an integer sequence and $(b_n)_{n\\ge 0}$ a sequence of positive integers satisfying $a_0=0$, $a_1=1$, and for every integer $n\\ge 1$\n-- \\[\n-- a_{n+1}=\\begin{cases}\n-- a_n\\,b_n + a_{n-1}, & \\text{if } b_{\\,n-1}=1,\\\\[4pt]\n-- a_n\\,b_n - a_{n-1}, & \\text{if } b_{\\,n-1}>1 .\n-- \\end{cases}\n-- \\]\n-- Prove that at least one of the two numbers $a_{2017}$ and $a_{2018}$ is greater than or equal to $2017\\,.\nimport Mathlib.Data.Int.Basic\n\n/-!\n# Formalization of the integer recurrence problem\n\nThe source problem considers an integer sequence `a` indexed by `n ≥ 0` and a\npositive integer sequence `b`, with prescribed initial values and a two-case\nrecurrence. The target is the assertion that at least one of the two terms\n`a_2017` and `a_2018` is at least `2017`.\n-/\n\nnamespace Problem\n\n/-- The recurrence step at an index `n ≥ 1`.\n\nThe first disjunct is the case `b (n - 1) = 1`; the second is the case\n`b (n - 1) > 1`. -/\ndef Step (a : ℕ → ℤ) (b : ℕ → ℕ) (n : ℕ) : Prop :=\n (b (n - 1) = 1 ∧\n a (n + 1) = a n * (b n : ℤ) + a (n - 1)) ∨\n (1 < b (n - 1) ∧\n a (n + 1) = a n * (b n : ℤ) - a (n - 1))\n\n/-- Admissibility of a pair `(a, b)` as in the problem: `a` is an integer\nsequence, `b` is a sequence of positive integers, `a₀ = 0`, `a₁ = 1`, and\nthe stated recurrence holds for every integer `n ≥ 1`. -/\ndef AdmissiblePair (a : ℕ → ℤ) (b : ℕ → ℕ) : Prop :=\n a 0 = 0 ∧ a 1 = 1 ∧ (∀ n : ℕ, 0 < b n) ∧\n (∀ n : ℕ, 1 ≤ n → Step a b n)\n\n/-- The assertion from the source problem: for every admissible pair `(a, b)`,\nat least one of `a_2017` and `a_2018` is at least `2017`. -/\ndef Target : Prop :=\n ∀ (a : ℕ → ℤ) (b : ℕ → ℕ),\n AdmissiblePair a b →\n (2017 : ℤ) ≤ a 2017 ∨ (2017 : ℤ) ≤ a 2018\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e5e6a3fb-fc74-50df-9a65-e016344815f1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e8cd740a9ac36c3c7aaeb7ffa4a8c823057ac8212c708e4a6b4e193c9939ba13", "task_path": "tasks/nmp3_e5e6a3fb-fc74-50df-9a65-e016344815f1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e5e6a3fb-fc74-50df-9a65-e016344815f1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e5f91882-93cc-5771-b858-d47f29e8ddf5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z\\ge 0$ be real numbers such that $xy+yz+zx>0$. Prove that \n-- \\[\n-- 3\\;\\frac{x^{4}+y^{4}+z^{4}}{xy+yz+zx}\\;\\ge\\;5\\;\\frac{xy\\,(y-z)^{2}}{x^{2}+y^{2}}\\;+\\;(x^{2}+y^{2}+z^{2})\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe source problem asks to prove an inequality for nonnegative real numbers\n`x`, `y`, and `z` satisfying `xy + yz + zx > 0`.\n\nThe statement is represented as a proposition-valued definition. All\ndivisions below are the usual division operation on real numbers. The\nhypothesis `xy + yz + zx > 0` together with nonnegativity implies that the\ndenominator `x^2 + y^2` is nonzero; no additional well-definedness assumption\nis needed for the source statement.\n-/\n\nnamespace Problem\n\n/-- The nonnegativity and positive-pairwise-sum hypotheses of the problem. -/\ndef Hypotheses (x y z : ℝ) : Prop :=\n 0 ≤ x ∧ 0 ≤ y ∧ 0 ≤ z ∧ 0 < x * y + y * z + z * x\n\n/-- The asserted inequality, with the two sides written separately. -/\ndef Inequality (x y z : ℝ) : Prop :=\n 3 * ((x ^ 4 + y ^ 4 + z ^ 4) / (x * y + y * z + z * x)) ≥\n 5 * ((x * y * (y - z) ^ 2) / (x ^ 2 + y ^ 2)) +\n (x ^ 2 + y ^ 2 + z ^ 2)\n\n/-- The complete universally quantified target proposition. -/\ndef Target : Prop :=\n ∀ (x y z : ℝ), Hypotheses x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e5f91882-93cc-5771-b858-d47f29e8ddf5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c884b0ff20f86ddbaacd79b8c6fcbbb94cdc720fba4f0fecfe2c66110344929b", "task_path": "tasks/nmp3_e5f91882-93cc-5771-b858-d47f29e8ddf5", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e5f91882-93cc-5771-b858-d47f29e8ddf5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e631be61-6430-5655-85d0-c606149026f0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that $abc=1$. Prove that \n-- \\[\n-- \\frac{(a^{2}+2b^{2})(b^{2}+2c^{2})(c^{2}+2a^{2})}{a^{2}b+b^{2}c+c^{2}a}\\ge 9.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the inequality, as a real-valued function of `a`, `b`, and `c`. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n ((a ^ 2 + 2 * b ^ 2) * (b ^ 2 + 2 * c ^ 2) * (c ^ 2 + 2 * a ^ 2)) /\n (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a)\n\n/-- The assertion of the problem: for all positive real `a`, `b`, `c` with `a*b*c = 1`,\nthe displayed quotient is at least `9`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a * b * c = 1 →\n lhs a b c ≥ 9\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e631be61-6430-5655-85d0-c606149026f0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "95fd1e07e420e9ca3e791ad2e4cd31815e68fc3601141413812c89437831f7ad", "task_path": "tasks/nmp3_e631be61-6430-5655-85d0-c606149026f0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e631be61-6430-5655-85d0-c606149026f0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e649701a-1cc4-55df-a9c6-752791672a22", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}+\\frac{24(a+b+c)(ab+bc+ca)}{(a+b)(b+c)(c+a)}\\ge 30.\n-- \\]\nmodule\npublic import Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe original problem asks to prove, for all positive real numbers `a`, `b`, and\n`c`, the stated lower bound. The assertion is represented as a `Prop`-valued\ndefinition; no proof is supplied at the same time as the formalization.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The assertion that for all positive real numbers `a`, `b`, `c`,\n\\[\n \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\n +\\frac{24(a+b+c)(ab+bc+ca)}{(a+b)(b+c)(c+a)}\n \\ge 30.\n\\]\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a / b + b / c + c / a\n + (24 : ℝ) * (a + b + c) * (a * b + b * c + c * a)\n / ((a + b) * (b + c) * (c + a))\n ≥ (30 : ℝ)\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e649701a-1cc4-55df-a9c6-752791672a22", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a3b80fd8f340e088192110a7a6554b283f6a729cff9cb0e1601fad58f2bc7053", "task_path": "tasks/nmp3_e649701a-1cc4-55df-a9c6-752791672a22", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e649701a-1cc4-55df-a9c6-752791672a22", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e6509704-202b-5a83-86c5-8ea24e9fb499", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be positive real numbers. Prove that \n-- \\[\n-- \\sqrt{\\frac{a^{3}}{a^{3}+15bcd}}+\\sqrt{\\frac{b^{3}}{b^{3}+15cad}}+\\sqrt{\\frac{c^{3}}{c^{3}+15abd}}+\\sqrt{\\frac{d^{3}}{d^{3}+15abc}}\\ge 1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The generic summand occurring in the left-hand side of the inequality:\n`Real.sqrt (x ^ 3 / (x ^ 3 + 15 * y * z * w))`. -/\nnoncomputable def summand (x y z w : ℝ) : ℝ :=\n Real.sqrt (x ^ (3 : ℕ) / (x ^ (3 : ℕ) + (15 : ℝ) * y * z * w))\n\n/-- The complete left-hand side of the desired inequality. -/\nnoncomputable def lhs (a b c d : ℝ) : ℝ :=\n summand a b c d + summand b c a d + summand c a b d + summand d a b c\n\n/-- For all positive real numbers `a`, `b`, `c`, and `d`, the stated sum of four\nsquare roots is at least one. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, 0 < a → 0 < b → 0 < c → 0 < d →\n lhs a b c d ≥ (1 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e6509704-202b-5a83-86c5-8ea24e9fb499", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a9c2b29889203cca11e81d7e3a727ac588543aa3dcb2acec099728f415eb7308", "task_path": "tasks/nmp3_e6509704-202b-5a83-86c5-8ea24e9fb499", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e6509704-202b-5a83-86c5-8ea24e9fb499", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e656e19f-b125-554f-987f-44b8da32c674", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a+b+c=abc$. Prove that \n-- \\[\n-- \\frac{ab+bc+ca}{2}+\\sum_{\\text{cyc}}\\frac{a}{a+b}\\ge 6,\n-- \\] \n-- where $\\displaystyle\\sum_{\\text{cyc}}\\frac{a}{a+b}=\\frac{a}{a+b}+\\frac{b}{b+c}+\\frac{c}{c+a}\\,. $\nimport Mathlib\n\n/-!\n# Formalization of a cyclic inequality with the constraint `a + b + c = a * b * c`\n\nThe source problem asks us to prove, for positive real numbers `a`, `b`, and `c`\nsatisfying `a + b + c = a * b * c`, that\n\n`(a*b + b*c + c*a)/2 + a/(a+b) + b/(b+c) + c/(c+a) >= 6`.\n\nThis file states the target as a proposition. It intentionally contains no proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility predicate for the variables in the source problem.\n\nThe variables are positive real numbers and satisfy `a + b + c = a * b * c`.\n-/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = a * b * c\n\n/-- The left-hand side appearing in the source inequality.\n\nThe cyclic sum is written out explicitly, as in the source:\n`a/(a+b) + b/(b+c) + c/(c+a)`.\n-/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a * b + b * c + c * a) / 2 + (a / (a + b) + b / (b + c) + c / (c + a))\n\n/-- The assertion of the source problem: for every triple of positive real numbers\nsatisfying `a + b + c = a * b * c`, the displayed left-hand side is at least `6`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → 6 ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e656e19f-b125-554f-987f-44b8da32c674", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2e44ef23164dc07bb2b36603a4107bbc76e3b12030a3c5b15aa3ca20c95108de", "task_path": "tasks/nmp3_e656e19f-b125-554f-987f-44b8da32c674", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e656e19f-b125-554f-987f-44b8da32c674", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e673ff41-f6be-5bcc-aef4-237e5f2bd56f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^{2}+2bc}{(b+c)^{2}}+\\frac{b^{2}+2ca}{(c+a)^{2}}+\\frac{c^{2}+2ab}{(a+b)^{2}}\\ge\\frac94\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement for the three-variable inequality\n\nThe source asks, for positive real numbers `a`, `b`, and `c`, to prove the\nnon-strict lower bound `9 / 4` for the given cyclic sum.\n-/\n\nnamespace Problem\n\n/-- The left-hand side appearing in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + 2 * b * c) / (b + c) ^ 2 +\n (b ^ 2 + 2 * c * a) / (c + a) ^ 2 +\n (c ^ 2 + 2 * a * b) / (a + b) ^ 2\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the cyclic sum is at least\n`9 / 4`. This is the unproved target proposition, not a proof of it.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ (9 : ℝ) / 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e673ff41-f6be-5bcc-aef4-237e5f2bd56f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0be97b72c4e29cd1ade56452e14e2c7916d3a92a392215e16fe30804967089d0", "task_path": "tasks/nmp3_e673ff41-f6be-5bcc-aef4-237e5f2bd56f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e673ff41-f6be-5bcc-aef4-237e5f2bd56f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e69bd83a-612c-5543-8a6d-aa4dc8fb4c5e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$. Prove that \n-- \\[\n-- (a^2+b^2-2c^2)\\sqrt{c^2+ab}+(a^2+c^2-2b^2)\\sqrt{b^2+ac}+(b^2+c^2-2a^2)\\sqrt{a^2+bc}\\le 0.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the nonnegative-triple square-root inequality\n\nThe source asks, for nonnegative real numbers `a`, `b`, and `c`, to prove a\ncyclic inequality involving principal real square roots. This file contains\nthe target proposition only; no proof of it is asserted or supplied.\n-/\n\nnamespace Problem\n\n/--\nFor all nonnegative real numbers `a`, `b`, and `c`, the cyclic sum\n`(a² + b² - 2c²)√(c² + ab) +\n (a² + c² - 2b²)√(b² + ac) +\n (b² + c² - 2a²)√(a² + bc)`\nis at most zero.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n (a ^ 2 + b ^ 2 - 2 * c ^ 2) * Real.sqrt (c ^ 2 + a * b) +\n (a ^ 2 + c ^ 2 - 2 * b ^ 2) * Real.sqrt (b ^ 2 + a * c) +\n (b ^ 2 + c ^ 2 - 2 * a ^ 2) * Real.sqrt (a ^ 2 + b * c) ≤\n 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e69bd83a-612c-5543-8a6d-aa4dc8fb4c5e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "01cabea612a70c16e5df1b91adb934d25a33c4bdb280a0e8cdf1bcd11a0e7e6e", "task_path": "tasks/nmp3_e69bd83a-612c-5543-8a6d-aa4dc8fb4c5e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e69bd83a-612c-5543-8a6d-aa4dc8fb4c5e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e69c9c69-5ddd-5def-90f6-bb891ff87dbf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that \n-- $$\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\;\\ge\\;\\frac{c+a}{c+b}+\\frac{a+b}{a+c}+\\frac{b+c}{b+a}.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`, the stated cyclic sum\nis at least the stated symmetric sum. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n a / b + b / c + c / a ≥\n (c + a) / (c + b) + (a + b) / (a + c) + (b + c) / (b + a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e69c9c69-5ddd-5def-90f6-bb891ff87dbf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9e681a6dba842a68f592d0892d563a31284826fe55ddf0910fc70241736c489d", "task_path": "tasks/nmp3_e69c9c69-5ddd-5def-90f6-bb891ff87dbf", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e69c9c69-5ddd-5def-90f6-bb891ff87dbf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e6ae8a18-ab09-588f-abb1-02ec62435c4f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all functions $f:\\mathbb{R}\\to\\mathbb{R}$ satisfying\n-- \\[f(x+y)+f(x)f(y)=f(xy)+f(x)+f(y)\\qquad\\forall\\,x,y\\in\\mathbb{R}.\\]\nimport Mathlib\n\nnamespace Problem\n\n/-- A function `f : ℝ → ℝ` is admissible when the functional equation from the\nproblem holds for every ordered pair of real numbers. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n ∀ x y : ℝ, f (x + y) + f x * f y = f (x * y) + f x + f y\n\n/-- The identically zero function. -/\ndef zeroFunction : ℝ → ℝ :=\n fun _ => 0\n\n/-- The identity function on the reals. -/\ndef identityFunction : ℝ → ℝ :=\n fun x => x\n\n/-- The constant function whose value is `2`. -/\ndef constantTwoFunction : ℝ → ℝ :=\n fun _ => 2\n\n/-- The proposed complete answer set: exactly the zero function, the identity\nfunction, and the constant function with value `2`. -/\ndef CandidateSet : Set (ℝ → ℝ) :=\n {f : ℝ → ℝ | f = zeroFunction ∨ f = identityFunction ∨ f = constantTwoFunction}\n\n/-- A proposed set of functions is a complete answer when it is sound (every\nmember is admissible) and complete (every admissible function is a member).\nThe two conjuncts are the two directions of the classification. -/\ndef CompleteAnswer (S : Set (ℝ → ℝ)) : Prop :=\n (∀ f : ℝ → ℝ, f ∈ S → Admissible f) ∧\n (∀ f : ℝ → ℝ, Admissible f → f ∈ S)\n\n/-- The statement that the proposed explicit answer\n`{0, id, x ↦ 2}` is exactly the set of all admissible functions. -/\ndef Target : Prop :=\n CompleteAnswer CandidateSet\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e6ae8a18-ab09-588f-abb1-02ec62435c4f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c953ddac036e07df83a6f307e73ed2fb2138bf3e709746cf58da674b8be5c88c", "task_path": "tasks/nmp3_e6ae8a18-ab09-588f-abb1-02ec62435c4f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e6ae8a18-ab09-588f-abb1-02ec62435c4f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e6e264c7-c606-5467-8f3f-41cacb0775fa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{1}{a^{2}+bc}+\\frac{1}{b^{2}+ac}+\\frac{1}{c^{2}+ab}\\le \n-- \\frac{(a+b+c)^{3}}{6abc\\,(a^{2}+b^{2}+c^{2})}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a positive-real inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\n\n`1 / (a^2 + bc) + 1 / (b^2 + ca) + 1 / (c^2 + ab)\n ≤ (a + b + c)^3 / (6abc(a^2 + b^2 + c^2))`.\n\nThe target is stated as a proposition-valued definition. No proof of the\ninequality is supplied here.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n 1 / (a ^ 2 + b * c) + 1 / (b ^ 2 + c * a) + 1 / (c ^ 2 + a * b)\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n (a + b + c) ^ 3 / (6 * a * b * c * (a ^ 2 + b ^ 2 + c ^ 2))\n\n/-- The positivity assumptions on the three variables in the source problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The pointwise inequality asserted for an ordered triple `(a, b, c)`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≤ RHS a b c\n\n/-- The complete assertion of the problem: for every triple of positive real\nnumbers, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e6e264c7-c606-5467-8f3f-41cacb0775fa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "98b6ddfffa8edf12a922c98f1e3a2e93409cceff8c3aaac7f22ab3be13ada48b", "task_path": "tasks/nmp3_e6e264c7-c606-5467-8f3f-41cacb0775fa", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e6e264c7-c606-5467-8f3f-41cacb0775fa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e6fa4d68-9772-5b05-8238-cb194db6bb78", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that if $f:(0,\\infty)\\to\\mathbb{R}$ satisfies \n-- \\[\n-- f(xy)\\le \\frac{1}{y}\\,f(x)+f(y)\\qquad\\text{for all }x>0,\\;y>0,\n-- \\] \n-- then the limit $\\displaystyle\\lim_{x\\to\\infty}f(x)$ exists (as a finite real number).\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThe source problem concerns a function on the positive real numbers satisfying\na multiplicative inequality and asks to prove that its limit at positive infinity\nexists as a finite real number. This file records the statement as a `Prop`-valued\ndefinition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The domain `(0, ∞)` of the function, represented as a subtype of the reals. -/\nabbrev PositiveReals : Type := {x : ℝ // 0 < x}\n\n/-- The inequality required in the statement, for all positive `x` and `y`. -/\ndef SatisfiesInequality (f : PositiveReals → ℝ) : Prop :=\n ∀ x y : PositiveReals,\n f ⟨x.1 * y.1, mul_pos x.2 y.2⟩ ≤\n (1 / (y.1 : ℝ)) * f x + f y\n\n/-- The assertion that `f` has a finite real limit as a positive real tends to infinity. -/\ndef HasFiniteLimitAtInfinity (f : PositiveReals → ℝ) : Prop :=\n ∃ L : ℝ,\n Filter.Tendsto f\n (Filter.comap (fun x : PositiveReals => (x.1 : ℝ)) Filter.atTop)\n (nhds L)\n\n/--\nThe full assertion of the source problem: every function on `(0, ∞)` satisfying\nthe displayed inequality has a finite real limit at positive infinity.\n-/\ndef Target : Prop :=\n ∀ f : PositiveReals → ℝ, SatisfiesInequality f → HasFiniteLimitAtInfinity f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e6fa4d68-9772-5b05-8238-cb194db6bb78", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5832bcee1048d31e36a7e69d20d0aedcc71f9f078da00b9e081c0c4657bb559f", "task_path": "tasks/nmp3_e6fa4d68-9772-5b05-8238-cb194db6bb78", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e6fa4d68-9772-5b05-8238-cb194db6bb78", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e70571eb-9cda-5664-bc01-885b40c29f8c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any triangle with angles $A$, $B$, $C$ (so $A,B,C>0$ and $A+B+C=\\pi$), the following inequality holds:\n-- \\[\n-- \\frac{\\tan\\frac{A}{2}}{\\tan\\frac{B}{2}}+\\frac{\\tan\\frac{B}{2}}{\\tan\\frac{C}{2}}+\\frac{\\tan\\frac{C}{2}}{\\tan\\frac{A}{2}}\n-- \\;\\ge\\;\n-- \\frac{\\sin\\frac{A}{2}}{\\sin\\frac{B}{2}}+\\frac{\\sin\\frac{B}{2}}{\\sin\\frac{C}{2}}+\\frac{\\sin\\frac{C}{2}}{\\sin\\frac{A}{2}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the triangle half-angle inequality\n\nThe source problem asks us to prove that, for every triple of positive reals\n`A`, `B`, `C` whose sum is `π`, a certain sum of quotients of half-angle\ntangents is at least the corresponding sum of half-angle sine quotients.\n\nThis file states the complete theorem as a proposition-valued definition; it\ndeliberately contains no proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The source problem's condition that `A`, `B`, and `C` are the angles of a\ntriangle: all are positive and their sum is `π`. -/\ndef IsTriangleAngleTriple (A B C : ℝ) : Prop :=\n 0 < A ∧ 0 < B ∧ 0 < C ∧ A + B + C = Real.pi\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (A B C : ℝ) : ℝ :=\n Real.tan (A / 2) / Real.tan (B / 2) +\n Real.tan (B / 2) / Real.tan (C / 2) +\n Real.tan (C / 2) / Real.tan (A / 2)\n\n/-- The right-hand side of the displayed inequality. -/\ndef rhs (A B C : ℝ) : ℝ :=\n Real.sin (A / 2) / Real.sin (B / 2) +\n Real.sin (B / 2) / Real.sin (C / 2) +\n Real.sin (C / 2) / Real.sin (A / 2)\n\n/-- The displayed inequality, for arbitrary real `A`, `B`, and `C`. -/\ndef InequalityHolds (A B C : ℝ) : Prop :=\n lhs A B C ≥ rhs A B C\n\n/-- The complete assertion of the source problem: for every triple of triangle\nangles, the displayed half-angle tangent quotient sum is at least the\nhalf-angle sine quotient sum. -/\ndef Target : Prop :=\n ∀ A B C : ℝ,\n IsTriangleAngleTriple A B C → InequalityHolds A B C\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e70571eb-9cda-5664-bc01-885b40c29f8c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fdda0f0cce9665bb603c0a2213c97e255d36d04851425c9e5458224c2b86221d", "task_path": "tasks/nmp3_e70571eb-9cda-5664-bc01-885b40c29f8c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e70571eb-9cda-5664-bc01-885b40c29f8c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e7593791-356c-5c9f-856f-4e035df17bed", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. Let $A\\subseteq\\{1,2,\\dots ,n\\}$ be a subset with the property that for every $x\\in A$ there are at most one other element of $A$ that is divisible by $x$. Prove that the size of a largest such subset satisfies \n-- \\[\n-- \\frac{2n}{3}\\le |A|\\le\\Big\\lceil\\frac{3n}{4}\\Big\\rceil .\n-- \\]\nimport Mathlib\n\n/-!\n# Largest subsets of `{1, ..., n}` with at most one larger multiple\n\nThis file formalizes the statement of the problem. It does not prove the\nassertion: `Problem.Target` is a proposition-valued definition.\n-/\n\nnamespace Problem\n\n/-- An element `y` is an *other element* of `A` that is divisible by `x` when\n`y` belongs to `A`, `y ≠ x`, and `x ∣ y`. -/\ndef OtherMultipleOf (A : Finset ℕ) (x y : ℕ) : Prop :=\n y ∈ A ∧ y ≠ x ∧ x ∣ y\n\n/-- `A` is an admissible subset for `n`: it is a subset of `{1, 2, ..., n}`,\nand every `x ∈ A` has at most one other element of `A` that is divisible by\n`x`. -/\ndef Admissible (n : ℕ) (A : Finset ℕ) : Prop :=\n A ⊆ Finset.Icc (1 : ℕ) n ∧\n ∀ x : ℕ, x ∈ A →\n ∀ y : ℕ, OtherMultipleOf A x y →\n ∀ z : ℕ, OtherMultipleOf A x z → y = z\n\n/-- `k` is the cardinality of a largest admissible subset for `n`. This says\nboth that an admissible subset of cardinality `k` exists and that no\nadmissible subset has larger cardinality. -/\ndef IsLargestAdmissibleCard (n k : ℕ) : Prop :=\n (∃ A : Finset ℕ, Admissible n A ∧ A.card = k) ∧\n ∀ A : Finset ℕ, Admissible n A → A.card ≤ k\n\n/-- The rational lower-bound condition `2n/3 ≤ k`. -/\ndef LowerBoundAt (n k : ℕ) : Prop :=\n (2 * (n : ℚ) / 3 : ℚ) ≤ (k : ℚ)\n\n/-- The upper-bound condition `k ≤ ceil(3n/4)`, with the ceiling taken in `ℕ`\nafter regarding `3n/4` as a rational number. -/\ndef UpperBoundAt (n k : ℕ) : Prop :=\n k ≤ Nat.ceil (3 * (n : ℚ) / 4)\n\n/-- The formal target: for every positive integer `n`, a largest admissible\nsubset has cardinality `k`, and that same cardinality satisfies\n`2n/3 ≤ k ≤ ceil(3n/4)`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n →\n ∃ k : ℕ,\n IsLargestAdmissibleCard n k ∧ LowerBoundAt n k ∧ UpperBoundAt n k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e7593791-356c-5c9f-856f-4e035df17bed", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dad6fff29bdc4fa89be1c111abc071ab8e3f24a29200513fc5974333be56d05b", "task_path": "tasks/nmp3_e7593791-356c-5c9f-856f-4e035df17bed", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e7593791-356c-5c9f-856f-4e035df17bed", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e762a70a-1ff3-5c0e-8c51-980a73585600", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $X:\\mathbb{R}^2\\to\\mathbb{R}^2$ be a bijection such that for every (Euclidean) circle $C$ in the plane the image $X(C)$ is also a circle. Prove that $X$ maps every straight line onto a straight line.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Sphere.Basic\n\n/-!\n# Formal statement: circle-preserving bijections of the Euclidean plane\n\nThis file formalizes the statement of the problem. The plane is represented by\n`EuclideanSpace ℝ (Fin 2)`, whose norm and distance are the usual Euclidean ones.\nA circle is a metric sphere of strictly positive radius, and a line is the affine\nspan of two distinct points. No proof of the target assertion is supplied.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane `ℝ²`. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A Euclidean circle: a metric circle with a strictly positive radius. -/\ndef IsCircle (C : Set Plane) : Prop :=\n ∃ (center : Plane) (radius : ℝ), 0 < radius ∧ C = Metric.sphere center radius\n\n/-- A straight line: the full affine line through two distinct points. -/\ndef IsLine (L : Set Plane) : Prop :=\n ∃ p q : Plane, p ≠ q ∧ L = (affineSpan ℝ ({p, q} : Set Plane) : Set Plane)\n\n/-- A map sends every Euclidean circle to a Euclidean circle. -/\ndef CirclePreserving (X : Plane → Plane) : Prop :=\n ∀ C : Set Plane, IsCircle C → IsCircle (X '' C)\n\n/-- A map sends every straight line onto a straight line. -/\ndef LinePreserving (X : Plane → Plane) : Prop :=\n ∀ L : Set Plane, IsLine L → IsLine (X '' L)\n\n/-- Statement to be proved: every bijection of the Euclidean plane that maps every\ncircle to a circle also maps every straight line onto a straight line. -/\ndef Target : Prop :=\n ∀ X : Plane → Plane,\n Function.Bijective X → CirclePreserving X → LinePreserving X\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e762a70a-1ff3-5c0e-8c51-980a73585600", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "635591d2234ec0e3e27b92ba4b179df9f581355fe364bdc52250a710d9cdd4a9", "task_path": "tasks/nmp3_e762a70a-1ff3-5c0e-8c51-980a73585600", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e762a70a-1ff3-5c0e-8c51-980a73585600", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e7885217-5f7d-5f2a-81cf-446118d04895", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\bigl(a^3+b^3+c^3+abc\\bigr)\\,(a+b-c)\\,(b+c-a)\\,(c+a-b)\\le 4(abc)^2\\,. \n-- \\]\nmodule\n\npublic import Mathlib.Basic.Real.Basic\n\n@[expose] public section\n\n/-!\n# Formal statement\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\n`(a^3 + b^3 + c^3 + abc) (a + b - c) (b + c - a) (c + a - b)\n ≤ 4 (abc)^2`.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive reals `a`, `b`, and `c`,\n`(a^3 + b^3 + c^3 + abc) * (a + b - c) * (b + c - a) * (c + a - b)`\nis at most `4 * (abc)^2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n (a ^ 3 + b ^ 3 + c ^ 3 + a * b * c) *\n (a + b - c) * (b + c - a) * (c + a - b) ≤\n (4 : ℝ) * (a * b * c) ^ 2\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e7885217-5f7d-5f2a-81cf-446118d04895", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3fd24f5f586949158e8624f7070906a79dd9d2525a4007cb65841e6603e0279a", "task_path": "tasks/nmp3_e7885217-5f7d-5f2a-81cf-446118d04895", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e7885217-5f7d-5f2a-81cf-446118d04895", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e797c432-f971-5c80-9946-df830698c2ce", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^6+b^6+c^6+5abc=8$. Prove that \n-- \\[\n-- 2+\\frac1{abc}\\;\\ge\\;\\frac{a^2+bc}{a(b+c)}+\\frac{b^2+ca}{b(c+a)}+\\frac{c^2+ab}{c(a+b)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe source asks to prove an inequality for positive real numbers `a`, `b`, and `c`\nsatisfying `a^6 + b^6 + c^6 + 5abc = 8`.\n\nThis file only records the proposition; it deliberately contains no proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side `2 + 1 / (abc)` of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 2 + 1 / (a * b * c)\n\n/-- The first summand `(a^2 + bc) / (a(b+c))` on the right-hand side. -/\nnoncomputable def firstTerm (a b c : ℝ) : ℝ :=\n (a ^ 2 + b * c) / (a * (b + c))\n\n/-- The second summand `(b^2 + ca) / (b(c+a))` on the right-hand side. -/\nnoncomputable def secondTerm (a b c : ℝ) : ℝ :=\n (b ^ 2 + c * a) / (b * (c + a))\n\n/-- The third summand `(c^2 + ab) / (c(a+b))` on the right-hand side. -/\nnoncomputable def thirdTerm (a b c : ℝ) : ℝ :=\n (c ^ 2 + a * b) / (c * (a + b))\n\n/-- The complete right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n firstTerm a b c + secondTerm a b c + thirdTerm a b c\n\n/--\nThe formal target: for all positive real `a`, `b`, `c` satisfying\n`a^6 + b^6 + c^6 + 5abc = 8`,\n`2 + 1/(abc)` is at least the specified sum of three fractions.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 6 + b ^ 6 + c ^ 6 + 5 * a * b * c = 8 →\n lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e797c432-f971-5c80-9946-df830698c2ce", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3af18981e469354cf30ac199f01c505efdae8b5fe5b2517ce3c07155bbe5a449", "task_path": "tasks/nmp3_e797c432-f971-5c80-9946-df830698c2ce", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e797c432-f971-5c80-9946-df830698c2ce", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e7ab2891-1f9b-5562-b401-a9338553cf7f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A nonconstant polynomial $f$ with integer coefficients has the property that for each prime $p$ there exist a prime $q$ and a positive integer $m$ such that $f(p)=q^{\\,m}$. Prove that $f(x)=x^{n}$ for some positive integer $n$.\nimport Mathlib\n\n/-!\n# Formalization of the polynomial prime-power values problem\n\nA nonconstant integer polynomial `f` is assumed to satisfy: for every natural\nprime `p`, the integer `f.eval p` is a positive power of a natural prime `q`.\nThe conclusion is that `f` is the monomial `X ^ n` for some positive natural\nnumber `n`.\n-/\n\nnamespace Problem\n\n/-- The hypothesis on the integer polynomial `f`: for every prime `p`, the\nvalue at `p` is a power `q ^ m` where `q` is prime and `m` is a positive\ninteger. -/\ndef Admissible (f : Polynomial ℤ) : Prop :=\n ∀ p : ℕ, Nat.Prime p →\n ∃ q : ℕ, Nat.Prime q ∧\n ∃ m : ℕ, 0 < m ∧ f.eval (p : ℤ) = (q : ℤ) ^ m\n\n/-- The asserted classification conclusion: `f` is `X ^ n` for some positive\ninteger `n`. -/\ndef Conclusion (f : Polynomial ℤ) : Prop :=\n ∃ n : ℕ, 0 < n ∧ f = Polynomial.X ^ n\n\n/-- The full mathematical statement to be proved: every nonconstant integer\npolynomial satisfying the prime-power value condition is a positive power of\n`X`. -/\ndef Target : Prop :=\n ∀ f : Polynomial ℤ, 0 < f.natDegree → Admissible f → Conclusion f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e7ab2891-1f9b-5562-b401-a9338553cf7f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f60512bb3ab90f665bb700f0b5350b2d89cf5670e996af7d2fa303265ad414e8", "task_path": "tasks/nmp3_e7ab2891-1f9b-5562-b401-a9338553cf7f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e7ab2891-1f9b-5562-b401-a9338553cf7f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e7e2d93d-d907-5aa7-acea-69bc996a51b1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that $648x^5-648x^4+96x^3+25x^2+6x+1>0$ for all $x\\ge0$.\nimport Mathlib\n\n/-!\n# Formal statement for the polynomial positivity problem\n\nThe source asks to prove that a fixed degree-five real polynomial is positive for\nevery nonnegative real number. This file records the mathematical assertion as a\n`Prop`-valued definition; no proof of the assertion is supplied here.\n-/\n\nnamespace Problem\n\n/-- The polynomial appearing in the problem, evaluated at a real number `x`. -/\ndef polynomial (x : ℝ) : ℝ :=\n 648 * x ^ 5 - 648 * x ^ 4 + 96 * x ^ 3 + 25 * x ^ 2 + 6 * x + 1\n\n/-- The assertion to be proved: `648x^5 - 648x^4 + 96x^3 + 25x^2 + 6x + 1 > 0`\nfor every real number `x` satisfying `x ≥ 0`. -/\ndef Target : Prop :=\n ∀ (x : ℝ), 0 ≤ x → 0 < polynomial x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e7e2d93d-d907-5aa7-acea-69bc996a51b1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e650d10f79ec6ebdd4d1073b8891639f8ef6487393791dbe85ef4657365d91f1", "task_path": "tasks/nmp3_e7e2d93d-d907-5aa7-acea-69bc996a51b1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e7e2d93d-d907-5aa7-acea-69bc996a51b1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e7ebf810-a73c-5454-91f0-b5fa77aced81", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let the sequence be defined by \\(a_{1}=5\\) and \\(a_{n+1}=a_{n}^{3}-2a_{n}^{2}+2\\) for all \\(n\\ge 1\\). Let \\(p\\) be a prime such that \\(p\\equiv 3\\pmod 4\\) and \\(p\\mid a_{2011}+1\\). Prove that \\(p=3\\).\nimport Mathlib\n\n/-!\n# Formalization of a recurrence and a prime-divisibility statement\n\nThe original sequence is indexed from `1`. The helper `seq` is indexed from `0`\nand stores the same terms shifted by one: `seq k` is the original term `a_{k+1}`.\nThe definition `a n = seq (n - 1)` therefore has the original indexing for every\n`n ≥ 1`.\n-/\n\nnamespace Problem\n\n/-- The one-step polynomial `x ↦ x^3 - 2x^2 + 2`. -/\ndef step (x : ℤ) : ℤ := x ^ 3 - 2 * x ^ 2 + 2\n\n/-- Zero-indexed helper for the recurrence: `seq k` is the original term `a_{k+1}`. -/\ndef seq : ℕ → ℤ\n | 0 => 5\n | k + 1 => step (seq k)\n\n/-- The sequence `a` from the problem, with its original indexing on positive indices.\nThe value at the out-of-domain index `0` is immaterial and is defined through\nnatural-number subtraction in the helper shift. -/\ndef a (n : ℕ) : ℤ := seq (n - 1)\n\n/-- The initial condition of the sequence: the original term `a₁` is `5`. -/\nlemma a_one : a 1 = 5 := rfl\n\n/-- The recurrence, for every original index `n ≥ 1`. -/\nlemma a_succ (n : ℕ) (hn : 1 ≤ n) : a (n + 1) = step (a n) := by\n obtain ⟨k, rfl⟩ := Nat.exists_eq_add_of_le hn\n simp only [a, Nat.add_sub_cancel]\n rw [Nat.add_comm 1 k]\n rfl\n\n/-- A natural number `p` satisfies all hypotheses imposed on the prime in the problem. -/\ndef IsAdmissible (p : ℕ) : Prop :=\n Nat.Prime p ∧ p % 4 = 3 ∧ (p : ℤ) ∣ a 2011 + 1\n\n/-- The assertion to be proved: every admissible prime `p` is equal to `3`. -/\ndef Target : Prop :=\n ∀ p : ℕ, IsAdmissible p → p = 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e7ebf810-a73c-5454-91f0-b5fa77aced81", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "526d979d53ecb8490b0d5dbafef4522edfbfe1e09f36fcaa95ff0a123acab1f0", "task_path": "tasks/nmp3_e7ebf810-a73c-5454-91f0-b5fa77aced81", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e7ebf810-a73c-5454-91f0-b5fa77aced81", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e7ee51d4-952d-537e-ad5d-afe1b6f1b4e3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive numbers such that $a^2+b^2+c^2=\\frac34$. Prove that \n-- \\[\n-- \\frac{ab}{ab+1-a}+\\frac{bc}{bc+1-b}+\\frac{ca}{ca+1-c}\\le 1\\, .\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The three variables are strictly positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The quadratic constraint imposed on the three variables. -/\ndef SquareSumCondition (a b c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 = (3 : ℝ) / 4\n\n/-- The admissible triples in the problem: three positive real numbers whose\nsquares sum to `3 / 4`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositiveTriple a b c ∧ SquareSumCondition a b c\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * b / (a * b + 1 - a) +\n b * c / (b * c + 1 - b) +\n c * a / (c * a + 1 - c)\n\n/-- The complete universal statement of the problem. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 = (3 : ℝ) / 4 →\n lhs a b c ≤ (1 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e7ee51d4-952d-537e-ad5d-afe1b6f1b4e3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b49f1755adddce78a20a826773826ad8a72c0ce1cdef5133b2922526d996fc7a", "task_path": "tasks/nmp3_e7ee51d4-952d-537e-ad5d-afe1b6f1b4e3", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e7ee51d4-952d-537e-ad5d-afe1b6f1b4e3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e837eec4-6e5f-583c-aef7-d84d1229d1cc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all real numbers $a,b,c$, prove that \n-- \\[\n-- (a^2+b^2+c^2)^2 \\ge 3(a+b+c)\\bigl(a^2b+b^2c+c^2a+abc-ab^2-bc^2-ca^2\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the real three-variable inequality\n\nThe source problem asks to prove the stated inequality for every three real\nnumbers. The declaration below records only that proposition; it does not\nprovide a proof.\n-/\n\nnamespace Problem\n\n/-- For all real numbers `a`, `b`, and `c`,\n`(a^2 + b^2 + c^2)^2` is at least\n`3 * (a + b + c) * (a^2*b + b^2*c + c^2*a + a*b*c - a*b^2 - b*c^2 - c*a^2)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n (a ^ 2 + b ^ 2 + c ^ 2) ^ 2 ≥\n 3 * (a + b + c) *\n (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a + a * b * c -\n a * b ^ 2 - b * c ^ 2 - c * a ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e837eec4-6e5f-583c-aef7-d84d1229d1cc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4098494df73a35ac232f0c8a0fe16ea5500f24ed1d8e2b6f4fa38591b5911728", "task_path": "tasks/nmp3_e837eec4-6e5f-583c-aef7-d84d1229d1cc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e837eec4-6e5f-583c-aef7-d84d1229d1cc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e87bc3d7-94c2-594a-ad6a-5984e9d4ba63", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{a+2}+\\frac{1}{b+2}+\\frac{1}{c+2}\\ge\n-- \\frac{1}{1+b+c}+ \\frac{1}{1+a+c}+ \\frac{1}{1+a+b}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The positivity hypotheses for the three variables. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The product constraint `a * b * c = 1`. -/\ndef ProductEqOne (a b c : ℝ) : Prop :=\n a * b * c = 1\n\n/-- The complete set of hypotheses of the problem: `a`, `b`, and `c` are\npositive reals and their product is one. -/\ndef Hypotheses (a b c : ℝ) : Prop :=\n PositiveTriple a b c ∧ ProductEqOne a b c\n\n/-- The left-hand side of the displayed inequality. -/\ndef LeftHandSide (a b c : ℝ) : ℝ :=\n 1 / (a + 2) + 1 / (b + 2) + 1 / (c + 2)\n\n/-- The right-hand side of the displayed inequality. -/\ndef RightHandSide (a b c : ℝ) : ℝ :=\n 1 / (1 + b + c) + 1 / (1 + a + c) + 1 / (1 + a + b)\n\n/-- The displayed inequality as a predicate on `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LeftHandSide a b c ≥ RightHandSide a b c\n\n/-- The full statement: for every positive real triple whose product is one,\nthe displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Hypotheses a b c → Inequality a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e87bc3d7-94c2-594a-ad6a-5984e9d4ba63", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9a93b99943387475573e211a3019ee5122fbb74a3c86b7e4d8937e012da05e9b", "task_path": "tasks/nmp3_e87bc3d7-94c2-594a-ad6a-5984e9d4ba63", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e87bc3d7-94c2-594a-ad6a-5984e9d4ba63", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e89a778c-a4e2-5b97-b7df-3288f9878b07", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d$ be positive real numbers and let $k\\ge 0$. Prove that \n-- \\[\n-- (2a-b-c)\\frac{a^{k}}{(b+c)^{\\,k+1}}+(2b-c-d)\\frac{b^{k}}{(c+d)^{\\,k+1}}+(2c-d-a)\\frac{c^{k}}{(d+a)^{\\,k+1}}+(2d-a-b)\\frac{d^{k}}{(a+b)^{\\,k+1}}\\ge 0\\,.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formal statement for the four-variable cyclic real-power inequality\n\nThe source problem asks to prove, for positive real `a`, `b`, `c`, `d` and\nnonnegative real `k`, the cyclic inequality displayed in `Problem.Target`.\n\nThis file only formalizes the statement; it does not assert or prove the\ninequality as a theorem.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality from the problem statement.\n\nEach occurrence of a real power is represented by `Real.rpow`. -/\nnoncomputable def LHS (a b c d k : ℝ) : ℝ :=\n ((2 * a - b - c) * Real.rpow a k) / Real.rpow (b + c) (k + 1) +\n ((2 * b - c - d) * Real.rpow b k) / Real.rpow (c + d) (k + 1) +\n ((2 * c - d - a) * Real.rpow c k) / Real.rpow (d + a) (k + 1) +\n ((2 * d - a - b) * Real.rpow d k) / Real.rpow (a + b) (k + 1)\n\n/-- The assertion to be proved.\n\nFor all positive real numbers `a`, `b`, `c`, `d` and every nonnegative real\nnumber `k`, the cyclic four-term expression is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c d k : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d → 0 ≤ k →\n 0 ≤ LHS a b c d k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e89a778c-a4e2-5b97-b7df-3288f9878b07", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "549ed64feef4c9593d532f9ffd6b6d500977dcdbcbfb47148855cfc0fb2b780d", "task_path": "tasks/nmp3_e89a778c-a4e2-5b97-b7df-3288f9878b07", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e89a778c-a4e2-5b97-b7df-3288f9878b07", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e8be317e-d704-59a4-9bc8-ae46dd4275b2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb R$. Prove that \n-- \\[\n-- \\bigl(a^2+2\\bigr)\\bigl(b^2+2\\bigr)\\bigl(c^2+2\\bigr)\\ge \\bigl(2-a-b-c+abc\\bigr)^2.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the inequality in `problem.md`\n\nThe original problem asks for a proof of a universal inequality over three real\nnumbers. This file records the assertion as a proposition; it does not provide\na proof.\n-/\n\nnamespace Problem\n\n/-- For all real `a`, `b`, and `c`,\n`(a^2 + 2)(b^2 + 2)(c^2 + 2) ≥ (2 - a - b - c + abc)^2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n (a ^ 2 + 2) * (b ^ 2 + 2) * (c ^ 2 + 2) ≥\n (2 - a - b - c + a * b * c) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e8be317e-d704-59a4-9bc8-ae46dd4275b2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7d5fd07c9d031aa1156c308a7aab05844b33bd36c49aa8b3f02f649e06a5f5b5", "task_path": "tasks/nmp3_e8be317e-d704-59a4-9bc8-ae46dd4275b2", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e8be317e-d704-59a4-9bc8-ae46dd4275b2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e90b949c-e4dc-5a28-a2dc-4f04abef4ed6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\ge 0$ such that $a+b+c+d=4$. Prove that \n-- \\[\n-- a^4+b^4+c^4+d^4 \\;\\ge\\; 4abcd \\;+\\; 32\\,(a-1)(b-1)(c-1)(d-1).\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The nonnegativity hypotheses on the four variables. -/\ndef Nonnegative (a b c d : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 ≤ d\n\n/-- The prescribed sum of the four variables. -/\ndef SumEqFour (a b c d : ℝ) : Prop :=\n a + b + c + d = 4\n\n/-- The admissible quadruples in the problem: four nonnegative real numbers\nwhose sum is `4`. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n Nonnegative a b c d ∧ SumEqFour a b c d\n\n/-- The inequality asserted for every admissible quadruple. -/\ndef Inequality (a b c d : ℝ) : Prop :=\n a ^ 4 + b ^ 4 + c ^ 4 + d ^ 4 ≥\n 4 * a * b * c * d + 32 * (a - 1) * (b - 1) * (c - 1) * (d - 1)\n\n/-- The full statement to be proved: for all nonnegative real numbers `a`, `b`,\n`c`, and `d` with sum `4`, the displayed fourth-power inequality holds. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Inequality a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e90b949c-e4dc-5a28-a2dc-4f04abef4ed6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1daf0ad5090d4042e13becbaa88ad344abbb5484660db9cfd79301b523750f31", "task_path": "tasks/nmp3_e90b949c-e4dc-5a28-a2dc-4f04abef4ed6", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e90b949c-e4dc-5a28-a2dc-4f04abef4ed6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e90e40e0-0847-57b2-b21c-dfda52a5f976", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A,B\\in\\mathcal{M}_{2}(\\mathbb{R})$ be real $2\\times2$ matrices satisfying $A^{2}+B^{2}=AB$. Prove that $(AB-BA)^{2}=O_{2}$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The type `M₂(ℝ)` of real `2 × 2` matrices. -/\nabbrev RealMatrix2x2 : Type := Matrix (Fin 2) (Fin 2) ℝ\n\n/-- The zero `2 × 2` matrix `O₂`. -/\ndef O2 : RealMatrix2x2 := 0\n\n/-- The hypothesis `A² + B² = AB`, with matrix multiplication and addition. -/\ndef Hypothesis (A B : RealMatrix2x2) : Prop :=\n A * A + B * B = A * B\n\n/-- The conclusion `(AB - BA)² = O₂`, with matrix multiplication and subtraction. -/\ndef Conclusion (A B : RealMatrix2x2) : Prop :=\n (A * B - B * A) * (A * B - B * A) = O2\n\n/-- For all real `2 × 2` matrices `A` and `B`, if `A² + B² = AB`, then\n`(AB - BA)² = O₂`. -/\ndef Target : Prop :=\n ∀ (A B : RealMatrix2x2), Hypothesis A B → Conclusion A B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e90e40e0-0847-57b2-b21c-dfda52a5f976", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3c72b73aec00871c48e934ed1b3e725d25af6537c1686176d8f78c03558fb99d", "task_path": "tasks/nmp3_e90e40e0-0847-57b2-b21c-dfda52a5f976", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e90e40e0-0847-57b2-b21c-dfda52a5f976", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e93b546b-7240-5b71-b7ea-ccc566ee5a33", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If $a,b,c$ are nonnegative real numbers such that $a+b+c=2$, then \n-- \\[\n-- \\frac{\\sqrt{a+b}}{a+1}+\\frac{\\sqrt{b+c}}{b+1}+\\frac{\\sqrt{c+a}}{c+1}\\ge\\frac{4\\sqrt{2}}{3}.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the nonnegative-real inequality\n\nThis file records the statement of the problem only. In particular,\n`Problem.Target` is a proposition-valued definition; it is not accompanied\nby a proof.\n-/\n\nnamespace Problem\n\n/-- The admissible triples in the problem: nonnegative real numbers whose sum is two. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a + b + c = 2\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n Real.sqrt (a + b) / (a + 1) +\n Real.sqrt (b + c) / (b + 1) +\n Real.sqrt (c + a) / (c + 1)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def RHS : ℝ :=\n 4 * Real.sqrt 2 / 3\n\n/-- The precise assertion from the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ RHS\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e93b546b-7240-5b71-b7ea-ccc566ee5a33", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "507d50e2f70bc7747299f1d9f9367013d00a8c0ee9f5a4c775404c3cb4481ba8", "task_path": "tasks/nmp3_e93b546b-7240-5b71-b7ea-ccc566ee5a33", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e93b546b-7240-5b71-b7ea-ccc566ee5a33", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e964fb62-78b0-525e-8a0a-0788cc8608b0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a+\\sqrt{ab}+\\sqrt[3]{abc}}{3}\\;\\le\\;\\sqrt[3]{\\,a\\cdot\\frac{a+b}{2}\\cdot\\frac{a+b+c}{3}\\,}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable mean inequality\n\nThis file records the proposition asserted in `problem.md`, not a proof of it.\nThe real cube root of a positive real number is represented by the real power\nwith exponent `1 / 3`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The real cube root, encoded as the real power with exponent `1 / 3`.\nOn the positive arguments occurring in the target, this is the usual real\ncube root. -/\ndef cubeRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 3 : ℝ)\n\n/-- For all positive real numbers `a`, `b`, and `c`,\n`(a + sqrt(a*b) + cbrt(a*b*c)) / 3` is at most\n`cbrt(a * ((a+b)/2) * ((a+b+c)/3))`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n (a + Real.sqrt (a * b) + cubeRoot (a * b * c)) / 3 ≤\n cubeRoot (a * ((a + b) / 2) * ((a + b + c) / 3))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e964fb62-78b0-525e-8a0a-0788cc8608b0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cdcb58676936ea77e4fee1640c0d48fc25e99865735e8f46d6c1bcda77633352", "task_path": "tasks/nmp3_e964fb62-78b0-525e-8a0a-0788cc8608b0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e964fb62-78b0-525e-8a0a-0788cc8608b0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e972c6c5-6517-537c-903b-bdf797877012", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,m,n$ be integers greater than $1$ such that the $m$‑fold tetration of $x$ equals the $n$‑fold tetration of $y$, i.e. \n-- \\[\n-- \\underbrace{x^{\\,x^{\\,\\cdot^{\\cdot^{x}}}}}_{m\\text{ times}} \\;=\\; \\underbrace{y^{\\,y^{\\,\\cdot^{\\cdot^{y}}}}}_{n\\text{ times}}\\!,\n-- \\]\n-- or equivalently $\\,^m x = \\,^n y$, where $^1a = a$ and $^{k+1}a = a^{\\,^{k}a}$ for $k\\ge1$. \n-- Prove that this forces $m=n$.\nimport Mathlib\n\n/-!\n# Formalization of the tetration equality problem\n\nThe source problem defines the right-associated `k`-fold tetration of a base\n`a` by `^1 a = a` and `^(k+1) a = a ^ (^k a)` for `k >= 1`. The declarations\nbelow make that iteration explicit for integer bases. Since a tower with\nheight at least one and base greater than one is a positive integer, its value\nmay safely be used as the natural exponent required by integer exponentiation.\n-/\n\nnamespace Problem\n\n/-- Right-associated tetration of an integer base, indexed by a natural height.\n\nThe recursion is total. Natural height `0` is assigned the harmless seed value\n`1`, so that height `1` is the base itself:\n`Tetration a 1 = a`. For every natural `k`,\n`Tetration a (k + 1) = a ^ (Tetration a k).toNat`.\nUnder the problem's hypotheses `1 < a` and `1 ≤ k`, every tower value is\npositive, so `Int.toNat` is the intended ordinary exponent. -/\ndef Tetration (a : ℤ) : ℕ → ℤ\n | 0 => 1\n | k + 1 => a ^ (Tetration a k).toNat\n\n/-- The source problem calls the iteration heights `m` and `n` integers.\nThis wrapper keeps those heights in `ℤ`; after the source hypothesis `1 < k`,\nthe natural height is `k.toNat`. -/\ndef TetrationInt (a k : ℤ) : ℤ :=\n Tetration a k.toNat\n\n/-- The complete assertion of the problem: for all integers `x`, `y`, `m`,\nand `n` greater than `1`, if the `m`-fold tetration of `x` equals the\n`n`-fold tetration of `y`, then `m = n`. -/\ndef Target : Prop :=\n ∀ x y m n : ℤ,\n 1 < x → 1 < y → 1 < m → 1 < n →\n TetrationInt x m = TetrationInt y n → m = n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e972c6c5-6517-537c-903b-bdf797877012", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9fc22c640999f68bd8a77b2a22c0125f22585d71b3d96f0738447e9aef10bc89", "task_path": "tasks/nmp3_e972c6c5-6517-537c-903b-bdf797877012", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e972c6c5-6517-537c-903b-bdf797877012", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e974fecf-1037-58ab-9ddd-9d2053dc43e2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $N\\ge 2$ be an integer, and let $\\mathbf a=(a_1,\\dots,a_N)$ and $\\mathbf b=(b_1,\\dots,b_N)$ be sequences of non‑negative integers. Extend the sequences periodically to all integer indices by defining $a_i=a_k$ and $b_i=b_k$, where $k\\in\\{1,\\dots,N\\}$ is the unique integer satisfying $i\\equiv k\\pmod N$. \n-- \n-- We say that $\\mathbf a$ is $\\mathbf b$‑harmonic if for every integer $i$\n-- \\[\n-- a_i=\\frac{1}{2b_i+1}\\sum_{s=-b_i}^{\\,b_i}a_{i+s},\n-- \\]\n-- and that $\\mathbf b$ is $\\mathbf a$‑harmonic if for every integer $i$\n-- \\[\n-- b_i=\\frac{1}{2a_i+1}\\sum_{s=-a_i}^{\\,a_i}b_{i+s}.\n-- \\]\n-- \n-- Assume that neither $\\mathbf a$ nor $\\mathbf b$ is a constant sequence, and that $\\mathbf a$ is $\\mathbf b$‑harmonic as well as $\\mathbf b$ is $\\mathbf a$‑harmonic. \n-- \n-- Prove that at least $N+1$ of the $2N$ numbers $a_1,\\dots,a_N,b_1,\\dots,b_N$ are equal to $0$.\nimport Mathlib\n\n/-!\n# Formal statement of the periodic harmonic sequences problem\n\nThe source problem considers two length-`N` sequences of non-negative integers,\nperiodically extended to all integer indices, which are harmonic with respect to\neach other's entries used as window radii. The assertion to be proved is that,\nprovided both sequences are non-constant, at least `N + 1` of the `2N` entries\nare zero.\n-/\n\nnamespace Problem\n\n/-- The zero-based `Fin N` representative of an integer modulo `N`.\n\nThe source uses representatives `k` in `{1, ..., N}`. Here index `i` is\nmapped to the representative `i - 1` modulo `N`, which lies in\n`{0, ..., N - 1}` and is exactly `k - 1`, so that it indexes `Fin N`.\n-/\ndef periodicIndex (N : ℕ) (hN : 0 < N) (i : ℤ) : Fin N :=\n ⟨(i - 1).natMod (N : ℤ), by\n simpa using Int.natMod_lt (m := i - 1) (n := N) (Nat.ne_of_gt hN)⟩\n\n/-- Periodic extension of a length-`N` sequence to all integer indices. -/\ndef periodicValue (N : ℕ) (hN : 0 < N) (x : Fin N → ℕ) (i : ℤ) : ℕ :=\n x (periodicIndex N hN i)\n\n/-- A length-`N` sequence is constant when all its entries are equal. -/\ndef IsConstant {N : ℕ} (x : Fin N → ℕ) : Prop :=\n ∃ c : ℕ, ∀ i : Fin N, x i = c\n\n/-- `x` is `y`-harmonic: at every integer index `i`, the entry `x i` equals the\naverage of the periodically extended `x` over the window from `-y_i` through\n`y_i`. The equality is stated in `ℚ`, reflecting the displayed real/rational\ndivision. -/\ndef IsHarmonic (N : ℕ) (hN : 0 < N) (x y : Fin N → ℕ) : Prop :=\n ∀ i : ℤ,\n let k := periodicIndex N hN i\n let r := y k\n (x k : ℚ) = (1 / ((2 * r + 1 : ℕ) : ℚ)) *\n ∑ s ∈ Finset.Icc (-(r : ℤ)) (r : ℤ),\n (periodicValue N hN x (i + s) : ℚ)\n\n/-- The two sequences are harmonic with respect to one another. -/\ndef MutuallyHarmonic (N : ℕ) (hN : 0 < N) (a b : Fin N → ℕ) : Prop :=\n IsHarmonic N hN a b ∧ IsHarmonic N hN b a\n\n/-- The number of zero entries among the `2N` entries of `a` and `b`. -/\ndef zeroCount {N : ℕ} (a b : Fin N → ℕ) : ℕ :=\n (Finset.univ.filter (fun i : Fin N => a i = 0)).card +\n (Finset.univ.filter (fun i : Fin N => b i = 0)).card\n\n/-- The source problem's admissibility hypotheses: `N ≥ 2`, both sequences are\nnon-constant, and each sequence is harmonic with respect to the other. -/\ndef Admissible (N : ℕ) (hN : 2 ≤ N) (a b : Fin N → ℕ) : Prop :=\n ¬ IsConstant a ∧\n ¬ IsConstant b ∧\n MutuallyHarmonic N (Nat.lt_of_lt_of_le (by omega) hN) a b\n\n/-- Complete formal statement: for every `N ≥ 2` and every pair of non-constant\nlength-`N` sequences of non-negative integers that are mutually harmonic in the\nsenses above, at least `N + 1` of the `2N` entries are zero. -/\ndef Target : Prop :=\n ∀ (N : ℕ) (hN : 2 ≤ N) (a b : Fin N → ℕ),\n Admissible N hN a b → N + 1 ≤ zeroCount a b\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e974fecf-1037-58ab-9ddd-9d2053dc43e2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7e503e7bb2e34129fd276e283da9a024de1d68dc62994afeac80d7ffadd20711", "task_path": "tasks/nmp3_e974fecf-1037-58ab-9ddd-9d2053dc43e2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e974fecf-1037-58ab-9ddd-9d2053dc43e2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e978115b-1051-5527-910b-01eccc0b66aa", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\ge0$ satisfy \n-- \\[\n-- \\frac1{a+1}+\\frac1{b+1}+\\frac1{c+1}+\\frac1{d+1}=3.\n-- \\] \n-- Prove that \n-- \\[\n-- 3(ab+bc+ca+ad+bd+cd)+\\frac{4}{a+b+c+d}\\le5.\n-- \\]\nimport Mathlib\n\n/-!\nThis file formalizes the statement of the following problem.\n\nLet `a, b, c, d ≥ 0` be real numbers satisfying\n`1/(a+1) + 1/(b+1) + 1/(c+1) + 1/(d+1) = 3`.\nProve that\n`3(ab + bc + ca + ad + bd + cd) + 4/(a+b+c+d) ≤ 5`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The sum of the six pairwise products occurring in the asserted inequality. -/\ndef pairwiseProductSum (a b c d : ℝ) : ℝ :=\n a * b + b * c + c * a + a * d + b * d + c * d\n\n/-- The reciprocal sum appearing in the hypothesis. -/\ndef reciprocalSum (a b c d : ℝ) : ℝ :=\n 1 / (a + 1) + 1 / (b + 1) + 1 / (c + 1) + 1 / (d + 1)\n\n/-- The admissibility conditions on the four real variables: they are all\nnonnegative and their reciprocal sum equals three. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 ≤ d ∧ reciprocalSum a b c d = 3\n\n/-- The inequality asserted in the problem's conclusion. -/\ndef ClaimInequality (a b c d : ℝ) : Prop :=\n 3 * pairwiseProductSum a b c d + 4 / (a + b + c + d) ≤ 5\n\n/-- The complete proposition to be proved: for every quadruple of real numbers,\nthe admissibility hypotheses imply the asserted inequality. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → ClaimInequality a b c d\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e978115b-1051-5527-910b-01eccc0b66aa", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b521e7eaa0d702916309fab59c49b0190cf24d9a1ce804289510e5e112ea2ba6", "task_path": "tasks/nmp3_e978115b-1051-5527-910b-01eccc0b66aa", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e978115b-1051-5527-910b-01eccc0b66aa", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e9ae0862-0358-57cc-b87c-57887f6a1812", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$. Prove that \n-- \\[\n-- \\sqrt{5a^{2}+4bc}+\\sqrt{5b^{2}+4ca}+\\sqrt{5c^{2}+4ab}\\ge \\sqrt{3\\,(a^{2}+b^{2}+c^{2})}+2\\bigl(\\sqrt{ab}+\\sqrt{bc}+\\sqrt{ca}\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the nonnegative-real radical inequality\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, and `c`,\nthe cyclic radical inequality\n`sqrt (5*a^2 + 4*b*c) + sqrt (5*b^2 + 4*c*a) + sqrt (5*c^2 + 4*a*b)`\nat least\n`sqrt (3*(a^2+b^2+c^2)) + 2*(sqrt (a*b) + sqrt (b*c) + sqrt (c*a))`.\n\nThe assertion is represented as a proposition-valued definition. No proof is\nsupplied at this formalization stage.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The first left-hand radical: `sqrt (5*a^2 + 4*b*c)`. -/\ndef leftRadicalA (a b c : ℝ) : ℝ :=\n Real.sqrt (5 * a ^ 2 + 4 * b * c)\n\n/-- The second left-hand radical: `sqrt (5*b^2 + 4*c*a)`. -/\ndef leftRadicalB (a b c : ℝ) : ℝ :=\n Real.sqrt (5 * b ^ 2 + 4 * c * a)\n\n/-- The third left-hand radical: `sqrt (5*c^2 + 4*a*b)`. -/\ndef leftRadicalC (a b c : ℝ) : ℝ :=\n Real.sqrt (5 * c ^ 2 + 4 * a * b)\n\n/-- The three-term left-hand side of the target inequality. -/\ndef leftSide (a b c : ℝ) : ℝ :=\n leftRadicalA a b c + leftRadicalB a b c + leftRadicalC a b c\n\n/-- The first right-hand radical: `sqrt (3*(a^2 + b^2 + c^2))`. -/\ndef rightRadical (a b c : ℝ) : ℝ :=\n Real.sqrt (3 * (a ^ 2 + b ^ 2 + c ^ 2))\n\n/-- The sum `sqrt (a*b) + sqrt (b*c) + sqrt (c*a)` of pairwise radicals. -/\ndef pairwiseRadicalSum (a b c : ℝ) : ℝ :=\n Real.sqrt (a * b) + Real.sqrt (b * c) + Real.sqrt (c * a)\n\n/-- The two-term right-hand side of the target inequality. -/\ndef rightSide (a b c : ℝ) : ℝ :=\n rightRadical a b c + 2 * pairwiseRadicalSum a b c\n\n/-- The target inequality, universally quantified over nonnegative real `a`, `b`, `c`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n leftSide a b c ≥ rightSide a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e9ae0862-0358-57cc-b87c-57887f6a1812", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "dc30d54b93ad161d9c5db8fb2ede379ddbf27583e54f721d45b5c3ca78e8d4c4", "task_path": "tasks/nmp3_e9ae0862-0358-57cc-b87c-57887f6a1812", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e9ae0862-0358-57cc-b87c-57887f6a1812", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e9b258ee-3ec3-5869-9fd2-948c511aefe6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $k$ be a positive integer and let $r_1,r_2,\\dots,r_k$ be positive real numbers such that for every integer $n\\ge 2$ the sum \n-- \\[P(n)=\\sum_{j=1}^{k} r_j^{1/n}\\] \n-- is a rational number. Prove that $r_1=r_2=\\dots =r_k=1\\,.\nimport Mathlib\n\n/-!\n# Formalization of the root-sum rationality problem\n\nThe source problem asks: if `k ≥ 1` and `r₁, ..., rₖ` are positive reals such that\n`∑ⱼ rⱼ^(1/n)` is rational for every integer `n ≥ 2`, then all `rⱼ` equal `1`.\n\nWe model `r₁, ..., rₖ` as a function `r : Fin k → ℝ`. The real power\n`rⱼ^(1/n)` is represented by `Real.rpow (r j) ((n : ℝ)⁻¹)`. Since the\nhypothesis says each `r j` is positive and `n ≥ 2`, this is the usual positive\nreal `n`-th root.\n-/\n\nnamespace Problem\n\n/-- The sum `P(n) = ∑_{j=1}^k r_j^(1/n)`, using real powers. -/\nnoncomputable def RootSum (k : ℕ) (r : Fin k → ℝ) (n : ℕ) : ℝ :=\n ∑ j : Fin k, Real.rpow (r j) ((n : ℝ)⁻¹)\n\n/-- The original hypotheses: `k` is positive, every `r_j` is positive, and\n`P(n)` is rational for every integer `n ≥ 2`. -/\ndef Admissible (k : ℕ) (r : Fin k → ℝ) : Prop :=\n 0 < k ∧\n (∀ j : Fin k, 0 < r j) ∧\n (∀ n : ℕ, 2 ≤ n → ∃ q : ℚ, RootSum k r n = (q : ℝ))\n\n/-- The asserted conclusion: every one of the positive reals is equal to `1`. -/\ndef Conclusion (k : ℕ) (r : Fin k → ℝ) : Prop :=\n ∀ j : Fin k, r j = 1\n\n/-- The full universal statement of the problem. -/\ndef Target : Prop :=\n ∀ (k : ℕ) (r : Fin k → ℝ), Admissible k r → Conclusion k r\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e9b258ee-3ec3-5869-9fd2-948c511aefe6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "832a8c1124d7453db24e9919c12070e0b2045b97787e7427fbee7a9671f6d075", "task_path": "tasks/nmp3_e9b258ee-3ec3-5869-9fd2-948c511aefe6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e9b258ee-3ec3-5869-9fd2-948c511aefe6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e9bb4933-736b-5b9e-aa6d-95b02e1794e8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers such that $x^3+y^3+z^3=3$. Prove that \n-- \\[\n-- (xy)^4+(yz)^4+(zx)^4\\le 3\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/--\nThe admissibility hypotheses on the three real variables: each is positive and\nthe sum of their cubes is exactly `3`.\n-/\ndef IsAdmissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x ^ 3 + y ^ 3 + z ^ 3 = 3\n\n/-- The inequality asserted in the problem. -/\ndef Inequality (x y z : ℝ) : Prop :=\n (x * y) ^ 4 + (y * z) ^ 4 + (z * x) ^ 4 ≤ 3\n\n/--\nThe full universal assertion of the problem: for every triple of positive real\nnumbers satisfying `x ^ 3 + y ^ 3 + z ^ 3 = 3`, the stated inequality holds.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ, IsAdmissible x y z → Inequality x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e9bb4933-736b-5b9e-aa6d-95b02e1794e8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ce710e681576da5fd675254a9a3217a997865ed9969473ecdff14d3a0cd86d8e", "task_path": "tasks/nmp3_e9bb4933-736b-5b9e-aa6d-95b02e1794e8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e9bb4933-736b-5b9e-aa6d-95b02e1794e8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e9e126f1-e665-53db-9420-0b5d8684669c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle, $m_a,m_b,m_c$ its medians, $S$ its area and $p=\\frac{a+b+c}{2}$ its semiperimeter. Prove that \n-- \\[\n-- \\frac{27\\,m_a^{2}m_b^{2}m_c^{2}}{S^{6}}\\;\\le\\;\\left(\\frac1{(p-a)^{2}}+\\frac1{(p-b)^{2}}+\\frac1{(p-c)^{2}}\\right)^{3},\n-- \\] \n-- with equality only for the equilateral triangle.\nimport Mathlib\n\n/-!\n# Formal statement for the median--area inequality\n\nThis file fixes the vocabulary used to state the problem. In particular, a\ntriangle is represented by its three positive side lengths satisfying the\nstrict triangle inequalities. Its area is the Heron expression in those side\nlengths, and its medians are the usual length formulas in terms of the sides.\nNo attempt is made to prove the resulting proposition here.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The three real numbers `a`, `b`, and `c` are the side lengths of a\nnondegenerate Euclidean triangle. Positivity is included explicitly, and the\nthree triangle inequalities are strict. -/\ndef IsTriangle (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ a + c > b ∧ b + c > a\n\n/-- The semiperimeter `p = (a + b + c) / 2`. -/\ndef semiperimeter (a b c : ℝ) : ℝ :=\n (a + b + c) / 2\n\n/-- The length of the median to the side of length `a`. -/\ndef medianA (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * b ^ 2 + 2 * c ^ 2 - a ^ 2)\n\n/-- The length of the median to the side of length `b`. -/\ndef medianB (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * a ^ 2 + 2 * c ^ 2 - b ^ 2)\n\n/-- The length of the median to the side of length `c`. -/\ndef medianC (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * a ^ 2 + 2 * b ^ 2 - c ^ 2)\n\n/-- The area of the triangle, written using Heron's formula. -/\ndef triangleArea (a b c : ℝ) : ℝ :=\n Real.sqrt\n (semiperimeter a b c *\n (semiperimeter a b c - a) *\n (semiperimeter a b c - b) *\n (semiperimeter a b c - c))\n\n/-- The left-hand side of the asserted inequality. -/\ndef inequalityLHS (a b c : ℝ) : ℝ :=\n (27 * (medianA a b c) ^ 2 * (medianB a b c) ^ 2 *\n (medianC a b c) ^ 2) /\n (triangleArea a b c) ^ 6\n\n/-- The sum of reciprocals of the squared semiperimeter gaps. -/\ndef reciprocalGapSqSum (a b c : ℝ) : ℝ :=\n 1 / ((semiperimeter a b c - a) ^ 2) +\n 1 / ((semiperimeter a b c - b) ^ 2) +\n 1 / ((semiperimeter a b c - c) ^ 2)\n\n/-- The right-hand side of the asserted inequality. -/\ndef inequalityRHS (a b c : ℝ) : ℝ :=\n (reciprocalGapSqSum a b c) ^ (3 : ℕ)\n\n/-- The side lengths `a`, `b`, and `c` form a genuine equilateral triangle. -/\ndef IsEquilateral (a b c : ℝ) : Prop :=\n a = b ∧ b = c\n\n/-- The universal inequality asserted for every triangle. -/\ndef mainInequality : Prop :=\n ∀ (a b c : ℝ), IsTriangle a b c →\n inequalityLHS a b c ≤ inequalityRHS a b c\n\n/-- Equality in the asserted inequality occurs exactly for equilateral\ntriangles. The forward direction says equality occurs only in the equilateral\ncase; the reverse direction records that the equilateral triangle indeed gives\nequality. -/\ndef equalityCase : Prop :=\n ∀ (a b c : ℝ), IsTriangle a b c →\n (inequalityLHS a b c = inequalityRHS a b c ↔ IsEquilateral a b c)\n\n/-- The complete formal target: for every triple of side lengths of a genuine\nEuclidean triangle, the asserted inequality holds and equality occurs exactly\nfor equilateral triangles. The single outer quantifier mirrors the original\nsentence, in which the inequality and the equality condition are both asserted\nfor the same arbitrary triangle. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), IsTriangle a b c →\n (inequalityLHS a b c ≤ inequalityRHS a b c) ∧\n (inequalityLHS a b c = inequalityRHS a b c ↔ IsEquilateral a b c)\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e9e126f1-e665-53db-9420-0b5d8684669c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c26d32bbda99061ff7a93576cd29fec0990bc205aefb2bc78f90e4c1b2989086", "task_path": "tasks/nmp3_e9e126f1-e665-53db-9420-0b5d8684669c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e9e126f1-e665-53db-9420-0b5d8684669c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_e9e3c6ee-5f6b-579e-8cf2-d2ef1b36ef24", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,\\;b,\\;c\\) be non‑negative real numbers. Prove that \n-- \\[\n-- a^{2}+b^{2}+c^{2}+ab+bc+ca\\;\\ge\\;a\\sqrt{3b^{2}+c^{2}}+b\\sqrt{3c^{2}+a^{2}}+c\\sqrt{3a^{2}+b^{2}}.\n-- \\] \n-- (Here \\(\\sum a^{2}=a^{2}+b^{2}+c^{2}\\) and \\(\\sum ab=ab+bc+ca\\).)\nimport Mathlib\n\n/-!\nFormal statement of the inequality proposed in `problem.md`.\n\nThe original problem asks to prove, for non-negative real numbers `a`, `b`, `c`,\nthat\n`a^2 + b^2 + c^2 + ab + bc + ca`\nis at least\n`a * sqrt (3 b^2 + c^2) + b * sqrt (3 c^2 + a^2) + c * sqrt (3 a^2 + b^2)`.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the inequality in the problem. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a ^ 2 + b ^ 2 + c ^ 2 + a * b + b * c + c * a\n\n/-- The right-hand side of the inequality in the problem. -/\ndef rhs (a b c : ℝ) : ℝ :=\n a * Real.sqrt (3 * b ^ 2 + c ^ 2) +\n b * Real.sqrt (3 * c ^ 2 + a ^ 2) +\n c * Real.sqrt (3 * a ^ 2 + b ^ 2)\n\n/-- The asserted pointwise inequality `lhs ≥ rhs`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n rhs a b c ≤ lhs a b c\n\n/-- The complete universally quantified statement from the problem: for every three\nnon-negative real numbers `a`, `b`, and `c`, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c → Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e9e3c6ee-5f6b-579e-8cf2-d2ef1b36ef24", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5a4af2cb404f406e57d2e7e8916cf15657eb8b775b4554b7813078d952551e2f", "task_path": "tasks/nmp3_e9e3c6ee-5f6b-579e-8cf2-d2ef1b36ef24", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "e9e3c6ee-5f6b-579e-8cf2-d2ef1b36ef24", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ea06f23c-a853-5be6-9a87-c0a6d2eeb66f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given three non‑negative real numbers $a,b,c$ with $ab+bc+ca>0$, prove that \n-- \\[\n-- \\frac{a}{\\sqrt{b^{2}-bc+c^{2}}}+\\frac{b}{\\sqrt{c^{2}-ca+a^{2}}}+\\frac{c}{\\sqrt{a^{2}-ab+b^{2}}}\\ge 2+\\frac{3abc}{a^{3}+b^{3}+c^{3}}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility conditions from the problem: `a`, `b`, and `c` are\nnon-negative real numbers and `ab + bc + ca > 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < a * b + b * c + c * a\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / Real.sqrt (b ^ 2 - b * c + c ^ 2) +\n b / Real.sqrt (c ^ 2 - c * a + a ^ 2) +\n c / Real.sqrt (a ^ 2 - a * b + b ^ 2)\n\n/-- The right-hand side of the asserted inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 2 + (3 : ℝ) * a * b * c / (a ^ 3 + b ^ 3 + c ^ 3)\n\n/-- The pointwise inequality asserted for an admissible triple. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full universal statement: for every non-negative real triple satisfying\n`ab + bc + ca > 0`, the asserted inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea06f23c-a853-5be6-9a87-c0a6d2eeb66f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8bde5b6f696540e1ae0d1bf79ea3dc8902202802ecb627b26e72d5aa3646ad9a", "task_path": "tasks/nmp3_ea06f23c-a853-5be6-9a87-c0a6d2eeb66f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea06f23c-a853-5be6-9a87-c0a6d2eeb66f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ea164057-2e37-590c-81d2-5bf0ab996db8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given triangle \\(ABC\\) with incircle \\((I)\\) touching \\(BC,CA,AB\\) at \\(D,E,F\\) respectively. Let \\(T=AD\\cap BE\\). Let \\(K\\) be the reflection of \\(T\\) across line \\(EF\\). Let \\(H\\) be the foot of the perpendicular from \\(D\\) to \\(EF\\). Prove that the points \\(A, H, K\\) are collinear.\nimport Mathlib\n\n/-!\n# Formalization of an incircle / reflection collinearity statement\n\nThe Euclidean plane is represented explicitly by `ℝ × ℝ`. All geometric\nnotions used in the problem (collinearity, perpendicularity, segment\nmembership, the interior of a triangle, reflection in a line, and orthogonal\nprojection onto a line) are defined below in elementary coordinates.\n-/\n\nnamespace Problem\n\n/-- A point of the Euclidean plane, represented in Cartesian coordinates. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- The vector from `p` to `q`. -/\ndef vsub (p q : Point) : Point := (q.1 - p.1, q.2 - p.2)\n\n/-- The Euclidean scalar product. -/\ndef dot (u v : Point) : ℝ := u.1 * v.1 + u.2 * v.2\n\n/-- The signed area/cross product of two plane vectors. -/\ndef cross (u v : Point) : ℝ := u.1 * v.2 - u.2 * v.1\n\n/-- Three points are collinear when the vectors from the first point to the\nother two are parallel. In particular, a repeated point is collinear with\nany other point. -/\ndef Collinear (p q r : Point) : Prop := cross (vsub p q) (vsub p r) = 0\n\n/-- The line through `p` and `q` is perpendicular to the line through `r` and\n`s` when their direction vectors have zero scalar product. -/\ndef Perp (p q r s : Point) : Prop := dot (vsub p q) (vsub r s) = 0\n\n/-- The square of the Euclidean distance between two points. -/\ndef SquaredDistance (p q : Point) : ℝ := dot (vsub p q) (vsub p q)\n\n/-- The midpoint of two points. -/\nnoncomputable def Midpoint (p q : Point) : Point :=\n ((p.1 + q.1) / 2, (p.2 + q.2) / 2)\n\n/-- A point lies on the closed segment joining `a` and `b`. -/\ndef OnSegment (p a b : Point) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ p = (1 - t) • a + t • b\n\n/-- A point lies in the relative interior of the segment joining `a` and `b`.\nThis is the form of contact that an incircle has with a side. -/\ndef StrictlyOnSegment (p a b : Point) : Prop :=\n ∃ t : ℝ, 0 < t ∧ t < 1 ∧ p = (1 - t) • a + t • b\n\n/-- A point lies in the interior of the (nondegenerate) triangle with vertices\n`a`, `b`, and `c`, expressed as a strict convex combination. -/\ndef InTriangleInterior (p a b c : Point) : Prop :=\n ∃ α β γ : ℝ,\n 0 < α ∧ 0 < β ∧ 0 < γ ∧ α + β + γ = 1 ∧\n p = α • a + β • b + γ • c\n\n/-- `a`, `b`, and `c` are three distinct noncollinear points, i.e. they form a\nnondegenerate triangle. -/\ndef IsNondegenerateTriangle (a b c : Point) : Prop :=\n a ≠ b ∧ b ≠ c ∧ c ≠ a ∧ ¬ Collinear a b c\n\n/-- A circle with center `i` touches the sides `bc`, `ca`, and `ab` at `d`,\n`e`, and `f`, respectively. Concretely, `i` is in the interior of triangle\n`abc`, the three points are interior points of the respective sides, each\nradius `id`, `ie`, `if` is perpendicular to its side, and the three radii have\nthe same positive squared length. -/\ndef IsIncircleWithContacts (a b c i d e f : Point) : Prop :=\n InTriangleInterior i a b c ∧\n StrictlyOnSegment d b c ∧\n StrictlyOnSegment e c a ∧\n StrictlyOnSegment f a b ∧\n Perp i d b c ∧\n Perp i e c a ∧\n Perp i f a b ∧\n 0 < SquaredDistance i d ∧\n SquaredDistance i d = SquaredDistance i e ∧\n SquaredDistance i e = SquaredDistance i f\n\n/-- `x` is the unique intersection of the lines through `p q` and through\n`r s`. The nondegeneracy conditions say that each named pair really\ndetermines a line. -/\ndef IsUniqueLineIntersection (p q r s x : Point) : Prop :=\n p ≠ q ∧ r ≠ s ∧\n Collinear p q x ∧ Collinear r s x ∧\n ∀ y : Point, Collinear p q y → Collinear r s y → y = x\n\n/-- `q` is the reflection of `p` across the line through `e` and `f`.\nEquivalently, the line `ef` is the perpendicular bisector of `pq`: the\nmidpoint of `pq` lies on `ef`, and `pq` is perpendicular to `ef`. -/\ndef IsReflectionAcrossLine (p e f q : Point) : Prop :=\n e ≠ f ∧\n Collinear e f (Midpoint p q) ∧\n dot (vsub p q) (vsub e f) = 0\n\n/-- `h` is the foot of the perpendicular from `p` to the line through `e` and\n`f`. Thus `h` lies on `ef` and `ph` is perpendicular to `ef`. -/\ndef IsPerpendicularFoot (p e f h : Point) : Prop :=\n e ≠ f ∧\n Collinear e f h ∧\n dot (vsub p h) (vsub e f) = 0\n\n/-- The full target assertion: for every nondegenerate triangle `ABC` with\nincircle center `I` touching `BC`, `CA`, `AB` at `D`, `E`, `F`, if `T` is the\nunique intersection of `AD` and `BE`, `K` is the reflection of `T` across\n`EF`, and `H` is the perpendicular foot from `D` to `EF`, then `A`, `H`, and\n`K` are collinear. -/\ndef Target : Prop :=\n ∀ (A B C I D E F T K H : Point),\n IsNondegenerateTriangle A B C →\n IsIncircleWithContacts A B C I D E F →\n IsUniqueLineIntersection A D B E T →\n IsReflectionAcrossLine T E F K →\n IsPerpendicularFoot D E F H →\n Collinear A H K\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea164057-2e37-590c-81d2-5bf0ab996db8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0484ace3ba498fb3d921ef44f0b6876e71994089d86126184dd19584d120dcfe", "task_path": "tasks/nmp3_ea164057-2e37-590c-81d2-5bf0ab996db8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea164057-2e37-590c-81d2-5bf0ab996db8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ea1843d6-b806-59b9-9a9c-238bb143ecb8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $T$ be a tree with $n$ vertices (i.e., a connected simple graph on $n$ vertices containing no cycle). For each unordered pair of distinct vertices $u,v$, let $d(u,v)$ be the distance between $u$ and $v$ (the number of edges in the unique shortest $u$–$v$ path in $T$). Define \n-- \n-- \\[\n-- W(T)=\\sum_{\\substack{\\{u,v\\}\\subseteq V(T)\\\\ u\\neq v}}d(u,v),\\qquad \n-- H(T)=\\sum_{\\substack{\\{u,v\\}\\subseteq V(T)\\\\ u\\neq v}}\\frac{1}{d(u,v)}.\n-- \\]\n-- \n-- Prove that \n-- \n-- \\[\n-- W(T)\\cdot H(T)\\ge \\frac{(n-1)^{3}(n+2)}{4}.\n-- \\]\nimport Mathlib.Combinatorics.SimpleGraph.Acyclic\nimport Mathlib.Combinatorics.SimpleGraph.Metric\nimport Mathlib.Data.Finset.Sym\nimport Mathlib.Algebra.BigOperators.Field\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the tree Wiener-index / reciprocal-distance inequality\n\nThis file records the objects appearing in the problem: the set of unordered\npairs of distinct vertices, graph distance on such pairs, the Wiener index\n`W(T)`, the reciprocal-distance sum `H(T)`, and the asserted inequality for\nfinite trees.\n-/\n\nopen scoped BigOperators\n\nnamespace Problem\n\nuniverse u\n\n/-- The unordered pairs of distinct vertices of a finite type `V`.\n\nThis is the finset of two-element unordered pairs, represented as the\nnon-diagonal elements of the symmetric square of `Finset.univ`. Its elements\nare in bijection with the subsets `{u, v} ⊆ V` for which `u ≠ v`. -/\nnoncomputable def distinctPairs (V : Type u) [Fintype V] :\n Finset (Sym2 V) := by\n classical\n exact (Finset.univ : Finset V).sym2.filter (fun p => ¬ p.IsDiag)\n\n/-- The graph distance as a function of an unordered pair of vertices.\n\nA pair is represented by `Sym2 V`; the function is symmetric in its two\nvertex arguments and therefore descends to the symmetric square. -/\nnoncomputable def sym2Dist {V : Type u} (G : SimpleGraph V) : Sym2 V → ℕ :=\n Sym2.lift ⟨fun u v => G.dist u v, fun _ _ => SimpleGraph.dist_comm⟩\n\n/-- The Wiener index `W(T)`: the sum of the distances over all unordered pairs\nof distinct vertices. -/\nnoncomputable def W {V : Type u} [Fintype V] (G : SimpleGraph V) : ℕ :=\n ∑ p ∈ distinctPairs V, sym2Dist G p\n\n/-- The reciprocal-distance sum `H(T)`: the sum of `1 / d(u,v)` over all\nunordered pairs of distinct vertices, evaluated in the real numbers. -/\nnoncomputable def H {V : Type u} [Fintype V] (G : SimpleGraph V) : ℝ :=\n ∑ p ∈ distinctPairs V, (1 : ℝ) / (sym2Dist G p : ℝ)\n\n/-- `G` is a tree whose vertex type has cardinality `n`. -/\ndef IsTreeWithVertexCount (n : ℕ) (V : Type u) [Fintype V]\n (G : SimpleGraph V) : Prop :=\n G.IsTree ∧ Fintype.card V = n\n\n/-- The inequality asserted for a finite tree on `n` vertices. This is the\nconclusion of the problem, with the right-hand side interpreted in `ℝ`. -/\ndef treeWeightInequality (n : ℕ) (V : Type u) [Fintype V]\n (G : SimpleGraph V) : Prop :=\n (W G : ℝ) * H G ≥\n ((n : ℝ) - 1) ^ 3 * ((n : ℝ) + 2) / 4\n\n/-- The full assertion of the problem: for every `n` and every simple graph\n`G` on a finite vertex type `V` that is a tree with `n` vertices,\n`W(G) * H(G) ≥ ((n - 1)^3 * (n + 2)) / 4`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (V : Type u) [Fintype V] (G : SimpleGraph V),\n IsTreeWithVertexCount n V G → treeWeightInequality n V G\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea1843d6-b806-59b9-9a9c-238bb143ecb8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e9ac130ca3e864061e06aed0229d7e622fa7d8d0068ddf6b837846499bce5ffe", "task_path": "tasks/nmp3_ea1843d6-b806-59b9-9a9c-238bb143ecb8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea1843d6-b806-59b9-9a9c-238bb143ecb8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ea322066-a892-55a2-8484-86b7b8a292bd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x, y, z>0$ satisfy $x+y+z=x^{3}+y^{3}+z^{3}$. Prove that \n-- \\[\n-- \\frac{xz^{2}}{(x^{2}+1)\\,y^{2}}+\\frac{yx^{2}}{(y^{2}+1)\\,z^{2}}+\\frac{zy^{2}}{(z^{2}+1)\\,x^{2}}\\ge \\frac{x+y+z}{2}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the supplied inequality problem\n\nThe problem asks to prove, for positive real numbers satisfying the cubic-sum\ncondition, a lower bound for a three-term rational expression.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality:\n`x*z^2 / ((x^2+1)*y^2) + y*x^2 / ((y^2+1)*z^2) + z*y^2 / ((z^2+1)*x^2)`. -/\nnoncomputable def leftHandSide (x y z : ℝ) : ℝ :=\n x * z ^ 2 / ((x ^ 2 + 1) * y ^ 2) +\n y * x ^ 2 / ((y ^ 2 + 1) * z ^ 2) +\n z * y ^ 2 / ((z ^ 2 + 1) * x ^ 2)\n\n/-- The right-hand side of the inequality, `(x+y+z)/2`. -/\nnoncomputable def rightHandSide (x y z : ℝ) : ℝ :=\n (x + y + z) / 2\n\n/-- The inequality asserted by the problem, for arbitrary real `x`, `y`, and `z`. -/\ndef Inequality (x y z : ℝ) : Prop :=\n leftHandSide x y z ≥ rightHandSide x y z\n\n/-- The positivity and cubic-sum admissibility conditions from the problem. -/\ndef Admissible (x y z : ℝ) : Prop :=\n 0 < x ∧ 0 < y ∧ 0 < z ∧ x + y + z = x ^ 3 + y ^ 3 + z ^ 3\n\n/-- The full formal target: for all positive reals `x`, `y`, and `z` satisfying\n`x + y + z = x^3 + y^3 + z^3,` the displayed rational expression is at least\n`(x + y + z) / 2`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x + y + z = x ^ 3 + y ^ 3 + z ^ 3 →\n x * z ^ 2 / ((x ^ 2 + 1) * y ^ 2) +\n y * x ^ 2 / ((y ^ 2 + 1) * z ^ 2) +\n z * y ^ 2 / ((z ^ 2 + 1) * x ^ 2) ≥\n (x + y + z) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea322066-a892-55a2-8484-86b7b8a292bd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ec9c2c65989a14f7cc8ba76d0a4ef3f3ed6de6c7e83a17411b3e8632bb13f93d", "task_path": "tasks/nmp3_ea322066-a892-55a2-8484-86b7b8a292bd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea322066-a892-55a2-8484-86b7b8a292bd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ea41bf15-07af-541f-bf0b-db0053140805", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\frac{a(a+b)}{b+c}+\\frac{b(b+c)}{c+a}+\\frac{c(c+a)}{a+b}\\ge 3\\sqrt{\\frac{ab^{2}+bc^{2}+ca^{2}}{a+b+c}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable real inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe inequality\n\n`a * (a + b) / (b + c) + b * (b + c) / (c + a) + c * (c + a) / (a + b)\n ≥ 3 * Real.sqrt ((a * b ^ 2 + b * c ^ 2 + c * a ^ 2) / (a + b + c))`.\n\nNo proof is provided here; `Problem.Target` is the proposition to be proved.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for every triple of positive real numbers,\nthe displayed inequality holds. All divisions are real divisions and the\nsquare root is the nonnegative real square root. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n (a * (a + b)) / (b + c) +\n (b * (b + c)) / (c + a) +\n (c * (c + a)) / (a + b) ≥\n 3 * Real.sqrt ((a * b ^ 2 + b * c ^ 2 + c * a ^ 2) / (a + b + c))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea41bf15-07af-541f-bf0b-db0053140805", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "eef4e4364e1f2134772c046afcbdfaf8829ec02c727241a1c27f1eb057d623e6", "task_path": "tasks/nmp3_ea41bf15-07af-541f-bf0b-db0053140805", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea41bf15-07af-541f-bf0b-db0053140805", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ea445306-9c4e-5da0-9435-97a112de5002", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $c\\neq0$ be an integer. Prove that there exist infinitely many prime numbers $p$ such that for some positive integer $n$ we have $p\\mid 2^{\\,n}+c\\,. $\nimport Mathlib\n\n/-!\n# Statement of the problem\n\nFor every nonzero integer `c`, infinitely many primes `p` have the property that\n`p` divides `2 ^ n + c` for some positive integer `n`.\n\nThe declaration `Problem.Target` is the formal proposition to be proved. It is\nstated as a `Prop`-valued definition, as required for statement formalization.\n-/\n\nnamespace Problem\n\n/-- `Admissible c p` says that the natural number `p` is a prime and that there is\na positive natural number `n` such that `p` divides `2 ^ n + c` in the integers. -/\ndef Admissible (c : ℤ) (p : ℕ) : Prop :=\n p.Prime ∧ ∃ n : ℕ, 0 < n ∧ (p : ℤ) ∣ (2 : ℤ) ^ n + c\n\n/-- There are infinitely many primes admissible for the integer `c`. -/\ndef InfinitelyManyAdmissiblePrimes (c : ℤ) : Prop :=\n Set.Infinite {p : ℕ | Admissible c p}\n\n/-- The statement: for every nonzero integer `c`, there are infinitely many prime\nnumbers `p` for which `p ∣ 2 ^ n + c` for some positive integer `n`. -/\ndef Target : Prop :=\n ∀ c : ℤ, c ≠ 0 → InfinitelyManyAdmissiblePrimes c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea445306-9c4e-5da0-9435-97a112de5002", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "77f338a921a93beca7533e246090ae47a73ebb99d38b4c05d81c4061e40322df", "task_path": "tasks/nmp3_ea445306-9c4e-5da0-9435-97a112de5002", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea445306-9c4e-5da0-9435-97a112de5002", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ea56d603-0a80-5ab4-a4a2-0485f2e7e653", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer and consider the set $F$ of all functions $f:\\{1,2,\\dots,n\\}\\to\\{1,2,\\dots,n\\}$ (an arrangement of $n$ cars on $n$ stations, cars may share a station). For $f,g\\in F$ define the distance \n-- \\[\n-- d(f,g)=m\\Bigl(\\bigcup_{i=1}^{n}[\\,f(i),\\,g(i)\\,]\\Bigr),\n-- \\] \n-- where $[a,b]$ denotes the closed interval between $a$ and $b$ (with $a\\le b$) and $m(\\cdot)$ is the usual length (Lebesgue measure) of a subset of the real line. \n-- \n-- Prove that for every real $\\alpha<1$ there exists an integer $n$ and a collection $S\\subseteq F$ of at least $100^{\\,n}$ functions such that $d(f,g)\\ge\\alpha n$ for all distinct $f,g\\in S\\,. $\nimport Mathlib\n\n/-!\n# Formal statement for the car-arrangement distance problem\n\nThe station set `{1, ..., n}` is represented by `Fin n`. A car arrangement is\ntherefore a function `Fin n → Fin n`, and `F n` is the finite set of all such\nfunctions. The distance is the Lebesgue measure of the union of the closed\n(unordered) intervals determined by the two arrangements.\n-/\n\nnoncomputable section\n\nopen MeasureTheory\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The set `F` of all functions from the `n`-element station set to itself.\n\nSince `Fin n` represents `{1, ..., n}` (up to an order-preserving relabeling),\nthis is the finite set of all arrangements of `n` cars on `n` stations. -/\ndef F (n : ℕ) : Finset (Fin n → Fin n) :=\n Finset.univ\n\n/-- The closed interval in the real line between two station labels.\n\nThe interval is unordered, so it is also defined when the endpoints occur in\nthe opposite order; equivalently it is `[min a b, max a b]`. -/\ndef interval {n : ℕ} (a b : Fin n) : Set ℝ :=\n Set.uIcc (a : ℝ) (b : ℝ)\n\n/-- The distance `d(f, g)` from the problem.\n\nIt is the usual length (Lebesgue measure) of the union, over all stations `i`,\nof the closed interval between `f i` and `g i`. The union is a finite union of\nbounded closed intervals, so its measure is finite and its `toReal` value is the\nordinary length used in the statement. -/\nnoncomputable def dist {n : ℕ} (f g : Fin n → Fin n) : ℝ :=\n (MeasureTheory.volume (⋃ i : Fin n, interval (f i) (g i))).toReal\n\n/-- For every real `α < 1`, there is a positive integer `n` and a collection\n`S ⊆ F` of at least `100 ^ n` functions whose pairwise distances are all at\nleast `α * n`. -/\ndef Target : Prop :=\n ∀ α : ℝ, α < 1 →\n ∃ n : ℕ, 1 ≤ n ∧\n ∃ S : Finset (Fin n → Fin n),\n S ⊆ F n ∧\n 100 ^ n ≤ S.card ∧\n ∀ f ∈ S, ∀ g ∈ S, f ≠ g → α * (n : ℝ) ≤ dist f g\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea56d603-0a80-5ab4-a4a2-0485f2e7e653", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fe44e3f6d5efa8026725d63a857af7c73b4352b151ebd572edd49b2ac18d1df2", "task_path": "tasks/nmp3_ea56d603-0a80-5ab4-a4a2-0485f2e7e653", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ea56d603-0a80-5ab4-a4a2-0485f2e7e653", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eaa624d1-a8d6-5e50-85c9-3608f41306ef", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find positive integers $a$, $b$, $c$ greater than 2011 such that the decimal expansion of \n-- \\[\n-- \\bigl(a+\\sqrt b\\,\\bigr)^c\n-- \\]\n-- contains the block “2010,2011”. In other words, the integer part of \\((a+\\sqrt b)^c\\) ends with the digits 2010 (i.e. \\(\\lfloor (a+\\sqrt b)^c\\rfloor\\equiv2010\\pmod{10000}\\)) and the fractional part begins with the digits 2011 (i.e. \\(0.2011\\le\\{(a+\\sqrt b)^c\\}<0.2012\\)).\nimport Mathlib\n\n/-!\n# Formal statement for the 2010/2011 decimal-block problem\n\nThe source asks for positive integers `a`, `b`, and `c`, all greater than\n`2011`, such that `(a + sqrt b)^c` has integer part ending in the digits\n`2010` and fractional part beginning with the digits `2011`.\n\nThis file records the admissibility conditions, a correctness predicate for a\nproposed witness triple, a generic complete-answer predicate for the\nall-solutions reading, and the existential target asserting that a witness\nexists. No answer or proof is supplied.\n-/\n\nnamespace Problem\n\n/-- Positive integer triples `(a, b, c)` under consideration. -/\nabbrev Triple : Type := ℕ × ℕ × ℕ\n\n/-- The integer part of `x` has final four decimal digits `2010`.\n\nFor a real number `x`, this is stated as the congruence\n`⌊x⌋ ≡ 2010 (mod 10000)`, matching the congruence in the source. -/\ndef IntegerPartEndsWith2010 (x : ℝ) : Prop :=\n Int.ModEq 10000 ⌊x⌋ 2010\n\n/-- The fractional part of `x` lies in `[2011/10000, 2012/10000)`, so its\ndecimal expansion begins with the digits `2011`.\n\nThe decimal endpoints in the source are represented by the exact rational\nnumbers `2011/10000` and `2012/10000`. -/\ndef FractionalPartBeginsWith2011 (x : ℝ) : Prop :=\n (2011 : ℝ) / (10000 : ℝ) ≤ Int.fract x ∧\n Int.fract x < (2012 : ℝ) / (10000 : ℝ)\n\n/-- The decimal expansion of `x` has integer part ending in `2010` and\nfractional part beginning with `2011`. -/\ndef ContainsBlock2010Comma2011 (x : ℝ) : Prop :=\n IntegerPartEndsWith2010 x ∧ FractionalPartBeginsWith2011 x\n\n/-- A triple `(a, b, c)` is admissible exactly when `a`, `b`, and `c` are\nnatural numbers greater than `2011`, and\n`(a + Real.sqrt b)^c` has integer part ending in `2010` while its fractional\npart begins with `2011`.\n\nAll three entries are natural numbers, and each strict lower bound is\nexplicit. The real-valued expression uses the principal nonnegative square\nroot `Real.sqrt` and the natural-number power `c`. -/\ndef Admissible (a b c : ℕ) : Prop :=\n 2011 < a ∧ 2011 < b ∧ 2011 < c ∧\n ContainsBlock2010Comma2011 (((a : ℝ) + Real.sqrt (b : ℝ)) ^ c)\n\n/-- Correctness of a proposed triple as a witness to the search problem. -/\ndef AnswerCorrect (a b c : ℕ) : Prop :=\n Admissible a b c\n\n/-- Correctness of a proposed complete set of triples: it contains every\nadmissible triple and no inadmissible triple.\n\nThis predicate makes both directions of an all-solutions classification\nexplicit. It does not assert that any particular set is complete. -/\ndef CompleteAnswer (S : Set Triple) : Prop :=\n (∀ a b c : ℕ, Admissible a b c → (a, b, c) ∈ S) ∧\n (∀ a b c : ℕ, (a, b, c) ∈ S → Admissible a b c)\n\n/-- The stated search problem has a solution: there exist positive integers\n`a`, `b`, and `c`, all greater than `2011`, for which\n`(a + Real.sqrt b)^c` satisfies the two decimal-digit conditions.\n\nBecause the source says \"Find positive integers\" rather than \"Find all\", the\nprimary target is the find-one/existence statement. -/\ndef Target : Prop :=\n ∃ a b c : ℕ, Admissible a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eaa624d1-a8d6-5e50-85c9-3608f41306ef", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1f9d169fea437923eb9fa32fee31cdfb60a20aee66865c06ecadf05103e0753e", "task_path": "tasks/nmp3_eaa624d1-a8d6-5e50-85c9-3608f41306ef", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eaa624d1-a8d6-5e50-85c9-3608f41306ef", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eaac4975-5d03-5892-ba7f-9614157a68c3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Positive integer $k$ with $k\\ge 8$ is given. Prove that if there exists at least one pair of positive integers $(x,y)$ satisfying \n-- \n-- \\[\n-- \\begin{cases}\n-- x\\mid y^{2}-3,\\\\[4pt]\n-- y\\mid x^{2}-2,\\\\[4pt]\n-- \\gcd\\!\\Bigl(3x+\\displaystyle\\frac{2(y^{2}-3)}{x},\\;2y+\\displaystyle\\frac{3(x^{2}-2)}{y}\\Bigr)=k,\n-- \\end{cases}\n-- \\]\n-- \n-- then there exist infinitely many pairs of positive integers $(x,y)$ satisfying the same three conditions.\nimport Mathlib\n\n/-!\n# Formal statement of the integer-pair problem\n\nThe original problem asks, for a positive integer `k ≥ 8`, to prove that the\nexistence of one positive integer solution `(x, y)` to a system of two\ndivisibility conditions and one gcd condition implies the existence of infinitely\nmany such solutions.\n\nThe quotient expressions in the gcd conditions are represented in `ℤ`. This is\nimportant because `y ^ 2 - 3` and `x ^ 2 - 2` can be negative even when `x` and\n`y` are positive natural numbers; natural-number division would truncate those\nnumerator differences. The divisibility hypotheses ensure that the displayed\ninteger divisions are exact.\n-/\n\nnamespace Problem\n\n/-- The three displayed conditions, together with positivity of `x` and `y`.\n\nHere `x` and `y` are natural numbers standing for the positive integers in the\nproblem. The divisibility relations and the quotient expressions are interpreted\nin the integers. `Int.gcd` returns a natural number and agrees with the usual\ngcd of the absolute values of its integer arguments. -/\ndef AdmissiblePair (k : ℕ) (x y : ℕ) : Prop :=\n 0 < x ∧\n 0 < y ∧\n (x : ℤ) ∣ (y : ℤ) ^ 2 - (3 : ℤ) ∧\n (y : ℤ) ∣ (x : ℤ) ^ 2 - (2 : ℤ) ∧\n Int.gcd\n ((3 : ℤ) * (x : ℤ) +\n Int.ediv ((2 : ℤ) * ((y : ℤ) ^ 2 - (3 : ℤ))) (x : ℤ))\n ((2 : ℤ) * (y : ℤ) +\n Int.ediv ((3 : ℤ) * ((x : ℤ) ^ 2 - (2 : ℤ))) (y : ℤ)) = k\n\n/-- The set of all positive integer pairs satisfying the displayed conditions\nfor a fixed `k`. -/\ndef SolutionSet (k : ℕ) : Set (ℕ × ℕ) :=\n {p | AdmissiblePair k p.1 p.2}\n\n/-- The complete assertion to be proved. It quantifies over every natural\nnumber `k`, restricts to the positive integers `k` with `k ≥ 8`, assumes that at\nleast one admissible positive integer pair exists, and concludes that the set of\nall such pairs is infinite. -/\ndef Target : Prop :=\n ∀ k : ℕ,\n 0 < k →\n 8 ≤ k →\n (∃ x y : ℕ, AdmissiblePair k x y) →\n Set.Infinite (SolutionSet k)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eaac4975-5d03-5892-ba7f-9614157a68c3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c873952bd65adff35e233c7e17e1052dd05f21fea0db297cbbc71e199c1a0bb2", "task_path": "tasks/nmp3_eaac4975-5d03-5892-ba7f-9614157a68c3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eaac4975-5d03-5892-ba7f-9614157a68c3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eaaf7099-e1c5-5e35-b2d9-3ac07c68920f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute triangle with $D$, $E$, $F$ the feet of the altitudes from $A$, $B$, $C$ onto $BC$, $CA$, $AB$ respectively. Let $P$ be one of the intersection points of line $EF$ with the circumcircle of $ABC$. Let $Q = BP \\cap DF$. Prove that $AP = AQ$.\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement of the altitude/circumcircle problem\n\nWe model the Euclidean plane as `ℝ × ℝ` with the usual dot product and\nEuclidean distance. All geometric objects in the problem are represented\nextensionally by subsets of this plane, so the statement below is a\nproposition about an arbitrary acute triangle and the specified constructed\npoints.\n\nThis file contains only definitions and the target proposition; it does not\ncontain a proof of the target.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A point of the Euclidean plane, represented by Cartesian coordinates. -/\nabbrev Point : Type := ℝ × ℝ\n\n/-- The dot product of two displacement vectors in the plane. -/\ndef dot (u v : Point) : ℝ := u.1 * v.1 + u.2 * v.2\n\n/-- The displacement vector from `Y` to `X`. -/\ndef diff (X Y : Point) : Point := (X.1 - Y.1, X.2 - Y.2)\n\n/-- The square of the Euclidean distance between two points. -/\ndef sqDist (X Y : Point) : ℝ := (X.1 - Y.1) ^ 2 + (X.2 - Y.2) ^ 2\n\n/-- The Euclidean distance between two points. -/\ndef dist (X Y : Point) : ℝ := Real.sqrt (sqDist X Y)\n\n/-- The (full) affine line through two points. -/\ndef Line (X Y : Point) : Set Point :=\n {R : Point | ∃ t : ℝ,\n R = (X.1 + t * (Y.1 - X.1), X.2 + t * (Y.2 - X.2))}\n\n/-- `OnLine X Y R` means that `R` lies on the full line through `X` and `Y`. -/\ndef OnLine (X Y R : Point) : Prop := R ∈ Line X Y\n\n/-- The angle at `A` in the ordered triple `A B C` is acute. -/\ndef IsAcuteAngle (A B C : Point) : Prop :=\n 0 < dot (diff B A) (diff C A)\n\n/-- `A B C` is an acute triangle: all three of its interior angles are acute. -/\ndef IsAcuteTriangle (A B C : Point) : Prop :=\n IsAcuteAngle A B C ∧ IsAcuteAngle B A C ∧ IsAcuteAngle C A B\n\n/--\n`D` is the foot of the altitude from `A` to the line `BC`: it lies on that\nline and the segment `AD` is perpendicular to `BC`.\n-/\ndef IsAltitudeFoot (A D B C : Point) : Prop :=\n OnLine B C D ∧ dot (diff A D) (diff B C) = 0\n\n/--\n`X` lies on the circumcircle of `A B C`, expressed as the existence of a\ncenter `O` and a positive radius `r` whose circle contains all four points.\n-/\ndef OnCircumcircle (A B C X : Point) : Prop :=\n ∃ O : Point, ∃ r : ℝ,\n 0 < r ∧\n sqDist O A = r ^ 2 ∧\n sqDist O B = r ^ 2 ∧\n sqDist O C = r ^ 2 ∧\n sqDist O X = r ^ 2\n/-- The circumcircle of `A B C`, as a set of points. -/\ndef Circumcircle (A B C : Point) : Set Point :=\n {X : Point | OnCircumcircle A B C X}\n\n/--\n`P` is one of the intersection points of the full line through `E` and `F`\nwith the circumcircle of `A B C`.\n-/\ndef IsLineCircumcircleIntersection (A B C E F P : Point) : Prop :=\n P ∈ Line E F ∧ P ∈ Circumcircle A B C\n\n/--\n`Q` is the unique point common to the full lines `XY` and `ZW`; this is the\nformal reading of the notation `Q = XY ∩ ZW` for the two constructed lines.\n-/\ndef IsUniqueLineIntersection (X Y Z W Q : Point) : Prop :=\n Q ∈ Line X Y ∧ Q ∈ Line Z W ∧\n ∀ R : Point, R ∈ Line X Y → R ∈ Line Z W → R = Q\n\n/--\nThe assertion of the problem: for every acute triangle `ABC`, for the feet\n`D`, `E`, `F` of its three altitudes, for every intersection point `P` of\nline `EF` with the circumcircle of `ABC`, and for the intersection point `Q`\nof lines `BP` and `DF`, the lengths `AP` and `AQ` are equal.\n-/\ndef Target : Prop :=\n ∀ (A B C D E F : Point),\n IsAcuteTriangle A B C →\n IsAltitudeFoot A D B C →\n IsAltitudeFoot B E C A →\n IsAltitudeFoot C F A B →\n ∀ P : Point,\n IsLineCircumcircleIntersection A B C E F P →\n ∀ Q : Point,\n IsUniqueLineIntersection B P D F Q →\n dist A P = dist A Q\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eaaf7099-e1c5-5e35-b2d9-3ac07c68920f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "481bc62ce2d37914692479c784b77749a153a011e757905bb7a4622d2959c638", "task_path": "tasks/nmp3_eaaf7099-e1c5-5e35-b2d9-3ac07c68920f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eaaf7099-e1c5-5e35-b2d9-3ac07c68920f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eafb5a11-449e-5866-a5af-29a9ef81a080", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ be real numbers such that $ab+ac+bc=3$. Prove that \n-- \\[\n-- \\frac{1}{\\sqrt{5a+4}}+\\frac{1}{\\sqrt{5b+4}}+\\frac{1}{\\sqrt{5c+4}}\\ge1.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissible triples of nonnegative real numbers satisfying\n`ab + ac + bc = 3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + a * c + b * c = 3\n\n/-- For all nonnegative real numbers `a`, `b`, and `c` with\n`ab + ac + bc = 3`, the sum of the three reciprocal square roots\n`1 / sqrt (5a + 4) + 1 / sqrt (5b + 4) + 1 / sqrt (5c + 4)` is at least `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n (1 : ℝ) / Real.sqrt (5 * a + 4) +\n (1 : ℝ) / Real.sqrt (5 * b + 4) +\n (1 : ℝ) / Real.sqrt (5 * c + 4) ≥ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eafb5a11-449e-5866-a5af-29a9ef81a080", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "24b5f169f883fe7002b349aa6b6e2522a4b4eea51b7373568ce74fa16759182a", "task_path": "tasks/nmp3_eafb5a11-449e-5866-a5af-29a9ef81a080", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eafb5a11-449e-5866-a5af-29a9ef81a080", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eb11dc7b-17ce-5a8d-9992-29f24ece36ef", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x, y, z$ be positive real numbers. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{1}{xy+2z^2}\\;\\le\\;\\frac{xy+yz+zx}{\\,xyz\\,(x+y+z)}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the cyclic inequality problem\n\nThe source problem asks to prove, for all positive real numbers `x`, `y`, and `z`,\n\n`∑_cyc 1 / (x*y + 2*z^2) ≤ (x*y + y*z + z*x) / (x*y*z*(x+y+z))`.\n\nThe cyclic sum is written out explicitly to make its three summands unambiguous.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The cyclic sum\n`1 / (x*y + 2*z^2) + 1 / (y*z + 2*x^2) + 1 / (z*x + 2*y^2)`. -/\ndef cyclicSum (x y z : ℝ) : ℝ :=\n 1 / (x * y + 2 * z ^ 2) +\n 1 / (y * z + 2 * x ^ 2) +\n 1 / (z * x + 2 * y ^ 2)\n\n/-- The right-hand side\n`(x*y + y*z + z*x) / (x*y*z*(x+y+z))`. -/\ndef rightHandSide (x y z : ℝ) : ℝ :=\n (x * y + y * z + z * x) / (x * y * z * (x + y + z))\n\n/-- The complete assertion of the problem: for every triple of positive real\nnumbers, the cyclic sum is at most the displayed right-hand side. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n cyclicSum x y z ≤ rightHandSide x y z\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb11dc7b-17ce-5a8d-9992-29f24ece36ef", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f95f04c77271654f159b6e53929384e3b513c478c556c2734f78aecbb19396b5", "task_path": "tasks/nmp3_eb11dc7b-17ce-5a8d-9992-29f24ece36ef", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb11dc7b-17ce-5a8d-9992-29f24ece36ef", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eb17569c-af21-50e9-9974-d2e4c29755eb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $I$ be the incenter of $\\triangle ABC$. The ray $AI$ meets the circumcircle of $\\triangle ABC$ again at $D$. The circumcircle of $\\triangle CDI$ meets the ray $BI$ again at $K$ (distinct from $I$). Prove that $BK = CK$.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Circumcenter\nimport Mathlib.Geometry.Euclidean.Incenter.Basic\n\n/-!\n# Formal statement of an incenter/isosceles geometry problem\n\nThe ambient plane is the real Euclidean plane of dimension two. A triangle is\nrepresented by `Affine.Triangle ℝ Plane`, which bundles three affinely\nindependent points. Its `incenter` and `circumsphere` are the corresponding\nMathlib notions.\n-/\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The real Euclidean plane used throughout the statement. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `RayFrom a b x` says that `x` lies on the ray starting at `a` and passing through `b`.\nThe parameter is nonnegative, so the endpoint is included. -/\ndef RayFrom (a b x : Plane) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ x = t • (b -ᵥ a) +ᵥ a\n\n/-- `IsCircumcircle A B C ω` records that `ω` is the circumcircle of the\nnon-collinear triple `A`, `B`, `C`: it passes through all three points, the\nthree points are non-collinear, and it is the unique sphere through them. -/\ndef IsCircumcircle (A B C : Plane) (ω : EuclideanGeometry.Sphere Plane) : Prop :=\n A ∈ ω ∧ B ∈ ω ∧ C ∈ ω ∧\n ¬ Collinear ℝ ({A, B, C} : Set Plane) ∧\n ∀ σ : EuclideanGeometry.Sphere Plane, A ∈ σ → B ∈ σ → C ∈ σ → σ = ω\n\n/-- `IsSecondIntersectionOnRay ω start through known second` says that `second`\nis the unique point of the sphere `ω` on the ray from `start` through `through`,\nother than the already known point `known` of `ω`. This is used both when the\nknown point is the endpoint of the ray (as for `D` on ray `AI`) and when it is\nan interior point of the ray (as for `K` on ray `BI`). -/\ndef IsSecondIntersectionOnRay (ω : EuclideanGeometry.Sphere Plane)\n (start through known second : Plane) : Prop :=\n known ∈ ω ∧ RayFrom start through known ∧ second ∈ ω ∧ second ≠ known ∧\n RayFrom start through second ∧\n ∀ z : Plane, z ∈ ω → z ≠ known → RayFrom start through z → z = second\n\n/-- The proposition asserted by the original problem. For every nondegenerate\nreal Euclidean triangle with vertices `A = t.points 0`, `B = t.points 1`, and\n`C = t.points 2`, with incenter `I = t.incenter`, if `D` is the second\nintersection of ray `AI` with the circumcircle of `ABC`, and if `K` is the\nsecond intersection of ray `BI` with the circumcircle of `CDI`, then\n`BK = CK`. -/\ndef Target : Prop :=\n ∀ (t : Affine.Triangle ℝ Plane) (D : Plane),\n IsSecondIntersectionOnRay t.circumsphere (t.points 0) t.incenter (t.points 0) D →\n ∀ (ωCDI : EuclideanGeometry.Sphere Plane),\n IsCircumcircle (t.points 2) D t.incenter ωCDI →\n ∀ (K : Plane),\n IsSecondIntersectionOnRay ωCDI (t.points 1) t.incenter t.incenter K →\n dist (t.points 1) K = dist (t.points 2) K\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb17569c-af21-50e9-9974-d2e4c29755eb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "52ceb50501f7c26598fedce78b8b86780969c763f886933de71bbd40650d4fef", "task_path": "tasks/nmp3_eb17569c-af21-50e9-9974-d2e4c29755eb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb17569c-af21-50e9-9974-d2e4c29755eb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eb19c6a8-a1b9-5cef-959e-4b373de8bdc8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle such that the arithmetic mean of $a,b,c$ is at least as large as the median of $a,b,c$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{3a-2\\sqrt{a^{2}+(b-c)^{2}}}{\\,b+c-a\\,}\\ge 3\\,,\n-- \\] \n-- where $\\sum_{\\text{cyc}}$ denotes the cyclic sum over $a,b,c$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The median (middle value) of three real numbers. -/\ndef median3 (a b c : ℝ) : ℝ :=\n max (min a b) (min (max a b) c)\n\n/-- The side lengths of a (nondegenerate) triangle are positive and satisfy\nthe three strict triangle inequalities. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a < b + c ∧ b < c + a ∧ c < a + b\n\n/-- One cyclic summand, with the distinguished variable first. -/\nnoncomputable def cyclicTerm (a b c : ℝ) : ℝ :=\n (3 * a - 2 * Real.sqrt (a ^ 2 + (b - c) ^ 2)) / (b + c - a)\n\n/-- The cyclic sum\n`(3a - 2 sqrt(a^2 + (b-c)^2))/(b+c-a) + ...`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The assertion from the problem: for every triangle with side lengths\n`a`, `b`, `c` whose arithmetic mean is at least its median, the cyclic sum is\nat least `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n IsTriangleSideLengths a b c →\n (a + b + c) / 3 ≥ median3 a b c →\n cyclicSum a b c ≥ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb19c6a8-a1b9-5cef-959e-4b373de8bdc8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f6c478e08065ed483c7ae75039bd5c0c68ba421c71d02e0067e18d273ad1d796", "task_path": "tasks/nmp3_eb19c6a8-a1b9-5cef-959e-4b373de8bdc8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb19c6a8-a1b9-5cef-959e-4b373de8bdc8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eb4a7a5e-fbbf-526e-aacd-c0e1abe26a57", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $(a_n)_{n\\ge1}$ be a sequence of positive real numbers and let $s$ be a fixed positive integer. Assume that for every $n>s$ \n-- \n-- \\[\n-- a_n=\\max\\{a_k+a_{\\,n-k}\\mid 1\\le k\\le n-1\\}\\,. \n-- \\]\n-- \n-- Prove that there exist an integer $\\ell$ with $1\\le\\ell\\le s$ and an integer $N$ such that \n-- \n-- \\[\n-- a_n=a_\\ell+a_{\\,n-\\ell}\\qquad\\text{for all }n\\ge N .\n-- \\] \n-- (Equivalently, for all sufficiently large $n$ the maximum in the definition is attained at the same index $\\ell\\le s$.)\nimport Mathlib\n\n/-!\n# A maximum recurrence for positive real sequences\n\nThe original sequence is indexed by positive integers. We represent it by a\nfunction `a : ℕ → ℝ` and impose positivity only at positive indices; the value\n`a 0` is an unconstrained totalization and plays no role in the statement.\n-/\n\nnamespace Problem\n\n/-- The candidate summands occurring in the recurrence at index `n`. -/\ndef IsCandidateValue (a : ℕ → ℝ) (n : ℕ) (x : ℝ) : Prop :=\n ∃ k : ℕ, 1 ≤ k ∧ k ≤ n - 1 ∧ x = a k + a (n - k)\n\n/-- `M` is the maximum of the finite candidate set at index `n`.\n\nThis is stated by membership plus the universal upper-bound property, avoiding\nany choice of a particular finite maximum operation. For `n > s` in the\nproblem the candidate set is nonempty. -/\ndef IsMaximumValue (a : ℕ → ℝ) (n : ℕ) (M : ℝ) : Prop :=\n IsCandidateValue a n M ∧\n ∀ x : ℝ, IsCandidateValue a n x → x ≤ M\n\n/-- The hypothesis that the recurrence holds at every index `n > s`. -/\ndef SatisfiesMaxRecurrence (a : ℕ → ℝ) (s : ℕ) : Prop :=\n ∀ n : ℕ, s < n → IsMaximumValue a n (a n)\n\n/-- The sequence is positive at every positive index. -/\ndef PositiveOnPositiveIndices (a : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, 1 ≤ n → 0 < a n\n\n/-- A fixed index `k` realizes the maximum at index `n`. -/\ndef IsMaximizerAt (a : ℕ → ℝ) (n k : ℕ) : Prop :=\n 1 ≤ k ∧ k ≤ n - 1 ∧\n ∀ j : ℕ, 1 ≤ j → j ≤ n - 1 →\n a j + a (n - j) ≤ a k + a (n - k)\n\n/-- Eventual stabilization at the fixed decomposition index `ell`. -/\ndef EventuallyStabilizesAt (a : ℕ → ℝ) (ell : ℕ) : Prop :=\n ∃ N : ℕ, ∀ n : ℕ, N ≤ n → 1 ≤ n →\n a n = a ell + a (n - ell)\n\n/-- Eventual attainment of the maximum at the fixed index `ell`.\nThis is the parenthetical equivalent formulation in the source problem. -/\ndef EventuallyHasFixedMaximizer (a : ℕ → ℝ) (ell : ℕ) : Prop :=\n ∃ N : ℕ, ∀ n : ℕ, N ≤ n → 1 ≤ n → IsMaximizerAt a n ell\n\n/-- The conclusion of the problem, in its displayed equality form. -/\ndef Conclusion (a : ℕ → ℝ) (s : ℕ) : Prop :=\n ∃ ell : ℕ, 1 ≤ ell ∧ ell ≤ s ∧ EventuallyStabilizesAt a ell\n\n/-- The parenthetical equivalent form of the conclusion. -/\ndef FixedMaximizerConclusion (a : ℕ → ℝ) (s : ℕ) : Prop :=\n ∃ ell : ℕ, 1 ≤ ell ∧ ell ≤ s ∧ EventuallyHasFixedMaximizer a ell\n\n/-- The complete assertion to be proved. -/\ndef Target : Prop :=\n ∀ (a : ℕ → ℝ) (s : ℕ),\n 0 < s →\n PositiveOnPositiveIndices a →\n SatisfiesMaxRecurrence a s →\n Conclusion a s\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb4a7a5e-fbbf-526e-aacd-c0e1abe26a57", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c2ef56e4203eaa8035ed8cfe12198408d048b2f66b92bd0fd756c672c6a45ca3", "task_path": "tasks/nmp3_eb4a7a5e-fbbf-526e-aacd-c0e1abe26a57", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb4a7a5e-fbbf-526e-aacd-c0e1abe26a57", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eb668eb4-b2c4-5d0a-a90c-ce0a3322b1ef", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove the inequality \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{4\\sqrt{ab}}{2c+a+b}\\;\\le\\;\\sum_{\\text{cyc}}\\sqrt{\\frac{2a}{\\,b+c\\,}}\\,,\n-- \\] \n-- where the cyclic sum runs over $(a,b,c)$, i.e. the three terms are \n-- \\[\n-- \\frac{4\\sqrt{ab}}{2c+a+b},\\qquad\\frac{4\\sqrt{bc}}{2a+b+c},\\qquad\\frac{4\\sqrt{ca}}{2b+c+a}\n-- \\] \n-- and \n-- \\[\n-- \\sqrt{\\frac{2a}{b+c}},\\qquad\\sqrt{\\frac{2b}{c+a}},\\qquad\\sqrt{\\frac{2c}{a+b}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a cyclic square-root inequality\n\nFor positive real numbers `a`, `b`, and `c`, the problem asks for a proof of\n\n`∑_cyc 4 * sqrt (a * b) / (2 * c + a + b)\n ≤ ∑_cyc sqrt (2 * a / (b + c))`,\n\nwhere both cyclic sums contain the three terms displayed in the source problem.\n\nThe declarations below define the two sides explicitly as rotations of a single\ncyclic term. The target proposition is left unproved.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The `(a,b,c)` cyclic term on the left-hand side:\n`4 * sqrt (a * b) / (2 * c + a + b)`. -/\ndef lhsCyclicTerm (a b c : ℝ) : ℝ :=\n (4 * Real.sqrt (a * b)) / (2 * c + a + b)\n\n/-- The `(a,b,c)` cyclic term on the right-hand side:\n`sqrt (2 * a / (b + c))`. -/\ndef rhsCyclicTerm (a b c : ℝ) : ℝ :=\n Real.sqrt ((2 * a) / (b + c))\n\n/-- The left-hand cyclic sum, written out as the three rotations\n`(a,b,c)`, `(b,c,a)`, and `(c,a,b)`. -/\ndef lhsCyclicSum (a b c : ℝ) : ℝ :=\n lhsCyclicTerm a b c + lhsCyclicTerm b c a + lhsCyclicTerm c a b\n\n/-- The right-hand cyclic sum, written out as the three rotations\n`(a,b,c)`, `(b,c,a)`, and `(c,a,b)`. -/\ndef rhsCyclicSum (a b c : ℝ) : ℝ :=\n rhsCyclicTerm a b c + rhsCyclicTerm b c a + rhsCyclicTerm c a b\n\n/-- The inequality stated in the problem, for all positive real `a`, `b`, and `c`.\n\nThe arguments of both cyclic sums are real numbers; the positivity hypotheses\nare exactly those stated in the source. The inequality is non-strict. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n lhsCyclicSum a b c ≤ rhsCyclicSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb668eb4-b2c4-5d0a-a90c-ce0a3322b1ef", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "19d17d69ecc5d01a86f442e6763a27d54074ce934b1565432c35f68b42310737", "task_path": "tasks/nmp3_eb668eb4-b2c4-5d0a-a90c-ce0a3322b1ef", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb668eb4-b2c4-5d0a-a90c-ce0a3322b1ef", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eb72d29d-79d0-59a8-ab9b-8c3466730015", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that every positive integer can be expressed as a sum of one or more numbers of the form $2^r3^s$, where $r$ and $s$ are non‑negative integers, in such a way that no summand divides another. (For example, $23 = 9 + 8 + 6$.)\nimport Mathlib.Data.Fintype.Basic\nimport Mathlib.Algebra.BigOperators.Group.Finset.Basic\nimport Mathlib.Data.Fin.VecNotation\n\n/-!\n# Every positive integer is a sum of pairwise non-dividing `2^r * 3^s` terms\n\nThis file formalizes the statement of the problem. It does not contain a proof.\n-/\n\nnamespace Problem\n\n/-- An allowed summand is a natural number of the form `2 ^ r * 3 ^ s`, where\nthe exponents `r` and `s` are non-negative integers (represented by `ℕ`). -/\ndef IsAllowedSummand (x : ℕ) : Prop :=\n ∃ r s : ℕ, x = 2 ^ r * 3 ^ s\n\n/-- A decomposition of `n` into `m` summands `a 0, ..., a (m - 1)` is valid when\n\n* there is at least one summand (`1 ≤ m`),\n* every summand has the form `2 ^ r * 3 ^ s` with `r, s : ℕ`,\n* the sum of the summands is `n`, and\n* no summand divides a different summand. -/\ndef IsValidDecomposition (n : ℕ) (m : ℕ) (a : Fin m → ℕ) : Prop :=\n 1 ≤ m ∧\n (∀ i : Fin m, IsAllowedSummand (a i)) ∧\n (∑ i : Fin m, a i) = n ∧\n (∀ i j : Fin m, i ≠ j → ¬ a i ∣ a j)\n\n/-- `n` is expressible in the required way. -/\ndef Admissible (n : ℕ) : Prop :=\n ∃ (m : ℕ) (a : Fin m → ℕ), IsValidDecomposition n m a\n\n/-- The problem's assertion: every positive natural number admits a valid\ndecomposition into one or more pairwise non-dividing allowed summands. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → Admissible n\n\n/-- The three summands in the example `23 = 9 + 8 + 6`. -/\ndef example23Summands : Fin 3 → ℕ := ![9, 8, 6]\n\n/-- The statement that the displayed example is a valid decomposition of `23`. -/\ndef Example23 : Prop :=\n IsValidDecomposition 23 3 example23Summands\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb72d29d-79d0-59a8-ab9b-8c3466730015", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7c3f5e7f5dc5ace46596e5ef464a947770a4caec318d1d2cb54884cb74f6dab2", "task_path": "tasks/nmp3_eb72d29d-79d0-59a8-ab9b-8c3466730015", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb72d29d-79d0-59a8-ab9b-8c3466730015", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eb88a28a-7cea-5852-8701-a9a3f0bd4123", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle (so $a,b,c>0$ and $a x) a b c\n\n/-- The cyclic sum `∑cyc a^3`, namely `a^3 + b^3 + c^3`. -/\ndef cycA3 (a b c : ℝ) : ℝ :=\n cyclicSum3 (fun (x : ℝ) (_y : ℝ) (_z : ℝ) => x ^ 3) a b c\n\n/-- The cyclic sum `∑cyc a^2 b^2`, namely\n`a^2 b^2 + b^2 c^2 + c^2 a^2`. -/\ndef cycA2B2 (a b c : ℝ) : ℝ :=\n cyclicSum3 (fun (x : ℝ) (y : ℝ) (_z : ℝ) => x ^ 2 * y ^ 2) a b c\n\n/-- The cyclic sum `∑cyc (a + b - c)^7`. -/\ndef cycABSubCPow7 (a b c : ℝ) : ℝ :=\n cyclicSum3 (fun (x : ℝ) (y : ℝ) (z : ℝ) => (x + y - z) ^ 7) a b c\n\n/-- The cyclic sum `∑cyc a^7`, namely `a^7 + b^7 + c^7`. -/\ndef cycAPow7 (a b c : ℝ) : ℝ :=\n cyclicSum3 (fun (x : ℝ) (_y : ℝ) (_z : ℝ) => x ^ 7) a b c\n\n/-- The factor `(a - b)(b - c)(c - a)` in the second term. -/\ndef triangleFactor (a b c : ℝ) : ℝ :=\n (a - b) * (b - c) * (c - a)\n\n/-- The bracketed expression\n`(∑cyc a) * ((∑cyc a^3) + abc) + ∑cyc a^2 b^2`. -/\ndef bracket (a b c : ℝ) : ℝ :=\n cycA a b c * (cycA3 a b c + a * b * c) + cycA2B2 a b c\n\n/-- The left-hand side of the desired inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n cycABSubCPow7 a b c + 7 * triangleFactor a b c * bracket a b c\n\n/-- The right-hand side of the desired inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n cycAPow7 a b c\n\n/-- The inequality whose truth is to be proved for every triangle side triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full universal assertion: for all positive real numbers `a`, `b`, and\n`c` satisfying the strict triangle inequalities, the displayed cyclic-sum\ninequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), TriangleSideLengths a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb88a28a-7cea-5852-8701-a9a3f0bd4123", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2ff4509616a4df314a3f216423d8ba9d9e2a894adf91ef18b79760ec38de92ea", "task_path": "tasks/nmp3_eb88a28a-7cea-5852-8701-a9a3f0bd4123", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eb88a28a-7cea-5852-8701-a9a3f0bd4123", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ec074c66-c195-5de1-b6a9-b22096f47874", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\{x_n\\}_{n\\in\\mathbb{N}}$ be a sequence of non‑zero real numbers. For each positive integer $m$ define \n-- \\[\n-- X_m=\\bigl\\{A\\subseteq\\{0,1,\\dots,m-1\\}:\\; \\bigl|\\sum_{a\\in A}x_a\\bigr| \\gt \\frac{1}{m}\\bigr\\}.\n-- \\] \n-- Prove that \n-- \\[\n-- \\lim_{n\\to\\infty}\\frac{|X_n|}{2^n}=1.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the subset-sum density theorem\n\nFor a nonzero real sequence `x`, `X x m` is the finite collection of\nsubsets of `{0, ..., m - 1}` whose `x`-sum has absolute value greater than\n`1 / m`. `Target` states that, as positive `n` tends to infinity, the\nnumber of such subsets divided by `2 ^ n` tends to `1`.\n-/\n\nnamespace Problem\n\n/-- The positive natural numbers, used as the index set for the sets `X_m`. -/\nabbrev PositiveNat : Type := {m : ℕ // 0 < m}\n\n/-- A real sequence all of whose terms are nonzero. -/\ndef IsAdmissibleSequence (x : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, x n ≠ 0\n\n/-- For a positive integer `m`, this is the finite set\n`{A ⊆ {0, ..., m - 1} : |∑_{a ∈ A} x_a| > 1 / m}`. -/\nnoncomputable def X (x : ℕ → ℝ) (m : PositiveNat) : Finset (Finset ℕ) :=\n (Finset.range m.1).powerset.filter\n (fun A : Finset ℕ =>\n (1 : ℝ) / (m.1 : ℝ) < |∑ a ∈ A, x a|)\n\n/-- The asserted limit for a fixed sequence `x`. -/\ndef LimitStatement (x : ℕ → ℝ) : Prop :=\n Filter.Tendsto\n (fun n : PositiveNat =>\n ((X x n).card : ℝ) / (2 : ℝ) ^ n.1)\n Filter.atTop (nhds (1 : ℝ))\n\n/-- The full assertion: for every nonzero real sequence `x`, the proportion\nof subsets in `X x n` among all `2 ^ n` subsets tends to `1`. -/\ndef Target : Prop :=\n ∀ x : ℕ → ℝ, IsAdmissibleSequence x → LimitStatement x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ec074c66-c195-5de1-b6a9-b22096f47874", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7f795fbd97296a43109382e768bba549e1f121d0e7c3aef87a59c5bc5443628e", "task_path": "tasks/nmp3_ec074c66-c195-5de1-b6a9-b22096f47874", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ec074c66-c195-5de1-b6a9-b22096f47874", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ec0ebf48-9ff3-5897-9c4c-d79ad7a84b81", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n,k$ be positive integers with $2\\le n<2^{k}$. Prove that there exists a subset $A\\subseteq\\{0,1,\\dots ,n\\}$ such that for any distinct $x,y\\in A$ the binomial coefficient $\\displaystyle\\binom{y}{x}$ is even, and moreover \n-- \\[\n-- |A|\\;\\ge\\;\\frac{\\displaystyle\\binom{k}{\\lfloor k/2\\rfloor}}{2^{k}}\\,(n+1)\\,. \n-- \\] \n-- (Equivalently, no binary representation of one element of $A$ contains the binary representation of another.)\nimport Mathlib\n\n/-!\n# Formal statement for the subset-with-even-binomial-coefficients problem\n\nThe source problem asks, for positive natural numbers `n` and `k` with\n`2 ≤ n < 2^k`, for the existence of a subset `A` of `{0, 1, ..., n}` whose\ndistinct elements have even binomial coefficients in the indicated order,\nwith a lower bound on the cardinality of `A`.\n\nThe target is recorded as a proposition-valued definition; no proof is\nprovided or assumed.\n-/\n\nnamespace Problem\n\n/-- The finite set `A` is a subset of `{0, 1, ..., n}`.\nThis is represented as a subset of `Finset.range (n + 1)`. -/\ndef SubsetUpTo (n : ℕ) (A : Finset ℕ) : Prop :=\n A ⊆ Finset.range (n + 1)\n\n/-- For every ordered pair of distinct elements `x, y` of `A`, the natural\nbinomial coefficient `Nat.choose y x` is even. With Mathlib's convention,\n`Nat.choose y x = 0` when `x > y`; in particular the condition only has\nnontrivial content when `x < y`. -/\ndef PairwiseBinomialEven (A : Finset ℕ) : Prop :=\n ∀ x : ℕ, x ∈ A → ∀ y : ℕ, y ∈ A → x ≠ y → Even (Nat.choose y x)\n\n/-- The binary representation of `x` is contained in that of `y` when every\n`1`-bit of `x` is also a `1`-bit of `y`, equivalently `x &&& y = x`. -/\ndef BinaryRepresentationContained (x y : ℕ) : Prop :=\n x &&& y = x\n\n/-- No ordered pair of distinct elements of `A` has the property that the\nbinary representation of the first is contained in the binary representation\nof the second. This is the binary reformulation mentioned in the source. -/\ndef NoBinaryRepresentationContained (A : Finset ℕ) : Prop :=\n ∀ x : ℕ, x ∈ A → ∀ y : ℕ, y ∈ A → x ≠ y →\n ¬ BinaryRepresentationContained x y\n\n/-- The admissibility condition on a proposed set `A`: it is a subset of\n`{0, 1, ..., n}` and all its distinct pairs have the required even binomial\ncoefficient. -/\ndef Admissible (n : ℕ) (A : Finset ℕ) : Prop :=\n SubsetUpTo n A ∧ PairwiseBinomialEven A\n\n/-- The same range and binary-containment condition, kept as an explicit\nformal counterpart of the parenthetical equivalent formulation. -/\ndef AdmissibleByBinaryContainment (n : ℕ) (A : Finset ℕ) : Prop :=\n SubsetUpTo n A ∧ NoBinaryRepresentationContained A\n\n/-- The cardinality lower bound from the problem, interpreted as an\ninequality in the real numbers. The exponent `k / 2` is natural-number\ndivision, i.e. `⌊k / 2⌋`. -/\ndef CardLowerBound (n k : ℕ) (A : Finset ℕ) : Prop :=\n (A.card : ℝ) ≥\n ((Nat.choose k (k / 2) : ℝ) / ((2 : ℝ) ^ k)) *\n (((n + 1 : ℕ) : ℝ))\n\n/-- For fixed `n` and `k`, the asserted existence of a good set satisfying\nboth the admissibility condition and the cardinality lower bound. -/\ndef ExistsGoodSubset (n k : ℕ) : Prop :=\n ∃ A : Finset ℕ, Admissible n A ∧ CardLowerBound n k A\n\n/-- The complete universal statement of the problem: for all positive\nintegers `n` and `k` satisfying `2 ≤ n < 2^k`, there exists an admissible\nsubset `A` of `{0, 1, ..., n}` whose cardinality satisfies the stated lower\nbound. -/\ndef Target : Prop :=\n ∀ n k : ℕ, 0 < n → 0 < k → 2 ≤ n → n < 2 ^ k →\n ExistsGoodSubset n k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ec0ebf48-9ff3-5897-9c4c-d79ad7a84b81", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fdea7b44b26530fd947d92dc64250a37b0a5adedaa65361c33c2bcbdc7d3b86c", "task_path": "tasks/nmp3_ec0ebf48-9ff3-5897-9c4c-d79ad7a84b81", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ec0ebf48-9ff3-5897-9c4c-d79ad7a84b81", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ec3b2f00-94c4-5ade-ab38-6721958780a9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) with \\(a^{2}+b^{2}+c^{2}=3\\). Prove that \n-- \\[\n-- \\frac{1}{a^{2}+b^{2}}+\\frac{1}{b^{2}+c^{2}}+\\frac{1}{c^{2}+a^{2}}+\\frac{3+6abc}{2abc}\\ge 16\\Bigl(\\frac{1}{a^{2}+7}+\\frac{1}{b^{2}+7}+\\frac{1}{c^{2}+7}\\Bigr).\\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe source problem asks to prove an inequality for positive real numbers\n`a`, `b`, and `c` satisfying `a^2 + b^2 + c^2 = 3`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / (a ^ 2 + b ^ 2) +\n 1 / (b ^ 2 + c ^ 2) +\n 1 / (c ^ 2 + a ^ 2) +\n (3 + 6 * a * b * c) / (2 * a * b * c)\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n 16 * (1 / (a ^ 2 + 7) + 1 / (b ^ 2 + 7) + 1 / (c ^ 2 + 7))\n\n/-- The admissibility condition for the variables in the source problem:\n`a > 0`, `b > 0`, `c > 0`, and `a^2 + b^2 + c^2 = 3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a ^ 2 + b ^ 2 + c ^ 2 = 3\n\n/-- The inequality asserted by the source problem, as a predicate of `a`, `b`, `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete universally quantified assertion requested by the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ec3b2f00-94c4-5ade-ab38-6721958780a9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e35a6cb5f24ac60ae4086d01f68af8fcb03e4002d6a0047e29ffe4590eebda00", "task_path": "tasks/nmp3_ec3b2f00-94c4-5ade-ab38-6721958780a9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ec3b2f00-94c4-5ade-ab38-6721958780a9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ecbb6507-e1df-530f-bec5-0da772b8ff1f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any positive real number $\\alpha$, there exist infinitely many positive integers $n$ such that $\\displaystyle\\lfloor \\alpha n^{2}\\rfloor$ is even.\nimport Mathlib\n\n/-!\n# Formalization of the target statement\n\nThe problem asks to prove that for every positive real number `α`, infinitely many\npositive integers `n` satisfy that `⌊α * n^2⌋` is even.\n-/\n\nnamespace Problem\n\n/-- The integer part `⌊α * n^2⌋` is even. -/\ndef FloorEven (α : ℝ) (n : ℕ) : Prop :=\n Even (Int.floor (α * (n : ℝ) ^ 2))\n\n/-- The positive integers `n` admissible for a fixed positive real `α`: those for which\n`⌊α * n^2⌋` is even. The positivity condition on `n` is included explicitly. -/\ndef Admissible (α : ℝ) (n : ℕ) : Prop :=\n 0 < n ∧ FloorEven α n\n\n/-- For every positive real number `α`, there are infinitely many positive integers `n`\nsuch that `⌊α * n^2⌋` is even. -/\ndef Target : Prop :=\n ∀ α : ℝ, 0 < α → Set.Infinite {n : ℕ | Admissible α n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ecbb6507-e1df-530f-bec5-0da772b8ff1f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "42c6a9bfd09dddde3cbf47a6b1564d7909721e2847a40f300b85e68152fd0ba7", "task_path": "tasks/nmp3_ecbb6507-e1df-530f-bec5-0da772b8ff1f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ecbb6507-e1df-530f-bec5-0da772b8ff1f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ecd9925c-ab29-565c-888b-dd0d7eeca1e5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that for every prime $p$ with $p\\equiv1\\pmod8$, \n-- \\[\n-- \\sum_{k=1}^{\\frac{p-1}{4}}(-1)^k\\binom{p}{k}\\equiv3\\bigl(2^{\\,p-1}-1\\bigr)\\pmod{p^2}.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the congruence statement in `problem.md`.\n\nThe original problem asks to show, for every prime `p` with `p ≡ 1 (mod 8)`,\nthat the alternating partial sum of binomial coefficients up to `(p - 1) / 4`\nis congruent to `3 * (2 ^ (p - 1) - 1)` modulo `p ^ 2`.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the congruence:\n`∑_{k=1}^{(p-1)/4} (-1)^k * choose p k`, regarded as an integer. -/\ndef lhs (p : ℕ) : ℤ :=\n ∑ k ∈ Finset.Icc 1 ((p - 1) / 4), (-1 : ℤ) ^ k * (Nat.choose p k : ℤ)\n\n/-- The right-hand side of the congruence:\n`3 * (2 ^ (p - 1) - 1)`, regarded as an integer. -/\ndef rhs (p : ℕ) : ℤ :=\n 3 * ((2 : ℤ) ^ (p - 1) - 1)\n\n/-- The assertion of the problem: for every prime `p` congruent to `1` modulo `8`,\nthe alternating binomial sum is congruent to `3 * (2 ^ (p - 1) - 1)` modulo `p ^ 2`. -/\ndef Target : Prop :=\n ∀ p : ℕ, p.Prime → p ≡ 1 [MOD 8] → lhs p ≡ rhs p [ZMOD (p : ℤ) ^ 2]\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ecd9925c-ab29-565c-888b-dd0d7eeca1e5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "008c82af8cfd40129fb1e21cfe24fa751dc4f90ae5ea133ccd3beac997b8c4d4", "task_path": "tasks/nmp3_ecd9925c-ab29-565c-888b-dd0d7eeca1e5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ecd9925c-ab29-565c-888b-dd0d7eeca1e5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ecf45b9c-6789-533e-bae0-41440c507015", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{1}{\\,4a^{2}+4b^{2}-ab\\,}\\ge\\frac{9}{7\\,(a^{2}+b^{2}+c^{2})}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nthe cyclic inequality\n\n`1 / (4a^2 + 4b^2 - ab) + 1 / (4b^2 + 4c^2 - bc)\n + 1 / (4c^2 + 4a^2 - ca) ≥ 9 / (7 (a^2 + b^2 + c^2))`.\n\nThis file records the assertion as a proposition. It deliberately contains no\nproof of that proposition.\n-/\n\nnamespace Problem\n\n/-- The denominator occurring in the cyclic sum. -/\nnoncomputable def cyclicDenominator (x y : ℝ) : ℝ :=\n 4 * x ^ 2 + 4 * y ^ 2 - x * y\n\n/--\nThe cyclic sum, written out as the three terms obtained from the cycles\n`(a,b)`, `(b,c)`, and `(c,a)`.\n-/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n 1 / cyclicDenominator a b +\n 1 / cyclicDenominator b c +\n 1 / cyclicDenominator c a\n\n/-- The inequality asserted for a fixed triple `(a,b,c)` of real numbers. -/\nnoncomputable def inequalityHolds (a b c : ℝ) : Prop :=\n cyclicSum a b c ≥ 9 / (7 * (a ^ 2 + b ^ 2 + c ^ 2))\n\n/--\nThe full target: for all positive real numbers `a`, `b`, and `c`, the cyclic\ninequality holds.\n-/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → inequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ecf45b9c-6789-533e-bae0-41440c507015", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "33c05b996d890960ecfb8c1231ee620fc682d3fe0a82bb7c9070ecf4da592b5f", "task_path": "tasks/nmp3_ecf45b9c-6789-533e-bae0-41440c507015", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ecf45b9c-6789-533e-bae0-41440c507015", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ed2a72e2-cb57-59c4-ab03-a3877e81c4c9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ satisfy $a^{2}+b^{2}+c^{2}\\le3$. Prove that \n-- \\[\n-- (a+b+c)\\bigl(a+b+c-abc\\bigr)\\ge2\\bigl(a^{2}b+b^{2}c+c^{2}a\\bigr)\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion that for all nonnegative real numbers `a`, `b`, and `c`\nwhose squares sum to at most `3`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a ^ 2 + b ^ 2 + c ^ 2 ≤ 3 →\n (a + b + c) * (a + b + c - a * b * c) ≥\n 2 * (a ^ 2 * b + b ^ 2 * c + c ^ 2 * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ed2a72e2-cb57-59c4-ab03-a3877e81c4c9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cce1fc46b40c11290a033f8fed6d85166e863f867f096ba905933383fda142dd", "task_path": "tasks/nmp3_ed2a72e2-cb57-59c4-ab03-a3877e81c4c9", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ed2a72e2-cb57-59c4-ab03-a3877e81c4c9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ed333334-b44c-59b8-b462-58f5376fbba5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A number of 17 workers stand in a row, labeled 1,…,17. Every contiguous group of at least 2 workers (i.e. any interval \\([i,j]\\) with \\(1\\le i0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{a(a^{2}+bc)}{\\sqrt{a^{4}+b+c}}+\\frac{b(b^{2}+ca)}{\\sqrt{b^{4}+c+a}}+\\frac{c(c^{2}+ab)}{\\sqrt{c^{4}+a+b}}\\ge 2\\sqrt{3}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic square root inequality\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwith product one, the lower bound\n`2 * sqrt 3` for a cyclic sum of three terms.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def cyclicLHS (a b c : ℝ) : ℝ :=\n a * (a ^ 2 + b * c) / Real.sqrt (a ^ 4 + b + c) +\n b * (b ^ 2 + c * a) / Real.sqrt (b ^ 4 + c + a) +\n c * (c ^ 2 + a * b) / Real.sqrt (c ^ 4 + a + b)\n\n/-- The assertion to be proved: for all positive reals `a`, `b`, `c` with\n`a * b * c = 1`, the cyclic square-root expression is at least `2 * sqrt 3`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a * b * c = 1 →\n cyclicLHS a b c ≥ 2 * Real.sqrt 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ed4e2800-b7d7-503a-8cc7-5b4448048ba0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b52be05c8f90cf20a2df50fb8fe8853dbab012b650614b647fe2eb7403bdba61", "task_path": "tasks/nmp3_ed4e2800-b7d7-503a-8cc7-5b4448048ba0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ed4e2800-b7d7-503a-8cc7-5b4448048ba0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ed526b32-3ab7-550d-b7c5-507206d649d5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a-b}{c^2+ab+bc}+\\frac{b-c}{a^2+bc+ca}+\\frac{c-a}{b^2+ca+ab}\\ge0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic rational inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthat\n\n`(a - b) / (c^2 + a*b + b*c)\n + (b - c) / (a^2 + b*c + c*a)\n + (c - a) / (b^2 + c*a + a*b) ≥ 0`.\n\nThe declaration below records exactly this assertion as a proposition. No proof is\nasserted here.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def inequalityLHS (a b c : ℝ) : ℝ :=\n (a - b) / (c ^ 2 + a * b + b * c) +\n (b - c) / (a ^ 2 + b * c + c * a) +\n (c - a) / (b ^ 2 + c * a + a * b)\n\n/-- The complete proposition asserted by the problem: for every triple of positive\nreal numbers, the displayed cyclic sum is nonnegative. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → 0 ≤ inequalityLHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ed526b32-3ab7-550d-b7c5-507206d649d5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fe25bd9aa8f99629121736c460873ae6a1a4c08e05d1b9d9ad837602dd111fe2", "task_path": "tasks/nmp3_ed526b32-3ab7-550d-b7c5-507206d649d5", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ed526b32-3ab7-550d-b7c5-507206d649d5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ed56fc91-f76d-5083-bc6c-25ed27ebaf18", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$, $q$, and $r$ be prime numbers such that $p^3+q^3+r^3$ is divisible by $pqr$. Prove that the sum of two of the primes is divisible by the third; i.e. show that either $p\\mid q+r$, $q\\mid p+r$, or $r\\mid p+q$.\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThis file records the statement of the problem, but does not assert or prove it.\n\nThe original problem asks, for natural primes `p`, `q`, and `r`, to prove that\n`p ∣ q + r`, or `q ∣ p + r`, or `r ∣ p + q`, assuming that `p q r` divides\n`p ^ 3 + q ^ 3 + r ^ 3`.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypothesis of the problem: `p`, `q`, and `r` are natural\nprimes and their product divides the sum of their cubes. -/\ndef Hypothesis (p q r : ℕ) : Prop :=\n Nat.Prime p ∧ Nat.Prime q ∧ Nat.Prime r ∧\n (p * q * r) ∣ (p ^ 3 + q ^ 3 + r ^ 3)\n\n/-- The required conclusion: at least one of the three pairwise sums is\ndivisible by the remaining prime. -/\ndef Conclusion (p q r : ℕ) : Prop :=\n p ∣ q + r ∨ q ∣ p + r ∨ r ∣ p + q\n\n/-- The full universally quantified statement of the problem. -/\ndef Target : Prop :=\n ∀ (p q r : ℕ), Hypothesis p q r → Conclusion p q r\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ed56fc91-f76d-5083-bc6c-25ed27ebaf18", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9d0bc341c8b82a155d1801d019ef6e492f8c3e66758cbca12da6cc7a96d6b29a", "task_path": "tasks/nmp3_ed56fc91-f76d-5083-bc6c-25ed27ebaf18", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ed56fc91-f76d-5083-bc6c-25ed27ebaf18", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ed57433e-1f80-57ab-9e13-ad0e852da0f8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A flea moves on the positive direction of the real x‑axis, starting from the origin. Each jump must have length either $\\sqrt{2}$ or $\\sqrt{2005}$. Prove that there exists an integer $n_{0}$ such that for every integer $n\\ge n_{0}$ the flea can land at some point inside the interval $[\\,n,\\;n+1\\,]$ (i.e. there are non‑negative integers $a,b$ with $a\\sqrt2+b\\sqrt{2005}\\in[n,n+1]$).\nimport Mathlib\n\n/-!\n# Flea jump problem\n\nThis file formalizes the statement of the problem: a flea starts at the origin\nand moves only in the positive real direction, with every jump having length\neither `sqrt 2` or `sqrt 2005`. The target asserts that from some integer\nthreshold onward, every unit interval with integer left endpoint contains a\nreachable landing point.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The displacement after `a` jumps of length `sqrt 2` and `b` jumps of\nlength `sqrt 2005`, all in the positive real direction. -/\ndef LandingPoint (a b : ℕ) : ℝ :=\n (a : ℝ) * Real.sqrt 2 + (b : ℝ) * Real.sqrt 2005\n\n/-- A real number is a reachable landing point when it is the displacement\nobtained from nonnegative counts of the two permitted jump lengths. -/\ndef IsReachable (x : ℝ) : Prop :=\n ∃ a b : ℕ, x = LandingPoint a b\n\n/-- The flea can land in the closed unit interval `[n, n + 1]`. -/\ndef HasLandingInUnitInterval (n : ℤ) : Prop :=\n ∃ a b : ℕ,\n (n : ℝ) ≤ LandingPoint a b ∧ LandingPoint a b ≤ (n : ℝ) + 1\n\n/-- The assertion of the problem: there exists an integer threshold `n₀` such\nthat every integer `n ≥ n₀` has a reachable landing point in `[n, n + 1]`. -/\ndef Target : Prop :=\n ∃ n₀ : ℤ, ∀ n : ℤ, n₀ ≤ n → HasLandingInUnitInterval n\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ed57433e-1f80-57ab-9e13-ad0e852da0f8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1c9f9244f0ac9a1334656446a5201cf522cc1bced1db3e2b5361d7c2fd3640b0", "task_path": "tasks/nmp3_ed57433e-1f80-57ab-9e13-ad0e852da0f8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ed57433e-1f80-57ab-9e13-ad0e852da0f8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_edaaebfc-cfc2-5ba5-a221-5b3351baa279", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a non‑isosceles acute triangle with circumcircle $(O)$ and orthocenter $H$, and assume $AB>AC$. Let $(I)$ be the circle with diameter $BH$. Let $F\\neq B$ be the second intersection of $(I)$ with $(O)$. Let $CH$ meet $AB$ at $D'$ and meet $(O)$ again at $D\\neq C$. Let $AH$ meet $BC$ at $E'$ and meet $(O)$ again at $E\\neq A$. Let $P\\neq B$ be the second intersection of $BE$ with $(I)$. Prove that the three lines $DE$, $HP$, and $FE'$ are concurrent.\nimport Mathlib\n\nsection NMP3BundledGeometry\n\n/-!\n# Elementary planar geometry predicates for the concurrence problem\n\nThis file fixes a concrete model of the Euclidean plane, namely `ℝ²`, and\nspells out the incidence, metric, orthogonality, and triangle hypotheses that\noccur in the problem. It contains no proof of the target theorem.\n-/\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the statement. -/\nabbrev PlanePoint : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- Three points are the vertices of a nondegenerate triangle. -/\ndef IsTriangle (A B C : PlanePoint) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set PlanePoint)\n\n/-- The angle with vertex `A`, formed by the rays `AB` and `AC`, is acute.\nThis is expressed by a positive scalar product of the two side vectors. -/\ndef AcuteAngleAt (A B C : PlanePoint) : Prop :=\n 0 < inner ℝ (B - A) (C - A)\n\n/-- All three angles of the triangle are acute. -/\ndef IsAcuteTriangle (A B C : PlanePoint) : Prop :=\n AcuteAngleAt A B C ∧ AcuteAngleAt B A C ∧ AcuteAngleAt C A B\n\n/-- No two side lengths of the triangle are equal. -/\ndef IsNonIsoscelesTriangle (A B C : PlanePoint) : Prop :=\n dist A B ≠ dist A C ∧\n dist A B ≠ dist B C ∧\n dist A C ≠ dist B C\n\n/-- The side length `AB` is strictly larger than the side length `AC`. -/\ndef SideABLongerThanAC (A B C : PlanePoint) : Prop :=\n dist A C < dist A B\n\n/-- `O` is the circumcenter of the nondegenerate triangle `ABC`: it is\nequidistant from the three vertices and the common distance is positive. -/\ndef IsCircumcenter (O A B C : PlanePoint) : Prop :=\n 0 < dist O A ∧\n dist O A = dist O B ∧\n dist O B = dist O C\n\n/-- `H` is the orthocenter of `ABC`: the three lines joining `H` to the\nvertices are the corresponding altitudes. -/\ndef IsOrthocenter (H A B C : PlanePoint) : Prop :=\n inner ℝ (A - H) (B - C) = 0 ∧\n inner ℝ (B - H) (A - C) = 0 ∧\n inner ℝ (C - H) (A - B) = 0\n\n/-- The circle with center `O` passing through `A`, used for the circumcircle. -/\ndef CircleThrough (O A : PlanePoint) : Set PlanePoint :=\n {X : PlanePoint | dist O X = dist O A}\n\n/-- Membership in the circle with center `O` passing through `A`. -/\ndef OnCircleWithCenter (O A X : PlanePoint) : Prop :=\n X ∈ CircleThrough O A\n\n/-- The circle with diameter `BH`. Its center is the midpoint of `BH` and its\nradius is half the distance `BH`. -/\ndef DiameterCircle (B H : PlanePoint) : Set PlanePoint :=\n {X : PlanePoint | dist X (midpoint ℝ B H) = dist B H / 2}\n\n/-- Membership in the circle with diameter `BH`. -/\ndef OnCircleWithDiameter (B H X : PlanePoint) : Prop :=\n X ∈ DiameterCircle B H\n\n/-- `X` lies on the line through `A` and `B`. -/\ndef OnLine (A B X : PlanePoint) : Prop :=\n X ∈ line[ℝ, A, B]\n\n/-- Three lines, respectively through `(A,B)`, `(C,D)`, and `(E,F)`, have a\ncommon point. -/\ndef LinesConcurrent\n (A B C D E F : PlanePoint) : Prop :=\n ∃ X : PlanePoint,\n OnLine A B X ∧ OnLine C D X ∧ OnLine E F X\n\nend Problem\n\nnamespace Problem\n\n/-- `F` is the unique point of the circumcircle `(O)` which lies on the circle\nwith diameter `BH` and is different from `B`. -/\ndef IsUniqueSecondIntersectionOfCircles\n (O A B H F : PlanePoint) : Prop :=\n OnCircleWithCenter O A F ∧\n OnCircleWithDiameter B H F ∧\n F ≠ B ∧\n ∀ X : PlanePoint,\n OnCircleWithCenter O A X →\n OnCircleWithDiameter B H X →\n X ≠ B →\n X = F\n\n/-- `X` is the unique intersection of the two lines `AB` and `CD`. -/\ndef IsUniqueLineIntersection\n (A B C D X : PlanePoint) : Prop :=\n OnLine A B X ∧\n OnLine C D X ∧\n ∀ Y : PlanePoint,\n OnLine A B Y →\n OnLine C D Y →\n Y = X\n\n/-- `X` is the unique point, other than `V`, in which the line `UV` meets the\ncircle with center `O` passing through `A`. In the problem this predicate is\nused when `V` is the already known first intersection. -/\ndef IsUniqueSecondLineCircleIntersection\n (O A U V X : PlanePoint) : Prop :=\n OnLine U V X ∧\n OnCircleWithCenter O A X ∧\n X ≠ V ∧\n ∀ Y : PlanePoint,\n OnLine U V Y →\n OnCircleWithCenter O A Y →\n Y ≠ V →\n Y = X\n\n/-- `X` is the unique point, other than `V`, in which the line `UV` meets the\ncircle with diameter `BH`. -/\ndef IsUniqueSecondLineDiameterCircleIntersection\n (B H U V X : PlanePoint) : Prop :=\n OnLine U V X ∧\n OnCircleWithDiameter B H X ∧\n X ≠ V ∧\n ∀ Y : PlanePoint,\n OnLine U V Y →\n OnCircleWithDiameter B H Y →\n Y ≠ V →\n Y = X\n\nend Problem\n\nend -- helper noncomputable section\nend NMP3BundledGeometry\n\n\n/-!\n# Formal statement of the planar concurrence problem\n\nThe target is the universal implication saying that for every non-isosceles\nacute triangle `ABC` with `AB > AC`, every correctly chosen circumcenter `O`\nand orthocenter `H`, and every choice of the points specified by the problem,\nthe lines `DE`, `HP`, and `FE'` are concurrent.\n\nThe construction predicates explicitly include the uniqueness of each point\ndefined as an intersection. No existence of these points is asserted by the\ndeclaration: the problem introduces them as constructed objects, and the Lean\nstatement treats any such objects as parameters satisfying their defining\nproperties.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The triangle itself is nondegenerate, non-isosceles, and acute. -/\ndef IsNonIsoscelesAcuteTriangle (A B C : PlanePoint) : Prop :=\n IsTriangle A B C ∧\n IsNonIsoscelesTriangle A B C ∧\n IsAcuteTriangle A B C\n\n/-- The hypotheses of the problem, in the order in which the problem presents\nthem: a non-isosceles acute triangle, its circumcircle with center `O`, its\northocenter `H`, and `AB > AC`. -/\ndef ProblemHypotheses (A B C O H : PlanePoint) : Prop :=\n IsNonIsoscelesAcuteTriangle A B C ∧\n IsCircumcenter O A B C ∧\n IsOrthocenter H A B C ∧\n SideABLongerThanAC A B C\n\n/-- The defining properties of all points introduced in the problem:\n`F` is the second intersection of the circumcircle and the circle with\ndiameter `BH`; `D'` is `CH ∩ AB`; `D` is the second point in which `CH`\nmeets the circumcircle; `E'` is `AH ∩ BC`; `E` is the second point in which\n`AH` meets the circumcircle; and `P` is the second intersection of `BE` with\nthe circle with diameter `BH`. -/\ndef IsConstructedConfiguration\n (A B C O H F D' D E' E P : PlanePoint) : Prop :=\n IsUniqueSecondIntersectionOfCircles O A B H F ∧\n IsUniqueLineIntersection C H A B D' ∧\n IsUniqueSecondLineCircleIntersection O A H C D ∧\n IsUniqueLineIntersection A H B C E' ∧\n IsUniqueSecondLineCircleIntersection O A H A E ∧\n IsUniqueSecondLineDiameterCircleIntersection B H E B P\n\n/-- The formal target statement: under all the stated hypotheses and for all\npoints satisfying the problem's construction definitions, the lines `DE`,\n`HP`, and `FE'` are concurrent. -/\ndef Target : Prop :=\n ∀ (A B C O H F D' D E' E P : PlanePoint),\n ProblemHypotheses A B C O H →\n IsConstructedConfiguration A B C O H F D' D E' E P →\n LinesConcurrent D E H P F E'\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "edaaebfc-cfc2-5ba5-a221-5b3351baa279", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "67fb681641ffbd37752292fd2cd0f7f7fc308b83d71541623846eceeaa63388b", "task_path": "tasks/nmp3_edaaebfc-cfc2-5ba5-a221-5b3351baa279", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "edaaebfc-cfc2-5ba5-a221-5b3351baa279", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_edf3f755-2f8c-5937-b188-5e83e6aeda0e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- (a^2+2)(b^2+2)(c^2+2)\\ge 9(ab+bc+ca).\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality problem\n\nThe source asks to prove, for all positive real numbers `a`, `b`, and `c`, that\n`(a^2 + 2) * (b^2 + 2) * (c^2 + 2) ≥ 9 * (a * b + b * c + c * a)`.\n\nThe assertion is recorded as a proposition; no proof is supplied here.\n-/\n\nnamespace Problem\n\n/-- For every triple of positive real numbers `a`, `b`, and `c`,\n`(a^2 + 2)(b^2 + 2)(c^2 + 2) ≥ 9(ab + bc + ca)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n (a ^ 2 + 2) * (b ^ 2 + 2) * (c ^ 2 + 2) ≥\n 9 * (a * b + b * c + c * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "edf3f755-2f8c-5937-b188-5e83e6aeda0e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e3a975d542dc49bf3b379f8c5224e8d8298d6f7e7f6d5f36fdc257292d97be08", "task_path": "tasks/nmp3_edf3f755-2f8c-5937-b188-5e83e6aeda0e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "edf3f755-2f8c-5937-b188-5e83e6aeda0e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ee074cda-7006-552b-809f-6b2e94e5c884", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- a, b, c are positive real numbers. Prove that \n-- \\[\n-- \\frac{a+b+c}{ab+ac+bc}\\;\\ge\\;\\frac{a}{a^{2}+2bc}+\\frac{b}{b^{2}+2ac}+\\frac{c}{c^{2}+2ab}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, `c`, that\n\n`(a + b + c) / (a*b + a*c + b*c) ≥\n a/(a^2 + 2*b*c) + b/(b^2 + 2*a*c) + c/(c^2 + 2*a*b)`.\n\nThe declaration `Problem.Target` below records exactly this universal proposition.\nIt is a statement formalization only; no proof is supplied here.\n-/\n\nnamespace Problem\n\n/-- The three source variables are positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a + b + c) / (a * b + a * c + b * c)\n\n/-- One summand on the right-hand side, with `a` as the numerator variable\nand `b`, `c` as the two variables in the `2bc` term. -/\nnoncomputable def fractionTerm (a b c : ℝ) : ℝ :=\n a / (a ^ 2 + 2 * b * c)\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n fractionTerm a b c + fractionTerm b a c + fractionTerm c a b\n\n/-- The complete proposition asserted by the source problem: for every triple of\npositive real numbers, the left-hand side is at least the right-hand side, where\nall divisions are real divisions and the inequality is non-strict. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee074cda-7006-552b-809f-6b2e94e5c884", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7df8fc887ef9bef743a6f51d5bd1df25a46a2e38f49fa3ed7df835a257843027", "task_path": "tasks/nmp3_ee074cda-7006-552b-809f-6b2e94e5c884", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee074cda-7006-552b-809f-6b2e94e5c884", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ee21c0be-92e4-5462-a58b-312fbff3ec1e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $f: M_n(\\mathbb{F}) \\to M_m(\\mathbb{F})$ is a surjective function satisfying $f(X)f(Y)=f(XY)$ for all $X,Y\\in M_n(\\mathbb{F})$. Prove that $m\\le n$.\nimport Mathlib.Data.Matrix.Basic\nimport Mathlib.Algebra.Field.Defs\n\n/-!\n# Formalization of a surjective multiplicative map between full matrix rings\n\nThe source problem asks to prove that if there is a surjective multiplicative\nfunction from the full matrix ring `M_n(F)` to the full matrix ring `M_m(F)`,\nthen `m ≤ n`.\n-/\n\nuniverse u\n\nnamespace Problem\n\n/-- The full ring of `n × n` matrices over a field `F`, written `M_n(F)` in the\nsource problem. -/\nabbrev MatrixRing (F : Type u) [Field F] (n : ℕ) : Type u :=\n Matrix (Fin n) (Fin n) F\n\n/-- A function between full matrix rings preserves multiplication when\n`f X * f Y = f (X * Y)` for every pair of matrices `X` and `Y`. -/\ndef PreservesMultiplication {F : Type u} [Field F] {n m : ℕ}\n (f : MatrixRing F n → MatrixRing F m) : Prop :=\n ∀ (X Y : MatrixRing F n), f X * f Y = f (X * Y)\n\n/-- The assertion of the problem: for every field `F`, natural numbers `n` and\n`m`, and function `f : M_n(F) → M_m(F)`, if `f` is surjective and preserves\nmatrix multiplication, then `m ≤ n`. -/\ndef Target : Prop :=\n ∀ (F : Type u) [Field F] (n m : ℕ)\n (f : MatrixRing F n → MatrixRing F m),\n Function.Surjective f →\n PreservesMultiplication f →\n m ≤ n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee21c0be-92e4-5462-a58b-312fbff3ec1e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e9d4cb8f626e5878ebc8cb4ca1a6aff49d24abad1f68f79eceb1424dd7f1299c", "task_path": "tasks/nmp3_ee21c0be-92e4-5462-a58b-312fbff3ec1e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee21c0be-92e4-5462-a58b-312fbff3ec1e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ee29ead4-328b-5467-97ee-16e63d752bb2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- If \\(a,b,c>0\\), prove that \n-- \\[\n-- \\sqrt{\\frac{(a^{2}+b^{2})(a^{2}+c^{2})}{b}}+\n-- \\sqrt{\\frac{(b^{2}+c^{2})(b^{2}+a^{2})}{c}}+\n-- \\sqrt{\\frac{(c^{2}+a^{2})(c^{2}+b^{2})}{a}}\n-- \\;\\ge\\;\n-- \\bigl(a^{2}+b^{2}+c^{2}+ab+bc+ca\\bigr)\\sqrt{\\frac{3}{a+b+c}}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-variable square-root inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and\n`c`, the inequality\n...\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (((a ^ 2 + b ^ 2) * (a ^ 2 + c ^ 2)) / b)\n + Real.sqrt (((b ^ 2 + c ^ 2) * (b ^ 2 + a ^ 2)) / c)\n + Real.sqrt (((c ^ 2 + a ^ 2) * (c ^ 2 + b ^ 2)) / a)\n\n/-- The right-hand side of the inequality in the source problem. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2 + c ^ 2 + a * b + b * c + c * a)\n * Real.sqrt (3 / (a + b + c))\n\n/-- The complete proposition asserted by the source problem: for all positive\nreal `a`, `b`, and `c`, the left-hand side is at least the right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee29ead4-328b-5467-97ee-16e63d752bb2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "255aa5a3ef56f37a9908e0304e051629badee1efa794858b8a86d1b8dce0b82a", "task_path": "tasks/nmp3_ee29ead4-328b-5467-97ee-16e63d752bb2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee29ead4-328b-5467-97ee-16e63d752bb2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ee2b5b4f-5128-5b6c-9ecf-82d3da09e9ff", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For $x,y,z,p,q>0$, prove that \n-- \\[\n-- (xy+yz+zx)\\Bigg[\\frac{x}{\\,y\\big(p\\sqrt[3]{x^{2}y}+qz\\big)^{2}}+\\frac{y}{\\,z\\big(p\\sqrt[3]{y^{2}z}+qx\\big)^{2}}+\\frac{z}{\\,x\\big(p\\sqrt[3]{z^{2}x}+qy\\big)^{2}}\\Bigg]\\ge\\frac{9}{(p+q)^{2}}\\,.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formalization of the stated cyclic inequality\n\nThe source problem asks, for five positive real parameters, to prove a\nthree-term cyclic inequality involving cube roots. This file records the\nmathematical assertion as a proposition-valued definition; it does not prove\nthe assertion.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The principal real cube root, represented using the real power `a ^ (1/3)`.\nThe inequality is only stated for positive radicands, where this agrees with\nthe usual positive real cube root. -/\ndef cubeRoot (a : ℝ) : ℝ :=\n Real.rpow a ((1 : ℝ) / 3)\n\n/-- The common factor `xy + yz + zx` on the left-hand side. -/\ndef cyclicFactor (x y z : ℝ) : ℝ :=\n x * y + y * z + z * x\n\n/-- The bracketed three-term cyclically symmetric sum. -/\ndef cyclicBracket (x y z p q : ℝ) : ℝ :=\n x / (y * (p * cubeRoot (x ^ 2 * y) + q * z) ^ 2) +\n y / (z * (p * cubeRoot (y ^ 2 * z) + q * x) ^ 2) +\n z / (x * (p * cubeRoot (z ^ 2 * x) + q * y) ^ 2)\n\n/-- The complete left-hand side of the inequality. -/\ndef lhs (x y z p q : ℝ) : ℝ :=\n cyclicFactor x y z * cyclicBracket x y z p q\n\n/-- The right-hand side of the inequality. -/\ndef rhs (p q : ℝ) : ℝ :=\n (9 : ℝ) / (p + q) ^ 2\n\n/-- The assertion in the source problem: for all positive real `x`, `y`, `z`,\n`p`, and `q`, the stated left-hand side is at least `9 / (p + q)^2`. -/\ndef Target : Prop :=\n ∀ x y z p q : ℝ,\n 0 < x → 0 < y → 0 < z → 0 < p → 0 < q →\n lhs x y z p q ≥ rhs p q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee2b5b4f-5128-5b6c-9ecf-82d3da09e9ff", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0a0a0225273d827bb41bd6ecd148393000005571807063254c67055e9298c772", "task_path": "tasks/nmp3_ee2b5b4f-5128-5b6c-9ecf-82d3da09e9ff", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee2b5b4f-5128-5b6c-9ecf-82d3da09e9ff", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ee31368f-0d78-530f-980e-500ab35256bf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be a triangle with $AB\\neq AC$. Let $M$ be the midpoint of $BC$, and let $N$ be the midpoint of the arc $BC$ of the circumcircle of $ABC$ that contains $A$. Let $H$ be the foot of the perpendicular from $N$ to $AC$. Let $K\\neq C$ be the second intersection of the circumcircle of $\\triangle AMC$ with the line $CN$. Prove that $\\displaystyle\\angle AKH=\\angle CAM\\,. $\n/-\nFormalization of the statement in `problem.md`.\n\nThe ambient object is the real Euclidean plane. The target is a closed\n`Prop`; no proof of it is supplied. All constructions named in the source\n(midpoint, selected arc midpoint, perpendicular foot, and second\ncircle/line intersection) are represented by explicit predicate\ndefinitions and then introduced in the same order as in the source.\n-/\n\nmodule\n\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\n@[expose] public section\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The real Euclidean plane, represented by its standard two-dimensional\ninner-product space. -/\nabbrev Plane := EuclideanSpace ℝ (Fin 2)\n\n/-- The oriented area/determinant of the ordered pair of vectors `u`, `v`\nin the standard coordinates of the plane. -/\ndef cross (u v : Plane) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- The real inner product of two vectors of the plane. -/\ndef dot (u v : Plane) : ℝ := inner ℝ u v\n\n/-- The oriented area of the parallelogram spanned by `B - A` and `C - A`.\nIt is nonzero exactly when `A`, `B`, and `C` are noncollinear. -/\ndef orientedArea (A B C : Plane) : ℝ :=\n cross (B - A) (C - A)\n\n/-- `A`, `B`, and `C` are the vertices of a nondegenerate triangle. In the\nplane, this is equivalent to the three points being noncollinear. -/\ndef IsNondegenerateTriangle (A B C : Plane) : Prop :=\n orientedArea A B C ≠ 0\n\n/-- `X` lies on the full affine line through `A` and `B`. -/\ndef OnLine (A B X : Plane) : Prop :=\n ∃ t : ℝ, X = A + t • (B - A)\n\n/-- `X` lies on a positive-radius circle that also passes through `A`, `B`,\nand `C`. For a noncollinear triple this is the usual circumcircle\nmembership condition. -/\ndef OnCircleThrough (A B C X : Plane) : Prop :=\n ∃ (O : Plane) (r : ℝ),\n 0 < r ∧ dist O A = r ∧ dist O B = r ∧ dist O C = r ∧ dist O X = r\n\n/-- `X` and `Y` are strictly in the same open half-plane determined by the\nline through `A` and `B`. -/\ndef SameSideOfLine (A B X Y : Plane) : Prop :=\n 0 < orientedArea A B X * orientedArea A B Y\n\n/-- `M` is the midpoint of the segment with endpoints `A` and `B`. -/\ndef IsMidpointOf (M A B : Plane) : Prop :=\n M = midpoint ℝ A B\n\n/-- `N` is the midpoint of the arc `BC` of the circumcircle of `ABC` that\ncontains `A`. Equivalently, `N` is on that circumcircle, is equidistant from\n`B` and `C`, and lies in the same open half-plane of the chord line `BC` as\n`A`. The last condition chooses the arc containing `A` rather than the other\narc. -/\ndef IsArcMidpointContaining (A B C N : Plane) : Prop :=\n OnCircleThrough A B C N ∧\n dist N B = dist N C ∧\n SameSideOfLine B C A N\n\n/-- The vector `u` is perpendicular to the vector `v`. -/\ndef IsPerpendicular (u v : Plane) : Prop :=\n dot u v = 0\n\n/-- `H` is the foot of the perpendicular from `N` to the line `AC`: it lies\non the full line `AC`, and the segment `NH` is perpendicular to `AC`. -/\ndef IsFootOfPerpendicular (H N A C : Plane) : Prop :=\n OnLine A C H ∧ IsPerpendicular (N - H) (C - A)\n\n/-- `K` is the second intersection, different from `C`, of the circumcircle\nof triangle `AMC` with the full line `CN`. The final conjunct records the\nuniqueness of this second intersection: `C` and `K` are exactly the common\npoints of that circle and line. -/\ndef IsSecondIntersectionOfCircleLine (K A M C N : Plane) : Prop :=\n K ≠ C ∧\n OnCircleThrough A M C K ∧\n OnLine C N K ∧\n ∀ X : Plane, OnCircleThrough A M C X → OnLine C N X → X = C ∨ X = K\n\n/-- The complete assertion of the problem: for every nondegenerate triangle\n`ABC` with `AB ≠ AC`, and for the midpoint `M` of `BC`, the midpoint `N` of\nthe arc `BC` containing `A`, the perpendicular foot `H` from `N` to `AC`,\nand the second intersection `K ≠ C` of the circumcircle of `AMC` with line\n`CN`, the unoriented angles `AKH` and `CAM` are equal. -/\ndef Target : Prop :=\n ∀ (A B C : Plane),\n IsNondegenerateTriangle A B C →\n dist A B ≠ dist A C →\n ∀ (M : Plane),\n IsMidpointOf M B C →\n ∀ (N : Plane),\n IsArcMidpointContaining A B C N →\n ∀ (H : Plane),\n IsFootOfPerpendicular H N A C →\n ∀ (K : Plane),\n IsSecondIntersectionOfCircleLine K A M C N →\n EuclideanGeometry.angle A K H = EuclideanGeometry.angle C A M\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee31368f-0d78-530f-980e-500ab35256bf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b7fed545a030769fe861277bb9b2d34f343a5a8041ae6ff8c530e12e20aa7b5c", "task_path": "tasks/nmp3_ee31368f-0d78-530f-980e-500ab35256bf", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee31368f-0d78-530f-980e-500ab35256bf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ee3eab88-f51c-5e4f-94f7-ef85097dff39", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers such that $ab+bc+ca=1$. Prove that \n-- \\[\n-- \\frac{1+a^{2}b^{2}}{(a+b)^{2}}+\\frac{1+b^{2}c^{2}}{(b+c)^{2}}+\\frac{1+c^{2}a^{2}}{(c+a)^{2}}\\ge\\frac52\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility conditions from the problem: `a`, `b`, and `c` are positive\nreal numbers satisfying `ab + bc + ca = 1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = 1\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n (1 + a ^ 2 * b ^ 2) / (a + b) ^ 2 +\n (1 + b ^ 2 * c ^ 2) / (b + c) ^ 2 +\n (1 + c ^ 2 * a ^ 2) / (c + a) ^ 2\n\n/-- The assertion to be proved: for all positive real `a`, `b`, `c` satisfying\n`ab + bc + ca = 1`, the displayed cyclic sum is at least `5/2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ (5 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee3eab88-f51c-5e4f-94f7-ef85097dff39", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "766aca7c15957dd199015bf6ffd4ad1642640677c80a169f7dfe288b6b475f54", "task_path": "tasks/nmp3_ee3eab88-f51c-5e4f-94f7-ef85097dff39", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee3eab88-f51c-5e4f-94f7-ef85097dff39", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ee51dd6e-358e-5ee6-aec6-c84fdb69a8dc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\ge 0$. Prove that \n-- \\[\n-- \\sqrt[3]{(a+b+c)(a+c+d)}\\;\\ge\\;\\sqrt[3]{ab}+\\sqrt[3]{cd}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The real cube root, defined as the inverse of `x ↦ x ^ 3` on all of `ℝ`.\nFor `x ≥ 0` this is the principal nonnegative cube root; for `x < 0` the\nnegative branch is used. The exponent is the real number `1 / 3`, using real\ndivision and `Real.rpow`. -/\ndef CubeRoot (x : ℝ) : ℝ :=\n if 0 ≤ x then Real.rpow x (1 / 3 : ℝ)\n else -Real.rpow (-x) (1 / 3 : ℝ)\n\n/-- The inequality from the problem, with all four nonnegativity hypotheses\nretained explicitly. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c → 0 ≤ d →\n CubeRoot ((a + b + c) * (a + c + d)) ≥\n CubeRoot (a * b) + CubeRoot (c * d)\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee51dd6e-358e-5ee6-aec6-c84fdb69a8dc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6d859c8bf41b32ca851b0de49b4a2b0bb2c0d71687fb7cecbf9bdfde065e6f66", "task_path": "tasks/nmp3_ee51dd6e-358e-5ee6-aec6-c84fdb69a8dc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee51dd6e-358e-5ee6-aec6-c84fdb69a8dc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ee54c2cd-1b76-569a-8810-8385a9190caf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- a,b,c\\ge 0,\\qquad ab+bc+ca=3.\\ \\text{Prove that}\\ \n-- \\displaystyle\\sqrt{a^{2}-2bc+9}+\\sqrt{b^{2}-2ca+9}+\\sqrt{c^{2}-2ab+9}\\ge \n-- \\sqrt{a^{2}+b^{2}+c^{2}+69}\\,.\nimport Mathlib\n\nnamespace Problem\n\n/-- The problem's inequality: for all nonnegative real numbers `a`, `b`, and `c`\nsatisfying `ab + bc + ca = 3`, the stated sum of three square roots is at least\nthe stated fourth square root. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a →\n 0 ≤ b →\n 0 ≤ c →\n a * b + b * c + c * a = 3 →\n Real.sqrt (a ^ 2 - 2 * b * c + 9) +\n Real.sqrt (b ^ 2 - 2 * c * a + 9) +\n Real.sqrt (c ^ 2 - 2 * a * b + 9) ≥\n Real.sqrt (a ^ 2 + b ^ 2 + c ^ 2 + 69)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee54c2cd-1b76-569a-8810-8385a9190caf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "559df5be3070593b6d936cb5a4d5f74715872e70ab9afbdb50001c06bc3d29ee", "task_path": "tasks/nmp3_ee54c2cd-1b76-569a-8810-8385a9190caf", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee54c2cd-1b76-569a-8810-8385a9190caf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ee721e57-a886-573c-918b-03beaca4188a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) satisfy \\(a+b+c=ab+bc+ca\\). Prove that \n-- \\[\n-- \\frac{ab+bc+ca}{3}+2\\;\\ge\\;\\sqrt{ab}+\\sqrt{bc}+\\sqrt{ca}.\n-- \\] \n-- (The proof must not use the \\(uvw\\) method.)\nimport Mathlib\n\nnamespace Problem\n\n/-- The strict positivity condition on the three real numbers `a`, `b`, and `c`. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The constraint `a + b + c = ab + bc + ca`. -/\ndef Constraint (a b c : ℝ) : Prop :=\n a + b + c = a * b + b * c + c * a\n\n/-- The complete hypothesis of the problem. -/\ndef Hypothesis (a b c : ℝ) : Prop :=\n PositiveTriple a b c ∧ Constraint a b c\n\n/-- The asserted non-strict real inequality, with the principal real square root. -/\ndef Claim (a b c : ℝ) : Prop :=\n (a * b + b * c + c * a) / 3 + 2 ≥\n Real.sqrt (a * b) + Real.sqrt (b * c) + Real.sqrt (c * a)\n\n/-- The universal statement of the problem: for all positive real `a`, `b`, and `c`\nsatisfying the given equality, the asserted square-root inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Hypothesis a b c → Claim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee721e57-a886-573c-918b-03beaca4188a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "29a866bb63477fa16baec9d51cc03e2466c3339a8246349138323e559e219203", "task_path": "tasks/nmp3_ee721e57-a886-573c-918b-03beaca4188a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee721e57-a886-573c-918b-03beaca4188a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ee752652-f3d8-5fd3-9285-77a65b117ded", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{(a+1)^2(b+c)}+\\frac{1}{(b+1)^2(c+a)}+\\frac{1}{(c+1)^2(a+b)}\\le \\frac{3}{8}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement: symmetric inequality under the constraint `abc = 1`\n\nThe original problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose product is one, the inequality\n`1 / ((a + 1)^2 * (b + c)) + ... ≤ 3 / 8`.\nThis file records that proposition as a `Prop`-valued definition. It does not\nsupply a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n 1 / ((a + 1) ^ 2 * (b + c)) +\n 1 / ((b + 1) ^ 2 * (c + a)) +\n 1 / ((c + 1) ^ 2 * (a + b))\n\n/-- The assertion in the problem: for all positive real `a`, `b`, `c`\nwith `a * b * c = 1`, the left-hand side is at most `3 / 8`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n lhs a b c ≤ (3 : ℝ) / 8\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee752652-f3d8-5fd3-9285-77a65b117ded", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e7192a952a398402e5c9deea8b683fcf325bb96b8b3db5ce5a0e8b9f41da5e33", "task_path": "tasks/nmp3_ee752652-f3d8-5fd3-9285-77a65b117ded", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee752652-f3d8-5fd3-9285-77a65b117ded", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ee88f9f7-a329-508c-bfd1-87e2907d4317", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $a,b,c\\ge 0$ with $ab+bc+ca=6$, prove that \n-- \\[\n-- \\sqrt{\\frac{a}{3a^{2}+bc}}+\\sqrt{\\frac{b}{3b^{2}+ca}}+\\sqrt{\\frac{c}{3c^{2}+ab}}\n-- \\;\\ge\\;\n-- \\frac{4}{\\sqrt{a^{3}+b^{3}+c^{3}+abc}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nGiven nonnegative real numbers `a`, `b`, and `c` satisfying\n`ab + bc + ca = 6`, the problem asks for the inequality\n\n`sqrt (a / (3a^2 + bc)) + sqrt (b / (3b^2 + ca))\n + sqrt (c / (3c^2 + ab))\n ≥ 4 / sqrt (a^3 + b^3 + c^3 + abc)`.\n\nThe declaration `Problem.Target` below states exactly this assertion. It is\nonly a proposition; no proof is supplied here.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem statement. -/\ndef lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a / (3 * a ^ 2 + b * c)) +\n Real.sqrt (b / (3 * b ^ 2 + c * a)) +\n Real.sqrt (c / (3 * c ^ 2 + a * b))\n\n/-- The right-hand side of the inequality in the problem statement. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 4 / Real.sqrt (a ^ 3 + b ^ 3 + c ^ 3 + a * b * c)\n\n/-- The hypotheses imposed on `a`, `b`, and `c` in the problem statement. -/\ndef Hypotheses (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + b * c + c * a = 6\n\n/-- The complete mathematical assertion of the problem.\n\nFor every triple of real numbers `a`, `b`, `c` that is nonnegative and satisfies\n`ab + bc + ca = 6`, the stated square-root expression is at least\n`4 / sqrt (a^3 + b^3 + c^3 + abc)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Hypotheses a b c → rhs a b c ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee88f9f7-a329-508c-bfd1-87e2907d4317", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "924d7aba22f297e69c078c10493480986e03d7b50ccb51f62480101945a74aa9", "task_path": "tasks/nmp3_ee88f9f7-a329-508c-bfd1-87e2907d4317", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ee88f9f7-a329-508c-bfd1-87e2907d4317", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eea20263-234e-5684-82f7-ce9324b42bc8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be a prime such that $\\frac{p-1}{2}$ is also prime. Let $a,b,c\\in\\mathbb Z$ satisfy $p\\nmid a$, $p\\nmid b$, $p\\nmid c$. Prove that the number of positive integers $n$ with $n Admissible p a b c n)\n\n/-- The statement of the problem: for every prime `p` for which `(p - 1) / 2`\nis prime, and for all integers `a`, `b`, and `c` not divisible by `p`, the\nnumber of positive integers `n < p` satisfying `p ∣ a ^ n + b ^ n + c ^ n`\nis at most `1 + sqrt(2p)`. -/\ndef Target : Prop :=\n ∀ (p : ℕ) (a b c : ℤ),\n p.Prime →\n Nat.Prime ((p - 1) / 2) →\n ¬ (p : ℤ) ∣ a →\n ¬ (p : ℤ) ∣ b →\n ¬ (p : ℤ) ∣ c →\n ((solutionSet p a b c).card : ℝ) ≤ 1 + Real.sqrt (2 * (p : ℝ))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eea20263-234e-5684-82f7-ce9324b42bc8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "90f7de552911614a46d6a4466f1339ac6a514d135fdefd72ca8b5030dcc7bf5b", "task_path": "tasks/nmp3_eea20263-234e-5684-82f7-ce9324b42bc8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eea20263-234e-5684-82f7-ce9324b42bc8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eeae894a-60d4-5afe-8e06-f740284e7167", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p$ be an odd prime and let $a_1,a_2,\\dots ,a_p\\in\\mathbb Z$. Prove that the following two statements are equivalent.\n-- \n-- 1. There exists a polynomial $P(x)$ with $\\deg P\\le\\frac{p-1}{2}$ such that \n-- $$P(i)\\equiv a_i\\pmod p\\qquad\\text{for all }i=1,2,\\dots ,p.$$\n-- \n-- 2. For every integer $d$ with $1\\le d\\le\\frac{p-1}{2}$, \n-- $$\\sum_{i=1}^{p}\\bigl(a_{i+d}-a_i\\bigr)^2\\equiv0\\pmod p,$$ \n-- where the indices are taken modulo $p$ (i.e. $a_{i+p}=a_i$).\nimport Mathlib\n\n/-!\n# Formal statement of the polynomial congruence problem\n\nThe problem asks, for every odd prime `p` and every integer vector\n`a : Fin p → ℤ`, whether the following two conditions are equivalent:\n\n1. The vector is represented modulo `p` on the indices `1, ..., p` by an\n integer polynomial of degree at most `(p - 1) / 2`.\n2. All cyclic first differences whose step is in `1, ..., (p - 1) / 2`\n have sum of squares congruent to zero modulo `p`.\n\nThe declarations below are statements only; no proof of the equivalence is\nprovided.\n-/\n\nnamespace Problem\n\nopen scoped BigOperators\n\n/-- The cyclic index `i + d` in `Fin p`, i.e. indices are taken modulo `p`.\nThe positivity witness `hp` is needed because `Fin p` is empty when `p = 0`.\nFor the target this witness is supplied by primality of `p`. -/\ndef cyclicAdd (p : ℕ) (hp : 0 < p) (i : Fin p) (d : ℕ) : Fin p :=\n ⟨(i.val + d) % p, Nat.mod_lt _ hp⟩\n\n/-- Condition 1: there is an integer polynomial `P` of degree at most\n`(p - 1) / 2` whose values at the representatives `1, ..., p` are congruent\nto `a₁, ..., aₚ` modulo `p`. -/\ndef ExistsPolynomialInterpolant (p : ℕ) (a : Fin p → ℤ) : Prop :=\n ∃ P : Polynomial ℤ,\n P.natDegree ≤ (p - 1) / 2 ∧\n ∀ i : Fin p,\n ((P.eval (i.val + 1) : ℤ) : ZMod p) = (a i : ZMod p)\n\n/-- Condition 2: for every positive integer step `d ≤ (p - 1) / 2`, the sum\nof the squares of the cyclic differences `a_{i+d} - a_i`, over `i = 1, ..., p`,\nis congruent to zero modulo `p`. -/\ndef DifferenceCongruenceCondition (p : ℕ) (hp : 0 < p) (a : Fin p → ℤ) : Prop :=\n ∀ d : ℕ,\n 1 ≤ d →\n d ≤ (p - 1) / 2 →\n (∑ i : Fin p,\n (((a (cyclicAdd p hp i d) : ZMod p) - (a i : ZMod p)) ^ 2)) = 0\n\n/-- The complete mathematical assertion of the problem: for every odd prime\n`p` and every integer vector `a` indexed by `1, ..., p`, conditions 1 and 2\nare equivalent. -/\ndef Target : Prop :=\n ∀ (p : ℕ) (_hpodd : Odd p) (hpprime : p.Prime) (a : Fin p → ℤ),\n ExistsPolynomialInterpolant p a ↔\n DifferenceCongruenceCondition p hpprime.pos a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eeae894a-60d4-5afe-8e06-f740284e7167", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bd5f24724c8f70ce7c6825622bfa2895a7f9f15c2df245c5f8f6f7fdd7b1bac0", "task_path": "tasks/nmp3_eeae894a-60d4-5afe-8e06-f740284e7167", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eeae894a-60d4-5afe-8e06-f740284e7167", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eeb3c1a9-f7b1-5e0a-9650-04a1f02fb50d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\bigl(a^{8}-a^{2}+3\\bigr)\\bigl(b^{8}-b^{2}+3\\bigr)\\bigl(c^{8}-c^{2}+3\\bigr)\\ge (ab+bc+ca)^{3}.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The value of the factor `x ^ 8 - x ^ 2 + 3` appearing in the inequality. -/\ndef factor (x : ℝ) : ℝ := x ^ 8 - x ^ 2 + 3\n\n/--\nFor all positive real numbers `a`, `b`, and `c`,\n`(a ^ 8 - a ^ 2 + 3) * (b ^ 8 - b ^ 2 + 3) * (c ^ 8 - c ^ 2 + 3)`\nis at least `(a * b + b * c + c * a) ^ 3`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n factor a * factor b * factor c ≥ (a * b + b * c + c * a) ^ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eeb3c1a9-f7b1-5e0a-9650-04a1f02fb50d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "59bbe7fc89bb87651db8e971226d4a43aa70a5363b0bc929bb731a18162dfff8", "task_path": "tasks/nmp3_eeb3c1a9-f7b1-5e0a-9650-04a1f02fb50d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "eeb3c1a9-f7b1-5e0a-9650-04a1f02fb50d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_eec9c761-bf64-5472-bd47-49edbce36408", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle $ABC$ (so $a,b,c>0$ and $a\n ⟨d.1, Nat.digits_lt_base (by norm_num) d.2⟩\n\n/-- A canonical decimal digit list is never empty. -/\nlemma decimalDigits_ne_nil (x : ℕ) : decimalDigits x ≠ [] := by\n unfold decimalDigits\n split_ifs with hx\n · simp\n · rw [ne_eq, List.map_eq_nil_iff, List.reverse_eq_nil_iff]\n simp [Nat.digits_ne_nil_iff_ne_zero, hx]\n\n/-- The digits obtained by concatenating the canonical decimal representations of\n`x 0, x 1, ..., x (m - 1)`, in that order. -/\ndef concatenatedPrefix (x : ℕ → ℕ) (m : ℕ) : List (Fin 10) :=\n (List.range m).flatMap fun i => decimalDigits (x i)\n\n/-- The first `m` terms of a natural sequence contribute at least `m` decimal digits,\nbecause every canonical decimal representation is nonempty. -/\nlemma concatenatedPrefix_length_ge (x : ℕ → ℕ) :\n ∀ m : ℕ, m ≤ (concatenatedPrefix x m).length := by\n intro m\n induction m with\n | zero => simp [concatenatedPrefix]\n | succ m ih =>\n rw [concatenatedPrefix, List.range_succ, List.flatMap_append, List.length_append,\n List.flatMap_singleton]\n change m + 1 ≤ (concatenatedPrefix x m).length + (decimalDigits (x m)).length\n have hd : 1 ≤ (decimalDigits (x m)).length :=\n Nat.succ_le_of_lt (List.length_pos_iff.mpr (decimalDigits_ne_nil (x m)))\n exact Nat.add_le_add ih hd\n\n/-- The infinite digit string obtained by concatenating the decimal representations of\n`x 0, x 1, ...`. Its value at `t` is the `(t+1)`-st digit of that concatenation. It is\nenough to inspect the first `t + 1` terms, since they contain at least `t + 1` digits. -/\ndef concatDigitStream (x : ℕ → ℕ) (t : ℕ) : Fin 10 :=\n (concatenatedPrefix x (t + 1)).get\n ⟨t, Nat.lt_of_succ_le (concatenatedPrefix_length_ge x (t + 1))⟩\n\n/-- The `n` digits of the `k`-th block, in order, as zero-indexed positions in the full\nconcatenated digit string. Here `k` is mathematically positive: the first block is `k = 1`. -/\ndef blockDigits (s : ℕ → Fin 10) (n k : ℕ) : List (Fin 10) :=\n (List.range n).map fun i => s (n * (k - 1) + i)\n\n/-- The natural number represented by the `k`-th block of `n` digits. A leading zero in a\nblock is allowed when interpreting the block as a number (for example, the two-digit block\n`05` represents `5`). -/\ndef blockValue (s : ℕ → Fin 10) (n k : ℕ) : ℕ :=\n Nat.ofDigits 10 ((blockDigits s n k).map fun d => (d : ℕ)).reverse\n\n/-- The real polynomial `f` is nonconstant. For real polynomials this is equivalent to\nhaving positive natural degree. -/\ndef IsNonconstantRealPolynomial (f : Polynomial ℝ) : Prop :=\n 0 < f.natDegree\n\n/-- The sequence `a : ℕ → ℝ` is strictly increasing, unbounded above, and has all adjacent\ngaps strictly smaller than `2020`. `a i` represents the original one-indexed term `a_{i+1}`. -/\ndef IsAdmissibleSequence (a : ℕ → ℝ) : Prop :=\n StrictMono a ∧\n (∀ M : ℝ, ∃ i : ℕ, M < a i) ∧\n (∀ i : ℕ, a (i + 1) - a i < 2020)\n\n/-- The `i`-th value `x_i = ⌊|f(a_i)|⌋`, represented as a natural number.\nAgain `i : ℕ` is zero-indexed. -/\nnoncomputable def xValue (f : Polynomial ℝ) (a : ℕ → ℝ) (i : ℕ) : ℕ :=\n Nat.floor |f.eval (a i)|\n\n/-- The infinite digit string obtained from the values `x_i = ⌊|f(a_i)|⌋`. -/\nnoncomputable def polynomialDigitString (f : Polynomial ℝ) (a : ℕ → ℝ) : ℕ → Fin 10 :=\n concatDigitStream fun i => xValue f a i\n\n/-- `N` is an `n`-digit integer in the sense of the problem:\n`10^(n-1) ≤ N ≤ 10^n - 1`. -/\ndef IsNDigitInteger (n N : ℕ) : Prop :=\n 10 ^ (n - 1) ≤ N ∧ N ≤ 10 ^ n - 1\n\n/-- The set of numbers represented by the blocks of length `n` in the digit string `s`.\nOnly positive block indices are included, matching the original indexing. -/\ndef BlockSet (s : ℕ → Fin 10) (n : ℕ) : Set ℕ :=\n {N : ℕ | ∃ k : ℕ, 0 < k ∧ blockValue s n k = N}\n\n/-- Every `n`-digit integer occurs as the value of some length-`n` block of `s`. -/\ndef ContainsEveryNDigitBlock (s : ℕ → Fin 10) (n : ℕ) : Prop :=\n ∀ N : ℕ, IsNDigitInteger n N → N ∈ BlockSet s n\n\n/-- The full assertion: for every nonconstant real polynomial `f`, every strictly increasing\nunbounded real sequence `a` with adjacent gaps below `2020`, and every positive `n`, the\nlength-`n` decimal blocks in the concatenation of `⌊|f(a_i)|⌋` contain every `n`-digit\ninteger. -/\ndef Target : Prop :=\n ∀ (f : Polynomial ℝ), IsNonconstantRealPolynomial f →\n ∀ (a : ℕ → ℝ), IsAdmissibleSequence a →\n ∀ (n : ℕ), 0 < n →\n ContainsEveryNDigitBlock (polynomialDigitString f a) n\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ef489d9f-3e3f-552d-9c53-7502715ec95c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "69d90f205fff93656f33ee87e6ca871799afd1d05e8eeb58d7a5e53f288ee3e1", "task_path": "tasks/nmp3_ef489d9f-3e3f-552d-9c53-7502715ec95c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ef489d9f-3e3f-552d-9c53-7502715ec95c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ef6ba3c9-2f31-5375-8ef0-36b9f32e08b8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c\\) be non‑negative real numbers such that \\((a+b)(b+c)(c+a)>0\\). Prove that \n-- \\[\n-- \\frac{ab}{(a+b)^2}+ \\frac{bc}{(b+c)^2}+ \\frac{ca}{(c+a)^2}+ \\frac54 \\;\\ge\\; \\frac{6(ab+bc+ca)}{(a+b+c)^2}\\,. \n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove an inequality for all non-negative real\ntriples `(a, b, c)` satisfying `(a + b) * (b + c) * (c + a) > 0`.\nThe assertion is represented as a proposition-valued definition, not as a\nproof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a * b) / (a + b) ^ 2 +\n (b * c) / (b + c) ^ 2 +\n (c * a) / (c + a) ^ 2 +\n 5 / 4\n\n/-- The right-hand side of the inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 6 * (a * b + b * c + c * a) / (a + b + c) ^ 2\n\n/-- The hypotheses of the source problem: `a`, `b`, and `c` are non-negative\nreal numbers and `(a + b) * (b + c) * (c + a)` is strictly positive. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 < (a + b) * (b + c) * (c + a)\n\n/-- The inequality asserted by the source problem, for fixed `a`, `b`, and `c`. -/\ndef InequalityAt (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full universally quantified proposition to be proved. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → InequalityAt a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ef6ba3c9-2f31-5375-8ef0-36b9f32e08b8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "30507242fd15f182de59a362631dfa7c503f42d8785e3fad8cb790a6140f6570", "task_path": "tasks/nmp3_ef6ba3c9-2f31-5375-8ef0-36b9f32e08b8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ef6ba3c9-2f31-5375-8ef0-36b9f32e08b8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ef74969b-95a9-531d-9f83-2931f80c2a8a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$, prove that \n-- $$\\sqrt{\\frac{a}{b^{2}+c^{2}}}+\\sqrt{\\frac{b}{c^{2}+a^{2}}}+\\sqrt{\\frac{c}{a^{2}+b^{2}}}\\ge 3\\sqrt{\\frac{ab+bc+ca}{2\\,(a^{3}+b^{3}+c^{3})}}\\,. $$\nmodule\n\npublic import Mathlib\n\n/-!\n# Formalization of the positive-real inequality\n\nFor positive real numbers `a`, `b`, and `c`, the problem asserts\n\n`√(a / (b^2 + c^2)) + √(b / (c^2 + a^2)) + √(c / (a^2 + b^2))`\n` ≥ 3 * √((ab + bc + ca) / (2 * (a^3 + b^3 + c^3)))`.\n\nThe declaration `Problem.Target` records this assertion as a proposition. No\nproof of the assertion is supplied here.\n-/\n\n@[expose] public section\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n Real.sqrt (a / (b ^ 2 + c ^ 2)) +\n Real.sqrt (b / (c ^ 2 + a ^ 2)) +\n Real.sqrt (c / (a ^ 2 + b ^ 2))\n\n/-- The right-hand side of the displayed inequality. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n (3 : ℝ) * Real.sqrt\n (((a * b + b * c + c * a) : ℝ) /\n ((2 : ℝ) * (a ^ 3 + b ^ 3 + c ^ 3)))\n\n/-- The complete statement: for every triple of positive real numbers, the\ndisplayed inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n leftHandSide a b c ≥ rightHandSide a b c\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ef74969b-95a9-531d-9f83-2931f80c2a8a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ebb7bdb53bcaba9815060f4d6f3b6b19881549ee9c0b181c497683aafefc282d", "task_path": "tasks/nmp3_ef74969b-95a9-531d-9f83-2931f80c2a8a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ef74969b-95a9-531d-9f83-2931f80c2a8a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_efb2b103-921a-5de3-8bb9-8f5d7164e16a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $S$ be a set of $n\\ge 4$ points in the plane, not all lying on a common circle, and such that no three points of $S$ are collinear. Let $f\\colon S\\to\\mathbb R$ satisfy the condition that for any circle $C$ which contains at least three points of $S$, one has \n-- \\[\n-- \\sum_{P\\in C\\cap S} f(P)=0.\n-- \\]\n-- Prove that $f(P)=0$ for every $P\\in S$.\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The Euclidean plane, represented as the real inner-product space of dimension two. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A nondegenerate circle in the Euclidean plane, represented by its center and radius. -/\nstructure Circle where\n center : Plane\n radius : ℝ\n radius_pos : 0 < radius\n\n/-- Membership of a point in a nondegenerate circle. -/\ndef Circle.Mem (C : Circle) (P : Plane) : Prop :=\n dist P C.center = C.radius\n\n/-- The points of a finite point set which lie on a given circle. -/\nnoncomputable def pointsOnCircle (S : Finset Plane) (C : Circle) : Finset Plane := by\n classical\n exact S.filter (fun P => C.Mem P)\n\n/-- The same finite set of points, attached as a finite set of elements of `S`.\nThis is the index set for the sum over the intersection of `S` with a circle. -/\nnoncomputable def attachedPointsOnCircle (S : Finset Plane) (C : Circle) : Finset S := by\n classical\n exact S.attach.filter (fun P => C.Mem (P : Plane))\n\n/-- The circle-sum condition: every circle containing at least three points of `S`\nhas sum of `f` over its intersection with `S` equal to zero. -/\ndef CircleSumCondition (S : Finset Plane) (f : S → ℝ) : Prop :=\n ∀ C : Circle,\n 3 ≤ (pointsOnCircle S C).card →\n (attachedPointsOnCircle S C).sum f = 0\n\n/-- The set `S` has no three distinct collinear points. -/\ndef NoThreeCollinear (S : Finset Plane) : Prop :=\n ∀ P ∈ S, ∀ Q ∈ S, ∀ R ∈ S,\n P ≠ Q → P ≠ R → Q ≠ R →\n ¬ Collinear ℝ ({P, Q, R} : Set Plane)\n\n/-- Not all points of `S` lie on one common nondegenerate circle. -/\ndef NotAllConcyclic (S : Finset Plane) : Prop :=\n ¬ ∃ C : Circle, ∀ P ∈ S, C.Mem P\n\n/-- The hypotheses of the problem, including the cardinality condition `|S| = n ≥ 4`. -/\ndef Admissible (n : ℕ) (S : Finset Plane) (f : S → ℝ) : Prop :=\n S.card = n ∧\n 4 ≤ n ∧\n NotAllConcyclic S ∧\n NoThreeCollinear S ∧\n CircleSumCondition S f\n\n/-- The asserted conclusion of the problem: `f` vanishes at every point of `S`. -/\ndef Conclusion (S : Finset Plane) (f : S → ℝ) : Prop :=\n ∀ P : S, f P = 0\n\n/-- The full universally quantified statement of the problem. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (S : Finset Plane) (f : S → ℝ),\n Admissible n S f → Conclusion S f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "efb2b103-921a-5de3-8bb9-8f5d7164e16a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "12d3c1ff61b690a6bfd2a962432019f7db386c76ae8ac5cea66eeeec457c04a2", "task_path": "tasks/nmp3_efb2b103-921a-5de3-8bb9-8f5d7164e16a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "efb2b103-921a-5de3-8bb9-8f5d7164e16a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_efceaa6f-56cb-515f-a3e9-45416dfc53e5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In the exterior of triangle $ABC$ construct outward equilateral triangles $ABM$, $BCN$, and $CAP$. Prove that the three lines $AN$, $BP$, and $CM$ are concurrent.\nimport Mathlib\n\n/-!\n# Napoleon-type concurrence of outward equilateral triangles\n\nThis file formalizes the statement of the problem: given a nondegenerate\ntriangle `ABC` and outward equilateral triangles `ABM`, `BCN`, and `CAP`,\nthe three lines `AN`, `BP`, and `CM` are concurrent.\n\nThe Euclidean plane is represented by `EuclideanSpace ℝ (Fin 2)`. The\n\"outward\" condition is expressed using the sign of an oriented area: the\nthird vertex of each equilateral triangle is required to lie in the open\nhalf-plane opposite the remaining vertex of `ABC`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- Points of the Euclidean plane. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The signed twice-area (or two-dimensional cross product) of two vectors. -/\ndef cross2 (u v : Point) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- The signed twice-area of the parallelogram spanned by `Y - X` and `Z - X`.\nIts sign tells on which side of the oriented line through `X` and `Y` the point\n`Z` lies. -/\ndef sideCross (X Y Z : Point) : ℝ := cross2 (Y - X) (Z - X)\n\n/-- `ABC` is a genuine (non-collinear) triangle. -/\ndef TriangleNondegenerate (A B C : Point) : Prop :=\n sideCross A B C ≠ 0\n\n/-- The triangle with vertices `X`, `Y`, `Z` is equilateral: all three side\nlengths are equal. -/\ndef Equilateral (X Y Z : Point) : Prop :=\n dist X Y = dist Y Z ∧ dist Y Z = dist Z X ∧ dist Z X = dist X Y\n\n/-- The oriented triangle `XYZ` is equilateral and `Z` lies in the open\nhalf-plane opposite `W` with respect to the line through `X` and `Y`.\nThus `XYZ` is the outward equilateral triangle on side `XY` relative to a\ntriangle having its third vertex at `W`. -/\ndef OutwardEquilateral (X Y Z W : Point) : Prop :=\n Equilateral X Y Z ∧ sideCross X Y Z * sideCross X Y W < 0\n\n/-- `Q` lies on the affine line through the line's two given points `X` and `Y`. -/\ndef OnLine (X Y Q : Point) : Prop :=\n ∃ t : ℝ, Q = (1 - t) • X + t • Y\n\n/-- The three lines `AN`, `BP`, and `CM` are concurrent. -/\ndef Concurrent (A N B P C M : Point) : Prop :=\n ∃ Q : Point, OnLine A N Q ∧ OnLine B P Q ∧ OnLine C M Q\n\n/-- The complete configuration: `M`, `N`, and `P` are respectively the outward\napexes on sides `AB`, `BC`, and `CA` of `ABC`. -/\ndef OutwardNapoleonConfiguration (A B C M N P : Point) : Prop :=\n OutwardEquilateral A B M C ∧\n OutwardEquilateral B C N A ∧\n OutwardEquilateral C A P B\n\n/-- The assertion of the problem: for every nondegenerate triangle `ABC` and\nevery choice of outward equilateral triangles `ABM`, `BCN`, and `CAP`, the\nlines `AN`, `BP`, and `CM` are concurrent. -/\ndef Target : Prop :=\n ∀ A B C M N P : Point,\n TriangleNondegenerate A B C →\n OutwardNapoleonConfiguration A B C M N P →\n Concurrent A N B P C M\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "efceaa6f-56cb-515f-a3e9-45416dfc53e5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f0a8f63bedb84a36180ad9affefe85d9c169649193d99f6ec49d83e9c547338b", "task_path": "tasks/nmp3_efceaa6f-56cb-515f-a3e9-45416dfc53e5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "efceaa6f-56cb-515f-a3e9-45416dfc53e5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f049d2ca-5547-5f81-87b5-4ab2a94b7b53", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1N$,\n-- \\[a_{T+n+1}-a_{T+n}=a_{n+1}-a_n.\\]\nimport Mathlib\n\n/-!\n# Eventual periodicity of the differences of a recursively defined integer sequence\n\nThis file formalizes the statement of the problem. The sequence is indexed by\nnatural numbers so that `a n` is the term called `a_n` in the problem (`n ≥ 1`);\nthe value `a 0` is an irrelevant dummy value and is never used.\n-/\n\nnamespace Problem\n\n/-- A pair `(i, j)` is an admissible representation of `x` from the first\n`n - 1` terms when `1 ≤ i < j ≤ n - 1` and `a i + a j = x`. -/\ndef IsRepresentation (a : ℕ → ℤ) (n : ℕ) (x : ℤ) : Prop :=\n ∃ i j : ℕ, 1 ≤ i ∧ i < j ∧ j ≤ n - 1 ∧ a i + a j = x\n\n/-- `x` is represented in exactly one way from the first `n - 1` terms. -/\ndef IsUniqueRepresentation (a : ℕ → ℤ) (n : ℕ) (x : ℤ) : Prop :=\n ∃! p : ℕ × ℕ,\n 1 ≤ p.1 ∧ p.1 < p.2 ∧ p.2 ≤ n - 1 ∧ a p.1 + a p.2 = x\n\n/-- The recursive defining condition for `a n` when `n ≥ 3`: it is the least\ninteger strictly larger than `a (n - 1)` having exactly one representation as\n`a i + a j` with `1 ≤ i < j ≤ n - 1`. -/\ndef IsNextTerm (a : ℕ → ℤ) (n : ℕ) (x : ℤ) : Prop :=\n a (n - 1) < x ∧\n IsUniqueRepresentation a n x ∧\n ∀ y : ℤ,\n a (n - 1) < y → IsUniqueRepresentation a n y → x ≤ y\n\n/-- A sequence satisfying the two initial values and the recursive rule from\nthe problem. The value at index `0` is irrelevant. -/\ndef IsProblemSequence (a : ℕ → ℤ) : Prop :=\n a 1 < a 2 ∧ ∀ n : ℕ, 3 ≤ n → IsNextTerm a n (a n)\n\n/-- Only finitely many positive-indexed terms of the sequence are even. -/\ndef FiniteEvenTerms (a : ℕ → ℤ) : Prop :=\n ({n : ℕ | 1 ≤ n ∧ Even (a n)} : Set ℕ).Finite\n\n/-- The difference sequence is eventually periodic: the displayed relation\nholds for all sufficiently large `n`, with positive period `T` and positive\nthreshold `N`. -/\ndef EventuallyPeriodicDifferences (a : ℕ → ℤ) : Prop :=\n ∃ T N : ℕ,\n 0 < T ∧ 0 < N ∧\n ∀ n : ℕ, N < n → a (T + n + 1) - a (T + n) = a (n + 1) - a n\n\n/-- The assertion to be proved: for every integer sequence satisfying the\ninitial condition, the recursive construction, and the hypothesis that only\n`finitely many terms are even`, the difference sequence is eventually\nperiodic. -/\ndef Target : Prop :=\n ∀ a : ℕ → ℤ,\n IsProblemSequence a → FiniteEvenTerms a → EventuallyPeriodicDifferences a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f049d2ca-5547-5f81-87b5-4ab2a94b7b53", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e8e2e0a202bd0564aaf3a28eea2c94413a895e4bfbaeb2ce8dc247d55de34c6a", "task_path": "tasks/nmp3_f049d2ca-5547-5f81-87b5-4ab2a94b7b53", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f049d2ca-5547-5f81-87b5-4ab2a94b7b53", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f04df0cb-3e1f-50f8-bee2-69a4d8b3d3e7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for positive integers $m,n$ with $\\gcd(m,n)=1$, the two numbers $m^2-n^2-2mn$ and $m^2-n^2+2mn$ cannot both be perfect squares.\nimport Mathlib\n\nnamespace Problem\n\n/-- An integer is a perfect square when it is the square of an integer.\n\nThis formulation also encodes the nonnegativity inherent in being a perfect\nsquare: negative integers are not perfect squares, while zero is. -/\ndef IsPerfectSquare (z : ℤ) : Prop :=\n ∃ k : ℤ, z = k ^ 2\n\n/-- The first integer from the problem:\n`m ^ 2 - n ^ 2 - 2 * m * n`. The positive inputs are embedded into `ℤ`\nbefore subtraction, so the expression is not truncated at zero. -/\ndef firstNumber (m n : ℕ) : ℤ :=\n (m : ℤ) ^ 2 - (n : ℤ) ^ 2 - 2 * (m : ℤ) * (n : ℤ)\n\n/-- The second integer from the problem:\n`m ^ 2 - n ^ 2 + 2 * m * n`. The positive inputs are embedded into `ℤ`\nbefore subtraction, so the two terms are added without natural-number\ntruncation. -/\ndef secondNumber (m n : ℕ) : ℤ :=\n (m : ℤ) ^ 2 - (n : ℤ) ^ 2 + 2 * (m : ℤ) * (n : ℤ)\n\n/-- The assertion of the problem: for all positive natural numbers `m` and\n`n` that are coprime, the two displayed integers are not both perfect\nsquares. -/\ndef Target : Prop :=\n ∀ m n : ℕ, 0 < m → 0 < n → Nat.gcd m n = 1 →\n ¬ (IsPerfectSquare (firstNumber m n) ∧\n IsPerfectSquare (secondNumber m n))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f04df0cb-3e1f-50f8-bee2-69a4d8b3d3e7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "84e1d01d49dd8364106523c2d87a594aa38369627ac49894cb7dad25978c240e", "task_path": "tasks/nmp3_f04df0cb-3e1f-50f8-bee2-69a4d8b3d3e7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f04df0cb-3e1f-50f8-bee2-69a4d8b3d3e7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f07d5d54-aa6d-569e-be6d-36f2bc4d0739", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given a parallelogram $ABCD$ and a point $P$ inside it such that $\\angle APB + \\angle CPD = 180^\\circ$, prove that $\\angle PAD = \\angle PCD$.\n/-\nFormalization of the problem statement:\n\nGiven a parallelogram ABCD and a point P inside it such that\n∠APB + ∠CPD = 180°, prove that ∠PAD = ∠PCD.\n\nThis file contains only the formal statement, not a proof.\n-/\n\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Analysis.Convex.Hull\nimport Mathlib.Analysis.Convex.Topology\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane used to represent the geometry of the problem. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/--\n`A B C D` are the vertices, in that order, of a nondegenerate parallelogram.\n\nThe adjacent side vectors `B - A` and `D - A` are required to be linearly\nindependent, so the quadrilateral is nondegenerate. The fourth vertex is\nthen `C = B + D - A`.\n-/\ndef IsParallelogram (A B C D : Point) : Prop :=\n C = B + D - A ∧ LinearIndependent ℝ ![B - A, D - A]\n\n/-- The point `P` lies in the strict interior of the parallelogram `ABCD`. -/\ndef IsInteriorPoint (A B C D P : Point) : Prop :=\n P ∈ interior (convexHull ℝ ({A, B, C, D} : Set Point))\n\n/-- The angle condition `∠APB + ∠CPD = 180°`, expressed in radians. -/\ndef AngleSumCondition (A B C D P : Point) : Prop :=\n ∠ A P B + ∠ C P D = Real.pi\n\n/-- The asserted conclusion `∠PAD = ∠PCD`. -/\ndef AngleConclusion (A C D P : Point) : Prop :=\n ∠ P A D = ∠ P C D\n\n/--\nThe universally quantified proposition asserted by the problem: for every\nnondegenerate parallelogram `ABCD` and every point `P` in its strict interior,\nif `∠APB + ∠CPD = 180°`, then `∠PAD = ∠PCD`.\n-/\ndef Target : Prop :=\n ∀ (A B C D P : Point),\n IsParallelogram A B C D →\n IsInteriorPoint A B C D P →\n AngleSumCondition A B C D P →\n AngleConclusion A C D P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f07d5d54-aa6d-569e-be6d-36f2bc4d0739", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b3459f72005104a9682ff1a881e16cfc7d2f9e0bb03bfb25750cf538e7b66baf", "task_path": "tasks/nmp3_f07d5d54-aa6d-569e-be6d-36f2bc4d0739", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f07d5d54-aa6d-569e-be6d-36f2bc4d0739", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f0803748-0582-5102-9b36-c988f470577c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a}{a+b}\\sqrt{\\frac{b}{b+c}}+\\frac{b}{b+c}\\sqrt{\\frac{c}{c+a}}+\\frac{c}{c+a}\\sqrt{\\frac{a}{a+b}}\\le \\frac{3\\sqrt2}{4}\\,.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement: cyclic square-root inequality\n\nThis file records the statement of the problem as a proposition-valued\ndefinition. No proof of the inequality is supplied here.\n-/\n\nnamespace Problem\n\n/-- The admissible domain of the problem: all three variables are positive\nreal numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / (a + b) * Real.sqrt (b / (b + c)) +\n b / (b + c) * Real.sqrt (c / (c + a)) +\n c / (c + a) * Real.sqrt (a / (a + b))\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def rhs : ℝ :=\n 3 * Real.sqrt 2 / 4\n\n/-- The assertion to be proved: for all positive real numbers `a`, `b`, and\n`c`, the cyclic square-root expression is at most `3 * sqrt 2 / 4`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → lhs a b c ≤ rhs\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f0803748-0582-5102-9b36-c988f470577c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c9ddad079db506a00f82f536f21443456859fc31359c5336ca1a76616a36b894", "task_path": "tasks/nmp3_f0803748-0582-5102-9b36-c988f470577c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f0803748-0582-5102-9b36-c988f470577c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f081bbe5-95e4-58b1-a538-35e881cc38dd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Prove that\n-- \\[\n-- \\frac{a-b}{b}+\\frac{b-c}{c}+\\frac{c-a}{a}\\ge 2\\,(a-b)(b-c)(c-a).\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the inequality statement\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`\nwhose sum is `3`, the inequality\n\n`(a - b) / b + (b - c) / c + (c - a) / a ≥ 2 * (a - b) * (b - c) * (c - a)`.\n\nThe declarations below record the admissibility hypotheses and the exact target\nproposition. No proof of the target is supplied at this stage.\n-/\n\nnamespace Problem\n\n/-- The admissible values in the source problem: `a`, `b`, and `c` are positive\nreal numbers with sum `3`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 3\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a - b) / b + (b - c) / c + (c - a) / a\n\n/-- The right-hand side of the asserted inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 2 * ((a - b) * (b - c) * (c - a))\n\n/-- The inequality asserted for admissible `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The complete proposition to be proved in the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f081bbe5-95e4-58b1-a538-35e881cc38dd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "13640a1e97c87a85a22448ce1951023ac26e97a9d9ef37d754c0743224466e3b", "task_path": "tasks/nmp3_f081bbe5-95e4-58b1-a538-35e881cc38dd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f081bbe5-95e4-58b1-a538-35e881cc38dd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f0b31635-0dbf-55a1-b91c-7fbd5115f840", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $x$, $y$, $z$, prove that \n-- \\[\n-- \\frac{(x+y+z)^{3}}{xyz}+18\\sum_{\\text{cyc}}\\frac{x^{2}}{x^{2}+yz}\\ge 54\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the cyclic inequality\n\nFor positive real numbers `x`, `y`, and `z`, the statement asks to prove\n\n\\[\n\\frac{(x+y+z)^3}{xyz} + 18 \\sum_{\\mathrm{cyc}} \\frac{x^2}{x^2+yz} \\ge 54.\n\\]\n\nThe definitions below make the cyclic sum and the complete target proposition\nexplicit. No proof of the target is included.\n-/\n\nnamespace Problem\n\n/-- One cyclic summand `x^2 / (x^2 + y*z)`. -/\nnoncomputable def cyclicTerm (x y z : ℝ) : ℝ :=\n x ^ 2 / (x ^ 2 + y * z)\n\n/-- The cyclic sum appearing in the problem:\n`x^2/(x^2+yz) + y^2/(y^2+zx) + z^2/(z^2+xy)`. -/\nnoncomputable def cyclicSum (x y z : ℝ) : ℝ :=\n cyclicTerm x y z + cyclicTerm y z x + cyclicTerm z x y\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (x y z : ℝ) : ℝ :=\n (x + y + z) ^ 3 / (x * y * z) + 18 * cyclicSum x y z\n\n/-- The complete statement: for all positive real numbers `x`, `y`, and `z`,\nthe left-hand side is at least `54`. Positivity of `x`, `y`, and `z` is stated\nas three strict inequalities. -/\nnoncomputable def Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z → lhs x y z ≥ 54\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f0b31635-0dbf-55a1-b91c-7fbd5115f840", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "844f49c3c267207e1611ee9effbe36c9ec3ec4e30a5a2f881377e4175fe91dcd", "task_path": "tasks/nmp3_f0b31635-0dbf-55a1-b91c-7fbd5115f840", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f0b31635-0dbf-55a1-b91c-7fbd5115f840", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f10fef6e-a316-5f62-822b-e3587e27877a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G=(V,E)$ be a simple connected graph with $|V|=2010$ and $|E|=2009$ (hence $G$ is a tree). Let $f:V\\to V$ be a mapping such that for every edge $uv\\in E$ either $f(u)f(v)\\in E$ or $f(u)=f(v)$. Prove that at least one of the following holds: \n-- \n-- (1) There exists a vertex $v\\in V$ with $f(v)=v$ (a fixed point). \n-- \n-- (2) There exist adjacent vertices $u,v\\in V$ (i.e. $uv\\in E$) such that $f(u)=v$ and $f(v)=u$ (a 2‑cycle on an edge).\nmodule\n\npublic import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected\n\n@[expose] public section\n\nuniverse u\n\nnamespace Problem\n\n/-- The graph-theoretic hypotheses of the problem.\n\n`SimpleGraph V` already expresses that the graph is simple (its adjacency\nrelation is symmetric and loopless). The cardinality equalities are stated\nwith `Nat.card`; in particular, `Nat.card` is `0` for infinite types, so the\nequalities `Nat.card V = 2010` and `Nat.card G.edgeSet = 2009` force the\nrelevant vertex and edge collections to be finite with the required sizes. -/\ndef IsProblemGraph (V : Type u) (G : SimpleGraph V) : Prop :=\n G.Connected ∧ Nat.card V = 2010 ∧ Nat.card G.edgeSet = 2009\n\n/-- The edge-preserving-or-collapsing condition on the map `f`.\n\nFor each adjacency `u v` in `G`, its image is either an adjacency or a collapse\nto a single vertex. Quantifying over ordered adjacent pairs is equivalent to\nquantifying over undirected edges because `SimpleGraph.Adj` is symmetric and\nthe disjunction is invariant under swapping `u` and `v`. -/\ndef IsAdmissibleMap (V : Type u) (G : SimpleGraph V) (f : V → V) : Prop :=\n ∀ u v : V, G.Adj u v → G.Adj (f u) (f v) ∨ f u = f v\n\n/-- Alternative (1): the map has a fixed point. -/\ndef HasFixedPoint (V : Type u) (f : V → V) : Prop :=\n ∃ v : V, f v = v\n\n/-- Alternative (2): there is an adjacent pair interchanged by the map. -/\ndef HasAdjacentTwoCycle (V : Type u) (G : SimpleGraph V) (f : V → V) : Prop :=\n ∃ u v : V, G.Adj u v ∧ f u = v ∧ f v = u\n\n/-- The full formalized assertion of the problem.\n\nFor every vertex type `V`, every simple graph `G` on `V` with `2010` vertices\nand `2009` edges that is connected, and every map `f : V → V` satisfying the\nedge-preserving-or-collapsing condition, at least one of the two displayed\nalternatives holds. -/\ndef Target : Prop :=\n ∀ (V : Type u) (G : SimpleGraph V) (f : V → V),\n IsProblemGraph V G → IsAdmissibleMap V G f →\n HasFixedPoint V f ∨ HasAdjacentTwoCycle V G f\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f10fef6e-a316-5f62-822b-e3587e27877a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f51555cb82785c2cdd216f4f2c3286df8913056c8e5144cf1dcd87fb00f836ed", "task_path": "tasks/nmp3_f10fef6e-a316-5f62-822b-e3587e27877a", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f10fef6e-a316-5f62-822b-e3587e27877a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f1107522-d55c-5514-9c8f-05da57c82cf0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an equilateral triangle. Points $P,Q,R$ lie in the interior of $ABC$ such that the segments $AR$, $BP$, and $CQ$ have the same length. Moreover, $Q$, $A$, $R$ are collinear with $Q$ between $A$ and $R$; $R$, $B$, $P$ are collinear with $R$ between $B$ and $P$; and $P$, $C$, $Q$ are collinear with $P$ between $C$ and $Q$. Prove that $\\triangle PQR$ is also equilateral.\nimport Mathlib.Analysis.Convex.Between\nimport Mathlib.Analysis.Convex.Topology\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional\n\n/-!\n# Formal statement: triangle `PQR` is equilateral\n\nThis file formalizes the statement of the problem, but intentionally does not\nprove it. The target is the proposition `Problem.Target`.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane used to interpret all points and triangles in the problem. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A nondegenerate triangle, expressed as three non-collinear points in the plane. -/\ndef IsNondegenerateTriangle (A B C : Plane) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Plane)\n\n/-- An equilateral triangle: its three vertices are non-collinear and its three side\nlengths are equal. -/\ndef IsEquilateralTriangle (A B C : Plane) : Prop :=\n IsNondegenerateTriangle A B C ∧\n dist A B = dist B C ∧ dist B C = dist C A\n\n/-- The (topological) interior of the triangle with vertices `A`, `B`, and `C`. -/\ndef TriangleInterior (A B C : Plane) : Set Plane :=\n interior (convexHull ℝ ({A, B, C} : Set Plane))\n\n/-- The three segment lengths `AR`, `BP`, and `CQ` are equal. -/\ndef SameCevianLengths (A B C P Q R : Plane) : Prop :=\n dist A R = dist B P ∧ dist B P = dist C Q\n\n/-- The required strict ordering conditions on the three cevians. In `Sbtw ℝ x y z`,\n`y` is strictly between `x` and `z`. -/\ndef CyclicBetweenness (A B C P Q R : Plane) : Prop :=\n Sbtw ℝ A Q R ∧ Sbtw ℝ B R P ∧ Sbtw ℝ C P Q\n\n/-- All hypotheses of the problem, gathered into a single admissibility predicate. -/\ndef IsAdmissibleConfiguration (A B C P Q R : Plane) : Prop :=\n IsEquilateralTriangle A B C ∧\n P ∈ TriangleInterior A B C ∧\n Q ∈ TriangleInterior A B C ∧\n R ∈ TriangleInterior A B C ∧\n SameCevianLengths A B C P Q R ∧\n CyclicBetweenness A B C P Q R\n\n/-- The precise assertion of the problem: for every equilateral triangle `ABC` and\nall interior points `P`, `Q`, `R` satisfying the three equal-length and betweenness\nconditions, the triangle `PQR` is equilateral. -/\ndef Target : Prop :=\n ∀ A B C P Q R : Plane,\n IsAdmissibleConfiguration A B C P Q R → IsEquilateralTriangle P Q R\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f1107522-d55c-5514-9c8f-05da57c82cf0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6d69c51f3613e66383808c1f89eca2dd298e957deda809d6b960b9be0a07fa18", "task_path": "tasks/nmp3_f1107522-d55c-5514-9c8f-05da57c82cf0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f1107522-d55c-5514-9c8f-05da57c82cf0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f1202a46-ede4-515d-8438-e63de4d191ae", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) with \\(abc=1\\). Prove that \n-- \\[\n-- \\frac{a^{2}+b^{2}}{c^{2}+a+b}+\\frac{b^{2}+c^{2}}{a^{2}+b+c}+\\frac{c^{2}+a^{2}}{b^{2}+c+a}\\ge 2.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the positive-real inequality problem\n\nThe original problem asks to prove, for all positive real numbers `a`, `b`, and `c`\nsatisfying `a * b * c = 1`, the stated three-term inequality. The declarations\nbelow record the admissibility predicate, the left-hand side, and the target\nproposition. No proof of the target is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions from the problem: `a`, `b`, and `c` are positive\nreal numbers whose product is `1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2) / (c ^ 2 + a + b) +\n (b ^ 2 + c ^ 2) / (a ^ 2 + b + c) +\n (c ^ 2 + a ^ 2) / (b ^ 2 + c + a)\n\n/-- The formal target: for every admissible real triple `(a, b, c)`, the\nleft-hand side is at least `2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f1202a46-ede4-515d-8438-e63de4d191ae", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4ebfb6ac5d11f8c2e7e49b419e1ee84390a186a71e3c86402725fa5707062ad1", "task_path": "tasks/nmp3_f1202a46-ede4-515d-8438-e63de4d191ae", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f1202a46-ede4-515d-8438-e63de4d191ae", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f1462c62-9958-5e83-83f4-e89deb5ff2d0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive integers satisfying $\\gcd(a,b)+\\operatorname{lcm}(a,b)=2021^c$. Suppose $|a-b|$ is a prime number. Prove that $(a+b)^2+4$ is composite.\nimport Mathlib.Data.Nat.Dist\nimport Mathlib.Data.Nat.GCD.Basic\nimport Mathlib.Data.Nat.Prime.Basic\n\nnamespace Problem\n\n/-- A natural number `n` is composite if it is greater than `1` and is not prime. -/\ndef Composite (n : ℕ) : Prop :=\n 1 < n ∧ ¬ Nat.Prime n\n\n/-- The hypotheses of the problem for positive integers `a`, `b`, and `c`. -/\ndef Admissible (a b c : ℕ) : Prop :=\n 0 < a ∧\n 0 < b ∧\n 0 < c ∧\n Nat.gcd a b + Nat.lcm a b = 2021 ^ c ∧\n Nat.Prime (Nat.dist a b)\n\n/-- The assertion to be proved: for all positive integers `a`, `b`, and `c`\nsatisfying the stated gcd/lcm equation and having prime absolute difference,\nthe number `(a + b)^2 + 4` is composite. -/\ndef Target : Prop :=\n ∀ a b c : ℕ, Admissible a b c → Composite ((a + b) ^ 2 + 4)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f1462c62-9958-5e83-83f4-e89deb5ff2d0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b94540b9d7df53101a28b2aa6d2be90a10a34a05b69210b2390acfa9795d3e86", "task_path": "tasks/nmp3_f1462c62-9958-5e83-83f4-e89deb5ff2d0", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f1462c62-9958-5e83-83f4-e89deb5ff2d0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f16ace2c-192e-59af-8279-c59eba1a5213", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P(x)$ and $Q(x)$ be two polynomials with integer coefficients such that no non‑constant polynomial with rational coefficients divides both $P(x)$ and $Q(x)$. Suppose that for every positive integer $n$ the integers $P(n)$ and $Q(n)$ are positive and that $2^{\\,Q(n)}-1$ divides $3^{\\,P(n)}-1$. Prove that $Q(x)$ is a constant polynomial.\nimport Mathlib\n\n/-\nFormal statement of the problem:\n\nLet P(x) and Q(x) be two polynomials with integer coefficients such that no\nnon-constant polynomial with rational coefficients divides both P(x) and Q(x).\nSuppose that for every positive integer n, the integers P(n) and Q(n) are\npositive and that 2^(Q(n)) - 1 divides 3^(P(n)) - 1. Prove that Q(x) is a\nconstant polynomial.\n\nNo proof of the target is supplied; `Target` is the proposition itself.\n-/\n\nnamespace Problem\n\n/-- A polynomial over `ℚ` is constant when it is of the form `C c` for some\nrational number `c`. This includes the zero polynomial. -/\ndef IsConstantPolynomialRat (R : Polynomial ℚ) : Prop :=\n ∃ c : ℚ, R = Polynomial.C c\n\n/-- There is no non-constant polynomial with rational coefficients that divides\nboth integer polynomials `P` and `Q`, after viewing them over `ℚ`. -/\ndef NoNonconstantCommonDivisorOverRat (P Q : Polynomial ℤ) : Prop :=\n ∀ R : Polynomial ℚ,\n ¬ IsConstantPolynomialRat R →\n ¬ (R ∣ Polynomial.map (Int.castRingHom ℚ) P ∧\n R ∣ Polynomial.map (Int.castRingHom ℚ) Q)\n\n/-- For every positive integer `n`, the integer values `P(n)` and `Q(n)` are\npositive, and `2 ^ Q(n) - 1` divides `3 ^ P(n) - 1` in `ℤ`.\n\nThe exponent `Q(n)` (respectively `P(n)`) is converted from `ℤ` to `ℕ` with\n`Int.toNat`; the accompanying positivity condition states that this conversion\nis the intended positive-integer exponent. -/\ndef PositiveValuesAndDivisibility (P Q : Polynomial ℤ) : Prop :=\n ∀ n : ℕ, 0 < n →\n 0 < Polynomial.eval (n : ℤ) P ∧\n 0 < Polynomial.eval (n : ℤ) Q ∧\n ((2 : ℤ) ^ (Polynomial.eval (n : ℤ) Q).toNat - 1 ∣\n (3 : ℤ) ^ (Polynomial.eval (n : ℤ) P).toNat - 1)\n\n/-- The full assertion of the problem: for every pair of integer polynomials\nwith no non-constant rational common divisor, if both take positive integer\nvalues at every positive integer and the stated exponential divisibility holds,\nthen `Q` is a constant polynomial. -/\ndef Target : Prop :=\n ∀ P Q : Polynomial ℤ,\n NoNonconstantCommonDivisorOverRat P Q →\n PositiveValuesAndDivisibility P Q →\n ∃ c : ℤ, Q = Polynomial.C c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f16ace2c-192e-59af-8279-c59eba1a5213", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "df3b2522a11824f0cf3ffe1dbf316567e6431e564f853fe8b465de03cdcffb0d", "task_path": "tasks/nmp3_f16ace2c-192e-59af-8279-c59eba1a5213", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f16ace2c-192e-59af-8279-c59eba1a5213", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f1836c34-23f7-56e8-a99b-e546eb945b26", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be real numbers such that $a+b+c=3$. Prove that \n-- \\[\n-- \\frac{1}{\\sqrt{a^{2}+3}}+\\frac{1}{\\sqrt{b^{2}+3}}+\\frac{1}{\\sqrt{c^{2}+3}}\\le\\frac32.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe problem quantifies over all real triples `(a, b, c)` satisfying\n`a + b + c = 3` and asserts the stated upper bound for the sum of the\nthree reciprocal square roots.\n-/\n\nnamespace Problem\n\n/--\nFor all real numbers `a`, `b`, and `c` with `a + b + c = 3`, the sum\n`1 / sqrt (a^2 + 3) + 1 / sqrt (b^2 + 3) + 1 / sqrt (c^2 + 3)`\nis at most `3 / 2`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n a + b + c = (3 : ℝ) →\n (1 / Real.sqrt (a ^ 2 + (3 : ℝ)) +\n 1 / Real.sqrt (b ^ 2 + (3 : ℝ)) +\n 1 / Real.sqrt (c ^ 2 + (3 : ℝ)) ≤\n (3 : ℝ) / 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f1836c34-23f7-56e8-a99b-e546eb945b26", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0a776e66fe748cc5c813e4cde83812cb4c627b809efdaa1a715fc785bf3e284d", "task_path": "tasks/nmp3_f1836c34-23f7-56e8-a99b-e546eb945b26", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f1836c34-23f7-56e8-a99b-e546eb945b26", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f18ddd28-4650-5d68-a7d7-573d4af3bba9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{a+3}{(a+1)^2}+\\frac{b+3}{(b+1)^2}+\\frac{c+3}{(c+1)^2}\\ge 3.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the algebraic inequality problem\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose product is one, that a certain sum of three rational expressions is at\nleast three.\n-/\n\nnamespace Problem\n\n/-- One summand `(x + 3) / (x + 1)^2` occurring on the left-hand side. -/\nnoncomputable def summand (x : ℝ) : ℝ :=\n (x + 3) / (x + 1) ^ 2\n\n/-- The left-hand side of the inequality, as a function of `a`, `b`, and `c`. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n summand a + summand b + summand c\n\n/-- The target proposition: for all positive reals `a`, `b`, and `c` with\n`a * b * c = 1`, the stated sum is at least `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c → a * b * c = 1 →\n 3 ≤ lhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f18ddd28-4650-5d68-a7d7-573d4af3bba9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f1fd0265b3b3b69a075d9442f4b9912351652ac5b8f79ac35d93d48b0a418e2a", "task_path": "tasks/nmp3_f18ddd28-4650-5d68-a7d7-573d4af3bba9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f18ddd28-4650-5d68-a7d7-573d4af3bba9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f1afcb90-b2db-59bb-8e6f-72ef08ea52cf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:\\mathbb N\\to\\mathbb N$. Show that $f(m)+n\\mid f(n)+m$ for all positive integers $m\\le n$ if and only if $f(m)+n\\mid f(n)+m$ for all positive integers $m\\ge n$.\nimport Mathlib.Data.Nat.Basic\n\nnamespace Problem\n\n/-- The first divisibility property: for every pair of positive natural numbers\n`m ≤ n`, the natural number `f m + n` divides `f n + m`. -/\ndef AdmissibleLE (f : ℕ → ℕ) : Prop :=\n ∀ (m n : ℕ), 0 < m → 0 < n → m ≤ n → (f m + n) ∣ (f n + m)\n\n/-- The second divisibility property: for every pair of positive natural numbers\n`m ≥ n`, the natural number `f m + n` divides `f n + m`. -/\ndef AdmissibleGE (f : ℕ → ℕ) : Prop :=\n ∀ (m n : ℕ), 0 < m → 0 < n → n ≤ m → (f m + n) ∣ (f n + m)\n\n/-- The assertion of the problem: for every function `f : ℕ → ℕ`, the\ndivisibility property for all positive `m ≤ n` is equivalent to the\ndivisibility property for all positive `m ≥ n`. -/\ndef Target : Prop :=\n ∀ (f : ℕ → ℕ), AdmissibleLE f ↔ AdmissibleGE f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f1afcb90-b2db-59bb-8e6f-72ef08ea52cf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "baed5acfa01665ca2915b233fb4a82cd2d0da3c0c96f9245cb38e89f2052a5d0", "task_path": "tasks/nmp3_f1afcb90-b2db-59bb-8e6f-72ef08ea52cf", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f1afcb90-b2db-59bb-8e6f-72ef08ea52cf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f206b732-8877-51e2-bb45-67d3067612ed", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\frac{a^3+abc}{\\sqrt{b^2+c^2}}+\\frac{b^3+abc}{\\sqrt{c^2+a^2}}+\\frac{c^3+abc}{\\sqrt{a^2+b^2}}\n-- \\;\\ge\\;\n-- \\frac{\\sqrt2}{3}\\bigl(\\sqrt{ab}+\\sqrt{bc}+\\sqrt{ca}\\bigr)^2.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality, as a function of the three\npositive real variables. -/\nnoncomputable def LeftSide (a b c : ℝ) : ℝ :=\n (a ^ 3 + a * b * c) / Real.sqrt (b ^ 2 + c ^ 2) +\n (b ^ 3 + a * b * c) / Real.sqrt (c ^ 2 + a ^ 2) +\n (c ^ 3 + a * b * c) / Real.sqrt (a ^ 2 + b ^ 2)\n\n/-- The right-hand side of the target inequality, as a function of the three\npositive real variables. -/\nnoncomputable def RightSide (a b c : ℝ) : ℝ :=\n (Real.sqrt 2 / 3) *\n (Real.sqrt (a * b) + Real.sqrt (b * c) + Real.sqrt (c * a)) ^ 2\n\n/-- For all positive real numbers `a`, `b`, and `c`, the target inequality\nholds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n LeftSide a b c ≥ RightSide a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f206b732-8877-51e2-bb45-67d3067612ed", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3dba300f62045a3017da243d8e88ab0f0afe1da5d66d59fc0139e5f40f788e94", "task_path": "tasks/nmp3_f206b732-8877-51e2-bb45-67d3067612ed", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f206b732-8877-51e2-bb45-67d3067612ed", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f226c394-9c65-518c-bb18-ca2f40f3ab03", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be an integer with $n\\ge 2$. Prove that the integer \n-- \n-- \\[\n-- \\bigl(2^{n}+1\\bigr)\\bigl(2^{n}+3\\bigr)\\cdots\\bigl(2^{\\,n+1}-1\\bigr)\\;-\\;1\\cdot3\\cdot5\\cdots(2^{n}-1)\n-- \\]\n-- \n-- is divisible by $2^{3n-1}$ but not by $2^{3n}$. (Equivalently, its $2$‑adic valuation equals $3n-1$.)\n/-\nFormalization of the statement in `problem.md`.\n\nFor an integer `n ≥ 2`, the displayed integer is the difference of two\nfinite products of odd integers:\n\n* the first product runs over `2^n + 1, 2^n + 3, ..., 2^(n+1) - 1`;\n* the second product runs over `1, 3, 5, ..., 2^n - 1`.\n\nThe conclusion is the conjunction of divisibility by `2^(3*n - 1)` and\nnon-divisibility by `2^(3*n)`. No proof of this statement is asserted here.\n-/\nimport Mathlib\n\nnamespace Problem\n\n/-- The integer `2^n`, for an integer exponent `n`, read through `Int.toNat`.\n\nEvery use of this definition in the target occurs under the hypothesis `2 ≤ n`,\nso the exponent is nonnegative and this is the usual integer power of two. -/\ndef powTwo (n : ℤ) : ℤ :=\n (2 : ℤ) ^ n.toNat\n\n/-- The finite set of odd integers `z` with `a ≤ z ≤ b`. -/\ndef oddIntegers (a b : ℤ) : Finset ℤ :=\n (Finset.Icc a b).filter (fun (z : ℤ) => Odd z)\n\n/-- The first displayed product\n`(2^n + 1) * (2^n + 3) * ... * (2^(n+1) - 1)`.\n\nIt is the product of all odd integers in the interval from `2^n + 1` through\n`2^(n+1) - 1`. Under the target assumption `2 ≤ n`, these are exactly\n`2^n + 1, 2^n + 3, ..., 2^(n+1) - 1`. -/\ndef oddProductAbove (n : ℤ) : ℤ :=\n Finset.prod (oddIntegers (powTwo n + 1) (powTwo (n + 1) - 1))\n (fun (z : ℤ) => z)\n\n/-- The second displayed product\n`1 * 3 * 5 * ... * (2^n - 1)`.\n\nIt is the product of all odd integers in the interval from `1` through\n`2^n - 1`. Under the target assumption `2 ≤ n`, these are exactly\n`1, 3, 5, ..., 2^n - 1`. -/\ndef oddProductBelow (n : ℤ) : ℤ :=\n Finset.prod (oddIntegers (1 : ℤ) (powTwo n - 1))\n (fun (z : ℤ) => z)\n\n/-- The integer displayed in the problem:\nthe first odd product minus the second odd product. -/\ndef expression (n : ℤ) : ℤ :=\n oddProductAbove n - oddProductBelow n\n\n/-- The assertion that `2^(3*n - 1)` divides the displayed integer. -/\ndef expectedPowerDivides (n : ℤ) : Prop :=\n powTwo (3 * n - 1) ∣ expression n\n\n/-- The assertion that `2^(3*n)` does not divide the displayed integer. -/\ndef nextPowerDoesNotDivide (n : ℤ) : Prop :=\n ¬ powTwo (3 * n) ∣ expression n\n\n/-- The conclusion for one fixed integer `n`, conditional on `n ≥ 2`. -/\ndef Claim (n : ℤ) : Prop :=\n 2 ≤ n → expectedPowerDivides n ∧ nextPowerDoesNotDivide n\n\n/-- The full quantified target statement: for every integer `n ≥ 2`, the\ndisplayed integer is divisible by `2^(3*n - 1)` but not by `2^(3*n)`. -/\ndef Target : Prop :=\n ∀ n : ℤ, Claim n\n\n/-- An elementary expression of exact finite `2`-adic valuation: a nonzero\ninteger `a` has `2`-adic valuation `k` exactly when `2^k ∣ a` and\n`2^(k+1) ∤ a`. For `a = 0` this predicate is false for every finite `k`,\nconsistently with the usual convention that `0` has infinite valuation. -/\ndef HasExactTwoAdicValuation (a : ℤ) (k : ℕ) : Prop :=\n (2 : ℤ) ^ k ∣ a ∧ ¬ (2 : ℤ) ^ (k + 1) ∣ a\n\n/-- The parenthetical reformulation: the `2`-adic valuation of the displayed\ninteger is `3*n - 1`. Under `2 ≤ n`, this is equivalent to the two\ndivisibility assertions used in `Claim`. -/\ndef twoAdicValuationClaim (n : ℤ) : Prop :=\n HasExactTwoAdicValuation (expression n) (3 * n - 1).toNat\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f226c394-9c65-518c-bb18-ca2f40f3ab03", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2334551619e29d8954e56fcfb99e5ffc26ec2ec9ccbc5ae6106f34d22e5081bc", "task_path": "tasks/nmp3_f226c394-9c65-518c-bb18-ca2f40f3ab03", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f226c394-9c65-518c-bb18-ca2f40f3ab03", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f251f2aa-ec72-55fb-9e7f-a58e5335da4b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. Prove that there exist positive real numbers $a_0,a_1,\\dots,a_n$ such that for every choice of signs (each coefficient may be taken as $+a_i$ or $-a_i$) the polynomial \n-- \\[\n-- \\pm a_n x^n \\pm a_{n-1}x^{\\,n-1}\\pm\\cdots\\pm a_1x\\pm a_0\n-- \\] \n-- has $n$ distinct real roots.\nimport Mathlib\n\nnamespace Problem\n\n/--\nA polynomial `p` has exactly `n` distinct real roots if there is an injective\nlisting `xs : Fin n → ℝ` of all real roots of `p`. Injectivity accounts for the\ndistinctness, and the final completeness clause excludes any additional real\nroot.\n-/\ndef HasExactlyNDistinctRealRoots (p : Polynomial ℝ) (n : ℕ) : Prop :=\n ∃ xs : Fin n → ℝ,\n Function.Injective xs ∧\n (∀ i : Fin n, Polynomial.IsRoot p (xs i)) ∧\n (∀ x : ℝ, Polynomial.IsRoot p x → ∃ i : Fin n, x = xs i)\n\n/-- A choice, independently for every coefficient from degree `0` through `n`,\nof whether that coefficient is positive or negative. `true` means `+a i` and\n`false` means `-a i`.\n-/\ndef SignChoice (n : ℕ) : Type :=\n Fin (n + 1) → Bool\n\n/--\nGiven positive magnitudes `a i`, form the polynomial\n`∑ i, (if s i then a i else -a i) * X ^ i`.\n-/\nnoncomputable def SignedPolynomial (n : ℕ) (a : Fin (n + 1) → ℝ)\n (s : SignChoice n) : Polynomial ℝ :=\n ∑ i : Fin (n + 1),\n Polynomial.C (if s i then a i else -a i) * Polynomial.X ^ (i : ℕ)\n\n/--\nFor every positive integer `n`, there are positive real numbers\n`a 0, a 1, ..., a n` such that every one of the `2 ^ (n + 1)` independent\nchoices of signs for the coefficients gives a polynomial with exactly `n`\ndistinct real roots.\n-/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n →\n ∃ a : Fin (n + 1) → ℝ,\n (∀ i : Fin (n + 1), 0 < a i) ∧\n ∀ s : SignChoice n,\n HasExactlyNDistinctRealRoots (SignedPolynomial n a s) n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f251f2aa-ec72-55fb-9e7f-a58e5335da4b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2f9a6949c1516e540498d5ef8e1ba7345a56363ea09d5a91c44c0a660ae1a67b", "task_path": "tasks/nmp3_f251f2aa-ec72-55fb-9e7f-a58e5335da4b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f251f2aa-ec72-55fb-9e7f-a58e5335da4b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f26ef8d5-7828-580a-9328-2eb9a7efd09c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute triangle. Let $D$, $E$, $F$ be the feet of the altitudes from $A$, $B$, $C$ onto $BC$, $CA$, $AB$, respectively. The line $EF$ meets the circumcircle of $ABC$ again at $P$, with $F$ between $E$ and $P$. Let $Q=BP\\cap DF$. Prove that if $ED=EP$, then $CQ\\parallel DP\\,.\nimport Mathlib\n\n/-!\n# Formalization of an altitude / circumcircle geometry problem\n\nWe work in the Euclidean plane represented as `EuclideanSpace ℝ (Fin 2)`.\nThe three principal geometric predicates used below are defined explicitly:\ncollinearity by a zero two-dimensional determinant, an altitude foot by\nmembership in the opposite side-line together with a right-angle dot-product\ncondition, and a point being on the circumcircle of three points by the\nexistence of a positive-radius circle through all four points.\n-/\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- A point in the Euclidean plane. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The two-dimensional determinant (signed area) of two vectors. -/\ndef cross (u v : Point) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- Three points are collinear when the determinant of two side vectors is zero. -/\ndef Collinear (A B C : Point) : Prop := cross (B - A) (C - A) = 0\n\n/-- `Y` lies strictly between `X` and `Z` on the affine line through them. -/\ndef StrictlyBetween (X Y Z : Point) : Prop :=\n ∃ t : ℝ, 0 < t ∧ t < 1 ∧ Y = (1 - t) • X + t • Z\n\n/-- The lines through `A,B` and `C,D` have parallel direction vectors. -/\ndef LineParallel (A B C D : Point) : Prop :=\n cross (B - A) (D - C) = 0\n\n/--\n`D` is the foot of the altitude from `A` to the line `BC`: it lies on the line\n`BC` and the segment `AD` is perpendicular to `BC`.\n-/\ndef IsAltitudeFoot (A B C D : Point) : Prop :=\n Collinear B C D ∧ inner ℝ (A - D) (C - B) = 0\n\n/-- The circle with center `O` and radius `r` passes through `X`. -/\ndef OnCircleWithCenterRadius (O : Point) (r : ℝ) (X : Point) : Prop :=\n dist O X = r\n\n/--\n`P` lies on the circumcircle of the non-collinear triple `A,B,C`; explicitly,\nsome positive-radius circle passes through `A`, `B`, `C`, and `P`.\n-/\ndef OnCircumcircle (A B C P : Point) : Prop :=\n ∃ O : Point, ∃ r : ℝ,\n 0 < r ∧\n OnCircleWithCenterRadius O r A ∧\n OnCircleWithCenterRadius O r B ∧\n OnCircleWithCenterRadius O r C ∧\n OnCircleWithCenterRadius O r P\n\n/-- The triangle `ABC` is nondegenerate and all three of its angles are acute. -/\ndef IsAcuteTriangle (A B C : Point) : Prop :=\n ¬ Collinear A B C ∧\n 0 < inner ℝ (B - A) (C - A) ∧\n 0 < inner ℝ (A - B) (C - B) ∧\n 0 < inner ℝ (A - C) (B - C)\n\n/--\n`X` is the unique intersection of the line through `A,B` and the line through\n`C,D`.\n-/\ndef IsLineIntersection (A B C D X : Point) : Prop :=\n Collinear A B X ∧\n Collinear C D X ∧\n ∀ Y : Point, Collinear A B Y → Collinear C D Y → Y = X\n\n/--\nLet `ABC` be an acute triangle, let `D`, `E`, `F` be the feet of the altitudes\nfrom `A`, `B`, `C` onto `BC`, `CA`, `AB`, respectively. Let the line `EF`\nmeet the circumcircle of `ABC` at `P`, with `F` strictly between `E` and `P`.\nLet `Q = BP ∩ DF`. If `ED = EP`, then `CQ` is parallel to `DP`.\n-/\ndef Target : Prop :=\n ∀ (A B C D E F P Q : Point),\n IsAcuteTriangle A B C →\n IsAltitudeFoot A B C D →\n IsAltitudeFoot B C A E →\n IsAltitudeFoot C A B F →\n OnCircumcircle A B C P →\n StrictlyBetween E F P →\n IsLineIntersection B P D F Q →\n dist E D = dist E P →\n LineParallel C Q D P\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f26ef8d5-7828-580a-9328-2eb9a7efd09c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "373344ace997ed1ba22411512014076e5006764b5a4fd12bc0d3c4daabac57a7", "task_path": "tasks/nmp3_f26ef8d5-7828-580a-9328-2eb9a7efd09c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f26ef8d5-7828-580a-9328-2eb9a7efd09c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f27d8381-7bda-5cb1-90fc-9f6ea34cc723", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $x, y, z$, prove that \n-- $$5xyz+\\left(\\sqrt{\\frac{xy+yz+zx}{3}}+\\frac{3(x+y)(y+z)(z+x)}{4(xy+yz+zx)}\\right)^3\\ge 4(x+y)(y+z)(z+x).$$\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nThe source problem asks one to prove, for all strictly positive real numbers\n`x`, `y`, and `z`, the inequality\n\n`5xyz + (sqrt ((xy + yz + zx) / 3) +\n 3 (x + y) (y + z) (z + x) / (4 (xy + yz + zx))) ^ 3\n ≥ 4 (x + y) (y + z) (z + x)`.\n\nThe declarations below record the constituent real-valued expressions and the\nresulting proposition. They do not assert or prove the proposition.\n-/\n\nnamespace Problem\n\n/-- The symmetric sum `xy + yz + zx`, which occurs in the square root and in\nthe denominator. -/\ndef symmetricSum (x y z : ℝ) : ℝ := x * y + y * z + z * x\n\n/-- The product `(x + y)(y + z)(z + x)`, which occurs in the numerator and on\nthe right-hand side. -/\ndef pairProduct (x y z : ℝ) : ℝ := (x + y) * (y + z) * (z + x)\n\n/-- The left-hand side of the stated inequality. -/\nnoncomputable def leftHandSide (x y z : ℝ) : ℝ :=\n 5 * x * y * z +\n (Real.sqrt (symmetricSum x y z / 3) +\n 3 * pairProduct x y z / (4 * symmetricSum x y z)) ^ 3\n\n/-- The right-hand side of the stated inequality. -/\ndef rightHandSide (x y z : ℝ) : ℝ :=\n 4 * pairProduct x y z\n\n/-- The inequality stated in the problem, universally quantified over all\npositive real triples. This is a proposition, not a proof. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n leftHandSide x y z ≥ rightHandSide x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f27d8381-7bda-5cb1-90fc-9f6ea34cc723", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "21ff09d624014c9c0ecd04bf2b819af00b1fec8b0bc2fae9421233bb5c8551bf", "task_path": "tasks/nmp3_f27d8381-7bda-5cb1-90fc-9f6ea34cc723", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f27d8381-7bda-5cb1-90fc-9f6ea34cc723", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f2801544-6972-5bb7-b5d5-db48a36606d8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p,q$ be prime numbers and $m,n$ be positive integers. Prove that the Diophantine equation \n-- \\[(2^p-p^2)(2^q-q^2)=p^m q^n\\]\n-- has no solutions in positive integers.\nimport Mathlib\n\n/-!\n# Formalization of a Diophantine non-existence statement\n\nThe original problem asks, for prime natural numbers `p` and `q` and positive\nnatural numbers `m` and `n`, to prove that\n\n `(2^p - p^2) * (2^q - q^2) = p^m * q^n`\n\nhas no solution. Since `2^p - p^2` is negative for `p = 3`, the equation is\nformalized in the integers.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the Diophantine equation, as an integer. -/\ndef lhs (p q : ℕ) : ℤ :=\n ((2 : ℤ) ^ p - (p : ℤ) ^ 2) * ((2 : ℤ) ^ q - (q : ℤ) ^ 2)\n\n/-- The right-hand side of the Diophantine equation, as an integer. -/\ndef rhs (p q m n : ℕ) : ℤ :=\n (p : ℤ) ^ m * (q : ℤ) ^ n\n\n/-- The equation to be solved, with all four unknowns natural numbers. -/\ndef Equation (p q m n : ℕ) : Prop :=\n lhs p q = rhs p q m n\n\n/--\nFor all primes `p` and `q` and all positive integers `m` and `n`, the\nDiophantine equation has no integer solution.\n-/\ndef Target : Prop :=\n ∀ (p q m n : ℕ),\n Nat.Prime p → Nat.Prime q → 0 < m → 0 < n → ¬ Equation p q m n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f2801544-6972-5bb7-b5d5-db48a36606d8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0c6271f75033c8fa5b12482d346d06b385326409625095ccc48864bc6ef8fff0", "task_path": "tasks/nmp3_f2801544-6972-5bb7-b5d5-db48a36606d8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f2801544-6972-5bb7-b5d5-db48a36606d8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f2a25fc5-8d09-5253-a627-54c4ef665972", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute‑angled triangle. Let $L$ be the foot of the internal bisector of $\\angle B$ on side $AC$. Let $D$ and $E$ be the midpoints of the minor arcs $AB$ and $BC$, respectively, of the circumcircle $\\omega$ of $ABC$. Extend $BD$ beyond $D$ to a point $P$ and extend $BE$ beyond $E$ to a point $Q$ such that $\\angle APB=\\angle CQB=90^\\circ$. Prove that the midpoint of segment $BL$ lies on the line $PQ\\,. $\nimport Mathlib\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the formalization. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The signed twice-area (cross product) of the vectors `B - A` and `X - A`.\nIts sign records on which side of the directed line through `A` and `B` the point `X` lies. -/\ndef cross (A B X : Point) : ℝ :=\n (B 0 - A 0) * (X 1 - A 1) - (B 1 - A 1) * (X 0 - A 0)\n\n/-- `X` lies strictly between the distinct points `A` and `B` on the segment from `A` to `B`. -/\ndef StrictlyBetween (A X B : Point) : Prop :=\n A ≠ B ∧ ∃ t : ℝ, 0 < t ∧ t < 1 ∧ X = (1 - t) • A + t • B\n\n/-- The triangle with vertices `A`, `B`, `C` is acute-angled. -/\ndef AcuteTriangle (A B C : Point) : Prop :=\n A ≠ B ∧\n B ≠ C ∧\n C ≠ A ∧\n EuclideanGeometry.angle B A C < Real.pi / 2 ∧\n EuclideanGeometry.angle A B C < Real.pi / 2 ∧\n EuclideanGeometry.angle A C B < Real.pi / 2\n\n/-- `L` is the point in which the internal angle bisector at `B` meets the side `AC`.\nThe condition that `L` lies in the open segment `AC` selects the internal bisector intersection,\nand the two adjacent angles at `B` are equal. -/\ndef IsInternalAngleBisectorFoot (A B C L : Point) : Prop :=\n StrictlyBetween A L C ∧\n EuclideanGeometry.angle A B L = EuclideanGeometry.angle L B C\n\n/-- `O` is the center and `r` the radius of the circumcircle of the triangle `ABC`. -/\ndef IsCircumcircle (O : Point) (r : ℝ) (A B C : Point) : Prop :=\n 0 < r ∧ dist O A = r ∧ dist O B = r ∧ dist O C = r\n\n/-- `X` lies on the circle with center `O` and radius `r`. -/\ndef OnCircle (O : Point) (r : ℝ) (X : Point) : Prop :=\n dist O X = r\n\n/-- `X` and `Y` lie in the two open half-planes cut by the line through `A` and `B`. -/\ndef StrictlyOppositeSides (A B X Y : Point) : Prop :=\n cross A B X * cross A B Y < 0\n\n/-- `D` is the midpoint of the minor arc `AB` of the circle with center `O` and radius `r`.\nFor a non-diameter chord `AB`, the minor arc is the arc on the side of line `AB` opposite to\nthe center. Thus its midpoint is the circle point on the perpendicular bisector of `AB` and\non the side of `AB` opposite to `O`. -/\ndef IsMidpointOfMinorArc (O : Point) (r : ℝ) (A B D : Point) : Prop :=\n 0 < r ∧\n OnCircle O r A ∧\n OnCircle O r B ∧\n OnCircle O r D ∧\n A ≠ B ∧\n dist D A = dist D B ∧\n StrictlyOppositeSides A B O D\n\n/-- The angle `∠ A P B` is a right angle, with the two rays actually present. -/\ndef RightAngle (A P B : Point) : Prop :=\n A ≠ P ∧ B ≠ P ∧ EuclideanGeometry.angle A P B = Real.pi / 2\n\n/-- The line through the two distinct points `P` and `Q` contains `M`. The\nnondegeneracy `P ≠ Q` is part of the meaning of the phrase \"the line `PQ`\". -/\ndef OnLineThrough (P Q M : Point) : Prop :=\n P ≠ Q ∧ Collinear ℝ ({P, Q, M} : Set Point)\n\n/-- The assertion of the problem: in every acute triangle `ABC`, with the internal angle\nbisector foot `L`, the midpoints `D` and `E` of the indicated minor arcs, and the points `P`\nand `Q` obtained by extending `BD` and `BE` beyond `D` and `E` to right angles at `P` and `Q`,\nthe midpoint of `BL` lies on the line `PQ`. -/\ndef Target : Prop :=\n ∀ (A B C : Point), AcuteTriangle A B C →\n ∀ (L : Point), IsInternalAngleBisectorFoot A B C L →\n ∀ (O : Point) (r : ℝ), IsCircumcircle O r A B C →\n ∀ (D E : Point),\n IsMidpointOfMinorArc O r A B D →\n IsMidpointOfMinorArc O r B C E →\n ∀ (P Q : Point),\n StrictlyBetween B D P →\n StrictlyBetween B E Q →\n RightAngle A P B →\n RightAngle C Q B →\n OnLineThrough P Q (midpoint ℝ B L)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f2a25fc5-8d09-5253-a627-54c4ef665972", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f36aa0dc2057bc06466c2fe073b046627bd8cddca65effd930f2027ecab401ce", "task_path": "tasks/nmp3_f2a25fc5-8d09-5253-a627-54c4ef665972", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f2a25fc5-8d09-5253-a627-54c4ef665972", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f2a556dd-0bac-5a35-8e96-16efc8dcbc76", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle. Prove that \n-- \\[\n-- 3+\\sum_{\\text{cyc}}\\frac{a(a+b-c)}{c\\bigl(c+b-a\\bigr)}\\ge\\sum_{\\text{cyc}}\\frac{a^{2}+b^{2}}{ab}\\,. \n-- \\] \n-- (Here $\\sum_{\\text{cyc}}$ denotes the cyclic sum over $(a,b,c)$.)\nimport Mathlib.Basic.Real.Basic\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The real numbers `a`, `b`, and `c` are the side lengths of a\nnondegenerate triangle. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a < b + c ∧ b < c + a ∧ c < a + b\n\n/-- The cyclic sum of a three-variable expression over `(a, b, c)`,\nnamely `f a b c + f b c a + f c a b`. -/\ndef cyclicSum (f : ℝ → ℝ → ℝ → ℝ) (a b c : ℝ) : ℝ :=\n f a b c + f b c a + f c a b\n\n/-- The summand in the first cyclic sum. -/\ndef leftCyclicTerm (a b c : ℝ) : ℝ :=\n a * (a + b - c) / (c * (c + b - a))\n\n/-- The summand in the second cyclic sum. -/\ndef rightCyclicTerm (a b _c : ℝ) : ℝ :=\n (a ^ 2 + b ^ 2) / (a * b)\n\n/-- The assertion to be proved: for every triple of side lengths of a\nnondegenerate triangle, the stated cyclic inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsTriangleSideLengths a b c →\n 3 + cyclicSum leftCyclicTerm a b c ≥\n cyclicSum rightCyclicTerm a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f2a556dd-0bac-5a35-8e96-16efc8dcbc76", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5bc01870219961d84edca15ca20eaf53beba4be9c147a9a6a1cc90230d3603c7", "task_path": "tasks/nmp3_f2a556dd-0bac-5a35-8e96-16efc8dcbc76", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f2a556dd-0bac-5a35-8e96-16efc8dcbc76", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f2c06f21-5b2b-5574-b3d7-37525991fe0c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- (ab+bc+ca)\\Big(\\frac1{a^2+b^2}+\\frac1{b^2+c^2}+\\frac1{c^2+a^2}\\Big)\\ge\\frac52.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the target inequality\n\nLet `a`, `b`, and `c` be positive real numbers. This file records the\nassertion of the problem as a proposition-valued definition; it does not\nprovide or assume a proof.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`,\n`(ab + bc + ca) * (1/(a² + b²) + 1/(b² + c²) + 1/(c² + a²)) ≥ 5/2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n (a * b + b * c + c * a) *\n (1 / (a ^ 2 + b ^ 2) +\n 1 / (b ^ 2 + c ^ 2) +\n 1 / (c ^ 2 + a ^ 2)) ≥\n (5 : ℝ) / 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f2c06f21-5b2b-5574-b3d7-37525991fe0c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7edac4742c23836d00a1295e98cd78c028a4332603533ee53a645e56f7464d63", "task_path": "tasks/nmp3_f2c06f21-5b2b-5574-b3d7-37525991fe0c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f2c06f21-5b2b-5574-b3d7-37525991fe0c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f2ca8221-14ca-513a-bba5-87082c4af239", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- a^{6}+b^{6}+c^{6}+4\\sum_{\\text{cyc}}a^{5}(b+c)\\;\\ge\\;4\\sum_{\\text{cyc}}a^{3}b^{3}+15a^{2}b^{2}c^{2}.\n-- \\] \n-- (Here $\\displaystyle\\sum_{\\text{cyc}}a^{5}(b+c)=a^{5}(b+c)+b^{5}(c+a)+c^{5}(a+b)$ and $\\displaystyle\\sum_{\\text{cyc}}a^{3}b^{3}=a^{3}b^{3}+b^{3}c^{3}+c^{3}a^{3}$.)\nimport Mathlib\n\n/-!\n# Formalization of the cyclic sixth-degree inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\n\n`a^6 + b^6 + c^6 + 4 * (a^5*(b+c) + b^5*(c+a) + c^5*(a+b))\n >= 4 * (a^3*b^3 + b^3*c^3 + c^3*a^3) + 15*a^2*b^2*c^2`.\n\nThe unproved assertion is packaged as a proposition-valued definition.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum\n`∑_cyc a^5 (b + c) = a^5 (b+c) + b^5 (c+a) + c^5 (a+b)`. -/\ndef cyclicA5MulSum (a b c : ℝ) : ℝ :=\n a ^ 5 * (b + c) + b ^ 5 * (c + a) + c ^ 5 * (a + b)\n\n/-- The cyclic sum\n`∑_cyc a^3 b^3 = a^3 b^3 + b^3 c^3 + c^3 a^3`. -/\ndef cyclicA3B3Sum (a b c : ℝ) : ℝ :=\n a ^ 3 * b ^ 3 + b ^ 3 * c ^ 3 + c ^ 3 * a ^ 3\n\n/-- For all positive real numbers `a`, `b`, and `c`, the stated cyclic\nsixth-degree inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 6 + b ^ 6 + c ^ 6 + 4 * cyclicA5MulSum a b c ≥\n 4 * cyclicA3B3Sum a b c + 15 * a ^ 2 * b ^ 2 * c ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f2ca8221-14ca-513a-bba5-87082c4af239", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "84b7068d65c36d9ed8bc83a8b1bce73ae597cb8ff9b0e01e63df0e66a99c69d9", "task_path": "tasks/nmp3_f2ca8221-14ca-513a-bba5-87082c4af239", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f2ca8221-14ca-513a-bba5-87082c4af239", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f3399cbe-6166-52db-9ee9-57bf3a5574ac", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be a finite group and let $p$ be a prime dividing $|G|$. Suppose the map $\\phi\\colon G\\to G$ defined by $\\phi(x)=x^{p}$ is a group homomorphism. Prove that $G$ has a nontrivial center.\nimport Mathlib.Data.Fintype.Card\nimport Mathlib.Data.Nat.Prime.Basic\nimport Mathlib.GroupTheory.Subgroup.Center\n\n/-!\n# Nontrivial center from a power-map homomorphism\n\nLet `G` be a finite group and let `p` be a prime dividing `|G|`.\nIf the map `x ↦ x ^ p` from `G` to itself is a group homomorphism,\nthen `G` has a nontrivial center.\n-/\n\nuniverse u\n\nnamespace Problem\n\n/-- The map `x ↦ x ^ p` on a group. -/\ndef powMap (G : Type u) [Group G] (p : ℕ) : G → G :=\n fun x => x ^ p\n\n/-- The assertion that the power map `x ↦ x ^ p` preserves multiplication. -/\ndef IsPowerMapHom (G : Type u) [Group G] (p : ℕ) : Prop :=\n ∀ x y : G, powMap G p (x * y) = powMap G p x * powMap G p y\n\n/-- The assertion that the center of a group contains a nonidentity element. -/\ndef HasNontrivialCenter (G : Type u) [Group G] : Prop :=\n ∃ z : G, z ≠ 1 ∧ z ∈ Subgroup.center G\n\n/-- The formal statement of the problem.\n\nFor every finite group `G` and every natural number `p`, if `p` is prime,\n`p` divides the cardinality of `G`, and the power map `x ↦ x ^ p` is a group\nhomomorphism, then the center of `G` contains a nonidentity element. -/\ndef Target : Prop :=\n ∀ (G : Type u) [Group G] [Fintype G] (p : ℕ),\n p.Prime → p ∣ Fintype.card G → IsPowerMapHom G p → HasNontrivialCenter G\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f3399cbe-6166-52db-9ee9-57bf3a5574ac", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c2ebfe0326b001d6596275ee12601a94580c9c73e854dcc06a8df54b036fe096", "task_path": "tasks/nmp3_f3399cbe-6166-52db-9ee9-57bf3a5574ac", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f3399cbe-6166-52db-9ee9-57bf3a5574ac", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f341be61-56f2-544e-8baa-cb05c6f7ca9c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^{2}+b^{2}+c^{2}=1$. Prove that \n-- \\[\n-- \\frac{bc}{a^{2}+1}+\\frac{ca}{b^{2}+1}+\\frac{ab}{c^{2}+1}\\le \\frac34\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The strict positivity assumptions on the three variables. -/\ndef Positive (a b c : ℝ) : Prop :=\n (0 : ℝ) < a ∧ (0 : ℝ) < b ∧ (0 : ℝ) < c\n\n/-- The normalization assumption that the sum of the three squares is one. -/\ndef Normalized (a b c : ℝ) : Prop :=\n a ^ 2 + b ^ 2 + c ^ 2 = (1 : ℝ)\n\n/-- The complete hypotheses of the problem: positivity and normalization. -/\ndef Admissible (a b c : ℝ) : Prop :=\n Positive a b c ∧ Normalized a b c\n\n/-- The inequality asserted in the problem, for arbitrary real `a`, `b`, and `c`. -/\ndef Claim (a b c : ℝ) : Prop :=\n (b * c) / (a ^ 2 + (1 : ℝ)) + (c * a) / (b ^ 2 + (1 : ℝ)) +\n (a * b) / (c ^ 2 + (1 : ℝ)) ≤ (3 : ℝ) / (4 : ℝ)\n\n/-- The complete assertion of the problem: for every real triple satisfying the\nstated positivity and normalization conditions, the claimed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Claim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f341be61-56f2-544e-8baa-cb05c6f7ca9c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "381c1446c9c175ccb4c262a37a2fe6e3756e3c79d8903497a7096db5b90580a6", "task_path": "tasks/nmp3_f341be61-56f2-544e-8baa-cb05c6f7ca9c", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f341be61-56f2-544e-8baa-cb05c6f7ca9c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f35aa368-1e5e-5248-bc59-30f812326b6b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In triangle $ABC$, let $h_a$ be the altitude from $A$, $m_b$ be the median from $B$, and $t_c$ be the length of the internal angle bisector from $C$. Prove that \n-- $$h_a+m_b+t_c\\le\\frac{\\sqrt3}{2}\\,(a+b+c),$$ \n-- where $a,b,c$ are the side lengths opposite $A,B,C$, respectively.\nimport Mathlib\n\n/-!\n# Formalization of the triangle inequality problem\n\nWe model the Euclidean plane by explicit Cartesian coordinates. A triangle is\ngiven by three non-collinear points. All geometric quantities appearing in the\nproblem are defined directly from the vertices.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A point of the Euclidean plane, represented by Cartesian coordinates. -/\nstructure Point where\n x : ℝ\n y : ℝ\n\n/-- The Euclidean distance between two points of the plane. -/\ndef distance (P Q : Point) : ℝ :=\n Real.sqrt ((P.x - Q.x) ^ 2 + (P.y - Q.y) ^ 2)\n\n/-- The signed twice-area determinant of the ordered triple `(A, B, C)`.\n\nEquivalently, this is the two-dimensional cross product of the vectors `B - A`\nand `C - A`. Its absolute value is the area of the parallelogram spanned by\nthose vectors. -/\ndef cross (A B C : Point) : ℝ :=\n (B.x - A.x) * (C.y - A.y) - (B.y - A.y) * (C.x - A.x)\n\n/-- The three points are non-collinear, i.e. they form a genuine triangle. -/\ndef Noncollinear (A B C : Point) : Prop :=\n cross A B C ≠ 0\n\n/-- The side length opposite `A`, namely `|BC|`. -/\ndef sideA (_A B C : Point) : ℝ :=\n distance B C\n\n/-- The side length opposite `B`, namely `|CA|`. -/\ndef sideB (A _B C : Point) : ℝ :=\n distance C A\n\n/-- The side length opposite `C`, namely `|AB|`. -/\ndef sideC (A B _C : Point) : ℝ :=\n distance A B\n\n/-- The altitude from `A` to the line `BC`, expressed as the perpendicular\ndistance from `A` to that line. It equals twice the area of triangle `ABC`\ndivided by `|BC|`. -/\ndef altitudeFromA (A B C : Point) : ℝ :=\n |cross A B C| / sideA A B C\n\n/-- The midpoint of the segment joining `P` and `Q`. -/\ndef midpoint (P Q : Point) : Point :=\n ⟨(P.x + Q.x) / 2, (P.y + Q.y) / 2⟩\n\n/-- The length of the median from `B` to the midpoint of `AC`. -/\ndef medianFromB (A B C : Point) : ℝ :=\n distance B (midpoint A C)\n\n/-- The point where the internal angle bisector from `C` meets the side `AB`.\n\nBy the internal angle-bisector theorem, this point divides `AB` in the ratio\n`|AC| : |BC| = b : a`; hence its barycentric coordinates are\n`a / (a + b)` for `A` and `b / (a + b)` for `B`. -/\ndef angleBisectorFootFromC (A B C : Point) : Point :=\n let a := sideA A B C\n let b := sideB A B C\n ⟨(a / (a + b)) * A.x + (b / (a + b)) * B.x,\n (a / (a + b)) * A.y + (b / (a + b)) * B.y⟩\n\n/-- The length of the internal angle bisector from `C`. -/\ndef angleBisectorLengthFromC (A B C : Point) : ℝ :=\n distance C (angleBisectorFootFromC A B C)\n\n/-- The inequality asserted in the problem:\n`h_a + m_b + t_c ≤ (√3 / 2) (a + b + c)`, for every non-degenerate triangle\n`ABC`. -/\ndef Target : Prop :=\n ∀ A B C : Point,\n Noncollinear A B C →\n altitudeFromA A B C + medianFromB A B C + angleBisectorLengthFromC A B C\n ≤ (Real.sqrt 3 / 2) * (sideA A B C + sideB A B C + sideC A B C)\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f35aa368-1e5e-5248-bc59-30f812326b6b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7f609a11785295db5dd39f5f0f2bae3f81406d794c00f5d4c79db84578d7735e", "task_path": "tasks/nmp3_f35aa368-1e5e-5248-bc59-30f812326b6b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f35aa368-1e5e-5248-bc59-30f812326b6b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f36863f0-d2ea-5a46-b50e-5175f1c202da", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ and $k$ be positive integers. Prove that if $p=60k+7$ is a prime factor of $10^{2n}+8\\cdot10^{n}+1$, then $n$ and $k$ are even.\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe problem asks: for positive integers `n` and `k`, if the number\n`p = 60 * k + 7` is prime and divides\n`10 ^ (2 * n) + 8 * 10 ^ n + 1`, then both `n` and `k` are even.\n\nAll arithmetic in the source is integer arithmetic on positive integers.\nThis file records only the statement as a proposition; no proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The candidate prime `p` determined by the positive integer `k`. -/\ndef p (k : ℕ) : ℕ := 60 * k + 7\n\n/-- The integer whose prime factors occur in the problem. -/\ndef expression (n : ℕ) : ℕ := 10 ^ (2 * n) + 8 * 10 ^ n + 1\n\n/-- The complete assertion of the problem.\n\nFor all positive integers `n` and `k`, if `60 * k + 7` is prime and divides\n`10 ^ (2 * n) + 8 * 10 ^ n + 1`, then `n` and `k` are both even. -/\ndef Target : Prop :=\n ∀ n k : ℕ,\n 0 < n →\n 0 < k →\n Nat.Prime (p k) →\n p k ∣ expression n →\n Even n ∧ Even k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f36863f0-d2ea-5a46-b50e-5175f1c202da", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2a32088e0968abf5c934ee64afc14abe14bb9fc308b56914b0a63a3da92725fe", "task_path": "tasks/nmp3_f36863f0-d2ea-5a46-b50e-5175f1c202da", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f36863f0-d2ea-5a46-b50e-5175f1c202da", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f36d7a6a-72a3-56d0-8956-2d09399fecea", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 3$ be an integer. The $n^{2}$ cards labeled $1,2,\\dots ,n^{2}$ are placed in any order into $n$ boxes, each box containing exactly $n$ cards. An operation consists of selecting two boxes, removing any two cards from each of the selected boxes, and then swapping the two cards taken from one box with the two cards taken from the other box (so each box receives the two cards removed from the other). Prove that, regardless of the initial arrangement, there exists a finite sequence of such operations after which each box contains $n$ consecutive integers.\nimport Mathlib\n\n/-!\n# Formal statement of the card-swapping problem\n\nThe labels `1, ..., n^2` are represented by natural numbers, and the contents\nof a box are represented by a finite set of labels. An arrangement is a\npartition of the label set `{1, ..., n^2}` into `n` boxes, each of cardinality\n`n`. An operation replaces two selected boxes by two finite sets, obtained by\nremoving a two-element subset from each and exchanging those subsets.\n-/\n\nnamespace Problem\n\n/-- The set of labels occurring in the problem: `{1, 2, ..., n^2}`. -/\ndef CardSet (n : ℕ) : Finset ℕ :=\n Finset.Icc 1 (n ^ 2)\n\n/-- A block of `n` consecutive integers beginning at `start`. -/\ndef ConsecutiveBlock (n start : ℕ) : Finset ℕ :=\n Finset.Icc start (start + n - 1)\n\n/-- An arrangement is a partition of the label set into `n` boxes of size `n`. -/\ndef IsArrangement (n : ℕ) (boxes : Fin n → Finset ℕ) : Prop :=\n (∀ i : Fin n, boxes i ⊆ CardSet n) ∧\n (∀ i : Fin n, (boxes i).card = n) ∧\n (∀ i j : Fin n, i ≠ j → Disjoint (boxes i) (boxes j)) ∧\n (Finset.univ.biUnion boxes = CardSet n)\n\n/-- Every box contains `n` consecutive integers (possibly starting at different\nplaces in different boxes). -/\ndef IsConsecutiveArrangement (n : ℕ) (boxes : Fin n → Finset ℕ) : Prop :=\n ∀ i : Fin n, ∃ start : ℕ, boxes i = ConsecutiveBlock n start\n\n/-- One operation: choose two different boxes, remove a two-card subset from\neach, and exchange the two subsets. The definitions of the two selected boxes\nare changed; all other boxes are unchanged. -/\ndef Operation (n : ℕ) (before after : Fin n → Finset ℕ) : Prop :=\n ∃ i j : Fin n, ∃ A B : Finset ℕ,\n i ≠ j ∧\n A ⊆ before i ∧ A.card = 2 ∧\n B ⊆ before j ∧ B.card = 2 ∧\n after i = (before i \\ A) ∪ B ∧\n after j = (before j \\ B) ∪ A ∧\n (∀ k : Fin n, k ≠ i → k ≠ j → after k = before k)\n\n/-- The assertion of the problem: for every integer `n ≥ 3`, from every\narrangement of the labels `1, ..., n^2` into `n` boxes of size `n`, some finite\nsequence of operations reaches an arrangement in which every box consists of\n`n` consecutive integers. -/\ndef Target : Prop :=\n ∀ n : ℕ, 3 ≤ n →\n ∀ initial : Fin n → Finset ℕ,\n IsArrangement n initial →\n ∃ final : Fin n → Finset ℕ,\n IsArrangement n final ∧\n IsConsecutiveArrangement n final ∧\n Relation.ReflTransGen (Operation n) initial final\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f36d7a6a-72a3-56d0-8956-2d09399fecea", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b7a45d3af8d5f78b4937718a3d80786aa806364c57ca13bc51294d7fa40ba1fb", "task_path": "tasks/nmp3_f36d7a6a-72a3-56d0-8956-2d09399fecea", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f36d7a6a-72a3-56d0-8956-2d09399fecea", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f3727e07-29b3-52fe-9468-f3ff46863c9a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers such that $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{a(a+b)}+\\frac{1}{b(b+c)}+\\frac{1}{c(c+a)}\\ge\\frac32\\,,\n-- \\] \n-- with equality when $a=b=c=1$.\nimport Mathlib\n\n/-!\n# Formalization of an inequality with the constraint abc = 1\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwith `a * b * c = 1`, that\n\n`1 / (a * (a + b)) + 1 / (b * (b + c)) + 1 / (c * (c + a)) ≥ 3 / 2`,\n\nand that equality holds at `a = b = c = 1`.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side appearing in the problem. -/\ndef LHS (a b c : ℝ) : ℝ :=\n 1 / (a * (a + b)) + 1 / (b * (b + c)) + 1 / (c * (c + a))\n\n/-- The admissibility conditions imposed on the real numbers in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The universal inequality assertion in the problem. -/\ndef Inequality : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c →\n LHS a b c ≥ (3 : ℝ) / 2\n\n/-- The stated equality instance, obtained when `a = b = c = 1`. -/\ndef EqualityAtUnitTriple : Prop :=\n LHS 1 1 1 = (3 : ℝ) / 2\n\n/-- The complete assertion asked for in the source problem: the inequality under\nthe stated hypotheses, together with the stated equality instance at `(1, 1, 1)`. -/\ndef Target : Prop :=\n Inequality ∧ EqualityAtUnitTriple\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f3727e07-29b3-52fe-9468-f3ff46863c9a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ac505e08fa2ab5cf39b218fc4f98ff9a4d12c9e794b338d908deb76a7751f28e", "task_path": "tasks/nmp3_f3727e07-29b3-52fe-9468-f3ff46863c9a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f3727e07-29b3-52fe-9468-f3ff46863c9a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f3998965-2ddf-5df0-8fcc-ea4bc4885eec", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $d$ be a positive integer. Prove that for every integer $k$ there exist a positive integer $n$ and signs $a_1,a_2,\\dots,a_n\\in\\{1,-1\\}$ such that \n-- \\[\n-- k = a_1(1+d)^2 + a_2(1+2d)^2 + \\cdots + a_n(1+nd)^2.\n-- \\]\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThe problem asks: for every positive integer `d` and every integer `k`, there are a\npositive integer `n` and signs `a_1, ..., a_n ∈ {1, -1}` such that\n`k = ∑_{i=1}^n a_i (1 + i d)^2`.\n-/\n\nnamespace Problem\n\n/-- The square factor `(1 + j*d)^2`, where `j` is the integer index from `1` to `n`. -/\ndef squareTerm (d j : ℤ) : ℤ :=\n (1 + j * d) ^ 2\n\n/-- A sequence of signs, each entry being either `1` or `-1`. -/\ndef IsSignSequence {n : ℕ} (a : Fin n → ℤ) : Prop :=\n ∀ i : Fin n, a i = 1 ∨ a i = -1\n\n/--\n`admissible d k` says that `k` has the required signed sum representation for the\npositive integer parameter `d`.\n-/\ndef admissible (d k : ℤ) : Prop :=\n ∃ n : ℕ, 0 < n ∧ ∃ a : Fin n → ℤ,\n IsSignSequence a ∧\n k = ∑ i : Fin n, a i * squareTerm d (((i : ℕ) : ℤ) + 1)\n\n/-- The assertion of the problem: every integer is representable for every `d > 0`. -/\ndef Target : Prop :=\n ∀ d : ℤ, 0 < d → ∀ k : ℤ, admissible d k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f3998965-2ddf-5df0-8fcc-ea4bc4885eec", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fc8890cc244e6d592cf17ca472ea678e633b6c037bd98d66f8e87d2c2d9645e7", "task_path": "tasks/nmp3_f3998965-2ddf-5df0-8fcc-ea4bc4885eec", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f3998965-2ddf-5df0-8fcc-ea4bc4885eec", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f3a04fa4-b1fe-5c6c-b362-e54f25d2619c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $\\theta$ be an angle in the interval $(0,\\pi/2)$. Suppose $\\cos\\theta$ is irrational, and there exists a positive integer $k$ such that both $\\cos(k\\theta)$ and $\\cos((k+1)\\theta)$ are rational. Prove that $\\theta = \\pi/6$.\nimport Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic\nimport Mathlib.NumberTheory.Real.Irrational\n\n/-!\n# Formal statement of the trigonometric rationality problem\n\nThe source problem asks us to prove that the stated hypotheses force `θ = π / 6`.\nThis file records the precise statement as a proposition-valued definition. No proof\nof the proposition is supplied here.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- A real number is rational when it is the image of a rational number. -/\ndef IsRational (x : ℝ) : Prop :=\n ∃ q : ℚ, x = (q : ℝ)\n\n/--\nThe hypotheses imposed on the real angle `θ` by the problem.\n\nThe angle is measured in radians by the real trigonometric functions. The first two\nconjuncts say `0 < θ < π / 2`. The third says that `cos θ` is irrational. The final\nconjunct says that there is a positive natural number `k` for which both\n`cos (k θ)` and `cos ((k + 1) θ)` are rational. Natural-number arguments are cast to\nreal numbers before multiplication by `θ`.\n-/\ndef AngleHypotheses (θ : ℝ) : Prop :=\n 0 < θ ∧\n θ < Real.pi / 2 ∧\n Irrational (Real.cos θ) ∧\n ∃ k : ℕ,\n 0 < k ∧\n IsRational (Real.cos ((k : ℝ) * θ)) ∧\n IsRational (Real.cos ((((k + 1 : ℕ) : ℝ) * θ)))\n\n/-- The full assertion of the problem, with all quantifiers and hypotheses explicit. -/\ndef Target : Prop :=\n ∀ θ : ℝ, AngleHypotheses θ → θ = Real.pi / 6\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f3a04fa4-b1fe-5c6c-b362-e54f25d2619c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1d8d6941b4f34f4f645b065c12110079b74788dfbf120159b4c085fb8e604397", "task_path": "tasks/nmp3_f3a04fa4-b1fe-5c6c-b362-e54f25d2619c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f3a04fa4-b1fe-5c6c-b362-e54f25d2619c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f3b41ebe-d40f-5e53-a3ac-e5b52ae21ceb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 3$ guests meet at a party. Some pairs of guests know each other. Assume there is **no** set of four distinct guests $a,b,c,d$ such that the pairs $\\{a,b\\},\\{b,c\\},\\{c,d\\},\\{d,a\\}$ are all pairs of acquaintances while the pairs $\\{a,c\\},\\{b,d\\}$ are **not** acquaintances. A non‑empty set $X$ of guests is called an *ingroup* if any two guests in $X$ know each other and there is no guest outside $X$ who knows every guest in $X$. Prove that the number of ingroups is at most $\\displaystyle\\frac{n(n-1)}2$.\nimport Mathlib\n\n/-!\n# Formalization of the party-ingroup problem\n\nThe acquaintance relation is represented by a `SimpleGraph`: an undirected,\nloopless graph. The hypothesis of the problem says that the graph has no\ninduced cycle on four vertices. An ingroup is a nonempty clique which cannot\nbe extended by any outside vertex adjacent to all of its members. The target\nasserts that a finite graph with `n` vertices and no induced four-cycle has at\nmost `n * (n - 1) / 2` such ingroups.\n-/\n\nuniverse u\n\nnamespace Problem\n\n/-- A graph has no induced cycle on four distinct vertices. The four cycle\nedges `a-b`, `b-c`, `c-d`, and `d-a` are present, while the two diagonals\n`a-c` and `b-d` are absent. -/\ndef IsInducedC4Free {V : Type u} (G : SimpleGraph V) : Prop :=\n ¬ ∃ a b c d : V,\n a ≠ b ∧ a ≠ c ∧ a ≠ d ∧ b ≠ c ∧ b ≠ d ∧ c ≠ d ∧\n G.Adj a b ∧ G.Adj b c ∧ G.Adj c d ∧ G.Adj d a ∧\n ¬ G.Adj a c ∧ ¬ G.Adj b d\n\n/-- A finite set of vertices is a clique when every two distinct members are\nadjacent. -/\ndef IsClique {V : Type u} (G : SimpleGraph V) (X : Finset V) : Prop :=\n ∀ x : V, x ∈ X → ∀ y : V, y ∈ X → x ≠ y → G.Adj x y\n\n/-- An ingroup is a nonempty clique `X` with no outside vertex adjacent to\nevery member of `X`. -/\ndef IsIngroup {V : Type u} (G : SimpleGraph V) (X : Finset V) : Prop :=\n X.Nonempty ∧ IsClique G X ∧\n ∀ v : V, v ∉ X → ¬ ∀ x : V, x ∈ X → G.Adj v x\n\n/-- The number of ingroups of a finite graph. It is the cardinality of the\nsubtype of all finite vertex sets satisfying `IsIngroup`. -/\nnoncomputable def numberOfIngroups {V : Type u} [Fintype V]\n (G : SimpleGraph V) : ℕ := by\n classical\n exact Fintype.card {X : Finset V // IsIngroup G X}\n\n/-- The bound assertion for a fixed number `n` of guests. -/\ndef TargetFor (n : ℕ) : Prop :=\n ∀ (V : Type u) [Fintype V], ∀ G : SimpleGraph V,\n Fintype.card V = n → IsInducedC4Free G →\n numberOfIngroups G ≤ n * (n - 1) / 2\n\n/-- The complete assertion: for every `n ≥ 3`, every finite simple graph on\nexactly `n` vertices with no induced four-cycle has at most `n * (n - 1) / 2`\ningroups. -/\ndef Target : Prop :=\n ∀ n : ℕ, 3 ≤ n → TargetFor.{u} n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f3b41ebe-d40f-5e53-a3ac-e5b52ae21ceb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e7dfe9267d393cfbd8cb5145395d190e0c80d98e281a3a030ac36e28d9b6a087", "task_path": "tasks/nmp3_f3b41ebe-d40f-5e53-a3ac-e5b52ae21ceb", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f3b41ebe-d40f-5e53-a3ac-e5b52ae21ceb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f3dbef94-0c1c-544d-94f3-616b08209ed3", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an acute triangle with $\\angle A>60^\\circ$, and let $H$ be its orthocenter. \n-- Points $M\\in AB$ and $N\\in AC$ satisfy $\\angle HMB=\\angle HNC=60^\\circ$. \n-- Let $O$ be the circumcenter of $\\triangle HMN$. \n-- Let $D$ be a point on the same side of $BC$ as $A$ such that $\\triangle DBC$ is equilateral. \n-- Prove that the points $H$, $O$, and $D$ are collinear.\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.Convex.Side\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Geometry.Euclidean.Circumcenter\nimport Mathlib.Geometry.Euclidean.MongePoint\nimport Mathlib.Geometry.Euclidean.Simplex\n\n/-!\n# Statement formalization: a collinearity of an orthocenter, a circumcenter, and\n# an equilateral-triangle vertex\n\nThis file records the proposition of the problem, not a proof of it. The\nEuclidean plane is represented by `EuclideanSpace ℝ (Fin 2)`. The vertices of\nthe given triangle `ABC` are represented by the three points of a bundled\n`Affine.Triangle`; this makes the usual nondegeneracy of a triangle an explicit\npart of the representation. The auxiliary predicates below likewise state\nthat `HMN` and `DBC` are (nondegenerate) triangles when the problem speaks of\ntheir circumcenter or of being equilateral.\n-/\n\nnamespace Problem\n\n/-- The ambient Euclidean plane used throughout the statement. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `O` is the circumcenter of the triangle with vertices `X`, `Y`, and `Z`.\n\nThe existential bundled triangle records that the three points are affinely\nindependent and that `O` is the circumcenter of the unique bundled triangle\nwith those three vertices. -/\ndef IsCircumcenter (X Y Z O : Point) : Prop :=\n ∃ t : Affine.Triangle ℝ Point,\n t.points 0 = X ∧ t.points 1 = Y ∧ t.points 2 = Z ∧\n t.circumcenter = O\n\n/-- The triangle with vertices `X`, `Y`, and `Z` is equilateral.\n\nThe existential bundled triangle records the usual nondegenerate meaning of\n\"triangle\"; its `Equilateral` field says that all three side lengths are equal. -/\ndef IsEquilateralTriangle (X Y Z : Point) : Prop :=\n ∃ t : Affine.Triangle ℝ Point,\n t.points 0 = X ∧ t.points 1 = Y ∧ t.points 2 = Z ∧\n t.Equilateral\n\n/-- The main proposition of the problem.\n\n`ABC` is represented by a bundled triangle `t`, with\n`A = t.points 0`, `B = t.points 1`, and `C = t.points 2`. The proposition is\nuniversally quantified over every such acute triangle, every point `H` that is\nits orthocenter, every pair of points `M` and `N` on the respective segments\nover `AB` and `AC` satisfying the two sixty-degree angle conditions, every\ncircumcenter `O` of triangle `HMN`, and every point `D` on the same side of\n`BC` as `A` for which triangle `DBC` is equilateral. Its conclusion is that\n`H`, `O`, and `D` are collinear. The body of `Target` is the assertion itself;\nno proof is supplied here. -/\ndef Target : Prop :=\n ∀ (t : Affine.Triangle ℝ Point) (H M N O D : Point),\n t.AcuteAngled →\n Real.pi / 3 < EuclideanGeometry.angle (t.points 1) (t.points 0) (t.points 2) →\n H = t.orthocenter →\n M ∈ segment ℝ (t.points 0) (t.points 1) →\n N ∈ segment ℝ (t.points 0) (t.points 2) →\n EuclideanGeometry.angle H M (t.points 1) = Real.pi / 3 →\n EuclideanGeometry.angle H N (t.points 2) = Real.pi / 3 →\n IsCircumcenter H M N O →\n (affineSpan ℝ ({t.points 1, t.points 2} : Set Point)).SSameSide (t.points 0) D →\n IsEquilateralTriangle D (t.points 1) (t.points 2) →\n Collinear ℝ ({H, O, D} : Set Point)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f3dbef94-0c1c-544d-94f3-616b08209ed3", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e1a0693a16af78aec17ae8757e09d15526291c98ba2ccc525677bfb246cf5c79", "task_path": "tasks/nmp3_f3dbef94-0c1c-544d-94f3-616b08209ed3", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f3dbef94-0c1c-544d-94f3-616b08209ed3", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f3e31a57-8863-5832-9475-049653915f0a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Define \\(f(n)=\\tau(n!)-\\tau((n-1)!)\\) for each natural number \\(n\\), where \\(\\tau(k)\\) denotes the number of positive divisors of \\(k\\). Prove that there exist infinitely many composite integers \\(n\\) such that \\(f(m)0$ with $n\\ge2$. Prove that \n-- \\[\n-- \\biggl(\\sum_{i=1}^n x_i\\biggr)\\!\\biggl(\\sum_{i=1}^n\\frac1{x_i}\\biggr)-n^2\n-- \\;\\ge\\;(n-1)^2\\Biggl[\\sum_{i=1}^n\\frac{x_i}{\\displaystyle\\sum_{j\\neq i}x_j}\n-- -\\frac{n}{\\,n-1\\,}\\Biggr]\\;\\ge\\;0\\,.\n-- \\] \n-- (Here $\\displaystyle\\sum_{i=1}^n\\frac{x_i}{\\sum_{j\\neq i}x_j}$ is the cyclic sum $\\frac{x_1}{x_2+\\cdots+x_n}+\\frac{x_2}{x_1+x_3+\\cdots+x_n}+\\dots+\\frac{x_n}{x_1+\\cdots+x_{n-1}}$.)\nimport Mathlib\n\n/-!\n# Formalization of a cyclic sum inequality\n\nThis file states the inequality from the problem. The target is represented as a\nproposition-valued definition; no proof of the inequality is supplied here.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum\n`∑ i, x i / (∑ j ≠ i, x j)` appearing in the statement. -/\nnoncomputable def cyclicSum (n : ℕ) (x : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, x i / (∑ j ∈ Finset.univ.erase i, x j)\n\n/-- The left-hand inequality of the displayed chain: the difference of the two\nproducts is at least `(n - 1)^2` times the normalized cyclic sum difference. -/\ndef firstInequality (n : ℕ) (x : Fin n → ℝ) : Prop :=\n (∑ i : Fin n, x i) * (∑ i : Fin n, (1 : ℝ) / x i) - (n : ℝ) ^ 2 ≥\n ((n : ℝ) - 1) ^ 2 * (cyclicSum n x - (n : ℝ) / ((n : ℝ) - 1))\n\n/-- The right-hand inequality of the displayed chain: the normalized cyclic sum\ndifference is nonnegative. -/\ndef secondInequality (n : ℕ) (x : Fin n → ℝ) : Prop :=\n ((n : ℝ) - 1) ^ 2 * (cyclicSum n x - (n : ℝ) / ((n : ℝ) - 1)) ≥ 0\n\n/-- The complete assertion of the problem: for every integer `n ≥ 2` and every\npositive real tuple `x : Fin n → ℝ`, both inequalities in the displayed chain\nhold. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (x : Fin n → ℝ),\n 2 ≤ n →\n (∀ i : Fin n, 0 < x i) →\n firstInequality n x ∧ secondInequality n x\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f4218241-9c76-5855-8531-d9ce8cab3cd4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c4cd5f67d2c4a9873bd9b66f68c30ec08dea8e0744322df0dcfafe388faa1c90", "task_path": "tasks/nmp3_f4218241-9c76-5855-8531-d9ce8cab3cd4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f4218241-9c76-5855-8531-d9ce8cab3cd4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f437a466-7cab-57ed-bdea-ca36c8c685f5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $P$ be the set of all prime numbers and let $M\\subseteq P$ be a non‑empty set of primes. Assume that for every non‑empty finite subset $\\{p_1,p_2,\\dots ,p_k\\}\\subseteq M$ (the $p_i$ are distinct), all prime divisors of $p_1p_2\\cdots p_k+1$ also belong to $M$. Prove that $M=P$.\n/-\nFormalization of the statement of the problem.\n\nSource problem: Let P be the set of all prime numbers and let M ⊆ P be a\nnon-empty set of primes. Assume that for every non-empty finite subset\n{p_1, p_2, ..., p_k} ⊆ M (the p_i are distinct), all prime divisors of\np_1 p_2 ... p_k + 1 also belong to M. Prove that M = P.\n\nThis file only states the target proposition; it deliberately contains no\nproof of it.\n-/\n\nimport Mathlib.Data.Nat.Prime.Basic\nimport Mathlib.Algebra.BigOperators.Group.Finset.Basic\n\nnamespace Problem\n\n/-- `P`, the set of all prime numbers, viewed as a subset of `ℕ`. -/\ndef PrimeSet : Set ℕ := {p : ℕ | Nat.Prime p}\n\n/-- For a finite subset `s = {p₁, ..., pₖ}` of `ℕ`, the natural number\n`p₁ p₂ ⋯ pₖ + 1`. -/\ndef prodPlusOne (s : Finset ℕ) : ℕ :=\n (s.prod (fun p : ℕ => p)) + 1\n\n/-- The hypothesis that `M` is closed under prime divisors of `p₁ p₂ ⋯ pₖ + 1`\nfor every non-empty finite subset `{p₁, ..., pₖ}` of `M` with distinct elements.\n\nThe finite subset is represented by a `Finset ℕ` (finite, unordered, and\nduplicate-free), and non-emptiness is `s.Nonempty`. The product\n`p₁ ⋯ pₖ` is `s.prod (fun p => p)`, and `Problem.prodPlusOne s` is that\nproduct plus one; `q` ranges over the prime divisors of this number. -/\ndef PrimeDivisorClosure (M : Set ℕ) : Prop :=\n ∀ s : Finset ℕ, s.Nonempty → (∀ p : ℕ, p ∈ s → p ∈ M) →\n ∀ q : ℕ, Nat.Prime q → q ∣ prodPlusOne s → q ∈ M\n\n/-- Admissibility of `M`: it is a subset of the set of all primes, it is\nnon-empty, and it satisfies the finite-product closure hypothesis. -/\ndef Admissible (M : Set ℕ) : Prop :=\n M ⊆ PrimeSet ∧ M.Nonempty ∧ PrimeDivisorClosure M\n\n/-- The assertion to be proved for a fixed admissible set `M`: `M = P`. -/\ndef TargetFor (M : Set ℕ) : Prop :=\n Admissible M → M = PrimeSet\n\n/-- The full assertion of the problem: every set of primes that is non-empty\nand satisfies the stated finite-product closure condition is the set of all\nprimes. -/\ndef Target : Prop :=\n ∀ M : Set ℕ, TargetFor M\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f437a466-7cab-57ed-bdea-ca36c8c685f5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "49d544798f892f57f2ffa5c8fd8bb85f04ade6d6fa9433f9c79024f95c054a5e", "task_path": "tasks/nmp3_f437a466-7cab-57ed-bdea-ca36c8c685f5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f437a466-7cab-57ed-bdea-ca36c8c685f5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f449ee53-ee48-5eb1-a731-abf8ac5d8392", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In an acute‑angled triangle $ABC$ (so $03$, and suppose that \n-- \n-- \\[\n-- a_1+a_2+\\cdots+a_{2n}=4n .\n-- \\]\n-- \n-- Prove that there exists a non‑empty subset of these numbers whose sum equals $2n$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The set `{1, 2, ..., 2n - 1}` of permitted integer values, written as a\npredicate on integers. -/\ndef InAllowedValueSet (n : ℕ) (x : ℤ) : Prop :=\n 1 ≤ x ∧ x ≤ 2 * (n : ℤ) - 1\n\n/-- Every one of the `2n` indexed entries lies in `{1, 2, ..., 2n - 1}`. -/\ndef EntriesInAllowedSet (n : ℕ) (a : Fin (2 * n) → ℤ) : Prop :=\n ∀ i : Fin (2 * n), InAllowedValueSet n (a i)\n\n/-- The sum of all `2n` indexed entries is `4n`. -/\ndef TotalSumIsFourN (n : ℕ) (a : Fin (2 * n) → ℤ) : Prop :=\n ∑ i : Fin (2 * n), a i = 4 * (n : ℤ)\n\n/-- Admissibility of the sequence of `2n` integers: every entry lies in\n`{1, 2, ..., 2n - 1}` and the sum of all entries is `4n`. -/\ndef Admissible (n : ℕ) (a : Fin (2 * n) → ℤ) : Prop :=\n EntriesInAllowedSet n a ∧ TotalSumIsFourN n a\n\n/-- There is a nonempty subset of the indexed entries whose sum is `2n`.\nThe elements of the finite set are term positions, so repeated values at\ndifferent positions are distinct selectable occurrences. -/\ndef HasNonemptySubsetSum (n : ℕ) (a : Fin (2 * n) → ℤ) : Prop :=\n ∃ S : Finset (Fin (2 * n)),\n S.Nonempty ∧ (∑ i ∈ S, a i = 2 * (n : ℤ))\n\n/-- The statement of the problem: for every natural number `n > 3` and every\nadmissible sequence of `2n` integers, some nonempty subset of the entries has\nsum `2n`. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 3 < n → ∀ (a : Fin (2 * n) → ℤ),\n Admissible n a → HasNonemptySubsetSum n a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f492bf3e-29b6-52ba-834b-67c8e995f40f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9b22812f2bc7d21aff849ba32a90ac89abd7922bf68814fbec4cb24aa958286e", "task_path": "tasks/nmp3_f492bf3e-29b6-52ba-834b-67c8e995f40f", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f492bf3e-29b6-52ba-834b-67c8e995f40f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f49433bf-4371-5bc5-bad1-7dca40145a00", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a+b+c=1$. Prove that \n-- \\[\n-- \\frac{a}{a+b^{2}}+\\frac{b}{b+c^{2}}+\\frac{c}{c+a^{2}}\\le\\frac14\\Bigl(\\frac1a+\\frac1b+\\frac1c\\Bigr)\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypotheses that `a`, `b`, and `c` are positive real numbers with sum one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = 1\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a / (a + b ^ 2) + b / (b + c ^ 2) + c / (c + a ^ 2)\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rhs (a b c : ℝ) : ℝ :=\n (1 / 4 : ℝ) * (1 / a + 1 / b + 1 / c)\n\n/-- The asserted inequality for fixed values of `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ rhs a b c\n\n/-- The complete statement: for all positive real numbers `a`, `b`, and `c`\nwhose sum is one, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f49433bf-4371-5bc5-bad1-7dca40145a00", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "95e6e14cd77ace608c238edd9f5ae721599451da6a207d8e6b391ad1d3474365", "task_path": "tasks/nmp3_f49433bf-4371-5bc5-bad1-7dca40145a00", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f49433bf-4371-5bc5-bad1-7dca40145a00", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f4fca5e8-d638-50fc-9d75-789dd04ab9f8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A$ be the $n\\times n$ matrix whose $(i,j)$‑entry is the $(i-1)$‑th derivative of $\\cos(jx)$ with respect to $x$, i.e. \n-- $$A_{i,j}= \\frac{d^{\\,i-1}}{dx^{\\,i-1}}\\cos(jx),\\qquad i,j=1,2,\\dots,n.$$\n-- Prove that $\\det A\\neq0$ for every positive integer $n\\,. $\nimport Mathlib.Analysis.Calculus.IteratedDeriv.Defs\nimport Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic\nimport Mathlib.LinearAlgebra.Matrix.Determinant.Basic\n\n/-!\n# Formalization of the Wronskian determinant problem\n\nThe `(i,j)`-entry of the matrix is the `(i-1)`-th derivative, with respect to `x`,\nof the function `x ↦ cos (j*x)`. Since no point of evaluation is supplied, the\nentries are functions of `x`, and the determinant is taken in the pointwise ring\nof real-valued functions. Thus `det A ≠ 0` means that the determinant function\nis not identically zero.\n-/\n\nnamespace Problem\n\n/-- The real-valued function `x ↦ cos(j*x)`, where `j` is represented by a\nzero-based `Fin n` index and the original column number is `j + 1`. -/\nnoncomputable def cosineFunction {n : ℕ} (j : Fin n) : ℝ → ℝ :=\n fun x : ℝ => Real.cos (((j : ℕ) + 1 : ℝ) * x)\n\n/-- The `(i,j)`-entry of the matrix, as a function of `x`: the `i`-th iterated\nderivative of `x ↦ cos((j+1)*x)`. The zero-based index `i` corresponds to the\noriginal row number `i+1` and the derivative order `i`. -/\nnoncomputable def matrixEntry {n : ℕ} (i j : Fin n) : ℝ → ℝ :=\n fun x : ℝ => iteratedDeriv (i : ℕ) (cosineFunction j) x\n\n/-- The `n × n` matrix `A` from the problem, with entries in the pointwise ring\nof functions `ℝ → ℝ`. -/\nnoncomputable def A (n : ℕ) : Matrix (Fin n) (Fin n) (ℝ → ℝ) :=\n fun i j => matrixEntry i j\n\n/-- The assertion that for every positive integer `n`, the determinant of `A`\nis nonzero in the pointwise ring of real-valued functions, equivalently the\ndeterminant function is not identically zero. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → Matrix.det (A n) ≠ (0 : ℝ → ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f4fca5e8-d638-50fc-9d75-789dd04ab9f8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7a89b25117c4295c4c34b89edc7697dc4b9c71598e8cdf88f33cbb6349c74cca", "task_path": "tasks/nmp3_f4fca5e8-d638-50fc-9d75-789dd04ab9f8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f4fca5e8-d638-50fc-9d75-789dd04ab9f8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f51b5b0b-2daa-52a5-8d62-b7bfc344df04", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that \n-- \\[\n-- \\cos x\\cos y+\\cos y\\cos z+\\cos z\\cos x\\;\\ge\\;2\\sqrt{\\cos x\\cos y\\cos z\\bigl(1+\\cos x\\cos y\\cos z\\bigr)},\n-- \\]\n-- where $x,\\;y,\\;z$ are the angles of an acute‑angled triangle (i.e. $00$ and $a+b>c$, $b+c>a$, $c+a>b$). Prove that for every real $t\\ge 1$,\n-- \\[\n-- (t+1)(a^3b+b^3c+c^3a)\\;\\ge\\;ab^3+bc^3+ca^3\\;+\\;t\\,abc\\,(a+b+c)\\,. \n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The assertion that positive real numbers `a`, `b`, and `c` are the side\nlengths of a (nondegenerate) triangle. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The inequality stated in the problem: for all positive real triangle side\nlengths `a`, `b`, `c` and every real `t ≥ 1`,\n`(t + 1) (a^3 b + b^3 c + c^3 a) ≥\n a b^3 + b c^3 + c a^3 + t a b c (a + b + c)`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n IsTriangleSideLengths a b c →\n ∀ (t : ℝ),\n 1 ≤ t →\n (t + 1) * (a ^ 3 * b + b ^ 3 * c + c ^ 3 * a) ≥\n a * b ^ 3 + b * c ^ 3 + c * a ^ 3 +\n t * a * b * c * (a + b + c)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f52d770f-2165-50e6-a428-b994fd407676", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5175e2ae91a3f6e043f268645bc9aeeb0e770720337cda15b668f31d29742635", "task_path": "tasks/nmp3_f52d770f-2165-50e6-a428-b994fd407676", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f52d770f-2165-50e6-a428-b994fd407676", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f5454860-d45f-5393-886f-8dc7c3fdf8a4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z \\in \\mathbb{R}^+$ such that $xyz=1$. Prove that \n-- \\[\n-- (xy^3+yz^3+zx^3)^2 \\ge 3\\,(x^2+y^2+z^2)\\,.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the inequality stated in `problem.md`.\n\nThe original problem asks to prove that for all positive real numbers\n`x y z` satisfying `x y z = 1`,\n`(x y^3 + y z^3 + z x^3)^2 ≥ 3 (x^2 + y^2 + z^2)`.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real `x`, `y`, and `z`\nsubject to `x * y * z = 1`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x →\n 0 < y →\n 0 < z →\n x * y * z = 1 →\n (x * y ^ 3 + y * z ^ 3 + z * x ^ 3) ^ 2 ≥\n 3 * (x ^ 2 + y ^ 2 + z ^ 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f5454860-d45f-5393-886f-8dc7c3fdf8a4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4afa5e11824c93bdb9689c6d905118f42796c4fa90add67330a72a52c140c3ea", "task_path": "tasks/nmp3_f5454860-d45f-5393-886f-8dc7c3fdf8a4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f5454860-d45f-5393-886f-8dc7c3fdf8a4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f56fa9a1-8d39-5032-8cf8-171938363723", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\;\\ge\\;3\\sqrt[4]{\\frac{a^{3}+b^{3}+c^{3}}{3abc}}\\;.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The hypothesis that the three variables are positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The principal real fourth root, represented using real exponentiation. -/\nnoncomputable def fourthRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 4 : ℝ)\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def leftHandSide (a b c : ℝ) : ℝ :=\n a / b + b / c + c / a\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def rightHandSide (a b c : ℝ) : ℝ :=\n 3 * fourthRoot ((a ^ 3 + b ^ 3 + c ^ 3) / (3 * a * b * c))\n\n/-- The asserted inequality for a single triple of real numbers. -/\nnoncomputable def Inequality (a b c : ℝ) : Prop :=\n leftHandSide a b c ≥ rightHandSide a b c\n\n/-- The complete statement: for all positive real numbers `a`, `b`, and `c`,\nthe given inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, PositiveTriple a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f56fa9a1-8d39-5032-8cf8-171938363723", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9f59456f8d4cf29c3b1ffa8db0fcfaa60de53a1f646d32908c95f24b335ebf79", "task_path": "tasks/nmp3_f56fa9a1-8d39-5032-8cf8-171938363723", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f56fa9a1-8d39-5032-8cf8-171938363723", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f57a3cc8-e82b-5bcd-b727-af1a6e0c83e7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\;\\ge\\;\\frac{a^{2}+b^{2}+c^{2}}{(a+b+c)^{2}}\\Biggl(8+\\frac{a^{2}+b^{2}+c^{2}}{ab+bc+ca}\\Biggr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the stated cyclic inequality\n\nThe source problem asks one to prove, for positive real numbers `a`, `b`, and `c`,\nthe cyclic inequality\n\n`a / b + b / c + c / a ≥\n (a^2 + b^2 + c^2) / (a + b + c)^2 *\n (8 + (a^2 + b^2 + c^2) / (a * b + b * c + c * a))`.\n\nThis file only records the mathematical assertion as a proposition. No proof is\nprovided.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a / b + b / c + c / a\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n ((a ^ 2 + b ^ 2 + c ^ 2) / (a + b + c) ^ 2) *\n (8 + (a ^ 2 + b ^ 2 + c ^ 2) / (a * b + b * c + c * a))\n\n/-- The asserted inequality for a fixed triple of real numbers. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LHS a b c ≥ RHS a b c\n\n/-- The full statement to be proved: the inequality holds for all positive reals. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f57a3cc8-e82b-5bcd-b727-af1a6e0c83e7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "36ebdc97767dff7cecc72a8c904a499d3fb5c4d96dd3c88f6e236a09c0b1cd14", "task_path": "tasks/nmp3_f57a3cc8-e82b-5bcd-b727-af1a6e0c83e7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f57a3cc8-e82b-5bcd-b727-af1a6e0c83e7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f594e889-1ef4-5594-973d-26401affb3c7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb{R}$. Prove that \n-- \\[\n-- 5\\bigl(a^{4}+b^{4}+c^{4}\\bigr)+7\\bigl(a^{3}b+b^{3}c+c^{3}a\\bigr)\\ge0.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the statement in `problem.md`.\n\nThe problem asks to prove a universal real inequality. In accordance with the\nformalization task, the assertion is represented as a proposition-valued\ndefinition rather than as a theorem with a proof.\n-/\n\nnamespace Problem\n\n/-- The inequality asserted in the problem for all real triples `(a, b, c)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ 5 * (a ^ 4 + b ^ 4 + c ^ 4)\n + 7 * (a ^ 3 * b + b ^ 3 * c + c ^ 3 * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f594e889-1ef4-5594-973d-26401affb3c7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4aa135cdfce4a5235431e118255586a379f3e75a37e1bab3baea03fb6b165d30", "task_path": "tasks/nmp3_f594e889-1ef4-5594-973d-26401affb3c7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f594e889-1ef4-5594-973d-26401affb3c7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f59f2b03-b4eb-5b49-bf4e-5f94163efbdd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $ab+bc+ca=3$. Prove that \n-- \\[\n-- \\frac{a^3}{b^2+3}+\\frac{b^3}{c^2+3}+\\frac{c^3}{a^2+3}\\ge\\frac34\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nLet `a, b, c > 0` be real numbers satisfying `a*b + b*c + c*a = 3`.\nProve the cyclic inequality\n`a^3 / (b^2 + 3) + b^3 / (c^2 + 3) + c^3 / (a^2 + 3) ≥ 3/4`.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved: for all positive real numbers `a`, `b`, and `c`\nsatisfying `a*b + b*c + c*a = 3`, the stated cyclic sum is at least `3/4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n a * b + b * c + c * a = 3 →\n (a ^ 3) / (b ^ 2 + 3) +\n (b ^ 3) / (c ^ 2 + 3) +\n (c ^ 3) / (a ^ 2 + 3) ≥\n (3 : ℝ) / 4\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f59f2b03-b4eb-5b49-bf4e-5f94163efbdd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "cd30c2c584caa4791a0127e710f0e9c3498f065c18f2202591e3ef4217855e05", "task_path": "tasks/nmp3_f59f2b03-b4eb-5b49-bf4e-5f94163efbdd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f59f2b03-b4eb-5b49-bf4e-5f94163efbdd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f5fd853a-5a4b-5ea7-ab3b-d30b9a390af9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers \\(a,b,c\\),\n-- \n-- \\[\n-- \\sum_{cyc}\\frac{1}{b^{2}+c^{2}+a(b+c)}\\;\\ge\\;\\frac{3(a+b+c)^{2}}{4\\,(a^{2}+b^{2}+c^{2})\\,(ab+bc+ca)}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of a cyclic denominator inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\nthe inequality\n`∑_cyc 1 / (b^2 + c^2 + a * (b + c)) ≥\n 3 * (a + b + c)^2 / (4 * (a^2 + b^2 + c^2) * (ab + bc + ca))`.\n\nNo proof is supplied here: `Problem.Target` is the proposition to be proved.\n-/\n\nnamespace Problem\n\n/-- The cyclic sum\n`1 / (b^2 + c^2 + a * (b + c)) +\n 1 / (c^2 + a^2 + b * (c + a)) +\n 1 / (a^2 + b^2 + c * (a + b))`.\n-/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n 1 / (b ^ 2 + c ^ 2 + a * (b + c)) +\n 1 / (c ^ 2 + a ^ 2 + b * (c + a)) +\n 1 / (a ^ 2 + b ^ 2 + c * (a + b))\n\n/-- The formal target: for every triple of positive real numbers, the cyclic sum\nis at least\n`3 * (a + b + c)^2 / (4 * (a^2 + b^2 + c^2) * (ab + bc + ca))`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n CyclicSum a b c ≥\n 3 * (a + b + c) ^ 2 /\n (4 * (a ^ 2 + b ^ 2 + c ^ 2) * (a * b + b * c + c * a))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f5fd853a-5a4b-5ea7-ab3b-d30b9a390af9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bf21e61f42bf1a6d5dcf1c2dca88cb8bca47e09505c7e7031fd4675feae00b0a", "task_path": "tasks/nmp3_f5fd853a-5a4b-5ea7-ab3b-d30b9a390af9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f5fd853a-5a4b-5ea7-ab3b-d30b9a390af9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f5ff1ea3-85ad-51af-a77f-a335ec4ddc65", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- An equilateral triangle $\\Delta$ of side length $L>0$ is given. Inside $\\Delta$ are drawn $n$ unit equilateral triangles (side length $1$) whose interiors are pairwise non‑overlapping, whose sides are parallel to those of $\\Delta$, and whose orientation is opposite to that of $\\Delta$ (i.e. they point “downward’’ if $\\Delta$ points “upward’’). Prove that \n-- \\[\n-- n\\;\\le\\;\\frac{2}{3}\\,L^{2}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the equilateral-triangle packing problem\n\nThe original problem asks for a bound on the number of pairwise\ninterior-disjoint, downward-pointing unit equilateral triangles contained in\nan upward-pointing equilateral triangle of side length `L`.\n-/\n\nnamespace Problem\n\n/-- Points of the Euclidean plane, with the standard Euclidean norm. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A triangle is represented by its three vertices. Its geometric region is\nthe convex hull of those vertices. -/\nstructure Triangle where\n a : Point\n b : Point\n c : Point\n\n/-- The closed triangular region determined by the three vertices. -/\nnoncomputable def Triangle.region (T : Triangle) : Set Point :=\n convexHull ℝ ({T.a, T.b, T.c} : Set Point)\n\n/-- A triangle has all three side lengths equal to `L`. Nondegeneracy follows\nfrom `L > 0` in the target statement. -/\ndef IsEquilateral (T : Triangle) (L : ℝ) : Prop :=\n dist T.a T.b = L ∧ dist T.b T.c = L ∧ dist T.c T.a = L\n\n/-- The image of a triangle under the map `x ↦ t + r • x`. We only use the\ncase `r = -1 / L`. Since `L > 0`, its absolute value scales side lengths from\n`L` to `1`; multiplication by the nonzero scalar preserves all side lines; and\nthe negative sign swaps the two pointing classes of an equilateral triangle. -/\ndef Triangle.affineScale (T : Triangle) (t : Point) (r : ℝ) : Triangle where\n a := t + r • T.a\n b := t + r • T.b\n c := t + r • T.c\n\n/-- The canonical downward unit triangle associated with `T` and a translation\n`t`, obtained by the central inversion `x ↦ -x`, scaling by `1 / L`, and\ntranslation by `t`. -/\nnoncomputable def downwardUnitTriangle (T : Triangle) (L : ℝ) (t : Point) : Triangle :=\n T.affineScale t (-(1 / L))\n\n/-- A triangle is a downward-pointing, side-parallel unit copy of the\nreference triangle `T` iff its closed region is the region of some\n`downwardUnitTriangle T L t`. Comparing regions rather than vertex lists makes\nthis independent of the arbitrary ordering of a triangle's vertices. Under\nthe hypothesis that `T` is equilateral of side `L > 0`, this is exactly the\nclass of opposite-oriented unit equilateral triangles whose sides are parallel\nto those of `T`. -/\ndef IsDownwardUnitCopy (T : Triangle) (L : ℝ) (S : Triangle) : Prop :=\n ∃ t : Point, Triangle.region S = Triangle.region (downwardUnitTriangle T L t)\n\n/-- The interiors of the members of a finite family of triangles are pairwise\ndisjoint. -/\ndef PairwiseInteriorDisjoint {n : ℕ} (S : Fin n → Triangle) : Prop :=\n ∀ i j : Fin n, i ≠ j →\n Disjoint (interior (Triangle.region (S i))) (interior (Triangle.region (S j)))\n\n/-- Admissibility of an arrangement: every member is a unit equilateral\ndownward copy of `Δ` with sides parallel to `Δ`, every member lies inside the\nclosed region of `Δ`, and interiors are pairwise disjoint. -/\ndef IsAdmissibleArrangement (Δ : Triangle) (L : ℝ) (n : ℕ)\n (S : Fin n → Triangle) : Prop :=\n (∀ i : Fin n, IsEquilateral (S i) 1) ∧\n (∀ i : Fin n, IsDownwardUnitCopy Δ L (S i)) ∧\n (∀ i : Fin n, Triangle.region (S i) ⊆ Triangle.region Δ) ∧\n PairwiseInteriorDisjoint S\n\n/-- The assertion of the problem: for every positive real `L`, every\nequilateral reference triangle `Δ` of side length `L`, and every admissible\narrangement of `n` downward unit equilateral triangles, one has\n`n ≤ (2 / 3) * L^2`. -/\ndef Target : Prop :=\n ∀ (L : ℝ), 0 < L →\n ∀ (Δ : Triangle), IsEquilateral Δ L →\n ∀ (n : ℕ) (S : Fin n → Triangle),\n IsAdmissibleArrangement Δ L n S →\n (n : ℝ) ≤ (2 / 3 : ℝ) * L ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f5ff1ea3-85ad-51af-a77f-a335ec4ddc65", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6e99aede0b3ccddd9f7e8f94eb6fcd474c5a4e10d9051fc59c0961f12331caea", "task_path": "tasks/nmp3_f5ff1ea3-85ad-51af-a77f-a335ec4ddc65", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f5ff1ea3-85ad-51af-a77f-a335ec4ddc65", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f60354c3-b009-5546-84fb-b10116bd74fd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A frog starts at the integer 1 on the number line. If the frog is at an integer $n$, let $m_n$ be the exponent such that $2^{m_n}$ is the largest power of 2 dividing $n$ (i.e. $m_n=v_2(n)$). From $n$ the frog may jump either to $n+1$ or to $n+2^{\\,m_n+1}$. For integers $k\\ge2$ and $i\\ge0$, let $f(n)$ denote the minimum number of jumps required to reach $n$ from 1. Prove that \n-- $$f(2^{\\,i}k)\\;>\\;f(2^{\\,i}).$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The 2-adic exponent `m_n = v₂(n)`, represented on integers. -/\ndef frogExponent (n : ℤ) : ℕ := padicValInt 2 n\n\n/-- The defining property of `frogExponent`: for nonzero `n`, the exponent gives\nthe largest power of `2` dividing `n`. -/\nlemma two_pow_frogExponent_dvd (n : ℤ) :\n (2 : ℤ) ^ frogExponent n ∣ n :=\n padicValInt_dvd n\n\nlemma two_pow_frogExponent_succ_not_dvd {n : ℤ} (hn : n ≠ 0) :\n ¬ (2 : ℤ) ^ (frogExponent n + 1) ∣ n := by\n have hiff : (2 : ℤ) ^ (frogExponent n + 1) ∣ n ↔\n n = 0 ∨ frogExponent n + 1 ≤ frogExponent n := by\n simpa [frogExponent] using\n (padicValInt_dvd_iff_of_ne_one (p := 2) (by norm_num)\n (frogExponent n + 1) n)\n intro h\n rcases hiff.mp h with hzero | hle\n · exact hn hzero\n · omega\n\n/-- One legal jump of the frog from `n` to `m`. -/\ndef frogJump (n m : ℤ) : Prop :=\n m = n + 1 ∨ m = n + (2 : ℤ) ^ (frogExponent n + 1)\n\n/-- `reachesIn n steps` means that the frog can get from `1` to `n` in exactly\n`steps` jumps. -/\ninductive reachesIn : ℤ → ℕ → Prop where\n | start : reachesIn 1 0\n | step {n m : ℤ} {steps : ℕ} :\n reachesIn n steps → frogJump n m → reachesIn m (steps + 1)\n\nlemma frogJump_pos {n m : ℤ} (hn : 0 < n) (h : frogJump n m) : 0 < m := by\n rcases h with h | h\n · rw [h]\n omega\n · rw [h]\n have hp : (0 : ℤ) < (2 : ℤ) ^ (frogExponent n + 1) := by positivity\n omega\n\nlemma reachesIn_pos {n : ℤ} {steps : ℕ} (h : reachesIn n steps) : 0 < n := by\n induction h with\n | start => norm_num\n | step hreach hjump ih => exact frogJump_pos ih hjump\n\nlemma existsReachesIn_nat_add_one (d : ℕ) :\n ∃ steps, reachesIn ((d : ℤ) + 1) steps := by\n induction d with\n | zero =>\n exact ⟨0, by simpa using reachesIn.start⟩\n | succ d ih =>\n obtain ⟨steps, hsteps⟩ := ih\n refine ⟨steps + 1, ?_⟩\n apply reachesIn.step hsteps\n left\n norm_num\n\nlemma existsReachesIn_of_one_le {n : ℤ} (hn : 1 ≤ n) :\n ∃ steps, reachesIn n steps := by\n obtain ⟨d, hd⟩ : ∃ d : ℕ, n = (d : ℤ) + 1 := by\n refine ⟨Int.toNat (n - 1), ?_⟩\n have hnon : (0 : ℤ) ≤ n - 1 := by omega\n have hcast : ((Int.toNat (n - 1) : ℕ) : ℤ) = n - 1 :=\n Int.toNat_of_nonneg hnon\n omega\n rw [hd]\n exact existsReachesIn_nat_add_one d\n\nlemma existsReachesIn_of_pos {n : ℤ} (hn : 0 < n) :\n ∃ steps, reachesIn n steps :=\n existsReachesIn_of_one_le (by omega)\n\nlemma reachable_iff_pos (n : ℤ) :\n (∃ steps, reachesIn n steps) ↔ 0 < n := by\n constructor\n · rintro ⟨steps, hsteps⟩\n exact reachesIn_pos hsteps\n · intro hn\n exact existsReachesIn_of_pos hn\n\n/-- The positive integers, which are exactly the integers reachable from `1`. -/\nabbrev PositiveInt : Type := {n : ℤ // 0 < n}\n\n/-- The minimum number of jumps needed to reach `n` from `1`. -/\nnoncomputable def frogDistance (n : PositiveInt) : ℕ := by\n classical\n exact Nat.find (existsReachesIn_of_pos n.property)\n\n/-- `frogDistance n` is attained by a legal path and is no larger than any\nlegal path length. -/\nlemma frogDistance_spec (n : PositiveInt) :\n reachesIn (n : ℤ) (frogDistance n) ∧\n ∀ steps : ℕ, reachesIn (n : ℤ) steps → frogDistance n ≤ steps := by\n classical\n unfold frogDistance\n constructor\n · exact Nat.find_spec (existsReachesIn_of_pos n.property)\n · intro steps hsteps\n exact Nat.find_min' (existsReachesIn_of_pos n.property) hsteps\n\n/-- `2 ^ i` for a nonnegative integer exponent `i`, realized as a repeated\ninteger multiplication via `i.toNat`. -/\ndef twoPow (i : ℤ) (_hi : 0 ≤ i) : ℤ :=\n (2 : ℤ) ^ i.toNat\n\nlemma twoPow_pos (i : ℤ) (hi : 0 ≤ i) : 0 < twoPow i hi := by\n unfold twoPow\n positivity\n\nlemma twoPow_mul_pos {k : ℤ} (i : ℤ) (hi : 0 ≤ i) (hk : 2 ≤ k) :\n 0 < twoPow i hi * k := by\n have h2 : 0 < twoPow i hi := twoPow_pos i hi\n have hk0 : (0 : ℤ) < k := by omega\n exact mul_pos h2 hk0\n\nlemma toNat_cast_eq_of_nonneg {i : ℤ} (hi : 0 ≤ i) :\n (i.toNat : ℤ) = i :=\n Int.toNat_of_nonneg hi\n\nlemma twoPow_eq_pow_toNat {i : ℤ} (hi : 0 ≤ i) :\n twoPow i hi = (2 : ℤ) ^ i.toNat := rfl\n\n/-- The original assertion, for all integers `k ≥ 2` and all `i ≥ 0`:\n`f(2^i * k) > f(2^i)`. -/\ndef Target : Prop :=\n ∀ (k i : ℤ) (hk : 2 ≤ k) (hi : 0 ≤ i),\n frogDistance ⟨twoPow i hi * k, twoPow_mul_pos i hi hk⟩ >\n frogDistance ⟨twoPow i hi, twoPow_pos i hi⟩\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f60354c3-b009-5546-84fb-b10116bd74fd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e19f60391b87636192be15b31eab17d7eb1714d469691763826fbdb78663c222", "task_path": "tasks/nmp3_f60354c3-b009-5546-84fb-b10116bd74fd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f60354c3-b009-5546-84fb-b10116bd74fd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f61cb4ea-2546-5189-a040-3d984ffc1a78", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\in\\mathbb{R}^+$ . Prove that \n-- \\[\n-- \\left(\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a}\\right)^{2}\\ge (a+b+c)\\left(\\frac1a+\\frac1b+\\frac1c\\right)+\\frac{(a-b)^{2}}{ab+bc+ca}\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The notation `ℝ⁺` in the source problem is interpreted as the strictly\npositive real numbers. -/\ndef IsPositiveReal (x : ℝ) : Prop :=\n 0 < x\n\n/--\nLet `a b c : ℝ` be strictly positive. This proposition is the inequality\nstated in the source problem:\n`(a / b + b / c + c / a)^2 ≥\n (a + b + c) * (1 / a + 1 / b + 1 / c) +\n (a - b)^2 / (a * b + b * c + c * a)`.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n IsPositiveReal a → IsPositiveReal b → IsPositiveReal c →\n (a / b + b / c + c / a) ^ 2 ≥\n (a + b + c) * (1 / a + 1 / b + 1 / c) +\n (a - b) ^ 2 / (a * b + b * c + c * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f61cb4ea-2546-5189-a040-3d984ffc1a78", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "06efca075ed62ab60d6df79f84765be672fa401e7997c366720ce86afef2b03b", "task_path": "tasks/nmp3_f61cb4ea-2546-5189-a040-3d984ffc1a78", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f61cb4ea-2546-5189-a040-3d984ffc1a78", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f64100ce-b11e-55d0-a2ef-1b1585c05b1e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all continuous functions $f:\\mathbb R\\to\\mathbb R$ such that $f(x+f(x))=f(x)$ for all $x\\in\\mathbb R$.\nimport Mathlib.Basic.Real.Basic\nimport Mathlib.Topology.MetricSpace.Pseudo.Lemmas\n\n/-!\n# Formalization of the functional-equation classification problem\n\nThe source problem asks for every continuous real-valued function `f` on `ℝ`\nsatisfying `f (x + f x) = f x` for every real `x`.\n\n`Admissible` records exactly the hypotheses of the problem. `IsCompleteAnswer`\nis the correctness predicate for a proposed classification: it requires both\nthat every function satisfying the proposed classification is admissible and\nthat every admissible function satisfies the proposed classification.\n`Target` applies this to the candidate answer consisting of all constant\nfunctions. No proof of `Target` is supplied here; this file only formalizes the\nmathematical assertion.\n-/\n\nnamespace Problem\n\n/-- A continuous function `f : ℝ → ℝ` is admissible when it satisfies\n`f (x + f x) = f x` for every real number `x`. -/\ndef Admissible (f : ℝ → ℝ) : Prop :=\n Continuous f ∧ ∀ x : ℝ, f (x + f x) = f x\n\n/-- The proposed answer predicate: `f` is a constant real-valued function. -/\ndef IsConstantFunction (f : ℝ → ℝ) : Prop :=\n ∃ c : ℝ, ∀ x : ℝ, f x = c\n\n/-- A predicate on real-valued functions is a complete answer when it holds\nexactly for the admissible functions. The two implications are kept explicit\nto represent both directions of the requested classification. -/\ndef IsCompleteAnswer (P : (ℝ → ℝ) → Prop) : Prop :=\n (∀ f : ℝ → ℝ, P f → Admissible f) ∧\n (∀ f : ℝ → ℝ, Admissible f → P f)\n\n/-- The formal target: the complete answer to the problem is precisely the\nclass of constant real-valued functions. -/\ndef Target : Prop :=\n IsCompleteAnswer IsConstantFunction\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f64100ce-b11e-55d0-a2ef-1b1585c05b1e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "218f59183b37b0639e85566f25f5716465cbb30738d2019c0489d342d9b520d1", "task_path": "tasks/nmp3_f64100ce-b11e-55d0-a2ef-1b1585c05b1e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f64100ce-b11e-55d0-a2ef-1b1585c05b1e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f6499f77-b6ac-5ab3-a80c-10802432cb67", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sum_{cyc}\\Bigg(\\frac{a}{a+b}+\\frac{b}{b+c}\\Bigg)\\Bigg(\\frac{b}{b+c}+\\frac{c}{c+a}\\Bigg)\\le \n-- \\frac{(a+b+c)^2}{ab+bc+ca}\\, .\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the cyclic rational inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\n\n`∑_cyc ((a/(a+b) + b/(b+c)) * (b/(b+c) + c/(c+a)))\n ≤ (a+b+c)^2/(ab+bc+ca)`.\n\nThe standard cyclic sum over `(a,b,c)` is made explicit below as the sum of the\nterms obtained by the cyclic substitutions `(a,b,c)`, `(b,c,a)`, and `(c,a,b)`.\n-/\n\nnamespace Problem\n\n/-- One cyclic summand of the displayed inequality. -/\nnoncomputable def cyclicTerm (a b c : ℝ) : ℝ :=\n (a / (a + b) + b / (b + c)) * (b / (b + c) + c / (c + a))\n\n/-- The three-term cyclic sum over `(a,b,c)`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The assertion from the problem: for all positive real `a`, `b`, and `c`,\nthe cyclic sum is at most `(a+b+c)^2/(ab+bc+ca)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n cyclicSum a b c ≤ (a + b + c) ^ 2 / (a * b + b * c + c * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6499f77-b6ac-5ab3-a80c-10802432cb67", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1b88a6e55bbc17a065fae906ebe20c2bbf591b2b798684674f8af64f1862d042", "task_path": "tasks/nmp3_f6499f77-b6ac-5ab3-a80c-10802432cb67", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6499f77-b6ac-5ab3-a80c-10802432cb67", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f64af212-a75e-53fe-9a45-104c854b00ed", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $1+x+x^2+\\cdots+x^{n-1}=F(x)G(x)$, where $n>1$ and $F(x),G(x)$ are polynomials whose coefficients are only $0$ or $1$. Prove that one of the polynomials $F$ or $G$ can be written as \n-- \\[\n-- (1+x+x^2+\\cdots+x^{k-1})\\,T(x),\n-- \\]\n-- where $k>1$ and $T(x)$ also has coefficients only $0$ or $1$.\nimport Mathlib.Algebra.Polynomial.Basic\n\n/-!\n# Formal statement of the polynomial factorization problem\n\nThe source problem asks: if\n`1 + x + ... + x^(n-1) = F(x)G(x)` with `n > 1` and if `F` and `G`\nhave coefficients only `0` or `1`, then at least one of `F` and `G` has a\nfactor `1 + x + ... + x^(k-1)` with `k > 1`, where the remaining factor `T`\nalso has coefficients only `0` or `1`.\n\nThe coefficient ring is represented by `ℕ`, since the permitted\ncoefficients are exactly the natural numbers `0` and `1`.\n-/\n\nnamespace Problem\n\n/-- A polynomial over `ℕ` has coefficients only `0` or `1`. -/\ndef HasZeroOneCoefficients (p : Polynomial ℕ) : Prop :=\n ∀ i : ℕ, p.coeff i = 0 ∨ p.coeff i = 1\n\n/-- The polynomial `1 + x + ... + x^(n-1)`, as a finite sum. -/\nnoncomputable def geometricSum (n : ℕ) : Polynomial ℕ :=\n ∑ i ∈ Finset.range n, Polynomial.X ^ i\n\n/--\nThe assertion that `p` has a factor of the form\n`1 + x + ... + x^(k-1)`, with `k > 1`, whose cofactor `T` also has\ncoefficients only `0` or `1`.\n-/\ndef HasGeometricFactorWithZeroOneCofactor (p : Polynomial ℕ) : Prop :=\n ∃ (k : ℕ) (T : Polynomial ℕ),\n 1 < k ∧ HasZeroOneCoefficients T ∧ p = geometricSum k * T\n\n/--\nThe complete assertion of the problem: for every natural number `n > 1` and\nevery pair of `{0,1}`-coefficient polynomials `F`, `G` satisfying\n`1 + x + ... + x^(n-1) = F(x)G(x)`, at least one of `F`, `G` has a\n`{0,1}`-coefficient cofactor after a geometric-sum factor with exponent\nparameter `k > 1`.\n-/\ndef Target : Prop :=\n ∀ (n : ℕ) (F G : Polynomial ℕ),\n 1 < n →\n HasZeroOneCoefficients F →\n HasZeroOneCoefficients G →\n geometricSum n = F * G →\n HasGeometricFactorWithZeroOneCofactor F ∨\n HasGeometricFactorWithZeroOneCofactor G\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f64af212-a75e-53fe-9a45-104c854b00ed", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a8e74fc27783a77e8367b278a68bf481ee8744bf13f2a690959229aee7db8ea3", "task_path": "tasks/nmp3_f64af212-a75e-53fe-9a45-104c854b00ed", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f64af212-a75e-53fe-9a45-104c854b00ed", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f66f4bea-2dd6-5c14-ba26-678640dc39e5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that \n-- \\[\n-- \\frac1a+\\frac1b+\\frac1c=\\frac32 .\n-- \\] \n-- Prove that \n-- \\[\n-- \\frac{ab}{c}+\\frac{bc}{a}+\\frac{ca}{b}+3\\;\\ge\\;\n-- \\sqrt{a^2+b^2+1}+\\sqrt{b^2+c^2+1}+\\sqrt{c^2+a^2+1}.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formalization of the stated inequality problem\n\nThe source problem asks to prove, for positive real numbers `a`, `b`, and `c`\nwhose reciprocals sum to `3 / 2`, the inequality\n\n`ab/c + bc/a + ca/b + 3 ≥ sqrt(a^2 + b^2 + 1) + sqrt(b^2 + c^2 + 1) + sqrt(c^2 + a^2 + 1)`.\n\nThis file records only the statement. In particular, `Problem.Target` is a\ndefinition of a proposition and is not supplied with a proof.\n-/\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The three variables of the problem are positive real numbers. -/\ndef PositiveTriple (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The reciprocal-sum constraint from the problem. -/\ndef ReciprocalSumEqThreeHalves (a b c : ℝ) : Prop :=\n (1 : ℝ) / a + (1 : ℝ) / b + (1 : ℝ) / c = (3 : ℝ) / 2\n\n/-- Admissibility conditions imposed on `a`, `b`, and `c` in the problem. -/\ndef Admissible (a b c : ℝ) : Prop :=\n PositiveTriple a b c ∧ ReciprocalSumEqThreeHalves a b c\n\n/-- The left-hand side of the asserted inequality. -/\ndef LeftHandSide (a b c : ℝ) : ℝ :=\n a * b / c + b * c / a + c * a / b + 3\n\n/-- The right-hand side of the asserted inequality. -/\ndef RightHandSide (a b c : ℝ) : ℝ :=\n Real.sqrt (a ^ 2 + b ^ 2 + 1) +\n Real.sqrt (b ^ 2 + c ^ 2 + 1) +\n Real.sqrt (c ^ 2 + a ^ 2 + 1)\n\n/-- The inequality asserted in the source problem, for fixed `a`, `b`, and `c`. -/\ndef Inequality (a b c : ℝ) : Prop :=\n LeftHandSide a b c ≥ RightHandSide a b c\n\n/-- The full universal proposition to be proved in the source problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f66f4bea-2dd6-5c14-ba26-678640dc39e5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "03dd5948462758fadda2fceeee3984afe8c981e4b2631b34ed5d9052f3fed72f", "task_path": "tasks/nmp3_f66f4bea-2dd6-5c14-ba26-678640dc39e5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f66f4bea-2dd6-5c14-ba26-678640dc39e5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f6b46d88-2b06-5738-9df9-dcf4cad64944", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that among any $100\\,000$ consecutive $100$‑digit positive integers there exists an integer $n$ such that the length of the repeating part (period) of the decimal expansion of $\\frac1n$ is greater than $2011$.\nmodule\n\npublic import Mathlib\n\n/-!\n# Formal statement of the decimal-period problem\n\nThis file records the statement (not a proof) of the following problem:\n\nAmong any 100000 consecutive 100-digit positive integers there is an integer\n`n` whose reciprocal `1 / n`, in decimal, has a repeating part of length\ngreater than 2011.\n\nThe decimal period is represented directly from the decimal digits. For a\npositive denominator `n`, the digit at zero-based position `k` after the\ndecimal point in the expansion of `1 / n` is `(10 ^ (k + 1) / n) % 10`; this\nis the usual decimal expansion obtained by the floor construction. A positive integer\n`p` is an\neventual period when, after some finite preperiod, all digits repeat with\nshift `p`. The period (length of the repeating part) is the least such\npositive integer.\n-/\n\npublic section\n\nnamespace Problem\n\n/-- `n` is a positive integer having exactly 100 decimal digits. -/\ndef IsHundredDigitPositiveInteger (n : ℕ) : Prop :=\n 0 < n ∧ (10 : ℕ) ^ 99 ≤ n ∧ n < (10 : ℕ) ^ 100\n\n/-- `a, a + 1, ..., a + 99999` is a block of 100000 consecutive\n100-digit positive integers. -/\ndef IsConsecutiveBlockOfHundredDigitPositiveIntegers (a : ℕ) : Prop :=\n ∀ k : ℕ, k < 100000 → IsHundredDigitPositiveInteger (a + k)\n\n/-- `n` lies in the block beginning at `a` and having 100000 terms. -/\ndef InConsecutiveBlock (a n : ℕ) : Prop :=\n a ≤ n ∧ n < a + 100000\n\n/-- The digit at zero-based index `k` after the decimal point of `1 / n`,\nusing the usual floor construction. (The value at `n = 0` is an irrelevant\ntotalized fallback; all denominators used in the target are positive.) -/\ndef decimalDigit (n k : ℕ) : ℕ :=\n ((10 : ℕ) ^ (k + 1)) / n % 10\n\n/-- The decimal expansion of `1 / n` is eventually periodic with positive\nperiod `period`: after some preperiod, shifting the digit sequence by\n`period` leaves every sufficiently late digit unchanged. -/\ndef EventuallyPeriodicDigits (n period : ℕ) : Prop :=\n 0 < period ∧\n ∃ preperiod : ℕ,\n ∀ i : ℕ, preperiod ≤ i →\n decimalDigit n (i + period) = decimalDigit n i\n\n/-- `period` is the length of the repeating part of the decimal expansion of\n`1 / n`; that is, `period` is the least positive eventual period of its\ndecimal digits. -/\ndef HasDecimalPeriod (n period : ℕ) : Prop :=\n EventuallyPeriodicDigits n period ∧\n ∀ q : ℕ, EventuallyPeriodicDigits n q → period ≤ q\n\n/-- The repeating part of the decimal expansion of `1 / n` has length\nstrictly greater than `bound`. -/\ndef DecimalPeriodGreaterThan (n bound : ℕ) : Prop :=\n ∃ period : ℕ, HasDecimalPeriod n period ∧ bound < period\n\n/-- The full assertion of the problem: every block of 100000 consecutive\n100-digit positive integers contains a member `n` for which the decimal\nexpansion of `1 / n` has period greater than 2011. -/\ndef Target : Prop :=\n ∀ a : ℕ,\n IsConsecutiveBlockOfHundredDigitPositiveIntegers a →\n ∃ n : ℕ,\n InConsecutiveBlock a n ∧ DecimalPeriodGreaterThan n 2011\n\nend Problem\n\nend\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6b46d88-2b06-5738-9df9-dcf4cad64944", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "22e5cfed1722aa6f11cb7a155dedab1de9d17ae67540c0a5e77185d375d4b4b5", "task_path": "tasks/nmp3_f6b46d88-2b06-5738-9df9-dcf4cad64944", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6b46d88-2b06-5738-9df9-dcf4cad64944", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f6ca6308-701e-5606-8e9c-3639c1cbea50", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c>0$, prove that \n-- $$a^3+b^3+c^3+3abc\\;\\ge\\;ab\\sqrt{2(a^2+b^2)}+bc\\sqrt{2(b^2+c^2)}+ca\\sqrt{2(c^2+a^2)}.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\ndef lhs (a : ℝ) (b : ℝ) (c : ℝ) : ℝ :=\n a ^ 3 + b ^ 3 + c ^ 3 + 3 * a * b * c\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def rhs (a : ℝ) (b : ℝ) (c : ℝ) : ℝ :=\n a * b * Real.sqrt (2 * (a ^ 2 + b ^ 2)) +\n b * c * Real.sqrt (2 * (b ^ 2 + c ^ 2)) +\n c * a * Real.sqrt (2 * (c ^ 2 + a ^ 2))\n\n/-- The assertion stated in the problem: for every triple of positive reals,\nthe left-hand side is at least the right-hand side. -/\ndef Target : Prop :=\n ∀ (a : ℝ) (b : ℝ) (c : ℝ),\n 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6ca6308-701e-5606-8e9c-3639c1cbea50", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c7e58b9f6dc55a73b6efb17761d0ebd2225550a579babbc99df5f918c7a9e3b7", "task_path": "tasks/nmp3_f6ca6308-701e-5606-8e9c-3639c1cbea50", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6ca6308-701e-5606-8e9c-3639c1cbea50", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f6d12f1f-7592-5f50-a24f-4ec5b16a60e4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $T$ denote the set of infinite sequences of integers. For $x=(a_1,a_2,\\dots)$ and $y=(b_1,b_2,\\dots)$ in $T$, define addition componentwise:\n-- \\[\n-- x+y=(a_1+b_1,\\;a_2+b_2,\\dots).\n-- \\]\n-- Let $f:T\\to\\mathbb Z$ satisfy \n-- \n-- (i) $f(x)=0$ whenever $x$ has a single entry equal to $1$ and all other entries equal to $0$ (i.e. $x=e_i$ for some $i$); \n-- \n-- (ii) $f(x+y)=f(x)+f(y)$ for all $x,y\\in T$. \n-- \n-- Prove that $f(x)=0$ for every $x\\in T$.\nimport Mathlib\n\n/-!\n# Formal statement: additive integer-valued functions on infinite integer sequences\n\nThis file formalizes the statement of the problem. The set `T` of infinite\nsequences of integers is represented by the function type `ℕ+ → ℤ`, using the\npositive natural numbers as sequence indices (matching the source notation\n`a₁, a₂, ...`). Addition on `T` is defined componentwise.\n-/\n\nnamespace Problem\n\n/-- The type underlying the set `T` of infinite sequences of integers.\n\nThe source writes sequences as `(a₁, a₂, ...)`, so the indices are taken to be\nthe positive natural numbers. -/\nabbrev T : Type := ℕ+ → ℤ\n\n/-- Componentwise addition on infinite integer sequences. -/\ndef componentwiseAdd (x y : T) : T :=\n fun i => x i + y i\n\n/-- The sequence `e_i`: its `i`-th entry is `1` and all other entries are `0`. -/\ndef basisVector (i : ℕ+) : T :=\n fun j => if j = i then (1 : ℤ) else 0\n\n/-- Condition (i): `f` vanishes on every standard basis vector `e_i`. -/\ndef VanishesOnBasis (f : T → ℤ) : Prop :=\n ∀ i : ℕ+, f (basisVector i) = 0\n\n/-- Condition (ii): `f` is additive with respect to componentwise addition. -/\ndef ComponentwiseAdditive (f : T → ℤ) : Prop :=\n ∀ x y : T, f (componentwiseAdd x y) = f x + f y\n\n/-- The two hypotheses imposed on `f` in the problem. -/\ndef Admissible (f : T → ℤ) : Prop :=\n VanishesOnBasis f ∧ ComponentwiseAdditive f\n\n/-- The asserted conclusion: `f` vanishes at every element of `T`. -/\ndef Vanishes (f : T → ℤ) : Prop :=\n ∀ x : T, f x = 0\n\n/-- The complete assertion to be proved: every additive integer-valued function\non `T` that vanishes on all `e_i` is identically zero. -/\ndef Target : Prop :=\n ∀ f : T → ℤ, Admissible f → Vanishes f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6d12f1f-7592-5f50-a24f-4ec5b16a60e4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8932701235fac1cf0cfaebd695e6566d809a5b83086e8ae576c7b257fabeda2c", "task_path": "tasks/nmp3_f6d12f1f-7592-5f50-a24f-4ec5b16a60e4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6d12f1f-7592-5f50-a24f-4ec5b16a60e4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f6e533c1-24ad-5946-9503-8847efe608fe", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d\\ge0$ satisfy $a^{2}+b^{2}+c^{2}+d^{2}=1$. Prove that \n-- \\[\n-- \\sqrt{1-a}+\\sqrt{1-b}+\\sqrt{1-c}+\\sqrt{1-d}\\;\\ge\\;\\sqrt a+\\sqrt b+\\sqrt c+\\sqrt d.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formalization of the square-root inequality\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, `c`, and `d`\nwhose squares sum to one, that the sum of the square roots of `1 - a`, `1 - b`,\n`1 - c`, and `1 - d` is at least the sum of the square roots of `a`, `b`, `c`, and `d`.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the four real parameters in the source problem. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ 0 ≤ d ∧\n a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = 1\n\n/-- The inequality asserted as the conclusion of the source problem. -/\ndef SqrtSumInequality (a b c d : ℝ) : Prop :=\n Real.sqrt (1 - a) + Real.sqrt (1 - b) + Real.sqrt (1 - c) + Real.sqrt (1 - d) ≥\n Real.sqrt a + Real.sqrt b + Real.sqrt c + Real.sqrt d\n\n/-- The complete proposition to be proved in the source problem. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → SqrtSumInequality a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6e533c1-24ad-5946-9503-8847efe608fe", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f650f2c9e4cc45829f02120ac2c60f80fc2b56a3a0540b69e52f718e7a25f877", "task_path": "tasks/nmp3_f6e533c1-24ad-5946-9503-8847efe608fe", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6e533c1-24ad-5946-9503-8847efe608fe", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f6f84f43-029e-5b4f-8bac-76662685a4e9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\sum_{\\text{cyc}} \\frac{(b+c)(a^4-b^2c^2)}{ab+2bc+ca}\\ge 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the cyclic inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, and `c`,\n\n`∑_cyc ((b + c) * (a^4 - b^2 * c^2) / (a*b + 2*b*c + c*a)) ≥ 0`.\n\nThe cyclic sum is expanded explicitly into its three cyclic terms.\n-/\n\nnamespace Problem\n\n/-- One cyclic summand of the target inequality, with the cyclic variables\nwritten in the order `(a, b, c)`. -/\nnoncomputable def cyclicTerm (a b c : ℝ) : ℝ :=\n (b + c) * (a ^ 4 - b ^ 2 * c ^ 2) / (a * b + 2 * b * c + c * a)\n\n/-- The cyclic sum appearing in the source problem, expanded over the three\ncyclic permutations of `(a, b, c)`. -/\nnoncomputable def cyclicSum (a b c : ℝ) : ℝ :=\n cyclicTerm a b c + cyclicTerm b c a + cyclicTerm c a b\n\n/-- The assertion to be proved: for every positive real `a`, `b`, and `c`,\nthe cyclic sum is nonnegative. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n 0 ≤ cyclicSum a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6f84f43-029e-5b4f-8bac-76662685a4e9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "79a70fb810c1d748c319a1e81507a407a4458e4fb64b2a3bfe023323586671c1", "task_path": "tasks/nmp3_f6f84f43-029e-5b4f-8bac-76662685a4e9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6f84f43-029e-5b4f-8bac-76662685a4e9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f6f9ed14-72aa-5ee3-9c8c-2c6bff3c2314", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a}{a^{2}+bc}+\\frac{b}{b^{2}+ca}+\\frac{c}{c^{2}+ab}\\le\n-- \\frac{1}{a+b}+\\frac{1}{b+c}+\\frac{1}{c+a}.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n a / (a ^ 2 + b * c) + b / (b ^ 2 + c * a) + c / (c ^ 2 + a * b)\n\n/-- The right-hand side of the target inequality. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 1 / (a + b) + 1 / (b + c) + 1 / (c + a)\n\n/-- The full universally quantified assertion from the problem:\nfor all positive real numbers `a`, `b`, and `c`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → LHS a b c ≤ RHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6f9ed14-72aa-5ee3-9c8c-2c6bff3c2314", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a0f2ad52bd9f9b55607f6dee3bdfaeac650a46774f75240f0a7e53326fd35f20", "task_path": "tasks/nmp3_f6f9ed14-72aa-5ee3-9c8c-2c6bff3c2314", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f6f9ed14-72aa-5ee3-9c8c-2c6bff3c2314", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f73828d3-b3a9-581c-b1c4-52e507b5019a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sqrt{a+\\frac{bc}{a}}+\\sqrt{b+\\frac{ac}{b}}+\\sqrt{c+\\frac{ab}{c}}\\ge \\sqrt{6\\,(a+b+c)}.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The radicand of the first term, `a + bc / a`. -/\ndef firstRadicand (a b c : ℝ) : ℝ :=\n a + b * c / a\n\n/-- The radicand of the second term, `b + ac / b`. -/\ndef secondRadicand (a b c : ℝ) : ℝ :=\n b + a * c / b\n\n/-- The radicand of the third term, `c + ab / c`. -/\ndef thirdRadicand (a b c : ℝ) : ℝ :=\n c + a * b / c\n\n/-- The left-hand side of the asserted inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (firstRadicand a b c) +\n Real.sqrt (secondRadicand a b c) +\n Real.sqrt (thirdRadicand a b c)\n\n/-- The right-hand side of the asserted inequality, `sqrt (6 * (a + b + c))`. -/\ndef rhs (a b c : ℝ) : ℝ :=\n Real.sqrt ((6 : ℝ) * (a + b + c))\n\n/-- The asserted inequality for a fixed positive triple. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/--\nFor all positive real numbers `a`, `b`, and `c`, the sum of\n`sqrt (a + bc / a)`, `sqrt (b + ac / b)`, and `sqrt (c + ab / c)`\nis at least `sqrt (6 * (a + b + c))`.\n\nThe divisions are real division and `Real.sqrt` is the nonnegative\nreal square root.\n-/\ndef Target : Prop :=\n ∀ (a : ℝ) (b : ℝ) (c : ℝ),\n 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f73828d3-b3a9-581c-b1c4-52e507b5019a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "63dcbb4780fc8e8f1914c5f9c58d985e90e60e9d535e6e08dd55d461fc1ecace", "task_path": "tasks/nmp3_f73828d3-b3a9-581c-b1c4-52e507b5019a", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f73828d3-b3a9-581c-b1c4-52e507b5019a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f743c078-0798-549e-99f5-67661f9eb6f9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a_1,a_2,\\dots,a_n$ (with $n\\in\\mathbb{N}$) prove that \n-- \n-- \\[\n-- \\frac{a_1^5}{a_2^2\\bigl(a_1^2+a_2^2\\bigr)}+\\frac{a_2^5}{a_3^2\\bigl(a_2^2+a_3^2\\bigr)}+\\cdots+\\frac{a_n^5}{a_1^2\\bigl(a_n^2+a_1^2\\bigr)}\\ge\\frac{a_1+a_2+\\cdots+a_n}{2},\n-- \\]\n-- \n-- where the indices are taken cyclically (i.e. $a_{n+1}=a_1$).\nimport Mathlib\n\nset_option autoImplicit false\n\n/-!\n# Formal statement: cyclic inequality for positive reals\n\nThis file records the statement of the problem without proving it. A positive\ninteger `n` is represented by `n : ℕ` together with `hn : 0 < n`, and the\nfinite sequence `a_1, ..., a_n` is represented by a function\n`a : Fin n → ℝ`, where `a i` is the source entry `a_{i.val + 1}` (zero-based\nfinite indexing). The cyclic successor of an index is computed modulo `n`.\n-/\n\nnamespace Problem\n\n/-- The cyclic successor of an index `i` in `Fin n := {0, ..., n-1}`.\n\nFor `n > 1`, `0` maps to `1` and `n-1` maps back to `0`; for `n = 1`, the\nunique index maps to itself. This is the formal version of `a_{n+1} = a_1`. -/\ndef cyclicSucc {n : ℕ} (hn : 0 < n) (i : Fin n) : Fin n :=\n ⟨(i.val + 1) % n, Nat.mod_lt (i.val + 1) hn⟩\n\n/-- The sum `a_1 + a_2 + ⋯ + a_n`, encoded as a sum over `Fin n`. -/\ndef cyclicSum {n : ℕ} (a : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, a i\n\n/-- The left-hand side\n`∑ i, a_i^5 / (a_{i+1}^2 * (a_i^2 + a_{i+1}^2))`,\nwhere the index `i+1` is cyclic. -/\nnoncomputable def cyclicLHS {n : ℕ} (hn : 0 < n) (a : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n,\n (a i) ^ 5 /\n ((a (cyclicSucc hn i)) ^ 2 * ((a i) ^ 2 + (a (cyclicSucc hn i)) ^ 2))\n\n/-- The admissibility condition that all entries of the finite sequence are\npositive real numbers. -/\ndef PositiveTuple {n : ℕ} (a : Fin n → ℝ) : Prop :=\n ∀ i : Fin n, 0 < a i\n\n/-- The asserted cyclic inequality for a fixed positive length `n` and a fixed\nreal sequence `a : Fin n → ℝ`. -/\ndef CyclicInequality {n : ℕ} (hn : 0 < n) (a : Fin n → ℝ) : Prop :=\n cyclicSum a / 2 ≤ cyclicLHS hn a\n\n/-- The full universally quantified statement of the problem: for every\npositive integer `n` and every positive real sequence `(a_1, ..., a_n)`, the\ncyclic inequality holds. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (hn : 0 < n) (a : Fin n → ℝ),\n PositiveTuple a → CyclicInequality hn a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f743c078-0798-549e-99f5-67661f9eb6f9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "574e999204a352bee3c8bf99ff7c4ca38b361ce98b21cb0e59d1af37a8f14314", "task_path": "tasks/nmp3_f743c078-0798-549e-99f5-67661f9eb6f9", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f743c078-0798-549e-99f5-67661f9eb6f9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f74537ba-a3ce-5bf5-b4c4-7e8ae91774c8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $f:\\mathbb{R}\\to\\mathbb{R}$ satisfies $f(x)=0$ for all $x\\in(a,b)$ where $a0$. Prove that \n-- \\[\n-- \\sqrt{3+144\\frac{x}{\\,x+y\\,}}+\\sqrt{3+144\\frac{y}{\\,y+z\\,}}+\\sqrt{3+144\\frac{z}{\\,z+x\\,}}\\le 15\\sqrt{3}\\,. \n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\nnamespace Problem\n\n/-- The left-hand side of the inequality, as a real-valued function of the three\npositive real variables. -/\nnoncomputable def LHS (x : ℝ) (y : ℝ) (z : ℝ) : ℝ :=\n Real.sqrt (3 + 144 * x / (x + y)) +\n Real.sqrt (3 + 144 * y / (y + z)) +\n Real.sqrt (3 + 144 * z / (z + x))\n\n/-- The assertion of the problem: for all positive real numbers `x`, `y`, and\n`z`, the sum of the three square roots is at most `15 * sqrt 3`. -/\nnoncomputable def Target : Prop :=\n ∀ (x : ℝ) (y : ℝ) (z : ℝ), 0 < x → 0 < y → 0 < z →\n LHS x y z ≤ 15 * Real.sqrt 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f755156c-92f8-50f8-876b-9e82a3e4e865", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d0bb443269476fe0a2490c62e3ee157a23aa6c17c48f1e01224ed1f4efef7c9d", "task_path": "tasks/nmp3_f755156c-92f8-50f8-876b-9e82a3e4e865", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f755156c-92f8-50f8-876b-9e82a3e4e865", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f7999ccf-e9ce-5cab-8452-f1d850535068", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Find all positive integers $n$ such that $3^{n}-2$ is a perfect square. Show that the only solutions are $n=1$ and $n=3$.\nimport Mathlib\n\n/-!\n# Formalization of the perfect-square Diophantine problem\n\nThe original problem asks for all positive integers `n` for which\n`3 ^ n - 2` is a perfect square, and states that the only such integers are\n`1` and `3`.\n\nThis file records the admissibility predicate and a complete-answer predicate\nfor a proposed set of exponents. No proof of the mathematical claim is\nincluded.\n-/\n\nnamespace Problem\n\n/-- An integer is a perfect square when it is the square of an integer. -/\ndef IsPerfectSquare (z : ℤ) : Prop :=\n ∃ m : ℤ, z = m ^ 2\n\n/-- `n` is admissible when it is a positive natural number and `3 ^ n - 2` is\na perfect square. The subtraction and exponentiation are carried out in the\nintegers, with the exponent `n` a natural number. -/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧ IsPerfectSquare ((3 : ℤ) ^ n - 2)\n\n/-- Soundness of a proposed answer set: every exponent it lists is admissible. -/\ndef AnswerSound (S : Set ℕ) : Prop :=\n ∀ n : ℕ, n ∈ S → Admissible n\n\n/-- Completeness of a proposed answer set: every admissible exponent is listed. -/\ndef AnswerComplete (S : Set ℕ) : Prop :=\n ∀ n : ℕ, Admissible n → n ∈ S\n\n/-- A set is a correct complete answer to the \"find all\" question when\nboth the soundness and completeness directions hold. -/\ndef AnswerCorrect (S : Set ℕ) : Prop :=\n AnswerSound S ∧ AnswerComplete S\n\n/-- The answer proposed by the problem statement: the two-element set\n`{1, 3}`. -/\ndef ProposedAnswer : Set ℕ :=\n {1, 3}\n\n/-- The formal target: the proposed answer set `{1, 3}` is exactly the set of\npositive integers `n` for which `3 ^ n - 2` is a perfect square. -/\ndef Target : Prop :=\n AnswerCorrect ProposedAnswer\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f7999ccf-e9ce-5cab-8452-f1d850535068", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5e62491e2b6fb71ca37d6b748335baaf8ef7e66f8acc15573070a80dade3ae28", "task_path": "tasks/nmp3_f7999ccf-e9ce-5cab-8452-f1d850535068", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f7999ccf-e9ce-5cab-8452-f1d850535068", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f7a1c94a-f40e-59af-8340-4d81ed98b602", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for a positive integer $n$, the number $3^{n}-2$ is a perfect square only when $n=1$ or $n=3$.\nimport Mathlib\n\nnamespace Problem\n\n/-- A natural number is a perfect square when it is the square of a natural number. -/\ndef IsPerfectSquare (N : ℕ) : Prop :=\n ∃ k : ℕ, N = k ^ 2\n\n/-- For every positive integer `n`, if `3 ^ n - 2` is a perfect square,\nthen `n` must be either `1` or `3`. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 0 < n → IsPerfectSquare (3 ^ n - 2) → n = 1 ∨ n = 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f7a1c94a-f40e-59af-8340-4d81ed98b602", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "54449d76b2c631fa3dbaffaca2f43d22829ea1add245bd6be988318afd85d1a3", "task_path": "tasks/nmp3_f7a1c94a-f40e-59af-8340-4d81ed98b602", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f7a1c94a-f40e-59af-8340-4d81ed98b602", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f7eb6477-9ece-54ac-b1d3-51a4133b0aa4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $\\{q_n\\}_{n\\ge0}$ is an infinite sequence of integers such that \n-- \n-- (i) $m-n\\mid q_m-q_n$ for all integers $m>n\\ge0$, and \n-- \n-- (ii) there exists a (real) polynomial $P$ with $|q_n| n ≥ 0`, and\n* `q` is bounded in absolute value at the natural numbers by the values of some\n real polynomial.\n\nThen `q` agrees on all natural numbers with a rational-coefficient polynomial,\nand a nonzero integer multiple of that polynomial has integer coefficients.\n\nThe final declaration `Problem.Target` is a proposition; it is not proved here.\n-/\n\nnamespace Problem\n\n/-- The divisibility hypothesis (i) on an integer sequence.\n\nThe indices of the sequence are natural numbers. For natural numbers `m > n`,\nthe integer `m - n` divides the integer difference `q m - q n`. -/\ndef DivisibilityCondition (q : ℕ → ℤ) : Prop :=\n ∀ (m n : ℕ), n < m → ((m : ℤ) - (n : ℤ)) ∣ (q m - q n)\n\n/-- The growth hypothesis (ii) on an integer sequence: there is a real\npolynomial `P` such that `|q n| < P n` for every natural number `n`. -/\ndef PolynomialGrowth (q : ℕ → ℤ) : Prop :=\n ∃ P : Polynomial ℝ, ∀ n : ℕ, |(q n : ℝ)| < Polynomial.eval (n : ℝ) P\n\n/-- The full admissibility hypothesis for the sequence: conditions (i) and (ii). -/\ndef Admissible (q : ℕ → ℤ) : Prop :=\n DivisibilityCondition q ∧ PolynomialGrowth q\n\n/-- A rational-coefficient polynomial has an integer-coefficient multiple: there\nis a nonzero integer `c` and an integer-coefficient polynomial `R` whose image\nunder the canonical coefficient inclusion `ℤ → ℚ` is `c • Q`. -/\ndef HasIntegerCoefficientMultiple (Q : Polynomial ℚ) : Prop :=\n ∃ c : ℤ, c ≠ 0 ∧\n ∃ R : Polynomial ℤ, Polynomial.map (Int.castRingHom ℚ) R = Polynomial.C (c : ℚ) * Q\n\n/-- The sequence `q` is represented on all natural numbers by the rational\npolynomial `Q`. -/\ndef RealizesOnNaturals (q : ℕ → ℤ) (Q : Polynomial ℚ) : Prop :=\n ∀ n : ℕ, (q n : ℚ) = Polynomial.eval (n : ℚ) Q\n\n/-- The conclusion of the problem for a fixed sequence `q`: there exists a\nrational-coefficient polynomial `Q` that agrees with `q` on every natural number\nand has a nonzero integer multiple with integer coefficients. -/\ndef PolynomialConclusion (q : ℕ → ℤ) : Prop :=\n ∃ Q : Polynomial ℚ, HasIntegerCoefficientMultiple Q ∧ RealizesOnNaturals q Q\n\n/-- The complete statement to be proved. For every integer-valued sequence on\nthe natural numbers satisfying the divisibility and polynomial-growth hypotheses,\nthere is a rational-coefficient polynomial interpolating the sequence on the\nnatural numbers and having an integer-coefficient nonzero multiple. -/\ndef Target : Prop :=\n ∀ q : ℕ → ℤ, Admissible q → PolynomialConclusion q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f7eb6477-9ece-54ac-b1d3-51a4133b0aa4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "acfd2b970f28f53c93b0d5821bd2eaaad238b622fecffcdd6e589e87786a77d5", "task_path": "tasks/nmp3_f7eb6477-9ece-54ac-b1d3-51a4133b0aa4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f7eb6477-9ece-54ac-b1d3-51a4133b0aa4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f7f0fed8-943b-5597-9358-90ab0e83da53", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be the complete bipartite graph $K_{km,kn}$ with bipartition $A,B$, where $|A|=km$ and $|B|=kn$ for positive integers $k,m,n$. The edges of $G$ are colored with $k$ colors. Prove that there exists a monochromatic connected component containing at least $m+n$ vertices (i.e., there is a color and a set of vertices such that any two of them are joined by a path using only edges of that color).\nimport Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected\n\nuniverse u v\n\nnamespace Problem\n\n/-- The adjacency relation of the complete bipartite graph with sides `A` and `B`.\nVertices are represented by the disjoint sum `A ⊕ B`. -/\ndef completeBipartiteAdj (A : Type u) (B : Type v) : A ⊕ B → A ⊕ B → Prop\n | Sum.inl _, Sum.inr _ => True\n | Sum.inr _, Sum.inl _ => True\n | _, _ => False\n\n/-- The complete bipartite graph `K_{|A|,|B|}` on the disjoint sum of the two parts. -/\ndef completeBipartiteGraph (A : Type u) (B : Type v) : SimpleGraph (A ⊕ B) where\n Adj := completeBipartiteAdj A B\n symm := ⟨by\n intro x y h\n cases x <;> cases y <;> simp_all [completeBipartiteAdj]⟩\n loopless := ⟨by\n intro x h\n cases x <;> simp_all [completeBipartiteAdj]⟩\n\n/-- The spanning subgraph formed by the edges of one fixed color. -/\ndef colorSubgraph {V : Type u} {k : ℕ} (G : SimpleGraph V)\n (color : G.edgeSet → Fin k) (c : Fin k) : SimpleGraph V where\n Adj x y := ∃ h : G.Adj x y,\n color ⟨s(x, y), by simpa [SimpleGraph.mem_edgeSet] using h⟩ = c\n symm := ⟨by\n intro x y h\n rcases h with ⟨hG, hc⟩\n refine ⟨hG.symm, ?_⟩\n simpa [Sym2.eq_swap] using hc⟩\n loopless := ⟨by\n intro x h\n exact G.irrefl h.1⟩\n\n/-- The statement of the problem: in every `k`-edge-coloring of `K_{km,kn}`, some\ncolor class has a connected component on at least `m+n` vertices. The vertices are\nthe disjoint sum `A ⊕ B`; an edge coloring is a function on `G.edgeSet`; and the\ncomponent's vertex count is `C.supp.ncard` (finite because `A` and `B` are finite). -/\ndef Target : Prop :=\n ∀ (k m n : ℕ), 0 < k → 0 < m → 0 < n →\n ∀ (A : Type u) (B : Type v) [Fintype A] [Fintype B],\n Fintype.card A = k * m →\n Fintype.card B = k * n →\n ∀ color : (completeBipartiteGraph A B).edgeSet → Fin k,\n ∃ c : Fin k,\n ∃ C : (colorSubgraph (completeBipartiteGraph A B) color c).ConnectedComponent,\n m + n ≤ C.supp.ncard\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f7f0fed8-943b-5597-9358-90ab0e83da53", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "9f57415063cfaffe068e9f0ff3450ec7dad333d494a71a27691e7b988db5bc2a", "task_path": "tasks/nmp3_f7f0fed8-943b-5597-9358-90ab0e83da53", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f7f0fed8-943b-5597-9358-90ab0e83da53", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f805e4ba-b74f-5175-a29c-b407ec09c782", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers. Prove that \n-- \\[\n-- x^{6}+y^{6}+z^{6}+15\\bigl(x^{3}y^{3}+y^{3}z^{3}+z^{3}x^{3}\\bigr)\\ge 16\\,xyz\\bigl(x^{3}+y^{3}+z^{3}\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the problem\n\nThe original problem asks to prove an inequality for all positive real numbers\n`x`, `y`, and `z`.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `x`, `y`, and `z`,\n`x^6 + y^6 + z^6 + 15 (x^3 y^3 + y^3 z^3 + z^3 x^3)`\nis at least `16 x y z (x^3 + y^3 + z^3)`. -/\ndef Target : Prop :=\n ∀ (x y z : ℝ),\n 0 < x → 0 < y → 0 < z →\n x ^ 6 + y ^ 6 + z ^ 6 +\n 15 * (x ^ 3 * y ^ 3 + y ^ 3 * z ^ 3 + z ^ 3 * x ^ 3) ≥\n 16 * (x * y * z) * (x ^ 3 + y ^ 3 + z ^ 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f805e4ba-b74f-5175-a29c-b407ec09c782", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "914d87c83fe60b1af6d1241c6789db3157b86a0330df375bedc0ffd37a1e3d32", "task_path": "tasks/nmp3_f805e4ba-b74f-5175-a29c-b407ec09c782", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f805e4ba-b74f-5175-a29c-b407ec09c782", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f80e15eb-e914-5be2-8120-b9a487ef2233", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers with $a^4+b^4+c^4=3$. Prove that \n-- $$P=\\frac{a^2}{b}+\\frac{b^2}{c}+\\frac{c^2}{a}\\ge 3.$$\nimport Mathlib\n\nnamespace Problem\n\n/-- The quantity `P` from the statement, with real-valued division. -/\nnoncomputable def P (a b c : ℝ) : ℝ :=\n a ^ 2 / b + b ^ 2 / c + c ^ 2 / a\n\n/-- The full assertion: for all positive real numbers `a`, `b`, `c` satisfying\n`a^4 + b^4 + c^4 = 3`, the quantity `P a b c` is at least `3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 4 + b ^ 4 + c ^ 4 = 3 →\n P a b c ≥ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f80e15eb-e914-5be2-8120-b9a487ef2233", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "66cff642ad2322671769d8c13fe53f2722f5d85ea755547c3da232260b005425", "task_path": "tasks/nmp3_f80e15eb-e914-5be2-8120-b9a487ef2233", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f80e15eb-e914-5be2-8120-b9a487ef2233", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f82a0acb-7e29-5a6b-83aa-3c69dec1e577", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for any real numbers $a,b,c$ satisfying $abc=1$ the inequality \n-- \\[\n-- \\frac{1}{2a^{2}+b^{2}+3}+\\frac{1}{2b^{2}+c^{2}+3}+\\frac{1}{2c^{2}+a^{2}+3}\\le\\frac12\n-- \\]\n-- holds.\nimport Mathlib\n\n/-!\n# Formal statement\n\nThis file formalizes the assertion from `problem.md`: for all real numbers\n`a`, `b`, and `c` with `a*b*c = 1`, a certain sum of three real fractions is\nat most `1/2`.\n\nThe target is intentionally only a proposition-valued definition. No proof is\nprovided here.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition on the real triple `(a,b,c)`: `abc = 1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n a * b * c = (1 : ℝ)\n\n/-- The left-hand side of the desired inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n (1 : ℝ) / ((2 : ℝ) * a ^ 2 + b ^ 2 + 3) +\n (1 : ℝ) / ((2 : ℝ) * b ^ 2 + c ^ 2 + 3) +\n (1 : ℝ) / ((2 : ℝ) * c ^ 2 + a ^ 2 + 3)\n\n/-- The right-hand side of the desired inequality. -/\nnoncomputable def rhs : ℝ :=\n (1 : ℝ) / 2\n\n/-- The formalized target inequality: for any real numbers `a`, `b`, and `c`\nsatisfying `abc = 1`, the sum of the three displayed fractions is at most\n`1/2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≤ rhs\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f82a0acb-7e29-5a6b-83aa-3c69dec1e577", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b5daecfc44b5e4bb0f39fc76f119a9290239b58da1ea6c7929245a0772b4bd29", "task_path": "tasks/nmp3_f82a0acb-7e29-5a6b-83aa-3c69dec1e577", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f82a0acb-7e29-5a6b-83aa-3c69dec1e577", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f8417b97-c6c4-5edc-9961-c3517d47bdcc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z$ be positive real numbers. Prove that \n-- \\[\n-- (x+y+z)^3 \\ge \\frac{27}{4}\\bigl(x^2y + y^2z + z^2x + xyz\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for all positive real numbers `x`, `y`, and `z`,\nthat `(x + y + z)^3 ≥ (27 / 4) * (x^2 * y + y^2 * z + z^2 * x + x * y * z)`.\n-/\n\nnamespace Problem\n\n/-- The assertion to be proved: for all positive reals `x`, `y`, and `z`, the\nstated homogeneous cubic inequality holds. -/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z →\n (x + y + z) ^ 3 ≥\n (27 / 4 : ℝ) * (x ^ 2 * y + y ^ 2 * z + z ^ 2 * x + x * y * z)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8417b97-c6c4-5edc-9961-c3517d47bdcc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5695b0c9e409443d779735db3bc1e24ef9afac124292b90625ede5bb6c16879e", "task_path": "tasks/nmp3_f8417b97-c6c4-5edc-9961-c3517d47bdcc", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8417b97-c6c4-5edc-9961-c3517d47bdcc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f862e562-df12-5f4f-abc7-23e70edc25df", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy $a^4+b^4+c^4=3$. Prove that \n-- \\[\n-- \\frac{1}{4-ab}+\\frac{1}{4-bc}+\\frac{1}{4-ca}\\le 1\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`\nsatisfying `a^4 + b^4 + c^4 = 3`, the sum of the three displayed reciprocals is at\nmost `1`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 4 + b ^ 4 + c ^ 4 = 3 →\n 1 / (4 - a * b) + 1 / (4 - b * c) + 1 / (4 - c * a) ≤ 1\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f862e562-df12-5f4f-abc7-23e70edc25df", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5d18fdbecea759edc5f9eb01e9d844f332b6b68b1a565fb6cd12d1edc1894ad1", "task_path": "tasks/nmp3_f862e562-df12-5f4f-abc7-23e70edc25df", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f862e562-df12-5f4f-abc7-23e70edc25df", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f8652beb-089c-5bd6-b57d-56a127871850", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers such that $a^2+b^2+c^2+abc=4$. Prove that \n-- \\[\n-- \\bigl|(a-b)(b-c)(c-a)\\bigr|\\le \\frac{8}{3\\sqrt3}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a positive-real-variable inequality\n\nThe source problem asks to prove that, for positive real numbers `a`, `b`, and\n`c` satisfying `a^2 + b^2 + c^2 + a*b*c = 4`, the absolute value of\n`(a - b) * (b - c) * (c - a)` is at most `8 / (3 * sqrt 3)`.\n\nThis file records that assertion as a proposition. No proof is supplied.\n-/\n\nnamespace Problem\n\n/-- The assertion from the source problem: for all positive real numbers `a`, `b`,\nand `c` satisfying `a^2 + b^2 + c^2 + a*b*c = 4`, the absolute value of\n`(a - b) * (b - c) * (c - a)` is at most `8 / (3 * sqrt 3)`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 + a * b * c = 4 →\n |(a - b) * (b - c) * (c - a)| ≤ 8 / (3 * Real.sqrt 3)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8652beb-089c-5bd6-b57d-56a127871850", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "11e49c2deaa25f1998e55daef1ea8411016f60a492cbfdbe9c1cadff86861ccd", "task_path": "tasks/nmp3_f8652beb-089c-5bd6-b57d-56a127871850", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8652beb-089c-5bd6-b57d-56a127871850", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f87d8bff-c860-5a07-b8ce-08b06047d6e9", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$ satisfying $a^{2}+b^{2}+c^{2}+abc=4$, prove that \n-- \\[\n-- a+b+c\\le 3-\\frac14\\min\\{(a-b)^{2},\\,(b-c)^{2},\\,(c-a)^{2}\\}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable inequality\n\nThis file records the problem statement only. It deliberately contains no proof of\nthe claimed inequality.\n-/\n\nnamespace Problem\n\n/-- The minimum of three real numbers, written as nested binary minima. -/\ndef min3 (x y z : ℝ) : ℝ :=\n min x (min y z)\n\n/-- The hypotheses of the problem: `a`, `b`, and `c` are positive real numbers\nsatisfying `a^2 + b^2 + c^2 + abc = 4`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a ^ 2 + b ^ 2 + c ^ 2 + a * b * c = 4\n\n/-- The inequality asserted in the problem. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a + b + c ≤\n 3 - (1 / 4 : ℝ) *\n min3 ((a - b) ^ 2) ((b - c) ^ 2) ((c - a) ^ 2)\n\n/-- The complete assertion: for every triple of positive real numbers satisfying\n`a^2 + b^2 + c^2 + abc = 4`, the stated inequality holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f87d8bff-c860-5a07-b8ce-08b06047d6e9", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0ef5a19ac54eb07db13d60ac376e1ff5e9456a8051784099d63490732928a42a", "task_path": "tasks/nmp3_f87d8bff-c860-5a07-b8ce-08b06047d6e9", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f87d8bff-c860-5a07-b8ce-08b06047d6e9", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f8aab6e7-d2b1-53e6-9894-723245aecea7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $A_n$ be the set of partitions of the sequence $1,2,\\dots,n$ into several subsequences (blocks) such that in each block any two consecutive terms have opposite parity. \n-- Let $B_n$ be the set of partitions of the sequence $1,2,\\dots,n$ into several subsequences (blocks) such that all terms in each block have the same parity. \n-- (Each subsequence is taken in the order in which its elements appear in the original sequence, i.e. each block is an increasing subsequence of $\\{1,\\dots,n\\}$.) \n-- \n-- Prove that for every positive integer $n$,\n-- \\[\n-- |A_n|=|B_{\\,n+1}|.\n-- \\]\nimport Mathlib\n\n/-!\nFormalization of the statement from `problem.md`.\n\nFor a natural number `n`, an element of `Fin n` is used to index one of the\nterms `1, …, n` in order. A block is a finite subset of these indices; ordered\nin the canonical order of `Fin n`, it is precisely an increasing subsequence of\n`1, …, n`. A partition is a finite set of pairwise disjoint nonempty blocks\nwhose union is the whole sequence. Blocks are not ordered.\n-/\n\nnamespace Problem\n\n/-- The original term represented by an index in `Fin n`. The zero-based index\nis shifted by one, so `value n x` is the corresponding element of `1, …, n`. -/\ndef value (n : ℕ) (x : Fin n) : ℕ := x.val + 1\n\n/-- The parity of the original term represented by an element of `Fin n`. -/\ndef parity (n : ℕ) (x : Fin n) : ℕ := value n x % 2\n\n/-- A finite family of blocks is a set partition of `Fin n` when each block is\nnonempty, distinct blocks are disjoint, and the blocks cover every index. -/\ndef IsSetPartition (n : ℕ) (P : Finset (Finset (Fin n))) : Prop :=\n (∀ B ∈ P, B.Nonempty) ∧\n (∀ B₁ ∈ P, ∀ B₂ ∈ P, B₁ ≠ B₂ → Disjoint B₁ B₂) ∧\n P.biUnion (fun B => B) = Finset.univ\n\n/-- Two indices are consecutive in a block when they both belong to the block,\nthe first is smaller than the second, and no element of the block lies strictly\nbetween them. This is adjacency in the increasing list of block elements. -/\ndef ConsecutiveInBlock {n : ℕ} (B : Finset (Fin n)) (x y : Fin n) : Prop :=\n x ∈ B ∧ y ∈ B ∧ x < y ∧ ∀ z ∈ B, x < z → z < y → False\n\n/-- A block has the property from `A_n`: consecutive terms in its increasing\norder have opposite parity. -/\ndef HasAlternatingParity {n : ℕ} (B : Finset (Fin n)) : Prop :=\n ∀ x y : Fin n, ConsecutiveInBlock B x y → parity n x ≠ parity n y\n\n/-- A block has the property from `B_n`: all its terms have the same parity. -/\ndef HasConstantParity {n : ℕ} (B : Finset (Fin n)) : Prop :=\n ∀ x ∈ B, ∀ y ∈ B, parity n x = parity n y\n\n/-- The finite set of all set partitions of `1, …, n` satisfying the `A_n`\nadjacent-opposite-parity condition. -/\nnoncomputable def An (n : ℕ) : Finset (Finset (Finset (Fin n))) := by\n classical\n exact ((Finset.univ : Finset (Fin n)).powerset.powerset).filter\n (fun P => IsSetPartition n P ∧ ∀ B ∈ P, HasAlternatingParity B)\n\n/-- The finite set of all set partitions of `1, …, n` satisfying the `B_n`\nsame-parity-in-each-block condition. -/\nnoncomputable def Bn (n : ℕ) : Finset (Finset (Finset (Fin n))) := by\n classical\n exact ((Finset.univ : Finset (Fin n)).powerset.powerset).filter\n (fun P => IsSetPartition n P ∧ ∀ B ∈ P, HasConstantParity B)\n\n/-- The assertion to be proved: for every positive integer `n`, the number of\n`A`-partitions of `1, …, n` equals the number of `B`-partitions of `1, …, n+1`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → (An n).card = (Bn (n + 1)).card\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8aab6e7-d2b1-53e6-9894-723245aecea7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8a52881764b6d7d99e0ef5c8e8163a82701086728b48d900963810c4d9a2235e", "task_path": "tasks/nmp3_f8aab6e7-d2b1-53e6-9894-723245aecea7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8aab6e7-d2b1-53e6-9894-723245aecea7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f8b93c6f-5837-5a91-acb2-4054c89a9306", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be the side lengths of a triangle (so $a+b>c$, $b+c>a$, $c+a>b$). Prove that \n-- \\[\n-- \\frac{a^{3}(a+b)}{a^{2}+b^{2}}+\\frac{b^{3}(b+c)}{b^{2}+c^{2}}+\\frac{c^{3}(c+a)}{c^{2}+a^{2}}\\ge a^{2}+b^{2}+c^{2}\\,.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissible triples `(a, b, c)` from the problem: positive real numbers\nwhich satisfy the three strict triangle inequalities. -/\ndef IsPositiveTriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The left-hand side of the asserted inequality. -/\ndef InequalityLHS (a b c : ℝ) : ℝ :=\n a ^ 3 * (a + b) / (a ^ 2 + b ^ 2) +\n b ^ 3 * (b + c) / (b ^ 2 + c ^ 2) +\n c ^ 3 * (c + a) / (c ^ 2 + a ^ 2)\n\n/-- The right-hand side of the asserted inequality. -/\ndef InequalityRHS (a b c : ℝ) : ℝ :=\n a ^ 2 + b ^ 2 + c ^ 2\n\n/-- The full universal statement: for every positive real triple satisfying the\nthree strict triangle inequalities, the displayed inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n IsPositiveTriangleSideLengths a b c →\n InequalityLHS a b c ≥ InequalityRHS a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8b93c6f-5837-5a91-acb2-4054c89a9306", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2f928286a5d4091f7107942f9a9119b75d8fb7953fd40730c10ab7afc9a8bc7f", "task_path": "tasks/nmp3_f8b93c6f-5837-5a91-acb2-4054c89a9306", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8b93c6f-5837-5a91-acb2-4054c89a9306", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f8ec2f87-61a6-5ef6-85f4-751b5063bac4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) with \\(a+b+c=1\\). Prove \n-- \\[\n-- \\sqrt{a+(b-c)^2}+\\sqrt{b+(c-a)^2}+\\sqrt{c+(a-b)^2}\\ge \\sqrt{3}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable square-root inequality\n\nThe source problem asks, for positive `a`, `b`, and `c` whose sum is `1`, to\nprove the inequality\n\n`Real.sqrt (a + (b - c)^2) + Real.sqrt (b + (c - a)^2) +\n Real.sqrt (c + (a - b)^2) ≥ Real.sqrt (3 : ℝ)`.\n\nThis file records the statement only. In particular, `Problem.Target` is a\n`Prop`-valued definition and no proof of it is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition on the real variables in the source problem:\n`a`, `b`, and `c` are all strictly positive and sum to `1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a + b + c = (1 : ℝ)\n\n/-- The left-hand side of the asserted inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a + (b - c) ^ (2 : ℕ)) +\n Real.sqrt (b + (c - a) ^ (2 : ℕ)) +\n Real.sqrt (c + (a - b) ^ (2 : ℕ))\n\n/-- The asserted inequality, under the exact positivity and sum hypotheses\nfrom the source problem. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → lhs a b c ≥ Real.sqrt (3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8ec2f87-61a6-5ef6-85f4-751b5063bac4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "939d1d4dd742c30cfef1b65feac4fe4c6cb5b6388229a2becac170e139f8510b", "task_path": "tasks/nmp3_f8ec2f87-61a6-5ef6-85f4-751b5063bac4", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8ec2f87-61a6-5ef6-85f4-751b5063bac4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f8f1e070-cf97-5cd8-b07a-76edc79abd7b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$ be real numbers such that $ab+ac+bc\\neq0$. Prove that \n-- \\[\n-- \\frac1{a^3+3abc+b^3}+\\frac1{a^3+3abc+c^3}+\\frac1{b^3+3abc+c^3}\\ge\\frac{81}{5\\,(a+b+c)^3}\\, .\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The admissibility conditions placed on the real numbers `a`, `b`, and `c`:\nthey are nonnegative and satisfy `a*b + a*c + b*c ≠ 0`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧ a * b + a * c + b * c ≠ 0\n\n/-- The left-hand side of the asserted inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n 1 / (a ^ 3 + 3 * a * b * c + b ^ 3) +\n 1 / (a ^ 3 + 3 * a * b * c + c ^ 3) +\n 1 / (b ^ 3 + 3 * a * b * c + c ^ 3)\n\n/-- The right-hand side of the asserted inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 81 / (5 * (a + b + c) ^ 3)\n\n/-- The asserted inequality, with its intended side placed on the left. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≥ rhs a b c\n\n/-- The full assertion: for all nonnegative real `a`, `b`, and `c` satisfying\n`a*b + a*c + b*c ≠ 0`, the sum of the three reciprocal cubic expressions is at\nleast `81 / (5 * (a + b + c)^3)`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Admissible a b c → Inequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8f1e070-cf97-5cd8-b07a-76edc79abd7b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2e2a95c4a445f453327dbe303df4b6ab3f24d6740fe629fec9de12b417168487", "task_path": "tasks/nmp3_f8f1e070-cf97-5cd8-b07a-76edc79abd7b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8f1e070-cf97-5cd8-b07a-76edc79abd7b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f8f9cc4f-0a2b-58c3-a656-eea2bca2a0cb", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that every integer greater than 6 can be expressed as a sum of distinct prime numbers (the number of primes used is unrestricted).\nimport Mathlib\n\n/-!\n# Formal statement: every integer greater than six is a sum of distinct primes\n\nThe problem asks to prove that every integer greater than `6` can be written as a\nfinite sum of distinct prime numbers, with no restriction on the number of\nsummands. Since a `Finset` represents a finite collection without repetitions,\ndistinctness is built into the representation below. Prime numbers are natural\nnumbers, while the target integer being decomposed is an integer; consequently\nthe prime summands are coerced into `ℤ` before their sum is taken.\n-/\n\nnamespace Problem\n\n/-- A finite collection of natural numbers all of whose members are prime. -/\ndef IsPrimeFinset (primes : Finset ℕ) : Prop :=\n ∀ p : ℕ, p ∈ primes → Nat.Prime p\n\n/-- `IsDistinctPrimeSum n` means that `n` is the sum of a finite collection of\ndistinct prime numbers. The collection is a `Finset`, so it has no repeated\nelements; its cardinality is unrestricted. -/\ndef IsDistinctPrimeSum (n : ℤ) : Prop :=\n ∃ primes : Finset ℕ,\n IsPrimeFinset primes ∧\n primes.sum (fun (p : ℕ) => (p : ℤ)) = n\n\n/-- Every integer strictly greater than `6` is a sum of distinct prime numbers\n(the number of primes used is unrestricted). -/\ndef Target : Prop :=\n ∀ n : ℤ, 6 < n → IsDistinctPrimeSum n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8f9cc4f-0a2b-58c3-a656-eea2bca2a0cb", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ecc8fc0b08b89db694dd8119323b6cabed7bd8502d977b71b33aa9d04711e2c8", "task_path": "tasks/nmp3_f8f9cc4f-0a2b-58c3-a656-eea2bca2a0cb", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f8f9cc4f-0a2b-58c3-a656-eea2bca2a0cb", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f9027840-9c8b-568b-baed-14cfd5eb6095", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{b+c}{2a^2+bc}+\\frac{c+a}{2b^2+ca}+\\frac{a+b}{2c^2+ab}\\ge \\frac{6}{a+b+c}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement: three-term positive-variable inequality\n\nThis file states the inequality from the source problem. It introduces no\nproof: `Problem.Target` is a proposition-valued definition whose body is the\nuniversally quantified implication corresponding to the claim.\n-/\n\nnamespace Problem\n\n/-- The first summand of the left-hand side:\n`(b + c) / (2 a ^ 2 + b c)`. -/\nnoncomputable def firstTerm (a b c : ℝ) : ℝ :=\n (b + c) / (2 * a ^ 2 + b * c)\n\n/-- The second summand of the left-hand side:\n`(c + a) / (2 b ^ 2 + c a)`. -/\nnoncomputable def secondTerm (a b c : ℝ) : ℝ :=\n (c + a) / (2 * b ^ 2 + c * a)\n\n/-- The third summand of the left-hand side:\n`(a + b) / (2 c ^ 2 + a b)`. -/\nnoncomputable def thirdTerm (a b c : ℝ) : ℝ :=\n (a + b) / (2 * c ^ 2 + a * b)\n\n/-- The complete left-hand side of the claimed inequality. -/\nnoncomputable def leftSide (a b c : ℝ) : ℝ :=\n firstTerm a b c + secondTerm a b c + thirdTerm a b c\n\n/-- The right-hand side of the claimed inequality. -/\nnoncomputable def rightSide (a b c : ℝ) : ℝ :=\n 6 / (a + b + c)\n\n/-- The claimed inequality for a fixed triple of real variables. -/\nnoncomputable def inequality (a b c : ℝ) : Prop :=\n leftSide a b c ≥ rightSide a b c\n\n/--\nThe complete assertion of the problem: for all real numbers `a`, `b`, and `c`\nwith `a > 0`, `b > 0`, and `c > 0`, the three-term inequality holds.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f9027840-9c8b-568b-baed-14cfd5eb6095", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "944023ae9cf357e9ec5e65dcd1955a22dbc94cc40604eef97292b69748add6b1", "task_path": "tasks/nmp3_f9027840-9c8b-568b-baed-14cfd5eb6095", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f9027840-9c8b-568b-baed-14cfd5eb6095", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f91324ab-fd7f-56a6-abae-041c910515d2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that\n-- \\[\n-- \\frac{\\frac{a+b}{\\,b+c\\,}+\\frac{b+c}{\\,c+a\\,}}{\\frac{c}{\\,b+c\\,}+\\frac{a}{\\,c+a\\,}}\n-- +\\frac{\\frac{b+c}{\\,c+a\\,}+\\frac{c+a}{\\,a+b\\,}}{\\frac{a}{\\,c+a\\,}+\\frac{b}{\\,a+b\\,}}\n-- +\\frac{\\frac{c+a}{\\,a+b\\,}+\\frac{a+b}{\\,b+c\\,}}{\\frac{b}{\\,a+b\\,}+\\frac{c}{\\,b+c\\,}}\n-- \\ge 6.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-term inequality\n\nThis file records the statement of the problem. It deliberately contains no\nproof of the inequality; `Problem.Target` is a proposition-valued definition.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The first summand in the displayed left-hand side. -/\ndef term1 (a b c : ℝ) : ℝ :=\n (((a + b) / (b + c) + (b + c) / (c + a)) /\n (c / (b + c) + a / (c + a)))\n\n/-- The second summand in the displayed left-hand side. -/\ndef term2 (a b c : ℝ) : ℝ :=\n (((b + c) / (c + a) + (c + a) / (a + b)) /\n (a / (c + a) + b / (a + b)))\n\n/-- The third summand in the displayed left-hand side. -/\ndef term3 (a b c : ℝ) : ℝ :=\n (((c + a) / (a + b) + (a + b) / (b + c)) /\n (b / (a + b) + c / (b + c)))\n\n/-- The complete left-hand side of the displayed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n term1 a b c + term2 a b c + term3 a b c\n\n/-- The assertion stated in the problem: for all positive real `a`, `b`, and\n`c`, the displayed three-term expression is at least `6`. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c → lhs a b c ≥ (6 : ℝ)\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f91324ab-fd7f-56a6-abae-041c910515d2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c8d30838f74adafb719acb5a72d4b2ed9b30746de02fef40f4a8a2dcf4523a6f", "task_path": "tasks/nmp3_f91324ab-fd7f-56a6-abae-041c910515d2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f91324ab-fd7f-56a6-abae-041c910515d2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f9233d86-3085-5ceb-aad4-0c9e515d55b8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that \n-- \\[\n-- (a+b+c)\\Bigl(\\frac1a+\\frac1b+\\frac1c\\Bigr)\\ge 2+\\sqrt{\\,1+4\\Bigl(\\frac{a}{b+c}+\\frac{b}{c+a}+\\frac{c}{a+b}\\Bigr)\\frac{(b+c)(c+a)(a+b)}{abc}\\,}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the target inequality\n\nThe source problem asks to prove, for all positive real numbers `a`, `b`, `c`, that\n\n`(a + b + c) * (1/a + 1/b + 1/c) ≥\n 2 + sqrt (1 + 4 * (a/(b+c) + b/(c+a) + c/(a+b)) *\n ((b+c)*(c+a)*(a+b))/(a*b*c))`.\n\nThis file only states the proposition; it does not provide any proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the target inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n (a + b + c) * (1 / a + 1 / b + 1 / c)\n\n/-- The cyclic sum appearing in the radicand. -/\ndef cyclicSum (a b c : ℝ) : ℝ :=\n a / (b + c) + b / (c + a) + c / (a + b)\n\n/-- The product of pairwise sums appearing in the radicand. -/\ndef pairwiseProduct (a b c : ℝ) : ℝ :=\n ((b + c) * (c + a) * (a + b)) / (a * b * c)\n\n/-- The radicand on the right-hand side of the target inequality. -/\ndef radicand (a b c : ℝ) : ℝ :=\n 1 + 4 * cyclicSum a b c * pairwiseProduct a b c\n\n/-- The right-hand side of the target inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 2 + Real.sqrt (radicand a b c)\n\n/-- The assertion from the problem: for all positive real numbers `a`, `b`, `c`,\nthe stated inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f9233d86-3085-5ceb-aad4-0c9e515d55b8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "45adba01f1282aa5bf6173aaf2b7be2b94674b5a7ccdf80836a5cb2d10a117ec", "task_path": "tasks/nmp3_f9233d86-3085-5ceb-aad4-0c9e515d55b8", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f9233d86-3085-5ceb-aad4-0c9e515d55b8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f93c113d-541f-5b5b-8b5a-ee36fa520a38", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{a^2}{b}+\\frac{b^2}{c}+\\frac{c^2}{a}\\ge\n-- \\frac{5(a^2+b^2+c^2)-2(ab+bc+ca)}{a+b+c}\\,.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the claimed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n a ^ 2 / b + b ^ 2 / c + c ^ 2 / a\n\n/-- The right-hand side of the claimed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (5 * (a ^ 2 + b ^ 2 + c ^ 2) - 2 * (a * b + b * c + c * a)) /\n (a + b + c)\n\n/--\nFor all strictly positive real numbers `a`, `b`, and `c`, the claimed\ninequality holds.\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≥ rhs a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f93c113d-541f-5b5b-8b5a-ee36fa520a38", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bf6f62687ca59ace2e589a588aaaf4e63d5d54a0e1aabdfc59bdcfc2f4c05a4a", "task_path": "tasks/nmp3_f93c113d-541f-5b5b-8b5a-ee36fa520a38", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f93c113d-541f-5b5b-8b5a-ee36fa520a38", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f958ad66-197f-5cb5-b95c-3011811fc718", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$ be real numbers such that $b+c$, $c+a$, $a+b$ are non‑zero. Prove that \n-- \\[\n-- \\left(\\frac{2a}{\\,b+c\\,}\\right)^{\\frac35}+\\left(\\frac{2b}{\\,c+a\\,}\\right)^{\\frac35}+\\left(\\frac{2c}{\\,a+b\\,}\\right)^{\\frac35}\\ge 3\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The sum on the left-hand side of the target inequality. -/\nnoncomputable def leftSide (a b c : ℝ) : ℝ :=\n (2 * a / (b + c)) ^ ((3 : ℝ) / 5) +\n (2 * b / (c + a)) ^ ((3 : ℝ) / 5) +\n (2 * c / (a + b)) ^ ((3 : ℝ) / 5)\n\n/-- The assumptions that `a`, `b`, and `c` are nonnegative, and that\nthe three pairwise sums occurring in the denominators are nonzero. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c ∧\n b + c ≠ 0 ∧ c + a ≠ 0 ∧ a + b ≠ 0\n\n/-- The inequality to be proved for fixed admissible `a`, `b`, and `c`. -/\ndef Claim (a b c : ℝ) : Prop :=\n 3 ≤ leftSide a b c\n\n/-- The full universally quantified proposition stated by the problem. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Claim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f958ad66-197f-5cb5-b95c-3011811fc718", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f966818542e9d8c2de68ad214b8dfe4b66a9e3fdab3a6ceaa3cc7b9956e58d27", "task_path": "tasks/nmp3_f958ad66-197f-5cb5-b95c-3011811fc718", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f958ad66-197f-5cb5-b95c-3011811fc718", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f965b8e9-6c56-5516-bb36-1f6e7ed517e7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. Prove that \n-- \\[\n-- \\sum_{k=1}^{n} (-1)^{\\big\\lfloor k(\\sqrt{2}-1)\\big\\rfloor}\\ge 0.\n-- \\] \n-- (Here $\\lfloor x\\rfloor$ denotes the greatest integer $\\le x$.)\nimport Mathlib\n\nnamespace Problem\n\n/-- The summand `(-1) ^ floor (k * (sqrt 2 - 1))`, with the floor\ninterpreted as the natural-number floor. For the indices used below this\nagrees with the usual greatest-integer floor, since `k ≥ 1` and `sqrt 2 - 1 > 0`. -/\nnoncomputable def targetTerm (k : ℕ) : ℤ :=\n (-1 : ℤ) ^ Nat.floor ((k : ℝ) * (Real.sqrt 2 - 1))\n\n/-- The partial sum `∑_{k=1}^n (-1) ^ floor (k * (sqrt 2 - 1))`. -/\nnoncomputable def partialSum (n : ℕ) : ℤ :=\n ∑ k ∈ Finset.Icc 1 n, targetTerm k\n\n/-- The assertion of the problem: for every positive integer `n`, the partial\nsum from `1` through `n` is nonnegative. -/\nnoncomputable def Target : Prop :=\n ∀ n : ℕ, 0 < n → 0 ≤ partialSum n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f965b8e9-6c56-5516-bb36-1f6e7ed517e7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "36b3759b3604aaf1fe3030883ef84487a82af08e316458596180fa61d0a113de", "task_path": "tasks/nmp3_f965b8e9-6c56-5516-bb36-1f6e7ed517e7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f965b8e9-6c56-5516-bb36-1f6e7ed517e7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f967db65-f812-59f0-ba13-229fc883ce2e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\frac{\\sqrt{b^{2}+c^{2}}}{\\,b^{2}+bc+c^{2}\\,}\n-- +\\frac{\\sqrt{c^{2}+a^{2}}}{\\,c^{2}+ca+a^{2}\\,}\n-- +\\frac{\\sqrt{a^{2}+b^{2}}}{\\,a^{2}+ab+b^{2}\\,}\n-- \\le \\frac{\\sqrt{2}\\,(a+b+c)}{ab+bc+ca}\\,. \n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion from the problem: for all positive real numbers `a`, `b`, and `c`,\nthe cyclic sum of `sqrt (b^2 + c^2) / (b^2 + b*c + c^2)` over the three\npermutations is at most `sqrt 2 * (a + b + c) / (a*b + b*c + c*a)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n Real.sqrt (b ^ 2 + c ^ 2) / (b ^ 2 + b * c + c ^ 2) +\n Real.sqrt (c ^ 2 + a ^ 2) / (c ^ 2 + c * a + a ^ 2) +\n Real.sqrt (a ^ 2 + b ^ 2) / (a ^ 2 + a * b + b ^ 2)\n ≤ Real.sqrt 2 * (a + b + c) / (a * b + b * c + c * a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f967db65-f812-59f0-ba13-229fc883ce2e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "974a31a5e6c56587cf2a33b8de0c4862fd471c551b08e7678b49471d6059d917", "task_path": "tasks/nmp3_f967db65-f812-59f0-ba13-229fc883ce2e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f967db65-f812-59f0-ba13-229fc883ce2e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f98d490f-37fe-54be-970d-21d3dbfccab0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all non‑negative real numbers \\(a,b,c\\) the following inequality holds \n-- \\[\n-- \\bigl(a^{3}+b^{3}+c^{3}+3abc\\bigr)^{2}\\;\\ge\\;2\\,(ab+bc+ca)\\Bigl(ab(a^{2}+b^{2})+bc(b^{2}+c^{2})+ca(c^{2}+a^{2})\\Bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the non-negative real-variable inequality\n\nThe original problem asks to prove a single universally quantified inequality\nfor non-negative real numbers. The assertion is represented as a `Prop`-valued\ndefinition; no proof is supplied. The target does not assume its conclusion.\n-/\n\nnamespace Problem\n\n/--\nFor all non-negative real numbers `a`, `b`, and `c`,\n\\[\n(a^3+b^3+c^3+3abc)^2 \\ge\n2(ab+bc+ca)\\bigl(ab(a^2+b^2)+bc(b^2+c^2)+ca(c^2+a^2)\\bigr).\n\\]\n-/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 ≤ a → 0 ≤ b → 0 ≤ c →\n (a ^ 3 + b ^ 3 + c ^ 3 + 3 * a * b * c) ^ 2 ≥\n 2 * (a * b + b * c + c * a) *\n (a * b * (a ^ 2 + b ^ 2) +\n b * c * (b ^ 2 + c ^ 2) +\n c * a * (c ^ 2 + a ^ 2))\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f98d490f-37fe-54be-970d-21d3dbfccab0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ef45de5f29bdf8c372c36dfa8024195b1f2949b9a5c5b4263b8aa70763efb633", "task_path": "tasks/nmp3_f98d490f-37fe-54be-970d-21d3dbfccab0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f98d490f-37fe-54be-970d-21d3dbfccab0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_f9e05aaa-98b7-590b-a970-a405f0351762", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove \n-- \\[\n-- \\frac{(c+a)(c+b)}{a^{2}+b^{2}+ab}+\\frac{(a+c)(a+b)}{b^{2}+c^{2}+bc}+\\frac{(b+a)(b+c)}{c^{2}+a^{2}+ac}\\ge 4.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The three positive real parameters are in the intended domain. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The left-hand side of the asserted cyclic inequality. -/\ndef LHS (a b c : ℝ) : ℝ :=\n (c + a) * (c + b) / (a ^ 2 + b ^ 2 + a * b) +\n (a + c) * (a + b) / (b ^ 2 + c ^ 2 + b * c) +\n (b + a) * (b + c) / (c ^ 2 + a ^ 2 + a * c)\n\n/-- For all positive real `a`, `b`, and `c`, the cyclic sum is at least `4`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → LHS a b c ≥ 4\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f9e05aaa-98b7-590b-a970-a405f0351762", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "65eb6621b65545f29c5342756affa25a08923cd002328b91ec2c1abdc330c1ca", "task_path": "tasks/nmp3_f9e05aaa-98b7-590b-a970-a405f0351762", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "f9e05aaa-98b7-590b-a970-a405f0351762", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fa61ad85-c0ec-591b-836f-b002e66ecf1f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- 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$). Denote by $m_a,m_b,m_c$ the lengths of the medians to sides $a,b,c$, respectively. Prove that \n-- \n-- \\[\n-- \\sum_{\\text{cyc}}\\frac{m_a\\,m_b}{a^2+b^2}\\;\\ge\\;\\frac{9}{8},\n-- \\]\n-- \n-- where the cyclic sum runs over $(a,b,c)$, $(b,c,a)$, $(c,a,b)$.\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\n/-!\n# Formal statement for the cyclic median inequality\n\nThe problem asks to prove, for positive real numbers `a`, `b`, `c` that are the\nside lengths of a triangle, the inequality\n`m_a * m_b / (a^2 + b^2) + m_b * m_c / (b^2 + c^2) + m_c * m_a / (c^2 + a^2) ≥ 9/8`,\nwhere `m_a`, `m_b`, `m_c` are the median lengths to the corresponding sides.\n\nThe median-to-side length is represented by the standard side-length formula\n(Apollonius' formula): if the median is drawn from the vertex opposite side `x`,\nand the other two side lengths are `y` and `z`, then\n`m_x = sqrt (2 * y^2 + 2 * z^2 - x^2) / 2`.\n-/\n\nnamespace Problem\n\n/-- `IsTriangleSideLengths a b c` says that `a`, `b`, and `c` are the positive\nstrict-side lengths of a (nondegenerate) triangle. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b > c ∧ b + c > a ∧ c + a > b\n\n/-- The length of the median to the side of length `x` in a triangle whose other\ntwo side lengths are `y` and `z`. This is the standard Apollonius formula. -/\nnoncomputable def medianToSide (x y z : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * y ^ 2 + 2 * z ^ 2 - x ^ 2)\n\n/-- The cyclic sum `m_a m_b / (a^2 + b^2) + m_b m_c / (b^2 + c^2)\n+ m_c m_a / (c^2 + a^2)` appearing in the problem. -/\nnoncomputable def cyclicMedianSum (a b c : ℝ) : ℝ :=\n (medianToSide a b c * medianToSide b c a) / (a ^ 2 + b ^ 2) +\n (medianToSide b c a * medianToSide c a b) / (b ^ 2 + c ^ 2) +\n (medianToSide c a b * medianToSide a b c) / (c ^ 2 + a ^ 2)\n\n/-- The full assertion of the problem: for every positive real triple that forms\nthe side lengths of a triangle, the cyclic median sum is at least `9/8`. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ,\n IsTriangleSideLengths a b c → cyclicMedianSum a b c ≥ (9 / 8 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fa61ad85-c0ec-591b-836f-b002e66ecf1f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b6adef8117c7006efaa968024c3dc4611db6a42d029798d359ec4724039df3a1", "task_path": "tasks/nmp3_fa61ad85-c0ec-591b-836f-b002e66ecf1f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fa61ad85-c0ec-591b-836f-b002e66ecf1f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fa63c2d6-2a6d-5a88-a2ff-069d958b64c1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f,g:\\mathbb{R}^+\\to\\mathbb{R}^+$ satisfy \n-- $$f\\bigl(g(x)+y\\bigr)=f(x)+f(y)\\qquad\\forall x,y>0,$$ \n-- $$g\\bigl(f(x)+y\\bigr)=g(x)+g(y)\\qquad\\forall x,y>0.$$ \n-- Prove that $f(x)=g(x)$ for every $x>0\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the functional-equation problem\n\nThe source problem writes `ℝ⁺` for the strictly positive real numbers. We model\nit as the subtype of positive real numbers. Both the domain and codomain of\n`f` and `g` are this subtype. The helper `PosReal.add` packages the fact that\nthe sum of two positive reals is again positive; it is the addition operation\noccurring in both displayed functional equations.\n-/\n\nnamespace Problem\n\n/-- The strictly positive real numbers, used for the source notation `ℝ⁺`. -/\nabbrev PosReal : Type := { x : ℝ // 0 < x }\n\n/-- Addition of strictly positive real numbers, with its positivity proof. -/\ndef PosReal.add (x y : PosReal) : PosReal :=\n ⟨(x : ℝ) + (y : ℝ), add_pos x.property y.property⟩\n\n/-- The first displayed functional equation, for all positive `x` and `y`. -/\ndef FirstEquation (f g : PosReal → PosReal) : Prop :=\n ∀ x y : PosReal,\n f (PosReal.add (g x) y) = PosReal.add (f x) (f y)\n\n/-- The second displayed functional equation, for all positive `x` and `y`. -/\ndef SecondEquation (f g : PosReal → PosReal) : Prop :=\n ∀ x y : PosReal,\n g (PosReal.add (f x) y) = PosReal.add (g x) (g y)\n\n/-- The pointwise equality conclusion `f x = g x` for every positive `x`. -/\ndef PointwiseEquals (f g : PosReal → PosReal) : Prop :=\n ∀ x : PosReal, f x = g x\n\n/--\nThe complete assertion: every pair of functions `f, g : ℝ⁺ → ℝ⁺` satisfying\nboth displayed functional equations is pointwise equal.\n-/\ndef Target : Prop :=\n ∀ f g : PosReal → PosReal,\n FirstEquation f g → SecondEquation f g → PointwiseEquals f g\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fa63c2d6-2a6d-5a88-a2ff-069d958b64c1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f117437ee8c09ab38b9e7ef48cea28787068f0e14ac738df123c80a269aef408", "task_path": "tasks/nmp3_fa63c2d6-2a6d-5a88-a2ff-069d958b64c1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fa63c2d6-2a6d-5a88-a2ff-069d958b64c1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fa642237-40a5-5193-b95a-d92b5aa600b4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ satisfying $a+b+c+d=\\frac{1}{a}+\\frac{1}{b}+\\frac{1}{c}+\\frac{1}{d}$. Prove that \n-- $$3(a^4+b^4+c^4+d^4)+52abcd\\ge64.$$\nimport Mathlib\n\n/-!\n# Formal statement for the four-variable inequality problem\n\nThe source problem asks to prove a non-strict real inequality for four positive\nreal numbers whose sum equals the sum of their reciprocals. This file records\nthe statement only; it deliberately contains no proof of the assertion.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypotheses of the problem: all four variables are positive\nreal numbers and their sum equals the sum of their reciprocals. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧\n a + b + c + d = 1 / a + 1 / b + 1 / c + 1 / d\n\n/-- The conclusion to be proved for an admissible quadruple. -/\ndef Conclusion (a b c d : ℝ) : Prop :=\n 3 * (a ^ 4 + b ^ 4 + c ^ 4 + d ^ 4) + 52 * (a * b * c * d) ≥ 64\n\n/-- The complete formal target: for every quadruple of positive real numbers\nsatisfying the reciprocal-sum condition, the stated fourth-power inequality\nholds. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → Conclusion a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fa642237-40a5-5193-b95a-d92b5aa600b4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "69a36789be5f583e9f54496fba795bac34672bc96d9bcff90abd9db82c7d364f", "task_path": "tasks/nmp3_fa642237-40a5-5193-b95a-d92b5aa600b4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fa642237-40a5-5193-b95a-d92b5aa600b4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fa792e7b-3518-5d7e-82b3-c32515aa1cfc", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a convex quadrilateral such that $AB = AC = BD$. Let $O = AC\\cap BD$, let $P$ be the second intersection of the circumcircles of $\\triangle ABC$ and $\\triangle ADO$, and let $Q = AP\\cap BC$. Prove that $\\angle COQ = \\angle DOQ$.\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Geometry.Euclidean.Sphere.Basic\nimport Mathlib.Analysis.Convex.Between\nimport Mathlib.Analysis.Convex.Independent\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Basic\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the formalization. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The three segment lengths `AB`, `AC`, and `BD` are all equal. -/\ndef EqualDistances (A B C D : Plane) : Prop :=\n dist A B = dist A C ∧ dist A C = dist B D\n\n/-- `ABCD` is a nondegenerate convex quadrilateral, with `A`, `B`, `C`, `D`\nin the indicated cyclic order. The last condition says that the diagonals\n`AC` and `BD` have an interior crossing point. -/\ndef ConvexQuadrilateral (A B C D : Plane) : Prop :=\n ConvexIndependent ℝ ![A, B, C, D] ∧\n ∃ O : Plane, Sbtw ℝ A O C ∧ Sbtw ℝ B O D\n\n/-- The point `O` is the intersection of the diagonal segments `AC` and `BD`,\nand it is the unique such interior intersection. -/\ndef DiagonalsMeetAt (A B C D O : Plane) : Prop :=\n Sbtw ℝ A O C ∧ Sbtw ℝ B O D ∧\n ∀ X : Plane, Sbtw ℝ A X C → Sbtw ℝ B X D → X = O\n\n/-- A point `X` lies on the circumcircle of triangle `ABC`. This is expressed\nas the concyclicity of `A`, `B`, `C`, and `X`. -/\ndef OnCircumcircle (A B C X : Plane) : Prop :=\n EuclideanGeometry.Cospherical ({A, B, C, X} : Set Plane)\n\n/-- A point lies on both the circumcircle of `ABC` and the circumcircle of\n`ADO`. -/\ndef OnBothCircumcircles (A B C D O X : Plane) : Prop :=\n OnCircumcircle A B C X ∧ OnCircumcircle A D O X\n\n/-- `P` is the second intersection of the circumcircle of `ABC` and the\ncircumcircle of `ADO`. The first conjunct records that `A` is a common point;\nthe final conjunct states that the two circles have exactly the two common\npoints `A` and `P`. -/\ndef SecondCircumcircleIntersection (A B C D O P : Plane) : Prop :=\n OnBothCircumcircles A B C D O A ∧\n P ≠ A ∧\n OnBothCircumcircles A B C D O P ∧\n ∀ X : Plane, OnBothCircumcircles A B C D O X → X = A ∨ X = P\n\n/-- The full affine line through two points. -/\ndef LineThrough (X Y : Plane) : AffineSubspace ℝ Plane :=\n line[ℝ, X, Y]\n\n/-- `R` is the unique intersection point of the lines through `X`, `Y` and\nthrough `Z`, `W`. The word `line` here is the full affine line, not the\nclosed segment. -/\ndef LinesMeetAt (X Y Z W R : Plane) : Prop :=\n R ∈ LineThrough X Y ∧\n R ∈ LineThrough Z W ∧\n ∀ T : Plane, T ∈ LineThrough X Y → T ∈ LineThrough Z W → T = R\n\n/-- The two unoriented angles `COQ` and `DOQ` are equal. -/\ndef AngleEquality (C D O Q : Plane) : Prop :=\n EuclideanGeometry.angle C O Q = EuclideanGeometry.angle D O Q\n\n/-- The formal target: for every convex quadrilateral `ABCD` satisfying\n`AB = AC = BD`, with `O` the intersection of its diagonals, `P` the second\nintersection of the two circumcircles, and `Q` the intersection of `AP` and\n`BC`, the angles `COQ` and `DOQ` are equal. -/\ndef Target : Prop :=\n ∀ (A B C D : Plane),\n ConvexQuadrilateral A B C D →\n EqualDistances A B C D →\n ∀ (O : Plane),\n DiagonalsMeetAt A B C D O →\n ∀ (P : Plane),\n SecondCircumcircleIntersection A B C D O P →\n ∀ (Q : Plane),\n LinesMeetAt A P B C Q →\n AngleEquality C D O Q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fa792e7b-3518-5d7e-82b3-c32515aa1cfc", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3e5ace5377f1a978acc1165fd18e21170a8b42c4f7e5507d3fb52f35985479d8", "task_path": "tasks/nmp3_fa792e7b-3518-5d7e-82b3-c32515aa1cfc", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fa792e7b-3518-5d7e-82b3-c32515aa1cfc", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fa98bfb2-a5c7-5118-91fc-f92640732b22", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For any triangle $ABC$ with semiperimeter $s$, circumradius $R$, and interior angles $A$, $B$, $C$, prove that \n-- \\[\n-- \\sqrt{1+\\frac{s}{2R}}\\;\\ge\\;\\sin\\frac{A}{2}+\\sin\\frac{B}{2}+\\sin\\frac{C}{2}\\,.\n-- \\] \n-- (Here $s=\\frac{a+b+c}{2}$ where $a,b,c$ are the side lengths.)\nimport Mathlib.Geometry.Euclidean.Circumcenter\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\nnoncomputable section\n\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- The Euclidean plane, used as the ambient space for triangles. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A nondegenerate triangle in the Euclidean plane with vertices labelled by `Fin 3`. -/\nabbrev Triangle : Type := Affine.Triangle ℝ Plane\n\n/-- The side length opposite vertex `A`, namely the length of `BC`. -/\ndef sideA (t : Triangle) : ℝ := dist (t.points 1) (t.points 2)\n\n/-- The side length opposite vertex `B`, namely the length of `CA`. -/\ndef sideB (t : Triangle) : ℝ := dist (t.points 2) (t.points 0)\n\n/-- The side length opposite vertex `C`, namely the length of `AB`. -/\ndef sideC (t : Triangle) : ℝ := dist (t.points 0) (t.points 1)\n\n/-- The semiperimeter `s = (a + b + c) / 2`. -/\ndef semiperimeter (t : Triangle) : ℝ := (sideA t + sideB t + sideC t) / (2 : ℝ)\n\n/-- The interior angle at vertex `A`. -/\ndef angleA (t : Triangle) : ℝ := ∠ (t.points 1) (t.points 0) (t.points 2)\n\n/-- The interior angle at vertex `B`. -/\ndef angleB (t : Triangle) : ℝ := ∠ (t.points 2) (t.points 1) (t.points 0)\n\n/-- The interior angle at vertex `C`. -/\ndef angleC (t : Triangle) : ℝ := ∠ (t.points 0) (t.points 2) (t.points 1)\n\n/-- The left-hand side `sqrt (1 + s / (2R))`. -/\ndef leftHandSide (t : Triangle) : ℝ :=\n Real.sqrt ((1 : ℝ) + semiperimeter t / ((2 : ℝ) * t.circumradius))\n\n/-- The right-hand side `sin (A / 2) + sin (B / 2) + sin (C / 2)`. -/\ndef rightHandSide (t : Triangle) : ℝ :=\n Real.sin (angleA t / (2 : ℝ)) + Real.sin (angleB t / (2 : ℝ)) +\n Real.sin (angleC t / (2 : ℝ))\n\n/-- The asserted inequality for a particular labelled triangle. -/\ndef TriangleInequality (t : Triangle) : Prop :=\n leftHandSide t ≥ rightHandSide t\n\n/-- For every nondegenerate triangle in the Euclidean plane, the square root of\n`1 + s/(2R)` is at least the sum of the sines of the three half-angles. -/\ndef Target : Prop :=\n ∀ t : Triangle, TriangleInequality t\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fa98bfb2-a5c7-5118-91fc-f92640732b22", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4ac09eb8982a4664ac1d2fd033b9b9f2980a4928bbdc9ab50c656e4dd30d892d", "task_path": "tasks/nmp3_fa98bfb2-a5c7-5118-91fc-f92640732b22", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fa98bfb2-a5c7-5118-91fc-f92640732b22", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fac46ce1-3a24-51ba-a975-c15b6cb5e0c2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for the side lengths $a,b,c>0$ of any triangle (i.e. $a+b>c$, $b+c>a$, $c+a>b$) the inequality \n-- \\[\n-- 3\\Bigl(\\frac{a^{2}}{b^{2}}+\\frac{b^{2}}{c^{2}}+\\frac{c^{2}}{a^{2}}\\Bigr)\\;-\\;(a^{2}+b^{2}+c^{2})\\Bigl(\\frac1{a^{2}}+\\frac1{b^{2}}+\\frac1{c^{2}}\\Bigr)\\;\\ge\\;0\n-- \\] \n-- holds.\nimport Mathlib\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the inequality stated in the problem. -/\ndef lhs (a b c : ℝ) : ℝ :=\n 3 * (a ^ 2 / b ^ 2 + b ^ 2 / c ^ 2 + c ^ 2 / a ^ 2) -\n (a ^ 2 + b ^ 2 + c ^ 2) * (1 / a ^ 2 + 1 / b ^ 2 + 1 / c ^ 2)\n\n/-- For all positive real side lengths of a triangle, the displayed expression is nonnegative. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n a + b > c →\n b + c > a →\n c + a > b →\n lhs a b c ≥ 0\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fac46ce1-3a24-51ba-a975-c15b6cb5e0c2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3f8950c146bca4e6dc8716cdc3c78a2110d28e0938d3333447f7ccd98a0629d3", "task_path": "tasks/nmp3_fac46ce1-3a24-51ba-a975-c15b6cb5e0c2", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fac46ce1-3a24-51ba-a975-c15b6cb5e0c2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fac47539-f13f-581d-9add-2ab32deb4e64", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>2$ be an integer and let $a_1,a_2,\\dots,a_n$ be positive real numbers satisfying $a_1+a_2+\\dots+a_n=1$. Prove that \n-- \\[\n-- \\sum_{i=1}^{n}\\frac{\\displaystyle\\prod_{j\\neq i}a_{j}}{a_{i}+n-2}\\;\\le\\;\\frac{1}{(n-1)^{2}}\\,.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the inequality\n\nThe source problem asks to prove, for every integer `n > 2` and every\npositive real `n`-tuple `a` whose entries sum to `1`, the inequality\n\n`∑ i, (∏ j ≠ i, a j) / (a i + n - 2) ≤ 1 / (n - 1)^2`.\n\nThe declarations below expose the admissibility assumptions, the two sides\nof the inequality, and the closed proposition asserting the source claim.\nNo proof of the target is supplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility assumptions on the length and the tuple: `n > 2`, all\nentries are positive, and the entries sum to `1`. -/\ndef Admissible (n : ℕ) (a : Fin n → ℝ) : Prop :=\n 2 < n ∧ (∀ i : Fin n, 0 < a i) ∧ (∑ i : Fin n, a i = 1)\n\n/-- The left-hand side of the inequality. For each `i`, the product is\ntaken over all `j ≠ i` (implemented as the finite set `Finset.univ.erase i`). -/\nnoncomputable def lhs (n : ℕ) (a : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n,\n (Finset.prod (Finset.univ.erase i) (fun j : Fin n => a j)) / (a i + (n : ℝ) - 2)\n\n/-- The right-hand side of the inequality. -/\nnoncomputable def rhs (n : ℕ) : ℝ :=\n 1 / ((n : ℝ) - 1) ^ 2\n\n/-- The complete assertion of the source problem, with the source assumptions\nintroduced in their original order: first `n > 2`, then the real tuple `a`,\nthe strict positivity of every entry, and finally the sum condition. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 2 < n →\n ∀ (a : Fin n → ℝ),\n (∀ i : Fin n, 0 < a i) →\n (∑ i : Fin n, a i = 1) →\n lhs n a ≤ rhs n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fac47539-f13f-581d-9add-2ab32deb4e64", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f04f0809873affee2b77664b7f760385742371bbb40da1f938ee9e306225571d", "task_path": "tasks/nmp3_fac47539-f13f-581d-9add-2ab32deb4e64", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fac47539-f13f-581d-9add-2ab32deb4e64", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fad56bb9-1635-5d32-9095-da02bfed2270", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABCD$ be a parallelogram and let $O$ be a point inside it such that \n-- \\[\n-- \\angle AOB+\\angle COD=180^\\circ .\n-- \\]\n-- Prove that \n-- \\[\n-- \\angle OBC=\\angle ODC .\n-- \\] \n-- (Here $\\angle XYZ$ denotes the interior angle at $Y$ formed by the segments $YX$ and $YZ$.)\nmodule\n\npublic import Mathlib.Analysis.InnerProductSpace.PiL2\npublic import Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\npublic import Mathlib.Analysis.Convex.Hull\n\n/-!\n# Formal statement of the parallelogram angle problem\n\nThe problem is stated in the Euclidean plane. A point is represented by a\nvector in `EuclideanSpace ℝ (Fin 2)`. The undirected angle used by the problem\nis Mathlib's `EuclideanGeometry.angle`, whose value is the angle in `[0, π]`\nbetween two non-zero rays.\n-/\n\n@[expose] public section\n\nnoncomputable section\n\nopen Set\nopen scoped EuclideanGeometry\n\nnamespace Problem\n\n/-- Points of the Euclidean plane. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- `ABCD` is a parallelogram, expressed by the equality of the midpoints of\nits diagonals `AC` and `BD`. Together with the strict-inside hypothesis below,\nthis rules out degenerate configurations. -/\ndef IsParallelogram (A B C D : Point) : Prop :=\n A + C = B + D\n\n/-- The open (interior) region of the parallelogram with vertices `A B C D`. -/\ndef ParallelogramInterior (A B C D : Point) : Set Point :=\n interior (convexHull ℝ ({A, B, C, D} : Set Point))\n\n/-- `O` lies strictly inside the parallelogram `ABCD`. -/\ndef LiesInside (O A B C D : Point) : Prop :=\n O ∈ ParallelogramInterior A B C D\n\n/-- The interior angle `∠XYZ` at `Y` formed by the segments `YX` and `YZ`.\nThis is Mathlib's unoriented Euclidean angle, measured in radians and taking\nvalues in `[0, π]`. -/\ndef InteriorAngle (X Y Z : Point) : ℝ :=\n EuclideanGeometry.angle X Y Z\n\n/-- Conversion from a degree measure to radians. -/\ndef degrees (θ : ℝ) : ℝ :=\n θ * Real.pi / 180\n\n/-- The hypothesis that the two angles at `O` add up to `180°`. -/\ndef AngleSumCondition (A B C D O : Point) : Prop :=\n InteriorAngle A O B + InteriorAngle C O D = degrees 180\n\n/-- The asserted equality of the two remaining angles. -/\ndef AngleEquality (O B C D : Point) : Prop :=\n InteriorAngle O B C = InteriorAngle O D C\n\n/-- The complete assertion of the problem: for every parallelogram `ABCD` in\nthe Euclidean plane and every point `O` strictly inside it, if the two angles\n`∠AOB` and `∠COD` sum to `180°`, then `∠OBC = ∠ODC`. -/\ndef Target : Prop :=\n ∀ (A B C D O : Point),\n IsParallelogram A B C D →\n LiesInside O A B C D →\n AngleSumCondition A B C D O →\n AngleEquality O B C D\n\nend Problem\n\n\npublic theorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fad56bb9-1635-5d32-9095-da02bfed2270", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1d4be3a7509c35ad6fe2258471424458760c1c6654489db91decde0328c351cb", "task_path": "tasks/nmp3_fad56bb9-1635-5d32-9095-da02bfed2270", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fad56bb9-1635-5d32-9095-da02bfed2270", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_faf85258-d3c1-503c-a1cb-e151cf03980e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_n$ denote the coefficient of $x^n$ in the expansion of $(x^2+x+1)^n$. Prove that for any prime $p\\ge 5$,\n-- $$a_p\\equiv1\\pmod{p^2}.$$\nimport Mathlib.Algebra.Polynomial.Basic\nimport Mathlib.Data.Int.ModEq\nimport Mathlib.Data.Nat.Prime.Basic\n\n/-!\n# Formalization of the coefficient congruence problem\n\nThe source problem defines the sequence `a n` as the coefficient of `x ^ n` in\n`(x ^ 2 + x + 1) ^ n`, and asks to prove `a p ≡ 1 (mod p ^ 2)` for every prime\n`p ≥ 5`.\n-/\n\nnamespace Problem\n\n/-- The base polynomial `x ^ 2 + x + 1`, over the integers. -/\nnoncomputable def basePolynomial : Polynomial ℤ :=\n Polynomial.X ^ 2 + Polynomial.X + 1\n\n/-- `a n` is the coefficient of `x ^ n` in `(x ^ 2 + x + 1) ^ n`. -/\nnoncomputable def a (n : ℕ) : ℤ :=\n Polynomial.coeff (basePolynomial ^ n) n\n\n/-- The assertion to be proved: for every prime `p ≥ 5`, the coefficient\n`a p` is congruent to `1` modulo `p ^ 2`. -/\ndef Target : Prop :=\n ∀ p : ℕ, Nat.Prime p → 5 ≤ p → a p ≡ (1 : ℤ) [ZMOD ((p : ℤ) ^ 2)]\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "faf85258-d3c1-503c-a1cb-e151cf03980e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "84cd210a6378f503d314a985ef783ead76e65e4da2ffb13374287ac2de03dcb9", "task_path": "tasks/nmp3_faf85258-d3c1-503c-a1cb-e151cf03980e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "faf85258-d3c1-503c-a1cb-e151cf03980e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fb1ee7a8-681c-554d-a487-7d3adb320051", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge 0$. Prove that \n-- \\[\n-- a(a-b)(a-2b)+b(b-c)(b-2c)+c(c-a)(c-2a)\\ge 0.\n-- \\]\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement: cyclic nonnegative inequality\n\nThe source problem asks to prove, for nonnegative real numbers `a`, `b`, and `c`,\nthat\n`a * (a - b) * (a - 2 * b) + b * (b - c) * (b - 2 * c)\n + c * (c - a) * (c - 2 * a) ≥ 0`.\n\nThe declaration `Problem.Target` below records exactly this universal\nproposition. It is a proposition-valued definition, not a proof.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the source problem. -/\ndef LHS (a b c : Real) : Real :=\n a * (a - b) * (a - 2 * b) +\n b * (b - c) * (b - 2 * c) +\n c * (c - a) * (c - 2 * a)\n\n/-- The asserted inequality: for all nonnegative real `a`, `b`, and `c`, the\ncyclic sum `LHS a b c` is nonnegative. -/\ndef Target : Prop :=\n ∀ (a b c : Real), 0 ≤ a → 0 ≤ b → 0 ≤ c → 0 ≤ LHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fb1ee7a8-681c-554d-a487-7d3adb320051", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "6a31368b8081096c01d7d22a0aac589d3ba55b6510f39c1f21b90a4d4d1d134f", "task_path": "tasks/nmp3_fb1ee7a8-681c-554d-a487-7d3adb320051", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fb1ee7a8-681c-554d-a487-7d3adb320051", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fb456db5-281c-5498-9791-0d6814722b61", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exists an infinite sequence $(a_n)_{n=1}^{\\infty}$ of integers greater than 1 such that each integer $>1$ appears exactly once in the sequence and for every $n\\ge1$ the consecutive terms are not coprime, i.e. $\\gcd(a_n,a_{n+1})>1$.\nimport Mathlib.Data.PNat.Basic\nimport Mathlib.Data.Int.GCD\n\n/-!\n# Formal statement: an infinite non-coprime contiguous permutation of the integers above one\n\nThe source problem asks for the existence of an infinite sequence, indexed by the\npositive integers, whose terms are integers greater than `1`, in which every integer\ngreater than `1` occurs exactly once, and in which every pair of consecutive terms\nhas gcd greater than `1`.\n\nWe use `ℕ+` for the index set `{1, 2, 3, ...}` and `ℤ` for the term values.\n`Int.gcd` is Mathlib's gcd of integers; it returns the natural-number gcd of their\nabsolute values.\n-/\n\nnamespace Problem\n\n/-- Every term of the sequence is an integer strictly greater than `1`. -/\ndef AllTermsGreaterThanOne (a : ℕ+ → ℤ) : Prop :=\n ∀ n : ℕ+, (1 : ℤ) < a n\n\n/-- Every integer strictly greater than `1` occurs at exactly one positive index. -/\ndef EachIntegerGreaterThanOneAppearsExactlyOnce (a : ℕ+ → ℤ) : Prop :=\n ∀ m : ℤ, (1 : ℤ) < m → ∃! n : ℕ+, a n = m\n\n/-- The terms at every positive index `n` and its successor have gcd greater than `1`. -/\ndef ConsecutiveTermsNotCoprime (a : ℕ+ → ℤ) : Prop :=\n ∀ n : ℕ+, (1 : ℕ) < Int.gcd (a n) (a (n + 1))\n\n/-- A sequence satisfying all three conditions in the source problem. -/\ndef AdmissibleSequence (a : ℕ+ → ℤ) : Prop :=\n AllTermsGreaterThanOne a ∧\n EachIntegerGreaterThanOneAppearsExactlyOnce a ∧\n ConsecutiveTermsNotCoprime a\n\n/-- The full assertion of the problem: an admissible sequence exists. -/\ndef Target : Prop :=\n ∃ a : ℕ+ → ℤ, AdmissibleSequence a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fb456db5-281c-5498-9791-0d6814722b61", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a978fa3ba046f06bb920f5b26e51c872dfc445eb638864c322639bb338f9ad9d", "task_path": "tasks/nmp3_fb456db5-281c-5498-9791-0d6814722b61", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fb456db5-281c-5498-9791-0d6814722b61", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fb542442-6085-5e00-8f9c-571e18326de1", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ with $abc=1$. Prove that \n-- \\[\n-- \\frac{1}{a^{4}+4b^{2}+7}+\\frac{1}{b^{4}+4c^{2}+7}+\\frac{1}{c^{4}+4a^{2}+7}\\le\\frac14.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-variable inequality\n\nThe source problem asks to prove a universal inequality over positive real\nnumbers `a`, `b`, and `c` subject to `a * b * c = 1`.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the three variables: they are positive\nreal numbers whose product is one. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 1\n\n/-- The left-hand side of the inequality in the source problem. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n 1 / (a ^ 4 + 4 * b ^ 2 + 7) +\n 1 / (b ^ 4 + 4 * c ^ 2 + 7) +\n 1 / (c ^ 4 + 4 * a ^ 2 + 7)\n\n/-- The asserted inequality for one admissible triple `(a, b, c)`. -/\ndef Claim (a b c : ℝ) : Prop :=\n Admissible a b c → LeftHandSide a b c ≤ (1 : ℝ) / 4\n\n/-- The full universally quantified statement of the problem. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ), Claim a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fb542442-6085-5e00-8f9c-571e18326de1", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "f34bf3c5a15732cc6ff0a0b822150a793f14a5f81aec86dc025f53b8319b12b2", "task_path": "tasks/nmp3_fb542442-6085-5e00-8f9c-571e18326de1", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fb542442-6085-5e00-8f9c-571e18326de1", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fb54a1fe-a130-59df-8c4d-b790862579cf", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that \n-- \\[\n-- \\sqrt{\\frac{9a+b}{9b+a}}+\\sqrt{\\frac{9b+c}{9c+b}}+\\sqrt{\\frac{9c+a}{9a+c}}\\ge 3.\n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement for the cyclic radical inequality\n\nLet `a b c` be positive real numbers. The target asserts the cyclic sum\n`√((9a+b)/(9b+a)) + √((9b+c)/(9c+b)) + √((9c+a)/(9a+c))`\nis at least `3`.\n-/\n\nnamespace Problem\n\n/-- The inequality proposed in the problem, over positive real numbers. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a → 0 < b → 0 < c →\n Real.sqrt (((9 : ℝ) * a + b) / ((9 : ℝ) * b + a)) +\n Real.sqrt (((9 : ℝ) * b + c) / ((9 : ℝ) * c + b)) +\n Real.sqrt (((9 : ℝ) * c + a) / ((9 : ℝ) * a + c)) ≥ (3 : ℝ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fb54a1fe-a130-59df-8c4d-b790862579cf", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1ffd7163ddf36c95ff3d1d39de8932d3964d89e55c467a25dff6cd2f48925e38", "task_path": "tasks/nmp3_fb54a1fe-a130-59df-8c4d-b790862579cf", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fb54a1fe-a130-59df-8c4d-b790862579cf", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fb96836b-497f-56a4-9842-726379d4b17e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ satisfy \n-- \\[\n-- (a^2-a+1)(b^2-b+1)(c^2-c+1)=1.\n-- \\] \n-- Prove that \n-- \\[\n-- a^2b^2+b^2c^2+c^2a^2\\le 3.\n-- \\]\nimport Mathlib\n\nset_option autoImplicit false\n\nnamespace Problem\n\n/-- The three parameters are all strictly positive. -/\ndef PositiveParameters (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- The product equation imposed on the three positive real parameters. -/\ndef ProductEquation (a b c : ℝ) : Prop :=\n (a ^ 2 - a + 1) * (b ^ 2 - b + 1) * (c ^ 2 - c + 1) = (1 : ℝ)\n\n/-- The target inequality in the three real parameters. -/\ndef Inequality (a b c : ℝ) : Prop :=\n a ^ 2 * b ^ 2 + b ^ 2 * c ^ 2 + c ^ 2 * a ^ 2 ≤ (3 : ℝ)\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`\nsatisfying `(a^2 - a + 1) * (b^2 - b + 1) * (c^2 - c + 1) = 1`, the inequality\n`a^2 * b^2 + b^2 * c^2 + c^2 * a^2 ≤ 3` holds. -/\ndef Target : Prop :=\n ∀ (a b c : ℝ),\n PositiveParameters a b c →\n ProductEquation a b c →\n Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fb96836b-497f-56a4-9842-726379d4b17e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "301a7aa8933a4d2bcef4971674d50aa8927e2ebbe2bbc55d600b95d093d9ebd6", "task_path": "tasks/nmp3_fb96836b-497f-56a4-9842-726379d4b17e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fb96836b-497f-56a4-9842-726379d4b17e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fbbb9e36-430d-51df-a686-321aef2b2bd8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c\\ge0$. Prove that \n-- \\[\n-- \\sqrt{ab\\,(a+b)^3}+\\sqrt{bc\\,(b+c)^3}+\\sqrt{ca\\,(c+a)^3}\\;\\ge\\;(a+b+c)\\sqrt{(a+b)(b+c)(c+a)}\\,.\n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Sqrt\n\n/-!\n# Formal statement of a cyclic square-root inequality\n\nFor nonnegative real numbers `a`, `b`, and `c`, the formal target asserts\n\n`√(ab(a+b)^3) + √(bc(b+c)^3) + √(ca(c+a)^3)\n ≥ (a+b+c) under the principal real square root.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the displayed inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (a * b * (a + b) ^ 3) +\n Real.sqrt (b * c * (b + c) ^ 3) +\n Real.sqrt (c * a * (c + a) ^ 3)\n\n/-- The right-hand side of the displayed inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n (a + b + c) * Real.sqrt ((a + b) * (b + c) * (c + a))\n\n/-- The assertion to be proved: for all nonnegative real `a`, `b`, and `c`,\nthe cyclic square-root sum is at least the stated right-hand side. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 ≤ a → 0 ≤ b → 0 ≤ c →\n lhs a b c ≥ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fbbb9e36-430d-51df-a686-321aef2b2bd8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "30ad7781c00bc2e52f46a3b7702b76157e1eafcfdc1bfbca15e8e49d1ffc3013", "task_path": "tasks/nmp3_fbbb9e36-430d-51df-a686-321aef2b2bd8", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fbbb9e36-430d-51df-a686-321aef2b2bd8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fbeffdab-5f5c-5d77-a224-4eaaccff92ae", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for a triangle with side lengths $a,b,c$ and corresponding altitudes $h_A,h_B,h_C$, if \n-- \n-- \\[\n-- \\sqrt{a+h_B}+\\sqrt{b+h_C}+\\sqrt{c+h_A}\n-- =\n-- \\sqrt{a+h_C}+\\sqrt{b+h_A}+\\sqrt{c+h_B},\n-- \\]\n-- \n-- then the triangle is isosceles (i.e. at least two of $a,b,c$ are equal).\nimport Mathlib\n\n/-!\n# Formal statement of the triangle/altitude problem\n\nThe source problem concerns a (nondegenerate) Euclidean triangle whose side\nlengths are `a`, `b`, `c` and whose corresponding altitudes are `hA`, `hB`,\n`hC`. Since the statement is phrased only in terms of side lengths and\naltitudes, we encode the corresponding altitude to a side by Heron's formula\nfor the area of the triangle.\n\nNo assertion in this file is proved here: `Problem.Target` is the proposition\nwhich the original problem asks to prove.\n-/\n\nnamespace Problem\n\n/-- The semiperimeter of a triangle with side lengths `a`, `b`, `c`. -/\nnoncomputable def semiperimeter (a b c : ℝ) : ℝ :=\n (a + b + c) / 2\n\n/-- The area of a triangle with side lengths `a`, `b`, `c`, expressed by\nHeron's formula. Under the strict triangle inequalities this is the usual\npositive area. -/\nnoncomputable def areaFromSideLengths (a b c : ℝ) : ℝ :=\n Real.sqrt\n (semiperimeter a b c * (semiperimeter a b c - a) *\n (semiperimeter a b c - b) * (semiperimeter a b c - c))\n\n/-- The altitude to side `a` in a triangle whose side lengths are `a`, `b`,\n`c`. It equals `2 * area / a`. -/\nnoncomputable def altitudeToSideA (a b c : ℝ) : ℝ :=\n 2 * areaFromSideLengths a b c / a\n\n/-- The altitude to side `b` in a triangle whose side lengths are `a`, `b`,\n`c`. -/\nnoncomputable def altitudeToSideB (a b c : ℝ) : ℝ :=\n 2 * areaFromSideLengths a b c / b\n\n/-- The altitude to side `c` in a triangle whose side lengths are `a`, `b`,\n`c`. -/\nnoncomputable def altitudeToSideC (a b c : ℝ) : ℝ :=\n 2 * areaFromSideLengths a b c / c\n\n/-- The three positive side lengths satisfy the strict triangle inequalities,\nso they are the side lengths of a nondegenerate Euclidean triangle. -/\ndef IsNondegenerateTriangle (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a < b + c ∧ b < c + a ∧ c < a + b\n\n/-- `hA`, `hB`, and `hC` are the altitudes corresponding respectively to the\nsides of lengths `a`, `b`, and `c`. -/\nnoncomputable def CorrespondingAltitudes\n (a b c hA hB hC : ℝ) : Prop :=\n hA = altitudeToSideA a b c ∧\n hB = altitudeToSideB a b c ∧\n hC = altitudeToSideC a b c\n\n/-- The side lengths and the three displayed altitudes belong to one and the\nsame nondegenerate triangle. -/\nnoncomputable def IsTriangleWithAltitudes\n (a b c hA hB hC : ℝ) : Prop :=\n IsNondegenerateTriangle a b c ∧\n CorrespondingAltitudes a b c hA hB hC\n\n/-- The left-hand side of the equality in the source problem. -/\nnoncomputable def EquationLeftHandSide\n (a b c hA hB hC : ℝ) : ℝ :=\n Real.sqrt (a + hB) + Real.sqrt (b + hC) + Real.sqrt (c + hA)\n\n/-- The right-hand side of the equality in the source problem. -/\nnoncomputable def EquationRightHandSide\n (a b c hA hB hC : ℝ) : ℝ :=\n Real.sqrt (a + hC) + Real.sqrt (b + hA) + Real.sqrt (c + hB)\n\n/-- The hypothesis equation of the source problem. -/\nnoncomputable def AltitudeEquation\n (a b c hA hB hC : ℝ) : Prop :=\n EquationLeftHandSide a b c hA hB hC =\n EquationRightHandSide a b c hA hB hC\n\n/-- The conclusion that the triangle is isosceles, meaning that at least two\nof its side lengths are equal. -/\ndef Isosceles (a b c : ℝ) : Prop :=\n a = b ∨ b = c ∨ c = a\n\n/-- The complete proposition asserted by the problem: for every nondegenerate\ntriangle with side lengths `a`, `b`, `c` and corresponding altitudes\n`hA`, `hB`, `hC`, the displayed altitude equation implies that the triangle is\nisosceles. -/\nnoncomputable def Target : Prop :=\n ∀ (a b c hA hB hC : ℝ),\n IsTriangleWithAltitudes a b c hA hB hC →\n AltitudeEquation a b c hA hB hC →\n Isosceles a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fbeffdab-5f5c-5d77-a224-4eaaccff92ae", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "d0ee9bc6b425619b071912eaa936a7b8936487e11311c659bdf57eaff13f6ed0", "task_path": "tasks/nmp3_fbeffdab-5f5c-5d77-a224-4eaaccff92ae", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fbeffdab-5f5c-5d77-a224-4eaaccff92ae", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fbf592bf-333e-52a8-aac3-291356b527a4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$. Prove that\n-- \\[\n-- \\frac{ab}{a^2+ab+b^2}+\\frac{bc}{b^2+bc+c^2}+\\frac{ca}{c^2+ca+a^2}\n-- \\;+\\;\n-- \\frac{4(a^2+b^2+c^2)}{(a+b+c)^2}\n-- \\;\\ge\\;\\frac73.\n-- \\]\n-- (The sum $\\sum$ is taken cyclically over $(a,b,c)$.)\nimport Mathlib.Basic.Real.Basic\n\n/-!\n# Formal statement of the cyclic rational inequality\n\nThe source problem asks, for positive real numbers `a`, `b`, and `c`, to prove\nan inequality whose left-hand side consists of a cyclic sum of three rational\nterms together with a symmetric fourth term.\n\nThis file only states the target proposition. It does not contain a proof.\n-/\n\nnamespace Problem\n\n/-- The admissibility condition on the three variables in the source problem. -/\ndef IsAdmissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c\n\n/-- One member of the cyclic sum, formed from an ordered pair of variables. -/\nnoncomputable def CyclicTerm (a b : ℝ) : ℝ :=\n a * b / (a ^ 2 + a * b + b ^ 2)\n\n/-- The cyclic sum `ab/(a^2+ab+b^2) + bc/(b^2+bc+c^2) + ca/(c^2+ca+a^2)`. -/\nnoncomputable def CyclicSum (a b c : ℝ) : ℝ :=\n CyclicTerm a b + CyclicTerm b c + CyclicTerm c a\n\n/-- The complete left-hand side displayed in the source problem. -/\nnoncomputable def LeftHandSide (a b c : ℝ) : ℝ :=\n CyclicSum a b c\n + 4 * (a ^ 2 + b ^ 2 + c ^ 2) / (a + b + c) ^ 2\n\n/-- The inequality to be proved, under the positivity assumptions on `a`, `b`, `c`. -/\nnoncomputable def InequalityHolds (a b c : ℝ) : Prop :=\n LeftHandSide a b c ≥ (7 : ℝ) / 3\n\n/-- The full universally quantified statement from the source problem:\nfor all positive real `a`, `b`, and `c`, the displayed inequality holds. -/\nnoncomputable def Target : Prop :=\n ∀ a b c : ℝ, IsAdmissible a b c → InequalityHolds a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fbf592bf-333e-52a8-aac3-291356b527a4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "c7d08a7159904b87e140f3e9ef2e96c5cf250380fe34e74783b92e4daa4c00c8", "task_path": "tasks/nmp3_fbf592bf-333e-52a8-aac3-291356b527a4", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fbf592bf-333e-52a8-aac3-291356b527a4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fc12de9e-bb32-5329-8fa7-6c107ad49001", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n$ be a positive integer. A sequence $x_1,x_2,\\dots,x_{n^2}$ of length $n^2$ is called $n$‑good if each $x_i\\in\\{1,2,\\dots,n\\}$ and the ordered pairs $(x_i,x_{i+1})$ (indices taken modulo $n^2$) are all distinct. Two $n$‑good sequences $(x_i)_{i=1}^{n^2}$ and $(y_i)_{i=1}^{n^2}$ are called similar if there exists an integer $k$ such that $y_i=x_{i+k}$ for every $i$ (indices modulo $n^2$). Suppose there exists a non‑trivial permutation $\\sigma$ of $\\{1,2,\\dots,n\\}$ and an $n$‑good sequence $x_1,\\dots,x_{n^2}$ that is similar to the permuted sequence $\\sigma(x_1),\\sigma(x_2),\\dots,\\sigma(x_{n^2})$. Prove that $n\\equiv2\\pmod4\\,. $\nimport Mathlib\n\n/-!\n# Formalization of the `n`-good cyclic sequence problem\n\nThe source problem is a statement to be proved. This file only declares the\nobjects and the proposition; it deliberately contains no proof of the target.\n-/\n\nnamespace Problem\n\n/--\nAn `n`-good sequence: its entries lie in `{1, ..., n}` and all `n^2` cyclic\nadjacent ordered pairs are distinct.\n\nWe index a sequence of length `n^2` by `ZMod (n^2)`. For positive `n` this is\nexactly a cyclic index set of cardinality `n^2`, and addition in `ZMod (n^2)`\nimplements \"indices taken modulo `n^2`\" with wrapping around.\n-/\ndef NGood (n : ℕ) (x : ZMod (n ^ 2) → Fin n) : Prop :=\n Function.Injective (fun i : ZMod (n ^ 2) => (x i, x (i + 1)))\n\n/--\nTwo sequences of length `n^2` are similar when one is a cyclic shift of the\nother. The shift is specified by an integer `k`, exactly as in the problem;\nit is interpreted modulo `n^2` by its cast into `ZMod (n^2)`.\n-/\ndef Similar (n : ℕ) (x y : ZMod (n ^ 2) → Fin n) : Prop :=\n ∃ k : ℤ, ∀ i : ZMod (n ^ 2), y i = x (i + (k : ZMod (n ^ 2)))\n\n/--\nThere is a non-identity permutation `σ` of `{1, ..., n}` and an `n`-good\nsequence `x` that is similar to the sequence obtained by applying `σ`\nentrywise.\n-/\ndef HasNontrivialPermutedSimilarSequence (n : ℕ) : Prop :=\n ∃ σ : Equiv.Perm (Fin n), σ ≠ 1 ∧\n ∃ x : ZMod (n ^ 2) → Fin n,\n NGood n x ∧ Similar n x (fun i => σ (x i))\n\n/--\nThe assertion of the problem: for every positive integer `n`, existence of a\nnon-trivial permutation and a similar permuted `n`-good sequence forces\n`n ≡ 2 (mod 4)`.\n-/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → HasNontrivialPermutedSimilarSequence n → n % 4 = 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fc12de9e-bb32-5329-8fa7-6c107ad49001", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1a3c984c605e1bb444c98667850fc18cd5e6fe40e90f5bac2b741ad121bf3805", "task_path": "tasks/nmp3_fc12de9e-bb32-5329-8fa7-6c107ad49001", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fc12de9e-bb32-5329-8fa7-6c107ad49001", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fc13f62c-e03b-5332-a12f-85b85d703e88", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given $n>4$ points in the plane, with no three collinear, prove that there are at least $\\displaystyle\\frac{(n-3)(n-4)}{2}$ convex quadrilaterals whose vertices are among the $n$ points.\nimport Mathlib\n\n/-!\n# Convex quadrilaterals among points in the plane\n\nThis file formalizes the statement of the problem. The plane is represented by\n`EuclideanSpace ℝ (Fin 2)`. A convex quadrilateral is represented by a\nfour-element finite set of points in convex position; thus different vertex\norderings do not give different quadrilaterals.\n-/\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout this formalization. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- A finite set of points has no three collinear points: every choice of three\npairwise distinct points from the set is not collinear. -/\ndef NoThreeCollinear (P : Finset Plane) : Prop :=\n ∀ (p q r : Plane), p ∈ P → q ∈ P → r ∈ P →\n p ≠ q → p ≠ r → q ≠ r → ¬ Collinear ℝ ({p, q, r} : Set Plane)\n\n/-- A finite set of points is in convex position when no point of the set lies in\nthe convex hull of the other points of the set. For four distinct points this is\nexactly the condition that the four points are the vertices of a convex\nquadrilateral. -/\ndef ConvexPosition (Q : Finset Plane) : Prop :=\n ∀ p : Plane, p ∈ Q → p ∉ convexHull ℝ (((Q.erase p : Finset Plane) : Set Plane))\n\n/-- A convex quadrilateral with vertices among a finite point set is a\nfour-element subset in convex position. -/\ndef ConvexQuadrilateral (Q : Finset Plane) : Prop :=\n Q.card = 4 ∧ ConvexPosition Q\n\n/-- The number of convex quadrilaterals whose vertices belong to `P`. -/\nnoncomputable def convexQuadrilateralCount (P : Finset Plane) : ℕ := by\n classical\n exact ((P.powersetCard 4).filter (fun Q => ConvexQuadrilateral Q)).card\n\n/-- The statement of the problem: for any configuration of `n > 4` points in\nthe plane with no three collinear, at least `(n - 3) * (n - 4) / 2` of the\nfour-point subsets are convex quadrilaterals. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (P : Finset Plane),\n 4 < n →\n P.card = n →\n NoThreeCollinear P →\n (convexQuadrilateralCount P : ℝ) ≥\n (((n : ℝ) - 3) * ((n : ℝ) - 4) / 2)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fc13f62c-e03b-5332-a12f-85b85d703e88", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "aa1b311f8dac5e21b7d814911a6bd6e9701aed237dca4dd18cacb4377345bfda", "task_path": "tasks/nmp3_fc13f62c-e03b-5332-a12f-85b85d703e88", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fc13f62c-e03b-5332-a12f-85b85d703e88", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fc3dc7d2-7c87-51b0-9380-58e3a5429552", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ be real numbers satisfying $ab+bc+ca=1$. Prove that \n-- $$a\\sqrt{1+bc}+b\\sqrt{1+ca}+c\\sqrt{1+ab}\\ge 2.$$\nimport Mathlib\n\n/-!\n# Formalization of the three-variable square-root inequality\n\nThe original problem asks to prove that for all positive real numbers `a`, `b`, and `c`\nsatisfying `a*b + b*c + c*a = 1`, one has\n`a * sqrt (1 + b*c) + b * sqrt (1 + c*a) + c * sqrt (1 + a*b) >= 2`.\n\nThis file only states the target proposition; it does not prove it.\n-/\n\nnamespace Problem\n\n/-- The admissibility conditions on the real parameters `a`, `b`, and `c`:\nall three are strictly positive and satisfy `ab + bc + ca = 1`. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = 1\n\n/-- The left-hand side of the inequality in the problem statement. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n a * Real.sqrt (1 + b * c) +\n b * Real.sqrt (1 + c * a) +\n c * Real.sqrt (1 + a * b)\n\n/-- The claimed conclusion for fixed parameters `a`, `b`, and `c`. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n 2 ≤ lhs a b c\n\n/-- The full assertion of the problem: for every triple of real numbers satisfying\nthe positivity and constraint assumptions, the displayed square-root inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Admissible a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fc3dc7d2-7c87-51b0-9380-58e3a5429552", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "52960a4ba3370555dda7061a80b9436db5094413b37699feeff5de52794be869", "task_path": "tasks/nmp3_fc3dc7d2-7c87-51b0-9380-58e3a5429552", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fc3dc7d2-7c87-51b0-9380-58e3a5429552", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fc4f4c59-e12b-545a-970e-41402191bbae", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,\\;y,\\;z>0$ with $xyz=1$. Prove that \n-- \\[\n-- \\frac{1}{\\sqrt[3]{14x^{2}+12x+1}}+\\frac{1}{\\sqrt[3]{14y^{2}+12y+1}}+\\frac{1}{\\sqrt[3]{14z^{2}+12z+1}}\\ge 1\\,. \n-- \\]\nimport Mathlib.Analysis.SpecialFunctions.Pow.Real\n\n/-!\n# Formalization of a three-variable real inequality\n\nThe source problem asks to prove, for positive real numbers `x`, `y`, and `z`\nwhose product is `1`, a lower bound for a sum of reciprocals of real cube roots.\n\nMathlib does not provide a dedicated real cube-root function at this commit, so\n`realCubeRoot` is represented using the real power `a ^ (1 / 3 : ℝ)`. The\nradicands appearing in the statement are positive under the assumptions, and on\npositive reals this real power is the usual (nonnegative) real cube root.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The common quadratic radicand `14 t ^ 2 + 12 * t + 1`. -/\ndef radicand (t : ℝ) : ℝ :=\n (14 : ℝ) * t ^ (2 : ℕ) + (12 : ℝ) * t + (1 : ℝ)\n\n/-- The real cube root of `a`, represented as the real power `a ^ (1 / 3)`. -/\ndef realCubeRoot (a : ℝ) : ℝ :=\n Real.rpow a ((1 : ℝ) / (3 : ℝ))\n\n/-- The summand `1 / (14 t ^ 2 + 12 t + 1) ^ (1 / 3)`. -/\ndef summand (t : ℝ) : ℝ :=\n (1 : ℝ) / realCubeRoot (radicand t)\n\n/-- The asserted inequality for arbitrary positive real `x`, `y`, and `z` with\nproduct `1`. -/\ndef Target : Prop :=\n ∀ x y z : ℝ,\n 0 < x → 0 < y → 0 < z →\n x * y * z = (1 : ℝ) →\n (1 : ℝ) ≤ summand x + summand y + summand z\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fc4f4c59-e12b-545a-970e-41402191bbae", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "a2d10a79d5723b66a7ef628b56c8ecbf41860aef4294a666a961a78cd4fd3b57", "task_path": "tasks/nmp3_fc4f4c59-e12b-545a-970e-41402191bbae", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fc4f4c59-e12b-545a-970e-41402191bbae", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fc6295ba-850a-5faa-8418-463b2fc70157", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- In a convex quadrilateral $ABCD$ we have \n-- $$AB\\cdot CD = BC\\cdot DA$$ \n-- and \n-- $$2\\angle A + \\angle C = 180^\\circ.$$ \n-- Let $P$ be the point on the circumcircle of $\\triangle ABD$ that is the midpoint of the arc $BD$ not containing $A$, and suppose $P$ lies inside the quadrilateral $ABCD$. Prove that \n-- $$\\angle BCA = \\angle DCP.$$\n/-\nFormalization of the statement in `problem.md`.\n\nThis file states the geometric claim; it deliberately contains no proof of it.\n-/\n\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\nimport Mathlib.Geometry.Euclidean.Sphere.Basic\nimport Mathlib.Analysis.Convex.Hull\nimport Mathlib.Analysis.Normed.Affine.Convex\nimport Mathlib.Topology.Algebra.Module.FiniteDimension\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The Euclidean plane used throughout the formalization, represented as the real\ninner-product space with two coordinates. -/\nabbrev Plane : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The two-dimensional cross product (or signed area factor) of two vectors. -/\ndef cross (u v : Plane) : ℝ := u 0 * v 1 - u 1 * v 0\n\n/-- The signed area of the oriented triangle with vertices `A`, `B`, `C`. Its sign\nrecords on which side of the directed line `AB` the point `C` lies. -/\ndef signedArea (A B C : Plane) : ℝ := cross (B - A) (C - A)\n\n/-- The points `X` and `Y` lie on strictly opposite sides of the line through `U`\nand `V`. In particular, `U` and `V` are understood to be distinct when this\npredicate is used in the convex-quadrilateral setting. -/\ndef OppositeSidesOfLine (U V X Y : Plane) : Prop :=\n signedArea U V X * signedArea U V Y < 0\n\n/-- `A`, `B`, `C`, and `D` are the vertices, in that cyclic order, of a strictly\nconvex quadrilateral. The two alternatives allow either the counterclockwise\nor the clockwise orientation. In each alternative every directed side has the\nother two vertices strictly on the same side: left of every side in the\ncounterclockwise case, and right of every side in the clockwise case. This\nexcludes collinear consecutive vertices and self-intersection. -/\ndef ConvexQuadrilateral (A B C D : Plane) : Prop :=\n (0 < signedArea A B C ∧ 0 < signedArea A B D ∧\n 0 < signedArea B C D ∧ 0 < signedArea B C A ∧\n 0 < signedArea C D A ∧ 0 < signedArea C D B ∧\n 0 < signedArea D A B ∧ 0 < signedArea D A C) ∨\n (signedArea A B C < 0 ∧ signedArea A B D < 0 ∧\n signedArea B C D < 0 ∧ signedArea B C A < 0 ∧\n signedArea C D A < 0 ∧ signedArea C D B < 0 ∧\n signedArea D A B < 0 ∧ signedArea D A C < 0)\n\n/-- `P` lies strictly inside the convex quadrilateral whose vertices are\n`A`, `B`, `C`, and `D`. Since those vertices are in strictly convex position,\nthis topological interior is exactly the interior of the quadrilateral. -/\ndef InsideQuadrilateral (A B C D P : Plane) : Prop :=\n P ∈ interior (convexHull ℝ ({A, B, C, D} : Set Plane))\n\n/-- `P` lies on the circumcircle of the nondegenerate triangle `ABD`, is\nequidistant from `B` and `D`, and lies on the side of chord `BD` opposite to\n`A`. In the presence of the other conjuncts, these conditions say exactly that\n`P` is the midpoint of the arc `BD` that does not contain `A`: the circle minus\nthe two endpoints `B` and `D` has two arcs, one on each side of the chord `BD`,\nand the equidistance condition selects the midpoint on the relevant arc. -/\ndef IsMidpointOfArcBDNotContainingA (A B D P : Plane) : Prop :=\n EuclideanGeometry.Cospherical ({A, B, D, P} : Set Plane) ∧\n dist P B = dist P D ∧ OppositeSidesOfLine B D A P\n\n/-- The exact statement asserted in the problem.\n\nFor every convex quadrilateral `ABCD` satisfying the side-length product\ncondition and the angle condition, and for every point `P` on the circumcircle\nof `ABD` that is the midpoint of the arc `BD` not containing `A` and that lies\nin the strict interior of the quadrilateral, the angles `∠BCA` and `∠DCP` are\nequal. Ordinary (unoriented) Euclidean angles, measured in radians, are used. -/\ndef Target : Prop :=\n ∀ A B C D : Plane,\n ConvexQuadrilateral A B C D →\n dist A B * dist C D = dist B C * dist D A →\n 2 * EuclideanGeometry.angle D A B +\n EuclideanGeometry.angle B C D = Real.pi →\n ∀ P : Plane,\n IsMidpointOfArcBDNotContainingA A B D P →\n InsideQuadrilateral A B C D P →\n EuclideanGeometry.angle B C A = EuclideanGeometry.angle D C P\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fc6295ba-850a-5faa-8418-463b2fc70157", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2cddc98504579a03dcae0a4ebbdef38709b3248cd1e03855e83e3793d3a2c795", "task_path": "tasks/nmp3_fc6295ba-850a-5faa-8418-463b2fc70157", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fc6295ba-850a-5faa-8418-463b2fc70157", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fc84b6f6-709b-5364-b787-fc36a55dd445", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $z_1,z_2,z_3,z_4\\in\\mathbb C$ satisfy $|z_j|=1$ and $z_j\\neq1$ for each $j\\in\\{1,2,3,4\\}$. Prove that \n-- \\[\n-- 3 - z_1 - z_2 - z_3 - z_4 + z_1z_2z_3z_4 \\neq 0.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks to prove that a particular expression in four complex\nnumbers cannot vanish when all four numbers lie on the complex unit circle and\nnone of them equals one.\n-/\n\nnamespace Problem\n\n/-- The assertion of the problem: for all complex numbers `z₁`, `z₂`, `z₃`, and\n`z₄`, if each has complex absolute value `1` and none equals `1`, then\n`3 - z₁ - z₂ - z₃ - z₄ + z₁ z₂ z₃ z₄` is nonzero. -/\ndef Target : Prop :=\n ∀ z₁ z₂ z₃ z₄ : ℂ,\n ‖z₁‖ = (1 : ℝ) → z₁ ≠ 1 →\n ‖z₂‖ = (1 : ℝ) → z₂ ≠ 1 →\n ‖z₃‖ = (1 : ℝ) → z₃ ≠ 1 →\n ‖z₄‖ = (1 : ℝ) → z₄ ≠ 1 →\n (3 : ℂ) - z₁ - z₂ - z₃ - z₄ + z₁ * z₂ * z₃ * z₄ ≠ 0\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fc84b6f6-709b-5364-b787-fc36a55dd445", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7c1e42d731512d772b30e0ab51192b36ecfbff3e6f478ab38cac536cb4172b9d", "task_path": "tasks/nmp3_fc84b6f6-709b-5364-b787-fc36a55dd445", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fc84b6f6-709b-5364-b787-fc36a55dd445", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fcb83636-18df-5ad1-82aa-f3cde780fe3e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $m$ and $n$ be positive integers with $m>n$ and $m-n$ even. Suppose that $m^2-n^2+1$ divides $n^2-1$. Prove that $m^2-n^2+1$ is a perfect square.\nimport Mathlib\n\n/-!\n# Formal statement of the problem\n\nThe problem asks us to prove, for positive integers `m` and `n` with `m > n`\nand `m - n` even, that if `m^2 - n^2 + 1` divides `n^2 - 1`, then\n`m^2 - n^2 + 1` is a perfect square.\n\nThis file formalizes the statement only. In particular, `Problem.Target` is a\n`Prop`-valued definition; no proof of the target is supplied or assumed.\n-/\n\nnamespace Problem\n\n/-- A natural number is a perfect square when it is the square of a natural\nnumber. Since the number `m ^ 2 - n ^ 2 + 1` in the target is positive, this\nis the same notion as being a square of an integer. -/\ndef IsPerfectSquare (a : ℕ) : Prop :=\n ∃ k : ℕ, a = k ^ 2\n\n/-- The hypotheses of the problem for positive integers `m` and `n`:\n`m > n`, `m - n` is even, and `m ^ 2 - n ^ 2 + 1` divides `n ^ 2 - 1`.\n\nThe subtraction and divisibility are those of natural numbers. Under\n`n < m`, the subtraction `m - n` and the displayed subtractions are exact\n(non-truncated) natural-number differences. -/\ndef Hypotheses (m n : ℕ) : Prop :=\n 0 < m ∧\n 0 < n ∧\n m > n ∧\n Even (m - n) ∧\n (m ^ 2 - n ^ 2 + 1) ∣ (n ^ 2 - 1)\n\n/-- The full assertion of the problem: for all positive integers `m` and `n`\nsatisfying the stated parity and divisibility hypotheses, `m ^ 2 - n ^ 2 + 1`\nis a perfect square. -/\ndef Target : Prop :=\n ∀ m n : ℕ, Hypotheses m n → IsPerfectSquare (m ^ 2 - n ^ 2 + 1)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fcb83636-18df-5ad1-82aa-f3cde780fe3e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1d7bdb46529be31612aed01e7dca384cbe9bf005ac2d5c85cb0b8b14f8057515", "task_path": "tasks/nmp3_fcb83636-18df-5ad1-82aa-f3cde780fe3e", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fcb83636-18df-5ad1-82aa-f3cde780fe3e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fce2551b-b299-5eaa-848a-435eac7039af", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Define a sequence $\\{x_n\\}$ by $x_1=0$, $x_2=1$, and for every integer $n\\ge 2$,\n-- \\[\n-- x_{n+1}= \\Bigl(1+\\frac1n\\Bigr)x_n - x_{n-1}.\n-- \\]\n-- Prove that for all $n\\in\\mathbb{N}$,\n-- \\[\n-- (x_n)^2\\le \\frac{8}{3}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the sequence inequality problem\n\nThe source problem defines a real sequence by the initial values `x₁ = 0`,\n`x₂ = 1`, and a second-order recurrence, then asks for a uniform bound on the\nsquare of every term. Lean's `ℕ` contains `0`, whereas the source sequence is\nintroduced only at positive indices. The concrete sequence below therefore\nassigns an arbitrary value at index `0`; that value is outside the problem and\nis never used by the target statement.\n-/\n\nnamespace Problem\n\n/-- The two initial conditions `x₁ = 0` and `x₂ = 1`. -/\ndef InitialConditions (x : ℕ → ℝ) : Prop :=\n x 1 = 0 ∧ x 2 = 1\n\n/--\nThe recurrence, with the source's division `1 / n` interpreted as division in\n`ℝ`. The binder is restricted to natural `n ≥ 2`; every integer satisfying\nthis inequality is a positive natural index, and then `n - 1` is the ordinary\npredecessor.\n-/\ndef Recurrence (x : ℕ → ℝ) : Prop :=\n ∀ n : ℕ, 2 ≤ n →\n x (n + 1) = (1 + (1 : ℝ) / (n : ℝ)) * x n - x (n - 1)\n\n/-- Admissibility predicate for the source sequence on positive indices. -/\ndef IsProblemSequence (x : ℕ → ℝ) : Prop :=\n InitialConditions x ∧ Recurrence x\n\n/--\nThe concrete real-valued sequence determined by the initial values and the\nrecurrence. The branch `n + 3` computes `x_{n+3}` from `x_{n+2}`, `x_{n+1}`,\nand the recurrence with index `n + 2`. The value assigned at index `0` is\narbitrary and has no role in the problem.\n-/\nnoncomputable def problemSequence : ℕ → ℝ\n | 0 => 0\n | 1 => 0\n | 2 => 1\n | n + 3 =>\n (1 + (1 : ℝ) / ((n + 2 : ℕ) : ℝ)) * problemSequence (n + 2)\n - problemSequence (n + 1)\n\n/-- The concrete sequence has the prescribed initial values. -/\ntheorem problemSequence_initial : InitialConditions problemSequence := by\n constructor <;> rfl\n\n/-- The concrete sequence satisfies the prescribed recurrence. -/\ntheorem problemSequence_recurrence : Recurrence problemSequence := by\n intro n hn\n obtain ⟨k, rfl⟩ := Nat.exists_eq_add_of_le hn\n have h1 : 2 + k + 1 = k + 3 := by omega\n have h2 : 2 + k = k + 2 := by omega\n have h3 : k + 2 - 1 = k + 1 := by omega\n rw [h1, h2, h3]\n rfl\n\n/-- The concrete sequence is admissible for the source recurrence problem. -/\ntheorem problemSequence_isProblemSequence : IsProblemSequence problemSequence :=\n ⟨problemSequence_initial, problemSequence_recurrence⟩\n\n/-- The assertion to be proved: for every positive natural index `n`, the\nsquare of the corresponding term is at most `8 / 3`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 1 ≤ n → (problemSequence n) ^ 2 ≤ (8 : ℝ) / 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fce2551b-b299-5eaa-848a-435eac7039af", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "7d7acb881d171b5e69549b73048f307ff58b5e8ae831e9a30a93ca3e42804456", "task_path": "tasks/nmp3_fce2551b-b299-5eaa-848a-435eac7039af", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fce2551b-b299-5eaa-848a-435eac7039af", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fd0e81c3-16e5-5a2a-a89f-ea771d905e77", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n\\ge 3$ be an integer and let $x_1\\le x_2\\le\\cdots\\le x_n$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{x_n x_1}{x_2}+\\frac{x_1 x_2}{x_3}+\\frac{x_2 x_3}{x_4}+\\dots+\\frac{x_{n-1}x_n}{x_1}\\ge x_1+x_2+\\dots+x_n.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The zero-based cyclic index corresponding to adding `k` to a `Fin n` index.\n\nFor an index `i`, `CyclicIndex i k` has value `(i.val + k) % n`. It is used to\nexpress the cyclic convention `x_{n+1} = x_1`, `x_{n+2} = x_2` in the statement. -/\ndef CyclicIndex {n : ℕ} (i : Fin n) (k : ℕ) : Fin n :=\n ⟨(i.val + k) % n, Nat.mod_lt _ (Fin.pos i)⟩\n\n/-- The cyclic term `x_i * x_{i+1} / x_{i+2}`, with zero-based `Fin n` indices\nand indices read modulo `n`. -/\ndef CyclicTerm {n : ℕ} (x : Fin n → ℝ) (i : Fin n) : ℝ :=\n x i * x (CyclicIndex i 1) / x (CyclicIndex i 2)\n\n/-- The left-hand side of the claimed inequality:\n`∑ i, x_i * x_{i+1} / x_{i+2}`, with cyclic indices. -/\ndef LeftSide {n : ℕ} (x : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, CyclicTerm x i\n\n/-- The right-hand side of the claimed inequality: `∑ i, x_i`. -/\ndef RightSide {n : ℕ} (x : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, x i\n\n/-- The assertion of the problem: for every natural number `n ≥ 3`, and every\npositive nondecreasing real `n`-tuple `x`, the cyclic sum\n`∑ i, x_i * x_{i+1} / x_{i+2}` is at least `∑ i, x_i`.\n\nHere indices are zero-based `Fin n` indices; the source's `j`-th entry\n`x_j` is represented by `x ⟨j - 1, _⟩`. The source's cyclic convention is\nimplemented by `CyclicIndex`. -/\ndef Target : Prop :=\n ∀ (n : ℕ) (_hn : 3 ≤ n) (x : Fin n → ℝ),\n (∀ i : Fin n, 0 < x i) →\n (∀ i j : Fin n, i ≤ j → x i ≤ x j) →\n LeftSide x ≥ RightSide x\n\nend Problem\n\nend\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fd0e81c3-16e5-5a2a-a89f-ea771d905e77", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "4b6a8c0a523b633b3f89809f6d830da92352156568211af5d87b6b665e4804ef", "task_path": "tasks/nmp3_fd0e81c3-16e5-5a2a-a89f-ea771d905e77", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fd0e81c3-16e5-5a2a-a89f-ea771d905e77", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fd335c0c-a785-5c31-8b35-ee54c3f4d4a8", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $x,y,z>0$. Prove that \n-- \\[\n-- yz\\sqrt{x^{2}+y^{2}}+zx\\sqrt{y^{2}+z^{2}}+xy\\sqrt{z^{2}+x^{2}}\\le \\sqrt{2}\\,\\bigl(x^{2}y+y^{2}z+z^{2}x\\bigr).\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement of the three-variable radical inequality\n\nThe source problem asks to prove, for positive real numbers `x`, `y`, and `z`,\nthe inequality\n\n`y*z*√(x^2+y^2) + z*x*√(y^2+z^2) + x*y*√(z^2+x^2)\n ≤ √2*(x^2*y + y^2*z + z^2*x)`.\n\nThis file records the statement only; it intentionally contains no proof.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\ndef leftSide (x y z : ℝ) : ℝ :=\n y * z * Real.sqrt (x ^ 2 + y ^ 2) +\n z * x * Real.sqrt (y ^ 2 + z ^ 2) +\n x * y * Real.sqrt (z ^ 2 + x ^ 2)\n\n/-- The right-hand side of the inequality. -/\ndef rightSide (x y z : ℝ) : ℝ :=\n Real.sqrt 2 * (x ^ 2 * y + y ^ 2 * z + z ^ 2 * x)\n\n/--\nThe full universal assertion from the problem: for all positive real numbers\n`x`, `y`, and `z`, the stated radical expression is at most the stated cubic\nexpression.\n-/\ndef Target : Prop :=\n ∀ x y z : ℝ, 0 < x → 0 < y → 0 < z →\n leftSide x y z ≤ rightSide x y z\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fd335c0c-a785-5c31-8b35-ee54c3f4d4a8", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e3fa2be018aeafd49d1d64941c8df60b8f8ef768ee7c9d1d182f83e6f6b1371e", "task_path": "tasks/nmp3_fd335c0c-a785-5c31-8b35-ee54c3f4d4a8", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fd335c0c-a785-5c31-8b35-ee54c3f4d4a8", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fd3fb3e6-ca25-5c4d-89a6-f2ebb5d5601e", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given four positive real numbers $a,b,c,d$ such that $a^2+b^2+c^2+d^2+45abcd=1$, prove that \n-- \\[\n-- \\Big(\\frac1a-1\\Big)\\Big(\\frac1b-1\\Big)\\Big(\\frac1c-1\\Big)\\Big(\\frac1d-1\\Big)\\ge 16.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of a positivity/constraint inequality\n\nThe source problem asks us to prove, for four positive real numbers\n`a, b, c, d` satisfying\n\n`a^2 + b^2 + c^2 + d^2 + 45 * a * b * c * d = 1`,\n\nthat\n\n`(1 / a - 1) * (1 / b - 1) * (1 / c - 1) * (1 / d - 1) >= 16`.\n\nThe declarations below record the exact proposition as a target. No proof is\nsupplied.\n-/\n\nnamespace Problem\n\n/-- The admissibility hypotheses for the quadruple `(a, b, c, d)` in the\nsource problem: all four entries are positive real numbers and they satisfy\nthe stated quadratic/quartic constraint. -/\ndef Admissible (a b c d : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧\n a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 + 45 * a * b * c * d = 1\n\n/-- The inequality asserted under the admissibility hypotheses. -/\ndef InequalityHolds (a b c d : ℝ) : Prop :=\n (1 / a - 1) * (1 / b - 1) * (1 / c - 1) * (1 / d - 1) ≥ 16\n\n/-- The complete statement to be proved: for every quadruple of positive real\nnumbers satisfying the stated constraint, the displayed product is at least\n`16`. -/\ndef Target : Prop :=\n ∀ a b c d : ℝ, Admissible a b c d → InequalityHolds a b c d\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fd3fb3e6-ca25-5c4d-89a6-f2ebb5d5601e", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "0ae9c37a5d8fe2699e8e367da975d5be5c81abc1e609e0abf474e848ef463589", "task_path": "tasks/nmp3_fd3fb3e6-ca25-5c4d-89a6-f2ebb5d5601e", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fd3fb3e6-ca25-5c4d-89a6-f2ebb5d5601e", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fd475cdf-9010-546b-b80d-16f611bedb5b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $f:(0,\\infty)\\to\\mathbb{R}$ be continuous. Suppose that for every $x>0$ we have \n-- \\[\n-- \\lim_{n\\to\\infty}f(nx)=+\\infty,\n-- \\] \n-- where $n$ ranges over the positive integers. Prove that \n-- \\[\n-- \\lim_{x\\to\\infty}f(x)=+\\infty.\n-- \\]\nimport Mathlib\n\n/-!\n# Statement formalization\n\nThe problem concerns functions defined on the positive real line. We model that\nopen domain as the subtype `Set.Ioi (0 : ℝ)`. Limits to `+∞` are represented by\nthe order filter `Filter.atTop`, both for the positive-integer sequence index and\nfor real values.\n-/\n\nnamespace Problem\n\n/-- The domain `(0, ∞)`, represented as a subtype of the real numbers. -/\nabbrev PositiveReals : Type := Set.Ioi (0 : ℝ)\n\n/-- The canonical element of `(0, ∞)` determined by a positive real number. -/\ndef positiveReal (x : ℝ) (hx : 0 < x) : PositiveReals := ⟨x, hx⟩\n\n/--\nFor a fixed positive real `x`, the positive-integer sequence\n`n ↦ f (n * x)` tends to `+∞`.\n-/\ndef SequenceCondition (f : PositiveReals → ℝ) (x : ℝ) (hx : 0 < x) : Prop :=\n Filter.Tendsto\n (fun n : ℕ+ =>\n f (positiveReal ((n : ℝ) * x)\n (mul_pos (by exact_mod_cast n.pos) hx)))\n Filter.atTop Filter.atTop\n\n/--\nThe assumed hypothesis: for every positive real `x`, `f (n * x)` tends to\n`+∞` as the positive integer `n` tends to infinity.\n-/\ndef Hypothesis (f : PositiveReals → ℝ) : Prop :=\n ∀ (x : ℝ) (hx : 0 < x), SequenceCondition f x hx\n\n/-- The claimed conclusion: `f (x)` tends to `+∞` as `x` tends to infinity. -/\ndef Conclusion (f : PositiveReals → ℝ) : Prop :=\n Filter.Tendsto f Filter.atTop Filter.atTop\n\n/--\nThe complete assertion of the problem: every continuous function on `(0, ∞)`\nwhose normalized positive-integer sequences all tend to `+∞` itself tends to\n`+∞` at infinity.\n-/\ndef Target : Prop :=\n ∀ f : PositiveReals → ℝ, Continuous f → Hypothesis f → Conclusion f\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fd475cdf-9010-546b-b80d-16f611bedb5b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "8e27306a2835d7c44454dcb3e254d2e29bcdf5343374da7d1faa763c33960eac", "task_path": "tasks/nmp3_fd475cdf-9010-546b-b80d-16f611bedb5b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fd475cdf-9010-546b-b80d-16f611bedb5b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fd4ec7f4-437c-556f-aaef-4a6712c91fd4", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For positive real numbers $a,b,c$, prove that \n-- \\[\n-- \\sqrt{20(a^{2}+18ab+b^{2})}+\\sqrt{20(b^{2}+18bc+c^{2})}+\\sqrt{20(c^{2}+18ca+a^{2})}+7\\sqrt{3(a^{2}+b^{2}+c^{2})}\\le 27(a+b+c)\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for a three-variable radical inequality\n\nThe source problem asks to prove, for every triple of positive real numbers\n`a`, `b`, and `c`, the stated inequality involving real square roots.\n-/\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. -/\nnoncomputable def lhs (a b c : ℝ) : ℝ :=\n Real.sqrt (20 * (a ^ 2 + 18 * a * b + b ^ 2)) +\n Real.sqrt (20 * (b ^ 2 + 18 * b * c + c ^ 2)) +\n Real.sqrt (20 * (c ^ 2 + 18 * c * a + a ^ 2)) +\n 7 * Real.sqrt (3 * (a ^ 2 + b ^ 2 + c ^ 2))\n\n/-- The right-hand side of the inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n 27 * (a + b + c)\n\n/-- The asserted inequality, without the positivity hypotheses. -/\ndef Inequality (a b c : ℝ) : Prop :=\n lhs a b c ≤ rhs a b c\n\n/-- The complete source assertion: for all positive real numbers `a`, `b`, and `c`,\nthe stated radical inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → Inequality a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fd4ec7f4-437c-556f-aaef-4a6712c91fd4", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "098126ac98486e397ae3e72632685b36c0374526bab811b0dac77fec41ab5ffe", "task_path": "tasks/nmp3_fd4ec7f4-437c-556f-aaef-4a6712c91fd4", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fd4ec7f4-437c-556f-aaef-4a6712c91fd4", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fd744f30-583b-58bb-89bf-cd4f18a1291d", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all sufficiently large positive integers $n$, among any $n$ distinct positive integers there exist four whose least common multiple exceeds $n^{3.99}$.\nimport Mathlib\n\n/-!\n# Formal statement\n\nThe source problem asks to prove that, for all sufficiently large positive\nintegers `n`, every finite set of `n` distinct positive integers contains a\nfour-element subset whose least common multiple is greater than\n`n ^ (3.99)`.\n\nThe exponent is interpreted as the real number `399 / 100`. The least common\nmultiple of a finite set of natural numbers is compared with the real power\nafter coercing it to `ℝ`.\n-/\n\nnamespace Problem\n\n/-- The real exponent `3.99`, written as the exact rational `399 / 100`. -/\nnoncomputable def Exponent : ℝ := (399 : ℝ) / 100\n\n/-- The least common multiple of a finite set of natural numbers. -/\ndef FinsetLcm (s : Finset ℕ) : ℕ := s.lcm id\n\n/--\n`HasFourLargeLcm n s` says that `s` contains four distinct elements (a\nfour-element finite subset) whose least common multiple, as a real number,\nstrictly exceeds `n ^ (3.99)`.\n-/\nnoncomputable def HasFourLargeLcm (n : ℕ) (s : Finset ℕ) : Prop :=\n ∃ t : Finset ℕ,\n t ⊆ s ∧\n t.card = 4 ∧\n ((FinsetLcm t : ℕ) : ℝ) > (n : ℝ) ^ Exponent\n\n/--\nFor all sufficiently large positive integers `n`, any finite set `s` of exactly\n`n` distinct positive integers has a four-element subset whose least common\nmultiple exceeds `n ^ (3.99)`.\n-/\nnoncomputable def Target : Prop :=\n ∃ N : ℕ,\n 0 < N ∧\n ∀ n : ℕ,\n N ≤ n →\n 0 < n →\n ∀ s : Finset ℕ,\n s.card = n →\n (∀ a ∈ s, 0 < a) →\n HasFourLargeLcm n s\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fd744f30-583b-58bb-89bf-cd4f18a1291d", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b1f869428132c284c6adc22ad26c44aefb1e5fc26d79870495ff333b2c6a908e", "task_path": "tasks/nmp3_fd744f30-583b-58bb-89bf-cd4f18a1291d", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fd744f30-583b-58bb-89bf-cd4f18a1291d", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fd7d04c6-0b93-5dc3-bd27-6f12fdb2f28f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $p,q,n$ be positive integers with $p+q0$ satisfy $a^2+b^2+c^2+abc\\le 4$. Prove that \n-- \\[(1+a)(1+b)(1+c)\\ge (a+b)(b+c)(c+a).\\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The assertion of the problem: for all positive real numbers `a`, `b`, and `c`\nsatisfying `a^2 + b^2 + c^2 + abc ≤ 4`, the product inequality\n`(1+a)(1+b)(1+c) ≥ (a+b)(b+c)(c+a)` holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n 0 < a →\n 0 < b →\n 0 < c →\n a ^ 2 + b ^ 2 + c ^ 2 + a * b * c ≤ 4 →\n (1 + a) * (1 + b) * (1 + c) ≥ (a + b) * (b + c) * (c + a)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fdb57137-684c-53a6-bf4e-01cc24889c80", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "ef41f58059b53ba2f9391df53b03ea25b931a1ccfd19b3a3b00aefa7a1054c92", "task_path": "tasks/nmp3_fdb57137-684c-53a6-bf4e-01cc24889c80", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fdb57137-684c-53a6-bf4e-01cc24889c80", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fdb8ac65-aba1-5bfe-8322-9070455579a5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Given positive real numbers $a,b,c$ such that \n-- \\[\n-- a+b+c\\ge\\frac{a}{b}+\\frac{b}{c}+\\frac{c}{a},\n-- \\] \n-- prove that \n-- \\[\n-- \\frac{a^{3}c}{b(c+a)}+\\frac{b^{3}a}{c(a+b)}+\\frac{c^{3}b}{a(b+c)}\\ge\\frac32.\n-- \\]\nimport Mathlib\n\nnamespace Problem\n\n/-- The admissibility assumptions of the problem: `a`, `b`, and `c` are positive\nreal numbers and satisfy the displayed cyclic inequality. -/\ndef Assumptions (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a + b + c ≥ a / b + b / c + c / a\n\n/-- The cyclic inequality asserted as the conclusion of the problem. -/\ndef Conclusion (a b c : ℝ) : Prop :=\n a ^ 3 * c / (b * (c + a)) +\n b ^ 3 * a / (c * (a + b)) +\n c ^ 3 * b / (a * (b + c)) ≥\n (3 : ℝ) / 2\n\n/-- The full universal statement: for all positive real numbers `a`, `b`, `c`\nsatisfying the displayed hypothesis, the displayed cyclic inequality holds. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, Assumptions a b c → Conclusion a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fdb8ac65-aba1-5bfe-8322-9070455579a5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "82f1675bc91c48aa137daf2edc40e5893d9b89cbef7da6149a02598b55dea9c6", "task_path": "tasks/nmp3_fdb8ac65-aba1-5bfe-8322-9070455579a5", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fdb8ac65-aba1-5bfe-8322-9070455579a5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fdbda132-3055-55d4-a625-7c1108a84149", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for every positive integer $n$ there exists a subset $A\\subset\\{1,2,\\dots,2^n\\}$ with exactly $n$ elements such that for any two distinct non‑empty subsets $X,Y\\subseteq A$, the sum of the elements of $X$ does not divide the sum of the elements of $Y$.\nimport Mathlib\n\nnamespace Problem\n\n/-- The ambient set `{1, 2, ..., 2 ^ n}`. -/\ndef AllowedSet (n : ℕ) : Finset ℕ :=\n Finset.Icc 1 (2 ^ n)\n\n/-- The divisibility condition on the subset sums of a finite set `A`: for every\ntwo distinct nonempty subsets `X` and `Y` of `A`, the sum of the elements of\n`X` does not divide the sum of the elements of `Y`. -/\ndef HasNondividingSubsetSums (A : Finset ℕ) : Prop :=\n ∀ X : Finset ℕ, X.Nonempty → X ⊆ A →\n ∀ Y : Finset ℕ, Y.Nonempty → Y ⊆ A →\n X ≠ Y → ¬ ((∑ x ∈ X, x) ∣ (∑ y ∈ Y, y))\n\n/-- `A` is an admissible `n`-element choice from `{1, 2, ..., 2 ^ n}` for the\nproblem: it has exactly `n` elements and satisfies the nondividing subset-sum\ncondition. -/\ndef Admissible (n : ℕ) (A : Finset ℕ) : Prop :=\n A ⊆ AllowedSet n ∧\n A.card = n ∧\n HasNondividingSubsetSums A\n\n/-- For every positive integer `n`, there exists an `n`-element subset `A` of\n`{1, 2, ..., 2 ^ n}` such that the sum of every nonempty subset of `A` fails\nto divide the sum of every distinct nonempty subset of `A`. -/\ndef Target : Prop :=\n ∀ n : ℕ, 0 < n → ∃ A : Finset ℕ, Admissible n A\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fdbda132-3055-55d4-a625-7c1108a84149", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "286817472680a4f2ce561ed169a98265ca1207eeb88a744716445e28f2c743aa", "task_path": "tasks/nmp3_fdbda132-3055-55d4-a625-7c1108a84149", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fdbda132-3055-55d4-a625-7c1108a84149", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fdc47deb-4947-52cc-bfdd-f0cb64ce027c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there exist infinitely many positive integers $n$ such that $n^2+1$ is square‑free (i.e., not divisible by $p^2$ for any prime $p$).\nimport Mathlib\n\nnamespace Problem\n\n/-- A natural number `m` is square-free when no prime square divides it. -/\ndef PrimeSquarefree (m : ℕ) : Prop :=\n ∀ p : ℕ, p.Prime → ¬ p ^ (2 : ℕ) ∣ m\n\n/-- The admissible positive integers: positive `n` for which `n ^ 2 + 1` is square-free. -/\ndef Admissible (n : ℕ) : Prop :=\n 0 < n ∧ PrimeSquarefree (n ^ 2 + 1)\n\n/-- There are infinitely many positive integers `n` such that `n ^ 2 + 1` is square-free. -/\ndef Target : Prop :=\n Set.Infinite {n : ℕ | Admissible n}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fdc47deb-4947-52cc-bfdd-f0cb64ce027c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "217722a433ef154a201f8d861d033d79c4d353c4e1a6472c5eaf7763da93b175", "task_path": "tasks/nmp3_fdc47deb-4947-52cc-bfdd-f0cb64ce027c", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fdc47deb-4947-52cc-bfdd-f0cb64ce027c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fdedb7df-fae4-5403-ae05-81202a47798b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c,d>0$ and $k\\ge 2$ satisfy $abcd=1$. Prove that \n-- \\[\n-- \\frac{1}{a^{k}b(c+d)}+\\frac{1}{b^{k}c(d+a)}+\\frac{1}{c^{k}d(a+b)}+\\frac{1}{d^{k}a(b+c)}\\ge 2\\,.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The left-hand side of the inequality. All four bases are positive in `Target`;\nthe real-valued exponent is represented by `Real.rpow`. -/\ndef lhs (a b c d k : ℝ) : ℝ :=\n 1 / (Real.rpow a k * b * (c + d)) +\n 1 / (Real.rpow b k * c * (d + a)) +\n 1 / (Real.rpow c k * d * (a + b)) +\n 1 / (Real.rpow d k * a * (b + c))\n\n/-- The hypotheses of the problem: `a`, `b`, `c`, and `d` are positive,\n`k ≥ 2`, and `a b c d = 1`. -/\ndef Admissible (a b c d k : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ 0 < d ∧ 2 ≤ k ∧ a * b * c * d = 1\n\n/-- The asserted inequality for fixed admissible parameters. -/\ndef Claim (a b c d k : ℝ) : Prop :=\n lhs a b c d k ≥ 2\n\n/-- The full universally quantified statement of the problem. -/\ndef Target : Prop :=\n ∀ a b c d k : ℝ, Admissible a b c d k → Claim a b c d k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fdedb7df-fae4-5403-ae05-81202a47798b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5b798dd6a835fb97b71ddfcfb6475aabd811406acf681091974961833fe9c2b6", "task_path": "tasks/nmp3_fdedb7df-fae4-5403-ae05-81202a47798b", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fdedb7df-fae4-5403-ae05-81202a47798b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fe5c4e8d-9dd0-55d4-a521-31654b0f8bd5", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\(a,b,c>0\\) with \\(abc=1\\) and let \\(k\\ge \\frac{10}{19}\\). Prove that \n-- \\[\n-- \\frac{a^{k}}{\\sqrt[3]{\\,b+c\\,}}+\\frac{b^{k}}{\\sqrt[3]{\\,c+a\\,}}+\\frac{c^{k}}{\\sqrt[3]{\\,a+b\\,}}\\ge\\frac{3}{\\sqrt[3]{2}}\\,. \n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the three-variable cyclic inequality\n\nThe original problem is stated for positive real numbers `a`, `b`, and `c`\nwith `a * b * c = 1`, and a real exponent `k` satisfying `k ≥ 10 / 19`.\nThe cube roots are interpreted as principal real cube roots. For a\nnonnegative real `x`, this is `Real.rpow x (1 / 3)`, which agrees with the\nusual real cube root.\n-/\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The principal real cube root of a nonnegative real number, written as the\nreal power with exponent `1 / 3`. The target only applies this function to\npositive arguments (`2`, `b + c`, `c + a`, and `a + b`). -/\ndef realCubeRoot (x : ℝ) : ℝ :=\n Real.rpow x (1 / 3 : ℝ)\n\n/-- The left-hand side of the inequality, with the cyclically permuted\ndenominators `realCubeRoot (b + c)`, `realCubeRoot (c + a)`, and\n`realCubeRoot (a + b)`. -/\ndef lhs (a b c k : ℝ) : ℝ :=\n Real.rpow a k / realCubeRoot (b + c) +\n Real.rpow b k / realCubeRoot (c + a) +\n Real.rpow c k / realCubeRoot (a + b)\n\n/-- The right-hand side `3 / (2 ^ (1 / 3))` of the inequality. -/\ndef rhs : ℝ :=\n (3 : ℝ) / realCubeRoot 2\n\n/-- The full assertion of the problem: for all positive real `a`, `b`, and\n`c` whose product is `1`, and for every real `k ≥ 10 / 19`, the cyclic sum is\nat least `3 / (2 ^ (1 / 3))`. -/\ndef Target : Prop :=\n ∀ (a b c k : ℝ),\n 0 < a →\n 0 < b →\n 0 < c →\n a * b * c = 1 →\n (10 / 19 : ℝ) ≤ k →\n rhs ≤ lhs a b c k\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fe5c4e8d-9dd0-55d4-a521-31654b0f8bd5", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "3d4deca8fdcf1b48e225ca15d35a6ee4bbec33b33585b28246920a9ef355f16a", "task_path": "tasks/nmp3_fe5c4e8d-9dd0-55d4-a521-31654b0f8bd5", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fe5c4e8d-9dd0-55d4-a521-31654b0f8bd5", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fe616bd3-2a32-50d0-a0ed-fc46e17e3ee0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,b,c$, prove that\n-- \\[\n-- \\prod_{\\text{sym}}(a+2b)\\;\\ge\\;27\\bigl(ab+bc+ca\\bigr)^3,\n-- \\]\n-- where $\\prod_{\\text{sym}}(a+2b)$ denotes the product of the six terms\n-- $(a+2b)(b+2a)(a+2c)(c+2a)(b+2c)(c+2b)$ (i.e. the symmetric product of $a+2b$).\nimport Mathlib\n\nnamespace Problem\n\n/-- The six-term symmetric product\n`(a + 2b)(b + 2a)(a + 2c)(c + 2a)(b + 2c)(c + 2b)`. -/\ndef symmetricProduct (a b c : ℝ) : ℝ :=\n (a + 2 * b) * (b + 2 * a) * (a + 2 * c) *\n (c + 2 * a) * (b + 2 * c) * (c + 2 * b)\n\n/-- For all positive real numbers `a`, `b`, and `c`, the symmetric product of\n`a + 2b` is at least `27 * (ab + bc + ca)^3`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c →\n symmetricProduct a b c ≥ 27 * (a * b + b * c + c * a) ^ (3 : ℕ)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fe616bd3-2a32-50d0-a0ed-fc46e17e3ee0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "51a55e2f2f0149033eef7effee93f497ad321b86e58383aeb33981b7df372871", "task_path": "tasks/nmp3_fe616bd3-2a32-50d0-a0ed-fc46e17e3ee0", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fe616bd3-2a32-50d0-a0ed-fc46e17e3ee0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fe6215cc-c370-5ac5-b8cf-0868f4ab9b51", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be positive real numbers. Prove that \n-- \\[\n-- \\frac{a^{4}+b^{4}+c^{4}}{abc}\\ge \n-- \\frac{a^{10}+b^{10}}{a^{9}+b^{9}}+\n-- \\frac{b^{10}+c^{10}}{b^{9}+c^{9}}+\n-- \\frac{c^{10}+a^{10}}{c^{9}+a^{9}}.\n-- \\]\nimport Mathlib\n\n/-!\n# Formal statement for the positive-real inequality problem\n\nThe original problem asks to prove an inequality for all positive real numbers\n`a`, `b`, and `c`. This file records the assertion as a proposition-valued\ndefinition; no proof of the assertion is included.\n-/\n\nnamespace Problem\n\n/-- For all positive real numbers `a`, `b`, and `c`,\n\\[\n\\frac{a^{4}+b^{4}+c^{4}}{abc}\\ge\n\\frac{a^{10}+b^{10}}{a^{9}+b^{9}}+\n\\frac{b^{10}+c^{10}}{b^{9}+c^{9}}+\n\\frac{c^{10}+a^{10}}{c^{9}+a^{9}}.\n\\]\n-/\ndef Target : Prop :=\n ∀ (a b c : ℝ), 0 < a → 0 < b → 0 < c →\n (a ^ 4 + b ^ 4 + c ^ 4) / (a * b * c) ≥\n (a ^ 10 + b ^ 10) / (a ^ 9 + b ^ 9) +\n (b ^ 10 + c ^ 10) / (b ^ 9 + c ^ 9) +\n (c ^ 10 + a ^ 10) / (c ^ 9 + a ^ 9)\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fe6215cc-c370-5ac5-b8cf-0868f4ab9b51", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "b6864f76313fa57cd74d82d8c2cbbcae442203a873f6d797b46ac7572233e57e", "task_path": "tasks/nmp3_fe6215cc-c370-5ac5-b8cf-0868f4ab9b51", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fe6215cc-c370-5ac5-b8cf-0868f4ab9b51", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fe702952-5ca6-5b35-89eb-eed73da7c531", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c$ be the side lengths of a triangle and let $s=\\frac{a+b+c}{2}$ be its semiperimeter. Denote by $m_a,m_b,m_c$ the lengths of the medians to sides $a,b,c$, respectively, and by $h_a,h_b,h_c$ the lengths of the corresponding altitudes. Prove that \n-- $$m_a h_a + m_b h_b + m_c h_c \\le s^2.$$\nimport Mathlib.Analysis.Real.Sqrt\n\n/-!\n# Formal statement of the median-altitude inequality\n\nThe original problem concerns the three side lengths of a (nondegenerate)\ntriangle. For side lengths `a b c` we use the standard formulas determined by\nthe side lengths:\n\n* `medianA a b c` (respectively `medianB`, `medianC`) is the length of the\n median to side `a` (respectively `b`, `c`), via Apollonius' theorem;\n* `heronArea a b c` is the area of the triangle, via Heron's formula;\n* `altitudeA a b c` (respectively `altitudeB`, `altitudeC`) is the altitude to\n side `a` (respectively `b`, `c`), using area equals one half base times\n height.\n\nThe target proposition is the non-strict inequality requested by the problem.\nNo proof is asserted here.\n-/\n\nnamespace Problem\n\n/-- The positive real numbers `a`, `b`, and `c` are the side lengths of a\nnondegenerate Euclidean triangle, expressed by the three strict triangle\ninequalities. -/\ndef IsTriangleSideLengths (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧\n a < b + c ∧ b < a + c ∧ c < a + b\n\n/-- The semiperimeter `s = (a + b + c) / 2`. -/\nnoncomputable def semiperimeter (a b c : ℝ) : ℝ :=\n (a + b + c) / 2\n\n/-- The length of the median to the side of length `a`, determined by the\nthree side lengths through Apollonius' theorem. -/\nnoncomputable def medianA (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * b ^ 2 + 2 * c ^ 2 - a ^ 2)\n\n/-- The length of the median to the side of length `b`. -/\nnoncomputable def medianB (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * a ^ 2 + 2 * c ^ 2 - b ^ 2)\n\n/-- The length of the median to the side of length `c`. -/\nnoncomputable def medianC (a b c : ℝ) : ℝ :=\n (1 / 2 : ℝ) * Real.sqrt (2 * a ^ 2 + 2 * b ^ 2 - c ^ 2)\n\n/-- The area of a triangle with side lengths `a`, `b`, and `c`, expressed by\nHeron's formula. It is a total real-valued function; for actual triangle side\nlengths its radicand is nonnegative. -/\nnoncomputable def heronArea (a b c : ℝ) : ℝ :=\n Real.sqrt\n (semiperimeter a b c * (semiperimeter a b c - a) *\n (semiperimeter a b c - b) * (semiperimeter a b c - c))\n\n/-- The length of the altitude to the side of length `a`, from\n`area = (1 / 2) * base * height`. -/\nnoncomputable def altitudeA (a b c : ℝ) : ℝ :=\n 2 * heronArea a b c / a\n\n/-- The length of the altitude to the side of length `b`. -/\nnoncomputable def altitudeB (a b c : ℝ) : ℝ :=\n 2 * heronArea a b c / b\n\n/-- The length of the altitude to the side of length `c`. -/\nnoncomputable def altitudeC (a b c : ℝ) : ℝ :=\n 2 * heronArea a b c / c\n\n/-- For every nondegenerate triangle with side lengths `a`, `b`, `c`,\n`m_a h_a + m_b h_b + m_c h_c ≤ s^2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, IsTriangleSideLengths a b c →\n medianA a b c * altitudeA a b c +\n medianB a b c * altitudeB a b c +\n medianC a b c * altitudeC a b c ≤\n (semiperimeter a b c) ^ 2\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fe702952-5ca6-5b35-89eb-eed73da7c531", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "1b823bb60155fef3a23679c3151707b5cdc4d5ce5dcfeba0735197d40b7f1bb6", "task_path": "tasks/nmp3_fe702952-5ca6-5b35-89eb-eed73da7c531", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fe702952-5ca6-5b35-89eb-eed73da7c531", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fe914267-352a-5305-bcfb-ce81aaaaa818", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A finite set $A$ of positive integers is called **good** if for every element $x\\in A$, $x$ divides the sum of all elements of $A$. Prove that for any finite set of positive integers there exists a finite good set $B$ such that $A\\subseteq B$.\nimport Mathlib\n\nnamespace Problem\n\n/-- A finite set of positive integers is good when all its elements are positive and\neach element divides the sum of all elements of the set. -/\ndef Good (B : Finset ℕ) : Prop :=\n (∀ x : ℕ, x ∈ B → 0 < x) ∧\n (∀ x : ℕ, x ∈ B → x ∣ B.sum (fun y : ℕ => y))\n\n/-- For every finite set `A` of positive integers, there is a finite good set `B`\ncontaining `A`. -/\ndef Target : Prop :=\n ∀ A : Finset ℕ,\n (∀ x : ℕ, x ∈ A → 0 < x) →\n ∃ B : Finset ℕ, Good B ∧ A ⊆ B\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fe914267-352a-5305-bcfb-ce81aaaaa818", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e19f42440ee96a9a580ddd14d92b50dda9b9fb6dde7f0d2be01d162c124690f8", "task_path": "tasks/nmp3_fe914267-352a-5305-bcfb-ce81aaaaa818", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fe914267-352a-5305-bcfb-ce81aaaaa818", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fea711e8-867c-5c87-bd74-c4f3fe1e5358", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that there is no odd integer $n>1$ for which there exist two (positive) divisors $d_1$ and $d_2$ of $\\frac{n^2+1}{2}$ satisfying $d_1+d_2=n+1$.\nimport Mathlib\n\n/-!\n# Formalization of the divisor-pair statement\n\nThe problem quantifies over an odd integer `n > 1` and asks whether two\npositive integer divisors `d₁`, `d₂` of `(n ^ 2 + 1) / 2` can sum to `n + 1`.\nBecause `n` is odd, the displayed quotient is exact; `HalfSquareSucc` uses\ninteger division, which agrees with the exact quotient on the assumed domain.\n-/\n\nnamespace Problem\n\n/-- The integer `(n ^ 2 + 1) / 2`, the number whose positive divisors are\nconsidered in the problem. -/\ndef HalfSquareSucc (n : ℤ) : ℤ := (n ^ 2 + 1) / 2\n\n/-- The existential witness condition: there are two positive integer\ndivisors `d₁` and `d₂` of `(n ^ 2 + 1) / 2` whose sum is `n + 1`.\nNo distinctness condition is imposed on `d₁` and `d₂`, matching the wording\n\"two ... divisors\" without the qualifier \"distinct\". -/\ndef HasDivisorPair (n : ℤ) : Prop :=\n ∃ d₁ d₂ : ℤ,\n 0 < d₁ ∧\n 0 < d₂ ∧\n d₁ ∣ HalfSquareSucc n ∧\n d₂ ∣ HalfSquareSucc n ∧\n d₁ + d₂ = n + 1\n\n/-- There is no odd integer `n > 1` for which two positive divisors of\n`(n ^ 2 + 1) / 2` sum to `n + 1`. -/\ndef Target : Prop :=\n ∀ n : ℤ, Odd n → 1 < n → ¬ HasDivisorPair n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fea711e8-867c-5c87-bd74-c4f3fe1e5358", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "00a729a426fab6f153a316ebb005a733eacc4d19655a2c6d1a3f0cfa84854f3e", "task_path": "tasks/nmp3_fea711e8-867c-5c87-bd74-c4f3fe1e5358", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fea711e8-867c-5c87-bd74-c4f3fe1e5358", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fead03b0-2c82-59f0-a929-6d5b7b391a5b", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $n>5$ and $x_i>0$ for $i=1,2,\\dots,n$. Prove that \n-- \\[\n-- \\sum_{i=1}^{n} x_i\\,x_{i+1}\\,x_{i+2}\\;\\le\\;\\frac{1}{27}\\Bigl(\\sum_{i=1}^{n}x_i\\Bigr)^{3},\n-- \\]\n-- where the indices are taken cyclically (i.e. $x_{n+1}=x_1$, $x_{n+2}=x_2$).\nimport Mathlib\n\nopen scoped BigOperators\n\nnamespace Problem\n\n/-- The cyclic shift of a zero-based finite index by `k` positions.\n\nFor `i : Fin n`, `cyclicShift n k i` has value `(i.val + k) % n`.\nThus `cyclicShift n 1` represents `x_{n+1} = x_1` under the\ncorrespondence between `Fin n` and the original one-based indices. -/\ndef cyclicShift (n k : ℕ) (i : Fin n) : Fin n :=\n ⟨(i.val + k) % n, Nat.mod_lt (i.val + k) (Nat.zero_lt_of_lt i.isLt)⟩\n\n/-- The cyclic sum `∑ x_i x_{i+1} x_{i+2}` for a finite sequence of length `n`. -/\ndef cyclicProductSum (n : ℕ) (x : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, x i * x (cyclicShift n 1 i) * x (cyclicShift n 2 i)\n\n/-- The sum `∑ x_i` for a finite sequence of length `n`. -/\ndef totalSum (n : ℕ) (x : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, x i\n\n/-- The statement of the problem: for every natural number `n > 5` and every\nstrictly positive real sequence indexed by `Fin n`, the cyclic three-term\nproduct sum is at most `(1/27)` times the cube of the total sum. -/\ndef Target : Prop :=\n ∀ (n : ℕ), 5 < n →\n ∀ (x : Fin n → ℝ),\n (∀ i : Fin n, 0 < x i) →\n cyclicProductSum n x ≤ (1 / 27 : ℝ) * (totalSum n x) ^ 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fead03b0-2c82-59f0-a929-6d5b7b391a5b", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "5552a09332b401efeaab7b6149d9cc4860421c6d78e022484cbd22ccc6e4054e", "task_path": "tasks/nmp3_fead03b0-2c82-59f0-a929-6d5b7b391a5b", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fead03b0-2c82-59f0-a929-6d5b7b391a5b", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_feaf6f1b-8069-5dab-941c-e24e8a6e04a0", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a_1,a_2,\\dots,a_n$ be real numbers such that $a_1\\le a_2\\le\\cdots\\le a_n$. Prove that \n-- \\[\n-- \\sum_{i=1}^{n} a_i\\,a_{i+1}^{4}\\;\\ge\\;\\sum_{i=1}^{n} a_i^{4}\\,a_{i+1},\n-- \\]\n-- where the indices are taken cyclically by defining $a_{n+1}=a_1$.\nimport Mathlib\n\n/-!\n# Formal statement of the cyclic four-power inequality\n\nThe original problem considers a nondecreasing real sequence\n`a₁ ≤ a₂ ≤ ⋯ ≤ aₙ` and proves a cyclic inequality involving fourth powers.\nWe encode the sequence as a function on `Fin n`; the cyclic successor sends the\nlast index to `0`, so `a (nextIndex i)` is the term written `a_{i+1}` in the\nproblem, with `a_{n+1}` understood as `a₁`.\n-/\n\nnamespace Problem\n\n/-- The cyclic successor on `Fin n`: index `i` is taken to\n`(i + 1) mod n`. In particular, for `i = n - 1` it returns `0`. -/\ndef nextIndex {n : ℕ} (i : Fin n) : Fin n :=\n ⟨(i.val + 1) % n, Nat.mod_lt (i.val + 1) (Nat.zero_lt_of_lt i.isLt)⟩\n\n/-- The entries of the sequence are nondecreasing. This is the standard finite\nform of `a₁ ≤ a₂ ≤ ⋯ ≤ aₙ`: whenever the zero-based index of `i` is at most\nthat of `j`, we have `a i ≤ a j`. -/\ndef Nondecreasing {n : ℕ} (a : Fin n → ℝ) : Prop :=\n ∀ i j : Fin n, i.val ≤ j.val → a i ≤ a j\n\n/-- The left-hand side\n`∑_{i=1}^n a_i a_{i+1}^4`, with the cyclic convention `a_{n+1} = a₁`. -/\ndef leftSide {n : ℕ} (a : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, a i * (a (nextIndex i)) ^ 4\n\n/-- The right-hand side\n`∑_{i=1}^n a_i^4 a_{i+1}`, with the cyclic convention `a_{n+1} = a₁`. -/\ndef rightSide {n : ℕ} (a : Fin n → ℝ) : ℝ :=\n ∑ i : Fin n, (a i) ^ 4 * a (nextIndex i)\n\n/-- The asserted inequality for a fixed positive length and a fixed sequence. -/\ndef Inequality {n : ℕ} (a : Fin n → ℝ) : Prop :=\n leftSide a ≥ rightSide a\n\n/-- The complete universally quantified statement of the problem: for every\npositive integer `n` and every nondecreasing real sequence of length `n`, the\ncyclic inequality of the problem holds. -/\ndef Target : Prop :=\n ∀ n : ℕ, 1 ≤ n → ∀ a : Fin n → ℝ, Nondecreasing a → Inequality a\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "feaf6f1b-8069-5dab-941c-e24e8a6e04a0", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "fb75acd79bbc2f90754880f05ff211249ac1fa2af0f493a7ddc2e5b25a0adb77", "task_path": "tasks/nmp3_feaf6f1b-8069-5dab-941c-e24e8a6e04a0", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "feaf6f1b-8069-5dab-941c-e24e8a6e04a0", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fedb601a-dd9d-5923-bc32-f42ec5440ddd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that the expression $3^n-2$ is a perfect square for an integer $n$ only when $n=1$ or $n=3$.\nimport Mathlib\n\n/-!\n# Formalization of the stated problem\n\nThe source problem asks to prove that, for an integer exponent `n`, the value\n`3^n - 2` is a perfect square only for `n = 1` or `n = 3`.\n\nBecause the source explicitly allows `n` to be an arbitrary integer, integer\nexponentiation is interpreted in `ℚ`, where negative exponents are meaningful.\nThe expression \"perfect square\" is interpreted as \"the square of an integer\",\nnot merely the square of a rational number. These interpretive choices are\nalso recorded in `ambiguities.json`.\n-/\n\nnamespace Problem\n\n/-- The value of the expression `3^n - 2` at an integer exponent `n`.\n\nThe expression is evaluated in `ℚ` in order to give a meaning to negative\ninteger exponents as well as nonnegative ones. -/\ndef Value (n : ℤ) : ℚ :=\n (3 : ℚ) ^ n - 2\n\n/-- A rational number is an integer perfect square when it is the square of an\ninteger. -/\ndef IsPerfectSquare (q : ℚ) : Prop :=\n ∃ m : ℤ, (m : ℚ) ^ 2 = q\n\n/-- The assertion from the problem: for every integer `n`, if `3^n - 2` is a\nperfect square, then `n` is `1` or `3`.\n\nThis is the necessary-condition (\"only when\") direction stated in the source;\nsufficiency at `n = 1` and `n = 3` is not additionally asserted. -/\ndef Target : Prop :=\n ∀ n : ℤ, IsPerfectSquare (Value n) → n = 1 ∨ n = 3\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fedb601a-dd9d-5923-bc32-f42ec5440ddd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bbee2502105df3f4cd625808de10c1b8450f17248e1eec8fa63191a27f6a9f89", "task_path": "tasks/nmp3_fedb601a-dd9d-5923-bc32-f42ec5440ddd", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fedb601a-dd9d-5923-bc32-f42ec5440ddd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_fee931c5-0273-5db2-a2ce-3d102add8cb7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$, and define $p=a^2+b^2+c^2$ and $q=ab+bc+ca$. Prove that \n-- \\[\n-- \\frac{1}{\\sqrt{a^2+ab+b^2}}+\\frac{1}{\\sqrt{b^2+bc+c^2}}+\\frac{1}{\\sqrt{c^2+ca+a^2}}\n-- \\le\n-- \\frac{\\sqrt{p^2+pq+q^2}}{\\sqrt{a^3b^3}+\\sqrt{b^3c^3}+\\sqrt{c^3a^3}}.\n-- \\]\nimport Mathlib\n\nnoncomputable section\n\nnamespace Problem\n\n/-- The quantity `p = a^2 + b^2 + c^2`. -/\ndef p (a b c : ℝ) : ℝ :=\n a ^ 2 + b ^ 2 + c ^ 2\n\n/-- The quantity `q = ab + bc + ca`. -/\ndef q (a b c : ℝ) : ℝ :=\n a * b + b * c + c * a\n\n/-- The left-hand side of the asserted inequality. -/\ndef lhs (a b c : ℝ) : ℝ :=\n 1 / Real.sqrt (a ^ 2 + a * b + b ^ 2) +\n 1 / Real.sqrt (b ^ 2 + b * c + c ^ 2) +\n 1 / Real.sqrt (c ^ 2 + c * a + a ^ 2)\n\n/-- The denominator on the right-hand side of the asserted inequality. -/\ndef rhsDenominator (a b c : ℝ) : ℝ :=\n Real.sqrt (a ^ 3 * b ^ 3) +\n Real.sqrt (b ^ 3 * c ^ 3) +\n Real.sqrt (c ^ 3 * a ^ 3)\n\n/-- The right-hand side of the asserted inequality. -/\ndef rhs (a b c : ℝ) : ℝ :=\n Real.sqrt ((p a b c) ^ 2 + (p a b c) * (q a b c) + (q a b c) ^ 2) /\n rhsDenominator a b c\n\n/-- The statement of the problem: for all positive real `a`, `b`, and `c`, the\ndisplayed inequality holds, with `p = a^2+b^2+c^2` and `q = ab+bc+ca`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → lhs a b c ≤ rhs a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fee931c5-0273-5db2-a2ce-3d102add8cb7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e5f25c438438d1715a068594af0dc5e63e549ad4a10bc22cbf71f8f1f885f205", "task_path": "tasks/nmp3_fee931c5-0273-5db2-a2ce-3d102add8cb7", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "fee931c5-0273-5db2-a2ce-3d102add8cb7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_feef0c2e-ec4a-5ce4-9c9d-301c2be239a6", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $ABC$ be an isosceles triangle with $AB=BC$. \n-- Choose a point $M$ inside $\\triangle ABC$ such that $\\angle AMC=2\\angle ABC$. \n-- Let $K$ be a point on the segment $AM$ satisfying $\\angle BKM=\\angle ABC$. \n-- Prove that \n-- \\[\n-- BK = KM + MC\\,.\n-- \\]\nimport Mathlib.Analysis.InnerProductSpace.PiL2\nimport Mathlib.Geometry.Euclidean.Angle.Unoriented.Affine\n\n/-!\n# Formal statement for the isosceles-triangle length problem\n\nThis file only formalizes the problem statement. It introduces the claim as a\n`Prop` and does not provide a proof of the geometric result. The ambient plane\nis the real Euclidean plane\n`EuclideanSpace ℝ (Fin 2)`. Angles are Mathlib's unoriented Euclidean angles,\n`EuclideanGeometry.angle`, with values in `[0, π]`; interiors are strict and\nsegments are closed, as indicated in the definitions below.\n-/\n\nnoncomputable section\n\nopen scoped RealInnerProductSpace\nopen EuclideanGeometry\n\nnamespace Problem\n\n/-- The ambient Euclidean plane used throughout the formalization. -/\nabbrev Point : Type := EuclideanSpace ℝ (Fin 2)\n\n/-- The three vertices form a genuine (non-collinear) geometric triangle. -/\ndef NondegenerateTriangle (A B C : Point) : Prop :=\n ¬ Collinear ℝ ({A, B, C} : Set Point)\n\n/-- `M` lies in the strict interior of triangle `ABC`.\n\nThis is expressed by the existence of strictly positive barycentric\ncoordinates with respect to the three vertices. For a non-collinear\ntriangle this is exactly the usual open triangular region. -/\ndef InsideTriangle (A B C M : Point) : Prop :=\n ∃ α β γ : ℝ,\n 0 < α ∧ 0 < β ∧ 0 < γ ∧ α + β + γ = 1 ∧\n M = α • A + β • B + γ • C\n\n/-- `K` lies on the closed segment joining `A` and `M`, endpoints included. -/\ndef OnClosedSegment (A M K : Point) : Prop :=\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ K = (1 - t) • A + t • M\n\n/-- All hypotheses of the problem for a configuration `(A, B, C, M, K)`.\n\nThe order records: `ABC` is a nondegenerate triangle with `AB = BC`; `M`\nis inside the triangle and satisfies `∠AMC = 2∠ABC`; `K` is on segment\n`AM` and satisfies `∠BKM = ∠ABC`. -/\ndef IsoscelesConfiguration (A B C M K : Point) : Prop :=\n NondegenerateTriangle A B C ∧\n dist A B = dist B C ∧\n InsideTriangle A B C M ∧\n EuclideanGeometry.angle A M C = 2 * EuclideanGeometry.angle A B C ∧\n OnClosedSegment A M K ∧\n EuclideanGeometry.angle B K M = EuclideanGeometry.angle A B C\n\n/-- The asserted length conclusion `BK = KM + MC`. -/\ndef Conclusion (B C M K : Point) : Prop :=\n dist B K = dist K M + dist M C\n\n/-- The full formal statement of the problem: for every isosceles triangle\n`ABC` with `AB = BC`, every interior point `M` satisfying\n`∠AMC = 2∠ABC`, and every point `K` on segment `AM` satisfying\n`∠BKM = ∠ABC`, the equality `BK = KM + MC` holds. -/\ndef Target : Prop :=\n ∀ A B C M K : Point,\n IsoscelesConfiguration A B C M K → Conclusion B C M K\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "feef0c2e-ec4a-5ce4-9c9d-301c2be239a6", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "91e4f66f639ecc39f12fd0548cb34308aa7bed71abe7f0054868ed5bde85cb1c", "task_path": "tasks/nmp3_feef0c2e-ec4a-5ce4-9c9d-301c2be239a6", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "feef0c2e-ec4a-5ce4-9c9d-301c2be239a6", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ff196cd6-058e-5328-a6b5-88db0aafe4fd", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Prove that for all positive real numbers $a,b,c,d,e,m,n,o,p,q$,\n-- \\[\n-- \\bigl(a^6-m^{25}a+m^{30}+4\\bigr)\\bigl(b^6-n^{25}b+n^{30}+4\\bigr)\\bigl(c^6-o^{25}c+o^{30}+4\\bigr)\\bigl(d^6-p^{25}d+p^{30}+4\\bigr)\\bigl(e^6-q^{25}e+q^{30}+4\\bigr)\\ge(am+bn+co+dp+eq)^5.\n-- \\]\nimport Mathlib\n\n/-!\n# Formalization of the proposed inequality\n\nThe source asks to prove that for all positive real numbers\n`a b c d e m n o p q`, the product of five sextic expressions is at least\nthe fifth power of the corresponding linear combination.\n-/\n\nnamespace Problem\n\n/-- One factor of the left-hand side: `x^6 - y^25 * x + y^30 + 4`. -/\ndef factor (x y : ℝ) : ℝ :=\n x ^ 6 - y ^ 25 * x + y ^ 30 + 4\n\n/-- The complete left-hand side of the target inequality. -/\ndef lhs (a b c d e m n o p q : ℝ) : ℝ :=\n factor a m * factor b n * factor c o * factor d p * factor e q\n\n/-- The complete right-hand side of the target inequality. -/\ndef rhs (a b c d e m n o p q : ℝ) : ℝ :=\n (a * m + b * n + c * o + d * p + e * q) ^ 5\n\n/--\nThe proposition asserted in the problem: for all positive real numbers\n`a,b,c,d,e,m,n,o,p,q`, the stated product is at least the stated fifth power.\nThe ten positivity assumptions are represented by the ten explicit implications.\n-/\ndef Target : Prop :=\n ∀ a b c d e m n o p q : ℝ,\n 0 < a → 0 < b → 0 < c → 0 < d → 0 < e →\n 0 < m → 0 < n → 0 < o → 0 < p → 0 < q →\n lhs a b c d e m n o p q ≥ rhs a b c d e m n o p q\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff196cd6-058e-5328-a6b5-88db0aafe4fd", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "522be290c3ef037d68af0c846e88af0d8c26d48535a4451c590846979711b63a", "task_path": "tasks/nmp3_ff196cd6-058e-5328-a6b5-88db0aafe4fd", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff196cd6-058e-5328-a6b5-88db0aafe4fd", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ff3be7a7-ccd0-544f-bcf1-c62fe2031f30", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let \\((a_n)_{n\\in\\mathbb N}\\) be defined by \n-- \\(a_1 = 1\\) and \n-- \\(a_{n+1}=a_n^4-a_n^3+2a_n^2+1\\) for \\(n\\ge 1\\). \n-- Prove that there exist infinitely many primes \\(p\\) such that \\(p\\) does **not** divide any term of the sequence, i.e. \\(p\\nmid a_n\\) for all \\(n\\).\nimport Mathlib.Data.Nat.Prime.Basic\nimport Mathlib.Data.Set.Finite.Basic\n\n/-!\n# Formal statement for the sequence and primes problem\n\nThe source problem defines a sequence of natural numbers starting at index `1`\nand asks for a proof that infinitely many primes avoid every positive-indexed\nterm. The declaration `Problem.Target` below is the proposition to be proved;\nit is deliberately not accompanied by a proof.\n-/\n\nnamespace Problem\n\n/-- The polynomial recurrence map\n`x ↦ x ^ 4 - x ^ 3 + 2 * x ^ 2 + 1`. -/\ndef nextTerm (x : ℕ) : ℕ :=\n x ^ 4 - x ^ 3 + 2 * x ^ 2 + 1\n\n/-- The sequence from the problem, indexed by natural numbers.\n\nThe problem only defines `a n` for `n ≥ 1`. We make an arbitrary but fixed\nchoice at `n = 0`; all statements below restrict to `1 ≤ n`. On positive\nindices this definition gives `a 1 = 1` and\n`a (n + 1) = nextTerm (a n)` for every `n ≥ 1`. -/\ndef a : ℕ → ℕ\n | 0 => 1\n | 1 => 1\n | n + 2 => nextTerm (a (n + 1))\n\n/-- The initial condition `a 1 = 1` from the source problem. -/\ntheorem a_one : a 1 = 1 := rfl\n\n/-- The recurrence from the source problem, stated for its intended range\n`n ≥ 1`. -/\ntheorem a_succ (n : ℕ) (hn : 1 ≤ n) :\n a (n + 1) = nextTerm (a n) := by\n cases n with\n | zero => exact False.elim (Nat.not_succ_le_zero 0 hn)\n | succ k => rfl\n\n/-- A prime avoids the sequence when it divides no term with positive index. -/\ndef AvoidsSequence (p : ℕ) : Prop :=\n Nat.Prime p ∧ ∀ n : ℕ, 1 ≤ n → ¬ p ∣ a n\n\n/-- There are infinitely many primes which divide no term of the sequence. -/\ndef Target : Prop :=\n Set.Infinite {p : ℕ | AvoidsSequence p}\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff3be7a7-ccd0-544f-bcf1-c62fe2031f30", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "bdb65c324130ac0a872ccaf19ec8bd86684e345e71ba10e37a54a0639103947c", "task_path": "tasks/nmp3_ff3be7a7-ccd0-544f-bcf1-c62fe2031f30", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff3be7a7-ccd0-544f-bcf1-c62fe2031f30", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ff56fe50-9b47-55e8-96ed-0bf4ca6b969c", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- For all positive real numbers $a,\\;b,\\;c$, prove the double inequality \n-- \\[\n-- ab+bc+ca\\;\\le\\;\\frac{a^{3}(b+c)}{a^{2}+bc}+\\frac{b^{3}(c+a)}{b^{2}+ca}+\\frac{c^{3}(a+b)}{c^{2}+ab}\\;\\le\\;a^{2}+b^{2}+c^{2}\\,. \n-- \\] \n-- (The sums are taken cyclically in $a,\\;b,\\;c$.)\nimport Mathlib.Basic.Real.Basic\n\nnamespace Problem\n\nnoncomputable section\n\n/-- The left-hand side of the asserted double inequality. -/\ndef leftExpr (a b c : ℝ) : ℝ :=\n a * b + b * c + c * a\n\n/-- The cyclic middle sum in the asserted double inequality. -/\ndef middleExpr (a b c : ℝ) : ℝ :=\n a ^ 3 * (b + c) / (a ^ 2 + b * c) +\n b ^ 3 * (c + a) / (b ^ 2 + c * a) +\n c ^ 3 * (a + b) / (c ^ 2 + a * b)\n\n/-- The right-hand side of the asserted double inequality. -/\ndef rightExpr (a b c : ℝ) : ℝ :=\n a ^ 2 + b ^ 2 + c ^ 2\n\n/-- The lower bound half of the asserted double inequality for a fixed triple. -/\ndef lowerInequality (a b c : ℝ) : Prop :=\n leftExpr a b c ≤ middleExpr a b c\n\n/-- The upper bound half of the asserted double inequality for a fixed triple. -/\ndef upperInequality (a b c : ℝ) : Prop :=\n middleExpr a b c ≤ rightExpr a b c\n\n/-- The asserted double inequality for a fixed triple of real numbers. -/\ndef doubleInequality (a b c : ℝ) : Prop :=\n lowerInequality a b c ∧ upperInequality a b c\n\n/-- For all positive real numbers `a`, `b`, and `c`, the prescribed cyclic sum lies\nbetween `ab + bc + ca` and `a ^ 2 + b ^ 2 + c ^ 2`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ, 0 < a → 0 < b → 0 < c → doubleInequality a b c\n\nend\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff56fe50-9b47-55e8-96ed-0bf4ca6b969c", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "398f0087f32e7e46d10d9e5a4e821d5bbf869fa4d6bc42db48bdcb903b87e17e", "task_path": "tasks/nmp3_ff56fe50-9b47-55e8-96ed-0bf4ca6b969c", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff56fe50-9b47-55e8-96ed-0bf4ca6b969c", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ff5a4d63-2685-5f87-9b07-20f00cb5a2a2", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- A subset $S\\subset\\{0,1,2,\\dots ,2000\\}$ satisfies $|S|=401$. Prove that there exists a positive integer $n$ ( $1\\le n\\le2000$ ) such that there are at least $70$ positive integers $x$ for which both $x$ and $x+n$ belong to $S$.\nimport Mathlib\n\nnamespace Problem\n\n/--\nFor a finite set `S` of natural numbers and a natural shift `n`, this is the\nnumber of positive integers `x` such that both `x` and `x + n` belong to `S`.\nThe base `Finset` is `S`, so membership `x ∈ S` is imposed by `filter`; the\npredicate explicitly imposes positivity of `x` and membership of `x + n`.\n-/\ndef countPositiveShiftedPairs (S : Finset ℕ) (n : ℕ) : ℕ :=\n (S.filter (fun x => 0 < x ∧ x + n ∈ S)).card\n\n/--\nA subset `S` of `{0, 1, ..., 2000}` with `|S| = 401` has some positive\n`n ≤ 2000` for which at least `70` positive integers `x` satisfy\n`x ∈ S` and `x + n ∈ S`.\n-/\ndef Target : Prop :=\n ∀ S : Finset ℕ,\n S ⊆ Finset.Icc 0 2000 →\n S.card = 401 →\n ∃ n : ℕ,\n 1 ≤ n ∧ n ≤ 2000 ∧ 70 ≤ countPositiveShiftedPairs S n\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff5a4d63-2685-5f87-9b07-20f00cb5a2a2", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "e076fb7776b80c469b8977b7e7f4c9ffd936ab211d226f4daa507f081ab571bc", "task_path": "tasks/nmp3_ff5a4d63-2685-5f87-9b07-20f00cb5a2a2", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff5a4d63-2685-5f87-9b07-20f00cb5a2a2", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ff8185b2-b3f2-558d-9995-3b53ec916efe", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $G$ be a simple undirected graph on $998$ vertices (cities) such that for every subset $X$ of $k$ vertices the number of edges with both endpoints in $X$ satisfies $e(X)\\le 5k+10$. Prove that it is possible to add edges (without creating multiple edges) to $G$ so that the resulting graph still satisfies $e(X)\\le5|X|+10$ for every subset $X$ and has exactly $5\\cdot998+10=5000$ edges.\nimport Mathlib\n\n/-!\n# Formal statement for the graph edge-bound extension problem\n\nThe source problem asks, for a simple graph on 998 vertices whose induced\nsubgraphs all satisfy an affine edge bound, for a supergraph on the same\nvertex set with exactly 5000 edges and with the same affine edge bound.\n\nThe declarations below state the problem only; they do not assert or prove\nits conclusion.\n-/\n\nopen scoped Sym2\n\nnamespace Problem\n\n/-- The number `e(X)` of edges of `G` both of whose endpoints lie in `X`.\n\nThe graph is simple, so its edges are unordered pairs of vertices. An edge\nof `G.edgeFinset` is counted exactly when every vertex occurring in that\nunordered pair belongs to the finset `X`. -/\nnoncomputable def edgeCountIn {V : Type*} [Fintype V]\n (G : SimpleGraph V) (X : Finset V) : ℕ := by\n classical\n exact (G.edgeFinset.filter (fun e : Sym2 V => ∀ v : V, v ∈ e → v ∈ X)).card\n\n/-- The total number of edges of a finite simple graph. -/\nnoncomputable def edgeCount {V : Type*} [Fintype V]\n (G : SimpleGraph V) : ℕ := by\n classical\n exact G.edgeFinset.card\n\n/-- The affine induced-edge bound `e(X) ≤ 5 * |X| + 10` for every finite\nsubset `X` of the vertex set. On a finite vertex type, `Finset V` ranges\nover all subsets of `V`. -/\nnoncomputable def EdgeBound {V : Type*} [Fintype V]\n (G : SimpleGraph V) : Prop :=\n ∀ X : Finset V, edgeCountIn G X ≤ 5 * X.card + 10\n\n/-- `H` extends `G` by adding edges, without deleting edges of `G`. Since\n`H` is a `SimpleGraph`, this also enforces that no loops or multiple edges are\ncreated. -/\ndef Extends {V : Type*} (G H : SimpleGraph V) : Prop :=\n ∀ ⦃v w : V⦄, G.Adj v w → H.Adj v w\n\n/-- The assertion to be proved.\n\nFor every simple graph `G` on the canonical 998-element vertex type `Fin 998`,\nif every finite vertex subset `X` satisfies `e(X) ≤ 5 * |X| + 10`, then there\nis a simple supergraph `H` of `G` on the same vertex set such that:\n* no edge of `G` is removed (and hence edges are only added);\n* `H` has exactly `5 * 998 + 10 = 5000` edges; and\n* every finite vertex subset `X` of `H` satisfies `e(X) ≤ 5 * |X| + 10`.\n\nAllowing `H = G` corresponds to adding zero edges; this is needed for the\nboundary case in which `G` already has 5000 edges. -/\nnoncomputable def Target : Prop :=\n ∀ G : SimpleGraph (Fin 998),\n EdgeBound G →\n ∃ H : SimpleGraph (Fin 998),\n Extends G H ∧ edgeCount H = 5000 ∧ EdgeBound H\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff8185b2-b3f2-558d-9995-3b53ec916efe", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "55594594dfaafd5c5a30931a1133d67cb9709a50fe1dde389ce79bdcca69e476", "task_path": "tasks/nmp3_ff8185b2-b3f2-558d-9995-3b53ec916efe", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff8185b2-b3f2-558d-9995-3b53ec916efe", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ff84186d-03b5-51f9-8d33-606b7602c40f", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Let $a,b,c>0$ such that $ab+bc+ca=2$. Prove that \n-- \\[\n-- \\sqrt{\\frac{2a^{2}+bc}{a^{2}+bc}}+\\sqrt{\\frac{2b^{2}+ca}{b^{2}+ca}}+\\sqrt{\\frac{2c^{2}+ab}{c^{2}+ab}}\\le\\frac{2}{abc}\\,. \n-- \\]\nimport Mathlib.Analysis.Real.Sqrt\n\nnamespace Problem\n\n/-- The left-hand side of the inequality in the problem. -/\nnoncomputable def LHS (a b c : ℝ) : ℝ :=\n Real.sqrt ((2 * a ^ 2 + b * c) / (a ^ 2 + b * c)) +\n Real.sqrt ((2 * b ^ 2 + c * a) / (b ^ 2 + c * a)) +\n Real.sqrt ((2 * c ^ 2 + a * b) / (c ^ 2 + a * b))\n\n/-- The right-hand side of the inequality in the problem. -/\nnoncomputable def RHS (a b c : ℝ) : ℝ :=\n 2 / (a * b * c)\n\n/-- The positivity and normalization assumptions imposed on the variables. -/\ndef Admissible (a b c : ℝ) : Prop :=\n 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b + b * c + c * a = 2\n\n/-- The assertion to be proved: for all positive real `a`, `b`, `c` satisfying\n`ab + bc + ca = 2`, the stated square-root sum is at most `2 / (abc)`. -/\ndef Target : Prop :=\n ∀ a b c : ℝ,\n Admissible a b c → LHS a b c ≤ RHS a b c\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff84186d-03b5-51f9-8d33-606b7602c40f", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "82ed01f1b595be27312866c826a67337c25e92c34699bd8913fbeb74f7c63c8a", "task_path": "tasks/nmp3_ff84186d-03b5-51f9-8d33-606b7602c40f", "metadata": {"split": "train", "difficulty": "medium", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff84186d-03b5-51f9-8d33-606b7602c40f", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ff86ea80-671a-5264-8f12-29667f1e031a", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Show that there exists a set \\(A\\subseteq\\mathbb{N}\\) with the following property: for every infinite set \\(S\\) of prime numbers there exist an integer \\(k\\ge 2\\) and two positive integers \\(m\\) and \\(n\\) such that \\(m\\in A,\\;n\\notin A\\), and both \\(m\\) and \\(n\\) can be written as the product of exactly \\(k\\) distinct primes taken from \\(S\\).\nimport Mathlib\n\n/-!\n# Formalization of the existence problem\n\nThe source problem asks for a set `A` of natural numbers such that every infinite\nset of primes has two numbers, one in `A` and one outside `A`, which are each a\nproduct of the same number `k ≥ 2` of distinct primes from that set.\n\nThe declaration `Problem.Target` is the proposition to be proved. No proof is\nprovided here.\n-/\n\nnamespace Problem\n\n/-- A natural number `m` is a product of exactly `k` distinct primes taken from\nthe set `S`. The witnessing finset records the primes, so its cardinality is the\nexact number of distinct prime factors used, and all its members are required to\nlie in `S` and to be prime. -/\ndef IsProductOfExactlyKDistinctPrimesFrom\n (S : Set ℕ) (k m : ℕ) : Prop :=\n ∃ t : Finset ℕ,\n t.card = k ∧\n (∀ p : ℕ, p ∈ t → p ∈ S ∧ Nat.Prime p) ∧\n t.prod id = m\n\n/-- `S` is an infinite set of prime natural numbers. -/\ndef IsInfinitePrimeSet (S : Set ℕ) : Prop :=\n S.Infinite ∧ ∀ p : ℕ, p ∈ S → Nat.Prime p\n\n/-- The property required of the set `A` in the problem: for every infinite set\n`S` of primes, there are `k ≥ 2` and positive integers `m` and `n` such that\n`m ∈ A`, `n ∉ A`, and both `m` and `n` are products of exactly `k` distinct\nprimes from `S`. -/\ndef AdmissibleSet (A : Set ℕ) : Prop :=\n ∀ S : Set ℕ,\n IsInfinitePrimeSet S →\n ∃ k : ℕ,\n 2 ≤ k ∧\n ∃ m n : ℕ,\n 0 < m ∧ 0 < n ∧\n m ∈ A ∧ n ∉ A ∧\n IsProductOfExactlyKDistinctPrimesFrom S k m ∧\n IsProductOfExactlyKDistinctPrimesFrom S k n\n\n/-- There exists a subset `A` of `ℕ` with the property stated in the problem. -/\ndef Target : Prop :=\n ∃ A : Set ℕ, AdmissibleSet A\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff86ea80-671a-5264-8f12-29667f1e031a", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "2d12f1df9d1c8fd6f878af75d08002866507472547755bbb2bfbc5f037ebb6ce", "task_path": "tasks/nmp3_ff86ea80-671a-5264-8f12-29667f1e031a", "metadata": {"split": "train", "difficulty": "easy", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ff86ea80-671a-5264-8f12-29667f1e031a", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "nmp3_ffdc6a47-a856-5ca1-aa58-ac31eff72af7", "task_type": "lean_theorem_proving", "theorem_statement": "-- Original natural-language problem:\n-- Suppose $(s_i)_{i\\ge1}$ is a strictly increasing sequence of positive integers such that the subsequences $(s_{s_i})_{i\\ge1}$ and $(s_{s_i+1})_{i\\ge1}$ are both arithmetic progressions. Prove that $(s_i)_{i\\ge1}$ itself is an arithmetic progression.\nimport Mathlib.Data.PNat.Basic\n\n/-!\n# Formal statement of the positive-integer sequence problem\n\nThe source index set is `i ≥ 1`, so the sequence is represented as a function on\n`ℕ+`, the positive natural numbers. Its values are also positive integers, hence\nthe codomain is `ℕ+`.\n\nAn arithmetic progression is encoded by its first term together with a natural\nnumber common difference. All arithmetic is therefore in `ℕ`; in this strictly\nincreasing setting a valid progression has a positive common difference.\n-/\n\nnamespace Problem\n\n/-- A sequence `u : ℕ+ → ℕ+` is an arithmetic progression when there is a\nnatural-number common difference `d` such that\n`u i = u 1 + (i - 1) * d` for every positive integer index `i`. -/\ndef IsArithmeticProgression (u : ℕ+ → ℕ+) : Prop :=\n ∃ d : ℕ, ∀ i : ℕ+,\n (u i : ℕ) = (u 1 : ℕ) + ((i : ℕ) - 1) * d\n\n/-- A sequence of positive integers, indexed by positive integers, is strictly\nincreasing. The positivity of the terms is carried by the codomain `ℕ+`. -/\ndef IsStrictlyIncreasingPositiveIntegerSequence (s : ℕ+ → ℕ+) : Prop :=\n ∀ i j : ℕ+, i < j → s i < s j\n\n/-- The subsequence with `i`-th term `s (s i)`, representing `(s_{s_i})_{i ≥ 1}`. -/\ndef SelfComposition (s : ℕ+ → ℕ+) : ℕ+ → ℕ+ :=\n fun i : ℕ+ => s (s i)\n\n/-- The subsequence with `i`-th term `s (s i + 1)`, representing\n`(s_{s_i + 1})_{i ≥ 1}`. -/\ndef SelfCompositionSucc (s : ℕ+ → ℕ+) : ℕ+ → ℕ+ :=\n fun i : ℕ+ => s (s i + 1)\n\n/-- The target assertion: every strictly increasing positive-integer sequence\nwhose self-composition and shifted self-composition are arithmetic progressions\nis itself an arithmetic progression. -/\ndef Target : Prop :=\n ∀ s : ℕ+ → ℕ+,\n IsStrictlyIncreasingPositiveIntegerSequence s →\n IsArithmeticProgression (SelfComposition s) →\n IsArithmeticProgression (SelfCompositionSucc s) →\n IsArithmeticProgression s\n\nend Problem\n\n\ntheorem _root_.nmp3_proof : _root_.Problem.Target := by\n sorry\n", "target_workspace": {"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"}, "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ffdc6a47-a856-5ca1-aa58-ac31eff72af7", "source_license": "cc-by-4.0", "theorem_names": ["nmp3_proof"], "statement_sha256": "66ca98c9583b1c0a1abc37387747c5e425260514a309b9cbd354931407d87f03", "task_path": "tasks/nmp3_ffdc6a47-a856-5ca1-aa58-ac31eff72af7", "metadata": {"split": "train", "difficulty": "hard", "source": "nvidia/Nemotron-Math-Proofs-v3-RL", "source_id": "ffdc6a47-a856-5ca1-aa58-ac31eff72af7", "source_license": "cc-by-4.0", "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__OMR_problem_332071__70cfe73c7689f0a2__e511ec2949946f25", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_332071 :\n ∀ P : Polynomial ℚ,\n (P.degree = 5) →\n (P.eval 1 = 1) →\n (P.eval 2 = 1/2) →\n (P.eval 3 = 1/3) →\n (P.eval 4 = 1/4) →\n (P.eval 5 = 1/5) →\n (P.eval 6 = 1/6) →\n (P.eval 7 = 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "Goedel-LM/rl_dataset_v2", "source_id": "OMR_problem_332071__70cfe73c7689f0a2", "source_license": null, "theorem_names": ["OMR_problem_332071"], "statement_sha256": "e511ec2949946f2580fde13a5b8e342349cd02a210c391abd76a8c78d31aca92", "task_path": "tasks/rl_align__OMR_problem_332071__70cfe73c7689f0a2__e511ec2949946f25", "metadata": {"split": "train", "difficulty": "easy", "source": "Goedel-LM/rl_dataset_v2", "source_id": "OMR_problem_332071__70cfe73c7689f0a2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__OMR_problem_382062__702144b4b58f7d91__f089cb0b0c81013f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_382062 :\n {x : ℝ | Real.tan (5 * x) + Real.tan (3 * x) = Real.tan (8 * x)} =\n {x : ℝ | ∃ k : ℤ, x = k * Real.pi / 5} ∪\n {x : ℝ | ∃ m : ℤ, x = m * Real.pi / 3} ∪\n {x : ℝ | ∃ n : ℤ, x = -(n * Real.pi / 8)} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "Goedel-LM/rl_dataset_v2", "source_id": "OMR_problem_382062__702144b4b58f7d91", "source_license": null, "theorem_names": ["OMR_problem_382062"], "statement_sha256": "f089cb0b0c81013f3c41260cd227042dd589ae1eba1313110bfd209b05dae133", "task_path": "tasks/rl_align__OMR_problem_382062__702144b4b58f7d91__f089cb0b0c81013f", "metadata": {"split": "train", "difficulty": "medium", "source": "Goedel-LM/rl_dataset_v2", "source_id": "OMR_problem_382062__702144b4b58f7d91", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00000-of-00041.arrow_11832__332c0f0e9f5ef1fc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_23320 (n : ℕ) (hn : n ≠ 0) (a : Fin n → ℝ) : ∑ i, ∑ j, (a i * a j)^2 ≤ n * ∑ i, (a i)^2 * n * ∑ j, (a j)^2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00000-of-00041.arrow_11832", "source_license": null, "theorem_names": ["lean_workbook_23320"], "statement_sha256": "332c0f0e9f5ef1fcb23a755c3912bb7a2aecaa9101792a720d31d69f6b0209fd", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00000-of-00041.arrow_11832__332c0f0e9f5ef1fc", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00000-of-00041.arrow_11832", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00000-of-00041.arrow_19287__1fca979259d84bba", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_299322 :\n ∃ (k : ℕ),\n let F₂ : ℝ → ℝ → ℝ := fun x y => x * y\n let A : (Fin 3 → ℝ) → ℝ := fun x =>\n ∑ j : Fin 3, F₂ (x j) (x ((j + 1) % 3))\n let H₃ : (Fin 3 → ℝ) → ℝ := fun x =>\n ∑ i : Fin 3, (x i)^k * (A x - 2 * F₂ (x ((i + 1) % 3)) (x ((i + 2) % 3)))\n H₃ ![1, 2, 3] = 82 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00000-of-00041.arrow_19287", "source_license": null, "theorem_names": ["OMR_problem_299322"], "statement_sha256": "1fca979259d84bbabd8e70f4dc33279a3b184fb54d826acc90e279e4c7914a2e", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00000-of-00041.arrow_19287__1fca979259d84bba", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00000-of-00041.arrow_19287", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00000-of-00041.arrow_23245__6c97e6a69fd13d49", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem programming_contest_groups (n : ℕ) (h : n = 2008) :\n ∃ k : ℕ, k = 11 ∧\n ∃ (groups : Fin k → Fin n → Bool),\n ∀ i j : Fin n, i ≠ j →\n ∃ r : Fin k, groups r i ≠ groups r j := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00000-of-00041.arrow_23245", "source_license": null, "theorem_names": ["programming_contest_groups"], "statement_sha256": "6c97e6a69fd13d49db4a1c5aa6a98e42bd05e8d0182efab0228ee4a961a8b08b", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00000-of-00041.arrow_23245__6c97e6a69fd13d49", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00000-of-00041.arrow_23245", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00000-of-00041.arrow_32220__0651432e567ce74e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_658 (a : ℕ → ℝ) (ha : ∀ i, 0 < a i) (h : Summable a) : Summable (λ i => a i / (a i + 1)) ∧ (∑' i, a i / (a i + 1)) ≤ ∑' i, a i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00000-of-00041.arrow_32220", "source_license": null, "theorem_names": ["lean_workbook_658"], "statement_sha256": "0651432e567ce74ed918b47ebb02aac2a9d6fc9dfbe3d82dfc603520e1a97516", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00000-of-00041.arrow_32220__0651432e567ce74e", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00000-of-00041.arrow_32220", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00000-of-00041.arrow_8395__2ff052057860a9ff", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem grasshopper_cannot_return :\n ∀ (jumps : Fin 1985 → Int),\n (∀ i : Fin 1985, (jumps i).natAbs = i.val + 1) →\n (∑ i : Fin 1985, jumps i) ≠ 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00000-of-00041.arrow_8395", "source_license": null, "theorem_names": ["grasshopper_cannot_return"], "statement_sha256": "2ff052057860a9ff981bfb47430f647e36b5e5ef5124a7e35d28676443fb2661", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00000-of-00041.arrow_8395__2ff052057860a9ff", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00000-of-00041.arrow_8395", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00001-of-00041.arrow_11565__738e72b4bd343260", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem exactly_one_div_by_five (n : ℕ) :\n let a_n := 2^(2*n+1) - 2^(n+1) + 1\n let b_n := 2^(2*n+1) + 2^(n+1) + 1\n ∃! x ∈ ({a_n, b_n} : Set ℕ), 5 ∣ x := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00001-of-00041.arrow_11565", "source_license": null, "theorem_names": ["exactly_one_div_by_five"], "statement_sha256": "738e72b4bd343260044ac89c52c5726ab8f2da604006953cd192207b16b0f028", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00001-of-00041.arrow_11565__738e72b4bd343260", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00001-of-00041.arrow_11565", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00001-of-00041.arrow_30046__8e26dcaab6e9394a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_163462 : ∫ x in (0 : ℝ)..(1 : ℝ), (1 - x^3)^5 = 729 / 1456 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00001-of-00041.arrow_30046", "source_license": null, "theorem_names": ["OMR_problem_163462"], "statement_sha256": "8e26dcaab6e9394a99fe3cf773347e35dcb1b3eb6eca58253b970bd31c9ca881", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00001-of-00041.arrow_30046__8e26dcaab6e9394a", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00001-of-00041.arrow_30046", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00001-of-00041.arrow_31723__b1e90fdf243bf453", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_395074 :\n let p : ℝ → ℂ := fun x => 2 * Complex.cos x + 3 * Complex.sin x\n let n : ℕ := 1\n let c : ℤ → ℂ := fun k =>\n if k = 1 then (1 + 3/(2*Complex.I))\n else if k = -1 then (1 - 3/(2*Complex.I))\n else 0\n let T : Matrix (Fin (2*n + 1)) (Fin (2*n + 1)) ℂ :=\n fun i j => c ((j.val : ℤ) - (i.val : ℤ))\n (Finset.univ.sum fun i => Finset.univ.sum fun j => T i j) = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00001-of-00041.arrow_31723", "source_license": null, "theorem_names": ["OMR_problem_395074"], "statement_sha256": "b1e90fdf243bf453baa63d091c7dea6277d17a31fbb83ddcee3cb33eb8dfae82", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00001-of-00041.arrow_31723__b1e90fdf243bf453", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00001-of-00041.arrow_31723", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00002-of-00041.arrow_24992__7269b33a7f6cc1d7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_51099 : ∃ (a : Fin 9 → ℕ),\n (∀ i, Odd (a i)) ∧\n (∀ i j, i ≠ j → a i ≠ a j) ∧\n (∑ i : Fin 9, (1 : ℚ) / (a i : ℚ)) = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00002-of-00041.arrow_24992", "source_license": null, "theorem_names": ["OMR_problem_51099"], "statement_sha256": "7269b33a7f6cc1d724cfafeacf7815d7fe2f6feb87a5969f7344bb5369f42191", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00002-of-00041.arrow_24992__7269b33a7f6cc1d7", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00002-of-00041.arrow_24992", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00002-of-00041.arrow_29476__7d93c42d9b870722", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_182950 (a : ℕ → ℝ)\n (h : ∀ α : ℝ, α > 1 → Filter.Tendsto (fun n => a ⌊α^n⌋₊) Filter.atTop (nhds 0)) :\n Filter.Tendsto (fun n => a (2^n)) Filter.atTop (nhds 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00002-of-00041.arrow_29476", "source_license": null, "theorem_names": ["OMR_problem_182950"], "statement_sha256": "7d93c42d9b87072223637eca8d10372c0f58d7b987290f4c82e753970228e223", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00002-of-00041.arrow_29476__7d93c42d9b870722", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00002-of-00041.arrow_29476", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00002-of-00041.arrow_30369__f5ac97476b71cedb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat Classical Polynomial\n\n\ntheorem OMR_problem_30463 (n : ℤ) :\n (∫ x in (0 : ℝ)..(2 * Real.pi), (Real.sin (↑n * x))^2) +\n (∫ x in (0 : ℝ)..(2 * Real.pi), (Real.cos (↑n * x))^2) = 2 * Real.pi := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00002-of-00041.arrow_30369", "source_license": null, "theorem_names": ["OMR_problem_30463"], "statement_sha256": "f5ac97476b71cedbd0adc979f47a3eb050c7881db6dd6eb7ca11a000be967713", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00002-of-00041.arrow_30369__f5ac97476b71cedb", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00002-of-00041.arrow_30369", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00003-of-00041.arrow_17990__096425d7abac48bc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem distance_parity (n : ℕ) (a : Fin n → ℤ)\n (n_ge_3 : n ≥ 3)\n (n_odd : Odd n)\n (even_sum : ∀ i : Fin n, Even (∑ j : Fin n, if i = j then 0 else |a i - a j|)) :\n ∀ i j : Fin n, Even |a i - a j| := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00003-of-00041.arrow_17990", "source_license": null, "theorem_names": ["distance_parity"], "statement_sha256": "096425d7abac48bcc46809d9f871485ee8eaa1d1c009182280f547bb168fb1eb", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00003-of-00041.arrow_17990__096425d7abac48bc", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00003-of-00041.arrow_17990", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00003-of-00041.arrow_2249__936dceda99ea58b4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem area_between_curves :\n let f (x : ℝ) := 3 - x^2\n let g (x : ℝ) := 2*x\n let a : ℝ := -3\n let b : ℝ := 1\n ∫ x in a..b, (f x - g x) = 32/3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00003-of-00041.arrow_2249", "source_license": null, "theorem_names": ["area_between_curves"], "statement_sha256": "936dceda99ea58b42241dfa967b781235a045715b3ed175507c355e1c3d65fd3", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00003-of-00041.arrow_2249__936dceda99ea58b4", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00003-of-00041.arrow_2249", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00003-of-00041.arrow_26532__548bceafa113ff75", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_32363 (a b c : ℝ) (ha : 0 < a) (hb : 0 < b) (hc : 0 < c) : ∃ f : ℝ → ℝ, ContinuousOn f (Set.Icc 0 1) ∧ ∀ x ∈ Set.Icc 0 1, f x ^ 2 ≤ 1 ∧ (a / (a + b)) ^ 2 + (b / (b + c)) ^ 2 + (c / (c + a)) ^ 2 ≥ 3 / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00003-of-00041.arrow_26532", "source_license": null, "theorem_names": ["lean_workbook_32363"], "statement_sha256": "548bceafa113ff755c38f97bc21ad6e71080fbb0a3b06b92fe23f8a83064140c", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00003-of-00041.arrow_26532__548bceafa113ff75", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00003-of-00041.arrow_26532", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00004-of-00041.arrow_17804__1ec821261e2014f5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem integral_equals_two_thirds : ∫ (x : ℝ) in (1)..(3), (x^2 - 2*x) = 2/3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00004-of-00041.arrow_17804", "source_license": null, "theorem_names": ["integral_equals_two_thirds"], "statement_sha256": "1ec821261e2014f5c6398c9782d358085c1b41df86c7d5bb1af4382425b53dd7", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00004-of-00041.arrow_17804__1ec821261e2014f5", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00004-of-00041.arrow_17804", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00004-of-00041.arrow_22557__a51a461d3a3428ba", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem max_distance_between_spheres :\n let center1 : ℝ × ℝ × ℝ := (-5, -15, 10)\n let center2 : ℝ × ℝ × ℝ := (15, 5, -20)\n let radius1 : ℝ := 24\n let radius2 : ℝ := 93\n let dist := Real.sqrt ((-20)^2 + (-20)^2 + 30^2)\n ∀ (p1 p2 : ℝ × ℝ × ℝ),\n ‖p1 - center1‖ = radius1 →\n ‖p2 - center2‖ = radius2 →\n ‖p2 - p1‖ ≤ radius1 + dist + radius2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00004-of-00041.arrow_22557", "source_license": null, "theorem_names": ["max_distance_between_spheres"], "statement_sha256": "a51a461d3a3428ba4d1df63cda1d2b193528f09179b19d00fef8f68b413ea4b2", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00004-of-00041.arrow_22557__a51a461d3a3428ba", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00004-of-00041.arrow_22557", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00004-of-00041.arrow_23806__ec66a9699bbf8bd6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem series_div_n_convergent {a : ℕ → ℝ} (h : Summable a) :\n Summable (fun n => a n / n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00004-of-00041.arrow_23806", "source_license": null, "theorem_names": ["series_div_n_convergent"], "statement_sha256": "ec66a9699bbf8bd6bcee7e51f0f75e17690752101ac0f02dbef17fd048742faa", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00004-of-00041.arrow_23806__ec66a9699bbf8bd6", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00004-of-00041.arrow_23806", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00004-of-00041.arrow_24986__dd332695b97fead8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_456148 :\n let f : ℝ → ℝ := fun x => 2 * x - 3\n let F : ℝ → ℝ := fun x => ∫ t in (1 : ℝ)..x, f t\n ∀ x ∈ Set.Icc 1 5, F x ≤ F 5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00004-of-00041.arrow_24986", "source_license": null, "theorem_names": ["OMR_problem_456148"], "statement_sha256": "dd332695b97fead8e3ac199663dc873fb1e578a484527630f52f51e4449a871f", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00004-of-00041.arrow_24986__dd332695b97fead8", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00004-of-00041.arrow_24986", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00004-of-00041.arrow_3578__23dd066db26a19a9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem functional_equation_proof\n (f : ℝ → ℝ)\n (h_dom : ∀ x, x ∈ Set.Icc 0 1 → f x ∈ Set.Icc 0 1)\n (h_eq : ∀ x y, x ∈ Set.Icc 0 1 → y ∈ Set.Icc 0 1 →\n f x + y ∈ Set.Icc 0 1 → f x + f y = f (f x + y)) :\n ∀ x ∈ Set.Icc 0 1, f (f x) = f x := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00004-of-00041.arrow_3578", "source_license": null, "theorem_names": ["functional_equation_proof"], "statement_sha256": "23dd066db26a19a9fd396db4bcfbaef185b32bba5dcbe24543034b647ad15924", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00004-of-00041.arrow_3578__23dd066db26a19a9", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00004-of-00041.arrow_3578", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00004-of-00041.arrow_4171__b5e8ab3d5b60175b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_218226 :\n ∃ (a : Fin 5 → ℕ) (r : Fin 5 → ℕ),\n (∀ i : Fin 5, r i > 0) ∧\n (∀ n : ℕ, ∃ i : Fin 5, ∃ k : ℕ, n = a i + k * r i) ∧\n (∑ i : Fin 5, (a i : ℚ) / (r i : ℚ)) = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00004-of-00041.arrow_4171", "source_license": null, "theorem_names": ["OMR_problem_218226"], "statement_sha256": "b5e8ab3d5b60175b803cddc46429552fa910432dc8121861727dd102602aa204", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00004-of-00041.arrow_4171__b5e8ab3d5b60175b", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00004-of-00041.arrow_4171", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00005-of-00041.arrow_11284__097be88bb7c43363", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem sequence_with_zeros\n (a : Fin 50 → ℤ)\n (h_vals : ∀ i, a i = 0 ∨ a i = 1 ∨ a i = -1)\n (h_sum : ∑ i, a i = 9)\n (h_square_sum : ∑ i, (a i + 1)^2 = 107) :\n (∑ i, (if a i = 0 then 1 else 0)) = 11 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00005-of-00041.arrow_11284", "source_license": null, "theorem_names": ["sequence_with_zeros"], "statement_sha256": "097be88bb7c433636883430b990e33ffc4dab2f5d80fd510ac73447dbb03a35d", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00005-of-00041.arrow_11284__097be88bb7c43363", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00005-of-00041.arrow_11284", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00005-of-00041.arrow_1446__15c450b148394b20", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem counter_reset_moves (n : ℕ) (h_n : n = 28) (init : Fin n → ℕ)\n (h_init : ∀ i, init i ≤ 2017) :\n ∃ (moves : Fin 11 → (Fin n → Bool) × ℕ),\n let final := λ i => init i - ∑ k, (moves k).2 * if (moves k).1 i then 1 else 0\n ∀ i, final i = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00005-of-00041.arrow_1446", "source_license": null, "theorem_names": ["counter_reset_moves"], "statement_sha256": "15c450b148394b20f36349e9f761948492f98ec922f1f575f1c5bdf99a155c24", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00005-of-00041.arrow_1446__15c450b148394b20", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00005-of-00041.arrow_1446", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00005-of-00041.arrow_2896__7f0f90ed04dcfb35", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem area_between_exp_curves :\n let f (x : ℝ) := Real.exp x\n let g (x : ℝ) := Real.exp (-x)\n ∫ x in (0)..1, (f x - g x) = Real.exp 1 + Real.exp (-1) - 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00005-of-00041.arrow_2896", "source_license": null, "theorem_names": ["area_between_exp_curves"], "statement_sha256": "7f0f90ed04dcfb35269afd28954cac9c8d7e348bec6a43dbb5839e41a1a05d74", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00005-of-00041.arrow_2896__7f0f90ed04dcfb35", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00005-of-00041.arrow_2896", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00006-of-00041.arrow_26522__e6d5f43f0f5f4c9b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\n\ntheorem algebra_2012_p176 (n : ℕ) (hn : 1 < n) ( x : Fin n → ℝ) (hx : ∀ i, x i ^ 2 = 1) :\n ∑ k, x k * x k ≤ n * ∑ k, x k ^ 2 * ∑ k, x k ^ 2 / n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00006-of-00041.arrow_26522", "source_license": null, "theorem_names": ["algebra_2012_p176"], "statement_sha256": "e6d5f43f0f5f4c9ba625381b8647d05771e7b8db398e791dae2eada1ac94ae9f", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00006-of-00041.arrow_26522__e6d5f43f0f5f4c9b", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00006-of-00041.arrow_26522", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00006-of-00041.arrow_3200__e66b96ef7f673183", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_469498 :\n let f : ℕ → ℕ → ℕ → ℕ := fun n k p =>\n (Nat.primeFactors (n ^ (p ^ k))).card\n f 10 3 2 = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00006-of-00041.arrow_3200", "source_license": null, "theorem_names": ["OMR_problem_469498"], "statement_sha256": "e66b96ef7f67318399651e0646436d939db5003510d17b04e77a14ec346e29cb", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00006-of-00041.arrow_3200__e66b96ef7f673183", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00006-of-00041.arrow_3200", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00006-of-00041.arrow_947__47f12b74e88699e7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\n\ntheorem main_2017_p46 (n : ℕ) (hn : n ≠ 0) (hn₁ : n ≠ 1) (x : Fin n → ℝ) ( h : ∀ i, 0 < x i) ( h₁ : ∑ i, (x i) = 1) : ∑ i, Real.log (x i * n) ≤ (n : ℝ) * ∑ i, x i * (n + 1) / n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00006-of-00041.arrow_947", "source_license": null, "theorem_names": ["main_2017_p46"], "statement_sha256": "47f12b74e88699e7ff46bd2ef02d066110c9fda82f2d68aae6f8c150d3043e82", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00006-of-00041.arrow_947__47f12b74e88699e7", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00006-of-00041.arrow_947", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00007-of-00041.arrow_30021__10945b6378e36f72", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_11201 :\n let f : ℕ → ℕ → ℕ → ℤ := fun a b c =>\n let volume := (a * b * c : ℤ)\n let possible_orientations :=\n (if 4 ∣ a then (a / 4 * b * c : ℤ) else 0) +\n (if 4 ∣ b then (a * b / 4 * c : ℤ) else 0) +\n (if 4 ∣ c then (a * b * c / 4 : ℤ) else 0)\n if possible_orientations > 0 ∧ 4 ∣ volume then\n volume / 4\n else if volume = 0 then\n 0\n else\n -1\n f 12 16 20 = 960 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00007-of-00041.arrow_30021", "source_license": null, "theorem_names": ["OMR_problem_11201"], "statement_sha256": "10945b6378e36f726c6043435ef14ae63056cf34a350b55b760a2929d07d31e7", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00007-of-00041.arrow_30021__10945b6378e36f72", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00007-of-00041.arrow_30021", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00008-of-00041.arrow_28029__75ff82107dbf1a10", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem cable_pieces_ratio {n : ℕ} (hn : n = 21)\n (pieces : Fin n → ℝ)\n (pos_pieces : ∀ i, 0 < pieces i)\n (sum_pieces : ∑ i, pieces i = 21)\n (bound_ratio : ∀ i j, pieces i ≤ 3 * pieces j) :\n ∃ i j, i ≠ j ∧ pieces i ≤ pieces j ∧ pieces j ≤ pieces i + pieces i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00008-of-00041.arrow_28029", "source_license": null, "theorem_names": ["cable_pieces_ratio"], "statement_sha256": "75ff82107dbf1a102c7dd245efcb60fae75c74d3804cd2e1419cf2e8c321f52d", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00008-of-00041.arrow_28029__75ff82107dbf1a10", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00008-of-00041.arrow_28029", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00009-of-00041.arrow_13106__a8caaffc0f68ea46", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem integral_special_function {f : ℝ → ℝ} (hf : Differentiable ℝ f)\n (h_eq : ∀ x, f x = x^2 + 2 * (deriv f 2) * x + 3) :\n ∫ x in (0)..3, f x = -18 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00009-of-00041.arrow_13106", "source_license": null, "theorem_names": ["integral_special_function"], "statement_sha256": "a8caaffc0f68ea46c50375fb351281c17f87eee2a18a50b7ff8bb340541c267a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00009-of-00041.arrow_13106__a8caaffc0f68ea46", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00009-of-00041.arrow_13106", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00009-of-00041.arrow_28871__41aafd50ebe47ae9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem no_equilateral_triangle_possible :\n let A₁ : ℝ × ℝ := (-3, 0)\n let B : ℝ × ℝ := (-3/5, 12/5)\n ∀ y : ℝ, let C : ℝ × ℝ := (-9, y)\n ¬ (dist A₁ B = dist B C ∧ dist B C = dist C A₁ ∧ dist C A₁ = dist A₁ B) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00009-of-00041.arrow_28871", "source_license": null, "theorem_names": ["no_equilateral_triangle_possible"], "statement_sha256": "41aafd50ebe47ae97117a2557aba8c81328544b4c2ad278c392fa290ece35da9", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00009-of-00041.arrow_28871__41aafd50ebe47ae9", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00009-of-00041.arrow_28871", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00009-of-00041.arrow_9182__99696f4e851880e8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem odd_squares_representation (p q : ℕ)\n (hp_prime : Nat.Prime p) (hq_prime : Nat.Prime q)\n (hp_mod : p % 8 = 3) (hq_mod : q % 8 = 3)\n (hp_neq_q : p ≠ q) :\n ¬∃ (n : ℕ) (squares : Fin n → ℕ) (hodd : ∀ i, Odd (squares i)),\n n < 10 ∧ 2 * p * q = ∑ i, (squares i)^2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00009-of-00041.arrow_9182", "source_license": null, "theorem_names": ["odd_squares_representation"], "statement_sha256": "99696f4e851880e8ac28170148219a4b7c6d7ca7cb87107fc6ac1a60c8ea8c0a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00009-of-00041.arrow_9182__99696f4e851880e8", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00009-of-00041.arrow_9182", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00010-of-00041.arrow_15755__0e5d0f884b7d80b5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_equal_function_derivative\n {f g : ℝ → ℝ}\n (hf : Continuous f)\n (hg : Differentiable ℝ g)\n (h_endpoint : (f 0 - deriv g 0) * (deriv g 1 - f 1) > 0) :\n ∃ c ∈ Set.Ioo 0 1, f c = deriv g c := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00010-of-00041.arrow_15755", "source_license": null, "theorem_names": ["exists_equal_function_derivative"], "statement_sha256": "0e5d0f884b7d80b5eab974f657d7cf4da3dadf135ef685bb1ecfd2f96e29b945", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00010-of-00041.arrow_15755__0e5d0f884b7d80b5", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00010-of-00041.arrow_15755", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00010-of-00041.arrow_18036__d9c87fafe46e74da", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\ntheorem extracted_456aee69 (n : ℕ) (hn : (6 : ℕ) ≤ n)\n (h_imp :\n (∃ (A : Finset ℕ) (B : Finset ℕ) (C : Finset ℕ),\n A ∪ B ∪ C = Finset.Icc (1 : ℕ) n ∧\n A ∩ B = ∅ ∧\n B ∩ C = ∅ ∧ C ∩ A = ∅ ∧ A.card = B.card ∧ B.card = C.card ∧ A.sum id = B.sum id ∧ B.sum id = C.sum id) →\n (3 : ℕ) ∣ n)\n (hn3 : (3 : ℕ) ∣ n) (h₁ : n % (3 : ℕ) = (0 : ℕ)) (k : ℕ) (hk : n = (3 : ℕ) * k) (h₃ : k ≥ (2 : ℕ))\n (h₄ : n = (3 : ℕ) * k) (h₅ : k ≥ (2 : ℕ)) (h₇ : n = (3 : ℕ) * k) (h₈ : k ≥ (2 : ℕ)) (h₁₀ : n = (3 : ℕ) * k)\n (h₁₁ : k ≥ (2 : ℕ)) (x : ℕ) (h : (1 : ℕ) ≤ x ∧ x ≤ (3 : ℕ) * k) (h₁₂ : (1 : ℕ) ≤ x) (h₁₃ : x ≤ (3 : ℕ) * k)\n (h₁₄ : x % (3 : ℕ) = (2 : ℕ)) :\n ((∃ (a : ℕ), ((1 : ℕ) ≤ a ∧ a ≤ k) ∧ (3 : ℕ) * a - (2 : ℕ) = x) ∨\n ∃ (a : ℕ), ((1 : ℕ) ≤ a ∧ a ≤ k) ∧ (3 : ℕ) * a - (1 : ℕ) = x) ∨\n ∃ (a : ℕ), ((1 : ℕ) ≤ a ∧ a ≤ k) ∧ (3 : ℕ) * a = x := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00010-of-00041.arrow_18036", "source_license": null, "theorem_names": ["extracted_456aee69"], "statement_sha256": "d9c87fafe46e74da0b61a44937b8bdbea0abd9610f99a7ea34908f807fa86425", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00010-of-00041.arrow_18036__d9c87fafe46e74da", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00010-of-00041.arrow_18036", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00011-of-00041.arrow_28296__062710c5173d7622", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\ntheorem extracted_aa17bcd3 (f : ℕ → ℕ) (h₀ : ∀ (n : ℕ), (1 : ℕ) ≤ n ∧ n ≤ (30 : ℕ) → f n = ∑ k ∈ n.divisors, k) :\n {n ∈ Finset.Icc (1 : ℕ) (30 : ℕ) | Nat.Prime (f n)} = {(2 : ℕ), (4 : ℕ), (9 : ℕ), (16 : ℕ), (25 : ℕ)} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00011-of-00041.arrow_28296", "source_license": null, "theorem_names": ["extracted_aa17bcd3"], "statement_sha256": "062710c5173d7622eabb12985ccb0e1290386d58c6a11366d92cbf24ad6ef28e", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00011-of-00041.arrow_28296__062710c5173d7622", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00011-of-00041.arrow_28296", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00011-of-00041.arrow_28997__dbb61ab44ee2a5d6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_22829 : ∃ f : ℝ → ℝ, Continuous f ∧\n (∀ x : ℝ, x * (∫ t in (0)..(2*x), f t) + 2 * (∫ t in x..(0), t * f (2*t)) = 2*x^4 - 2*x^3) ∧\n (∀ x : ℝ, f x ≥ -3/4) ∧\n (∃ x : ℝ, f x = -3/4) ∧\n (∀ M : ℝ, ∃ x : ℝ, f x > M) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00011-of-00041.arrow_28997", "source_license": null, "theorem_names": ["OMR_problem_22829"], "statement_sha256": "dbb61ab44ee2a5d635cb76be919462c36f4023326bd7a1b0c7e712b54b8c4626", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00011-of-00041.arrow_28997__dbb61ab44ee2a5d6", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00011-of-00041.arrow_28997", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00011-of-00041.arrow_7109__a920a0d472397e58", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_279960 : ∀ n : ℕ, ∃ p : Polynomial ℤ, ∀ k : ℕ, k ≤ n → Nat.Prime (Int.natAbs (p.eval (k : ℤ))) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00011-of-00041.arrow_7109", "source_license": null, "theorem_names": ["OMR_problem_279960"], "statement_sha256": "a920a0d472397e58b20f2b9a920114ac3971eeac690b75b2ec4683779028c506", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00011-of-00041.arrow_7109__a920a0d472397e58", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00011-of-00041.arrow_7109", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00012-of-00041.arrow_27535__6da2938499cbfa08", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem average_velocity_first_30_seconds :\n let v := fun t : ℝ => t^2 - 3*t + 8\n let displacement := ∫ t in (0)..(30), v t\n displacement / 30 = 263 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00012-of-00041.arrow_27535", "source_license": null, "theorem_names": ["average_velocity_first_30_seconds"], "statement_sha256": "6da2938499cbfa0829da4e09acbd24a7fb44534cd2ff38b6354afe37acfff63a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00012-of-00041.arrow_27535__6da2938499cbfa08", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00012-of-00041.arrow_27535", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00012-of-00041.arrow_3962__8cab4ba4b6c6e8b7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_142571 {K V W : Type*} [Field K] [AddCommGroup V] [Module K V]\n [AddCommGroup W] [Module K W] (T : V →ₗ[K] W)\n (h_unique : ∀ L₁ L₂ : W →ₗ[K] V, L₁ ∘ₗ T = LinearMap.id → L₂ ∘ₗ T = LinearMap.id → L₁ = L₂)\n (L : W →ₗ[K] V) (hL : L ∘ₗ T = LinearMap.id) :\n ∀ v : V, T (L (T v)) = T v := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00012-of-00041.arrow_3962", "source_license": null, "theorem_names": ["OMR_problem_142571"], "statement_sha256": "8cab4ba4b6c6e8b7dc77bbc28e312de4ecfd41bc4d8decf86ab55b705631122b", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00012-of-00041.arrow_3962__8cab4ba4b6c6e8b7", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00012-of-00041.arrow_3962", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00013-of-00041.arrow_12444__a061010330468e42", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem function_extremum_values :\n let f (a b x : ℝ) := a^2 * x^3 + 3*a * x^2 - b*x - 1\n let a₀ : ℝ := -1/2\n let b₀ : ℝ := -9/4\n\n (f a₀ b₀ 1 = 0) ∧\n\n (deriv (f a₀ b₀) 1 = 0) ∧\n\n (∀ x ∈ Set.Icc 0 3, f a₀ b₀ x ≥ -1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00013-of-00041.arrow_12444", "source_license": null, "theorem_names": ["function_extremum_values"], "statement_sha256": "a061010330468e42512add523908c4828e0931060c2f273305bce093a615a7bc", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00013-of-00041.arrow_12444__a061010330468e42", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00013-of-00041.arrow_12444", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00013-of-00041.arrow_17721__059638a24c0a6209", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_248131 (f : ℝ → ℝ)\n (h_surj : Function.Surjective f)\n (h_divergent : ∀ (x : ℕ → ℝ), (¬∃ L, Filter.Tendsto x Filter.atTop (nhds L)) →\n (¬∃ L, Filter.Tendsto (fun n => f (x n)) Filter.atTop (nhds L)))\n (h_f0 : f 0 = 1)\n (h_f1 : f 1 = 0) :\n let g := fun x => f x - x\n g 0 + g 1 = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00013-of-00041.arrow_17721", "source_license": null, "theorem_names": ["OMR_problem_248131"], "statement_sha256": "059638a24c0a6209d62797f13040a7d8e4940a0d435b3c3b04830dcc8d7f48c4", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00013-of-00041.arrow_17721__059638a24c0a6209", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00013-of-00041.arrow_17721", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00013-of-00041.arrow_7350__5bf77bcf2928e0b8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem linear_function_slope_from_integrals\n (f : ℝ → ℝ) (m b : ℝ)\n (h_linear : ∀ x, f x = m * x + b)\n (h_int1 : ∫ x in (3:ℝ)..5, f x = 0)\n (h_int2 : ∫ x in (5:ℝ)..7, f x = 12) :\n m = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00013-of-00041.arrow_7350", "source_license": null, "theorem_names": ["linear_function_slope_from_integrals"], "statement_sha256": "5bf77bcf2928e0b87ea04375af0716146eb2deaef3b1d55219f03f3963f6971c", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00013-of-00041.arrow_7350__5bf77bcf2928e0b8", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00013-of-00041.arrow_7350", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00014-of-00041.arrow_14765__dac1488999729d01", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\n\ntheorem exercise_10_4_6_18 {G : Type*} [Group G] [Fintype G]\n (hG : Nat.card G = 2)\n (a : G) : a ^ 2 = 1 ∧ ∀ a : G, a = a⁻¹ ∧ (∀ x y : G, x * y * x * y = 1) ↔ ∀ x : G, orderOf x ≤ √2 * Real.sqrt √11 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00014-of-00041.arrow_14765", "source_license": null, "theorem_names": ["exercise_10_4_6_18"], "statement_sha256": "dac1488999729d018c7dd707becbb6095d491d0528482643a402377e870a09ae", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00014-of-00041.arrow_14765__dac1488999729d01", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00014-of-00041.arrow_14765", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00014-of-00041.arrow_15935__9f5f5ec4ff79b3f7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_429517 :\n let g : ℝ → ℝ := fun x => 3 * x^2 - 2 * x + 1\n ∫ x in (0 : ℝ)..(1 : ℝ), g x = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00014-of-00041.arrow_15935", "source_license": null, "theorem_names": ["OMR_problem_429517"], "statement_sha256": "9f5f5ec4ff79b3f7870bb9d3efc2d3c1eaacb674440be1bc68756475caccddf3", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00014-of-00041.arrow_15935__9f5f5ec4ff79b3f7", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00014-of-00041.arrow_15935", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00014-of-00041.arrow_7421__32713f50a6225281", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_129400 :\n ∃ k : ℝ, k > 0 ∧\n (let a : Fin 5 → ℝ := fun _ => k\n let S1 := ∑ i : Fin 5, ∑ j : Fin 5, if i < j then 1 / (a i * a j) else 0\n let S2 := ∑ i : Fin 5, ∑ j : Fin 5, if i < j then 1 / (a i + a j) else 0\n (Nat.choose 5 2 : ℝ) * S1 = 4 * S2^2) ∧\n k = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00014-of-00041.arrow_7421", "source_license": null, "theorem_names": ["OMR_problem_129400"], "statement_sha256": "32713f50a6225281a74d782002cd9cb8715a49b7282d8c75974fd94eff42562f", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00014-of-00041.arrow_7421__32713f50a6225281", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00014-of-00041.arrow_7421", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00015-of-00041.arrow_11273__6873fcf53d4e719f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem linear_function_unique_from_integrals\n (f : ℝ → ℝ)\n (hf : ∃ (a b : ℝ), ∀ x, f x = a * x + b)\n (hint1 : ∫ (x : ℝ) in (0)..(1), f x = 5)\n (hint2 : ∫ (x : ℝ) in (0)..(1), x * (f x) = 17/6) :\n ∀ x, f x = 4 * x + 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00015-of-00041.arrow_11273", "source_license": null, "theorem_names": ["linear_function_unique_from_integrals"], "statement_sha256": "6873fcf53d4e719f94a5e1a08f0b35a6e9871ff3f9bc65ac895cdd95e92df417", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00015-of-00041.arrow_11273__6873fcf53d4e719f", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00015-of-00041.arrow_11273", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00015-of-00041.arrow_29318__d0c2a4b94d259a86", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_489572 (G : Type*) [AddCommGroup G] [Module ℤ G] (g : G) :\n (5 : ℤ) • ((3 : ℤ) • g - (2 : ℤ) • g) = (5 : ℤ) • g := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00015-of-00041.arrow_29318", "source_license": null, "theorem_names": ["OMR_problem_489572"], "statement_sha256": "d0c2a4b94d259a86c0d987b3415e42a8db4fffc08fc9b703ba8847d2b4f143a0", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00015-of-00041.arrow_29318__d0c2a4b94d259a86", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00015-of-00041.arrow_29318", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00015-of-00041.arrow_31485__dcfbecbfc79a808b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\ntheorem extracted_e69bd1d0 (n : ℕ) (hn : n ≥ (20 : ℕ)) :\n (((0 : ℂ) + ((↑(11 / 10 : ℝ) : ℂ) + (1 : ℂ) / (↑(↑n : ℝ) : ℂ)) * Complex.I) ^ (2 : ℕ) +\n (2 : ℂ) * ((0 : ℂ) + ((↑(11 / 10 : ℝ) : ℂ) + (1 : ℂ) / (↑(↑n : ℝ) : ℂ)) * Complex.I) * Complex.I +\n (2 : ℂ)).re ∈\n Set.Icc (-5 : ℝ) (5 : ℝ) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00015-of-00041.arrow_31485", "source_license": null, "theorem_names": ["extracted_e69bd1d0"], "statement_sha256": "dcfbecbfc79a808b502189cb17840055fa8792db926a7beb5cb0661d464d4cf8", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00015-of-00041.arrow_31485__dcfbecbfc79a808b", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00015-of-00041.arrow_31485", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00015-of-00041.arrow_4841__2767ca5cb1933cef", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_exercise1275_6 (G : Type*) [Group G] [Fintype G]\n (h₀ : Fintype.card G ∣ 2) (h₁ : ∀ a : G, a ≠ 1 ↔ orderOf a = 2) : ∀ a b : G, a * b * (a * b) = 1 ∧ ∀ a : G, a^(-2 : ℤ)= 1∧ ∀ a b : G, a^2 * b^2 = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00015-of-00041.arrow_4841", "source_license": null, "theorem_names": ["theorem_exercise1275_6"], "statement_sha256": "2767ca5cb1933ceff2d3164bbb7da0c1ff9f60692e8a7a98f454111f32a88f8b", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00015-of-00041.arrow_4841__2767ca5cb1933cef", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00015-of-00041.arrow_4841", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00016-of-00041.arrow_25753__68275df4a679e3c8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_337195 :\n let a : ℕ → ℕ := fun n => 2^(2^(n+1)) + 2^(2^n) + 1\n (∀ j : ℕ, 0 < j → j < 4 → (Nat.primeFactors (a j)).card < 5) ∧\n (Nat.primeFactors (a 4)).card ≥ 5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00016-of-00041.arrow_25753", "source_license": null, "theorem_names": ["OMR_problem_337195"], "statement_sha256": "4414ed0241c8dbca825c9127268f0ed669c2400b7f12f7a44e2f2ebd37eebcad", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00016-of-00041.arrow_25753__68275df4a679e3c8", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00016-of-00041.arrow_25753", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00016-of-00041.arrow_32006__a70275ec6032ad9d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\ntheorem extracted_df9b232a :\n let f : ℕ → ℤ := fun (n : ℕ) =>\n if n % (5 : ℕ) = (1 : ℕ) ∨ n % (5 : ℕ) = (4 : ℕ) ∨ n % (5 : ℕ) = (0 : ℕ) then (↑n : ℤ) else -(↑n : ℤ);\n ∀ (k : ℕ),\n ∑ n ∈ Finset.range ((5 : ℕ) * k), f (n + (1 : ℕ)) = (5 : ℤ) * (↑k : ℤ) * ((↑k : ℤ) + (1 : ℤ)) / (2 : ℤ) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00016-of-00041.arrow_32006", "source_license": null, "theorem_names": ["extracted_df9b232a"], "statement_sha256": "a70275ec6032ad9d3eac6a69bc251251ed924553504c809a9df3bccbee8d3b34", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00016-of-00041.arrow_32006__a70275ec6032ad9d", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00016-of-00041.arrow_32006", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00017-of-00041.arrow_15956__51d10e41d305d8ca", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_125017 : ∃ (P Q : Polynomial ℝ),\n Q = Polynomial.X * (Polynomial.X + 1) ∧\n (∀ x : ℝ, x ≠ 0 ∧ x ≠ -1 ∧ x ≠ -2 →\n (P.eval x) / (Q.eval x) - (P.eval (x + 1)) / (Q.eval (x + 1)) = 1 / (x * (x + 2))) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00017-of-00041.arrow_15956", "source_license": null, "theorem_names": ["OMR_problem_125017"], "statement_sha256": "51d10e41d305d8ca3a94162dc2c2e8012c2340aa4e45c60c76199840b24cf142", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00017-of-00041.arrow_15956__51d10e41d305d8ca", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00017-of-00041.arrow_15956", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00017-of-00041.arrow_19730__65418375eda23837", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_1657166 (n : ℕ) (h₀ : n ≠ 0) (x : Fin n → ℝ) (h₁ : ∀ i, 0 < x i) (h₂ : ∑ i, x i = 1) : Real.sqrt (n + 1) * ∑ i, (x i) ^ 2 ≤ n * ∑ i, x i / x i + (n + 1)^ (2 : ℝ) / Real.sqrt ( n + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00017-of-00041.arrow_19730", "source_license": null, "theorem_names": ["lean_workbook_1657166"], "statement_sha256": "65418375eda23837b9a75192c59ddb2cda7bc7b4c5588413db4ec5922e6e6ac7", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00017-of-00041.arrow_19730__65418375eda23837", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00017-of-00041.arrow_19730", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00017-of-00041.arrow_23367__fdab0db9f57456ff", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_376150 (m n : ℕ) (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) :\n let f := fun x : Fin n → ℝ => ‖A.mulVec x - b‖^2 + ∑ k, |x k|\n ∃ H : Matrix (Fin n) (Fin n) ℝ,\n H = 2 • (A.transpose * A) ∧\n Matrix.trace H = 2 * Matrix.trace (A.transpose * A) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00017-of-00041.arrow_23367", "source_license": null, "theorem_names": ["OMR_problem_376150"], "statement_sha256": "fdab0db9f57456ffd9ff5e4d332d5fc94ca91edbff9ee524d8ed17633bb5ec2b", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00017-of-00041.arrow_23367__fdab0db9f57456ff", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00017-of-00041.arrow_23367", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00017-of-00041.arrow_27389__6e862da012830bc2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem quadratic_integral_formula {f : ℝ → ℝ} (h_quad : ∃ (a b c : ℝ), ∀ x, f x = a*x^2 + b*x + c) :\n ∫ x in (0)..2, f x = (f 0 + 4 * f 1 + f 2) / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00017-of-00041.arrow_27389", "source_license": null, "theorem_names": ["quadratic_integral_formula"], "statement_sha256": "6e862da012830bc220b714ff0f377c6cbac68ce972e9bee31f7b60d0f06fd3fe", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00017-of-00041.arrow_27389__6e862da012830bc2", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00017-of-00041.arrow_27389", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00019-of-00041.arrow_10126__62f576fdbb14331c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_247017 :\n let x : ℝ → ℝ := fun t => Real.exp (-t) * Real.cos t\n let y : ℝ → ℝ := fun t => Real.exp (-t) * Real.sin t\n let arc_length := ∫ t in (0)..(Real.pi / 2), Real.sqrt ((deriv x t)^2 + (deriv y t)^2)\n arc_length = Real.sqrt 2 * (1 - Real.exp (-(Real.pi / 2))) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00019-of-00041.arrow_10126", "source_license": null, "theorem_names": ["OMR_problem_247017"], "statement_sha256": "62f576fdbb14331cba8cc8a02ed16b3e26dcc512713f0e946805829a0583f180", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00019-of-00041.arrow_10126__62f576fdbb14331c", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00019-of-00041.arrow_10126", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00019-of-00041.arrow_10719__7279ab220e4b1152", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\n\ntheorem algebra_theorem_2014_p1480 (n : ℕ) (hn : n ≥ 2) (x : Fin n → ℝ) (hx : ∀ a, x a ^ 2 = 1) : ∑ i : Fin n, (x i * (n - 1)) ^ 2 ≤ n * (n - 1) * ∑ i : Fin n, x i ^ 2 * ∑ i : Fin n, x i ^ 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00019-of-00041.arrow_10719", "source_license": null, "theorem_names": ["algebra_theorem_2014_p1480"], "statement_sha256": "7279ab220e4b1152671d113cb33914316b73d8d0dbcd026087cf73ce38518bb6", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00019-of-00041.arrow_10719__7279ab220e4b1152", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00019-of-00041.arrow_10719", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00019-of-00041.arrow_20095__bdae09351c947889", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_126774 :\n let f : ℕ → ℕ → ℚ := fun m n =>\n ((2 * m + n + 1) * (m + 1)) / (n * (n + 1) * (m + n)) * (Nat.choose (m + n) (m + 1))^2\n f 5 3 = 686 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00019-of-00041.arrow_20095", "source_license": null, "theorem_names": ["OMR_problem_126774"], "statement_sha256": "bdae09351c9478898b5ba4a0d71c9e6c93286fcbaf89dcf52ee9d654a2b7aacb", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00019-of-00041.arrow_20095__bdae09351c947889", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00019-of-00041.arrow_20095", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00019-of-00041.arrow_21328__f93321174b8d8f95", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_355220 :\n let A : Matrix (Fin 3) (Fin 2) ℚ := !![1, 2; 2, 3; 3, 4]\n (∀ i j, A i j > 0) →\n (∀ i l j k, (A i j - A i k) * (A l j - A l k) ≥ 0) →\n (∏ i : Fin 3, ∑ j : Fin 2, A i j) / (∑ j : Fin 2, ∏ i : Fin 3, A i j) = 7/2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00019-of-00041.arrow_21328", "source_license": null, "theorem_names": ["OMR_problem_355220"], "statement_sha256": "f93321174b8d8f95d95b0becc25d3309370aafafe588fc017309d370211c29e2", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00019-of-00041.arrow_21328__f93321174b8d8f95", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00019-of-00041.arrow_21328", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00019-of-00041.arrow_22104__d57b8248a9849ec7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_491787 :\n let S₁ : ℕ → ℕ := fun k => Finset.sum (Finset.Icc 1 k) (fun i => i % 4)\n let S₂ : ℕ → ℕ := fun k => Finset.sum (Finset.Icc (k+1) 2000) (fun i => i % 3)\n S₁ 800 = S₂ 800 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00019-of-00041.arrow_22104", "source_license": null, "theorem_names": ["OMR_problem_491787"], "statement_sha256": "d57b8248a9849ec73f74c2ff70115057f933145f6be482ddd4615f3b479f7547", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00019-of-00041.arrow_22104__d57b8248a9849ec7", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00019-of-00041.arrow_22104", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00020-of-00041.arrow_13584__7aeb0d8054189b2b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_393592 : ∀ n : ℕ, n > 0 → ((n^2 + 2) ∣ (n^6 + 206) ↔ n ∈ ({1, 2, 3, 4, 8, 14} : Set ℕ)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00020-of-00041.arrow_13584", "source_license": null, "theorem_names": ["OMR_problem_393592"], "statement_sha256": "7aeb0d8054189b2bb4f0ce48636f057d6429f00313bf68adfa4512f5d0c7deec", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00020-of-00041.arrow_13584__7aeb0d8054189b2b", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00020-of-00041.arrow_13584", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00020-of-00041.arrow_29105__e507ccaf5b5b5315", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_255223 :\n let p : ℕ := 11\n (Nat.Prime p) ∧ (p % 5 = 1) ∧\n (∃ q : ℕ, q ∈ Set.Icc 2 (p - 1) ∧ p ∣ (q^2 + q - 1) ∧\n (∀ r : ℕ, r ∈ Set.Icc 2 (p - 1) ∧ p ∣ (r^2 + r - 1) → q ≤ r) ∧\n q = 3) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00020-of-00041.arrow_29105", "source_license": null, "theorem_names": ["OMR_problem_255223"], "statement_sha256": "e507ccaf5b5b5315771083d3c9fa0047312a823abef46087e5e0eed53e648100", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00020-of-00041.arrow_29105__e507ccaf5b5b5315", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00020-of-00041.arrow_29105", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00021-of-00041.arrow_12026__025ae0d870dbe877", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem sum_bounded_exists_integers {n : ℕ} (hn : 2 ≤ n)\n (c : Fin n → ℝ) (hc_sum_nonneg : 0 ≤ ∑ i, c i) (hc_sum_bound : ∑ i, c i ≤ n) :\n ∃ k : Fin n → ℤ, (∑ i, k i = 0) ∧\n ∀ i, (1 - n : ℝ) ≤ c i + n * (k i) ∧ c i + n * (k i) ≤ n := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00021-of-00041.arrow_12026", "source_license": null, "theorem_names": ["sum_bounded_exists_integers"], "statement_sha256": "025ae0d870dbe877ad1df7fe0e29a58e9f6aead12f26dc3745f936c21ea5afe1", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00021-of-00041.arrow_12026__025ae0d870dbe877", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00021-of-00041.arrow_12026", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00022-of-00041.arrow_14999__9714ba8e6457bcfa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\n\ntheorem algebra_2017_p199 (n : ℕ) (h₀ : 2 < n) (x : Fin n → ℝ) (h₁ : ∀ i, 0 < x i) (h₂ : ∑ i, x i = 1) : ∑ i, x i * ∑ i, x i * (1 / (n - 1)) ≤ n * (1 + 1 / (n - 1)) / (n - 1) * ∑ i, x i + 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00022-of-00041.arrow_14999", "source_license": null, "theorem_names": ["algebra_2017_p199"], "statement_sha256": "9714ba8e6457bcfac0e4255927fa39ad473c990397cfef2f2b68b56dded75e6b", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00022-of-00041.arrow_14999__9714ba8e6457bcfa", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00022-of-00041.arrow_14999", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00022-of-00041.arrow_24174__fda2f13afa6c435d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_265038 :\n let P : Polynomial ℝ := Polynomial.X^2 + 1\n (∀ x : ℝ, x ≥ 0 → P.eval x > 0) ∧\n (∀ k : ℕ, (Polynomial.coeff ((1 + Polynomial.X) * P) k ≥ 0)) ∧\n (∀ n : ℕ, n > 0 ∧ (∀ k : ℕ, (Polynomial.coeff ((1 + Polynomial.X)^n * P) k ≥ 0)) → n ≥ 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00022-of-00041.arrow_24174", "source_license": null, "theorem_names": ["OMR_problem_265038"], "statement_sha256": "fda2f13afa6c435d39fb1b936997c7fc88b2a2b4ce92f51189c6d0189f0572de", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00022-of-00041.arrow_24174__fda2f13afa6c435d", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00022-of-00041.arrow_24174", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00023-of-00041.arrow_22451__1f91dbd481fff1b6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem consecutive_product_representation (m n : ℕ) :\n ∃ r : ℕ, r < 5 ∧ r ∈ ({0, 1, 4} : Set ℕ) ∧\n (n*(n+1)*(n+2)*(n+3)*(n+4) - m*(m+1)*(m+2)) % 5 = r := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00023-of-00041.arrow_22451", "source_license": null, "theorem_names": ["consecutive_product_representation"], "statement_sha256": "1f91dbd481fff1b6390912f92b84dac37acca79efef94e247096a2ec7b780323", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00023-of-00041.arrow_22451__1f91dbd481fff1b6", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00023-of-00041.arrow_22451", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00024-of-00041.arrow_12564__e37a74fbf7ec1fa6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_plus_3036268 (n : ℕ) (z : Fin n → ℂ) : ∑ i, ‖z i‖ ≥ ‖∑ i, z i‖/ n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00024-of-00041.arrow_12564", "source_license": null, "theorem_names": ["lean_workbook_plus_3036268"], "statement_sha256": "e37a74fbf7ec1fa619339e583bb39442bacc7ca239649fede8698619c8fb9a62", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00024-of-00041.arrow_12564__e37a74fbf7ec1fa6", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00024-of-00041.arrow_12564", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00026-of-00041.arrow_19532__6ad98e34a71263b8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_321767 :\n Set.ncard {x : ℝ | abs (x - 1) - 2 * abs x = 3 * abs (x + 1)} = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00026-of-00041.arrow_19532", "source_license": null, "theorem_names": ["OMR_problem_321767"], "statement_sha256": "6ad98e34a71263b831fff82b440676db6c1affdac6f3e807956b37d62df4fc8e", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00026-of-00041.arrow_19532__6ad98e34a71263b8", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00026-of-00041.arrow_19532", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00026-of-00041.arrow_704__5f98cea22f9f5e46", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_32193 (a : ℝ) (ha : a > 0) :\n ∃ f : ℝ → ℝ, Continuous f ∧\n (∀ x : ℝ, a * f x * ∫ t in (0 : ℝ)..x, f t ^ 2 = x * ∫ t in (0 : ℝ)..x, f t - ∫ t in (0 : ℝ)..x, t * f t) ∧\n ∃ C : ℝ, ∀ x : ℝ, x ≥ 0 → f x = C * Real.sqrt x := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00026-of-00041.arrow_704", "source_license": null, "theorem_names": ["OMR_problem_32193"], "statement_sha256": "5f98cea22f9f5e469e95b21eddb408ae77abae8859fadd2f9b5703f2180d7777", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00026-of-00041.arrow_704__5f98cea22f9f5e46", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00026-of-00041.arrow_704", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00026-of-00041.arrow_8335__59c2581823f9b7ba", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat Classical Polynomial\n\n\ntheorem OMR_problem_70299 (r : ℝ) (hr : 0 < r) :\n let x : ℝ → ℝ := fun t => 2 * r * (t - Real.sin t * Real.cos t)\n let y : ℝ → ℝ := fun t => 2 * r * (Real.sin t)^2\n ∀ t ∈ Set.Icc 0 Real.pi,\n let a_mag := Real.sqrt ((deriv (deriv x) t)^2 + (deriv (deriv y) t)^2)\n a_mag = 4 * r := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00026-of-00041.arrow_8335", "source_license": null, "theorem_names": ["OMR_problem_70299"], "statement_sha256": "59c2581823f9b7ba5bb39df56d041b0a7eabb297eb6947f204be7221ca59b54f", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00026-of-00041.arrow_8335__59c2581823f9b7ba", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00026-of-00041.arrow_8335", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_17495__ce46c7cb9510780d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_439141_0_gs2 (a : ℝ) (ha : a ≠ 0) :\n let f : ℝ → ℝ := fun x => a * (1 - x)\n let f' : ℝ → ℝ := fun x => -a\n (∫ x in (0 : ℝ)..1, (f x)^4 = a^4 / 5) ∧\n (∫ x in (0 : ℝ)..1, (f' x)^4 = a^4) ∧\n (∀ k : ℝ, (∫ x in (0 : ℝ)..1, (f x)^4 = k * ∫ x in (0 : ℝ)..1, (f' x)^4) → k = 1/5) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_17495", "source_license": null, "theorem_names": ["OMR_problem_439141_0_gs2"], "statement_sha256": "ce46c7cb9510780dbffe3cd116fd8a4ef88441e8877d0eccccf7471917c17313", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_17495__ce46c7cb9510780d", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_17495", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_17801__3a85f2678a76b132", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_381752_1_gp2 (a : ℝ) :\n let u := fun x => a * x * (1 - x)\n ∫ x in (0)..(1), (u x)^2 + (deriv u x)^2 = (11 / 30) * a^2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_17801", "source_license": null, "theorem_names": ["OMR_problem_381752_1_gp2"], "statement_sha256": "3a85f2678a76b1327a7bd0c0d3e3af2ec08c019c3450196465543db87d0972c5", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_17801__3a85f2678a76b132", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_17801", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_20196__352a81f0f290e5bd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_496955 (K : Type*) [Field K] (n : ℕ)\n (B : Matrix (Fin n) (Fin n) K)\n (A : Matrix (Fin n) (Fin n) K)\n (h : ∀ v ∈ LinearMap.range (Matrix.toLin' B), A.mulVec v ∈ LinearMap.range (Matrix.toLin' B)) :\n Matrix.rank (A * B) ≤ Matrix.rank B := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_20196", "source_license": null, "theorem_names": ["OMR_problem_496955"], "statement_sha256": "352a81f0f290e5bd26e201cf11816e8fbbc645e64277be714e5fcdd6af3f23d7", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_20196__352a81f0f290e5bd", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_20196", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_25391__106353603aebdeaa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_410740_0_gp8 (a : ℝ) (ha1 : 1/2 < a) (ha2 : a < 1) :\n let f : ℝ → ℝ := fun v => v * (v - a) * (v - 1)\n ∀ v_r : ℝ, v_r ∈ Set.Ioo a 1 →\n let I : ℝ → ℝ := fun v => f v + v\n let dI_dv : ℝ → ℝ := fun v => 3 * v^2 - 2 * (1 + a) * v + (a + 1)\n (deriv I v_r = dI_dv v_r) ∧ (0 < dI_dv v_r) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_25391", "source_license": null, "theorem_names": ["OMR_problem_410740_0_gp8"], "statement_sha256": "106353603aebdeaa3eb35a1749b7bef76e848b56343de11e0c63d7040eace76a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_25391__106353603aebdeaa", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_25391", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_26331__2ddcca89d2e80577", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_44123_0_gs1 (z : ℂ) (hz : z ∉ Set.range ((↑) : ℝ → ℂ)) :\n ∃ (a b c d : ℝ), ∀ (x : ℝ), (x - z) * (x - star z) = (a * x + b)^2 + (c * x + d)^2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_26331", "source_license": null, "theorem_names": ["OMR_problem_44123_0_gs1"], "statement_sha256": "1462593126a1c507b2fc59805b64ea81089e6df8cad6192281233fb1e6a812d8", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_26331__2ddcca89d2e80577", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_26331", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_29763__1fd1bfa10b981460", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_297017_0_gp9 (f : ℝ → ℝ)\n (hcod : ∀ x, x ≥ 0 → f x ∈ Set.Ioo (-1 : ℝ) 1)\n (hcont : ContinuousOn f (Set.Ici 0))\n (hfunc : ∀ x y, x ≥ 0 → y ≥ 0 → f (x * y) = (f x + f y) / (1 + f x * f y))\n (hint : ∫ x in (0 : ℝ)..1, f x = 0) :\n ∀ x, x ≥ 0 → f x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_29763", "source_license": null, "theorem_names": ["OMR_problem_297017_0_gp9"], "statement_sha256": "1fd1bfa10b981460109b8762ec3b4f27f939ce3a094b8ea605064956edb1559d", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_29763__1fd1bfa10b981460", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_29763", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_35019__2e1bca53c6c39c67", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_216795_0_gp3 :\n let A : Set ℂ := {0, 1, 2}\n let f : ℂ → ℂ := fun z => if z = 0 then 0 else if z = 1 then 0 else if z = 2 then 1 else 0\n ∃ (a : ℕ → ℝ),\n let g : ℕ → ℂ → ℂ := fun n z =>\n match n with\n | 0 => z\n | 1 => (z - a 1)^2\n | 2 => ((z - a 1)^2 - a 2)^2\n | 3 => (((z - a 1)^2 - a 2)^2 - a 3)^2\n | _ => z\n ∀ z ∈ A, g 3 z = f z := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_35019", "source_license": null, "theorem_names": ["OMR_problem_216795_0_gp3"], "statement_sha256": "2e1bca53c6c39c67af6a8d99da902cd13120900be198fd09876cabc0e2a424ef", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_35019__2e1bca53c6c39c67", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_35019", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_43069__8602c0bb01bd57fd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_446015_0_gs2 (a ε : ℝ) (ha : a < 0) (hε_pos : 0 < ε) (hε_bound : ε < |a|) :\n ∫ x in a..(-ε), (1 : ℝ) / x = Real.log (-ε / a) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_43069", "source_license": null, "theorem_names": ["OMR_problem_446015_0_gs2"], "statement_sha256": "8602c0bb01bd57fdb4148c893b2e0e2323c0c1ccaaab34d53e7565c22cfcd40d", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_43069__8602c0bb01bd57fd", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_43069", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_44717__93d855d54b7dc6e0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_90746_gp7 (k : ℕ) (a b : Fin k → ℝ) (n : ℕ)\n (ha : ∀ i, 0 < a i) (hb : ∀ i, 0 < b i) :\n ∑ i, (1 + a i / b i) ^ n + ∑ i, (1 + b i / a i) ^ n ≥ 2 * k * 2 ^ n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_44717", "source_license": null, "theorem_names": ["OMR_problem_90746_gp7"], "statement_sha256": "93d855d54b7dc6e0716d6d84600bd03fa129a744ad3d1f3a7acad955b234898d", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_44717__93d855d54b7dc6e0", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_44717", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_47130__d0d67d0fd5740a8f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_394046 (n : ℕ) (A : Matrix (Fin (n-1)) (Fin n) ℝ)\n (h : ∀ i : Fin (n-1), Finset.sum Finset.univ (fun j => A i j) = 0) :\n let x : Fin n → ℝ := fun _ => 1\n A.mulVec x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_47130", "source_license": null, "theorem_names": ["OMR_problem_394046"], "statement_sha256": "d0d67d0fd5740a8f255a958e584f249cb1eee411d73c933bad10f836bfe1a3ca", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_47130__d0d67d0fd5740a8f", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_47130", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_47717__fea86e4bd9fe2e26", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_348652_2_gp7 :\n ∃ (f : ℝ → ℝ),\n (∃ a b c d : ℝ, ∀ x, f x = a * x^3 + b * x^2 + c * x + d) ∧\n f 0 = 0 ∧\n (deriv f) 0 = 0 ∧\n f 60 = 10 ∧\n (deriv f) 60 = 0 ∧\n (∀ x, (f x - 9)^2 + (x - 24)^2 > 9) ∧\n ∫ x in (0)..(60), f x = 300 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_47717", "source_license": null, "theorem_names": ["OMR_problem_348652_2_gp7"], "statement_sha256": "fea86e4bd9fe2e26f96689ee4ff90deb7a176f3d442c0b4cd376314eea8c3bb1", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_47717__fea86e4bd9fe2e26", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_47717", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_52692__e57b7a317830c9fb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_464591_0_gs0 :\n let f : ℕ → ℝ := fun b => 1 / (b : ℝ) + ((b : ℝ) + 1) / 50\n ∃ (b_min : ℕ),\n b_min ∈ ({2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48} : Set ℕ) ∧\n (∀ b ∈ ({2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48} : Set ℕ), f b_min ≤ f b) ∧\n |(b_min : ℝ) - Real.sqrt 50| < 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_52692", "source_license": null, "theorem_names": ["OMR_problem_464591_0_gs0"], "statement_sha256": "e57b7a317830c9fb25ae4d769dbc34c11291dc5f5873ad968cf31bd0bc150590", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_52692__e57b7a317830c9fb", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_52692", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_54188__eb1b46107e6854d3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_429517_0_gp8 (k : ℝ) :\n ∫ x in (0 : ℝ)..(1 : ℝ), (3 * x^2 - 2 * x + 1 + k) = 1 + k := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_54188", "source_license": null, "theorem_names": ["OMR_problem_429517_0_gp8"], "statement_sha256": "eb1b46107e6854d3e8f42c55a1547e01ac700bf23fe74a5999fc8775d6dc01ba", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_54188__eb1b46107e6854d3", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_54188", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_54942__17c14c3d728d2c65", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_366965_2_gp5 :\n let f : MvPolynomial (Fin 2) ℤ := MvPolynomial.X 0 ^ 2 * MvPolynomial.X 1 ^ 2 * (MvPolynomial.X 0 + MvPolynomial.X 1)\n (∀ p q : ℕ, Nat.Prime p → Nat.Prime q → p ≠ q →\n (p ^ 2 : ℤ) ∣ MvPolynomial.eval (![↑p, ↑q]) f ∨ (q ^ 2 : ℤ) ∣ MvPolynomial.eval (![↑p, ↑q]) f) →\n (∃ g : MvPolynomial (Fin 2) ℤ, f = MvPolynomial.X 0 ^ 2 * g) →\n (∃ g : MvPolynomial (Fin 2) ℤ, f = MvPolynomial.X 1 ^ 2 * g) →\n (∃ g : MvPolynomial (Fin 2) ℤ, f = MvPolynomial.X 0 ^ 2 * g ∧\n MvPolynomial.eval (![1, 1]) g = 2) ∧\n (∃ g : MvPolynomial (Fin 2) ℤ, f = MvPolynomial.X 1 ^ 2 * g ∧\n MvPolynomial.eval (![1, 1]) g = 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_54942", "source_license": null, "theorem_names": ["OMR_problem_366965_2_gp5"], "statement_sha256": "17c14c3d728d2c659c21ec0eb61fc857c405b00afb3e4ccee626e002ca4832e7", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_54942__17c14c3d728d2c65", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_54942", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_56804__6420fe78f233b933", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_327073_0_gs3 : ∫ x in (0:ℝ)..(1:ℝ), (-2 + 6 * x)^2 = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_56804", "source_license": null, "theorem_names": ["OMR_problem_327073_0_gs3"], "statement_sha256": "6420fe78f233b9336c68b368b15c52bfd1a8a3ca5d82ed13ded44231294cb050", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_56804__6420fe78f233b933", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_56804", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_63538__1eb262f5326e232e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_219467 (B : ℤ → ℝ → ℝ)\n (h1 : ∀ n : ℤ, ∀ x : ℝ, x ≠ 0 → B (n - 1) x + B (n + 1) x = (2 * n) / x * B n x)\n (h2 : ∀ n : ℤ, ∀ x : ℝ, B (n - 1) x - B (n + 1) x = 2 * (deriv (B n) x))\n (hdiff : ∀ n : ℤ, Differentiable ℝ (B n))\n (hdiff2 : ∀ n : ℤ, Differentiable ℝ (deriv (B n)))\n (n : ℤ) (x : ℝ) (hx : x ≠ 0) (hn : n ≥ 2) :\n (deriv (deriv (B n))) x = (1/4) * (B (n - 2) x - 2 * B n x + B (n + 2) x) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_63538", "source_license": null, "theorem_names": ["OMR_problem_219467"], "statement_sha256": "1eb262f5326e232e275313d3470891b9c1f04506ded13501735fef0b0107e723", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_63538__1eb262f5326e232e", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_63538", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_6805__f75a60132fe9dec7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_255507 (a b : ℝ) (f g : ℝ → ℝ)\n (hf : Differentiable ℝ f) (hg : Differentiable ℝ g) :\n let h : ℝ → ℝ := fun x => Matrix.det !![a, b, x; f a, f b, f x; g a, g b, g x]\n ∀ x : ℝ, deriv h x = (a * f b - b * f a) * deriv g x + (b * g a - a * g b) * deriv f x + f a * g b - f b * g a := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_6805", "source_license": null, "theorem_names": ["OMR_problem_255507"], "statement_sha256": "f75a60132fe9dec7240c3fe7aa04d20b9467cd5f06c54af20d2caf671aefdeab", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_6805__f75a60132fe9dec7", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_6805", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_722__5c5568e0e96f3c57", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_381383 :\n ∃ (a b : ℝ), (∫ x in (0:ℝ)..1, (a*x + b)^2) = 1 ∧\n (∀ (a' b' : ℝ), (∫ x in (0:ℝ)..1, (a'*x + b')^2) = 1 →\n (∫ x in (0:ℝ)..1, 3*x*(a*x + b)) ≥ (∫ x in (0:ℝ)..1, 3*x*(a'*x + b'))) ∧\n a = Real.sqrt 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_722", "source_license": null, "theorem_names": ["OMR_problem_381383"], "statement_sha256": "5c5568e0e96f3c57824035bb534c4ea569197d91dc8663a11ac87c0e73e95c35", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00027-of-00041.arrow_722__5c5568e0e96f3c57", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00027-of-00041.arrow_722", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_11422__bc8ab1b3fa9a6838", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem numina_COT_problem_551087_gp4 :\n let palindromic_ABABA := {n : ℕ | ∃ A B : ℕ,\n A ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ) ∧\n B ∈ ({0,1,2,3,4,5,6,7,8,9} : Set ℕ) ∧\n A ≠ B ∧\n n = 10101 * A + 1010 * B}\n let divisible_by_11_and_3 := {n ∈ palindromic_ABABA | n % 11 = 0 ∧ n % 3 = 0}\n (∃ M : ℕ, ∀ n ∈ divisible_by_11_and_3, n ≤ M) ∧\n (∃ max_elem : ℕ, max_elem ∈ divisible_by_11_and_3 ∧\n ∀ n ∈ divisible_by_11_and_3, n ≤ max_elem) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_11422", "source_license": null, "theorem_names": ["numina_COT_problem_551087_gp4"], "statement_sha256": "bc8ab1b3fa9a68384ab94b166ca12d3f35e0ddb3e2a8d68f45160beceafed809", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_11422__bc8ab1b3fa9a6838", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_11422", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_15400__30721ebb3530b8b0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_407245 :\n ∃ (a b : ℕ → ℝ),\n a 1 = 1/3 ∧\n b 1 = 1/4 ∧\n (∀ n : ℕ, n ≥ 1 → a (n + 1) = a 1 * (1 - a n - b n) + a n) ∧\n (∀ n : ℕ, n ≥ 1 → b (n + 1) = b 1 * (1 - a n - b n) + b n) ∧\n (a 1 + b 1 : ℝ) ∈ Set.Ioo 0 1 ∧\n (a 100 + b 100 : ℝ) = 1 - (5/12 : ℝ)^100 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_15400", "source_license": null, "theorem_names": ["OMR_problem_407245"], "statement_sha256": "30721ebb3530b8b0a57f72064e913ebaff611acc8042f5ff8d5d28e25676917f", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_15400__30721ebb3530b8b0", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_15400", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_16585__d32fb1f6f69c973b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_165971_0_gs1 (a b : ℝ) (hab : a < b) (f : ℝ → ℝ)\n (hf_diff : DifferentiableOn ℝ f (Set.Icc a b))\n (h1 : derivWithin f (Set.Ici a) a > (f b - f a) / (b - a))\n (h2 : derivWithin f (Set.Iic b) b > (f b - f a) / (b - a)) :\n ∃ c ∈ Set.Ioo a b, deriv f c = (f b - f a) / (b - a) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_16585", "source_license": null, "theorem_names": ["OMR_problem_165971_0_gs1"], "statement_sha256": "d32fb1f6f69c973bed2a6f1146fdbdb1feb09d7d625a03feae4ca3e6175eaae2", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_16585__d32fb1f6f69c973b", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_16585", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_18699__ff5a1c5ce713abbb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_379613_0_gs2 (a : ℕ → ℝ) (L : ℝ)\n (h : Filter.Tendsto a Filter.atTop (nhds L)) :\n let b : ℕ → ℝ := fun n => (a n + a (n + 1)) / 2\n Filter.Tendsto b Filter.atTop (nhds L) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_18699", "source_license": null, "theorem_names": ["OMR_problem_379613_0_gs2"], "statement_sha256": "ff5a1c5ce713abbb94b9da643836c45e080e8640f438126445abc6d8307cb869", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_18699__ff5a1c5ce713abbb", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_18699", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_19404__14820a9926bd5ac4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_144568_3_gs3 :\n let x := 3\n (∀ d ∈ ({0, 2, 4, 6, 8} : Set ℕ), ∃ m : ℤ, (⌊(100 * m + x)^2 / 100⌋ : ℤ) % 10 = d) ∧\n (∀ m : ℤ, (⌊(100 * m + x)^2 / 100⌋ : ℤ) % 10 ∈ ({0, 2, 4, 6, 8} : Set ℤ)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_19404", "source_license": null, "theorem_names": ["OMR_problem_144568_3_gs3"], "statement_sha256": "14820a9926bd5ac44636b076a25a795fa2ec5014b0c2639d21ee28017b0a5aab", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_19404__14820a9926bd5ac4", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_19404", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_21035__5ce99190fe23aece", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_46185_0_gs3 :\n let f : ℝ → ℝ := fun x => 1/x + 18/(3 + x) - 6*(2/(2 + x) + 1/2)\n ∀ x ∈ Set.Icc 1 2, deriv f x ≠ 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_21035", "source_license": null, "theorem_names": ["OMR_problem_46185_0_gs3"], "statement_sha256": "5ce99190fe23aece0afd1e8423768eecb4da5a2a3306c5212677111093046a93", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_21035__5ce99190fe23aece", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_21035", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_23040__98dc9a0d57f719a9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_82962_0_gp6 :\n let f : ℝ → ℝ := fun x => x^4 - 2*x^3 + 3*x^2 - 4*x + 5\n let g : ℝ → ℝ := fun w => (deriv (deriv (deriv f))) w / 2 - (f 1 / 2 - f (-1) / 2 - (deriv f) 0)\n ∀ w ∈ Set.Icc (-1 : ℝ) 1, g w = 12 * w - 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_23040", "source_license": null, "theorem_names": ["OMR_problem_82962_0_gp6"], "statement_sha256": "98dc9a0d57f719a90d2ed761de993715d8eb537ae9e42d8b0829f5ce18aa1315", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_23040__98dc9a0d57f719a9", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_23040", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_24174__a70dd5ff9ae8e3d6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_262851_0_gs0 (k : ℕ) (hk_odd : Odd k) :\n ¬∃ (odd_ints even_ints : Fin k → ℤ),\n (∀ i, Odd (odd_ints i)) ∧\n (∀ i, Even (even_ints i)) ∧\n (∑ i, odd_ints i) = (∑ i, even_ints i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_24174", "source_license": null, "theorem_names": ["OMR_problem_262851_0_gs0"], "statement_sha256": "a70dd5ff9ae8e3d61cdd1be2acaa2e5bfc1c28031f02baa75d092d345e0b5c56", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_24174__a70dd5ff9ae8e3d6", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_24174", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_24490__415f0239a47f59b3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_10812_0_gs1 (a : ℕ → ℝ) (h : Summable a) :\n ∑' k, a k = a 0 + ∑' k, a (k + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_24490", "source_license": null, "theorem_names": ["OMR_problem_10812_0_gs1"], "statement_sha256": "415f0239a47f59b331a3080976df745357c8967321fc732909023f3f17651a06", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_24490__415f0239a47f59b3", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_24490", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_24816__669c50c74ea4b00b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_386335_gp7 (p q : Polynomial ℕ) :\n let f : Polynomial ℚ → Polynomial ℚ → Polynomial ℚ := fun x y =>\n (1/2 : ℚ) • ((x + y) * (x + y + 1)) + y\n f (p.map (algebraMap ℕ ℚ)) (q.map (algebraMap ℕ ℚ)) +\n f (q.map (algebraMap ℕ ℚ)) (p.map (algebraMap ℕ ℚ)) =\n (p.map (algebraMap ℕ ℚ) + q.map (algebraMap ℕ ℚ)) * (p.map (algebraMap ℕ ℚ) + q.map (algebraMap ℕ ℚ) + 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_24816", "source_license": null, "theorem_names": ["OMR_problem_386335_gp7"], "statement_sha256": "669c50c74ea4b00bdbe2ca981afe51f04cade0d71364774d01ac8e6d5543d7a9", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_24816__669c50c74ea4b00b", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_24816", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_26916__1d1bffc0a775543f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_191287_0_gs4 :\n let f : ℝ → ℝ := fun x => x / 2\n ∫ x in (0 : ℝ)..1, x^2 * f x - ∫ x in (0 : ℝ)..1, x * (f x)^2 = 1/16 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_26916", "source_license": null, "theorem_names": ["OMR_problem_191287_0_gs4"], "statement_sha256": "1d1bffc0a775543fdf2284d00438c96f1bb1b934b660e157b58f8621b6f32fb3", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_26916__1d1bffc0a775543f", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_26916", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_294__9e00f10fc6a8c242", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_182943_1_gs3 (a b c : ℝ) :\n let f : ℝ → ℝ := fun x ↦ a * x^2 + b * x + c\n (∫ x in (0 : ℝ)..1, f x) = a/3 + b/2 + c ∧\n (∫ x in (0 : ℝ)..1, f x) = 0 ↔ a/3 + b/2 + c = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_294", "source_license": null, "theorem_names": ["OMR_problem_182943_1_gs3"], "statement_sha256": "9e00f10fc6a8c24205d9b23acc045ecb0037c1c36ccb0a8b487293decb8e3e45", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_294__9e00f10fc6a8c242", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_294", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_3168__d06edb0d6fc118d1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_470152_3_gs1 (n : ℕ) (S k : ℝ) (hn : n > 0) :\n (∀ (c : Fin n → ℝ), (∑ i, c i) = S →\n (∑ i, (k * c i)) = k * S) ∧\n (∃ (c : Fin n → ℝ), (∑ i, c i) = S ∧\n (∑ i, Real.sqrt ((c i)^2 + (k * c i)^2)) = |S| * Real.sqrt (1 + k^2)) ∧\n (∀ (c : Fin n → ℝ), (∑ i, c i) = S →\n |S| * Real.sqrt (1 + k^2) ≤ (∑ i, Real.sqrt ((c i)^2 + (k * c i)^2))) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_3168", "source_license": null, "theorem_names": ["OMR_problem_470152_3_gs1"], "statement_sha256": "d06edb0d6fc118d1229ee20a5884e7ef42cdf28134d8bc8e6c2219581fdb7a18", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_3168__d06edb0d6fc118d1", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_3168", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_33465__fa5da79cdcf5fc05", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_299212_0_gs2 (k : ℕ) (a : Fin k → ℝ)\n (h : ∀ m : ℕ+, ∑ j : Fin k, (a j)^(m : ℕ) = 0) :\n ∀ j : Fin k, a j = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_33465", "source_license": null, "theorem_names": ["OMR_problem_299212_0_gs2"], "statement_sha256": "fa5da79cdcf5fc05484c2aed25181957c2f6a6b679a4be82ab41054d85657983", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_33465__fa5da79cdcf5fc05", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_33465", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_33887__08ad9efef0ff9592", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_111761_2_gs0 : ¬∃ (P : Polynomial ℝ), Set.Infinite {n | P.coeff n ≠ 0} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_33887", "source_license": null, "theorem_names": ["OMR_problem_111761_2_gs0"], "statement_sha256": "08ad9efef0ff9592fc6c7e5a25da9c77c4fe1e0b4effdba4b911f68f4a5c4593", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_33887__08ad9efef0ff9592", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_33887", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_35151__4154b30ab982d4fe", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem numina_COT_aops_problem_54139_gs4 :\n ((Polynomial.X - Polynomial.C 2)^4 * (Polynomial.X - Polynomial.C 1)^2 : Polynomial ℤ).coeff 3 = -88 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_35151", "source_license": null, "theorem_names": ["numina_COT_aops_problem_54139_gs4"], "statement_sha256": "4154b30ab982d4fe739eb49210bcc053ea254ba246f1621b5b64d3016b68f8d5", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_35151__4154b30ab982d4fe", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_35151", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_39408__a44f07315d7ee974", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_15423_0_gs0 :\n let f : ℝ → ℝ → ℝ → ℝ := fun a b c => (a^2 + b^3 + c^2) / (3 * a * b^2 * c)\n ∃ (a₀ b₀ c₀ : ℝ), a₀ ∈ Set.Icc 1 2 ∧ b₀ ∈ Set.Icc 1 2 ∧ c₀ ∈ Set.Icc 1 2 ∧\n ∀ (a b c : ℝ), a ∈ Set.Icc 1 2 → b ∈ Set.Icc 1 2 → c ∈ Set.Icc 1 2 →\n f a b c ≤ f a₀ b₀ c₀ := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_39408", "source_license": null, "theorem_names": ["OMR_problem_15423_0_gs0"], "statement_sha256": "a44f07315d7ee97451757d1ed48f7578357b97ea08d4b4dedfdbecbca65c1cf1", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_39408__a44f07315d7ee974", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_39408", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_40397__27bc0218a33cff78", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_173450_0_gp6\n (f : ℝ → ℝ)\n (hf_cont : Continuous f)\n (h_integral : ∀ a b c d : ℝ, ∫ x in a..b, f x + ∫ x in c..d, f x = ∫ x in (a + c + d)..(b + c + d), f x)\n (k : ℝ)\n (hf_linear : ∀ x : ℝ, f x = k * x) :\n k = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_40397", "source_license": null, "theorem_names": ["OMR_problem_173450_0_gp6"], "statement_sha256": "27bc0218a33cff784f53453703e0b6b062ad0f9b0c16cf74d4dc56204c7addea", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_40397__27bc0218a33cff78", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_40397", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_4127__f756cda69f609a22", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_400315 : ∀ (P : Polynomial ℤ),\n P.eval 21 = 17 →\n P.eval 32 = -247 →\n P.eval 37 = 33 →\n (∀ N : ℤ, P.eval N = N + 51 → N = 26) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_4127", "source_license": null, "theorem_names": ["OMR_problem_400315"], "statement_sha256": "f756cda69f609a22a269359e23b7d118c4952ff18264d6eeec29c75ed5b65db4", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_4127__f756cda69f609a22", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_4127", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_42620__cf34f287569cd003", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat Polynomial\nopen scoped Polynomial\n\n\ntheorem OMR_problem_54877_0_gs1 (a₁ b₁ c₁ d₁ a₂ b₂ c₂ d₂ a₃ b₃ c₃ d₃ : ℝ) :\n ∀ (T : Polynomial ℝ →ₗ[ℝ] Polynomial ℝ),\n (T 1 = a₁ • X^3 + b₁ • X^2 + c₁ • X + d₁ • 1) →\n (T X = a₂ • X^3 + b₂ • X^2 + c₂ • X + d₂ • 1) →\n (T (X^2) = a₃ • X^3 + b₃ • X^2 + c₃ • X + d₃ • 1) →\n ∀ (a b c : ℝ),\n T (a • X^2 + b • X + c • 1) =\n (a * a₃ + b * a₂ + c * a₁) • X^3 +\n (a * b₃ + b * b₂ + c * b₁) • X^2 +\n (a * c₃ + b * c₂ + c * c₁) • X +\n (a * d₃ + b * d₂ + c * d₁) • 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_42620", "source_license": null, "theorem_names": ["OMR_problem_54877_0_gs1"], "statement_sha256": "cded1c5aef9b409be9c995447c4b64f2fbc2635cdec17c4322b9eb82ff451c7e", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_42620__cf34f287569cd003", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_42620", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_43650__02e2e78df3152179", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_184404_0_gs3 :\n let A : Matrix (Fin 5) (Fin 5) ℝ := fun i j => (i.val + j.val : ℝ)^4\n let C : Matrix (Fin 5) (Fin 5) ℝ := fun i k => (Nat.choose 4 k : ℝ) * (i.val : ℝ)^(4 - k.val)\n let D : Matrix (Fin 5) (Fin 5) ℝ := fun k j => (j.val : ℝ)^k.val\n A = C * D := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_43650", "source_license": null, "theorem_names": ["OMR_problem_184404_0_gs3"], "statement_sha256": "02e2e78df31521792069fd3b76a8675fbf67a5ada43a3ea17ebb8a813b7c9076", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_43650__02e2e78df3152179", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_43650", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_44452__e30f234707a98c38", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_159946_0_gp1 :\n Set.Infinite {(a, b) : ℕ × ℕ | a > 0 ∧ b > 0 ∧\n ∀ x y z : ℕ, x > 0 → y > 0 → z > 0 →\n Nat.Coprime x y → Nat.Coprime y z → Nat.Coprime x z →\n (x^b + y^b + z^b) ∣ (x^a + y^a + z^a)} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_44452", "source_license": null, "theorem_names": ["OMR_problem_159946_0_gp1"], "statement_sha256": "e30f234707a98c38d2f0863df60355e8d6ae81ba2d732efcee3bbbe5ffd42ba7", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_44452__e30f234707a98c38", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_44452", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_49747__9f6ca59fb2db950f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_483901_0_gs4 :\n let f : ℝ → ℝ := fun t => t^3 - (35/4)*t^2 + (259/16)*t - (225/64)\n let t₁ := (35 + 8*Real.sqrt 7) / 12\n let t₂ := (35 - 8*Real.sqrt 7) / 12\n {t : ℝ | t ∈ Set.Icc 0 (25/4) ∧ (deriv f) t = 0} = {t₁, t₂} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_49747", "source_license": null, "theorem_names": ["OMR_problem_483901_0_gs4"], "statement_sha256": "9f6ca59fb2db950f826c70aeae6dd1ddabc568d3ff83268b141c3d5cc04ab4b4", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_49747__9f6ca59fb2db950f", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_49747", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_52243__dbb376abb2ba0168", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_457122_0_gp2 :\n let n := 864\n (100 ≤ n ∧ n ≤ 999) ∧\n (let a := n / 100\n let b := (n / 10) % 10\n let c := n % 10\n a ∈ ({2, 4, 6, 8} : Set ℕ) ∧\n b ∈ ({2, 4, 6, 8} : Set ℕ) ∧\n c ∈ ({2, 4, 6, 8} : Set ℕ) ∧\n a ≠ b ∧ b ≠ c ∧ a ≠ c ∧\n a ≠ 0 ∧ b ≠ 0 ∧ c ≠ 0 ∧\n n % a = 0 ∧ n % b = 0 ∧ n % c = 0) ∧\n (∀ m : ℕ, (100 ≤ m ∧ m ≤ 999) →\n (let a := m / 100\n let b := (m / 10) % 10\n let c := m % 10\n a ∈ ({2, 4, 6, 8} : Set ℕ) ∧\n b ∈ ({2, 4, 6, 8} : Set ℕ) ∧\n c ∈ ({2, 4, 6, 8} : Set ℕ) ∧\n a ≠ b ∧ b ≠ c ∧ a ≠ c ∧\n a ≠ 0 ∧ b ≠ 0 ∧ c ≠ 0 ∧\n m % a = 0 ∧ m % b = 0 ∧ m % c = 0) →\n m ≤ n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_52243", "source_license": null, "theorem_names": ["OMR_problem_457122_0_gp2"], "statement_sha256": "dbb376abb2ba0168823184fc8be7e97a04ff6a1a4aec6114d8d3ae396382b362", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_52243__dbb376abb2ba0168", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_52243", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_600__717e6eb14973a03d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_342711_0_gp3 (n : ℤ) (h : (n - 3) ∣ (n^2 + 5)) :\n n ∈ ({-11, -4, 1, 2, 4, 5, 10, 17} : Set ℤ) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_600", "source_license": null, "theorem_names": ["OMR_problem_342711_0_gp3"], "statement_sha256": "717e6eb14973a03d253764b09adfcd3d9d8747d96f5f1f04a8779486f289870f", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_600__717e6eb14973a03d", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_600", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_60381__709dff2efd037b5d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_128931_0_gs0 (p : ℝ → ℝ → ℝ)\n (h_poly : ∃ (poly : MvPolynomial (Fin 2) ℝ), ∀ x y : ℝ, p x y = MvPolynomial.eval ![x, y] poly)\n (h : ∀ x y : ℝ, (x - y) * p x y = (x - 1) * p x 1 + (1 - y) * p 1 y) :\n ∀ x : ℝ, p x 1 = p 1 x := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_60381", "source_license": null, "theorem_names": ["OMR_problem_128931_0_gs0"], "statement_sha256": "709dff2efd037b5d4b8684310fda3d87350e3dd99c9a0d96b7c6155296d8d73e", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_60381__709dff2efd037b5d", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_60381", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_61038__2288d1232778a28a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat Classical Polynomial\n\ntheorem OMR_problem_19078_0_gs0 (k : ℝ) :\n ∫ x in (0:ℝ)..1, (x^2 - k*x) * x * (1 - x) = (3 - 5*k) / 60 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_61038", "source_license": null, "theorem_names": ["OMR_problem_19078_0_gs0"], "statement_sha256": "2288d1232778a28a0dbe7c434ee1a46bbcae0fda42c1bc9a9b8a06caff6f0cdb", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_61038__2288d1232778a28a", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_61038", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_61243__b18605ca9cef19c4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_168536_0_gp9 (a : ℝ) :\n (∃ r₁ r₂ : ℝ, r₁ ≠ r₂ ∧\n r₁^2 - (5 - a) * r₁ + a^2 - 11*a + 22 = 0 ∧\n r₂^2 - (5 - a) * r₂ + a^2 - 11*a + 22 = 0 ∧\n ((r₁ > 2 ∧ r₂ < 2) ∨ (r₁ < 2 ∧ r₂ > 2))) ↔\n (∫ x in (0 : ℝ)..(1 : ℝ), (a^2 - 9*a + 16)) < 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_61243", "source_license": null, "theorem_names": ["OMR_problem_168536_0_gp9"], "statement_sha256": "b18605ca9cef19c481bf1912aa68b29e8e15ab565677b678e2b07a15e6ae6209", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_61243__b18605ca9cef19c4", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_61243", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_8874__550b96c0aeb8377c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_318905_0_gp6 :\n ∃ (s : Set (ℝ × ℝ)), s.Finite ∧ s.ncard = 2 ∧\n (∀ (x y : ℝ), (x, y) ∈ s ↔\n (2 * x^2 + x + 3 ≥ 0 ∧\n x + 1 + Real.sqrt (2 * x^2 + x + 3) ≥ 0 ∧\n 5 - Real.sqrt (x + 1 + Real.sqrt (2 * x^2 + x + 3)) ≥ 0 ∧\n Real.sqrt (5 - Real.sqrt (x + 1 + Real.sqrt (2 * x^2 + x + 3))) = 1 ∧\n x + y = 0)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_8874", "source_license": null, "theorem_names": ["OMR_problem_318905_0_gp6"], "statement_sha256": "550b96c0aeb8377cab0bff97a09cd1799c497e33bbec56d5579486d9dbf2046c", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00028-of-00041.arrow_8874__550b96c0aeb8377c", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00028-of-00041.arrow_8874", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_18265__57c1a30a2d56eba7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_178526_0_gs2 (p q : ℝ) :\n ∫ x in (0:ℝ)..(1:ℝ), (x^4 + 2*p*x^3 + (p^2 + 2*q)*x^2 + 2*p*q*x + q^2) =\n 1/5 + p/2 + (p^2 + 2*q)/3 + p*q + q^2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_18265", "source_license": null, "theorem_names": ["OMR_problem_178526_0_gs2"], "statement_sha256": "57c1a30a2d56eba795b33f4c1cf00321526b09413779b8f918bc8a6dd091e05a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_18265__57c1a30a2d56eba7", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_18265", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_18887__a16f65f659e1298a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem numina_COT_problem_129152_gs0 {K : Type*} [Field K] (n : ℕ) (r : Fin n → K) :\n let p : Polynomial K := ∏ i, (Polynomial.X - Polynomial.C (r i))\n p.coeff 0 = (-1)^n * ∏ i, r i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_18887", "source_license": null, "theorem_names": ["numina_COT_problem_129152_gs0"], "statement_sha256": "a16f65f659e1298aa285644517cc41065fdd3a0b926b62ca9b09bdb3a2378b55", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_18887__a16f65f659e1298a", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_18887", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_21367__344e2f686a1f8a1e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_155093_0_gp6 :\n let f : ℝ → ℝ := fun x => ∫ t in (0)..(Real.arctan x), Real.sin (3 * t)\n let g : ℝ → ℝ := fun x => ∫ t in (0)..(Real.arctan x), Real.cos (3 * t)\n f (Real.sqrt 3) + g (Real.sqrt 3) = 2 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_21367", "source_license": null, "theorem_names": ["OMR_problem_155093_0_gp6"], "statement_sha256": "344e2f686a1f8a1e8ac5bea5636bf4eb5e88a3c6779abcaab6c02d626fcfa526", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_21367__344e2f686a1f8a1e", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_21367", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_22280__987443b9dd31b0c8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_88123_0_gs1 (a b β : ℝ) :\n let h : ℝ → ℝ := fun x => a * x^2 + b * x\n h 0 = 0 →\n h 1 = 1 →\n ∫ x in (0 : ℝ)..1, h x = β →\n a / 3 + b / 2 = β := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_22280", "source_license": null, "theorem_names": ["OMR_problem_88123_0_gs1"], "statement_sha256": "987443b9dd31b0c81622c6a6ab44e3df0b3fdf0ea2cd040953f4c4ddce5e44e2", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_22280__987443b9dd31b0c8", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_22280", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_22910__3fec50a7c8f62595", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_114454_2_gs3 :\n (∀ A B : ℤ, A * B = 16 ∧ Even (B - A) ↔\n (A, B) ∈ ({(2, 8), (8, 2), (4, 4), (-4, -4), (-8, -2), (-2, -8)} : Set (ℤ × ℤ))) ∧\n (∀ A B : ℤ, (A, B) ∈ ({(2, 8), (8, 2), (4, 4), (-4, -4), (-8, -2), (-2, -8)} : Set (ℤ × ℤ)) →\n let p : ℤ := 13 + (A + B) / 2\n p > 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_22910", "source_license": null, "theorem_names": ["OMR_problem_114454_2_gs3"], "statement_sha256": "3fec50a7c8f625956f36e0fbd03e38dfc73c1690486971bb7b0bc6c2839b1729", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_22910__3fec50a7c8f62595", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_22910", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_29039__7785a6aea15e485b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_370571_0_gp1 :\n Set.Infinite {(A, s, t, u, v) : ℤ × ℤ × ℤ × ℤ × ℤ |\n A^2 = 16 * (s * t * v)^4 + 2 * s * u * t * (u * t^2 - v * s^2)^2 + 4 * s^2 * t^2 * u^2 * v^2 ∧\n Int.gcd s t = 1 ∧ Int.gcd u v = 1} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_29039", "source_license": null, "theorem_names": ["OMR_problem_370571_0_gp1"], "statement_sha256": "7785a6aea15e485b9712c486cb151363944784b535390b2eac2a5f1f4ee1f106", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_29039__7785a6aea15e485b", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_29039", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_37658__b56a799239e4226e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_249788_0_gp6 :\n ∃ (max_num min_num : ℕ),\n\n let has_distinct_geometric_digits := fun n : ℕ =>\n 100 ≤ n ∧ n ≤ 999 ∧\n ∃ (a b c : ℕ),\n a ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ) ∧\n b ∈ ({0,1,2,3,4,5,6,7,8,9} : Set ℕ) ∧\n c ∈ ({0,1,2,3,4,5,6,7,8,9} : Set ℕ) ∧\n a ≠ b ∧ b ≠ c ∧ a ≠ c ∧\n n = 100 * a + 10 * b + c ∧\n b * b = a * c\n\n has_distinct_geometric_digits max_num ∧\n has_distinct_geometric_digits min_num ∧\n\n (∀ n, has_distinct_geometric_digits n → n ≤ max_num) ∧\n\n (∀ n, has_distinct_geometric_digits n → min_num ≤ n) ∧\n\n 120 ∣ (max_num - min_num) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_37658", "source_license": null, "theorem_names": ["OMR_problem_249788_0_gp6"], "statement_sha256": "b56a799239e4226e43e979ac0f0eb636dc1cb77120d83bc7e5586134519c41f5", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_37658__b56a799239e4226e", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_37658", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_38127__11c1dfa5dac95bca", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_236708_0_gs2 :\n ∃ (p : Polynomial ℚ), (∀ n : ℕ, (Finset.range (n + 1)).sum (fun i => (i : ℚ)^3) = p.eval (n : ℚ)) ∧\n (p.natDegree = 4) ∧ (p.leadingCoeff = 1/4) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_38127", "source_license": null, "theorem_names": ["OMR_problem_236708_0_gs2"], "statement_sha256": "11c1dfa5dac95bca3db2ff117b7973d109756abce05a825450d232cfa1f5447f", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_38127__11c1dfa5dac95bca", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_38127", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_40945__877228595c4f6cec", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_416397_0_gp8 : ∃ (S : Finset ℕ),\n S ⊆ Finset.range 2016 \\ {0} ∧\n S.card = 40 ∧\n ∀ x ∈ S, ((S.sum id - x) / 10) % 10 = (x / 10) % 10 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_40945", "source_license": null, "theorem_names": ["OMR_problem_416397_0_gp8"], "statement_sha256": "877228595c4f6cecca687d3c90dd4fda5a99bd68b2971909951017b1d94d1b8d", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_40945__877228595c4f6cec", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_40945", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_41424__f576d38b226af66f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_363647_0_gs2 (n : ℕ) (k : ℕ) (d : ℕ)\n (h1 : n > 0)\n (h2 : k > 0)\n (h3 : d ∈ ({1, 2, 3, 4, 5, 6, 7, 8, 9} : Set ℕ))\n (h4 : 6^n + 1 = d * ((10^k - 1) / 9)) :\n d = 7 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_41424", "source_license": null, "theorem_names": ["OMR_problem_363647_0_gs2"], "statement_sha256": "f576d38b226af66f1e67b69bc6b3481efcbbae1d171a91bbab87330f0684edc8", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_41424__f576d38b226af66f", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_41424", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_50641__824675902187dff4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_392734_0_gs3 : ∃ (f g : MvPolynomial (Fin 2) ℤ),\n (MvPolynomial.X 0 * MvPolynomial.X 1 + 2 * MvPolynomial.X 0 + 2 * MvPolynomial.X 1 + 4 : MvPolynomial (Fin 2) ℤ) = f * g ∧\n f ≠ 1 ∧ g ≠ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_50641", "source_license": null, "theorem_names": ["OMR_problem_392734_0_gs3"], "statement_sha256": "824675902187dff477bd508185b08deabbbeb41e13294fd086c44e8ad717d92a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_50641__824675902187dff4", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_50641", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_5075__3d4bcd0cdfb66975", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_283731_0_gp9 :\n ∫ x in (0:ℝ)..(1:ℝ), x^5 * (1-x)^7 = (Nat.factorial 5 * Nat.factorial 7 : ℝ) / Nat.factorial 13 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_5075", "source_license": null, "theorem_names": ["OMR_problem_283731_0_gp9"], "statement_sha256": "3d4bcd0cdfb6697551e5d23cf0865defdd0e3dd88f6e6d0b6497a4fbe6e7bb3a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_5075__3d4bcd0cdfb66975", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_5075", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_54793__8cbcb354d0078d4c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_477646_0_gs2 (n : ℕ) (A : Fin n → ℝ) (a : Fin n → ℝ)\n (h_distinct : ∀ i j : Fin n, i ≠ j → a i ≠ a j) :\n ∀ x : ℝ, (∀ i : Fin n, x ≠ a i) →\n deriv (fun y => ∑ i : Fin n, A i * Real.log (abs (y - a i))) x = ∑ i : Fin n, A i / (x - a i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_54793", "source_license": null, "theorem_names": ["OMR_problem_477646_0_gs2"], "statement_sha256": "8cbcb354d0078d4cff4049b7b552449e42078357ece40b6901e8b6ba34e65427", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_54793__8cbcb354d0078d4c", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_54793", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_61232__eb291f3e602e7092", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_274350 (n : ℕ) [NeZero n] (V : Type*) [AddCommGroup V]\n (f : Fin n × Fin n × Fin n → V)\n (h_rows : ∀ (axis : Fin 3) (fixed : Fin n × Fin n),\n ∑ i : Fin n, f (if axis = 0 then (i, fixed.1, fixed.2)\n else if axis = 1 then (fixed.1, i, fixed.2)\n else (fixed.1, fixed.2, i)) = 0) :\n ∑ i : Fin n, ∑ j : Fin n, ∑ k : Fin n, f (i, j, k) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_61232", "source_license": null, "theorem_names": ["OMR_problem_274350"], "statement_sha256": "eb291f3e602e7092655330b56f22efc28fc231d6a2b7d853cd6472138aff9699", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_61232__eb291f3e602e7092", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_61232", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_62488__8b09c8851fbae5fe", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_70107_0_gp5 :\n let f : ℕ → ℕ := fun n => (Nat.primeFactors ((2^n - 1) * (2^n) * (2^n + 1))).card\n f 2 = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_62488", "source_license": null, "theorem_names": ["OMR_problem_70107_0_gp5"], "statement_sha256": "8b09c8851fbae5fea85775c09655e991cea31c1505647848f3c325e4f3694714", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_62488__8b09c8851fbae5fe", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_62488", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_63603__9d48d76e70d6e9c9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_173450_0_gp8 (f : ℝ → ℝ) (hf_cont : Continuous f)\n (h_integral : ∀ a b c d : ℝ,\n ∫ x in a..b, f x + ∫ x in c..d, f x = ∫ x in (a + c)..(b + d), f x + ∫ x in (a - d)..(b - c), f x)\n (k : ℝ) (hf_linear : ∀ x : ℝ, f x = k * x) :\n k = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_63603", "source_license": null, "theorem_names": ["OMR_problem_173450_0_gp8"], "statement_sha256": "9d48d76e70d6e9c9c9172fae10ebaa3dd1963bb841670e47e598d020b2b2bd1e", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_63603__9d48d76e70d6e9c9", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_63603", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_6907__3767d412997161a9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_212069_0_gs1 (a : ℝ) (ha : 0 < a) :\n let f := fun x => (a - x) * Real.log x + x * Real.log (a - x)\n ∀ x ∈ Set.Ioo 0 a, deriv f x = Real.log ((a - x) / x) + ((a - x) / x - x / (a - x)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_6907", "source_license": null, "theorem_names": ["OMR_problem_212069_0_gs1"], "statement_sha256": "3767d412997161a9b65546da7d1d0e8ff5c424c73ad7ba1e541f6c1ebf91dbc0", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_6907__3767d412997161a9", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_6907", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_7882__a041ea8e5507dc96", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_188783_0_gs3 : ∫ x in (0 : ℝ)..(Real.pi / 4), (Real.cos (2 * x))^2 = Real.pi / 8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_7882", "source_license": null, "theorem_names": ["OMR_problem_188783_0_gs3"], "statement_sha256": "a041ea8e5507dc965f2b02557a9cc343b376f580017076ec03bddca6f3b762c9", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00029-of-00041.arrow_7882__a041ea8e5507dc96", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00029-of-00041.arrow_7882", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_11925__c3f40e61954e47e5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_360907_0_gp3 :\n Real.pi * ∫ y in (0 : ℝ)..(4 : ℝ), ((4 - y^2/4)^3 - (4 - y)^3) = 1856*Real.pi/35 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_11925", "source_license": null, "theorem_names": ["OMR_problem_360907_0_gp3"], "statement_sha256": "c3f40e61954e47e5abd3e8c2b277de2feba7016e73f1a485e1fadc6d5a97f373", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_11925__c3f40e61954e47e5", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_11925", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_18903__de821e879417fe55", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_381690_0_gs1 (n : ℕ) (P : Polynomial ℝ) (x : Fin n → ℝ) (A : Fin n → ℝ)\n (hP_monic : P.Monic)\n (hP_degree : P.degree = ↑n)\n (hP_roots : ∀ k : Fin n, P.eval (x k) = 0)\n (hP_distinct : Function.Injective x)\n (hP_nonzero_roots : ∀ k : Fin n, x k ≠ 0)\n (hP_all_roots : ∀ r : ℝ, P.eval r = 0 → ∃ k : Fin n, r = x k) :\n let R : ℝ → ℝ := fun t => 1 + ∑ k : Fin n, (A k) / (t - x k)\n R 0 = 1 - ∑ k : Fin n, (A k) / (x k) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_18903", "source_license": null, "theorem_names": ["OMR_problem_381690_0_gs1"], "statement_sha256": "de821e879417fe55d18b00b3de971e796d5b3ceceb2f211c1e6a91a2a59b0bf1", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_18903__de821e879417fe55", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_18903", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_19523__e63c3496713f354e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_28089_2_gs2 (p : ℕ) (hp : Nat.Prime p) :\n let a : ℕ → ℕ := fun n => p\n (∃ S : Set ℕ, S.Infinite ∧ ∀ n ∈ S, n ≥ 1 → p ∣ a n) ∧\n (∀ q : ℕ, Nat.Prime q → q < p → ∀ n : ℕ, n ≥ 1 → ¬(q ∣ a n)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_19523", "source_license": null, "theorem_names": ["OMR_problem_28089_2_gs2"], "statement_sha256": "e63c3496713f354eecd1708688a47528ea13bfd85b8bf9c63d9bd4bed2ddf07e", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_19523__e63c3496713f354e", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_19523", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_19756__20275330f45ec835", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_366965_2_gp0 :\n let f : MvPolynomial (Fin 2) ℤ := MvPolynomial.X 0 ^ 3 + MvPolynomial.X 1 ^ 3\n (∀ p q : ℕ, Nat.Prime p → Nat.Prime q → p ≠ q →\n (p + q : ℤ) ∣ MvPolynomial.eval ![↑p, ↑q] f) →\n ∃ g : MvPolynomial (Fin 2) ℤ,\n (f = (MvPolynomial.X 0 + MvPolynomial.X 1) * g ∨\n f = (MvPolynomial.X 0 - MvPolynomial.X 1) * g) ∧\n MvPolynomial.eval ![1, 1] g = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_19756", "source_license": null, "theorem_names": ["OMR_problem_366965_2_gp0"], "statement_sha256": "20275330f45ec835a5384aaee2f01d9e0ec7c69d38547a53f851a1712dc8f944", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_19756__20275330f45ec835", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_19756", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_23729__ce54e4527e6b4e56", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_395791_0_gs4 :\n let f : ℝ → ℝ := fun x => (3*x - x^2) / (x + 1)^2\n ∃ (f' : ℝ → ℝ),\n (∀ x ∈ Set.Ioo 0 1, HasDerivAt f (f' x) x) ∧\n f' (3/5) = 0 ∧\n (∀ x ∈ Set.Ioo 0 1, x < 3/5 → f' x > 0) ∧\n (∀ x ∈ Set.Ioo 0 1, x > 3/5 → f' x < 0) ∧\n (∀ x ∈ Set.Ioo 0 1, f x ≤ f (3/5)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_23729", "source_license": null, "theorem_names": ["OMR_problem_395791_0_gs4"], "statement_sha256": "ce54e4527e6b4e56f1337c066c58b7d87e5bc8b918105421ef8c07f8932ff82a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_23729__ce54e4527e6b4e56", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_23729", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_26172__9a3942df249cdf6e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_441341_0_gp2 :\n ∀ f : ℝ × ℝ → ℝ,\n (∀ A B : ℝ × ℝ, dist A B = Real.sqrt 3 → f A + f B = 0) →\n f = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_26172", "source_license": null, "theorem_names": ["OMR_problem_441341_0_gp2"], "statement_sha256": "9a3942df249cdf6ea574f3812e1483c87b7d341836e5421eea7cd656cca62bdc", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_26172__9a3942df249cdf6e", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_26172", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_27323__9d0c0dd4dfd7dd4f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_105833_0_gs3 :\n ∃ (differences : Finset ℕ) (partition : ℕ → Set ℕ),\n (∀ d ∈ differences, d > 0) ∧\n (∀ n : ℕ, n > 0 → ∃! d, d ∈ differences ∧ n ∈ partition d) ∧\n (∀ d ∈ differences, ∃ a : ℕ, partition d = {a + n * d | n : ℕ}) ∧\n (differences.sum (fun d => (1 : ℚ) / d) = 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_27323", "source_license": null, "theorem_names": ["OMR_problem_105833_0_gs3"], "statement_sha256": "9d0c0dd4dfd7dd4f5510e7f4c401ebd9de609b4262805a104c2b2e3399ba17d3", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_27323__9d0c0dd4dfd7dd4f", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_27323", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_27797__7d5f2c2c81e153be", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_326503_2_gs4 :\n let f : ℝ → ℝ := fun t => (4 - t) * (5 - t) / 16\n ∫ t in (1 : ℝ)..(4 : ℝ), f t = 27 / 32 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_27797", "source_license": null, "theorem_names": ["OMR_problem_326503_2_gs4"], "statement_sha256": "7d5f2c2c81e153be3155994bc184563e98c4b701297490cc256a23e6ae2e3ee2", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_27797__7d5f2c2c81e153be", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_27797", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_29127__e0df026a6f66d755", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_177755 :\n let f : ℝ → ℝ := fun x => (3 * x - 1) / 2\n let C : ℝ := 5 / 24\n ∀ x : ℝ, (∫ y in (0)..(x), f y) + (∫ y in (0)..(1), (x + y)^2 * f y) = x^2 + C := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_29127", "source_license": null, "theorem_names": ["OMR_problem_177755"], "statement_sha256": "e0df026a6f66d755f97610f7ac96d045839adc7c28bba66199487cd887b852d7", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_29127__e0df026a6f66d755", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_29127", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_291__2e95e347353109f2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_368828_0_gs1 (x a : ℝ) :\n ∫ t in (0 : ℝ)..(1 : ℝ), (6 * x^2 * t + 3 * a * x^2 + 8 * x * t^2 + 4 * a * x * t) =\n 3 * x^2 + 3 * a * x^2 + (8/3) * x + 2 * a * x := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_291", "source_license": null, "theorem_names": ["OMR_problem_368828_0_gs1"], "statement_sha256": "2e95e347353109f28813156efce5e14dd0cd95511f8d70fb71356c239448afde", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_291__2e95e347353109f2", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_291", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_3174__f4e6fa9281cbfa5c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_151698_0_gp0 (m n : ℕ) (θ : ℝ) (h : Real.cos θ + Real.sin θ = 1) :\n Real.cos θ ^ (m + 1) * (Finset.sum (Finset.range (n + 1)) fun k => Real.sin θ ^ k * (Nat.choose (m + k) k : ℝ)) +\n Real.sin θ ^ (n + 1) * (Finset.sum (Finset.range (m + 1)) fun l => Real.cos θ ^ l * (Nat.choose (n + l) l : ℝ)) = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_3174", "source_license": null, "theorem_names": ["OMR_problem_151698_0_gp0"], "statement_sha256": "f4e6fa9281cbfa5c504a3805f3249c895645131c03dd3dd4334ac44a9c64f093", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_3174__f4e6fa9281cbfa5c", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_3174", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_32298__a7b445cfd617141a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_349208_2_gs1 (f : ℕ → ℕ) (hf : Function.Injective f) :\n ∀ d : ℕ, d > 0 → ∃ r : ℕ, r < d ∧ Set.Infinite {y | ∃ n, n % d = r ∧ f n = y} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_32298", "source_license": null, "theorem_names": ["OMR_problem_349208_2_gs1"], "statement_sha256": "a7b445cfd617141aa9ef40d4f2aad4019f598bee56a38488a285f4861903efc9", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_32298__a7b445cfd617141a", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_32298", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_35016__db110840f7cdb7ce", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_309255 (m n : ℕ) (A : Matrix (Fin m) (Fin n) ℝ)\n (v : Fin m → (Fin n → ℝ))\n (hv : ∀ i : Fin m, A.mulVec (v i) = Pi.single i 1) :\n let B : Matrix (Fin n) (Fin m) ℝ := fun j i => (v i) j\n A * B = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_35016", "source_license": null, "theorem_names": ["OMR_problem_309255"], "statement_sha256": "db110840f7cdb7ce07ef24f3b62030103daf682e7b46f2723ffe0e1a078da33a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_35016__db110840f7cdb7ce", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_35016", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_35847__21d71a33ce6fd1ac", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_272536_0_gp9 :\n let solution_set (a : ℝ) : Set ℝ := {x : ℝ | (x + a) * Real.sqrt (4 * x^2 + 5) + (2 * x + a) * Real.sqrt (x^2 + 2) = 3}\n let f (a : ℝ) : ℕ := (solution_set a).ncard\n f 2 = 1 ∧ solution_set 2 = {-1} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_35847", "source_license": null, "theorem_names": ["OMR_problem_272536_0_gp9"], "statement_sha256": "21d71a33ce6fd1ac2aa2cfa5e958bd94304c3e5027f0988e53cc58c0f2d5607f", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_35847__21d71a33ce6fd1ac", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_35847", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_37760__e0f22094cea314d2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_125682_0_gs1 :\n ∀ a : ℝ, a ∈ Set.Ioo 0 3 →\n (deriv (fun a => 3 - 2*a + 20/a + 7/(3 - a))) a = -2 - 20/a^2 + 7/(3 - a)^2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_37760", "source_license": null, "theorem_names": ["OMR_problem_125682_0_gs1"], "statement_sha256": "e0f22094cea314d23e649184ef739a764e4190dde00e33bedbe535371f6e2d41", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_37760__e0f22094cea314d2", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_37760", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_40436__9465423509d508d6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_128480_0_gs1 (n : ℕ) (hn : 0 < n) :\n let T := n * (n + 1) / 2\n ∀ (signs : Fin n → Bool),\n ∃ k : ℤ, 0 ≤ k ∧ k ≤ T ∧\n (∑ i : Fin n, (if signs i then 1 else -1) * (i.val + 1 : ℤ)) = T - 2 * k := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_40436", "source_license": null, "theorem_names": ["OMR_problem_128480_0_gs1"], "statement_sha256": "9465423509d508d66dfee08a4b1213029613d4a66455787a3ec958f46cf248a2", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_40436__9465423509d508d6", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_40436", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_41493__731ef4f8cc19e6da", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_200106_0_gs0 :\n ∫ x in (0 : ℝ)..(1 : ℝ), 2 * (2 * x * (1 - x)) * (1 - 2 * x * (1 - x)) = 2/5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_41493", "source_license": null, "theorem_names": ["OMR_problem_200106_0_gs0"], "statement_sha256": "731ef4f8cc19e6dabc14dee4bb4255f23929b020f1dae828f5ec96697d95c46c", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_41493__731ef4f8cc19e6da", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_41493", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_45283__0c183bf729aacb2f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_317274 (n : ℕ) (hn : n > 0) :\n (∀ (x : Fin n → ℝ), (∀ i, 0 ≤ x i) → (∑ i, x i) = 1 →\n n - 1 ≤ ∑ i, Real.sqrt (1 - x i)) ∧\n (∃ (x : Fin n → ℝ), (∀ i, 0 ≤ x i) ∧ (∑ i, x i) = 1 ∧\n ∑ i, Real.sqrt (1 - x i) = n - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_45283", "source_license": null, "theorem_names": ["OMR_problem_317274"], "statement_sha256": "0c183bf729aacb2ff086aff4d8beb3cca8dc7963b058176811da1e45e5b53316", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_45283__0c183bf729aacb2f", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_45283", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_45997__ce8583e5e4a58475", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_96711_0_gs1 :\n (∀ a : ℕ → ℝ, ¬ Filter.Tendsto a Filter.atTop (nhds 0) → ¬ Summable a) ∧\n ¬ Summable (fun n => (2 : ℝ) ^ n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_45997", "source_license": null, "theorem_names": ["OMR_problem_96711_0_gs1"], "statement_sha256": "ce8583e5e4a58475c56d66619d6fb9bea084b9f483212003922a6a876144a929", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_45997__ce8583e5e4a58475", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_45997", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_51666__01259c14b4beb076", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_214941 {R : Type*} [CommRing R] (p : Polynomial R) (k : ℕ) :\n let f : (Polynomial R) → (Polynomial R) := fun q => q.comp (Polynomial.X + 1) - q\n (∃ c : R, c ≠ 0 ∧ (f^[k]) p = Polynomial.C c) →\n (f^[k+1]) p = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_51666", "source_license": null, "theorem_names": ["OMR_problem_214941"], "statement_sha256": "01259c14b4beb076ac40ab331fe67ab02d7ab05b8d570b010b034cb01568d53a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_51666__01259c14b4beb076", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_51666", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_52627__daa713af302f0515", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_339074_1_gp6 :\n let a : ℕ → ℕ := fun n => 19 + (n - 1) * 25\n let b : ℕ → ℕ := fun n => 5 + (n - 1) * 18\n let common_terms : Set ℕ := {x | ∃ i j : ℕ, i ≥ 1 ∧ j ≥ 1 ∧ a i = x ∧ b j = x}\n ∃ (first_seven : Finset ℕ),\n first_seven.card = 7 ∧\n (∀ x ∈ first_seven, x ∈ common_terms) ∧\n (∀ x ∈ common_terms, ∀ y ∈ first_seven, x < y → x ∈ first_seven) ∧\n first_seven.sum id = 12383 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_52627", "source_license": null, "theorem_names": ["OMR_problem_339074_1_gp6"], "statement_sha256": "daa713af302f0515b30934d9fc1740ed72545023f5efe8de14257cb75944d6ef", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_52627__daa713af302f0515", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_52627", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_56023__265f184d738e2c67", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_60021_0_gp7 :\n let A : Matrix (Fin 2) (Fin 2) ℝ := ![![1, 0], ![-1, 1]]\n ∀ n : ℕ+, Matrix.det (A ^ (n : ℕ)) = 1 ∧ Matrix.trace (A ^ (n : ℕ)) = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_56023", "source_license": null, "theorem_names": ["OMR_problem_60021_0_gp7"], "statement_sha256": "265f184d738e2c67829482f7d73fce7e39705acfa8cdf1dafa8837ad605adb4a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_56023__265f184d738e2c67", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_56023", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_61656__958f686c9b61268c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_451123_0_gp3 :\n ∫ x in (-1 : ℝ)..1, Real.pi * ((2 - x^2)^2 - (x^2)^2) = 16 * Real.pi / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_61656", "source_license": null, "theorem_names": ["OMR_problem_451123_0_gp3"], "statement_sha256": "958f686c9b61268c466bf80f99a876d45b1e98f4fa88c66510e2da5caf0c0d22", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_61656__958f686c9b61268c", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_61656", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_63154__c322710edc8f96b4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_404386_gs1 (n : ℕ) (hn : n ≥ 1) (θ : Fin n → ℝ)\n (h : ∑ k : Fin n, (k.val + 1) * Real.cos (θ k) = n * (n + 1) / 2) :\n ∀ k : Fin n, Real.cos (θ k) = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_63154", "source_license": null, "theorem_names": ["OMR_problem_404386_gs1"], "statement_sha256": "c322710edc8f96b4da3c51ac663dffd428cdc24714481113092e2ecf4bd7ee11", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_63154__c322710edc8f96b4", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_63154", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_8868__eada06afe9379fc4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_236143_0_gp0 : ∫ x in (-1 : ℝ)..(1 : ℝ), x^4 * (x - 1)^3 = -(44 : ℝ) / 35 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_8868", "source_license": null, "theorem_names": ["OMR_problem_236143_0_gp0"], "statement_sha256": "eada06afe9379fc4f45961737f2425c99aaa912db03a7fc64740aadeb4ea3cd4", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_8868__eada06afe9379fc4", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_8868", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_9066__3cb3720316cfe742", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_159831_0_gp4 :\n let f : ℝ → ℝ := fun x => x^3\n let g : ℝ → ℝ := fun x => x^2\n ∫ x in (1:ℝ)..(3:ℝ), (f x - f 2) * (g x - g (4 - x)) = (336 : ℝ) / 5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_9066", "source_license": null, "theorem_names": ["OMR_problem_159831_0_gp4"], "statement_sha256": "3cb3720316cfe74257416e062edf80e17a0166cc80b131df724b0e24f582b8b8", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00030-of-00041.arrow_9066__3cb3720316cfe742", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00030-of-00041.arrow_9066", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_10093__9e02fc9429b323c7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_133616_3_gs3 (n : ℕ) [NeZero n] (M : Matrix (Fin n) (Fin n) ℂ) (k : ℂ)\n (h : M = k • 1) : k = Matrix.trace M / (n : ℂ) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_10093", "source_license": null, "theorem_names": ["OMR_problem_133616_3_gs3"], "statement_sha256": "9e02fc9429b323c7a00bacc2264374d46f7fd77e51c4477f4868bd89dc8b978c", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_10093__9e02fc9429b323c7", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_10093", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_11967__31cf74bee4405ce5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_306832_0_gs1 (n : ℕ) (a r : Fin n → ℝ)\n (ha_mono : Monotone a) (ha_nonpos : ∀ i, a i ≤ 0)\n (hr_mono : Monotone r) (hr_nonneg : ∀ i, 0 ≤ r i) :\n (∑ i : Fin n, ∑ j : Fin n, a i * a j * min (r i) (r j)) ≥ 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_11967", "source_license": null, "theorem_names": ["OMR_problem_306832_0_gs1"], "statement_sha256": "31cf74bee4405ce5996480ca25778516154b9d17de938d14a774ee91322cf118", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_11967__31cf74bee4405ce5", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_11967", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_14169__851ce5e267743af5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_373711_0_gp5 : ∃ (A : Matrix (Fin 2) (Fin 2) ℤ),\n (Matrix.det A ≡ 0 [ZMOD 27]) ∧\n (Matrix.det (A + 1) ≡ 0 [ZMOD 25]) ∧\n (Matrix.det (A + 2 • 1) ≡ 0 [ZMOD 121]) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_14169", "source_license": null, "theorem_names": ["OMR_problem_373711_0_gp5"], "statement_sha256": "851ce5e267743af56199f383e5180dfb8cb0bb5646e3193f6f12af0e86c43581", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_14169__851ce5e267743af5", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_14169", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_14792__5a762183597db41b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_168722_0_gp7 :\n ∀ p : Polynomial ℝ,\n (∀ q : Polynomial ℝ, ∀ x : ℝ, ∫ t in (0)..(x), (p.comp q).eval t = ∫ t in (0)..(x), (q.comp p).eval t) →\n p = Polynomial.X := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_14792", "source_license": null, "theorem_names": ["OMR_problem_168722_0_gp7"], "statement_sha256": "5a762183597db41b1f5eb78542e2370e44ff38fe9e1419e31424203c4f7b3659", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_14792__5a762183597db41b", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_14792", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_20542__b7c3a81c3ef43775", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_327865_0_gs2 (a b : ℝ) :\n ∫ x in (0 : ℝ)..1, (a + b * x)^2 = a^2 + a * b + b^2 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_20542", "source_license": null, "theorem_names": ["OMR_problem_327865_0_gs2"], "statement_sha256": "b7c3a81c3ef437750434ccdd55bbd816634ba17ab9fbd38effe09ccecf6b5e5b", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_20542__b7c3a81c3ef43775", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_20542", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_21812__08bc7acdc5a47d39", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_77409_0_gs3 :\n let f : ℝ → ℝ := fun x => ∫ t in (0 : ℝ)..x, Real.exp t\n (∀ x, deriv f x = Real.exp x) ∧\n f 0 = 0 ∧\n f 1 = Real.exp 1 - 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_21812", "source_license": null, "theorem_names": ["OMR_problem_77409_0_gs3"], "statement_sha256": "08bc7acdc5a47d39dc8a25d1667dca616ca09671e35968295b10c2d7b2727d5e", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_21812__08bc7acdc5a47d39", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_21812", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_41328__da4ff3b68c564082", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_61609_0_gs2 :\n ∀ x : ℝ, x ∈ Set.Ioo (-1 : ℝ) 1 →\n deriv (fun x => (x - 2) * Real.sqrt (1 + x) + (x + 3) * Real.sqrt (1 - x)) x =\n 3 * x / (2 * Real.sqrt (1 + x)) - (3 * x + 1) / (2 * Real.sqrt (1 - x)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_41328", "source_license": null, "theorem_names": ["OMR_problem_61609_0_gs2"], "statement_sha256": "da4ff3b68c564082e5ab0c6ef82cb138d31a9b6277a40dcd2c51e7b13ce63bea", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_41328__da4ff3b68c564082", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_41328", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_43161__eb1dc53ac42351ce", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_182713_0_gs3 :\n let P : Polynomial ℤ := Polynomial.X^8 - 8 • Polynomial.X^6 + 20 • Polynomial.X^4 - 16 • Polynomial.X^2 - Polynomial.X + 2\n P = (Polynomial.X + 1) * (Polynomial.X - 2) * (Polynomial.X^6 + Polynomial.X^5 - 5 • Polynomial.X^4 - 3 • Polynomial.X^3 + 7 • Polynomial.X^2 + Polynomial.X - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_43161", "source_license": null, "theorem_names": ["OMR_problem_182713_0_gs3"], "statement_sha256": "b2245b2ceb086331bc910e58522bf182a6791898964fa0dddaa1e24d081e2dbe", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_43161__eb1dc53ac42351ce", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_43161", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_50726__b57a75a7ae432a4c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_192874_0_gp1 : ¬∃ (f g : ℝ → ℝ),\n ContinuousOn f (Set.Ioi 0) ∧ ContinuousOn g (Set.Ioi 0) ∧\n MonotoneOn f (Set.Ioi 0) ∧ MonotoneOn g (Set.Ioi 0) ∧\n (∀ x ∈ Set.Ioi 0, x = f x * |x - 1| + g x * |x - 2|) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_50726", "source_license": null, "theorem_names": ["OMR_problem_192874_0_gp1"], "statement_sha256": "b57a75a7ae432a4cdf969ccf8fc65ea68ea5e45f0fa9f184d4f58424a8c7419f", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_50726__b57a75a7ae432a4c", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_50726", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_50855__2f428cf3cce12c69", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_245550_0_gp4 :\n let B : Matrix (Fin 2) (Fin 2) ℚ := !![14, -5; -5, -10]\n ∀ n : ℕ, n > 0 → B^n = ((15^n - (-11)^n : ℚ) / 26) • B + ((165 * (15^(n-1) - (-11)^(n-1)) : ℚ) / 26) • (1 : Matrix (Fin 2) (Fin 2) ℚ) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_50855", "source_license": null, "theorem_names": ["OMR_problem_245550_0_gp4"], "statement_sha256": "2f428cf3cce12c698ad16780f8c4b8e4c39f4a9770c34429d809f50dc343c7ef", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_50855__2f428cf3cce12c69", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_50855", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_51710__434698ed9b7bf629", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_494744_0_gs2 :\n let f : ℝ → ℝ := fun x => 1 / (x^2 + 1) + 4 * x / (3 - x)\n ∀ x ∈ Set.Ico 0 1, deriv f x > 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_51710", "source_license": null, "theorem_names": ["OMR_problem_494744_0_gs2"], "statement_sha256": "434698ed9b7bf629859ffe0cf19cddb5fb0c99560a078a4cfc479679e7e55cc1", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_51710__434698ed9b7bf629", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_51710", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_59001__aa27c76f269cee5e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_172461_0_gs2 :\n let E : ℝ → ℝ := fun k => (3 - k) * (k^2 + 2)\n let k₀ := 1 + Real.sqrt 3 / 3\n 1 < k₀ ∧ k₀ < 3 ∧\n deriv E k₀ = 0 ∧\n deriv (deriv E) k₀ < 0 ∧\n IsMaxOn E (Set.Ioo 1 3) k₀ := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_59001", "source_license": null, "theorem_names": ["OMR_problem_172461_0_gs2"], "statement_sha256": "aa27c76f269cee5e1b8ce298a9b425089e04460a8a42bac0671085e464938b38", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_59001__aa27c76f269cee5e", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_59001", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_59130__6f24b4cc47399d87", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_108628_0_gp0 (k : ℕ) (hk : 0 < k) :\n ∫ x in (0 : ℝ)..(1 : ℝ), x^k = ∫ x in (0 : ℝ)..(1 : ℝ), (1 - x)^k := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_59130", "source_license": null, "theorem_names": ["OMR_problem_108628_0_gp0"], "statement_sha256": "6f24b4cc47399d87d3d15dbb3ee4d127d038316967abb523b88bb79f03b7e515", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_59130__6f24b4cc47399d87", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_59130", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_7937__ebdcb47785a05026", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_162592_0_gs2 :\n let f : ℝ → ℝ := fun x => -x^3 - x^2 + 2*x + 2\n let critical_points := {x : ℝ | (deriv f) x = 0}\n critical_points = {(-1 + Real.sqrt 7) / 3, (-1 - Real.sqrt 7) / 3} ∧\n ∃! x ∈ critical_points, x ∈ Set.Ioc 0 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_7937", "source_license": null, "theorem_names": ["OMR_problem_162592_0_gs2"], "statement_sha256": "ebdcb47785a0502638baee64f6402b7cc30a3f83a5dc2c829667e6fbee9690ee", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00031-of-00041.arrow_7937__ebdcb47785a05026", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00031-of-00041.arrow_7937", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_1627__603af04a99cd4dc3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_459836_0_gp7 :\n let f : ℝ × ℝ → ℝ := fun (x, y) => (x + y) * (x^2 - y^2)\n let g : ℝ → ℝ := fun x => ∫ y in (0:ℝ)..(1:ℝ), f (x, y)\n deriv g (1/2) = ∫ y in (0:ℝ)..(1:ℝ), (3 * (1/2)^2 - y^2 + 2 * (1/2) * y) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_1627", "source_license": null, "theorem_names": ["OMR_problem_459836_0_gp7"], "statement_sha256": "603af04a99cd4dc3e51e09418424bab30b29f74ea0cb7bedd233601edc9ec14e", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_1627__603af04a99cd4dc3", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_1627", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_16433__4ab2ffe727df368a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_121329_0_gp0 :\n let J : ℕ → ℕ → ℝ := fun m n => ∫ x in (0 : ℝ)..(Real.pi/2), (Real.sin x)^m * Real.cos ((n : ℝ) * x)\n let m : ℕ := 5\n let n : ℕ := 2\n (((m : ℝ)^2 - (n : ℝ)^2) * J m n) / ((m : ℝ) * ((m : ℝ) - 1) * J (m - 2) n) = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_16433", "source_license": null, "theorem_names": ["OMR_problem_121329_0_gp0"], "statement_sha256": "4ab2ffe727df368ac69f71a1933ec1cc6e04ac4b56340e6cdb8ef8962323192b", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_16433__4ab2ffe727df368a", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_16433", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_19046__253b5efbd354dc83", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\nset_option maxHeartbeats 0\nopen BigOperators Real Nat Topology Rat\ntheorem extracted_ec9b6263 : (↑({x ∈ (9 : ℕ)!.divisors | Even x}) : Set ℕ) = {x : ℕ | x ∣ (9 : ℕ)! ∧ Even x} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_19046", "source_license": null, "theorem_names": ["extracted_ec9b6263"], "statement_sha256": "253b5efbd354dc831b352037b6c405c391558b6ed0b7a8ea632ff4ad109ecb6b", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_19046__253b5efbd354dc83", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_19046", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_22139__f6dfd375dbeb53cc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_121388_1_gp2 :\n let f : Polynomial ℂ → Polynomial ℂ := fun p =>\n Polynomial.comp p (Polynomial.X + Polynomial.C Complex.I) -\n Polynomial.comp p (Polynomial.X - Polynomial.C Complex.I)\n let B : Fin 3 → Polynomial ℂ := ![1, Polynomial.X, Polynomial.X^2]\n let B' : Fin 3 → Polynomial ℂ := ![Polynomial.X, 1 + Polynomial.X, Polynomial.X^2]\n let A : Matrix (Fin 3) (Fin 3) ℂ :=\n Matrix.of (fun i j => (f (B j)).coeff i)\n let A' : Matrix (Fin 3) (Fin 3) ℂ :=\n Matrix.of (fun i j => (f (B' j)).coeff i)\n A.det = 0 ∧ A'.det = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_22139", "source_license": null, "theorem_names": ["OMR_problem_121388_1_gp2"], "statement_sha256": "f6dfd375dbeb53cc8de8cdb586d88f67699d3ed7a21c1ea92d1506598d01b7bb", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_22139__f6dfd375dbeb53cc", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_22139", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_25338__5b392c0a243e2269", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_116744_1_gs2 :\n ∃ (group1 group2 : Finset (Fin 5)),\n group1 ∪ group2 = Finset.univ ∧\n group1 ∩ group2 = ∅ ∧\n group1.Nonempty ∧\n group2.Nonempty ∧\n let a : Fin 5 → ℝ := ![0, 0.5, 0.5, 0.75, 1]\n |(group1.sum a / group1.card) - (group2.sum a / group2.card)| < 1/2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_25338", "source_license": null, "theorem_names": ["OMR_problem_116744_1_gs2"], "statement_sha256": "5b392c0a243e226919ce4c93f82283f01fb537825a45fd39f8aee7a69e184b7b", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_25338__5b392c0a243e2269", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_25338", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_30166__ce4349a2970dfffd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_360632_gs5 (n : ℕ) :\n let A : ℝ → ℝ := fun x => ((n : ℝ) * x^(n+2) - ((n : ℝ)+1) * x^(n+1) + x) / (x - 1)^2\n let f : ℝ → ℝ := fun x => x * deriv A x\n f 2 = 2^(n+1) * ((n : ℝ)^2 - 2*(n : ℝ) + 3) - 6 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_30166", "source_license": null, "theorem_names": ["OMR_problem_360632_gs5"], "statement_sha256": "ce4349a2970dfffd5f21cd3fed98f567d9aaf034d63812256fd5692d6d52f516", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_30166__ce4349a2970dfffd", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_30166", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_35171__a87dd6e4ccc39695", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_173450_0_gp9 (f : ℝ → ℝ) (hf_cont : Continuous f)\n (h_integral : ∀ a b c d e f_var : ℝ,\n ∫ x in a..b, f x + ∫ x in c..d, f x + ∫ x in e..f_var, f x = ∫ x in (a + c + e)..(b + d + f_var), f x)\n (k : ℝ) (hf_linear : ∀ x, f x = k * x) :\n k = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_35171", "source_license": null, "theorem_names": ["OMR_problem_173450_0_gp9"], "statement_sha256": "a87dd6e4ccc39695e73af92ece33256472df24441cc7c4f53f89ed938b136988", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_35171__a87dd6e4ccc39695", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_35171", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_37655__85a049104e4e9cf5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_228752_1_gs2 :\n let g : ℝ → ℝ := fun a => (3 : ℝ)^(a^3) + (3 : ℝ)^((1 - a)^3)\n ∀ a ∈ Set.Icc (0 : ℝ) 1,\n (deriv g a = 3 * Real.log 3 * (a^2 * (3 : ℝ)^(a^3) - (1 - a)^2 * (3 : ℝ)^((1 - a)^3))) ∧\n (deriv g a = 0 ↔ a^2 * (3 : ℝ)^(a^3) = (1 - a)^2 * (3 : ℝ)^((1 - a)^3)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_37655", "source_license": null, "theorem_names": ["OMR_problem_228752_1_gs2"], "statement_sha256": "85a049104e4e9cf50e967b185d3973de64848862eb2527fea6e071561df7c8c6", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_37655__85a049104e4e9cf5", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_37655", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_45480__0812e1413dd2f98c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_164638_0_gs3 (a b : ℝ) (ha : 0 < a) (hb : 0 < b) :\n let f : ℕ → ℝ := fun n => a * (n : ℝ) * Real.log (n : ℝ) - b * (n : ℝ)\n Filter.Tendsto (fun n : ℕ => f n / ((n : ℝ) * Real.log (n : ℝ))) Filter.atTop (nhds a) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_45480", "source_license": null, "theorem_names": ["OMR_problem_164638_0_gs3"], "statement_sha256": "0812e1413dd2f98c8f34b140e0faae65b7ab035a0558f0c2c23710d3b541b858", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_45480__0812e1413dd2f98c", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_45480", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_47208__9386061c07b31a07", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_203415_0_gp3 :\n let f : ℝ → ℝ := fun x => x + 1\n (∫ x in (0 : ℝ)..(2 : ℝ), x * f x) / (∫ x in (0 : ℝ)..(2 : ℝ), f x) = 7 / 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_47208", "source_license": null, "theorem_names": ["OMR_problem_203415_0_gp3"], "statement_sha256": "9386061c07b31a078d7cc4c0fb7ade9f877058f88d255f1841ac763b612a0569", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_47208__9386061c07b31a07", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_47208", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_49646__5c14545e1228777e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_266057_1_gs1 :\n ∃ p : Polynomial ℚ, Polynomial.degree p = ↑6 ∧\n ∀ n : ℕ, (Finset.sum (Finset.Icc 1 n) (fun k => k^5) : ℚ) = p.eval ↑n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_49646", "source_license": null, "theorem_names": ["OMR_problem_266057_1_gs1"], "statement_sha256": "5c14545e1228777ef917e0f833cd20a1242617a8716be3b759d0e895616bf753", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_49646__5c14545e1228777e", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_49646", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_50352__b49bf40963a2d1f1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_88468_0_gs1 :\n ∀ B ∈ ({1, 3, 7, 9} : Set ℕ),\n (Finset.filter (fun abc : ℕ =>\n 100 ≤ abc ∧ abc ≤ 999 ∧\n let A := abc / 100\n let B_ := (abc / 10) % 10\n let C := abc % 10\n B_ = B ∧\n Nat.Prime (10 * A + B) ∧\n Nat.Prime (10 * B + C)\n ) (Finset.range 1000)).card =\n (Finset.filter (fun p : ℕ =>\n 10 ≤ p ∧ p ≤ 99 ∧ p % 10 = B ∧ Nat.Prime p\n ) (Finset.range 100)).card *\n (Finset.filter (fun p : ℕ =>\n 10 ≤ p ∧ p ≤ 99 ∧ p / 10 = B ∧ Nat.Prime p\n ) (Finset.range 100)).card := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_50352", "source_license": null, "theorem_names": ["OMR_problem_88468_0_gs1"], "statement_sha256": "b49bf40963a2d1f17d9bc0535fc1cfd3341ae86befa3961252d56ed284a0cc7c", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_50352__b49bf40963a2d1f1", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_50352", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_56105__5f24305019193b21", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_310281_0_gp0 :\n let F := {f : ℝ → ℝ | ContinuousOn f (Set.Icc 0 2) ∧\n (∀ x ∈ Set.Icc 0 2, f x ∈ Set.Icc 0 3) ∧\n ∫ x in Set.Icc 0 2, f x = 2}\n ∀ c : ℝ,\n (fun _ => c) ∈ F ∧ (fun _ => c^3) ∈ F →\n c = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_56105", "source_license": null, "theorem_names": ["OMR_problem_310281_0_gp0"], "statement_sha256": "5f24305019193b21aa64d1034fe2318a1819a8cfc103b58b75fb8483ff254568", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_56105__5f24305019193b21", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_56105", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_63206__a2d56a3b5a99a76d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_41790_0_gp5 (n : ℕ) (c : Fin n → ℂ) (a : Fin n → ℝ)\n (h : ∑ j, c j * Complex.exp (Complex.I * a j) = 0) :\n ∑ j, ∑ k, c j * (starRingEnd ℂ (c k)) * Complex.exp (Complex.I * (a j - a k)) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_63206", "source_license": null, "theorem_names": ["OMR_problem_41790_0_gp5"], "statement_sha256": "a2d56a3b5a99a76d8f85e471a219efcab9b4346f723666c73ccf2cbcd408896e", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_63206__a2d56a3b5a99a76d", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_63206", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_9129__4d7a9ed73c27342c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_373978 (r : ℝ) (θ : ℝ) (n : ℕ) (hr : r > 0) (hn : n > 0) :\n let z : ℂ := r * (Complex.cos θ + Complex.I * Complex.sin θ)\n let root_angles : Fin n → ℝ := fun k => (θ + 2 * Real.pi * (k : ℝ)) / (n : ℝ)\n (∀ k : Fin n, Complex.exp (Complex.I * root_angles k) ^ n = z / r) →\n (∑ k : Fin n, root_angles k) = θ + Real.pi * (n - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_9129", "source_license": null, "theorem_names": ["OMR_problem_373978"], "statement_sha256": "4d7a9ed73c27342cfe01e38cbb28f9bc9f7f38e9f980c8014859f2d4b1e2c5d7", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00032-of-00041.arrow_9129__4d7a9ed73c27342c", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00032-of-00041.arrow_9129", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_19837__8a0ae858d9801134", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_384298 (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (α : ℝ)\n (row_sum : ∀ i : Fin n, ∑ j : Fin n, A i j = α)\n (col_sum : ∀ j : Fin n, ∑ i : Fin n, A i j = α) :\n let e : Fin n → ℝ := fun _ => 1\n A.mulVec e = α • e := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_19837", "source_license": null, "theorem_names": ["OMR_problem_384298"], "statement_sha256": "8a0ae858d9801134a6747c4d08ce208d851a053be198551fff7b9d4872c4a9b8", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_19837__8a0ae858d9801134", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_19837", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_22577__6b0a2a5b0dc97ffa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_451042_0_gp4 :\n\n (Nat.Prime 113 ∧ Nat.Prime 127 ∧ 127 - 113 = 14 ∧\n (∀ r : ℕ, Nat.Prime r → 113 < r → r < 127 → False)) ∧\n\n (∀ p q : ℕ, Nat.Prime p → Nat.Prime q → q > p → q - p = 14 →\n (∀ r : ℕ, Nat.Prime r → p < r → r < q → False) → 113 ≤ p) ∧\n\n (∀ n : ℕ, 113 < n → n < 127 →\n (∃ d : ℕ, d ∈ ({2, 3, 5, 7, 11} : Set ℕ) ∧ Nat.Prime d ∧ d ∣ n)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_22577", "source_license": null, "theorem_names": ["OMR_problem_451042_0_gp4"], "statement_sha256": "6b0a2a5b0dc97ffac28a9989c888d504d33095ebca07a94c7e1a94022fcdc728", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_22577__6b0a2a5b0dc97ffa", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_22577", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_23173__84fe23abc366c597", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_60538_0_gp8 : ∃ (A B C D : Matrix (Fin 2) (Fin 2) ℕ),\n (∀ i j, 0 < A i j) ∧ (∀ i j, 0 < B i j) ∧ (∀ i j, 0 < C i j) ∧ (∀ i j, 0 < D i j) ∧\n 2 • (A + B^3) = C^2 + D^4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_23173", "source_license": null, "theorem_names": ["OMR_problem_60538_0_gp8"], "statement_sha256": "84fe23abc366c597f58f72fb9520ab2bc9a857634cfaabadb427f49c513a7aa9", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_23173__84fe23abc366c597", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_23173", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_24465__57d9813b17d4f5d2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_171525_0_gs0 :\n ∀ a b : ℝ,\n let P := fun x => a * x + b\n (∫ x in (0 : ℝ)..(2 : ℝ), P x = 4) ∧\n (∫ x in (0 : ℝ)..(2 : ℝ), (P x)^2 = 14) →\n ((a = 3 ∧ b = -1) ∨ (a = -3 ∧ b = 5)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_24465", "source_license": null, "theorem_names": ["OMR_problem_171525_0_gs0"], "statement_sha256": "57d9813b17d4f5d2f9e176baadaa90ac5b3e49a9a3eb254155a4224977403ae9", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_24465__57d9813b17d4f5d2", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_24465", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_25804__44939039c596309b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_168348_0_gs1 (n : ℕ) (hn : n ≥ 2) :\n let p : Polynomial ℝ := Polynomial.X^(2*n) - (2*n : ℝ) • Polynomial.X^(n+1) + (2*n : ℝ) • Polynomial.X^n - 1\n (p.eval 1 = 0) ∧ ∃ q : Polynomial ℝ, p = (Polynomial.X - 1) * q := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_25804", "source_license": null, "theorem_names": ["OMR_problem_168348_0_gs1"], "statement_sha256": "44939039c596309bbcb2f646449453cf1bafc08875e062f0ef2e355b62b6dc3b", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_25804__44939039c596309b", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_25804", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_28659__8b4c25f5a232537c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_183182_1_gp6 :\n Set.ncard {(x, y, z) : ℕ × ℕ × ℕ | x > 0 ∧ y > 0 ∧ z > 0 ∧ x ≤ y ∧ y ≤ z ∧ x * y * z = 2084} = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_28659", "source_license": null, "theorem_names": ["OMR_problem_183182_1_gp6"], "statement_sha256": "8b4c25f5a232537cc9039a41f16830852a62a9b4517436043ef247f5eac07cb7", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_28659__8b4c25f5a232537c", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_28659", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_52785__cc4fffc8667f3753", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_390153_2_gs2 (x : ℝ) :\n ∫ t in (0 : ℝ)..x, (x - t)^3 * t^2 = x^6 / 60 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_52785", "source_license": null, "theorem_names": ["OMR_problem_390153_2_gs2"], "statement_sha256": "cc4fffc8667f3753338497cf470859fb7ae930135cb55330dc12c31708aa69c2", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_52785__cc4fffc8667f3753", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_52785", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_63762__de117455f12e2582", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_404386_0_gs1 (n : ℕ) (a : Fin n → ℝ)\n (h : ∀ k : Fin n, a k ≤ (k.val + 1 : ℝ)) :\n (∑ k : Fin n, a k) ≤ n * (n + 1) / 2 ∧\n ((∑ k : Fin n, a k) = n * (n + 1) / 2 ↔ ∀ k : Fin n, a k = (k.val + 1 : ℝ)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_63762", "source_license": null, "theorem_names": ["OMR_problem_404386_0_gs1"], "statement_sha256": "de117455f12e2582441ae49b8181d323dd98776cf2ddc6d58ba7e69d926e7e96", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00033-of-00041.arrow_63762__de117455f12e2582", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00033-of-00041.arrow_63762", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_15096__f13a584b185d64d9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_82962_0_gp1 :\n let f : ℝ → ℝ := fun x => x^4 - 2*x^3 + 3*x^2 - 4*x + 5\n let g : ℝ → ℝ := fun w => (deriv^[3] f w) / 6 - ((f 1) / 2 - (f (-1)) / 2 - (deriv^[2] f 0))\n ∀ w ∈ Set.Icc (-1) 1, g w = 4*w + 10 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_15096", "source_license": null, "theorem_names": ["OMR_problem_82962_0_gp1"], "statement_sha256": "f13a584b185d64d961599a10dbd253623766df8f9b208e4f83205df4197cd19a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_15096__f13a584b185d64d9", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_15096", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_22470__3d163a1017ab2086", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_233673 :\n let A : Matrix (Fin 2) (Fin 2) ℤ := !![0, 1; 1, 0]\n let B : Matrix (Fin 2) (Fin 2) ℤ := !![1, 1; 0, 1]\n let C := A^2 * B^3 * A * B⁻¹^2\n ∑ i, ∑ j, C i j = -3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_22470", "source_license": null, "theorem_names": ["OMR_problem_233673"], "statement_sha256": "3d163a1017ab20860acebf2408747544b388a4627f3dee6b377382b62cd5b0fc", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_22470__3d163a1017ab2086", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_22470", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_26188__2dba5f7d033c58db", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_439567_0_gs0 (a b c d : ℝ) :\n let P : ℝ → ℝ := fun x => a * x^3 + b * x^2 + c * x + d\n ∫ x in (-1)..1, P x = 2 * b / 3 + 2 * d := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_26188", "source_license": null, "theorem_names": ["OMR_problem_439567_0_gs0"], "statement_sha256": "2dba5f7d033c58db6b5d0b26df569b8a7f270f1d4e6d83babb5484c741ffad02", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_26188__2dba5f7d033c58db", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_26188", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_37413__54c47be070c1bd6e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_123797 :\n ∃ p : Polynomial ℝ,\n let S := {x : ℝ | (p.eval x) ∈ Set.range ((↑) : ℚ → ℝ)}\n let T := {x : ℝ | (p.eval (x + 1)) ∉ Set.range ((↑) : ℚ → ℝ)}\n S ∩ T = ∅ := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_37413", "source_license": null, "theorem_names": ["OMR_problem_123797"], "statement_sha256": "2a35a0abd6b13277b4aa0536b70f69612be57af54f8b389ec7168a4bd332e47c", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_37413__54c47be070c1bd6e", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_37413", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_38917__757a47a2258cc54d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_477802_0_gs2 :\n (∀ d : ℤ, d ∣ 33 ↔ d ∈ ({1, -1, 3, -3, 11, -11, 33, -33} : Set ℤ)) ∧\n (∀ y : ℤ, (2 * y + 3) ∣ 33 ↔ y ∈ ({-18, -7, -3, -2, -1, 0, 4, 15} : Set ℤ)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_38917", "source_license": null, "theorem_names": ["OMR_problem_477802_0_gs2"], "statement_sha256": "757a47a2258cc54d529b601594c7b80436fe50f2c20d17a7911b14586a9aee08", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_38917__757a47a2258cc54d", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_38917", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_435__5a95ed248e7c0702", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_381948_0_gs4 :\n let f : ℝ → ℝ := fun t => t + 2 / (t - 1)\n let domain := Set.Icc (-Real.sqrt 2) (Real.sqrt 2) \\ {1}\n let critical_points := {t : ℝ | (deriv f) t = 0 ∧ t ∈ domain}\n critical_points = {1 - Real.sqrt 2} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_435", "source_license": null, "theorem_names": ["OMR_problem_381948_0_gs4"], "statement_sha256": "5a95ed248e7c0702345a65179a709c240242830adb83ea407b153b74ddb6446c", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_435__5a95ed248e7c0702", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_435", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_48473__6b0bd4019c3c5cd9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_20346_0_gp4 :\n ∀ (f : ℤ → Polynomial ℝ),\n (∀ n k : ℤ, (f n).eval (k : ℝ) = (f (n + k)).eval (k : ℝ)) →\n f 0 = Polynomial.X^2 + 2 * Polynomial.X + 3 →\n (∀ n : ℤ, (f n).natDegree ≤ 2) →\n (f 10).eval 5 = 38 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_48473", "source_license": null, "theorem_names": ["OMR_problem_20346_0_gp4"], "statement_sha256": "6b0bd4019c3c5cd941cf980fb79e6ec5354f2cddf1a8775efadb010e2f9ea307", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_48473__6b0bd4019c3c5cd9", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_48473", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_58922__32237d030ad4d56f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_416397_0_gp7 : ∃ S : Finset ℕ,\n S ⊆ Finset.Icc 1 2023 ∧\n S.card = 404 ∧\n (∀ x ∈ S, (S.sum id - x) % 10 = x % 10) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_58922", "source_license": null, "theorem_names": ["OMR_problem_416397_0_gp7"], "statement_sha256": "32237d030ad4d56fb0ab8d769508c010e67b1ef11fe3776d2695ceafa851ea56", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_58922__32237d030ad4d56f", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_58922", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_60206__0ccf2dcf5551ada0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_154607_0_gp5 {n : ℕ} {R : Type*} [Field R]\n (A B : Matrix (Fin n) (Fin n) R) [Invertible A] [Invertible B]\n (c : R) (hc : c ≠ 0) :\n Matrix.det ((c • A * B)⁻¹) = 1 / (c^n * Matrix.det A * Matrix.det B) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_60206", "source_license": null, "theorem_names": ["OMR_problem_154607_0_gp5"], "statement_sha256": "0ccf2dcf5551ada06b56f806a6b233e32e24a9adafeef760e0f0ee67f0dec198", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_60206__0ccf2dcf5551ada0", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_60206", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_6518__87a35e98a8845821", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_487831_3_gs3 (t a : ℝ) (ha : a ≠ 0) :\n ∫ τ in (0 : ℝ)..t, (τ + Real.exp (a * τ)) = t^2 / 2 + (Real.exp (a * t) - 1) / a := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_6518", "source_license": null, "theorem_names": ["OMR_problem_487831_3_gs3"], "statement_sha256": "87a35e98a8845821110bd1bd86852e271027f73b0b18de7fd1a997489fa2b059", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00034-of-00041.arrow_6518__87a35e98a8845821", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00034-of-00041.arrow_6518", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_10499__b81ac5c0b315d0ed", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_300624_0_gs0 : ∫ x in (-Real.pi)..Real.pi, 2 * x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_10499", "source_license": null, "theorem_names": ["OMR_problem_300624_0_gs0"], "statement_sha256": "b81ac5c0b315d0edf384c0c6b083e33a301e53492a07f48a2bd876cf37476bda", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_10499__b81ac5c0b315d0ed", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_10499", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_2354__3b9fdb6d6118c1f7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem numina_COT_problem_675126_gs1 (n : ℕ) (hn : 2 ≤ n) (milk : Fin n → ℝ) (i : Fin n) :\n let total_milk := ∑ j, milk j\n let milk_after_operation := fun j => if j = i then 0 else milk j + (milk i) / (n - 1)\n ∑ j, milk_after_operation j = total_milk := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_2354", "source_license": null, "theorem_names": ["numina_COT_problem_675126_gs1"], "statement_sha256": "3b9fdb6d6118c1f7a654aa278fa2ff8c7bc2c3f1bb0ed03b57cd43ae40b6707e", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_2354__3b9fdb6d6118c1f7", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_2354", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_26084__c0a4f4fa829f9af6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_227053_0_gs1 (n : ℕ) (hn : n > 0) :\n let T_n : ℝ → ℝ := fun x => Real.cos (n * Real.arccos x)\n let scaled_factor : ℝ := 1 / (2 : ℝ)^(n - 1)\n let P : ℝ → ℝ := fun x => scaled_factor * T_n x\n ∃ p : Polynomial ℝ, p.Monic ∧\n (∀ x ∈ Set.Icc (-1) 1, |P x| ≤ scaled_factor) ∧\n (∃ x ∈ Set.Icc (-1) 1, |P x| = scaled_factor) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_26084", "source_license": null, "theorem_names": ["OMR_problem_227053_0_gs1"], "statement_sha256": "c0a4f4fa829f9af664e10e75bda587017ec27b6b238d24a6ae73a45ef0fe07d3", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_26084__c0a4f4fa829f9af6", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_26084", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_33054__56e7ca28d96bc334", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_190233_0_gs1 (c : ℝ) :\n ∫ x in (0 : ℝ)..(1 : ℝ), (x - c)^2 = 1/3 - c + c^2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_33054", "source_license": null, "theorem_names": ["OMR_problem_190233_0_gs1"], "statement_sha256": "56e7ca28d96bc33494e46a473448bc2bff7c1d153bb9f1242b80bfa5c90c6ea1", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_33054__56e7ca28d96bc334", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_33054", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_34603__dad5fe73e811125e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_422819_1_gs4 (R : Type*) [CommRing R] (a b c d : R) :\n let M : Matrix (Fin 2) (Fin 2) R := !![a, b; c, d]\n Matrix.charpoly M = Polynomial.X^2 - Polynomial.C (Matrix.trace M) * Polynomial.X + Polynomial.C (Matrix.det M) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_34603", "source_license": null, "theorem_names": ["OMR_problem_422819_1_gs4"], "statement_sha256": "dad5fe73e811125e1ebc4c3c8b52d43349ce46eadda3ad45e8c5aca24dfb3c21", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_34603__dad5fe73e811125e", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_34603", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_5025__99666c5799d4dc13", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_148944_0_gs0 (a b c d e : ℝ) :\n let P : ℝ → ℝ := fun x => a * x^4 + b * x^3 + c * x^2 + d * x + e\n ∫ x in (0 : ℝ)..(1 : ℝ), P x = a/5 + b/4 + c/3 + d/2 + e := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_5025", "source_license": null, "theorem_names": ["OMR_problem_148944_0_gs0"], "statement_sha256": "99666c5799d4dc134a5190e7716125fd0c6ee7b245b95756b192d0f3d0a97926", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_5025__99666c5799d4dc13", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_5025", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_5684__35f3f84f72552e15", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_66498_3_gs0 (n : ℕ) (hn : n ≥ 1) :\n ∀ (f : Fin n → ℝ),\n (∀ i, f i = 1 ∨ f i = -1) →\n (∏ i : Fin n, f i =\n if Even (Finset.card (Finset.filter (fun i => f i = -1) Finset.univ)) then 1 else -1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_5684", "source_license": null, "theorem_names": ["OMR_problem_66498_3_gs0"], "statement_sha256": "35f3f84f72552e15b4231de141201483cfd3fc67e6fa53f8f547ecab9ee754d1", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_5684__35f3f84f72552e15", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_5684", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_61337__d8ccbc66a31f985d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_335120 (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : IsUnit (Matrix.det A)) :\n let C := Matrix.fromBlocks (A.transpose * A) 0 0 (A.transpose * A)\n Matrix.det C = (Matrix.det A)^4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_61337", "source_license": null, "theorem_names": ["OMR_problem_335120"], "statement_sha256": "d8ccbc66a31f985dbaf5a690fdec81c8d85824e0d96f2eb14a9be5d4683edff5", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_61337__d8ccbc66a31f985d", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_61337", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_62082__11c86fef0507bcfd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_273462_0_gs1 :\n let a : Fin 4 → ℝ := fun _ => 1/2\n let f := fun β => (∑ i : Fin 4, (a i)^4) +\n 2 * (4 / (∑ i : Fin 4, (a i)^2))^(2*β-2) * (∏ i : Fin 4, (a i)^β) -\n (∑ i : Fin 4, ∑ j : Fin 4, if i < j then (a i)^2 * (a j)^2 else 0)\n ∀ β ∈ Set.Ioc 1 2, f β = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_62082", "source_license": null, "theorem_names": ["OMR_problem_273462_0_gs1"], "statement_sha256": "11c86fef0507bcfd03701b588a8b30a192426a921fb501e4135127b7d9bdd26a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_62082__11c86fef0507bcfd", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_62082", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_736__a1ce8583b48e903d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_113210_0_gs2 :\n let f : ℝ → ℝ := fun t => t^3 - 3*t^2 + 4\n let f' := deriv f\n (Filter.Tendsto f' (nhdsWithin 1 (Set.Ioi 1)) (nhds (-3))) ∧\n (HasDerivWithinAt f (-3) (Set.Ici 1) 1) ∧\n ((-3) = (-3)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_736", "source_license": null, "theorem_names": ["OMR_problem_113210_0_gs2"], "statement_sha256": "a1ce8583b48e903d6daaf9ae06b973acc6894744ae28b4ab4218432fadecab4f", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00035-of-00041.arrow_736__a1ce8583b48e903d", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00035-of-00041.arrow_736", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_17260__4913fbf7ec035614", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_208979_0_gs3 (A B c : ℝ) :\n let g : ℝ → ℝ := fun x => A + B * (x - c)\n ∫ x in (1 : ℝ)..(2 : ℝ), g x = A * (2 - 1) + B * ((2 - c)^2 - (1 - c)^2) / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_17260", "source_license": null, "theorem_names": ["OMR_problem_208979_0_gs3"], "statement_sha256": "4913fbf7ec0356148fa07f403ad6da577047b727eb53ce35dd0c53bb1cc5b32e", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_17260__4913fbf7ec035614", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_17260", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_2060__2a1553c5753bbd63", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_327216_0_gp1 :\n (∀ (a : Fin 10 → ℕ), (∀ i, 0 < a i) → 10 ∣ (∏ i, a i) * (∑ i, (a i)^4)) ∧\n (∀ n : ℕ, 0 < n → n < 4 → ∃ (a : Fin 10 → ℕ), (∀ i, 0 < a i) ∧ ¬(10 ∣ (∏ i, a i) * (∑ i, (a i)^n))) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_2060", "source_license": null, "theorem_names": ["OMR_problem_327216_0_gp1"], "statement_sha256": "2a1553c5753bbd63ce0336477a4801160a0be119dad18cbb2e01c179e7a6842d", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_2060__2a1553c5753bbd63", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_2060", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_43147__6cd7871c51e4c061", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_458217_1_gs2 (k : ℕ) (hk : k > 0) :\n (∫ x in (0 : ℝ)..(π : ℝ), Real.sin ((k : ℝ) * x) ≠ 0 ↔ Odd k) ∧\n (Odd k → ∫ x in (0 : ℝ)..(π : ℝ), Real.sin ((k : ℝ) * x) = 2 / (k : ℝ)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_43147", "source_license": null, "theorem_names": ["OMR_problem_458217_1_gs2"], "statement_sha256": "6cd7871c51e4c061159b3d17ba485300843d6cf1d75bd548171a033596823380", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_43147__6cd7871c51e4c061", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_43147", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_50413__5b67df7bf7514e01", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_119543 :\n ∃ P : ℕ → Polynomial ℝ,\n (P 1 = 1) ∧\n (∀ n : ℕ, n ≥ 1 → P (n + 1) = Polynomial.X * P n + Polynomial.X^2 * Polynomial.derivative (P n)) ∧\n (∀ n : ℕ, n ≥ 1 → P n = Polynomial.C ((n - 1).factorial : ℝ) * Polynomial.X^(n - 1)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_50413", "source_license": null, "theorem_names": ["OMR_problem_119543"], "statement_sha256": "5b67df7bf7514e015e7853eb18a0e91d4f8db2fe2cdfa9807b0fe63ffac432f4", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_50413__5b67df7bf7514e01", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_50413", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_53150__a2ec8b247e9ad6ec", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_437289_0_gs2 (c : ℝ) (hc : c ∈ Set.Icc 0 1) :\n ∫ x in (0)..(c), (x^3 + (1/2) * x^2 - (1/2) * x) = c^4/4 + c^3/6 - c^2/4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_53150", "source_license": null, "theorem_names": ["OMR_problem_437289_0_gs2"], "statement_sha256": "a2ec8b247e9ad6ec32dee74b7c33059cabeb73fd4ee2d695cc10119a341914a2", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_53150__a2ec8b247e9ad6ec", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_53150", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_60416__5f164fa2cf994605", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_176778_0_gp7 :\n ∀ (A : ℕ → Matrix (Fin 2) (Fin 2) ℚ),\n (A 1 = (1/6 : ℚ) • (1 : Matrix (Fin 2) (Fin 2) ℚ)) →\n (∀ n : ℕ, n > 1 → A n = A (n-1) - (1/n : ℚ) • (1 : Matrix (Fin 2) (Fin 2) ℚ) + (2/(n+1) : ℚ) • (1 : Matrix (Fin 2) (Fin 2) ℚ) - (1/(n+2) : ℚ) • (1 : Matrix (Fin 2) (Fin 2) ℚ)) →\n ∀ n : ℕ, n ≥ 1 → A n = (1/((n+1)*(n+2)) : ℚ) • (1 : Matrix (Fin 2) (Fin 2) ℚ) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_60416", "source_license": null, "theorem_names": ["OMR_problem_176778_0_gp7"], "statement_sha256": "5f164fa2cf994605d08c1312570005ca01f38720e0dca1a375870a763590c768", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_60416__5f164fa2cf994605", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_60416", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_62067__6d3443fe4cc5f967", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_464728 (n : ℕ) (hn : 0 < n) (a : Fin n → ℝ)\n (h : ∀ i, a i = 1/2) :\n let P := ∏ i, (a i) / (1 - a i)\n let Q := (∑ i, a i)^n / (∑ i, (1 - a i))^n\n Q / P = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_62067", "source_license": null, "theorem_names": ["OMR_problem_464728"], "statement_sha256": "6d3443fe4cc5f967dddb15d90a8fb7b3225ec8f36016fac0ff7c7d3ba3c4f55e", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00036-of-00041.arrow_62067__6d3443fe4cc5f967", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00036-of-00041.arrow_62067", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00037-of-00041.arrow_17310__c3973d262e0dbe28", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_408553_1_gp2 (b : ℕ) (hb : b ≥ 2) :\n ∃ (P : Polynomial ℤ), ∃ (S : Finset ℕ), S.card ≥ 5 ∧\n ∀ n ∈ S, n ≥ 1 ∧ (Nat.digits b (Int.natAbs (P.eval (n : ℤ)))).sum = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00037-of-00041.arrow_17310", "source_license": null, "theorem_names": ["OMR_problem_408553_1_gp2"], "statement_sha256": "c3973d262e0dbe288fa5f932a7e0172ea2f71d831f163796051981b9659a266f", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00037-of-00041.arrow_17310__c3973d262e0dbe28", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00037-of-00041.arrow_17310", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00037-of-00041.arrow_36145__6c1b63a78e941c41", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_469729_0_gp2 :\n ∃ (n : ℕ), n > 0 ∧\n (∃ (d : ℕ), d ∈ ({1, 2, 3, 4, 5, 6, 7, 8, 9} : Set ℕ) ∧\n ∃ (k : ℕ), k > 0 ∧ n = d * (10^k - 1) / 9) ∧\n 105 ∣ n ∧\n (∀ (m : ℕ), m > 0 →\n (∃ (d : ℕ), d ∈ ({1, 2, 3, 4, 5, 6, 7, 8, 9} : Set ℕ) ∧\n ∃ (k : ℕ), k > 0 ∧ m = d * (10^k - 1) / 9) →\n 105 ∣ m → n ≤ m) ∧\n n = 555555 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00037-of-00041.arrow_36145", "source_license": null, "theorem_names": ["OMR_problem_469729_0_gp2"], "statement_sha256": "6c1b63a78e941c41877530151ec4c8b519de0f9fd54299a567e2562c06fa9dc7", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00037-of-00041.arrow_36145__6c1b63a78e941c41", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00037-of-00041.arrow_36145", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00037-of-00041.arrow_490__c63735b9b5c3a628", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat Classical Polynomial\n\ntheorem OMR_problem_134948_2_gs3 (f : ℤ → ℤ)\n (h_totally_mult : ∀ x y : ℤ, f (x * y) = f x * f y)\n (h_ideal : ∃ I : Ideal ℤ, {n : ℤ | f n = 0} = I)\n (h_euclidean_like : ∀ a : ℤ, ∀ b : ℤ, b ≠ 0 → ∃ q r : ℤ, a = q * b + r ∧ f r < f b) :\n {n : ℤ | f n = 0} = {0} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00037-of-00041.arrow_490", "source_license": null, "theorem_names": ["OMR_problem_134948_2_gs3"], "statement_sha256": "c63735b9b5c3a62888912d89626e05640b0819f5ed98772db305eeff3bee6083", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00037-of-00041.arrow_490__c63735b9b5c3a628", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00037-of-00041.arrow_490", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00037-of-00041.arrow_53600__73aac9ccc15fe80e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_196337 :\n Set.ncard {b : ℤ | ∃ n : ℤ, {x : ℤ | x^2 + b*x + 2 ≤ 0} = {n, n+1, n+2}} = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00037-of-00041.arrow_53600", "source_license": null, "theorem_names": ["OMR_problem_196337"], "statement_sha256": "73aac9ccc15fe80e28483270bb7aa5051a86b8f6a40941653830b4a29a1ef16a", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00037-of-00041.arrow_53600__73aac9ccc15fe80e", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00037-of-00041.arrow_53600", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00037-of-00041.arrow_5802__8e620de46e67a17e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_112344_0_gs3 :\n let f : ℝ → ℝ → ℝ := fun x y => (2 * x^2 + 3 * y^2) / (4 * x + 5 * y) + (2 * (1 - x)^2 + 3 * (1 - y)^2) / (9 - 4 * x - 5 * y)\n ∀ x y : ℝ, x ∈ Set.Ioo 0 1 → y ∈ Set.Ioo 0 1 → f (1/2) (1/2) ≤ f x y := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00037-of-00041.arrow_5802", "source_license": null, "theorem_names": ["OMR_problem_112344_0_gs3"], "statement_sha256": "8e620de46e67a17e373428799e8927941fb9413a0ffb91e419886831eff4ae6d", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00037-of-00041.arrow_5802__8e620de46e67a17e", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00037-of-00041.arrow_5802", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_33293__1b2384febc34116c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_413294_0_gp7 (A : Matrix (Fin 5) (Fin 5) ℝ)\n (h1 : (A + A.transpose)^2 = A + A.transpose)\n (h2 : A + A.transpose = ![![1, 0, 0, 0, 0], ![0, 1, 0, 0, 0], ![0, 0, 0, 0, 0], ![0, 0, 0, 0, 0], ![0, 0, 0, 0, 1]]) :\n ∑ i : Fin 5, ∑ j : Fin 5, A i j = 3/2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_33293", "source_license": null, "theorem_names": ["OMR_problem_413294_0_gp7"], "statement_sha256": "1b2384febc34116cf157d60ae5348c49f8f559899d5d6f204640d67b6e2805b9", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_33293__1b2384febc34116c", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_33293", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_33314__42e913fb49cf7432", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_185295 :\n ∃ a : ℕ → ℝ,\n a 0 = 2 ∧\n a 1 = 7 ∧\n (∀ n : ℕ, n ≥ 2 → a n = 7 * a (n - 1) - 10 * a (n - 2)) ∧\n (∃ r : ℝ, r > 0 ∧ ∀ x : ℝ, |x| < r →\n let f := fun x => ∑' n, a n * x^n\n f x - 7 * x * f x + 10 * x^2 * f x = 2 - 7 * x + 0 * x^2) ∧\n a 10 = 9766649 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_33314", "source_license": null, "theorem_names": ["OMR_problem_185295"], "statement_sha256": "42e913fb49cf7432646d697c44a96786e2d2ae11b47e3a64c1f249a53efe0d50", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_33314__42e913fb49cf7432", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_33314", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_36754__ee7a4e5f99b121db", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_208815_0_gp4 :\n let parabola := fun x : ℝ => x^2 - 3*x + 2\n let line := fun x : ℝ => 2*x + 1\n let slope_line := (2 : ℝ)\n let slope_perp := -1/slope_line\n\n ∃ (x₁ x₂ : ℝ), x₁ ≠ x₂ ∧\n\n parabola x₁ = line x₁ ∧ parabola x₂ = line x₂ ∧\n\n (∀ x : ℝ, parabola x = line x → x = x₁ ∨ x = x₂) ∧\n\n let dist := fun x : ℝ => |parabola x - line x| / Real.sqrt (1 + slope_line^2)\n\n (∀ x : ℝ, dist x ≥ dist x₁ ∧ dist x ≥ dist x₂) ∧\n\n dist x₁ = dist x₂ := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_36754", "source_license": null, "theorem_names": ["OMR_problem_208815_0_gp4"], "statement_sha256": "ee7a4e5f99b121db2df53876df0f3e5aa8d9428f78aac5b51eab69763a720e97", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_36754__ee7a4e5f99b121db", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_36754", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_37455__36496369cee10131", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_59156_0_gs1 (n : ℕ) (c : Fin n → ℝ) (b : Fin n → ℝ) :\n let g := fun x : ℝ => ∑ i : Fin n, c i * Real.log (x - b i)\n ∀ x : ℝ, (∀ i : Fin n, x ≠ b i) →\n deriv g x = ∑ i : Fin n, c i / (x - b i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_37455", "source_license": null, "theorem_names": ["OMR_problem_59156_0_gs1"], "statement_sha256": "36496369cee10131ede5bcefc085f3709bc2b8a76f6868808d18fc508a14878b", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_37455__36496369cee10131", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_37455", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_38777__d22663bc4a8c29bf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem numina_COT_problem_134608_gp8 :\n ∀ (U : Finset ℕ) (C T M : Finset ℕ),\n U.card = 100 →\n C ⊆ U → T ⊆ U → M ⊆ U →\n C.card = 90 → T.card = 80 → M.card = 70 →\n (∀ (C' T' M' : Finset ℕ),\n C' ⊆ U → T' ⊆ U → M' ⊆ U →\n C'.card = 90 → T'.card = 80 → M'.card = 70 →\n C'.card + T'.card + M'.card - (C' ∩ T').card - (C' ∩ M').card - (T' ∩ M').card + (C' ∩ T' ∩ M').card ≥\n C.card + T.card + M.card - (C ∩ T).card - (C ∩ M).card - (T ∩ M).card + (C ∩ T ∩ M).card) →\n (C ∩ T ∩ M).card ≥ 40 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_38777", "source_license": null, "theorem_names": ["numina_COT_problem_134608_gp8"], "statement_sha256": "d22663bc4a8c29bf1e641a987402bda7ece52b4763d52c40af9ea5141df31754", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_38777__d22663bc4a8c29bf", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_38777", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_41542__92da0200322d937f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem OMR_problem_478822_0_gp4 :\n let f : ℝ → ℝ := fun x => 5 * x + 1\n let F : ℝ → ℝ := fun x => ∫ t in (0)..(x), f t\n let A : ℝ := ∫ t in (0)..(1), f t\n ∃ Finv : ℝ → ℝ, (∀ x ∈ Set.Icc 0 1, Finv (F x) = x) ∧\n Finv (A / 2) = (-2 + Real.sqrt 74) / 10 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_41542", "source_license": null, "theorem_names": ["OMR_problem_478822_0_gp4"], "statement_sha256": "92da0200322d937f429e252d87da1ea8b3aea80b05d26f62fa0254c844b60a67", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_41542__92da0200322d937f", "metadata": {"split": "train", "difficulty": "medium", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_41542", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_5395__989c6ba643a4c1fc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_356117_0_gs1 (a b c d e : ℝ) :\n 8 * ∫ x in (1/4)..(3/4), a * x^4 + b * x^3 + c * x^2 + d * x + e =\n 121/320 * a + 5/8 * b + 13/12 * c + 2 * d + 4 * e := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_5395", "source_license": null, "theorem_names": ["OMR_problem_356117_0_gs1"], "statement_sha256": "989c6ba643a4c1fc929862f64ed65a39909a0bd1da2c0d5ff3e49d43ab3bcba7", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00038-of-00041.arrow_5395__989c6ba643a4c1fc", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00038-of-00041.arrow_5395", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__goedel_sft_dataset_v2-train-00039-of-00041.arrow_28783__74c5f1abb2030b45", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem OMR_problem_46185_0_gs1 :\n let f := fun x y : ℝ => 1/x + 1/y - 6/(x + y)\n ∀ x y : ℝ, x ∈ Set.Icc 1 2 → y ∈ Set.Icc 1 2 →\n (∀ x' y' : ℝ, x' ∈ Set.Icc 1 2 → y' ∈ Set.Icc 1 2 → f x y ≤ f x' y') →\n (x = 1 ∨ x = 2 ∨ y = 1 ∨ y = 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00039-of-00041.arrow_28783", "source_license": null, "theorem_names": ["OMR_problem_46185_0_gs1"], "statement_sha256": "74c5f1abb2030b4598e15d00df7ef1ad77d2ee705b0296891f9e4a1e38be51bd", "task_path": "tasks/rl_align__goedel_sft_dataset_v2-train-00039-of-00041.arrow_28783__74c5f1abb2030b45", "metadata": {"split": "train", "difficulty": "easy", "source": "goedel", "source_id": "goedel_sft_dataset_v2-train-00039-of-00041.arrow_28783", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Cauchy_Schwarz_3__9d72e0d27ac129a3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem Cauchy_Schwarz (n : ℕ) (hn : 0 < n) (a b : Fin n → ℝ)\n (h : ∑ i : Fin n, b i = 0) :\n (∑ i : Fin n, a i ^ 2 / n - (∑ i : Fin n, a i / n) ^ 2) *\n (∑ i : Fin n, b i ^ 2 / n) ≥ (∑ i : Fin n, a i * b i / n) ^ 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Cauchy_Schwarz_3", "source_license": null, "theorem_names": ["Cauchy_Schwarz"], "statement_sha256": "9d72e0d27ac129a340e1775a09855c2f0e4e992e61b2e289db6501e88275f1ab", "task_path": "tasks/rl_align__o_proofs_Cauchy_Schwarz_3__9d72e0d27ac129a3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Cauchy_Schwarz_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_ComplexSum_3__35b538b8987349cb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem ComplexSum (n : ℕ) (hn : 0 < n) (s : Finset ℂ) (h₀ : s.card = n)\n (h₁ : ∀ z ∈ s, ‖z‖ ≤ 1) :\n ∃ z, ‖z‖ ≤ 1 ∧ ∑ i ∈ s, ‖z - i‖ ≥ n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ComplexSum_3", "source_license": null, "theorem_names": ["ComplexSum"], "statement_sha256": "35b538b8987349cbb0a99a19f59432dede15dad6b8ae4dfe2b79f54b566b06cc", "task_path": "tasks/rl_align__o_proofs_ComplexSum_3__35b538b8987349cb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ComplexSum_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_ComplexUnitThree__72cef4e7ec37451f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem ComplexUnitThree (a b c : ℂ) (ha : ‖a‖ = 1) (hb : ‖b‖ = 1) (hc : ‖c‖ = 1)\n (h : a + b + c = 0) :\n dist a b = dist b c ∧ dist b c = dist a c := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ComplexUnitThree", "source_license": null, "theorem_names": ["ComplexUnitThree"], "statement_sha256": "72cef4e7ec37451fa224ee3718b9e35789e5d96c630be9de6717d55aff5f530c", "task_path": "tasks/rl_align__o_proofs_ComplexUnitThree__72cef4e7ec37451f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ComplexUnitThree", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Complex_exp_definite_int__5786d182edb1d582", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Complex.exp_definite_int (k : ℝ) (X : ℝ) (hX : X > 0) :\n ∫ x in (-X)..X, Complex.exp (I * (k + (-k)) * x) = 2 * X := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Complex_exp_definite_int", "source_license": null, "theorem_names": ["Complex.exp_definite_int"], "statement_sha256": "5786d182edb1d582d3030f7298844cbdd51b1ba6bf25bb7a1897daefcc4aa165", "task_path": "tasks/rl_align__o_proofs_Complex_exp_definite_int__5786d182edb1d582", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Complex_exp_definite_int", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_ContinuousDifferentiableOn_4__fd45f26edba62dfa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem ContinuousDifferentiableOn (f : ℝ → ℝ) (hf : ContinuousOn f (Set.Icc 0 1))\n (h0 : f 0 = 0) (h1 : f 1 = 1) (hf' : DifferentiableOn ℝ f (Set.Ioo 0 1)) :\n ∃ x : Fin 2021 → ℝ,\n StrictMono x ∧\n (∀ i, 0 < x i ∧ x i < 1) ∧\n ∑ i, deriv f (x i) = 2021 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ContinuousDifferentiableOn_4", "source_license": null, "theorem_names": ["ContinuousDifferentiableOn"], "statement_sha256": "fd45f26edba62dfa28c03afd0889e0b2d9ff28cccdae6d7fc0312804f18030c1", "task_path": "tasks/rl_align__o_proofs_ContinuousDifferentiableOn_4__fd45f26edba62dfa", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ContinuousDifferentiableOn_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_ContinuousDifferentiable_18__60ebb71eb12fc5cf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem ContinuousDifferentiable (f : ℝ → ℝ)\n (h₀ : Continuous f) (h₁ : Differentiable ℝ f)\n (h₂ : f 5 = 2) (h₃ : deriv f 5 = -2) (h₄ : iteratedDeriv 2 f 5 = -14)\n (h₅ : iteratedDeriv 3 f 5 = 6) :\n ∃ p : Polynomial ℝ, p.degree = 3 ∧\n ∀ x, p.eval x = 2 - 2 * (x - 5) - 7 * (x - 5) ^ 2 + (x - 5) ^ 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ContinuousDifferentiable_18", "source_license": null, "theorem_names": ["ContinuousDifferentiable"], "statement_sha256": "60ebb71eb12fc5cf0c6ee4357460c744b1131757c36c89b07fe85fcddfd18733", "task_path": "tasks/rl_align__o_proofs_ContinuousDifferentiable_18__60ebb71eb12fc5cf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ContinuousDifferentiable_18", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_ContinuousF_82__03815f021b999086", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem ContinuousF (f : ℝ → ℝ) (h₀ : Continuous f)\n (h₁ : ∫ x in (0)..1, (f x)^2 = 3) :\n ∫ x in (0)..1, x * f x ≤ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ContinuousF_82", "source_license": null, "theorem_names": ["ContinuousF"], "statement_sha256": "03815f021b99908684bd3bf2f390d7683438774eb4e3bf545e065fedb31f732a", "task_path": "tasks/rl_align__o_proofs_ContinuousF_82__03815f021b999086", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ContinuousF_82", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_ContinuousG_10__6d9ef747a9b2a53d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem ContinuousG (g : ℝ → ℝ)\n (φ : ℝ → ℝ)\n (h₀ : Continuous g)\n (h₁ : Differentiable ℝ φ)\n (h₂ : ∀ x, deriv φ x = g (φ x))\n (b : ℝ)\n (h₃ : Tendsto φ atTop (𝓝 b)) :\n g b = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ContinuousG_10", "source_license": null, "theorem_names": ["ContinuousG"], "statement_sha256": "6d9ef747a9b2a53d4bd6d51c613dda75e0be3d8ecd209cd25f24c92b8d7be7af", "task_path": "tasks/rl_align__o_proofs_ContinuousG_10__6d9ef747a9b2a53d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ContinuousG_10", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_ContinuousMono__b065149cb048a19a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem ContinuousMono (f : ℝ → ℝ) (hf : Continuous f) (hmono : Monotone f) :\n ∫ x in (0)..1, x * f x ≥ 1 / 2 * ∫ x in (0)..1, f x := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ContinuousMono", "source_license": null, "theorem_names": ["ContinuousMono"], "statement_sha256": "b065149cb048a19a3b9afe67fece0b704ddd0a6e3f34cd072c2f2a613a54fb49", "task_path": "tasks/rl_align__o_proofs_ContinuousMono__b065149cb048a19a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ContinuousMono", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_ConvexSet_4__ff72e9a20db942ca", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem ConvexSet {n : ℕ} (hn : 0 < n) (C : Set (EuclideanSpace ℝ (Fin n)))\n (hC : Convex ℝ C) (f : EuclideanSpace ℝ (Fin n) → ℝ)\n (hf : ∀ x, f x = sInf {dist x z | z ∈ C}) :\n ∀ x y : EuclideanSpace ℝ (Fin n), ∀ l : ℝ, l ∈ Set.Icc 0 1 →\n f (l • x + (1 - l) • y) ≤ l * f x + (1 - l) * f y := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ConvexSet_4", "source_license": null, "theorem_names": ["ConvexSet"], "statement_sha256": "ff72e9a20db942ca6f7e0dc5065d3c83c1bac73399885b626edb6c501501023b", "task_path": "tasks/rl_align__o_proofs_ConvexSet_4__ff72e9a20db942ca", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ConvexSet_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_CountIntP__f87efd7d31a8717d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem CountIntP : {(a, b) : ℕ × ℕ | ∃ A B : Set ℕ,\n A = {x : ℕ | 5 * x - a ≤ 0} ∧\n B = {x : ℕ | 6 * x - b > 0} ∧\n (A ∩ B) = {2, 3, 4}}.ncard = 30 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_CountIntP", "source_license": null, "theorem_names": ["CountIntP"], "statement_sha256": "f87efd7d31a8717d9866ba3472fa2aff295ab58aa0beb4a53e0072d638274690", "task_path": "tasks/rl_align__o_proofs_CountIntP__f87efd7d31a8717d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_CountIntP", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Count__540d13fcfe4d331d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem Count :\n Set.ncard {p : Fin 6 → ℕ | (∀ i, p i < 10) ∧\n p 0 + p 1 + p 2 = p 3 + p 4 + p 5 ∧\n p 0 + p 2 + p 4 = p 1 + p 3 + p 5} = 6700 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Count", "source_license": null, "theorem_names": ["Count"], "statement_sha256": "540d13fcfe4d331d4c9dc546492ca6e7506c462456bbfe00516db5ccc027a753", "task_path": "tasks/rl_align__o_proofs_Count__540d13fcfe4d331d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Count", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_E_20__6bc436b72b7319fb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem E (f : ℝ → ℝ → ℝ)\n (hf : f = λ x y => if (2 ≤ x ∧ x ≤ 10 ∧ 0 ≤ y ∧ y ≤ 1) then (10 - x * y ^ 2) / 64 else 0) :\n ∫ x in (2)..10, ∫ y in (0)..1, y * f x y = 7 / 16 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_E_20", "source_license": null, "theorem_names": ["E"], "statement_sha256": "6bc436b72b7319fbd2f784e288c516a2b0a6b0200fbabf3bb46a7304ab70e311", "task_path": "tasks/rl_align__o_proofs_E_20__6bc436b72b7319fb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_E_20", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Equilateral__f1f8d656f28d2bb7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem Equilateral (A B C D E F G : EuclideanSpace ℝ (Fin 2))\n (hABC : dist A B = dist A C ∧ dist A C = dist B C)\n (hADE : dist A D = dist A E ∧ dist A E = dist D E)\n (hEFG : dist E F = dist E G ∧ dist E G = dist F G)\n (hmid : D = midpoint ℝ A C ∧ G = midpoint ℝ A E)\n (hAB : dist A B = 4) :\n dist A B + dist B C + dist C D + dist D E + dist E F + dist F G +\n dist G A = 15 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Equilateral", "source_license": null, "theorem_names": ["Equilateral"], "statement_sha256": "f1f8d656f28d2bb7b0ca9a51b395106938830191f8bd9dd9fb6ba57338e98e17", "task_path": "tasks/rl_align__o_proofs_Equilateral__f1f8d656f28d2bb7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Equilateral", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_96218__f7b676c3001bf198", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry_96218 (A B C : EuclideanSpace ℝ (Fin 2))\n (hABC : ¬Collinear ℝ {A, B, C}) :\n 3 ≤ (4 * dist A B + 5 * dist B C) / (3 * dist A B + 2 * dist B C + dist C A) +\n (4 * dist B C + 5 * dist C A) / (3 * dist B C + 2 * dist C A + dist A B) +\n (4 * dist C A + 5 * dist A B) / (3 * dist C A + 2 * dist A B + dist B C) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_96218", "source_license": null, "theorem_names": ["EuclideanGeometry_96218"], "statement_sha256": "f7b676c3001bf19856aa9f28eb9d005d45594c150373c6d50cc5407f4dd216e8", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_96218__f7b676c3001bf198", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_96218", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_ESTriangle__9718f555217d849d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.ESTriangle (a b c : ℝ)\n (h₀ : 0 < a ∧ 0 < b ∧ 0 < c)\n (h₁ : a + b > c)\n (h₂ : b + c > a)\n (h₃ : c + a > b)\n (h₄ : a + b + c = 1) :\n a^2 + b^2 + c^2 + 4*a*b*c < 1/2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_ESTriangle", "source_license": null, "theorem_names": ["EuclideanGeometry.ESTriangle"], "statement_sha256": "9718f555217d849d23e7d3f3df2087eeed062fd0e77454d57cdc966f7ab403f4", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_ESTriangle__9718f555217d849d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_ESTriangle", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_Eval__385e765017da69c6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.Eval (a b c : ℝ)\n (h₀ : 0 < a ∧ 0 < b ∧ 0 < c)\n (h₁ : a + b > c)\n (h₂ : b + c > a)\n (h₃ : c + a > b) :\n a ^ 3 + b ^ 3 + c ^ 3 + 15 * a * b * c ≤\n 3 * a ^ 2 * (b + c) + 3 * b ^ 2 * (c + a) + 3 * c ^ 2 * (a + b) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_Eval", "source_license": null, "theorem_names": ["EuclideanGeometry.Eval"], "statement_sha256": "385e765017da69c64ba95484967d81be707bf335c10df819e6100c4f72816c2a", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_Eval__385e765017da69c6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_Eval", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_Triangle_Sides_5__86012543d6c7c64b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.Triangle.Sides (a b c : ℝ)\n (h₀ : 0 < a ∧ 0 < b ∧ 0 < c)\n (h₁ : a + b > c) (h₂ : b + c > a) (h₃ : c + a > b) :\n 3 * (a ^ 2 + b ^ 2 + c ^ 2) / (a + b + c) ^ 2 +\n (a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2) ≤ 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_Triangle_Sides_5", "source_license": null, "theorem_names": ["EuclideanGeometry.Triangle.Sides"], "statement_sha256": "86012543d6c7c64b242d0d9b0c3eabed9d3087885292bedb87db77985c5df93b", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_Triangle_Sides_5__86012543d6c7c64b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_Triangle_Sides_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_Triangle_sides_23__77e99bb9d61a8113", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.Triangle.sides (A B C : EuclideanSpace ℝ (Fin 2))\n (a b c : ℝ) (h₀ : dist A B = a) (h₁ : dist B C = b) (h₂ : dist A C = c)\n (ha : 0 < a) (hb : 0 < b) (hc : 0 < c) :\n (a ^ 2 - b * c) / (3 * a ^ 2 + b ^ 2 + c ^ 2) +\n (b ^ 2 - c * a) / (3 * b ^ 2 + c ^ 2 + a ^ 2) +\n (c ^ 2 - a * b) / (3 * c ^ 2 + a ^ 2 + b ^ 2) ≤ 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_Triangle_sides_23", "source_license": null, "theorem_names": ["EuclideanGeometry.Triangle.sides"], "statement_sha256": "77e99bb9d61a811360a19f651556fceaecf4809598e9661ad7686480056e58ab", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_Triangle_sides_23__77e99bb9d61a8113", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_Triangle_sides_23", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_a_230876__e0ce74c83da7ab7f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen EuclideanGeometry\n\ntheorem EuclideanGeometry.a_230876\n {A B C : EuclideanSpace ℝ (Fin 2)}\n (hABC : ¬Collinear ℝ {A, B, C})\n (a b c : ℝ)\n (ha : dist A B = a)\n (hb : dist B C = b)\n (hc : dist C A = c)\n (h : a * b + b * c + c * a = 1) :\n (a + 1) * (b + 1) * (c + 1) ≤ 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_a_230876", "source_license": null, "theorem_names": ["EuclideanGeometry.a_230876"], "statement_sha256": "e0ce74c83da7ab7f727d40591ea606fdab89e857dab106887cca63d1ec27211e", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_a_230876__e0ce74c83da7ab7f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_a_230876", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_a_b_c__cafded35d79e8a6a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.a_b_c : ∀ a b c : ℝ,\n (a ≤ b + c ∧ b ≤ a + c ∧ c ≤ a + b) →\n a / (b + c) + b / (c + a) + c / (a + b) +\n (a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2) ≤\n 5 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_a_b_c", "source_license": null, "theorem_names": ["EuclideanGeometry.a_b_c"], "statement_sha256": "cafded35d79e8a6aeda3e874cfafbb6d1ee3243c1bd574b1a0dc67742de3c770", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_a_b_c__cafded35d79e8a6a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_a_b_c", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_angleABC__63fd6a8db2eef56a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.angleABC (A B C : EuclideanSpace ℝ (Fin 2))\n (a b c : ℝ) (ha : dist B C = a) (hb : dist A C = b) (hc : dist A B = c)\n (h : a + b > c) (h' : a + c > b) (h'' : b + c > a) :\n (a - b)/(a + b) + (b - c)/(b + c) + (c - a)/(c + a) < 1/16 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_angleABC", "source_license": null, "theorem_names": ["EuclideanGeometry.angleABC"], "statement_sha256": "63fd6a8db2eef56a419ad179d0f0139713643e8348e810e7f3630a098b3a3806", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_angleABC__63fd6a8db2eef56a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_angleABC", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_angle_X__5f50be260d2c8e7d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.angle.X (x y z : ℝ) (h₀ : 0 < x ∧ 0 < y ∧ 0 < z)\n (h₁ : x + y > z) (h₂ : y + z > x) (h₃ : z + x > y) :\n |(x - y)/(x + y) + (y - z)/(y + z) + (z - x)/(z + x)| < 1/8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_angle_X", "source_license": null, "theorem_names": ["EuclideanGeometry.angle.X"], "statement_sha256": "5f50be260d2c8e7d1a875dc04f27f484371f083dfbda6593e39da16d9e724a80", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_angle_X__5f50be260d2c8e7d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_angle_X", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_angle_trin__fd5b02857931fb93", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.angle_trin (a b c : ℝ)\n (h₀ : 0 < a ∧ 0 < b ∧ 0 < c)\n (h₁ : c < a + b)\n (h₂ : a < b + c)\n (h₃ : b < a + c) :\n a^3 + b^3 + c^3 + 15*a*b*c ≤ 3*a^2*(b + c) + 3*b^2*(c + a) + 3*c^2*(a + b) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_angle_trin", "source_license": null, "theorem_names": ["EuclideanGeometry.angle_trin"], "statement_sha256": "fd5b02857931fb938ccd7a8a10b5156b1dc11d0e1d375cbf2139201a06cd281b", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_angle_trin__fd5b02857931fb93", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_angle_trin", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_lens__3c19d3d04d53c56f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.lens (a b c : ℝ)\n (h₀ : 0 < a ∧ 0 < b ∧ 0 < c)\n (h₁ : a + b > c) (h₂ : a + c > b) (h₃ : b + c > a)\n (h₄ : a + b + c = 1) :\n (b + c - a)/(a^2 + b*c) + (c + a - b)/(b^2 + c*a) +\n (a + b - c)/(c^2 + a*b) > 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_lens", "source_license": null, "theorem_names": ["EuclideanGeometry.lens"], "statement_sha256": "3c19d3d04d53c56f769861ec433158885612d227cca85482d4d31d4fc6dc3ddf", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_lens__3c19d3d04d53c56f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_lens", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_lens_of_triangle__e42827ff1325932c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.lens_of_triangle\n (A B C : EuclideanSpace ℝ (Fin 2))\n (a b c : ℝ)\n (h₀ : dist B C = a)\n (h₁ : dist A C = b)\n (h₂ : dist A B = c) :\n a / (b + c) + b / (c + a) + c / (a + b) +\n (a * b + b * c + c * a) / (a ^ 2 + b ^ 2 + c ^ 2) ≤ 5 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_lens_of_triangle", "source_license": null, "theorem_names": ["EuclideanGeometry.lens_of_triangle"], "statement_sha256": "e42827ff1325932c1fa61c661f21f716d0828b44a2d7b9c6944a2506f2e652e3", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_lens_of_triangle__e42827ff1325932c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_lens_of_triangle", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_prove_12__0e523dc148713b35", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.prove (a b c : ℝ) (h₀ : 0 < a ∧ 0 < b ∧ 0 < c)\n (h₁ : c < a + b) (h₂ : b < a + c) (h₃ : a < b + c) (h₄ : a + b + c = 2) :\n a^2 * b^2 + b^2 * c^2 + c^2 * a^2 ≥ 9 / 16 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_prove_12", "source_license": null, "theorem_names": ["EuclideanGeometry.prove"], "statement_sha256": "0e523dc148713b35ed7750440f85e37cb7b1e968cf8a5117f2125fa13901d8df", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_prove_12__0e523dc148713b35", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_prove_12", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_prove_19__f1e0436901b467cd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.prove\n (A B C : EuclideanSpace ℝ (Fin 2))\n (hABC : ¬Collinear ℝ {A, B, C})\n (h : dist A B * dist B C + dist B C * dist C A + dist C A * dist A B = 1) :\n (dist A B + 1) * (dist B C + 1) * (dist C A + 1) < 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_prove_19", "source_license": null, "theorem_names": ["EuclideanGeometry.prove"], "statement_sha256": "f1e0436901b467cd65bc3ea2c74e90f8540ab65feab65b572649b3f07b979da6", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_prove_19__f1e0436901b467cd", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_prove_19", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_prove_52__64d03f4f4648d8ed", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.prove (a b c : ℝ)\n (h₀ : 0 < a ∧ 0 < b ∧ 0 < c)\n (h₁ : c < a + b) (h₂ : b < a + c) (h₃ : a < b + c) :\n (a + b + c)^3 ≤ 27 * a^2 * b^2 * c^2 / ((a + b - c) * (b + c - a) * (c + a - b)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_prove_52", "source_license": null, "theorem_names": ["EuclideanGeometry.prove"], "statement_sha256": "64d03f4f4648d8edb8a20d7a890148fd5da27063aa3ec57332477c02afde5b96", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_prove_52__64d03f4f4648d8ed", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_prove_52", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EuclideanGeometry_prove_8248__dd487f71996e6b05", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem EuclideanGeometry.prove_8248\n (a b c : ℝ)\n (h₀ : 0 < a ∧ 0 < b ∧ 0 < c)\n (h₁ : c < a + b)\n (h₂ : b < a + c)\n (h₃ : a < b + c) :\n 3 * (a / b + b / c + c / a - 1) ≥ 2 * (b / a + a / c + c / b) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_prove_8248", "source_license": null, "theorem_names": ["EuclideanGeometry.prove_8248"], "statement_sha256": "dd487f71996e6b05948511cfd908d2719b8e9a52ca3d2d3ed4d752a500fa0b60", "task_path": "tasks/rl_align__o_proofs_EuclideanGeometry_prove_8248__dd487f71996e6b05", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_EuclideanGeometry_prove_8248", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Evaluate_14__24a61d9734f5b3bd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem Evaluate :\n\n ∫ x in (-π/2)..(π/2), sqrt (1 - cos x) = 4 * (Real.sqrt 2 - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Evaluate_14", "source_license": null, "theorem_names": ["Evaluate"], "statement_sha256": "24a61d9734f5b3bd08afd043191c0c7737c9a66f123969c0815c5799db7784ba", "task_path": "tasks/rl_align__o_proofs_Evaluate_14__24a61d9734f5b3bd", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Evaluate_14", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_EvenBelow__6e88c9540013fa14", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem EvenBelow (n : ℕ) (hn : Odd n) :\n Set.ncard {x | 0 < x ∧ Even x ∧ x < n} = (n - 1) / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EvenBelow", "source_license": null, "theorem_names": ["EvenBelow"], "statement_sha256": "6e88c9540013fa14e09626f1fb3b3c3c7ebe444acb0a7dae96bf49976b7807c8", "task_path": "tasks/rl_align__o_proofs_EvenBelow__6e88c9540013fa14", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_EvenBelow", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_IdealList__f889bdacb1680f16", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Fintype Subgroup Set Polynomial Ideal\nopen scoped BigOperators\n\n\ntheorem IdealList :\n {(x, y) : ℤ × (ZMod 12) | x = 0 ∧ y = 0} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 0 ∧ y = 1} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 0 ∧ y = 2} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 0 ∧ y = 3} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 0 ∧ y = 4} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 0 ∧ y = 6} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 0 ∧ y = 12} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 1 ∧ y = 0} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 1 ∧ y = 1} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 1 ∧ y = 2} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 1 ∧ y = 3} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 1 ∧ y = 4} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 1 ∧ y = 6} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 1 ∧ y = 12} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 2 ∧ y = 0} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 2 ∧ y = 1} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 2 ∧ y = 2} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 2 ∧ y = 3} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 2 ∧ y = 4} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 2 ∧ y = 6} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 2 ∧ y = 12} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 3 ∧ y = 0} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 3 ∧ y = 1} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 3 ∧ y = 2} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 3 ∧ y = 3} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 3 ∧ y = 4} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 3 ∧ y = 6} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 3 ∧ y = 12} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 4 ∧ y = 0} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 4 ∧ y = 1} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 4 ∧ y = 2} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 4 ∧ y = 3} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 4 ∧ y = 4} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 4 ∧ y = 6} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 4 ∧ y = 12} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 6 ∧ y = 0} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 6 ∧ y = 1} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 6 ∧ y = 2} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 6 ∧ y = 3} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 6 ∧ y = 4} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 6 ∧ y = 6} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 6 ∧ y = 12} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 12 ∧ y = 0} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 12 ∧ y = 1} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 12 ∧ y = 2} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 12 ∧ y = 3} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 12 ∧ y = 4} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 12 ∧ y = 6} ∪\n {(x, y) : ℤ × (ZMod 12) | x = 12 ∧ y = 12} =\n {(0, 0), (0, 1), (0, 2), (0, 3), (0, 4), (0, 6), (0, 12),\n (1, 0), (1, 1), (1, 2), (1, 3), (1, 4), (1, 6), (1, 12),\n (2, 0), (2, 1), (2, 2), (2, 3), (2, 4), (2, 6), (2, 12),\n (3, 0), (3, 1), (3, 2), (3, 3), (3, 4), (3, 6), (3, 12),\n (4, 0), (4, 1), (4, 2), (4, 3), (4, 4), (4, 6), (4, 12),\n (6, 0), (6, 1), (6, 2), (6, 3), (6, 4), (6, 6), (6, 12),\n (12, 0), (12, 1), (12, 2), (12, 3), (12, 4), (12, 6), (12, 12)} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_IdealList", "source_license": null, "theorem_names": ["IdealList"], "statement_sha256": "f889bdacb1680f1690b1b98189b1a0cbef317522c656b75045a23f4d0e59f4e5", "task_path": "tasks/rl_align__o_proofs_IdealList__f889bdacb1680f16", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_IdealList", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_InequalityRelation__462787edc74a6253", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem InequalityRelation {n : ℕ} (hn : 0 < n) (x : Fin n → ℝ)\n (hx : ∀ i, 0 < x i) :\n ∏ i, x i ^ x i ≥ (∏ i, x i) ^ ((∑ i, x i) / n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_InequalityRelation", "source_license": null, "theorem_names": ["InequalityRelation"], "statement_sha256": "462787edc74a62534df2d149810c3d00eeba71c361102ad7bc98d475958f99db", "task_path": "tasks/rl_align__o_proofs_InequalityRelation__462787edc74a6253", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_InequalityRelation", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_InfiniteSet_32__312b79cf4df09734", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem InfiniteSet : Set.Infinite {f : ℕ → ℕ | ∀ k n, f (n * f k + k * f n) = f (n ^ 2 + k ^ 2) * f (n + k - 1)} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_InfiniteSet_32", "source_license": null, "theorem_names": ["InfiniteSet"], "statement_sha256": "312b79cf4df09734c4ef5bc13a4f71ec7de07ef4035e68fc62e6d46d0858034c", "task_path": "tasks/rl_align__o_proofs_InfiniteSet_32__312b79cf4df09734", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_InfiniteSet_32", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Irrational_roots__dea8623d91cce2cc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Irrational_roots (f : ℝ → ℝ) (hf : f = fun x => 4 * x / (x ^ 2 + x + 3) + 5 * x / (x ^ 2 - 5 * x + 3) + 3 / 2) :\n Set.ncard {x | Irrational x ∧ f x = 0} = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Irrational_roots", "source_license": null, "theorem_names": ["Irrational_roots"], "statement_sha256": "dea8623d91cce2cc09d2729897e87c3ef788b41f7e0c63fe410ea8d7506ed859", "task_path": "tasks/rl_align__o_proofs_Irrational_roots__dea8623d91cce2cc", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Irrational_roots", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_IsReducible__e44af4e12af67a12", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem IsReducible (p : ℕ) (hp : Nat.Prime p) :\n ∃ f g : Polynomial ℤ, f.degree > 0 ∧ g.degree > 0 ∧\n ∀ x : ℤ, x ^ p + p * x + p - 1 = f.eval x * g.eval x ↔ p = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_IsReducible", "source_license": null, "theorem_names": ["IsReducible"], "statement_sha256": "e44af4e12af67a1271f0c8d2befd84037787c18292e2b3a0c7e9b8ad73ae1e2b", "task_path": "tasks/rl_align__o_proofs_IsReducible__e44af4e12af67a12", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_IsReducible", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_MatrixComm_14__0773c1d3352f0970", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem MatrixComm {n : ℕ} {A B C : Matrix (Fin n) (Fin n) ℝ}\n (hAB : C = A * B - B * A) (hA : C * A = A * C) (hB : C * B = B * C)\n (k : ℕ) (hk : 0 < k) :\n A * B ^ k - B ^ k * A = k * B ^ (k - 1) * C := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_MatrixComm_14", "source_license": null, "theorem_names": ["MatrixComm"], "statement_sha256": "0773c1d3352f0970e59919ab1fa6a20184aaf73fcef66968a31021abc509b8a3", "task_path": "tasks/rl_align__o_proofs_MatrixComm_14__0773c1d3352f0970", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_MatrixComm_14", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_MatrixInvertible_29__e7a1b786cf32012f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Matrix Finset\n\n\ntheorem MatrixInvertible {n m : ℕ} (hn : 0 < n) (hm : 0 < m)\n (A : Matrix (Fin n) (Fin n) ℝ) (B : Matrix (Fin n) (Fin m) ℝ)\n (I : Matrix (Fin m) (Fin m) ℝ) (f : Matrix (Fin n) (Fin 1) ℝ)\n (hA : Nonempty (Invertible A)) :\n ∃! x : Matrix (Fin n) (Fin 1) ℝ,\n ∃! y : Matrix (Fin m) (Fin 1) ℝ,\n (A * x + B * y = f ∧ y = 0) ↔ Nonempty (Invertible A) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_MatrixInvertible_29", "source_license": null, "theorem_names": ["MatrixInvertible"], "statement_sha256": "e7a1b786cf32012f3a84c8711e39f2f84c0cb6109197c5035e3588501276fba9", "task_path": "tasks/rl_align__o_proofs_MatrixInvertible_29__e7a1b786cf32012f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_MatrixInvertible_29", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_MatrixPower_14__cc8c82b25c9d23ae", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem MatrixPower {A : Matrix (Fin 2) (Fin 2) ℝ}\n (hA : A = !![1, 2; -2, 1]) (n : ℕ) (hn : n > 0) :\n A ^ n =\n !![5 ^ ((n : ℝ) / 2) * cos (n * arctan 2), 5 ^ ((n : ℝ) / 2) * sin (n * arctan 2);\n -5 ^ ((n : ℝ) / 2) * sin (n * arctan 2), 5 ^ ((n : ℝ) / 2) * cos (n * arctan 2)] := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_MatrixPower_14", "source_license": null, "theorem_names": ["MatrixPower"], "statement_sha256": "cc8c82b25c9d23aef76aa20de653c4ed0720bb3cb221faf9388908895cb34ca1", "task_path": "tasks/rl_align__o_proofs_MatrixPower_14__cc8c82b25c9d23ae", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_MatrixPower_14", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_MatrixProven__e7eed5d1066858e6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem MatrixProven {n : ℕ} {A B C : Matrix (Fin n) (Fin n) ℝ}\n (hC : C = A * B - B * A) (hCA : A * C = C * A) (hCB : B * C = C * B)\n (k : ℕ) (hk : 0 < k) :\n A * B ^ k - B ^ k * A = k * B ^ (k - 1) * C := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_MatrixProven", "source_license": null, "theorem_names": ["MatrixProven"], "statement_sha256": "e7eed5d1066858e68bd7294a8145879762e5c77985160b34ecb265382dc9070d", "task_path": "tasks/rl_align__o_proofs_MatrixProven__e7eed5d1066858e6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_MatrixProven", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_MatrixSign__43b764219058f11a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem MatrixSign (m n : ℕ) (a : Matrix (Fin m) (Fin n) ℝ) :\n ∃ b : Matrix (Fin m) (Fin n) ℝ,\n (∀ i j, b i j = -a i j ∨ b i j = a i j) ∧\n (∀ i, ∑ j : Fin n, b i j ≥ 0) ∧\n (∀ j, ∑ i : Fin m, b i j ≥ 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_MatrixSign", "source_license": null, "theorem_names": ["MatrixSign"], "statement_sha256": "43b764219058f11a9f1d2eedd6ba74cee896fdfa2434970a0101254b6a391c5b", "task_path": "tasks/rl_align__o_proofs_MatrixSign__43b764219058f11a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_MatrixSign", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_MatrixSumNonneg__5b289a41870d4330", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Matrix\n\n\ntheorem MatrixSumNonneg (m n : ℕ) (hm : 0 < m) (hn : 0 < n)\n (A : Matrix (Fin m) (Fin n) ℝ) :\n ∃ B : Matrix (Fin m) (Fin n) ℝ,\n (∀ i j, B i j = A i j ∨ B i j = -A i j) ∧\n (∀ i, ∑ j : Fin n, B i j ≥ 0) ∧\n (∀ j, ∑ i : Fin m, B i j ≥ 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_MatrixSumNonneg", "source_license": null, "theorem_names": ["MatrixSumNonneg"], "statement_sha256": "5b289a41870d4330266eccfc079409e018d2441561a1c9a65e4c9f7a3333f749", "task_path": "tasks/rl_align__o_proofs_MatrixSumNonneg__5b289a41870d4330", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_MatrixSumNonneg", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Matrix_A_2__003b9c1a909c9c6b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Matrix_A {n : ℕ} {B C : Matrix (Fin n) (Fin n) ℝ}\n (hB : B.det ≠ 0) (hC : C.det ≠ 0) (hAB : (B + C).det ≠ 0)\n (A : Matrix (Fin n) (Fin n) ℝ)\n (hA : A = B⁻¹ * C * (B + C)⁻¹ * B * C⁻¹ * (B + C)) :\n A ^ 2 = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Matrix_A_2", "source_license": null, "theorem_names": ["Matrix_A"], "statement_sha256": "003b9c1a909c9c6b493208dd0525df5296c6f6623774434304630dac239604d0", "task_path": "tasks/rl_align__o_proofs_Matrix_A_2__003b9c1a909c9c6b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Matrix_A_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Matrix_A_3__930e10ca370f90c8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Matrix_A : {A : Matrix (Fin 3) (Fin 3) ℝ | ∀ X : Matrix (Fin 3) (Fin 3) ℝ, (∀ i j : Fin 3, i < j → X i j = 0) → A * X = X * A} =\n {A : Matrix (Fin 3) (Fin 3) ℝ | ∃ c : ℝ, A = c • 1} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Matrix_A_3", "source_license": null, "theorem_names": ["Matrix_A"], "statement_sha256": "930e10ca370f90c8d02ebac936d3dbbca3a7d6677fba639168aa8b53e2f5880e", "task_path": "tasks/rl_align__o_proofs_Matrix_A_3__930e10ca370f90c8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Matrix_A_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Multinom__78a836be13fcd71b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Multinom :\n Set.ncard {x : Fin 4 → ℕ | ∃ e : Fin 4 → ℕ,\n (∀ i, e i ≥ 0) ∧\n (∑ i, e i) = 25 ∧\n x 0 = e 0 ∧\n x 1 = e 1 ∧\n x 2 = e 2 ∧\n x 3 = e 3} = 3276 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Multinom", "source_license": null, "theorem_names": ["Multinom"], "statement_sha256": "78a836be13fcd71beb610f6a6d530b05983b5037aa169b123eeca992961a915c", "task_path": "tasks/rl_align__o_proofs_Multinom__78a836be13fcd71b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Multinom", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Nat_choose_12_5_2__66c6fb1c6312062e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Nat.choose_12_5 : {x : Finset ℕ | x ⊆ Finset.Icc 1 12 ∧ x.card = 5 ∧ ¬(1 ∈ x ∧ 2 ∈ x)}.ncard = Nat.choose 12 5 - Nat.choose 10 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Nat_choose_12_5_2", "source_license": null, "theorem_names": ["Nat.choose_12_5"], "statement_sha256": "66c6fb1c6312062e01554e1cdeb857544a89801c5e287953977f8f5a8315c1b0", "task_path": "tasks/rl_align__o_proofs_Nat_choose_12_5_2__66c6fb1c6312062e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Nat_choose_12_5_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Nat_choose_20_4__a04a35ac4bb1c097", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Nat.choose_20_4 :\n Set.ncard {x : Finset ℕ | x ⊆ Finset.Icc 1 20 ∧ x.card = 4 ∧ ∀ i ∈ x, ¬∃ j ∈ x, j = i + 1} =\n Nat.choose 17 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Nat_choose_20_4", "source_license": null, "theorem_names": ["Nat.choose_20_4"], "statement_sha256": "a04a35ac4bb1c0979db73ae5b1e175ac009414d3ba0e0952b3e2aaee437640c3", "task_path": "tasks/rl_align__o_proofs_Nat_choose_20_4__a04a35ac4bb1c097", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Nat_choose_20_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Nat_choose_sum_111__44b4b46029595938", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem Nat.choose_sum (k : ℕ) (m : ℕ) (n : ℕ) :\n ∑ r ∈ Icc k m, Nat.choose (n + r) n =\n Nat.choose (n + m + 1) (n + 1) - Nat.choose (n + k) (n + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Nat_choose_sum_111", "source_license": null, "theorem_names": ["Nat.choose_sum"], "statement_sha256": "44b4b4602959593892e31e995b61acaa25ef493040b1206e2edc6540d612e2b3", "task_path": "tasks/rl_align__o_proofs_Nat_choose_sum_111__44b4b46029595938", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Nat_choose_sum_111", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Nat_factorial_sum_5__9aef7dd717421928", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem Nat.factorial_sum {n : ℕ} (hn : 0 < n) :\n ∑ i ∈ Icc 1 (n - 1), i * Nat.factorial i = Nat.factorial n - 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Nat_factorial_sum_5", "source_license": null, "theorem_names": ["Nat.factorial_sum"], "statement_sha256": "9aef7dd717421928cbf0022513de4f5a0a6418e75c32fca02904103a122e4f04", "task_path": "tasks/rl_align__o_proofs_Nat_factorial_sum_5__9aef7dd717421928", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Nat_factorial_sum_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_OddF_2__58f4cbd820df9ec0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem OddF (f : ℝ → ℝ) (a : ℝ) (ha : 0 < a) (hodd : ∀ x, f (-x) = -f x)\n (hfint : ∃ y, ∫ x in (-a)..a, f x = y) :\n ∫ x in (-a)..a, f x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_OddF_2", "source_license": null, "theorem_names": ["OddF"], "statement_sha256": "58f4cbd820df9ec0e6721d4ba9ec93e2a3b79945125a067e6543ac279cc95356", "task_path": "tasks/rl_align__o_proofs_OddF_2__58f4cbd820df9ec0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_OddF_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_OddIntegers__a77814915ba0272e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem OddIntegers (n : ℕ) :\n Set.ncard {k | Odd k ∧ k ∈ Finset.Icc 1 n} = ⌈(n / 2 : ℝ)⌉₊ := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_OddIntegers", "source_license": null, "theorem_names": ["OddIntegers"], "statement_sha256": "a77814915ba0272e1fec847ce1591d8aa421424ccc900cd0b0d88afd3fbefcec", "task_path": "tasks/rl_align__o_proofs_OddIntegers__a77814915ba0272e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_OddIntegers", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Philippe_wins__369d195902dede0d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem Philippe_wins : ∃ (Philippe_cards Emmanuel_cards : Finset ℕ),\n (∀ x ∈ Philippe_cards, x ∈ Finset.Icc 1 2018) ∧\n (∀ x ∈ Emmanuel_cards, x ∈ Finset.Icc 1 2018) ∧\n (Philippe_cards ∪ Emmanuel_cards = Finset.Icc 1 2018) ∧\n (Philippe_cards ∩ Emmanuel_cards = ∅) ∧\n (Finset.sum Philippe_cards id % 2 = 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Philippe_wins", "source_license": null, "theorem_names": ["Philippe_wins"], "statement_sha256": "369d195902dede0d5c648b5ca5351bce0c9d7b900afbe3820ef383dcf74f1a0d", "task_path": "tasks/rl_align__o_proofs_Philippe_wins__369d195902dede0d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Philippe_wins", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial337428__437e715ce2e5bc78", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem Polynomial337428 {p : Polynomial ℝ} : ∃ q : Fin 100 → Polynomial ℝ, ∀ x : ℝ, p.eval x = ∑ i : Fin 100, (q i).eval x ^ 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial337428", "source_license": null, "theorem_names": ["Polynomial337428"], "statement_sha256": "437e715ce2e5bc78ba38cec1ff4ea9037941f91aee586e8a0dc8afd06087fd0e", "task_path": "tasks/rl_align__o_proofs_Polynomial337428__437e715ce2e5bc78", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial337428", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_PolynomialComplexRoot_2__704ac161b0451dd5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem PolynomialComplexRoot (a b : ℝ) (p : ℂ → ℂ)\n (h₀ : ∀ x, p x = x ^ 4 + a * x ^ 3 + b * x ^ 2 + a * x + 1)\n (h₁ : p 1 = 0) :\n (∃ z, p z = 0 ∧ z.im ≠ 0) ↔ a ∈ Set.Ioo (-4) 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_PolynomialComplexRoot_2", "source_license": null, "theorem_names": ["PolynomialComplexRoot"], "statement_sha256": "704ac161b0451dd55fc1700a86ae4efdf85ac33ebf1819648331e0faf385b8fe", "task_path": "tasks/rl_align__o_proofs_PolynomialComplexRoot_2__704ac161b0451dd5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_PolynomialComplexRoot_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_PolynomialModPrime__13589efcc8720604", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem PolynomialModPrime {p : ℕ} (hp : Nat.Prime p) :\n (p = 2 ∨ p = 3 ∨ p = 5) → ∃ f g : Polynomial ℤ, f.degree = 2 ∧ g.degree = 2 ∧\n ∀ x : ℤ, x ^ 4 - 2 * x ^ 3 + 3 * x ^ 2 - 2 * x - 5 ≡ (f.eval x) * (g.eval x) [ZMOD p] := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_PolynomialModPrime", "source_license": null, "theorem_names": ["PolynomialModPrime"], "statement_sha256": "13589efcc8720604ddd22e86f81dcf2c09e1cfdf4e02332796f90afa67126466", "task_path": "tasks/rl_align__o_proofs_PolynomialModPrime__13589efcc8720604", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_PolynomialModPrime", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_PolynomialOn__ad79dc3d69c493be", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem PolynomialOn (a b c d : ℝ) (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = a + b * x + c * x ^ 2 + d * x ^ 3)\n (h₁ : |f 0| ≤ 1) (h₂ : |deriv f 0| ≤ 1) (h₃ : |deriv (deriv f) 0| ≤ 1)\n (h₄ : |f 1| ≤ 1 / 2) :\n ∀ x ∈ Set.Icc 0 1, |f x| ≤ 11 / 8 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_PolynomialOn", "source_license": null, "theorem_names": ["PolynomialOn"], "statement_sha256": "ad79dc3d69c493be9a3bd0a2f198addb353e3e6b4ca176089f4373e40b9c8c83", "task_path": "tasks/rl_align__o_proofs_PolynomialOn__ad79dc3d69c493be", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_PolynomialOn", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_PolynomialRoots_2__d214f6eb0b3b22c4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem PolynomialRoots {P : Polynomial ℤ} :\n ¬∃ x : ℤ, P.eval x * P.eval (x ^ 2) * P.eval (x ^ 3) * P.eval (x ^ 4) + 1 = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_PolynomialRoots_2", "source_license": null, "theorem_names": ["PolynomialRoots"], "statement_sha256": "d214f6eb0b3b22c4af02ab664967b20cc46191b0f6b92469592f36c5b02254c5", "task_path": "tasks/rl_align__o_proofs_PolynomialRoots_2__d214f6eb0b3b22c4", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_PolynomialRoots_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_PolynomialSum_13__3ff3fbf3428e8643", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem PolynomialSum (F G : ℝ → ℝ) (hF : F = fun y => 3 * y ^ 2 - y + 1)\n (hFG : ∀ y, F (G y) = 12 * y ^ 4 - 62 * y ^ 2 + 81) :\n ∑ᶠ g ∈ {g | ∃ p : Polynomial ℝ, p.eval 1 = g ∧ (∀ x, F (p.eval x) = 12 * x ^ 4 - 62 * x ^ 2 + 81)}, g = 1 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_PolynomialSum_13", "source_license": null, "theorem_names": ["PolynomialSum"], "statement_sha256": "3ff3fbf3428e86432bb31fd972d546ad2216d6699b79ba8859564ac11ae775d5", "task_path": "tasks/rl_align__o_proofs_PolynomialSum_13__3ff3fbf3428e8643", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_PolynomialSum_13", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_Bounds__241236f9327e710b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial_Bounds {P : Polynomial ℝ} (hP : P.degree = 2)\n (hP1 : |P.eval 1| ≤ 1) (hP2 : |P.eval 0| ≤ 1) (hP3 : |P.eval (-1)| ≤ 1) :\n ∀ x ∈ Set.Icc (-1) 1, |P.eval x| ≤ 5 / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Polynomial_Bounds", "source_license": null, "theorem_names": ["Polynomial_Bounds"], "statement_sha256": "241236f9327e710bfcb09e970b5b01f8c488f0a7e6e39a20c87d7db3e2495249", "task_path": "tasks/rl_align__o_proofs_Polynomial_Bounds__241236f9327e710b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Polynomial_Bounds", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_Root_2__3fb765ce82dc7eb9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial.Root (n : ℕ) (hn : 1 < n) :\n ∃ x : ℚ, x = 1 + 1 / n ∧ ∑ i ∈ Finset.Icc 1 n, i * x ^ (i - 1) = n ^ 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_Root_2", "source_license": null, "theorem_names": ["Polynomial.Root"], "statement_sha256": "3fb765ce82dc7eb9b71ecb6fd260af1c18f40abd83f8c58eda0d21f531904ed7", "task_path": "tasks/rl_align__o_proofs_Polynomial_Root_2__3fb765ce82dc7eb9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_Root_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_arithmeticFunction__f73e7ba204d8498f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem Polynomial.arithmeticFunction {p : Polynomial ℤ} (a b : ℤ) (h : p.eval a * p.eval b = -(a - b)^2) :\n p.eval a + p.eval b = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Polynomial_arithmeticFunction", "source_license": null, "theorem_names": ["Polynomial.arithmeticFunction"], "statement_sha256": "f73e7ba204d8498f02f295bce856ca1106ab389ef9106786f41a85cd845d4479", "task_path": "tasks/rl_align__o_proofs_Polynomial_arithmeticFunction__f73e7ba204d8498f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Polynomial_arithmeticFunction", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_arithmeticFunction_eval__213ed09319000ac3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem Polynomial.arithmeticFunction.eval {P : Polynomial ℤ} (a b : ℤ) (ha : P.eval a * P.eval b = -(a - b)^2) (hab : a ≠ b) :\n P.eval a + P.eval b = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_arithmeticFunction_eval", "source_license": null, "theorem_names": ["Polynomial.arithmeticFunction.eval"], "statement_sha256": "213ed09319000ac3f6e3e8282e822311982eaa259bf5297d7c889743c81f7f56", "task_path": "tasks/rl_align__o_proofs_Polynomial_arithmeticFunction_eval__213ed09319000ac3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_arithmeticFunction_eval", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_degree_2_2__b475e8fe693ba11a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial.degree_2 (P : Polynomial ℝ) (hP : P.degree = 2)\n (hP1 : ‖P.eval 1‖ ≤ 1) (hP2 : ‖P.eval 0‖ ≤ 1) (hP3 : ‖P.eval (-1)‖ ≤ 1) :\n ∀ x ∈ Set.Icc (-1) 1, ‖P.eval x‖ ≤ 5 / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_degree_2_2", "source_license": null, "theorem_names": ["Polynomial.degree_2"], "statement_sha256": "b475e8fe693ba11a8433d66cb01828dc651b789912ac233bb1643dd5bfc323f5", "task_path": "tasks/rl_align__o_proofs_Polynomial_degree_2_2__b475e8fe693ba11a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_degree_2_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_evalComplex_3__a486da3c319ba8be", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial.evalComplex {a b c d : ℝ} (f : ℂ → ℂ) (hf : ∀ x, f x = x ^ 4 + a * x ^ 3 + b * x ^ 2 + c * x + d)\n (h1 : f (2 * .I) = 0) (h2 : f (2 + .I) = 0) : a + b + c + d = 9 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_evalComplex_3", "source_license": null, "theorem_names": ["Polynomial.evalComplex"], "statement_sha256": "a486da3c319ba8bef872117b83950eb60c269cce8e86def070a3c40dddfaf854", "task_path": "tasks/rl_align__o_proofs_Polynomial_evalComplex_3__a486da3c319ba8be", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_evalComplex_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_evalComplex_5__7b2ae18dd5efee05", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial.evalComplex (f : ℂ → ℂ) (hf : f = fun x => x ^ 4 + 2 * x ^ 3 + 5 * x ^ 2 + 4 * x + 1)\n (i ω : ℂ) (hi : i ^ 2 + 1 = 0) (hω : ω ^ 2 + ω + 1 = 0) :\n f (i + ω) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_evalComplex_5", "source_license": null, "theorem_names": ["Polynomial.evalComplex"], "statement_sha256": "7b2ae18dd5efee0567d238722e145d7797bf07597883891b6eaca89d06fbd0e5", "task_path": "tasks/rl_align__o_proofs_Polynomial_evalComplex_5__7b2ae18dd5efee05", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_evalComplex_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_eval_a_b_2__0e9d9ec63b7a6b6e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial.eval_a_b {f : Polynomial ℤ} (hf : ∃ a b, f.eval a = 41 ∧ f.eval b = 49) :\n ∃ c, 2009 ∣ f.eval c := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_eval_a_b_2", "source_license": null, "theorem_names": ["Polynomial.eval_a_b"], "statement_sha256": "0e9d9ec63b7a6b6e5cdd979bf0726cb25cec26df9f15f5f27c929e85ee0d62f5", "task_path": "tasks/rl_align__o_proofs_Polynomial_eval_a_b_2__0e9d9ec63b7a6b6e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_eval_a_b_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_eval_eq_2012__4f68b22b1c96b3bc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial.eval_eq_2012 (f : Polynomial ℤ) (h : ∃ x y z w v : ℤ, x ≠ y ∧ x ≠ z ∧ x ≠ w ∧ x ≠ v ∧ y ≠ z ∧ y ≠ w ∧ y ≠ v ∧ z ≠ w ∧ z ≠ v ∧ w ≠ v ∧ f.eval x = 2012 ∧ f.eval y = 2012 ∧ f.eval z = 2012 ∧ f.eval w = 2012 ∧ f.eval v = 2012) :\n {x : ℤ | f.eval x = 2014}.encard = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Polynomial_eval_eq_2012", "source_license": null, "theorem_names": ["Polynomial.eval_eq_2012"], "statement_sha256": "4f68b22b1c96b3bc62585da90b60fdafd09531e595639085a0ff02cc4818a4a7", "task_path": "tasks/rl_align__o_proofs_Polynomial_eval_eq_2012__4f68b22b1c96b3bc", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Polynomial_eval_eq_2012", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_eval_eq_zero_3__82d6539d96df495e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem Polynomial.eval_eq_zero {P : Polynomial ℤ} (a b : ℤ)\n (ha : P.eval a ≠ 0) (hb : P.eval b ≠ 0)\n (hab : a ≠ b)\n (h : P.eval a * P.eval b = -(a - b)^2) :\n P.eval a + P.eval b = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_eval_eq_zero_3", "source_license": null, "theorem_names": ["Polynomial.eval_eq_zero"], "statement_sha256": "82d6539d96df495e2ff64652e3342b8965576521291518a2d9fe93a3336cde5e", "task_path": "tasks/rl_align__o_proofs_Polynomial_eval_eq_zero_3__82d6539d96df495e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_eval_eq_zero_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_eval_eq_zero_5__f800235bba5e918c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem Polynomial.eval_eq_zero {P : Polynomial ℤ} (a b : ℤ) (h₀ : a ≠ b)\n (h₁ : P.eval a * P.eval b = -(a - b)^2) :\n P.eval a + P.eval b = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_eval_eq_zero_5", "source_license": null, "theorem_names": ["Polynomial.eval_eq_zero"], "statement_sha256": "f800235bba5e918c25a923776e7601f323dd038718a950f887ce5f23fcbd2d32", "task_path": "tasks/rl_align__o_proofs_Polynomial_eval_eq_zero_5__f800235bba5e918c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_eval_eq_zero_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_eval_five_eq_two__0e0c649e2dd58de3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial.eval_five_eq_two (f : Polynomial ℤ) (a b c d e : ℤ)\n (h₀ : a ≠ b) (h₁ : a ≠ c) (h₂ : a ≠ d) (h₃ : a ≠ e)\n (h₄ : b ≠ c) (h₅ : b ≠ d) (h₆ : b ≠ e) (h₇ : c ≠ d)\n (h₈ : c ≠ e) (h₉ : d ≠ e) (h₁₀ : f.eval a = 2) (h₁₁ : f.eval b = 2)\n (h₁₂ : f.eval c = 2) (h₁₃ : f.eval d = 2) (h₁₄ : f.eval e = 2) :\n ¬∃ k : ℤ, f.eval k = 9 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Polynomial_eval_five_eq_two", "source_license": null, "theorem_names": ["Polynomial.eval_five_eq_two"], "statement_sha256": "0e0c649e2dd58de3664c35a4dd39068ac21e7e652a7290c8a3eb327a8627dbd0", "task_path": "tasks/rl_align__o_proofs_Polynomial_eval_five_eq_two__0e0c649e2dd58de3", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Polynomial_eval_five_eq_two", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_eval_seq__275a4010dc5858e8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial.eval_seq {f : Polynomial ℤ} (a : ℕ → ℤ)\n (h₀ : a 1 = f.eval 0) (h₁ : a 2 = f.eval (a 1))\n (h₂ : ∀ n ≥ 3, a n = f.eval (a (n - 1))) :\n ∃ k ≥ 3, a k = 0 → a 1 = 0 ∨ a 2 = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_eval_seq", "source_license": null, "theorem_names": ["Polynomial.eval_seq"], "statement_sha256": "275a4010dc5858e881747f2242da159ac5187a07f82b7cc3d5b9567d6f111f38", "task_path": "tasks/rl_align__o_proofs_Polynomial_eval_seq__275a4010dc5858e8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_eval_seq", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_factorization_10__cdad63b4ac995484", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial.factorization : (X^3 - 6*X^2 + 6*X - 5 : Polynomial ℤ) =\n (X - 5)*(X^2 - X + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_factorization_10", "source_license": null, "theorem_names": ["Polynomial.factorization"], "statement_sha256": "cdad63b4ac9954841f7d491684fcf02991a8d03a18ffd75d4239baafeb5cdaa1", "task_path": "tasks/rl_align__o_proofs_Polynomial_factorization_10__cdad63b4ac995484", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_factorization_10", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_factorization_15__1d6bc897a70428e6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial.factorization {n : ℕ} :\n (X ^ n - 1 : Polynomial ℚ) =\n (X - 1) * (∑ i ∈ Finset.range n, X ^ i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_factorization_15", "source_license": null, "theorem_names": ["Polynomial.factorization"], "statement_sha256": "1d6bc897a70428e6edc41c81d2eabc2c59f86dc93b0207c30481db6d8c5c6dc6", "task_path": "tasks/rl_align__o_proofs_Polynomial_factorization_15__1d6bc897a70428e6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_factorization_15", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_feval__35499ae8f66edea4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial.feval {f : Polynomial ℤ} (hf : f.degree ≥ 2)\n (hodd : Odd (f.eval 1) ∧ Odd (f.coeff f.natDegree) ∧ Odd (f.coeff 0)) :\n ¬∃ x : ℚ, f.eval (x.num / x.den) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_feval", "source_license": null, "theorem_names": ["Polynomial.feval"], "statement_sha256": "35499ae8f66edea4419997b6b19bab6fa9ce7cd8d20a15700b3321b8d42fbbef", "task_path": "tasks/rl_align__o_proofs_Polynomial_feval__35499ae8f66edea4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_feval", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_prov_2__8ced0152b425ff4f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem Polynomial.prov : ∀ p : Polynomial ℝ, (∀ x : ℝ, (x - 1) * p.eval x + 1 = x * p.eval (x + 1)) → (∀ n : ℕ, p.coeff n = if n = 0 then 1 else 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_prov_2", "source_license": null, "theorem_names": ["Polynomial.prov"], "statement_sha256": "8ced0152b425ff4fb73f35e5cf025316b14ae957f39fd885df57958e2d0e5a08", "task_path": "tasks/rl_align__o_proofs_Polynomial_prov_2__8ced0152b425ff4f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_prov_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_roots_sum_2__cf748e99f2011b41", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Complex Filter Function Metric Finset\nopen scoped BigOperators Topology\n\n\ntheorem Polynomial.roots_sum :\n ¬ (∀ {P : Polynomial ℂ} (hP : P ≠ 0), ∑ᶠ x ∈ P.roots, (x : ℂ).im =\n ∑ᶠ x ∈ P.derivative.roots, (x : ℂ).im) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Polynomial_roots_sum_2", "source_license": null, "theorem_names": ["Polynomial.roots_sum"], "statement_sha256": "cf748e99f2011b417b46b272996e81e8355f3f07cac6e32834b42fa25a3f4853", "task_path": "tasks/rl_align__o_proofs_Polynomial_roots_sum_2__cf748e99f2011b41", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Polynomial_roots_sum_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_roots_sum__d2001bf352f5afc3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial.roots.sum (P : ℝ → ℝ) (A : ℝ) (hP : P = fun x => x^3 - A * x + 15)\n (hroots : ∃ x y z, x ≠ y ∧ y ≠ z ∧ z ≠ x ∧ P x = 0 ∧ P y = 0 ∧ P z = 0 ∧ x + y = 5) :\n |A| = 22 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_roots_sum", "source_license": null, "theorem_names": ["Polynomial.roots.sum"], "statement_sha256": "d2001bf352f5afc3bbf64e584d5de93099f97d47b6a8ceeda46d4528e53f4eb8", "task_path": "tasks/rl_align__o_proofs_Polynomial_roots_sum__d2001bf352f5afc3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_roots_sum", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_roots_toFinset_card_4__6f97cf36aef4b5a8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem Polynomial.roots.toFinset.card {r s : ℂ}\n (hroots : {x : ℂ | 1337 * x ^ 2 - 1337 * x + 666 = 0} = {r, s}) :\n (r ^ 5 + s ^ 5) + 5 * r * s * (r ^ 3 + s ^ 3) + 10 * r ^ 2 * s ^ 2 * (r + s) = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_roots_toFinset_card_4", "source_license": null, "theorem_names": ["Polynomial.roots.toFinset.card"], "statement_sha256": "6f97cf36aef4b5a87ad9e6dd2e5f1d9551a2d8cd8a77496c9a917e547de2a123", "task_path": "tasks/rl_align__o_proofs_Polynomial_roots_toFinset_card_4__6f97cf36aef4b5a8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_roots_toFinset_card_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_roots_toRat__4d423b930947cf12", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial.roots.toRat {P : Polynomial ℤ} (hP : Odd (P.coeff 0)) (hP' : Odd (P.coeff P.natDegree))\n (hP'' : Odd ((P.eval 1))) :\n ¬∃ x : ℚ, P.eval (x.num / x.den) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_roots_toRat", "source_license": null, "theorem_names": ["Polynomial.roots.toRat"], "statement_sha256": "4d423b930947cf12fa045ece731edf0572d788fbf95ef293c4514591fc9f33eb", "task_path": "tasks/rl_align__o_proofs_Polynomial_roots_toRat__4d423b930947cf12", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_roots_toRat", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Polynomial_set_infinite__d43c90d0de80cc1a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Polynomial_set_infinite :\n Set.Infinite {p : Polynomial ℝ | p.degree = 3 ∧ p.eval 7 = 5 ∧ p.eval 15 = 9} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_set_infinite", "source_license": null, "theorem_names": ["Polynomial_set_infinite"], "statement_sha256": "d43c90d0de80cc1ae8d191cbd5fd9b570b824cdea9afd204177ef62d702b32b8", "task_path": "tasks/rl_align__o_proofs_Polynomial_set_infinite__d43c90d0de80cc1a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Polynomial_set_infinite", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_PrimeList_13__4903d48fa485ccd6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem PrimeList (n : Fin 31 → ℕ)\n (h₀ : ∀ i j, i < j → n i < n j)\n (h₁ : 30 ∣ ∑ i, (n i)^4)\n (h₂ : ∀ i, Nat.Prime (n i)) :\n ∃ p q r, p.Prime ∧ q.Prime ∧ r.Prime ∧ p < q ∧ q < r ∧\n ∃ i, n i = p ∧ n (i + 1) = q ∧ n (i + 2) = r := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_PrimeList_13", "source_license": null, "theorem_names": ["PrimeList"], "statement_sha256": "4903d48fa485ccd6263122ffa8685c3718174790c29f3f587e65873dceaf4b7b", "task_path": "tasks/rl_align__o_proofs_PrimeList_13__4903d48fa485ccd6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_PrimeList_13", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_PropTrue__130d0643edca8e54", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem PropTrue :\n ∃ (f : ℝ → ℝ), (f 0 = 0 ∧ f 1 = 1 ∧ DifferentiableOn ℝ f (Set.Icc 0 1) ∧ ∀ x ∈ Set.Icc 0 1, deriv f x > 0 ∧ iteratedDeriv 2 f x < 0) ∧ ∃ c ∈ Set.Ioo (1 / 2) 1, 2 * ∫ x in (0)..1, f x = f c / c := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_PropTrue", "source_license": null, "theorem_names": ["PropTrue"], "statement_sha256": "130d0643edca8e54ec8687d57517bd174d168c6221ca3a9e10a3185577cc2c0a", "task_path": "tasks/rl_align__o_proofs_PropTrue__130d0643edca8e54", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_PropTrue", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_ProveBoundedOn__e4ebb4aa633015d6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem ProveBoundedOn\n (f : ℝ → ℝ)\n (a b : ℝ)\n (h₀ : ∀ x ∈ Set.Icc a b, ∃ L, Tendsto (λ y => f y) (𝓝 x) (𝓝 L))\n : ∃ B, ∀ x ∈ Set.Icc a b, |f x| ≤ B := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ProveBoundedOn", "source_license": null, "theorem_names": ["ProveBoundedOn"], "statement_sha256": "e4ebb4aa633015d6c02f3a3ddae0d5ac5cc07231a48681416bf995c6205148e2", "task_path": "tasks/rl_align__o_proofs_ProveBoundedOn__e4ebb4aa633015d6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ProveBoundedOn", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Prove_222__715fc9fa7207e5a1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem Prove (p : ℕ) [hp : Fact (Nat.Prime p)] :\n ∃ f : ℕ → ℕ,\n (∀ i ∈ Icc 1 (p - 1), f i ∈ Icc 1 (p - 1)) ∧\n (∑ i ∈ Icc 1 (p - 1), f i) ≡ 0 [MOD p] ↔ p > 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Prove_222", "source_license": null, "theorem_names": ["Prove"], "statement_sha256": "715fc9fa7207e5a183549e0b5ecf7f673356f06792e65e0ca890178e35e68adb", "task_path": "tasks/rl_align__o_proofs_Prove_222__715fc9fa7207e5a1", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Prove_222", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Prove_910__75b64b925982d291", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Prove :\n Set.Infinite {(m, n, p, q) : ℕ × ℕ × ℕ × ℕ | m > 0 ∧ n > 0 ∧ p > 0 ∧ q > 0 ∧ (1 / m : ℚ) + (1 / n : ℚ) + (1 / p : ℚ) = 1 / q} ∧\n Set.Infinite {(m, n, p, q) : ℕ × ℕ × ℕ × ℕ | m > 0 ∧ n > 0 ∧ p > 0 ∧ q > 0 ∧ Nat.Coprime m n ∧ Nat.Coprime m p ∧ Nat.Coprime m q ∧ Nat.Coprime n p ∧ Nat.Coprime n q ∧ Nat.Coprime p q} ∧\n Set.Infinite {(m, n, p, q) : ℕ × ℕ × ℕ × ℕ | m > 0 ∧ n > 0 ∧ p > 0 ∧ q > 0 ∧ Nat.gcd (Nat.gcd m n) (Nat.gcd p q) = 1} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Prove_910", "source_license": null, "theorem_names": ["Prove"], "statement_sha256": "75b64b925982d291bdfb37876b3177b8ff8ddf70b8cac1b508aedccb4ca6a23b", "task_path": "tasks/rl_align__o_proofs_Prove_910__75b64b925982d291", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Prove_910", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_QP_eq_one_implies_not_integer__56fde972988dcf8e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem QP_eq_one_implies_not_integer (P Q : Polynomial ℤ) (a : ℤ)\n (hP_a : a ∈ Polynomial.roots P)\n (hP_a1997 : a + 1997 ∈ Polynomial.roots P)\n (hQ_1998 : Q.eval 1998 = 2000) :\n ∀ x : ℤ, Q.eval (P.eval x) ≠ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_QP_eq_one_implies_not_integer", "source_license": null, "theorem_names": ["QP_eq_one_implies_not_integer"], "statement_sha256": "56fde972988dcf8e3fadebf4e45e695d6f1960a7983ad33af392db3b3db1635b", "task_path": "tasks/rl_align__o_proofs_QP_eq_one_implies_not_integer__56fde972988dcf8e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_QP_eq_one_implies_not_integer", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_QWEN_2__63dd11bae5ae1530", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem QWEN (a : Fin 1953 → ℕ) (h : ∑ i : Fin 1953, a i * 10 ^ i.val ≡ 0 [MOD 27]) :\n ∀ j : Fin 1953, ∑ i : Fin 1953, a (j + i) * 10 ^ i.val ≡ 0 [MOD 27] := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_QWEN_2", "source_license": null, "theorem_names": ["QWEN"], "statement_sha256": "63dd11bae5ae153057675a360bc7d58e6077e35bf90a63ad4696d416eb305449", "task_path": "tasks/rl_align__o_proofs_QWEN_2__63dd11bae5ae1530", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_QWEN_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_QWen_A_456782__5685bad3325c09e3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem QWen_A_456782 {f : Polynomial ℤ} (h : ∀ n > 1, (2^(n-1)-1) ∣ f.eval (2^n - 1)) :\n f.eval 1 = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_QWen_A_456782", "source_license": null, "theorem_names": ["QWen_A_456782"], "statement_sha256": "5685bad3325c09e36616f4767f59ee2b42050442e585b41d78b52ef8ebe37010", "task_path": "tasks/rl_align__o_proofs_QWen_A_456782__5685bad3325c09e3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_QWen_A_456782", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Qwen_167__9858cfe4e35dcdfb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Qwen (a : Fin 4 → ℤ) (ha : ∀ i, 0 < a i) :\n (∏ i, ∏ j, if i < j then (a i - a j) else 1) ≡ 0 [ZMOD 12] := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Qwen_167", "source_license": null, "theorem_names": ["Qwen"], "statement_sha256": "9858cfe4e35dcdfb1753c0018828d112efe5b58add6f977631c555c61742b646", "task_path": "tasks/rl_align__o_proofs_Qwen_167__9858cfe4e35dcdfb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Qwen_167", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_RealInt_26__5b7e4d6c2903f67d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem RealInt :\n ∫ x in (0)..1, (2 * x + 3) = 4 ∧\n ∫ x in (Real.exp 1)..(Real.exp 3), (1 / x) = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_RealInt_26", "source_license": null, "theorem_names": ["RealInt"], "statement_sha256": "5b7e4d6c2903f67d76c719619bca0a84f87b6dec9053bd5e4bf28bb44e476805", "task_path": "tasks/rl_align__o_proofs_RealInt_26__5b7e4d6c2903f67d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_RealInt_26", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_RealPrimitive__9180005b9cb49467", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem RealPrimitive (f : ℝ → ℝ) (hf : Differentiable ℝ f)\n (hfnz : ∀ x, f x ≠ 0) (F : ℝ → ℝ) (hF : Differentiable ℝ F)\n (hF1 : ∀ x, deriv F x = f x) (hF2 : F 0 = 0) :\n ∃ c ∈ Set.Ioo 0 1, |1 - F c / f c| < 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_RealPrimitive", "source_license": null, "theorem_names": ["RealPrimitive"], "statement_sha256": "9180005b9cb49467e7c9ac32efa53750e780fa8e68dda18eb52c0cdc413f7098", "task_path": "tasks/rl_align__o_proofs_RealPrimitive__9180005b9cb49467", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_RealPrimitive", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_RealSet_ncard_9__6543f4f9abb3b4cc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem RealSet.ncard {f g : ℝ → ℝ × ℝ}\n (hf : f = fun t => (2 + t, -1 - t)) (hg : g = fun α => (3 * Real.cos α, 3 * Real.sin α)) :\n Set.ncard {x | ∃ t α, x = f t ∧ x = g α} = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_RealSet_ncard_9", "source_license": null, "theorem_names": ["RealSet.ncard"], "statement_sha256": "6543f4f9abb3b4cc47bc8c6a99d23bad5edddff7c343811fa0f2ce5bb8e5935a", "task_path": "tasks/rl_align__o_proofs_RealSet_ncard_9__6543f4f9abb3b4cc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_RealSet_ncard_9", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_RealSolutions_101__ccfa6a4a6ed16764", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem RealSolutions (S : Set ℝ) (hS : S = {x | 2 < x ^ 2 ∧ x ^ 2 < 3 ∧ Int.fract (x ^ 2) = Int.fract (1 / x ^ 2)}) :\n S.ncard = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_RealSolutions_101", "source_license": null, "theorem_names": ["RealSolutions"], "statement_sha256": "ccfa6a4a6ed1676400df6208b9d6a814309dd25f575d5c9a98a4378725972323", "task_path": "tasks/rl_align__o_proofs_RealSolutions_101__ccfa6a4a6ed16764", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_RealSolutions_101", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_RealSum_118__19865875e4aabcc3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem RealSum (s : Set ℝ) (hs : s = {x | ∃ y z, x + y = 15 ∧ x * y + z = 74 ∧ x * z = 120}) :\n ∑ᶠ x ∈ s, x = 15 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_RealSum_118", "source_license": null, "theorem_names": ["RealSum"], "statement_sha256": "19865875e4aabcc3de162975728f687d5a96b1d2dd09d091999a2758d1388306", "task_path": "tasks/rl_align__o_proofs_RealSum_118__19865875e4aabcc3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_RealSum_118", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_RealSum_166__d528effa9e945eeb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem RealSum (n : ℕ) (hn : 0 < n) (α β : Fin n → ℝ) :\n (∑ i : Fin n, α i ^ 2) * (∑ i : Fin n, β i ^ 2) ≥\n (∑ i : Fin n, α i * β i) ^ 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_RealSum_166", "source_license": null, "theorem_names": ["RealSum"], "statement_sha256": "d528effa9e945eeb2a17d769e014825ea682aa4ccfa85c157753d31f81f16126", "task_path": "tasks/rl_align__o_proofs_RealSum_166__d528effa9e945eeb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_RealSum_166", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_RealSum_47__a3b889e20e61d5a8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem RealSum {n : ℕ} (hn : 0 < n) (u v : Fin n → ℝ) :\n 1 + ∑ i : Fin n, (u i + v i)^2 ≤ (4 / 3) * (∑ i : Fin n, u i^2 + 1) * (∑ i : Fin n, v i^2 + 1) ∧\n (1 + ∑ i : Fin n, (u i + v i)^2 = (4 / 3) * (∑ i : Fin n, u i^2 + 1) * (∑ i : Fin n, v i^2 + 1) ↔\n ∀ i : Fin n, u i = v i ∧ ∑ i : Fin n, u i^2 = 1 / 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_RealSum_47", "source_license": null, "theorem_names": ["RealSum"], "statement_sha256": "a3b889e20e61d5a8169f46373ead182b283b69e8140fad87ac8af6e0f7bf7508", "task_path": "tasks/rl_align__o_proofs_RealSum_47__a3b889e20e61d5a8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_RealSum_47", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Real_cos1_2__35066b9a515f0c02", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Real.cos1 (f : ℝ → ℝ) (hf : f = fun x => Real.cos x * Real.cos (3 * x) * Real.cos (5 * x)) :\n ∫ x in (0)..Real.pi, f x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_cos1_2", "source_license": null, "theorem_names": ["Real.cos1"], "statement_sha256": "35066b9a515f0c02961ec4660d3e5c7803a0c621cc93afaa5feccf8f5f07833c", "task_path": "tasks/rl_align__o_proofs_Real_cos1_2__35066b9a515f0c02", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_cos1_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Real_cos_ne_zero_2__68691b6396cc3eb5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Real.cos_ne_zero (n m : ℕ) (hnm : n ≠ m) :\n ∫ x in (-Real.pi)..Real.pi, Real.cos (n * x) * Real.cos (m * x) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_cos_ne_zero_2", "source_license": null, "theorem_names": ["Real.cos_ne_zero"], "statement_sha256": "68691b6396cc3eb540e573b2cc3e1c1a6f260e7f8eae871d9b92fbaa72845c06", "task_path": "tasks/rl_align__o_proofs_Real_cos_ne_zero_2__68691b6396cc3eb5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_cos_ne_zero_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Real_floor_ceil__d6f37596e1cd43c1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Real.floor.ceil (f g : ℝ → ℝ)\n (hf : ∀ x, f x = ⌊x⌋) (hg : ∀ x, g x = ⌈x⌉) :\n ∀ x, x ∉ Set.range Int.cast → deriv f x = 0 ∧ deriv g x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_floor_ceil", "source_license": null, "theorem_names": ["Real.floor.ceil"], "statement_sha256": "d6f37596e1cd43c123f6c6ae0b1f42f4ed99bb6af7865b5e69c625bae9de33cd", "task_path": "tasks/rl_align__o_proofs_Real_floor_ceil__d6f37596e1cd43c1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_floor_ceil", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Real_integers__b8efe1d580f8277e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Real_integers : ∫ x in (0)..(Real.pi / 2), Real.sin x ^ 2 = Real.pi / 4 ∧\n ∫ x in (0)..(Real.pi / 2), Real.cos x ^ 2 = Real.pi / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_integers", "source_license": null, "theorem_names": ["Real_integers"], "statement_sha256": "b8efe1d580f8277e9f1fb8b69ef758cb2847f93077fe531ba1b05ce428204fd9", "task_path": "tasks/rl_align__o_proofs_Real_integers__b8efe1d580f8277e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_integers", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Real_roots_14__426e33b7f0354451", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Real_roots (a b : ℝ) (f : ℝ → ℝ) (hf : f = fun x => 3 * x ^ 2 + 2 * a * x + b)\n (h : ∫ x in (-1)..1, abs (f x) < 2) :\n ∃ x y, x ≠ y ∧ f x = 0 ∧ f y = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_roots_14", "source_license": null, "theorem_names": ["Real_roots"], "statement_sha256": "426e33b7f0354451add1289d0de4cc69a4fc5493fdb39401bf0e18f452b30450", "task_path": "tasks/rl_align__o_proofs_Real_roots_14__426e33b7f0354451", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_roots_14", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Real_sin_41__da6a546d7a9d5c27", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Real.sinθ : ∫ θ in (0)..(Real.pi / 3), Real.cos θ ^ 2 * Real.sin θ ^ 4 = Real.pi / 48 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Real_sin_41", "source_license": null, "theorem_names": ["Real.sinθ"], "statement_sha256": "da6a546d7a9d5c2798d6b3317362d42297520c9156d4076f191f1d766bcfba34", "task_path": "tasks/rl_align__o_proofs_Real_sin_41__da6a546d7a9d5c27", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Real_sin_41", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Real_sqrt_ineq_37__27e50af0ebd4c1f1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Real.sqrt_ineq :\n Set.ncard {n : ℕ | 0 < n ∧ 2000 < Real.sqrt (n * (n - 1)) ∧ Real.sqrt (n * (n - 1)) < 2005} = 5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_sqrt_ineq_37", "source_license": null, "theorem_names": ["Real.sqrt_ineq"], "statement_sha256": "27e50af0ebd4c1f1e2f47a8732f8d9660d7ff405eb446758148c3239656c84e1", "task_path": "tasks/rl_align__o_proofs_Real_sqrt_ineq_37__27e50af0ebd4c1f1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_sqrt_ineq_37", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Real_to_499__8a5b90b136ad68c4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem Real_to_499 :\n Set.ncard {n : ℤ | ∃ a b : ℝ, 4/2001 < a/(a+b) ∧ a/(a+b) < 5/2001 ∧ n = b/a} = 100 ∧\n IsGreatest {n : ℤ | ∃ a b : ℝ, 4/2001 < a/(a+b) ∧ a/(a+b) < 5/2001 ∧ n = b/a} 499 ∧\n IsLeast {n : ℤ | ∃ a b : ℝ, 4/2001 < a/(a+b) ∧ a/(a+b) < 5/2001 ∧ n = b/a} 400 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_to_499", "source_license": null, "theorem_names": ["Real_to_499"], "statement_sha256": "8a5b90b136ad68c4c34e5d3ecf82e5de530ab587c72ae050a15ed025a7544328", "task_path": "tasks/rl_align__o_proofs_Real_to_499__8a5b90b136ad68c4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Real_to_499", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_S_12__c0667ab602169d21", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem S_12 (f : ℝ → ℝ)\n (h₀ : ∀ x, x ≤ 1 → f x = 3 - x^3)\n (h₁ : ∀ x, x > 1 → f x = x^2) :\n ∫ x in Set.Icc (-1) 1, f x = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_S_12", "source_license": null, "theorem_names": ["S_12"], "statement_sha256": "c0667ab602169d21baeae382105f437049613d92d12d24d870c015641c13ba85", "task_path": "tasks/rl_align__o_proofs_S_12__c0667ab602169d21", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_S_12", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Solution_23__aabe61a5ec1aa805", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\ntheorem Solution (f : ℕ → ℕ) (h₀ : ∀ n > 0, f n = ((n + 3).gcd n) - 1) :\n ∑ i ∈ Icc 1 1990, f i = 1326 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Solution_23", "source_license": null, "theorem_names": ["Solution"], "statement_sha256": "aabe61a5ec1aa8053e6f84468b49c127d0a867c6b8ab07c2394d01340d46ac7f", "task_path": "tasks/rl_align__o_proofs_Solution_23__aabe61a5ec1aa805", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Solution_23", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Stewart__e9ec1da6e7583451", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem Stewart (A B C M : EuclideanSpace ℝ (Fin 2))\n (h₀ : ¬Collinear ℝ {A, B, C})\n (h₁ : M ∈ segment ℝ B C) :\n dist A M ^ 2 * dist B C = dist A B ^ 2 * dist M C + dist A C ^ 2 * dist M B -\n dist B C * dist B M * dist C M := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Stewart", "source_license": null, "theorem_names": ["Stewart"], "statement_sha256": "e9ec1da6e7583451b182a0a95af16823f9e3ccda8d4249afd11ab93875093c23", "task_path": "tasks/rl_align__o_proofs_Stewart__e9ec1da6e7583451", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Stewart", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_TendstoV__20437fd2eacd4a25", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem TendstoV (v : ℕ → ℝ)\n (h₀ : ∀ n, 1 < n → v n > 1)\n (h₁ : ∀ n, 1 < n → 3 * (v n)^n * Real.exp (- (v n)^2) - 1 = 0) :\n Tendsto v atTop atTop := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_TendstoV", "source_license": null, "theorem_names": ["TendstoV"], "statement_sha256": "20437fd2eacd4a2539b97a3caa211aac8706bfdbd56509c515ead127103dd59e", "task_path": "tasks/rl_align__o_proofs_TendstoV__20437fd2eacd4a25", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_TendstoV", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1046__1d97d259219ac7c3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (x₀ : ℝ) (hf : DifferentiableAt ℝ f x₀) :\n Tendsto (λ h => (f (x₀ + h) - f (x₀ - h)) / (2 * h)) (𝓝[≠] 0) (𝓝 (deriv f x₀)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1046", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "1d97d259219ac7c3e2dd4508a5eaac927cc9c78a472c92f9b407b2afa755532a", "task_path": "tasks/rl_align__o_proofs_Tendsto_1046__1d97d259219ac7c3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1046", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1083__6d5604528d1fb3f1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℕ → ℝ) (ha : ∀ n, a n = (1 / n) ^ 2) :\n ∑' n, a n = Real.pi ^ 2 / 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1083", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "6d5604528d1fb3f1cf7213fa702992343645085d676b01284214ac582cedd17b", "task_path": "tasks/rl_align__o_proofs_Tendsto_1083__6d5604528d1fb3f1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1083", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1165__528e8cffa509a012", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ x, x ≠ 0 → f x = (Real.exp x - Real.log (Real.exp 1 + x)) / (x^3 - 2 * x)) :\n Tendsto f (𝓝[≠] 0) (𝓝 ((1 / 2) * (1 / Real.exp 1 - 1))) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1165", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "528e8cffa509a01292947a0e75e462b5e0be185f1f456dc0765eccd1dc5345c8", "task_path": "tasks/rl_align__o_proofs_Tendsto_1165__528e8cffa509a012", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1165", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1236__0cc90afdca6ab553", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℕ → ℝ) (ha : ∀ n, 0 < a n)\n (r : ℝ) (hr : r < 1) (h : Tendsto (λ n => a (n + 1) / a n) atTop (𝓝 r)) :\n Tendsto a atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1236", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "0cc90afdca6ab553f68140dc30ec55bf9f84d1066872ad8e70001bd24315cb1d", "task_path": "tasks/rl_align__o_proofs_Tendsto_1236__0cc90afdca6ab553", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1236", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1252__0e84981bee388f29", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℕ → ℝ)\n (h₀ : a 1 = 5)\n (h₁ : ∀ n ≥ 1, a (n + 1) = (5 * a n + 4) / (a n + 2)) :\n Tendsto a atTop (𝓝 4) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1252", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "0e84981bee388f2904d3cc8c0a4d6806a4a5230d95d8a83e607e2739a72f0e22", "task_path": "tasks/rl_align__o_proofs_Tendsto_1252__0e84981bee388f29", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1252", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1266__226067170aadad70", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (θ : ℚ) (a : ℕ → ℝ)\n (ha : ∀ n, a n = Real.sin ((Nat.factorial n) * Real.pi * θ)) :\n Tendsto a atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1266", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "226067170aadad70b2014da3407e696c2b4be17575a82d4d3f81966aaa6b06b8", "task_path": "tasks/rl_align__o_proofs_Tendsto_1266__226067170aadad70", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1266", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_128__f300adbac1950479", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped BigOperators Topology\n\n\ntheorem Tendsto (a : ℕ → ℝ)\n (ha : ∀ j, a j = -((2 * j - 3) * (j - 3)) / ((5 * j - 8) * (4 * j + 1))) :\n ¬ Summable a := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_128", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "f300adbac1950479e271ca95397e6bf01805fb13fcba18b38256b09a7fd604a7", "task_path": "tasks/rl_align__o_proofs_Tendsto_128__f300adbac1950479", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_128", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1294__c9bf287d0d526b77", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (I : ℕ → ℝ)\n (hI : ∀ n, I n = ∫ x in (0)..n, x^n * Real.arctan (x^(1/n))) :\n Tendsto (λ n => I n / n^n) atTop (𝓝 (Real.pi/4)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1294", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "c9bf287d0d526b77c3511073e9930496ecc2d18a08dc3e9a25c8bd1b7b3f9699", "task_path": "tasks/rl_align__o_proofs_Tendsto_1294__c9bf287d0d526b77", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1294", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1314__9ca91717f21067e5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℤ) (hf : ∀ x, f x = ⌊1 / x⌋) :\n Tendsto (λ x => x * f x) (𝓝[≠] 0) (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1314", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "9ca91717f21067e5788c77664c221fa40bed785875cdcd15db9b872522c4f0e4", "task_path": "tasks/rl_align__o_proofs_Tendsto_1314__9ca91717f21067e5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1314", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1336__7bf038fa518c6c10", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = Real.cos (Real.pi * Real.sqrt (4 * n ^ 2 - 3 * n))) :\n Tendsto f atTop (𝓝 (-Real.sqrt 2 / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1336", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "7bf038fa518c6c10657ac2307b656c3bf0c7a5fef64a8aa458ff90c9fbd679b5", "task_path": "tasks/rl_align__o_proofs_Tendsto_1336__7bf038fa518c6c10", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1336", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1347__687a194e4c6356af", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto {f : ℝ → ℝ}\n (hf : DifferentiableOn ℝ f (Set.Ioi 0))\n (hM : ∃ M > 0, ∀ x ∈ Set.Ioi 0, |x * deriv f x * Real.log x - f x| ≤ M * x * (Real.log x)^2) :\n Tendsto f (𝓝[≠] 1) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1347", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "687a194e4c6356af590bee8fe8a08c21409d1cd41cc3ac0792b768cda6964a51", "task_path": "tasks/rl_align__o_proofs_Tendsto_1347__687a194e4c6356af", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1347", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1383__78889df84555e857", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => (x ^ 4 - 16) / (x - 2)) :\n Tendsto f (𝓝[≠] 2) (𝓝 32) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1383", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "78889df84555e857492375e30c2f4bc09d2166ca7be80be130174afea582031b", "task_path": "tasks/rl_align__o_proofs_Tendsto_1383__78889df84555e857", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1383", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1387__b1522fe0eaf244cb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = n * Real.log ((Real.log (n + 1)) / (Real.log n))) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1387", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "b1522fe0eaf244cb3aff3eac7223fd182ee5dcc1c30679e0773331ecff562e95", "task_path": "tasks/rl_align__o_proofs_Tendsto_1387__b1522fe0eaf244cb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1387", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1391__c9905c3d6713a515", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (a : ℝ) (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = (sin (a + x) * sin (a + 2 * x) - sin a ^ 2) / x) :\n Tendsto f (𝓝[≠] 0) (𝓝 (3 * sin a * cos a)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1391", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "c9905c3d6713a5152591f8c06b9e1a3a22061aaed09b3d04e2f1ad777ac820fb", "task_path": "tasks/rl_align__o_proofs_Tendsto_1391__c9905c3d6713a515", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1391", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1400__1f903861b054e1de", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => (1 / x) * (1 / Real.sqrt (1 + x) - 1)) :\n Tendsto f (𝓝[≠] 0) (𝓝 (-1 / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1400", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "1f903861b054e1de787379965299354a0aed3e7999590361bdd0cabe969b719a", "task_path": "tasks/rl_align__o_proofs_Tendsto_1400__1f903861b054e1de", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1400", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1417__507996dee621638e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : f = λ x => ((3 * x - 5) / x) * (6 + 2 / x)) :\n Tendsto f atTop (𝓝 18) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1417", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "507996dee621638e227745692095c6e2759dbd0179596c364778934e2f1a5ef5", "task_path": "tasks/rl_align__o_proofs_Tendsto_1417__507996dee621638e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1417", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1468__589634d3496956f5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (x : ℕ → ℝ) (hx : ∃ L, Tendsto x atTop (𝓝 L))\n (f : ℝ → ℝ) (hf : UniformContinuousOn f (Set.univ : Set ℝ)) :\n ∃ y, Tendsto (λ n => f (x n)) atTop (𝓝 y) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1468", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "589634d3496956f5b888d050778313ff6da5b102771459564e52a1050971a815", "task_path": "tasks/rl_align__o_proofs_Tendsto_1468__589634d3496956f5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1468", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_147__f8491a3685749773", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (s : ℕ → ℝ) (h₀ : ∀ n, s n = Real.sqrt (4 * n ^ 2 + n) - 2 * n)\n (ε : ℝ) (h₁ : ε > 0) :\n ∃ N, ∀ n, N ≤ n → |s n - 1 / 4| < ε := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_147", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "9663eac802fb47a26db8bc45550c9e096c9686e5b96da7577e10976cb9a518d1", "task_path": "tasks/rl_align__o_proofs_Tendsto_147__f8491a3685749773", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_147", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_153__da99c3c2e2422f72", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => x - Real.log (Real.cosh x)) :\n Tendsto f atTop (𝓝 (Real.log 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_153", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "da99c3c2e2422f729444ae99c1aa0b26ac36a61b3cbca28c00eb3eb61c74ba17", "task_path": "tasks/rl_align__o_proofs_Tendsto_153__da99c3c2e2422f72", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_153", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1542__98264b0df4e4dc83", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : DifferentiableOn ℝ f (Set.Ioi 0))\n (a b : ℝ) (ha : Tendsto f atTop (𝓝 a)) (hb : Tendsto (deriv f) atTop (𝓝 b))\n (hc : a ≠ 0) : b = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1542", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "98264b0df4e4dc833a55f84bfedb74db22c89059c06494ef2c70b0178187b803", "task_path": "tasks/rl_align__o_proofs_Tendsto_1542__98264b0df4e4dc83", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1542", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1551__94566eb954a40524", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => x ^ 2 * (Real.cos (1 / x) - Real.cos (3 / x))) :\n Tendsto f (𝓝[≠] 0) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1551", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "94566eb954a40524e5db13f2ef3736ad2140e5d2f895540b588a34321fbadeec", "task_path": "tasks/rl_align__o_proofs_Tendsto_1551__94566eb954a40524", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1551", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1555__d2e813d2907722c7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (x : ℕ → ℝ)\n (hx1 : x 1 = 1)\n (hxn : ∀ n ≥ 1, x (n + 1) = Real.sqrt (1 + n * x n)) :\n Tendsto (λ n => x n / n) atTop (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1555", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "d2e813d2907722c72801d41756c784c99c7b871e758662c873d6191273850878", "task_path": "tasks/rl_align__o_proofs_Tendsto_1555__d2e813d2907722c7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1555", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_161__99b86185769e47a6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => Real.log (Real.cos x) / x) :\n Tendsto f (𝓝[≠] 0) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_161", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "99b86185769e47a60e4105e451fe30ab3738638c9c09002c9487fc19dea44bce", "task_path": "tasks/rl_align__o_proofs_Tendsto_161__99b86185769e47a6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_161", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1620__ddc8df69341dc79a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = ((n + 1)^3 - (n - 1)^3) / ((n + 1)^2 - (n - 1)^2)) :\n Tendsto f atTop atTop := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1620", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "ddc8df69341dc79a0ac3a4dd520d0f1d0ced98c259c7a2048d12ace9a772ded0", "task_path": "tasks/rl_align__o_proofs_Tendsto_1620__ddc8df69341dc79a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1620", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1622__a68878b86ecb7def", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ t, f t = ∫ x in (t)..(t^3), Real.sin x / x^(2/3)) :\n Tendsto f (𝓝[<] 0) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1622", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "a68878b86ecb7def6bff3d34f76b457632293c9aa4b9f63d935cbc6e503a2730", "task_path": "tasks/rl_align__o_proofs_Tendsto_1622__a68878b86ecb7def", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1622", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1646__a02b37b13c002a48", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = ((∏ i ∈ range 85, (1 - (i + 1) * x)) - 1) / x) :\n Tendsto f (𝓝[≠] 0) (𝓝 (-3655)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1646", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "a02b37b13c002a48ac760db01cca8a05c02ec19fc99afdad3b744178cb536529", "task_path": "tasks/rl_align__o_proofs_Tendsto_1646__a02b37b13c002a48", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1646", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1653__d23c8a40d9c04323", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = ∏ i ∈ Finset.range n, sin ((i + 1) * π / (2 * n))) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1653", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "d23c8a40d9c043232e0c19ad569a88d300afa60ce1db333cde50053096213304", "task_path": "tasks/rl_align__o_proofs_Tendsto_1653__d23c8a40d9c04323", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1653", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1656__3f05837db21c1c7f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (hf : ∀ n, f n = (n^4 + 1)^(1 / 3 : ℝ) / (1 + 2 * Real.sqrt (n^3 + 1))) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1656", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "3f05837db21c1c7fa22298320e8df03d9d186a6d5ea8cd3e703a5ece2188e6d5", "task_path": "tasks/rl_align__o_proofs_Tendsto_1656__3f05837db21c1c7f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1656", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1666__c95f30c5523aefea", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (lambda : ℝ) (hl : lambda > 1)\n (a : ℕ → ℝ) (ha : ∀ n, a n = Real.log (2 * ⌊lambda ^ n⌋ + 1) / n) :\n Tendsto a atTop (𝓝 (Real.log lambda)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1666", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "c95f30c5523aefead493762e71357d735383b149db10422c5d359aa614c97238", "task_path": "tasks/rl_align__o_proofs_Tendsto_1666__c95f30c5523aefea", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1666", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1731__7a13f6cfa1faa2cd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (S : ℕ → ℝ)\n (hS : ∀ n, S n = ∑ i ∈ Icc 1 (3 * n - 1), 1 / Real.sqrt (n ^ 2 + i)) :\n Tendsto S atTop (𝓝 3) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1731", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "66cd1cedb0eab497c1033ad618cda0bf9f133738dbeae1637c555a3cb6c8fe22", "task_path": "tasks/rl_align__o_proofs_Tendsto_1731__7a13f6cfa1faa2cd", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1731", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1759__879d7119da787c8b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (c k : ℝ) (hc : c > 0) (hk : k > 0)\n (f : ℕ → ℝ) (hf : f = λ n => c ^ n / (Nat.factorial n) ^ (1 / k)) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1759", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "879d7119da787c8b28dd0e3fa034e80a224b2aaddeb6b78fe85439fd142bdecb", "task_path": "tasks/rl_align__o_proofs_Tendsto_1759__879d7119da787c8b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1759", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1765__5f354443766067b7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (u : ℕ → ℝ)\n (h₀ : u 1 = 5)\n (h₁ : ∀ n, u (n + 1) = 1 / 2 + Real.sqrt ((2 * n + 3) / (n + 1) * u n + 1 / 4)) :\n ∃ L, Tendsto u atTop (𝓝 L) ∧ L = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1765", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "5f354443766067b77c5d71d027329f767916d1ef95cd3e1d83269b87bf97a232", "task_path": "tasks/rl_align__o_proofs_Tendsto_1765__5f354443766067b7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1765", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1773__551bf70d7179dd69", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = (1 + 1 / n ^ n) ^ n) :\n Tendsto f atTop (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1773", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "551bf70d7179dd69e96b04bf8e4a35819aa3bf7cbba5fa1a5286b21419ab5fb9", "task_path": "tasks/rl_align__o_proofs_Tendsto_1773__551bf70d7179dd69", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1773", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1782__2a40cd2a96cfce39", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℕ → ℝ) (hf : ∀ n, f n = (Nat.factorial n) ^ (1 / n : ℝ)) :\n Tendsto f atTop atTop := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1782", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "2a40cd2a96cfce39d5ff8d4f25c0506318964a8670ec1a5b986ba0a1c829df67", "task_path": "tasks/rl_align__o_proofs_Tendsto_1782__2a40cd2a96cfce39", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1782", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1793__63638a0ab72839a3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = n * (2 ^ ((1 : ℝ) / n) - 2 ^ ((1 : ℝ) / (n + 1)))) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1793", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "63638a0ab72839a3d32d7075365f5b844e77e7d643b45c4e7d220c1d4efe294e", "task_path": "tasks/rl_align__o_proofs_Tendsto_1793__63638a0ab72839a3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1793", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1802__87d25ee0c9a426f0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = (arctan x - x) / x ^ 2) :\n Tendsto f (𝓝[>] 0) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1802", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "87d25ee0c9a426f0fb29a0a9a1684dba88429ef75998470fc95a9837888fdf8a", "task_path": "tasks/rl_align__o_proofs_Tendsto_1802__87d25ee0c9a426f0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1802", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1824__6c687be0516c2dfa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ a, 1 < a → f a = ∑' n : ℕ, (-1 : ℝ)^n / a^(n+1)) :\n Tendsto f (𝓝[>] 1) (𝓝 (1/2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1824", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "6c687be0516c2dfa507c596a536543c4f3e258a05c166bea99040c7d96bcf929", "task_path": "tasks/rl_align__o_proofs_Tendsto_1824__6c687be0516c2dfa", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_1824", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_1950__88299a7f328c915b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = -Real.cos (-1 + Real.cos x) / (2 * Real.exp x) * Real.sin x / (Real.exp x - 1)) :\n Tendsto f (𝓝[≠] 0) (𝓝 (-1 / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1950", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "88299a7f328c915bb38dbf6ea894d2b6aebd6ee43034f16077722d308a5c5244", "task_path": "tasks/rl_align__o_proofs_Tendsto_1950__88299a7f328c915b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_1950", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2015__a5c7616d15e2af1d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (k : ℕ) :\n Tendsto (λ x => x * ∑ i ∈ range k, ⌊(i + 1 : ℝ) / x⌋) (𝓝[>] 0) (𝓝 (k * (k + 1) / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2015", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "a5c7616d15e2af1dd25fb82405ee190b53543741171b8eae4fce29766d44a519", "task_path": "tasks/rl_align__o_proofs_Tendsto_2015__a5c7616d15e2af1d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2015", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2035__f268a32b1bd7763b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (a : ℕ → ℝ) (ha : ∀ n, a n = (-1)^n / (log n)^n) :\n Tendsto (λ n => abs (a (n + 1) / a n)) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2035", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "f268a32b1bd7763b04efcc222c51f8f9a6769e85033979f9e1cfad7451ebbed6", "task_path": "tasks/rl_align__o_proofs_Tendsto_2035__f268a32b1bd7763b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2035", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2037__1ce4667583f71676", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = Real.log ((n + 2) / (n + 1)) / Real.log ((n + 1) / n)) :\n Tendsto f atTop (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2037", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "1ce4667583f71676217a252f722a37822b4697dd48891ca586407e14f2868213", "task_path": "tasks/rl_align__o_proofs_Tendsto_2037__1ce4667583f71676", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2037", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2056__62e0ec2e1ad72618", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (h₀ : ∀ x y, f x y = (x ^ 5 - y ^ 7) / (x ^ 4 + y ^ 4)) :\n Tendsto (λ (x, y) => f x y) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2056", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "62e0ec2e1ad726188750f3df02079a0b50f1360ffd66e93f9a3d725e8788bdd1", "task_path": "tasks/rl_align__o_proofs_Tendsto_2056__62e0ec2e1ad72618", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2056", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2066__bc9e6da7d8a5c7a6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = sqrt (abs (sin x - tan x)) * ∫ y in (cos x)..(1 + sin x), exp y) :\n Tendsto f (𝓝[>] 0) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2066", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "bc9e6da7d8a5c7a60569084aee917cb2ca788d75c618ff117432202ec0ac8947", "task_path": "tasks/rl_align__o_proofs_Tendsto_2066__bc9e6da7d8a5c7a6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2066", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2077__3f1609c300062724", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto :\n Tendsto (λ n => Nat.choose (2 * n) (n - 2) * (2 * n)^(2 * n - 4) * (∏ i ∈ Icc 1 n, (2 * n - i + 1)) / (2 * n)^(4 * n)) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2077", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "3f1609c300062724eb56e75075bc2c62d355b41ff9ebf2edca04eeb7720f203a", "task_path": "tasks/rl_align__o_proofs_Tendsto_2077__3f1609c300062724", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2077", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2078__da15c884f2ce895a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = (x + 2) * Real.exp (-1 / (x + 1)) - (x + 1)) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2078", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "da15c884f2ce895a320286ff77d40aa5458d8f5fb994222f580a3839496cd007", "task_path": "tasks/rl_align__o_proofs_Tendsto_2078__da15c884f2ce895a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2078", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2092__59921e1fab94fc06", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = (Real.cos (3 * Real.pi * n / (4 * n + 2))) ^ n) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2092", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "59921e1fab94fc06229d508c29b37a75ba1e26ba6d5f49d9eda8c3e67ac51213", "task_path": "tasks/rl_align__o_proofs_Tendsto_2092__59921e1fab94fc06", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2092", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2100__add167a0c7117cf5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = ((7^(1 / n) + n^(1 / n))^n - 1 / 7^n) / (7^n - n^7)) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2100", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "add167a0c7117cf575cefd6de4865efaf6763080ce9b6d910171a8bdc777a5b7", "task_path": "tasks/rl_align__o_proofs_Tendsto_2100__add167a0c7117cf5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2100", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2162__56c5cb1dbde563c5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => (Real.exp (5 * x) - Real.exp (3 * x)) / (Real.sin (2 * x) - Real.sin x)) :\n Tendsto f (𝓝[≠] 0) (𝓝 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2162", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "56c5cb1dbde563c5eda853c458f0285938be2565700f338e902e53aefb3bdab9", "task_path": "tasks/rl_align__o_proofs_Tendsto_2162__56c5cb1dbde563c5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2162", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2166__2676cc32bfee2f31", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => Real.sin (5 * (x + Real.pi)) / (Real.exp (3 * x) - 1)) :\n Tendsto f (𝓝[≠] 0) (𝓝 (-5 / 3)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2166", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "2676cc32bfee2f319b83afa9c2af1e56f6ca880b19e751d2e369db87e3ee5fdb", "task_path": "tasks/rl_align__o_proofs_Tendsto_2166__2676cc32bfee2f31", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2166", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2180__f8c5e914bedc4fa2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = Real.sin (2 * Real.pi * Real.sqrt (n ^ 2 + n))) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2180", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "f8c5e914bedc4fa27104b210f70c9dd18e23aec05e84429219ecec918a84d9d9", "task_path": "tasks/rl_align__o_proofs_Tendsto_2180__f8c5e914bedc4fa2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2180", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2183__d607df08d1206483", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℝ) (ha : a > 0) :\n Tendsto (λ n => a ^ n / ∏ i ∈ range n, (1 + a ^ (i + 1))) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2183", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "d607df08d120648311e83247050c8cf9ef0e65abc225a5b4655aff50f4073a58", "task_path": "tasks/rl_align__o_proofs_Tendsto_2183__d607df08d1206483", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2183", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2216__dd923381ac0bee5e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => ((x + 1) * sqrt (2 * x + 1) - (x ^ 2 + 2009) * (3 * x + 1) ^ ((1 : ℝ) / 3) + 2008) / x) :\n Tendsto f (𝓝[≠] 0) (𝓝 (-2007)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2216", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "dd923381ac0bee5ea4f5d2a3c713e4989fad9d26058b77da17e658b731c65908", "task_path": "tasks/rl_align__o_proofs_Tendsto_2216__dd923381ac0bee5e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2216", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2219__f7387b7159ecbabe", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => Real.pi / 4 - Real.arctan (2 * x / (2 * x + 1))) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2219", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "f7387b7159ecbabea03ca16e246eb7fd370f77991cea9931e5953683b9044b27", "task_path": "tasks/rl_align__o_proofs_Tendsto_2219__f7387b7159ecbabe", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2219", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2223__b0f653d974d36741", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => sqrt x * (sin x + sqrt x * cos x) / (x * sqrt x - sin (x * sqrt x))) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2223", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "b0f653d974d36741ea3952a2ecd14e342d739e769a6b5386df1d4561fbaba95a", "task_path": "tasks/rl_align__o_proofs_Tendsto_2223__b0f653d974d36741", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2223", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2231__30ba3b4978abaa68", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => Real.sqrt x * (Real.exp (-1 / x) - 1)) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2231", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "30ba3b4978abaa687fc6238ab1a2b7e5508cab0a5898611f50ee75e0b5a91f12", "task_path": "tasks/rl_align__o_proofs_Tendsto_2231__30ba3b4978abaa68", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2231", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2256__1d8d6b251bf4e8cb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℕ → ℝ) (hf : ∀ n, f n = sin (π * sqrt (n ^ 2 + 2 * n))) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2256", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "1d8d6b251bf4e8cba3d41c3edc78baaedb2e5c9dbd5967e4746af8a2fe5d6e98", "task_path": "tasks/rl_align__o_proofs_Tendsto_2256__1d8d6b251bf4e8cb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2256", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2279__b01d15de71354b5b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = (∫ x in (0)..n, x^n * Real.arctan (x^(1 / n))) / n ^ n) :\n Tendsto f atTop (𝓝 (Real.pi / 4)) := by sorry", "target_workspace": {"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"}, "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_Tendsto_2279", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "b01d15de71354b5b7df7b07813686a16b164aae63e623cf0c0987f7ce52fa964", "task_path": "tasks/rl_align__o_proofs_Tendsto_2279__b01d15de71354b5b", "metadata": {"split": "train", "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_Tendsto_2279", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2294__1b776abbad580a2c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = (n ^ 3 + 3 * n) ^ ((1 : ℝ) / 3) - Real.sqrt (n ^ 2 - 2 * n)) :\n Tendsto f atTop (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2294", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "c85d1ca2c266fd7a2b0a6ddfcc34c103d563593ed42ccce5e2df08cdfdf5150a", "task_path": "tasks/rl_align__o_proofs_Tendsto_2294__1b776abbad580a2c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2294", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2316__3a8818b10197bb7e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => (Real.exp (4 * x) - 1) / Real.sin (Real.pi * (x / 2 + 1))) :\n Tendsto f (𝓝[≠] 0) (𝓝 (-8 / Real.pi)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2316", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "3a8818b10197bb7ea0454c7cd96148afa7b38bb0439f6fe118c00d4adf1ddb76", "task_path": "tasks/rl_align__o_proofs_Tendsto_2316__3a8818b10197bb7e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2316", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2329__8f7cca9cdc34810d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℕ → ℝ)\n (ha : ∀ n, a n = (∏ i ∈ range n, (2 * i + 1)) / (∏ i ∈ range n, (2 * i + 2))) :\n Tendsto a atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2329", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "8f7cca9cdc34810dea3e90ccb8cd2eafdf315083124c98958f4580f88423418a", "task_path": "tasks/rl_align__o_proofs_Tendsto_2329__8f7cca9cdc34810d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2329", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2366__cbb4a78a1dad0c90", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℕ → ℝ)\n (ha : ∀ n, a n = Nat.factorial n ^ 3 / Nat.factorial (3 * n)) :\n Tendsto a atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2366", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "cbb4a78a1dad0c901e6961b0d7eb6149a8a970852ce8a4ea1bcc80da60646a86", "task_path": "tasks/rl_align__o_proofs_Tendsto_2366__cbb4a78a1dad0c90", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2366", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2400__b0514d311acc2703", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a b : ℝ) (ha : 0 < a) (hb : 0 < b)\n (f : ℕ → ℝ) (hf : ∀ n, f n = Real.sqrt ((n + a) * (n + b)) - n) :\n Tendsto f atTop (𝓝 ((a + b) / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2400", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "cd4600a0ff0bf0afc6a73a7245bef133c333e0c02a5d4f8485f5c09bfaf6b24c", "task_path": "tasks/rl_align__o_proofs_Tendsto_2400__b0514d311acc2703", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2400", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2422__0172a8df95667006", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => (1 - Real.cos (x ^ 2)) / (1 - x ^ 2 - Real.exp (x ^ 2))) :\n Tendsto f (𝓝[≠] 0) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2422", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "0172a8df9566700658e712908a089df26b1498a6c6328414408d32604c75f4e8", "task_path": "tasks/rl_align__o_proofs_Tendsto_2422__0172a8df95667006", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2422", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2432__d9378a896bda044d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℕ → ℝ)\n (h₀ : a 0 = 1)\n (h₁ : ∀ n, a (n + 1) = a n + 1 / a n) :\n Tendsto a atTop atTop := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2432", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "d9378a896bda044d39fd5c0e5ef79919ba348eea5b826a77f23a474bc8af4e7a", "task_path": "tasks/rl_align__o_proofs_Tendsto_2432__d9378a896bda044d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2432", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2463__7b652f2eba8841a8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a b : ℝ) (m n : ℕ)\n (f : ℝ → ℝ)\n (hf : f = λ x => (1 + a * x) ^ ((1 : ℝ) / m) - (1 + b * x) ^ ((1 : ℝ) / n)) :\n Tendsto (λ x => f x / x) (𝓝[≠] 0) (𝓝 (a / m - b / n)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2463", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "7b652f2eba8841a8c50f8865e75a9412d8a077855c307ccdc68c28db80aab31a", "task_path": "tasks/rl_align__o_proofs_Tendsto_2463__7b652f2eba8841a8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2463", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2528__6e969e30d1d3dccb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℝ) :\n Tendsto (λ x => a * Real.sin (a * x) / (2 * x)) (𝓝[≠] 0) (𝓝 (a * a * Real.cos (a * 0) / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2528", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "6e969e30d1d3dccb22076de728e38e9ca9c6c53afebc50353d0ca150210cfd9a", "task_path": "tasks/rl_align__o_proofs_Tendsto_2528__6e969e30d1d3dccb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2528", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2651__324b3411617dcaab", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => cos (sqrt (x + 1)) - cos (sqrt x)) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2651", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "324b3411617dcaab28fa79ee734cfafac0c882430e8927451075b0aa6448476f", "task_path": "tasks/rl_align__o_proofs_Tendsto_2651__324b3411617dcaab", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2651", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2673__4acdb2c533d00f76", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℂ → ℂ) (hf : f = λ z => (z^2 - z + 1 - I) / (z^2 - 2 * z + 2)) :\n Tendsto f (𝓝[≠] (1 + I)) (𝓝 (1 - 1 / 2 * I)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2673", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "4acdb2c533d00f762cb2c2ed509e89df92d08deed982d20ea7b29f9ba5b65251", "task_path": "tasks/rl_align__o_proofs_Tendsto_2673__4acdb2c533d00f76", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2673", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2696__7d3212b5f200ecb4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => (Real.exp x + Real.exp (-x) - 2) / x^2) :\n Tendsto f (𝓝[≠] 0) (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2696", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "7d3212b5f200ecb42798a0070932e246f422cedde66c751cd6b0382bda8f5850", "task_path": "tasks/rl_align__o_proofs_Tendsto_2696__7d3212b5f200ecb4", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2696", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2798__b9decf160a822224", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (x y : ℕ → ℝ)\n (h₀ : ∀ n, y n = x n + 2 * x (n + 1))\n (h₁ : Tendsto y atTop (𝓝 0)) :\n Tendsto x atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2798", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "b9decf160a82222469c8df2b0f37ccaac1763afefbebac094b48aaf0afdbf40c", "task_path": "tasks/rl_align__o_proofs_Tendsto_2798__b9decf160a822224", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2798", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2832__069aebfab32cf8fb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a k : ℝ) (ha : 0 < a ∧ a ≠ 1) :\n Tendsto (λ h => (a^(k * h) - 1) / (a^h - 1)) (𝓝[≠] 0) (𝓝 k) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2832", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "069aebfab32cf8fb605512b98eec118a1b1da476a3da9ccc7f9535cfc583aef6", "task_path": "tasks/rl_align__o_proofs_Tendsto_2832__069aebfab32cf8fb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2832", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2833__5d63b7170f54163f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (x : ℝ) (hx : 0 ≤ x) :\n Tendsto (λ n => (Real.log (Real.exp n + x ^ n)) / n) atTop (if x ≤ Real.exp 1 then (𝓝 1) else (𝓝 (Real.log x))) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2833", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "5d63b7170f54163f4d0a49ba94e5a8e503c636dfb6cbbc1a9debbd6eb6ec26e6", "task_path": "tasks/rl_align__o_proofs_Tendsto_2833__5d63b7170f54163f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2833", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2857__9df6daa50b41a941", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (x : ℕ → ℝ) (hx : ∀ n, x n = sin n) :\n ¬ ∃ y, Tendsto x atTop (𝓝 y) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2857", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "9df6daa50b41a94150570c7d02270a1d1083da0fe1a6a01938538bc8c1ab215f", "task_path": "tasks/rl_align__o_proofs_Tendsto_2857__9df6daa50b41a941", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2857", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2860__2102162d88c5b7af", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (x : ℕ → ℝ)\n (hx1 : x 1 = 2)\n (hx2 : x 2 = 4)\n (hxn : ∀ n ≥ 2, x (n + 1) = Real.sqrt (x n * x (n - 1))) :\n ∃ L, Tendsto x atTop (𝓝 L) ∧ L = 2 * 4 ^ ((1 : ℝ) / 3) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2860", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "4402ef536ef15b28107f95ce946cce51334cd4d53548a92b8ed9b1bb4b86fd13", "task_path": "tasks/rl_align__o_proofs_Tendsto_2860__2102162d88c5b7af", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2860", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2861__746a1a12d480424d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = (∑ i ∈ range n, (1 / (Real.sqrt (2 * i + 1) + Real.sqrt (2 * i + 3)))) / Real.sqrt n) :\n Tendsto f atTop (𝓝 (Real.sqrt 2 / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2861", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "746a1a12d480424d8084180bfde08ecfff684076bf7ca6b1aa1edcc55fdf7b3e", "task_path": "tasks/rl_align__o_proofs_Tendsto_2861__746a1a12d480424d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2861", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2923__3da53cff25c7ebd1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = n ^ (Nat.factorial n) / (Nat.factorial n) ^ n) :\n Tendsto f atTop atTop := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2923", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "3da53cff25c7ebd11965a50245de59ecd77ab5bf4b817ef6043bb3eccd2a0e6c", "task_path": "tasks/rl_align__o_proofs_Tendsto_2923__3da53cff25c7ebd1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2923", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2932__78713dad96581918", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => (1 - cos x) / sin x) :\n Tendsto f (𝓝[≠] 0) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2932", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "78713dad96581918e9272bfa24bcaecc014d9c080f5afe29536907a24558537a", "task_path": "tasks/rl_align__o_proofs_Tendsto_2932__78713dad96581918", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2932", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2945__e4a2d15a4fb3601d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ x, f x = Real.log (Nat.factorial x) / (x * Real.log x)) :\n Tendsto f atTop (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2945", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "e4a2d15a4fb3601d12547e04f8ef919e5f8e1eca8d836251a5c445ff6555e3d9", "task_path": "tasks/rl_align__o_proofs_Tendsto_2945__e4a2d15a4fb3601d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2945", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2949__54697d47a7fab3f6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = (∏ i ∈ Icc 1 n, i) / ∏ i ∈ Icc (n + 1) (2 * n), i) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2949", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "54697d47a7fab3f6687df4eb9185b6101c3afcd71d2766c819bc6ee055ac20e5", "task_path": "tasks/rl_align__o_proofs_Tendsto_2949__54697d47a7fab3f6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2949", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2961__f45ff74247e65dbb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = Real.sin x / (x * (Real.sin x)^2 + 1)) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2961", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "f45ff74247e65dbb8a7a9eacb4a479da58f5504484f45a6ebff4db13edd1da72", "task_path": "tasks/rl_align__o_proofs_Tendsto_2961__f45ff74247e65dbb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2961", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2969__7b0060e247290d21", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = ∑ i ∈ Icc 0 (Nat.floor (2 * x)), 1 / Real.sqrt (x ^ 2 + i)) :\n Tendsto f atTop (𝓝 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2969", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "7b0060e247290d21175c265aafed2b0ef15ebbe87d9a841f4622ed7b0376e64a", "task_path": "tasks/rl_align__o_proofs_Tendsto_2969__7b0060e247290d21", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2969", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2971__76ae80e269a20798", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = x ^ 2 * log (1 + 1 / x) - x) :\n Tendsto f atTop (𝓝 (-1 / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2971", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "76ae80e269a2079889d177e2fc7aa68211c4e08f3a36484c4095d0851d6c0ec5", "task_path": "tasks/rl_align__o_proofs_Tendsto_2971__76ae80e269a20798", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2971", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2974__71e0c4c73366e3a6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a b : ℝ) (ha : 0 < b) (hb : b ≤ a) :\n Tendsto (λ n => (a ^ n + b ^ n) ^ ((1 : ℝ) / n)) atTop (𝓝 a) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2974", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "71e0c4c73366e3a6d8a4fc5bdcbaa2410da4b31b79f3fbe8e82598082fe3e6ec", "task_path": "tasks/rl_align__o_proofs_Tendsto_2974__71e0c4c73366e3a6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_2974", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2983__3fbbbd8c694ace43", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => Real.sin x / x)\n (h₀ : ∀ x y, Real.sin (x + y) = Real.sin x * Real.cos y + Real.cos x * Real.sin y)\n (h₁ : ∀ x y, Real.cos (x + y) = Real.cos x * Real.cos y - Real.sin x * Real.sin y)\n (h₂ : Real.sin 0 = 0) (h₃ : Real.cos 0 = 1)\n (h₄ : ∀ x, (Real.sin x)^2 + (Real.cos x)^2 = 1)\n (h₅ : Continuous Real.sin) (h₆ : Continuous Real.cos)\n (h₇ : ∃ τ, IsLeast {x | 0 < x ∧ Function.Periodic Real.sin x} τ ∧\n Real.sin (τ / 4) = 1) :\n Tendsto f (𝓝[≠] 0) (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2983", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "3fbbbd8c694ace4302294aa32fe5e7d90e96080a638278ce1cb3ead57a412b2a", "task_path": "tasks/rl_align__o_proofs_Tendsto_2983__3fbbbd8c694ace43", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2983", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_2986__e8f68013d0f56688", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (a : ℕ → ℝ)\n (h₀ : ∀ x, a x = (Nat.factorial x) ^ (1 / x : ℝ)) :\n Tendsto a atTop atTop := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2986", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "e8f68013d0f5668894c721c2a44780e736377fc2363fb96de8a4082f1f6da0c4", "task_path": "tasks/rl_align__o_proofs_Tendsto_2986__e8f68013d0f56688", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_2986", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3013__41e4d34ec18fefeb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a x : ℝ) (ha : 0 < a ∧ a ≠ 1) :\n Tendsto (λ h => (a^(x + h) + a^(x - h) - 2*a^x)/h) (𝓝[≠] 0) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3013", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "41e4d34ec18fefeb3cddb6376cc4fd06dd7d0ebe037ff4548de449391631e924", "task_path": "tasks/rl_align__o_proofs_Tendsto_3013__41e4d34ec18fefeb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3013", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3021__385047263d80048c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => (x * (2 + Real.sin (1 / x)) + 8 * Real.cos x) ^ ((1 : ℝ) / 3)) :\n Tendsto f (𝓝[≠] 0) (𝓝 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3021", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "385047263d80048c300c22ab8d208df7e82a528487eaa9fca93a147aa8615d06", "task_path": "tasks/rl_align__o_proofs_Tendsto_3021__385047263d80048c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3021", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3029__13e6cb46d4075125", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => ((x - 3) / (x - 7)) ^ x) :\n Tendsto f atTop (𝓝 (Real.exp 4)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3029", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "13e6cb46d407512552479f462ed4bd74233b87477720348a162cd89bcdbc68c9", "task_path": "tasks/rl_align__o_proofs_Tendsto_3029__13e6cb46d4075125", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3029", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3053__d787138df5e5e894", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = (∏ i ∈ range n, (n + i + 1)) / (2 * n) ^ (2 * n)) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3053", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "d787138df5e5e8948fc453df26957b7bc4531519dd255675603e3769407d861c", "task_path": "tasks/rl_align__o_proofs_Tendsto_3053__d787138df5e5e894", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3053", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3060__39ad447a30d41814", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (hf : f = λ x y => (x ^ 3 - y ^ 3) / (x ^ 2 + y ^ 2)) :\n Tendsto (λ (x, y) => f x y) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3060", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "39ad447a30d418145630b50f68ccdaa522aa1be22c6ee12d1219ab7e1bd1486a", "task_path": "tasks/rl_align__o_proofs_Tendsto_3060__39ad447a30d41814", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3060", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3067__24b163dd2ea64dfb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = ((Real.sqrt (1 + x ^ 3 / (x + 1)) - x) * Real.log x) / (x * (x ^ (1 / x) - 1) + Real.sqrt x * (Real.log x) ^ 2)) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3067", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "6cc15c39ef4ffd6f4926a06812eb89560128250818c93b5d507962bc7b94397a", "task_path": "tasks/rl_align__o_proofs_Tendsto_3067__24b163dd2ea64dfb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3067", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3090__16812bdcc7431031", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => exp (-1 / x ^ 2) / x) :\n Tendsto f (𝓝[≠] 0) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3090", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "16812bdcc74310314e6e72c7d97488a636faee6957feb108052c7dcb8b6570c9", "task_path": "tasks/rl_align__o_proofs_Tendsto_3090__16812bdcc7431031", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3090", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3091__b6bcb5d2cd05ac02", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (hf : ∀ x y, y ≠ 0 → f x y = Real.sin (x * y) / y)\n (hf' : ∀ x y, y = 0 → f x y = x) :\n Tendsto (λ (x, y) => f x y) (𝓝 ((0, 0) : ℝ × ℝ)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3091", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "b6bcb5d2cd05ac02a4ac7d9b3020cd5b88bbfb1a5e97b0c5b2f9e559a4cd857d", "task_path": "tasks/rl_align__o_proofs_Tendsto_3091__b6bcb5d2cd05ac02", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3091", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3097__0091f529d822e79b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto :\n Tendsto (λ (x, y) => (Real.sin (x ^ 3 + y ^ 3)) / (x ^ 2 + y ^ 2)) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3097", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "0091f529d822e79be4f6f591642b32de70ed42d6d90f7b6a966c02569da20922", "task_path": "tasks/rl_align__o_proofs_Tendsto_3097__0091f529d822e79b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3097", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3100__bfcffb114806cd1b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f g : ℝ → ℝ)\n (h₀ : ∀ x, f (x + 3 / 2) = f x)\n (h₁ : ∀ x, g (x + 1 / 2) = g x)\n (h₂ : Tendsto (λ x => f x / x) (𝓝 0) (𝓝 1))\n (h₃ : Tendsto (λ x => g x / x) (𝓝 0) (𝓝 2)) :\n Tendsto (λ n => f ((3 + √7) ^ n * 3 / 2) / g ((2 + √2) ^ n * 1 / 2)) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3100", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "bfcffb114806cd1b39084c5ca34abf45f998dfcbb6e3f4746c7de50fb7e66d18", "task_path": "tasks/rl_align__o_proofs_Tendsto_3100__bfcffb114806cd1b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3100", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3109__579906a79da20726", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (h₀ : ∀ x y, f x y = (x ^ 5 + y ^ 2) / (x ^ 4 + |y|)) :\n Tendsto (λ (x, y) => f x y) (𝓝 ((0, 0) : ℝ × ℝ)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3109", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "579906a79da2072680d6b931d372717464a4eafa12fca4d6f308c9c706a17ed2", "task_path": "tasks/rl_align__o_proofs_Tendsto_3109__579906a79da20726", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3109", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3132__43bdbe517f23205e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = ∫ x in (-1)..1, x ^ n / (1 + 1 / n)) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3132", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "43bdbe517f23205ebc7b52d3db013541f7fc927cf5656f2584c8c4d17c36b732", "task_path": "tasks/rl_align__o_proofs_Tendsto_3132__43bdbe517f23205e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3132", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3139__c470f759b556e7cc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℕ → ℝ)\n (h₀ : ∀ n, a n = ∏ i ∈ range n, (1 + 1 / 3 ^ (2 ^ i))) :\n Tendsto a atTop (𝓝 (3 / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3139", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "c470f759b556e7ccade53f37d809cc57d9ff53004dc684e653782e7a3749c540", "task_path": "tasks/rl_align__o_proofs_Tendsto_3139__c470f759b556e7cc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3139", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3140__99953925f629a291", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = ((1 + 1 / (n ^ 2)) ^ (n ^ 2) / Real.exp 1) ^ n) :\n Tendsto f atTop (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3140", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "99953925f629a291a154eda1620a2eddc61aa68bf28c558a79be97a20fe0f0f8", "task_path": "tasks/rl_align__o_proofs_Tendsto_3140__99953925f629a291", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3140", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3148__8a4d35a2143a55f3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = x * ∑ i ∈ Finset.range 10, ⌊(i + 1) / x⌋) :\n Tendsto f (𝓝[≠] 0) (𝓝 55) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3148", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "8a4d35a2143a55f301aaf23083da07a39104dbf75804af02a0442941c0847bb6", "task_path": "tasks/rl_align__o_proofs_Tendsto_3148__8a4d35a2143a55f3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3148", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3150__67fe51dcfe4f888c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (h₀ : ∀ x y, (x ≠ 0 ∨ y ≠ 0) → f x y = x * y ^ 3 / (x ^ 2 + y ^ 2))\n (h₁ : f 0 0 = 0) :\n Tendsto (λ (x, y) => f x y) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3150", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "67fe51dcfe4f888cb3e9d2166ea9af16e7ff5875fd0aa5d1fca03d0dcb1d6924", "task_path": "tasks/rl_align__o_proofs_Tendsto_3150__67fe51dcfe4f888c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3150", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3155__3a373d28acad94ce", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (hf : f = λ x y => x ^ 3 * y / (x ^ 2 + y ^ 2) ^ ((3 : ℝ) / 2)) :\n Tendsto (λ (x, y) => f x y) (𝓝 ((0, 0) : ℝ × ℝ)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3155", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "3a373d28acad94ced1298025bc2542350ef9741a0407a694584ed39294751072", "task_path": "tasks/rl_align__o_proofs_Tendsto_3155__3a373d28acad94ce", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3155", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3157__dd180720963d2612", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (h₀ : ∀ x y, f x y = if x ≠ 0 ∧ y ≠ 0 then x * Real.sin (1 / y) + y * Real.sin (1 / x) else 0) :\n Tendsto (λ (x, y) => f x y) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3157", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "dd180720963d26125753e380a75da675e1d89ab93a468a8bfe6f72e11d956112", "task_path": "tasks/rl_align__o_proofs_Tendsto_3157__dd180720963d2612", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3157", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3166__23b4160d4ab478c9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (hf : f = λ x y => x ^ 3 / (x ^ 2 + y ^ 2)) :\n Tendsto (λ p => f (p.1) (p.2)) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3166", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "23b4160d4ab478c9e455c1793cc9ddc6b609a8c16bed86db293a945661d2fc08", "task_path": "tasks/rl_align__o_proofs_Tendsto_3166__23b4160d4ab478c9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3166", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3178__cc0fbcdbe15649b2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (F : ℝ → ℝ → ℝ)\n (hF : F = λ x y => (x ^ 3 + y ^ 3) / (x ^ 2 + y ^ 2)) :\n Tendsto (λ (x, y) => F x y) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3178", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "cc0fbcdbe15649b22eb366af8ee2d23b81f0b84dad806c72e5f894dc98ec1dcb", "task_path": "tasks/rl_align__o_proofs_Tendsto_3178__cc0fbcdbe15649b2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3178", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3183__9e549e78da0b4f32", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (hf : f = λ x y => x * y ^ 4 / (x ^ 2 + y ^ 6)) :\n Tendsto (λ p => f p.1 p.2) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3183", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "9e549e78da0b4f325d05583ccfc70c55302cf5c5b5f4637ec04eaa0904f22c40", "task_path": "tasks/rl_align__o_proofs_Tendsto_3183__9e549e78da0b4f32", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3183", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3185__03d8243ae3f2468e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (a : ℕ → ℝ) (ha : ∀ n, a n = n ^ n / Nat.factorial n) :\n ¬ ∃ L, Tendsto a atTop (𝓝 L) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3185", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "03d8243ae3f2468eadecd7bb170b8ab3aac858125434633b474e3fc5b5870572", "task_path": "tasks/rl_align__o_proofs_Tendsto_3185__03d8243ae3f2468e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3185", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3188__ca1e67bdf94349c4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => ((x + 5) * arctan (x + 5) - (x + 1) * arctan (x + 1))) :\n Tendsto f atTop (𝓝 (2 * π)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3188", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "ca1e67bdf94349c4b0a804d7b6b36eb3216342697366f73395bc15ac4d1839f0", "task_path": "tasks/rl_align__o_proofs_Tendsto_3188__ca1e67bdf94349c4", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3188", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3194__101f2dbe4ca212f7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ) (hf : ∀ n, f n = Real.sin (Real.pi * Real.sqrt (n ^ 2 + n)) ^ 2) :\n Tendsto f atTop (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3194", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "101f2dbe4ca212f718cbafca970abb8542cec35b10458248380ae9d02d7db801", "task_path": "tasks/rl_align__o_proofs_Tendsto_3194__101f2dbe4ca212f7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3194", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3198__f98827f9686d7fcc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a b : ℕ → ℝ)\n (ha : ∀ n, a n = (n ^ 3 + n ^ 2) ^ ((1 : ℝ) / 3))\n (hb : ∀ n, b n = (n ^ 3 + 1) ^ ((1 : ℝ) / 3)) :\n Tendsto (λ n => a n - b n) atTop (𝓝 (1 / 3)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3198", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "f98827f9686d7fcc111fe08a6c91a3eabde513396b8f8c2a636a12e190383845", "task_path": "tasks/rl_align__o_proofs_Tendsto_3198__f98827f9686d7fcc", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3198", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3200__79e009dc4292cc2b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => (Real.log x - Real.sin (Real.pi * x)) / Real.sqrt (x - 1)) :\n Tendsto f (𝓝[>] 1) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3200", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "79e009dc4292cc2b06eb58fb91befc9f9ff2e37f413ece30f7bdd1139aa54320", "task_path": "tasks/rl_align__o_proofs_Tendsto_3200__79e009dc4292cc2b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3200", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3205__b21dc10730a74c9b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (hf : f = λ x y => (x ^ 3 * y - x * y ^ 3) / (x ^ 2 + y ^ 2) ^ ((3 : ℝ) / 2)) :\n Tendsto (λ (x, y) => f x y) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3205", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "b21dc10730a74c9bfc921f0e5071ddcac2db53f4a13263c0527d4712ebc8b5ce", "task_path": "tasks/rl_align__o_proofs_Tendsto_3205__b21dc10730a74c9b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3205", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3208__116e3a0d965eb74e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ α => ∫ x in (0)..(1/α), sin (α*x)) :\n Tendsto f (𝓝[>] 0) atTop := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3208", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "116e3a0d965eb74e0d853924b001271a450129508755f1d0d9af10fcf9637446", "task_path": "tasks/rl_align__o_proofs_Tendsto_3208__116e3a0d965eb74e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3208", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3214__c217931a5b12dd2d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (a : ℕ → ℝ)\n (h₀ : ∀ n, a n = ∏ i ∈ Finset.Icc 2 (n + 1), (1 - 1 / sqrt i)) :\n Tendsto a atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3214", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "c217931a5b12dd2d5f50afd177fedae125823f0e0a6d8318c83c0cf4f69514a2", "task_path": "tasks/rl_align__o_proofs_Tendsto_3214__c217931a5b12dd2d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3214", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3215__7cf022cb16fcd171", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (hf : f = λ x y => x ^ 4 * y ^ 2 / ((x ^ 4 + y ^ 6) * Real.sqrt (x ^ 2 + y ^ 2))) :\n Tendsto (λ (x, y) => f x y) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3215", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "620df8058ce6d120b9d66e17be6285b90207e22170ea7cec48bd93980db02237", "task_path": "tasks/rl_align__o_proofs_Tendsto_3215__7cf022cb16fcd171", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3215", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3268__dd67f4c97595a69a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = (n - (n ^ 5 - 5) ^ ((1 : ℝ) / 3)) * n * Real.sqrt n) :\n Tendsto f atTop atBot := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3268", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "dd67f4c97595a69ab0526c3cbd0fadd835c13313cae511b613b08151c1cdd37d", "task_path": "tasks/rl_align__o_proofs_Tendsto_3268__dd67f4c97595a69a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3268", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3277__119b402e0c82d031", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (b : ℕ → ℝ) (hb : ∃ B, ∀ n, b n ≤ B)\n (hb' : ∀ n, 0 < b n) :\n Tendsto (λ n => |Real.tan (n * Real.pi - Real.pi * Real.sqrt (n ^ 2 + b n))|) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3277", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "119b402e0c82d031546294fa2c0491a0cb76425a5e71f53f0bb247bca37abc36", "task_path": "tasks/rl_align__o_proofs_Tendsto_3277__119b402e0c82d031", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3277", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3282__4d73c143b23537a9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = n / (1 + 1 / n) ^ (n ^ 2)) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3282", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "4d73c143b23537a98326a9373ac3a91c1ac33a9e6646620b2f10901c4f38d164", "task_path": "tasks/rl_align__o_proofs_Tendsto_3282__4d73c143b23537a9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3282", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3286__91e1a37c1447f322", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (hf : f = λ x y => sin (x ^ 2 * y ^ 2) / (x ^ 2 + y ^ 2) ^ (3 / 2)) :\n Tendsto (λ (x, y) => f x y) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3286", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "91e1a37c1447f32217d64a2f72ece14dda68367a73f6b97e5c3e17a8aa3b2a80", "task_path": "tasks/rl_align__o_proofs_Tendsto_3286__91e1a37c1447f322", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3286", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3288__e4c482279b9f2791", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (hf : f = λ x y => (x ^ 3 + y ^ 3) / (x ^ 2 + y ^ 2)) :\n Tendsto (λ (x, y) => f x y) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3288", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "e4c482279b9f27919b709598468c644b2874bcf4e26a0f869e5460c01aa211c4", "task_path": "tasks/rl_align__o_proofs_Tendsto_3288__e4c482279b9f2791", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3288", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_32__f8010a914bd9a0dc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ n, f n = (Real.sin n + (Real.sin (n ^ 2))^2 + (Real.sin (n ^ 3))^3) / n^3) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_32", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "f8010a914bd9a0dcb17e6d288be49e900a5ee1b50ac323c9c924f275d5107959", "task_path": "tasks/rl_align__o_proofs_Tendsto_32__f8010a914bd9a0dc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_32", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3309__ee669ae6894c407d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (x : ℝ) (hx : x > 0)\n (a : ℕ → ℝ) (ha : ∀ n, a n = Real.sqrt n * (Real.sqrt (x - 1 / n) - Real.sqrt x)) :\n Tendsto a atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3309", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "c60cec11c3452f4c1cdfa4c081ddacaed35d415ffe5b89d2210175fbdd258e94", "task_path": "tasks/rl_align__o_proofs_Tendsto_3309__ee669ae6894c407d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3309", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3311__1d7397989139653f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = ((3 * (n + 1) + 4) * (4 ^ (n + 1) + 5) * (5 ^ n + 3)) / ((5 ^ (n + 1) + 3) * (3 * n + 4) * (4 ^ n + 5))) :\n Tendsto f atTop (𝓝 (4 / 5)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3311", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "1d7397989139653f4b3e3bd2570b8929dd35d307fa56a6792a5d045d15985881", "task_path": "tasks/rl_align__o_proofs_Tendsto_3311__1d7397989139653f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3311", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3349__ec7c46ec55bdfe99", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℝ) (ha : 0 < a)\n (x : ℕ → ℝ) (hx1 : x 1 = a)\n (hxn : ∀ n, x (n + 1) = 1 - 1 / (x n + 2)) :\n Tendsto x atTop (𝓝 ((Real.sqrt 5 - 1) / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3349", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "ec7c46ec55bdfe993575d1e12ab7add8f97aee045ff3102230e3b1d4ffa9d6af", "task_path": "tasks/rl_align__o_proofs_Tendsto_3349__ec7c46ec55bdfe99", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3349", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3368__61e70ff59589c6f0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (u : ℕ → ℝ)\n (h₀ : u 1 = 5)\n (h₁ : ∀ n ≥ 1, u (n + 1) = (1 / 2) * u n + (n ^ 2 + n - 2) / (n ^ 3 + 3 * n ^ 2 + 2 * n)) :\n Tendsto (λ n => n * u n) atTop (𝓝 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3368", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "61e70ff59589c6f0dc64651a6bef862419ec20fe1e28b5bb102a66fa1be91787", "task_path": "tasks/rl_align__o_proofs_Tendsto_3368__61e70ff59589c6f0", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3368", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3389__1ac72078abcf71bc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => log (x + 1) - log x) :\n Tendsto (λ n => n * (1 - n * f n)) atTop (𝓝 (1 / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3389", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "1ac72078abcf71bc6cdb393e6a54bd7782a490c9c6db45ff09fb534626ec6fbc", "task_path": "tasks/rl_align__o_proofs_Tendsto_3389__1ac72078abcf71bc", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3389", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3423__134fe2806e066788", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => 1 + x / log (1 - x)) :\n Tendsto f (𝓝[≠] 0) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3423", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "134fe2806e066788828ddce03770471a5ebb7470b07323ae57fb91f55de331fe", "task_path": "tasks/rl_align__o_proofs_Tendsto_3423__134fe2806e066788", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3423", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3510__f5a662e72aa380b0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => ((Real.log (1 + x)) / (6 * x)) ^ (x / (x + 2))) :\n Tendsto f (𝓝[≠] 0) (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3510", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "f5a662e72aa380b08c708115c1e19364628020ef626d0078845134614da3e461", "task_path": "tasks/rl_align__o_proofs_Tendsto_3510__f5a662e72aa380b0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3510", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3518__0d7bf716be78e23b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => ((Real.exp (3 * x) - 1) / x) ^ (Real.cos (Real.pi / 4 + x))^2) :\n Tendsto f (𝓝[≠] 0) (𝓝 (Real.sqrt 3)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3518", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "0d7bf716be78e23b15fe2e4b37d6b99ab06b8f006098d9608d20e705b18a9cb0", "task_path": "tasks/rl_align__o_proofs_Tendsto_3518__0d7bf716be78e23b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3518", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3519__cddce34a7e67cccc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (h₀ : ∀ x y, f x y = x ^ 3 * y / (x ^ 4 + y ^ 2)) :\n Tendsto (λ (x, y) => f x y) (𝓝 ((0, 0) : ℝ × ℝ)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3519", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "cddce34a7e67cccc1888d96df71d9628c17c419960cadf822fc2e37291014493", "task_path": "tasks/rl_align__o_proofs_Tendsto_3519__cddce34a7e67cccc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3519", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3521__b9bef1010f75a6ff", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (hf : f = λ x y => x ^ 2 * y / (x ^ 2 + y ^ 2)) :\n Tendsto (λ (x, y) => f x y) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3521", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "b9bef1010f75a6ffa784598b7548e8b30bed7b497e293e880c8339872a70bdd2", "task_path": "tasks/rl_align__o_proofs_Tendsto_3521__b9bef1010f75a6ff", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3521", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3536__e79cad05a9d61016", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℕ → ℝ) (h : ∀ n, |a (n + 1) - a n| ≤ n ^ 2 / 2 ^ n) :\n ∃ l, Tendsto a atTop (𝓝 l) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3536", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "e79cad05a9d610162ab2745be1454ed7f1550fdd4a0a573f923059eb59f2b9f5", "task_path": "tasks/rl_align__o_proofs_Tendsto_3536__e79cad05a9d61016", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3536", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3544__8188e1d1320d1b64", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (x : ℕ → ℝ)\n (hx0 : x 0 = 2)\n (hxn : ∀ n, x (n + 1) = 6 * x n / (3 + x n)) :\n Tendsto (λ n => (x n - 2)^n) atTop (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3544", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "8188e1d1320d1b6404e845f4dc2033b2b746947bb01327e96c9a650564b1ba64", "task_path": "tasks/rl_align__o_proofs_Tendsto_3544__8188e1d1320d1b64", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3544", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3575__b276a4f9374fc385", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => (1 - cos (4 * x)) / x ^ 2) :\n Tendsto f (𝓝[≠] 0) (𝓝 8) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3575", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "b276a4f9374fc3851e0bb5d1dff9fc4c9fb9098e34f65d64166f8ac25bff35bf", "task_path": "tasks/rl_align__o_proofs_Tendsto_3575__b276a4f9374fc385", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3575", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3629__c8bea9ad393c8ec0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => (1 + Real.sin (3 * x) - Real.cos (3 * x)) / (1 + Real.sin (4 * x) - Real.cos (4 * x))) :\n Tendsto f (𝓝[≠] 0) (𝓝 (3 / 4)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3629", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "c8bea9ad393c8ec03e412967ca6ebaa2089f563a4d5f964108aa2ea0fa524988", "task_path": "tasks/rl_align__o_proofs_Tendsto_3629__c8bea9ad393c8ec0", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3629", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_362__e89d0a3dce9f93e6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => Real.sqrt x - Real.sqrt (x - 1)) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_362", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "c1c7e66b06453322dfe2e72e0fa078f1638d6eaa946a6f68829e185782f4c296", "task_path": "tasks/rl_align__o_proofs_Tendsto_362__e89d0a3dce9f93e6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_362", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3636__87936ee2a37e703e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => sin x / (exp x - 1)) :\n Tendsto f (𝓝[≠] 0) (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3636", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "87936ee2a37e703eb9d0c058a1d3843273085ccd6075650e26ae3c616025231c", "task_path": "tasks/rl_align__o_proofs_Tendsto_3636__87936ee2a37e703e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3636", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3638__703bc5da8ecbfe94", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ) (hf : ∀ n, f n = (1 + 2 ^ n) ^ ((1 : ℝ) / n)) :\n Tendsto f atTop (𝓝 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3638", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "703bc5da8ecbfe9436c55cccbd44af23831a0e57c2d23fa588ac6b6a1ba762ea", "task_path": "tasks/rl_align__o_proofs_Tendsto_3638__703bc5da8ecbfe94", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3638", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3641__e2cd2a61b31f19a4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (a b : ℝ)\n (hf : ContDiff ℝ 1 f)\n (h₁ : Tendsto f atTop (𝓝 a))\n (h₂ : Tendsto (deriv f) atTop (𝓝 b)) :\n b = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3641", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "e2cd2a61b31f19a41038464cff1d32e4c9d0ae0b1f580af10f22e57da69f9100", "task_path": "tasks/rl_align__o_proofs_Tendsto_3641__e2cd2a61b31f19a4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3641", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3648__fbb9c31a68171e00", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto θ : ∀ (θ_seq : ℕ → ℝ), (∀ ε > 0, ∃ N, |θ_seq N - θ| < ε) →\n ∃ (n_seq : ℕ → ℕ), StrictMono n_seq ∧ (∀ ε > 0, ∃ N, |θ_seq (n_seq N) - θ| < ε) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3648", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "fbb9c31a68171e0053ff0dcbf990a7307f82a222545d3c4363c9c05f3f103eff", "task_path": "tasks/rl_align__o_proofs_Tendsto_3648__fbb9c31a68171e00", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3648", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_365__c33d5a86226ddd7a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ) (hf : ∀ n, f n = (24 * n + 17) / (8 * n - 15)) :\n Tendsto f atTop (𝓝 3) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_365", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "c33d5a86226ddd7a641275d050682567e3c56a70a42bdc69cd8a004d4fd4da4f", "task_path": "tasks/rl_align__o_proofs_Tendsto_365__c33d5a86226ddd7a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_365", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3702__b272a27a11d5f52b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => (deriv (λ x => sin (-1 + cos x)) x) / (deriv (λ x => (exp x - 1)^2) x)) :\n Tendsto f (𝓝[≠] 0) =\n Tendsto (λ x => cos (-1 + cos x) * (-sin x) / (2 * (exp x - 1) * exp x)) (𝓝[≠] 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3702", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "b272a27a11d5f52b1d57114d2a5f418226a5c9a4ecd74538808883b441357972", "task_path": "tasks/rl_align__o_proofs_Tendsto_3702__b272a27a11d5f52b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3702", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3945__21f2870c30ca461f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (S : ℕ → ℝ)\n (hS : ∀ n, S n = ∑ i ∈ Finset.range n, arctan (1 / (2 * (i + 1)^2))) :\n Tendsto S atTop (𝓝 (π/4)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3945", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "21f2870c30ca461fd1c01eda457f19d9801139ddc893dca50e5c81e26c63640f", "task_path": "tasks/rl_align__o_proofs_Tendsto_3945__21f2870c30ca461f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3945", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3969__4d31910688316915", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = ∑ i ∈ range n, (1 / Real.sqrt (n ^ 2 + 2 * i + 2))) :\n Tendsto f atTop (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3969", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "4d3191068831691578d8a789eeb6e18252c62b215f6268f800b0d1f1748e7a29", "task_path": "tasks/rl_align__o_proofs_Tendsto_3969__4d31910688316915", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_3969", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3985__9cd192403c143260", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a b : ℝ) (ha : 0 < a) (hb : 0 < b)\n (f : ℝ → ℝ) (hf : f = λ x => ((a ^ x + b ^ x) / 2) ^ (1 / x)) :\n Tendsto f (𝓝[≠] 0) (𝓝 (Real.sqrt (a * b))) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3985", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "9cd192403c14326099a52877df77b206164630ca47a34dc325209b3c14163e95", "task_path": "tasks/rl_align__o_proofs_Tendsto_3985__9cd192403c143260", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3985", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_3994__ea1cd3e40a655b3b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℝ) (ha : 0 < a) :\n Tendsto (λ n => a ^ n / ∏ i ∈ range n, (1 + a ^ (i + 1))) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3994", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "ea1cd3e40a655b3b7832a20739c64aeff8567cf73c4ed9c1c02795b401c41d84", "task_path": "tasks/rl_align__o_proofs_Tendsto_3994__ea1cd3e40a655b3b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_3994", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_435__5ac7e875140c83df", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a b : ℝ) (m n : ℕ) (hm : 0 < m) (hn : 0 < n)\n (f : ℝ → ℝ) (hf : f = λ x => ((a * x + 1) ^ ((1 : ℝ) / m) *\n (b * x + 1) ^ ((1 : ℝ) / n) - 1) / x) :\n Tendsto f (𝓝[≠] 0) (𝓝 (a / m + b / n)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_435", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "5ac7e875140c83df5487240d5a816ccc5f47693bcbb19a4095745a0af87b93e2", "task_path": "tasks/rl_align__o_proofs_Tendsto_435__5ac7e875140c83df", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_435", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_462__2f67f6708d09bd83", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℕ → ℝ)\n (ha : ∀ n, a n = ∑ i ∈ range n, (4 * i + 3) / 2 ^ (i + 1)) :\n Tendsto a atTop (𝓝 3) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_462", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "2f67f6708d09bd83560264549efc1744ad778b839f8cb3202c4699e22e4e9a06", "task_path": "tasks/rl_align__o_proofs_Tendsto_462__2f67f6708d09bd83", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_462", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_463__a8ca1c8846ed3ef3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = ((1 + x) ^ ((1 : ℝ) / 3) - (1 - x) ^ ((1 : ℝ) / 3)) / x) :\n Tendsto f (𝓝[≠] 0) (𝓝 (2 / 3)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_463", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "a8ca1c8846ed3ef3f34c331d0bed22f4a9398eeec10a86a4e2ca76e92413c11e", "task_path": "tasks/rl_align__o_proofs_Tendsto_463__a8ca1c8846ed3ef3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_463", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_471__90c4798c96997037", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ n => Real.log ((n + 1)^2) / n) :\n Tendsto f (𝓝[≠] 0) (𝓝 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_471", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "90c4798c9699703735ea4bc435dc3161b432c6be646988ba79ead8ccc78db192", "task_path": "tasks/rl_align__o_proofs_Tendsto_471__90c4798c96997037", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_471", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_496__9e6aef24fd0ad254", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ)\n (hf : f = λ x => (10^8 * x^5 + 10^6 * x^4 + 10^4 * x^2) / (10^9 * x^6 + 10^7 * x^5 + 10^5 * x^3)) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_496", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "9e6aef24fd0ad2545e9bef2a8bbdd2aee3b6dff0825050346801f2bf8af9dac3", "task_path": "tasks/rl_align__o_proofs_Tendsto_496__9e6aef24fd0ad254", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_496", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_51__5edb14c912e72e5f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℝ) (ha : a > 1)\n (b : ℕ → ℝ) (hb : b = λ n => Real.sqrt ((a ^ 2) ^ n / Nat.factorial n)) :\n Tendsto b atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_51", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "e65d6ea536124a6e7e9bc27c1762524eccd28440758026a95cefb3fcecc12011", "task_path": "tasks/rl_align__o_proofs_Tendsto_51__5edb14c912e72e5f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_51", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_64__410a22bdb19c2f03", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => (3 * x / 4 - 1)) :\n Tendsto f (𝓝[≠] 2) (𝓝 (1 / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_64", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "410a22bdb19c2f03d0ba309bc6e5c77b9b38173bf2f625f20b9164ab0ad7f90a", "task_path": "tasks/rl_align__o_proofs_Tendsto_64__410a22bdb19c2f03", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_64", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_743__67069f375d2016ba", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a b : ℝ) (m n : ℕ) (hmn : m ≠ 0 ∧ n ≠ 0)\n (f : ℝ → ℝ) (hf : f = λ x => ((1 + a * x) ^ ((1 : ℝ) / m) *\n (1 + b * x) ^ ((1 : ℝ) / n) - 1) / x) :\n Tendsto f (𝓝[≠] 0) (𝓝 (a / m + b / n)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_743", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "67069f375d2016bae20ae12805db6656aa2956ccdd406a825a705ace8cb1e4f8", "task_path": "tasks/rl_align__o_proofs_Tendsto_743__67069f375d2016ba", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_743", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_785__b8fce1cfaf038c90", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => (x - 1) * (x + 1) / (x - 1)) :\n Tendsto f (𝓝[≠] 1) (𝓝 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_785", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "b8fce1cfaf038c90faaff8cf3106bfad276064590bf04f31939f791ee03f8fd5", "task_path": "tasks/rl_align__o_proofs_Tendsto_785__b8fce1cfaf038c90", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_785", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_799__b202151212b83c0a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => x ^ 2 / (sqrt (1 + sin x) - sqrt (cos x))) :\n Tendsto f (𝓝[≠] 0) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_799", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "b202151212b83c0af8f31420a3ae3b96c470b11a4cdb8abd6f6a4d360db17b5b", "task_path": "tasks/rl_align__o_proofs_Tendsto_799__b202151212b83c0a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_799", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_811__812f464daba5a6da", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (f : ℝ → ℝ) (hf : f = λ x => log (1 + sin (3 * x)) / x) :\n Tendsto f (𝓝[≠] 0) (𝓝 3) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_811", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "812f464daba5a6da5f67cb64064761f75be14f2b69924ffebbc516cc96ee4d8b", "task_path": "tasks/rl_align__o_proofs_Tendsto_811__812f464daba5a6da", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_811", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_864__70cfd803cfb24bac", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto (a : ℕ → ℝ)\n (ha : ∀ n, a n = ∏ i ∈ Finset.Icc 1 n, (1 - 1 / sqrt (i + 1))) :\n Tendsto a atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_864", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "70cfd803cfb24bac5c65186391856b60aed2598a8396d0a9b565172834594ee7", "task_path": "tasks/rl_align__o_proofs_Tendsto_864__70cfd803cfb24bac", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_864", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_880__0e675354c24c8ceb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = (Real.sin (Real.pi * Real.sqrt (n ^ 2 + n))) ^ 2) :\n Tendsto f atTop (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_880", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "4abd14cea7d2b4cbdc093bf3b8c529914c7c5e3e027e3fe1a3c8f07d7d4215ef", "task_path": "tasks/rl_align__o_proofs_Tendsto_880__0e675354c24c8ceb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_880", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_910__83741326f012b66d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℝ → ℝ → ℝ)\n (h₀ : f = λ x y => x ^ 4 * y ^ 2 / (x ^ 4 + y ^ 6)) :\n Tendsto (λ (x, y) => f x y) (𝓝 (0, 0)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_910", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "83741326f012b66dbf05fc7e9770cf79dc1063372bc2dde1c167b404f7b29fd2", "task_path": "tasks/rl_align__o_proofs_Tendsto_910__83741326f012b66d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_910", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_913__4d097b841185f174", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (a : ℕ → ℝ)\n (ha : ∀ n, a n = (∏ i ∈ range n, (2 * i + 1)) / (∏ i ∈ range n, (2 * i + 2))) :\n Tendsto (λ n => a n / n) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_913", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "4d097b841185f174db9dd6891346cd19aa5083505a5a48f0dfe1c20329e0b7ef", "task_path": "tasks/rl_align__o_proofs_Tendsto_913__4d097b841185f174", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_913", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_920__858cbf6d260d7eed", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = 2 ^ n / ∏ i ∈ Icc 1 n, (1 + 2 ^ i)) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_920", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "858cbf6d260d7eed0c4ea4844178ec048450598d74bd260fbe042d4052003a31", "task_path": "tasks/rl_align__o_proofs_Tendsto_920__858cbf6d260d7eed", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_920", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_947__57b209c7c422cc8b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = n ^ ((-1 : ℝ) / 2 * (1 + 1 / n) * (∏ i ∈ Icc 1 n, (i ^ i)) ^ (1 / n ^ 2))) :\n Tendsto f atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_947", "source_license": null, "theorem_names": ["Tendsto"], "statement_sha256": "57b209c7c422cc8b351d68fc581ddf5c418cabe6bea5ff81247edb8e0f626b97", "task_path": "tasks/rl_align__o_proofs_Tendsto_947__57b209c7c422cc8b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_Tendsto_947", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_a_3__df150433db98753a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Tendsto_a (a : ℕ → ℝ)\n (ha : ∀ k, a k = (-1)^k * k / sqrt ((k + 1) * (k + 2))) :\n ¬ Tendsto (λ k => |a k|) atTop (𝓝 0) → ¬ Summable a := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_a_3", "source_license": null, "theorem_names": ["Tendsto_a"], "statement_sha256": "df150433db98753a06b63c45eabe6df04c88bee2e5908987689701b3f7ba7072", "task_path": "tasks/rl_align__o_proofs_Tendsto_a_3__df150433db98753a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_a_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Tendsto_h__550b8586e078c0ec", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Tendsto_h (h : ℝ → ℝ → ℝ)\n (h_def : ∀ x y, (x ≠ 0 ∨ y ≠ 0) → h x y = (x ^ 2 + y ^ 2 - x ^ 2 * y ^ 2) / (x ^ 2 + y ^ 2 + x ^ 2 * y ^ 2)) :\n Tendsto (λ p => h p.1 p.2) (𝓝[≠] (0, 0)) (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_h", "source_license": null, "theorem_names": ["Tendsto_h"], "statement_sha256": "550b8586e078c0ec078cce0ac0b7a73d8feafe33c1753d0cee480cd1c33aa574", "task_path": "tasks/rl_align__o_proofs_Tendsto_h__550b8586e078c0ec", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Tendsto_h", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Topology_filterReal_20__550cc53b17609d8f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem Topology.filterReal\n (b : ℝ)\n (hb : b > 1)\n (a : ℕ → ℝ)\n (ha : ∀ n, a n = b ^ n / sqrt (Nat.factorial n)) :\n Tendsto a atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Topology_filterReal_20", "source_license": null, "theorem_names": ["Topology.filterReal"], "statement_sha256": "550cc53b17609d8f94e91d428a37105d6222f2d2de9b508d7200698129157e91", "task_path": "tasks/rl_align__o_proofs_Topology_filterReal_20__550cc53b17609d8f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Topology_filterReal_20", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_Topology_filter_422351__d722c4c560a14d0b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem Topology_filter_422351 {f : ℝ → ℝ}\n (hf : ContDiff ℝ 1 f)\n (h : ∃ L, Tendsto (λ x => f x + deriv f x) atTop (𝓝 L))\n (h' : ∃ L, Tendsto (deriv f) atTop (𝓝 L)) :\n Tendsto (deriv f) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Topology_filter_422351", "source_license": null, "theorem_names": ["Topology_filter_422351"], "statement_sha256": "d722c4c560a14d0bed246f3acfcf3f4c3f8c7cafb4483be52bb19e4aefdfe47b", "task_path": "tasks/rl_align__o_proofs_Topology_filter_422351__d722c4c560a14d0b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_Topology_filter_422351", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_USAMO_2017_P1__1ca8823ba12a8dba", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem USAMO_2017_P1 : ∃ (s : Set (ℕ × ℕ)), (∀ p ∈ s, Nat.Coprime p.1 p.2 ∧ p.1 > 1 ∧ p.2 > 1 ∧ p.1 + p.2 ∣ p.1 ^ p.2 + p.2 ^ p.1) ∧ Set.Infinite s := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_USAMO_2017_P1", "source_license": null, "theorem_names": ["USAMO_2017_P1"], "statement_sha256": "1ca8823ba12a8dba6f11118e4e4d82fad2192e08e8e97cd727a75c6b17f3f380", "task_path": "tasks/rl_align__o_proofs_USAMO_2017_P1__1ca8823ba12a8dba", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_USAMO_2017_P1", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_a_b_c_59__fc360fa8707b1783", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem a_b_c :\n IsLeast {n | ∃ a b c : ℕ, 0 < a ∧ 0 < b ∧ 0 < c ∧ Nat.lcm (Nat.lcm a b) c = 60 ∧ Nat.gcd a c = 6 ∧ Nat.gcd a b = 2 ∧ Nat.gcd b c = 4 ∧ n = a + b + c} 38 ∧\n IsGreatest {n | ∃ a b c : ℕ, 0 < a ∧ 0 < b ∧ 0 < c ∧ Nat.lcm (Nat.lcm a b) c = 60 ∧ Nat.gcd a c = 6 ∧ Nat.gcd a b = 2 ∧ Nat.gcd b c = 4 ∧ n = a + b + c} 70 ∧\n Set.ncard {n | ∃ a b c : ℕ, 0 < a ∧ 0 < b ∧ 0 < c ∧ Nat.lcm (Nat.lcm a b) c = 60 ∧ Nat.gcd a c = 6 ∧ Nat.gcd a b = 2 ∧ Nat.gcd b c = 4 ∧ n = a + b + c} = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_a_b_c_59", "source_license": null, "theorem_names": ["a_b_c"], "statement_sha256": "fc360fa8707b1783372f03b7575d88d6013c2d6d75f98a8727e38be3a0f0bfd4", "task_path": "tasks/rl_align__o_proofs_a_b_c_59__fc360fa8707b1783", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_a_b_c_59", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_add_584724__c200d69cb576fbf2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\ntheorem _add_584724 {f : ℝ → ℝ}\n (hf : ContinuousOn f (Set.Icc 0 1))\n (hfd : DifferentiableOn ℝ f (Set.Ioo 0 1)) :\n (∃ a b, ∀ x ∈ Set.Icc 0 1, f x = a * x + b) ∨\n ∃ t ∈ Set.Ioo 0 1, |f 1 - f 0| < |deriv f t| := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_add_584724", "source_license": null, "theorem_names": ["_add_584724"], "statement_sha256": "c200d69cb576fbf292d0106c31303b0289d2ff9f46e29646c82242f592622c7e", "task_path": "tasks/rl_align__o_proofs_add_584724__c200d69cb576fbf2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_add_584724", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra453169__2e54d5b53dceb564", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra453169 {f : ℝ → ℝ} (hf : Differentiable ℝ f)\n (h0 : f 0 = 0) (heq : ∀ h ≠ 0, (∑' n : ℕ, f ((4 * h) / (2 ^ n)) ) / h = 64) :\n deriv f 0 = 8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra453169", "source_license": null, "theorem_names": ["algebra453169"], "statement_sha256": "2e54d5b53dceb564d914b7dd5ba858911e20919c31cde9b737bf2a608cb6ee51", "task_path": "tasks/rl_align__o_proofs_algebra453169__2e54d5b53dceb564", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra453169", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_105179__408131fff4a21175", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_105179 (n : ℕ) (hn : n ≥ 2)\n (a : Fin n → ℝ) (ha : ∀ i, 0 < a i)\n (x : ℝ) (s : ℝ) (hs : s = ∑ i, a i) :\n ∑ i, (x - a i) / (s - a i) = n * x / s ↔ x = s := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_105179", "source_license": null, "theorem_names": ["algebra_105179"], "statement_sha256": "408131fff4a211757709bb7b32073736ec573127f5d6da1bd76caae3f12e4df4", "task_path": "tasks/rl_align__o_proofs_algebra_105179__408131fff4a21175", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_105179", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_10594__938b2c33e8bc7838", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_10594 :\n {(a, b) : ℕ × ℕ | 0 < a ∧ 0 < b ∧\n {x : ℕ | 5 * x - a ≤ 0} ∩ {x : ℕ | 6 * x - b > 0} =\n {2, 3, 4}}.ncard = 30 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_10594", "source_license": null, "theorem_names": ["algebra_10594"], "statement_sha256": "938b2c33e8bc78383a0db3b04d838d09bf289bb57472f7badf67ebf0ec2331e2", "task_path": "tasks/rl_align__o_proofs_algebra_10594__938b2c33e8bc7838", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_10594", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_106918__211a29f18772da7d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem algebra_106918 (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = (1/2)^x + (2/3)^x + (5/6)^x) :\n {x : ℤ | x ≥ 0 ∧ ∃ n : ℤ, f x = n}.ncard = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_106918", "source_license": null, "theorem_names": ["algebra_106918"], "statement_sha256": "211a29f18772da7dc43b5863f92bdf17d70da8d98c8f6511247836d09ba44c42", "task_path": "tasks/rl_align__o_proofs_algebra_106918__211a29f18772da7d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_106918", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_11123_2__321ba3c28055a424", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem algebra_11123 {a : ℕ → ℝ}\n (ha1 : a 1 = 1)\n (han : ∀ n ≥ 2, a n = n / (n ^ 2 - 1)) :\n ∀ n ≥ 1, ∑ k ∈ Icc 1 n, (∏ i ∈ Icc 1 k, a i) = 2 - 2 / (n + 1).factorial := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_11123_2", "source_license": null, "theorem_names": ["algebra_11123"], "statement_sha256": "321ba3c28055a42499e9e043e41474ebda5474337726a05b72459950465df34a", "task_path": "tasks/rl_align__o_proofs_algebra_11123_2__321ba3c28055a424", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_11123_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_114744__8d6b61c57b641f10", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem algebra_114744 {x : ℕ → ℝ} (hx1 : x 1 = 2 / 3)\n (hxn : ∀ n > 0, x (n + 1) = x n / (2 * (2 * n + 1) * x n + 1)) :\n ∑ i ∈ Icc 1 2014, x i = 4028 / 4029 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_114744", "source_license": null, "theorem_names": ["algebra_114744"], "statement_sha256": "8d6b61c57b641f1093e8d6b032ad469ae450149450639a990193c967a045c91a", "task_path": "tasks/rl_align__o_proofs_algebra_114744__8d6b61c57b641f10", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_114744", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_116902__4e24a17f91fdff97", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem algebra_116902 {n : ℕ} (hn : 2 ≤ n) (f : Fin n → ℂ)\n (h₁ : ∀ i, ‖f i‖ = 1) (h₂ : ∑ i, f i = 0) :\n (∀ z, ∑ i, ‖z - f i‖^2 = n * ‖z‖^2 + n) ∧\n (∀ z, ‖z‖ ≤ 1 → ∑ i, ‖z - f i‖ ≤ n * Real.sqrt 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_116902", "source_license": null, "theorem_names": ["algebra_116902"], "statement_sha256": "4e24a17f91fdff9772af3c5d94f061b48c1e8b19f1eced2ab65fba632d80dfcc", "task_path": "tasks/rl_align__o_proofs_algebra_116902__4e24a17f91fdff97", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_116902", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_119662__87848c397e55185d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem algebra_119662 {a : ℕ → ℝ} (ha : ∀ n, a n = a 0 * (-1 / 2) ^ n)\n (ha0 : a 0 = 1536) :\n IsGreatest {∏ i ∈ range n, a i | n > 0} (a 0 * a 1 * a 2 * a 3 * a 4 * a 5 * a 6 * a 7 * a 8 * a 9 * a 10 * a 11) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_119662", "source_license": null, "theorem_names": ["algebra_119662"], "statement_sha256": "87848c397e55185dfd9be8e9f4aa549c0dbadf2b5268f2744e39585944dc5b65", "task_path": "tasks/rl_align__o_proofs_algebra_119662__87848c397e55185d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_119662", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_121084__c69d65ce6a030084", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_121084 {P : Polynomial ℤ} (a b c d : ℤ) (ha : a ≠ b) (hb : a ≠ c)\n (hc : a ≠ d) (hd : b ≠ c) (he : b ≠ d) (hf : c ≠ d) (hP : P.eval a = 5) (hP' : P.eval b = 5)\n (hP'' : P.eval c = 5) (hP''' : P.eval d = 5) : ¬∃ k : ℤ, P.eval k = 8 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_121084", "source_license": null, "theorem_names": ["algebra_121084"], "statement_sha256": "c69d65ce6a030084fffa000b573d4fbfc71de86483b25ed4f5e4610b24b826e9", "task_path": "tasks/rl_align__o_proofs_algebra_121084__c69d65ce6a030084", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_121084", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_123037__b6fb4f2438bbdf87", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_123037 (a : Fin 10 → ℕ) (h₀ : ∑ i, a i = 150)\n (h₁ : ∀ i j, i < j → a i < a j) (h₂ : a 0 ≥ (1 / 2 : ℚ) * a 9) :\n a 5 = 16 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_123037", "source_license": null, "theorem_names": ["algebra_123037"], "statement_sha256": "b6fb4f2438bbdf875cbc6928427c62767f120a69553a21c1a9a45af4d0e9b846", "task_path": "tasks/rl_align__o_proofs_algebra_123037__b6fb4f2438bbdf87", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_123037", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_12436__533ea14104e50de7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Polynomial\n\n\ntheorem algebra_12436 : IsGreatest {n : ℤ | ∃ a b c d : ℤ,\n (5*X^2 + C n*X + 48 : Polynomial ℤ) =\n (C a*X + C b) * (C c*X + C d) } 241 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_12436", "source_license": null, "theorem_names": ["algebra_12436"], "statement_sha256": "533ea14104e50de7a04e5beca7e15c06d72f778203c080a9b30f6ff5896ba544", "task_path": "tasks/rl_align__o_proofs_algebra_12436__533ea14104e50de7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_12436", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_133969__f862c3b2fffea9a2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_133969 (a : ℕ → ℝ) (ha : ∀ n, a (n + 1) = (1 + a n) / (1 - a n)) :\n ∃ z, z ∈ Set.range a ∧ z = 2022 ↔ a 1 = 2022 ∨ a 1 = 2021 / 2023 ∨ a 1 = -1 / 2022 ∨ a 1 = -2023 / 2021 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_133969", "source_license": null, "theorem_names": ["algebra_133969"], "statement_sha256": "f862c3b2fffea9a2105488360fc43fbe71f633af14fa87d881b9ada1a8620562", "task_path": "tasks/rl_align__o_proofs_algebra_133969__f862c3b2fffea9a2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_133969", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_13560__a40d52c36b9dbaf0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_13560 (s : Set ℝ) (hs : s = {r | ∃! x, 2 * x ≠ 0 ∧ 1 / (2 * x) = (r - x) / 7}) :\n ∏ᶠ r ∈ s, r = -14 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_13560", "source_license": null, "theorem_names": ["algebra_13560"], "statement_sha256": "a40d52c36b9dbaf0c4a0240ee74ec30c69c98a6b447cb68a00714ece350b74c4", "task_path": "tasks/rl_align__o_proofs_algebra_13560__a40d52c36b9dbaf0", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_13560", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_14188__3051a9acb44b5233", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\ntheorem algebra_14188 (p1 p2 p3 p4 : (ℕ → ℝ) → Prop)\n (hp1 : ∀ a, p1 a ↔ ∃ d, ∀ n, a (n + 1) = a n + d)\n (hp2 : ∀ a, p2 a ↔ ∀ i ∈ Finset.range 200, 10 ≤ a i)\n (hp3 : ∀ a, p3 a ↔ ∀ i ∈ Finset.range 200, a i ≤ 100)\n (hp4 : ∀ a, p4 a ↔ ∑ i ∈ Finset.range 200, a i = 10000)\n (s : Set ℝ) (hs : s = {x | ∃ a, p1 a ∧ p2 a ∧ p3 a ∧ p4 a ∧ x = a 49})\n (L G : ℝ) (hL : IsLeast s L) (hG : IsGreatest s G) :\n G - L = 8080 / 199 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_14188", "source_license": null, "theorem_names": ["algebra_14188"], "statement_sha256": "3051a9acb44b5233f018e9e27ce5dbcf8980e4afc1d3391e3d894358de4cb085", "task_path": "tasks/rl_align__o_proofs_algebra_14188__3051a9acb44b5233", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_14188", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_142362__3d81b7f5b2c39a10", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem algebra_142362 {a : ℕ → ℝ} (ha : ∀ k, a k = 2 ^ k / (3 ^ (2 ^ k) + 1)) :\n (∑ i ∈ range 10, a i) / (∏ i ∈ range 10, a i) =\n (3 ^ (2 ^ 10) - 2 ^ 11 - 1) / 2 ^ 47 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_142362", "source_license": null, "theorem_names": ["algebra_142362"], "statement_sha256": "3d81b7f5b2c39a102c4dc0e9f4761d225f947145268158f3d1eb85515d5ef854", "task_path": "tasks/rl_align__o_proofs_algebra_142362__3d81b7f5b2c39a10", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_142362", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_152718__8461f888d8e5a08b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem algebra_152718 (f : ℂ → ℝ)\n (h₀ : ∀ z, ‖z‖ = 1 → f z = max (‖1 + z‖ / 2) (Real.sqrt (‖1 + z^2‖ / 2))) :\n IsGreatest (Set.image f (Metric.sphere 0 1)) 1 ∧\n IsLeast (Set.image f (Metric.sphere 0 1)) (Real.sqrt 3 / 3) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_152718", "source_license": null, "theorem_names": ["algebra_152718"], "statement_sha256": "8461f888d8e5a08b072eb3223cf49e80fdb35b8525942c60f483eb28bf267b6f", "task_path": "tasks/rl_align__o_proofs_algebra_152718__8461f888d8e5a08b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_152718", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_153699__5134c69be7f5325b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_153699 (a : ℤ) (A B C : Set (ℤ × ℤ))\n (hA : A = {(x, y) | a * x + y = 1}) (hB : B = {(x, y) | x + a * y = 1})\n (hC : C = {(x, y) | x ^ 2 + y ^ 2 = 1}) :\n ((A ∪ B) ∩ C).encard = 4 ↔ a = -1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_153699", "source_license": null, "theorem_names": ["algebra_153699"], "statement_sha256": "5134c69be7f5325b5433c0f75ec87be2a60482ba1fab5c06c7eaf6cd629a8eae", "task_path": "tasks/rl_align__o_proofs_algebra_153699__5134c69be7f5325b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_153699", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_156__0132992d556e137b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra (f : ℝ → ℝ → ℝ) (hf : ∀ x, f x = fun a => (abs (x - 2) + 2 * a) ^ 2 - 3 * (abs (x - 2) + 2 * a) + 4 * a * (3 - 4 * a)) :\n IsGreatest {a | Set.encard {x | f x a = 0} = 3} 0.5 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_156", "source_license": null, "theorem_names": ["algebra"], "statement_sha256": "0132992d556e137b0ae2b7369af3c84226f95f9ea629b428b5326b6595610402", "task_path": "tasks/rl_align__o_proofs_algebra_156__0132992d556e137b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_156", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_159248__287c9a8abaa6c8f2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_159248 :\n Set.ncard {x : ℝ | ∃ k : ℤ, (x^2 - 2 * x + 4) / (x^2 - 3 * x + 3) = k} = 7 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_159248", "source_license": null, "theorem_names": ["algebra_159248"], "statement_sha256": "287c9a8abaa6c8f2f3173a3d96c4789d8e205923a6aa717c981f5294743144c0", "task_path": "tasks/rl_align__o_proofs_algebra_159248__287c9a8abaa6c8f2", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_159248", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_160264__b654761eee0e1548", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\ntheorem algebra_160264 {g : Polynomial ℤ} (f : Polynomial ℤ)\n (h₀ : ∀ x, f.eval x = 6 * (x ^ 2 + 1) ^ 2 + 5 * g.eval x * (x ^ 2 + 1) - 21 * (g.eval x) ^ 2) :\n ¬∃ x : ℤ, f.eval x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_160264", "source_license": null, "theorem_names": ["algebra_160264"], "statement_sha256": "b654761eee0e15489feb1d83f06766e096ed708842ec44d5c8562f483cc249e0", "task_path": "tasks/rl_align__o_proofs_algebra_160264__b654761eee0e1548", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_160264", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_161180__76616c22b04d37e4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem algebra_161180 {f : ℝ → ℝ} (hf : f = fun x => 2 ^ x) (n : ℕ) :\n ∑ i ∈ Icc 1 n, f i * (Nat.floor (Real.logb 2 (f i))) = (n - 1) * 2 ^ (n + 1) + 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_161180", "source_license": null, "theorem_names": ["algebra_161180"], "statement_sha256": "76616c22b04d37e47553f545a49339a933bbab9d64803b6e7ad36daef5ad72e1", "task_path": "tasks/rl_align__o_proofs_algebra_161180__76616c22b04d37e4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_161180", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_161305__360c3e248ef3468a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem algebra_161305 (a : ℕ → ℝ)\n (h₀ : a 1 = 1)\n (h₁ : a 2 = 2)\n (h₂ : ∀ n, a (n + 2) = a (n + 1) / a n) :\n ∑ i ∈ range 1730, a (i + 1) = 2019 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_161305", "source_license": null, "theorem_names": ["algebra_161305"], "statement_sha256": "360c3e248ef3468a6f3e7d05e5484e5163068d4624b137b7aca8728f472d0303", "task_path": "tasks/rl_align__o_proofs_algebra_161305__360c3e248ef3468a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_161305", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_169277__7b689ff5de9b0e01", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_169277 (a : ℝ) (ha : a > 0) :\n Set.ncard {x : ℝ | ∃ y : ℝ, x^2 - y^2 + 4 * y - 3 = 0 ∧ y = a * x^2} = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_169277", "source_license": null, "theorem_names": ["algebra_169277"], "statement_sha256": "7b689ff5de9b0e01eb03a7c5f75dacddf5466225d1ae758223ec0c0b6f3a90ff", "task_path": "tasks/rl_align__o_proofs_algebra_169277__7b689ff5de9b0e01", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_169277", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_171830__0fbbad1c80ad107a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Complex Filter Function Metric Finset\nopen scoped BigOperators Topology\n\n\ntheorem algebra_171830 {a : ℕ → ℂ}\n (ha : ∀ n, a n = ∏ i ∈ range n, (1 + I / Real.sqrt (i + 1))) :\n ∀ n, ‖a n - a (n + 1)‖ = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_171830", "source_license": null, "theorem_names": ["algebra_171830"], "statement_sha256": "0fbbad1c80ad107aec701596898d954884cffff24baf0a1807d0a0728bc7ae17", "task_path": "tasks/rl_align__o_proofs_algebra_171830__0fbbad1c80ad107a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_171830", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_171952__84b57e5e01b112a9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_171952 {n : ℕ} (hn : 0 < n) (a b : Fin n → ℝ)\n (ha : ∑ i : Fin n, a i < 0) (hb : ∑ i : Fin n, b i < 0) :\n ∃ x : Fin n, ∑ i : Fin n, a (x + i) * b i > 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_171952", "source_license": null, "theorem_names": ["algebra_171952"], "statement_sha256": "84b57e5e01b112a9f43ccdbee318394cbd50a889ee3912aa474177c1cea003bd", "task_path": "tasks/rl_align__o_proofs_algebra_171952__84b57e5e01b112a9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_171952", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_18821__78ad40e76e6dd0d8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_18821 (A : Finset (Finset ℕ)) (hA : A.card = 15)\n (hA1 : ∀ s ∈ A, s.card = 2) (hA2 : ∀ s ∈ A, s ⊆ Finset.Icc 1 6) :\n ∑ s ∈ A, (s.sum id) = 105 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_18821", "source_license": null, "theorem_names": ["algebra_18821"], "statement_sha256": "78ad40e76e6dd0d86a6cc723f1fe422201d29afd9b2c0efccd265ad95eca4042", "task_path": "tasks/rl_align__o_proofs_algebra_18821__78ad40e76e6dd0d8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_18821", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_197791__d3244bf863184a89", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_197791 (x : Fin 67 → ℕ) (hx : ∀ i, 0 < x i)\n (hxs : ∑ i, x i = 110) :\n ∑ i, (x i)^2 ≤ 2002 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_197791", "source_license": null, "theorem_names": ["algebra_197791"], "statement_sha256": "d3244bf863184a892c030aace774d049d2cad677e9e5d5fb1dfe9554d0158c4f", "task_path": "tasks/rl_align__o_proofs_algebra_197791__d3244bf863184a89", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_197791", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_203069__0241e56a54436fb3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem algebra_203069 {a : ℕ → ℝ}\n (ha : ∀ n ∈ Icc 1 5, a n = n)\n (h : ∀ n ≥ 5, a (n + 1) = ∏ i ∈ Icc 1 n, a i - 1) :\n IsGreatest {x | ∃ m, x = ∏ i ∈ Icc 1 m, a i - ∑ i ∈ Icc 1 m, (a i)^2} 65 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_203069", "source_license": null, "theorem_names": ["algebra_203069"], "statement_sha256": "0241e56a54436fb3383fe9ddb0986e8e5f40b83ff5675b5234637e5a52aa65d7", "task_path": "tasks/rl_align__o_proofs_algebra_203069__0241e56a54436fb3", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_203069", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_203990__eb68d869b04ed26f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_203990 {n : ℕ} {k : ℕ} (f : Polynomial ℤ) (hf : f.degree = n)\n (h : ∀ x : ℤ, (x - 1) ∣ ∑ i ∈ Finset.range (n + 1), f.coeff i * x ^ (k * i)) :\n (Polynomial.X ^ k - 1) ∣ ∑ i ∈ Finset.range (n + 1), Polynomial.C (f.coeff i) * Polynomial.X ^ (k * i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_203990", "source_license": null, "theorem_names": ["algebra_203990"], "statement_sha256": "621f572db7bc02a8d1d120438bf769584dccb67def33b8c3c574d3f485eb8c00", "task_path": "tasks/rl_align__o_proofs_algebra_203990__eb68d869b04ed26f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_203990", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_2047__72d8878f7a7ba796", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem algebra_2047 {n : ℕ} [NeZero n] (a : ℕ → ℝ) (ha : ∀ i ∈ Icc 1 n, a i ≠ -1)\n (S : ℝ) (hS : S = ∑ i ∈ Icc 1 n, a i / (∏ j ∈ Icc 1 i, (1 + a j))) :\n S = 1 - 1 / (∏ i ∈ Icc 1 n, (1 + a i)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_2047", "source_license": null, "theorem_names": ["algebra_2047"], "statement_sha256": "72d8878f7a7ba796b5ce9abc60a44f4ad7d497f71564ba984647b045ed1aecf0", "task_path": "tasks/rl_align__o_proofs_algebra_2047__72d8878f7a7ba796", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_2047", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_205595__37ec2d6ea500167d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_205595 :\n Set.ncard {p : ℕ × ℕ | p.1 > 0 ∧ p.2 > 0 ∧ p.1 * Real.sqrt p.2 + p.2 * Real.sqrt p.1 - Real.sqrt (2007 * p.1) - Real.sqrt (2007 * p.2) + Real.sqrt (2007 * p.1 * p.2) = 2007} = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_205595", "source_license": null, "theorem_names": ["algebra_205595"], "statement_sha256": "37ec2d6ea500167dd3501bfb5897bb868a8d9a20f95b2086e15799383ca4cc97", "task_path": "tasks/rl_align__o_proofs_algebra_205595__37ec2d6ea500167d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_205595", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_218059__112d9265847aee21", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Complex Filter Function Metric Finset\nopen scoped BigOperators Topology\n\n\ntheorem algebra_218059 {θ : ℕ → ℝ} {n : ℕ} (f : ℂ → ℂ)\n (h₀ : ∀ z, f z = z^n * Real.cos (θ n) + ∑ i ∈ range n, z^i * Real.cos (θ i) - 2) :\n ∀ z, f z = 0 → ‖z‖ > 1 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_218059", "source_license": null, "theorem_names": ["algebra_218059"], "statement_sha256": "112d9265847aee21aa1c3c24f993943cfdbb1b8765dda7a6827b700c8f3c3583", "task_path": "tasks/rl_align__o_proofs_algebra_218059__112d9265847aee21", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_218059", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_22176__ca34dfa4cefb1f36", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_22176 (a : Fin 2005 → ℝ)\n (h : ∀j < 2024, ∑ i, a i * (i + 1) ^ (j + 1) = 0)\n (h' : ∑ i, a i * (i + 1) ^ 2005 = 1) :\n a 0 = 1 / Nat.factorial 2004 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_22176", "source_license": null, "theorem_names": ["algebra_22176"], "statement_sha256": "ca34dfa4cefb1f365e71600b79fb45e27b9004f7525aa6a0fb465dfa26af322a", "task_path": "tasks/rl_align__o_proofs_algebra_22176__ca34dfa4cefb1f36", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_22176", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_231766__ea048ede32e697ec", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem algebra_231766 {n : ℕ} :\n (∀ x : ℕ → ℝ, x 0 = 1 ∧ x (n + 1) = 0 → ∑ i ∈ range (n + 1), (x i - x (i + 1))^2 ≥ 1 / (n + 1))\n ∧ (∃ x : ℕ → ℝ, x 0 = 1 ∧ x (n + 1) = 0 ∧ ∑ i ∈ range (n + 1), (x i - x (i + 1))^2 = 1 / (n + 1)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_231766", "source_license": null, "theorem_names": ["algebra_231766"], "statement_sha256": "ea048ede32e697eccbb848dda2ee4af63aee4d225da0c9793d8c25ef0527194a", "task_path": "tasks/rl_align__o_proofs_algebra_231766__ea048ede32e697ec", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_231766", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_237166__b85b02843158de23", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_237166 (a : Fin 2014 → Fin 2014 → ℤ)\n (ha : ∀ i j, a i j = (-1) ^ (i.1 + 1) * (2015 - (i.1 + 1) - (j.1 + 1)) ^ 2) :\n ∑ i, ∑ j, a i j = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_237166", "source_license": null, "theorem_names": ["algebra_237166"], "statement_sha256": "b85b02843158de230ea777f8a0f1fc0cf55d3d368c524f2649a36f30a105d2e6", "task_path": "tasks/rl_align__o_proofs_algebra_237166__b85b02843158de23", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_237166", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_241642__d4882404c4909e64", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_241642 {f : ℝ → ℝ} (hf1 : f 1 = 1)\n (hadd : ∀ x y, f x + f y + x * y + 1 = f (x + y)) :\n ∑ᶠ n ∈ {n : ℤ | f n = 2 * n ^ 2 - 10}, n ^ 3 = 19 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_241642", "source_license": null, "theorem_names": ["algebra_241642"], "statement_sha256": "d4882404c4909e64235d0da237a392e9862424470761613f11aac5de05e61559", "task_path": "tasks/rl_align__o_proofs_algebra_241642__d4882404c4909e64", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_241642", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_242619__859203e3019e8ffa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_242619 {a : ℕ → ℝ} (ha1 : a 1 = 3) (han : ∀ m n, m > 0 → n > 0 → a (m + n) = a m + a n + 2 * m * n) : (∀ n > 0, a n = n ^ 2 + 2 * n) ∧ {c : ℝ | ∀ k > 0, ∑ i ∈ Finset.Icc 1 k, (1 / a i) < c} = Set.Ici (3 / 4) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_242619", "source_license": null, "theorem_names": ["algebra_242619"], "statement_sha256": "859203e3019e8ffaf5a535aa136082bc7161b681cf6d869224afa20cddd95412", "task_path": "tasks/rl_align__o_proofs_algebra_242619__859203e3019e8ffa", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_242619", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_249635__35b4c1e83110a097", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem algebra_249635 {a : ℕ → ℝ} (ha1 : a 1 = 1 / 2)\n (han : ∀ n ≥ 2, a n = (2 * n - 3) / (2 * n) * a (n - 1)) :\n ∀ n, ∑ i ∈ range n, a (i + 1) < 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_249635", "source_license": null, "theorem_names": ["algebra_249635"], "statement_sha256": "35b4c1e83110a097bbd4cb6cc0be85d2e8bf79eec2d07e62582d03428097d13b", "task_path": "tasks/rl_align__o_proofs_algebra_249635__35b4c1e83110a097", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_249635", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_253138__b1f40da2d7acf1b4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem algebra_253138 {n : ℕ} (hn : 0 < n) (x : ℕ → ℝ)\n (hx0 : x 0 = 1 / n) (hxn : ∀ k ∈ Icc 1 (n - 1), x k = (∑ i ∈ Icc 0 (k - 1), x i) / (n - k)) :\n ∑ i ∈ Icc 0 (n - 1), x i = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_253138", "source_license": null, "theorem_names": ["algebra_253138"], "statement_sha256": "b1f40da2d7acf1b4a66368332635436ccf211789a630fd8fc8f817107b247aba", "task_path": "tasks/rl_align__o_proofs_algebra_253138__b1f40da2d7acf1b4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_253138", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_2691__29f3bc537d6ca18a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra (s : Set ℝ) (hs : s = {a | ∃(b c : ℝ), a + b = 15 ∧ a * b + c = 74 ∧ a * c = 120}) :\n ∑ᶠ x ∈ s, x = 15 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_2691", "source_license": null, "theorem_names": ["algebra"], "statement_sha256": "29f3bc537d6ca18aa01057fc1ba255815214771f7e0d79bc01194e4adc23520c", "task_path": "tasks/rl_align__o_proofs_algebra_2691__29f3bc537d6ca18a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_2691", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_286339__949aa316db9a4924", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nopen Real\ntheorem algebra_286339 {a : ℕ → ℝ} (ha_pos : ∀ n, 0 < a n)\n (h : ∀ n, a n + 1 = 2 * √(∑ i ∈ Finset.range (n + 1), a i)) :\n (∀ n, a n = 2 * n + 1) ∧\n (∀ n, ∑ i ∈ Finset.range (n + 1), a (i + 2) / (a i * a (i + 1) * 2^(i + 1)) ∈ Set.Ico (5 / 6) 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_286339", "source_license": null, "theorem_names": ["algebra_286339"], "statement_sha256": "949aa316db9a49248dc2988d5379effb1d1286b29cea8e13c3e90a7965a6d5a3", "task_path": "tasks/rl_align__o_proofs_algebra_286339__949aa316db9a4924", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_286339", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_287172__e06fd5c0bb8951a3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_287172 :\n Set.ncard {p : ℕ × ℕ | p.1 > 0 ∧ p.2 > 0 ∧ p.1 * Real.sqrt p.2 + p.2 * Real.sqrt p.1 +\n Real.sqrt (2009 * p.1 * p.2) - Real.sqrt (2009 * p.1) - Real.sqrt (2009 * p.2) - 2009 = 0} = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_287172", "source_license": null, "theorem_names": ["algebra_287172"], "statement_sha256": "e06fd5c0bb8951a34c598478eceff0a3e7bb2983faf3d3c6e6083614169bdf6d", "task_path": "tasks/rl_align__o_proofs_algebra_287172__e06fd5c0bb8951a3", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_287172", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_297185__3e37a8206d57c90d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_297185 (a : ℝ) (f : ℝ → ℝ)\n (hf : f = fun x => (1/3)*x^3 - (1/2)*a*x^2 + (a-1)*x + 1)\n (h1 : ∀ x ∈ Set.Ioo 1 4, deriv f x < 0)\n (h2 : ∀ x ∈ Set.Ioi 6, deriv f x > 0) :\n 5 ≤ a ∧ a ≤ 7 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_297185", "source_license": null, "theorem_names": ["algebra_297185"], "statement_sha256": "3e37a8206d57c90d40eec945916324009295f1c4ec243b20548a9587b29b1a24", "task_path": "tasks/rl_align__o_proofs_algebra_297185__3e37a8206d57c90d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_297185", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_303270__8d2cbd3f2636616f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem algebra_303270 {a : ℕ → ℝ}\n (ha1 : a 1 = 1 / 2)\n (hak : ∀ k ≥ 2, 2 * k * a k = (2 * k - 3) * a (k - 1)) :\n ∀ n, ∑ k ∈ Icc 1 n, a k < 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_303270", "source_license": null, "theorem_names": ["algebra_303270"], "statement_sha256": "8d2cbd3f2636616f640b313276d571837b79f5532959109b8914a9f1f271392b", "task_path": "tasks/rl_align__o_proofs_algebra_303270__8d2cbd3f2636616f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_303270", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_306484__675694efc47ce4a9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem algebra_306484 {n : ℕ} (hn : 0 < n) (a : ℕ → ℝ)\n (ha : ∀ k ∈ Icc 1 n, a k = 2 ^ k) :\n ∑ i ∈ Icc 1 n, ∑ j ∈ Icc 1 n, (if i ≤ j then a i * a j else 0) =\n 4 / 3 * (2 ^ n - 1) * (2 ^ (n + 1) - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_306484", "source_license": null, "theorem_names": ["algebra_306484"], "statement_sha256": "675694efc47ce4a9dba83684f5f493317a477c23cb63f796cb1a38382268be86", "task_path": "tasks/rl_align__o_proofs_algebra_306484__675694efc47ce4a9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_306484", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_327186__9c27a5edb15b22aa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_327186 {p q : ℝ} (f g : ℝ → ℝ)\n (hf : ∀ x, f x = x ^ 2 + p * x + q)\n (hg : ∀ x, g x = x + 1 / x ^ 2)\n (hfg : ∃ x ∈ Set.Icc 1 2, f x = g x ∧ deriv f x = 0 ∧ deriv g x = 0) :\n IsGreatest (Set.image f (Set.Icc 1 2)) (4 - 5 / 2 * (2 ^ ((1 : ℝ) / 3)) + (4 ^ ((1 : ℝ) / 3))) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_327186", "source_license": null, "theorem_names": ["algebra_327186"], "statement_sha256": "9c27a5edb15b22aafc9c733ac56dd3f908b425745d721631acd4a0c860dcfdf0", "task_path": "tasks/rl_align__o_proofs_algebra_327186__9c27a5edb15b22aa", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_327186", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_328262__49fa2cc36c29489a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_328262 {a : ℕ → ℂ} (ha1 : a 1 = 0)\n (han : ∀ n ≥ 2, a n = a (n - 1) ^ 2 + .I) :\n ∑ i ∈ Finset.Icc 1 2007, a i = -1003 + 2 * .I := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_328262", "source_license": null, "theorem_names": ["algebra_328262"], "statement_sha256": "49fa2cc36c29489ae55758a58cd15f639e9983f78c976827df9a78cd01034380", "task_path": "tasks/rl_align__o_proofs_algebra_328262__49fa2cc36c29489a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_328262", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_3282__af4d0f91b83797d4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem algebra_3282 {f : ℕ → ℝ}\n (hf : ∀ r, f r = ∑ i ∈ Icc 1 r, (1 : ℝ) / i) (n : ℕ) (hn : 0 < n) :\n ∑ r ∈ Icc 1 n, f r = (n + 1) * f n - n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_3282", "source_license": null, "theorem_names": ["algebra_3282"], "statement_sha256": "af4d0f91b83797d4f49c917fda50b265f510d0fabb2dba88a1a4741c83798cdb", "task_path": "tasks/rl_align__o_proofs_algebra_3282__af4d0f91b83797d4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_3282", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_37000__86694c8ae058b30d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_37000 (r : Set ℝ) (hr : r = {x : ℝ | x ^ 2 - 7 * ⌊x⌋ + 5 = 0}) :\n r.Finite ∧ ∑ᶠ x ∈ r, x ^ 2 = 92 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_37000", "source_license": null, "theorem_names": ["algebra_37000"], "statement_sha256": "86694c8ae058b30d00d8eaa97aa3a09443c7e549ba7b1d848d490d75373ee77c", "task_path": "tasks/rl_align__o_proofs_algebra_37000__86694c8ae058b30d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_37000", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_372882__a469ae9c6a18ca7a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\ntheorem algebra_372882 {f : ℕ → ℝ}\n (hf : ∀ N, f N = N * (9 / 10 : ℝ) ^ N) :\n ∃ m n : ℕ, IsGreatest (Set.image f {N | N > 0}) (m / n) ∧ Nat.Coprime m n ∧ (m + n) % 1000 = 401 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_372882", "source_license": null, "theorem_names": ["algebra_372882"], "statement_sha256": "a469ae9c6a18ca7a453346dbfeb9713b09998f3537a85b700b1664a4d68e10db", "task_path": "tasks/rl_align__o_proofs_algebra_372882__a469ae9c6a18ca7a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_372882", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_379540_2__2e5c46bc8999b145", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem algebra_379540 (f : ℝ → ℝ) (hf : f = λ x => cos (2 * x) + cos (6 * x) + 2 * (sin x)^2 - 1)\n (I : Set ℝ) (hI : I = {x | x ∈ Icc (5 * π / 6) (6 * π / 6) ∧ f x = 0}) :\n abs (∑ᶠ x ∈ I, x - 2.88) < 0.01 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_379540_2", "source_license": null, "theorem_names": ["algebra_379540"], "statement_sha256": "2e5c46bc8999b145ad5ea6726ea440508f240c32863a7db6bfab47f4c217835b", "task_path": "tasks/rl_align__o_proofs_algebra_379540_2__2e5c46bc8999b145", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_379540_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_435720__f17a4972f8458f13", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra_435720 : ∃ g : Polynomial ℕ, ∀ m n : ℕ, m ≠ n → m > 0 → n > 0 → Nat.gcd (g.eval m) (g.eval n) = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_435720", "source_license": null, "theorem_names": ["algebra_435720"], "statement_sha256": "f17a4972f8458f135615acc9173216a3e208886146bac13daff4d1c754be3911", "task_path": "tasks/rl_align__o_proofs_algebra_435720__f17a4972f8458f13", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_435720", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_436659__27bdabfa27c8c8a5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra_436659 (f : ℝ → ℝ)\n (hodd : ∀ x, f (-x) = -f x)\n (hf : ∀ x, f (x + 2) = -f x)\n (hf' : ∀ x ∈ Set.Icc 0 2, f x = 2 * x - x ^ 2) :\n ∑ i ∈ Finset.range 2019, f i = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_436659", "source_license": null, "theorem_names": ["algebra_436659"], "statement_sha256": "27bdabfa27c8c8a5f884bd3f27dc436afca517a28f25bf1edc52ab00f150a62f", "task_path": "tasks/rl_align__o_proofs_algebra_436659__27bdabfa27c8c8a5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_436659", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_437786__e5b63333d73b0971", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\ntheorem algebra_437786 {h : ℕ → ℝ}\n (h_def : ∀ x, h x = 1 + x + x ^ 2 + x ^ 3) (n : ℕ) :\n ∑ i ∈ Icc 1 n, h i = n + n * (n + 1) / 2 + n * (n + 1) * (2 * n + 1) / 6 +\n n ^ 2 * (n + 1) ^ 2 / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_437786", "source_license": null, "theorem_names": ["algebra_437786"], "statement_sha256": "e5b63333d73b09718ee5f50651f03186e8e71abb892fe7c7171671ed99eb0b43", "task_path": "tasks/rl_align__o_proofs_algebra_437786__e5b63333d73b0971", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_437786", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_446659__db28dca5aad2aa44", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem algebra_446659 {a : ℕ → ℝ}\n (ha1 : a 1 = 1)\n (han : ∀ n ≥ 2, a n = ((n + 1) / (n - 1)) * ∑ i ∈ Icc 1 (n - 1), a i) :\n a 2013 = 2 ^ 2012 * 1007 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_446659", "source_license": null, "theorem_names": ["algebra_446659"], "statement_sha256": "db28dca5aad2aa44bcad5751ce4cbb0371edd7d194251d8401c21ee8defe7750", "task_path": "tasks/rl_align__o_proofs_algebra_446659__db28dca5aad2aa44", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_446659", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_453067__c61627faed2cfe8b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem algebra_453067 (k : ℕ) :\n ∫ x in (0)..(π/2), cos (2*k*x)*sin x =\n ((1 - cos ((2*k + 1)*(π/2)))/(2*k + 1) -\n (1 - cos ((2*k - 1)*(π/2)))/(2*k - 1))/2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_453067", "source_license": null, "theorem_names": ["algebra_453067"], "statement_sha256": "c61627faed2cfe8bc47864fc808bce74b00f25873acadca9eeccbbe0cb18cf9a", "task_path": "tasks/rl_align__o_proofs_algebra_453067__c61627faed2cfe8b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_453067", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_460939__06f4a5a83ae0571f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_460939 (f : ℝ → ℝ) (h : ∀ x y, f ((x - y) ^ 2) = f x ^ 2 - 2 * x * f y + y ^ 2)\n (n : ℕ) (hn : n = {x | ∃ f : ℝ → ℝ, (∀ x y, f ((x - y) ^ 2) = f x ^ 2 - 2 * x * f y + y ^ 2) ∧ f 1 = x}.ncard)\n (s : ℝ) (hs : s = ∑ᶠ x ∈ {x | ∃ f : ℝ → ℝ, (∀ x y, f ((x - y) ^ 2) = f x ^ 2 - 2 * x * f y + y ^ 2) ∧ f 1 = x}, x) :\n n * s = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_460939", "source_license": null, "theorem_names": ["algebra_460939"], "statement_sha256": "06f4a5a83ae0571f0a313b89b35299a3f4f11544bf9cc6feb311b69c8b9ee186", "task_path": "tasks/rl_align__o_proofs_algebra_460939__06f4a5a83ae0571f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_460939", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_464823__89cc031284adaf33", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem algebra_464823 {f : ℝ → ℝ}\n (hf : ∀ ρ ∈ Set.Ioo 0 1, f ρ = ∑' n : ℕ, (n + 1) * ρ ^ (n + 1) * (1 - ρ)) :\n ∀ ρ ∈ Set.Ioo 0 1, f ρ = ρ / (1 - ρ) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_464823", "source_license": null, "theorem_names": ["algebra_464823"], "statement_sha256": "89cc031284adaf33ec549214b94fb9f7cf53e0aaff2c6469f66691f727e6680a", "task_path": "tasks/rl_align__o_proofs_algebra_464823__89cc031284adaf33", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_464823", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_467396__f2cfb2a11fd0cd32", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra_467396 (s : Set ℝ) (h₀ : s = {x : ℝ | abs (x ^ 2 - x + 1 / 2010) = 1 / 2010}) :\n ∑ᶠ (x) (_ : x ∈ s), x ^ 2 = 2008 / 1005 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_467396", "source_license": null, "theorem_names": ["algebra_467396"], "statement_sha256": "f2cfb2a11fd0cd326c89c6dbc5bd1bca0c9f145cbc04cacf9975581ef34376dd", "task_path": "tasks/rl_align__o_proofs_algebra_467396__f2cfb2a11fd0cd32", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_467396", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_467782__c617644bbdc86817", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra_467782 (s : Set ℕ) (hs : s = {x | ∃ j k : ℕ, j > 0 ∧ k > 0 ∧ (1 / j : ℚ) + (1 / k : ℚ) = 1 / 4 ∧ x = j + k}) :\n ∑ᶠ x ∈ s, x = 59 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_467782", "source_license": null, "theorem_names": ["algebra_467782"], "statement_sha256": "c617644bbdc8681722aa48c28bd3413479934900eb45872ed45bc996fe5aff07", "task_path": "tasks/rl_align__o_proofs_algebra_467782__c617644bbdc86817", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_467782", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_467985__e5658bba330be4b3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra_467985 (s : Set ℕ) (hs : s = {p : ℕ | p.Prime ∧ ∃ k, 2 * p + 1 = k ^ 3}) :\n ∑ᶠ x ∈ s, x = 13 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_467985", "source_license": null, "theorem_names": ["algebra_467985"], "statement_sha256": "e5658bba330be4b3c72b96f9dacf57540fe0e7de097e68ce523f5c7aa57009ac", "task_path": "tasks/rl_align__o_proofs_algebra_467985__e5658bba330be4b3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_467985", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_468297__31447224b119b3e7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_468297 (a : Finset ℤ) (h : a.card = 5) :\n ∃ b ⊆ a, b.card = 3 ∧ 3 ∣ ∑ x ∈ b, x := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_468297", "source_license": null, "theorem_names": ["algebra_468297"], "statement_sha256": "31447224b119b3e74883a076d50757aee5042f7a2f455ccbbc6fa01c0537b8b2", "task_path": "tasks/rl_align__o_proofs_algebra_468297__31447224b119b3e7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_468297", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_469753__4aed459b53a454c7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\ntheorem algebra_469753 {f : ℝ → ℝ}\n (hf0 : f 0 = 0) (hfp : f Real.pi = 0)\n (hfdiff : DifferentiableOn ℝ f (Set.Icc 0 Real.pi))\n (hfndiff : DifferentiableOn ℝ (deriv f) (Set.Icc 0 Real.pi))\n (hfcont : ContinuousOn f (Set.Icc 0 Real.pi)) :\n ∃ c ∈ Set.Ioo 0 Real.pi, iteratedDeriv 2 f c = -f c := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_469753", "source_license": null, "theorem_names": ["algebra_469753"], "statement_sha256": "4aed459b53a454c7517fa2ceb68878cb8649fec012952010ccb0b1d010610092", "task_path": "tasks/rl_align__o_proofs_algebra_469753__4aed459b53a454c7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_469753", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_473685__59e87f43cb62bdf1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Polynomial\n\ntheorem algebra_473685 {P : ℝ[X]} (hP : P = (1 + X + X ^ 2) ^ 25) :\n Even (∑ i ∈ range 51, P.coeff (2 * i)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_473685", "source_license": null, "theorem_names": ["algebra_473685"], "statement_sha256": "59e87f43cb62bdf1903244a4ec51e0e51fd1cd544de29f4d735bbec89785abe1", "task_path": "tasks/rl_align__o_proofs_algebra_473685__59e87f43cb62bdf1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_473685", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_477598__b5d826c0f01fd28b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem algebra_477598 (a : ℕ → ℤ)\n (ha : ∀ n, a n = ∑' k : ℕ, if k ≥ 1 then ⌊(n + 2^(k - 1)) / (2 ^ k : ℝ)⌋ else 0) :\n a 2015 = 2015 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_477598", "source_license": null, "theorem_names": ["algebra_477598"], "statement_sha256": "b5d826c0f01fd28bdf5c0936ac39e0afbe636322f8f614770ebcd457b4352a82", "task_path": "tasks/rl_align__o_proofs_algebra_477598__b5d826c0f01fd28b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_477598", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_480963_2__e40711536b9fc7a6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra_480963 :\n {(f 2) | (f : ℤ → ℤ) (_ : ∀ m n, f (m + n) + f (m * n - 1) = f m * f n + 2)}.ncard * ∑ᶠ x ∈ {x : ℤ | ∃ f : ℤ → ℤ, (∀ m n, f (m + n) + f (m * n - 1) = f m * f n + 2) ∧ x = f 2}, x = 5 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_480963_2", "source_license": null, "theorem_names": ["algebra_480963"], "statement_sha256": "e40711536b9fc7a62d068305881cd5d1327968a7f5f42ed68c901279ec0ec49d", "task_path": "tasks/rl_align__o_proofs_algebra_480963_2__e40711536b9fc7a6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_480963_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_483370__9d71d5233496ec02", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem algebra_483370 {f : ℝ → ℝ} (hf : f = fun x => x ^ 3 / 3 - x ^ 2 / 2 + x + 1 / 12) :\n ∫ x in (1 / 7)..(6 / 7), f (f x) = 5 / 14 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_483370", "source_license": null, "theorem_names": ["algebra_483370"], "statement_sha256": "9d71d5233496ec02f54b9d75f0539c4ebc1c577588ddb398b2504f7c1f6f09b1", "task_path": "tasks/rl_align__o_proofs_algebra_483370__9d71d5233496ec02", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_483370", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_484363__e3727b0b92c4bf9f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra_484363 (S : Set ℝ) (hS : S = {x | 1 / (1 + 1 / abs (x - 25)) = 49 / 50}) :\n ∑ᶠ x ∈ S, x = 50 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_484363", "source_license": null, "theorem_names": ["algebra_484363"], "statement_sha256": "e3727b0b92c4bf9f61292410b7a6e612c65d2e4617ee04fb958cf2c9f0db5f85", "task_path": "tasks/rl_align__o_proofs_algebra_484363__e3727b0b92c4bf9f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_484363", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_485726__738754259c4c039e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem algebra_485726 (f : ℝ → ℝ)\n (h₀ : ∀ t, 0 < t → f t = 1 / (4 * t ^ 2) + 3 + 9 * t ^ 2) :\n ∫ t in (1)..2, sqrt (f t) = 9 / 2 + 1 / 2 * log 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_485726", "source_license": null, "theorem_names": ["algebra_485726"], "statement_sha256": "738754259c4c039e36dad2c7fc6beec67f1c3e608e1f1eaed695b55ac8123560", "task_path": "tasks/rl_align__o_proofs_algebra_485726__738754259c4c039e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_485726", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_487182__7c9e8933e5c1d617", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra_487182 (r : Set ℝ) (hr : r = {x : ℝ | x ^ 2 = 5 * x + 6 * √x - 3}) :\n ∑ᶠ x ∈ r, x = 7 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_487182", "source_license": null, "theorem_names": ["algebra_487182"], "statement_sha256": "7c9e8933e5c1d6172b9f76a245c3dd9849b0fea66f2f6e8423934147c03ec393", "task_path": "tasks/rl_align__o_proofs_algebra_487182__7c9e8933e5c1d617", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_487182", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_498064_3__0bdf643131f1eb7b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem algebra_498064 {G : ℝ → ℝ} (hG : G = fun x => x ^ 3 * ∫ u in (x ^ 2)..1, (u - 1)) :\n deriv G = fun x => -7 * x ^ 6 / 2 + 5 * x ^ 4 - 3 * x ^ 2 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_498064_3", "source_license": null, "theorem_names": ["algebra_498064"], "statement_sha256": "0bdf643131f1eb7ba3d0e4df4eea27b7ca8b01f3e6c1566deb6ab558a8b25f36", "task_path": "tasks/rl_align__o_proofs_algebra_498064_3__0bdf643131f1eb7b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_498064_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_498468__7d048127769fd0ea", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra_498468 {F V : Type*} [AddCommGroup V] [Field F]\n [Module F V] (n : ℕ) (v : Fin n → V) (h : LinearIndependent F v)\n (a : Fin n → F) (ha : ∀ i, a i ≠ 0) :\n LinearIndependent F (fun i => a i • v i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_498468", "source_license": null, "theorem_names": ["algebra_498468"], "statement_sha256": "bc2a237eb7ac26e6f68869e27665c8477f4ccccfc309e2a7fc3aa9790e343a9d", "task_path": "tasks/rl_align__o_proofs_algebra_498468__7d048127769fd0ea", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_498468", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_516971__731560522252d90c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra_516971 {f : ℝ → ℝ} (hf : Differentiable ℝ f)\n (hfn : Differentiable ℝ (deriv f)) (g : ℝ → ℝ) (hg : ∀ x, g x ≥ 0)\n (hfg : ∀ x, iteratedDeriv 2 f x + f x = -x * g x * deriv f x) :\n Bornology.IsBounded (Set.image f (Set.univ : Set ℝ)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_516971", "source_license": null, "theorem_names": ["algebra_516971"], "statement_sha256": "731560522252d90ccacff9e0e9ba147cf8ee8ef88fe06293896682b8355e2dac", "task_path": "tasks/rl_align__o_proofs_algebra_516971__731560522252d90c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_516971", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_525__9293626ca3188040", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra {f : Polynomial ℝ} (h : ∀ a : ℤ, f.eval (a : ℝ) = f.eval ((a + 1) : ℝ)) :\n ∀ n > 0, f.coeff n = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_525", "source_license": null, "theorem_names": ["algebra"], "statement_sha256": "9293626ca31880409ac6b5d5a6cff45f4d689f28292e9687375ea5f2d262b823", "task_path": "tasks/rl_align__o_proofs_algebra_525__9293626ca3188040", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_525", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_563501__45af2ce98e7d7451", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem algebra_563501 {g : ℝ → ℝ} (hg : ∀ x, g x = ∫ t in (0)..x ^ 2, exp t) :\n iteratedDeriv 2 g 2 = 18 * exp 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_563501", "source_license": null, "theorem_names": ["algebra_563501"], "statement_sha256": "45af2ce98e7d7451631f3477079a2b0f0c78fe972ada516278d51d69cc2f0c43", "task_path": "tasks/rl_align__o_proofs_algebra_563501__45af2ce98e7d7451", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_563501", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_572840_2__121d797c5d393480", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra_572840 (s : Set ℝ) (hs : s = {a | ∃ x y : ℝ, a = x ∧ 3 * x + 8 * y = 24 ∧ |y| = |x|}) :\n ∑ᶠ a ∈ s, a = -144 / 55 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_572840_2", "source_license": null, "theorem_names": ["algebra_572840"], "statement_sha256": "121d797c5d393480f15d6d9538b8a37b9af3a187d1d5330a27a74c16ce86a753", "task_path": "tasks/rl_align__o_proofs_algebra_572840_2__121d797c5d393480", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_572840_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_576484__ae847183ed050491", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem algebra_576484 {n : ℕ} (hn : 0 < n) (a x : Fin n → ℝ)\n (ha : ∀ i, 0 ≤ a i) :\n ((1 - ∑ i, a i * cos (x i))^2 +\n (1 - ∑ i, a i * sin (x i))^2)^2 ≥\n 4 * (1 - ∑ i, a i)^3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_576484", "source_license": null, "theorem_names": ["algebra_576484"], "statement_sha256": "ae847183ed050491a0c6296e936f6cd2b8049bbc8c31412a04671612d2fda621", "task_path": "tasks/rl_align__o_proofs_algebra_576484__ae847183ed050491", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_576484", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_58908__9d3d3a474e24e390", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra_58908 (S : Set ℝ) (hS : S = {x | abs (x ^ 2 - x + 1 / 2023) = 1 / 2023}) :\n ∑ᶠ (x ∈ S), x ^ 2 = 4042 / 2023 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_58908", "source_license": null, "theorem_names": ["algebra_58908"], "statement_sha256": "9d3d3a474e24e390b2805e712ffab225e9747f1cb25a87218dd44f6c57ba0b49", "task_path": "tasks/rl_align__o_proofs_algebra_58908__9d3d3a474e24e390", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_58908", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_598998__cdf9d1cb011a4a7f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem algebra_598998 {a : ℕ → ℝ} (ha1 : a 1 = 1 / 2)\n (han : ∀ n, a (n + 1) = (a n) ^ 2 / (a n ^ 2 - a n + 1)) :\n ∀ n, ∑ i ∈ Icc 1 n, a i < 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_598998", "source_license": null, "theorem_names": ["algebra_598998"], "statement_sha256": "cdf9d1cb011a4a7f7ca72f4e1024d4d1dd63105306ab4df0e0e4b9a18b7eb5af", "task_path": "tasks/rl_align__o_proofs_algebra_598998__cdf9d1cb011a4a7f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_598998", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_602180__d725838fa70fae36", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem algebra_602180\n (x : ℕ → ℝ)\n (h₀ : x 1 = 5)\n (h₁ : ∀ n ≥ 1, x (n + 1) = (x n)^2 - 2) :\n Tendsto (λ n => x (n + 1) / ∏ i ∈ Icc 1 n, x i) atTop (𝓝 (Real.sqrt 21)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_602180", "source_license": null, "theorem_names": ["algebra_602180"], "statement_sha256": "d725838fa70fae3666ac32b089e50ef879e1573934a7e584cffb2d4f82787bf0", "task_path": "tasks/rl_align__o_proofs_algebra_602180__d725838fa70fae36", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_602180", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_60868__1c3434ffff9e6fd8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_60868 :\n Set.ncard {p : ℕ × ℕ | p.1 > 0 ∧ p.2 > 0 ∧ p.1 < 1000 ∧ p.2 < 1000 ∧ p.1 * p.2 = (p.2 ^ 2) / p.1} = 31 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_60868", "source_license": null, "theorem_names": ["algebra_60868"], "statement_sha256": "1c3434ffff9e6fd8a4fbd418fdd6fd148b9800c951c1f14e01f4b2a935dc49e9", "task_path": "tasks/rl_align__o_proofs_algebra_60868__1c3434ffff9e6fd8", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_60868", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_63445__208ce519a8328605", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem algebra_63445 {n : ℕ} (hn : n ≥ 1) :\n ∃ p : MvPolynomial (Fin 3) ℤ, ∀ x y z : ℤ,\n MvPolynomial.eval (fun i => if i = 0 then x + y + z else if i = 1 then x * y + y * z + z * x else x * y * z) p =\n x ^ n + y ^ n + z ^ n := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_63445", "source_license": null, "theorem_names": ["algebra_63445"], "statement_sha256": "208ce519a832860563409135c1cc44c9a5a0ee9b40957d2d7732ddb8909801e3", "task_path": "tasks/rl_align__o_proofs_algebra_63445__208ce519a8328605", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_63445", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_74835__abe3601c1f8fd8e3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_74835 {P : Polynomial ℤ} {a b : ℤ} (ha : a ≠ b)\n (h : P.eval a * P.eval b = -(a - b)^2) : P.eval a + P.eval b = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_74835", "source_license": null, "theorem_names": ["algebra_74835"], "statement_sha256": "abe3601c1f8fd8e34c781ddad7444584a6c451c882fa3c3c540c9d29008b1a48", "task_path": "tasks/rl_align__o_proofs_algebra_74835__abe3601c1f8fd8e3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_74835", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_75122__b2c2b343ae9ac4b2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_75122 {P : Polynomial ℤ} (a b : ℤ) (h : P.eval a * P.eval b = -(a - b) ^ 2) :\n P.eval a + P.eval b = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_75122", "source_license": null, "theorem_names": ["algebra_75122"], "statement_sha256": "b2c2b343ae9ac4b29ab4c2dd15700174b7b2b8c8563280453297c9db551e41b9", "task_path": "tasks/rl_align__o_proofs_algebra_75122__b2c2b343ae9ac4b2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_75122", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_91629__7eaa3b3051e709f3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_91629 {k n : ℕ} (hk : 1 ≤ k) (hn : k ≤ n)\n (a : Fin k → ℝ) (h : ∀ i, ∑ j : Fin k, a j ^ (i + 1) = n) :\n ∃ c : ℕ → ℝ, (∀ x, ∏ i : Fin k, (x + a i) = x ^ k + ∑ j : Fin k, c j * x ^ j.1) ∧\n ∀ j : Fin k, c j = Nat.choose n j.1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_91629", "source_license": null, "theorem_names": ["algebra_91629"], "statement_sha256": "7eaa3b3051e709f32bc013580be4583cad77276bb00e560cb546bc6cfef7a2c3", "task_path": "tasks/rl_align__o_proofs_algebra_91629__7eaa3b3051e709f3", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_91629", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_9319__80a4fc58ba2ef665", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nopen Finset\n\n\ntheorem algebra_9319 {x : ℕ → ℝ} (hx : ∀ n, 0 < x n)\n (hx1 : x 1 = 3 / 2)\n (hxn : ∀ n > 0, (x (n + 1)) ^ 2 - (x n) ^ 2 = 1 / (n + 2) ^ 2 - 1 / n ^ 2) :\n ∑ i ∈ Icc 1 2009, x i = 4040099 / 2010 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_9319", "source_license": null, "theorem_names": ["algebra_9319"], "statement_sha256": "80a4fc58ba2ef665bed8b601cd4bd57788f2f5ce3c38834dfd578eb0c574dbe0", "task_path": "tasks/rl_align__o_proofs_algebra_9319__80a4fc58ba2ef665", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_9319", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_9432__f91409df7525ed3f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebra_9432 {a b : ℝ} (ha : a ≠ 0) (hb : b ≠ 0) (f : ℝ → ℝ)\n (hf : ∀ x, f x = a * x ^ 3 + b * x ^ 2 + 5 / 3) (h : ∀ x, deriv (deriv f) x = 0 → x = 1)\n (h' : f 1 = 1) :\n a = 1 / 3 ∧ b = -1 ∧ ∑ i ∈ Finset.range 199, f ((i + 1) / 100) = 199 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_9432", "source_license": null, "theorem_names": ["algebra_9432"], "statement_sha256": "f91409df7525ed3fa9ca41e2d6566e8465e04b61ed88d40cb06279569e8e0bb1", "task_path": "tasks/rl_align__o_proofs_algebra_9432__f91409df7525ed3f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebra_9432", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_94516__cb1e68a58382ea2c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\ntheorem algebra_94516 : Set.ncard {a : ℤ | ∃ b c d, a > b ∧ b > c ∧ c > d ∧ d > 0 ∧ a + b + c + d = 2010 ∧ a^2 - b^2 + c^2 - d^2 = 2010} = 501 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_94516", "source_license": null, "theorem_names": ["algebra_94516"], "statement_sha256": "cb1e68a58382ea2c71553361fd9440fb379624481ec97f2520a2d62af6509a90", "task_path": "tasks/rl_align__o_proofs_algebra_94516__cb1e68a58382ea2c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_94516", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_96908__32707c70bfa1e21d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Complex Filter Function Metric Finset\nopen scoped BigOperators Topology\n\n\ntheorem algebra_96908 : Set.ncard {x : ℂ | ∃ n : ℤ, x = I ^ n + I ^ (-n)} = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_96908", "source_license": null, "theorem_names": ["algebra_96908"], "statement_sha256": "32707c70bfa1e21d2a193b57953ef338dcfd42fd40461c96de31536166ba263a", "task_path": "tasks/rl_align__o_proofs_algebra_96908__32707c70bfa1e21d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_96908", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_97150__9641ce3efd20d072", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem algebra_97150 {T P : ℕ → ℝ} (hT : ∀ n, T n = ∑ i ∈ Icc 1 n, i)\n (hP : P 2 = T 2 / (T 2 - 1) ∧ ∀ n ≥ 3, P n = P (n - 1) * T n / (T n - 1)) :\n P 1991 = 3 * 1991 / 1993 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_97150", "source_license": null, "theorem_names": ["algebra_97150"], "statement_sha256": "9641ce3efd20d072d3cd7811b8e9ae944c030831222ed7900a95c9cce3def874", "task_path": "tasks/rl_align__o_proofs_algebra_97150__9641ce3efd20d072", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_97150", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_99345__665e18fbffa70cd6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem algebra_99345 {p : ℕ → ℝ}\n (hp : ∀ k, p k = 1 + 1 / k - 1 / k ^ 2 - 1 / k ^ 3) :\n IsLeast {n | 0 < n ∧ ∏ i ∈ Icc 2 n, p i > 2010} 8038 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_99345", "source_license": null, "theorem_names": ["algebra_99345"], "statement_sha256": "665e18fbffa70cd61fb002fc5c07569613cf6dca032223722d3e601da42c1260", "task_path": "tasks/rl_align__o_proofs_algebra_99345__665e18fbffa70cd6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_99345", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebra_complex_filter_Basic__2d0c70459e1ee300", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebra.complex.filter.Basic (f : ℝ → ℝ)\n (hfg : ∀ g : Polynomial ℝ, (g.degree = 2) → f ∘ g.eval = g.eval ∘ f)\n : ∀ x, f x = x := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_complex_filter_Basic", "source_license": null, "theorem_names": ["algebra.complex.filter.Basic"], "statement_sha256": "2d0c70459e1ee3007192edb12b2f88d99936ebda3860e0ec28fb3a709ab4a064", "task_path": "tasks/rl_align__o_proofs_algebra_complex_filter_Basic__2d0c70459e1ee300", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_algebra_complex_filter_Basic", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebraicSum_2__c82679079a7013c9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem algebraicSum (α β : ℝ) (h₁ : α^2 - 2 * α - 7 = 0) (h₂ : β^2 - 2 * β - 7 = 0)\n (h₃ : α ≠ β) (S : ℕ → ℝ) (hS : ∀ r, S r = r / α ^ r + r / β ^ r) :\n ∑' n, S n = 1 / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebraicSum_2", "source_license": null, "theorem_names": ["algebraicSum"], "statement_sha256": "c82679079a7013c975deeb7c2af429368641b4ca3a80a067dcfecac6104f0eed", "task_path": "tasks/rl_align__o_proofs_algebraicSum_2__c82679079a7013c9", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebraicSum_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebraic_157__266914149fdbd18e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem algebraic {n : ℕ} (hn : n ≥ 1) :\n ∃ p : MvPolynomial (Fin 3) ℤ,\n ∀ x y z : ℤ,\n MvPolynomial.eval (λ i => if i = 0 then x + y + z else if i = 1 then x * y + y * z + z * x else if i = 2 then x * y * z else 0) p =\n x ^ n + y ^ n + z ^ n := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebraic_157", "source_license": null, "theorem_names": ["algebraic"], "statement_sha256": "266914149fdbd18ecf8eacfa9edc0d7b455b682d0f97db4ee463a7ffe6361c43", "task_path": "tasks/rl_align__o_proofs_algebraic_157__266914149fdbd18e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebraic_157", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebraic_302__f2f7ae8154822d28", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebraic (a b : ℕ → ℤ)\n (ha : ∀ n, 0 ≤ n ∧ n < 100 → a n = 3 + (n * 4))\n (hb : ∀ m, 0 ≤ m ∧ m < 100 → b m = 2 + (m * 7)):\n ∑ᶠ x ∈ {x | ∃ n m, 0 ≤ n ∧ n < 100 ∧ 0 ≤ m ∧ m < 100 ∧ a n = x ∧ b m = x}, x = 2870 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebraic_302", "source_license": null, "theorem_names": ["algebraic"], "statement_sha256": "f2f7ae8154822d28d3ef576835a323e03d8ab9c55196e59f9ee7b5d2ddbb6a48", "task_path": "tasks/rl_align__o_proofs_algebraic_302__f2f7ae8154822d28", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebraic_302", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_algebraic_608981__3946b74cc7c67af6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem algebraic_608981 (P : MvPolynomial (Fin 2) ℤ)\n (hP : MvPolynomial.eval ![4, 3] P = MvPolynomial.eval ![2, 4] P ∧\n MvPolynomial.eval ![2, 4] P = MvPolynomial.eval ![4, 4] P ∧\n MvPolynomial.eval ![4, 4] P = MvPolynomial.eval ![1, 2] P ∧\n MvPolynomial.eval ![1, 2] P = MvPolynomial.eval ![1, 3] P - 3) :\n ¬∃ R Q : Polynomial ℤ, ∀ x y : ℤ, MvPolynomial.eval (![x, y]) P = R.eval x + Q.eval y := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebraic_608981", "source_license": null, "theorem_names": ["algebraic_608981"], "statement_sha256": "3946b74cc7c67af6c81c16bc8ae283b1772d23bb3b478ff3d34e33b2faee14bd", "task_path": "tasks/rl_align__o_proofs_algebraic_608981__3946b74cc7c67af6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_algebraic_608981", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_angle_ABC_is_60_2__283078e4cbf480ee", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem angle_ABC_is_60 (A B C D : EuclideanSpace ℝ (Fin 2))\n (hAB : dist A B = Real.sqrt 2) (hAD : dist A D = Real.sqrt 6)\n (hAC : dist A C = Real.sqrt 26) (hD : D = midpoint ℝ B C) :\n ∃ θ : ℝ, θ = Real.pi / 3 ∧ cos θ = (dist B A ^ 2 + dist B C ^ 2 - dist C A ^ 2) / (2 * dist B A * dist B C) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_angle_ABC_is_60_2", "source_license": null, "theorem_names": ["angle_ABC_is_60"], "statement_sha256": "283078e4cbf480eef4b4eeb2ed2481379a0b38bac07b97e65ad72723364dbd63", "task_path": "tasks/rl_align__o_proofs_angle_ABC_is_60_2__283078e4cbf480ee", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_angle_ABC_is_60_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_arc_length_4__8a577f10d9569393", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem arc_length : ∫ t in (0:ℝ)..Real.pi, Real.sqrt ((5 - 5 * Real.cos t)^2 + (5 * Real.sin t)^2) = 20 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_arc_length_4", "source_license": null, "theorem_names": ["arc_length"], "statement_sha256": "8a577f10d95693930f7dd261df977dcd18361a714c923e32c16c0d13a1ee4149", "task_path": "tasks/rl_align__o_proofs_arc_length_4__8a577f10d9569393", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_arc_length_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_arccos_area_2__6ac73655ff697b49", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem arccos_area :\n ∫ x in (π/2)..(5*π/2), abs (arccos (sin x)) = π^2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_arccos_area_2", "source_license": null, "theorem_names": ["arccos_area"], "statement_sha256": "6ac73655ff697b49df7c64b8314c650f5e469a8892ba6567a08089bc3b0d6900", "task_path": "tasks/rl_align__o_proofs_arccos_area_2__6ac73655ff697b49", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_arccos_area_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_arcsin_arccos_range__03ded4d92fc5bea7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem arcsin_arccos_range (x : ℝ) (hx : 0 ≤ x ∧ x < 2 * Real.pi) :\n Set.range (fun x => Real.arcsin (Int.floor (Real.sin x)) + Real.arccos (Int.floor (Real.cos x))) =\n {0, Real.pi / 2, Real.pi} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_arcsin_arccos_range", "source_license": null, "theorem_names": ["arcsin_arccos_range"], "statement_sha256": "03ded4d92fc5bea79c6238e003d95f595c3832cb70996ba6522a9469c0ed9ca0", "task_path": "tasks/rl_align__o_proofs_arcsin_arccos_range__03ded4d92fc5bea7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_arcsin_arccos_range", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_area_45__2a5a5847c1e0a357", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem area (f g : ℝ → ℝ)\n (hf : f = λ x => abs (x + 2) - abs (x - 2))\n (hg : g = λ x => abs (x + 1) - abs (x - 3)) :\n ∫ x in (-5)..5, max (g x) (f x) - min (g x) (f x) = 8 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_area_45", "source_license": null, "theorem_names": ["area"], "statement_sha256": "2a5a5847c1e0a35709eed8a055ccf6550a2f8322693b787590a29286266a479c", "task_path": "tasks/rl_align__o_proofs_area_45__2a5a5847c1e0a357", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_area_45", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_area_49__163146d6bd4c1ca2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Complex Filter Function Metric Finset\nopen scoped BigOperators Topology\n\n\ntheorem area (S : Set ℂ) (hS : S = {z | ∃ z1 : ℂ, ‖z1‖ = 1 ∧ ‖z - 7 - 8 * I‖ = ‖z1 ^ 4 + 1 - 2 * z1 ^ 2‖}) :\n (MeasureTheory.volume S).toReal = 16 * Real.pi := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_area_49", "source_license": null, "theorem_names": ["area"], "statement_sha256": "163146d6bd4c1ca2e082d86dcdc5fcbf5b4fc22a2b6d28278a62d9d14b2c7971", "task_path": "tasks/rl_align__o_proofs_area_49__163146d6bd4c1ca2", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_area_49", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_area_between_curves_19__373172d5f57ce426", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem area_between_curves : ∫ x in (0:ℝ)..(1:ℝ), (Real.sqrt x - x ^ 2) = 1 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_area_between_curves_19", "source_license": null, "theorem_names": ["area_between_curves"], "statement_sha256": "373172d5f57ce426a4f47e4e0f40428c68d37dbab09411f852a3baae1510e1f4", "task_path": "tasks/rl_align__o_proofs_area_between_curves_19__373172d5f57ce426", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_area_between_curves_19", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_area_between_curves_24__1874b556937731bf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem area_between_curves : ∫ x in (-1 : ℝ)..1, (2 - 2 * x ^ 2) - (x ^ 2 - 1) = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_area_between_curves_24", "source_license": null, "theorem_names": ["area_between_curves"], "statement_sha256": "1874b556937731bf9dd451e4f4be2782a136f732dc7c74761ec09e1ed6cb0510", "task_path": "tasks/rl_align__o_proofs_area_between_curves_24__1874b556937731bf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_area_between_curves_24", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_area_enclosed_by_curve_line_and_y_axis__f886e919ee328efa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem area_enclosed_by_curve_line_and_y_axis : ∫ x in (0 : ℝ)..4, Real.sqrt x - (x - 2) = 16 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_area_enclosed_by_curve_line_and_y_axis", "source_license": null, "theorem_names": ["area_enclosed_by_curve_line_and_y_axis"], "statement_sha256": "f886e919ee328efaca15e724cb7dcc0f972938a883bc0f30e2d008105fba4c17", "task_path": "tasks/rl_align__o_proofs_area_enclosed_by_curve_line_and_y_axis__f886e919ee328efa", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_area_enclosed_by_curve_line_and_y_axis", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_area_under_cos_curve_2__d3bc9aa56cc9737e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem area_under_cos_curve : ∫ x in (0 : ℝ)..(3/2 * Real.pi), abs (Real.cos x) = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_area_under_cos_curve_2", "source_license": null, "theorem_names": ["area_under_cos_curve"], "statement_sha256": "d3bc9aa56cc9737e95cee5ec6ad51de2c69bb739b7a6d907ad7c846497eb257c", "task_path": "tasks/rl_align__o_proofs_area_under_cos_curve_2__d3bc9aa56cc9737e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_area_under_cos_curve_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_area_under_cos_curve__8a6cfb64a2b4624c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem area_under_cos_curve : ∫ x in (0:ℝ)..(3 * Real.pi / 2), |Real.cos x| = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_area_under_cos_curve", "source_license": null, "theorem_names": ["area_under_cos_curve"], "statement_sha256": "8a6cfb64a2b4624c2889aee9dcbfdca95a6603d0a2643a9d0881cc4ece3d87b9", "task_path": "tasks/rl_align__o_proofs_area_under_cos_curve__8a6cfb64a2b4624c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_area_under_cos_curve", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_area_under_f_2__1a3b651ccb2684bb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem area_under_f : ∫ x in (1/4)..2, max (x^2) (Real.sqrt x) = 35 / 12 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_area_under_f_2", "source_license": null, "theorem_names": ["area_under_f"], "statement_sha256": "1a3b651ccb2684bb31b211ada3d0d4a5bd31ddb1c0b41809589538028f7cc422", "task_path": "tasks/rl_align__o_proofs_area_under_f_2__1a3b651ccb2684bb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_area_under_f_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_arithmetic_progression_5__00dc8605792170b3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem arithmetic_progression : Set.Infinite {n | ∃ k, n = 18 + 19 * k ∧ Nat.digits 10 n = List.reverse (Nat.digits 10 n)} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_arithmetic_progression_5", "source_license": null, "theorem_names": ["arithmetic_progression"], "statement_sha256": "00dc8605792170b39a45e4ce6e604d886540ce5946d5ea0dcff219b28a2cbc33", "task_path": "tasks/rl_align__o_proofs_arithmetic_progression_5__00dc8605792170b3", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_arithmetic_progression_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_arithmetico_geometric_series__6500abbb3763bfda", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem arithmetico_geometric_series (a : ℕ → ℝ) (h₀ : ∀ n ≥ 0, a n = (n + 2) * (1 / 3) ^ (n + 3)) :\n ∑' n : ℕ, a n = 5 / 36 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_arithmetico_geometric_series", "source_license": null, "theorem_names": ["arithmetico_geometric_series"], "statement_sha256": "6500abbb3763bfdabd40c97042934041f7bcd3bd6946b975b16a829f26e815ed", "task_path": "tasks/rl_align__o_proofs_arithmetico_geometric_series__6500abbb3763bfda", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_arithmetico_geometric_series", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_at_least_16_left__6a0f934847a0571a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem at_least_16_left : ∃ (final_set : Finset ℕ), final_set ⊆ Finset.Icc 1 33 ∧\n (∀ a ∈ final_set, ∀ b ∈ final_set, a ≠ b → ¬∃ k : ℕ, a * b = k ^ 2) ∧\n final_set.card ≥ 16 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_at_least_16_left", "source_license": null, "theorem_names": ["at_least_16_left"], "statement_sha256": "6a0f934847a0571af3fa414c6982cab1a49aebdce00be7e42aa14f96913049e7", "task_path": "tasks/rl_align__o_proofs_at_least_16_left__6a0f934847a0571a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_at_least_16_left", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_average_17__f55ac12670a5889b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem average (S : Set ℝ) (hS : S = {x : ℝ | Real.sqrt (2 * x ^ 2 + 1) = Real.sqrt 19}) :\n (∑ᶠ x ∈ S, x) / (∑ᶠ x ∈ S, 1) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_average_17", "source_license": null, "theorem_names": ["average"], "statement_sha256": "f55ac12670a5889b9ec7dd08da1b02906256f60327a3686c3f4e9d2112727658", "task_path": "tasks/rl_align__o_proofs_average_17__f55ac12670a5889b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_average_17", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_average_t__e5d9149e1342cef9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem average_t : (∑ᶠ t ∈ {t : ℤ | ∃ x y : ℕ, x > 0 ∧ y > 0 ∧ x ≠ y ∧ x ^ 2 - 5 * x + t = 0 ∧ y ^ 2 - 5 * y + t = 0}, t) / {t : ℤ | ∃ x y : ℕ, x > 0 ∧ y > 0 ∧ x ≠ y ∧ x ^ 2 - 5 * x + t = 0 ∧ y ^ 2 - 5 * y + t = 0}.ncard = 5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_average_t", "source_license": null, "theorem_names": ["average_t"], "statement_sha256": "e5d9149e1342cef96e4e3353d82383198167dde09c3d47cdd80275bfda1d97dd", "task_path": "tasks/rl_align__o_proofs_average_t__e5d9149e1342cef9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_average_t", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_c__6ea258aa32465b15", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem c : ∀ n : ℕ, ∀ a ω : ℝ, ∀ c : ℕ → ℝ,\n ∑ k ∈ range (n + 1), ∑ i ∈ (range (k + 1)), c k * Nat.choose k i * a^(k - i) * ω^i =\n ∑ i ∈ range (n + 1), ∑ k ∈ (Icc i n), c k * Nat.choose k i * a^(k - i) * ω^i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_c", "source_license": null, "theorem_names": ["c"], "statement_sha256": "6ea258aa32465b15e5254639417d85dd62801b90fbed067facfe35f56033ab18", "task_path": "tasks/rl_align__o_proofs_c__6ea258aa32465b15", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_c", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_c_n_growth__d61b63acaa2c481c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem c_n_growth (c : ℕ → ℝ) (h₀ : c 0 = 1) (h₁ : ∀ n, c (n + 1) = c n + 1 / c n) : Filter.Tendsto c Filter.atTop Filter.atTop := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_c_n_growth", "source_license": null, "theorem_names": ["c_n_growth"], "statement_sha256": "d61b63acaa2c481c7500c822427779157f6c9535e37d1694b3a55f3f8f986a5b", "task_path": "tasks/rl_align__o_proofs_c_n_growth__d61b63acaa2c481c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_c_n_growth", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculateIntegral_2__5a391907e68924c9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem calculateIntegral (f : ℝ → ℝ → ℝ)\n (hf : f = λ x y => y - x ^ 2 + 1) :\n ∫ x in {x | ∃ y, f x y ≥ 0 ∧ y ≤ 0}, ∫ y in {y | f x y ≥ 0 ∧ y ≤ 0},\n (deriv (λ x => f x y) x) ^ 2 + (deriv (λ y => f x y) y) ^ 2 = 12 / 5 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculateIntegral_2", "source_license": null, "theorem_names": ["calculateIntegral"], "statement_sha256": "5a391907e68924c9131a3b8f2418f3e22a0e390c74e26bd58dfc3a3a65234aaa", "task_path": "tasks/rl_align__o_proofs_calculateIntegral_2__5a391907e68924c9", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculateIntegral_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculate_volume_2__f44533f9752ca9e9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem calculate_volume :\n ∫ x in (0)..1, ∫ y in (0)..1, sqrt (x^2 - 2*x*y + y^2) = 1/3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculate_volume_2", "source_license": null, "theorem_names": ["calculate_volume"], "statement_sha256": "f44533f9752ca9e9e300a5a40e0c814038f3f08e2aeb923218743e0fa61cb4f9", "task_path": "tasks/rl_align__o_proofs_calculate_volume_2__f44533f9752ca9e9", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculate_volume_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculate_volume__3e7da5868f3a4517", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem calculate_volume :\n ∫ y in (0)..3, ∫ x in (0)..(6 - 2 * y), max (x ^ 2 + 2 * y ^ 2) 0 = 81 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculate_volume", "source_license": null, "theorem_names": ["calculate_volume"], "statement_sha256": "3e7da5868f3a451766f7b06879411103caa19f8c28f48b422b7e2facd05856ad", "task_path": "tasks/rl_align__o_proofs_calculate_volume__3e7da5868f3a4517", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculate_volume", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_133472__f5fcd03d49228ad6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem calculus_133472 :\n Tendsto (λ x => (5^(2*x) - 2^(3*x))/(sin x + sin (x^2))) (𝓝[≠] 0) (𝓝 (log (25/8))) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_133472", "source_license": null, "theorem_names": ["calculus_133472"], "statement_sha256": "f5fcd03d49228ad6e6374b2bf84cad662088fba3b6d028c65bffe1b75d50c155", "task_path": "tasks/rl_align__o_proofs_calculus_133472__f5fcd03d49228ad6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_133472", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_134423__c4a964a1f708733c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem calculus_134423 : ∫ x in (Real.pi / 2)..(2 * Real.pi), 2^8 * (Real.sin x)^4 * (Real.cos x)^4 = 9 * Real.pi := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_134423", "source_license": null, "theorem_names": ["calculus_134423"], "statement_sha256": "c4a964a1f708733c6529946048cc0851fb51f30d269a631548570ecc8d591358", "task_path": "tasks/rl_align__o_proofs_calculus_134423__c4a964a1f708733c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_134423", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_134748__65ee93dcf5f44eab", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem calculus_134748 : ∫ x in (0)..(2 * Real.pi), (Real.sin (x / 4))^6 * (Real.cos (x / 4))^2 = 5 * Real.pi / 64 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_134748", "source_license": null, "theorem_names": ["calculus_134748"], "statement_sha256": "65ee93dcf5f44eabe6d63a05879ac875dfc448309e83f7060732be17f86b6a92", "task_path": "tasks/rl_align__o_proofs_calculus_134748__65ee93dcf5f44eab", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_134748", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_134904__b1edcbaff3f2edac", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem calculus_134904 : ∫ x in (0)..Real.pi, 2^4 * (Real.sin (x/2))^2 * (Real.cos (x/2))^6 = 5*Real.pi/8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_134904", "source_license": null, "theorem_names": ["calculus_134904"], "statement_sha256": "b1edcbaff3f2edac3ee70543bddd39007f366d8d37bab19293af1281c7eec4d0", "task_path": "tasks/rl_align__o_proofs_calculus_134904__b1edcbaff3f2edac", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_134904", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_137208__78d123514d24abe3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem calculus_137208 :\n Tendsto (λ x => (Real.tan (4 * x) / x) ^ (2 + x)) (𝓝[≠] 0) (𝓝 16) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_137208", "source_license": null, "theorem_names": ["calculus_137208"], "statement_sha256": "78d123514d24abe32caaf06880a0c8d3dc4c93f39349292c441300db00fe0ec3", "task_path": "tasks/rl_align__o_proofs_calculus_137208__78d123514d24abe3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_137208", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_140360__b60a51e9544fbe33", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem calculus_140360 :\n Tendsto (λ n => Real.sqrt (n + 2) * (Real.sqrt (n + 3) - Real.sqrt (n - 4))) atTop (𝓝 (7/2)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_140360", "source_license": null, "theorem_names": ["calculus_140360"], "statement_sha256": "b60a51e9544fbe335e39a0ebfa2046385e08dccae3547929a682f36846add925", "task_path": "tasks/rl_align__o_proofs_calculus_140360__b60a51e9544fbe33", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_140360", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_140863__0962a87e78ea9e79", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem calculus_140863 : ∫ x in (0)..2, sqrt (4 - x^2) = Real.pi := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_140863", "source_license": null, "theorem_names": ["calculus_140863"], "statement_sha256": "0962a87e78ea9e79ad3d81c885080a6f19542809192af959b31acb1c646f9427", "task_path": "tasks/rl_align__o_proofs_calculus_140863__0962a87e78ea9e79", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_140863", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_141811__acbe5742d4a8df48", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem calculus_141811 :\n Tendsto (λ x => (Real.sin (5 * (x + Real.pi))) / (Real.exp (3 * x) - 1)) (𝓝[≠] 0) (𝓝 (-5 / 3)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_141811", "source_license": null, "theorem_names": ["calculus_141811"], "statement_sha256": "acbe5742d4a8df481ab91fcf0cb72eb79dac696798d76f4a84aeeb947e6cf38c", "task_path": "tasks/rl_align__o_proofs_calculus_141811__acbe5742d4a8df48", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_141811", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_141843__97635d90c9c91c3b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem calculus_141843 :\n Tendsto (λ x => (Real.exp (2 * x) - Real.exp (-5 * x)) / (2 * Real.sin x - Real.tan x)) (𝓝[≠] 0) (𝓝 7) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_141843", "source_license": null, "theorem_names": ["calculus_141843"], "statement_sha256": "97635d90c9c91c3bd6ed75c3228b3c7fd8fc1b089440fa150d0a3367a7ca6f50", "task_path": "tasks/rl_align__o_proofs_calculus_141843__97635d90c9c91c3b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_141843", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_144031__a488d9023c8fbfe7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem calculus_144031 :\n Tendsto (λ x => (exp (2 * x) - exp (3 * x)) / (arctan x - x ^ 2)) (𝓝[≠] 0) (𝓝 (-1)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_144031", "source_license": null, "theorem_names": ["calculus_144031"], "statement_sha256": "a488d9023c8fbfe76a10ce5fa65adec3436e57b62d87f4cd698719d1dc2a7dd4", "task_path": "tasks/rl_align__o_proofs_calculus_144031__a488d9023c8fbfe7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_144031", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_147066__bf9abff05a55a9d9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem calculus_147066 (f : ℝ → ℝ) (hf : f = λ θ => 5 * exp (5 * θ / 12)) :\n ∫ θ in (0)..(π/3), sqrt ((deriv f θ)^2 + (f θ)^2) = 13 * (exp (5 * π / 36) - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_147066", "source_license": null, "theorem_names": ["calculus_147066"], "statement_sha256": "bf9abff05a55a9d94c37786adfe826c7beded32686d06879fb7fc58aff737c9d", "task_path": "tasks/rl_align__o_proofs_calculus_147066__bf9abff05a55a9d9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_147066", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_148218__0875f79777d65894", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem calculus_148218 :\n Tendsto (λ x => (7^(2*x) - 5^(3*x))/(2*x - arctan (3*x))) (𝓝[≠] 0) (𝓝 (log (125/49))) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_148218", "source_license": null, "theorem_names": ["calculus_148218"], "statement_sha256": "0875f79777d6589446e9f5961fcad5a0eb6186cde1b84b51b9c563e631c4c560", "task_path": "tasks/rl_align__o_proofs_calculus_148218__0875f79777d65894", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_148218", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_152421__5c50eb03305e81b6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem calculus_152421 (f : ℝ → ℝ × ℝ)\n (hf : f = λ t => ((t^2 - 2) * sin t + 2 * t * cos t, (2 - t^2) * cos t + 2 * t * sin t)) :\n ∫ t in (0)..(Real.pi / 3), Real.sqrt ((deriv f t).1^2 + (deriv f t).2^2) = (Real.pi^3) / 81 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_152421", "source_license": null, "theorem_names": ["calculus_152421"], "statement_sha256": "5c50eb03305e81b69c371d8ca5562d385c1fe88685a0afe2ea1073a5be73746f", "task_path": "tasks/rl_align__o_proofs_calculus_152421__5c50eb03305e81b6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_152421", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_152730__162b890770d77412", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem calculus_152730 (f : ℝ → ℝ × ℝ)\n (hf : f = λ t => (4 * (cos t)^3, 4 * (sin t)^3)) :\n ∫ t in (π/6)..(π/4), Real.sqrt ((deriv f t).1^2 + (deriv f t).2^2) = 3/2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_152730", "source_license": null, "theorem_names": ["calculus_152730"], "statement_sha256": "162b890770d77412bd73ed6affed61e0898b11e764a37adebdb31fe8a6267bda", "task_path": "tasks/rl_align__o_proofs_calculus_152730__162b890770d77412", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_152730", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_155130__0d607822b1c2ba4d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem calculus_155130 :\n Tendsto (λ x => (3 * x ^ 2 + 5 * x + 1) / (x ^ 2 - 2)) atTop (𝓝 3) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_155130", "source_license": null, "theorem_names": ["calculus_155130"], "statement_sha256": "0d607822b1c2ba4d9389d0b1ef8f7facd69839e566d308a35ae40df8925f1ad4", "task_path": "tasks/rl_align__o_proofs_calculus_155130__0d607822b1c2ba4d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_155130", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_164671__84cf70456f26b40b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem calculus_164671 : ∫ y in (0)..8, max (8 * y - y ^ 2 - 7) 0 = 36 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_164671", "source_license": null, "theorem_names": ["calculus_164671"], "statement_sha256": "84cf70456f26b40b6e833389a517afb53e9584db6a5b0f79159a9b1f09fb6944", "task_path": "tasks/rl_align__o_proofs_calculus_164671__84cf70456f26b40b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_164671", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_17082__086fbf75eeed6c13", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem calculus_17082:\n ( {(1,2,-2,-9)}: Set (ℤ × ℤ × ℤ × ℤ)) = {(A, B, C, D) : ℤ × ℤ × ℤ × ℤ |\n A > 0 ∧\n Int.gcd (Int.gcd (Int.gcd (Int.natAbs A) (Int.natAbs B)) (Int.natAbs C)) (Int.natAbs D) = 1 ∧\n A * (-3) + B * 4 + C * (-2) + D = 0 ∧\n A * 1 + B * 4 + C * 0 + D = 0 ∧\n A * 3 + B * 2 + C * (-1) + D = 0 } := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_17082", "source_license": null, "theorem_names": ["calculus_17082"], "statement_sha256": "086fbf75eeed6c13d6590934013477b9161732f41d337c4fdc807046e04c8773", "task_path": "tasks/rl_align__o_proofs_calculus_17082__086fbf75eeed6c13", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_17082", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_1818__6da615e1828028c6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem calculus_1818 {f : ℝ → ℝ} (hf : ContinuousOn f (Set.Icc 0 2))\n (hf' : DifferentiableOn ℝ f (Set.Icc 0 2 \\ {1})) (h : Tendsto (deriv f) (𝓝 1) (𝓝 2013)) :\n DifferentiableAt ℝ f 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_1818", "source_license": null, "theorem_names": ["calculus_1818"], "statement_sha256": "6da615e1828028c618599274320845cf1ee13993437e17a2d309165b19a232de", "task_path": "tasks/rl_align__o_proofs_calculus_1818__6da615e1828028c6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_1818", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_190219__1c83f030e672d620", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem calculus_190219 :\n ∃ f : ℝ → ℝ, ∃ x₀ δ : ℝ, δ > 0 ∧\n DifferentiableOn ℝ f (Set.Ioo (x₀-δ) (x₀+δ)) ∧\n IsMaxOn f (Set.Ioo (x₀-δ) (x₀+δ)) x₀ ∧\n ¬∃ δ' : ℝ, δ' > 0 ∧ δ' < δ ∧\n ∀ x ∈ Set.Ioo (x₀-δ') x₀, deriv f x > 0 ∧\n ∀ x ∈ Set.Ioo x₀ (x₀+δ'), deriv f x < 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_190219", "source_license": null, "theorem_names": ["calculus_190219"], "statement_sha256": "1c83f030e672d6206fd55d13dda416c29c1b025f5aeca0af0d917926315d84fb", "task_path": "tasks/rl_align__o_proofs_calculus_190219__1c83f030e672d620", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_190219", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_22019__7d734314892a0eaa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nopen Matrix Real\ntheorem calculus_22019 {A : Matrix (Fin 2) (Fin 2) ℝ}\n (hA : A = !![15, 25; -9, -15]) :\n ∑' n : ℕ, (n + 1) * A ^ n = !![31, 50; -18, -29] := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_22019", "source_license": null, "theorem_names": ["calculus_22019"], "statement_sha256": "7d734314892a0eaac962757a522145e6b84f08359ddd045ea4aa50f39e15dc23", "task_path": "tasks/rl_align__o_proofs_calculus_22019__7d734314892a0eaa", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_22019", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_228944__0c9cd66f7e59ea61", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem calculus_228944 : ∫ x in (0)..(π/2), sin (sin x) ^ 2 + cos (cos x) ^ 2 = (π/2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_228944", "source_license": null, "theorem_names": ["calculus_228944"], "statement_sha256": "0c9cd66f7e59ea612ba53ec66d23265a054377add8c01ca0fce9510e1483741d", "task_path": "tasks/rl_align__o_proofs_calculus_228944__0c9cd66f7e59ea61", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_228944", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_47102__d1f6bc9801bfc26a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem calculus_47102 (S : ℝ → ℝ)\n (hS : ∀ t > 0, S t = ∫ x in Set.Icc 0 (1 / t), exp (t ^ 2 * x)) :\n ∀ t > 0, S t > 4 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_47102", "source_license": null, "theorem_names": ["calculus_47102"], "statement_sha256": "d1f6bc9801bfc26a22e492bd21226b2a936b9d7fa4a2dadb35de321c2b42e58c", "task_path": "tasks/rl_align__o_proofs_calculus_47102__d1f6bc9801bfc26a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_47102", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_64129__9d4f065c7bf7cbe6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\ntheorem calculus_64129 (f : ℝ → ℝ) (h₀ : ∃ a b, f = fun x => a * x + b)\n (h₁ : ∫ x in (3)..5, f x = 0) (h₂ : ∫ x in (5)..7, f x = 12) :\n deriv f = fun _ => 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_64129", "source_license": null, "theorem_names": ["calculus_64129"], "statement_sha256": "9d4f065c7bf7cbe6a84f365115c9529c8e136992ac5695e1d70034aeb7ccdf76", "task_path": "tasks/rl_align__o_proofs_calculus_64129__9d4f065c7bf7cbe6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_64129", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_657__fa8d35413a5250e1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem calculus_657 :\n Tendsto (λ x => (Real.arcsin (x + 1 / 2) - π / 6) / x) (𝓝[≠] 0) (𝓝 (2 * Real.sqrt 3 / 3)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_657", "source_license": null, "theorem_names": ["calculus_657"], "statement_sha256": "fa8d35413a5250e1a424c97ae9db04276c2284263ac4a2f42ec030327fad959d", "task_path": "tasks/rl_align__o_proofs_calculus_657__fa8d35413a5250e1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_657", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_7007__6ed7504f24d0edf7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped BigOperators Topology\n\n\ntheorem calculus_7007 (X : ℕ → ℝ)\n (hX : ∀ n, X n = ∫ x in Set.Ioi 1, n * exp (-x)) :\n ¬ Summable X := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_7007", "source_license": null, "theorem_names": ["calculus_7007"], "statement_sha256": "6ed7504f24d0edf746ef3c4a80b219b102689031bf091274f6a81d3b048fec43", "task_path": "tasks/rl_align__o_proofs_calculus_7007__6ed7504f24d0edf7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_calculus_7007", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_calculus_87086__3b9ab01ffc8e8c24", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem calculus_87086 {a : ℝ} (f : ℝ → ℝ)\n (h₀ : ∀ x, 3 < x ∧ x < 5 → f x = a / (x - 1) + 1 / (x - 2) + 1 / (x - 6))\n (h₁ : DifferentiableOn ℝ f (Set.Ioo 3 5)) :\n deriv f 4 = 0 ↔ a = -9 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_87086", "source_license": null, "theorem_names": ["calculus_87086"], "statement_sha256": "3b9ab01ffc8e8c2476af3f0eaccf8f4482ff04960b9e7cafd21d1cb956b74f0b", "task_path": "tasks/rl_align__o_proofs_calculus_87086__3b9ab01ffc8e8c24", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_calculus_87086", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_campers_problem__0a686815a54dd327", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem campers_problem\n (S A R : Finset ℕ)\n (h_size_S : S.card = 20)\n (h_size_A : A.card = 20)\n (h_size_R : R.card = 20)\n (h_one : (S \\ (A ∪ R)).card + (A \\ (S ∪ R)).card + (R \\ (S ∪ A)).card = 24)\n (h_all : (S ∩ A ∩ R).card = 4)\n : (S ∩ A).card + (A ∩ R).card + (R ∩ S).card - 3 * ((S ∩ A ∩ R).card) = 12 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_campers_problem", "source_license": null, "theorem_names": ["campers_problem"], "statement_sha256": "0a686815a54dd327f1dd485d8080001c689c87025f0aadfcf374a48448b3e979", "task_path": "tasks/rl_align__o_proofs_campers_problem__0a686815a54dd327", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_campers_problem", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_can_obtain_non_negative_rows_columns__dd7ea5f0776d6ff7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem can_obtain_non_negative_rows_columns (m n : ℕ) (A : Matrix (Fin m) (Fin n) ℝ) : ∃ (A' : Matrix (Fin m) (Fin n) ℝ), (∀ i j, A' i j = A i j ∨ A' i j = -A i j) ∧ (∀ i, ∑ j, A' i j ≥ 0) ∧ (∀ j, ∑ i, A' i j ≥ 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_can_obtain_non_negative_rows_columns", "source_license": null, "theorem_names": ["can_obtain_non_negative_rows_columns"], "statement_sha256": "dd7ea5f0776d6ff76a988eb624cb1a5244c625797da26c6483f9c8bfa77f2dbb", "task_path": "tasks/rl_align__o_proofs_can_obtain_non_negative_rows_columns__dd7ea5f0776d6ff7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_can_obtain_non_negative_rows_columns", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_cardSum__4f8f18c75911dd51", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem cardSum (S : Finset ℕ) (hS : S ⊆ Finset.Icc 1 8) :\n S.card = 3 ∧ ∑ x ∈ S, x = 9 ↔\n (S = {1, 2, 6} ∨ S = {1, 3, 5} ∨ S = {2, 3, 4}) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_cardSum", "source_license": null, "theorem_names": ["cardSum"], "statement_sha256": "4f8f18c75911dd510418f227d918fb47a75c0ec4442c98295e539eb75dbdd22a", "task_path": "tasks/rl_align__o_proofs_cardSum__4f8f18c75911dd51", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_cardSum", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_cardiology_2__5ca14fb5406ce13f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem cardiology (f : ℝ → ℝ) (hf : f = λ φ => 2 * (1 + cos φ)) :\n ∫ φ in (0)..(2 * π), Real.sqrt ((deriv f φ)^2 + (f φ)^2) = 16 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_cardiology_2", "source_license": null, "theorem_names": ["cardiology"], "statement_sha256": "5ca14fb5406ce13f26eb53f33bd2c95112e5d76feeea5bbd0a372cfa27178cb3", "task_path": "tasks/rl_align__o_proofs_cardiology_2__5ca14fb5406ce13f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_cardiology_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_chord_trisected_by_radii__c1a3afe7a886fdc1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem chord_trisected_by_radii (O A B : ℝ × ℝ) (r : ℝ) (θ : ℝ) (h₁ : dist O A = r) (h₂ : dist O B = r) (h₃ : 0 < 2 * θ) (h₄ : 2 * θ < 2 * Real.pi) (h₅ : dist A B = 2 * r * sin θ) (h₆ : ¬ A = B) :\n ∃ (P Q : ℝ × ℝ), P ≠ Q ∧ dist O P = r ∧ dist O Q = r ∧ dist A P = dist P Q ∧ dist P Q = dist Q B := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_chord_trisected_by_radii", "source_license": null, "theorem_names": ["chord_trisected_by_radii"], "statement_sha256": "c1a3afe7a886fdc1e19c8958338d96ab7a63be8a4995982986be69f81b8db0ae", "task_path": "tasks/rl_align__o_proofs_chord_trisected_by_radii__c1a3afe7a886fdc1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_chord_trisected_by_radii", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_colorings_4__f08f9b5c87091239", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem colorings :\n Set.ncard {f : Finset.Icc 1 20 → Fin 2 | (∀ x, f x = 0 ∨ f x = 1) ∧\n (∃ y, f y = 0) ∧ (∃ z, f z = 1) ∧\n Nat.gcd (∏ i, if f i = 0 then i else 1) (∏ i, if f i = 1 then i else 1) = 1} = 62 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_colorings_4", "source_license": null, "theorem_names": ["colorings"], "statement_sha256": "f08f9b5c870912392da7c9a9753a1fa7f0d623af28d58947df2ce4899fdfb60b", "task_path": "tasks/rl_align__o_proofs_colorings_4__f08f9b5c87091239", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_colorings_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_combinatorial_identity_10__6e5f544b5f08cf45", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem combinatorial_identity {n m : ℕ} (hn : 0 < n) (hm : 0 ≤ m ∧ m ≤ n) :\n ∑ k ∈ Icc m n, Nat.choose n k * Nat.choose k m = Nat.choose n m * 2^(n - m) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_combinatorial_identity_10", "source_license": null, "theorem_names": ["combinatorial_identity"], "statement_sha256": "6e5f544b5f08cf452788fd612d681615204e740a451ff19d68ea0f363d61e831", "task_path": "tasks/rl_align__o_proofs_combinatorial_identity_10__6e5f544b5f08cf45", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_combinatorial_identity_10", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_combinatorial_identity_4__c00b0f449af55c56", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem combinatorial_identity (n : ℕ) :\n ∑ k ∈ range (n + 1), Nat.choose n k * Nat.choose n (n - k) =\n Nat.choose (2 * n) n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_combinatorial_identity_4", "source_license": null, "theorem_names": ["combinatorial_identity"], "statement_sha256": "c00b0f449af55c563f74268ddf8cc89c2f83c564253e1fe46a478dc728d79ec0", "task_path": "tasks/rl_align__o_proofs_combinatorial_identity_4__c00b0f449af55c56", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_combinatorial_identity_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_combinatorial_method__2dbfd470630241d5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem combinatorial_method {n : ℕ} (hn : n > 0) :\n ∑ k ∈ Icc 1 n, k * (n + 1 - k) = Nat.choose (n + 2) 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_combinatorial_method", "source_license": null, "theorem_names": ["combinatorial_method"], "statement_sha256": "2dbfd470630241d51a2246577bf7f9451f41e0f0adc3c3c1dec25f5dc2ddcb8e", "task_path": "tasks/rl_align__o_proofs_combinatorial_method__2dbfd470630241d5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_combinatorial_method", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_combinatorial_sum__540424d137cc5b40", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem combinatorial_sum {n : ℕ} (hn : 2 ≤ n) :\n ∑ i ∈ range n, Nat.choose (2 * i + 2) 2 =\n n * (n + 1) * (4 * n - 1) / 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_combinatorial_sum", "source_license": null, "theorem_names": ["combinatorial_sum"], "statement_sha256": "540424d137cc5b40ba130332678d5eb9d879af8a499ace03f2ddd188a11d70b9", "task_path": "tasks/rl_align__o_proofs_combinatorial_sum__540424d137cc5b40", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_combinatorial_sum", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_conclusion_1_14__4976659b8200c58a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem conclusion_1 : ∃ x : ℝ, x ∈ Set.Ioo (-2) 0 ∧ deriv (fun x => x^2 * Real.exp x) x < 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_conclusion_1_14", "source_license": null, "theorem_names": ["conclusion_1"], "statement_sha256": "4976659b8200c58a4616c9561d76b480f8b4c1adb50a5258b197583e0c4d4c06", "task_path": "tasks/rl_align__o_proofs_conclusion_1_14__4976659b8200c58a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_conclusion_1_14", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_construct_circle_2__5c19d928cf6030f1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem construct_circle (r : ℝ) (hr : r = 2.5) (P : EuclideanSpace ℝ (Fin 2))\n (hP : dist P (0 : EuclideanSpace ℝ (Fin 2)) = 7) :\n ∃ T1 T2 : EuclideanSpace ℝ (Fin 2), T1 ≠ T2 ∧\n dist P T1 = dist P T2 ∧\n dist T1 (0 : EuclideanSpace ℝ (Fin 2)) = r ∧\n dist T2 (0 : EuclideanSpace ℝ (Fin 2)) = r := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_construct_circle_2", "source_license": null, "theorem_names": ["construct_circle"], "statement_sha256": "5c19d928cf6030f1498c1d4b7d75619358f7786dc3fbad3f1ec906aa4d27e26c", "task_path": "tasks/rl_align__o_proofs_construct_circle_2__5c19d928cf6030f1", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_construct_circle_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_contraction_mapping_2__05016553df2f19d7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem contraction_mapping\n (T : ℚ → ℚ)\n (hT : T = λ x => x / 2 + 1 / x) :\n ∃ α, ∀ x y, x ∈ {x | 1 ≤ x} → y ∈ {x | 1 ≤ x} →\n dist (T x) (T y) ≤ α * dist x y ∧ α = 1 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_contraction_mapping_2", "source_license": null, "theorem_names": ["contraction_mapping"], "statement_sha256": "05016553df2f19d76e138826967e4c75f54f48bc497c4fa9f2aa68f5dca1bb3b", "task_path": "tasks/rl_align__o_proofs_contraction_mapping_2__05016553df2f19d7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_contraction_mapping_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_correct_second_number__5e86eeeef8da70ab", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem correct_second_number (a : Fin 10 → ℕ) (x y : ℕ) (h₁ : ∑ i : Fin 10, a i = 402) (h₂ : a 0 = x + 16) (h₃ : a 1 = 13) : ∃ z : ℕ, (∑ i : Fin 10, if i = 0 then x else if i = 1 then z else a i) / 10 = 40 ∧ z = 27 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_correct_second_number", "source_license": null, "theorem_names": ["correct_second_number"], "statement_sha256": "5e86eeeef8da70ab3d06d8e45ca3894a685623b17db7cf0032d82985c0277b0c", "task_path": "tasks/rl_align__o_proofs_correct_second_number__5e86eeeef8da70ab", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_correct_second_number", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_cos_diff_2__830dd94cc8b328c9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem cos_diff (f g h : ℝ → ℝ) (hf : f = λ t => cos t)\n (hg : g = λ u => ∫ t in (1)..u, f t) (hh : h = λ x => ∫ t in (1)..(x^2), f t) :\n deriv h = λ x => 2 * x * cos (x ^ 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_cos_diff_2", "source_license": null, "theorem_names": ["cos_diff"], "statement_sha256": "830dd94cc8b328c95f14d848ed9fcc5038b00af9c573b4764d6729a6289c709a", "task_path": "tasks/rl_align__o_proofs_cos_diff_2__830dd94cc8b328c9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_cos_diff_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_countLegalPhoneNumbers__a4ebacb5e98ced75", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem countLegalPhoneNumbers :\n Set.ncard {a : Fin 7 → ℕ | (∀ i, a i < 10) ∧ (a 0 * 100 + a 1 * 10 + a 2 = a 3 * 100 + a 4 * 10 + a 5 ∨ a 0 * 100 + a 1 * 10 + a 2 = a 4 * 100 + a 5 * 10 + a 6)} = 19990 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_countLegalPhoneNumbers", "source_license": null, "theorem_names": ["countLegalPhoneNumbers"], "statement_sha256": "a4ebacb5e98ced75396a42eb5a8de6b5c9509a869a4f6b2dc4996e4e59b2db0f", "task_path": "tasks/rl_align__o_proofs_countLegalPhoneNumbers__a4ebacb5e98ced75", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_countLegalPhoneNumbers", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_201__a85cb5a3eb188602", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem count :\n Set.ncard {(m, n) : ℕ × ℕ | m > 0 ∧ n > 0 ∧ m ≤ n ∧ Nat.lcm m n = 600} = 53 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_count_201", "source_license": null, "theorem_names": ["count"], "statement_sha256": "a85cb5a3eb188602d3f6bf9f75c0eff6de4e63ef27bfacdabe79c0da87a27d6d", "task_path": "tasks/rl_align__o_proofs_count_201__a85cb5a3eb188602", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_count_201", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_25__eb6bb44084f8377b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem count :\n Set.ncard {p : Fin 6 → ℕ | p.Injective ∧ (∀ i, p i ∈ Finset.Icc 1 6) ∧\n p 0 < p 1 ∧ p 1 < p 2 ∧ p 3 < p 4 ∧ p 4 < p 5 ∧ p 0 < p 3 ∧ p 1 < p 4 ∧ p 2 < p 5} = 5 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_count_25", "source_license": null, "theorem_names": ["count"], "statement_sha256": "eb6bb44084f8377bccb1721444a054f3e15102bd0c622d8adae2ff0a843ca69b", "task_path": "tasks/rl_align__o_proofs_count_25__eb6bb44084f8377b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_count_25", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_305__3bfd1d6450adfbd2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem count :\n Set.ncard {n : ℕ | n ∈ Finset.Icc 1000000 9999999 ∧ ¬(7 = (Nat.digits 10 n).headI) ∧ ¬(7 = (Nat.digits 10 n).tail.tail.tail.tail.tail.tail.headI)} = 7200000 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_count_305", "source_license": null, "theorem_names": ["count"], "statement_sha256": "3bfd1d6450adfbd21f5d4643d68bb770f5d8de1bfffd6f5e6920a2c0b0df3164", "task_path": "tasks/rl_align__o_proofs_count_305__3bfd1d6450adfbd2", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_count_305", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_35__2d384ff12f4a7d4a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem count : Set.encard {p : ℝ × ℝ | p.1 ^ 2 * 16 + p.2 ^ 2 * 25 = 360 ∧ p.1 * p.2 = 1} = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_count_35", "source_license": null, "theorem_names": ["count"], "statement_sha256": "2d384ff12f4a7d4a9b331d077e097f020474bed4397db6a1fa15740a02ea08b4", "task_path": "tasks/rl_align__o_proofs_count_35__2d384ff12f4a7d4a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_count_35", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_367__f60861383e05224c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem count :\n Set.ncard { (a, b) : ℤ × ℤ | a ∣ 720 ∧ b ∣ 720 ∧ ¬(a * b ∣ 720) } = 2520 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_367", "source_license": null, "theorem_names": ["count"], "statement_sha256": "f60861383e05224c8f542b8350a7b16d81d09a3930a9ecfe790923146d8e86d1", "task_path": "tasks/rl_align__o_proofs_count_367__f60861383e05224c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_367", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_37__d87f0e7a94e2f2ae", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem count :\n Set.ncard {p : Fin 5 → ℕ | p.Injective ∧ (∀ i, p i ∈ Finset.Icc 1 5) ∧\n 3 ∣ (p 0 * p 1 * p 2 + p 1 * p 2 * p 3 + p 2 * p 3 * p 4 + p 3 * p 4 * p 0 + p 4 * p 0 * p 1)} = 80 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_37", "source_license": null, "theorem_names": ["count"], "statement_sha256": "d87f0e7a94e2f2aed0d239c968645a5a8948641914c2a4015a5f19d4f31e9d00", "task_path": "tasks/rl_align__o_proofs_count_37__d87f0e7a94e2f2ae", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_37", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_389__daaab242095f6278", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem count :\n Set.ncard {n : ℕ | n ∈ Finset.Icc 1000 9999 ∧ (n % 100 = 23) ∧ 3 ∣ n} = 30 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_389", "source_license": null, "theorem_names": ["count"], "statement_sha256": "daaab242095f6278ad0d5187669d7d066d86f72e95662076b414de07ee84024f", "task_path": "tasks/rl_align__o_proofs_count_389__daaab242095f6278", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_389", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_393__b8e4860146a775cc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem count :\n Set.ncard {(x, y, z) : ℤ × ℤ × ℤ | 0 < x ∧ x < y ∧ y < z ∧ z < 10 ∧ Even z} = 34 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_393", "source_license": null, "theorem_names": ["count"], "statement_sha256": "b8e4860146a775cc760cf6e580bc4679053b54565e8fa478fd333e85d5b9b1d0", "task_path": "tasks/rl_align__o_proofs_count_393__b8e4860146a775cc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_393", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_43__2f4b85ecd13ab540", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem count :\n Set.ncard {n : ℕ | 0 < n ∧ n < 2017 ∧ ∃ k : ℤ, 1 + n + (n ^ 2 / Nat.factorial 2 : ℝ) + (n ^ 3 / Nat.factorial 3 : ℝ) + (n ^ 4 / Nat.factorial 4 : ℝ) + (n ^ 5 / Nat.factorial 5 : ℝ) + (n ^ 6 / Nat.factorial 6 : ℝ) = k } = 134 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_43", "source_license": null, "theorem_names": ["count"], "statement_sha256": "2f4b85ecd13ab54037608c08da85de10cdf431e8a1130b9cae029df57885540e", "task_path": "tasks/rl_align__o_proofs_count_43__2f4b85ecd13ab540", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_43", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_44__188457f57f1a654c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem count :\n Set.ncard {A : ℕ | (Nat.digits 10 A).length = 4 ∧ (Nat.digits 10 (A + 20)).length ≠ 4 ∨ (Nat.digits 10 A).length ≠ 4 ∧ (Nat.digits 10 (A + 20)).length = 4} = 40 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_44", "source_license": null, "theorem_names": ["count"], "statement_sha256": "188457f57f1a654c163debbc27534cfee5a1d75aa8611d891312c0fb7d6d040a", "task_path": "tasks/rl_align__o_proofs_count_44__188457f57f1a654c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_44", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_59__5e440cf620fd63ce", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem count : Set.ncard {n : ℕ+ | 1 ≤ n.val ∧ n.val < 100 ∧ 3 ∣ (1 ^ n.val + 2 ^ n.val + 3 ^ n.val + 4 ^ n.val)} = 49 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_59", "source_license": null, "theorem_names": ["count"], "statement_sha256": "5e440cf620fd63ce8d2bece9f748573d1ee61ddf4e8129888a5c42d7ec3f433e", "task_path": "tasks/rl_align__o_proofs_count_59__5e440cf620fd63ce", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_59", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_n__38c78203845c8eb6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem count_n : Set.ncard {n : ℕ | n > 1 ∧ ∃ a : ℤ, ∑ i ∈ Finset.range n, (a + 2 * i) = 153} = 5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_n", "source_license": null, "theorem_names": ["count_n"], "statement_sha256": "38c78203845c8eb620581966e11cb1dd6da75529f135b792467f2991058e4c39", "task_path": "tasks/rl_align__o_proofs_count_n__38c78203845c8eb6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_n", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_of_two_digit_n__67d088ab3f93b6a7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem count_of_two_digit_n : Set.ncard {n : ℕ | (Nat.digits 10 n).length = 2 ∧ (Nat.digits 10 n)[0]! = 2 * (Nat.digits 10 n)[1]!} = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_of_two_digit_n", "source_license": null, "theorem_names": ["count_of_two_digit_n"], "statement_sha256": "67d088ab3f93b6a7bcf1aa691fbb46d68652b75365a0c7b9de92e888ac87c80b", "task_path": "tasks/rl_align__o_proofs_count_of_two_digit_n__67d088ab3f93b6a7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_of_two_digit_n", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_pos_k_not_int__e9fd7a7ac477ac57", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem count_pos_k_not_int : Set.ncard {k : ℤ | k > 0 ∧ ¬∃ x y : ℕ, 5 * x + 8 * y = k} = 14 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_count_pos_k_not_int", "source_license": null, "theorem_names": ["count_pos_k_not_int"], "statement_sha256": "e9fd7a7ac477ac5764dee81d687ba65d1fc3190a138d06ef66b833d0844e9932", "task_path": "tasks/rl_align__o_proofs_count_pos_k_not_int__e9fd7a7ac477ac57", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_count_pos_k_not_int", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_triples_5__60f0e6cc844a623c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem count_triples : Set.ncard {(a, b, c) : ℕ × ℕ × ℕ | 1 ≤ a ∧ a < b ∧ b < c ∧ c ≤ 10 ∧ b - a = c - b} = 20 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_triples_5", "source_license": null, "theorem_names": ["count_triples"], "statement_sha256": "60f0e6cc844a623ce672cc52c37fe7de259ae49a6b20cc0715f83a9ea91b3c1e", "task_path": "tasks/rl_align__o_proofs_count_triples_5__60f0e6cc844a623c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_triples_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_count_twin_primes__95f50a0e5d8ac75d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem count_twin_primes :\n Set.ncard {p : ℕ | ∃ q : ℕ, p.Prime ∧ q.Prime ∧ p - q = 2 ∧ 10 < p ∧ p < 50} = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_twin_primes", "source_license": null, "theorem_names": ["count_twin_primes"], "statement_sha256": "95f50a0e5d8ac75dbb4b4134fcf41fe2a990baab10f89b794b1632d1b9418058", "task_path": "tasks/rl_align__o_proofs_count_twin_primes__95f50a0e5d8ac75d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_count_twin_primes", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_cube_division_into_seventy_two_smaller_cubes__8221abd3aa561c58", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem cube_division_into_seventy_two_smaller_cubes :\n ∃ (n : ℕ), n > 0 ∧ ∃ (sizes : Fin 72 → ℕ), (∑ i : Fin 72, sizes i^3) = n^3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_cube_division_into_seventy_two_smaller_cubes", "source_license": null, "theorem_names": ["cube_division_into_seventy_two_smaller_cubes"], "statement_sha256": "8221abd3aa561c58beae658a7cbf2cdf2347fe3a434b69f023d3c8de29dda7b6", "task_path": "tasks/rl_align__o_proofs_cube_division_into_seventy_two_smaller_cubes__8221abd3aa561c58", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_cube_division_into_seventy_two_smaller_cubes", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_degree_hx4_jx3__85bd109e225f3f82", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem degree_hx4_jx3 (h : Polynomial ℤ) (j : Polynomial ℤ) (hx : h.degree = 3) (jx : j.degree = 5) : (h.comp (Polynomial.X ^ 4) * j.comp (Polynomial.X ^ 3)).degree = 27 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_degree_hx4_jx3", "source_license": null, "theorem_names": ["degree_hx4_jx3"], "statement_sha256": "85bd109e225f3f82b7660e34e4863f74c0695a357e8747eccfadddc4b7909fed", "task_path": "tasks/rl_align__o_proofs_degree_hx4_jx3__85bd109e225f3f82", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_degree_hx4_jx3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_derivNorm__8809805a67752f5c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem derivNorm {n : ℕ} (g : ℝ → (Fin n → ℝ))\n (hg : Differentiable ℝ g) :\n ∀ t, ‖deriv g t‖ ≤ sSup {‖deriv g t • x‖ | (x : Fin n → ℝ) (hx : ‖x‖ ≤ 1)} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_derivNorm", "source_license": null, "theorem_names": ["derivNorm"], "statement_sha256": "8809805a67752f5c2e91a3203325e2648eb3e51dc9b9cad20490e71ae9c73c4a", "task_path": "tasks/rl_align__o_proofs_derivNorm__8809805a67752f5c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_derivNorm", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_deriv_determinant__a9c5c09763a187e4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem deriv_determinant {f1 f2 g1 g2 : ℝ → ℝ}\n (hf1 : Differentiable ℝ f1) (hf2 : Differentiable ℝ f2)\n (hg1 : Differentiable ℝ g1) (hg2 : Differentiable ℝ g2)\n (D : ℝ → ℝ)\n (hD : D = fun x => Matrix.det (fun i j : Fin 2 => if i = 0 ∧ j = 0 then f1 x else if i = 0 ∧ j ≠ 0 then g1 x else if i ≠ 0 ∧ j = 0 then f2 x else g2 x)) :\n deriv D = fun x => Matrix.det (fun i j : Fin 2 => if i = 0 ∧ j = 0 then deriv f1 x else if i = 0 ∧ j ≠ 0 then deriv g1 x else if i ≠ 0 ∧ j = 0 then f2 x else g2 x) +\n Matrix.det (fun i j : Fin 2 => if i = 0 ∧ j = 0 then f1 x else if i = 0 ∧ j ≠ 0 then g1 x else if i ≠ 0 ∧ j = 0 then deriv f2 x else deriv g2 x) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_deriv_determinant", "source_license": null, "theorem_names": ["deriv_determinant"], "statement_sha256": "a9c5c09763a187e47255eca3be18bb6323194d25af37c06739c03452585881b2", "task_path": "tasks/rl_align__o_proofs_deriv_determinant__a9c5c09763a187e4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_deriv_determinant", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_deriv_g_6__6efb84a8b651a6a7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem deriv_g {g : ℝ → ℝ} (hg : ∀ x, |g x| ≤ x ^ 2) :\n Tendsto (λ x => g x / x) (𝓝[≠] 0) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_deriv_g_6", "source_license": null, "theorem_names": ["deriv_g"], "statement_sha256": "6efb84a8b651a6a7525aba789513b18f6d2509d220c7caccc02987cf5ddd91b1", "task_path": "tasks/rl_align__o_proofs_deriv_g_6__6efb84a8b651a6a7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_deriv_g_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_derivative_signs__655591158925d5e9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem derivative_signs (x₀ : ℝ) (h₀ : x₀ > 0) (h₁ : deriv (fun x => exp x + 1 / x) x₀ = 0) :\n ∃ m n : ℝ, m ∈ Set.Ioo 0 x₀ ∧ n ∈ Set.Ioi x₀ ∧ deriv (fun x => exp x + 1 / x) m < 0 ∧ deriv (fun x => exp x + 1 / x) n > 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_derivative_signs", "source_license": null, "theorem_names": ["derivative_signs"], "statement_sha256": "655591158925d5e9d89b7a5dd6c11bb76c5d23cad6d2c421f869e55f5124aca1", "task_path": "tasks/rl_align__o_proofs_derivative_signs__655591158925d5e9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_derivative_signs", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_det_of_diffs__67254897684537f9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem det_of_diffs (a b c : Fin 3 → ℝ) (D : ℝ) (hD : D = Matrix.det ![![a 0, a 1, a 2], ![b 0, b 1, b 2], ![c 0, c 1, c 2]]) :\n Matrix.det ![![a 0 - b 0, a 1 - b 1, a 2 - b 2], ![b 0 - c 0, b 1 - c 1, b 2 - c 2], ![c 0 - a 0, c 1 - a 1, c 2 - a 2]] = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_det_of_diffs", "source_license": null, "theorem_names": ["det_of_diffs"], "statement_sha256": "67254897684537f9d55e17d964341a2feccfe505ae8ebf62e8b23604746142c5", "task_path": "tasks/rl_align__o_proofs_det_of_diffs__67254897684537f9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_det_of_diffs", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_determine_values_3__42bc99a39890e9fe", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem determine_values (α : ℝ) :\n (∃ f : ℝ → ℝ, Differentiable ℝ f ∧\n Tendsto f atTop (𝓝 1) ∧\n Tendsto (deriv f) atTop (𝓝 α)) ↔ α = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_determine_values_3", "source_license": null, "theorem_names": ["determine_values"], "statement_sha256": "42bc99a39890e9fedca1e67b5bc4a827c41947ce2672862d64b2ec82e548ef8c", "task_path": "tasks/rl_align__o_proofs_determine_values_3__42bc99a39890e9fe", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_determine_values_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_dice_probability_3__d5a49feb1fff1ae0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem dice_probability (p : Fin 6 → ℝ) (h₀ : ∀ i : Fin 6, p i = 1 / 6) (h₁ : ∑ i : Fin 6, p i = 1) :\n (∑ i : Fin 6, ∑ j : Fin 6, if Nat.Prime ((i.val + 1) + (j.val + 1)) then p i * p j else 0) = 5 / 12 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_dice_probability_3", "source_license": null, "theorem_names": ["dice_probability"], "statement_sha256": "d5a49feb1fff1ae0eddf0feb752b283217ab7b9e48b68cce0c72718ca50f70df", "task_path": "tasks/rl_align__o_proofs_dice_probability_3__d5a49feb1fff1ae0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_dice_probability_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_digit_repetition_divisibility__3e2ec99ded46323f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem digit_repetition_divisibility (m : ℕ) (d : ℕ) (hd : d ∈ Set.Icc 1 9) : (d * (10^(3^m) - 1) / 9) % 3^m = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_digit_repetition_divisibility", "source_license": null, "theorem_names": ["digit_repetition_divisibility"], "statement_sha256": "3e2ec99ded46323fb49039dccc606600c6c9193a82bfb9500ffed5c693b8780c", "task_path": "tasks/rl_align__o_proofs_digit_repetition_divisibility__3e2ec99ded46323f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_digit_repetition_divisibility", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_direct_trip_distance__48a68bea57ae214d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem direct_trip_distance (west1 : ℝ) (north : ℝ) (west2 : ℝ) (h₁ : west1 = 8) (h₂ : north = 8) (h₃ : west2 = 7) : dist (0, 0) (-west1 - west2, north) < dist (0, 0) (-west1, 0) + dist (-west1, 0) (-west1 - west2, north) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_direct_trip_distance", "source_license": null, "theorem_names": ["direct_trip_distance"], "statement_sha256": "48a68bea57ae214d856de9ac449a62c35ddb56555d32c864b0fcfb50aa4e23b7", "task_path": "tasks/rl_align__o_proofs_direct_trip_distance__48a68bea57ae214d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_direct_trip_distance", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_dist_36__1ef67b742b554c9a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem dist (f : ℝ → ℝ) (hf : f = λ t => -t^2 + 7 * t + 19)\n (a b : ℝ) (ha : a = 2) (hb : b = 4) :\n ∫ t in (a)..b, |deriv f t| = 2.5 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_dist_36", "source_license": null, "theorem_names": ["dist"], "statement_sha256": "1ef67b742b554c9afe0d04bf211e6cd6e86e79272c0fe5feca978f3ced75dadb", "task_path": "tasks/rl_align__o_proofs_dist_36__1ef67b742b554c9a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_dist_36", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_dist_62__35c71278ff6b8e32", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem dist (n : ℕ) (hn : n = 32) :\n {(x, y, z, w, v) : ℕ × ℕ × ℕ × ℕ × ℕ |\n x + y + z + w + v = n ∧\n Odd x ∧ Odd y ∧ Odd z ∧ Odd w ∧ Even v ∧\n v ≡ 2 [MOD 3]}.ncard = 1005 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_dist_62", "source_license": null, "theorem_names": ["dist"], "statement_sha256": "35c71278ff6b8e3209af33b12c19f723cee0bbbe648ef33fb791649d94007c42", "task_path": "tasks/rl_align__o_proofs_dist_62__35c71278ff6b8e32", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_dist_62", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_dist_65__ed47ba556fa0fffe", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem dist (n : ℕ) (hn : n = 9) :\n Set.ncard {x : Fin 4 → ℕ | x 0 + x 1 + x 2 + x 3 = n} = 220 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_dist_65", "source_license": null, "theorem_names": ["dist"], "statement_sha256": "ed47ba556fa0fffe1a66184b769dd6c2ed48c23d1f2c3c7b27518cd74b3d6cae", "task_path": "tasks/rl_align__o_proofs_dist_65__ed47ba556fa0fffe", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_dist_65", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_dist_A_midpoint_B_C__d2e42728554bbc9b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem dist_A_midpoint_B_C (A B C : EuclideanSpace ℝ (Fin 2))\n (h₀ : A ≠ B) (h₁ : A ≠ C) (h₂ : B ≠ C) :\n let midpoint := midpoint ℝ B C\n let length := dist A midpoint\n length = sqrt (2 * dist A B ^ 2 + 2 * dist A C ^ 2 - dist B C ^ 2) / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_dist_A_midpoint_B_C", "source_license": null, "theorem_names": ["dist_A_midpoint_B_C"], "statement_sha256": "d2e42728554bbc9b1efee93022a1a3c3d486907d1c0a8d12372756c6efd51d12", "task_path": "tasks/rl_align__o_proofs_dist_A_midpoint_B_C__d2e42728554bbc9b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_dist_A_midpoint_B_C", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_dist_a_3__3125b33d97b55a4f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem dist_a : ∀ n > 0, ∀ a : Fin n → ℤ,\n (∀ i j, a i = a j → i = j) →\n ¬∃ p q : Polynomial ℤ, p.degree > 0 ∧ q.degree > 0 ∧\n (∏ i : Fin n, (Polynomial.X - Polynomial.C (a i)) - 1 =\n p * q) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_dist_a_3", "source_license": null, "theorem_names": ["dist_a"], "statement_sha256": "8b02070a3b786ece81192ca4b965d13a473de309df719bad82efcfde0b6119fa", "task_path": "tasks/rl_align__o_proofs_dist_a_3__3125b33d97b55a4f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_dist_a_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_dist_sum_2__46677110822c0068", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem dist_sum : Set.ncard {x : ℕ | ∃ a b c : ℕ, 0 < a ∧ 0 < b ∧ 0 < c ∧ a * b * c = 72 ∧ x = a + b + c} = 11 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_dist_sum_2", "source_license": null, "theorem_names": ["dist_sum"], "statement_sha256": "46677110822c0068fca2f6166c53ccf80392f5dd128418d5e838d8753ec30299", "task_path": "tasks/rl_align__o_proofs_dist_sum_2__46677110822c0068", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_dist_sum_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distance_between_intersections__7ab0b8c7db244ee2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem distance_between_intersections :\n ∃ (a b : ℕ), a + b = 21 ∧\n let line : Set (ℝ × ℝ × ℝ) := {p : ℝ × ℝ × ℝ | ∃ t : ℝ, p = (1, 1, 1) + t • (3, 1, 1)};\n let sphere : Set (ℝ × ℝ × ℝ) := {p : ℝ × ℝ × ℝ | ‖p‖ = 2};\n let intersections := line ∩ sphere;\n ∃ p₁ p₂ : ℝ × ℝ × ℝ, p₁ ∈ intersections ∧ p₂ ∈ intersections ∧ p₁ ≠ p₂ ∧\n dist p₁ p₂ = a / Real.sqrt b := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distance_between_intersections", "source_license": null, "theorem_names": ["distance_between_intersections"], "statement_sha256": "7ab0b8c7db244ee2abf751221dc88c5c7f3886f4d0c12a8e0f25e864c1b670d1", "task_path": "tasks/rl_align__o_proofs_distance_between_intersections__7ab0b8c7db244ee2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distance_between_intersections", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distance_between_parallel_planes__920e5a142d2acb19", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem distance_between_parallel_planes (parallel_plane_1 parallel_plane_2 : ℝ → ℝ → ℝ → Prop)\n (hparallel_plane_1 : parallel_plane_1 = fun x y z ↦ 6 * z = 4 * y - 2 * x)\n (hparallel_plane_2 : parallel_plane_2 = fun x y z ↦ 9 * z = 1 - 3 * x + 6 * y) :\n ∃ x₁ y₁ z₁ x₂ y₂ z₂ : ℝ,\n parallel_plane_1 x₁ y₁ z₁ ∧ parallel_plane_2 x₂ y₂ z₂ ∧\n dist (x₁, y₁, z₁) (x₂, y₂, z₂) = (Real.sqrt 180) / 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distance_between_parallel_planes", "source_license": null, "theorem_names": ["distance_between_parallel_planes"], "statement_sha256": "920e5a142d2acb199b2c5f801c97888990ca582e709f069a05c2c1ec0636aec2", "task_path": "tasks/rl_align__o_proofs_distance_between_parallel_planes__920e5a142d2acb19", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distance_between_parallel_planes", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distance_t__b86554e1da2b5716", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem distance_t : ∃ t : ℝ, t ≥ 0 ∧\n let dist : ℝ → ℝ := fun t => √((t^2)^2 + (cos t + t * sin t - 0)^2 + (sin t - t * cos t - 1)^2);\n dist t = Real.sqrt 5 * Real.pi^2 / 8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distance_t", "source_license": null, "theorem_names": ["distance_t"], "statement_sha256": "b86554e1da2b57165c67043e151d9b1122edc7df608e2ed64a8e96bfe99e2152", "task_path": "tasks/rl_align__o_proofs_distance_t__b86554e1da2b5716", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distance_t", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distance_traveled_56__319764772b2011e3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem distance_traveled : ∫ t in (0:ℝ)..5, abs (2*t - 3) = 29/2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distance_traveled_56", "source_license": null, "theorem_names": ["distance_traveled"], "statement_sha256": "319764772b2011e377045430f510765ba125d8a169324197e0491d3df43e3034", "task_path": "tasks/rl_align__o_proofs_distance_traveled_56__319764772b2011e3", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distance_traveled_56", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distance_traveled_7__00e3b346fd206428", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem distance_traveled : ∫ t in (0:ℝ)..(3/2), abs (2 * t - 3) = 9 / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distance_traveled_7", "source_license": null, "theorem_names": ["distance_traveled"], "statement_sha256": "00e3b346fd206428a3e98bef50d324f0779364d7a11bfd32ce00f41988f35b5e", "task_path": "tasks/rl_align__o_proofs_distance_traveled_7__00e3b346fd206428", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distance_traveled_7", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distribution_139__1a54ff1700b01784", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem distribution (a : Fin 7 → ℕ) (ha : a 0 = 1 ∧ a 1 = 2 ∧ a 2 = 4 ∧ a 3 = 8 ∧ a 4 = 16 ∧ a 5 = 32 ∧ a 6 = 64) :\n ∀ n ∈ Finset.Icc 1 127, ∃ s : Finset (Fin 7), ∑ i ∈ s, a i = n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distribution_139", "source_license": null, "theorem_names": ["distribution"], "statement_sha256": "1a54ff1700b017840ac285c5b87bf48176cc362d1aa9f26cb6fcb6cd5b2ce5d3", "task_path": "tasks/rl_align__o_proofs_distribution_139__1a54ff1700b01784", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distribution_139", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distribution_40__2c57e6274c3e32f3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem distribution :\n Set.ncard {x : Fin 3 → ℕ | ∑ i, x i = 49 ∧ x 0 ≥ 4 ∧ Odd (x 1) ∧ Even (x 2)} = 276 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distribution_40", "source_license": null, "theorem_names": ["distribution"], "statement_sha256": "2c57e6274c3e32f361eab30d79d16300b7b35069121baabb5b7990066bfddaae", "task_path": "tasks/rl_align__o_proofs_distribution_40__2c57e6274c3e32f3", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distribution_40", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distribution_43__c60ba8f13d9fc7cf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem distribution (n : ℕ) (hn : n = 6) :\n {f : Fin 5 → ℕ | ∑ i : Fin 5, f i = n ∧ ∀ i : Fin 5, f i > 0}.ncard = 5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distribution_43", "source_license": null, "theorem_names": ["distribution"], "statement_sha256": "c60ba8f13d9fc7cfbb8bef644703a75d390e2af3a27c2963d0cec58dbd59b578", "task_path": "tasks/rl_align__o_proofs_distribution_43__c60ba8f13d9fc7cf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distribution_43", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distribution_80__3322208ae36873d7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem distribution (n : ℕ) (h₀ : n = 66) :\n {(x, y, z) : ℕ × ℕ × ℕ | x + y + z = n ∧ x > 0 ∧ y > 0 ∧ z > 0 ∧ x < y ∧ y < z}.ncard = 331 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distribution_80", "source_license": null, "theorem_names": ["distribution"], "statement_sha256": "3322208ae36873d78164443bf10d73f47a0f392c9c9e0d0c380eb94424fa2724", "task_path": "tasks/rl_align__o_proofs_distribution_80__3322208ae36873d7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distribution_80", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distribution_lollipops__0a3df57fa90780e7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem distribution_lollipops (n : ℕ) (hn : n = 18) :\n Set.ncard {x : Fin 4 → ℕ | ∑ i, x i = n ∧ ∀ i, x i > 0} = Nat.choose 17 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distribution_lollipops", "source_license": null, "theorem_names": ["distribution_lollipops"], "statement_sha256": "0a3df57fa90780e7ba9a8b3a0bb77092ecbda4596efd086c7a6976c4cb6e8e3a", "task_path": "tasks/rl_align__o_proofs_distribution_lollipops__0a3df57fa90780e7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distribution_lollipops", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distribution_of_donuts__e00990aa0c513293", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem distribution_of_donuts :\n {f : Fin 4 → ℕ | ∑ i, f i = 10}.ncard = 286 ∧\n {f : Fin 5 → ℕ | ∑ i, f i = 7}.ncard = Nat.choose 11 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distribution_of_donuts", "source_license": null, "theorem_names": ["distribution_of_donuts"], "statement_sha256": "e00990aa0c51329354d75157cc2a4972ca64ca5c7b17bfb6845682f9458dca4a", "task_path": "tasks/rl_align__o_proofs_distribution_of_donuts__e00990aa0c513293", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_distribution_of_donuts", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distribution_pebbles__6e21bf9ec56245e5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem distribution_pebbles (a : Fin 42 → ℕ) (ha : ∀ i j, i < j → a i > a j)\n (hapos : ∀ i, 0 < a i) :\n IsLeast {n | ∃ a : Fin 42 → ℕ, (∀ i j, i < j → a i > a j) ∧ (∀ i, 0 < a i) ∧ n = ∑ i, a i} 903 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distribution_pebbles", "source_license": null, "theorem_names": ["distribution_pebbles"], "statement_sha256": "6e21bf9ec56245e5ddc8e77840012ffbcfd29d7acb324c629d35ad53003bde2a", "task_path": "tasks/rl_align__o_proofs_distribution_pebbles__6e21bf9ec56245e5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distribution_pebbles", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distribution_ways_6__41a190845f6f7a20", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem distribution_ways :\n Set.ncard {x : Fin 3 → ℕ | x 0 ≥ 1 ∧ x 1 ≥ 1 ∧ x 2 ≥ 1 ∧ ∑ i, x i ≤ 25} = 2300 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distribution_ways_6", "source_license": null, "theorem_names": ["distribution_ways"], "statement_sha256": "41a190845f6f7a20dcea6bd08301ab746523e8f79d9e246a557ec6c3989bb469", "task_path": "tasks/rl_align__o_proofs_distribution_ways_6__41a190845f6f7a20", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distribution_ways_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_distribution_wins__5552dc61ccf2d492", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem distribution_wins : Set.ncard {x : Fin 5 → ℕ | ∑ i : Fin 5, x i = 15 ∧ (x 0 = 1 ∨ x 0 = 2)} = 1240 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distribution_wins", "source_license": null, "theorem_names": ["distribution_wins"], "statement_sha256": "5552dc61ccf2d4928d765a3bbd43b93677cf4b0b8f88d4e25ed731c384f95bc5", "task_path": "tasks/rl_align__o_proofs_distribution_wins__5552dc61ccf2d492", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_distribution_wins", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_divide_segment_into_three_equal_parts__79fccc63134b8516", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem divide_segment_into_three_equal_parts (A B : EuclideanSpace ℝ (Fin 1)) (h : A ≠ B) :\n ∃ C D : EuclideanSpace ℝ (Fin 1), C ≠ A ∧ D ≠ B ∧ C ≠ D ∧ dist A C = dist C D ∧ dist C D = dist D B ∧ dist A B = dist A C + dist C D + dist D B := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_divide_segment_into_three_equal_parts", "source_license": null, "theorem_names": ["divide_segment_into_three_equal_parts"], "statement_sha256": "79fccc63134b85163bf17131137e11e4c27b8e866282261aaf430bd693a1c2a2", "task_path": "tasks/rl_align__o_proofs_divide_segment_into_three_equal_parts__79fccc63134b8516", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_divide_segment_into_three_equal_parts", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_divisibility_by_xn_minus_1__5b278ed2fadc3c45", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem divisibility_by_xn_minus_1 (n : ℕ) (hn : 0 < n) (P : Polynomial ℂ) (h : (Polynomial.X - 1) ∣ P.comp (Polynomial.X ^ n)) : (Polynomial.X ^ n - 1) ∣ P.comp (Polynomial.X ^ n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_divisibility_by_xn_minus_1", "source_license": null, "theorem_names": ["divisibility_by_xn_minus_1"], "statement_sha256": "5b278ed2fadc3c457a8b8f7b0de539007825239cc406934df5c099138475819a", "task_path": "tasks/rl_align__o_proofs_divisibility_by_xn_minus_1__5b278ed2fadc3c45", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_divisibility_by_xn_minus_1", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_doubleIntegral_3__b77476934482b7eb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem doubleIntegral : ∫ y in (0)..9, ∫ x in ((y - 3) / 2)..(Real.sqrt y), x = 81 / 8 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_doubleIntegral_3", "source_license": null, "theorem_names": ["doubleIntegral"], "statement_sha256": "b77476934482b7eb24766db7d2a5647fe4194ea4433282b747f291d4ecbd8e7f", "task_path": "tasks/rl_align__o_proofs_doubleIntegral_3__b77476934482b7eb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_doubleIntegral_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_double_int__78bc27c0aba0f8cf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem double_int : ∫ u in (0)..1, ∫ v in (0)..1, v * (u + v ^ 2) ^ 4 = 31 / 30 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_double_int", "source_license": null, "theorem_names": ["double_int"], "statement_sha256": "78bc27c0aba0f8cf798318eb08bcd156bbdddc68ac8ca290a5e8cd1c2146d6be", "task_path": "tasks/rl_align__o_proofs_double_int__78bc27c0aba0f8cf", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_double_int", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_double_integral_17__6a376e5913c9d0d1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem double_integral : ∫ v in (1)..2, ∫ u in (v)..(2 * v), (u ^ 2 / v ^ 2 + u ^ 2 * v ^ 2) = 28 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_double_integral_17", "source_license": null, "theorem_names": ["double_integral"], "statement_sha256": "6a376e5913c9d0d19ee478c03e067ad9a0eec678f8125e4016c122b07f6779b8", "task_path": "tasks/rl_align__o_proofs_double_integral_17__6a376e5913c9d0d1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_double_integral_17", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_entire_function_2__e2335e3185fccd22", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem entire_function {f : ℂ → ℂ} (hf : ∃ a : ℕ → ℂ, (∀ z, f z = ∑' k : ℕ, a k * z ^ k) ∧\n ∀ k ≥ 1, (k + 1) * a (k + 1) = 0) :\n ∃ p : Polynomial ℂ, p.degree ≤ 1 ∧ ∀ z, f z = p.eval z := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_entire_function_2", "source_license": null, "theorem_names": ["entire_function"], "statement_sha256": "e2335e3185fccd22f10a25843d92d719e087af2ae45709799acc9f8186d67ea3", "task_path": "tasks/rl_align__o_proofs_entire_function_2__e2335e3185fccd22", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_entire_function_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_equilateral_triangle_construction_4__fd2c50434aea0311", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem equilateral_triangle_construction (A B : EuclideanSpace ℝ (Fin 2)) (hAB : A ≠ B) :\n ∃ C : EuclideanSpace ℝ (Fin 2), dist A C = dist A B ∧ dist B C = dist A B ∧ dist A C = dist B C := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_equilateral_triangle_construction_4", "source_license": null, "theorem_names": ["equilateral_triangle_construction"], "statement_sha256": "fd2c50434aea031110114f873efe7524efaf1782c58e9bb27d5e07ebbc6307a4", "task_path": "tasks/rl_align__o_proofs_equilateral_triangle_construction_4__fd2c50434aea0311", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_equilateral_triangle_construction_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_estimate_integral__072bc170c2c811e7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem estimate_integral : ∃ I₄ : ℝ, abs (I₄ - ∫ x in (0:ℝ)..(1:ℝ), Real.sqrt (1 + x ^ 2)) < 0.001 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_estimate_integral", "source_license": null, "theorem_names": ["estimate_integral"], "statement_sha256": "072bc170c2c811e701882d292ebd5941d578e963305774d0e201e1d63cf28bbc", "task_path": "tasks/rl_align__o_proofs_estimate_integral__072bc170c2c811e7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_estimate_integral", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_example6_5__8c59bacf32345423", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem example6 (f : Polynomial ℤ) (hf : f.degree = 4) (h1 : f.eval 1 = 0) (h2 : f.eval 2 = 0) (h3 : f.eval 3 = 0) (h4 : f.eval 4 = 6) (h5 : f.eval 5 = 72) : f.eval 2010 % 10 = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example6_5", "source_license": null, "theorem_names": ["example6"], "statement_sha256": "8c59bacf32345423ba4b8e96df41398c2ed6bae3f95be250f46ae388822f345f", "task_path": "tasks/rl_align__o_proofs_example6_5__8c59bacf32345423", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example6_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_example_1_53__e13aa22a85d20944", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem example_1 (n : ℕ) (h₀ : 2 ≤ n) (A : ℝ) (h₁ : A > 0) (x : Fin n → ℝ) (h₂ : ∑ i, x i = A) (h₃ : ∑ i, (x i)^2 = A^2 / (n - 1)) : ∀ i, 0 ≤ x i ∧ x i ≤ 2 * A / n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_1_53", "source_license": null, "theorem_names": ["example_1"], "statement_sha256": "e13aa22a85d209448acbe7d9303e50581b9dbb452ac777d379b609ac92ca5720", "task_path": "tasks/rl_align__o_proofs_example_1_53__e13aa22a85d20944", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_1_53", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_example_2_15__020e335084b8eba6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem example_2 (n : ℕ) (X : Type*) [Fintype X] [DecidableEq X] (hX : Fintype.card X = n) (Φ : Set (Finset X)) (hΦ : ∀ s ∈ Φ, s.card = 3) (hΦ_disjoint : ∀ s ∈ Φ, ∀ t ∈ Φ, s ≠ t → (s ∩ t).card ≤ 1) : ∃ M : Finset X, M ∉ Φ ∧ M.card ≥ Int.floor (Real.sqrt (2 * n)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_example_2_15", "source_license": null, "theorem_names": ["example_2"], "statement_sha256": "020e335084b8eba67bd67d8f8a24082e7c315df321682effb6610f09295a0d1c", "task_path": "tasks/rl_align__o_proofs_example_2_15__020e335084b8eba6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_example_2_15", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_example_3_147__2d287c08cb3da9e3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem example_3 : ∃ (k : ℕ) (A : Fin k → Finset ℕ), (∀ i, A i ⊆ Finset.Icc 1 10) ∧ (∀ i, (A i).card = 5) ∧ (∀ i j, i ≠ j → (A i ∩ A j).card ≤ 2) ∧ k = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_3_147", "source_license": null, "theorem_names": ["example_3"], "statement_sha256": "2d287c08cb3da9e39647b28eaf14b48d6259a8a4017afa96b32b9b25301773a9", "task_path": "tasks/rl_align__o_proofs_example_3_147__2d287c08cb3da9e3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_3_147", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_example_3_27__37510e86c3ffde0b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem example_3 (points : Finset (ℝ × ℝ)) (h₁ : points.card = 25) (h₂ : ∀ p ∈ points, ∀ q ∈ points, ∀ r ∈ points, dist p q < 1 ∨ dist p r < 1 ∨ dist q r < 1) : ∃ (x y : ℝ), ∃ (covered : Finset (ℝ × ℝ)), covered ⊆ points ∧ covered.card ≥ 13 ∧ ∀ p ∈ covered, dist (x, y) p ≤ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_3_27", "source_license": null, "theorem_names": ["example_3"], "statement_sha256": "37510e86c3ffde0bca18c6bfe873dc7b7b193b4bb4f6b615fc2e6c59da9a3b8c", "task_path": "tasks/rl_align__o_proofs_example_3_27__37510e86c3ffde0b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_3_27", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_example_4_146__162e30d2617dc187", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem example_4 (a : Fin 7 → ℕ) (h₁ : ∑ i : Fin 7, a i = 100) (h₂ : ∀ i j : Fin 7, i ≠ j → a i ≠ a j) :\n ∃ i j k : Fin 7, i ≠ j ∧ j ≠ k ∧ i ≠ k ∧ a i + a j + a k < 50 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_4_146", "source_license": null, "theorem_names": ["example_4"], "statement_sha256": "162e30d2617dc187654556cdf4b416d842fb4e2972d1c8e884254bc50b7aabac", "task_path": "tasks/rl_align__o_proofs_example_4_146__162e30d2617dc187", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_4_146", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_example_4_86__ed96088012d4f67c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem example_4 (points : Finset (ℝ × ℝ)) (h : points.card = 25) (h_dist : ∀ p ∈ points, ∀ q ∈ points, ∀ r ∈ points, p ≠ q → p ≠ r → q ≠ r → dist p q ≤ 1 ∨ dist p r ≤ 1 ∨ dist q r ≤ 1) : ∃ c : ℝ × ℝ, ∃ r : ℝ, r = 1 ∧ (Finset.filter (fun p => dist p c ≤ r) points).card ≥ 13 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_4_86", "source_license": null, "theorem_names": ["example_4"], "statement_sha256": "ed96088012d4f67c4179fcc12cde257e877860489e8ea0a2853db5ae814be623", "task_path": "tasks/rl_align__o_proofs_example_4_86__ed96088012d4f67c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_4_86", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_example_8_12__bca9c4be954f0261", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem example_8 (n : ℕ) (α : Fin n → ℝ) (h : ∀ i, α i > 0 ∧ α i < Real.pi / 2) (s : ℝ) (hs : ∑ i, (Real.cos (α i)) ^ 2 = s) : ∑ i, (Real.cot (α i)) ^ 2 ≥ n * s / (n - s) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_example_8_12", "source_license": null, "theorem_names": ["example_8"], "statement_sha256": "bca9c4be954f0261388998a6b8f599a3795350dd4f61654ecb9e331e5e754c71", "task_path": "tasks/rl_align__o_proofs_example_8_12__bca9c4be954f0261", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_example_8_12", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_example_divergent_seq__e4d94a997a2a0094", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem example_divergent_seq :\n ∃ x y : ℕ → ℝ,\n Tendsto (λ k => |y k - x k|) atTop (𝓝 0) ∧\n ¬ ∃ L, Tendsto x atTop (𝓝 L) ∧ Tendsto y atTop (𝓝 L) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_divergent_seq", "source_license": null, "theorem_names": ["example_divergent_seq"], "statement_sha256": "e4d94a997a2a0094b97636a7c8245d08dcc0d677c19f3279e59bd5bc1053639a", "task_path": "tasks/rl_align__o_proofs_example_divergent_seq__e4d94a997a2a0094", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_divergent_seq", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_example_matrix_limits__483472f1186feb87", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem example_matrix_limits : ∃ A B : Matrix (Fin 2) (Fin 2) ℝ,\n (∃ L : Matrix (Fin 2) (Fin 2) ℝ, Filter.Tendsto (fun m => A ^ m) Filter.atTop (𝓝 L)) ∧\n (∃ L : Matrix (Fin 2) (Fin 2) ℝ, Filter.Tendsto (fun m => B ^ m) Filter.atTop (𝓝 L)) ∧\n (∃ L : Matrix (Fin 2) (Fin 2) ℝ, Filter.Tendsto (fun m => (A * B) ^ m) Filter.atTop (𝓝 L)) ∧\n ¬∃ LA LB : Matrix (Fin 2) (Fin 2) ℝ,\n Filter.Tendsto (fun m => A ^ m) Filter.atTop (𝓝 LA) ∧\n Filter.Tendsto (fun m => B ^ m) Filter.atTop (𝓝 LB) ∧\n Filter.Tendsto (fun m => (A * B) ^ m) Filter.atTop (𝓝 (LA * LB)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_matrix_limits", "source_license": null, "theorem_names": ["example_matrix_limits"], "statement_sha256": "483472f1186feb874df7230b46cec2afea853ea0f9cf61866d6b185b9201bf3b", "task_path": "tasks/rl_align__o_proofs_example_matrix_limits__483472f1186feb87", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_example_matrix_limits", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exercise_2_V01102__8ffc2d9b5e0c2f4e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exercise_2_V01102 : Filter.Tendsto (fun x => ((1 - x) ^ 6 * Real.sin (3 * x) - Real.sin (3 * x)) / (3 * x ^ 2)) (𝓝[≠] 0) (𝓝 (-6)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exercise_2_V01102", "source_license": null, "theorem_names": ["exercise_2_V01102"], "statement_sha256": "8ffc2d9b5e0c2f4e0f373bc81fb3841f0de0e5d4c88a9d78a3c2628edf57abf8", "task_path": "tasks/rl_align__o_proofs_exercise_2_V01102__8ffc2d9b5e0c2f4e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exercise_2_V01102", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exist_set_2__ea1f0bd8a88731a0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem exist_set :\n ∃ S : Finset ℕ,\n (∀ s ∈ S, s > 0) ∧\n (∃ T : Finset (Finset ℕ), T.card = 2020 ∧ ∀ t ∈ T, t ⊆ S ∧ ∑ x ∈ t, x = 2020) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exist_set_2", "source_license": null, "theorem_names": ["exist_set"], "statement_sha256": "ea1f0bd8a88731a032ce43256a5d5ed202c949cb2bc3f3b0630a66149314c855", "task_path": "tasks/rl_align__o_proofs_exist_set_2__ea1f0bd8a88731a0", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exist_set_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_existence_of_stationary_vector__d5466491a7ee9863", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Matrix\n\n\ntheorem existence_of_stationary_vector {n : ℕ} (hn : 0 < n) (P : Matrix (Fin n) (Fin n) ℝ)\n (hP : ∀ i j, 0 ≤ P i j) (hP' : ∀ i, ∑ j, P i j = 1) :\n ∃ v : Matrix (Fin n) (Fin 1) ℝ,\n (∀ i, 0 ≤ v i 0) ∧\n (∑ i, v i 0 = 1) ∧\n P * v = v := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_existence_of_stationary_vector", "source_license": null, "theorem_names": ["existence_of_stationary_vector"], "statement_sha256": "d5466491a7ee98636df5726b6d99934aba72ed07fe3f1413a38cc3fdce9d6a66", "task_path": "tasks/rl_align__o_proofs_existence_of_stationary_vector__d5466491a7ee9863", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_existence_of_stationary_vector", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_a_b_in_open_unit_interval__ca17177cfe64d7d1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_a_b_in_open_unit_interval (f : ℝ → ℝ) (h_diff : DifferentiableOn ℝ f (Set.Icc 0 1)) (h0 : f 0 = 0) (h1 : f 1 = 1) : ∃ (a b : ℝ), a ∈ Set.Ioo 0 1 ∧ b ∈ Set.Ioo 0 1 ∧ a ≠ b ∧ deriv f a * deriv f b = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_a_b_in_open_unit_interval", "source_license": null, "theorem_names": ["exists_a_b_in_open_unit_interval"], "statement_sha256": "ca17177cfe64d7d1d83ff4f88d26c79a626d3c821418c8e7df9ffc22040f0bd3", "task_path": "tasks/rl_align__o_proofs_exists_a_b_in_open_unit_interval__ca17177cfe64d7d1", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_a_b_in_open_unit_interval", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_arrangement_of_triangles__bf9509f21c4743b8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_arrangement_of_triangles : ∃ (triangles : Fin 10 → Set (ℝ × ℝ)), (∀ i j : Fin 10, i ≠ j → triangles i ∩ triangles j ≠ ∅) ∧ ∀ i j k : Fin 10, i ≠ j → i ≠ k → j ≠ k → triangles i ∩ triangles j ∩ triangles k = ∅ := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_arrangement_of_triangles", "source_license": null, "theorem_names": ["exists_arrangement_of_triangles"], "statement_sha256": "bf9509f21c4743b8224e671f65409974e5726989fea9867ffb97d769a66c6938", "task_path": "tasks/rl_align__o_proofs_exists_arrangement_of_triangles__bf9509f21c4743b8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_arrangement_of_triangles", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_ball__2a3861e5b119ae5d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\ntheorem exists_ball (n : ℕ) (f : Fin n → ℂ)\n (h₀ : ∀ i j, f i = f j → i = j)\n (h₁ : ∀ i, ‖f i‖ ≤ 1) :\n ∃ z, ‖z‖ ≤ 1 ∧ ∑ i : Fin n, ‖z - f i‖ ≥ n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_ball", "source_license": null, "theorem_names": ["exists_ball"], "statement_sha256": "2a3861e5b119ae5d5ce7c57f469b27d7d08feb03e08f4d05f64c4c59d0198b8c", "task_path": "tasks/rl_align__o_proofs_exists_ball__2a3861e5b119ae5d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_ball", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_c_satisfying_integral_eq_c__00fae7b7b810c8a9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_c_satisfying_integral_eq_c : ∃ c : ℝ, c > 0 ∧ ∫ x in (0:ℝ)..c, |x^2 - 1| = c := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_c_satisfying_integral_eq_c", "source_license": null, "theorem_names": ["exists_c_satisfying_integral_eq_c"], "statement_sha256": "00fae7b7b810c8a97b46e4aeeb759229942fd9a57fb0e9064b8dd74439362cbb", "task_path": "tasks/rl_align__o_proofs_exists_c_satisfying_integral_eq_c__00fae7b7b810c8a9", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_c_satisfying_integral_eq_c", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_chord_length_p_or_q__35cb9fa0cf04dceb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_chord_length_p_or_q (A B : ℝ × ℝ) (hA : A ≠ B) (hB : B ≠ A) (γ : ℝ → ℝ × ℝ) (hγ : Continuous γ) (hγ₁ : γ 0 = A) (hγ₂ : γ 1 = B) (p q : ℝ) (hp : 0 < p) (hq : 0 < q) (h : p + q = dist A B) : ∃ x y : ℝ, x < y ∧ dist (γ x) (γ y) = p ∨ dist (γ x) (γ y) = q ∧ ((γ x).2 = (γ y).2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_chord_length_p_or_q", "source_license": null, "theorem_names": ["exists_chord_length_p_or_q"], "statement_sha256": "35cb9fa0cf04dcebce0e72a8090612690febe5046df3997232fc3f9e17c95987", "task_path": "tasks/rl_align__o_proofs_exists_chord_length_p_or_q__35cb9fa0cf04dceb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_chord_length_p_or_q", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_comprehensive_subset__1420416ce34e8b6d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_comprehensive_subset (n : ℕ) (hn : n ≥ 2) (S : Set ℕ) (hS : S.Nonempty) (h : ∀ x : ℕ, x < n → ∃ s : Finset ℕ, ↑s ⊆ S ∧ (Finset.sum s id) % n = x) : ∃ T : Finset ℕ, T.card ≤ n - 1 ∧ (∀ x : ℕ, x < n → ∃ t : Finset ℕ, t ⊆ T ∧ (Finset.sum t id) % n = x) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_comprehensive_subset", "source_license": null, "theorem_names": ["exists_comprehensive_subset"], "statement_sha256": "1420416ce34e8b6db88fd9484cbaab8b65920f86031efdcb58a39bc1f792163d", "task_path": "tasks/rl_align__o_proofs_exists_comprehensive_subset__1420416ce34e8b6d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_comprehensive_subset", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_continuous_function_g__328d4ffd0f06a5cd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_continuous_function_g : ∃ g : ℝ → ℝ, ContinuousOn g (Set.Icc 0 1) ∧ ∫ t in Set.Icc 0 1, t * g t = 0 ∧ ∫ t in Set.Icc 0 1, t ^ 4 * g t = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_continuous_function_g", "source_license": null, "theorem_names": ["exists_continuous_function_g"], "statement_sha256": "328d4ffd0f06a5cdf194d2aebe96653b9c840dee290918800909b5f2248b28d6", "task_path": "tasks/rl_align__o_proofs_exists_continuous_function_g__328d4ffd0f06a5cd", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_continuous_function_g", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_coprime_subset__885c04508bd81782", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_coprime_subset (n : ℕ) (A : Finset ℕ) (hA : A ⊆ Finset.Icc 1 (2 * n)) (h_card : A.card = n + 1) : ∃ x y : ℕ, x ∈ A ∧ y ∈ A ∧ x ≠ y ∧ Nat.Coprime x y := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_coprime_subset", "source_license": null, "theorem_names": ["exists_coprime_subset"], "statement_sha256": "885c04508bd81782788629af79910fc60f6d90c879424c9e278cbc8fd35d5504", "task_path": "tasks/rl_align__o_proofs_exists_coprime_subset__885c04508bd81782", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_coprime_subset", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_deriv_eq_one__c4ab6a3145158e5f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_deriv_eq_one (f : ℝ → ℝ) (hf : DifferentiableOn ℝ f (Set.Icc 0 1)) (h : f 0 = 0) (h' : f 1 = 1) : ∃ x y : ℝ, x ∈ Set.Icc 0 1 ∧ y ∈ Set.Icc 0 1 ∧ x ≠ y ∧ deriv f x * deriv f y = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_deriv_eq_one", "source_license": null, "theorem_names": ["exists_deriv_eq_one"], "statement_sha256": "c4ab6a3145158e5f51500cbc4f5ae0751c34d975f2f8cf2e31aeb6c1b4e8d4d4", "task_path": "tasks/rl_align__o_proofs_exists_deriv_eq_one__c4ab6a3145158e5f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_deriv_eq_one", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_derivative_eq_one_third__5537a02f4c830459", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_derivative_eq_one_third (f : ℝ → ℝ) (hf : ContinuousOn f (Set.Icc 0 2)) (hd : DifferentiableOn ℝ f (Set.Ioo 0 2)) (h₀ : f 0 = 0) (h₁ : f 1 = 1) (h₂ : f 2 = 1) : ∃ c : ℝ, c ∈ Set.Ioo 0 2 ∧ deriv f c = 1 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_derivative_eq_one_third", "source_license": null, "theorem_names": ["exists_derivative_eq_one_third"], "statement_sha256": "5537a02f4c8304591d18eedcf779f8c1f57e9d31025fed9ecac00c19e3137918", "task_path": "tasks/rl_align__o_proofs_exists_derivative_eq_one_third__5537a02f4c830459", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_derivative_eq_one_third", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_distinct_integers_dividing_sum__37fb84e546ad0d7b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_distinct_integers_dividing_sum (n : ℕ) (hn : 0 < n) : ∃ (r : Fin n → ℤ), (∀ i j : Fin n, i ≠ j → r i ≠ r j) ∧ ∀ i : Fin n, r i ∣ ∑ j : Fin n, r j := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_distinct_integers_dividing_sum", "source_license": null, "theorem_names": ["exists_distinct_integers_dividing_sum"], "statement_sha256": "37fb84e546ad0d7bbef268f8d805f36847f08bf4928b15cc8cb82b2bd72a4b72", "task_path": "tasks/rl_align__o_proofs_exists_distinct_integers_dividing_sum__37fb84e546ad0d7b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_distinct_integers_dividing_sum", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_distinct_positive_integers_satisfying_eq__7b90f3fbc0b3e260", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_distinct_positive_integers_satisfying_eq (m : ℕ) (h₁ : m ≥ 1) : ∃ x : Fin m → ℕ, (∀ i j : Fin m, i ≠ j → x i ≠ x j) ∧ (∑ i : Fin m, x i)^2 = ∑ i : Fin m, (x i)^3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_distinct_positive_integers_satisfying_eq", "source_license": null, "theorem_names": ["exists_distinct_positive_integers_satisfying_eq"], "statement_sha256": "7b90f3fbc0b3e260d4d3b15e73544c7afd422b94ed07a8a7f0c725312e7995b2", "task_path": "tasks/rl_align__o_proofs_exists_distinct_positive_integers_satisfying_eq__7b90f3fbc0b3e260", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_distinct_positive_integers_satisfying_eq", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_erasable_number__f3c3c7bd3aff4de1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_erasable_number (n : ℕ) (hn : n > 1 ∧ Odd n) :\n ∃ k ∈ Set.Ico n (2 * n), ¬(2 * n * (2 * n - 1) / 2 - k) % k = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_erasable_number", "source_license": null, "theorem_names": ["exists_erasable_number"], "statement_sha256": "f3c3c7bd3aff4de10bf9901595c4202cbbfd93429fb3ace94c11fbea4b9eee46", "task_path": "tasks/rl_align__o_proofs_exists_erasable_number__f3c3c7bd3aff4de1", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_erasable_number", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_fibonacci_divisible_by_a__82560a40c1837f06", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_fibonacci_divisible_by_a (k : ℕ) (h : k > 0) : ∃ (a : ℕ), (∃ (S : Set ℕ), (∀ p ∈ S, Nat.Prime p) ∧ (Nat.card S) ≥ k) ∧ (a ∣ Nat.fib a) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_fibonacci_divisible_by_a", "source_license": null, "theorem_names": ["exists_fibonacci_divisible_by_a"], "statement_sha256": "82560a40c1837f0614d8ada15c64411d4b627f5d83fbea2f153ede55eb368c49", "task_path": "tasks/rl_align__o_proofs_exists_fibonacci_divisible_by_a__82560a40c1837f06", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_fibonacci_divisible_by_a", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_finite_nonzero_set_M__f468437475ff069c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_finite_nonzero_set_M : ∃ M : Finset ℝ, M.Nonempty ∧ 0 ∉ M ∧ ∀ n : ℕ, ∃ p : Polynomial ℝ, p.degree ≥ n ∧ ∀ z ∈ p.roots, z ∈ M := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_finite_nonzero_set_M", "source_license": null, "theorem_names": ["exists_finite_nonzero_set_M"], "statement_sha256": "f468437475ff069c66df5698507a55e8d4ac62d03b867f48c619b04d9c85ded0", "task_path": "tasks/rl_align__o_proofs_exists_finite_nonzero_set_M__f468437475ff069c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_finite_nonzero_set_M", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_four_sequences__994058c55ec09907", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_four_sequences : ∃ (a b c d : Fin 2007 → ℕ), (∀ i : Fin 2007, a i ∈ Set.Icc 1 2007 ∧ b i ∈ Set.Icc 1 2007 ∧ c i ∈ Set.Icc 1 2007 ∧ d i ∈ Set.Icc 1 2007) ∧ (∀ i j : Fin 2007, i ≠ j → (a i ≠ a j ∨ b i ≠ b j) ∧ (c i ≠ c j ∨ d i ≠ d j)) ∧ (∑ i, a i * b i) = 2 * (∑ i, c i * d i) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_four_sequences", "source_license": null, "theorem_names": ["exists_four_sequences"], "statement_sha256": "994058c55ec09907c22092a8750d72a708a602be5d40678850f415dc4ab4b8a2", "task_path": "tasks/rl_align__o_proofs_exists_four_sequences__994058c55ec09907", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_four_sequences", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinite_composite_satisfying_a__f26c65afbc586d73", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinite_composite_satisfying_a (a : ℕ) : ∃ (s : Set ℕ), ∃ (g : ℕ → ℕ), (∀ n, g n ∈ s) ∧ (∀ n, g n > 1) ∧ (∀ n, ¬Nat.Prime (g n)) ∧ (∀ n, a ^ (g n - 1) ≡ a [ZMOD (g n)]) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_composite_satisfying_a", "source_license": null, "theorem_names": ["exists_infinite_composite_satisfying_a"], "statement_sha256": "f26c65afbc586d7399042ff41d970ddc8fc134597d131a0089b4adb2cd907a36", "task_path": "tasks/rl_align__o_proofs_exists_infinite_composite_satisfying_a__f26c65afbc586d73", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_composite_satisfying_a", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinite_double_squares_3__6516adba9dc434fd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinite_double_squares : ∃ (s : Set ℕ), s.Infinite ∧ ∀ n ∈ s, ∃ (a : ℕ), a > 0 ∧ n = a ^ 2 ∧ ∃ (b : ℕ), b > 0 ∧ 10 ^ b ≤ a ∧ a < 10 ^ (2 * b) ∧ a % (10 ^ b) = a / (10 ^ b) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_infinite_double_squares_3", "source_license": null, "theorem_names": ["exists_infinite_double_squares"], "statement_sha256": "6516adba9dc434fdc40457257cf63a28d134ab690f5fd2bf5852adf66a12066e", "task_path": "tasks/rl_align__o_proofs_exists_infinite_double_squares_3__6516adba9dc434fd", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_infinite_double_squares_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinite_multiples_2__a1b983e311df0591", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinite_multiples (p : ℕ) (hp : Nat.Prime p) : ∃ (s : Set ℕ), Set.Infinite s ∧ ∀ m ∈ s, p ∣ m ∧ ∃ (x y : ℕ), x > 0 ∧ y > 0 ∧ m = (x^2 + y + 1) / (x + y^2 + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_multiples_2", "source_license": null, "theorem_names": ["exists_infinite_multiples"], "statement_sha256": "a1b983e311df0591d9801731e15d33df697f3820cadfbbd881b4827dbe4d3c73", "task_path": "tasks/rl_align__o_proofs_exists_infinite_multiples_2__a1b983e311df0591", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_multiples_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinite_n_11__3491326b25c5b282", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinite_n (a : Fin 6 → ℤ) (m : ℤ) (h₁ : m % 7 ≠ 0) (h₂ : (a 5 * m ^ 5 + a 4 * m ^ 4 + a 3 * m ^ 3 + a 2 * m ^ 2 + a 1 * m + 8) % 7 = 0) : Set.Infinite {n : ℤ | (8 * n ^ 5 + a 1 * n ^ 4 + a 2 * n ^ 3 + a 3 * n ^ 2 + a 4 * n + a 5) % 7 = 0} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_infinite_n_11", "source_license": null, "theorem_names": ["exists_infinite_n"], "statement_sha256": "3491326b25c5b282079b4465e0d3517f0be9c02501eef1405af86522363d07d5", "task_path": "tasks/rl_align__o_proofs_exists_infinite_n_11__3491326b25c5b282", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_infinite_n_11", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinite_n_dividing_2n_plus_1__ff8979523c4704fd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinite_n_dividing_2n_plus_1 : ∃ (S : Set ℕ), S.Infinite ∧ ∀ n ∈ S, n ∣ (2 ^ n + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_n_dividing_2n_plus_1", "source_license": null, "theorem_names": ["exists_infinite_n_dividing_2n_plus_1"], "statement_sha256": "ff8979523c4704fd8dc36069cd0f139680669c818fa097ece60f1b23acdb737c", "task_path": "tasks/rl_align__o_proofs_exists_infinite_n_dividing_2n_plus_1__ff8979523c4704fd", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_n_dividing_2n_plus_1", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinite_n_divisible_by_2018__ba6fe1927acd94b6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinite_n_divisible_by_2018 : ∃ (s : Set ℕ), s.Infinite ∧ ∀ n ∈ s, 2018 ∣ (1 + 2^n + 3^n + 4^n) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_infinite_n_divisible_by_2018", "source_license": null, "theorem_names": ["exists_infinite_n_divisible_by_2018"], "statement_sha256": "ba6fe1927acd94b6bcf443452dd9902c873859b978db922917246fbcfff16587", "task_path": "tasks/rl_align__o_proofs_exists_infinite_n_divisible_by_2018__ba6fe1927acd94b6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_infinite_n_divisible_by_2018", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinite_non_representable__57ed3090d6791b0d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinite_non_representable : ∃ (S : Set ℕ), S.Infinite ∧ ∀ x ∈ S, ¬∃ (p : ℕ) (hp : Nat.Prime p) (n k : ℕ), x = p + n ^ (2 * k) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_non_representable", "source_license": null, "theorem_names": ["exists_infinite_non_representable"], "statement_sha256": "57ed3090d6791b0dd938f2f77ec9a27abe5f9128df25d0dfb832ce264531e24e", "task_path": "tasks/rl_align__o_proofs_exists_infinite_non_representable__57ed3090d6791b0d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_non_representable", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinite_nonexpressible_numbers__2e9894b479f37366", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinite_nonexpressible_numbers :\n ∃ s : Set ℕ, s.Infinite ∧ ∀ n ∈ s, ¬∃ p : ℕ, p.Prime ∧ ∃ a k : ℕ, p + a^(2*k) = n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_nonexpressible_numbers", "source_license": null, "theorem_names": ["exists_infinite_nonexpressible_numbers"], "statement_sha256": "2e9894b479f3736660c2bc8cf4fa9fbe0a39289c3aab6678d0b72f810ae68056", "task_path": "tasks/rl_align__o_proofs_exists_infinite_nonexpressible_numbers__2e9894b479f37366", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_nonexpressible_numbers", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinite_odd_terms__9a2812887ac30f86", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinite_odd_terms : ∃ (s : Set ℕ), s.Infinite ∧ ∀ n ∈ s, Odd (Finset.sum (Finset.Icc 1 n) (fun k => k ^ k)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_odd_terms", "source_license": null, "theorem_names": ["exists_infinite_odd_terms"], "statement_sha256": "9a2812887ac30f86d76490a98e5d4939ed26f3b23ccd923e401976e1c3af0e76", "task_path": "tasks/rl_align__o_proofs_exists_infinite_odd_terms__9a2812887ac30f86", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_odd_terms", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinite_odds_n_such_that_2_pow_n_plus_n_is_composite__97e44c4a4162f340", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinite_odds_n_such_that_2_pow_n_plus_n_is_composite : Set.Infinite {n : ℕ | Odd n ∧ ¬Nat.Prime (2^n + n)} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_odds_n_such_that_2_pow_n_plus_n_is_composite", "source_license": null, "theorem_names": ["exists_infinite_odds_n_such_that_2_pow_n_plus_n_is_composite"], "statement_sha256": "97e44c4a4162f340b6e5f347475eaa551e026d1d39552af42491903e17ed7d31", "task_path": "tasks/rl_align__o_proofs_exists_infinite_odds_n_such_that_2_pow_n_plus_n_is_composite__97e44c4a4162f340", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_odds_n_such_that_2_pow_n_plus_n_is_composite", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinite_pairwise_coprime_subset__5859ce7c98f0e518", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinite_pairwise_coprime_subset (a : ℕ) (ha : a > 1) : ∃ s : Set ℕ, s.Infinite ∧ ∀ m ∈ s, ∀ n ∈ s, m ≠ n → Nat.Coprime m n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_pairwise_coprime_subset", "source_license": null, "theorem_names": ["exists_infinite_pairwise_coprime_subset"], "statement_sha256": "5859ce7c98f0e518151d3f04223fd57a6f0d1e53b5766e74d0178d9b23ed55f8", "task_path": "tasks/rl_align__o_proofs_exists_infinite_pairwise_coprime_subset__5859ce7c98f0e518", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinite_pairwise_coprime_subset", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinite_pos_ints_with_sum_of_digits_property__75441ce2cb70411c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinite_pos_ints_with_sum_of_digits_property :\n Set.Infinite {x : ℕ | x > 0 ∧ (Nat.digits 10 x).sum + (Nat.digits 10 (x ^ 2)).sum = (Nat.digits 10 (x ^ 3)).sum} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_infinite_pos_ints_with_sum_of_digits_property", "source_license": null, "theorem_names": ["exists_infinite_pos_ints_with_sum_of_digits_property"], "statement_sha256": "75441ce2cb70411ceabdbdff8659d4012f4ae2ea3383e0a978f6aefbda09323f", "task_path": "tasks/rl_align__o_proofs_exists_infinite_pos_ints_with_sum_of_digits_property__75441ce2cb70411c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_infinite_pos_ints_with_sum_of_digits_property", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinite_primes_dividing_a_n__78fa529168e97af4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinite_primes_dividing_a_n (a : ℕ → ℕ) (h₀ : ∀ n, 0 < a (n + 1) - a n) (h₁ : ∀ n, a (n + 1) - a n < 2 ^ 2017) : Set.Infinite {p : ℕ | ∃ n, a n % p = 0} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_infinite_primes_dividing_a_n", "source_license": null, "theorem_names": ["exists_infinite_primes_dividing_a_n"], "statement_sha256": "78fa529168e97af4a0e9db15b5b6cc0b662d94bf9b60e23d997f95ddb954bf11", "task_path": "tasks/rl_align__o_proofs_exists_infinite_primes_dividing_a_n__78fa529168e97af4", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_infinite_primes_dividing_a_n", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinitely_differentiable_with_derivative_zeros__280533bf6a03c928", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinitely_differentiable_with_derivative_zeros (n : ℕ) (h : 0 < n) :\n ∃ (f : ℝ → ℝ), (∀ x, HasDerivAt f (deriv f x) x) ∧\n f 1 = 0 ∧ f 0 = 0 ∧ deriv f 0 = 0 ∧ deriv^[n] f 0 = 0 ∧\n ∃ (x : ℝ), x ∈ Set.Ioo 0 1 ∧ deriv^[n + 1] f x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinitely_differentiable_with_derivative_zeros", "source_license": null, "theorem_names": ["exists_infinitely_differentiable_with_derivative_zeros"], "statement_sha256": "280533bf6a03c9287aac3def47216c17dde92a02c96a19ec9a24adbf3dec8a3b", "task_path": "tasks/rl_align__o_proofs_exists_infinitely_differentiable_with_derivative_zeros__280533bf6a03c928", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_infinitely_differentiable_with_derivative_zeros", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_infinitely_many_noninteger_alphas__c7b375f976ada332", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_infinitely_many_noninteger_alphas : Set.Infinite {α : ℝ | ∃ k : ℤ, α ≠ k ∧ ∀ n : ℕ, (⌊α^n⌋ - 1) % 2023 = 0} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_infinitely_many_noninteger_alphas", "source_license": null, "theorem_names": ["exists_infinitely_many_noninteger_alphas"], "statement_sha256": "c7b375f976ada332db0c92476abb6f5b2a32041ae29bf25fbfd9eff746173b51", "task_path": "tasks/rl_align__o_proofs_exists_infinitely_many_noninteger_alphas__c7b375f976ada332", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_infinitely_many_noninteger_alphas", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_integer_matrix_with_same_row_col_sums__fd4f0f956922f2d7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_integer_matrix_with_same_row_col_sums (a : Matrix (Fin 3) (Fin 3) ℝ)\n (h₁ : ∀ i, ∃ n : ℤ, ∑ j, a i j = n) (h₂ : ∀ j, ∃ m : ℤ, ∑ i, a i j = m) :\n ∃ b : Matrix (Fin 3) (Fin 3) ℤ,\n (∀ i, ∑ j, b i j = ∑ j, a i j) ∧\n ∀ j, ∑ i, b i j = ∑ i, a i j := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_integer_matrix_with_same_row_col_sums", "source_license": null, "theorem_names": ["exists_integer_matrix_with_same_row_col_sums"], "statement_sha256": "fd4f0f956922f2d7377ca284f1b1d3117f1b1a458f41c56cc5cfa1d5f7cf3424", "task_path": "tasks/rl_align__o_proofs_exists_integer_matrix_with_same_row_col_sums__fd4f0f956922f2d7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_integer_matrix_with_same_row_col_sums", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_inv_deriv_sum_eq_n__58f3878327df33cb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_inv_deriv_sum_eq_n (f : ℝ → ℝ) (hf : DifferentiableOn ℝ f (Set.Icc 0 1)) (hf0 : f 0 = 0) (hf1 : f 1 = 1) (n : ℕ) :\n ∃ (x : Fin n → ℝ), (∀ i : Fin n, x i ∈ Set.Icc 0 1) ∧ ∑ i : Fin n, 1 / (deriv f (x i)) = n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_inv_deriv_sum_eq_n", "source_license": null, "theorem_names": ["exists_inv_deriv_sum_eq_n"], "statement_sha256": "58f3878327df33cb18904d2987021a6526493692827764ad405be2683fdfb0ff", "task_path": "tasks/rl_align__o_proofs_exists_inv_deriv_sum_eq_n__58f3878327df33cb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_inv_deriv_sum_eq_n", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_k_primes_sum_squares_eq_2010__2e2150c159e570a5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_k_primes_sum_squares_eq_2010 : ∃ k : ℕ, ∃ p : Fin k → ℕ, (∀ i : Fin k, Nat.Prime (p i)) ∧ (∀ i j : Fin k, i ≠ j → p i ≠ p j) ∧ (∑ i : Fin k, (p i)^2) = 2010 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_k_primes_sum_squares_eq_2010", "source_license": null, "theorem_names": ["exists_k_primes_sum_squares_eq_2010"], "statement_sha256": "2e2150c159e570a52d0b6c8e6bba8b4ae83f5ba82a2833a0fb9f33b67d0c269c", "task_path": "tasks/rl_align__o_proofs_exists_k_primes_sum_squares_eq_2010__2e2150c159e570a5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_k_primes_sum_squares_eq_2010", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_large_yummy_segment__d1b310afb1ec7d20", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_large_yummy_segment (A : Finset ℕ) (hA : A ⊆ Finset.Icc 1 1000) (hA_card : A.card = 600) :\n ∃ n k : ℕ, Finset.Icc n k ⊆ Finset.Icc 1 1000 ∧ (∀ t ∈ Finset.Icc 1 (k - n), ∃ a ∈ A, ∃ b ∈ A, b - a = t) ∧ k - n ≥ 199 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_large_yummy_segment", "source_license": null, "theorem_names": ["exists_large_yummy_segment"], "statement_sha256": "d1b310afb1ec7d20bd52d104e627a51f4de4d1a35b9cb70f9a005818acb0f59c", "task_path": "tasks/rl_align__o_proofs_exists_large_yummy_segment__d1b310afb1ec7d20", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_large_yummy_segment", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_line_intersecting_all_polygons__e96d5e262c8618a2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_line_intersecting_all_polygons (Poly : Type) [Fintype Poly] (polygons : Poly → Set (ℝ × ℝ))\n (h₁ : ∀ p : Poly, ∃ n m b : ℝ, polygons p = {p : ℝ × ℝ | p.2 = n * p.1 + m ∧ b ≤ p.1 ∧ p.1 ≤ b + 1})\n (h₂ : ∀ p q : Poly, p ≠ q → polygons p ∩ polygons q ≠ ∅) :\n ∃ (a b : ℝ), ∀ p : Poly, ∃ (x y : ℝ), (x, y) ∈ polygons p ∧ a * x + b = y := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_line_intersecting_all_polygons", "source_license": null, "theorem_names": ["exists_line_intersecting_all_polygons"], "statement_sha256": "e96d5e262c8618a2c57f5f48c1f6c8ad4c63b376f5ec836df03b14e47f7b5f02", "task_path": "tasks/rl_align__o_proofs_exists_line_intersecting_all_polygons__e96d5e262c8618a2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_line_intersecting_all_polygons", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_magical_5x5_grid__5d850528084588a4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_magical_5x5_grid : ∃ (grid : Matrix (Fin 5) (Fin 5) ℕ),\n (∀ i j : Fin 5, 1 ≤ grid i j ∧ grid i j ≤ 25) ∧\n (∀ i j : Fin 5, ∀ i' j' : Fin 5, (i, j) ≠ (i', j') → grid i j ≠ grid i' j') ∧\n (∀ i : Fin 5, (∑ j : Fin 5, grid i j) = 65) ∧\n (∀ j : Fin 5, (∑ i : Fin 5, grid i j) = 65) ∧\n (∑ i : Fin 5, grid i i) = 65 ∧\n (∑ i : Fin 5, grid i (4 - i)) = 65 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_magical_5x5_grid", "source_license": null, "theorem_names": ["exists_magical_5x5_grid"], "statement_sha256": "5d850528084588a447a1aacbf9f4d1c5723c5c9907a9a6f0f5076287ff36f522", "task_path": "tasks/rl_align__o_proofs_exists_magical_5x5_grid__5d850528084588a4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_magical_5x5_grid", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_multiple_of_13_in_consecutive_integers__236cb49c08c5a283", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_multiple_of_13_in_consecutive_integers (n : ℕ) : ∃ i ∈ Set.Ico n (n + 79), ∃ (digits : List ℕ), digits.sum % 13 = 0 ∧ i = List.foldl (λ n d => 10 * n + d) 0 digits := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_multiple_of_13_in_consecutive_integers", "source_license": null, "theorem_names": ["exists_multiple_of_13_in_consecutive_integers"], "statement_sha256": "236cb49c08c5a2832cfb14f0853e5c8afda8cd748d4e33a635e4d06551923876", "task_path": "tasks/rl_align__o_proofs_exists_multiple_of_13_in_consecutive_integers__236cb49c08c5a283", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_multiple_of_13_in_consecutive_integers", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_non_polynomial_function_satisfying_inequality__dc4a0cf3c1f6e12e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_non_polynomial_function_satisfying_inequality :\n ∃ f : ℝ → ℝ, ¬(∃ p : Polynomial ℝ, ∀ x, f x = p.eval x) ∧\n ∀ x : ℝ, (x - 1) * f (x + 1) - (x + 1) * f (x - 1) ≥ 4 * x * (x ^ 2 - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_non_polynomial_function_satisfying_inequality", "source_license": null, "theorem_names": ["exists_non_polynomial_function_satisfying_inequality"], "statement_sha256": "dc4a0cf3c1f6e12eafe76de247d57598510ad29e449c2984afcee661c4e77870", "task_path": "tasks/rl_align__o_proofs_exists_non_polynomial_function_satisfying_inequality__dc4a0cf3c1f6e12e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_non_polynomial_function_satisfying_inequality", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_non_right_triangle_in_circle_with_sum_of_squares_eq_4__aec9a60c9f385b89", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_non_right_triangle_in_circle_with_sum_of_squares_eq_4 : ∃ (a b c : ℝ), a > 0 ∧ b > 0 ∧ c > 0 ∧ a ≠ b ∧ b ≠ c ∧ a ≠ c ∧ a^2 + b^2 ≠ c^2 ∧ a^2 + b^2 = 4 ∧ ∃ (A B C : ℝ × ℝ), (A.1^2 + A.2^2 = 1) ∧ (B.1^2 + B.2^2 = 1) ∧ (C.1^2 + C.2^2 = 1) ∧ dist A B = a ∧ dist B C = b ∧ dist C A = c := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_non_right_triangle_in_circle_with_sum_of_squares_eq_4", "source_license": null, "theorem_names": ["exists_non_right_triangle_in_circle_with_sum_of_squares_eq_4"], "statement_sha256": "aec9a60c9f385b890f1da77e651ecaa918d2909194cf391d4d61e3a9b1f7558c", "task_path": "tasks/rl_align__o_proofs_exists_non_right_triangle_in_circle_with_sum_of_squares_eq_4__aec9a60c9f385b89", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_non_right_triangle_in_circle_with_sum_of_squares_eq_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_nonconstant_arithmetic_progression_with_nonprime_binomia__929cb47fee1d65e5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_nonconstant_arithmetic_progression_with_nonprime_binomials :\n ∃ (d : ℕ) (a : ℕ → ℕ),\n (∀ n : ℕ, a (n + 1) = a n + d) ∧ d ≠ 0 ∧\n ∀ n : ℕ, n ≠ 0 → ¬Nat.Prime (Nat.choose (a n) n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_nonconstant_arithmetic_progression_with_nonprime_binomials", "source_license": null, "theorem_names": ["exists_nonconstant_arithmetic_progression_with_nonprime_binomials"], "statement_sha256": "929cb47fee1d65e5f6fa53f3f94b03c5e2560d4f3e4bab4d64e5a230d3cdbb21", "task_path": "tasks/rl_align__o_proofs_exists_nonconstant_arithmetic_progression_with_nonprime_binomia__929cb47fee1d65e5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_nonconstant_arithmetic_progression_with_nonprime_binomials", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_pair_greater_than_product__03fea82a536c520f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_pair_greater_than_product (a : ℕ × ℕ → ℕ) (h : ∀ n, Set.ncard {p : ℕ × ℕ | a p = n} = 8) : ∃ m n : ℕ, a (m, n) > m * n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_pair_greater_than_product", "source_license": null, "theorem_names": ["exists_pair_greater_than_product"], "statement_sha256": "03fea82a536c520f53acbbadff620784b15af3ef0ffd9fed92941195adb32bdb", "task_path": "tasks/rl_align__o_proofs_exists_pair_greater_than_product__03fea82a536c520f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_pair_greater_than_product", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_pair_with_product_no_greater_than_neg_one_div_n__00c307bc0f0b6fe2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_pair_with_product_no_greater_than_neg_one_div_n (n : ℕ) (hn : n ≥ 2) (a : Fin n → ℝ)\n (h₁ : ∑ i, a i = 0) (h₂ : ∑ i, a i ^ 2 = 1) :\n ∃ i j : Fin n, i ≠ j ∧ a i * a j ≤ -1 / n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_pair_with_product_no_greater_than_neg_one_div_n", "source_license": null, "theorem_names": ["exists_pair_with_product_no_greater_than_neg_one_div_n"], "statement_sha256": "00c307bc0f0b6fe2d28850747e61b13bf7864407263f61092efbda629752567b", "task_path": "tasks/rl_align__o_proofs_exists_pair_with_product_no_greater_than_neg_one_div_n__00c307bc0f0b6fe2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_pair_with_product_no_greater_than_neg_one_div_n", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_partition_divisors_not_square__ee260a6e1f0f2532", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_partition_divisors_not_square (n : ℕ) (hn : n > 0) (h : ¬(∃ k : ℕ, k ^ 2 = n)) :\n ∃ (A : Set (ℕ × ℕ)), (∀ (d1 d2 : ℕ), (d1, d2) ∈ A → d1 ∣ d2) ∧\n (∀ (d1 d2 : ℕ), (d1, d2) ∈ A → d1 < d2) ∧\n (∀ d : ℕ, d ∣ n ↔ ∃ d1 d2 : ℕ, (d1, d2) ∈ A ∧ (d = d1 ∨ d = d2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_partition_divisors_not_square", "source_license": null, "theorem_names": ["exists_partition_divisors_not_square"], "statement_sha256": "ee260a6e1f0f2532acd27c9f0d92faa2fefbd91fea8e142e540513701ae2e090", "task_path": "tasks/rl_align__o_proofs_exists_partition_divisors_not_square__ee260a6e1f0f2532", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_partition_divisors_not_square", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_poly_divisible_by_7_and_12__845a7571030b48ba", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_poly_divisible_by_7_and_12 : ∃ p : Polynomial ℤ, (∀ x : ℤ, 7 ∣ p.eval x ∧ 12 ∣ p.eval x) ∧ ¬ (∀ i : ℕ, 7 ∣ p.coeff i) ∧ ¬ (∀ i : ℕ, 12 ∣ p.coeff i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_poly_divisible_by_7_and_12", "source_license": null, "theorem_names": ["exists_poly_divisible_by_7_and_12"], "statement_sha256": "845a7571030b48ba6ab575067a1218ccf9881e25cb1cded77056a2b6deaa3cec", "task_path": "tasks/rl_align__o_proofs_exists_poly_divisible_by_7_and_12__845a7571030b48ba", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_poly_divisible_by_7_and_12", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_polynomial_with_infinitely_many_prime_roots__c67f5d7019233f64", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_polynomial_with_infinitely_many_prime_roots :\n ∃ (P : Polynomial ℤ), P.degree ≥ 2 ∧\n ∃ (q : ℕ → ℕ), (∀ n : ℕ, Nat.Prime (q n)) ∧\n ∀ n : ℕ, ∃ x : ℤ, P.eval x = q n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_polynomial_with_infinitely_many_prime_roots", "source_license": null, "theorem_names": ["exists_polynomial_with_infinitely_many_prime_roots"], "statement_sha256": "c67f5d7019233f64beeb2aa9535f93bde41896feb99a8e9341ac9993cad92b33", "task_path": "tasks/rl_align__o_proofs_exists_polynomial_with_infinitely_many_prime_roots__c67f5d7019233f64", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_polynomial_with_infinitely_many_prime_roots", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_polynomials_satisfying__bc45b0e7ba4a6562", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_polynomials_satisfying : ∃ P Q : Polynomial ℤ, P^5 = Q^2 + 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_polynomials_satisfying", "source_license": null, "theorem_names": ["exists_polynomials_satisfying"], "statement_sha256": "bc45b0e7ba4a6562394733152b0364074b3b2c7ee2c9f8b741bbff9ebbfb3be6", "task_path": "tasks/rl_align__o_proofs_exists_polynomials_satisfying__bc45b0e7ba4a6562", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_polynomials_satisfying", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_power_series_diverges_at_all_except_one__19f9270b40a11120", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_power_series_diverges_at_all_except_one :\n ∃ (a : ℕ → ℝ), (∀ z : ℂ, ‖z‖ = 1 → z ≠ 1 → ¬HasSum (fun n => a n * z^n) (a 0 * 1)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_power_series_diverges_at_all_except_one", "source_license": null, "theorem_names": ["exists_power_series_diverges_at_all_except_one"], "statement_sha256": "19f9270b40a11120352903117117d23ed4e8f33591fb407d02b0365ce9e94b11", "task_path": "tasks/rl_align__o_proofs_exists_power_series_diverges_at_all_except_one__19f9270b40a11120", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_power_series_diverges_at_all_except_one", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_product_le_neg_one_over_n_2__aec5fb0d55beb769", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_product_le_neg_one_over_n (n : ℕ) (hn : n ≥ 2) (x : Fin n → ℝ) (hx : ∑ i, x i = 0) (h : ∑ i, (x i)^2 = 1) : ∃ i j : Fin n, i ≠ j ∧ x i * x j ≤ -1 / n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_product_le_neg_one_over_n_2", "source_license": null, "theorem_names": ["exists_product_le_neg_one_over_n"], "statement_sha256": "aec5fb0d55beb7695568f15cb96bf1b214767e1e3b76efc8d9562734b4bab4e3", "task_path": "tasks/rl_align__o_proofs_exists_product_le_neg_one_over_n_2__aec5fb0d55beb769", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_product_le_neg_one_over_n_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_quadratic_trinomial__e1862ae081ebdedb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_quadratic_trinomial (a b c : ℕ) (ha : a ≠ b ∧ a ≠ c) (hb : b ≠ c) :\n ∃ (f : Polynomial ℤ), f.coeff 2 > 0 ∧\n ∃ x y z : ℤ, f.eval x = a ^ 3 ∧ f.eval y = b ^ 3 ∧ f.eval z = c ^ 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_quadratic_trinomial", "source_license": null, "theorem_names": ["exists_quadratic_trinomial"], "statement_sha256": "e1862ae081ebdedbd9c69fcbfa2007161f0c3e3c1c7dac5b0d3cbd506c49efc4", "task_path": "tasks/rl_align__o_proofs_exists_quadratic_trinomial__e1862ae081ebdedb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_quadratic_trinomial", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_same_color_1cm_apart__0b0e8f293d95f04c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_same_color_1cm_apart (color : ℝ × ℝ → ℕ) (h_color : ∀ p, color p < 3) : ∃ x y : ℝ × ℝ, dist x y = 1 ∧ color x = color y := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_same_color_1cm_apart", "source_license": null, "theorem_names": ["exists_same_color_1cm_apart"], "statement_sha256": "0b0e8f293d95f04c0d734afd0e2e97ff5f195e33987bf21bdcc026c1a12b7b25", "task_path": "tasks/rl_align__o_proofs_exists_same_color_1cm_apart__0b0e8f293d95f04c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_same_color_1cm_apart", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_sequence_3__cffa1d5383668c4c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_sequence : ∃ (a : ℕ → ℝ), (∀ i, a i > 0) ∧ ∀ k ∈ Set.Icc 1 2010, (∀ z : ℂ, ∃ (p : Polynomial ℂ), p.degree = 2009 ∧ ∀ i : ℕ, i ∈ Set.Icc 0 2009 → p.coeff (2009 - i) = a (i + k) ∧ p.eval z = 0 → abs z.im ≤ abs z.re) := by sorry", "target_workspace": {"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"}, "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_exists_sequence_3", "source_license": null, "theorem_names": ["exists_sequence"], "statement_sha256": "cffa1d5383668c4c357aa3feaf3b666d1ea4eedffe3aa0ea78454db64d60d0fb", "task_path": "tasks/rl_align__o_proofs_exists_sequence_3__cffa1d5383668c4c", "metadata": {"split": "train", "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_exists_sequence_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_sequence_converges_sum_but_not_cubic_sum__7eeb7a9fda23da3a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_sequence_converges_sum_but_not_cubic_sum : ∃ (a : ℕ → ℝ), (∃ g : ℝ, Filter.Tendsto (fun n => Finset.sum (Finset.range n) a) Filter.atTop (nhds g)) ∧ ¬Filter.Tendsto (fun n => Finset.sum (Finset.range n) (fun k => a k ^ 3)) Filter.atTop (nhds 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_sequence_converges_sum_but_not_cubic_sum", "source_license": null, "theorem_names": ["exists_sequence_converges_sum_but_not_cubic_sum"], "statement_sha256": "7eeb7a9fda23da3ab5b9a78676a79f5eae79049be34f0db9ae55f739696ce416", "task_path": "tasks/rl_align__o_proofs_exists_sequence_converges_sum_but_not_cubic_sum__7eeb7a9fda23da3a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_sequence_converges_sum_but_not_cubic_sum", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_smallest_positive_integer_n__657f511d275b262d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_smallest_positive_integer_n :\n ∃ n : ℕ, n > 0 ∧ (Matrix.of ![![1 / Real.sqrt 2, 1 / Real.sqrt 2], ![-1 / Real.sqrt 2, 1 / Real.sqrt 2]]) ^ n = Matrix.of ![![1, 0], ![0, 1]] ∧ ∀ m : ℕ, m > 0 → (Matrix.of ![![1 / Real.sqrt 2, 1 / Real.sqrt 2], ![-1 / Real.sqrt 2, 1 / Real.sqrt 2]]) ^ m = Matrix.of ![![1, 0], ![0, 1]] → m ≥ n := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_smallest_positive_integer_n", "source_license": null, "theorem_names": ["exists_smallest_positive_integer_n"], "statement_sha256": "657f511d275b262d392b9c2d08de94a2395c3e8981f0ce5000ed97938fe3dd07", "task_path": "tasks/rl_align__o_proofs_exists_smallest_positive_integer_n__657f511d275b262d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_smallest_positive_integer_n", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_subset_covered_by_disk__93dbd188089fed35", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_subset_covered_by_disk (P : Finset (ℝ × ℝ)) (h₁ : P.card = 2013) (h₂ : ∀ x ∈ P, ∀ y ∈ P, ∀ z ∈ P, dist x y ≤ 1 ∨ dist x z ≤ 1 ∨ dist y z ≤ 1) : ∃ Q : Finset (ℝ × ℝ), Q ⊆ P ∧ Q.card = 1007 ∧ ∃ (c : ℝ × ℝ) (r : ℝ), r = 1 ∧ ∀ p ∈ Q, dist p c ≤ r := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_subset_covered_by_disk", "source_license": null, "theorem_names": ["exists_subset_covered_by_disk"], "statement_sha256": "93dbd188089fed35c090f36d5895c157b453a7872884bff4c34a06f71f300123", "task_path": "tasks/rl_align__o_proofs_exists_subset_covered_by_disk__93dbd188089fed35", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_subset_covered_by_disk", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_subset_with_sum_condition__f3a6f46f7bf87835", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_subset_with_sum_condition (n : ℕ) (hn : n ≥ 2) (M : Finset ℚ) (hM : M.card = 2 * n ^ 2 - 3 * n + 2) : ∃ A : Finset ℚ, A.card = n ∧ ∀ k : ℕ, k ≥ 2 → k ≤ n → ∀ (s : Finset ℚ), s.card = k → s ⊆ A → ¬(∃ x ∈ A, s.sum id = x) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_subset_with_sum_condition", "source_license": null, "theorem_names": ["exists_subset_with_sum_condition"], "statement_sha256": "f3a6f46f7bf878352a768131d1ba92446ded2d23493395c0970146bb67a464cc", "task_path": "tasks/rl_align__o_proofs_exists_subset_with_sum_condition__f3a6f46f7bf87835", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_subset_with_sum_condition", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_three_ages_sum_at_least_142__2eab71c6ac2dc058", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_three_ages_sum_at_least_142 (a : Fin 7 → ℕ) (h : ∑ i : Fin 7, a i = 332) : ∃ i j k : Fin 7, i ≠ j ∧ j ≠ k ∧ i ≠ k ∧ a i + a j + a k ≥ 142 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_three_ages_sum_at_least_142", "source_license": null, "theorem_names": ["exists_three_ages_sum_at_least_142"], "statement_sha256": "2eab71c6ac2dc0588f452ac2594e4b8172111e7533623ee9c47e34f367936871", "task_path": "tasks/rl_align__o_proofs_exists_three_ages_sum_at_least_142__2eab71c6ac2dc058", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_three_ages_sum_at_least_142", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_two_sets__61a777546fc3885b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem exists_two_sets :\n ∃ A B : Finset ℕ,\n A ≠ ∅ ∧ B ≠ ∅ ∧ A ∩ B = ∅ ∧\n A ∪ B = Finset.Icc 1 2021 ∧\n IsSquare (∑ x ∈ A, x * ∑ x ∈ B, x) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_two_sets", "source_license": null, "theorem_names": ["exists_two_sets"], "statement_sha256": "61a777546fc3885bc087ae6fb833de725fc2cb38f4f1fffb862638ee0a9d0c9b", "task_path": "tasks/rl_align__o_proofs_exists_two_sets__61a777546fc3885b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_two_sets", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_x1_x2_with_product_derivative_one__5095aff407dd794a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_x1_x2_with_product_derivative_one (a b : ℝ) (f : ℝ → ℝ)\n (h : a < b) (h_cont : ContinuousOn f (Set.Icc a b)) (h_diff : DifferentiableOn ℝ f (Set.Ioo a b))\n (h_a : f a = a) (h_b : f b = b) : ∃ x1 x2 : ℝ, x1 ∈ Set.Ioo a b ∧ x2 ∈ Set.Ioo a b ∧ x1 ≠ x2 ∧ deriv f x1 * deriv f x2 = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_x1_x2_with_product_derivative_one", "source_license": null, "theorem_names": ["exists_x1_x2_with_product_derivative_one"], "statement_sha256": "5095aff407dd794a7bda27f2037a53921622750c62b3f6acd6d2cb94317948ca", "task_path": "tasks/rl_align__o_proofs_exists_x1_x2_with_product_derivative_one__5095aff407dd794a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exists_x1_x2_with_product_derivative_one", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exists_xi_sum_eq_product__8f76dc4ebdcccb90", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem exists_xi_sum_eq_product (n : ℕ) (hn : n > 0) : ∃ (x : Fin n → ℕ), (∀ i, x i > 0) ∧ (∑ i, x i) = ∏ i, x i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_xi_sum_eq_product", "source_license": null, "theorem_names": ["exists_xi_sum_eq_product"], "statement_sha256": "8f76dc4ebdcccb9031f73f7a9f75ee1ed14f053459e854a8c04045d7be7534bc", "task_path": "tasks/rl_align__o_proofs_exists_xi_sum_eq_product__8f76dc4ebdcccb90", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exists_xi_sum_eq_product", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exp1_3__107f5a21a7fb6df7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem exp1 (n : ℕ) (f : Fin n → ℝ) (hpos : ∀ i : Fin n, f i > 0) :\n (∏ i : Fin n, (f i) ^ (f i)) ≥ (∏ i : Fin n, f i) ^ ((∑ i : Fin n, f i) / n : ℝ) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exp1_3", "source_license": null, "theorem_names": ["exp1"], "statement_sha256": "107f5a21a7fb6df7b48d4287f944b1aecd57e01445d4285f4cc78727154037e4", "task_path": "tasks/rl_align__o_proofs_exp1_3__107f5a21a7fb6df7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exp1_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exp_220__f0808a4f6ce6b71d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem exp (m s : ℝ) (hm : 0 < s) (hs : s < m) (k : ℕ) :\n ∫ x in Set.Ioi 0, m ^ k * x ^ (k - 1) * Real.exp (-m * x) * Real.exp (s * x) / Nat.factorial (k - 1) =\n ((m / (m - s)) ^ k) * ∫ x in Set.Ioi 0, ((m - s) ^ k) * x ^ (k - 1) *\n Real.exp (-(m - s) * x) / Nat.factorial (k - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exp_220", "source_license": null, "theorem_names": ["exp"], "statement_sha256": "f0808a4f6ce6b71d5623267549fb409d422c2962f71d0d3e1e5740d7bd23f95c", "task_path": "tasks/rl_align__o_proofs_exp_220__f0808a4f6ce6b71d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exp_220", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exp_52__c841116d7d301b4a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Complex Polynomial LinearMap FiniteDimensional Module Module.End\nopen scoped BigOperators\n\n\ntheorem exp (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = min (x) (1 - x)) :\n ∫ x in (0)..1, f x * (2 * π * x) / (π * 1^2) = 1 / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exp_52", "source_license": null, "theorem_names": ["exp"], "statement_sha256": "c841116d7d301b4ab30719920c8a1b87d0d6f76a668de775be50590b9bfea8f2", "task_path": "tasks/rl_align__o_proofs_exp_52__c841116d7d301b4a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exp_52", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exp_value_16__b62c4107532aeaa0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem exp_value : ∫ x in (0)..1, ∫ y in (0)..1, ∫ z in (0)..1,\n (x + y + z)^2 / (1 * 1 * 1) = 5 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exp_value_16", "source_license": null, "theorem_names": ["exp_value"], "statement_sha256": "b62c4107532aeaa04ce4d94f6f7b81ff81a29a2c507d1e358e059030433d6509", "task_path": "tasks/rl_align__o_proofs_exp_value_16__b62c4107532aeaa0", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_exp_value_16", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_exp_value_6__6eb79e8977084468", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem exp_value : ∫ x in (0)..2, max x (x^3) * (1 / (2 - 0)) = 17 / 8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exp_value_6", "source_license": null, "theorem_names": ["exp_value"], "statement_sha256": "6eb79e8977084468922077c157d4d8eeab74ad338396c4ceca4eca0ef67dbeeb", "task_path": "tasks/rl_align__o_proofs_exp_value_6__6eb79e8977084468", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_exp_value_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_expected_value_4__d21aa38c1420a97e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem expected_value :\n ∫ x in (0)..100, ∫ y in (0)..100, |x - y| * (1 / (100 ^ 2)) = 100 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_expected_value_4", "source_license": null, "theorem_names": ["expected_value"], "statement_sha256": "d21aa38c1420a97e62c947be02357663877f0ac2249d5b3279cfec6e891c8398", "task_path": "tasks/rl_align__o_proofs_expected_value_4__d21aa38c1420a97e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_expected_value_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_f_3694__90ca96090b61a18e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\ntheorem f_3694 (f : ℕ → ℝ)\n (h_f0 : f 0 = 1)\n (h_fdef : ∀ n : ℕ, f (n + 1) = (n + 1) * ∑ i ∈ range (n + 1), f i): ∀ n ≥ 1, f n = n * n ! := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_f_3694", "source_license": null, "theorem_names": ["f_3694"], "statement_sha256": "90ca96090b61a18eb7e53fe6eced1bb9ed8100828587864c351ed355d3e3c26a", "task_path": "tasks/rl_align__o_proofs_f_3694__90ca96090b61a18e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_f_3694", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_f_diff__cc73b8ca65d209c8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\ntheorem f_diff (f : ℝ → ℝ) (hf_diff : DifferentiableOn ℝ f (Set.Icc 0 1))\n (hf_val : f 0 = 0 ∧ f 1 = 1) :\n ∃ (a b : ℝ), a ∈ Set.Ioo 0 1 ∧ b ∈ Set.Ioo 0 1 ∧ a ≠ b ∧\n 1 / deriv f a + 1 / deriv f b = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_f_diff", "source_license": null, "theorem_names": ["f_diff"], "statement_sha256": "cc73b8ca65d209c8d5a9ccc6562c17866f74034a13c408f0dac5d58bc4dea1d4", "task_path": "tasks/rl_align__o_proofs_f_diff__cc73b8ca65d209c8", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_f_diff", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_f_monotone_increase__ede5e13fcdc50043", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem f_monotone_increase (k : ℤ) :\n MonotoneOn (fun x => (Real.sin x)^2 + 2 * Real.sin x * Real.cos x + 3 * (Real.cos x)^2)\n (Set.Icc (k * Real.pi - 3 * Real.pi / 8) (k * Real.pi + Real.pi / 8)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_f_monotone_increase", "source_license": null, "theorem_names": ["f_monotone_increase"], "statement_sha256": "ede5e13fcdc500436e3ef2c79fc7a9bc95cdb2d297e1c0731d3c3f0de05c5ec6", "task_path": "tasks/rl_align__o_proofs_f_monotone_increase__ede5e13fcdc50043", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_f_monotone_increase", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_f_odd_and_symmetric__a43a2ca424bdc687", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem f_odd_and_symmetric (f : ℝ → ℝ) (hf_odd : ∀ x, f (-x) = -f x) (hf_symm : ∀ x, f (1 - x) = f (1 + x)) (hf_exp : ∀ x ∈ Set.Ioc 0 1, f x = Real.exp x) : (∀ x ∈ Set.Ico (-1:ℝ) 0, f x = -Real.exp (-x)) ∧ (∀ k : ℕ, k ≥ 1 → ∀ x ∈ Set.Ioc (4 * k) (4 * k + 1), f x = Real.exp (x - 4 * k)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_f_odd_and_symmetric", "source_license": null, "theorem_names": ["f_odd_and_symmetric"], "statement_sha256": "a43a2ca424bdc68720ec8edcecfe40419ad12952ad3f59b1dd78d61e5ec4579a", "task_path": "tasks/rl_align__o_proofs_f_odd_and_symmetric__a43a2ca424bdc687", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_f_odd_and_symmetric", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_f_value_at_five_halfs__97fcfccd727d5cc1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem f_value_at_five_halfs (f : ℝ → ℝ) (h_period : ∀ x, f (x + 3) = f x)\n (h_piecewise : ∀ x ∈ Set.Icc (-2 : ℝ) 0, f x = 4 * x ^ 2 - 2 ∧ ∀ x ∈ Set.Ioo 0 1, f x = x) :\n f (5 / 2) = -1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_f_value_at_five_halfs", "source_license": null, "theorem_names": ["f_value_at_five_halfs"], "statement_sha256": "97fcfccd727d5cc14ca83433adcfede9caca30270b41d22a9e2f01a82bd4e38e", "task_path": "tasks/rl_align__o_proofs_f_value_at_five_halfs__97fcfccd727d5cc1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_f_value_at_five_halfs", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_fact_n__15f57f486ba71452", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\ntheorem fact_n (n : ℕ) {a : ℕ → ℝ}\n (h₀ : ∀ n ≥ 2, ∑ i ∈ Icc 1 n, a i = (n / (n - 1)) * a n)\n (h₁ : a 1 = 1) :\n ∀ n ≥ 2, a n = (n - 1)! * (n - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_fact_n", "source_license": null, "theorem_names": ["fact_n"], "statement_sha256": "15f57f486ba7145221ef6fedee42323f84ac912ade4e7f8dbf1314a6fc22b9f0", "task_path": "tasks/rl_align__o_proofs_fact_n__15f57f486ba71452", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_fact_n", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_factorial_inequality_3__12cb05d4a3c53c89", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem factorial_inequality (n : ℕ) (hn : n ≥ 6) :\n (Nat.factorial n)^2 ≥ n^n ∧\n Tendsto (λ n => n^2 / Nat.factorial n) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_factorial_inequality_3", "source_license": null, "theorem_names": ["factorial_inequality"], "statement_sha256": "12cb05d4a3c53c890569e66a2fcb1053f11c845818650d82c72266567b1fa167", "task_path": "tasks/rl_align__o_proofs_factorial_inequality_3__12cb05d4a3c53c89", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_factorial_inequality_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_farthest_from_origin_2__78b03468f6704af9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem farthest_from_origin : dist (0, 0) (0, 8) ≥ dist (0, 0) (2, 6) ∧ dist (0, 0) (0, 8) ≥ dist (0, 0) (4, 3) ∧ dist (0, 0) (0, 8) ≥ dist (0, 0) (7, -1) ∧ dist (0, 0) (0, 8) ≥ dist (0, 0) (-3, -5) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_farthest_from_origin_2", "source_license": null, "theorem_names": ["farthest_from_origin"], "statement_sha256": "78b03468f6704af9930c368c9c50842cabac24ed01701ad347eb58c867247463", "task_path": "tasks/rl_align__o_proofs_farthest_from_origin_2__78b03468f6704af9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_farthest_from_origin_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_fermat_number__fd78f73e6b78b9d7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem fermat_number (F : ℕ → ℤ)\n (hF : ∀ n, F n = 2 ^ (2 ^ n) + 1) :\n ∀ n ≥ 1, (F n - 2) / (∏ i ∈ Icc 0 (n - 1), F i) = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_fermat_number", "source_license": null, "theorem_names": ["fermat_number"], "statement_sha256": "fd78f73e6b78b9d747ed31bfb56351cc084b81412d7f79f84a8481e856877c63", "task_path": "tasks/rl_align__o_proofs_fermat_number__fd78f73e6b78b9d7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_fermat_number", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_fib_28__fcf4db3c0d2902ba", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem fib (F : ℕ → ℕ) (hF : ∀ n, F (n + 2) = F (n + 1) + F n)\n (hF0 : F 0 = 0) (hF1 : F 1 = 1) :\n Set.ncard {n | 0 ≤ n ∧ n ≤ 100 ∧ 13 ∣ F n} = 15 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_fib_28", "source_license": null, "theorem_names": ["fib"], "statement_sha256": "fcf4db3c0d2902bab0a2c6d3675eb8a96264d3bb3dfde4a8fa0ae98fc5d68a0b", "task_path": "tasks/rl_align__o_proofs_fib_28__fcf4db3c0d2902ba", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_fib_28", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_firstProblem_22__919c892a743992bc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem firstProblem :\n Set.ncard {p : ℕ × ℕ | p.1 > 0 ∧ p.2 > 0 ∧ 1 ≤ p.1 ∧ p.1 ≤ 100 ∧ 1 ≤ p.2 ∧ p.2 ≤ 100 ∧ Nat.lcm p.1 p.2 = 10 * Nat.gcd p.1 p.2} = 60 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_firstProblem_22", "source_license": null, "theorem_names": ["firstProblem"], "statement_sha256": "919c892a743992bc3ea7f126a4e0489741fc10c94ff19a7c76de22a832da8e90", "task_path": "tasks/rl_align__o_proofs_firstProblem_22__919c892a743992bc", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_firstProblem_22", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_firstProblem_7__6893827d6145a56b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem firstProblem :\n Set.ncard {x : ℤ | ∃ a b : ℕ, x = 7 * a + 13 * b ∧ a + b ≤ 100} = 1235 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_firstProblem_7", "source_license": null, "theorem_names": ["firstProblem"], "statement_sha256": "6893827d6145a56b529658cb644ff02f7de5fcb82f011011e4c329eb15c5433e", "task_path": "tasks/rl_align__o_proofs_firstProblem_7__6893827d6145a56b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_firstProblem_7", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_first_player_has_winning_strategy__887a7e9ab91a8738", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem first_player_has_winning_strategy (n : ℕ) (v : Fin n → ℝ × ℝ) (h₁ : n = 2010) :\n ∃ (s : Finset (Fin n)), s.card = n / 2 ∧\n ∀ (t : Finset (Fin n)), t.card = n / 2 →\n let sum_s := Finset.sum s (fun i => v i)\n let sum_t := Finset.sum t (fun i => v i)\n let dist_s := Real.sqrt (sum_s.1 ^ 2 + sum_s.2 ^ 2)\n let dist_t := Real.sqrt (sum_t.1 ^ 2 + sum_t.2 ^ 2)\n dist_s ≤ dist_t := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_first_player_has_winning_strategy", "source_license": null, "theorem_names": ["first_player_has_winning_strategy"], "statement_sha256": "887a7e9ab91a873870d0aef605f1b478876723da3064a547c32b61adc0425a6d", "task_path": "tasks/rl_align__o_proofs_first_player_has_winning_strategy__887a7e9ab91a8738", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_first_player_has_winning_strategy", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_four_digit_number_14__9d18957876521b05", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem four_digit_number :\n Set.ncard {n : ℕ | ∃ a b c d : ℕ, n = 1000 * a + 100 * b + 10 * c + d ∧\n 1 ≤ a ∧ a ≤ 9 ∧ 0 ≤ b ∧ b ≤ 9 ∧ 0 ≤ c ∧ c ≤ 9 ∧ 0 ≤ d ∧ d ≤ 9 ∧ d = a + b} = 450 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_four_digit_number_14", "source_license": null, "theorem_names": ["four_digit_number"], "statement_sha256": "9d18957876521b05be52fc26271806cd0ba345ec445fe6bc67d3a9cc1f1a5d4b", "task_path": "tasks/rl_align__o_proofs_four_digit_number_14__9d18957876521b05", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_four_digit_number_14", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_fourth_powers_sum_eq_2011_has_no_solutions__d90929a7f5557f5a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem fourth_powers_sum_eq_2011_has_no_solutions (x : Fin 10 → ℕ) : ∑ i, (x i)^4 = 2011 → False := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_fourth_powers_sum_eq_2011_has_no_solutions", "source_license": null, "theorem_names": ["fourth_powers_sum_eq_2011_has_no_solutions"], "statement_sha256": "d90929a7f5557f5adbcb85d1c43706b511f35d0d6a53399b478e93b79d676e21", "task_path": "tasks/rl_align__o_proofs_fourth_powers_sum_eq_2011_has_no_solutions__d90929a7f5557f5a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_fourth_powers_sum_eq_2011_has_no_solutions", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_function__4b626f650a3c384c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem θ_function {f : ℝ → ℝ → ℝ}\n (hf : ∀ x y, f x y = ∑' n : ℤ, x ^ (n ^ 2) * y ^ n)\n (a b : ℝ) (ha : a ≠ 0) (hb : b ≠ 0)\n (S : ℝ → ℝ → ℝ)\n (hS : ∀ b a, S b a = ∑' n : ℤ, exp (n ^ 2 * (b - a / 2)) * exp (n * (-b - a / 2))) :\n S b a = f (exp (b - a / 2)) (exp (-b - a / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_function", "source_license": null, "theorem_names": ["θ_function"], "statement_sha256": "4b626f650a3c384ccdcafedcee55ae3a907a14915e1c584ad508f8af1015bbc7", "task_path": "tasks/rl_align__o_proofs_function__4b626f650a3c384c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_function", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_function_equality_3__fc8c896271c31177", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem function_equality (a b : ℝ) (ha : a ≤ b) (f : ℕ → ℝ → ℝ) (f' g : ℝ → ℝ)\n (hf : ∀ x : ℝ, x ∈ Set.Icc a b → Filter.Tendsto (fun n => f n x) Filter.atTop (𝓝 (f' x)))\n (hg : ∀ x : ℝ, x ∈ Set.Icc a b → Filter.Tendsto (fun n => f n x) Filter.atTop (𝓝 (g x)))\n (h_cont_f : ContinuousOn f' (Set.Icc a b)) (h_cont_g : ContinuousOn g (Set.Icc a b))\n (h_l2_conv : Filter.Tendsto (fun n => Real.sqrt (∫ x in a..b, |f n x - g x|^2)) Filter.atTop (𝓝 0)) :\n ∀ x : ℝ, x ∈ Set.Icc a b → f' x = g x := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_function_equality_3", "source_license": null, "theorem_names": ["function_equality"], "statement_sha256": "fc8c896271c3117734204869214c2b36fb7a65a9cc8c9a67b672cda5b7acee9d", "task_path": "tasks/rl_align__o_proofs_function_equality_3__fc8c896271c31177", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_function_equality_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_galochkin_170_degree_angles__b04c7a1029668198", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem galochkin_170_degree_angles (n : ℕ) (angles : Fin n → ℝ) (h_convex : ∀ i : Fin n, 0 < angles i ∧ angles i < 180) (h_sum : ∑ i : Fin n, angles i = (n - 2) * 180) : Finset.card (Finset.filter (fun i => angles i < 170) Finset.univ) ≤ 35 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_galochkin_170_degree_angles", "source_license": null, "theorem_names": ["galochkin_170_degree_angles"], "statement_sha256": "b04c7a1029668198dfc544cc57bacf195ee4b82ebb519619e2b2dc9cc41a4ef7", "task_path": "tasks/rl_align__o_proofs_galochkin_170_degree_angles__b04c7a1029668198", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_galochkin_170_degree_angles", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_gcd_ab_ba_eq_a_plus_b__462b15ef2f492b2a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem gcd_ab_ba_eq_a_plus_b (a b : ℕ) (ha : a ∈ Set.Icc 1 9) (hb : b ∈ Set.Icc 1 9) (hcoprime : Nat.Coprime a b) (hab : (a + b) ∣ (10 * a + b)) (hba : (a + b) ∣ (10 * b + a)) : a + b = Nat.gcd (10 * a + b) (10 * b + a) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_gcd_ab_ba_eq_a_plus_b", "source_license": null, "theorem_names": ["gcd_ab_ba_eq_a_plus_b"], "statement_sha256": "462b15ef2f492b2a370e1f12e6982de2830a61af07fd49a33347b971578af296", "task_path": "tasks/rl_align__o_proofs_gcd_ab_ba_eq_a_plus_b__462b15ef2f492b2a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_gcd_ab_ba_eq_a_plus_b", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_gcd_one_exists__07fcd6efa399ab62", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem gcd_one_exists (s : Finset ℕ) (hs : s ⊆ Finset.Icc 1 987) (hcard : s.card = 503) :\n ∃ a ∈ s, ∃ b ∈ s, a ≠ b ∧ Nat.gcd a b = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_gcd_one_exists", "source_license": null, "theorem_names": ["gcd_one_exists"], "statement_sha256": "07fcd6efa399ab62b7beb2bd1982e36838e3162d34946ca68ff86b9d3daf27c5", "task_path": "tasks/rl_align__o_proofs_gcd_one_exists__07fcd6efa399ab62", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_gcd_one_exists", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_generate_chocolate_candies__5d4942386262a8a0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem generate_chocolate_candies :\n Set.ncard {x : Fin 7 → ℕ | ∑ i, x i * 20 = 300 ∧ ∀ i, 0 < x i ∧ x i ≤ 5} = 2415 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_generate_chocolate_candies", "source_license": null, "theorem_names": ["generate_chocolate_candies"], "statement_sha256": "5d4942386262a8a0f111e983cff42a715a20b29a65be3cda4795601cd3b51ccf", "task_path": "tasks/rl_align__o_proofs_generate_chocolate_candies__5d4942386262a8a0", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_generate_chocolate_candies", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_i_6__80a4ef03ec6877ab", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem i {a : ℕ → ℝ} (ha0 : a 0 = 2) (ha1 : a 1 = 7)\n (han : ∀ n ≥ 2, a n = 7 * a (n - 1) - 10 * a (n - 2)) :\n ∀ x ∈ Set.Ioo (-1 / 5) (1 / 5), ∑' n, a n * x ^ n =\n 1 / (1 - 2 * x) + 1 / (1 - 5 * x) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_i_6", "source_license": null, "theorem_names": ["i"], "statement_sha256": "80a4ef03ec6877ab63ebbe03a77a0bae1ceb6b94a9f6eb9fe24baaba4df5a5ac", "task_path": "tasks/rl_align__o_proofs_i_6__80a4ef03ec6877ab", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_i_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_impossibility_of_equal_distribution__396b8000e8a48131", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem impossibility_of_equal_distribution (B : Matrix (Fin 10) (Fin 10) ℕ) (h₀ : ∃ i j, B i j = 1 ∧ ∀ i' j', i' ≠ i ∨ j' ≠ j → B i' j' = 0) : ¬∃ B' : Matrix (Fin 10) (Fin 10) ℕ, B' = B ∧ ∃ k : ℕ, ∀ i j, B' i j = k ∧ k > 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_impossibility_of_equal_distribution", "source_license": null, "theorem_names": ["impossibility_of_equal_distribution"], "statement_sha256": "396b8000e8a48131b106ab0561598beb0015307633fe50aa012a9dd571e2e70f", "task_path": "tasks/rl_align__o_proofs_impossibility_of_equal_distribution__396b8000e8a48131", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_impossibility_of_equal_distribution", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_incorrect_statement_2__d06afd08b8694fa4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nset_option autoImplicit true\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem incorrect_statement : ¬(2^3 * x^2 : Polynomial ℤ).degree = 5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_incorrect_statement_2", "source_license": null, "theorem_names": ["incorrect_statement"], "statement_sha256": "450c3e272cb0fe245309a9010558a3d6bb23dd2b366a229788ccbb588f1b004e", "task_path": "tasks/rl_align__o_proofs_incorrect_statement_2__d06afd08b8694fa4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_incorrect_statement_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_increasing_condition__13a2711948668952", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem increasing_condition (a : ℝ) : (∀ x ∈ Set.Ioi (1/2), deriv (fun x => x^3 + a*x + 1/x) x > 0) ↔ a ≥ 13/4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_increasing_condition", "source_license": null, "theorem_names": ["increasing_condition"], "statement_sha256": "13a2711948668952954cf3941c11539a3ea73a805cd6c70ea96c30b35c105019", "task_path": "tasks/rl_align__o_proofs_increasing_condition__13a2711948668952", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_increasing_condition", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_1040__e209424edb7293a9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities {n : ℕ} (hn : 1 ≤ n) (a : Fin n → ℝ)\n (ha : ∀ i, 1 ≤ a i) :\n ∏ i, (1 + a i) ≥ 2 ^ n / (n + 1) * (1 + ∑ i, a i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_1040", "source_license": null, "theorem_names": ["inequalities"], "statement_sha256": "e209424edb7293a9b0612a67657dfb46bdb850d0cbd2d7b842dca5899e254c80", "task_path": "tasks/rl_align__o_proofs_inequalities_1040__e209424edb7293a9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_1040", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_116532__0e68869e9d29bdb6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities_116532 (n : ℕ) (hn : 0 < n) (a : Fin n → ℝ)\n (ha : ∃ i, a i ≠ 0) (r : Fin n → ℝ)\n (h : ∀ x : Fin n → ℝ, ∑ k : Fin n, r k * (x k - a k) ≤\n (∑ k : Fin n, (x k)^2)^((1 : ℝ)/2) - (∑ k : Fin n, (a k)^2)^((1 : ℝ)/2)) :\n ∀ i : Fin n, r i = a i / √(∑ k : Fin n, (a k)^2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_116532", "source_license": null, "theorem_names": ["inequalities_116532"], "statement_sha256": "0e68869e9d29bdb6120714f117b6701aac5fb784c505e6ef140c9d825f3aae3b", "task_path": "tasks/rl_align__o_proofs_inequalities_116532__0e68869e9d29bdb6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_116532", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_129667__ce23a2f5de6c8e9d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem inequalities_129667 (a : Fin 5 → ℝ) (ha : ∀ i, 0 ≤ a i)\n (hsum : ∑ i, a i = 1) :\n ∃ p : Fin 5 → Fin 5,\n (∀ i j, p i = p j → i = j) ∧\n (∑ i, a (p i) * a (p ((i + 1) % 5)) ≤ 1 / 5) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_129667", "source_license": null, "theorem_names": ["inequalities_129667"], "statement_sha256": "ce23a2f5de6c8e9db49ccfebb37423a45386896758b99911872f196ebe5dbe5a", "task_path": "tasks/rl_align__o_proofs_inequalities_129667__ce23a2f5de6c8e9d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_129667", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_138831__e52689d6ff1b0bd9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Tactic\n\nopen Real\n\n\ntheorem inequalities_138831 (n : ℕ) (x : Fin n → ℝ)\n (h₀ : ∀ i, 0 ≤ x i ∧ x i ≤ 2) :\n (∑ i, ∑ j, |x i - x j|) ≤ n ^ 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_138831", "source_license": null, "theorem_names": ["inequalities_138831"], "statement_sha256": "e52689d6ff1b0bd9bed913f0e5d557cfbb80d6ba074272bddcb575e29f7fbb56", "task_path": "tasks/rl_align__o_proofs_inequalities_138831__e52689d6ff1b0bd9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_138831", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_1401__cc458e8b7565d907", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities (n : ℕ) (hn : 0 < n) (a b : Fin n → ℝ)\n (ha : ∀ i, 0 < a i) (hb : ∀ i, 0 < b i) :\n (∑ i, a i ^ 2) * (∑ i, b i ^ 2) ≥\n (∑ i, b i * (a i + b i)) * (∑ i, a i ^ 2 * b i / (a i + b i)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_1401", "source_license": null, "theorem_names": ["inequalities"], "statement_sha256": "cc458e8b7565d907544eff4a80b6b0f9f9aed720978fdff4d9195319fa2eb1db", "task_path": "tasks/rl_align__o_proofs_inequalities_1401__cc458e8b7565d907", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_1401", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_143170__a0bdc2a8110761a4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities_143170 (n : ℕ) (hn : 0 < n) (a : Fin n → ℝ)\n (ha : ∃ i, a i ≠ 0) (r : Fin n → ℝ)\n (h : ∀ x : Fin n → ℝ,\n ∑ k : Fin n, r k * (x k - a k) ≤\n (∑ k : Fin n, x k ^ 2) ^ ((1 : ℝ) / 2) -\n (∑ k : Fin n, a k ^ 2) ^ ((1 : ℝ) / 2)) :\n ∀ i : Fin n, r i = a i / (∑ k : Fin n, a k ^ 2) ^ ((1 : ℝ) / 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_143170", "source_license": null, "theorem_names": ["inequalities_143170"], "statement_sha256": "a0bdc2a8110761a4fa54230ac6ed9957db6bf55f8c57fcb58f08896c9b31e11d", "task_path": "tasks/rl_align__o_proofs_inequalities_143170__a0bdc2a8110761a4", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_143170", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_152982__662dc2ca09ddd07c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem inequalities_152982 :\n {a : ℝ | 0 < a ∧ ∃! x : ℤ, x ^ 3 + 3 * x ^ 2 - x - 3 > 0 ∧ x ^ 2 - 2 * a * x - 1 ≤ 0} = Set.Ico (3 / 4) (4 / 3) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_152982", "source_license": null, "theorem_names": ["inequalities_152982"], "statement_sha256": "662dc2ca09ddd07c81b56c3e9b0fa9e01e993079ff7148f34f53c0312be3fc06", "task_path": "tasks/rl_align__o_proofs_inequalities_152982__662dc2ca09ddd07c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_152982", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_1568__4a0535a18e8403da", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem inequalities {n : ℕ} (hn : 0 < n) (x : ℕ → ℝ)\n (hx : ∀ i ∈ Icc 1 n, 0 < x i) :\n ∑ i ∈ Icc 1 n, x i / x ((n - i + 1)) ≥ n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_1568", "source_license": null, "theorem_names": ["inequalities"], "statement_sha256": "4a0535a18e8403dafe68c5d5293b1de0622e5e776198f5939cb4b52a3cefd25e", "task_path": "tasks/rl_align__o_proofs_inequalities_1568__4a0535a18e8403da", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_1568", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_158307__b8c2f41e6c041faf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities_158307 (n : ℕ) (hn : 0 < n) (a : Fin n → ℝ)\n (ha : ∃ i, a i ≠ 0) (r : Fin n → ℝ)\n (h : ∀ x : Fin n → ℝ,\n ∑ i, r i * (x i - a i) ≤ sqrt (∑ i, (x i)^2) - sqrt (∑ i, (a i)^2)) :\n ∀ i, r i = a i / sqrt (∑ i, (a i)^2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_158307", "source_license": null, "theorem_names": ["inequalities_158307"], "statement_sha256": "b8c2f41e6c041faf04f87467095a1f399ab183d75cf84e2680c77391fd522f14", "task_path": "tasks/rl_align__o_proofs_inequalities_158307__b8c2f41e6c041faf", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_158307", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_160657__7676ff5ba517c6d7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem inequalities_160657 :\n Set.ncard {D : ℤ | ∀ a b : ℝ, -1 / 4 < a ∧ a < 1 / 4 → -1 / 4 < b ∧ b < 1 / 4 → |a^2 - D * b^2| < 1} = 32 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_160657", "source_license": null, "theorem_names": ["inequalities_160657"], "statement_sha256": "7676ff5ba517c6d72311a7e7f95a6d7f69b3c43df6f27a728e893eeb1f155745", "task_path": "tasks/rl_align__o_proofs_inequalities_160657__7676ff5ba517c6d7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_160657", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_167525__148742002dc8be29", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem inequalities_167525 (A B C : EuclideanSpace ℝ (Fin 2))\n (m_a m_b m_c s : ℝ)\n (h₀ : m_a = dist B (midpoint ℝ A C))\n (h₁ : m_b = dist C (midpoint ℝ A B))\n (h₂ : m_c = dist A (midpoint ℝ B C))\n (h₃ : s = (dist B C + dist A C + dist A B) / 2) :\n m_a^2 + m_b^2 + m_c^2 ≥ s^2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_167525", "source_license": null, "theorem_names": ["inequalities_167525"], "statement_sha256": "148742002dc8be29e22817ebbb451d91dda1a8d0914ca36593e4864bda3ed473", "task_path": "tasks/rl_align__o_proofs_inequalities_167525__148742002dc8be29", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_167525", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_1751__d414fbcbedc990a5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities {n : ℕ} (hn : n ≥ 2) (x : Fin n → ℝ)\n (hx : ∀ i, 0 < x i) (hxs : ∑ i, x i = 1) :\n ∑ i, 1 / sqrt (1 - x i) ≥ n * sqrt (n / (n - 1)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_1751", "source_license": null, "theorem_names": ["inequalities"], "statement_sha256": "d414fbcbedc990a518e2bb95ae62ee6405735d86edc1dde664683dc330dad9f0", "task_path": "tasks/rl_align__o_proofs_inequalities_1751__d414fbcbedc990a5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_1751", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_2019__5a04ed0565304462", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem inequalities {n : ℕ} (hn : 0 < n) (x : ℕ → ℝ)\n (hx : ∀ i ∈ Icc 1 n, 0 < x i) :\n ∑ k ∈ Icc 1 n, ((x k) / (1 + ∑ i ∈ Icc 1 k, x i ^ 2)) ^ 2 ≤\n (∑ k ∈ Icc 1 n, x k ^ 2) / (1 + ∑ k ∈ Icc 1 n, x k ^ 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_2019", "source_license": null, "theorem_names": ["inequalities"], "statement_sha256": "5a04ed05653044624245bddf1c4154d47aebfcd145faae3ee0249e9483af4f80", "task_path": "tasks/rl_align__o_proofs_inequalities_2019__5a04ed0565304462", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_2019", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_205625__2467b659ce23f150", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem inequalities_205625 (a : Fin 33 → ℕ) (h₀ : ∑ i, a i = 430) :\n ∃ s : Finset (Fin 33), s.card = 20 ∧ ∑ i ∈ s, a i ≥ 260 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_205625", "source_license": null, "theorem_names": ["inequalities_205625"], "statement_sha256": "2467b659ce23f150edbc24720a4c699ce4d42edb0ffd3b2e86c8e299c0525649", "task_path": "tasks/rl_align__o_proofs_inequalities_205625__2467b659ce23f150", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_205625", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_2057__3e530ae44ad19b71", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities {n : ℕ} (hn : 3 ≤ n) (a : Fin n → ℝ)\n (ha : ∀ i j, i < j → a i ≥ a j) (ha' : ∀ i, 1 ≤ a i) :\n (∑ i, a i) * (∑ i, 1 / a i) ≤ n ^ 2 + ∑ i, ∑ j, if i < j then (a i - a j) else 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_2057", "source_license": null, "theorem_names": ["inequalities"], "statement_sha256": "3e530ae44ad19b71fdd7c8cc950cb74a0cd388619514f88082d7becc5d528867", "task_path": "tasks/rl_align__o_proofs_inequalities_2057__3e530ae44ad19b71", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_2057", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_211484__820b06e2dbaa16d7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem inequalities_211484 {n : ℕ} (hn : 2 ≤ n) :\n (∀ x : ℕ → ℝ, ∑ i ∈ Icc 1 n, (x i)^2 ≥ x n * ∑ i ∈ Icc 1 (n - 1), x i) ↔\n n = 2 ∨ n = 3 ∨ n = 4 ∨ n = 5 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_211484", "source_license": null, "theorem_names": ["inequalities_211484"], "statement_sha256": "820b06e2dbaa16d7b06bd633676429a2d4815d45f06894ce7595e3ecec3619c6", "task_path": "tasks/rl_align__o_proofs_inequalities_211484__820b06e2dbaa16d7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_211484", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_217275__92bf5559e3c1bf58", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem inequalities_217275 (A B C : EuclideanSpace ℝ (Fin 2))\n (a b c : ℝ) (ha : a = dist B C) (hb : b = dist A C) (hc : c = dist A B) :\n a^2 * b * (a - b) + b^2 * c * (b - c) + c^2 * a * (c - a) ≥ 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_217275", "source_license": null, "theorem_names": ["inequalities_217275"], "statement_sha256": "92bf5559e3c1bf586304a55639c52e5a843403d56f5db5a121bc264b2b76eaea", "task_path": "tasks/rl_align__o_proofs_inequalities_217275__92bf5559e3c1bf58", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_217275", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_220419__9e30d88d50a08e00", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem inequalities_220419 {n : ℕ} (hn : 0 < n) (x : Fin n → ℝ)\n (hx : ∀ i, x i ∈ Ioo 0 1) :\n IsGreatest {a | ∃ x : Fin n → ℝ, (∀ i, x i ∈ Ioo 0 1) ∧\n a = (∑ i, sqrt (1 - x i)) / sqrt (∑ i, 1 / x i)} (sqrt n / 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_220419", "source_license": null, "theorem_names": ["inequalities_220419"], "statement_sha256": "9e30d88d50a08e00251a7210a238eb19f297b01af426811787bdb5a5955415dc", "task_path": "tasks/rl_align__o_proofs_inequalities_220419__9e30d88d50a08e00", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_220419", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_222990__f5302e52717c30fb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem inequalities_222990 (n : ℕ) (hn : 0 < n) :\n ∃ σ : ℕ → ℕ,\n (∀ k ∈ Icc 1 n, σ k ∈ Icc 1 n) ∧\n (∀ k ∈ Icc 1 n, ∀ m ∈ Icc 1 n, k ≠ m → σ k ≠ σ m) ∧\n (∑ k ∈ Icc 1 n, (k / (k + σ k)^2 : ℝ) < 1 / 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_222990", "source_license": null, "theorem_names": ["inequalities_222990"], "statement_sha256": "f5302e52717c30fb9add0f7acff19ed338f49cce7d2708c01bfb4b1e4d3f0790", "task_path": "tasks/rl_align__o_proofs_inequalities_222990__f5302e52717c30fb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_222990", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_224975__788d677ac12d7d4b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities_224975 {n : ℕ} (hn : 0 < n) (x : Fin n → ℝ)\n (hx : ∀ i j, i < j → x i ≥ x j) (hx' : ∀ i, 0 ≤ x i)\n (h : ∑ i, x i / sqrt (i + 1) = 1) :\n ∑ i, (x i)^2 ≤ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_224975", "source_license": null, "theorem_names": ["inequalities_224975"], "statement_sha256": "788d677ac12d7d4b1151678c22cd06e0d8ba55fa037f3a0f2a47e4417e7126ae", "task_path": "tasks/rl_align__o_proofs_inequalities_224975__788d677ac12d7d4b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_224975", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_241995__a1b76f03d6921743", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem inequalities_241995 (a : ℕ → ℝ)\n (h₀ : ∀ n, a n = ∑ i ∈ Icc 1 n, (1 : ℝ)/i) :\n ∀ n ≥ 2, (a n)^2 > 2 * ∑ i ∈ Icc 2 n, a i / i := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_241995", "source_license": null, "theorem_names": ["inequalities_241995"], "statement_sha256": "a1b76f03d6921743d58ac340c2c5c7b86ab0698162063b5ee006a8e3c18094b9", "task_path": "tasks/rl_align__o_proofs_inequalities_241995__a1b76f03d6921743", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_241995", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_2441__8df68453e6a95a31", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem inequalities (s : Set ℤ) (hs : s = {x : ℤ | 0 ≤ 6 * x - 13 ∧ 0 ≤ 3 * x ^ 2 - 13 * x + 13 ∧ √(6 * x - 13) - √(3 * x ^ 2 - 13 * x + 13) ≥ 3 * x ^ 2 - 19 * x + 26}) :\n ∑ᶠ x ∈ s, x = 7 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_2441", "source_license": null, "theorem_names": ["inequalities"], "statement_sha256": "8df68453e6a95a310391cc3256973cbda6eabc0e4ec6427f883e1aad30ebbcc1", "task_path": "tasks/rl_align__o_proofs_inequalities_2441__8df68453e6a95a31", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_2441", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_253696__54c92117fb799adb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem inequalities_253696 {p n : ℕ} (hp : 0 < p) (hn : 0 < n)\n (C : ℕ → ℕ → ℝ) (hC : ∀ h ∈ Icc 1 n, ∀ k ∈ Icc 1 (p * h), C h k ∈ Set.Icc 0 1) :\n ∑ h ∈ Icc 1 n, ∑ k ∈ Icc 1 (p * h), ((C h k) / h) ^ 2 ≤\n 2 * p * ∑ h ∈ Icc 1 n, ∑ k ∈ Icc 1 (p * h), C h k := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_253696", "source_license": null, "theorem_names": ["inequalities_253696"], "statement_sha256": "54c92117fb799adbacb5a6c6be6070897818c7dd17a745948727002a1f6c79ac", "task_path": "tasks/rl_align__o_proofs_inequalities_253696__54c92117fb799adb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_253696", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_257102__8995e769cdad57b3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities_257102 {n : ℕ} (hn : n ≥ 2) (x : Fin n → ℝ)\n (hsum : ∑ i : Fin n, abs (x i) = 1) (hzero : ∑ i : Fin n, x i = 0) :\n abs (∑ i : Fin n, x i / (i.1 + 1)) ≤ 1 / 2 - 1 / (2 ^ n) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_257102", "source_license": null, "theorem_names": ["inequalities_257102"], "statement_sha256": "8995e769cdad57b38cc8a90e0d3e7a93c0ac7dbef58576765988e7a2b85ea658", "task_path": "tasks/rl_align__o_proofs_inequalities_257102__8995e769cdad57b3", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_257102", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_277181__a1e17fce15c2fe8e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities_277181 {n : ℕ} (hn : 0 < n) (a : Fin n → ℝ)\n (p : Fin n → ℕ) (ha : ∀ i, 0 < a i) (hp : ∀ i, 0 < p i) :\n ∏ i, (a i) ^ (p i) ≤ ((∑ i, p i * a i) / (∑ i, p i)) ^ (∑ i, p i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_277181", "source_license": null, "theorem_names": ["inequalities_277181"], "statement_sha256": "a1e17fce15c2fe8e63e0d94a696e5a393b42c0f0ca64dc1f972ff2c5598cdc16", "task_path": "tasks/rl_align__o_proofs_inequalities_277181__a1e17fce15c2fe8e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_277181", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_296830__987748f11b2a5442", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities_296830 {n : ℕ} (hn : 0 < n) (x : Fin n → ℝ)\n (hx : ∀ i, 0 < x i) (hxs : ∑ i, x i = 1) (m : ℝ) (hm : 1 < m) :\n ∑ i, ((x i + 1 / x i) ^ m) ≥ ((n ^ 2 + 1) ^ m) / n ^ (m - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_296830", "source_license": null, "theorem_names": ["inequalities_296830"], "statement_sha256": "987748f11b2a5442dd4e384b30843346d363ec39a19e5e174828fb5977cf11c1", "task_path": "tasks/rl_align__o_proofs_inequalities_296830__987748f11b2a5442", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_296830", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_297856__00128bb7c6652f80", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities_297856 {n : ℕ} (hn : 0 < n) (a : Fin n → ℝ)\n (ha : ∑ i : Fin n, a i = 1) (ha' : ∀ i : Fin n, 0 < a i) :\n IsLeast {x | ∃ a : Fin n → ℝ, ∑ i : Fin n, a i = 1 ∧ (∀ i : Fin n, 0 < a i) ∧ x = ∑ i : Fin n, a i / (1 + ∑ j : Fin n, if j ≠ i then a j else 0)} (n / (2 * n - 1)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_297856", "source_license": null, "theorem_names": ["inequalities_297856"], "statement_sha256": "00128bb7c6652f80cfcd1443732ebf7d642d6f0a9441b798de51ac7912c57f4e", "task_path": "tasks/rl_align__o_proofs_inequalities_297856__00128bb7c6652f80", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_297856", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_300196__e34ed1019fab9390", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities_300196 :\n Set.ncard {n : ℕ | 0 < n ∧ |sqrt ((n : ℝ) / (n + 2009)) - 1| > 1 / 1005} = 1008015 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_300196", "source_license": null, "theorem_names": ["inequalities_300196"], "statement_sha256": "e34ed1019fab939021b50f770e046191beee0e2bd4dc8ee5d8a2998b1f6a4175", "task_path": "tasks/rl_align__o_proofs_inequalities_300196__e34ed1019fab9390", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_300196", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_309161__e238740c2a7cdb27", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem inequalities_309161 {n : ℕ} (hn : 0 < n) (a b : ℝ)\n (ha : a > 0) (hb : b > 0) (α : Fin n → ℝ)\n (y : ℝ) (hy : y = a * abs (∏ i : Fin n, cos (α i)) +\n b * abs (∏ i : Fin n, sin (α i))) :\n (n = 1 → min a b ≤ y ∧ y ≤ sqrt (a^2 + b^2)) ∧\n (n ≥ 2 → 0 ≤ y ∧ y ≤ max a b) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_309161", "source_license": null, "theorem_names": ["inequalities_309161"], "statement_sha256": "e238740c2a7cdb270642852c9b7800cc62bba08d10bae2494973a81a5fdae5a6", "task_path": "tasks/rl_align__o_proofs_inequalities_309161__e238740c2a7cdb27", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_309161", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_320228__180eaf52c6c28d8c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities_320228 :\n Set.ncard {x : ℤ | 1 / (sqrt 3 - sqrt 2) < x ∧ x < 2 / (sqrt 6 - sqrt 5)} = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_320228", "source_license": null, "theorem_names": ["inequalities_320228"], "statement_sha256": "180eaf52c6c28d8cae67774a034deadf17615daf8fdad531c1e6e4a4eb8eda62", "task_path": "tasks/rl_align__o_proofs_inequalities_320228__180eaf52c6c28d8c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_320228", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_32748__8c69d207e95944b3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem inequalities_32748 (A B C : EuclideanSpace ℝ (Fin 2))\n (l_a l_b l_c l : ℝ)\n (h_l_a : l_a = (dist (A) (B) * dist (A) (C)) / (dist (A) (B) + dist (A) (C)))\n (h_l_b : l_b = (dist (B) (A) * dist (B) (C)) / (dist (B) (A) + dist (B) (C)))\n (h_l_c : l_c = (dist (C) (A) * dist (C) (B)) / (dist (C) (A) + dist (C) (B)))\n (h_l : l = dist (A) (B) + dist (B) (C) + dist (C) (A)) :\n l_a * l_b * l_c / l^3 ≤ 1 / 64 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_32748", "source_license": null, "theorem_names": ["inequalities_32748"], "statement_sha256": "8c69d207e95944b3197d9907595c298e480c8dec5d7b3625c282631f7d6031db", "task_path": "tasks/rl_align__o_proofs_inequalities_32748__8c69d207e95944b3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_32748", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_407368__22b0efe2a9cfe441", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\nopen scoped EuclideanGeometry\n\ntheorem inequalities_407368 (A B C : EuclideanSpace ℝ (Fin 2))\n (a b c: ℝ) (ha: dist B C = a) (hb: dist A C = b) (hc: dist A B = c): a > 0 ∧ b > 0 ∧ c > 0 ∧\n a < b + c ∧ b < a + c ∧ c < a + b →\n 1 ≤ a / (3 * a - b + c) + b / (3 * b - c + a) + c / (3 * c - a + b) ∧\n 1 ≤ c / (3 * a - b + c) + a / (3 * b - c + a) + b / (3 * c - a + b) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_407368", "source_license": null, "theorem_names": ["inequalities_407368"], "statement_sha256": "22b0efe2a9cfe441b90fa692d8ec8200d24cb649134615939ac70eb95b5baddf", "task_path": "tasks/rl_align__o_proofs_inequalities_407368__22b0efe2a9cfe441", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_407368", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_467__207968292d00116c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem inequalities (n : ℕ) (hn : 3 ≤ n) :\n (∀ a : ℕ → ℝ, (∑ i ∈ Icc 1 n, a i = 0) → ∑ i ∈ Icc 1 (n - 1), a i * a (i + 1) ≤ 0) ↔\n n = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_467", "source_license": null, "theorem_names": ["inequalities"], "statement_sha256": "207968292d00116c3302895861b2d5ad4337f87691625c95968cc8d12e835b5c", "task_path": "tasks/rl_align__o_proofs_inequalities_467__207968292d00116c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_467", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_598037__9f34cfbdf901e57c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities_598037 {n : ℕ} (hn : 0 < n) (a : Fin n → ℝ)\n (ha : ∀ i, 0 < a i) :\n (∏ i, ∏ j, (1 + a i / a j)) ^ ((1 : ℝ) / n) ≥ 2 ^ n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_598037", "source_license": null, "theorem_names": ["inequalities_598037"], "statement_sha256": "9f34cfbdf901e57ce88277a5be195e08535d8fc50f44efc73b83df8ce32cf86d", "task_path": "tasks/rl_align__o_proofs_inequalities_598037__9f34cfbdf901e57c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_598037", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_601547__e1d845040595d072", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem inequalities_601547 {n : ℕ} (hn : 0 < n) (α : Fin n → ℝ)\n (hα : ∀ i, α i ∈ Ioo 0 (π / 2)) (s : ℝ) (hs : s = ∑ i, cos (α i) ^ 2) :\n ∑ i, cot (α i) ^ 2 ≥ n * s / (n - s) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_601547", "source_license": null, "theorem_names": ["inequalities_601547"], "statement_sha256": "e1d845040595d072dad1a20c8b1dc45ecac6b59b1ef39f2c24c9653d4de54407", "task_path": "tasks/rl_align__o_proofs_inequalities_601547__e1d845040595d072", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_601547", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_602346__186cf2028df20ccf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities_602346 (n : ℕ) (hn : 3 ≤ n) (x : Fin n → ℝ)\n (hx : ∀ i, x i ∈ Set.Icc (-1) 1) (h : ∑ k, (x k)^5 = 0) :\n ∑ k, x k ≤ 8/15 * n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_602346", "source_license": null, "theorem_names": ["inequalities_602346"], "statement_sha256": "186cf2028df20ccf3284b158044e9169790464265a992b7294fc7423eee7bda3", "task_path": "tasks/rl_align__o_proofs_inequalities_602346__186cf2028df20ccf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_602346", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_602447__edfd17719a59abba", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem inequalities_602447 {n : ℕ} (hn : n > 1) (a : Fin n → ℝ)\n (ha : ∀ i, 0 < a i) :\n ∑ i, sqrt (a i ^ 2 + 1) < n - 1 + sqrt ((∑ i, a i) ^ 2 + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_602447", "source_license": null, "theorem_names": ["inequalities_602447"], "statement_sha256": "edfd17719a59abba1469bd81d00997709c639d3dad090240909d428c7b97070f", "task_path": "tasks/rl_align__o_proofs_inequalities_602447__edfd17719a59abba", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_602447", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_603932__5b5f6f21eef11f03", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem inequalities_603932 {n : ℕ} (hn : 0 < n) (a : ℕ → ℝ)\n (ha : ∀ i ∈ Icc 1 n, 0 < a i) (h : ∀ k ∈ Icc 1 n, ∏ i ∈ Icc 1 k, a i ≥ 1) :\n ∑ i ∈ Icc 1 n, (i : ℝ) / ∏ j ∈ Icc 1 i, (1 + a j) < 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_603932", "source_license": null, "theorem_names": ["inequalities_603932"], "statement_sha256": "5b5f6f21eef11f033a986f06807845bec11206cb8454313bec65e228683a52d8", "task_path": "tasks/rl_align__o_proofs_inequalities_603932__5b5f6f21eef11f03", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_603932", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_6043__20a82623f8650439", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nopen Real\n\n\ntheorem inequalities_6043 :\n Set.ncard {x : ℤ | -3 ≤ (3 * (x - 5) - 7) / 5 ∧ (3 * (x - 5) - 7) / 5 < 2} = 8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_6043", "source_license": null, "theorem_names": ["inequalities_6043"], "statement_sha256": "20a82623f8650439298818e1cf8ffffbd7bc989c0d0185af500903b6a86c415e", "task_path": "tasks/rl_align__o_proofs_inequalities_6043__20a82623f8650439", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_6043", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_6200__a1f1169ea96a06f3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem inequalities_6200 (x : Fin 4 → ℝ) (hx : ∀ i, 0 < x i)\n (h1 : x 0 ^ 3 + x 2 ^ 3 + 3 * x 0 * x 2 = 1) (h2 : x 1 + x 3 = 1)\n (n : ℕ) (hn : 2 ≤ n) :\n ∑ i, ((x i + 1 / x i) ^ n) ≥ 5 ^ n / 2 ^ (n - 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_6200", "source_license": null, "theorem_names": ["inequalities_6200"], "statement_sha256": "a1f1169ea96a06f3699265ced4848fd4630ab35e166215464fd58fdf31b6bbb6", "task_path": "tasks/rl_align__o_proofs_inequalities_6200__a1f1169ea96a06f3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_6200", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_66904__50b7e9605663e2a5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem inequalities_66904 {n : ℕ} (hn : 0 < n) (a : Fin n → ℝ)\n (ha : ¬ (∀ i, a i = 0)) (r : Fin n → ℝ)\n (h : ∀ x : Fin n → ℝ,\n ∑ i : Fin n, r i * (x i - a i) ≤\n Real.sqrt (∑ i : Fin n, (x i)^2) - Real.sqrt (∑ i : Fin n, (a i)^2)) :\n ∀ i : Fin n, r i = a i / Real.sqrt (∑ i : Fin n, (a i)^2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_66904", "source_license": null, "theorem_names": ["inequalities_66904"], "statement_sha256": "50b7e9605663e2a5153b9c8ced52c8a8629d815d76bf38f7b7f664b80065ad70", "task_path": "tasks/rl_align__o_proofs_inequalities_66904__50b7e9605663e2a5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_inequalities_66904", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inequalities_690__15b8d2fdc05f6c49", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem inequalities (n : ℕ) (x y : EuclideanSpace ℝ (Fin n))\n (c : ℝ) (hc : c > 1) :\n dist x y ^ 2 ≥ (norm x ^ 2 / c) - (norm y ^ 2 / (c - 1)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_690", "source_license": null, "theorem_names": ["inequalities"], "statement_sha256": "15b8d2fdc05f6c4979244f9d4345a639cddd3c1a4d1944c29fcd7a002a21a911", "task_path": "tasks/rl_align__o_proofs_inequalities_690__15b8d2fdc05f6c49", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inequalities_690", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_innerProductSpace_Pi_fact__522a42e6c3f200c1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Complex Filter Function Metric Finset\nopen scoped BigOperators Topology\n\ntheorem innerProductSpace.Pi.fact (k : ℕ) :\n ∫ x in (0)..Real.pi, (Real.cos (2 ^ k * x))^2 = Real.pi / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_innerProductSpace_Pi_fact", "source_license": null, "theorem_names": ["innerProductSpace.Pi.fact"], "statement_sha256": "522a42e6c3f200c1ff8de13a7155ce82bed5a84bef939f05408e44f5a07f1d10", "task_path": "tasks/rl_align__o_proofs_innerProductSpace_Pi_fact__522a42e6c3f200c1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_innerProductSpace_Pi_fact", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_abs_x_minus_1__df1e2b71392b2afd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_abs_x_minus_1 : ∫ x in (0:ℝ)..2, |x - 1| = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_abs_x_minus_1", "source_license": null, "theorem_names": ["integral_abs_x_minus_1"], "statement_sha256": "df1e2b71392b2afd6e99f1e044ba64283f21cafcc701a76ea1a98e4abce70d71", "task_path": "tasks/rl_align__o_proofs_integral_abs_x_minus_1__df1e2b71392b2afd", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_abs_x_minus_1", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_abs_x_minus_2__4b7707c0688eacc3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_abs_x_minus_2 : ∫ x in (0:ℝ)..4, |x - 2| = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_abs_x_minus_2", "source_license": null, "theorem_names": ["integral_abs_x_minus_2"], "statement_sha256": "4b7707c0688eacc3adfaaa9bcc68ab18995bb6d5ebeebc2dcfa60fc386a0b133", "task_path": "tasks/rl_align__o_proofs_integral_abs_x_minus_2__4b7707c0688eacc3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_abs_x_minus_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_eq_zero_value_of_m__0c2f1a915d0e668d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_eq_zero_value_of_m :\n ∃ m : ℝ, ∫ x in (0)..(1), (x^2 + m*x) = 0 ∧ m = -2/3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_eq_zero_value_of_m", "source_license": null, "theorem_names": ["integral_eq_zero_value_of_m"], "statement_sha256": "0c2f1a915d0e668d1c8170748cf40ce7ef1b9acf9434e89595c646c5e66bc6b9", "task_path": "tasks/rl_align__o_proofs_integral_eq_zero_value_of_m__0c2f1a915d0e668d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_eq_zero_value_of_m", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_equation_3__1432f99a6042d5dc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat MeasureTheory\n\ntheorem integral_equation (f : ℝ → ℝ) (h₀ : ContinuousOn f (Set.Icc 0 1)) (h₁ : ∀ x ∈ Set.Icc 0 1, f x ∈ Set.Icc 0 1) (h₂ : ∫ x in (0:ℝ)..1, f x * (x - f x) ∂volume = 1/12) : ∃ x ∈ Set.Icc 0 1, x = f x := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_equation_3", "source_license": null, "theorem_names": ["integral_equation"], "statement_sha256": "c3c870f3617a524dfa996bbe0882f12505fe15def47e36bd6138ec09c54f35de", "task_path": "tasks/rl_align__o_proofs_integral_equation_3__1432f99a6042d5dc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_equation_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_eval__6533f371a8195a8f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_eval : ∫ x in (0:ℝ)..1, Real.sqrt (1 - x ^ 2) + x + x ^ 3 = (Real.pi + 3) / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_eval", "source_license": null, "theorem_names": ["integral_eval"], "statement_sha256": "6533f371a8195a8f009ce211be8e2e0e228888d28c6dc761493c2c1296de72f3", "task_path": "tasks/rl_align__o_proofs_integral_eval__6533f371a8195a8f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_eval", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_example_14__7543a9441342c0d6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_example : ∫ x in (0:ℝ)..1, Real.sqrt (1 - x ^ 2) + 3 * x = Real.pi / 4 + 3 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_example_14", "source_license": null, "theorem_names": ["integral_example"], "statement_sha256": "7543a9441342c0d6c593cbd0cf0bbfdfde78e985b056105debbadf31136068af", "task_path": "tasks/rl_align__o_proofs_integral_example_14__7543a9441342c0d6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_example_14", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_example_96__04e53076af763e5b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_example : ∫ x in (1:ℝ)..2, (3 * x + 1) / x = 3 + Real.log 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_example_96", "source_license": null, "theorem_names": ["integral_example"], "statement_sha256": "04e53076af763e5bb6687ee4a91361177f2e4f0e7da9fc2af7caf28ce52e504e", "task_path": "tasks/rl_align__o_proofs_integral_example_96__04e53076af763e5b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_example_96", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_max__630d8a3e4839eab6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_max (a b : ℝ) (h : b > a) : ∃ M : ℝ, ∃ a0 b0 : ℝ, b0 > a0 ∧ M = ∫ x in a0..b0, (7 * x - x^2 - 10) ∧ ∀ a1 b1 : ℝ, b1 > a1 → ∫ x in a1..b1, (7 * x - x^2 - 10) ≤ M := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_max", "source_license": null, "theorem_names": ["integral_max"], "statement_sha256": "630d8a3e4839eab65dc94260ab41a632246b7357d1c5e18d9eea497c46a07d0d", "task_path": "tasks/rl_align__o_proofs_integral_max__630d8a3e4839eab6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_max", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_of_f_2__05119a7653a6c3f7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_of_f : ∫ x in (0 : ℝ)..1, (x^2 - x + 2) = 11 / 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_of_f_2", "source_license": null, "theorem_names": ["integral_of_f"], "statement_sha256": "05119a7653a6c3f7eeac441e8a512a0401a5851fc0ecbdb063b7ec6ee853f67f", "task_path": "tasks/rl_align__o_proofs_integral_of_f_2__05119a7653a6c3f7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_of_f_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_sin_cos_abs__ea550d71fec1ebb0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_sin_cos_abs : ∫ x in (0 : ℝ)..Real.pi, abs (sin x + cos x) = 2 * Real.sqrt 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_integral_sin_cos_abs", "source_license": null, "theorem_names": ["integral_sin_cos_abs"], "statement_sha256": "ea550d71fec1ebb0b94ba3e8410d6652b3c10c8a064059dad58369b2bbea3916", "task_path": "tasks/rl_align__o_proofs_integral_sin_cos_abs__ea550d71fec1ebb0", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_integral_sin_cos_abs", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_sin_power_eight__df061b84258001df", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_sin_power_eight : ∫ x in (0:ℝ)..Real.pi, 16 * (Real.sin (x / 2)) ^ 8 = 35 * Real.pi / 8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_sin_power_eight", "source_license": null, "theorem_names": ["integral_sin_power_eight"], "statement_sha256": "df061b84258001dfcba7de7149fb66b63deb2531593339769d770052a85dec42", "task_path": "tasks/rl_align__o_proofs_integral_sin_power_eight__df061b84258001df", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_sin_power_eight", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_sqrt_4_minus_x_sq_4__887897f1ff4b2c6e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_sqrt_4_minus_x_sq : ∫ x in (0:ℝ)..2, Real.sqrt (4 - x^2) = Real.pi := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_sqrt_4_minus_x_sq_4", "source_license": null, "theorem_names": ["integral_sqrt_4_minus_x_sq"], "statement_sha256": "887897f1ff4b2c6edede508dcfa466aeab3477f43d6fb446ccbce5f197570c5b", "task_path": "tasks/rl_align__o_proofs_integral_sqrt_4_minus_x_sq_4__887897f1ff4b2c6e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_sqrt_4_minus_x_sq_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_sqrt_9_minus_x_sq_9__073714824d85238d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_sqrt_9_minus_x_sq : ∫ x in (0:ℝ)..3, Real.sqrt (9 - x ^ 2) = (9 * Real.pi / 4) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_sqrt_9_minus_x_sq_9", "source_license": null, "theorem_names": ["integral_sqrt_9_minus_x_sq"], "statement_sha256": "073714824d85238d4078fb6f1c431ba2b8764bb66a2867656c39372df4d367f5", "task_path": "tasks/rl_align__o_proofs_integral_sqrt_9_minus_x_sq_9__073714824d85238d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_sqrt_9_minus_x_sq_9", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_value_119__a52f024a28ebd67c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_value (a : ℝ) (h₀ : deriv (fun x => Real.exp 1 * x ^ 2 + a * Real.exp x) 1 = Real.exp 1) :\n ∫ x in (0:ℝ)..1, Real.exp 1 * x ^ 2 + a * Real.exp x = 1 - 2/3 * Real.exp 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_integral_value_119", "source_license": null, "theorem_names": ["integral_value"], "statement_sha256": "a52f024a28ebd67c543b8c1906baba96f113a43130da856a9da088c038276173", "task_path": "tasks/rl_align__o_proofs_integral_value_119__a52f024a28ebd67c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_integral_value_119", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_value_42__cba8c1e04a29f691", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_value : ∫ x in (-2)..2, Real.sqrt (4 - x ^ 2) + x ^ 2 = 2 * Real.pi + 16 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_value_42", "source_license": null, "theorem_names": ["integral_value"], "statement_sha256": "cba8c1e04a29f6911735c0b4599a4e52539a239ad3c54b7ff4262ccb954421d2", "task_path": "tasks/rl_align__o_proofs_integral_value_42__cba8c1e04a29f691", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_value_42", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_integral_value_6__f3059d8bcd818797", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem integral_value : ∫ x in (0:ℝ)..1, (Real.sqrt (1 - x ^ 2) - x) = (Real.pi - 2) / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_value_6", "source_license": null, "theorem_names": ["integral_value"], "statement_sha256": "f3059d8bcd8187974083f14d700dc265345d9621c7bf4707a87187d1cc5aebe6", "task_path": "tasks/rl_align__o_proofs_integral_value_6__f3059d8bcd818797", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_integral_value_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_inverse_function_properties_3__8cafe83e762ec968", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem inverse_function_properties (f : ℝ → ℝ) (h_def : ∀ x ≠ 0, f x = 1/x)\n (h_point : f (1/2) = 2) :\n (∀ x ≠ 0, f (-x) = -f x) ∧\n (∀ x ∈ Set.Icc 1 2, f x ∈ Set.Icc (1/2) 1) ∧\n (∀ x > 0, f x ≥ 2 - x) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inverse_function_properties_3", "source_license": null, "theorem_names": ["inverse_function_properties"], "statement_sha256": "8cafe83e762ec96835cadda8740860d022da622383c3ecbb05804499cfbf51e7", "task_path": "tasks/rl_align__o_proofs_inverse_function_properties_3__8cafe83e762ec968", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_inverse_function_properties_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_isLeast_65__d1e77fa2568c8033", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem isLeast {A : ℕ → ℤ}\n (hA : ∀ n, A n = ∑ i ∈ range n, (10 ^ (i + 1) - 1) / 9) :\n IsLeast {n | 0 < n ∧ 45 ∣ A n} 35 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_isLeast_65", "source_license": null, "theorem_names": ["isLeast"], "statement_sha256": "d1e77fa2568c80337d057fb4febcf750db235e49b5c12815c2fe6c37191d1889", "task_path": "tasks/rl_align__o_proofs_isLeast_65__d1e77fa2568c8033", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_isLeast_65", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_jacobian_2__7f395207a95aeed1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem jacobian (f : ℝ → ℝ → ℝ)\n (h₀ : ∀ x y, f x y = (x + sin y) * cos (π * x ^ 2 + y))\n (x y u v : ℝ)\n (hx : x = 2)\n (hy : y = 0)\n (hu : u = f x y)\n (hv : v = x * y) :\n Matrix.det (fun i j : Fin 2 => if i = 0 ∧ j = 0 then deriv (λ x => f x y) x else if i = 0 ∧ j = 1 then deriv (λ y => f x y) y else if i = 1 ∧ j = 0 then deriv (λ x => x * y) x else deriv (λ y => x * y) y) = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_jacobian_2", "source_license": null, "theorem_names": ["jacobian"], "statement_sha256": "7f395207a95aeed10cbcfe2e77c7d10f2dbd63d4bf70a271dfb5d263b3ea945a", "task_path": "tasks/rl_align__o_proofs_jacobian_2__7f395207a95aeed1", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_jacobian_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_largest_divisor_not_dividing_factorials__0e23114c56db5a6a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem largest_divisor_not_dividing_factorials (m : ℕ) (h₁ : m ≥ 3) (n : ℕ) (h₂ : n > m * (m - 2)) :\n ∃ d : ℕ, d ∣ Nat.factorial n ∧ ∀ k ∈ Set.Icc m n, ¬k ∣ d ∧ ∀ d' : ℕ, d' ∣ Nat.factorial n → (∀ k ∈ Set.Icc m n, ¬k ∣ d') → d' ≤ d := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_largest_divisor_not_dividing_factorials", "source_license": null, "theorem_names": ["largest_divisor_not_dividing_factorials"], "statement_sha256": "0e23114c56db5a6aad8762f30c4e0e0aec2317d22f86508e74fcc61e5ea41bbf", "task_path": "tasks/rl_align__o_proofs_largest_divisor_not_dividing_factorials__0e23114c56db5a6a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_largest_divisor_not_dividing_factorials", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_10720__5e04f5c1d83af283", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∫ x in Set.Icc 0 (2 * Real.pi), (2 * Real.cos (6 * x)) ^ 2 / 2 = 2 * Real.pi := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_10720", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "5e04f5c1d83af283776f0bceee28b7ae6bac8e18b1b70f5ea0025e7686279640", "task_path": "tasks/rl_align__o_proofs_lean_workbook_10720__5e04f5c1d83af283", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_10720", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_10908__7b5e91b0d701a064", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (n : ℤ) : (Complex.I : ℂ)^n ∈ ({1, -1, Complex.I, -Complex.I} : Set ℂ) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_10908", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "7b5e91b0d701a0646009ef4c0c5be29ac5288fb51612fa8e076c865120fb1af5", "task_path": "tasks/rl_align__o_proofs_lean_workbook_10908__7b5e91b0d701a064", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_10908", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_11450__86dc166ff1831b3e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (n : ℕ) (x : Fin n → ℝ) (h : ∀ i, x i ∈ Set.Icc 0 2) :\n ∑ i : Fin n, ∑ j : Fin n, abs (x i - x j) ≤ n^2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_11450", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "86dc166ff1831b3e3eb01c3034db97b61f6948dc2e0f98eda3fd480158361f09", "task_path": "tasks/rl_align__o_proofs_lean_workbook_11450__86dc166ff1831b3e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_11450", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_1195__d096cbb4da379f2c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (n : ℕ) (θ : Fin n → ℝ) (hθ : ∀ i, 0 < θ i ∧ θ i < Real.pi / 2) : (∑ i, Real.tan (θ i)) * (∑ i, Real.cot (θ i)) ≥ (∑ i, Real.sin (θ i)) ^ 2 + (∑ i, Real.cos (θ i)) ^ 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_1195", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "d096cbb4da379f2c030303c5afb490714643a5361a2b89316f65b6c32b93c651", "task_path": "tasks/rl_align__o_proofs_lean_workbook_1195__d096cbb4da379f2c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_1195", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_12399_2__37e876eb1761ff7c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_12399 (tasty : Finset ℕ)\n (h₀ : 0 < tasty.card)\n (h₁ : ∀ x ∈ tasty, x < 28)\n : ∃ questions : Finset (Finset ℕ),\n questions.card = 21 ∧\n ∀ x ∈ questions,\n (x.card = 3 ∧ x ⊆ Finset.Ico 0 28) ∧\n (x ⊆ tasty ∨ x ⊆ Finset.Ico 0 28 \\ tasty) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_12399_2", "source_license": null, "theorem_names": ["lean_workbook_12399"], "statement_sha256": "37e876eb1761ff7c560fdd9052f26cecd3b60c1323881e1cb37cbc1d76d3ea5e", "task_path": "tasks/rl_align__o_proofs_lean_workbook_12399_2__37e876eb1761ff7c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_12399_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_139944__e378a36c12d66f4e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : Filter.Tendsto (fun n : ℕ => (1 / n : ℝ) * (Finset.sum (Finset.range n) (fun k => ((k : ℝ) / n) ^ 2))) Filter.atTop (𝓝 (1 / 3 : ℝ)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_139944", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "e378a36c12d66f4e026795f72cc0c3330b859e3d78235a761ff09cdc509d542e", "task_path": "tasks/rl_align__o_proofs_lean_workbook_139944__e378a36c12d66f4e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_139944", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_1447__99d55886e1c92705", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (f : ℝ → ℝ) (hf : DifferentiableOn ℝ f (Set.univ))\n (h : ∀ x, 0 ≤ deriv f x ∧ deriv f x ≤ f x) (c : ℝ) (hc : f c = 0) : ∀ x, f x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_1447", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "99d55886e1c92705c3874de6a306ea0b727942cf357dfd3bc090c6f02f9015b8", "task_path": "tasks/rl_align__o_proofs_lean_workbook_1447__99d55886e1c92705", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_1447", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_15661__4d96c11d1a928f76", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∀ n : ℕ, (∃ a ∈ Set.Icc n (n+4), ∀ b ∈ Set.Icc n (n+4), b ≠ a → Nat.gcd a b = 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_15661", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "4d96c11d1a928f763ff3cb5a0a1f75f8b0289601d9270404bb18851653619bb0", "task_path": "tasks/rl_align__o_proofs_lean_workbook_15661__4d96c11d1a928f76", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_15661", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_15968__6f154a3e68b5cb08", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∃ (f : Matrix (Fin 3) (Fin 3) ℕ), (∀ i j, f i j = 1 ∨ (∃ n, f i j = fib n)) ∧ (∀ i j k, i ≠ j → f i k ≠ f j k) ∧ (∀ i j k, i ≠ j → f k i ≠ f k j) ∧ (∀ i j, i ≠ j → f i j ≠ f j i) ∧ (∀ i, ∑ j, f i j = ∑ j, f j i) ∧ (∑ i, f i 0 = ∑ i, f i 1) ∧ (∑ i, f i 1 = ∑ i, f i 2) ∧ (∑ i, f i i = ∑ i, f i (2 - i)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_15968", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "6f154a3e68b5cb08e70c8a070e5f0d2ad5232dc50961610006c242d305163472", "task_path": "tasks/rl_align__o_proofs_lean_workbook_15968__6f154a3e68b5cb08", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_15968", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_17241__0c47cab0a229f37e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (f : ℝ → ℝ) (hf : Continuous f) (h : ∀ x y : ℝ, x ≠ y → ∫ t in x..y, f t = f x / f y) : ∃ x : ℝ, f x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_17241", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "0c47cab0a229f37ecf648cda307584faaf8bbfe8a3216d1364ec91c536e7d8ac", "task_path": "tasks/rl_align__o_proofs_lean_workbook_17241__0c47cab0a229f37e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_17241", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_17354__9d26760c4e1599d5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (f : ℝ → ℝ) (hf : DifferentiableOn ℝ f (Set.Icc 0 1))\n (hff' : DifferentiableOn ℝ (deriv f) (Set.Icc 0 1))\n (hff'' : DifferentiableOn ℝ (deriv (deriv f)) (Set.Icc 0 1))\n (hfg : ∀ x ∈ Set.Icc 0 1, ‖deriv (deriv f) x‖ < 1) (hfb : f 0 = f 1) :\n ∀ x ∈ Set.Icc 0 1, ‖deriv f x‖ < 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_17354", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "9d26760c4e1599d554babe66fbafe343ba35387829b3dd82ff5c379b182ffbfa", "task_path": "tasks/rl_align__o_proofs_lean_workbook_17354__9d26760c4e1599d5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_17354", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_17419__c33ddde1edbbea8a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (g : ℝ → ℝ) (varphi : ℝ → ℝ)\n (hg : Continuous g) (hvarphi : Differentiable ℝ varphi)\n (h : ∀ x, deriv varphi x = g (varphi x)) (hlim : ∃ b : ℝ, Filter.Tendsto varphi Filter.atTop (nhds b)) :\n ∃ b : ℝ, g b = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_17419", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "c33ddde1edbbea8ad7af5c3155d4e334ccc86c9159ed5fa063044a08aa43f01c", "task_path": "tasks/rl_align__o_proofs_lean_workbook_17419__c33ddde1edbbea8a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_17419", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_17751__648d38596244f226", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∃ f g : ℝ → ℝ, (∀ x ∈ Set.Ioo 0 1, 0 ≤ f x ∧ f x ≤ 1) ∧ (∀ x ∈ Set.Icc 0 1, 0 < g x ∧ g x < 1) ∧ Function.Bijective f ∧ Function.Bijective g := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_17751", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "648d38596244f226170ad2d0eb0db3594b46653cfbd18ce656bc05000d8d19fe", "task_path": "tasks/rl_align__o_proofs_lean_workbook_17751__648d38596244f226", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_17751", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_17830__18fb2898566a58b6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (X Y Z M N : ℝ × ℝ) (h1 : M = ((X.1 + Y.1) / 2, (X.2 + Y.2) / 2)) (h2 : N = ((X.1 + Z.1) / 2, (X.2 + Z.2) / 2)) : dist M N = (dist Y Z) / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_17830", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "18fb2898566a58b687591613d89f78cac4d40e16b82d7d406df5f67482ef0653", "task_path": "tasks/rl_align__o_proofs_lean_workbook_17830__18fb2898566a58b6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_17830", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_1826__dcc9a1e7a5e4140e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (a b : ℝ) (f : ℝ → ℝ) (hf : DifferentiableOn ℝ f (Set.Icc a b)) (h₁ : a < b) (h₂ : f a = b) (h₃ : f b = a) : ∃ c₁ c₂ : ℝ, c₁ ∈ Set.Ioo a b ∧ c₂ ∈ Set.Ioo a b ∧ c₁ ≠ c₂ ∧ deriv f c₁ * deriv f c₂ = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_1826", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "dcc9a1e7a5e4140e238104042745300c15289e2a0fccda46b7abb49ae4306447", "task_path": "tasks/rl_align__o_proofs_lean_workbook_1826__dcc9a1e7a5e4140e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_1826", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_18798__1bb8c74d124f59ce", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (x : ℕ → ℝ) (h₀ : ∀ n, x n > 0) (h₁ : ∀ n, (n+1) * x (n+1) = 1 + (n^(1/n) / (x n)^(1/2))) : ∃ L : ℝ, Filter.Tendsto (fun n => (n^(1/2) * x n)) Filter.atTop (nhds L) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_18798", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "1bb8c74d124f59ce1e178732bfb40acb82c325e4e0c0c96a3e6afdc894381b47", "task_path": "tasks/rl_align__o_proofs_lean_workbook_18798__1bb8c74d124f59ce", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_18798", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_19107__b5791aa64b1d0a10", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∀ n : ℕ, n ≥ 2 → ∃ limit : ℝ, Filter.Tendsto (fun x : ℕ => (Finset.sum (Finset.Icc 1 n) (fun k => (n : ℝ) ^ ((k : ℝ) - x) / x)) ^ x) Filter.atTop (nhds limit) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_19107", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "b5791aa64b1d0a10e2d46a182d78ec696820ed139b3485eab42d0bbf3ee6ead1", "task_path": "tasks/rl_align__o_proofs_lean_workbook_19107__b5791aa64b1d0a10", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_19107", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_20297__70ec5db0839708ec", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∀ P : ℝ × ℝ, (P.1^2 / 3 + P.2^2 / 4 = 1) → (dist P (1, 1) + dist P (0, -1) ≤ 5) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_20297", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "70ec5db0839708ecfb2dc13836e78cd80e8c178441d1201d09e62d3039159713", "task_path": "tasks/rl_align__o_proofs_lean_workbook_20297__70ec5db0839708ec", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_20297", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_20401__00e8f6bb636f9b28", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (a : ℕ → ℝ) (h : Summable a) : Summable (fun n => (a n) ^ (1 - 1 / n)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_20401", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "00e8f6bb636f9b28be93e51bf63da069b9e0bc6383b100e627839fa4040cfdd7", "task_path": "tasks/rl_align__o_proofs_lean_workbook_20401__00e8f6bb636f9b28", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_20401", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_21890__589d8930c80f4441", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∫ x in (0:ℝ)..Real.pi, (2^4 * (sin (x/2))^6 * (cos (x/2))^2) = 5 * Real.pi / 8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_21890", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "589d8930c80f4441c1f761e5c8eb5a351aea4cd91d37e40e6bff39568d4fe670", "task_path": "tasks/rl_align__o_proofs_lean_workbook_21890__589d8930c80f4441", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_21890", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_23606__a2da4dcec15ce6e7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (x : ℕ → ℤ) (h₁ : x 1 = 1) (h₂ : x 2 = 1) (h₃ : x 3 = 3)\n (h₄ : ∀ n ≥ 4, x n * x (n - 3) = x (n - 1) ^ 2 + x (n - 1) * x (n - 2) + x (n - 2) ^ 2) :\n ∀ n ≥ 1, x n ∈ Set.range (fun n : ℕ => (n : ℤ)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_23606", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "a2da4dcec15ce6e7792498ffcf42e6f32ac05adee10a316c2c3d3b49d1f6d38d", "task_path": "tasks/rl_align__o_proofs_lean_workbook_23606__a2da4dcec15ce6e7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_23606", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_24024__4867994c535af244", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (n : ℕ) (hn : n ≥ 2) (a : Fin n → ℝ) (ha : ∀ i, 0 ≤ a i ∧ a i ≤ 2) :\n ∑ i : Fin n, ∑ j : Fin n, |a i - a j| ≤ n^2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_24024", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "4867994c535af2449453519c361c7e77d36581d23169a05f6b236868f1550aa6", "task_path": "tasks/rl_align__o_proofs_lean_workbook_24024__4867994c535af244", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_24024", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_24042__ff25e221be5ec98f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_24042 (x : ℝ) (hx : x ∈ Set.Ioo (-1) 1) :\n (∑' n : ℕ, (n + 6) * x ^ (7 * n)) = (6 - 5 * x ^ 7) / (1 - x ^ 7) ^ 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_24042", "source_license": null, "theorem_names": ["lean_workbook_24042"], "statement_sha256": "ff25e221be5ec98f818b516fc0b218e85ab4889a084a8e1a95fd7d943f669704", "task_path": "tasks/rl_align__o_proofs_lean_workbook_24042__ff25e221be5ec98f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_24042", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_25524__5614ed327f0ead9b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : Filter.Tendsto (fun n : ℕ => (2 : ℝ)^(-1 / Real.sqrt n)) Filter.atTop (nhds (1 : ℝ)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_25524", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "5614ed327f0ead9b7d1675e67e41259cba92ba06add1493bbffd159f77dd1a0e", "task_path": "tasks/rl_align__o_proofs_lean_workbook_25524__5614ed327f0ead9b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_25524", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_26220__1bf8ce2e99d96162", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∀ x : ℝ, x ∈ Set.Ioo (-1) 1 → ∑' n : ℕ, (1 + (-1)^n / 2^(n + 1)) * x^n = 3 / (2 - x - x ^ 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_26220", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "1bf8ce2e99d961623bb8cebf2bccdb580df9411551cc161bd7ca4d3af19383f5", "task_path": "tasks/rl_align__o_proofs_lean_workbook_26220__1bf8ce2e99d96162", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_26220", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_2648_2__03b79684fa78e2b1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem lean_workbook_2648 (n : ℕ) (m : ℝ) (x : Fin n → ℝ) (hx: ∀ i, x i > 0) (hm: m > 0) (H : ∑ i, (x i)^m = n) : ∑ i, x i + (∏ i, x i)⁻¹ ≥ n + 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_2648_2", "source_license": null, "theorem_names": ["lean_workbook_2648"], "statement_sha256": "03b79684fa78e2b16d5376008d4beeb50c21d6f500446032f14a12932ddd3590", "task_path": "tasks/rl_align__o_proofs_lean_workbook_2648_2__03b79684fa78e2b1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_2648_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_27295__e3e40ad094994dd7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∫ x in Set.Icc (Real.pi / 2) Real.pi, 256 * sin x ^ 2 * cos x ^ 6 = 5 * Real.pi := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_27295", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "e3e40ad094994dd7e554a6a4255023855e15b8a489b89d9d03b37a793c8e138c", "task_path": "tasks/rl_align__o_proofs_lean_workbook_27295__e3e40ad094994dd7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_27295", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_27645__02aff46ce01bd204", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (n : ℕ) (a : Fin n → ℝ) (h₀ : ∑ k, a k ≠ 0) (r : Fin n → ℝ) (h₁ : ∀ x : Fin n → ℝ, ∑ k, r k * (x k - a k) ≤ Real.sqrt (∑ k, x k ^ 2) - Real.sqrt (∑ k, a k ^ 2)) : ∀ i, r i = a i / Real.sqrt (∑ k, a k ^ 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_27645", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "02aff46ce01bd204c8243c1bad153f479bb1d95f32eeaf9e8a7c09e13772ec24", "task_path": "tasks/rl_align__o_proofs_lean_workbook_27645__02aff46ce01bd204", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_27645", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_27760__8ca3423e322e73b3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (a : ℝ) (h₀ : 0 < a) (h₁ : a ≠ 1) :\n (∀ x ∈ Set.Ioo (-1 : ℝ) 0, deriv (fun x => Real.logb a (|x + 1|)) x > 0) →\n ∀ x ∈ Set.Iio (-1 : ℝ), deriv (fun x => Real.logb a (|x + 1|)) x < 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_27760", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "8ca3423e322e73b3e9631f5de259dcbd51c8fe9a3333a583e9ce8a37213a2703", "task_path": "tasks/rl_align__o_proofs_lean_workbook_27760__8ca3423e322e73b3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_27760", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_27842__4fe1f77d21079079", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∫ x in (-2)..2, (x + Real.sqrt (4 - x ^ 2)) = 2 * Real.pi := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_27842", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "4fe1f77d21079079e9a1603253af5e31e1c1d8e83a502ed8fba89d169538b8b9", "task_path": "tasks/rl_align__o_proofs_lean_workbook_27842__4fe1f77d21079079", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_27842", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_28123__15721651a7e4af87", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∫ x in (-2:ℝ)..2, abs (x^2 - 2 * x) = 8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_28123", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "15721651a7e4af872d6e7e8f8e5746b53b15d586ebc1cf1a406dadc87d5d01b6", "task_path": "tasks/rl_align__o_proofs_lean_workbook_28123__15721651a7e4af87", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_28123", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_29844_4__1566877ef3845dd1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_29844 (a : Fin 8 → Fin 8 → ℕ)\n (h₀ : ∀ i j, a i j = 0 ∨ a i j = 1)\n (h₁ : ∀ i, ∑ j, a i j = 4)\n (h₂ : ∀ j, ∑ i, a i j = 4) :\n ∃ b : Fin 8 → Fin 8 → ℕ,\n (∀ i j, b i j = 0 ∨ b i j = 1) ∧\n (∀ i, ∑ j, b i j = 1) ∧\n (∀ j, ∑ i, b i j = 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_29844_4", "source_license": null, "theorem_names": ["lean_workbook_29844"], "statement_sha256": "1566877ef3845dd194874abeaf6b13c79a6710d8c5332fbd9ef458bc17224f1f", "task_path": "tasks/rl_align__o_proofs_lean_workbook_29844_4__1566877ef3845dd1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_29844_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_3013__8699acf03bcb2f26", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (n : ℕ) (a b : Fin n → ℝ) (ha : ∀ i : Fin n, 0 < a i) (hb : ∀ i : Fin n, 0 < b i) :\n (∑ i, (a i + b i)) * (∑ i, (a i * b i) / (a i + b i)) ≤ (∑ i, a i) * (∑ i, b i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_3013", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "8699acf03bcb2f26e5ec91b4211e94ea29ff02f416b0b74616b5d5d1655a555a", "task_path": "tasks/rl_align__o_proofs_lean_workbook_3013__8699acf03bcb2f26", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_3013", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_30902_4__2d1390fe1acbfdc9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_30902 (n : ℕ) (M N : Matrix (Fin n) (Fin n) ℝ) (hM : M ≠ N) (h1 : M^3 = N^3) (h2 : M^2 * N = N^2 * M) : ∃ (M' N' : Matrix (Fin n) (Fin n) ℝ), M' ≠ N' ∧ M'^3 = N'^3 ∧ M'^2 * N' = N'^2 * M' ∧ (∃ (A B : Matrix (Fin n) (Fin n) ℝ), A ≠ B ∧ A^3 = B^3 ∧ A^2 * B = B^2 * A ∧ (M'^2 + N'^2) = -(M' * N')) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_30902_4", "source_license": null, "theorem_names": ["lean_workbook_30902"], "statement_sha256": "2d1390fe1acbfdc9b0df0f053eb6c4149ff5c0f1afb88b2ba680644db37daba4", "task_path": "tasks/rl_align__o_proofs_lean_workbook_30902_4__2d1390fe1acbfdc9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_30902_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_32532__9efa79cb27e5ea9c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_32532 (c : ℕ) (a : ℕ → ℕ) (h₁ : a 1 = 1) (h₂ : ∀ n, a (n + 1) = (Nat.divisors (a n)).card + c) : ∃ k, ∀ n, k ≤ n → a n = a k := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_32532", "source_license": null, "theorem_names": ["lean_workbook_32532"], "statement_sha256": "9efa79cb27e5ea9cc2b79073295152e5ba38cdd82972ec44f72b77c5c952aa94", "task_path": "tasks/rl_align__o_proofs_lean_workbook_32532__9efa79cb27e5ea9c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_32532", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_39002_2__18ea8e6558556d9e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_39002 (s : Finset ℝ) (hs : s.card = 6) (h : ∀ x ∈ s, ∀ y ∈ s, x ≠ y → dist x y ≥ 1) : ∃ x ∈ s, ∃ y ∈ s, x ≠ y ∧ dist x y ≥ Real.sqrt ((5 + Real.sqrt 5) / 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_39002_2", "source_license": null, "theorem_names": ["lean_workbook_39002"], "statement_sha256": "18ea8e6558556d9e9a345e7e1fc9cb5511fe5b47161c7e7f0b731a42929c23ec", "task_path": "tasks/rl_align__o_proofs_lean_workbook_39002_2__18ea8e6558556d9e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_39002_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_40171__d626ce57df77dd1b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∫ x in (0:ℝ)..1, Real.sqrt x + x = 7 / 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_40171", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "d626ce57df77dd1b2ef4b9706f7ce55b5691a2af85b99678dfff5231bdbfec30", "task_path": "tasks/rl_align__o_proofs_lean_workbook_40171__d626ce57df77dd1b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_40171", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_40699__899a63fe52a09267", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem lean_workbook_40699 (n : ℕ) (hn : 2 ≤ n) (a : Fin n → ℝ) (ha : ∀ i, 0 ≤ a i ∧ a i ≤ 1) : (∑ i : Fin n, a i) * (1 - ∏ i : Fin n, a i) + (n - 2) * ∏ i : Fin n, a i ≤ n - 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_40699", "source_license": null, "theorem_names": ["lean_workbook_40699"], "statement_sha256": "899a63fe52a0926783a75ea1e07d089c921e1a908f3de5fa54e61a314d33f293", "task_path": "tasks/rl_align__o_proofs_lean_workbook_40699__899a63fe52a09267", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_40699", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_45464_5__0df40e1a34401942", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_45464 (a : ℕ → ℕ)\n (h₀ : ∀ n, 1 ≤ n ∧ n ≤ 100 → a n ∈ Set.Icc 1 10)\n (h₁ : ∀ n, 1 ≤ n ∧ n ≤ 100 → ∀ m, 1 ≤ m ∧ m ≤ 100 → n ≠ m → Nat.Coprime (a n) (a m)) :\n ∃ k, 1 ≤ k ∧ k ≤ 10 ∧ 17 ≤ Nat.card {n | 1 ≤ n ∧ n ≤ 100 ∧ a n = k} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_45464_5", "source_license": null, "theorem_names": ["lean_workbook_45464"], "statement_sha256": "0df40e1a34401942737afeb5f2d1c6c1ca9f7f1c0d7e02b99c71dae88d6a44c5", "task_path": "tasks/rl_align__o_proofs_lean_workbook_45464_5__0df40e1a34401942", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_45464_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_51266_2__a8f08ed52f95d9e8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_51266 (a b c : ℝ)\n (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = 30 * x^3 - 50 * x^2 + 22 * x - 1)\n (h₁ : f a = 0 ∧ f b = 0 ∧ f c = 0)\n (h₂ : 0 < a ∧ a < 1)\n (h₃ : 0 < b ∧ b < 1)\n (h₄ : 0 < c ∧ c < 1)\n (h₅ : a ≠ b)\n (h₆ : a ≠ c)\n (h₇ : b ≠ c) :\n ∑' n : ℕ, (a^n + b^n + c^n) = 12 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_51266_2", "source_license": null, "theorem_names": ["lean_workbook_51266"], "statement_sha256": "a8f08ed52f95d9e8d8e4fc30a92932f307d80368fbdd8d2e6a161e144ca258f5", "task_path": "tasks/rl_align__o_proofs_lean_workbook_51266_2__a8f08ed52f95d9e8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_51266_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_51408_2__b21145652edbb99a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_51408 (o : ℝ × ℝ)\n (T : Set (ℝ × ℝ))\n (h₀ : ∀ P ∈ T, ∃ Q ∈ T, P ≠ Q ∧ dist P Q ≤ 2012)\n (h₁ : ∀ Q ∈ T, ∃ P ∈ T, P ≠ Q ∧ dist P Q ≤ 2012)\n (h₂ : 0 < 2012) :\n ∃ L : Set (ℝ × ℝ),\n L.Nonempty ∧\n ∀ P ∈ L, ∃ Q ∈ L, P ≠ Q ∧ dist P Q ≤ 2012 ∧\n ∀ Q ∈ L, ∃ P ∈ L, P ≠ Q ∧ dist P Q ≤ 2012 ∧\n 0 < 2012 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_51408_2", "source_license": null, "theorem_names": ["lean_workbook_51408"], "statement_sha256": "b21145652edbb99a16c0b2a42dfffba3a9aa942f52efd1946552d4ae46012b32", "task_path": "tasks/rl_align__o_proofs_lean_workbook_51408_2__b21145652edbb99a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_51408_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_5837__b58e1e70c619a23c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (f : ℝ → ℝ) (hf : ContinuousOn f (Set.Icc 0 1)) (hd : DifferentiableOn ℝ f (Set.Ioo 0 1)) (h₀ : f 0 = 0) (h₁ : f 1 = 1 / 3) : ∃ c₁ c₂ c₃ : ℝ, c₁ ∈ Set.Ioo 0 1 ∧ c₂ ∈ Set.Ioo 0 1 ∧ c₃ ∈ Set.Ioo 0 1 ∧ c₁ ≠ c₂ ∧ c₂ ≠ c₃ ∧ c₁ ≠ c₃ ∧ deriv f c₁ + deriv f c₂ + deriv f c₃ = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_5837", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "b58e1e70c619a23c9f47ffd41af3dbfe2974860ccfcd448a89a5e94f7c880fb5", "task_path": "tasks/rl_align__o_proofs_lean_workbook_5837__b58e1e70c619a23c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_5837", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_6453__e2d7f220f1ed8ec5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (A : Matrix (Fin 2) (Fin 2) ℤ) (hA : A = ![![1, 0], ![1, 1]]) : A^2018 = ![![1, 0], ![2018, 1]] := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_6453", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "e2d7f220f1ed8ec5fa7244cb728f7947abd83af5d7f22f84534a7cbb60c41933", "task_path": "tasks/rl_align__o_proofs_lean_workbook_6453__e2d7f220f1ed8ec5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_6453", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_70048__424a7d860663b1b2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∀ n : ℕ, n > 0 → ∃ P : Polynomial ℝ, ∫ x in (n-1 : ℝ)..n, P.eval x = ↑n ^ 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_70048", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "424a7d860663b1b221c9cfa9bddaec62c64853c089c2c7e50bed6afc64b7c8f7", "task_path": "tasks/rl_align__o_proofs_lean_workbook_70048__424a7d860663b1b2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_70048", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_70341__baf0d438a1bde3c3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∃ R : Polynomial ℤ, Polynomial.degree R ≤ 5 ∧ 6 * Polynomial.X ^ 8 - 25 * Polynomial.X ^ 7 - 31 * Polynomial.X ^ 6 + 140 * Polynomial.X ^ 5 - 6 * Polynomial.X ^ 3 + 25 * Polynomial.X ^ 2 + 31 * Polynomial.X - 140 = (Polynomial.X ^ 5 - 1) * R := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_70341", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "baf0d438a1bde3c36a789b43597c732c5f805ce84414ab6c13bf61934587a718", "task_path": "tasks/rl_align__o_proofs_lean_workbook_70341__baf0d438a1bde3c3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_70341", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_7399__16b48b17e5d40824", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∃ N : ℕ, ∀ A : ℕ, ¬(∃ B : ℕ, Nat.digits 10 B ⊆ {0, 1, 2} ∧ N = A ^ 2 + B) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_7399", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "16b48b17e5d40824b82ae01ac3cbfeb237ab07bc21c8060757ddaaf1009e98a2", "task_path": "tasks/rl_align__o_proofs_lean_workbook_7399__16b48b17e5d40824", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_7399", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_80183__a6b8671c7e9138cd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∃ P : Polynomial ℤ, ∃ B : ℕ, ∀ n : ℕ, n > 0 → (P.eval (3^n) % n) ≤ B := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_80183", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "a6b8671c7e9138cd625f8e12cbb7b2b1c103e803526f4969b6886895fdb76c8a", "task_path": "tasks/rl_align__o_proofs_lean_workbook_80183__a6b8671c7e9138cd", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_80183", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_82454__64acdf6e949f3262", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook : ∃ x : ℝ × ℝ, ∀ y : ℝ × ℝ, dist (x.1, x.2) (0, 0) + dist (x.1, x.2) (1, 0) + dist (x.1, x.2) (1, 1) + dist (x.1, x.2) (0, 1) ≤ dist (y.1, y.2) (0, 0) + dist (y.1, y.2) (1, 0) + dist (y.1, y.2) (1, 1) + dist (y.1, y.2) (0, 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_82454", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "64acdf6e949f3262937ef90e93a7cf4d6ed9a020af627149671cac46910aa675", "task_path": "tasks/rl_align__o_proofs_lean_workbook_82454__64acdf6e949f3262", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_82454", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_8626__1bab3a2718969f54", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (arrangements : Set (Fin 6 → ℕ)) (h : arrangements = {f | (∀ i, f i = 0 ∨ f i = 1) ∧ (List.count 0 (List.ofFn f) = 4) ∧ (List.count 1 (List.ofFn f) = 2)}) : Nat.card arrangements = 15 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_8626", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "1bab3a2718969f54ad58d92d6c72917e27812444ddb5a99ebd4bd1f7a887b6a6", "task_path": "tasks/rl_align__o_proofs_lean_workbook_8626__1bab3a2718969f54", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_8626", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_9146__0eda6c09a7670364", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (n : ℕ) (a b : Fin n → ℝ) : (∑ i, Real.sqrt ((a i)^2 + (b i)^2)) ≥ Real.sqrt ((∑ i, a i)^2 + (∑ i, b i)^2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_9146", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "0eda6c09a76703648252e7c89c978f687db3ce8c4829ed5753d756469ccb848a", "task_path": "tasks/rl_align__o_proofs_lean_workbook_9146__0eda6c09a7670364", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_9146", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_9201_3__41787704daa40f82", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen scoped BigOperators\n\ntheorem lean_workbook_9201 (p n : ℕ) (a : Fin n → ℤ) (hp : p.Prime) :\n (∑ i : Fin n, a i)^p ≡ ∑ i : Fin n, a i ^ p [ZMOD p] := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_9201_3", "source_license": null, "theorem_names": ["lean_workbook_9201"], "statement_sha256": "c3a20a29e4ac17ffe19ba108f360549d1bb6e9f8b807b3f804f43765c378b3f9", "task_path": "tasks/rl_align__o_proofs_lean_workbook_9201_3__41787704daa40f82", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_9201_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_98880__607c06dca33823ff", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook (n : ℕ) (h : 1 < n) : ∃ N : ℕ, ∀ k : ℕ, k ∈ Set.Icc 1 n → ¬ (∃ p : ℕ, p.Prime ∧ (k + N) = p ^ 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_98880", "source_license": null, "theorem_names": ["lean_workbook"], "statement_sha256": "607c06dca33823fff438f69d0cbca0ee25d0f97e7f0889b2cb260e7f4ca51b94", "task_path": "tasks/rl_align__o_proofs_lean_workbook_98880__607c06dca33823ff", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_98880", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_10297_5__24d86a10e581f299", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_plus_10297 : ¬∃ (n : ℕ) (x : Fin n → ℝ), ∑ i, x i = 2 ∧ ∑ i, (x i)^2 = 3 ∧ ∑ i, (x i)^3 = 4 ∧ ∑ i, (x i)^4 = 5 ∧ ∑ i, (x i)^5 = 6 ∧ ∑ i, (x i)^6 = 7 ∧ ∑ i, (x i)^7 = 8 ∧ ∑ i, (x i)^8 = 9 ∧ ∑ i, (x i)^9 = 10 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_10297_5", "source_license": null, "theorem_names": ["lean_workbook_plus_10297"], "statement_sha256": "24d86a10e581f29910d47444e8ea88bc992dd20e0c2138175dd4f89f95dd295d", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_10297_5__24d86a10e581f299", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_10297_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_10494__c144fab125163cbf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_10494 :\n ∫ x in (Set.Icc 0 (Real.pi / 4)), Real.cos (2 * x) = 1 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_10494", "source_license": null, "theorem_names": ["lean_workbook_plus_10494"], "statement_sha256": "c144fab125163cbf61d3b46926fc70d008a42a364908e40488871f0a66129615", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_10494__c144fab125163cbf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_10494", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_15303__4d6d4bbe50c135cd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_15303 (k : ℕ)\n (h₀ : 0 < k)\n (h₁ : k ≤ 64)\n (h₂ : ∀ A : Finset (Fin 8 × Fin 8), k ≤ A.card →\n ∀ B C : Finset (Fin 8 × Fin 8), A ⊆ B ∪ C → B ⊆ A ∪ C → C ⊆ A ∪ B) :\n 48 ≤ k := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_15303", "source_license": null, "theorem_names": ["lean_workbook_plus_15303"], "statement_sha256": "4d6d4bbe50c135cde1cdf2637221742080fac584612d2c663111c08dfc83338d", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_15303__4d6d4bbe50c135cd", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_15303", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_16368_2__1624af8835b62813", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem lean_workbook_plus_16368 (n : ℕ) (hn : 2 ≤ n) (A : Matrix (Fin n) (Fin n) ℝ) (hA : ∀ (B : Matrix (Fin n) (Fin n) ℝ), B ^ 2 = B → A * B = B * A) : ∃ (c : ℝ), A = c • (1 : Matrix (Fin n) (Fin n) ℝ) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_16368_2", "source_license": null, "theorem_names": ["lean_workbook_plus_16368"], "statement_sha256": "1624af8835b628139734290f3ef9b3f551840b6ce0f792a21f12c457104e166f", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_16368_2__1624af8835b62813", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_16368_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_17259_2__fee3364c11634e75", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_17259 : ∀ (A : Finset ℤ), A.card = 5 → ∃ (B : Finset ℤ), B ⊆ A ∧ B.card = 3 ∧ 3 ∣ B.sum (fun x ↦ x) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_17259_2", "source_license": null, "theorem_names": ["lean_workbook_plus_17259"], "statement_sha256": "fee3364c11634e75fe06d7f1b926bc04133f138f92bb7ecb615474d35da42ee8", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_17259_2__fee3364c11634e75", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_17259_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_18184__09dbb8520794b942", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_plus_18184 (a : ℕ → ℝ) (ha : ∀ i, a i > 0) (hb : Set.Infinite { i | a i ≥ 1 }) : ¬ Summable fun i => a i / (a i + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_18184", "source_license": null, "theorem_names": ["lean_workbook_plus_18184"], "statement_sha256": "09dbb8520794b942051b9f9644409d0de38caefed14eb4ebc7db16f28d1ac672", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_18184__09dbb8520794b942", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_18184", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_19793_2__d42de6edcadb3572", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_19793 (n : ℕ)\n (h₀ : 2 < n)\n (a : Matrix (Fin (n - 2)) (Fin n) ℕ)\n (h₁ : ∀ i j, 0 < a i j ∧ a i j ≤ n)\n (h₂ : ∀ i j k, i ≠ j → a i k ≠ a j k)\n (h₃ : ∀ i j k, i ≠ j → a k i ≠ a k j) :\n ∃ b : Matrix (Fin n) (Fin n) ℕ,\n ∀ i j, 0 < b i j ∧ b i j ≤ n ∧\n ∀ i j k, i ≠ j → b i k ≠ b j k ∧\n ∀ i j k, i ≠ j → b k i ≠ b k j := by sorry", "target_workspace": {"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"}, "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_19793_2", "source_license": null, "theorem_names": ["lean_workbook_plus_19793"], "statement_sha256": "d42de6edcadb35720439eef94c7f0c451f56df7451ef22e1c5feb5a0f1841154", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_19793_2__d42de6edcadb3572", "metadata": {"split": "train", "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_19793_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_21788__5b6a9ad632c401b6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_21788 :\n ∫ x in (Set.Icc 0 Real.pi), (Real.cos x)^2 = Real.pi / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_21788", "source_license": null, "theorem_names": ["lean_workbook_plus_21788"], "statement_sha256": "5b6a9ad632c401b6ddcf901801ed846a37c64a727cd5ca6c154b72149445c79f", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_21788__5b6a9ad632c401b6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_21788", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_22497_2__29702b50b4cdc36e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_22497 (h₀ : ∀ n, 210 ≤ n ∧ n ≤ 240 ∨ 310 ≤ n ∧ n ≤ 340 → (n % 1000) / 100 = 2 ∨ (n % 1000) / 100 = 3)\n (h₁ : ∀ n, 210 ≤ n ∧ n ≤ 240 ∨ 310 ≤ n ∧ n ≤ 340 → (n % 100) / 10 = 1 ∨ (n % 100) / 10 = 2 ∨ (n % 100) / 10 = 3 ∨ (n % 100) / 10 = 4)\n (h₂ : ∀ n, 210 ≤ n ∧ n ≤ 240 ∨ 310 ≤ n ∧ n ≤ 340 → n % 10 = 0 ∨ n % 10 = 1 ∨ n % 10 = 2 ∨ n % 10 = 3 ∨ n % 10 = 4 ∨ n % 10 = 5 ∨ n % 10 = 6 ∨ n % 10 = 7 ∨ n % 10 = 8 ∨ n % 10 = 9) :\n 37 ≤ Nat.card {n | 210 ≤ n ∧ n ≤ 240 ∨ 310 ≤ n ∧ n ≤ 340 ∧ (n % 1000) / 100 = 3} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_22497_2", "source_license": null, "theorem_names": ["lean_workbook_plus_22497"], "statement_sha256": "29702b50b4cdc36e51ff72bda58518efa50ba1f3893d9909c2f86ac2e1b896e9", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_22497_2__29702b50b4cdc36e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_22497_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_22498__ca31fe0ee677cc11", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_22498 :\n ∃ f : Polynomial ℤ,\n f.degree = 2003 ∧\n ∀ n, (n : ℤ) ≠ 0 → (Int.gcd n (f.eval n) = 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_22498", "source_license": null, "theorem_names": ["lean_workbook_plus_22498"], "statement_sha256": "ca31fe0ee677cc117586e07fc645babb22c77b43630306cdf2c2b44841ce35dd", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_22498__ca31fe0ee677cc11", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_22498", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_22903_2__d9cc55fe6ab27387", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_22903 (a b : ℝ)\n (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = a * x + b)\n (h₁ : ∫ x in Set.Icc (-1) 1, (f x)^2 = 2) :\n -1 ≤ a^2 + b ∧ a^2 + b ≤ 37 / 12 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_22903_2", "source_license": null, "theorem_names": ["lean_workbook_plus_22903"], "statement_sha256": "d9cc55fe6ab27387bb7b5b714155d8962d37e114c7b4e7cadfa34b45815728e3", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_22903_2__d9cc55fe6ab27387", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_22903_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_23339_9__6ed7bacf1c9cbcfc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_23339 (n k : ℕ) (hn : n = k^2 - k + 1) (hk : Nat.Prime (k - 1)) : ∃ (A : Matrix (Fin n) (Fin n) ℕ), (∀ i, ∑ j, A i j = k) ∧ (∀ j, ∑ i, A i j = k) ∧ ¬∃ (a b c d : Fin n), A a b = 1 ∧ A b c = 1 ∧ A c d = 1 ∧ A d a = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_23339_9", "source_license": null, "theorem_names": ["lean_workbook_plus_23339"], "statement_sha256": "6ed7bacf1c9cbcfc5800a0d8ea31bafd622e05c10df3ee61645f05ba13f0d2e3", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_23339_9__6ed7bacf1c9cbcfc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_23339_9", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_23950_3__19cb6a63214d4b82", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_plus_23950 :\n ∫ x in (Set.Icc 0 4), (Real.sqrt x - 1 - (x - 3)) = 16 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_23950_3", "source_license": null, "theorem_names": ["lean_workbook_plus_23950"], "statement_sha256": "19cb6a63214d4b82beb6477a2545371ab7fd58d0ca72885dead8986ace2d3aba", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_23950_3__19cb6a63214d4b82", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_23950_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_24105__cab1cd9b6f3f7681", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem lean_workbook_plus_24105 (m : ℕ) (a : ℕ → ℝ) (ha : a = fun n => if n = m^2 then (1 : ℝ) / n else 1 / n^2) : Summable a := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_24105", "source_license": null, "theorem_names": ["lean_workbook_plus_24105"], "statement_sha256": "cab1cd9b6f3f7681dd17594cf843f6a897de1eb3105c5eaffe525df53ded6f67", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_24105__cab1cd9b6f3f7681", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_24105", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_29312__0182db2045cea5bd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_29312 (m : ℝ)\n (z : ℂ)\n (h₀ : z = m / (1 - Complex.I))\n (h₁ : ‖z‖ = ∫ x in (Set.Icc 0 Real.pi), (Real.sin x - 1 / Real.pi)) :\n m = Real.sqrt 2 ∨ m = -Real.sqrt 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_29312", "source_license": null, "theorem_names": ["lean_workbook_plus_29312"], "statement_sha256": "0182db2045cea5bdc64f76fbe4c9d6518b8ee8d4edfe72bba75d843db0f2177e", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_29312__0182db2045cea5bd", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_29312", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_29435__b03e2194184e04b8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem lean_workbook_plus_29435 (k : ℕ) (x : Fin k → ℝ) (hx : ∀ i, x i ∈ Set.Icc 0 2) :\n ∑ i, ∑ j, abs (x i - x j) ≤ k^2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_29435", "source_license": null, "theorem_names": ["lean_workbook_plus_29435"], "statement_sha256": "b03e2194184e04b833807d1bc989159cf4c5df7a75a5ca3202a31b51dd4b017d", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_29435__b03e2194184e04b8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_29435", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_33322_3__e9dfa984059adba3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_33322 (p : Polynomial ℝ)\n (h₀ : p.degree = 2)\n (h₁ : abs (p.eval (-1)) ≤ 1)\n (h₂ : abs (p.eval 0) ≤ 1)\n (h₃ : abs (p.eval 1) ≤ 1) :\n ∀ x ∈ Set.Icc (-1) 1, abs (p.eval x) ≤ 5 / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_33322_3", "source_license": null, "theorem_names": ["lean_workbook_plus_33322"], "statement_sha256": "e9dfa984059adba3598943ebaced17c1af7f9d4925fe6afeed732665db8bf0d7", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_33322_3__e9dfa984059adba3", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_33322_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_33430_4__4c8d3ad9eb14ba36", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_33430 (n : ℕ) (x : Fin n → ℝ) (hx : ∀ i, 0 < x i ∧ x i < Real.pi / 2) :\n ∑ i, (Real.cos (x i))^2 / (Real.sqrt n + Real.sqrt (∑ i, (1 / (Real.sin (x i))^2))) ≤ Real.sqrt n / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_33430_4", "source_license": null, "theorem_names": ["lean_workbook_plus_33430"], "statement_sha256": "4c8d3ad9eb14ba3688e02b5aaf47aa9698909599f89a1e1d3ef4c0e78d1b9acd", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_33430_4__4c8d3ad9eb14ba36", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_33430_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_34036_3__81549d78490a27d2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_34036 (f : Polynomial ℤ)\n (k : ℕ)\n (h₀ : 1 < k)\n (h₁ : ¬ (k : ℤ) ∣ f.eval 1)\n (h₂ : ¬ (k : ℤ) ∣ f.eval 2)\n (h₃ : ∀ x, 1 ≤ x ∧ x ≤ k → ¬ (k : ℤ) ∣ f.eval x) :\n ∀ x, ¬ (k : ℤ) ∣ f.eval x := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_34036_3", "source_license": null, "theorem_names": ["lean_workbook_plus_34036"], "statement_sha256": "81549d78490a27d2ac6891cd6d51772f0d5c5f8459eca5349cbed504d5ceabdf", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_34036_3__81549d78490a27d2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_34036_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_35800__53e29b78ec5ed656", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_35800 (P : Polynomial ℤ)\n (S : Set ℤ)\n (hS : S = {n | (P.eval n) % n = 0}) :\n S.Finite ∨ (Set.univ \\ S).Finite := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_35800", "source_license": null, "theorem_names": ["lean_workbook_plus_35800"], "statement_sha256": "53e29b78ec5ed656664cf42a418c63f92edeeb199502c7874483ba18293a817d", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_35800__53e29b78ec5ed656", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_35800", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_36578__ecfd2ebf4dc31334", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_36578 (n : ℕ) (a : Fin n → ℝ) (ha : ∀ i, 0 ≤ a i ∧ a i ≤ 2) : ∑ i, ∑ j, |a i - a j| ≤ n^2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_36578", "source_license": null, "theorem_names": ["lean_workbook_plus_36578"], "statement_sha256": "ecfd2ebf4dc3133472d6186cf532c13dfbc30db6bbf1e94dba75af2594c72f33", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_36578__ecfd2ebf4dc31334", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_36578", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_37205_2__c9075fab81af57b4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_plus_37205 (a : ℕ → NNReal) (h1 : ∑' i, a i = 1) (h2 : ∀ i, 0 < a i) : ∀ ε > 0, ∃ N : ℕ, ∀ n ≥ N, a n < ε := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_37205_2", "source_license": null, "theorem_names": ["lean_workbook_plus_37205"], "statement_sha256": "c9075fab81af57b4730ebd456e6673c893aab1183fd05289fe135a3b3eace7a8", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_37205_2__c9075fab81af57b4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_37205_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_38173__93e5376798a14b47", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_38173 : Set.Infinite {n : ℕ | ¬ Nat.Prime ((2^(2*n) + 1)^2 + 2^2)} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_38173", "source_license": null, "theorem_names": ["lean_workbook_plus_38173"], "statement_sha256": "93e5376798a14b4721223e2d9f1e4e367405adc3534ff864c35770d5726af719", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_38173__93e5376798a14b47", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_38173", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_39693_11__f277b7924e70a4e9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_plus_39693 (a b x : ℝ)\n (f : ℝ → ℝ)\n (h₀ : 0 < a ∧ a < 1)\n (h₁ : b ∈ Set.univ)\n (h₂ : x ∈ Set.univ)\n (h₃ : f x = -(1 / 3) * x^3 + 2 * a * x^2 - 3 * a^2 * x + b) :\n (1 ≤ x ∧ x ≤ 3 * a) → f x ≤ b ∧ f x ≥ -(4 / 3) * a^3 + b := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_39693_11", "source_license": null, "theorem_names": ["lean_workbook_plus_39693"], "statement_sha256": "f277b7924e70a4e9a90c4b7ffec364d5a33521a2e8eb82063195445a66e481c3", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_39693_11__f277b7924e70a4e9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_39693_11", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_42684_4__87a6972c3ac002b3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_42684 (a : ℕ → ℕ)\n (h₀ : ∀ n, a n = 30 * n - 2)\n (h₁ : 0 < a 25)\n (h₂ : a 40 < 1200)\n (h₃ : 1 ≤ a 40) :\n Nat.card {n | 761 ≤ a n ∧ a n ≤ 1200} = 15 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_42684_4", "source_license": null, "theorem_names": ["lean_workbook_plus_42684"], "statement_sha256": "87a6972c3ac002b3aac743a7c7450fb7cced1de6869c2d9ef9aa95b2025416f7", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_42684_4__87a6972c3ac002b3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_42684_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_43048_14__4602f4ad54ea3ecf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_plus_43048 (N : Matrix (Fin 2) (Fin 2) ℤ) (hN : N =![![(3 : ℤ), 4],![(-2 : ℤ), 0]]) : ∃ r s : ℤ, N^2 = r • N + s • (1 : Matrix (Fin 2) (Fin 2) ℤ) ∧ r = 3 ∧ s = -8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_43048_14", "source_license": null, "theorem_names": ["lean_workbook_plus_43048"], "statement_sha256": "4602f4ad54ea3ecf8c96e7c8d25c0a613e07946f4f16debb8f3dd84a1fa5ff82", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_43048_14__4602f4ad54ea3ecf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_43048_14", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_49898__84289d60932eb94a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_49898 (t : ℕ)\n (x : Fin t → ℤ)\n (h₀ : ∑ i, x i ^ 3 = 2002 ^ 2002) :\n 4 ≤ t := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_49898", "source_license": null, "theorem_names": ["lean_workbook_plus_49898"], "statement_sha256": "84289d60932eb94ae07b521237222cd84496c94e3f539d1735afffb4feb0ba43", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_49898__84289d60932eb94a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_49898", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_50896_4__d10db518cb5c428d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_50896 (f : ℝ → ℝ)\n (h₀ : ∀ x, f (x - 2) = -f x)\n (h₁ : ∀ x ∈ Set.Icc (-1) 0, f x = 2^x) :\n f 2015 = 1 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_50896_4", "source_license": null, "theorem_names": ["lean_workbook_plus_50896"], "statement_sha256": "d10db518cb5c428d543e8f30ff11af0f467befb5d5101c0e4120c19e7113534e", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_50896_4__d10db518cb5c428d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_50896_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_54475_9__fd295a3bedd86828", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_54475 (A : Finset ℕ) (hA : A.card = 7) : ∃ B C D E F G H : Finset ℕ, B ∪ C ∪ D ∪ E ∪ F ∪ G ∪ H = A ∧ B.card = 1 ∧ C.card = 1 ∧ D.card = 1 ∧ E.card = 1 ∧ F.card = 1 ∧ G.card = 1 ∧ H.card = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_54475_9", "source_license": null, "theorem_names": ["lean_workbook_plus_54475"], "statement_sha256": "fd295a3bedd86828fbbdb64b5fbaf6389a18384fd1a7720c13b2754c1d4d27e2", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_54475_9__fd295a3bedd86828", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_54475_9", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_57394_7__5a1790b133bf7759", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_57394 (k : ℕ)\n (h₀ : 3 < k)\n (h₁ : Odd k)\n (h₂ : 0 < k) :\n Set.Infinite {(n : ℕ) | 0 < n ∧ ∃ d₁ d₂ : ℕ, d₁ + d₂ = n + k ∧ d₁ ∣ (n^2 + 1) / 2 ∧ d₂ ∣ (n^2 + 1) / 2} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_57394_7", "source_license": null, "theorem_names": ["lean_workbook_plus_57394"], "statement_sha256": "5a1790b133bf7759ffe3bb1f7f0d32780e8f1b9a4c64d53ef3e0d7e622bda79b", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_57394_7__5a1790b133bf7759", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_57394_7", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_60221_2__ccd225240a09dcf0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_60221 (x : Finset ℕ)\n (n : ℕ)\n (a : Fin n → Finset ℕ)\n (h₀ : ∀ i, 4 ≤ (a i).card)\n (h₁ : ∀ i j, i ≠ j → (a i ∩ a j).card ≤ 2) :\n ∃ y, y.card = 24 ∧ ∀ i, ¬ a i ⊆ y := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_60221_2", "source_license": null, "theorem_names": ["lean_workbook_plus_60221"], "statement_sha256": "ccd225240a09dcf09e404623f4b3b8292517816974dc87b9fcc5c840fe5f362f", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_60221_2__ccd225240a09dcf0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_60221_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_61897__76a91706c78a31b4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_61897 (k : ℕ) : ∃ n, ∃ S : Fin 5 → Finset ℕ, n = (S 0 ∪ S 1 ∪ S 2 ∪ S 3 ∪ S 4).card ∧ ∀ i j, i ≠ j → (S i ∩ S j).card = 0 ∧ ∀ i, (S i).card = k := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_61897", "source_license": null, "theorem_names": ["lean_workbook_plus_61897"], "statement_sha256": "76a91706c78a31b410cb9099c5540e1642a78ea19c9004fcfacc48a385294a9e", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_61897__76a91706c78a31b4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_61897", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_62689__aed9f33638be5a12", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_plus_62689 (S : ℝ)\n (h₀ : S = ∫ x in (Set.Icc 0 1), (-(x^2 - 2 * x) - x)) :\n S = 1 / 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_62689", "source_license": null, "theorem_names": ["lean_workbook_plus_62689"], "statement_sha256": "aed9f33638be5a12d051e93ae6785fd0dbb530bac1ff6dd7f545937195b874c9", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_62689__aed9f33638be5a12", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_62689", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_62708__7a2100481cd02451", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_plus_62708 (n : ℕ)\n (h₀ : 2 ≤ n)\n : ∃ A : Fin n → Matrix (Fin 2) (Fin 2) ℝ,\n (∀ i, A i ≠ 0) ∧\n ∑ i, (A i)⁻¹ = (∑ i, A i)⁻¹ := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_62708", "source_license": null, "theorem_names": ["lean_workbook_plus_62708"], "statement_sha256": "7a2100481cd024513bfebdf5354590c1bb12667875f4f4341df6974bd559cbc4", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_62708__7a2100481cd02451", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_62708", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_63656__551be1fd93bcb981", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_63656 (n : ℕ)\n (a : ℕ → ℤ)\n (P : Polynomial ℤ)\n (hP : P.degree = n)\n (hroots : ∀ z, z ∈ P.roots → ‖z‖ = 1) :\n ∃ m : ℕ, ∀ z, z ∈ P.roots → z^m = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_63656", "source_license": null, "theorem_names": ["lean_workbook_plus_63656"], "statement_sha256": "551be1fd93bcb981aadb0f30e4da1a6b7104e71764f439cd0829b7188dfeb56d", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_63656__551be1fd93bcb981", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_63656", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_64141_5__672a01c2cd5f3351", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_plus_64141 :\n {n : ℕ | ∃ x y : ℕ, (x^2 + y) % (x * y + 1) = n} = {n : ℕ | ∃ x y : ℕ, (x^2 + y) % (x * y + 1) = n ∧ x ≠ 1 ∧ y ≠ 1} ∪ {1} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_64141_5", "source_license": null, "theorem_names": ["lean_workbook_plus_64141"], "statement_sha256": "672a01c2cd5f3351d2845bea952a5477977e15fc944d230ef23baa0bdba463a0", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_64141_5__672a01c2cd5f3351", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_64141_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_64945__ada979673b2ffeff", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_64945 : Set.Infinite {p : ℕ | ∃ n : ℕ, p ∣ (2014^(2^n) + 2014)} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_64945", "source_license": null, "theorem_names": ["lean_workbook_plus_64945"], "statement_sha256": "ada979673b2ffeff3c335fd62eafba7b8b35beca1a04dc0c2df2e11f1d3b4d95", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_64945__ada979673b2ffeff", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_64945", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_64977_2__e921ca390454275a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_64977 (a : ℝ) :\n ∑' n : ℕ, (a / 3^n)^3 = 27 / 26 * a^3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_64977_2", "source_license": null, "theorem_names": ["lean_workbook_plus_64977"], "statement_sha256": "e921ca390454275affc561bf749556e55d8597923c703a5ebf0f9aecb9f2faed", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_64977_2__e921ca390454275a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_64977_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_65802_4__0ec7db38ea189f04", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_65802 (p : Polynomial ℝ)\n (h₀ : p.degree = 4)\n (h₁ : p.eval 0 = 1)\n (h₂ : p.eval 1 = 1)\n (h₃ : p.eval 2 = 4)\n (h₄ : p.eval 3 = 9)\n (h₅ : p.eval 4 = 16) :\n p.eval (-1) = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_65802_4", "source_license": null, "theorem_names": ["lean_workbook_plus_65802"], "statement_sha256": "0ec7db38ea189f04b9ab74a3a3c99def5a28495012600217cdba620ac6f78302", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_65802_4__0ec7db38ea189f04", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_65802_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_67638_5__0a3539fd1243b9b9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_plus_67638 (A : Matrix (Fin 2) (Fin 2) ℤ)\n (h₀ : A =![![4, 1],![-9, -2]]) :\n A^100 =![![301, 100],![-900, -299]] := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_67638_5", "source_license": null, "theorem_names": ["lean_workbook_plus_67638"], "statement_sha256": "0a3539fd1243b9b9ca83f997bd502b30d59b113f60aa4780bda50f0c00a4f3f4", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_67638_5__0a3539fd1243b9b9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_67638_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_68493__4f60dcf9aebe5658", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_68493 (a : ℕ) (ha : 0 < a) (a_n : ℕ → ℕ) (ha_n : ∀ n, 0 < a_n n) (hab : ∀ n, a_n n < a_n (n + 1) ∧ a_n (n + 1) ≤ a_n n + a) : Set.Infinite {p : ℕ | ∃ n : ℕ, p ∣ a_n n} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_68493", "source_license": null, "theorem_names": ["lean_workbook_plus_68493"], "statement_sha256": "4f60dcf9aebe5658904ba6bfea110d634658b8b33607c84749866e19b83c7f8a", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_68493__4f60dcf9aebe5658", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_68493", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_73674_2__e5c60b0039e8a560", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_plus_73674 (n m : ℕ) (a : Fin n → ℝ) (ha : ∀ i, 0 < a i) : (∑ i, (a i)^m) * (∑ i, (a i)^(m + 4)) ≥ (∑ i, (a i)^(m + 1)) * (∑ i, (a i)^(m + 3)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_73674_2", "source_license": null, "theorem_names": ["lean_workbook_plus_73674"], "statement_sha256": "e5c60b0039e8a560e830ed0099c03f40d4f5b012da69888fd2516996e6fc1e8a", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_73674_2__e5c60b0039e8a560", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_73674_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_74092__600b0cffc77854d7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_74092 (n : ℕ) (hn : 2 ≤ n) (θ : Fin n → ℝ) (hθ : ∀ i, 0 < θ i ∧ θ i < Real.pi / 2) : (∑ i, Real.tan (θ i)) * (∑ i, 1 / Real.tan (θ i)) ≥ (∑ i, Real.sin (θ i))^2 + (∑ i, Real.cos (θ i))^2 - n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_74092", "source_license": null, "theorem_names": ["lean_workbook_plus_74092"], "statement_sha256": "600b0cffc77854d77d435a12a0c926fb8c2b14dd2cd65d304c393cd6786fba06", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_74092__600b0cffc77854d7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_74092", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_78209_4__dff4948a51f8bfd6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_78209 (f : ℤ → ℤ → ℤ)\n (h₀ : ∀ x y, f x y = 7 * x^2 + 9 * x * y - 5 * y^2) :\n ∃ k : ℤ, k ∈ Set.Icc 12 19 ∧ ¬ ∃ x y : ℤ, f x y = k := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_78209_4", "source_license": null, "theorem_names": ["lean_workbook_plus_78209"], "statement_sha256": "dff4948a51f8bfd6d2b1139301305577863c01db2489b9d79f988b6eea0064b0", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_78209_4__dff4948a51f8bfd6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_78209_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_78459_2__e8ca47eb1375a36a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem lean_workbook_plus_78459 (n : ℕ) (hn : 100 ≤ n ∧ n ≤ 999) : ∃ k ∈ Set.Icc n (n + 17), k % (Nat.digits 10 k).sum = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_78459_2", "source_license": null, "theorem_names": ["lean_workbook_plus_78459"], "statement_sha256": "e8ca47eb1375a36a4aad0cb4136e1c195cf6773d6d2781ac111c26c5560ca77e", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_78459_2__e8ca47eb1375a36a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_78459_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_81689_2__99050fff74acdfad", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\n\ntheorem lean_workbook_plus_81689 (f : ℝ → ℝ): (∀ x y, f x + f y + 1 ≥ f (x + y) ∧ f (x + y) ≥ f x + f y) ∧ (∀ x ∈ Set.Ico (0 : ℝ) 1, f 0 ≥ f x) ∧ (-f (-1) = f 1 ∧ f 1 = 1) ↔ ∀ x, f x = Int.floor x := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_81689_2", "source_license": null, "theorem_names": ["lean_workbook_plus_81689"], "statement_sha256": "99050fff74acdfadbea58db6be5f63f6af475a6d676fb050da178018f1ebc34a", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_81689_2__99050fff74acdfad", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_81689_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lean_workbook_plus_81859__d93dc6d70786e3c5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem lean_workbook_plus_81859 (P : Polynomial ℝ) (hP : P.degree = 2) (hP1 : abs (P.eval 1) ≤ 1) (hP0 : abs (P.eval 0) ≤ 1) (hPm1 : abs (P.eval (-1)) ≤ 1) (x : ℝ) (hx : x ∈ Set.Icc (-1) 1) : abs (P.eval x) ≤ 5 / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_81859", "source_license": null, "theorem_names": ["lean_workbook_plus_81859"], "statement_sha256": "d93dc6d70786e3c541ce64c6dc07992c863e5c36e68cdf34261ce9da3c0077fa", "task_path": "tasks/rl_align__o_proofs_lean_workbook_plus_81859__d93dc6d70786e3c5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lean_workbook_plus_81859", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_least_k__c0a03b8a358e8c71", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem least_k (n : ℕ) (hn : 1 < n) : ∃ k : ℕ, ∀ X : Finset ℕ, X ⊆ Finset.Icc 1 (n^2) → X.card = k → ∃ x y : ℕ, x ∈ X ∧ y ∈ X ∧ x^2 ∣ y ∧ ∀ m : ℕ, m < k → ∃ X' : Finset ℕ, X' ⊆ Finset.Icc 1 (n^2) ∧ X'.card = m ∧ ∀ x y : ℕ, x ∈ X' → y ∈ X' → ¬(x^2 ∣ y) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_least_k", "source_license": null, "theorem_names": ["least_k"], "statement_sha256": "c0a03b8a358e8c71750a08a6acf1777426939785822d3d4756f227558c871d3a", "task_path": "tasks/rl_align__o_proofs_least_k__c0a03b8a358e8c71", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_least_k", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_least_positive_integer_3__7913f53cf33f105c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem least_positive_integer : ∃ n : ℕ, n > 0 ∧ ∃ F : Fin n → Polynomial ℚ, (∑ i, (F i)^2) = (Polynomial.X)^2 + 7 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_least_positive_integer_3", "source_license": null, "theorem_names": ["least_positive_integer"], "statement_sha256": "9670e5013b13a59c0724214894fedebd64e72c0203e4b1c14673d33731851260", "task_path": "tasks/rl_align__o_proofs_least_positive_integer_3__7913f53cf33f105c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_least_positive_integer_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_length_7__763f2dc1215a0527", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem length (f : ℝ → ℝ × ℝ)\n (hf : f = λ t => (3 * (t - sin t), 3 * (1 - cos t))) :\n ∫ t in (Real.pi)..(2 * Real.pi), Real.sqrt ((deriv f t).1^2 + (deriv f t).2^2) = 12 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_length_7", "source_license": null, "theorem_names": ["length"], "statement_sha256": "763f2dc1215a0527a52e6f5e5c94f54025fa80514e3f84b460fde6c6df807710", "task_path": "tasks/rl_align__o_proofs_length_7__763f2dc1215a0527", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_length_7", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_li_shenghong_inequality__a296481660ce5ae9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem li_shenghong_inequality (θ : Fin 4 → ℝ) (hθ : ∀ i, θ i ∈ Set.Ioo (-Real.pi / 2) (Real.pi / 2)) :\n (∃ x : ℝ, cos (θ 0) ^ 2 * cos (θ 1) ^ 2 - (sin (θ 0) * sin (θ 1) - x) ^ 2 ≥ 0 ∧\n cos (θ 2) ^ 2 * cos (θ 3) ^ 2 - (sin (θ 2) * sin (θ 3) - x) ^ 2 ≥ 0) ↔\n ∑ i : Fin 4, sin (θ i) ^ 2 ≤ 2 * (1 + ∏ i : Fin 4, sin (θ i) + ∏ i : Fin 4, cos (θ i)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_li_shenghong_inequality", "source_license": null, "theorem_names": ["li_shenghong_inequality"], "statement_sha256": "a296481660ce5ae9b9b919691eb21d37adfb042fa73e734dc35b182e794d6c0d", "task_path": "tasks/rl_align__o_proofs_li_shenghong_inequality__a296481660ce5ae9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_li_shenghong_inequality", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lim_a_15__6efd65b370d657db", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem lim_a\n (a : ℕ → ℝ)\n (h₀ : a 1 = 1 / 2)\n (h₁ : ∀ n ≥ 1, a (n + 1) = 2 / (3 - a n)) :\n Tendsto a atTop (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lim_a_15", "source_license": null, "theorem_names": ["lim_a"], "statement_sha256": "6efd65b370d657dba54355ef3b4a98000cf08a729b1efd22aedbfcc8b492217b", "task_path": "tasks/rl_align__o_proofs_lim_a_15__6efd65b370d657db", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lim_a_15", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lim_eval_9__8e614087f4e83dcf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem lim_eval :\n Tendsto (λ (x, y) => (x ^ 2 - 49) * Real.cos (349 / ((x - 7) ^ 2 + (y - 3) ^ 2))) (𝓝 (7, 3)) (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lim_eval_9", "source_license": null, "theorem_names": ["lim_eval"], "statement_sha256": "8e614087f4e83dcfb415d3f37ed7ad566a5ebe834dab338bf7e0048d1088db3d", "task_path": "tasks/rl_align__o_proofs_lim_eval_9__8e614087f4e83dcf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lim_eval_9", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lim_f_5__73f85d1575a19c22", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem lim_f (f : ℝ → ℝ)\n (hf : f = λ x => (π / 2 - arctan x) / log (1 + 1 / x ^ 2)) :\n Tendsto f atTop atTop := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lim_f_5", "source_license": null, "theorem_names": ["lim_f"], "statement_sha256": "73f85d1575a19c227d6eb42f7e0ae481f493f0f11423ce78d9c44f1ea9dc0542", "task_path": "tasks/rl_align__o_proofs_lim_f_5__73f85d1575a19c22", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_lim_f_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_lim_p__be0abd6e5c5c5675", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem lim_p : Tendsto (λ n => (Nat.choose (2 * n) n) / (2 ^ (2 * n))) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lim_p", "source_license": null, "theorem_names": ["lim_p"], "statement_sha256": "be0abd6e5c5c56757380d145e5f70dfa93ea2b33b1e70f80427296ff2cb1b223", "task_path": "tasks/rl_align__o_proofs_lim_p__be0abd6e5c5c5675", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_lim_p", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_2n_over_nfact__63079d162b462911", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_2n_over_nfact : Filter.Tendsto (fun n => (2 : ℝ) ^ n / (Nat.factorial n)) Filter.atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_2n_over_nfact", "source_license": null, "theorem_names": ["limit_2n_over_nfact"], "statement_sha256": "63079d162b46291114621e23f90a3e696f3538db59c6cbaf83e3addb4d96753e", "task_path": "tasks/rl_align__o_proofs_limit_2n_over_nfact__63079d162b462911", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_2n_over_nfact", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_63__8565a3bc2d979520", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem limit :\n Tendsto (λ n => (∏ i ∈ range n, (2 * i + 1)) / (∏ i ∈ range n, (2 * (i + 1))) ^ 3) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_63", "source_license": null, "theorem_names": ["limit"], "statement_sha256": "8565a3bc2d979520f5a98e01ff7b26f7ab3390008252cd904ae07992f7363684", "task_path": "tasks/rl_align__o_proofs_limit_63__8565a3bc2d979520", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_63", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_an__9cd408d768c9e103", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_an : Filter.Tendsto (fun n => if n ≤ 4 then -n else Real.sqrt (n ^ 2 - 4 * n) - n) Filter.atTop (nhds (-2)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_an", "source_license": null, "theorem_names": ["limit_an"], "statement_sha256": "9cd408d768c9e1032009ec0c31419859e687e5cfe54e36f01bd0d28f7f612857", "task_path": "tasks/rl_align__o_proofs_limit_an__9cd408d768c9e103", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_an", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_derivative__2ddad095f33f7b15", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_derivative (f : ℝ → ℝ) (x₀ : ℝ) (h : deriv f x₀ = 2) :\n Filter.Tendsto (fun Δx => (f (x₀ - 2 * Δx) - f x₀) / Δx) (𝓝[≠] 0) (𝓝 (-4)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_derivative", "source_license": null, "theorem_names": ["limit_derivative"], "statement_sha256": "2ddad095f33f7b15fdbf545439cd5bb1e68174ef22844d805d00c6d1e6d2da79", "task_path": "tasks/rl_align__o_proofs_limit_derivative__2ddad095f33f7b15", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_derivative", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_eval_17__9725c832fd1aef35", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem limit_eval (n : ℕ) (hn : n > 1) :\n Tendsto (λ x => (2 ^ x * (n * 2 ^ ((n - 1) * x) + 1)) / x) atTop atTop := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_eval_17", "source_license": null, "theorem_names": ["limit_eval"], "statement_sha256": "9725c832fd1aef35d6ec7dcfba64a89f9fa11d396dfc6928027a99088714b3fb", "task_path": "tasks/rl_align__o_proofs_limit_eval_17__9725c832fd1aef35", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_eval_17", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_eval_31__7e8e84fab6a5b70c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\ntheorem limit_eval :\n Tendsto (λ n => (∏ i ∈ Finset.range n, 2 * (i + 1)) / (∏ i ∈ Finset.range n, (3 * i + 1))) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_eval_31", "source_license": null, "theorem_names": ["limit_eval"], "statement_sha256": "7e8e84fab6a5b70c267072a31da9ee49029dee189111af08102c692bf1b47fa2", "task_path": "tasks/rl_align__o_proofs_limit_eval_31__7e8e84fab6a5b70c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_eval_31", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_eval_54__6be199c25e3ad672", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem limit_eval :\n Tendsto (λ x => x ^ 2 / 2 ^ sqrt (log x)) atTop atTop := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_eval_54", "source_license": null, "theorem_names": ["limit_eval"], "statement_sha256": "6be199c25e3ad6729b31eba8680d6e6356e96c689307cfcc81e295bc9eeabbe7", "task_path": "tasks/rl_align__o_proofs_limit_eval_54__6be199c25e3ad672", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_eval_54", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_eval_62__4dd690204d5de4f7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem limit_eval :\n Tendsto (λ n => 10 ^ n / (Real.sqrt ((Nat.factorial (n + 1)) : ℝ) + Real.sqrt (Nat.factorial n))) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_eval_62", "source_license": null, "theorem_names": ["limit_eval"], "statement_sha256": "4dd690204d5de4f7bb204ef637a2d848dc7573d28a187dff93a5172e9829510e", "task_path": "tasks/rl_align__o_proofs_limit_eval_62__4dd690204d5de4f7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_eval_62", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_eval_9__fd27383227188388", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\ntheorem limit_eval :\n Tendsto (λ n => ∑ j ∈ range (n + 1), (1 / (n ^ 2 + j) + 1 / (n ^ 2 - j))) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_eval_9", "source_license": null, "theorem_names": ["limit_eval"], "statement_sha256": "fd27383227188388415ca36da9946e378d5ffc8ec274bc8cbbb6c9b9be407779", "task_path": "tasks/rl_align__o_proofs_limit_eval_9__fd27383227188388", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_eval_9", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_example_40__6f783d0320035237", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_example : Filter.Tendsto (fun n => (2 * n ^ 2 - 3 * n + 1) / (n ^ 2 - 4 * n + 1)) Filter.atTop (𝓝 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_example_40", "source_license": null, "theorem_names": ["limit_example"], "statement_sha256": "6f783d0320035237879ce3efdd2a16946dfe229c241159f7ad4600f67fb90361", "task_path": "tasks/rl_align__o_proofs_limit_example_40__6f783d0320035237", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_example_40", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_example_4__4e3d8f896810ae61", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_example (h : Filter.Tendsto (fun Δx => Δx) (𝓝[≠] 0) (𝓝 0)) :\n Filter.Tendsto (fun Δx => (2 * Real.log (3 * (1 - 2 * Δx)) + 8 * (1 - 2 * Δx) - (2 * Real.log 3 + 8)) / Δx) (𝓝[≠] 0) (𝓝 (-20)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_example_4", "source_license": null, "theorem_names": ["limit_example"], "statement_sha256": "4e3d8f896810ae61348dea57afc4337719d1be89105cbc17ab3259301a965e61", "task_path": "tasks/rl_align__o_proofs_limit_example_4__4e3d8f896810ae61", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_example_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_example_70__196e06ca498f0a5e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_example : Filter.Tendsto (fun n => (2 * n + 3) / (n + 1)) Filter.atTop (𝓝 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_example_70", "source_license": null, "theorem_names": ["limit_example"], "statement_sha256": "196e06ca498f0a5e580577444d6f061a69408336f548fb23a78cb0b2149343fb", "task_path": "tasks/rl_align__o_proofs_limit_example_70__196e06ca498f0a5e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_example_70", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_example_9__4765727f7d04f35f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_example : Filter.Tendsto (fun n => (n ^ 2 + 3 * n + 5) / 2 ^ n) Filter.atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_example_9", "source_license": null, "theorem_names": ["limit_example"], "statement_sha256": "4765727f7d04f35ff6e3f2a53abec2e641b7107cb8c002aa9ebc1aaaf914d139", "task_path": "tasks/rl_align__o_proofs_limit_example_9__4765727f7d04f35f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_example_9", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_exists_7__9d468c326e4fb5c1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_exists (v : ℕ → ℝ) (h₀ : v 1 = 1) (h₁ : ∀ n, v (n + 1) = Real.sqrt (v n ^ 2 + 1 / 2 ^ n)) : ∃ l : ℝ, Filter.Tendsto v Filter.atTop (nhds l) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_exists_7", "source_license": null, "theorem_names": ["limit_exists"], "statement_sha256": "9d468c326e4fb5c1af10677b300c3852e29d35f2ae416c2ea37095c7eb7ea618", "task_path": "tasks/rl_align__o_proofs_limit_exists_7__9d468c326e4fb5c1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_exists_7", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_expression_12__fd5567eb1c58809d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_expression (x : ℝ) (hx : x > 0) : Filter.Tendsto (fun x => x^2 * Real.log (1 + 1/x) - x) Filter.atTop (𝓝 (-1/2)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_expression_12", "source_license": null, "theorem_names": ["limit_expression"], "statement_sha256": "fd5567eb1c58809d9bcd6185822b63ae02550efa2ec05fbc8ae1107327857752", "task_path": "tasks/rl_align__o_proofs_limit_expression_12__fd5567eb1c58809d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_expression_12", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_expression_13__88fe3f4a75399505", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_expression : Filter.Tendsto (fun n => (7^(n + 1) - 6^(n + 1)) / (7^n - 6^n)) Filter.atTop (nhds 7) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_expression_13", "source_license": null, "theorem_names": ["limit_expression"], "statement_sha256": "88fe3f4a753995057d9ec13048faa464fc8e1d7def5c492c403887754523279f", "task_path": "tasks/rl_align__o_proofs_limit_expression_13__88fe3f4a75399505", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_expression_13", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_expression_14__978233c456e2a50d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_expression (f : ℝ → ℝ) (x₀ : ℝ) (hf : deriv f x₀ = -3) : Filter.Tendsto (fun h : ℝ => (f (x₀ + h) - f (x₀ - 3 * h)) / h) (𝓝[≠] 0) (𝓝 (-12)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_expression_14", "source_license": null, "theorem_names": ["limit_expression"], "statement_sha256": "978233c456e2a50d989579013b31435cf6f40563238f3a0f394737b45aa60ac4", "task_path": "tasks/rl_align__o_proofs_limit_expression_14__978233c456e2a50d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_expression_14", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_expression_16__4ec29bac216e9f8c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_expression (f : ℝ → ℝ) (x₀ : ℝ) (hf : deriv f x₀ = 4) :\n Filter.Tendsto (fun Δx : ℝ => (f (x₀ + 2 * Δx) - f x₀) / Δx) (𝓝[≠] 0) (𝓝 8) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_expression_16", "source_license": null, "theorem_names": ["limit_expression"], "statement_sha256": "4ec29bac216e9f8cd90d44b695d386cbb3e44f25fc048f83bcc5c33679d93c09", "task_path": "tasks/rl_align__o_proofs_limit_expression_16__4ec29bac216e9f8c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_expression_16", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_expression_18__a388b6279406b08b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_expression (f : ℝ → ℝ) (x₀ : ℝ) (h_diff : DifferentiableAt ℝ f x₀) (h_deriv : deriv f x₀ = 1) :\n Filter.Tendsto (fun Δx => (f (x₀ + 2 * Δx) - f x₀) / Δx) (𝓝[≠] 0) (𝓝 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_expression_18", "source_license": null, "theorem_names": ["limit_expression"], "statement_sha256": "a388b6279406b08b1d304e099ef21e0eb1fe6aff5861a3371608c3239d382331", "task_path": "tasks/rl_align__o_proofs_limit_expression_18__a388b6279406b08b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_expression_18", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_expression_eq_neg_one_third_derivative__ab3366695ef353a3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_expression_eq_neg_one_third_derivative (f : ℝ → ℝ) (hf : DifferentiableAt ℝ f 1) :\n Filter.Tendsto (fun k => (f (1 - k) - f 1) / (3 * k)) (𝓝[≠] 0) (𝓝 (-1 / 3 * deriv f 1)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_expression_eq_neg_one_third_derivative", "source_license": null, "theorem_names": ["limit_expression_eq_neg_one_third_derivative"], "statement_sha256": "ab3366695ef353a320bbd083eadc6e28e0d34a7b5518f4644a8fb4add6283fd2", "task_path": "tasks/rl_align__o_proofs_limit_expression_eq_neg_one_third_derivative__ab3366695ef353a3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_expression_eq_neg_one_third_derivative", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_f_2__b6468e0cf5f43b5c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\ntheorem limit_f :\n Tendsto (λ x => ((x * Real.cos x) / (x ^ 3 + 1)) ) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_f_2", "source_license": null, "theorem_names": ["limit_f"], "statement_sha256": "b6468e0cf5f43b5c036637bd2105b9a9f87805bd1e63d9e262101e74c1571831", "task_path": "tasks/rl_align__o_proofs_limit_f_2__b6468e0cf5f43b5c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_f_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_f_and_f_prime_approach_zero__601e321044e258a4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_f_and_f_prime_approach_zero (f : ℝ → ℝ) (hf : ContinuousOn f Set.univ) (hL : ∃ L, Filter.Tendsto (fun x => f x) Filter.atTop (nhds L))\n (h : Filter.Tendsto (fun x => f x + deriv f x) Filter.atTop (nhds 0)) : Filter.Tendsto f Filter.atTop (nhds 0) ∧ Filter.Tendsto (deriv f) Filter.atTop (nhds 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_f_and_f_prime_approach_zero", "source_license": null, "theorem_names": ["limit_f_and_f_prime_approach_zero"], "statement_sha256": "601e321044e258a465d3b12e8a9b93210967aa18995fbb0f70c3f46e228af2ba", "task_path": "tasks/rl_align__o_proofs_limit_f_and_f_prime_approach_zero__601e321044e258a4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_f_and_f_prime_approach_zero", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_function__80e682f9ea3ff02f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_function (x : ℝ) (hx : 0 ≤ x ∧ x ≤ 1) : Filter.Tendsto (fun n : ℕ => ⌊n * x⌋ / n : ℕ → ℝ) Filter.atTop (nhds x) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_function", "source_license": null, "theorem_names": ["limit_function"], "statement_sha256": "80e682f9ea3ff02f0cdf0f1be6f9cd4e770d2bb82df7fa0f4c07851aa2c4bf40", "task_path": "tasks/rl_align__o_proofs_limit_function__80e682f9ea3ff02f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_function", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_ln_sq_ex_over_x_sq_plus_1__85dbd0e53e366119", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_ln_sq_ex_over_x_sq_plus_1 : Filter.Tendsto (fun x => (Real.log (Real.exp 1 * x)) ^ (1 / (x ^ 2 + 1))) (𝓝 1) (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_ln_sq_ex_over_x_sq_plus_1", "source_license": null, "theorem_names": ["limit_ln_sq_ex_over_x_sq_plus_1"], "statement_sha256": "85dbd0e53e366119603984047dc0d67002e7c23407f63490ba572bf33e922227", "task_path": "tasks/rl_align__o_proofs_limit_ln_sq_ex_over_x_sq_plus_1__85dbd0e53e366119", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_ln_sq_ex_over_x_sq_plus_1", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_max_sin_sqrt__14d98eb86d1882a4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_max_sin_sqrt : Filter.Tendsto (fun n : ℕ => max (Real.sin (1 / (n ^ 2 + 1))) (Real.sqrt (1 / (n ^ 4 + n)))) Filter.atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_max_sin_sqrt", "source_license": null, "theorem_names": ["limit_max_sin_sqrt"], "statement_sha256": "14d98eb86d1882a42a27b74053b199a4446fb90c2e828ffccc0dcb4a0746472a", "task_path": "tasks/rl_align__o_proofs_limit_max_sin_sqrt__14d98eb86d1882a4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_max_sin_sqrt", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_of_sequence_24__7f51b063617a0735", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_of_sequence (x : ℝ) :\n Filter.Tendsto (fun x => (2 * x ^ 5 - 7 * x ^ 2 + 1) / (4 * x ^ 4 - 4 * x ^ 3 + 4 * x ^ 2 - 6 * x + 17)) Filter.atTop Filter.atTop := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_of_sequence_24", "source_license": null, "theorem_names": ["limit_of_sequence"], "statement_sha256": "7f51b063617a07352ce50f2c3da964cffcb073e74b9a523f0fd1a4ab628ef378", "task_path": "tasks/rl_align__o_proofs_limit_of_sequence_24__7f51b063617a0735", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_of_sequence_24", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_part_a__fd7579cf648bc8c5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_part_a :\n ∃ l : ℝ, Filter.Tendsto (fun x => 3 / (1 - x^3) + 1 / (x - 1)) (𝓝[≠] 1) (𝓝 l) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_part_a", "source_license": null, "theorem_names": ["limit_part_a"], "statement_sha256": "fd7579cf648bc8c512513118451551fd9a35125730a13b3eb047585d407aea3d", "task_path": "tasks/rl_align__o_proofs_limit_part_a__fd7579cf648bc8c5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_part_a", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_sequence_12__8bfea3b41658de62", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_sequence (a b : ℝ) (x₀ : ℝ) (hx₀ : 0 < x₀) (ha : 0 < a) (hb : 0 < b) :\n ∃ l : ℝ, ∃ x : ℕ → ℝ, ∀ n, x n = (a ^ 2 * (b ^ 2 * (x (n - 1)) ^ 2 + 1)) / (b ^ 2 + (x (n - 1)) ^ 2) ∧ Filter.Tendsto x Filter.atTop (nhds l) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_sequence_12", "source_license": null, "theorem_names": ["limit_sequence"], "statement_sha256": "8bfea3b41658de6277a51842142746ac15af0673036ce6b587ac290c9a4e85e7", "task_path": "tasks/rl_align__o_proofs_limit_sequence_12__8bfea3b41658de62", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_sequence_12", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_sequence_24__cce9d94388c89824", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_sequence : Filter.Tendsto (fun n => (3 * (n + 1) * n / 2) / (n ^ 2 + 4)) Filter.atTop (𝓝 (3 / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_sequence_24", "source_license": null, "theorem_names": ["limit_sequence"], "statement_sha256": "cce9d94388c8982409431b59bdfe5a33efc6e6231e5f904af8befda6210011ae", "task_path": "tasks/rl_align__o_proofs_limit_sequence_24__cce9d94388c89824", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_sequence_24", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_sequence_41__51cf1cc56014ac8f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_sequence (n : ℕ) : Filter.Tendsto (fun n => (Real.sqrt ((n^2 + 5) * (n^4 + 2)) - Real.sqrt (n^6 - 3 * n^3 + 5)) / n) Filter.atTop (nhds (5/2)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_sequence_41", "source_license": null, "theorem_names": ["limit_sequence"], "statement_sha256": "51cf1cc56014ac8f29470eede7ef30fb82a5a071161651cc051014ec78389c86", "task_path": "tasks/rl_align__o_proofs_limit_sequence_41__51cf1cc56014ac8f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_sequence_41", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_series_sum__18af730484c4c6ef", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_series_sum : Filter.Tendsto (fun n => Finset.sum (Finset.range n) (fun k => (k : ℝ) / (Nat.factorial (k + 1)))) Filter.atTop (𝓝 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_series_sum", "source_license": null, "theorem_names": ["limit_series_sum"], "statement_sha256": "18af730484c4c6efcfa341d3def96a56f6bc130a98c859469a0fc756a9c72107", "task_path": "tasks/rl_align__o_proofs_limit_series_sum__18af730484c4c6ef", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_series_sum", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_sqrt_expression__8185ebbc7cf48d38", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_sqrt_expression : Filter.Tendsto (fun x => Real.sqrt (x^2 + 2*x) - Real.sqrt (x^2 - 2*x)) Filter.atTop (nhds 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_sqrt_expression", "source_license": null, "theorem_names": ["limit_sqrt_expression"], "statement_sha256": "8185ebbc7cf48d386fc40a3965d67e49ff3057eccc1b2280dd52d76fbfd6764e", "task_path": "tasks/rl_align__o_proofs_limit_sqrt_expression__8185ebbc7cf48d38", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_limit_sqrt_expression", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_sqrt_x__152269fea4344ff1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_sqrt_x (c : ℝ) : Filter.Tendsto (fun x => Real.sqrt x * (Real.sqrt (x + c) - Real.sqrt x)) Filter.atTop (nhds (c / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_sqrt_x", "source_license": null, "theorem_names": ["limit_sqrt_x"], "statement_sha256": "152269fea4344ff1073fcf088f4fe79d06216d6f51680ce8259a5811d570c74b", "task_path": "tasks/rl_align__o_proofs_limit_sqrt_x__152269fea4344ff1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_sqrt_x", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_limit_x_t_infinity__bc4614b57cc1a1e3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem limit_x_t_infinity : Filter.Tendsto (fun t : ℝ => (6 * t ^ 3 - 9 * t + 1) / (2 * t ^ 3 - 3 * t)) Filter.atTop (𝓝 3) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_x_t_infinity", "source_license": null, "theorem_names": ["limit_x_t_infinity"], "statement_sha256": "bc4614b57cc1a1e344eb3db4854bb5b49ecf27b5e7c3e45f68e693c7341ff205", "task_path": "tasks/rl_align__o_proofs_limit_x_t_infinity__bc4614b57cc1a1e3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_limit_x_t_infinity", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_line_integral_12__5009fe29eb7830ca", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem line_integral (f : ℝ → ℝ × ℝ × ℝ)\n (hf : f = λ t => (3/4 * sin (2*t), cos t^3, sin t^3)) :\n ∫ t in (0)..(2*π), (3/4 * sin (2*t)) * sqrt ((deriv f t).1^2 + (deriv f t).2.1^2 + (deriv f t).2.2^2) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_line_integral_12", "source_license": null, "theorem_names": ["line_integral"], "statement_sha256": "5009fe29eb7830ca9bef77f45e060547a2defee251271af321f33b5c6ab667bb", "task_path": "tasks/rl_align__o_proofs_line_integral_12__5009fe29eb7830ca", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_line_integral_12", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_line_integral_7__cdce7a9c56762a58", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem line_integral {f : ℝ → ℝ} (hf : f = λ x => 4 - x ^ 2)\n (A B : ℝ × ℝ) (hA : A = (1, 3)) (hB : B = (2, 0)) :\n let Z := ∫ x in (1)..2, (x - f x) + x * deriv f x\n let H := (90876845839099) ^ ((1 : ℝ) / 5) * (Z + 0.5) * 3 + 1\n H = -8046 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_line_integral_7", "source_license": null, "theorem_names": ["line_integral"], "statement_sha256": "cdce7a9c56762a58d2ac7e69b0b534a3f08f0f1d9063dfa51de0f8d80ebdd59d", "task_path": "tasks/rl_align__o_proofs_line_integral_7__cdce7a9c56762a58", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_line_integral_7", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_line_of_2018__398d4392d6e7175a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem line_of_2018 {p : ℕ → ℝ}\n (hp1 : p 1 = 1 / 2)\n (hpn : ∀ n > 1, p n = ( (∑ i ∈ Icc 1 (n - 1), p i) + 1 ) / (n + 1)) :\n ∑ i ∈ Icc 1 2018, p i = 1009 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_line_of_2018", "source_license": null, "theorem_names": ["line_of_2018"], "statement_sha256": "398d4392d6e7175a68b6573c499b7bc016bf22d80756bbc80fb6a398919a6ca8", "task_path": "tasks/rl_align__o_proofs_line_of_2018__398d4392d6e7175a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_line_of_2018", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_ln_over_n_converges_to_zero__7c72a4e4d21fe106", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem ln_over_n_converges_to_zero : Filter.Tendsto (fun n => (Real.log (n + 1) : ℝ) / (n + 1)) Filter.atTop (nhds 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ln_over_n_converges_to_zero", "source_license": null, "theorem_names": ["ln_over_n_converges_to_zero"], "statement_sha256": "7c72a4e4d21fe10617992b24cfa13fb873e861cb1fac9123372344da618df220", "task_path": "tasks/rl_align__o_proofs_ln_over_n_converges_to_zero__7c72a4e4d21fe106", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_ln_over_n_converges_to_zero", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_log_31__fed04f862aaa9530", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\ntheorem log (a b N : ℕ) (h₁ : 0 < a) (h₂ : b ≠ 0)\n (f : ℕ → ℕ → ℕ) (h₀ : ∀ n > 0, f 1 n = Nat.factorial n)\n (h₃ : ∀ k ≥ 2, ∀ n > 0, f k n = ∏ i ∈ Icc 1 n, f (k - 1) i) :\n (IsGreatest {x | x > 0 ∧ 2 ^ x ∣ f 4 10} N) → (Nat.digits 10 N).sum = 21 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_log_31", "source_license": null, "theorem_names": ["log"], "statement_sha256": "95e699ea25f4266fe97a3b2b8738a21ab675eb6a495c956def031a69349d5719", "task_path": "tasks/rl_align__o_proofs_log_31__fed04f862aaa9530", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_log_31", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_log_definite_integral__21bf53e0d4d8ca90", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem log_definite_integral (f : ℝ → ℝ) (hf : f = λ x => log (sin (π * x))) :\n (∫ x in Icc 0 1, f x) / 2 = ∫ y in (Icc 0 Real.pi), log (sin y) / (2 * Real.pi) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_log_definite_integral", "source_license": null, "theorem_names": ["log_definite_integral"], "statement_sha256": "21bf53e0d4d8ca90f558ff5450d56c9dff7816089ab2ca4740776a789efe1bea", "task_path": "tasks/rl_align__o_proofs_log_definite_integral__21bf53e0d4d8ca90", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_log_definite_integral", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_log_function_increasing_on_interval__dfb05e71c3869b23", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem log_function_increasing_on_interval (a : ℝ) (h₀ : 0 < a ∧ a ≠ 1) :\n (∀ x ∈ Set.Ioo 0 2, deriv (fun x => Real.logb a (1 - 3 * a * x)) x > 0) → a ∈ Set.Ioc 0 (1 / 6) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_log_function_increasing_on_interval", "source_license": null, "theorem_names": ["log_function_increasing_on_interval"], "statement_sha256": "dfb05e71c3869b238b18d17278bc2724e3976e17fc7efd9aaa1c309e41b05ea4", "task_path": "tasks/rl_align__o_proofs_log_function_increasing_on_interval__dfb05e71c3869b23", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_log_function_increasing_on_interval", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_logn_6__8818d3cdd2c8cf24", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem logn (n : ℕ) (hn : n > 1) (x : Fin n → ℝ)\n (hsum : ∑ i : Fin n, x i = 0) (hinterval : ∀ i : Fin n, x i ∈ Set.Ioo (-1 / n : ℝ) (2 / n : ℝ)) :\n 1 ≥ ∏ i : Fin n, (x i * log n + 1 - x i ^ (2 * n)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_logn_6", "source_license": null, "theorem_names": ["logn"], "statement_sha256": "8818d3cdd2c8cf24357f4b22a02011e8f482760d3aa5915b4cd49070aa14daa9", "task_path": "tasks/rl_align__o_proofs_logn_6__8818d3cdd2c8cf24", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_logn_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_logn_7__fae6b07a3d545847", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem logn (n : ℕ) (hn : 0 < n) (a : ℕ → ℝ)\n (ha : ∀ i ∈ range n, 1 ≤ a i) :\n ∏ i ∈ range n, (1 + a i) ≥ (2 ^ n / (n + 1)) * (1 + ∑ i ∈ range n, a i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_logn_7", "source_license": null, "theorem_names": ["logn"], "statement_sha256": "fae6b07a3d5458475705e6b350188ccd82f0008627e12927fcfe3f816ff107e8", "task_path": "tasks/rl_align__o_proofs_logn_7__fae6b07a3d545847", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_logn_7", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_maclaurin_series__ec48b480ac871e1d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem maclaurin_series : ∃ (c : ℕ → ℝ), ∀ x ∈ Set.Ioo (-1) 1, (∑' n : ℕ, c n * x ^ n) = 1 / (1 - x ^ 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_maclaurin_series", "source_license": null, "theorem_names": ["maclaurin_series"], "statement_sha256": "ec48b480ac871e1dc369131a4553167f558b575e8e3f4199c0e9ed139fd28559", "task_path": "tasks/rl_align__o_proofs_maclaurin_series__ec48b480ac871e1d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_maclaurin_series", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_marble_arrangements__f8352f076c00ea10", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem marble_arrangements : Nat.card { d : Fin 5 → ℕ | (∑ i : Fin 5, d i) = 20 } = Nat.choose 24 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_marble_arrangements", "source_license": null, "theorem_names": ["marble_arrangements"], "statement_sha256": "f8352f076c00ea10dcd92e36420c7bf5064024c2ec0a8a99851c8f9a30fe3303", "task_path": "tasks/rl_align__o_proofs_marble_arrangements__f8352f076c00ea10", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_marble_arrangements", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_a_value_10__c4f17fe9db2a7dad", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_a_value (f : ℝ → ℝ) (h_diff : DifferentiableOn ℝ f Set.univ) (h_eq : ∀ x, deriv f x + f x = 2 * Real.exp x) (h_init : f 0 = 5) : ∃ a, ∀ x, f x ≥ -Real.exp (2 * x) + 4 * Real.exp x + a ∧ ∀ b, b > a → ¬(∀ x, f x ≥ -Real.exp (2 * x) + 4 * Real.exp x + b) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_a_value_10", "source_license": null, "theorem_names": ["max_a_value"], "statement_sha256": "c4f17fe9db2a7dad573b1805a784032f0886d04c8c4ce7cdcbd2f622694b59c2", "task_path": "tasks/rl_align__o_proofs_max_a_value_10__c4f17fe9db2a7dad", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_a_value_10", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_angles_less_108__759d0262fad4bd78", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_angles_less_108 (n : ℕ) (h : n ≥ 3) : ∃ k : ℕ, k ≤ 4 ∧ ∀ (angles : Fin n → ℝ), (∀ i : Fin n, 0 < angles i ∧ angles i < 180) ∧ (∑ i : Fin n, angles i = (n - 2) * 180) → (Finset.card (Finset.filter (fun i => angles i < 108) Finset.univ) ≤ k) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_angles_less_108", "source_license": null, "theorem_names": ["max_angles_less_108"], "statement_sha256": "759d0262fad4bd789714bc1e7287a814045f9fb591f166976580e201dcbc6028", "task_path": "tasks/rl_align__o_proofs_max_angles_less_108__759d0262fad4bd78", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_angles_less_108", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_area_ABC_20__9aa379f12b01227e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_area_ABC (PA PB PC BC : ℝ) (hPA : PA = 3) (hPB : PB = 4) (hPC : PC = 5) (hBC : BC = 6) : ∃ (A B C P : ℝ × ℝ), dist A P = PA ∧ dist B P = PB ∧ dist C P = PC ∧ dist B C = BC ∧ (fun (A B C : ℝ × ℝ) => 1/2 * abs (A.1 * (B.2 - C.2) + B.1 * (C.2 - A.2) + C.1 * (A.2 - B.2))) A B C = 18.93 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_area_ABC_20", "source_license": null, "theorem_names": ["max_area_ABC"], "statement_sha256": "9aa379f12b01227edf44e018fc51052e5aaf9a90f74f56668647b9cd5e497d3b", "task_path": "tasks/rl_align__o_proofs_max_area_ABC_20__9aa379f12b01227e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_area_ABC_20", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_distance_PB_2__d1061e7bdf4311c8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_distance_PB : ∃ P : ℝ × ℝ, (∀ Q : ℝ × ℝ, (Q.1^2 / 5 + Q.2^2 = 1 → dist Q (0, 1) ≤ dist P (0, 1))) ∧ dist P (0, 1) = 5 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_distance_PB_2", "source_license": null, "theorem_names": ["max_distance_PB"], "statement_sha256": "d1061e7bdf4311c8aa94e208ed2e3b564d7b86c382c9f5a1253d2aa6e137a075", "task_path": "tasks/rl_align__o_proofs_max_distance_PB_2__d1061e7bdf4311c8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_distance_PB_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_distance_circle_line__328cd57c94c480c4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_distance_circle_line :\n let circle : Set (ℝ × ℝ) := {p | ∃ θ : ℝ, p.1 = Real.sqrt 6 / 2 * Real.cos θ ∧ p.2 = Real.sqrt 6 / 2 * Real.sin θ};\n let line : Set (ℝ × ℝ) := {p | p.1 * Real.sqrt 7 - p.2 = Real.sqrt 2};\n let dist : (ℝ × ℝ) → ℝ := fun p => abs (p.1 * Real.sqrt 7 - p.2 - Real.sqrt 2) / Real.sqrt (7 + 1);\n let max_dist : ℝ := Real.sqrt 6 / 2 + 1 / 2;\n ∀ d : ℝ, (∀ p ∈ circle, dist p ≤ d) → d ≥ max_dist := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_distance_circle_line", "source_license": null, "theorem_names": ["max_distance_circle_line"], "statement_sha256": "328cd57c94c480c450743e9e91cacfaa26ce268cd0414039943f89784a047272", "task_path": "tasks/rl_align__o_proofs_max_distance_circle_line__328cd57c94c480c4", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_distance_circle_line", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_divisibility__50baaf5baf0d461e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\ntheorem max_divisibility (P : Set ℕ) (hP : P = {x | ∃ a b c : ℕ, 0 < a ∧ 0 < b ∧ 0 < c ∧ x = a * b * c ∧ a ^ 2 + b ^ 2 = c ^ 2 ∧ 3 ∣ c}) :\n IsGreatest {n | ∀ m ∈ P, 3 ^ n ∣ m} 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_divisibility", "source_license": null, "theorem_names": ["max_divisibility"], "statement_sha256": "50baaf5baf0d461e1a83a16bc5cd9f61429b06a6846656a79c8c918ba65aed1d", "task_path": "tasks/rl_align__o_proofs_max_divisibility__50baaf5baf0d461e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_divisibility", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_f_12__421847473ee3c3e0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem max_f (f : ℕ → ℝ) (hf : ∀ n, f n = Nat.choose n 2 * Nat.choose (100 - n) 8 / Nat.choose 100 10)\n (n : ℕ) (hn : 2 ≤ n ∧ n ≤ 92) :\n IsGreatest {x | ∃ n, x = f n ∧ 2 ≤ n ∧ n ≤ 92} (f 20) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_f_12", "source_license": null, "theorem_names": ["max_f"], "statement_sha256": "421847473ee3c3e07567ff557a2f966b6e1868514de57aa98c44b4df7a0a525a", "task_path": "tasks/rl_align__o_proofs_max_f_12__421847473ee3c3e0", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_f_12", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_factors_of_x_pow_12_sub_1__126a7cfbf35e80e7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_factors_of_x_pow_12_sub_1 : ∃ m : ℕ, m = 6 ∧ ∃ q : Fin m → Polynomial ℝ, (∀ i, Polynomial.degree (q i) > 0) ∧ (∏ i, q i) = Polynomial.X ^ 12 - 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_factors_of_x_pow_12_sub_1", "source_license": null, "theorem_names": ["max_factors_of_x_pow_12_sub_1"], "statement_sha256": "126a7cfbf35e80e71ac94002176a144973f0e40689b798ac3648c6d9ce62ba4e", "task_path": "tasks/rl_align__o_proofs_max_factors_of_x_pow_12_sub_1__126a7cfbf35e80e7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_factors_of_x_pow_12_sub_1", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_m_value_4__5ec062bd60bb67b9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_m_value (m : ℝ) (h₁ : m ≥ 0) (h₂ : ∀ x ∈ Set.Icc (-m) m, deriv (fun x => sin (2 * (x + Real.pi / 4) - Real.pi / 4)) x ≥ 0) : m ≤ Real.pi / 8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_m_value_4", "source_license": null, "theorem_names": ["max_m_value"], "statement_sha256": "5ec062bd60bb67b97ab2f5cd598bd639891f2dc83d00fc195cf58f846d4b9578", "task_path": "tasks/rl_align__o_proofs_max_m_value_4__5ec062bd60bb67b9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_m_value_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_magnitude_of_f_prime__344601b9644d3385", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem max_magnitude_of_f_prime (f : ℝ → ℝ)\n (h₀ : ∀ x, f x = (1 - x^2)^(3 / 2)) :\n ∫ x in (-1)..1, f x ≤ sSup {abs (deriv f y) | y ∈ Ioo (-1) 1} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_magnitude_of_f_prime", "source_license": null, "theorem_names": ["max_magnitude_of_f_prime"], "statement_sha256": "344601b9644d3385e3fae88ce98646da6fdca1ee20186284b3746fab5f49b830", "task_path": "tasks/rl_align__o_proofs_max_magnitude_of_f_prime__344601b9644d3385", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_magnitude_of_f_prime", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_min_determinant__e90e79d4abd401ed", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Matrix Finset\n\n\ntheorem max_min_determinant :\n IsGreatest {d | ∃ A : Matrix (Fin 3) (Fin 3) ℤ, d = A.det ∧ ∀ i j, A i j = -1 ∨ A i j = 1} 4 ∧\n IsLeast {d | ∃ A : Matrix (Fin 3) (Fin 3) ℤ, d = A.det ∧ ∀ i j, A i j = -1 ∨ A i j = 1} (-4) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_min_determinant", "source_license": null, "theorem_names": ["max_min_determinant"], "statement_sha256": "e90e79d4abd401edae5c07c17a8a187350f16f38267a255182cbfc5615bf3553", "task_path": "tasks/rl_align__o_proofs_max_min_determinant__e90e79d4abd401ed", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_min_determinant", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_mn_value__b0277994b20d24f7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_mn_value (m n : ℝ) (h₁ : m > 2) (h₂ : ∀ x ∈ Set.Icc (-2) (-1), deriv (fun x => (1 / 2) * (2 - m) * x ^ 2 + (n - 8) * x + 1) x ≤ 0) : m * n ≤ 18 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_mn_value", "source_license": null, "theorem_names": ["max_mn_value"], "statement_sha256": "b0277994b20d24f7cb0e8163c0e61e454f2268c5b597318ed9356e149fa2fe29", "task_path": "tasks/rl_align__o_proofs_max_mn_value__b0277994b20d24f7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_mn_value", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_omega_6__4c132e2a1f8b21e8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_omega (ω : ℝ) (h₁ : ω > 0) (h₂ : ∀ x ∈ Set.Icc 0 (Real.pi / 12), deriv (fun x => cos (ω * x / 2) * (2 * sin (ω * x / 2) - 2 * Real.sqrt 3 * cos (ω * x / 2)) + Real.sqrt 3) (x + Real.pi / (3 * ω)) ≥ 0) : ω ≤ 6 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_omega_6", "source_license": null, "theorem_names": ["max_omega"], "statement_sha256": "4c132e2a1f8b21e84bb211d02967be49e871349f9ee20dee5817e74b45ad7d77", "task_path": "tasks/rl_align__o_proofs_max_omega_6__4c132e2a1f8b21e8", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_omega_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_power_of_2_2__eda96405aaad549f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\ntheorem max_power_of_2 (S : ℕ) (hS : S = ∑ k ∈ Icc 1 1024, Nat.choose 1024 k * 2 ^ k) :\n IsGreatest {m | m > 0 ∧ (2 ^ m : ℤ) ∣ S} 12 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_power_of_2_2", "source_license": null, "theorem_names": ["max_power_of_2"], "statement_sha256": "eda96405aaad549f7164c0e5a39fda26881d3e3f0cac595fcba73903b341b94f", "task_path": "tasks/rl_align__o_proofs_max_power_of_2_2__eda96405aaad549f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_power_of_2_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_problems_solved__ac46b3606d1598ab", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_problems_solved (n : ℕ) (h₀ : n = 25) (h₁ : ∃ p : Fin n → ℕ, ∀ i, p i ≥ 1 ∧ ∑ i, p i = 6 * n) : ∃ m : ℕ, ∃ p : Fin n → ℕ, (∀ i, p i ≥ 1 ∧ ∑ i, p i = 6 * n) ∧ m = 126 ∧ ∃ i, p i = m := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_problems_solved", "source_license": null, "theorem_names": ["max_problems_solved"], "statement_sha256": "ac46b3606d1598abb29e83fcdd26efb457685b6a94b2894a05a80e32de30cc34", "task_path": "tasks/rl_align__o_proofs_max_problems_solved__ac46b3606d1598ab", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_problems_solved", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_product_sum_31__27ce00ade4cf7d24", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_product_sum_31 : ∃ (n : ℕ) (f : Fin n → ℕ), (∑ i : Fin n, f i) = 31 ∧ ∀ g : Fin n → ℕ, (∑ i : Fin n, g i) = 31 → (∏ i : Fin n, f i) ≥ (∏ i : Fin n, g i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_product_sum_31", "source_license": null, "theorem_names": ["max_product_sum_31"], "statement_sha256": "27ce00ade4cf7d241428bce6613ad88ce3e52fbd1ec17c118292c60597a1f701", "task_path": "tasks/rl_align__o_proofs_max_product_sum_31__27ce00ade4cf7d24", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_product_sum_31", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_subset_size_17__a87ae0a324f523a8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_subset_size :\n ∃ (S : Finset ℕ), S ⊆ Finset.range 1989 ∧\n (∀ (x y : ℕ), x ∈ S → y ∈ S → x ≠ y → x ≠ y + 4 → x ≠ y + 7) ∧\n Finset.card S = (1990 : ℕ) / 11 * 5 + 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_subset_size_17", "source_license": null, "theorem_names": ["max_subset_size"], "statement_sha256": "a87ae0a324f523a86c2f336a491254293aa716d5935bbc740d20b658e91930f8", "task_path": "tasks/rl_align__o_proofs_max_subset_size_17__a87ae0a324f523a8", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_subset_size_17", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_subset_size_27__a7dd09bf316bf2ab", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_subset_size (n : ℕ) (hn : 0 < n) : ∃ T : Finset ℕ, (∀ x ∈ T, x ∈ Set.Icc 1 (3 * n)) ∧ (∀ x ∈ T, ∀ y ∈ T, ∀ z ∈ T, x + y + z ∉ T) ∧ (∀ S : Finset ℕ, (∀ x ∈ S, x ∈ Set.Icc 1 (3 * n)) → (∀ x ∈ S, ∀ y ∈ S, ∀ z ∈ S, x + y + z ∉ S) → S.card ≤ T.card) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_subset_size_27", "source_license": null, "theorem_names": ["max_subset_size"], "statement_sha256": "a7dd09bf316bf2ab1fd75aaf3f670c01d8220598a747115c9cb3c1a0e59f0fda", "task_path": "tasks/rl_align__o_proofs_max_subset_size_27__a7dd09bf316bf2ab", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_subset_size_27", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_value_543__38d23ad7a1edbaaa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem max_value {A : ℕ → ℝ}\n (hA : ∀ k, A k = (19 ^ k + 99 ^ k) / Nat.factorial k) :\n IsGreatest (Set.image A {k | 1 ≤ k}) (A 98) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_value_543", "source_license": null, "theorem_names": ["max_value"], "statement_sha256": "38d23ad7a1edbaaa2503ddcb95a18d73c0d60e76754bc65eac16fbb952c5689f", "task_path": "tasks/rl_align__o_proofs_max_value_543__38d23ad7a1edbaaa", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_value_543", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_value_915__13116626eda21980", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem max_value :\n IsGreatest {∑ j : Fin n, ‖z j‖^2 | (n : ℕ) (z : Fin n → ℂ)\n (h₀ : ∀ i, 0 ≤ (z i).re) (h₁ : ∑ j, z j = 5) (h₂ : ∑ j, (z j)^2 = 7)} 43 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_value_915", "source_license": null, "theorem_names": ["max_value"], "statement_sha256": "13116626eda21980153006ae427d389878c9688f895f4d8c61d75d2706fd5c63", "task_path": "tasks/rl_align__o_proofs_max_value_915__13116626eda21980", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_value_915", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_value_divisible_by_11_and_3__832e16acda4d1b86", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_value_divisible_by_11_and_3 : ∃ (A B C : ℕ), A ∈ Set.Icc 1 9 ∧ B ∈ Set.Icc 0 9 ∧ C ∈ Set.Icc 0 9 ∧ A ≠ B ∧ A ≠ C ∧ B ≠ C ∧ (10000 * A + 1000 * B + 100 * C + 10 * B + A) % 11 = 0 ∧ (10000 * A + 1000 * B + 100 * C + 10 * B + A) % 3 = 0 ∧ ∀ (A' B' C' : ℕ), A' ∈ Set.Icc 1 9 → B' ∈ Set.Icc 0 9 → C' ∈ Set.Icc 0 9 → A' ≠ B' → A' ≠ C' → B' ≠ C' → (10000 * A' + 1000 * B' + 100 * C' + 10 * B' + A') % 11 = 0 → (10000 * A' + 1000 * B' + 100 * C' + 10 * B' + A') % 3 = 0 → (10000 * A + 1000 * B + 100 * C + 10 * B + A) ≥ (10000 * A' + 1000 * B' + 100 * C' + 10 * B' + A') := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_value_divisible_by_11_and_3", "source_license": null, "theorem_names": ["max_value_divisible_by_11_and_3"], "statement_sha256": "832e16acda4d1b86723db384f959b93913eb9c96fccd57660b9da564808a3e79", "task_path": "tasks/rl_align__o_proofs_max_value_divisible_by_11_and_3__832e16acda4d1b86", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_max_value_divisible_by_11_and_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_value_of_f_167__74cf22b383cc6d5d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem max_value_of_f :\n IsGreatest {y : ℝ | ∃ z ∈ Icc 0 1, y = ∫ x in (0)..z, sqrt (x^4 + (z - z^2)^2)} (1/3) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_value_of_f_167", "source_license": null, "theorem_names": ["max_value_of_f"], "statement_sha256": "74cf22b383cc6d5de66a0fdaafdf87acbd791b84603c3185b4d44899b66471dd", "task_path": "tasks/rl_align__o_proofs_max_value_of_f_167__74cf22b383cc6d5d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_value_of_f_167", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_max_value_of_f_at_zero__a3f220063e80907e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem max_value_of_f_at_zero (f : ℝ → ℝ) (hf : DifferentiableOn ℝ f (Set.univ))\n (hf' : DifferentiableOn ℝ (deriv f) (Set.univ)) (hf'' : DifferentiableOn ℝ (deriv (deriv f)) (Set.univ))\n (h : ∀ x, abs (deriv (deriv f) x) ≤ 1) (h₀ : f (-1) = 0) (h₁ : deriv f (-1) = 0)\n (h₂ : f 1 = 0) (h₃ : deriv f 1 = 0) :\n f 0 ≤ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_value_of_f_at_zero", "source_license": null, "theorem_names": ["max_value_of_f_at_zero"], "statement_sha256": "a3f220063e80907ebe8186d2b7f61a81c396e9718549c368cbd75249f37de58a", "task_path": "tasks/rl_align__o_proofs_max_value_of_f_at_zero__a3f220063e80907e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_max_value_of_f_at_zero", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_mean_value_theorem__version__2a14d5d518aaa719", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem mean_value_theorem'_version (f : ℝ → ℝ) (a b : ℝ) (h : a < b) (f_cont : ContinuousOn f (Set.Icc a b)) (f_diff : DifferentiableOn ℝ f (Set.Ioo a b)) (f_equality : f a = f b) :\n ∃ c₁ c₂ : ℝ, c₁ ∈ Set.Ioo a b ∧ c₂ ∈ Set.Ioo a b ∧ a * deriv f c₁ + b * deriv f c₂ = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_mean_value_theorem__version", "source_license": null, "theorem_names": ["mean_value_theorem'_version"], "statement_sha256": "2a14d5d518aaa719275af9cdad23772ad6054200a0b505a2774db6378ba52cce", "task_path": "tasks/rl_align__o_proofs_mean_value_theorem__version__2a14d5d518aaa719", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_mean_value_theorem__version", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_median_value__5f38e3909196f35c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem median_value {m : ℝ} (hm : m > 0) :\n (MeasureTheory.volume {x | x ∈ Icc 0 1 ∧ (1 / 2) * x > m}).toReal =\n 50 / 100 ↔ m = 0.25 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_median_value", "source_license": null, "theorem_names": ["median_value"], "statement_sha256": "5f38e3909196f35c488f1d5c96f1d2ebd4458bb6a664adb47991fb44f35b3df5", "task_path": "tasks/rl_align__o_proofs_median_value__5f38e3909196f35c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_median_value", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_metric_sum__50647a090c964458", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem metric_sum (X : Type*) (d : ℕ → X → X → ℝ) (h : ∀ n, ∀ x y z : X, d n x y ≥ 0 ∧ d n y x = d n x y ∧ d n x x = 0 ∧ d n x z ≤ d n x y + d n y z) : ∀ x y : X, ∑' n : ℕ, min (d n x y) (1 / (2 : ℝ) ^ n) ≥ 0 ∧ ∑' n : ℕ, min (d n x y) (1 / (2 : ℝ) ^ n) = ∑' n : ℕ, min (d n y x) (1 / (2 : ℝ) ^ n) ∧ ∑' n : ℕ, min (d n x x) (1 / (2 : ℝ) ^ n) = 0 ∧ (∀ x y z : X, ∑' n : ℕ, min (d n x z) (1 / (2 : ℝ) ^ n) ≤ ∑' n : ℕ, min (d n x y) (1 / (2 : ℝ) ^ n) + ∑' n : ℕ, min (d n y z) (1 / (2 : ℝ) ^ n)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_metric_sum", "source_license": null, "theorem_names": ["metric_sum"], "statement_sha256": "50647a090c9644588e34c6c609252964c1efdf091bad7aa0733c17c9efd14a79", "task_path": "tasks/rl_align__o_proofs_metric_sum__50647a090c964458", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_metric_sum", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_min_area_square_on_parabola__a2fa0bd447bda0b0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem min_area_square_on_parabola : ∃ A B C : ℝ × ℝ, A ∈ Set.range (fun x => (x, x ^ 2)) ∧ B ∈ Set.range (fun x => (x, x ^ 2)) ∧ C ∈ Set.range (fun x => (x, x ^ 2)) ∧ ∃ D : ℝ × ℝ, dist A B = dist B C ∧ dist B C = dist C D ∧ dist C D = dist D A ∧ dist D A = dist A B ∧ dist A B ≠ 0 ∧ dist A B * dist A B = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_min_area_square_on_parabola", "source_license": null, "theorem_names": ["min_area_square_on_parabola"], "statement_sha256": "a2fa0bd447bda0b017ee8990fbe60bea1b9b2715c5c6ba095f04d19d9791d89a", "task_path": "tasks/rl_align__o_proofs_min_area_square_on_parabola__a2fa0bd447bda0b0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_min_area_square_on_parabola", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_min_cards__30b847bf3a3a4bce", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem min_cards (n : ℕ) (hn : n > 0) : ∃ S : Finset ℕ, (∀ t : ℕ, t ≤ n ! → ∃ s : Finset ℕ, s ⊆ S ∧ t = s.sum id) ∧ ∀ S' : Finset ℕ, (∀ t : ℕ, t ≤ n ! → ∃ s : Finset ℕ, s ⊆ S' ∧ t = s.sum id) → S.card ≤ S'.card := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_min_cards", "source_license": null, "theorem_names": ["min_cards"], "statement_sha256": "07ff88ca711bc35f8b7ef1a6e437ff591322837c535047fe7ab0793e35a12a25", "task_path": "tasks/rl_align__o_proofs_min_cards__30b847bf3a3a4bce", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_min_cards", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_min_cubes_2002_2002__3734eb5b3358807f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem min_cubes_2002_2002 : ∃ n : ℕ, ∃ (a : Fin n → ℤ), 2002 ^ 2002 = ∑ i, (a i) ^ 3 ∧ ∀ m : ℕ, m < n → ¬∃ (b : Fin m → ℤ), 2002 ^ 2002 = ∑ i, (b i) ^ 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_min_cubes_2002_2002", "source_license": null, "theorem_names": ["min_cubes_2002_2002"], "statement_sha256": "3734eb5b3358807f269b47dbc641306c0e214efd3815fd7b404d907e94ee0682", "task_path": "tasks/rl_align__o_proofs_min_cubes_2002_2002__3734eb5b3358807f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_min_cubes_2002_2002", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_min_distance_A_B__f4c8eb549d187b34", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem min_distance_A_B : ∃ (x : ℝ), x ≥ 1 ∧ dist (x + 1 / x, x - 1 / x) (1, 0) = 1 ∧ ∀ y ≥ 1, dist (y + 1 / y, y - 1 / y) (1, 0) ≥ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_min_distance_A_B", "source_license": null, "theorem_names": ["min_distance_A_B"], "statement_sha256": "f4c8eb549d187b3496ec49a24521587b610563cce8dedd73f6e64ef4759ef39b", "task_path": "tasks/rl_align__o_proofs_min_distance_A_B__f4c8eb549d187b34", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_min_distance_A_B", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_min_distance_A_M_N__8b461d49cdc1386d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem min_distance_A_M_N (p : ℝ) (h₀ : p > 0) (a b : ℝ) (h₁ : a > 0) (h₂ : b > 0) (h₃ : a > b) (h₄ : p = a - b) :\n ∃ M : ℝ × ℝ, M.2 ^ 2 = 2 * p * M.1 ∧ ∃ N : ℝ × ℝ, N.1 = M.1 ∧ N.2 = 0 ∧ dist (4, 4) (M.1, M.2) + dist (M.1, M.2) (N.1, N.2) = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_min_distance_A_M_N", "source_license": null, "theorem_names": ["min_distance_A_M_N"], "statement_sha256": "8b461d49cdc1386d148f321c7b2ddcd4faed1bd292c7e37ef051668430dc8f4a", "task_path": "tasks/rl_align__o_proofs_min_distance_A_M_N__8b461d49cdc1386d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_min_distance_A_M_N", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_min_m_for_triangle__3d316bf06c2964d8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem min_m_for_triangle (S : Finset ℕ) (hS : S = Finset.Icc 1 50) :\n ∃ m : ℕ, m = 9 ∧ ∀ (s : Finset ℕ), s ⊆ S → s.card ≥ m → ∃ (a b c : ℕ), a ∈ s ∧ b ∈ s ∧ c ∈ s ∧ a + b > c ∧ a + c > b ∧ b + c > a := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_min_m_for_triangle", "source_license": null, "theorem_names": ["min_m_for_triangle"], "statement_sha256": "3d316bf06c2964d835c1ff6a3f371aaa51c977aaad6d93b209bcba65d8ed5c24", "task_path": "tasks/rl_align__o_proofs_min_m_for_triangle__3d316bf06c2964d8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_min_m_for_triangle", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_min_segments_for_triangle__0415d09a6e800931", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem min_segments_for_triangle (V : Type) [Fintype V] [DecidableEq V] (hV : Fintype.card V = 7) :\n ∃ (E : Set (V × V)), (∀ s : Finset V, s.card = 3 → ∃ e ∈ E, e.1 ∈ s ∧ e.2 ∈ s) ∧\n ∀ (E' : Set (V × V)), (∀ s : Finset V, s.card = 3 → ∃ e ∈ E', e.1 ∈ s ∧ e.2 ∈ s) →\n Set.ncard E ≤ Set.ncard E' := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_min_segments_for_triangle", "source_license": null, "theorem_names": ["min_segments_for_triangle"], "statement_sha256": "0415d09a6e80093129116aeb5b50d3ee93234a0a9490ecf6a88c492414cc12a1", "task_path": "tasks/rl_align__o_proofs_min_segments_for_triangle__0415d09a6e800931", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_min_segments_for_triangle", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_min_value_500__6a509223d28f5abc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem min_value :\n IsLeast {x | ∃ a b c : ℝ, x = ∫ y in (0)..1, (a + b * y + c * y ^ 2) ^ 2 ∧ a + b + c = 1} (1/9) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_min_value_500", "source_license": null, "theorem_names": ["min_value"], "statement_sha256": "6a509223d28f5abc6a48656e31d3728e2a88ee472a779dedf8de18d3479ddf24", "task_path": "tasks/rl_align__o_proofs_min_value_500__6a509223d28f5abc", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_min_value_500", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_mitrofanov_5000_cinephiles__89a4a2634daa425b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem mitrofanov_5000_cinephiles (Film : Type) [Fintype Film] (hF : Fintype.card Film = 100) (Person : Type) [Fintype Person] (hP : Fintype.card Person = 5000) (seen : Person → Set Film) (h_seen : ∀ p : Person, seen p ≠ ∅) : ∃ (sections : Finset (Set Person)), sections.card = 100 ∧ ∀ s ∈ sections, (∀ p ∈ s, ∃ f ∈ seen p, ∀ q ∈ s, f ∈ seen q) ∨ (∀ p ∈ s, ∃ f ∈ seen p, ∀ q ∈ s, q = p → f ∈ seen q ∧ ∀ r ∈ s, r ≠ p → f ∉ seen r) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_mitrofanov_5000_cinephiles", "source_license": null, "theorem_names": ["mitrofanov_5000_cinephiles"], "statement_sha256": "89a4a2634daa425bcde65928ae4f6fd12a1f538f13eeef9d44793107c5427da5", "task_path": "tasks/rl_align__o_proofs_mitrofanov_5000_cinephiles__89a4a2634daa425b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_mitrofanov_5000_cinephiles", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_money_sums__83ea870d739b7ce0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem money_sums :\n Set.ncard {x : ℕ | ∃ s : Finset ℕ, s ⊆ {1, 2, 4, 8, 16} ∧ x = ∑ i ∈ s, i} = 32 ∧\n Set.ncard {x : ℕ | ∃ s : Finset ℕ, s ⊆ {1, 2, 4, 8, 16} ∧ x = ∑ i ∈ s, i ∧ ¬(s = ∅)} = 31 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_money_sums", "source_license": null, "theorem_names": ["money_sums"], "statement_sha256": "83ea870d739b7ce0ccb9f48665486e30d41d85a030f6b7ef6dcd7ecaaeacfdeb", "task_path": "tasks/rl_align__o_proofs_money_sums__83ea870d739b7ce0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_money_sums", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_monotonic_decreasing_interval_142__9ed6d9ec4e5023a9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem monotonic_decreasing_interval : ∀ x ∈ Set.Ioo (-1 : ℝ) 11, deriv (fun x => x^3 - 15*x^2 - 33*x + 6) x < 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_monotonic_decreasing_interval_142", "source_license": null, "theorem_names": ["monotonic_decreasing_interval"], "statement_sha256": "9ed6d9ec4e5023a9806404b21aff3c911a96d4c09b16115b396d8957749dbf87", "task_path": "tasks/rl_align__o_proofs_monotonic_decreasing_interval_142__9ed6d9ec4e5023a9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_monotonic_decreasing_interval_142", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_monotonic_decreasing_interval_166__31c417509375ef64", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem monotonic_decreasing_interval (x : ℝ) : x ∈ Set.Ioo (-1) 1 → deriv (fun x => x^3 - 3*x + 1) x < 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_monotonic_decreasing_interval_166", "source_license": null, "theorem_names": ["monotonic_decreasing_interval"], "statement_sha256": "31c417509375ef64980a3c179560fa668e88b4f3c30390b42ca373233fba0feb", "task_path": "tasks/rl_align__o_proofs_monotonic_decreasing_interval_166__31c417509375ef64", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_monotonic_decreasing_interval_166", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_monotonic_decreasing_interval_67__bd199f790bee60be", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem monotonic_decreasing_interval : ∃ (a b : ℝ), a = -1 ∧ b = 11 ∧ ∀ x ∈ Set.Ioo a b, deriv (fun x => x^3 - 15*x^2 - 33*x + 6) x < 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_monotonic_decreasing_interval_67", "source_license": null, "theorem_names": ["monotonic_decreasing_interval"], "statement_sha256": "bd199f790bee60bef027f2745bb0f4cd973363ab3729d30534cd9c54cfb9fc70", "task_path": "tasks/rl_align__o_proofs_monotonic_decreasing_interval_67__bd199f790bee60be", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_monotonic_decreasing_interval_67", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_monotonic_increasing_a_range_7__0d5484c8cd6304d1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem monotonic_increasing_a_range (a : ℝ) (h : ∀ x ∈ Set.Icc 1 2, deriv (fun x => x^3 - 2*x^2 + a*x + 3) x ≥ 0) : a ≥ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_monotonic_increasing_a_range_7", "source_license": null, "theorem_names": ["monotonic_increasing_a_range"], "statement_sha256": "0d5484c8cd6304d14711cbe26708dc0ef8c9ab395ac836f853f2c35c6d55fed8", "task_path": "tasks/rl_align__o_proofs_monotonic_increasing_a_range_7__0d5484c8cd6304d1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_monotonic_increasing_a_range_7", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_monotonic_increasing_interval_122__f300833ea5a18b27", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem monotonic_increasing_interval (a : ℝ) (h₀ : 0 < a) (h₁ : a < 1) :\n ∃ (k : ℤ), MonotoneOn (fun x => Real.logb a (Real.sin x + Real.cos x)) (Set.Ico (2 * k * Real.pi + Real.pi / 4) (2 * k * Real.pi + 3 * Real.pi / 4)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_monotonic_increasing_interval_122", "source_license": null, "theorem_names": ["monotonic_increasing_interval"], "statement_sha256": "f300833ea5a18b273ac01592eda5cf39115da41ac31e6f9d93cc207c1eadfb7f", "task_path": "tasks/rl_align__o_proofs_monotonic_increasing_interval_122__f300833ea5a18b27", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_monotonic_increasing_interval_122", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_monotonic_increasing_interval_67__bf7053d76534beae", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem monotonic_increasing_interval : Set.Ioo 0 1 = {x | x ∈ Set.Ioo 0 1 ∧ deriv (fun x => Real.log (-x^2 + 2*x)) x > 0} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_monotonic_increasing_interval_67", "source_license": null, "theorem_names": ["monotonic_increasing_interval"], "statement_sha256": "bf7053d76534beaef2e2d12cd602388dce4fe3751217a8ef45f4b5651bb3503d", "task_path": "tasks/rl_align__o_proofs_monotonic_increasing_interval_67__bf7053d76534beae", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_monotonic_increasing_interval_67", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_monotonic_interval__d63a1fc794b8b4b7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem monotonic_interval (m : ℝ) (h₁ : ∀ x ∈ Set.Icc m (m + 4), deriv (fun x => 2 * x ^ 3 - 3 * x ^ 2 - 12 * x + 3) x ≥ 0 ∨ ∀ x ∈ Set.Icc m (m + 4), deriv (fun x => 2 * x ^ 3 - 3 * x ^ 2 - 12 * x + 3) x ≤ 0) : m ∈ Set.Iic (-5) ∪ Set.Ici 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_monotonic_interval", "source_license": null, "theorem_names": ["monotonic_interval"], "statement_sha256": "d63a1fc794b8b4b708d5916e451ac5801a4dd5c4fcd38761f6fc366e00c83bb6", "task_path": "tasks/rl_align__o_proofs_monotonic_interval__d63a1fc794b8b4b7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_monotonic_interval", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_monotonicity_and_extreme_value__920150ceaf39401b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem monotonicity_and_extreme_value (x : ℝ) :\n HasDerivAt (fun x => x * Real.exp (-x)) (Real.exp (-x) - x * Real.exp (-x)) x ∧\n (x < 1 → deriv (fun x => x * Real.exp (-x)) x > 0) ∧\n (x > 1 → deriv (fun x => x * Real.exp (-x)) x < 0) ∧\n deriv (fun x => x * Real.exp (-x)) 1 = 0 ∧\n IsMaxOn (fun x => x * Real.exp (-x)) (Set.Icc 0 2) 1 ∧\n (fun x => x * Real.exp (-x)) 1 = 1 / Real.exp 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_monotonicity_and_extreme_value", "source_license": null, "theorem_names": ["monotonicity_and_extreme_value"], "statement_sha256": "920150ceaf39401b1e2dd9bb647f595247f5cefc52ff66841e97036e804f6d1e", "task_path": "tasks/rl_align__o_proofs_monotonicity_and_extreme_value__920150ceaf39401b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_monotonicity_and_extreme_value", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_monotonicity_and_range__69fcfb7e5cdf76e2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem monotonicity_and_range (a : ℝ) (ha : 0 < a) :\n (∀ x ∈ Set.Ioo 1 2, deriv (fun x => x - 2 / x + a * (2 - Real.log x)) x ≤ 0) ↔ a ≥ 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_monotonicity_and_range", "source_license": null, "theorem_names": ["monotonicity_and_range"], "statement_sha256": "69fcfb7e5cdf76e2e8ca8134dc19643d0710cca4feb675a197f3f3b499b0df37", "task_path": "tasks/rl_align__o_proofs_monotonicity_and_range__69fcfb7e5cdf76e2", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_monotonicity_and_range", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_monotonicity_condition_43__7e283c31c8f0571c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem monotonicity_condition (M : Set ℝ) (hM : M = Set.Ioo 0 (1 / 2)) (a : ℝ) (ha : a > 0 ∧ a ≠ 1) (h : a ∈ M) : (∀ x ∈ Set.Ioo 0 1, deriv (fun x => Real.logb a (|x - 1|)) x ≥ 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_monotonicity_condition_43", "source_license": null, "theorem_names": ["monotonicity_condition"], "statement_sha256": "7e283c31c8f0571c80b081a639a1c4f3f86101a7b1f48c59d17b5ffcc3235463", "task_path": "tasks/rl_align__o_proofs_monotonicity_condition_43__7e283c31c8f0571c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_monotonicity_condition_43", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_102136__ce234cd60ff344bf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (a : ℝ),\n (∀ x ∈ Set.Icc 0 1, (deriv (fun x => x^4 - 4*x^3 + a*x^2 - 1) x) ≥ 0) ∧\n (∀ x ∈ Set.Icc 1 2, (deriv (fun x => x^4 - 4*x^3 + a*x^2 - 1) x) ≤ 0) ∧\n (∃ (b : ℝ), ∃! (s : Finset ℝ), s.card = 2 ∧\n ∀ x ∈ s, (fun x => x^4 - 4*x^3 + a*x^2 - 1) x = (fun x => b*x^2 - 1) x ∧\n ∀ x : ℝ, (fun x => x^4 - 4*x^3 + a*x^2 - 1) x = (fun x => b*x^2 - 1) x → x ∈ s) ∧\n (∀ (n : ℝ), (∀ m ∈ Set.Icc (-6) (-2), ∀ x ∈ Set.Icc (-1) 1,\n (fun x => x^4 - 4*x^3 + a*x^2 - 1) x ≤ m*x^3 + 2*x^2 - n) ↔ n ≤ -4) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_102136", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "ce234cd60ff344bf163d06744129195ed2985f3fca8590e59184895f1572d156", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_102136__ce234cd60ff344bf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_102136", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_102188__e3ebab6a053f6a4c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (A B C P Q R Y Z : ℝ × ℝ),\n\n (Y.1 = 0 ∧ Y.2 = 0) ∧\n (Q.1 = 0 ∧ Q.2 = 15) ∧\n (Z.1 = 8 ∧ Z.2 = 15) ∧\n (C.1 = 8 ∧ C.2 = 0) ∧\n\n (dist A B = 9 ∧ dist B C = 9 ∧ dist C A = 9) ∧\n\n (∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ B = (1 - t) • C + t • Z) ∧\n\n (dist P Q = 9 ∧ dist Q R = 9 ∧ dist R P = 9) ∧\n\n (∃ s : ℝ, 0 ≤ s ∧ s ≤ 1 ∧ R = (1 - s) • Y + s • Q) ∧\n\n dist A P = 10 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_102188", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "e3ebab6a053f6a4c5228d8a369e3350c8c71408f062a612615e284924023952b", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_102188__e3ebab6a053f6a4c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_102188", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_104081__b3b20d8d3344e053", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∃ (apple_distribution : Fin 5 → Fin 6 → ℚ),\n (∀ child : Fin 6, ∑ apple : Fin 5, apple_distribution apple child = 5/6) ∧\n (∀ apple : Fin 5, ∑ child : Fin 6, apple_distribution apple child ≤ 1) ∧\n (∃ apple : Fin 5, ∃ (pieces : Finset (Fin 6)), pieces.card ≤ 3 ∧\n ∀ child : Fin 6, apple_distribution apple child > 0 ↔ child ∈ pieces) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_104081", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "b3b20d8d3344e053c5dde8bc3d9da0f8d45fa86dffb3159e2bcd04c3653aa435", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_104081__b3b20d8d3344e053", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_104081", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_104207__70b5243c58ab1562", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∀ (k : ℕ), Even k → k > 0 → ¬∃ (a : Fin k → ℕ), (∀ i, Odd (a i)) ∧ (∀ i, a i > 0) ∧ (∑ i, (1 : ℚ) / (a i : ℚ)) = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_104207", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "70b5243c58ab1562ae2e37f7f47e8ae4c64f9b8f701ef0aec5508b5752cccf7e", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_104207__70b5243c58ab1562", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_104207", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_109578__e65716ba70255547", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (a : ℝ) (ha : a ≠ 0) :\n (∀ x ∈ Set.Icc (-1 : ℝ) 2, (deriv (fun x => (1/3) * a * x^3 - (1/2) * a * x^2 - 2 * a * x) x) ≥ 0) →\n a < 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_109578", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "e65716ba70255547f505f55725ee135bfa85599887011701d86018a857394203", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_109578__e65716ba70255547", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_109578", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_109777__47a38e0862724c56", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ a : ℝ, (∀ x ∈ Set.Ioo (0 : ℝ) 1, (deriv (fun x => x^3 - a*x^2 - x + 6) x) ≤ 0) → a ≥ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_109777", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "47a38e0862724c569c2ec60fec46a10685ca27852d7a7e4c553fc2f462c6e77b", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_109777__47a38e0862724c56", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_109777", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_111__0e91d109fa8b1d4f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (∀ (angles : Fin 6 → ℝ) (d : ℝ),\n (∃ (a : ℝ) (σ : Equiv.Perm (Fin 6)), ∀ i : Fin 6, angles i = a + (σ i : ℝ) * d) →\n (∑ i : Fin 6, angles i) = 720 →\n (∀ i : Fin 6, 0 < angles i ∧ angles i < 180) →\n |d| ≤ 24) ∧\n (∀ (d : ℝ), |d| < 24 →\n ∃ (angles : Fin 6 → ℝ),\n (∃ (a : ℝ) (σ : Equiv.Perm (Fin 6)), ∀ i : Fin 6, angles i = a + (σ i : ℝ) * d) ∧\n (∑ i : Fin 6, angles i) = 720 ∧\n (∀ i : Fin 6, 0 < angles i ∧ angles i < 180)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_111", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "0e91d109fa8b1d4fea10fbd5572bca57cd32e334f3e56dcdd1947821152874c4", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_111__0e91d109fa8b1d4f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_111", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_11201__8b8e1e346a9fb1c4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (A B C D E : ℝ × ℝ),\n\n (A.2 = B.2) ∧ (C.2 = D.2) ∧ (A.2 ≠ C.2) ∧\n (dist A B = 5) ∧ (dist C D = 10) ∧\n (dist A D = dist B C) ∧\n\n (dist B C = dist E C) ∧\n ((A.1 - E.1) * (C.1 - E.1) + (A.2 - E.2) * (C.2 - E.2) = 0) ∧\n\n (∃ (a b : ℤ), b > 0 ∧\n (∀ p : ℕ, Nat.Prime p → (p^2 : ℤ) ∣ b → False) ∧\n dist A E = (a : ℝ) * Real.sqrt (b : ℝ) ∧\n a + b = 6) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11201", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "8b8e1e346a9fb1c45970ae2d0b84c5da922407499007cd38cad68592c564b3ab", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_11201__8b8e1e346a9fb1c4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11201", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_11412__83175dedf073dfd3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V]\n [FiniteDimensional ℝ V] (A B C : V)\n (hABC : ¬ Collinear ℝ {A, B, C}) :\n ∃ (F G E : V),\n (∃ t : ℝ, t = 1/3 ∧ F = (1 - t) • A + t • C) ∧\n G = (1/2 : ℝ) • B + (1/2 : ℝ) • F ∧\n (∃ s u : ℝ, E = (1 - s) • B + s • C ∧ E = (1 - u) • A + u • G) ∧\n (∃ r : ℝ, r = 1/4 ∧ E = (1 - r) • B + r • C) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11412", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "83175dedf073dfd38af4b4fddfac8f2e0415421904a420b0b02a142f9a7f6b45", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_11412__83175dedf073dfd3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11412", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_11414__9da7282a2555a1be", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n {p : ℕ | Nat.Prime p ∧ ∃ (digits : List ℕ),\n digits.toFinset ⊆ {1, 2, 3} ∧\n digits ≠ [] ∧\n digits.Nodup ∧\n p = digits.foldl (fun acc d => acc * 10 + d) 0} =\n {2, 3, 13, 23, 31} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11414", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "9da7282a2555a1beab6ed57b47cf1b4c042e4fc242221fdc02b6f74fd3ffd30a", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_11414__9da7282a2555a1be", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11414", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_11472__e68008e81f0fda8a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (angles : Fin 7 → ℝ),\n (∀ i, angles i < 180) →\n (∑ i, angles i = 900) →\n (Finset.card (Finset.filter (fun i => angles i > 90) Finset.univ) ≥ 4) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11472", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "e68008e81f0fda8a90c82833a7eae2bc15f0f1c424305e95a5bddfdf00447286", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_11472__e68008e81f0fda8a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11472", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_116436__8414ca9f0db63ed4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∫ x in (0 : ℝ)..(1 : ℝ), (3 * x + Real.exp x) = 1/2 + Real.exp 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_116436", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "8414ca9f0db63ed4af95946b519a33a5e77dd4bb09e2464051a1245bdb4009f6", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_116436__8414ca9f0db63ed4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_116436", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_116976__9cb89c152bdbab14", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (∃ x₁ x₂ x₃ x₄ : ℤ, x₁^3 + x₂^3 + x₃^3 + x₄^3 = 2002^2002) ∧\n (∀ t : ℕ, 0 < t ∧ t < 4 → ¬∃ (x : Fin t → ℤ), (∑ i, (x i)^3) = 2002^2002) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_116976", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "9cb89c152bdbab14932690c12cfc57ae1b7b18dad89d44716514ff394ab05b74", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_116976__9cb89c152bdbab14", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_116976", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_117137__7056a1fe026b5d29", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ) (hf_diff : Differentiable ℝ f)\n (h_ineq : ∀ x, deriv f x > 2 * f x) (h_init : f (1/2) = Real.exp 1) :\n {x : ℝ | x > 0 ∧ f (Real.log x) < x^2} = Set.Ioo 0 (Real.sqrt (Real.exp 1)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_117137", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "7056a1fe026b5d29124a65ec3c7611d8c24ec37e7de515e45f6356a32bbfadcb", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_117137__7056a1fe026b5d29", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_117137", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_117604__5e27468466254019", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃! n : ℕ, 10 ≤ n ∧ n ≤ 99 ∧\n Odd n ∧\n 9 ∣ n ∧\n ∃ a b : ℕ, a ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ) ∧\n b ∈ ({0,1,2,3,4,5,6,7,8,9} : Set ℕ) ∧\n n = 10 * a + b ∧\n ∃ k : ℕ, a * b = k^2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_117604", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "5e27468466254019afd9798bbcea6431c538e1684c46f606518bb24a686b1965", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_117604__5e27468466254019", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_117604", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_11829__f2164c83319e84de", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∃ (A B C D E F P Q : ℝ × ℝ),\n\n (A = (0, 0) ∧ B = (6, 0) ∧ C = (6, 3) ∧ D = (0, 3)) ∧\n\n (E = (6, 1) ∧ F = (6, 2)) ∧\n\n (∃ t₁ t₂ : ℝ, P = A + t₁ • (E - A) ∧ P = B + t₂ • (D - B)) ∧\n\n (∃ s₁ s₂ : ℝ, Q = A + s₁ • (F - A) ∧ Q = B + s₂ • (D - B)) ∧\n\n (∃ (r s t : ℕ), Nat.gcd (Nat.gcd r s) t = 1 ∧\n (∃ (k : ℝ), k > 0 ∧\n dist B P = k * r ∧\n dist P Q = k * s ∧\n dist Q D = k * t) ∧\n r + s + t = 20) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11829", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "f2164c83319e84ded41ba8d77ea1b7cf545ebcd93026dd7a0b5d172046dd61d6", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_11829__f2164c83319e84de", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11829", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_11869__8a3500555e9b7ec1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (∫ x in (-Real.sqrt 3)..(Real.sqrt 3), (x^2 - 1) = 0) ∧\n (∫ x in (-Real.sqrt 3)..(Real.sqrt 3), (x - 1)^2 = 4 * Real.sqrt 3) ∧\n (∫ x in (-Real.sqrt 3)..(Real.sqrt 3), (x + 1)^2 = 4 * Real.sqrt 3) ∧\n (∃ (a b : ℝ), (∫ x in (-Real.sqrt 3)..(Real.sqrt 3), (x - 1) * (a * x + b) = 5 * Real.sqrt 3) ∧\n (∫ x in (-Real.sqrt 3)..(Real.sqrt 3), (x + 1) * (a * x + b) = 3 * Real.sqrt 3) ∧\n (∀ x : ℝ, a * x + b = 2 * x - 1/2)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11869", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "8a3500555e9b7ec1e0fe48e618a88d4c8a6dfab366ccdff6fd667c4184a01e63", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_11869__8a3500555e9b7ec1", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11869", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_11911__38acdaf41e9d0932", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [FiniteDimensional ℝ V]\n (O A B P : V) (h_not_collinear : ¬ Collinear ℝ {O, A, B})\n (h_eq : 2 • (P - O) = 2 • (A - O) + (A - B)) :\n ∃ t : ℝ, t < 0 ∧ P = A + t • (B - A) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11911", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "38acdaf41e9d09328cf7ded17ab4bdccb1db9ff86e4bc094ec0c52b66bf3d5f6", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_11911__38acdaf41e9d0932", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_11911", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_12005__1bb225a7aad4dd85", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (a : ℝ)\n (h : ∀ x ∈ Set.Ioo 0 1, (deriv (fun x => x^2 - a*x + Real.log (x+1))) x > x)\n (c : ℕ → ℝ)\n (h_pos : c 1 > 0)\n (h_rec : ∀ n : ℕ, n ≥ 1 → c (n + 1) = (deriv (fun x => x^2 - a*x + Real.log (x+1))) (c n)) :\n ∀ n : ℕ, n ≥ 1 → c n < c (n + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_12005", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "1bb225a7aad4dd85211a20d27dd831fcbae0d8ca30da775a8ea30505075b912f", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_12005__1bb225a7aad4dd85", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_12005", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_121592__51703373fbc67949", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ)\n (h : ∀ k : ℕ, k ≤ n → (k = 3 ↔ ∀ j : ℕ, j ≤ n → Nat.choose n k ≥ Nat.choose n j)) :\n (2^n = 64) ∧\n (∃ t : ℤ, t = 15 ∧ ∃ k : ℕ, k ≤ n ∧ t = (-1)^k * (Nat.choose n k : ℤ)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_121592", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "51703373fbc679496276dd7d4ff9272ef64f99722627e4b3c22244bfaee858fa", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_121592__51703373fbc67949", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_121592", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_12347__10e5b9e37edeed18", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (x : Fin 14 → ℕ+),\n (∏ i : Fin 14, (x i + 1 : ℕ) = 2008 * ∏ i : Fin 14, (x i : ℕ)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_12347", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "10e5b9e37edeed18538403719ce1fbe6941b429ec9cc8d534fccaeddf09166f0", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_12347__10e5b9e37edeed18", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_12347", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_124212__c30ee9e3990ac5e1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ n : ℕ, (100 ≤ n ∧ n ≤ 999) →\n (∃ a b c : ℕ, a ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ) ∧\n b ∈ ({0,1,2,3,4,5,6,7,8,9} : Set ℕ) ∧\n c ∈ ({0,1,2,3,4,5,6,7,8,9} : Set ℕ) ∧\n n = 100 * a + 10 * b + c ∧\n 2 * n = 3 * Nat.factorial a * Nat.factorial b * Nat.factorial c) →\n n = 432 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_124212", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "c30ee9e3990ac5e184d355c5fb1b07d264fc5af7c0f08af0116971708e1652c3", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_124212__c30ee9e3990ac5e1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_124212", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_124643__def29668c9b0d4ca", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (a b c d e : ℕ),\n a > 0 ∧ b > 0 ∧ c > 0 ∧ d > 0 ∧ e > 0 ∧\n a + 2 = b - 2 ∧\n b - 2 = 2 * c ∧\n 2 * c = d / 2 ∧\n d / 2 = e^2 ∧\n (∀ x ∈ ({a, b, c, d, e} : Set ℕ), x ≤ d) ∧\n d > a ∧ d > b ∧ d > c ∧ d > e ∧\n (∃ (fronts : Fin 5 → ℕ),\n fronts 0 = 101 ∧ fronts 1 = 102 ∧ fronts 2 = 103 ∧ fronts 3 = 104 ∧ fronts 4 = 105 ∧\n (∃ (reverses : Fin 5 → ℕ),\n reverses 0 = a ∧ reverses 1 = b ∧ reverses 2 = c ∧ reverses 3 = d ∧ reverses 4 = e ∧\n (∀ i : Fin 5, (∀ j : Fin 5, reverses j ≤ reverses i) → fronts i = 104))) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_124643", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "def29668c9b0d4ca6efdc60764e4c918d2d4c832caec2f8bd013944b4fb6644e", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_124643__def29668c9b0d4ca", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_124643", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_12588__1c159fea3743317b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ) (x₀ : ℝ) (hf : DifferentiableAt ℝ f x₀)\n (h_deriv : deriv f x₀ = -3) :\n Filter.Tendsto (fun h => (f (x₀ + h) - f (x₀ - h)) / h) (nhdsWithin 0 {0}ᶜ) (nhds (-6)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_12588", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "1c159fea3743317b4ca172ba74f976f7afe664379ba66f822c348386d65b7e81", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_12588__1c159fea3743317b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_12588", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_12649__40f7391578ec4ca8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ a : ℝ, (deriv (fun x => a * x^3 + x^2) (-4/3) = 0) ∧\n (let f := fun x => a * x^3 + x^2\n let g := fun x => f x * Real.exp x\n (∀ x ∈ Set.Iio (-4), deriv g x < 0) ∧\n (∀ x ∈ Set.Ioo (-4) (-1), deriv g x > 0) ∧\n (∀ x ∈ Set.Ioo (-1) 0, deriv g x < 0) ∧\n (∀ x ∈ Set.Ioi 0, deriv g x > 0)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_12649", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "40f7391578ec4ca80ccf3756d129cdbc3a8943d5f267eda69e9f3f35c4cf8924", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_12649__40f7391578ec4ca8", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_12649", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_126794__f3dd0cd752aaf3c3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (∃ (x : Fin 4 → ℤ), (∑ i : Fin 4, (x i)^3) = 2002^2002) ∧\n (∀ n : ℕ, 0 < n ∧ n < 4 → ¬∃ (x : Fin n → ℤ), (∑ i : Fin n, (x i)^3) = 2002^2002) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_126794", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "f3dd0cd752aaf3c3b737896db6104d0c222dd20abd2fe91c480111210e4987ce", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_126794__f3dd0cd752aaf3c3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_126794", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_127900__716ca40fce597877", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (p q r s : ℕ → ℝ),\n (∀ n : ℕ, (1 + Real.sqrt 2 + Real.sqrt 3) ^ n = p n + q n * Real.sqrt 2 + r n * Real.sqrt 3 + s n * Real.sqrt 6) ∧\n Filter.Tendsto (fun n => p n / q n) Filter.atTop (nhds (Real.sqrt 2)) ∧\n Filter.Tendsto (fun n => p n / r n) Filter.atTop (nhds (Real.sqrt 3)) ∧\n Filter.Tendsto (fun n => p n / s n) Filter.atTop (nhds (Real.sqrt 6)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_127900", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "716ca40fce597877487225c73ed582cbb5d3fff5ea93d1b84a42f4d3ddbade4d", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_127900__716ca40fce597877", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_127900", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_128370__2d625bd923f350ab", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∫ x in (2 : ℝ)..(3 : ℝ), Real.pi * (-x^2 + 5*x - 6)^2 = Real.pi/30 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_128370", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "1646dd5dabef699f06c63409cd6318092727b49f1b8bb642f44d2b313f48a6d5", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_128370__2d625bd923f350ab", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_128370", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_128659__0f9ad0344c6433a5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (square_side_length : ℝ) (F E B C : ℝ × ℝ),\n square_side_length = 6 ∧\n\n B.2 = 0 ∧ E.2 = 0 ∧ F.2 = 0 ∧\n\n B.1 = 0 ∧ E.1 = 2 ∧ F.1 = 4 ∧ C.1 = 6 ∧\n\n ∃ (bounce_CD bounce_AD bounce_AB : ℝ × ℝ),\n\n bounce_CD.1 = square_side_length ∧ bounce_CD.2 ∈ Set.Ioo 0 square_side_length ∧\n bounce_AD.1 = 0 ∧ bounce_AD.2 ∈ Set.Ioo 0 square_side_length ∧\n bounce_AB.1 ∈ Set.Ioo 0 square_side_length ∧ bounce_AB.2 = 0 ∧\n\n dist F bounce_CD + dist bounce_CD bounce_AD + dist bounce_AD bounce_AB + dist bounce_AB E = 2 * Real.sqrt 61 ∧\n\n (dist F bounce_CD + dist bounce_CD bounce_AD + dist bounce_AD bounce_AB + dist bounce_AB E) / 1 = 2 * Real.sqrt 61 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_128659", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "0f9ad0344c6433a5e6334b520f61ce19bf9ca7592193ab35197e52abe92139f3", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_128659__0f9ad0344c6433a5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_128659", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_129279__8152b0e4c4b8021b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n Filter.Tendsto (fun n : ℕ => (n.factorial + (n + 2).factorial : ℝ) / ((n - 1).factorial + (n + 2).factorial)) Filter.atTop (nhds 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_129279", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "8152b0e4c4b8021b08acdc423239cdf3ddca84241e6bea9fbb691805a1945a79", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_129279__8152b0e4c4b8021b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_129279", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_129950__eff35f4567288d62", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n Filter.Tendsto (fun n : ℕ => (Real.exp (1 / n) + Real.sin (n / (n^2 + 1)) * Real.cos n) / (1 + Real.cos (1 / n))) Filter.atTop (nhds (1/2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_129950", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "eff35f4567288d624a43e167ca2cefe1ed3ecaface17756819fe0fd0f535addc", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_129950__eff35f4567288d62", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_129950", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_130786__4b7da50ec3387a06", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (A B C : EuclideanSpace ℝ (Fin 2))\n (h_eq : dist A B = dist B C ∧ dist B C = dist C A)\n (h_noncollinear : ¬ Collinear ℝ {A, B, C}) :\n ∀ P : EuclideanSpace ℝ (Fin 2),\n 100 * dist P A + 200 * dist P B + 300 * dist P C ≥\n 100 * dist C A + 200 * dist C B + 300 * dist C C := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_130786", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "4b7da50ec3387a0670ac4040c146122774275c680e040fb3122e6001b8d4c632", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_130786__4b7da50ec3387a06", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_130786", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_13526__58888ea2cbfd5f26", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∫ x in (0:ℝ)..(4:ℝ), (Real.sqrt x - x + 2) = 16/3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_13526", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "58888ea2cbfd5f26b12d7bb4858f7aded56e50d1645a605b8768ec8122637e76", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_13526__58888ea2cbfd5f26", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_13526", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_14438__24533e6551898fa8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (∃ (y : Fin 16 → ℝ), (∀ i, |y i| < 1) ∧\n (∑ i, |y i|) = 15 + |∑ i, y i|) ∧\n (∀ n : ℕ, n < 16 →\n ¬∃ (y : Fin n → ℝ), (∀ i, |y i| < 1) ∧\n (∑ i, |y i|) = 15 + |∑ i, y i|) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_14438", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "24533e6551898fa8be566d80d6de4a5e1d938af573e5a15799ee924757e4a0c4", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_14438__24533e6551898fa8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_14438", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_148641__03371392e7784d88", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (m n : ℝ), m > 2 ∧\n (∀ x ∈ Set.Icc (-2) (-1), (deriv (fun x => (1/2) * (2 - m) * x^2 + (n - 8) * x + 1) x) ≤ 0) ∧\n (∀ m' n' : ℝ, m' > 2 →\n (∀ x ∈ Set.Icc (-2) (-1), (deriv (fun x => (1/2) * (2 - m') * x^2 + (n' - 8) * x + 1) x) ≤ 0) →\n m' * n' ≤ m * n) ∧\n m * n = 18 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_148641", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "03371392e7784d8830e84c658da3790fab21ffb1f34a7f60accd86f8c886c06b", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_148641__03371392e7784d88", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_148641", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_149869__0d1d5b1ac057bc78", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : Polynomial ℚ) (α : ℝ) (h1 : α^3 - α = 33^1992)\n (h2 : ((f.map (algebraMap ℚ ℝ)).eval α)^3 - (f.map (algebraMap ℚ ℝ)).eval α = 33^1992) :\n ∀ n : ℕ, n ≥ 1 → (((f.map (algebraMap ℚ ℝ)).eval^[n]) α)^3 - ((f.map (algebraMap ℚ ℝ)).eval^[n]) α = 33^1992 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_149869", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "0d1d5b1ac057bc78ee9bd91aebb519860c99311a50e6347a48627f302d2de78f", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_149869__0d1d5b1ac057bc78", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_149869", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_15161__fec5a54e277c0b2f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ) (hf_diff : DifferentiableOn ℝ f (Set.Iio 1 ∪ Set.Ioi 1))\n (h_eq : ∀ x ∈ Set.Iio 1 ∪ Set.Ioi 1, f x = (deriv f 2) * x^2 + x * f x + x) :\n ∀ x ∈ Set.Iio 1 ∪ Set.Ioi 1, f x = (x^2 + x) / (1 - x) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_15161", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "fec5a54e277c0b2f70d5ba3799e56670a4f7cbd7fdce98acd7e382b5e2e28d46", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_15161__fec5a54e277c0b2f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_15161", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_152433__e4f89400c9c52ef3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (a : Fin 40 → ℤ) (h : ∀ i, ¬(5 ∣ a i)) : 5 ∣ (∑ i, (a i)^4) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_152433", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "e4f89400c9c52ef3c8a04ad71175b49c5b315ff50ba3acfd0c8c18ed0714b61d", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_152433__e4f89400c9c52ef3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_152433", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_152500__92ca0ec258158698", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (x : Fin n → ℝ) :\n |∑ i, x i| / (1 + |∑ i, x i|) ≤ ∑ i, (|x i| / (1 + |x i|)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_152500", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "92ca0ec25815869880db3725ead22bf3b7ebe77a4a7a4b49ebaf28eafc5b948d", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_152500__92ca0ec258158698", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_152500", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_152535__fa487148c26b6a39", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∃ (f : Polynomial ℤ) (g : Polynomial ℤ) (h : Polynomial ℤ),\n f.degree = 5 ∧\n g.degree = 3 ∧\n h.degree = 2 ∧\n (∀ i, |f.coeff i| ≤ 4) ∧\n (∀ i, |g.coeff i| ≤ 1) ∧\n (∀ i, |h.coeff i| ≤ 1) ∧\n f.eval 10 = g.eval 10 * h.eval 10 ∧\n f = g * h := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_152535", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "fa487148c26b6a39a9ea5ef2115b96d0dcc297a5a82bf6fb20697f9b32d4cd59", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_152535__fa487148c26b6a39", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_152535", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_15305__390106e931593b27", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (a b c : ℝ),\n (∀ x : ℝ, let f := fun t => t^2 + a*t + b\n let f' := fun t => 2*t + a\n f (x + 1) = c * ∫ t in (0:ℝ)..(1:ℝ), (3*x^2 + 4*x*t) * f' t) ↔\n ((a = -5/3 ∧ b = 2/3 ∧ c = -1/2) ∨ (a = -2/3 ∧ b = -1/3 ∧ c = 1)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_15305", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "390106e931593b27303e582a894ed6b874a927e0bbccb3a926bbb006c81a25bf", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_15305__390106e931593b27", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_15305", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_15683__4696ca08b6df9764", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (x : Fin n → ℝ)\n (h_nonneg : ∀ i, 0 ≤ x i)\n (h_sum : ∑ i, x i = 100) :\n 10 ≤ ∑ i, Real.sqrt (x i) ∧ ∑ i, Real.sqrt (x i) ≤ 10 * Real.sqrt n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_15683", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "4696ca08b6df9764685a4d9afc4f24724cce79f7dd9f3ebdff7d92adce392472", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_15683__4696ca08b6df9764", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_15683", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_15790__eddd46b53f8f3249", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (area : ℝ), area = 2 * Real.pi ∧\n area = (1/2) * ∫ θ in Set.Icc (-Real.pi / 4) (3 * Real.pi / 4), (2 * Real.sqrt 2 * Real.cos (Real.pi / 4 - θ))^2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_15790", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "eddd46b53f8f324938652cf812ac363d66465fcf713a3774a379212641650c08", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_15790__eddd46b53f8f3249", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_15790", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_15922__88db6d670e4aaa4c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (a : Fin n → ℝ) (ha : ∀ k, 0 < a k) :\n ∑ k : Fin n, (k.val + 1) * a k ≤ (n * (n - 1)) / 2 + ∑ k : Fin n, (a k) ^ (k.val + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_15922", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "88db6d670e4aaa4c3069920bf227e2c8f0a2e1bb27201062e3bfe8eb0bf843d8", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_15922__88db6d670e4aaa4c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_15922", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_159945__274aea2d07e133c7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n Set.ncard {r : ℕ | r < 7 ∧ ∃ n : ℕ, (n^2 : ℤ) % 7 = ↑r} = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_159945", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "274aea2d07e133c74ba6e14574adb78908f94a762c60fee7d6ef53e3eeef80d0", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_159945__274aea2d07e133c7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_159945", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_1617__287e204571512b3f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (hn : 0 < n) :\n (Polynomial.X^2 + Polynomial.X + 1 : Polynomial ℤ) ∣ ((Polynomial.X + 1)^(2*n + 1) + Polynomial.X^(n + 2) : Polynomial ℤ) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_1617", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "11c0fccbd68d4b615263e2a7b5c54c4f64a5121ae8bc1fe3c6a124043bb6d910", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_1617__287e204571512b3f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_1617", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_162227__6768bad24fec9b85", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (x : Fin n → ℝ)\n (h_nonneg : ∀ i, 0 ≤ x i)\n (h_decreasing : MonotoneOn (fun i => -x i) (Set.univ : Set (Fin n)))\n (h_constraint : ∑ i : Fin n, x i / Real.sqrt (i.val + 1) = 1) :\n ∑ i : Fin n, (x i)^2 ≤ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_162227", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "6768bad24fec9b85e6fbef45957762712c3c193b4fa44ce28b749697c0b2611d", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_162227__6768bad24fec9b85", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_162227", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_162469__9ddf5441a9c1967a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (hn : n > 0) :\n sSup {A : ℝ | ∃ (x : Fin n → ℝ), (∀ i, 0 < x i ∧ x i < 1) ∧\n A = (∑ i, (1 - x i) ^ (1/4 : ℝ)) / (∑ i, (x i) ^ (-1/4 : ℝ))} = Real.sqrt 2 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_162469", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "9ddf5441a9c1967a5986ecbb5e1cda6643dc5666ab3331888fae2ffc7e9019d1", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_162469__9ddf5441a9c1967a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_162469", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_162636__68cf11bd29e74e4a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (x : Fin n → ℝ) (hn : n ≥ 2) (hx : ∀ i, x i > 0) :\n ∑ i : Fin n, (i.val + 1) * x i ≤ (n * (n - 1) : ℝ) / 2 + ∑ i : Fin n, (x i) ^ (i.val + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_162636", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "68cf11bd29e74e4ad62a8447915fcf60154b819623746bf68187b99f39440768", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_162636__68cf11bd29e74e4a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_162636", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_162824__1f77a0d699b9c8e6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (p s r q : ℝ) (a : Fin n → ℝ)\n (h1 : p > s) (h2 : s ≥ r) (h3 : r > q) (h4 : p + q = r + s)\n (ha : ∀ i, 0 < a i) :\n (∑ i, (a i) ^ p) * (∑ i, (a i) ^ q) ≥ (∑ i, (a i) ^ s) * (∑ i, (a i) ^ r) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_162824", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "1f77a0d699b9c8e6503cb071988d2692f8fccb9d1bb69dd5b5b210b4fd0dd155", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_162824__1f77a0d699b9c8e6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_162824", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_162872__ee203fc651cd310d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (min_even : ℕ), min_even = 34 ∧\n (∀ (nums : Fin 100 → ℕ),\n (∀ i : Fin 100, Even (nums i) ∨ Even (nums ⟨(i.val + 1) % 100, Nat.mod_lt _ (by norm_num)⟩) ∨ Even (nums ⟨(i.val + 2) % 100, Nat.mod_lt _ (by norm_num)⟩)) →\n (∑ i : Fin 100, if Even (nums i) then 1 else 0) ≥ min_even) ∧\n (∃ (nums : Fin 100 → ℕ),\n (∀ i : Fin 100, Even (nums i) ∨ Even (nums ⟨(i.val + 1) % 100, Nat.mod_lt _ (by norm_num)⟩) ∨ Even (nums ⟨(i.val + 2) % 100, Nat.mod_lt _ (by norm_num)⟩)) ∧\n (∑ i : Fin 100, if Even (nums i) then 1 else 0) = min_even) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_162872", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "ee203fc651cd310d94a12dd59478adb5572c7bc2797d5ef706138fe56fd65911", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_162872__ee203fc651cd310d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_162872", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_163329__9bdcf1384ee174c4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (P : Fin n → EuclideanSpace ℝ (Fin 2))\n (A B : EuclideanSpace ℝ (Fin 2)) (M : EuclideanSpace ℝ (Fin 2))\n (hM : ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ M = (1 - t) • A + t • B) :\n (∑ i : Fin n, dist (P i) M) ≤ max (∑ i : Fin n, dist (P i) A) (∑ i : Fin n, dist (P i) B) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_163329", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "9bdcf1384ee174c46a0adc3945ed4602b8871b1b9bfed8d1a833de8476e40d8d", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_163329__9bdcf1384ee174c4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_163329", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_163543__e6e174792fb9cefc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n Set.Infinite {n : ℕ | n > 0 ∧\n (2553 : ℤ) ∣ (2 * 10^(n+1) + (5 * (10^n - 1) / 9) * 10 + 3 : ℤ)} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_163543", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "e6e174792fb9cefc32a3b3496912a1f11d8907e95a40c4b48fd697df39889e91", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_163543__e6e174792fb9cefc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_163543", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_1636__08f30ab3ea41a70d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∃ (a : Fin 14 → ℕ+),\n 2008 * (∏ i, (a i : ℕ)) = ∏ i, ((a i : ℕ) + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_1636", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "08f30ab3ea41a70d2959fd50e187a46662aee2ab8308b36bab234751c281c038", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_1636__08f30ab3ea41a70d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_1636", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_16498__9644cafcf24ec83c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (p : Polynomial ℝ) (r₁ r₂ r₃ : ℝ),\n p.degree = 3 →\n r₁ ∈ Set.Ioo 0 1 → r₂ ∈ Set.Ioo 0 1 → r₃ ∈ Set.Ioo 0 1 →\n r₁ ≠ r₂ ∧ r₂ ≠ r₃ ∧ r₁ ≠ r₃ →\n (p = (Polynomial.X - Polynomial.C r₁) * (Polynomial.X - Polynomial.C r₂) * (Polynomial.X - Polynomial.C r₃)) →\n ∀ (coeffs : List ℝ), coeffs.length = 4 →\n (∃ (σ : Equiv.Perm (Fin 4)), ∀ i : Fin 4, coeffs[i]! = p.coeff (σ i)) →\n ∃! (s : ℝ), s ∈ Set.Ioo 0 1 ∧ (Polynomial.X - Polynomial.C r₁) * (Polynomial.X - Polynomial.C r₂) * (Polynomial.X - Polynomial.C s) = p := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_16498", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "d5c8857a09795e98f1380078a42c9c3f02d482c1ea0f7872f696f72985c63410", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_16498__9644cafcf24ec83c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_16498", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_165714__6d53ff5e0d2b5312", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (Polynomial.coeff (((1 : Polynomial ℤ) - (2 : Polynomial ℤ) * Polynomial.X)^5 * ((1 : Polynomial ℤ) + (3 : Polynomial ℤ) * Polynomial.X)^4) 1) = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_165714", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "6d53ff5e0d2b53127e15960b8a7372efd1dac3fe1860a73f4c8ed716dafdbe4f", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_165714__6d53ff5e0d2b5312", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_165714", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_166118__e032ed08b069918a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ)\n (hf_diff : DifferentiableOn ℝ f (Set.Ici 0))\n (hf_ineq : ∀ x ≥ 0, f x + deriv f x > 0)\n (hf_init : f 0 = 1) :\n ∀ x > 0, f x > Real.exp (-x) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_166118", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "e032ed08b069918af2b3276757ccdd4035d5340d2d15fbdc7e2748bb1b9c6727", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_166118__e032ed08b069918a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_166118", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_16615__3a8ae008e9f2313c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∫ x : ℝ in Set.Icc (0 : ℝ) (2 : ℝ), ((4 : ℝ) * x - x^3) = (4 : ℝ) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_16615", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "3a8ae008e9f2313c822ecccd69a4c176c0382348d9e686c790eed44d26b7e82d", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_16615__3a8ae008e9f2313c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_16615", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_167064__8b1724b205d17f66", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ)\n (h_diff : DifferentiableOn ℝ f (Set.Ioi 0))\n (h_eq : ∀ x ∈ Set.Ioi 0, deriv f x = (3 / x) * f x)\n (h_nonzero : f (2^2016) ≠ 0) :\n f (2^2017) / f (2^2016) = 8 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_167064", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "8b1724b205d17f6649d08847e33161766a301577c24647deb1a7b35c0f072877", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_167064__8b1724b205d17f66", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_167064", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_1676__c2461db43b98073c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ¬∃ (f : ℤ → {x : ℕ // x ∈ ({1, 2, 3} : Set ℕ)}),\n ∀ x y : ℤ, (Int.natAbs (x - y) ∈ ({2, 3, 5} : Set ℕ)) → f x ≠ f y := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_1676", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "c2461db43b98073cebd4e197d1a1c36b8c9b209dea84ac9bf96d211aef0f0518", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_1676__c2461db43b98073c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_1676", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_17093__8ef78b600495b4e2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (S : Finset ℕ), S ⊆ Finset.Icc 1 2001 ∧\n (∀ a b c, a ∈ S → b ∈ S → c ∈ S → (a + b + c) % 21 = 0) ∧\n S.card = 95 ∧\n (∀ T : Finset ℕ, T ⊆ Finset.Icc 1 2001 →\n (∀ a b c, a ∈ T → b ∈ T → c ∈ T → (a + b + c) % 21 = 0) →\n T.card ≤ 95) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_17093", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "8ef78b600495b4e2726cd2ab94ef69fe695b67bcc976df6921ffde55945c7302", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_17093__8ef78b600495b4e2", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_17093", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_172353__fda0568e7e316869", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ)\n (h_odd : ∀ x, f (-x) = -f x)\n (h_symmetric : ∀ x, f (1 + x) = f (1 - x))\n (h_definition : ∀ x ∈ Set.Icc 0 1, f x = 2^x - 1) :\n f 2009 + f 2010 = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_172353", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "fda0568e7e316869bd0d8fad218019c00b4a9e4905fb3f8e862cadef239c151f", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_172353__fda0568e7e316869", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_172353", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_173424__491652d0d6eb9572", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (coeff : ℚ), coeff = 35 ∧\n (∀ x : ℝ, x > 0 →\n (x^(3/2 : ℝ) - x^(-1 : ℝ))^7 =\n (Finset.sum (Finset.range 8) fun k =>\n if k = 4 then coeff * x^(1/2 : ℝ) else 0) +\n (Finset.sum (Finset.range 8) fun k =>\n if k ≠ 4 then (Nat.choose 7 k : ℝ) * (-1)^k * x^((21 - 5*k)/2 : ℝ) else 0)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_173424", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "491652d0d6eb9572a339750e577eb476765b7f830bdc6604a2f706eed7b80ff8", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_173424__491652d0d6eb9572", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_173424", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_176331__74be89a811a5ceec", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (Nat.choose 25 6 + Nat.choose 25 7 = Nat.choose 26 7) ∧\n (Nat.choose 25 6 + Nat.choose 25 7 = Nat.choose 26 19) ∧\n (∀ k : ℕ, Nat.choose 25 6 + Nat.choose 25 7 = Nat.choose 26 k → k = 7 ∨ k = 19) ∧\n 7 + 19 = 26 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_176331", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "74be89a811a5ceece9065e624ce9ce807867735d7f058839304f0f41fa45bcbb", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_176331__74be89a811a5ceec", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_176331", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_177__34d108c9cd61d943", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (∃ (a b : ℕ → ℝ),\n (∃ L₁ L₂ : ℝ, L₁ ≠ L₂ ∧\n Filter.Tendsto a Filter.atTop (nhds L₁) ∧\n Filter.Tendsto b Filter.atTop (nhds L₂) ∧\n Filter.Tendsto (fun n => a n + b n) Filter.atTop (nhds 2))) ∧\n (∃ (a b : ℕ → ℝ),\n (¬ ∃ L₁ : ℝ, Filter.Tendsto a Filter.atTop (nhds L₁)) ∧\n (¬ ∃ L₂ : ℝ, Filter.Tendsto b Filter.atTop (nhds L₂)) ∧\n Filter.Tendsto (fun n => a n + b n) Filter.atTop (nhds 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_177", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "34d108c9cd61d943bde7a3ff62d591110c563a62686bf3e40ef71a47e09777d5", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_177__34d108c9cd61d943", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_177", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_17984__66e6b91b44954e2e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (P Q R M : EuclideanSpace ℝ (Fin 2))\n (h1 : dist P Q = 13)\n (h2 : dist P R = 13)\n (h3 : dist Q R = 24)\n (h4 : M = (1/2 : ℝ) • Q + (1/2 : ℝ) • R) :\n dist P M = 5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_17984", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "66e6b91b44954e2ec2a8505d6d8169f5b87bc1a8ec222ee1588fd74b02ee5c51", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_17984__66e6b91b44954e2e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_17984", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_180042__144d72f07e3784c6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (a : Fin 2018 → ℕ),\n (∀ i j : Fin 2018, i < j → a i < a j) →\n (∀ i : Fin 2018, 0 < a i) →\n (∑ i : Fin 2018, a i) = 2018^2018 →\n (∑ i : Fin 2018, (a i)^3) % 6 = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_180042", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "144d72f07e3784c61d87fcffaf820ab8e92771c9d4a29dbcfd9ad99f05c01fee", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_180042__144d72f07e3784c6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_180042", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_181561__995e77e4984e8e28", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (q : Fin n → ℕ)\n (hn : n ≥ 2)\n (hprime : ∀ i, Nat.Prime (q i))\n (hdistinct : Function.Injective q) :\n (∏ i, (q i : ℝ)^3 + 1) / (∏ i, (q i : ℝ)^3 - 1) < 36 / 25 := by sorry", "target_workspace": {"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"}, "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_181561", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "995e77e4984e8e28a7b911552782da68d9a60b39a26d743bdfdd8f6906d050a0", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_181561__995e77e4984e8e28", "metadata": {"split": "train", "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_181561", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_181616__3d3f5282b4344602", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (A B C D E F G P Q : ℝ × ℝ),\n\n A = (0, 0) ∧ B = (5, 0) ∧ C = (5, 4) ∧ D = (0, 4) ∧\n\n E = (4, 0) ∧\n\n G = (5, 3) ∧\n\n F = (2, 4) ∧\n\n (∃ t s : ℝ, P = A + t • (C - A) ∧ P = E + s • (F - E)) ∧\n\n (∃ u v : ℝ, Q = A + u • (G - A) ∧ Q = E + v • (F - E)) ∧\n\n dist P Q / dist E F = 10 / 91 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_181616", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "3d3f5282b43446022812c3a7664cb629b53e4d60443e42576a51eb9616b95104", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_181616__3d3f5282b4344602", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_181616", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_1835__2ca240ec11a5763b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (x t : Fin n → ℝ) (h : ∑ i, x i = 0) :\n ∑ i, ∑ j, (t i - t j)^2 * x i * x j ≤ 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_1835", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "2ca240ec11a5763ba39dfeb78ebe8fa7f5e084742e003c749c86039a166f7f59", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_1835__2ca240ec11a5763b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_1835", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_193305__a38c5a78cca8ce57", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [FiniteDimensional ℝ V]\n (A B C : V) (hABC : ¬ Collinear ℝ {A, B, C}) :\n ∃ (F G E : V),\n (∃ t : ℝ, t = 1/3 ∧ F = (1 - t) • A + t • C) ∧\n G = (1/2 : ℝ) • B + (1/2 : ℝ) • F ∧\n (∃ u v : ℝ, E = (1 - u) • B + u • C ∧ E = (1 - v) • A + v • G) ∧\n (∃ s : ℝ, s = 1/4 ∧ E = (1 - s) • B + s • C) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_193305", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "a38c5a78cca8ce578a72d22256b08a4b986a1bf88c34ed6533af0e9c42572ac7", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_193305__a38c5a78cca8ce57", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_193305", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_194348__d2442af6cf578d83", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ a : ℝ, a > 0 ∧ a ≠ 1 →\n (∀ x ∈ Set.Icc 0 1, 2 - a * x > 0) →\n (∀ x ∈ Set.Icc 0 1, deriv (fun x => Real.logb a (2 - a * x)) x < 0) →\n a ∈ Set.Ioo 1 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_194348", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "d2442af6cf578d836109888f1c0ca99fd1ea8cb041e945850a73443e397bd0bb", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_194348__d2442af6cf578d83", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_194348", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_1954__20441a704fe2956d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∃ f : ℝ → ℝ,\n (∀ x ∈ Set.Icc 0 1, f x ∈ Set.Icc 0 1) ∧\n (∃ lam ∈ Set.Ioo 0 1, f lam ∉ ({0, lam} : Set ℝ)) ∧\n (∀ x y : ℝ, x ∈ Set.Icc 0 1 → y ∈ Set.Icc 0 1 → f x + y ∈ Set.Icc 0 1 →\n f (f x + y) = f x + f y) ∧\n (∃ x ∈ Set.Icc 0 1, (f^[19]) x = (f^[98]) x) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_1954", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "20441a704fe2956dd0665cef6a80ba35c71216ebdbabf367b763f4aef5967d35", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_1954__20441a704fe2956d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_1954", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_1957__32016ac514b0187c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (stones : Fin 10 → Fin 14 → ℕ)\n (h_rows : ∀ i : Fin 10, Odd (∑ j : Fin 14, stones i j))\n (h_cols : ∀ j : Fin 14, Odd (∑ i : Fin 10, stones i j)) :\n Even (∑ i : Fin 10, ∑ j : Fin 14, if (i.val + j.val) % 2 = 0 then stones i j else 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_1957", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "32016ac514b0187cb7d6db0ee8b128fda7aed33be6d39c7d77b2b0c7585bd030", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_1957__32016ac514b0187c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_1957", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_19983__f49332e60534340c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ) (hf_diff : DifferentiableOn ℝ f (Set.Ioi 0))\n (h_eq : ∀ x ∈ Set.Ioi 0, f x = 2 * x * (deriv (deriv f) 1) + Real.log x) :\n deriv (deriv f) 1 = -1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_19983", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "f49332e60534340c11231ca7aab2c854e67acaf97cc530f89da55593d34848f2", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_19983__f49332e60534340c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_19983", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_200888__2a01969b0cc6f358", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (input_flow : Fin 20 → ℝ) (output_flow : Fin 20 → ℝ)\n (warehouse_inventory : ℝ → ℝ),\n (∀ i, input_flow i > 0) ∧\n (∀ j, output_flow j > 0) ∧\n warehouse_inventory 0 = 8 ∧\n (∃ (input_active_0_2 output_active_0_2 : Finset (Fin 20)),\n input_active_0_2.card = 14 ∧\n output_active_0_2.card = 12 ∧\n (∀ t ∈ Set.Icc 0 2,\n warehouse_inventory t = 8 + (input_active_0_2.sum input_flow) * t - (output_active_0_2.sum output_flow) * t)) ∧\n (∃ (input_active_4_5 output_active_4_5 : Finset (Fin 20)),\n input_active_4_5.card = 6 ∧\n output_active_4_5.card = 6 ∧\n (∀ t ∈ Set.Icc 4 5,\n warehouse_inventory t = warehouse_inventory 4 + (input_active_4_5.sum input_flow) * (t - 4) - (output_active_4_5.sum output_flow) * (t - 4))) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_200888", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "2a01969b0cc6f358e47a31fb02be9fffb92af8776192c9fc96595886753e183e", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_200888__2a01969b0cc6f358", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_200888", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_200942__267066e6a8ba9a60", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∫ x in Set.Icc (0 : ℝ) 3, (x - (x^2 - 2*x)) = 9/2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_200942", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "267066e6a8ba9a6053de8b5df93792fad04a13428d558386026aadb4ed788f1a", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_200942__267066e6a8ba9a60", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_200942", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_201646__d5d0b7fbcb36800f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (a : ℝ) (h : (deriv (fun x => 2 * x^3 + a * x^2 + 36 * x - 24)) 2 = 0) :\n ∃ (I : Set ℝ), I = Set.Ioi 3 ∧ ∀ x ∈ I, (deriv (fun x => 2 * x^3 + a * x^2 + 36 * x - 24)) x > 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_201646", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "d5d0b7fbcb36800f1511536e7c5f404253a55c0f5a884e7e8703675019d6659c", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_201646__d5d0b7fbcb36800f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_201646", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_203222__b4607fa8a8f666bb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n Polynomial.coeff ((1 + 2 * Polynomial.X - 3 * Polynomial.X^2)^6 : Polynomial ℤ) 5 = -168 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_203222", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "b4607fa8a8f666bbe8fceddf7404227a1c0bad63517c2a76d69a893460a6594c", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_203222__b4607fa8a8f666bb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_203222", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_2053__b45e16ab3465596c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (languages : Finset ℕ) (h_n : languages.card = n)\n (people : Type*) [Fintype people] (speaks : people → ℕ → Bool)\n (A : ℕ → Set people) (B : ℕ → Set people)\n (h_A : ∀ k, A k = {p | (languages.filter (fun l => speaks p l)).card ≥ k})\n (h_B : ∀ k, B k = {p | ∀ S : Finset ℕ, S ⊆ languages → S.card = k → ∃ l ∈ S, speaks p l}) :\n (∀ k, 1 ≤ k ∧ k ≤ n → 2 * k ≥ n + 1 → A k ⊆ B k) ∧ (∀ k, 1 ≤ k ∧ k ≤ n → 2 * k ≤ n + 1 → B k ⊆ A k) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_2053", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "b45e16ab3465596c19d50c8881a9961cddaf8570aef76bc21806cbecd63e14ed", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_2053__b45e16ab3465596c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_2053", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_205756__cefa11a1988b8dbc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (Polynomial.coeff ((1 - 3 * Polynomial.X^3)^6 : Polynomial ℤ) 6) = 135 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_205756", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "cefa11a1988b8dbc3753a8a77ea89f82af6d16e5d8f19fe9c5d09c92d22a0d93", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_205756__cefa11a1988b8dbc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_205756", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_209590__6c474e5f8a20b71e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ)\n (h_period : ∀ x, f (x + 2) = f x)\n (h_minimal_period : ∀ T > 0, (∀ x, f (x + T) = f x) → T ≥ 2)\n (h_definition : ∀ x ∈ Set.Ico 0 2, f x = x^3 - x) :\n ∃! S : Finset ℝ, (∀ x ∈ S, x ∈ Set.Icc 0 6 ∧ f x = 0) ∧ S.card = 7 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_209590", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "6c474e5f8a20b71ec6e6ec0be456cecb5e7f41012c1c548c8bd3c323fadd0920", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_209590__6c474e5f8a20b71e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_209590", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_210__a998ab9a656c6344", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ a b : ℕ,\n a + b = 29 ∧\n ((Nat.card (Nat.divisors a) = 2 ∧ Nat.card (Nat.divisors b) = 5) ∨\n (Nat.card (Nat.divisors a) = 5 ∧ Nat.card (Nat.divisors b) = 2)) ∧\n (Finset.sum (Nat.divisors a) id + Finset.sum (Nat.divisors b) id = 45) →\n ((a = 13 ∧ b = 16) ∨ (a = 16 ∧ b = 13)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_210", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "a998ab9a656c6344923823ef4ee3f0a423b152d2dca12e5d27f002187335c041", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_210__a998ab9a656c6344", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_210", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_212165__0aea02d448223422", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (P : ℕ → Fin 4 → Fin 4 → ℚ),\n (∀ n : ℕ, ∀ i j : Fin 4, P n i j ≥ 0) ∧\n (∀ n : ℕ, ∀ i : Fin 4, ∑ j : Fin 4, P n i j = 1) ∧\n (∀ i j : Fin 4, P 0 i j = if i = j then 1 else 0) ∧\n (∀ n : ℕ, ∀ i j : Fin 4, P (n + 1) i j =\n ∑ k : Fin 4, P n i k * (if j = k then 0 else 1/3)) ∧\n P 8 0 0 = 547 / 2187 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_212165", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "0aea02d448223422e80a5343a9000cf0a15dff434572323ae898c0abbd8e50f9", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_212165__0aea02d448223422", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_212165", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_221153__fe902f3fc85b3df5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ)\n (h_domain : ∀ x, x ∉ Set.Icc (-2) 2 → f x = 0)\n (h_increasing : ∀ x y, x ∈ Set.Icc (-2) 2 → y ∈ Set.Icc (-2) 2 → x < y → f x < f y)\n : ∀ m, (1 - m) ∈ Set.Icc (-2) 2 ∧ m ∈ Set.Icc (-2) 2 ∧ f (1 - m) < f m → m ∈ Set.Ioo (1/2) 2 ∪ {2} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_221153", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "fe902f3fc85b3df581a0d0d8bd793c86f45485b23737cab4c736a9f3b6874ca5", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_221153__fe902f3fc85b3df5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_221153", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_221766__740142b1b18f372c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (∀ f : ℝ → ℝ, f (-1) < f 1 → ¬(∀ x y, x ∈ Set.Icc (-2) 2 → y ∈ Set.Icc (-2) 2 → x ≤ y → f y ≤ f x)) ∧\n (∃ f : ℝ → ℝ, f (-1) = f 1 ∧ ¬(∀ x, f (-x) = f x)) ∧\n (∃ f : ℝ → ℝ, f (-1) * f 1 < 0 ∧ ¬(∃ x ∈ Set.Ioo (-1) 1, f x = 0)) ∧\n (∃ f : ℝ → ℝ, (∀ x, |f x| = |f (-x)|) ∧ ¬((∀ x, f (-x) = f x) ∨ (∀ x, f (-x) = -f x))) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_221766", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "740142b1b18f372c4d7a2877eef92478b76f509be92b15775e1bda5b67c1a0e9", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_221766__740142b1b18f372c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_221766", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_223063__bb57ddc431fa9b01", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (A B C D E F : ℝ × ℝ) (r_A r_B r_C r_D r_E r_F : ℝ) (p q : ℕ),\n r_A = 15 ∧ r_B = 5 ∧ r_C = 3 ∧ r_D = 3 ∧\n\n\n dist A B = r_A - r_B ∧\n dist A C = r_A - r_C ∧\n dist A D = r_A - r_D ∧\n\n dist B C = dist C D ∧ dist C D = dist D B ∧\n\n\n dist B E = r_B + r_E ∧\n dist C E = r_C + r_E ∧\n dist D E = r_D + r_E ∧\n dist B F = r_B - r_F ∧\n dist E F = r_E + r_F ∧\n\n r_E = (p : ℝ) / (q : ℝ) ∧ Nat.gcd p q = 1 ∧ p > 0 ∧ q > 0 ∧\n\n (p : ℝ) + (q : ℝ) + r_F = 16 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_223063", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "bb57ddc431fa9b01f485141f19fa982c19f70c476506121dcf012e5544f6be00", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_223063__bb57ddc431fa9b01", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_223063", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_224321__3f3614419fac9ea9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : (Polynomial.coeff ((1 + 2 * Polynomial.X : Polynomial ℤ) ^ 5) 2) = 40 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_224321", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "3f3614419fac9ea9f097a3298fb8f4d8b00d59e5278ba7b24b27b10028ef9044", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_224321__3f3614419fac9ea9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_224321", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_226587__06aee3e7e3004e6d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (k : ℕ) (hk : k > 0) :\n ∃ (n : ℕ) (R : ℕ → ℕ → Prop),\n n > k ∧\n (∀ i j : ℕ, i < n → j < n → i ≠ j → (R i j ∨ R j i) ∧ ¬(R i j ∧ R j i)) ∧\n (∀ A : Finset ℕ, A ⊆ Finset.range n → A.card = k →\n ∃ i : ℕ, i < n ∧ ∀ j ∈ A, R i j) := by sorry", "target_workspace": {"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"}, "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_226587", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "06aee3e7e3004e6dc15548598d2d2812d2c511aaf9326bafbcbe0f1ec81648d5", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_226587__06aee3e7e3004e6d", "metadata": {"split": "train", "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_226587", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_226730__d102354ccf230d5f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n Set.Infinite {n : ℕ | 50^n + (50*n + 1)^50 > 1 ∧ ¬ Nat.Prime (50^n + (50*n + 1)^50)} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_226730", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "d102354ccf230d5f248ce0bc4312eb36ac81a953bf00929e72d5d1945a160d1e", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_226730__d102354ccf230d5f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_226730", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_226886__4846e0a3c4576221", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (A : Fin 3 → Fin 3 → ℤ)\n (h : ∀ i j : Fin 3, (∑ x : Fin 3, A i x) = (∑ x : Fin 3, A j x) ∧\n (∑ x : Fin 3, A i x) = (∑ x : Fin 3, A x i) ∧\n (∑ x : Fin 3, A x x) = (∑ x : Fin 3, A x (2 - x))) :\n 3 ∣ (∑ i : Fin 3, ∑ j : Fin 3, A i j) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_226886", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "4846e0a3c4576221033896ad464cc659e9f0ad6429c1df6437ff4b57f840aa87", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_226886__4846e0a3c4576221", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_226886", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_227423__b51a40e3f0addad3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∃ (v : Fin 8 → ℕ),\n (∀ i j : Fin 8, i ≠ j → v i ≠ v j) ∧\n (∑ i : Fin 8, v i) = (Nat.gcd (v 0) (v 1) + Nat.gcd (v 0) (v 2) + Nat.gcd (v 0) (v 4) +\n Nat.gcd (v 1) (v 3) + Nat.gcd (v 1) (v 5) + Nat.gcd (v 2) (v 3) +\n Nat.gcd (v 2) (v 6) + Nat.gcd (v 3) (v 7) + Nat.gcd (v 4) (v 5) +\n Nat.gcd (v 4) (v 6) + Nat.gcd (v 5) (v 7) + Nat.gcd (v 6) (v 7)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_227423", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "b51a40e3f0addad30766be1f21be9bdf910a4e723dc6d4e8ba8d5dcbf12db481", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_227423__b51a40e3f0addad3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_227423", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_227863__202534a3bddc5860", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (p : Fin 24 → ℕ)\n (h_prime : ∀ i, Nat.Prime (p i))\n (h_ge : ∀ i, p i ≥ 5) :\n 24 ∣ (∑ i, (p i)^2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_227863", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "202534a3bddc5860dfe5ee52e882fab58f5ba1d6bde38ae665803338bdaee23c", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_227863__202534a3bddc5860", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_227863", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_22852__46b41bf73687347b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ) (hf_diff : Differentiable ℝ f)\n (hf_eq : ∀ x, f x = x^2 + 2 * (deriv f 2) * x + 3) :\n ∫ x in (0 : ℝ)..(3 : ℝ), f x = -18 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_22852", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "46b41bf73687347bf8e25b033c30dc47688dd6237b2dd2cd9e7ee8d2ccfe36c6", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_22852__46b41bf73687347b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_22852", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_229144__968fac4c12009453", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (∃ n : ℕ, n > 0 ∧ 18 ∣ n ∧ (∃ d : ℕ, d ∈ ({1, 2, 3, 4, 5, 6, 7, 8, 9} : Set ℕ) ∧\n ∃ k : ℕ, k > 0 ∧ n = d * (10^k - 1) / 9)) ∧\n (∀ m : ℕ, m > 0 ∧ 18 ∣ m ∧ (∃ d : ℕ, d ∈ ({1, 2, 3, 4, 5, 6, 7, 8, 9} : Set ℕ) ∧\n ∃ k : ℕ, k > 0 ∧ m = d * (10^k - 1) / 9) → 666 ≤ m) ∧\n (∃ d : ℕ, d ∈ ({1, 2, 3, 4, 5, 6, 7, 8, 9} : Set ℕ) ∧\n ∃ k : ℕ, k > 0 ∧ 666 = d * (10^k - 1) / 9) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_229144", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "968fac4c12009453d8e12a450cd74f85315158c9efff9b587d5cae62ef9c9126", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_229144__968fac4c12009453", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_229144", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_229211__81429fa09736267a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (stickers_received : Fin 26 → ℕ),\n (∀ i : Fin 26, stickers_received i ≤ 26) →\n (∀ k : ℕ, 1 ≤ k ∧ k ≤ 26 →\n (Finset.filter (fun i => stickers_received i ≥ k) (Finset.univ : Finset (Fin 26))).card = 27 - k) →\n (Finset.sum (Finset.univ : Finset (Fin 26)) stickers_received) = 351 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_229211", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "81429fa09736267a64b52214e9a62a068a1f18fca891fcb697519d7c0b51339e", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_229211__81429fa09736267a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_229211", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_229448__73866e08907cdfc1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∃ (edge_to_number : Fin 12 → ℕ),\n (∀ i : Fin 12, edge_to_number i ∈ ({1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12} : Set ℕ)) ∧\n (∀ i j : Fin 12, i ≠ j → edge_to_number i ≠ edge_to_number j) ∧\n (∃ (face_edges : Fin 6 → Finset (Fin 12)),\n (∀ face : Fin 6, (face_edges face).card = 4) ∧\n (∀ face : Fin 6, (face_edges face).sum edge_to_number = 26)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_229448", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "73866e08907cdfc16875f408610b7a06dbe7100b48a83458fa4a476b328f236c", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_229448__73866e08907cdfc1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_229448", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_230972__efc797f8407a1492", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (∀ (guests : ℕ) (consumption : Fin guests → ℝ),\n (∀ i, consumption i ≤ 2) →\n (∑ i, consumption i) = 319 →\n guests ≥ 160) ∧\n (∃ (consumption : Fin 160 → ℝ),\n (∀ i, consumption i ≤ 2) ∧\n (∑ i, consumption i) = 319) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_230972", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "efc797f8407a14929ca90cdfa53386771dded71012bad611de0dcbe313609453", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_230972__efc797f8407a1492", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_230972", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_234641__7a6eb9a05a288d1b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∫ x in Set.Icc (-1 : ℝ) 1, ((2 : ℝ) - 2 * x^2) - (x^2 - 1) = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_234641", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "7a6eb9a05a288d1b9482340ea05b5e31d44c2de55fb494d205dd9c5d08590ab2", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_234641__7a6eb9a05a288d1b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_234641", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_23766__523ff6400c88bc6c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (A B C D E F G : EuclideanSpace ℝ (Fin 2)) (center : EuclideanSpace ℝ (Fin 2)) (radius : ℝ),\n\n dist A B = 26 ∧ dist B C = 26 ∧ dist C A = 26 ∧\n\n dist center A = radius ∧ dist center B = radius ∧ dist center C = radius ∧\n\n dist center D = radius ∧ dist center E = radius ∧\n\n ∃ k : ℝ, (E - D) = k • (C - B) ∧\n\n (∃ t : ℝ, F = D + t • (E - D)) ∧\n (∃ s : ℝ, G = D + s • (E - D)) ∧\n (∃ u : ℝ, F = A + u • (B - A) ∧ u > 1) ∧\n (∃ v : ℝ, G = A + v • (C - A) ∧ v > 1) ∧\n\n (∃ m : ℕ+, ‖F - A‖ = m) ∧ (∃ n : ℕ+, ‖F - D‖ = n) ∧\n\n ‖E - D‖ = 16 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_23766", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "523ff6400c88bc6c8e4316736c7ad747b67bc3c70a23eaafadba5dd9b012c540", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_23766__523ff6400c88bc6c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_23766", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_238467__581963ebafe3a298", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ m : ℝ, (∀ x : ℝ, x^2 + 2*x + m ≥ -1) →\n (∃ x₀ : ℝ, x₀^2 + 2*x₀ + m = -1) →\n ∫ x in (1 : ℝ)..(2 : ℝ), (x^2 + 2*x + m) = 16/3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_238467", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "581963ebafe3a298dc1f26502b0852a3a0507f8a8b30ff8ff95918bb86d3b9cb", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_238467__581963ebafe3a298", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_238467", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_241444__21923fdeb20ea3f7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (¬ (Set.ncard ({2, 3, 4, 2} : Set ℕ) = 4)) ∧\n (({0} : Set ℕ) = {0}) ∧\n (¬ (({1, 2, 3} : Set ℕ) ≠ ({3, 2, 1} : Set ℕ))) ∧\n (¬ Set.Finite {q : ℚ | 0 < q ∧ q < 1}) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_241444", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "21923fdeb20ea3f7d67497cf68a2b1fcb84a191530328fb3e638d9b4a692b9e1", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_241444__21923fdeb20ea3f7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_241444", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_242232__fd232296f470a5b4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (visible_faces : Finset ℕ),\n visible_faces ⊆ {1, 2, 3, 4, 5, 6} →\n visible_faces.card = 5 →\n 12 ∣ (visible_faces.prod id) ∧\n ∀ n : ℕ, n > 12 → ∃ (counterexample : Finset ℕ),\n counterexample ⊆ {1, 2, 3, 4, 5, 6} ∧\n counterexample.card = 5 ∧\n ¬(n ∣ (counterexample.prod id)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_242232", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "fd232296f470a5b427df66a8f754977553917635505bc0a22239fe2832d36d0e", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_242232__fd232296f470a5b4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_242232", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_242444__08a875ee811b48ac", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n sSup {s : ℝ | ∃ (x : Fin 9 → ℝ), (∀ i, x i ∈ Set.Icc (-1) 1) ∧ (∑ i, (x i)^3 = 0) ∧ (s = ∑ i, x i)} = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_242444", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "08a875ee811b48ac9a5101e7692dd3198e662d900703f6ea50d3eb70deba03f2", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_242444__08a875ee811b48ac", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_242444", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_242532__c280e79ca97d6eb2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∃ (f : ℝ → ℝ) (a : ℝ),\n Continuous f ∧\n ∀ x : ℝ, ∫ t in (0)..(x), f t = Real.exp x - a * Real.exp (2 * x) * ∫ t in (0)..(1), f t * Real.exp (-t) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_242532", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "c280e79ca97d6eb239946ef1eb598825636b48813a5b30c31833ec250f2a9f9a", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_242532__c280e79ca97d6eb2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_242532", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_242587__0bc44242fda07f28", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (A B C : ℝ × ℝ) (square_vertices : Fin 4 → ℝ × ℝ) (r₁ r₂ r₃ : ℝ) (p q : ℕ),\n\n dist A C = 5 ∧ dist B C = 4 ∧ dist A B = 3 ∧\n\n (∃ (s : ℝ), s > 0 ∧\n\n (∀ i : Fin 4, dist (square_vertices i) (square_vertices (i + 1)) = s) ∧\n\n (∃ t₁ t₂ : ℝ, 0 ≤ t₁ ∧ t₁ ≤ 1 ∧ 0 ≤ t₂ ∧ t₂ ≤ 1 ∧\n square_vertices 0 = (1 - t₁) • A + t₁ • C ∧\n square_vertices 1 = (1 - t₂) • A + t₂ • C) ∧\n\n (∃ t₃ t₄ : ℝ, 0 ≤ t₃ ∧ t₃ ≤ 1 ∧ 0 ≤ t₄ ∧ t₄ ≤ 1 ∧\n square_vertices 2 = (1 - t₃) • A + t₃ • B ∧\n square_vertices 3 = (1 - t₄) • B + t₄ • C)) ∧\n\n r₁ > 0 ∧ r₂ > 0 ∧ r₃ > 0 ∧\n\n (1 / r₁ + 1 / r₂ + 1 / r₃ = (p : ℝ) / (q : ℝ)) ∧\n Nat.gcd p q = 1 ∧\n q > 0 ∧\n\n p + q = 14 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_242587", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "0bc44242fda07f28c844f413db10f60f3db299d90f67293f9ff0a9a7a8d7bb6e", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_242587__0bc44242fda07f28", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_242587", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_243655__622d34e2c4047f4a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n abs (∫ x in (-1 : ℝ)..0, (-x^3 + x^2 + 2*x)) + ∫ x in (0 : ℝ)..2, (-x^3 + x^2 + 2*x) = 37/12 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_243655", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "622d34e2c4047f4a97b6a208f017bb1198ba830d66c482697a3491ec4a713359", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_243655__622d34e2c4047f4a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_243655", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_246631__3200bdde2bf8bf49", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (hn : n > 0) (x : Fin n → ℝ) :\n (∀ k : ℕ, 1 ≤ k ∧ k ≤ n → ∑ i : Fin n, (x i) ^ k = n) →\n ∀ i : Fin n, x i = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_246631", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "3200bdde2bf8bf4957732dcee0e7bddcb2becab044f422dca0e3f30fc18814d0", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_246631__3200bdde2bf8bf49", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_246631", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_248959__2cb469ea7b5f6ebf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (hn : n > 0) (x : Fin n → ℝ)\n (h_sum : ∑ i, x i = 0)\n (h_sum_sq : ∑ i, (x i)^2 = 1) :\n ∃ i j, i ≠ j ∧ x i * x j ≤ -(1 : ℝ) / n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_248959", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "2cb469ea7b5f6ebf4bfe87743ab0c045b1df3d527fe402f94230df918aa326f9", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_248959__2cb469ea7b5f6ebf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_248959", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_249171__dfa68ee6c758a785", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (P : ℕ → ℝ),\n (∀ n : ℕ, n ≥ 7 → P n = 0) ∧\n (∀ n : ℕ, 1 ≤ n ∧ n ≤ 6 → P n = (1/2)^n * P 0) ∧\n (∑' n : ℕ, P n = 1) ∧\n P 0 = 64/127 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_249171", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "dfa68ee6c758a785a89111925d74e07f392301eaa8afee3e174ed1cb5cb99627", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_249171__dfa68ee6c758a785", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_249171", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_251525__06b019be02b9ba03", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (a : ℕ) (ha : 0 < a) :\n ∃ (min_n : ℕ), min_n > 0 ∧\n (∀ (X : Finset ℕ), X.Nonempty → (∀ x ∈ X, 0 < x) →\n (∀ p : ℕ, 1 ≤ p ∧ p ≤ a → ∃ A ⊆ X, A.sum id = p) →\n X.card ≥ min_n) ∧\n (∃ (X : Finset ℕ), X.Nonempty ∧ (∀ x ∈ X, 0 < x) ∧\n (∀ p : ℕ, 1 ≤ p ∧ p ≤ a → ∃ A ⊆ X, A.sum id = p) ∧\n X.card = min_n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_251525", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "06b019be02b9ba031caf5672a1b85fdde23738a1e53d162b5e6012246d491e8a", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_251525__06b019be02b9ba03", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_251525", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_251743__f156301bb1cc2af4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (A B C D E : ℝ × ℝ) (parabola : ℝ → ℝ),\n\n A.1 = 0 ∧ B.2 = 0 ∧ C.2 = 0 ∧\n\n dist (0, 0) A = 8 ∧\n\n dist A B = dist A C ∧\n\n (∃ (angle_ABC : ℝ), Real.sin angle_ABC = 4/5) ∧\n\n (∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ D = (1 - t) • A + t • B) ∧\n\n E.1 = 0 ∧ (∃ s : ℝ, E = (1 - s) • C + s • D) ∧\n\n abs (C.1 * (0 - E.2) + 0 * (E.2 - 0) + E.1 * (0 - C.2)) / 2 =\n abs (A.1 * (D.2 - E.2) + D.1 * (E.2 - A.2) + E.1 * (A.2 - D.2)) / 2 ∧\n\n (∀ x : ℝ, parabola x = (2/27) * x^2 - 8/3) ∧\n parabola B.1 = B.2 ∧ parabola C.1 = C.2 ∧ parabola E.1 = E.2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_251743", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "f156301bb1cc2af4dcadb8cd4d94d48d6ad70c56c9d518a59bc93c8bb575bbae", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_251743__f156301bb1cc2af4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_251743", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_2593__2e4dfd7cf84ef9c1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (stones : Fin 10 → Fin 14 → ℕ)\n (row_odd : ∀ i : Fin 10, Odd (∑ j : Fin 14, stones i j))\n (col_odd : ∀ j : Fin 14, Odd (∑ i : Fin 10, stones i j)) :\n Even (∑ i : Fin 10, ∑ j : Fin 14, if (i.val + j.val) % 2 = 0 then stones i j else 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_2593", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "2e4dfd7cf84ef9c1f7e98aeddf6e957d8730cb7846e486e9bd38a7ce516c6a1f", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_2593__2e4dfd7cf84ef9c1", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_2593", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_26851__077aad0c0011ad2d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ m : ℝ, (∀ x : ℝ, (deriv (fun x => Real.exp x - m * x + 1) x) ≠ -(1 / Real.exp 1)) ↔\n m ∈ Set.Iic (1 / Real.exp 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_26851", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "077aad0c0011ad2d853efb3f938b4a18e1afdf1b0746ad35e3d450caa0c5c0fa", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_26851__077aad0c0011ad2d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_26851", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_2729__a487da122e2598f8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (a : ℕ → ℝ) (h : Summable a) : Summable (fun n => if n = 0 then 0 else a n / n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_2729", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "a487da122e2598f8c18ba5a14875b39f3fbe7590d41e91d4a850ece9915edc78", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_2729__a487da122e2598f8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_2729", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_342__d91031dd2d7023f5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∃ (A B C D E F : ℝ × ℝ) (P : Set (ℝ × ℝ)) (r : ℝ),\n\n (∃ (center : ℝ × ℝ) (side_length : ℝ), side_length > 0 ∧\n\n A = center + (side_length, 0) ∧\n B = center + (side_length/2, side_length * Real.sqrt 3 / 2) ∧\n C = center + (-side_length/2, side_length * Real.sqrt 3 / 2) ∧\n D = center + (-side_length, 0) ∧\n E = center + (-side_length/2, -side_length * Real.sqrt 3 / 2) ∧\n F = center + (side_length/2, -side_length * Real.sqrt 3 / 2)) ∧\n\n (∃ (incenter : ℝ × ℝ), P = Metric.sphere incenter r ∧\n\n r > 0 ∧\n\n (A.1 - B.1) * (B.1 - D.1) + (A.2 - B.2) * (B.2 - D.2) = 0 ∧\n (B.1 - D.1) * (D.1 - E.1) + (B.2 - D.2) * (D.2 - E.2) = 0 ∧\n (D.1 - E.1) * (E.1 - A.1) + (D.2 - E.2) * (E.2 - A.2) = 0 ∧\n (E.1 - A.1) * (A.1 - B.1) + (E.2 - A.2) * (A.2 - B.2) = 0) ∧\n\n (Real.pi * r^2) / ((dist A B) * (dist B D)) = Real.pi * Real.sqrt 3 / 12 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_342", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "e1e6e3bc31673b6ba01106166a5a8493564628c34e25d2acc6e462fe3f08540d", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_342__d91031dd2d7023f5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_342", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_35130__c9c3e343120167c7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∃ (A B C D : ℝ × ℝ),\n dist A B = 8 ∧\n dist A C = 10 ∧\n dist B C = 10 ∧\n (∃ t : ℝ, t > 1 ∧ D = A + t • (B - A)) ∧\n dist C D = 12 ∧\n dist B D = 2 * Real.sqrt 15 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_35130", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "c9c3e343120167c78483454fc2462815bb0f7c9f3cf249ff0db233d3733ea691", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_35130__c9c3e343120167c7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_35130", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_3608__fa36e859066397ac", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (sunny_days overcast_days : Finset ℕ),\n sunny_days ∪ overcast_days = Finset.Icc 1 30 →\n sunny_days ∩ overcast_days = ∅ →\n sunny_days.card = 15 →\n overcast_days.card = 15 →\n (Finset.Icc 1 30).sum (fun d => (Finset.filter (fun s => s ≤ d) sunny_days).card) =\n overcast_days.sum id := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_3608", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "fa36e859066397aca8177e8866191bfb5f0c2e958a85d7a2e41370b7818fa6ca", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_3608__fa36e859066397ac", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_3608", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_3649__a384f15fdd3cdde4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (stones : Fin 10 → Fin 14 → ℕ),\n (∀ i : Fin 10, Odd (∑ j : Fin 14, stones i j)) →\n (∀ j : Fin 14, Odd (∑ i : Fin 10, stones i j)) →\n Even (∑ i : Fin 10, ∑ j : Fin 14, if (i.val + j.val) % 2 = 0 then stones i j else 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_3649", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "a384f15fdd3cdde48867e5cf67ca9f57939aabd2a4c485bd56885851ae946b40", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_3649__a384f15fdd3cdde4", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_3649", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_3691__4c9e6973f04dcf48", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (A : Finset (ℤ × ℤ)) :\n ∃ B : Finset (ℤ × ℤ), B ⊆ A ∧\n B.card ≥ (A.card + 3) / 4 ∧\n ∀ s₁ s₂ : ℤ × ℤ, s₁ ∈ B → s₂ ∈ B → s₁ ≠ s₂ →\n let (m₁, n₁) := s₁\n let (m₂, n₂) := s₂\n ({(m₁, n₁), (m₁ + 1, n₁), (m₁, n₁ + 1), (m₁ + 1, n₁ + 1)} : Finset (ℤ × ℤ)) ∩\n {(m₂, n₂), (m₂ + 1, n₂), (m₂, n₂ + 1), (m₂ + 1, n₂ + 1)} = ∅ := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_3691", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "4c9e6973f04dcf48ef1dcde752c0ec09d1d14ef6334543fb82b1f79f406a955d", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_3691__4c9e6973f04dcf48", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_3691", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_3709__f36be37c4aa39541", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (hn : n ≥ 2) (a : Fin n → ℝ)\n (ha : ∀ i, a i ∈ Set.Icc 0 2) :\n (∑ i : Fin n, ∑ j : Fin n, dist (a i) (a j)) ≤ n^2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_3709", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "f36be37c4aa39541fb7f0256af5dcc1d4d4145cab10b08ba95fdd7e4775f419f", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_3709__f36be37c4aa39541", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_3709", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_3827__9e16c8d69de9c0b8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (a b c : ℕ) (h : a^2 + b^2 = c^2) :\n (∃ x ∈ ({a, b, c} : Set ℕ), 3 ∣ x) ∧\n (∃ x ∈ ({a, b, c} : Set ℕ), 4 ∣ x) ∧\n (∃ x ∈ ({a, b, c} : Set ℕ), 5 ∣ x) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_3827", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "9e16c8d69de9c0b807accbef7e126cf4a55dc68d6edf32e35995408783936d01", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_3827__9e16c8d69de9c0b8", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_3827", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_3873__5fc258a11da76ce5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (hn : n ≥ 2) (x : Fin n → ℝ)\n (h1 : ∑ i, |x i| = 1)\n (h2 : ∑ i, x i = 0) :\n |∑ i, x i / (i.val + 1 : ℝ)| ≤ 1/2 - 1/(2 * n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_3873", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "5fc258a11da76ce576965db60be7ace2d4b4efc4f7b659db9458ddbbf39deb5f", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_3873__5fc258a11da76ce5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_3873", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_4018__0a1fa3b38a4bd594", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (max_two_winners : ℕ), max_two_winners = 49 ∧\n (∀ (win_counts : Fin 100 → ℕ),\n (∑ i : Fin 100, win_counts i) = 99 →\n (∑ i : Fin 100, if win_counts i = 2 then 1 else 0) ≤ max_two_winners) ∧\n (∃ (optimal_win_counts : Fin 100 → ℕ),\n (∑ i : Fin 100, optimal_win_counts i) = 99 ∧\n (∑ i : Fin 100, if optimal_win_counts i = 2 then 1 else 0) = max_two_winners) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_4018", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "0a1fa3b38a4bd594a36202cc7a334031eb89e074b59bef5c092cef1aa12a8609", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_4018__0a1fa3b38a4bd594", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_4018", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_4186__c3505eab1101807d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ¬∃ (T₁ T₂ : Set (ℝ × ℝ)) (square : Set (ℝ × ℝ)),\n (∃ (a : ℝ), a > 0 ∧\n T₁ = {p : ℝ × ℝ |\n dist p (0, 0) ≤ a ∧\n dist p (a, 0) ≤ a ∧\n dist p (a/2, a * Real.sqrt 3 / 2) ≤ a}) ∧\n (∃ (b : ℝ), b > 0 ∧\n T₂ = {p : ℝ × ℝ |\n dist p (0, 0) ≤ b ∧\n dist p (b, 0) ≤ b ∧\n dist p (b/2, b * Real.sqrt 3 / 2) ≤ b}) ∧\n (∃ (s : ℝ), s > 0 ∧ square = {p : ℝ × ℝ | 0 ≤ p.1 ∧ p.1 ≤ s ∧ 0 ≤ p.2 ∧ p.2 ≤ s}) ∧\n (∃ (P₁ P₂ P₃ Q₁ Q₂ Q₃ : Set (ℝ × ℝ)),\n\n (P₁ ∪ P₂ ∪ P₃ = T₁) ∧\n (Disjoint P₁ P₂) ∧ (Disjoint P₁ P₃) ∧ (Disjoint P₂ P₃) ∧\n\n (Q₁ ∪ Q₂ ∪ Q₃ = T₂) ∧\n (Disjoint Q₁ Q₂) ∧ (Disjoint Q₁ Q₃) ∧ (Disjoint Q₂ Q₃) ∧\n\n (P₁ ∪ P₂ ∪ P₃ ∪ Q₁ ∪ Q₂ ∪ Q₃ = square) ∧\n (Disjoint P₁ Q₁) ∧ (Disjoint P₁ Q₂) ∧ (Disjoint P₁ Q₃) ∧\n (Disjoint P₂ Q₁) ∧ (Disjoint P₂ Q₂) ∧ (Disjoint P₂ Q₃) ∧\n (Disjoint P₃ Q₁) ∧ (Disjoint P₃ Q₂) ∧ (Disjoint P₃ Q₃)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_4186", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "c3505eab1101807d7a3e20cbebac4d3f25cb1317bdf99eb032becf6d6f2e0d7b", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_4186__c3505eab1101807d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_4186", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_4208__83dab2472f40c04e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∫ x in Set.Icc (-2 : ℝ) 2, 2 * Real.pi * (3 - x) * (4 - x^2) = 64 * Real.pi := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_4208", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "83dab2472f40c04e1a77f244adfebbb12d7fba5577ecdfc364545e46ccd94fcd", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_4208__83dab2472f40c04e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_4208", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_422__cbaf2ee96a453c12", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (A B C D E F G H M : ℕ),\n (A ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ)) →\n (B ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ)) →\n (C ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ)) →\n (D ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ)) →\n (E ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ)) →\n (F ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ)) →\n (G ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ)) →\n (H ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ)) →\n (M ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ)) →\n (A ≠ B ∧ A ≠ C ∧ A ≠ D ∧ A ≠ E ∧ A ≠ F ∧ A ≠ G ∧ A ≠ H ∧ A ≠ M) →\n (B ≠ C ∧ B ≠ D ∧ B ≠ E ∧ B ≠ F ∧ B ≠ G ∧ B ≠ H ∧ B ≠ M) →\n (C ≠ D ∧ C ≠ E ∧ C ≠ F ∧ C ≠ G ∧ C ≠ H ∧ C ≠ M) →\n (D ≠ E ∧ D ≠ F ∧ D ≠ G ∧ D ≠ H ∧ D ≠ M) →\n (E ≠ F ∧ E ≠ G ∧ E ≠ H ∧ E ≠ M) →\n (F ≠ G ∧ F ≠ H ∧ F ≠ M) →\n (G ≠ H ∧ G ≠ M) →\n (H ≠ M) →\n (A + B = 14) →\n (M % G = 0 ∧ M / G = M - F ∧ M - F = H - C) →\n (D * F = 24) →\n (B + E = 16) →\n (H = 4) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_422", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "cbaf2ee96a453c12630ceb5475f54a474b799fa232b59c9799be2abfbf974c78", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_422__cbaf2ee96a453c12", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_422", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_4261__2a3b5cce5005ee98", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n let φ₁ : ℝ → ℝ := fun x => x\n let φ₂ : ℝ → ℝ := fun x => -x\n (∀ x : ℝ, ∫ t in (0)..(x), φ₁ t * φ₁ (x - t) = x^3 / 6) ∧\n (∀ x : ℝ, ∫ t in (0)..(x), φ₂ t * φ₂ (x - t) = x^3 / 6) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_4261", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "2a3b5cce5005ee98de48fe08118895a433b15f0a6a54ac7a165e60de9d555b37", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_4261__2a3b5cce5005ee98", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_4261", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_48425__6d7559bdc8bf539d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (X Y Z M : EuclideanSpace ℝ (Fin 2))\n (h_isosceles : dist X Y = 10 ∧ dist X Z = 10)\n (h_base : dist Y Z = 12)\n (h_midpoint : M = (1/2 : ℝ) • Y + (1/2 : ℝ) • Z) :\n dist X M = 8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_48425", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "6d7559bdc8bf539db7bfdf87338fe2b63f57571d58291d6e9759fe23d0c6bee4", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_48425__6d7559bdc8bf539d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_48425", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_48472__15fc0fc4baf6dff8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (P Q R M N : ℝ × ℝ) (h : ℝ × ℝ),\n\n dist P Q = 24 ∧\n dist P R = 26 ∧\n dist Q R = 30 ∧\n\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ M = (1 - t) • P + t • Q ∧\n\n ∃ s : ℝ, 0 ≤ s ∧ s ≤ 1 ∧ N = (1 - s) • P + s • R ∧\n\n ∃ k : ℝ, (N.1 - M.1, N.2 - M.2) = k • (R.1 - Q.1, R.2 - Q.2) ∧\n\n h ∈ Set.range (fun t : ℝ => (1 - t) • Q + t • R) ∧\n (h.1 - P.1) * (R.1 - Q.1) + (h.2 - P.2) * (R.2 - Q.2) = 0 ∧\n\n ∃ u : ℝ, (1 - u) • M + u • N = ((P.1 + h.1) / 2, (P.2 + h.2) / 2) ∧\n\n ∃ a b : ℕ, b > 0 ∧ Nat.gcd a b = 1 ∧ dist M N = a / b ∧ a + b = 16 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_48472", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "15fc0fc4baf6dff8469c3bb794825ffafe9e86549d33e33b4e84b3509c2080ca", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_48472__15fc0fc4baf6dff8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_48472", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_49387__6ed5160facf59829", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (g : ℝ → ℝ) (a b : ℝ) (h : ∫ x in a..b, |g x| = 12) :\n ∫ x in (a + 3)..(b + 3), |2 * g (x - 3)| = 24 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_49387", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "6ed5160facf59829a0988c202098c7a7077abe3dea3c589207730ece265e3521", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_49387__6ed5160facf59829", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_49387", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_52816__4086740f03a000a8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (r : ℝ) (hr : r > 0) :\n ∃ (A B C D P : EuclideanSpace ℝ (Fin 2)) (center : EuclideanSpace ℝ (Fin 2)),\n\n dist center A = r ∧ dist center B = r ∧ dist center C = r ∧ dist center D = r ∧\n\n ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ P = (1 - t) • C + t • D ∧\n\n dist C B = dist B P ∧ dist B P = dist P A ∧ dist P A = dist A B ∧\n\n dist P D = r := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_52816", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "4086740f03a000a8a009b3119b6c6127928acb8fa97071d48888ea203a95d59f", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_52816__4086740f03a000a8", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_52816", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_5373__d9fe71524b07b567", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (initial_state : Fin 5 → Fin 6) (pair1 pair2 odd : Fin 6),\n (∃ (i j k l m : Fin 5),\n i ≠ j ∧ k ≠ l ∧ i ≠ k ∧ i ≠ l ∧ i ≠ m ∧ j ≠ k ∧ j ≠ l ∧ j ≠ m ∧ k ≠ l ∧ k ≠ m ∧ l ≠ m ∧\n initial_state i = pair1 ∧ initial_state j = pair1 ∧\n initial_state k = pair2 ∧ initial_state l = pair2 ∧\n initial_state m = odd ∧\n pair1 ≠ pair2 ∧ pair1 ≠ odd ∧ pair2 ≠ odd) →\n (Set.ncard {new_odd : Fin 6 | new_odd = pair1 ∨ new_odd = pair2}) / 6 = (1 : ℚ) / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_5373", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "d9fe71524b07b5678f6ff8d74dd3161bf0ce2b64701a914f20c83bee7eeeab09", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_5373__d9fe71524b07b567", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_5373", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_539__929601a53a95638e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (k : ℕ) (hk : k > 0) :\n ∀ (table : Fin k → Fin k → ℕ) (row_perm col_perm : Equiv.Perm (Fin k)),\n (∀ i j, table i j = i * k + j + 1) →\n (∑ i, table (row_perm i) (col_perm i)) = k * (k^2 + 1) / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_539", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "929601a53a95638efcb900c6e42830c838806564ea0b1fc85d5e561f84f19c77", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_539__929601a53a95638e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_539", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_5428__0f4ba33024607604", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (W X Y Z : ℝ × ℝ) (squares : Fin 4 → Set (ℝ × ℝ)) (A B C O : ℝ × ℝ),\n\n (let side := 6\n (W.1 = 0 ∧ W.2 = 0 ∧\n X.1 = side ∧ X.2 = 0 ∧\n Y.1 = side ∧ Y.2 = side ∧\n Z.1 = 0 ∧ Z.2 = side) ∧\n side^2 = 36) ∧\n\n (∀ i : Fin 4, ∃ (x y : ℝ), squares i = {p : ℝ × ℝ | x ≤ p.1 ∧ p.1 ≤ x + 2 ∧ y ≤ p.2 ∧ p.2 ≤ y + 2}) ∧\n\n (∀ i : Fin 4, ∃ (x y : ℝ), x ≥ 0 ∧ y ≥ 0 ∧ x + 2 ≤ 6 ∧ y + 2 ≤ 6 ∧\n squares i = {p : ℝ × ℝ | x ≤ p.1 ∧ p.1 ≤ x + 2 ∧ y ≤ p.2 ∧ p.2 ≤ y + 2}) ∧\n\n O = ((W.1 + X.1 + Y.1 + Z.1) / 4, (W.2 + X.2 + Y.2 + Z.2) / 4) ∧\n\n dist A B = dist A C ∧\n\n ∃ (folded_A : ℝ × ℝ), folded_A = O ∧\n (∃ (reflection : ℝ × ℝ → ℝ × ℝ),\n (∀ P : ℝ × ℝ, P ∈ Set.range (fun t : ℝ => (1 - t) • B + t • C) → reflection P = P) ∧\n reflection A = folded_A) ∧\n\n (1/2) * abs ((B.1 - A.1) * (C.2 - A.2) - (C.1 - A.1) * (B.2 - A.2)) = 5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_5428", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "0f4ba330246076045881b0f6c03f9766e09e97a19852e83c3f505d12dcb3dd67", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_5428__0f4ba33024607604", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_5428", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_55179__fda60a01e0d4bf20", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ)\n (h_even : ∀ x, f (-x) = f x)\n (h_symmetric : ∀ x, f (2 + x) = f (2 - x))\n (h_zero_at_zero : f 0 = 0)\n (h_has_zero_in_interval : ∃ x ∈ Set.Ioo 0 4, f x = 0) :\n ∃ (zeros : Finset ℝ), (∀ x ∈ zeros, x ∈ Set.Ioc (-8) 10 ∧ f x = 0) ∧ zeros.card ≥ 9 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_55179", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "fda60a01e0d4bf20a6f743ac23b683da9ba58d66e32680ce8b8b73db4d93303e", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_55179__fda60a01e0d4bf20", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_55179", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_55710__8fbdf02d0201c5a1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (a b : ℝ)\n (A : Matrix (Fin 2) (Fin 2) ℝ)\n (α : Fin 2 → ℝ)\n (hA : A = !![a, 2; b, 1])\n (hα : α = ![(-2), 1])\n (h_eigen : A.mulVec α = (-3) • α) :\n ∃ (lambda : ℝ), lambda ≠ (-3) ∧ (A.det - lambda * A.trace + lambda^2 = 0) ∧\n (A.det ≠ 0 → A⁻¹ = !![(-1/6), 1/3; 1/3, 1/3]) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_55710", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "8fbdf02d0201c5a19d73042832f1016bf0acb306b76f45707052c5c59e8a2973", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_55710__8fbdf02d0201c5a1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_55710", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_55743__a0151a1f1d8a5891", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ k : ℤ, ∀ x : ℝ, x ∈ Set.Ioo (k * Real.pi - Real.pi / 3) (k * Real.pi + Real.pi / 6) →\n deriv (fun x => 3 - 2 * Real.cos (2 * x - Real.pi / 3)) x < 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_55743", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "a0151a1f1d8a5891d91c46799a3dbe263de761e6a3d463595397980c76b8bbde", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_55743__a0151a1f1d8a5891", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_55743", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_55899__3b12ac0fa9e07422", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (S : Finset (Finset ℕ)),\n (∀ A ∈ S, A.card = 5 ∧\n (∀ x : ℕ, 1 ≤ x ∧ x ≤ 29 →\n ∃ B : Finset ℕ, B ⊆ A ∧ B.sum id = x) ∧\n (∀ a ∈ A, 0 < a)) ∧\n S.card = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_55899", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "3b12ac0fa9e07422df0be9587d01f156746d64971454128b5f0f1e5f74b2c954", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_55899__3b12ac0fa9e07422", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_55899", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_5603__92185c8e20f175f5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (S : Finset ℂ), S.card = 4 ∧\n (∀ z ∈ S, z^4 = -16) ∧\n (∀ z : ℂ, z^4 = -16 → z ∈ S) ∧\n (∃ (T : Finset ℂ), T ⊆ S ∧\n (∀ z ∈ T, z.re < 0) ∧\n (∀ z ∈ S, z.re < 0 → z ∈ T) ∧\n T.prod id = 4) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_5603", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "92185c8e20f175f56e90c9b6369ea1060e12c20e9ae1540d6976e6f2b30509bd", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_5603__92185c8e20f175f5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_5603", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_57305__86b550aef0062411", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (a : ℝ) :\n (∀ x ∈ Set.Ioo (-2 : ℝ) 2, (deriv (fun x => x^3 - 3*a*x + 2) x) ≤ 0) ↔ a ≥ 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_57305", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "86b550aef0062411f12158662626c2a41e9da62a4a185fe3fc0fce38da58c351", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_57305__86b550aef0062411", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_57305", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_60784__3cfab048f0bef793", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (m : ℝ) :\n (∀ x ∈ Set.Icc 1 2, (deriv (fun x => (1/3) * x^3 - (1/2) * m * x^2 + 4 * x - 3) x) ≥ 0) →\n m ≤ 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_60784", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "3cfab048f0bef793abb921d3df5c201f657127d0503e3b9536ac3d332e160f8c", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_60784__3cfab048f0bef793", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_60784", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_61002__ab345b4eef0d01c1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (P : Polynomial ℤ) (n m : ℕ) (x : Fin m → ℤ)\n (h_degree : P.degree = ↑n)\n (h_n_ge_3 : n ≥ 3)\n (h_m_ge_3 : m ≥ 3)\n (h_distinct : Function.Injective x)\n (h_values : ∀ i : Fin m, P.eval (x i) = 1) :\n ∀ r : ℤ, P.eval r ≠ 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_61002", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "ab345b4eef0d01c1d1bdab3227a96c13c80e0c3e7a616df479dc4bbc94f33646", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_61002__ab345b4eef0d01c1", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_61002", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_61490__7c7684205651f15f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (l : Fin n → ℕ)\n (hn_pos : 1 < n) (hn_bound : n < 2018)\n (hl_pos : ∀ i, 0 < l i) (hl_distinct : Function.Injective l)\n (h_root : ∃ r : ℤ, (n : ℤ) * r^2 - 2018 * (n : ℤ) * r + (∑ i, (l i : ℤ)) = 0) :\n ∃ i, 2018 ≤ l i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_61490", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "7c7684205651f15f20736d4bae16894c4f2ce68255682b25c06bbd4d54516e7c", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_61490__7c7684205651f15f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_61490", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_61794__075c444a47da3c7b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (x : ℕ → ℕ),\n (x 1 < 204) ∧\n (∀ n : ℕ, n > 0 → (2004 * n) ∣ ((n^2 + 2004) * x n^2 - n^4 + 2004 * n)) ∧\n (∀ n : ℕ, n > 0 → x (n + 1) = ((n^2 + 2004) * x n^2 - n^4 + 2004 * n) / (2004 * n)) ∧\n Set.Infinite {n : ℕ | Nat.Prime (x n)} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_61794", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "075c444a47da3c7b4900a47dfe2c2ec010d7758d38a437c70668c9f716e46dba", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_61794__075c444a47da3c7b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_61794", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_6335__41202c7de1bfc2d5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (A B C D : ℝ × ℝ),\n dist A C = 10 ∧\n dist B C = 10 ∧\n dist A B = 4 ∧\n dist C D = 12 ∧\n (∃ t : ℝ, t > 1 ∧ D = A + t • (B - A)) ∧\n dist B D = 4 * Real.sqrt 3 - 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_6335", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "41202c7de1bfc2d58819746c357457211b755964fe3e5e103759bf0529ef3235", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_6335__41202c7de1bfc2d5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_6335", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_6466__22c50fb22ad2556f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (Polynomial.coeff ((1 - Polynomial.X : Polynomial ℤ) ^ 6 * (2 - Polynomial.X)) 3) = -55 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_6466", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "22c50fb22ad2556fe48009d46fcc9a8631a6951fef9c6244323b76bcb1d69472", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_6466__22c50fb22ad2556f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_6466", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_67331__d21155bc0426a3a4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (f : Polynomial ℤ) (n : ℕ),\n f.eval 0 = 11 →\n (∃ (S : Finset ℤ), S.card = n ∧ ∀ x ∈ S, f.eval x = 2010) →\n n ≤ 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_67331", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "d21155bc0426a3a4be5c15f7077ee02caddec2a27f38caed75f176754c3768e4", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_67331__d21155bc0426a3a4", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_67331", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_67495__f00d3413ba8794cc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (points : Finset (ℝ × ℝ)) (h_card : points.card = 25)\n (h_dist : ∀ p ∈ points, ∀ q ∈ points, ∀ r ∈ points, p ≠ q ∧ q ≠ r ∧ p ≠ r →\n dist p q < 1 ∨ dist q r < 1 ∨ dist p r < 1) :\n ∃ (subset : Finset (ℝ × ℝ)) (center : ℝ × ℝ),\n subset ⊆ points ∧ subset.card = 13 ∧\n ∀ p ∈ subset, dist p center ≤ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_67495", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "f00d3413ba8794ccede94c3571215d1143ed9b3d6dd12aa5945e1c1d8955b899", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_67495__f00d3413ba8794cc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_67495", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_6754__26b2d3f3106f33f5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (a : Fin n → ℝ)\n (hn : n ≥ 2)\n (ha_pos : ∀ i, 0 < a i)\n (ha_sum : ∑ i, a i = 1) :\n ∑ i, (a i) / (2 - a i) ≥ n / (2 * n - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_6754", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "26b2d3f3106f33f51e07a791c4252cbefce7c96389c1487bec2f76e6599764d9", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_6754__26b2d3f3106f33f5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_6754", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_6942__50e7dc11099db081", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (A B C D E F P Q : ℝ × ℝ) (r s t : ℕ+),\n\n (A.1 = 0 ∧ A.2 = 0) ∧\n (B.1 = 6 ∧ B.2 = 0) ∧\n (C.1 = 6 ∧ C.2 = 3) ∧\n (D.1 = 0 ∧ D.2 = 3) ∧\n\n (E.1 = 6 ∧ E.2 = 1) ∧\n (F.1 = 6 ∧ F.2 = 2) ∧\n\n (∃ t₁ t₂ : ℝ, P = A + t₁ • (E - A) ∧ P = B + t₂ • (D - B)) ∧\n\n (∃ s₁ s₂ : ℝ, Q = A + s₁ • (F - A) ∧ Q = B + s₂ • (D - B)) ∧\n\n (∃ k : ℝ, k > 0 ∧\n dist B P = k * r ∧\n dist P Q = k * s ∧\n dist Q D = k * t) ∧\n\n Nat.gcd (Nat.gcd r.val s.val) t.val = 1 ∧\n\n r.val + s.val + t.val = 20 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_6942", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "50e7dc11099db081958f9adb28cf978e84670459a989b413d90b4326905eef7b", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_6942__50e7dc11099db081", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_6942", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_7027__85a771cd40dbbb2d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (O C₁ C₂ A B : ℝ × ℝ) (m n : ℕ),\n\n let large_radius : ℝ := 13\n\n let small_radius : ℝ := 5\n\n dist C₁ C₂ = 2 * small_radius ∧\n\n dist O C₁ = large_radius - small_radius ∧\n dist O C₂ = large_radius - small_radius ∧\n\n dist O A = large_radius ∧\n\n dist O B = large_radius ∧\n\n ∃ t : ℝ, A = O + t • (C₁ - O) ∧\n\n ∃ s : ℝ, B = O + s • (C₂ - O) ∧\n\n dist A B = m / n ∧\n\n Nat.gcd m n = 1 ∧ m > 0 ∧ n > 0 ∧\n\n m + n = 69 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_7027", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "85a771cd40dbbb2dc308dbb8ce171e34c9694a9518c5446c781655740272d9d9", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_7027__85a771cd40dbbb2d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_7027", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_70335__e79f38004054aa0a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (p : ℕ) (hp : p ≥ 3) :\n ∃ (n : Fin p → ℕ), (∀ i, n i > 0) ∧ (∑ i, (1 : ℚ) / (n i : ℚ)) = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_70335", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "e79f38004054aa0af4e258a6b6c8ec8759580d67ee5d5ba7ac271c4e1f6f6861", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_70335__e79f38004054aa0a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_70335", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_7114__3cb51d0fcea486da", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n (∃ (x : Fin 20 → ℝ), (∀ i, |x i| < 1) ∧\n (∑ i, |x i|) = 19 + |∑ i, x i|) ∧\n (∀ n : ℕ, 0 < n ∧ n < 20 →\n ¬∃ (x : Fin n → ℝ), (∀ i, |x i| < 1) ∧\n (∑ i, |x i|) = 19 + |∑ i, x i|) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_7114", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "3cb51d0fcea486da373b138604706a3db3f4be75f49b482508a581d12512446b", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_7114__3cb51d0fcea486da", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_7114", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_71598__3ac1dc00d0c50d73", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (n : ℕ) (hn : 0 < n) :\n ∃ M : ℝ, (∀ (A : Fin n → ℝ), (∏ i, Real.tan (A i)) = 1 → (∏ i, Real.sin (A i)) ≤ M) ∧\n (∃ (A : Fin n → ℝ), (∏ i, Real.tan (A i)) = 1 ∧ (∏ i, Real.sin (A i)) = M) ∧\n M = 2^(-(n : ℝ)/2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_71598", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "3ac1dc00d0c50d730653e997d27a881bebb286a6956eaaf8fb10e4ccb3b08737", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_71598__3ac1dc00d0c50d73", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_71598", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_71862__38f283a1c98e57d0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n {n : ℕ | 100 ≤ n ∧ n ≤ 999 ∧\n 45 ∣ n ∧\n ∃ (a b c : ℕ), a ∈ ({1,2,3,4,5,6,7,8,9} : Set ℕ) ∧\n b ∈ ({0,1,2,3,4,5,6,7,8,9} : Set ℕ) ∧\n c ∈ ({0,1,2,3,4,5,6,7,8,9} : Set ℕ) ∧\n n = 100 * a + 10 * b + c ∧\n 2 * b = a + c} = {135, 630, 765} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_71862", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "38f283a1c98e57d094e2237aef83b7f323ba9cf3a7318515bbd42b1604144076", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_71862__38f283a1c98e57d0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_71862", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_72650__fb1c2bb892b66e2b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (A B C D O E F : ℝ × ℝ)\n (h_square : A = (0, 0) ∧ B = (1, 0) ∧ C = (1, 1) ∧ D = (0, 1))\n (h_diagonals : O = (1/2, 1/2))\n (h_E_on_BC : ∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ E = (1, t))\n (h_EC_ratio : dist E C = (1/4) * dist B C)\n (h_F_intersection : ∃ s u : ℝ, F = A + s • (C - A) ∧ F = D + u • (E - D))\n : (dist A O) / (dist O F) = 5 / 3 ∧ (dist O F) / (dist F C) = 3 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_72650", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "fb1c2bb892b66e2bff1820e6dbcc280f09ba110b768b7fb8ff1a6b1255036ccc", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_72650__fb1c2bb892b66e2b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_72650", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_74172__2256a24ccc107db5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (arrangement : Fin 12 → ℕ) (lines : Fin 6 → Finset (Fin 12)) (magic_sum : ℕ),\n (∀ i : Fin 12, arrangement i ∈ ({1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12} : Set ℕ)) ∧\n (∀ i j : Fin 12, i ≠ j → arrangement i ≠ arrangement j) ∧\n (∀ l : Fin 6, (lines l).card = 4) ∧\n (∀ l : Fin 6, (lines l).sum arrangement = magic_sum) ∧\n magic_sum = 26 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_74172", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "2256a24ccc107db5185b23a4e6a669661129f4dabba9ddcb264878d2a6e2d4ec", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_74172__2256a24ccc107db5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_74172", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_74511__819571b1ad697576", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (xiaoyu_cards : Finset ℕ) (xiaomu_cards : Finset ℕ),\n (xiaoyu_cards ∪ xiaomu_cards = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}) →\n (xiaoyu_cards ∩ xiaomu_cards = ∅) →\n (xiaoyu_cards.card = 5) →\n (xiaomu_cards.card = 5) →\n (∃ (xiaoyu_final xiaomu_final : ℤ),\n (xiaoyu_final = (xiaoyu_cards.sum (fun x => (x : ℤ))) +\n (xiaoyu_cards.sum (fun x => (x : ℤ))) -\n (xiaomu_cards.sum (fun x => (x : ℤ)))) ∧\n (xiaomu_final = (xiaomu_cards.sum (fun x => (x : ℤ))) +\n (xiaomu_cards.sum (fun x => (x : ℤ))) -\n (xiaoyu_cards.sum (fun x => (x : ℤ)))) ∧\n (xiaomu_final = 2 * xiaoyu_final)) →\n (xiaoyu_cards.sum (fun x => (x : ℤ))) = 20 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_74511", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "819571b1ad697576432cee5dd2eb34b6c7698ef0ada03f86ebe4cab4afdfad6e", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_74511__819571b1ad697576", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_74511", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_81083__a8e7374dee7489e3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ a : ℝ, (∀ x ∈ Set.Ioi (1/2), (deriv (fun x => x^2 + a*x + 1/x) x) ≥ 0) ↔ a ≥ 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_81083", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "a8e7374dee7489e3367f7b032d0ec762c1e512946f782db5a27a2061b318f3e4", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_81083__a8e7374dee7489e3", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_81083", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_8218__f3225f40061d1e6a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (a : ℝ) :\n (∀ x ∈ Set.Ioo (-3 : ℝ) 0, (deriv (fun x => Real.exp x * (x^2 - a)) x) ≤ 0) ↔\n a ∈ Set.Ici 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_8218", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "f3225f40061d1e6adfa4de5dc3e40802e89a5526f3df4edef2012e75a3a78621", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_8218__f3225f40061d1e6a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_8218", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_8493__6da5858def3d9f9a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ)\n (h_odd : ∀ x, f (-x) = -f x)\n (h_sym : ∀ x, f (1 - x) = f (1 + x))\n (h_def : ∀ x ∈ Set.Ioc 0 1, f x = Real.exp x) :\n (∀ x ∈ Set.Ico (-1) 0, f x = -Real.exp (-x)) ∧\n (∀ k : ℕ+, ∀ x ∈ Set.Ioc (4 * k) (4 * k + 1), f x = Real.exp (x - 4 * k)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_8493", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "6da5858def3d9f9a181167df4ac94871d34337ebd4cbe6f2359311531b49fb4c", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_8493__6da5858def3d9f9a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_8493", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_85275__f27414ce0951b486", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∃ (aleksa_bart_clara_deindra : Fin 4 → Finset ℕ),\n (∀ i, (aleksa_bart_clara_deindra i).card = 2) ∧\n (Disjoint (aleksa_bart_clara_deindra 0) (aleksa_bart_clara_deindra 1)) ∧\n (Disjoint (aleksa_bart_clara_deindra 0) (aleksa_bart_clara_deindra 2)) ∧\n (Disjoint (aleksa_bart_clara_deindra 0) (aleksa_bart_clara_deindra 3)) ∧\n (Disjoint (aleksa_bart_clara_deindra 1) (aleksa_bart_clara_deindra 2)) ∧\n (Disjoint (aleksa_bart_clara_deindra 1) (aleksa_bart_clara_deindra 3)) ∧\n (Disjoint (aleksa_bart_clara_deindra 2) (aleksa_bart_clara_deindra 3)) ∧\n (aleksa_bart_clara_deindra 0).sum id = 6 ∧\n ∃ a b, a ∈ (aleksa_bart_clara_deindra 1) ∧ b ∈ (aleksa_bart_clara_deindra 1) ∧ a ≠ b ∧ (a - b = 5 ∨ b - a = 5) ∧\n ∃ c d, c ∈ (aleksa_bart_clara_deindra 2) ∧ d ∈ (aleksa_bart_clara_deindra 2) ∧ c ≠ d ∧ c * d = 18 ∧\n ∃ e f, e ∈ (aleksa_bart_clara_deindra 3) ∧ f ∈ (aleksa_bart_clara_deindra 3) ∧ e ≠ f ∧ (e = 2 * f ∨ f = 2 * e) ∧\n (Finset.range 9).image (· + 1) = (aleksa_bart_clara_deindra 0) ∪ (aleksa_bart_clara_deindra 1) ∪ (aleksa_bart_clara_deindra 2) ∪ (aleksa_bart_clara_deindra 3) ∪ {9} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_85275", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "f27414ce0951b48664d2cf940d930945fe63224f41c6ef5b9ab2c8e48d27b8a2", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_85275__f27414ce0951b486", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_85275", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_85559__f7580c19d95a3679", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (A C D B E X : ℝ × ℝ) (ω : Set (ℝ × ℝ)),\n\n ω = {P | P.1^2 + P.2^2 = 1} ∧\n\n A = (-1, 0) ∧ C = (1, 0) ∧\n\n (∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ D = (1 - t) • C + t • A ∧ dist C D = 1/5) ∧\n\n B ∈ ω ∧\n\n (D.1 - B.1) * (C.1 - A.1) + (D.2 - B.2) * (C.2 - A.2) = 0 ∧\n\n E = ((D.1 + B.1) / 2, (D.2 + B.2) / 2) ∧\n\n (∃ t s : ℝ,\n\n (X.1 - B.1) * B.1 + (X.2 - B.2) * B.2 = 0 ∧\n\n X = (1 - t) • C + t • E ∧\n\n X.1^2 + X.2^2 ≠ 1) ∧\n\n dist A X = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_85559", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "f7580c19d95a36794970c952bfb256c78e844687e13fbd2c65b62e3ad57593cd", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_85559__f7580c19d95a3679", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_85559", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_8614__a8a08ebacf6f0e35", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ)\n (h_odd : ∀ x, f (-x) = -f x)\n (h_diff : DifferentiableOn ℝ f (Set.univ))\n (h_ineq : ∀ x, x < 0 → f x + x * (deriv f x) < 0) :\n let a := 3 * f 3\n let b := (Real.log 3 / Real.log Real.pi) * f (Real.log 3 / Real.log Real.pi)\n let c := -2 * f (-2)\n b < c ∧ c < a := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_8614", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "a8a08ebacf6f0e35afb687ef1a8bb861e8af37b6902ba21bc2547fc6eacda10c", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_8614__a8a08ebacf6f0e35", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_8614", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_86844__bdc215a8ab225753", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∃ (balls_in_boxes : Fin 10 → ℕ),\n (∀ i, ∃ d : ℕ, d < 10 ∧ (balls_in_boxes i / (10^d)) % 10 = 7) ∧\n (∑ i, balls_in_boxes i) = 2017 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_86844", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "bdc215a8ab225753ad36eefd6fbc2ef282a50401e171aadba7424d012eab025a", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_86844__bdc215a8ab225753", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_86844", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_89634__d1b2c1c4dc756439", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (total_people : Finset ℕ) (group_A group_B : Finset ℕ),\n total_people.card = 8 →\n group_A.card = 5 →\n group_B.card = 3 →\n group_A ∪ group_B = total_people →\n group_A ∩ group_B = ∅ →\n (Finset.filter (fun p : ℕ × ℕ => p.1 ∈ group_A ∧ p.2 ∈ group_B)\n (total_people ×ˢ total_people)).card = 15 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_89634", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "d1b2c1c4dc75643934c84689eab6226024ac98ff455b9412f25a5fef4f83c48f", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_89634__d1b2c1c4dc756439", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_89634", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_8983__357f2db82069db8a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (a : ℕ → ℝ)\n (h_pos : ∀ n : ℕ, 0 < n → 0 < a n)\n (h_sum : ∀ n : ℕ, 0 < n → (Finset.range n).sum (fun k => Real.sqrt (a (k + 1))) = n^2 + 3*n) :\n Filter.Tendsto (fun n => (1 / n^2) * (Finset.range n).sum (fun k => a (k + 1) / (k + 2))) Filter.atTop (nhds 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_8983", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "357f2db82069db8a64c19d6d98a6b40e68ec0b9984a0537fce2dd811a1156b74", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_8983__357f2db82069db8a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_8983", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_9141__214e21d8bfa32dd5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∫ x in (0 : ℝ)..(1 : ℝ), (Real.sqrt x - x) = (1 : ℝ) / 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_9141", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "214e21d8bfa32dd5c30f1333c9010ef9009e4f975e314ae33e40b4aed3464677", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_9141__214e21d8bfa32dd5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_9141", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_93186__8edf7bbb04542520", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∀ (group1 group2 group3 : Finset ℕ),\n (group1 ∪ group2 ∪ group3 = Finset.Icc 1 99) →\n (group1 ∩ group2 = ∅) →\n (group1 ∩ group3 = ∅) →\n (group2 ∩ group3 = ∅) →\n (group1.Nonempty) →\n (group2.Nonempty) →\n (group3.Nonempty) →\n ((group1.sum (fun x => (x : ℚ)) : ℚ) / group1.card = (group2.sum (fun x => (x : ℚ)) : ℚ) / group2.card) →\n ((group2.sum (fun x => (x : ℚ)) : ℚ) / group2.card = (group3.sum (fun x => (x : ℚ)) : ℚ) / group3.card) →\n ((group1.sum (fun x => (x : ℚ)) : ℚ) / group1.card) * ((group2.sum (fun x => (x : ℚ)) : ℚ) / group2.card) * ((group3.sum (fun x => (x : ℚ)) : ℚ) / group3.card) = 125000 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_93186", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "8edf7bbb04542520a2822866442f2e15bf57e3fd395e24f32ec1dcf15f752baf", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_93186__8edf7bbb04542520", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_93186", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_9357__2165215d24a5912a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (a : ℝ) :\n (∃ (c d : ℝ), c < d ∧ ∀ x ∈ Set.Ioo c d, (deriv (fun x => x^2 - Real.exp x - a*x) x) ≥ 0) →\n a < 2 * Real.log 2 - 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_9357", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "2165215d24a5912a5f9ed4840ac1e38e51cea38432d2e3970d5688806f4f3099", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_9357__2165215d24a5912a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_9357", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_9516__400a61fff254281c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (x₁ : ℝ) (x₂ : ℝ),\n x₁ ∈ Set.Ico 0 (2 * Real.pi) ∧\n x₂ ≥ 0 ∧\n (deriv (fun x => 2 * Real.sin x) x₁ = deriv (fun x => 2 * Real.sqrt x * (x / 3 + 1)) x₂) ∧\n let P := (x₁, 2 * Real.sin x₁)\n let Q := (x₂, 2 * Real.sqrt x₂ * (x₂ / 3 + 1))\n (Q.2 - P.2) / (Q.1 - P.1) = 8 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_9516", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "400a61fff254281c96965df92aff1db5986134cb771fa782552d5d72e3e39dbb", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_9516__400a61fff254281c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_9516", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_98046__1729ac83f4a42a98", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem (f : ℝ → ℝ) (hf_diff : Differentiable ℝ f)\n (hf_eq : ∀ x, f x = x^3 + x^2 * (deriv f 1)) :\n ∫ x in (0:ℝ)..(2:ℝ), f x = -4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_98046", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "1729ac83f4a42a98973560a4aae27adfb15cec14fc0bce3444d848d1504fa0ce", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_98046__1729ac83f4a42a98", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_98046", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_9817__f51225be27421104", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem : ∃! f : ℝ → ℝ, (∃ a b c : ℝ, a ≠ 0 ∧ ∀ x, f x = a * x^2 + b * x + c) ∧\n f (-1) = 2 ∧\n (deriv f) 0 = 0 ∧\n ∫ x in (0 : ℝ)..(1 : ℝ), f x = -2 ∧\n (∀ x ∈ Set.Icc (-1) 1, f x ≤ 2) ∧\n (∃ x ∈ Set.Icc (-1) 1, f x = 2) ∧\n (∃ m : ℝ, ∀ x ∈ Set.Icc (-1) 1, m ≤ f x) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_9817", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "f51225be27421104a97701d30936f98e0d89f85b3bcd8b144956317592983dbb", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_9817__f51225be27421104", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_9817", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_my_favorite_theorem_9959__685a53dab3b392d3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\ntheorem my_favorite_theorem :\n ∃ (people : Finset ℕ) (boys girls : Finset ℕ) (A B C : ℕ),\n people.card = 5 ∧\n boys.card = 2 ∧\n girls.card = 3 ∧\n boys ∪ girls = people ∧\n boys ∩ girls = ∅ ∧\n A ∈ people ∧ B ∈ people ∧ C ∈ people ∧\n A ≠ B ∧ B ≠ C ∧ A ≠ C ∧\n (∃ (arrangements : Finset (List ℕ)),\n arrangements.card = 20 ∧\n (∀ l ∈ arrangements, l.toFinset = people ∧ l.length = people.card ∧\n (∃ i j k : ℕ, i < j ∧ j < k ∧ l[i]! = A ∧ l[j]! = B ∧ l[k]! = C))) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_9959", "source_license": null, "theorem_names": ["my_favorite_theorem"], "statement_sha256": "685a53dab3b392d37bbff1a076f7fa9e3106b8f893a184ab70e95f260bfe7667", "task_path": "tasks/rl_align__o_proofs_my_favorite_theorem_9959__685a53dab3b392d3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_my_favorite_theorem_9959", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_n_115__e3191449d53176e0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem n (n : ℕ) (hn : 0 < n) (a b : Fin n → ℝ)\n (hb : ∀ i, 0 < b i) :\n (∑ i, (a i)^2 / b i) ≥ (∑ i, a i)^2 / ∑ i, b i ∧\n (∑ i, (a i)^2 / b i = (∑ i, a i)^2 / ∑ i, b i ↔\n ∀ i j, a i / b i = a j / b j) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_n_115", "source_license": null, "theorem_names": ["n"], "statement_sha256": "e3191449d53176e09ceb4bb5180e9b985b9842cf66af6bab30222f48c6b4b4c6", "task_path": "tasks/rl_align__o_proofs_n_115__e3191449d53176e0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_n_115", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_n_ge_2__70dde2e6a8e02d3b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem n_ge_2 (n : ℕ) (hn : 2 ≤ n) (a : Fin n → ℝ)\n (ha : ∀ i, 0 < a i) (hsum : ∑ i, a i = 1) :\n ∑ i, a i / (1 + ∑ j, if j ≠ i then a j else 0) ≥ n / (2 * n - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_n_ge_2", "source_license": null, "theorem_names": ["n_ge_2"], "statement_sha256": "70dde2e6a8e02d3bfbb37ba02d1c3889f866df45106ff6adb786d945ae626c1c", "task_path": "tasks/rl_align__o_proofs_n_ge_2__70dde2e6a8e02d3b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_n_ge_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_nestedIntegral__c6fe509e9c48d0e0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem nestedIntegral (k : ℝ) (hk : k ≠ 0) (t : ℝ) (ht : t > 0) :\n ∫ x in Set.Icc 0 t, ∫ y in Set.Icc 0 x, Real.sin (k * (x - y)) =\n (k * t - Real.sin (k * t)) / k ^ 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_nestedIntegral", "source_license": null, "theorem_names": ["nestedIntegral"], "statement_sha256": "c6fe509e9c48d0e0a04a4ee268381d77651de5808d1f37b6794e5a86c5b1eb03", "task_path": "tasks/rl_align__o_proofs_nestedIntegral__c6fe509e9c48d0e0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_nestedIntegral", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_no_convergence_2__8e72712c5fd8e36e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\ntheorem no_convergence (a : ℕ → ℝ)\n (ha : ∀ n, a n = (1 + cos (n * π) / n) ^ n) :\n ¬ ∃ x, Tendsto a atTop (𝓝 x) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_no_convergence_2", "source_license": null, "theorem_names": ["no_convergence"], "statement_sha256": "8e72712c5fd8e36e7a36912effcd7792b50ca54e90a31b7fe3477318f927a3f5", "task_path": "tasks/rl_align__o_proofs_no_convergence_2__8e72712c5fd8e36e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_no_convergence_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_no_infinite_zeros__21c7d30e077318c6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem no_infinite_zeros (a : Fin 8 → ℝ) (h₀ : ∃ i : Fin 8, a i ≠ 0) : ¬∃ n : ℕ, ∀ m ≥ n, ∑ i : Fin 8, (a i)^m = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_no_infinite_zeros", "source_license": null, "theorem_names": ["no_infinite_zeros"], "statement_sha256": "21c7d30e077318c6bf0e298a6489ba3d1d81789a260ddf49121fd8ab085f84e6", "task_path": "tasks/rl_align__o_proofs_no_infinite_zeros__21c7d30e077318c6", "metadata": {"split": "train", "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_no_infinite_zeros", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_no_integer_roots_14__f1b5e104172f9639", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem no_integer_roots (P : Polynomial ℤ) :\n ¬∃ k : ℤ, (P.eval (k^4) * P.eval (k^3) * P.eval (k^2) * P.eval k + 1) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_no_integer_roots_14", "source_license": null, "theorem_names": ["no_integer_roots"], "statement_sha256": "f1b5e104172f963917377b2b082515fef4276e49e08744fe44082bf94af4b096", "task_path": "tasks/rl_align__o_proofs_no_integer_roots_14__f1b5e104172f9639", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_no_integer_roots_14", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_no_integer_roots_38__1155eb53120ba505", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem no_integer_roots (p : ℕ) (hp : Nat.Prime p) (f : Polynomial ℤ)\n (h : ∃ x₁ x₂ x₃ x₄ x₅ : ℤ, x₁ ≠ x₂ ∧ x₁ ≠ x₃ ∧ x₁ ≠ x₄ ∧ x₁ ≠ x₅ ∧ x₂ ≠ x₃ ∧ x₂ ≠ x₄ ∧ x₂ ≠ x₅ ∧ x₃ ≠ x₄ ∧ x₃ ≠ x₅ ∧ x₄ ≠ x₅ ∧ f.eval x₁ = p ∧ f.eval x₂ = p ∧ f.eval x₃ = p ∧ f.eval x₄ = p ∧ f.eval x₅ = p) : ¬∃ x : ℤ, f.eval x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_no_integer_roots_38", "source_license": null, "theorem_names": ["no_integer_roots"], "statement_sha256": "1155eb53120ba5056fde499297b87e06a59ff7bf7b567f34c8447bf44447b973", "task_path": "tasks/rl_align__o_proofs_no_integer_roots_38__1155eb53120ba505", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_no_integer_roots_38", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_no_m__951beedbe4b8171b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem no_m : (∀ P : Polynomial ℤ, ∀ a b c d : ℤ, a ≠ b ∧ a ≠ c ∧ a ≠ d ∧ b ≠ c ∧ b ≠ d ∧ c ≠ d ∧ P.eval a = 3 ∧ P.eval b = 3 ∧ P.eval c = 3 ∧ P.eval d = 3 → ¬∃ m : ℤ, P.eval m = 2) ∧\n (∀ Q : Polynomial ℤ, ∀ a b c : ℤ, a ≠ b ∧ a ≠ c ∧ b ≠ c ∧ Q.eval a = 3 ∧ Q.eval b = 3 ∧ Q.eval c = 3 → ¬∃ m : ℤ, Q.eval m = 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_no_m", "source_license": null, "theorem_names": ["no_m"], "statement_sha256": "951beedbe4b8171bfbc64671259594bd416b10edea970fc92d660cc4f52cac0e", "task_path": "tasks/rl_align__o_proofs_no_m__951beedbe4b8171b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_no_m", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_no_positive_roots__5f7d78d97a74d87a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem no_positive_roots (n : ℕ) (a : Fin n → ℕ) (k M : ℕ) (h₀ : M > 1)\n (h₁ : ∑ i, (1 : ℝ) / (a i) = k) (h₂ : ∏ i, a i = M) : ¬ ∃ x : ℝ, x > 0 ∧ M * (x + 1) ^ k - ∏ i, (x + a i) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_no_positive_roots", "source_license": null, "theorem_names": ["no_positive_roots"], "statement_sha256": "5f7d78d97a74d87a79139d01c9d4af994ecb010c2bd81db95422fb2e849ec519", "task_path": "tasks/rl_align__o_proofs_no_positive_roots__5f7d78d97a74d87a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_no_positive_roots", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_normed_vector_space_5__fbed90d77a08d75f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Fintype Complex Polynomial LinearMap FiniteDimensional Module Module.End\nopen scoped BigOperators\n\n\ntheorem normed_vector_space (F V : Type*) [AddCommGroup V] [Field F]\n [Module F V] :\n ∃ (norm : V → ℝ), (∀ v w : V, norm v ≥ 0) ∧ (∀ v w : V, norm (v + w) ≤ norm v + norm w) ∧\n (∀ v : V, norm v = 0 → v = 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_normed_vector_space_5", "source_license": null, "theorem_names": ["normed_vector_space"], "statement_sha256": "fbed90d77a08d75f2586bebb88f222e654c0c1f7b578afe4aa83c9694cb8a6c9", "task_path": "tasks/rl_align__o_proofs_normed_vector_space_5__fbed90d77a08d75f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_normed_vector_space_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_not_exists_poly_eq_pow_2__12d71b2fa9b89713", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem not_exists_poly_eq_pow_2 (P : Polynomial ℤ) : ¬∀ n : ℕ, P.eval (n : ℤ) = 2 ^ n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_not_exists_poly_eq_pow_2", "source_license": null, "theorem_names": ["not_exists_poly_eq_pow_2"], "statement_sha256": "12d71b2fa9b89713256caa1b6631b1f32a5645bf39bf04bc2318577512559d7e", "task_path": "tasks/rl_align__o_proofs_not_exists_poly_eq_pow_2__12d71b2fa9b89713", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_not_exists_poly_eq_pow_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_nsum_5__15d1b29e95132ccb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem nsum {n : ℕ} (hn : n ≥ 2) (x : ℕ → ℝ)\n (hx : ∀ i ∈ Icc 1 n, 0 < x i) :\n ∑ i ∈ Icc 1 n, x i / (∑ j ∈ Icc 1 n \\ {i}, x j) ≥ n / (n - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_nsum_5", "source_license": null, "theorem_names": ["nsum"], "statement_sha256": "15d1b29e95132ccbc18ab0a53d0d473191f04d71e12a0aaffb864861445bd3c3", "task_path": "tasks/rl_align__o_proofs_nsum_5__15d1b29e95132ccb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_nsum_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_num_101_divisible_in_sequence__f14d0b24855b225b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem num_101_divisible_in_sequence (f : ℕ → ℕ) (hf : ∀ n, f n = 10 ^ n + 1) :\n Set.ncard {n | 2 ≤ n ∧ n ≤ 2019 ∧ 101 ∣ f n} = 505 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_num_101_divisible_in_sequence", "source_license": null, "theorem_names": ["num_101_divisible_in_sequence"], "statement_sha256": "f14d0b24855b225bb7c7d2d85cd1a45de12805a9fed5c70ccf96940ad08c1158", "task_path": "tasks/rl_align__o_proofs_num_101_divisible_in_sequence__f14d0b24855b225b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_num_101_divisible_in_sequence", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_num_theory_2__6e166f33e1f2bf30", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem num_theory : (5^123456789) % 7 = 6 ∧\n Set.ncard {n : ℕ | n ∈ Finset.Icc 100 999 ∧ 3 ∣ n ∧ (Nat.digits 10 n).length = 3 ∧\n (Nat.digits 10 n).toFinset.card = 3} = 228 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_num_theory_2", "source_license": null, "theorem_names": ["num_theory"], "statement_sha256": "6e166f33e1f2bf30a5597da343ecc493d7f3c7f445fe83d195d36bb8841f9131", "task_path": "tasks/rl_align__o_proofs_num_theory_2__6e166f33e1f2bf30", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_num_theory_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_num_valid_tuples__2d0e4f529a975ef5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem num_valid_tuples : Set.ncard {(x1, x2, x3, x4, x5) : ℤ × ℤ × ℤ × ℤ × ℤ | x1 ≥ 1 ∧ x2 ≥ 2 ∧ x3 ≥ 3 ∧ x4 ≥ 4 ∧ x5 ≥ 5 ∧ x1 + x2 + x3 + x4 + x5 = 25} = 1001 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_num_valid_tuples", "source_license": null, "theorem_names": ["num_valid_tuples"], "statement_sha256": "2d0e4f529a975ef5b9f1b16209691ef322582f570af74d2e2c63c8d625c7db2e", "task_path": "tasks/rl_align__o_proofs_num_valid_tuples__2d0e4f529a975ef5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_num_valid_tuples", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_7_digit_nums__e3c5ac4c7b2f4a42", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_7_digit_nums :\n Set.ncard {n : ℕ | n ∈ Finset.Icc 1000000 9999999 ∧ (Nat.digits 10 n).toFinset = {1, 2, 3, 4, 5, 6, 7} ∧ n % 7 = 5} = Nat.factorial 6 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_7_digit_nums", "source_license": null, "theorem_names": ["number_of_7_digit_nums"], "statement_sha256": "e3c5ac4c7b2f4a426cf91f0580e40207bfe63252dd20f194bd4483da5065a41f", "task_path": "tasks/rl_align__o_proofs_number_of_7_digit_nums__e3c5ac4c7b2f4a42", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_7_digit_nums", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_continuous_functions__a7772a3e5fa86fd7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\ntheorem number_of_continuous_functions :\n Set.Infinite {f : ℝ → ℝ | ContinuousOn f (Set.Icc 0 1) ∧ ∫ x in (0)..1, (f x)^2 = 2 * ∫ x in (0)..1, f x} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_continuous_functions", "source_license": null, "theorem_names": ["number_of_continuous_functions"], "statement_sha256": "a7772a3e5fa86fd7a6e384196450b6538e99f8ae3c47164bb23679aec821d512", "task_path": "tasks/rl_align__o_proofs_number_of_continuous_functions__a7772a3e5fa86fd7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_continuous_functions", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_differences__85cf767757f6ad14", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_differences :\n Set.ncard {d : ℤ | ∃ n : ℕ, d > 0 ∧ n ≥ 3 ∧ 119 + (n - 1) * d = 179} = 11 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_differences", "source_license": null, "theorem_names": ["number_of_differences"], "statement_sha256": "85cf767757f6ad142631e80ff0c7a74758d90d4336ddefda7f0b44be568de22e", "task_path": "tasks/rl_align__o_proofs_number_of_differences__85cf767757f6ad14", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_differences", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_distributions_8__682c4b504863246c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_distributions :\n Set.ncard {f : Fin 7 → ℕ | ∀ i, f i ≥ 1 ∧ ∑ i, f i = 10} = 84 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_distributions_8", "source_license": null, "theorem_names": ["number_of_distributions"], "statement_sha256": "682c4b504863246cc800c861c729503c308d22f15bb7a1914f81cd95fbfd37ff", "task_path": "tasks/rl_align__o_proofs_number_of_distributions_8__682c4b504863246c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_distributions_8", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_favorable_outcomes_3__7ffcf6fd5a476dee", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_favorable_outcomes :\n {(a : Fin 10 → ℕ)| (∀ i, a i ∈ Set.Icc 1 3) ∧\n (a 0 < a 1 ∧ a 2 < a 3 ∧ a 4 < a 5 ∧ a 6 < a 7 ∧ a 8 < a 9) ∧\n (a 1 > a 2 ∧ a 3 > a 4 ∧ a 5 > a 6 ∧ a 7 > a 8)}.ncard = 144 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_favorable_outcomes_3", "source_license": null, "theorem_names": ["number_of_favorable_outcomes"], "statement_sha256": "7ffcf6fd5a476deea623fff46de036cd2bf0e7441f6631577df008895943388a", "task_path": "tasks/rl_align__o_proofs_number_of_favorable_outcomes_3__7ffcf6fd5a476dee", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_favorable_outcomes_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_favorable_outcomes_5__31a404a7aa309e7c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_favorable_outcomes :\n {A : Finset ℕ | ∃ U, A ⊆ U ∧ U = Finset.Icc 1 8 ∧\n A.card = 4 ∧ ∃ B : Finset ℕ, B ⊆ U \\ A ∧ B.card = 4 ∧\n ∑ i ∈ A, i < ∑ i ∈ B, i}.ncard = 31 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_favorable_outcomes_5", "source_license": null, "theorem_names": ["number_of_favorable_outcomes"], "statement_sha256": "31a404a7aa309e7c523fb696460c9944ec0eace4b4a1368c282c23a0f6943bc9", "task_path": "tasks/rl_align__o_proofs_number_of_favorable_outcomes_5__31a404a7aa309e7c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_favorable_outcomes_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_five_digit_numbers_2__55b43ecd9a6e58e7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_five_digit_numbers :\n Set.ncard {n : ℕ | n > 30000 ∧ n % 5 = 0 ∧ (Nat.digits 10 n).length = 5 ∧ (Nat.digits 10 n).toFinset = {1, 2, 3, 4, 5}} = 12 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_five_digit_numbers_2", "source_license": null, "theorem_names": ["number_of_five_digit_numbers"], "statement_sha256": "55b43ecd9a6e58e76e7578a60d47ddab02cdc974eb899ec6a977ce941004389f", "task_path": "tasks/rl_align__o_proofs_number_of_five_digit_numbers_2__55b43ecd9a6e58e7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_five_digit_numbers_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_integers_18__b3464366b71cd5cb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_integers :\n Set.encard {n : ℤ | ∃ a b c : ℕ, Odd a ∧ Odd b ∧ Odd c ∧ a ≠ b ∧ a ≠ c ∧ b ≠ c ∧ n = a + b + c ∧ 3 ≤ a ∧ a ≤ 19 ∧ 3 ≤ b ∧ b ≤ 19 ∧ 3 ≤ c ∧ c ≤ 19} = 19 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_integers_18", "source_license": null, "theorem_names": ["number_of_integers"], "statement_sha256": "b3464366b71cd5cb4ad175dee4bddc74b4bec622962a2928a0ba3cd25ab94367", "task_path": "tasks/rl_align__o_proofs_number_of_integers_18__b3464366b71cd5cb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_integers_18", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_lattice_points_4__5ec5b1365f089552", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_lattice_points :\n Set.ncard {p : ℤ × ℤ | p.1 ≥ 2002 ∧ p.2 ≥ 2022 ∧ p.1 ≤ 2022 ∧ p.2 ≤ 2202 ∧ ∃ k : ℚ, (p.1 - 2002) / (2022 - 2002) = k ∧ (p.2 - 2022) / (2202 - 2022) = k} = 21 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_lattice_points_4", "source_license": null, "theorem_names": ["number_of_lattice_points"], "statement_sha256": "5ec5b1365f089552b09c5eb2a8e0f0ea76697ef612e2cdb3d77ca5161aed8f6e", "task_path": "tasks/rl_align__o_proofs_number_of_lattice_points_4__5ec5b1365f089552", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_lattice_points_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_nat_x__ca75cad028862dc0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_nat_x :\n Set.encard {n : ℕ | (Nat.digits 12 n).length = 3 ∧ (Nat.digits 9 n).length = 4} = 999 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_nat_x", "source_license": null, "theorem_names": ["number_of_nat_x"], "statement_sha256": "ca75cad028862dc0006a4cc5603ddecd6bfce716c51402178971cb9f1494f87c", "task_path": "tasks/rl_align__o_proofs_number_of_nat_x__ca75cad028862dc0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_nat_x", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_non_decreasing_sequences__4a30358e0ce87f30", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_non_decreasing_sequences :\n Set.ncard {s : Fin 6 → ℕ | (∀ i j, i < j → s i ≤ s j) ∧\n (∀ i, s i ∈ Finset.Icc 1 6)} = Nat.choose 11 5 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_non_decreasing_sequences", "source_license": null, "theorem_names": ["number_of_non_decreasing_sequences"], "statement_sha256": "4a30358e0ce87f3017c38d0910625a535d7afa8ac8eefc9c327b70afdbb9c934", "task_path": "tasks/rl_align__o_proofs_number_of_non_decreasing_sequences__4a30358e0ce87f30", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_non_decreasing_sequences", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_non_increasing_5_digit_sequences__559b775b113e39e6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_non_increasing_5_digit_sequences : Set.ncard {a : Fin 5 → ℕ | ∀ i j, i < j → a i ≥ a j ∧ ∀ i, a i ≤ 9} = 2002 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_non_increasing_5_digit_sequences", "source_license": null, "theorem_names": ["number_of_non_increasing_5_digit_sequences"], "statement_sha256": "559b775b113e39e607498f67d7a4219efa354a2dce993ff25d77e135b52533ac", "task_path": "tasks/rl_align__o_proofs_number_of_non_increasing_5_digit_sequences__559b775b113e39e6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_non_increasing_5_digit_sequences", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_pairs_105__413cf2721bf78dfe", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_pairs :\n Set.ncard {p : ℤ × ℤ | p.1 * p.2 ≥ 0 ∧ p.1 ^ 3 + p.2 ^ 3 + 99 * p.1 * p.2 = 33 ^ 3} = 35 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_pairs_105", "source_license": null, "theorem_names": ["number_of_pairs"], "statement_sha256": "413cf2721bf78dfef55d439b1baff9a15f653627f261331ee45ff99a2d4f49aa", "task_path": "tasks/rl_align__o_proofs_number_of_pairs_105__413cf2721bf78dfe", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_pairs_105", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_pairs_283__173fdbb13c6189fd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_pairs : Set.ncard {(a, b) : ℕ × ℕ | a > 0 ∧ b > 0 ∧ Nat.gcd a b = 1 ∧ ∃ k : ℤ, (a / b : ℚ) + 14 * b / (9 * a) = k} = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_pairs_283", "source_license": null, "theorem_names": ["number_of_pairs"], "statement_sha256": "173fdbb13c6189fdd53b384ce5131f0f8997a95824b24445f91e4cb0a4f3ca85", "task_path": "tasks/rl_align__o_proofs_number_of_pairs_283__173fdbb13c6189fd", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_pairs_283", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_pairs_39__a7f58d461e4c78a2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_pairs : (Set.ncard {p : ℤ × ℤ | p.1 ≠ 0 ∧ p.2 ≠ 0 ∧ -2015 ≤ p.1 ∧ p.1 ≤ 2015 ∧ -2015 ≤ p.2 ∧ p.2 ≤ 2015 ∧ ∃ x : ℤ, p.1 * x = p.2 ∧ p.2 * x = p.1}) = 8060 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_pairs_39", "source_license": null, "theorem_names": ["number_of_pairs"], "statement_sha256": "a7f58d461e4c78a2530fc60c6c9a301300f14af4c6c5a084008c079151213f18", "task_path": "tasks/rl_align__o_proofs_number_of_pairs_39__a7f58d461e4c78a2", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_pairs_39", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_pairs_79__30751311faed7116", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_pairs : Set.ncard {p : ℕ × ℕ | p.1 > 0 ∧ p.2 > 0 ∧ (2 : ℤ)^p.1 - p.2^2 = 4} = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_pairs_79", "source_license": null, "theorem_names": ["number_of_pairs"], "statement_sha256": "30751311faed711627029d4929b9b10e8f10d8af55814af262405c7eb5c8be17", "task_path": "tasks/rl_align__o_proofs_number_of_pairs_79__30751311faed7116", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_pairs_79", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_pairs_94__233a2c588de57128", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_pairs :\n Set.ncard {p : ℕ × ℕ | p.1 > 0 ∧ p.2 > 0 ∧ p.1 + p.2 ≤ 6} = 15 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_pairs_94", "source_license": null, "theorem_names": ["number_of_pairs"], "statement_sha256": "233a2c588de5712802891b19e9d0b5e096ed017d0f48f80f20e042377287b044", "task_path": "tasks/rl_align__o_proofs_number_of_pairs_94__233a2c588de57128", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_pairs_94", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_permutations_6__20bfcc2a7875b20a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_permutations :\n Set.ncard {p : Fin 5 → ℕ | (∀ i j, p i = p j → i = j) ∧\n (∀ i, p i ∈ Finset.Icc 1 5) ∧ 3 ∣ p 0 * p 1 * p 2 + p 1 * p 2 * p 3 +\n p 2 * p 3 * p 4 + p 3 * p 4 * p 0 + p 4 * p 0 * p 1} = 80 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_permutations_6", "source_license": null, "theorem_names": ["number_of_permutations"], "statement_sha256": "20bfcc2a7875b20a200dc8f6a657822061e88d73a6635949a959723cc3430e6a", "task_path": "tasks/rl_align__o_proofs_number_of_permutations_6__20bfcc2a7875b20a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_permutations_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_points_14__3c43975ca38d7b4b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_points :\n Set.ncard {p : ℤ × ℤ | p.1 > 1 ∧ p.2 > 1 ∧ p.1 < 100 ∧ p.2 < 1000 ∧\n (p.1 - 1) * (1000 - 1) = (p.2 - 1) * (100 - 1)} = 8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_points_14", "source_license": null, "theorem_names": ["number_of_points"], "statement_sha256": "3c43975ca38d7b4bdf01fea2eb60e8a78d932d8c57cab3297397a1c2a4b4ae0b", "task_path": "tasks/rl_align__o_proofs_number_of_points_14__3c43975ca38d7b4b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_points_14", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_roots_6__5efc752a9bffabf6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem number_of_roots (a b c : ℝ)\n (h1 : ∫ x in (0 : ℝ)..4, a * x^2 + b * x + c = 1)\n (h2 : ∫ x in (0 : ℝ)..4, x * (a * x^2 + b * x + c) = 2)\n (h3 : ∫ x in (0 : ℝ)..4, x^2 * (a * x^2 + b * x + c) = 3) :\n ∃ x : ℝ, 0 ≤ x ∧ x ≤ 4 ∧ a * x^2 + b * x + c = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_roots_6", "source_license": null, "theorem_names": ["number_of_roots"], "statement_sha256": "5efc752a9bffabf68a9e5e92fdc2f12a1255330701a6bcb1ee107bb985990b7a", "task_path": "tasks/rl_align__o_proofs_number_of_roots_6__5efc752a9bffabf6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_roots_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_solutions_118__d9282fc8381a94ac", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_solutions :\n Set.ncard {s : Fin 3 → ℕ | s 0 + s 1 + s 2 = 20 ∧ s 0 ≤ 10 ∧ s 1 ≤ 5 ∧ s 2 ≤ 15} = 51 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_solutions_118", "source_license": null, "theorem_names": ["number_of_solutions"], "statement_sha256": "d9282fc8381a94ace7bcb245cae5420fc0858566f6284036581d8aace3393403", "task_path": "tasks/rl_align__o_proofs_number_of_solutions_118__d9282fc8381a94ac", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_solutions_118", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_solutions_155__87a9f0caf68c1e4e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_solutions :\n Set.encard {n : ℕ | ∃ p : ℕ, Nat.Prime p ∧ p = (n ^ 2 - 3 * n + 1) ^ 2 + 1} = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_solutions_155", "source_license": null, "theorem_names": ["number_of_solutions"], "statement_sha256": "87a9f0caf68c1e4e2ec9d60cf44df423bbf06759f70e475b57b1c8e8eff478ed", "task_path": "tasks/rl_align__o_proofs_number_of_solutions_155__87a9f0caf68c1e4e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_solutions_155", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_solutions_250__3a8d33097a1d6b51", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_solutions : Set.ncard {p : Fin 5 → ℕ | p 0 + p 1 + p 2 + p 3 + p 4 = 15} = 3876 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_solutions_250", "source_license": null, "theorem_names": ["number_of_solutions"], "statement_sha256": "3a8d33097a1d6b5173b46c16658df200038f7ac276f119469239c5eb7f27f3e1", "task_path": "tasks/rl_align__o_proofs_number_of_solutions_250__3a8d33097a1d6b51", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_solutions_250", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_solutions_327__145a437fd5c59e68", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_solutions (f : ℝ → ℝ) (hf : f = fun (x:ℝ) => (144 - x^(1/3:ℝ))): Set.ncard {n : ℤ | ∃x ≥ 0, n ^ 2 = f x} = 25 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_solutions_327", "source_license": null, "theorem_names": ["number_of_solutions"], "statement_sha256": "145a437fd5c59e68d249fbc342d025677f36dc6e18f31958b1b0ee88a4ed4d92", "task_path": "tasks/rl_align__o_proofs_number_of_solutions_327__145a437fd5c59e68", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_solutions_327", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_solutions_377__1c9cd50756c087d9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_solutions : Set.ncard {x : ℤ × ℤ | x.1 ^ 2 - x.2 ^ 2 + x.1 + x.2 = 2014} = 16 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_solutions_377", "source_license": null, "theorem_names": ["number_of_solutions"], "statement_sha256": "1c9cd50756c087d9c85e48bc9cad3dfb848360d5fedbeb5095a1d376a64325ff", "task_path": "tasks/rl_align__o_proofs_number_of_solutions_377__1c9cd50756c087d9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_solutions_377", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_solutions_404__c893258505fd66a5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_solutions :\n Set.ncard {p : Fin 3 → ℕ | ∃ x y z, p = ![x, y, z] ∧ x > 0 ∧ y > 0 ∧ z > 0 ∧ x + y + z = 100 ∧ x > y ∧ y > z} = 784 := by sorry", "target_workspace": {"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"}, "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_number_of_solutions_404", "source_license": null, "theorem_names": ["number_of_solutions"], "statement_sha256": "c893258505fd66a57e1ed4543f116b3bd63b4d66637e081fd7aa42772782f3eb", "task_path": "tasks/rl_align__o_proofs_number_of_solutions_404__c893258505fd66a5", "metadata": {"split": "train", "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_number_of_solutions_404", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_solutions_87__5d3f2c8a2e8aa56a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_solutions : {s : Fin 10 → ℕ | (∀ i, s i = 1 ∨ s i = 0) ∧ 3 ≤ (∑ i, if s i = 1 then 1 else 0) ∧ 3 ≤ (∑ i, if s i = 0 then 1 else 0)}.ncard = 912 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_solutions_87", "source_license": null, "theorem_names": ["number_of_solutions"], "statement_sha256": "5d3f2c8a2e8aa56aeccaafea644f6f88137c6eec8b619a64953bed053c1816a9", "task_path": "tasks/rl_align__o_proofs_number_of_solutions_87__5d3f2c8a2e8aa56a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_solutions_87", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_solutions_96__2fdc6030ba7c55ef", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_solutions :\n Set.ncard {x : ℕ | x > 0 ∧ ⌊(x / 7 : ℝ)⌋ = ⌊(x / 9 : ℝ)⌋} = 15 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_solutions_96", "source_license": null, "theorem_names": ["number_of_solutions"], "statement_sha256": "2fdc6030ba7c55ef3370b79d80aa721dd855128678febedd1a84724f1303f211", "task_path": "tasks/rl_align__o_proofs_number_of_solutions_96__2fdc6030ba7c55ef", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_solutions_96", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_special_favor__9ce06150e54f36db", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_special_favor :\n\n Set.ncard {N : ℕ | N ∈ Finset.Ico 4000 6000 ∧ 5 ∣ N ∧ (Nat.digits 10 N).length = 4 ∧ 3 ≤ (Nat.digits 10 N)[1]! ∧ (Nat.digits 10 N)[1]! < (Nat.digits 10 N)[2]! ∧ (Nat.digits 10 N)[2]! ≤ 6 } = 24 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_special_favor", "source_license": null, "theorem_names": ["number_of_special_favor"], "statement_sha256": "9ce06150e54f36db18bc2aa5838199b701da8218f97de820fcbbd542620e2eea", "task_path": "tasks/rl_align__o_proofs_number_of_special_favor__9ce06150e54f36db", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_special_favor", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_triples_26__2429a93988e267ac", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_triples :\n {(D, E, F) : Finset ℕ × Finset ℕ × Finset ℕ |\n D ⊆ {1, 2, 3, 4, 5, 6, 7, 8} ∧\n E ⊆ {1, 2, 3, 4, 5, 6, 7, 8} ∧\n F ⊆ {1, 2, 3, 4, 5, 6, 7, 8} ∧\n (D ∩ E).card = 1 ∧\n (E ∩ F).card = 1 ∧\n (F ∩ D).card = 1 ∧\n (D ∩ E ∩ F) = ∅}.ncard ≡ 64 [MOD 1000] := by sorry", "target_workspace": {"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"}, "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_number_of_triples_26", "source_license": null, "theorem_names": ["number_of_triples"], "statement_sha256": "2429a93988e267ac8daad5d5ed920306f0d1a1a009438eda7ed500935abf1b8c", "task_path": "tasks/rl_align__o_proofs_number_of_triples_26__2429a93988e267ac", "metadata": {"split": "train", "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_number_of_triples_26", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_unordered_pairs_2__90c54c9fd5061d9c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_unordered_pairs :\n Set.ncard {p : ℕ × ℕ | p.1 ∈ Finset.Icc 1 2000 ∧ p.2 ∈ Finset.Icc 1 2000 ∧ Nat.gcd p.1 p.2 = 1 ∧ p.1 ≤ p.2} =\n ∑ k ∈ Finset.Icc 1 2000, Nat.totient k := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_unordered_pairs_2", "source_license": null, "theorem_names": ["number_of_unordered_pairs"], "statement_sha256": "90c54c9fd5061d9c7c91c404787a07e47c80677e416b44b8eabc125ecda7f988", "task_path": "tasks/rl_align__o_proofs_number_of_unordered_pairs_2__90c54c9fd5061d9c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_unordered_pairs_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_ways_104__779208fabf8176d7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_ways :\n Set.ncard {a : Fin 6 → ℕ | (∀ i j, i < j → a i ≤ a j) ∧ ∀ i, 1 ≤ a i ∧ a i ≤ 8} = Nat.choose 13 7 ∧\n Set.ncard {a : Fin 6 → ℕ | (∀ i j, i ≠ j → a i ≠ a j) ∧ (∀ i j, i < j → a i < a j) ∧\n ∀ i, 1 ≤ a i ∧ a i ≤ 8} = Nat.choose 8 6 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_ways_104", "source_license": null, "theorem_names": ["number_of_ways"], "statement_sha256": "779208fabf8176d78d4903389cba1a5bdd936f9f07d3fde3faea6217263570e1", "task_path": "tasks/rl_align__o_proofs_number_of_ways_104__779208fabf8176d7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_ways_104", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_ways_117__5ccf9573ec1ee35a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_ways :\n Set.ncard {x : Finset ℕ | ∃ a b : ℕ, x = {a, b} ∧ a ∈ Finset.Icc 1 50 ∧ b ∈ Finset.Icc 1 50 ∧ a ≠ b ∧ |(a : ℤ) - b| = 11 ∧ 5 ∣ a * b} = 15 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_ways_117", "source_license": null, "theorem_names": ["number_of_ways"], "statement_sha256": "5ccf9573ec1ee35a1188a2f9525d9337d37ecb44faccc962274603e8d91f9c04", "task_path": "tasks/rl_align__o_proofs_number_of_ways_117__5ccf9573ec1ee35a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_ways_117", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_ways_42__55de4adcbd4a6627", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_of_ways (n m : ℕ) (hn : n = 8) (hm : m = 4):\n {x : Fin m → ℕ | ∑ i, x i = n}.ncard = 165 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_ways_42", "source_license": null, "theorem_names": ["number_of_ways"], "statement_sha256": "55de4adcbd4a6627e03e796a9b9e4dcd79913b530e61c42d1eecec5a486c8100", "task_path": "tasks/rl_align__o_proofs_number_of_ways_42__55de4adcbd4a6627", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_ways_42", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_ways_to_select_5_numbers__278b478f662cc75f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_ways_to_select_5_numbers :\n Set.ncard {x : Finset ℕ | x ⊆ Finset.Icc 1 18 ∧ x.card = 5 ∧ ∀ m ∈ x, ∀ n ∈ x, m ≠ n → |(m : ℤ) - n| ≥ 2} = Nat.choose 14 5 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_ways_to_select_5_numbers", "source_license": null, "theorem_names": ["number_of_ways_to_select_5_numbers"], "statement_sha256": "278b478f662cc75fc07737ae31744abc81e144f1470e6389c7c1835c76b62b71", "task_path": "tasks/rl_align__o_proofs_number_of_ways_to_select_5_numbers__278b478f662cc75f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_of_ways_to_select_5_numbers", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_x_28__57c951745c9a4edf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem number_of_x :\n Set.ncard {x : ℤ | ∃ a b c, a = 10 ∧ b = 24 ∧ c = x ∧ a + b > c ∧ b + c > a ∧ c + a > b ∧\n (arccos ((a^2 + b^2 - c^2)/(2*a*b)) < π/2) ∧ (arccos ((b^2 + c^2 - a^2)/(2*b*c)) < π/2) ∧\n (arccos ((c^2 + a^2 - b^2)/(2*c*a)) < π/2)} = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_x_28", "source_license": null, "theorem_names": ["number_of_x"], "statement_sha256": "57c951745c9a4edf61c54a1e75a13aec20e09fa93b0956951dae54fa99b38bec", "task_path": "tasks/rl_align__o_proofs_number_of_x_28__57c951745c9a4edf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_x_28", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_of_x_5__2d17c8a4976deb79", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_of_x : Set.ncard {x : ℕ | ∃ y : ℕ, x > 0 ∧ y > 0 ∧ (1 + x / 100 : ℝ) * (1 - y / 100 : ℝ) = 1} = 12 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_x_5", "source_license": null, "theorem_names": ["number_of_x"], "statement_sha256": "2d17c8a4976deb79207038234ef90e62ec949e687ba88619d069d525aa022ed9", "task_path": "tasks/rl_align__o_proofs_number_of_x_5__2d17c8a4976deb79", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_of_x_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_101959__f2f87e9d92faa395", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_101959 {A : Set ℕ} (hA : ∀ x ∈ A, x > 0)\n (hA1 : 1 ∈ A) (hA2 : ∃ x ∈ A, x ≠ 1) (hA3 : ∀ m ∈ A, ∀ n ∈ A,\n m ≠ n → (m + 1) / Nat.gcd (m + 1) (n + 1) ∈ A) :\n A = {x | x > 0} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_101959", "source_license": null, "theorem_names": ["number_theory_101959"], "statement_sha256": "f2f87e9d92faa3959679383c8fcefa9957f0fa4bb1d92b8ab2d1e1ae219faadc", "task_path": "tasks/rl_align__o_proofs_number_theory_101959__f2f87e9d92faa395", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_101959", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_10724__12887fa5b7c78508", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_10724 :\n Set.ncard {x : ℤ | ∃ k : ℤ, 100 ≤ k ∧ k ≤ 999 ∧ x = ⌊(5 * k / 6 : ℝ)⌋} = 750 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_10724", "source_license": null, "theorem_names": ["number_theory_10724"], "statement_sha256": "12887fa5b7c7850872d2a070dfd1eecab751b6cfaa268fafa32b7fb6c91f3a8d", "task_path": "tasks/rl_align__o_proofs_number_theory_10724__12887fa5b7c78508", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_10724", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_126980__dce4c9c2d334057e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_126980 (a : Fin 5 → ℤ) :\n ∃ s : Finset (Fin 5), s.card = 3 ∧ 3 ∣ ∑ i ∈ s, a i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_126980", "source_license": null, "theorem_names": ["number_theory_126980"], "statement_sha256": "dce4c9c2d334057e9c4fc4825bb4933258cb345661e69954b1fde1bbd8dad95c", "task_path": "tasks/rl_align__o_proofs_number_theory_126980__dce4c9c2d334057e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_126980", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_13804__c768fa79f0912c64", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_13804 (s : Set ℕ) (hs : s = {N : ℕ | ∃ a b c : ℕ, 0 < a ∧ 0 < b ∧ 0 < c ∧\n a * b * c = 6 * (a + b + c) ∧ a = b + c ∧ N = a * b * c}) :\n ∑ᶠ N ∈ s, N = 336 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_13804", "source_license": null, "theorem_names": ["number_theory_13804"], "statement_sha256": "c768fa79f0912c64088912ee1148b9f40bf4d862877489b31957a6a83e172789", "task_path": "tasks/rl_align__o_proofs_number_theory_13804__c768fa79f0912c64", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_13804", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_1470__c75c3e01c358166e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_1470 (a : Fin 1992 → ℤ) (ha : ∀ i, a i = 1 ∨ a i = -1) :\n Even (∑ i, a i * (i + 1)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_1470", "source_license": null, "theorem_names": ["number_theory_1470"], "statement_sha256": "c75c3e01c358166e7b963ba8007861a2ddf58d977f69292d64cb69f0a8f8958c", "task_path": "tasks/rl_align__o_proofs_number_theory_1470__c75c3e01c358166e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_1470", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_15588__0c3f34226358bee5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_15588 :\n Set.ncard {n : ℕ | n ∈ Finset.Icc 10 99 ∧ Odd (Nat.divisors n).card} = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_15588", "source_license": null, "theorem_names": ["number_theory_15588"], "statement_sha256": "0c3f34226358bee5a2e1bd8d33575d035dea121840a9230dbe359b26913d2ab9", "task_path": "tasks/rl_align__o_proofs_number_theory_15588__0c3f34226358bee5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_15588", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_162325__13c723a083038627", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_162325 :\n Set.ncard {k : ℕ | 1 ≤ k ∧ k ≤ 2013 ∧ (k ^ k) % 10 = 1} = 202 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_162325", "source_license": null, "theorem_names": ["number_theory_162325"], "statement_sha256": "13c723a0830386278a1483578f3d887764cbc356ff404147a7c1f36fef50fcf5", "task_path": "tasks/rl_align__o_proofs_number_theory_162325__13c723a083038627", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_162325", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_162811__806bfa43ac063ecf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_162811 (p : ℕ) (hp : Nat.Prime p) :\n Set.Infinite {n : ℕ | 0 < n ∧ (p : ℤ) ∣ (2^n - n : ℤ)} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_162811", "source_license": null, "theorem_names": ["number_theory_162811"], "statement_sha256": "806bfa43ac063ecff1e0ede3c83b3963f07461b54263b0964136000b82ebbdbd", "task_path": "tasks/rl_align__o_proofs_number_theory_162811__806bfa43ac063ecf", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_162811", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_19302__1191b6e8a08f7e6b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_19302 :\n Set.ncard {a : Fin 3 → ℕ | a.Injective ∧ ∀ i, Nat.Prime (a i) ∧ a 0 < a 1 ∧ a 1 < a 2 ∧ a 0 + a 1 + a 2 = 20} = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_19302", "source_license": null, "theorem_names": ["number_theory_19302"], "statement_sha256": "1191b6e8a08f7e6b974b37d1a32a7b484e462005a9dde98068660640c6ea9f47", "task_path": "tasks/rl_align__o_proofs_number_theory_19302__1191b6e8a08f7e6b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_19302", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_19505__e68855c6b2d07510", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_19505 :\n Set.ncard {x : ℕ | Nat.Prime x ∧ x < 30 ∧ Odd x ∧ x > 0} = 9 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_19505", "source_license": null, "theorem_names": ["number_theory_19505"], "statement_sha256": "e68855c6b2d0751057fd2b9eff827f3710de5f289771f6ea19ae71e78d355d66", "task_path": "tasks/rl_align__o_proofs_number_theory_19505__e68855c6b2d07510", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_19505", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_201291__4f6808c387ce80e2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem number_theory_201291 {k : ℕ → ℕ}\n (hk : ∀ a, k a = {p : ℕ × ℕ | p.1 ∈ Icc 1 a ∧ p.2 ∈ Icc 1 a ∧ Nat.Coprime p.1 p.2}.ncard) :\n ∑ i ∈ Icc 1 100, k (100 / i) = (100 ^ 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_201291", "source_license": null, "theorem_names": ["number_theory_201291"], "statement_sha256": "4f6808c387ce80e2e24c8eb139e3fc85830c4eadbe772897fc0484c880a29dff", "task_path": "tasks/rl_align__o_proofs_number_theory_201291__4f6808c387ce80e2", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_201291", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_203595__540ffb48b071feeb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_203595 {E : ℕ → ℕ} (m : ℕ)\n (hE : ∀n, E n = ∑ i ∈ Finset.range n, 10 ^ i)\n (h : Nat.Coprime m 10) : Set.Infinite {n | m ∣ E n} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_203595", "source_license": null, "theorem_names": ["number_theory_203595"], "statement_sha256": "540ffb48b071feebe8ef27cca1fb12c4a574bd3a5e5acf32facab6dd7be45bb4", "task_path": "tasks/rl_align__o_proofs_number_theory_203595__540ffb48b071feeb", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_203595", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_220682__b14441a8238411dd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_220682 (S : Finset ℕ) (hS : S ⊆ Finset.Icc 1 2018) (hS1 : S.card = 1616) :\n (∏ x ∈ S, x) % 10 = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_220682", "source_license": null, "theorem_names": ["number_theory_220682"], "statement_sha256": "b14441a8238411dd1872189815981d2c38d45df9e20db147d0fd3bebceba6656", "task_path": "tasks/rl_align__o_proofs_number_theory_220682__b14441a8238411dd", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_220682", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_225305__5008d0a1824b4e65", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_225305 (S : Finset ℕ) (hS : S = Finset.Icc 1 2002) :\n ∃ T : Finset ℕ, T ⊆ S ∧ T.card = 1001 ∧\n (∑ i ∈ T, i) % 10 > (∑ i ∈ (S \\ T), i) % 10 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_225305", "source_license": null, "theorem_names": ["number_theory_225305"], "statement_sha256": "5008d0a1824b4e65b2455f2ad987a2055bc500ad0e28006d9e41a6ddbff7970e", "task_path": "tasks/rl_align__o_proofs_number_theory_225305__5008d0a1824b4e65", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_225305", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_226226__38fef6bf60baae98", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_226226 :\n Set.ncard {p : Fin 2 → ℤ | p 0 ∈ Finset.Icc 1 1000 ∧ p 1 ∈ Finset.Icc 1 1000 ∧ 7 ∣ p 0 ^ 2 + p 1 ^ 2} = 20164 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_226226", "source_license": null, "theorem_names": ["number_theory_226226"], "statement_sha256": "38fef6bf60baae980914ab091e595223ac8659e0a349b8476b1c7875bd05d904", "task_path": "tasks/rl_align__o_proofs_number_theory_226226__38fef6bf60baae98", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_226226", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_232386__632479b112ef6077", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\ntheorem number_theory_232386 {f : ℕ → ℕ}\n (hf : ∀ n, f n = ∑ d ∈ n.divisors, d) :\n {n | 0 < n ∧ f (f n) = n + 2}.ncard = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_232386", "source_license": null, "theorem_names": ["number_theory_232386"], "statement_sha256": "632479b112ef6077d9ddc0654539db0f1903661c5cbe2dd582bc61b146cf25c4", "task_path": "tasks/rl_align__o_proofs_number_theory_232386__632479b112ef6077", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_232386", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_23290__03852d3d1d34161a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\ntheorem number_theory_23290 {r : Set ℕ}\n (hr : r = { n : ℕ | ∃a b : ℕ,\n 1 ≤ a ∧ a ≤ 9 ∧ b ≤ 9 ∧ n = 10 * a + b ∧ n = a + b + a * b\n }) :\n (∑ᶠ d ∈ r, d) / (r.ncard : ℝ) = 59 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_23290", "source_license": null, "theorem_names": ["number_theory_23290"], "statement_sha256": "03852d3d1d34161af4c158be1bfab2018a7a10c1655d2445e1946529110a93c3", "task_path": "tasks/rl_align__o_proofs_number_theory_23290__03852d3d1d34161a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_23290", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_235230__fda39782d177fbc2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_235230 (R : ℝ) (hR : R = Real.sqrt 1105) :\n Set.ncard {p : ℤ × ℤ | p.1^2 + p.2^2 = R^2} = 32 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_235230", "source_license": null, "theorem_names": ["number_theory_235230"], "statement_sha256": "fda39782d177fbc28dc985b3ea1617204cb7169a82507894f39135c24e6f9ae2", "task_path": "tasks/rl_align__o_proofs_number_theory_235230__fda39782d177fbc2", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_235230", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_238786__e040c027c997be1e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_238786 :\n Set.ncard {N : ℕ | N > 0 ∧ ((∃ k, N = k ∧ k ∈ Finset.Icc 1000 9999) ∧ ¬(∃ m, N + 20 = m ∧ m ∈ Finset.Icc 1000 9999)) ∨ (¬(∃ k, N = k ∧ k ∈ Finset.Icc 1000 9999) ∧ ∃ m, N + 20 = m ∧ m ∈ Finset.Icc 1000 9999)} = 40 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_238786", "source_license": null, "theorem_names": ["number_theory_238786"], "statement_sha256": "e040c027c997be1ef7c9ee5bc125f64dbbe177727cfe425b5b1dd765e3c940d5", "task_path": "tasks/rl_align__o_proofs_number_theory_238786__e040c027c997be1e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_238786", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_252822__3059bf14024dfb2a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_252822 :\n Set.ncard {n : ℕ | (Nat.digits 10 (n^2)).length + (Nat.digits 10 (n^3)).length = 10} = 53 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_252822", "source_license": null, "theorem_names": ["number_theory_252822"], "statement_sha256": "3059bf14024dfb2ab313fc8be7b066469d3f0ec1d84d0f2dba48f5a4f0923633", "task_path": "tasks/rl_align__o_proofs_number_theory_252822__3059bf14024dfb2a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_252822", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_254236__11246ae01ab494dc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_254236 :\n Set.Infinite {p : ℕ | ∃ n, p.Prime ∧ ∃ k : ℤ, Real.sqrt (p + n) + Real.sqrt n = k} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_254236", "source_license": null, "theorem_names": ["number_theory_254236"], "statement_sha256": "11246ae01ab494dc32c9a4d69848a8123015f064d85c2d666bdb3622d82f09c8", "task_path": "tasks/rl_align__o_proofs_number_theory_254236__11246ae01ab494dc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_254236", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_2544__47d2cae46a10c8bd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_2544 : Set.ncard {x : ℕ | ∃ y : ℕ, x > 0 ∧ y > 0 ∧ x ^ 2 - y ^ 2 = 1995} = 8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_2544", "source_license": null, "theorem_names": ["number_theory_2544"], "statement_sha256": "47d2cae46a10c8bde0b201dc67fea5eb10b0b26e61e941d9e6ccc0a1ef86aaad", "task_path": "tasks/rl_align__o_proofs_number_theory_2544__47d2cae46a10c8bd", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_2544", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_262955__51ff7a0125602af8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_262955 :\n Set.ncard {x : ℚ | ∃ a b : ℕ, x = a / b ∧ a + b = 2022 ∧ ∃ c : ℤ, x = c} = 8 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_262955", "source_license": null, "theorem_names": ["number_theory_262955"], "statement_sha256": "51ff7a0125602af879fa97aee709439daf9952e30efcd81d1388829f6ef32a79", "task_path": "tasks/rl_align__o_proofs_number_theory_262955__51ff7a0125602af8", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_262955", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_264952__cc12070de452406f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_264952 (n : ℕ) :\n Set.ncard {p : ℕ × ℕ | p.1 > 0 ∧ p.2 > 0 ∧ p.1 + p.2 = n ∧ p.1 ≤ p.2} = ⌊n / 2⌋₊ := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_264952", "source_license": null, "theorem_names": ["number_theory_264952"], "statement_sha256": "cc12070de452406fe5604cfd6b14655a7cd482851628dac3e26d0a66d67115cc", "task_path": "tasks/rl_align__o_proofs_number_theory_264952__cc12070de452406f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_264952", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_283971__8a1f14c181b943ad", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_283971 (p : Fin 99 → ℕ) (hp : ∀ i, Nat.Prime (p i)) (hpi : ∀ i j, p i = p j → i = j) :\n (∑ i, (p i)^2) % 3 = 0 ∨ (∑ i, (p i)^2) % 3 = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_283971", "source_license": null, "theorem_names": ["number_theory_283971"], "statement_sha256": "8a1f14c181b943adcd4dba4980f34503c7351e3cd99ba678c8f578e392a06b9e", "task_path": "tasks/rl_align__o_proofs_number_theory_283971__8a1f14c181b943ad", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_283971", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_29252__9cd13c8e51cb7e60", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\ntheorem number_theory_29252 : Set.Infinite {n : ℕ | 0 < n ∧ 2553 ∣ 3 +\n ∑ i ∈ Finset.range n, 5 * 10 ^ (i + 1) + 2 * 10 ^ (n + 1)} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_29252", "source_license": null, "theorem_names": ["number_theory_29252"], "statement_sha256": "9cd13c8e51cb7e6078b21b77c98ad074198ba751d1d4c4d5a704c4a278cf7350", "task_path": "tasks/rl_align__o_proofs_number_theory_29252__9cd13c8e51cb7e60", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_29252", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_29417__a74ae644e39e16f7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Complex Polynomial\n\ntheorem number_theory_29417 (ω : ℂ) (hω : ω ^ 3 = 1 ∧ ω ≠ 1) :\n Set.ncard {x | ∃ n > 0, x = (ω + 1) ^ n} = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_29417", "source_license": null, "theorem_names": ["number_theory_29417"], "statement_sha256": "a74ae644e39e16f7784aac407f9da5d9bca432edbea35df365ea94234a5d822c", "task_path": "tasks/rl_align__o_proofs_number_theory_29417__a74ae644e39e16f7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_29417", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_308410__720f567149a7d6bc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_308410 (A : Finset ℕ) (hA : A ⊆ Finset.Icc 1 216)\n (hA' : ∀ m ∈ A, ∀ n ∈ A, ¬(6 ∣ m + n)) :\n A.card ≤ 74 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_308410", "source_license": null, "theorem_names": ["number_theory_308410"], "statement_sha256": "720f567149a7d6bc0f203dbe55d3e7ad26c85fb96c0bbc908334ed770eb2ac24", "task_path": "tasks/rl_align__o_proofs_number_theory_308410__720f567149a7d6bc", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_308410", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_319155__4a7d190a4b9a66fd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_319155 (A : ℕ → Set ℕ)\n (hA : ∀ n, A n = {x | 2 ^ n < x ∧ x < 2 ^ (n + 1) ∧ ∃ m, x = 7 * m + 1}) :\n ∑ᶠ x ∈ A 6, x = 891 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_319155", "source_license": null, "theorem_names": ["number_theory_319155"], "statement_sha256": "4a7d190a4b9a66fd60b317392747d9d97989e3c5bf8d0dc3f0b9f5d4cd974f2a", "task_path": "tasks/rl_align__o_proofs_number_theory_319155__4a7d190a4b9a66fd", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_319155", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_324870__13a2fe92dc7a1419", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_324870 :\n Set.ncard {n : ℕ | 1 ≤ n ∧ n ≤ 100 ∧ Nat.gcd (n^2 + 4) (n + 3) > 1} = 7 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_324870", "source_license": null, "theorem_names": ["number_theory_324870"], "statement_sha256": "13a2fe92dc7a14198a757f413609baa6023cb88a54e2c0360817b610640ab976", "task_path": "tasks/rl_align__o_proofs_number_theory_324870__13a2fe92dc7a1419", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_324870", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_326381__ae885a70ae987d6f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_326381 :\n Set.ncard {S : Finset ℕ | S ⊆ Finset.Icc 1 10 ∧ S ≠ ∅ ∧ Even (∑ x ∈ S, x)} = 511 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_326381", "source_license": null, "theorem_names": ["number_theory_326381"], "statement_sha256": "ae885a70ae987d6fcb099e1be9c5a5ac5c81869ae847b6f89724560ef7199836", "task_path": "tasks/rl_align__o_proofs_number_theory_326381__ae885a70ae987d6f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_326381", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_33551__ff0a5ed8596811fb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_33551 {d : ℕ → ℕ} (hd : ∀ m, d m = (Nat.divisors m).card) :\n {n | 0 < n ∧ d n + d (n + 1) = 5} = {3, 4} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_33551", "source_license": null, "theorem_names": ["number_theory_33551"], "statement_sha256": "ff0a5ed8596811fb3193994a009bf5a168aa09468d9f665b326b8d0c3cd4ae5b", "task_path": "tasks/rl_align__o_proofs_number_theory_33551__ff0a5ed8596811fb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_33551", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_3891_2__3ad50363828cf990", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_3891 (s : Set ℕ) (hs : s = {x : ℕ | x ∈ Finset.Icc 100 999 ∧ 3 * x % 5 = 4 ∧ 4 * x % 7 = 0 ∧ 5 * x % 11 = 6}) :\n ∑ᶠ x ∈ s, x = 483 + 868 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_3891_2", "source_license": null, "theorem_names": ["number_theory_3891"], "statement_sha256": "3ad50363828cf990d7f4f829e9fa4d3b020e5a6b665e181cecba71f148b8d6b0", "task_path": "tasks/rl_align__o_proofs_number_theory_3891_2__3ad50363828cf990", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_3891_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_43748__02fd58912a77cecc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Nat\n\n\ntheorem number_theory_43748 (a : ℕ) (ha : 1 < a) (d : ℕ → ℕ)\n (hd : ∀ n, d n = sInf {p | p.Prime ∧ p ∣ n}) (a_seq : ℕ → ℕ)\n (h_a1 : a_seq 1 = a)\n (h_an : ∀ n ≥ 1, a_seq (n + 1) = a_seq n + d (a_seq n) - 1) :\n ∀ k, ¬StrictMonoOn d (Set.Ici k) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_43748", "source_license": null, "theorem_names": ["number_theory_43748"], "statement_sha256": "02fd58912a77cecc7efaa5eeeb87637c407df0aefd38ee01672b6ec28c6746c5", "task_path": "tasks/rl_align__o_proofs_number_theory_43748__02fd58912a77cecc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_43748", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_44425__9d2c3c0b00169d5b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_44425 (A : Set ℕ) (hA : ∀ x ∈ A, x > 0)\n (hA1 : 1 ∈ A) (hA2 : ∃ x, x ≠ 1 ∧ x ∈ A) (hA3 : ∀ m ∈ A, ∀ n ∈ A, m ≠ n →\n (m + 1) / Nat.gcd (m + 1) (n + 1) ∈ A) :\n A = {x | x > 0} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_44425", "source_license": null, "theorem_names": ["number_theory_44425"], "statement_sha256": "9d2c3c0b00169d5bc4148ab92da2177aafea858b23810a5e5cdb7c7c78589961", "task_path": "tasks/rl_align__o_proofs_number_theory_44425__9d2c3c0b00169d5b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_44425", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_44816__7c2fa9208e75a3d3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_44816 (n : ℕ) (hn : 0 < n) :\n IsGreatest {k | ∃ s : Finset ℕ, s ⊆ Finset.Icc 1 (2 * n) ∧\n s.card = k ∧ ∀ x ∈ s, ∀ y ∈ s, x > y → x - y ≠ Nat.gcd x y} n := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_44816", "source_license": null, "theorem_names": ["number_theory_44816"], "statement_sha256": "7c2fa9208e75a3d38d24669abae3750412bd69eba579c6b9db8d8f26de45beb0", "task_path": "tasks/rl_align__o_proofs_number_theory_44816__7c2fa9208e75a3d3", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_44816", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_46486__0a1364a64a846120", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_46486 : Set.ncard {n : ℤ | ∃ a b c, n = a + b + c ∧ Odd a ∧ Odd b ∧ Odd c ∧ a ≠ b ∧ a ≠ c ∧ b ≠ c ∧ a ∈ Finset.Icc 3 19 ∧ b ∈ Finset.Icc 3 19 ∧ c ∈ Finset.Icc 3 19} = 19 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_46486", "source_license": null, "theorem_names": ["number_theory_46486"], "statement_sha256": "0a1364a64a84612032bd352d09196ac50aa72f71a6052ba6d1c463cb725ab0af", "task_path": "tasks/rl_align__o_proofs_number_theory_46486__0a1364a64a846120", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_46486", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_605998__af299d817f2167e2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_605998 (is_good : Finset ℕ → Prop) (hgood : ∀ S : Finset ℕ, is_good S = ∀ x ∈ S, ¬x ∣ ∑ i ∈ (Finset.erase S x), i) : IsGreatest {n : ℕ | ∃ S : Finset ℕ, S ⊆ Finset.Icc 1 63 ∧ S.card = n ∧ is_good S} 61 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_605998", "source_license": null, "theorem_names": ["number_theory_605998"], "statement_sha256": "af299d817f2167e2aa34745d0d392aa5adb7bfa7ff8ee9e853d85c0f179d5327", "task_path": "tasks/rl_align__o_proofs_number_theory_605998__af299d817f2167e2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_605998", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_61041__4f244b4f6cecf848", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem number_theory_61041 {f g : ℕ → ℤ}\n (hf : ∀ n, f n = ∑ d ∈ Icc 1 n, n / d)\n (hg : ∀ n, g (n + 1) = f (n + 1) - f n) :\n {n | n ∈ Icc 1 100 ∧ Even (g n)}.ncard = 90 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_61041", "source_license": null, "theorem_names": ["number_theory_61041"], "statement_sha256": "4f244b4f6cecf84805329c3408d8813194305349e12bc4d57451176ab3c7fcbc", "task_path": "tasks/rl_align__o_proofs_number_theory_61041__4f244b4f6cecf848", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_61041", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_64420__a7ee7ed239590abf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_64420 {P : Polynomial ℤ} (hP : ∀ n ∈ Finset.Icc 1 1998, ∃ k : ℕ, P.eval (n : ℤ) = k ∧ k ∈ Finset.Icc 100 999) :\n ¬∃ x : ℤ, P.eval x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_64420", "source_license": null, "theorem_names": ["number_theory_64420"], "statement_sha256": "a7ee7ed239590abf5d5812ca64369abc4a869189260b6944737aa614b187bc32", "task_path": "tasks/rl_align__o_proofs_number_theory_64420__a7ee7ed239590abf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_64420", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_69760__b88dcf5d7bc52467", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_69760 :\n Set.ncard {a : ℝ | a ∈ Set.Ioo 1 9 ∧ ∃ k : ℤ, a - 1 / a = k} = 8 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_69760", "source_license": null, "theorem_names": ["number_theory_69760"], "statement_sha256": "b88dcf5d7bc52467dd56fcd0475baab6fa5fe7c7966d665bfa06c2220370d20b", "task_path": "tasks/rl_align__o_proofs_number_theory_69760__b88dcf5d7bc52467", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_69760", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_73584__a4bb41bb775474cb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem number_theory_73584 {a : ℕ → ℕ}\n (ha : ∀ n, a n = ∑ i ∈ Icc 1 n, i ^ i) :\n ∀ N, ∃ n, n > N ∧ ¬Prime (a n) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_73584", "source_license": null, "theorem_names": ["number_theory_73584"], "statement_sha256": "a4bb41bb775474cb8699405b274312cad5ca97dceb01eddcc589e237ba0fb47e", "task_path": "tasks/rl_align__o_proofs_number_theory_73584__a4bb41bb775474cb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_73584", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_7495_2__30cbb226b9be2f8b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_7495 :\n Set.ncard {k : ℤ | ∃ x y : ℤ, x ≠ y ∧ x^2 + k * x + 36 = 0 ∧ y^2 + k * y + 36 = 0} = 8 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_7495_2", "source_license": null, "theorem_names": ["number_theory_7495"], "statement_sha256": "30cbb226b9be2f8bdefb2dcacb0c210710a5e0f40263f1860b7457a7a7f4db8b", "task_path": "tasks/rl_align__o_proofs_number_theory_7495_2__30cbb226b9be2f8b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_7495_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_758264__0b303db49585fe04", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_758264 :\n Set.ncard {a : ℤ | ∃ x : ℤ, x ^ 2 + a * x + 8 * a = 0} = 8 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_758264", "source_license": null, "theorem_names": ["number_theory_758264"], "statement_sha256": "0b303db49585fe04266c1ca51fc0895d0decba19b1c7c71955feab8fa8389774", "task_path": "tasks/rl_align__o_proofs_number_theory_758264__0b303db49585fe04", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_758264", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_7698__b7f72801b2365e11", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\ntheorem number_theory_7698 :\n {n : ℕ | 1 ≤ n ∧ n ≤ 25 ∧ Prime (∑ d ∈ n.divisors, d)}.ncard = 5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_7698", "source_license": null, "theorem_names": ["number_theory_7698"], "statement_sha256": "b7f72801b2365e1137910a3469b2e8be37cced05ea59ff6da07ea3fd3f1c94c8", "task_path": "tasks/rl_align__o_proofs_number_theory_7698__b7f72801b2365e11", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_7698", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_786481__0292d5c51fb49662", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_786481 :\n ∃ a b : ℕ, a > 0 ∧ b > 0 ∧ Nat.Coprime a b ∧\n ∀ L : ℕ → ℕ,\n (L 0 = a ∧ L 1 = b ∧\n ∀ n, L (n + 2) = 3 * L (n + 1) - L n) →\n ¬∃ p, Nat.Prime p ∧ p ∈ Set.range L := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_786481", "source_license": null, "theorem_names": ["number_theory_786481"], "statement_sha256": "0292d5c51fb49662f6e503eb43f6ad4a003020c29da111d2ff26b113318dbe39", "task_path": "tasks/rl_align__o_proofs_number_theory_786481__0292d5c51fb49662", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_786481", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_78653__db463cc4bc061258", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem number_theory_78653 : ∫ x in (-π/6)..(π/6), sin x ^ 3 * (1 + cos x ^ 2) / (4 + cos x + sin x ^ 2) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_78653", "source_license": null, "theorem_names": ["number_theory_78653"], "statement_sha256": "db463cc4bc0612583deb4ec50fc1accb52c3db6cfcaacb575a1463dc1d483176", "task_path": "tasks/rl_align__o_proofs_number_theory_78653__db463cc4bc061258", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_78653", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_79623__ab59af727202c061", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem number_theory_79623 : IsGreatest {n : ℕ | 2 ^ n ∣ ∏ i ∈ range 64, Nat.choose (2 * i + 2) (i + 1)} 193 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_79623", "source_license": null, "theorem_names": ["number_theory_79623"], "statement_sha256": "ab59af727202c0614a4aa67d5277dc0637b928be3a441236fd2655399ba251e6", "task_path": "tasks/rl_align__o_proofs_number_theory_79623__ab59af727202c061", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_79623", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_8243_14__9eb4e295658e9ee7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_8243 :\n Set.Infinite {(n : ℤ) | ¬∃ a b c : ℕ, n = (2 ^ a + 3 ^ b - 5 ^ c : ℤ)} ∧\n ∃ k : Fin 120, ¬ ∃ n : ℤ, n ≡ k [ZMOD 120] ∧ ∃ a b c : ℕ, n = (2 ^ a + 3 ^ b - 5 ^ c : ℤ) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_8243_14", "source_license": null, "theorem_names": ["number_theory_8243"], "statement_sha256": "9eb4e295658e9ee76a72a3c7e5271f301f7e691d552c563cd2976ae431367ae5", "task_path": "tasks/rl_align__o_proofs_number_theory_8243_14__9eb4e295658e9ee7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_8243_14", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_8244_4__9847186ec426684d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_8244 :\n Set.ncard {n : ℕ | 0 < n ∧ n < 2007 ∧ ⌊(n / 2 : ℝ)⌋ + ⌊(n / 3 : ℝ)⌋ + ⌊(n / 6 : ℝ)⌋ = n} = 334 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_8244_4", "source_license": null, "theorem_names": ["number_theory_8244"], "statement_sha256": "9847186ec426684d7b772e76e7f9e2f4d722aaa5bc13ca0b33e93ecae9a0fa59", "task_path": "tasks/rl_align__o_proofs_number_theory_8244_4__9847186ec426684d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_8244_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_8248_9__7c9dcafa628bad6e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_8248 :\n Set.ncard {s : Finset ℕ | s ⊆ Finset.Icc 1 100 ∧ s.card = 2 ∧ 7 ∣ s.prod id + s.sum id} = 602 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_8248_9", "source_license": null, "theorem_names": ["number_theory_8248"], "statement_sha256": "7c9dcafa628bad6eaf8e4d987d18f339eac88a43c5b76a0f98628b221c41746c", "task_path": "tasks/rl_align__o_proofs_number_theory_8248_9__7c9dcafa628bad6e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_8248_9", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_8279_2__96331f6a0aca1ec5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\ntheorem number_theory_8279 : IsSquare (∏ i ∈ Icc 1 100, if i = 50 then 1 else Nat.factorial i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_8279_2", "source_license": null, "theorem_names": ["number_theory_8279"], "statement_sha256": "96331f6a0aca1ec5f014450270379d72f6c619230f1bd72da27e857db47aac76", "task_path": "tasks/rl_align__o_proofs_number_theory_8279_2__96331f6a0aca1ec5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_8279_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_82959__54385183dcaa0878", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem number_theory_82959 :\n Set.ncard {a : ℤ | |a| ≤ 2005 ∧ ∃ x y : ℤ, x^2 = y + a ∧ y^2 = x + a} = 90 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_82959", "source_license": null, "theorem_names": ["number_theory_82959"], "statement_sha256": "54385183dcaa0878771a828b8e04efff9419fb5cd667edcc357ff9e035854240", "task_path": "tasks/rl_align__o_proofs_number_theory_82959__54385183dcaa0878", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_82959", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_8701__f072456257097d92", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\ntheorem number_theory_8701 :\n { n : ℕ | n ≥ 3 ∧ ∀ (a : ℕ → ℝ), (∑ i ∈ range n, a i = 0) → ∑ i ∈ range n, a i * a ((i + 1) % n) ≤ 0 } = { 3, 4 } := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_8701", "source_license": null, "theorem_names": ["number_theory_8701"], "statement_sha256": "f072456257097d92041d597251d7dea82d025863e0bfbe9bb1d921ac96dac0f1", "task_path": "tasks/rl_align__o_proofs_number_theory_8701__f072456257097d92", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_8701", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_8843_2__7b3c5fceb51c52c7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem number_theory_8843 :\n (∫ x in (0)..Real.pi, cos x ^ 4 + abs (cos x)) / (∫ x in (0)..(Real.pi / 2), sin x ^ 4 + abs (sin x)) = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_8843_2", "source_license": null, "theorem_names": ["number_theory_8843"], "statement_sha256": "7b3c5fceb51c52c7c698f4f6496635a6e99a37bc6a00f88031747990a2b7fdd2", "task_path": "tasks/rl_align__o_proofs_number_theory_8843_2__7b3c5fceb51c52c7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_8843_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_8924_2__abc14b2e7ce6f34c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_8924 :\n Set.ncard {a : ℕ | 1 ≤ a ∧ a ≤ 10000 ∧ 5 ∣ (2 ^ a - a ^ 2 : ℤ)} = 2000 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_8924_2", "source_license": null, "theorem_names": ["number_theory_8924"], "statement_sha256": "abc14b2e7ce6f34c353096afe316b566b406f68f3d263c2ec9c3f3a4c245a363", "task_path": "tasks/rl_align__o_proofs_number_theory_8924_2__abc14b2e7ce6f34c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_8924_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_96242__1a031c81199bffa3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_96242 (s : Set ℝ) (hs : s = {x | abs (x - 2013) + abs (x - 2014) = 3}) :\n ∑ᶠ x ∈ s, x = 4027 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_96242", "source_license": null, "theorem_names": ["number_theory_96242"], "statement_sha256": "1a031c81199bffa3f048e86e29c801e5a762af06cd4b9f4ba641e9d776aaf173", "task_path": "tasks/rl_align__o_proofs_number_theory_96242__1a031c81199bffa3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_96242", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_96629__71b0fd1b3944fcfa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_96629 :\n Set.ncard {n : ℕ | n ∈ Finset.Icc 1000 9999 ∧ ∀ d ∈ Finset.Icc 2 9, n % d = 1} = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_96629", "source_license": null, "theorem_names": ["number_theory_96629"], "statement_sha256": "71b0fd1b3944fcfa8a1ce22579005fa62ca01abc0598c399635bade44e81c678", "task_path": "tasks/rl_align__o_proofs_number_theory_96629__71b0fd1b3944fcfa", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_96629", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_9692__3ba09fe170c46155", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\ntheorem number_theory_9692 :\n IsGreatest {k | (1 * ∏ i ∈ Icc 1 100, Nat.factorial i) % 10 ^ k = 0} 1124 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_9692", "source_license": null, "theorem_names": ["number_theory_9692"], "statement_sha256": "3ba09fe170c4615597ef94ab5b7e099bde2238d120b56ef89253d84a4b8e6820", "task_path": "tasks/rl_align__o_proofs_number_theory_9692__3ba09fe170c46155", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_number_theory_9692", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_9780__399f0cfce9e02808", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_9780 :\n Set.ncard {n : ℕ | Nat.Prime ((n ^ 2 - 3 * n + 1) ^ 2 + 1)} = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_9780", "source_license": null, "theorem_names": ["number_theory_9780"], "statement_sha256": "399f0cfce9e028087f2249e17438f00951d9eec229c12109bb5ae0c3f37385e1", "task_path": "tasks/rl_align__o_proofs_number_theory_9780__399f0cfce9e02808", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_9780", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_98064_2__991efb7e37d9e931", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_98064 (n : ℕ) (hn : 1 < n) :\n Set.ncard {k | ∃ x y, k = x ^ n + y ^ n ∧ k < n ^ 2} ≤ n * (n + 1) / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_98064_2", "source_license": null, "theorem_names": ["number_theory_98064"], "statement_sha256": "991efb7e37d9e931178dee6d760c494adedc9c73c7681b1d1f7ab4a5f8e252e7", "task_path": "tasks/rl_align__o_proofs_number_theory_98064_2__991efb7e37d9e931", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_98064_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_number_theory_solution_3__03dd072a41723014", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem number_theory_solution : Set.ncard {x : Fin 3 → ℕ | 10 * x 0 + 25 * x 1 + 50 * x 2 = 2000} = 861 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_solution_3", "source_license": null, "theorem_names": ["number_theory_solution"], "statement_sha256": "03dd072a417230143f0bb172320bb6f1fa009493833c4c6a6c31cffd03cdf39c", "task_path": "tasks/rl_align__o_proofs_number_theory_solution_3__03dd072a41723014", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_number_theory_solution_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_numberof_palindrome789_only__f7e37e73960dce1d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem numberof_palindrome789_only :\n Set.ncard {n : ℕ | (Nat.digits 10 n).length = 7 ∧ n > 0 ∧\n (∀ d ∈ Nat.digits 10 n, d = 7 ∨ d = 8 ∨ d = 9) ∧\n Nat.digits 10 n = List.reverse (Nat.digits 10 n)} = 81 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_numberof_palindrome789_only", "source_license": null, "theorem_names": ["numberof_palindrome789_only"], "statement_sha256": "f7e37e73960dce1d56075f86d98bc9f7a60f1c406eaba15a7063a0751268c1ff", "task_path": "tasks/rl_align__o_proofs_numberof_palindrome789_only__f7e37e73960dce1d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_numberof_palindrome789_only", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_numbertheory_610534__52383c3864738e1f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem numbertheory_610534 (s : Set (ℕ × ℕ)) (hs : s = {(a, b) : ℕ × ℕ | a > 0 ∧ b > 0 ∧ Nat.gcd a b * a + b ^ 2 = 10000}) :\n s.ncard = 99 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_numbertheory_610534", "source_license": null, "theorem_names": ["numbertheory_610534"], "statement_sha256": "52383c3864738e1f305e39724a258be75e835d5ca411a80b51adf15187ebee9d", "task_path": "tasks/rl_align__o_proofs_numbertheory_610534__52383c3864738e1f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_numbertheory_610534", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_numm__1b4085d485cec66e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem numm : Set.ncard {m : ℕ | m > 0 ∧ ∃ a b c : ℕ, Nat.lcm m 150 = 300 ∧ m = 2 ^ a * 5 ^ b * 3 ^ c} = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_numm", "source_license": null, "theorem_names": ["numm"], "statement_sha256": "1b4085d485cec66eaa5767d4ce70e811440cc537776f5cfe9964e130ad15eda8", "task_path": "tasks/rl_align__o_proofs_numm__1b4085d485cec66e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_numm", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_object_A_catches_up_at_time_5__a82472390fba2718", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem object_A_catches_up_at_time_5 (t : ℝ) (h₀ : t ≥ 0) (h₁ : ∫ x in (0 : ℝ)..t, (3 * x ^ 2 + 1) - 10 * x = 5) : t = 5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_object_A_catches_up_at_time_5", "source_license": null, "theorem_names": ["object_A_catches_up_at_time_5"], "statement_sha256": "a82472390fba271895d48e6670455140b4dd888baddd16ff8c8f2abec86e0304", "task_path": "tasks/rl_align__o_proofs_object_A_catches_up_at_time_5__a82472390fba2718", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_object_A_catches_up_at_time_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_orthogonal__af98c5e1f5fa7c07", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem orthogonal (f : Fin 3 → ℝ → ℝ)\n (hf1 : ∀ x, f 0 x = 1)\n (hf2 : ∀ x, f 1 x = x)\n (hf3 : ∀ x, f 2 x = (3 * x ^ 2 - 1) / 2) :\n ∀ i j, i ≠ j → (∫ x in (-1)..1, f i x * f j x) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_orthogonal", "source_license": null, "theorem_names": ["orthogonal"], "statement_sha256": "af98c5e1f5fa7c079aee22f9da176f9ac2f3334aefc27ff2df056f2c1fd28f09", "task_path": "tasks/rl_align__o_proofs_orthogonal__af98c5e1f5fa7c07", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_orthogonal", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_other_57437__29dd209fc127586f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem other_57437 {a c : ℕ → ℝ}\n (ha0 : a 0 = 1 / 2) (hc0 : c 0 = 4)\n (han : ∀ n, a (n + 1) = 2 * a n / (1 + (a n) ^ 2))\n (hc : ∀ n, c (n + 1) = (c n) ^ 2 - 2 * c n + 2) :\n ∀ n ≥ 1, a n = (2 * ∏ i ∈ Icc 0 (n - 1), c i) / c n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_other_57437", "source_license": null, "theorem_names": ["other_57437"], "statement_sha256": "29dd209fc127586fcd2215a4b5aba852c66df12ddb1e3099c4fb4fdc3e3d48dc", "task_path": "tasks/rl_align__o_proofs_other_57437__29dd209fc127586f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_other_57437", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_p1_10__3a5c30da1188a5d0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem p1 (a : Fin 5 → Fin 5 → ℤ) (h : ∀ i j, a i j ≠ 0)\n (h' : ∀ i, ∏ j : Fin 5, a i j < 0) :\n ∃ j, ∏ i : Fin 5, a i j < 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_p1_10", "source_license": null, "theorem_names": ["p1"], "statement_sha256": "3a5c30da1188a5d045ef933a232f2ef5343e8ad2a6c11f49cd6a98c20cb490cf", "task_path": "tasks/rl_align__o_proofs_p1_10__3a5c30da1188a5d0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_p1_10", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_p8_value__adfe1e25cea1d15e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem p8_value : ∃ p : Polynomial ℤ, p.degree = 7 ∧ p.coeff 7 = 1 ∧ p.eval 1 = 1 ∧ p.eval 2 = 2 ∧ p.eval 3 = 3 ∧ p.eval 4 = 4 ∧ p.eval 5 = 5 ∧ p.eval 6 = 6 ∧ p.eval 7 = 7 ∧ p.eval 8 = 5048 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_p8_value", "source_license": null, "theorem_names": ["p8_value"], "statement_sha256": "adfe1e25cea1d15ea8e176b2654f782d2aa200ba2a5400b4645f50ba99dcd477", "task_path": "tasks/rl_align__o_proofs_p8_value__adfe1e25cea1d15e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_p8_value", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_p__6099f3330a72c7bf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem γ_p (γ : ℝ → ℝ) (hγ : γ = fun z => ∫ x in (0)..z, exp (-x)) (ψ : ℝ → ℝ)\n (hψ : ψ = fun z => deriv (fun z => log (γ z)) z) (ν : ℝ) (hν : ν > 0) :\n -(ν + 1) * deriv (fun x => log (γ (x / 2)) - log (γ ((x + 1) / 2))) ν =\n (ν + 1) / 2 * (ψ ((ν + 1) / 2) - ψ (ν / 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_p", "source_license": null, "theorem_names": ["γ_p"], "statement_sha256": "6099f3330a72c7bf9e096e2bf5f4f541dbbcdf44aedd6a76c9e91abd6f75b093", "task_path": "tasks/rl_align__o_proofs_p__6099f3330a72c7bf", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_p", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_pach_problem__589a58ad011fea85", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem pach_problem (p : ℕ) (hp : Nat.Prime p) :\n ∃ k : ℕ, k = p + 1 ∧\n ∃ s : Finset (Polynomial ℤ → ℤ), s.card = k ∧\n ∀ f ∈ s, ∀ g ∈ s, f ≠ g → ∃ x : ℤ, (f x - g x) % p ^ 2 ≠ 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_pach_problem", "source_license": null, "theorem_names": ["pach_problem"], "statement_sha256": "589a58ad011fea85057c6170caf2c263d78add4e925fd5a15a9df1e303f7bd62", "task_path": "tasks/rl_align__o_proofs_pach_problem__589a58ad011fea85", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_pach_problem", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_palindrome_in_bases__b30e79da19f50d6e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem palindrome_in_bases (K d : ℕ) (hK : K > 0) (hd : d > 0) : ∃ n : ℕ, 0 < n ∧ (∃ (b : ℕ → ℕ), (∀ i : Fin K, b i > 1) ∧ ∀ i : Fin K, ∃ (digits : ℕ → ℕ), (∀ m, digits m < b i) ∧ (∀ m < d, digits m = digits (d - m - 1)) ∧ ∑ m < d, digits m * b i ^ m = n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_palindrome_in_bases", "source_license": null, "theorem_names": ["palindrome_in_bases"], "statement_sha256": "b30e79da19f50d6e726dd911d767056a92d75e1acd498457214c02063807f40a", "task_path": "tasks/rl_align__o_proofs_palindrome_in_bases__b30e79da19f50d6e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_palindrome_in_bases", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part1_1073__2ea07d1c114ed89f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part1 (a : ℝ) (h : deriv (fun x => a * x ^ 2 - x - 2 * Real.log x - 1) (1 / Real.exp 1) = 0) :\n (∀ x ∈ Set.Ioo 0 (1 / Real.exp 1), deriv (fun x => a * x ^ 2 - x - 2 * Real.log x - 1) x < 0) ∧\n (∀ x ∈ Set.Ioi (1 / Real.exp 1), deriv (fun x => a * x ^ 2 - x - 2 * Real.log x - 1) x > 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part1_1073", "source_license": null, "theorem_names": ["part1"], "statement_sha256": "2ea07d1c114ed89faf2c5ad52c5355674735bb99c4b454c7691eab1fcf06ccd3", "task_path": "tasks/rl_align__o_proofs_part1_1073__2ea07d1c114ed89f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part1_1073", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part1_1160__3584ce7c599e58a3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part1 (a b : ℝ) (h : a ≤ b) : Filter.Tendsto (fun m : ℕ => ∫ x in a..b, Real.sin (m * x)) Filter.atTop (nhds 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_1160", "source_license": null, "theorem_names": ["part1"], "statement_sha256": "3584ce7c599e58a35cfed411ce8c7c09950e85b36ca11b9de4f7d576ff84eb97", "task_path": "tasks/rl_align__o_proofs_part1_1160__3584ce7c599e58a3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_1160", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part1_1194__e51d33bcf206ce5f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part1 (a : ℝ) (h : ∀ x ≤ 2, fderiv ℝ (fun x => x^2 - 2 * a * x + 3) x ≤ 0) :\n ∃ M : ℝ, ∀ x ∈ Set.Icc 3 5, x^2 - 2 * a * x + 3 ≤ M := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_1194", "source_license": null, "theorem_names": ["part1"], "statement_sha256": "e51d33bcf206ce5fde7ff08d0fe345474f08522f4ff0df5ac95ee47494201b66", "task_path": "tasks/rl_align__o_proofs_part1_1194__e51d33bcf206ce5f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_1194", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part1_1218__b71d7c4154c163f4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part1 (x : ℝ) (hx : x ∈ Set.Ioo 0 1 ∪ Set.Ioi 1) : deriv (fun x => (x^2 - 1) / Real.log x) x > 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_1218", "source_license": null, "theorem_names": ["part1"], "statement_sha256": "b71d7c4154c163f4f84c84b0e85fe9a440105ced383aa24106bb31ffd9d7b400", "task_path": "tasks/rl_align__o_proofs_part1_1218__b71d7c4154c163f4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_1218", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part1_2155__cea2af2cf14efb13", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part1 (x : ℝ) (hx : x > 0) : deriv (fun x => Real.log x - x + 1) x = 1/x - 1 ∧ (1/x - 1 > 0 ↔ x ∈ Set.Ioo 0 1) ∧ (1/x - 1 < 0 ↔ x ∈ Set.Ioi 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_2155", "source_license": null, "theorem_names": ["part1"], "statement_sha256": "cea2af2cf14efb135d627166dd4308c8b0d50375816166c3a6c8cbb0612b6aa3", "task_path": "tasks/rl_align__o_proofs_part1_2155__cea2af2cf14efb13", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_2155", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part1_261__e04172a028c103fe", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part1 (m : ℕ) (hk : m ≥ 1) (k : ℕ → ℕ) (b : ℕ → ℕ) (hb : ∀ i, i ≤ m → b i ≤ k i) :\n ∃ (a : Fin m → Fin m → ℕ),\n (∀ i : Fin m, ∑ j : Fin m, a i j = b i) ∧\n ∀ j : Fin m, ∑ i : Fin m, (a i j : ℚ) / ↑(k i) ≤ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_261", "source_license": null, "theorem_names": ["part1"], "statement_sha256": "e04172a028c103fe4c91cc45cf3620c04a4ecd449af1f61025c76d41656bb619", "task_path": "tasks/rl_align__o_proofs_part1_261__e04172a028c103fe", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_261", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part1_6873__cbead16329adffcc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part1 (a : ℝ) (h₀ : a = 1) : ∃ I : Set ℝ, I = Set.Ioi (-1) ∧ ∀ x ∈ I, deriv (fun x => (x - a - 1) * Real.exp (x - 1) - 1/2 * x ^ 2 + a * x) x ≥ 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part1_6873", "source_license": null, "theorem_names": ["part1"], "statement_sha256": "cbead16329adffccde6756a7c4668e9e73ac7a61c16b7cd2d0f8a1f89c0b54df", "task_path": "tasks/rl_align__o_proofs_part1_6873__cbead16329adffcc", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part1_6873", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part1_6__392989bcd145a69a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part1: ∫ x in (0:ℝ)..1, (1 - x^2)^50 = (2 / 3) * (4 / 5) * (6 / 7) * (8 / 9) * (10 / 11) * (12 / 13) * (14 / 15) * (16 / 17) * (18 / 19) * (20 / 21) * (22 / 23) * (24 / 25) * (26 / 27) * (28 / 29) * (30 / 31) * (32 / 33) * (34 / 35) * (36 / 37) * (38 / 39) * (40 / 41) * (42 / 43) * (44 / 45) * (46 / 47) * (48 / 49) * (50 / 51) * (52 / 53) * (54 / 55) * (56 / 57) * (58 / 59) * (60 / 61) * (62 / 63) * (64 / 65) * (66 / 67) * (68 / 69) * (70 / 71) * (72 / 73) * (74 / 75) * (76 / 77) * (78 / 79) * (80 / 81) * (82 / 83) * (84 / 85) * (86 / 87) * (88 / 89) * (90 / 91) * (92 / 93) * (94 / 95) * (96 / 97) * (98 / 99) * (100 / 101) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_6", "source_license": null, "theorem_names": ["part1"], "statement_sha256": "392989bcd145a69aceacdc5ad477729d97338a135a5e2a90f9b2f92bfc65f478", "task_path": "tasks/rl_align__o_proofs_part1_6__392989bcd145a69a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part1_761__78e3fd0455ace131", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part1 :\n Filter.Tendsto (fun n => n^2 / Real.log n^2 - n^2 / (Real.log n)^2 + (n^2 - n) / Real.log (n^2 - n)) Filter.atTop Filter.atTop := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part1_761", "source_license": null, "theorem_names": ["part1"], "statement_sha256": "78e3fd0455ace131c62a6e714b23d9b856978f02d8a0d5f4a3f86eee65809f97", "task_path": "tasks/rl_align__o_proofs_part1_761__78e3fd0455ace131", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part1_761", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part1_8037__40d6e8bd69a3420a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part1 (m : ℝ) (h : m = 1) : ∃ a b : ℝ, a < b ∧ ∀ x ∈ Set.Ioo a b, deriv (fun x => Real.log (1 + x) - m * x) x < 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_8037", "source_license": null, "theorem_names": ["part1"], "statement_sha256": "40d6e8bd69a3420a4c3bf5897a1168a41a27fd74180f01706ca5f6c3819b6a66", "task_path": "tasks/rl_align__o_proofs_part1_8037__40d6e8bd69a3420a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part1_8037", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part1_860__adc4c0352fb922d4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part1 : ∃ a b : ℝ, a ≤ b ∧ (∀ x ∈ Set.Icc (Real.pi / 4) (Real.pi / 2), x ∈ Set.Icc a b → deriv (fun x => 2 * (Real.sin (Real.pi / 4 + x)) ^ 2 - Real.sqrt 3 * Real.cos (2 * x) - 1) x ≥ 0) ∧ (∀ x ∈ Set.Icc (Real.pi / 4) (Real.pi / 2), x ∉ Set.Icc a b → deriv (fun x => 2 * (Real.sin (Real.pi / 4 + x)) ^ 2 - Real.sqrt 3 * Real.cos (2 * x) - 1) x < 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part1_860", "source_license": null, "theorem_names": ["part1"], "statement_sha256": "adc4c0352fb922d4dcd660d356fa0e87358379d96d57ee66ef9da9ad108a024f", "task_path": "tasks/rl_align__o_proofs_part1_860__adc4c0352fb922d4", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part1_860", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part_I_534__c7aabc813200c8da", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part_I (a : ℝ) : ∃ (x₁ x₂ : ℝ), x₁ < x₂ ∧ ∀ x ∈ Set.Icc x₁ x₂, deriv (fun x => (1/3:ℝ) * x^3 + x^2 - 3*x + a) x ≤ 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_I_534", "source_license": null, "theorem_names": ["part_I"], "statement_sha256": "c7aabc813200c8da38fefc083eacf896ce7734851fc05416691b6b248ad6bc3d", "task_path": "tasks/rl_align__o_proofs_part_I_534__c7aabc813200c8da", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_I_534", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part_a_1173__781af355f0722e5d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part_a (a : ℕ → ℂ) (h_bounded : ∃ M, ∀ k, ‖a k‖ ≤ M) :\n ∃ f : ℂ → ℂ, ∀ z, ‖z‖ < 1 → HasSum (fun k => a k * z ^ k) (f z) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_1173", "source_license": null, "theorem_names": ["part_a"], "statement_sha256": "781af355f0722e5d24ccc02f7cd851b937bd9e423589bd5ddea95e058be37170", "task_path": "tasks/rl_align__o_proofs_part_a_1173__781af355f0722e5d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_1173", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part_a_140__1d090c1cefc8b9c5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part_a (n : ℕ) (hn : n ≥ 2) (z : Fin n → ℂ) (hz : ∀ i, ‖z i‖ = 1) (hsum : ∑ i, z i = 0) : ∀ w : ℂ, ∑ i, ‖w - z i‖ ^ 2 = n * ‖w‖ ^ 2 + n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_140", "source_license": null, "theorem_names": ["part_a"], "statement_sha256": "1d090c1cefc8b9c559be297049713fbc44410aef60cbbe6e36fe5a24667cdbe3", "task_path": "tasks/rl_align__o_proofs_part_a_140__1d090c1cefc8b9c5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_140", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part_a_1512__c67f39f7dd35e447", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part_a (X : Matrix (Fin 2) (Fin 2) ℂ) (n : ℕ) (hn : n ≥ 2) : ∃ a_n b_n : ℂ, X ^ n = a_n • X + b_n • 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part_a_1512", "source_license": null, "theorem_names": ["part_a"], "statement_sha256": "c67f39f7dd35e4477bc9a53e07b99d52b3ffc01470af010d43db28f21c60747d", "task_path": "tasks/rl_align__o_proofs_part_a_1512__c67f39f7dd35e447", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part_a_1512", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part_a_267__f383093adf506ca7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part_a : ∃ (n : ℕ) (x : Fin n → ℝ), (∀ i : Fin n, x i > 0) ∧\n (∑ i, x i > ∑ i, (x i)^2) ∧ (∑ i, (x i)^2 > ∑ i, (x i)^3) ∧\n (∑ i, (x i)^3 > ∑ i, (x i)^4) ∧ (∑ i, (x i)^4 > ∑ i, (x i)^5) ∧\n (∑ i, (x i)^5 < ∑ i, (x i)^6) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_267", "source_license": null, "theorem_names": ["part_a"], "statement_sha256": "f383093adf506ca739f51fade14a4b95bb686aef0dfcbaebc279a574c5bc1cd8", "task_path": "tasks/rl_align__o_proofs_part_a_267__f383093adf506ca7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_267", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part_a_3147__7e29fe4f20d11495", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part_a (s : ℝ) (h₀ : s > 0) (h₁ : s = 2 + 2 * Real.sqrt 3) : ∃ (P Q R S T : ℝ × ℝ × ℝ),\n\n dist P Q = 2 ∧ dist P R = 2 ∧ dist P S = 2 ∧ dist Q R = 2 ∧ dist Q S = 2 ∧ dist R S = 2 ∧\n\n dist P T = s ∧ dist Q T = s ∧ dist R T = s ∧ dist S T = s := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_3147", "source_license": null, "theorem_names": ["part_a"], "statement_sha256": "7e29fe4f20d1149567a007a1476174537e564a7c03f82a053b44e06fca93eb6e", "task_path": "tasks/rl_align__o_proofs_part_a_3147__7e29fe4f20d11495", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_3147", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part_a_377__7f63d6010e20ae0d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part_a (x : ℕ → ℝ) (h₁ : x 1 = 1) (h₂ : ∀ n, x (n+1) = x n + 3 * Real.sqrt (x n) + n / Real.sqrt (x n)) :\n Filter.Tendsto (fun n => n / x n) Filter.atTop (nhds 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_377", "source_license": null, "theorem_names": ["part_a"], "statement_sha256": "7f63d6010e20ae0db5378c48478220be0e055d895025fbb632c44fe08a1f1167", "task_path": "tasks/rl_align__o_proofs_part_a_377__7f63d6010e20ae0d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_377", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part_a_3944__6834a895342bcd65", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part_a (A : Finset ℕ) (hA : A.card = 1004) (hA_subset : ∀ x ∈ A, x ∈ Set.Icc 1 2006) :\n ∃ a b c : ℕ, a ∈ A ∧ b ∈ A ∧ c ∈ A ∧ a ≠ b ∧ b ≠ c ∧ a ≠ c ∧ a.gcd b ∣ c := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part_a_3944", "source_license": null, "theorem_names": ["part_a"], "statement_sha256": "6834a895342bcd65817f0f6cfeef558a0f2aa20128ed10e55582a1424e4d6393", "task_path": "tasks/rl_align__o_proofs_part_a_3944__6834a895342bcd65", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part_a_3944", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part_a_426__dfcf0931f73e8fcf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part_a (n : ℕ) (A B : Matrix (Fin n) (Fin n) ℂ) (h₁ : B * A - A * B = A * B - B * A) (h₂ : A * (A * B - B * A) = (A * B - B * A) * A) (h₃ : B * (A * B - B * A) = (A * B - B * A) * B) : ∀ k : ℕ, A * B ^ k - B ^ k * A = k * B ^ (k - 1) * (A * B - B * A) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_426", "source_license": null, "theorem_names": ["part_a"], "statement_sha256": "dfcf0931f73e8fcfb63c8390a36cd31f09dc2c2376fe5b350cfa6de9ac824350", "task_path": "tasks/rl_align__o_proofs_part_a_426__dfcf0931f73e8fcf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_426", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part_a_722__eba9106b8d244eaf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part_a (x : ℕ → ℝ) (h₀ : x 1 > Real.sqrt 3) (h₁ : ∀ n, x (n + 1) = x n / Real.sqrt (1 + n * (x n)^2)) : Filter.Tendsto x Filter.atTop (nhds 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_722", "source_license": null, "theorem_names": ["part_a"], "statement_sha256": "eba9106b8d244eaf09bcce572786710efe742824e66c8ba9ead00107a6b1aec1", "task_path": "tasks/rl_align__o_proofs_part_a_722__eba9106b8d244eaf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_a_722", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part_a_748__335edfd3df9f109c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem part_a {n : ℕ} (hn : n = 40) :\n {x : Fin 6 → ℕ | (∀ i, x i > 0) ∧ (∑ i, x i) = n ∧ ∀ i, x i ≤ 8}.ncard = Nat.choose 13 5 - 6 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part_a_748", "source_license": null, "theorem_names": ["part_a"], "statement_sha256": "335edfd3df9f109c35ac1432f09810222cb3829343113492526a12b0a49bf6a9", "task_path": "tasks/rl_align__o_proofs_part_a_748__335edfd3df9f109c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_part_a_748", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_part_i_92__bc425512f511121f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem part_i (n : ℕ) (hn : n ≥ 1) : deriv (fun x => Finset.sum (Finset.range (n + 1)) (fun k => x ^ k / (k.factorial : ℝ))) = fun x => Finset.sum (Finset.range n) (fun k => x ^ k / (k.factorial : ℝ)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_i_92", "source_license": null, "theorem_names": ["part_i"], "statement_sha256": "bc425512f511121f8e2d8c73531d12f9fa7eaf730e8005f88ed553757296aadc", "task_path": "tasks/rl_align__o_proofs_part_i_92__bc425512f511121f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_part_i_92", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_pearson_coefficient__fad006d085841a92", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem pearson_coefficient (n : ℕ) (hn : 0 < n) (x y : Fin n → ℝ)\n (μx μy : ℝ) (hμx : μx = ∑ i : Fin n, x i / n) (hμy : μy = ∑ i : Fin n, y i / n)\n (hcx hcy : Fin n → ℝ) (hhcx : hcx = fun i => x i - μx * 1) (hhcY : hcy = fun i => y i - μy * 1)\n (horthogonal : ∑ i : Fin n, hcx i * hcy i = 0) :\n (n * ∑ i : Fin n, x i * y i - ∑ i : Fin n, μx * 1 * ∑ i : Fin n, μy * 1) /\n (√(n * ∑ i : Fin n, (x i - μx * 1)^2) * √(n * ∑ i : Fin n, (y i - μy * 1)^2)) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_pearson_coefficient", "source_license": null, "theorem_names": ["pearson_coefficient"], "statement_sha256": "fad006d085841a92da64c3cd9190954bed1362bea0d31c396632f5b278027793", "task_path": "tasks/rl_align__o_proofs_pearson_coefficient__fad006d085841a92", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_pearson_coefficient", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_player_age__446b056236b91987", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem player_age (ages : Fin 11 → ℕ) (h₁ : (∑ i, ages i) = 11 * 22) (h₂ : ∃ i, (∑ j, if j = i then 0 else ages j) = 10 * 21) : ∃ i, ages i = 32 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_player_age", "source_license": null, "theorem_names": ["player_age"], "statement_sha256": "446b056236b91987f61e36105f390c9dc1d026f52c747b2e6cb26dfcf5f93578", "task_path": "tasks/rl_align__o_proofs_player_age__446b056236b91987", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_player_age", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_points_within_unit_square__c5ac4f43493e5c26", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem points_within_unit_square (x1 y1 x2 y2 x3 y3 x4 y4 : ℝ)\n (hx1: x1 ∈ Set.Icc 0 1) (hy1: y1 ∈ Set.Icc 0 1)\n (hx2: x2 ∈ Set.Icc 0 1) (hy2: y2 ∈ Set.Icc 0 1)\n (hx3: x3 ∈ Set.Icc 0 1) (hy3: y3 ∈ Set.Icc 0 1)\n (hx4: x4 ∈ Set.Icc 0 1) (hy4: y4 ∈ Set.Icc 0 1) :\n (dist (x1, y1) (x2, y2) ≤ 1 ∨ dist (x1, y1) (x3, y3) ≤ 1 ∨ dist (x1, y1) (x4, y4) ≤ 1 ∨\n dist (x2, y2) (x3, y3) ≤ 1 ∨ dist (x2, y2) (x4, y4) ≤ 1 ∨ dist (x3, y3) (x4, y4) ≤ 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_points_within_unit_square", "source_license": null, "theorem_names": ["points_within_unit_square"], "statement_sha256": "c5ac4f43493e5c26197db2373a3e5d1ff3645fbd7bbb0f2f3a8a9ce0e8388aad", "task_path": "tasks/rl_align__o_proofs_points_within_unit_square__c5ac4f43493e5c26", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_points_within_unit_square", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_pointwise_convergence_8__88605d00db5011f1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Filter Set TopologicalSpace\nopen scoped Topology\n\n\ntheorem pointwise_convergence {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n (φ : ℕ → (X → Y)) :\n ∃ ϕ : X → Y,\n Tendsto φ atTop (𝓝 ϕ) ↔\n ∀ x : X, Tendsto (λ n => φ n x) atTop (𝓝 (ϕ x)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_pointwise_convergence_8", "source_license": null, "theorem_names": ["pointwise_convergence"], "statement_sha256": "88605d00db5011f1c3bc790f1da2c11b1bb7c26031cdea18b30e9831d8238cff", "task_path": "tasks/rl_align__o_proofs_pointwise_convergence_8__88605d00db5011f1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_pointwise_convergence_8", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_polynomial_coefficient_properties__390d6739bc87ed7e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem polynomial_coefficient_properties\n (a : Fin 9 → ℝ)\n (h : ∀ x : ℝ, (2*x - 1)*(x + 1)^7 = ∑ i : Fin 9, a i * x^(i : ℕ)) :\n a 0 = -1 ∧\n (a 0 + a 2 + a 4 + a 6 + a 8 = 64) ∧\n (a 1 + 2*a 2 + 3*a 3 + 4*a 4 + 5*a 5 + 6*a 6 + 7*a 7 + 8*a 8 = 704) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_polynomial_coefficient_properties", "source_license": null, "theorem_names": ["polynomial_coefficient_properties"], "statement_sha256": "390d6739bc87ed7ebedc1cd0bb6a5d96752f3b8a8085fadd28ddaaa598cdb113", "task_path": "tasks/rl_align__o_proofs_polynomial_coefficient_properties__390d6739bc87ed7e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_polynomial_coefficient_properties", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_polynomial_degree__6d2cc8854f0e5e80", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem polynomial_degree : Polynomial.degree (Polynomial.C 7 * Polynomial.X + Polynomial.C 2 * Polynomial.X ^ 3 * Polynomial.X + Polynomial.C (-1) * Polynomial.X ^ 2 * Polynomial.X + Polynomial.C (-5) * Polynomial.X ^ 3) = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_polynomial_degree", "source_license": null, "theorem_names": ["polynomial_degree"], "statement_sha256": "6d2cc8854f0e5e8061875bf9da248c4418d635e9199585e3e92497f53dee9b0b", "task_path": "tasks/rl_align__o_proofs_polynomial_degree__6d2cc8854f0e5e80", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_polynomial_degree", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_polynomial_infinite_composite__859f213a00d2317a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem polynomial_infinite_composite (a : ℕ → ℤ) (n : ℕ) (ha0 : a 0 = 1 ∨ a 0 = -1) (han : a n > 0) (h : ∃ i, i ≤ n ∧ a i ≠ 0) (hn : n ≥ 1) :\n ∃ s : Set ℤ, s.Infinite ∧ ∀ x ∈ s, ∃ d : ℤ, d ∣ x ∧ d > 1 ∧ d < x := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_polynomial_infinite_composite", "source_license": null, "theorem_names": ["polynomial_infinite_composite"], "statement_sha256": "859f213a00d2317ada236f3f7c6cd8df7b1466d1407aba99be9df4bc349064dc", "task_path": "tasks/rl_align__o_proofs_polynomial_infinite_composite__859f213a00d2317a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_polynomial_infinite_composite", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_polynomial_product_not_power_of_7__a579a7944906aaf7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem polynomial_product_not_power_of_7 (P : Polynomial ℤ) (hP : ∃ x : ℤ, Polynomial.eval x P = 0) : ¬∃ k : ℕ, P.eval 1995 * P.eval 2000 = 7^k := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_polynomial_product_not_power_of_7", "source_license": null, "theorem_names": ["polynomial_product_not_power_of_7"], "statement_sha256": "a579a7944906aaf7b8e64fa1e39c5d85e8219f6a8be887769d6c90af5eb66e29", "task_path": "tasks/rl_align__o_proofs_polynomial_product_not_power_of_7__a579a7944906aaf7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_polynomial_product_not_power_of_7", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_positiveProduct__a48c33db85d4039e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem positiveProduct {n : ℕ} (hn : 0 < n) (x : Fin n → ℝ)\n (hx : ∀ i, 0 < x i) (hxp : ∏ i, x i = 1) :\n ∏ i, (n + x i) ≥ (n + 1)^n := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_positiveProduct", "source_license": null, "theorem_names": ["positiveProduct"], "statement_sha256": "a48c33db85d4039ea7d424650e1333d4652e1837a73219938a1d9dabb618e08a", "task_path": "tasks/rl_align__o_proofs_positiveProduct__a48c33db85d4039e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_positiveProduct", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_possible_a_2__9b17f2b3690314bc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem possible_a : Set.ncard {a : ℤ | ∃ x y : ℕ, x > 0 ∧ y > 0 ∧ Even x ∧ Even y ∧ x ≠ y ∧ x^2 + a * x + 2016 = 0 ∧ y^2 + a * y + 2016 = 0} = 12 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_possible_a_2", "source_license": null, "theorem_names": ["possible_a"], "statement_sha256": "9b17f2b3690314bc30951923537fd0a6ccc194cd892c1c6c94b81a8acabd00ed", "task_path": "tasks/rl_align__o_proofs_possible_a_2__9b17f2b3690314bc", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_possible_a_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_possible_values_23__a3e5fd91f8fbe728", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\ntheorem possible_values :\n {N : ℕ | ∃ d : ℕ, N > 1 ∧ N < 100 ∧ ∑ i ∈ range (N.divisors.card - 1),\n (N.divisors.sort LE.le)[i]! * (N.divisors.sort LE.le)[i + 1]! = d ∧ d ∣ N ^ 2}.ncard = 25 := by sorry", "target_workspace": {"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"}, "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_possible_values_23", "source_license": null, "theorem_names": ["possible_values"], "statement_sha256": "a3e5fd91f8fbe7285b8d7d417cbd793847b5857a2dc2079116197a99ac13bf81", "task_path": "tasks/rl_align__o_proofs_possible_values_23__a3e5fd91f8fbe728", "metadata": {"split": "train", "difficulty": "hard", "source": "oproof", "source_id": "o_proofs_possible_values_23", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_possible_values_of_f_1__919519e81901c593", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem possible_values_of_f_1 : Set.ncard {z : ℝ | ∃ f : ℝ → ℝ, (∀ x y : ℝ, f ((x - y) ^ 2) = f x ^ 2 - 2 * x * f y + y ^ 2) ∧ z = f 1} * (∑ᶠ z ∈ {z : ℝ | ∃ f : ℝ → ℝ, (∀ x y : ℝ, f ((x - y) ^ 2) = f x ^ 2 - 2 * x * f y + y ^ 2) ∧ z = f 1}, z) = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_possible_values_of_f_1", "source_license": null, "theorem_names": ["possible_values_of_f_1"], "statement_sha256": "919519e81901c593feed662278eabb97c92a7f544b5a8c3e4f541f5854ab4acc", "task_path": "tasks/rl_align__o_proofs_possible_values_of_f_1__919519e81901c593", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_possible_values_of_f_1", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_probability_118__5f9d338c0b0235bb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem probability (n : ℕ) (hn : n > 0) :\n (Nat.card {x : Fin 7 → ℕ | ∑ i : Fin 7, x i = 10 ∧ ∀ i : Fin 7, x i ∈ Finset.Icc 1 6}) =\n 84 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_probability_118", "source_license": null, "theorem_names": ["probability"], "statement_sha256": "5f9d338c0b0235bb59987716f29c93d8cf7e96b5cf22296a5999db77f9a0a37e", "task_path": "tasks/rl_align__o_proofs_probability_118__5f9d338c0b0235bb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_probability_118", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_probability_194__f7c8c634f8c67abe", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem probability (S : Finset ℕ) (hS : S = {1, 2, 3, 4, 5, 6}) :\n (Nat.card {f : Fin 6 → ℕ | f.Injective ∧ ∀ i, f i ∈ S ∧ f 0 ≠ f 1 ∧ f 1 ≠ f 2 ∧ f 2 ≠ f 3 ∧ f 3 ≠ f 4 ∧ f 4 ≠ f 5 ∧\n ∑ i, f i * 10 ^ i.val = 123456}) / 720 = 1 / 720 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_probability_194", "source_license": null, "theorem_names": ["probability"], "statement_sha256": "f7c8c634f8c67abeb17b593ac129f168b9069d94aad73bd5b34991d0eb742463", "task_path": "tasks/rl_align__o_proofs_probability_194__f7c8c634f8c67abe", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_probability_194", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_probability_220__8e552de6f32b5ef6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem probability (s : Finset ℕ) (h₀ : s ⊆ Finset.Icc 1 24) (h₁ : s.card = 19) :\n ∃ t ⊆ s, t.card ≥ 4 ∧ ∃ k, t = {k, k + 1, k + 2, k + 3} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_probability_220", "source_license": null, "theorem_names": ["probability"], "statement_sha256": "8e552de6f32b5ef67dbc48eff62e2289fa96c7cc76ede1881b26ea060750fd51", "task_path": "tasks/rl_align__o_proofs_probability_220__8e552de6f32b5ef6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_probability_220", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_probability_429__a3dbbbf0728ec017", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem probability :\n ∫ y2 in (0)..(1/3), ∫ y1 in (y2)..(1/2), 3 * y1 = 23/216 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_probability_429", "source_license": null, "theorem_names": ["probability"], "statement_sha256": "a3dbbbf0728ec0176174be01c4e03b9877ff35465d73f35e863b7a6a429cd568", "task_path": "tasks/rl_align__o_proofs_probability_429__a3dbbbf0728ec017", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_probability_429", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_probability_752__49f4099c03503830", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem probability :\n round (((Finset.Icc 1 1000).filter fun m => (Nat.digits 9 m).length > (Nat.digits 10 m).length).card * 100 / (Finset.Icc 1 1000 : Set ℕ).ncard : ℝ) = 29 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_probability_752", "source_license": null, "theorem_names": ["probability"], "statement_sha256": "49f4099c035038304828cb6d7d0a460448b2ecd1061adfedf072d22049b3d9f9", "task_path": "tasks/rl_align__o_proofs_probability_752__49f4099c03503830", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_probability_752", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem1_136__08a5acfc18971e13", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem1 (x : ℕ) (h₀ : x ≠ 1 ∧ x ≠ 3 ∧ x ≠ 4 ∧ x ≠ 5 ∧ x ≠ 6) :\n ∃ A B C : Finset ℕ, A.card = 2 ∧ B.card = 2 ∧ C.card = 2 ∧\n A ∪ B ∪ C = {1, x, 3, 4, 5, 6} ∧ A ∩ B = ∅ ∧ A ∩ C = ∅ ∧ B ∩ C = ∅ ∧\n ∃ a b c : Fin 2 → ℕ, (∀ k, a k ∈ A) ∧ (∀ k, b k ∈ B) ∧ (∀ k, c k ∈ C) ∧\n (∀ k, c k = a k + b k) ∧ c 0 < c 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem1_136", "source_license": null, "theorem_names": ["problem1"], "statement_sha256": "08a5acfc18971e13c1e376f8b9577a8483580044e4cbaf4ccf1a8d4ef4e29c1e", "task_path": "tasks/rl_align__o_proofs_problem1_136__08a5acfc18971e13", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem1_136", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_18_9_2__38a9007c80a913b2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_18_9 (n : ℕ) : ∃ (k : ℕ) (a : Fin k → ℕ), (∑ i : Fin k, a i) = n ∧ ∀ (b : Fin k → ℕ), (∑ i : Fin k, b i) = n → (∏ i : Fin k, a i) ≥ ∏ i : Fin k, b i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_18_9_2", "source_license": null, "theorem_names": ["problem_18_9"], "statement_sha256": "38a9007c80a913b2675c69de38c8576c3c07613c59ae7c42d8bbde294f2be6a0", "task_path": "tasks/rl_align__o_proofs_problem_18_9_2__38a9007c80a913b2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_18_9_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_36_6__a211c377e4fc29b0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_36 : ∃ a b c : ℤ, a ≠ 0 ∧ b ≠ 0 ∧ c ≠ 0 ∧ a ≠ b ∧ a ≠ c ∧ b ≠ c ∧ ∃ p q : Polynomial ℤ, p.degree = 2 ∧ q.degree = 2 ∧ p * q = Polynomial.X ^ 4 - Polynomial.C a * Polynomial.X ^ 3 + Polynomial.C b * Polynomial.X ^ 2 - Polynomial.C c * Polynomial.X + Polynomial.C 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_36_6", "source_license": null, "theorem_names": ["problem_36"], "statement_sha256": "a211c377e4fc29b00ce9fb6e82c8bedaa26760d1258123732ac6ec9bee98c941", "task_path": "tasks/rl_align__o_proofs_problem_36_6__a211c377e4fc29b0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_36_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_B_134__dc84da292cf6a0e1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_B (f : ℝ → ℝ) (h₁ : ∀ x, f (x + 1) = f (-x + 1)) (h₂ : ∀ x, f (x + 2) = f x + f 2) (h₃ : ∀ x ∈ Set.Ioo 0 1, ∀ y ∈ Set.Ioo 0 1, x < y → f x < f y) : f (Real.log 3) > f (Real.log 2) ∧ f (Real.log 2) > f 2023.5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_B_134", "source_license": null, "theorem_names": ["problem_B"], "statement_sha256": "dc84da292cf6a0e12faf2f94ddfda796d89767a728b6d310b3b2a2a8b9822765", "task_path": "tasks/rl_align__o_proofs_problem_B_134__dc84da292cf6a0e1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_B_134", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_abc_2__ec5cf0124cbf3fc2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_abc (f g : ℝ → ℝ) (hf : DifferentiableOn ℝ f (Set.univ)) (hg : DifferentiableOn ℝ g (Set.univ)) (h₁ : ∀ x, f (x + 3) = g (-x) + 4) (h₂ : ∀ x, deriv f x + deriv g (1 + x) = 0) (h₃ : ∀ x, g (2 * x + 1) = g (-2 * x + 1)) : deriv g 1 = 0 ∧ ∀ x, f (2 - x) = f (2 + x) ∧ ∀ x, deriv f (1 - x) = deriv f (1 + x) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_abc_2", "source_license": null, "theorem_names": ["problem_abc"], "statement_sha256": "ec5cf0124cbf3fc2bc8fac4042d896485ca963960f31b81bf717668d894f06a8", "task_path": "tasks/rl_align__o_proofs_problem_abc_2__ec5cf0124cbf3fc2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_abc_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_11446__bfc7c73833feeb45", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (a : ℝ) (h₁ : ∃ n : ℕ, ∃ x₁ x₂ : ℝ, n < x₁ ∧ x₁ < x₂ ∧ x₂ < n + 2 ∧ deriv (fun x => a * exp x - x * Real.log x) x₁ = 0 ∧ deriv (fun x => a * exp x - x * Real.log x) x₂ = 0) : a ∈ Set.Ioo (Real.log (2 * Real.exp 1) / Real.exp 2) (1 / Real.exp 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_11446", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "bfc7c73833feeb450ba27e1b592ae9d527add039e931f1f464b756947b652544", "task_path": "tasks/rl_align__o_proofs_problem_name_11446__bfc7c73833feeb45", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_11446", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_1157__f50f3aac28d0422e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (p : ℝ) (h : ∃ n : ℕ, (p - (if n % 2 = 0 then -1 / (2 ^ (n + 1)) else 1 / (2 ^ (n + 1)))) * (p - (if (n + 1) % 2 = 0 then -1 / (2 ^ (n + 2)) else 1 / (2 ^ (n + 2)))) < 0) : p ∈ Set.Ioo (-3 / 4) (1 / 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_name_1157", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "f50f3aac28d0422ef9919549c04554efa1cd77ddebf3f1add690253b293fccee", "task_path": "tasks/rl_align__o_proofs_problem_name_1157__f50f3aac28d0422e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_name_1157", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_12995__48b8f2d07617b949", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (a : ℝ) (h₁ : ∀ x ∈ Set.Iic 5, deriv (fun x => x^2 - 2 * (a - 1) * x + 2) x ≤ 0) : a ≥ 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_name_12995", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "48b8f2d07617b949e497ac8e0fd3093fae0811513d4d1c8e1a2f93ac569e3821", "task_path": "tasks/rl_align__o_proofs_problem_name_12995__48b8f2d07617b949", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_name_12995", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_1454__111a00e988a9d079", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (m : ℝ) :\n (∃ x y : ℝ, x ≠ y ∧ deriv (fun x => (1/3) * Real.exp (3 * x) + m * Real.exp (2 * x) + (2 * m + 1) * Real.exp x + 1) x = 0 ∧ deriv (fun x => (1/3) * Real.exp (3 * x) + m * Real.exp (2 * x) + (2 * m + 1) * Real.exp x + 1) y = 0) ↔ m ∈ Set.Ioo (-1/2) (1 - Real.sqrt 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_1454", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "111a00e988a9d079ad8e4ebd4d78e2c1c52f1171097fe15dc669044b6f3af4a7", "task_path": "tasks/rl_align__o_proofs_problem_name_1454__111a00e988a9d079", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_1454", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_1588__263e8bb74ced7361", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (X : ℕ) (hX : X < 315) : ∃ a : ℕ, a > X ∧ ∃ P : Polynomial ℤ, (∀ x ∈ [1, 3, 5, 7], P.eval x = a) ∧ (∀ x ∈ [2, 4, 6, 8], P.eval x = -a) ∧ a = 315 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_name_1588", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "263e8bb74ced73610b5a3afb660fa93235d598b627d96b2cc2e08af24b3b76ef", "task_path": "tasks/rl_align__o_proofs_problem_name_1588__263e8bb74ced7361", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_name_1588", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_1593__afbdba38304759da", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (a : ℝ) (h₁ : ∀ x ∈ Set.Ioo 0 1, deriv (fun x => x^2 - a * x + 3) x ≤ 0) (h₂ : ∀ x ∈ Set.Ioo 1 2, deriv (fun x => x^2 - a * Real.log x) x ≥ 0) : a = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_1593", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "afbdba38304759da4df457c5059736e1a19ac5100d54fbe8d5a48ebffebd5c70", "task_path": "tasks/rl_align__o_proofs_problem_name_1593__afbdba38304759da", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_1593", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_199__407100cd1856b480", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (a b : ℝ) (h₁ : ∀ x ∈ Set.Ioo (-1 : ℝ) 1, deriv (fun x => x ^ 3 + a * x + b) x < 0) (h₂ : ∀ x ∈ Set.Ioi 1, deriv (fun x => x ^ 3 + a * x + b) x > 0) : a = -3 ∧ b ∈ Set.univ := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_name_199", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "407100cd1856b4808958d8a6c0695f856ed37f46377b818a9dcfb1df21661a58", "task_path": "tasks/rl_align__o_proofs_problem_name_199__407100cd1856b480", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_name_199", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_201__6cef16af3b7ebbbe", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (a : ℝ) : (∃ x y : ℝ, x ≠ y ∧ deriv (fun x => (1/3)*a*x^3 + x^2 + a*x + 1) x = 0 ∧ deriv (fun x => (1/3)*a*x^3 + x^2 + a*x + 1) y = 0) ↔ a ∈ Set.Ioo (-1) 0 ∪ Set.Ioo 0 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_201", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "6cef16af3b7ebbbe3dfa147beeb9ab38c0dd8642d4d69c5d1139c90c283cb5c3", "task_path": "tasks/rl_align__o_proofs_problem_name_201__6cef16af3b7ebbbe", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_201", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_2890__d4a2342a9b5bebbf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (f : ℝ → ℝ) (h₁ : ∀ x, f (x - 1) = -f (1 - x)) (h₂ : f 3 = 0) (h₃ : ∀ x₁ x₂ : ℝ, x₁ < 0 → x₂ < 0 → x₁ ≠ x₂ → (f x₂ - f x₁) / (x₂ - x₁) < 0) : {x : ℝ | (x - 1) * f (x + 1) ≥ 0} = Set.Icc (-4) (-1) ∪ Set.Icc 1 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_name_2890", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "d4a2342a9b5bebbf8757eac32ff4a014aa080b64319adb7e80d927fe5d0ae58e", "task_path": "tasks/rl_align__o_proofs_problem_name_2890__d4a2342a9b5bebbf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_name_2890", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_2980__d4871167b44cc80b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (m : ℝ) (h₁ : ∀ x ∈ Set.Icc 1 2, deriv (fun x => (1/3)*x^3 - (1/2)*m*x^2 + 4*x - 3) x ≥ 0) : m ≤ 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_2980", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "d4871167b44cc80b6d40b151773b8518dcb2f5b62d81768e7b2f98f9535fd02f", "task_path": "tasks/rl_align__o_proofs_problem_name_2980__d4871167b44cc80b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_2980", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_3524__d208ce0aa2e6571f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (p : Polynomial ℤ) (hp : p.degree = 6 ∧ p.coeff 6 = 1) :\n p.eval 1 = 1 ∧ p.eval 2 = 2 ∧ p.eval 3 = 3 ∧ p.eval 4 = 4 ∧ p.eval 5 = 5 ∧ p.eval 6 = 6 → p.eval 8 = 5048 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_3524", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "d208ce0aa2e6571ffa129469858c4e2c9d9f80fabb476bc60364eb07ecbb31ac", "task_path": "tasks/rl_align__o_proofs_problem_name_3524__d208ce0aa2e6571f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_3524", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_4591__35ba6454103d392c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (a : ℝ) (h₁ : ∀ x ∈ Set.Ioo 1 4, deriv (fun x => (1 / 3 : ℝ) * x ^ 3 - (1 / 2 : ℝ) * a * x ^ 2 + (a - 1) * x + 1) x < 0) (h₂ : ∀ x ∈ Set.Ioi 6, deriv (fun x => (1 / 3 : ℝ) * x ^ 3 - (1 / 2 : ℝ) * a * x ^ 2 + (a - 1) * x + 1) x > 0) : a ∈ Set.Icc 5 7 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_4591", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "35ba6454103d392cd70064eadba5807b0cc3673bd7bbdd0fac61a8ed6e497280", "task_path": "tasks/rl_align__o_proofs_problem_name_4591__35ba6454103d392c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_4591", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_701__3291cb00e716c067", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (a : ℝ) (h₀ : 0 < a ∧ a ≠ 1) :\n (∀ x ∈ Set.Ioo (-1/3) 0, deriv (fun x => Real.logb a (x^3 - a*x)) x > 0) → a ∈ Set.Ico (1/3) 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_701", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "3291cb00e716c067cb3779e283aebe0197b085d443595fec45b2044b9bb99bae", "task_path": "tasks/rl_align__o_proofs_problem_name_701__3291cb00e716c067", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_701", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_7367__aa47a989d2d552e0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (f : ℝ → ℝ) (hf : ∀ x, f x = 2 * x / (x - 2)) :\n ∃ M m : ℝ, (∀ x ∈ Set.Icc 3 4, f x ≤ M) ∧ (∀ x ∈ Set.Icc 3 4, m ≤ f x) ∧\n (∀ y, (∃ x ∈ Set.Icc 3 4, f x = y) → y ≤ M) ∧ (∀ y, (∃ x ∈ Set.Icc 3 4, f x = y) → m ≤ y) ∧\n m ^ 2 / M = 8 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_name_7367", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "aa47a989d2d552e064d7b953f5f491db92e68763247f6c264978784c391327c8", "task_path": "tasks/rl_align__o_proofs_problem_name_7367__aa47a989d2d552e0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_name_7367", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_name_7654__c89fe2b0b980c35d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_name (a : ℝ) (h₁ : ∀ x ∈ Set.Ioo 1 4, deriv (fun x => (1/3)*x^3 - (1/2)*a*x^2 + (a-1)*x + 1) x < 0) (h₂ : ∀ x ∈ Set.Ioi 6, deriv (fun x => (1/3)*x^3 - (1/2)*a*x^2 + (a-1)*x + 1) x > 0) : a ∈ Set.Icc 5 7 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_7654", "source_license": null, "theorem_names": ["problem_name"], "statement_sha256": "c89fe2b0b980c35d414d8aaa0a0e27742c093a8269606cede1dd750dd28b4941", "task_path": "tasks/rl_align__o_proofs_problem_name_7654__c89fe2b0b980c35d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_name_7654", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_part1_6__51005803db884b4c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_part1 (a : ℝ) (h₀ : 1 < a) :\n (∀ x ∈ Set.Icc (-3 : ℝ) 3, x ≤ -1 → deriv (fun x => Real.logb 2 (x ^ 2 + 2 * x + a)) x ≤ 0) ∧\n (∀ x ∈ Set.Icc (-3 : ℝ) 3, -1 ≤ x → deriv (fun x => Real.logb 2 (x ^ 2 + 2 * x + a)) x ≥ 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_part1_6", "source_license": null, "theorem_names": ["problem_part1"], "statement_sha256": "51005803db884b4ced93c506b02b858813f5c5d91e0b8c89010633797202c89e", "task_path": "tasks/rl_align__o_proofs_problem_part1_6__51005803db884b4c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_part1_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_part_I_3__0838c3dc11cacf1f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_part_I (m : ℝ) :\n ∃ (a b : ℝ), a < b ∧ ∀ x ∈ Set.Ico a b, (deriv (fun x => sin x ^ 2 + 2 * Real.sqrt 3 * sin x * cos x + 3 * cos x ^ 2 + m)) x ≥ 0 ∧\n ∃ (c : ℝ), ∀ x, (fun x => sin x ^ 2 + 2 * Real.sqrt 3 * sin x * cos x + 3 * cos x ^ 2 + m) (c - x) = (fun x => sin x ^ 2 + 2 * Real.sqrt 3 * sin x * cos x + 3 * cos x ^ 2 + m) (c + x) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_part_I_3", "source_license": null, "theorem_names": ["problem_part_I"], "statement_sha256": "0838c3dc11cacf1f668379cb2ec5a52958e188b896c37c20e8a90fa846b54182", "task_path": "tasks/rl_align__o_proofs_problem_part_I_3__0838c3dc11cacf1f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_problem_part_I_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_problem_three__085d8694b2c1df64", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem problem_three (n : ℕ) (hn : n ≥ 2) (a : Fin n → ℤ) (h₁ : ∑ i, a i ≥ n^2) (h₂ : ∑ i, a i ^ 2 ≤ n^3 + 1) : ∀ i : Fin n, a i = n := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_three", "source_license": null, "theorem_names": ["problem_three"], "statement_sha256": "085d8694b2c1df64567a76ecfdbbf3a833385f4bf8cef00ea53eef37061f14a7", "task_path": "tasks/rl_align__o_proofs_problem_three__085d8694b2c1df64", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_problem_three", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prod_4__1e3b258b21c46386", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem prod (n : ℕ) (hn : 2 ≤ n) (a : ℕ → ℝ)\n (ha : ∀ i ∈ Icc 1 n, 1 ≤ a i) (x : ℝ) (hx : x ∈ Set.Icc (-1) 1) :\n ∏ i ∈ Icc 1 n, (a i + x) / 2 ≤ (∏ i ∈ Icc 1 n, a i + x) / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prod_4", "source_license": null, "theorem_names": ["prod"], "statement_sha256": "1e3b258b21c463860c1e75fe52d309bdf0f12bedcd36a435267d61c40bca4388", "task_path": "tasks/rl_align__o_proofs_prod_4__1e3b258b21c46386", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prod_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prod_incr_4__884b17329a754a9f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem prod_incr {n : ℕ} (hn : 0 < n) (a : ℕ → ℝ)\n (ha : ∀ i ∈ range n, 1 ≤ a i) :\n 2^(n - 1) * (∏ i ∈ range n, a i + 1) ≥ ∏ i ∈ range n, (1 + a i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prod_incr_4", "source_license": null, "theorem_names": ["prod_incr"], "statement_sha256": "884b17329a754a9f0bdd0949bca2f79e7a7993c64afcbf01ff7693e249419a7f", "task_path": "tasks/rl_align__o_proofs_prod_incr_4__884b17329a754a9f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prod_incr_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prod_of_palindrome__544e49291768f37f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem prod_of_palindrome (p q : ℕ) (hp : p ∈ Set.Icc 100 999 ∧ Nat.digits 10 p = List.reverse (Nat.digits 10 p))\n (hq : q ∈ Set.Icc 100 999 ∧ Nat.digits 10 q = List.reverse (Nat.digits 10 q)) :\n p * q = 436995 → p + q = 1332 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prod_of_palindrome", "source_license": null, "theorem_names": ["prod_of_palindrome"], "statement_sha256": "544e49291768f37f4b80263bc6c4bbf6bfa6004054018d3a166c32ccb407f1e3", "task_path": "tasks/rl_align__o_proofs_prod_of_palindrome__544e49291768f37f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prod_of_palindrome", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prod_of_pos_x__7029b4bd41da7b19", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem prod_of_pos_x (n : ℕ) (hn : 0 < n) (x : ℕ → ℝ)\n (hx : ∀ i ∈ Icc 1 n, 0 < x i) (hsum : ∑ i ∈ Icc 1 n, x i < 1 / 2) :\n ∏ i ∈ Icc 1 n, (1 - x i) > 1 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prod_of_pos_x", "source_license": null, "theorem_names": ["prod_of_pos_x"], "statement_sha256": "7029b4bd41da7b191f1ef978c1630c5d22b4262346b7cd2f6ddc797ad356faec", "task_path": "tasks/rl_align__o_proofs_prod_of_pos_x__7029b4bd41da7b19", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prod_of_pos_x", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prod_of_roots_2__0436c83e95c804e6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem prod_of_roots {p : Polynomial ℤ} (hp₁ : p.eval 17 = 10) (hp₂ : p.eval 24 = 17)\n (n₁ n₂ : ℤ) (hn₁ : p.eval n₁ = n₁ + 3) (hn₂ : p.eval n₂ = n₂ + 3)\n (hne : n₁ ≠ n₂) : n₁ * n₂ = 418 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prod_of_roots_2", "source_license": null, "theorem_names": ["prod_of_roots"], "statement_sha256": "0436c83e95c804e68005ee28d22192aa349daa3641fdacf0262706761191512e", "task_path": "tasks/rl_align__o_proofs_prod_of_roots_2__0436c83e95c804e6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prod_of_roots_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prod_of_zs__38d2fd3bced2125a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Complex Filter Function Metric Finset\nopen scoped BigOperators Topology\n\n\ntheorem prod_of_zs {N : ℕ} (hN : 0 < N) (a b : Fin N → ℝ)\n (z : Fin N → ℂ) (hz : ∀ i, z i = a i + I * b i)\n (r : Fin N → ℝ) (hr : ∀ i, r i = Real.sqrt (a i ^ 2 + b i ^ 2))\n (θ : Fin N → ℝ) (hθ : ∀ i, θ i = (z i).arg) :\n (∏ i, z i).im = Real.sin (∑ i, θ i) * ∏ i, r i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prod_of_zs", "source_license": null, "theorem_names": ["prod_of_zs"], "statement_sha256": "38d2fd3bced2125af47cfffa612b90bd207fdb7343231ca3af7b7836250a5084", "task_path": "tasks/rl_align__o_proofs_prod_of_zs__38d2fd3bced2125a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prod_of_zs", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_product_max_equal__b3282b94dfe4a2d4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem product_max_equal (n : ℕ) (S : ℝ) (numbers : Fin n → ℝ) (h_sum : ∑ i : Fin n, numbers i = S) (h_pos : ∀ i : Fin n, 0 < numbers i) : (∀ i : Fin n, numbers i = S / n) ↔ (∏ i : Fin n, numbers i) = (∏ i : Fin n, S / n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_product_max_equal", "source_license": null, "theorem_names": ["product_max_equal"], "statement_sha256": "b3282b94dfe4a2d4d9a495b6f6e4f28a93bccbf931352f6e13d1330c801a4658", "task_path": "tasks/rl_align__o_proofs_product_max_equal__b3282b94dfe4a2d4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_product_max_equal", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_proveGCD__21aa3e237fd1c6d8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem proveGCD (n : ℕ) (hn : n > 0) (a : Fin n → ℕ)\n (ha : ∀ i, a i > 5) (hp : ∀ i, Nat.Prime (a i))\n (h : ∃ p, Nat.Prime p ∧ p = ∑ i, (a i)^4) :\n Nat.gcd 30 n = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_proveGCD", "source_license": null, "theorem_names": ["proveGCD"], "statement_sha256": "21aa3e237fd1c6d8eb1fbccf46c2273d023b9bc429cf1b4222b814108480da63", "task_path": "tasks/rl_align__o_proofs_proveGCD__21aa3e237fd1c6d8", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_proveGCD", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_proveLeast_4__6445bac77dbe3d94", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem proveLeast {k : ℕ} (hk : ∀ A : Finset ℕ, A ⊆ Icc 1 100000 ∧ A.card = 2010 →\n ∃ a ∈ A, ∃ b ∈ A, a ≠ b ∧ |(a : ℤ) - b| ≤ k) :\n IsLeast {x | (∀ A : Finset ℕ, A ⊆ Icc 1 100000 ∧ A.card = 2010 → ∃ a ∈ A, ∃ b ∈ A, a ≠ b ∧ |(a : ℤ) - b| ≤ x)} 49 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_proveLeast_4", "source_license": null, "theorem_names": ["proveLeast"], "statement_sha256": "6445bac77dbe3d94b03de4b420b609b0d4042b077bbb8e91dabe946b218a703c", "task_path": "tasks/rl_align__o_proofs_proveLeast_4__6445bac77dbe3d94", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_proveLeast_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_10014__1d84c9b489a84eb9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {x : ℕ | ∃ p q : ℕ, p > 0 ∧ q > 0 ∧ p + q < 10 ∧ x = p * q} = 16 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_10014", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "1d84c9b489a84eb95be093431861123ebe026fbf912c974ff51708320d35a6ab", "task_path": "tasks/rl_align__o_proofs_prove_10014__1d84c9b489a84eb9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_10014", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_10367__a88e8122904c137b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {s : Finset ℕ | s ⊆ Finset.Icc 1 50 ∧ s.card = 3 ∧ 3 ∣ s.sum id} = 6544 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_10367", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "a88e8122904c137bba8afabb400ceb6da2dce8270a5f03749bc3a0387edc439e", "task_path": "tasks/rl_align__o_proofs_prove_10367__a88e8122904c137b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_10367", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_10383__6e45e77762db4aaa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {s : Finset ℕ | s ⊆ Finset.Icc 1 300 ∧ s.card = 3 ∧ 3 ∣ ∑ x ∈ s, x} = 1485100 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_10383", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "6e45e77762db4aaa1b0465e8a7de0d98400a6677a8b205614e24424e07971fc9", "task_path": "tasks/rl_align__o_proofs_prove_10383__6e45e77762db4aaa", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_10383", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_10513__db221bc50d94405b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {n : ℕ | ∃ a b, n = a * b ∧ a ∈ (Nat.divisors 100000) ∧ b ∈ (Nat.divisors 100000) ∧ a ≠ b} = 117 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_10513", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "db221bc50d94405ba3bcc66a76df038217295577140ef0caa181c0cab0ca7c45", "task_path": "tasks/rl_align__o_proofs_prove_10513__db221bc50d94405b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_10513", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_10531__e23167e4109ed4ad", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {n : ℕ | 20000 ≤ n ∧ n < 70000 ∧ Odd n ∧ (Nat.digits 10 n).length = 5 ∧\n (Nat.digits 10 n).toFinset.card = 5 ∧ (Nat.digits 10 n)[2]! = 5} = 630 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_10531", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "e23167e4109ed4ade793ec0a706f1d0987e3aab1f13392f05aca2afc8be091ad", "task_path": "tasks/rl_align__o_proofs_prove_10531__e23167e4109ed4ad", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_10531", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_10617__d130df826b6fe54e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (a : Fin 11 → ℕ) (ha : ∀ i, 0 < a i)\n (h1 : ∀ i, a i + a ((i + 1) % 11) + a ((i + 2) % 11) ≤ 19)\n (h2 : ∀ i, a i + a ((i + 1) % 11) + a ((i + 2) % 11) + a ((i + 3) % 11) ≥ 25) :\n ∑ i, a i = 69 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_10617", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "d130df826b6fe54ee57442c78e422b7b50fc38bd063c7e27c9fe5d8b704b13d9", "task_path": "tasks/rl_align__o_proofs_prove_10617__d130df826b6fe54e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_10617", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_10628__454b9a21e9460f30", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem prove : IsSquare (∏ i ∈ Icc 1 120, if i = 60 then 1 else Nat.factorial i) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_10628", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "454b9a21e9460f308ff2a1e1257011edcb6acc4f4b9af6b3090b9d5577a98b81", "task_path": "tasks/rl_align__o_proofs_prove_10628__454b9a21e9460f30", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_10628", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_1133__e9c60234f940348c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem prove (f : ℝ → ℝ) (a b : ℝ)\n (h₁ : ContDiff ℝ 1 f)\n (h₂ : Tendsto f atTop (𝓝 a))\n (h₃ : Tendsto (deriv f) atTop (𝓝 b)) :\n b = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_1133", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "e9c60234f940348cae7ed732b49b20834b6d5bf9ddc47f62cf70b3d300ac6529", "task_path": "tasks/rl_align__o_proofs_prove_1133__e9c60234f940348c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_1133", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_1217__3e27971e30c2cb71", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem prove (a b : ℕ → ℝ)\n (h₀ : a 0 = 13)\n (h₁ : b 0 = 29)\n (h₂ : ∀ n, a (n + 1) = (a n + b n) / 2)\n (h₃ : ∀ n, b (n + 1) = 1 / (1 / a n + 1 / b n)) :\n Tendsto (λ n => a n * b n) atTop (𝓝 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_1217", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "3e27971e30c2cb71f110a8620056e3fc5ec35ccc48ae131ada8549b2712f4942", "task_path": "tasks/rl_align__o_proofs_prove_1217__3e27971e30c2cb71", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_1217", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_12629__8b11e9341e16ea95", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem prove (v : ℝ → ℝ) (h : v = λ t => 1 - sqrt t)\n (s : ℝ → ℝ) (hs : s = λ t => ∫ x in (0)..t, v x)\n (l : ℝ → ℝ) (hl : l = λ t => ∫ x in (0)..t, |v x|) :\n s 4 = -4 / 3 ∧ l 4 = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_12629", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "8b11e9341e16ea95628100cdb314a6dd09d15bfb020c07b435f7ad10de96b6d6", "task_path": "tasks/rl_align__o_proofs_prove_12629__8b11e9341e16ea95", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_12629", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_14549__d525d85e9c531c74", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Matrix Finset\n\n\ntheorem prove {A : Matrix (Fin 3) (Fin 3) ℝ}\n (hA : A = !![2006, 1, -2006; 2005, 2, -2006; 2005, 1, -2005]) :\n ∃ B : Matrix (Fin 3) (Fin 3) ℝ,\n B = ∑ i ∈ range 2007, A ^ i ∧\n B 0 0 = 2006 * 1003 * 2007 - 1003 * 2005 + 1 ∧\n B 1 1 = 1003 * 2007 + 2007 ∧\n B 2 2 = - (2007 * 1003 * 2007 - 1003 * 2005 - 2006) + 2007 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_14549", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "d525d85e9c531c7467f0135d9c25702c1097abfed019cf5382be84786870d3a5", "task_path": "tasks/rl_align__o_proofs_prove_14549__d525d85e9c531c74", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_14549", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_14592__c428f20dd49d608d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem prove (n : ℕ) :\n ∫ x in (0)..1, x * (1 - x)^n = 1 / ((n + 1) * (n + 2)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_14592", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "c428f20dd49d608d641501764d240c9415cad42daa7a7a8ad4dbc0553f9fe7ca", "task_path": "tasks/rl_align__o_proofs_prove_14592__c428f20dd49d608d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_14592", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_1483__122d4f3184cb9cde", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove {f : Polynomial ℤ} (hf : f.degree = 5) (h : f.coeff 5 = 2001)\n (h1 : f.eval 1 = 1) (h2 : f.eval 2 = 3) (h3 : f.eval 3 = 5)\n (h4 : f.eval 4 = 7) (h5 : f.eval 5 = 9) : f.eval 6 = 240131 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_1483", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "122d4f3184cb9cdee950b8c023463c4c3cf2284a2f6cfe44c23eb333a2e1950d", "task_path": "tasks/rl_align__o_proofs_prove_1483__122d4f3184cb9cde", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_1483", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_1536__08ac83ffd565ac3c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem prove (L : ℝ) (hL : L > 0) (n m : ℕ) (hn : n > 0) (hm : m > 0)\n (hnm : n = m) :\n ∫ x in (0)..L, sin (n * π * x / L) * sin (m * π * x / L) = L / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_1536", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "08ac83ffd565ac3c9f4800d4265d33058411603895112cebe88123eae884658c", "task_path": "tasks/rl_align__o_proofs_prove_1536__08ac83ffd565ac3c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_1536", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_1579__ca7cf2f307b8f170", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (n : ℕ) (hn : 3 ≤ n) :\n ∃ s : Finset ℕ,\n s ⊆ Finset.Icc 1 n ∧\n s.card ≤ 2 ∧\n IsSquare (∑ x ∈ (Finset.Icc 1 n) \\ s, x) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_1579", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "ca7cf2f307b8f1701d795f90327916351b3aa39bac98947455901b7e879565ce", "task_path": "tasks/rl_align__o_proofs_prove_1579__ca7cf2f307b8f170", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_1579", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_16316__8742ecfe6704330f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove {f : Polynomial ℝ} (hf : f.degree = 8)\n (h : ∀ i ∈ Finset.range 9, f.eval (2 ^ i) = 1 / (2 ^ i)) :\n f.eval 0 = 2 - 2 ^ (-8 : ℤ) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_16316", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "8742ecfe6704330ff447d433818c171def288e1358c9fcaba204254db24cb896", "task_path": "tasks/rl_align__o_proofs_prove_16316__8742ecfe6704330f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_16316", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_1797__6260f3d316f2f836", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem prove :\n ∃ T : Fin 100 → (Fin 3 → EuclideanSpace ℝ (Fin 2)),\n (∀ i j, i ≠ j → ¬(convexHull ℝ {T i k | k : Fin 3} ⊆ convexHull ℝ {T j k | k : Fin 3}) ∧\n ¬(convexHull ℝ {T j k | k : Fin 3} ⊆ convexHull ℝ {T i k | k : Fin 3})) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_1797", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "6260f3d316f2f836a63d8c24bbeb9e52c3183e0d155cc534829686bcff9b78d0", "task_path": "tasks/rl_align__o_proofs_prove_1797__6260f3d316f2f836", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_1797", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_1849__1e0fdceb57311f5f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (f : ℝ → ℝ → ℝ)\n (h₀ : ∀ r, f r = fun x => x * (x - 1) * (x - 2) * (x - 3) + r) :\n Set.Finite {r | ∃ x, f r x = 0 ∧ deriv (f r) x = 0} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_1849", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "1e0fdceb57311f5ff0a5fc9a48b322387a8f44b6998d99b16b73a904691e396d", "task_path": "tasks/rl_align__o_proofs_prove_1849__1e0fdceb57311f5f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_1849", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_1909__a9cf9b09da5f5da8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem prove (f : ℝ → ℝ) (hf : f = λ x => abs (4 * x) - sqrt (4 * x)) :\n (∑ᶠ x ∈ {x | f x = 0}, x) / {x | f x = 0}.ncard = 1 / 8 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_1909", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "a9cf9b09da5f5da8b5aa4a117bb676e2b8d53ff06ae82ec1c53c4403c4533a74", "task_path": "tasks/rl_align__o_proofs_prove_1909__a9cf9b09da5f5da8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_1909", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_19636__2543e0368622ebf3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (a : Fin 33 → ℕ) (h₀ : ∑ i, a i = 430) :\n ∃ b : Fin 20 → Fin 33, (∀ i j, i < j → a (b i) ≥ a (b j)) ∧\n ∑ i, a (b i) ≥ 260 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_19636", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "2543e0368622ebf36f52989345a034e2f8cfaeed6593ac01784815b2b25317f4", "task_path": "tasks/rl_align__o_proofs_prove_19636__2543e0368622ebf3", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_19636", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_21026__1c7beb4f9fe536f9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {n : ℕ | Even n ∧ 200 ≤ n ∧ n < 700 ∧ (Nat.digits 10 n).length = 3 ∧\n (Nat.digits 10 n).toFinset.card = 3 ∧ ∀ d ∈ (Nat.digits 10 n), d = 1 ∨ d = 2 ∨ d = 5 ∨ d = 7 ∨ d = 8 ∨ d = 9} = 12 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_21026", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "1c7beb4f9fe536f9910084e832eef1251684c751b0be08a53d1d97b70e4444c8", "task_path": "tasks/rl_align__o_proofs_prove_21026__1c7beb4f9fe536f9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_21026", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_21238__bc6fc10896f3f05d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {n : ℕ | ∃ x y : ℕ, x ≠ y ∧ n = x + y ∧ x ∈ Finset.Icc 10 99 ∧ y ∈ Finset.Icc 10 99 ∧ y = Nat.ofDigits 10 (List.reverse (Nat.digits 10 x))} = 15 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_21238", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "bc6fc10896f3f05d14b7e0af360983f04321d5ff51f15cfc516181a86b4cccae", "task_path": "tasks/rl_align__o_proofs_prove_21238__bc6fc10896f3f05d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_21238", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_21239__3fb476d68da9faee", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem prove (n : ℕ) (hn : 0 < n) (a : ℕ → ℝ)\n (ha : ∀ i ∈ Icc 1 n, 0 < a i) (h : a (n + 1) = a 1) :\n ∑ i ∈ Icc 1 n, (a i)^2 / ((a i)^2 + (a (i + 1))^2) * (a i - a (i + 1)) ≥ 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_21239", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "3fb476d68da9faeebdad9b4f12189b9267a291ca463ae5d2169d8e6f4ed5b3b5", "task_path": "tasks/rl_align__o_proofs_prove_21239__3fb476d68da9faee", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_21239", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_2256__3b0a4baf43ad83e9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem prove (x : ℝ) :\n ∫ v in (x)..(x^2), (v^2 + sin (3 * v)) =\n (x^6 - x^3 - cos (3 * x^2) + cos (3 * x)) / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_2256", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "3b0a4baf43ad83e9974eff20341bfa1b52c5e4cdfb8d8e85511ecba474ae48a4", "task_path": "tasks/rl_align__o_proofs_prove_2256__3b0a4baf43ad83e9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_2256", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_22701__69c7443e2569b37c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem prove (f : ℝ → ℝ) (hf : f = λ x => (x ^ 2 - 9) / (x ^ 2 - 1)) :\n ¬ ∃ y, Tendsto f (𝓝[≠] 1) (𝓝 y) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_22701", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "69c7443e2569b37ce570da496eb3856a4aef5081f8a34489693a8219839670cd", "task_path": "tasks/rl_align__o_proofs_prove_22701__69c7443e2569b37c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_22701", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_2306__712af44e01826b52", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Complex Polynomial\n\n\ntheorem prove {a : ℕ → ℂ}\n (ha : ∀ n, a n = ∏ i ∈ Icc 1 n, (1 + I / Real.sqrt i)) :\n ∀ n, ‖a n - a (n + 1)‖ = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_2306", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "712af44e01826b5216c05d98dec2963e2a6a477849ac383ab0ea2777fc3f0fbc", "task_path": "tasks/rl_align__o_proofs_prove_2306__712af44e01826b52", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_2306", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_25445__93fcf3b5ab45fd6e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove {f : Polynomial ℤ} (hf : f.Monic) (hfd : f.degree = 4)\n (h : ∀ n ∈ Finset.Icc 1 4, f.eval (2 ^ n + 1) = 8 ^ n + 1) :\n f.eval 1 = 1025 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_25445", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "93fcf3b5ab45fd6ed565de02bf77ae326ac4de938f078ab1cda7f07106082153", "task_path": "tasks/rl_align__o_proofs_prove_25445__93fcf3b5ab45fd6e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_25445", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_257__69d96c4ef1ff7c1e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem prove (α : ℝ) (hα : α = π / 4) (P : ℝ × ℝ) (hP : P = (1, 1))\n (C : ℝ → ℝ → Prop) (hC : C = λ x y => x ^ 2 + (y - 2) ^ 2 = 4) :\n (∃ A B : ℝ × ℝ, A ∈ {p | C p.1 p.2} ∧ B ∈ {p | C p.1 p.2} ∧\n dist P A * dist P B = 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_257", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "69d96c4ef1ff7c1e7b0f862d36fbba5b4fb42c4df7590963afe273fd892d1c47", "task_path": "tasks/rl_align__o_proofs_prove_257__69d96c4ef1ff7c1e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_257", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_27247__f365516486259b7a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (a : ℤ) (h : ∃ p : Polynomial ℤ, p.degree = 15 ∧ ∀ x : ℤ, (x^2 + x + a) * p.eval x = x^17 + x^13 + x^5 - 90 * x^4 + x - 90) :\n a = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_27247", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "f365516486259b7af142dc695cdfea56f68deedde8f75e77bd414075d2149617", "task_path": "tasks/rl_align__o_proofs_prove_27247__f365516486259b7a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_27247", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_2750__6b7d6cd0bd699455", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (a : ℝ) (ha : a ≥ 3 * Real.sqrt 3 / 2) :\n ∃ a' : ℕ → ℝ,\n (∀ n, a' (n + 1) > a' n) ∧\n a' 0 = 1 ∧\n a = ∑' n, a' (n + 1) / (a' n)^3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_2750", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "6b7d6cd0bd699455b0b836bc654bfc7cab6f84abbeac55bf0758561ce147dba4", "task_path": "tasks/rl_align__o_proofs_prove_2750__6b7d6cd0bd699455", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_2750", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_28531__9ecd181edae44e94", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (n : ℕ) (hn : 3 ≤ n) :\n ∃ s : Finset ℕ,\n s ⊆ Finset.Icc 1 n ∧\n s.card ≤ 2 ∧\n IsSquare (∑ i ∈ Finset.Icc 1 n \\ s, i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_28531", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "9ecd181edae44e94dd2c1424db74a7963ac6ec538f0df44da379c1d6fbcd11f8", "task_path": "tasks/rl_align__o_proofs_prove_28531__9ecd181edae44e94", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_28531", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_30023__9356f4b54c33dfd6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem prove (l : ℝ) (hl : l > 0) (m n : ℕ) (hm : 0 < m) (hn : 0 < n)\n (hmn : m ≠ n) :\n ∫ x in (0)..l, sin (π * m * x / l) * sin (π * n * x / l) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_30023", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "9356f4b54c33dfd682ee80df3a34267359ff34c98b8bdcb0c566444abbff000a", "task_path": "tasks/rl_align__o_proofs_prove_30023__9356f4b54c33dfd6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_30023", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_30026__96915aa5475d7b9f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem prove (A B C : EuclideanSpace ℝ (Fin 2))\n (h₀ : A ≠ B) (h₁ : A ≠ C) (h₂ : B ≠ C)\n (h₃ : dist A B = sqrt (dist A C ^ 2 + dist B C ^ 2)) :\n dist C (midpoint ℝ A B) = dist A B / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_30026", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "96915aa5475d7b9fcaffe05cebe472bdb114db9707032a64c2a08aa0e6a2aaa4", "task_path": "tasks/rl_align__o_proofs_prove_30026__96915aa5475d7b9f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_30026", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_30056__40cbbfa28060ca97", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem prove {U : Finset ℕ} (hU : U = Icc 1 2021) :\n ∃ A B : Finset ℕ,\n A ⊆ U ∧ B ⊆ U ∧\n A.Nonempty ∧ B.Nonempty ∧\n A ∩ B = ∅ ∧\n A ∪ B = U ∧\n IsSquare ((∑ x ∈ A, x) * (∑ x ∈ B, x)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_30056", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "40cbbfa28060ca97cd293b4392cfa9e72afdf38e7f5694a3fa196e5c7041c091", "task_path": "tasks/rl_align__o_proofs_prove_30056__40cbbfa28060ca97", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_30056", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_30113__ef7481b61855ef02", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem prove {c : ℝ} (hc : c > 0) :\n ∫ x in (0)..c, abs (x^2 - 1) = c ↔ c = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_30113", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "ef7481b61855ef0272b58e8b77be682b90f586e59d4ecf3e9763a3ff1eaa5af9", "task_path": "tasks/rl_align__o_proofs_prove_30113__ef7481b61855ef02", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_30113", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_3179__8602a8d81b7c8fb1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (a b c : ℝ) (f : ℝ → ℝ) (hf : f = fun x => x^2 + a * x + b)\n (h : ∀ x, f (x + 1) = c * ∫ t in (0)..1, (3 * x^2 + 4 * x * t) * deriv f t) :\n (a, b, c) = (-5 / 3, 2 / 3, -1 / 2) ∨ (a, b, c) = (-2 / 3, -1 / 3, 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_3179", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "8602a8d81b7c8fb1f823225518746fd716a6669347d6fe2af2940aa239e66947", "task_path": "tasks/rl_align__o_proofs_prove_3179__8602a8d81b7c8fb1", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_3179", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_3466__ae310d3556124bcd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (n m : ℕ) (h₀ : n ∈ Finset.Icc 100 999) (h₁ : m ∈ Finset.Icc 10 99)\n (h₂ : (Nat.digits 10 n).length = 3) (h₃ : (Nat.digits 10 m).length = 2)\n (h₄ : (Nat.digits 10 n).toFinset.card = 3) (h₅ : (Nat.digits 10 m).toFinset.card = 2)\n (h₆ : (Nat.digits 10 n).toFinset ∪ (Nat.digits 10 m).toFinset = {0, 2, 3, 7, 8})\n (h₇ : n - m = 288) :\n n + m = 452 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_3466", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "ae310d3556124bcd7957e6ffe57c9cc61a610e9a19fd1a2a1912923a3b722725", "task_path": "tasks/rl_align__o_proofs_prove_3466__ae310d3556124bcd", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_3466", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_3489__e822f27ad01c1485", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {z : ℚ | ∃ x y : ℕ, z = x / y ∧ x > 0 ∧ y > 0 ∧ Nat.Coprime x y ∧ (x + 1) / (y + 1) = 11 / 10 * z} = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_3489", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "e822f27ad01c14852907b7f0c544e368a6cdc883cf90358d5c7aab1ae6828584", "task_path": "tasks/rl_align__o_proofs_prove_3489__e822f27ad01c1485", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_3489", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_3569__6424006909161077", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem prove (α : ℝ) :\n (∀ f : ℝ → ℝ, ContinuousOn f (Set.Icc 0 1) ∧ DifferentiableOn ℝ f (Set.Ioo 0 1) ∧ f 0 = 0 ∧ f 1 = 1 →\n ∃ ξ ∈ Set.Ioo 0 1, f ξ + α = deriv f ξ) ↔ α = 1 / (Real.exp 1 - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_3569", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "642400690916107700b908184f9a920fbfc7a86c425d8534876de86f42070dad", "task_path": "tasks/rl_align__o_proofs_prove_3569__6424006909161077", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_3569", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_3754__ccf8a8c1e17bcb0f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\ntheorem prove (a : ℕ → ℝ) (ha : ∀ n, a n = -n ^ 2 + 12 * n - 32)\n (S : ℕ → ℝ) (hS : ∀ n, S n = ∑ i ∈ Icc 1 n, a i) :\n IsGreatest {x | ∃ m n : ℕ, m > 0 ∧ n > 0 ∧ m < n ∧ x = S n - S m} 10 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_3754", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "ccf8a8c1e17bcb0f58e4f5f34d0cf3cc179b85d08a46ac28aa46588eb55ea09e", "task_path": "tasks/rl_align__o_proofs_prove_3754__ccf8a8c1e17bcb0f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_3754", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_3761__85b94f8d36b09d18", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {s : Finset ℕ | ∃ a b c : ℕ, s = {a, b, c} ∧ a.Prime ∧ b.Prime ∧ c.Prime ∧ a + b + c = 34} = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_3761", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "85b94f8d36b09d184237c91e95822da582ab3c2542c595e55893ac67250d4ccf", "task_path": "tasks/rl_align__o_proofs_prove_3761__85b94f8d36b09d18", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_3761", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_3833__daec46f7020054fe", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem prove (f : ℝ → ℝ × ℝ)\n (hf : f = λ t => (exp (-t) * cos t, exp (-t) * sin t)) :\n let L := ∫ t in (0)..(π/2), Real.sqrt ((deriv f t).1^2 + (deriv f t).2^2)\n let S := ∫ t in (0)..(π/2), (1/2) * (exp (-t) * cos t)^2 + (1/2) * (exp (-t) * sin t)^2\n L = Real.sqrt 2 * (1 - exp (-π/2)) ∧ S = (1/4) * (1 - exp (-π)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_3833", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "daec46f7020054fe13b84a9195f471e5498cfb6270d823aaadc0006cd7391c30", "task_path": "tasks/rl_align__o_proofs_prove_3833__daec46f7020054fe", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_3833", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_400__9d5eaae54f0e00cc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem prove :\n ∫ y in (0)..3, max (4 - (y - 1)^2 - (y^2 - 4 * y + 3)) 0 = 9 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_400", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "9d5eaae54f0e00ccd071574b4f517a3ba690f4655befb95d76e5d9ee8c21c431", "task_path": "tasks/rl_align__o_proofs_prove_400__9d5eaae54f0e00cc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_400", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4046__bb4e7c7f15200dd8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem prove {i j : ℕ} (hij : j ≤ i) :\n (∑ k ∈ Icc j i, (-1 : ℤ)^k * Nat.choose i k * Nat.choose k j) =\n if i = j then (-1 : ℤ)^i else 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4046", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "bb4e7c7f15200dd898b7eebfaa7d0fa55895ad9c410d89370aa0c8af51fc14ab", "task_path": "tasks/rl_align__o_proofs_prove_4046__bb4e7c7f15200dd8", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4046", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_439__fd94ba58623babc2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (n : ℕ) (x : Fin n → ℝ)\n (h₁ : ∀ i, -1 ≤ x i) (h₂ : ∑ i, (x i)^3 = 0) :\n n / 3 ≥ ∑ i, x i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_439", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "fd94ba58623babc2968703ce7ce8f344a4f52eaf529cfff4496605ad9190b2af", "task_path": "tasks/rl_align__o_proofs_prove_439__fd94ba58623babc2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_439", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4402__925e49cbdaa8cf38", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem prove {n : ℕ} (hn : 0 < n) (C : ℕ → ℝ)\n (hC : ∀ r ∈ Icc 0 n, C r = Nat.choose n r) :\n ∑ i ∈ Icc 1 n, i * C i = n * 2 ^ (n - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_4402", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "925e49cbdaa8cf387a371c22c49f39ea13c74aca7b5b2dab89cf370eef468b66", "task_path": "tasks/rl_align__o_proofs_prove_4402__925e49cbdaa8cf38", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_4402", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4423__16582782d086bc4a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {a : Fin 4 → Fin 4 → ℕ | (∀ i j, a i j = 0 ∨ a i j = 1) ∧\n (∀ i, Even (∑ j : Fin 4, a i j)) ∧ (∀ j, Even (∑ i : Fin 4, a i j)) ∧\n Even (∑ i : Fin 4, a i i) ∧ Even (∑ i : Fin 4, a i (3 - i))} = 256 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_4423", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "16582782d086bc4aedd97ed72287af24022aec50e849dfad83549b93a14c7b8c", "task_path": "tasks/rl_align__o_proofs_prove_4423__16582782d086bc4a", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_4423", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4433__2b8b5b7410f90a3e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove : Set.ncard {z : ℕ | ∃ x y : ℕ, x ∈ Finset.Icc 100 999 ∧ y ∈ Finset.Icc 100 999 ∧ z = |(x : ℤ) - y| ∧ y = 100 * (x % 10) + 10 * ((x / 10) % 10) + (x / 100)} = 9 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4433", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "2b8b5b7410f90a3efde019ec87b161e7c12ccd1da5b59539519f9c2e42031bc8", "task_path": "tasks/rl_align__o_proofs_prove_4433__2b8b5b7410f90a3e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4433", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4514__46b13d14bc3c2e74", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {n : ℤ | 50 ≤ n ∧ n ≤ 59 ∧ ∃ a b c, a > 0 ∧ b > 0 ∧ c > 0 ∧ a^2 + b^2 = c^2 ∧ c = n} = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4514", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "46b13d14bc3c2e7478c0f29648b9b4a6be9e15c7dc8f673926dda37517b97820", "task_path": "tasks/rl_align__o_proofs_prove_4514__46b13d14bc3c2e74", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4514", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4634__777b83aca8d58a4b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem prove (f : ℝ → ℝ)\n (h₀ : ∀ x ∈ Icc (-1) 1, f x = ∑' n : ℕ, x ^ n / (2 ^ n)) :\n sqrt (exp (∫ x in (0)..1, f x)) = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_4634", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "777b83aca8d58a4bdea6d5b1669713e211423d092bbed416613378f4a1f95b08", "task_path": "tasks/rl_align__o_proofs_prove_4634__777b83aca8d58a4b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_4634", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4645__6286a3ac98939f1d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem prove (X Y O M N : EuclideanSpace ℝ (Fin 2))\n (h₀ : dist X O > 0) (h₁ : dist Y O > 0)\n (h₂ : dist X O^2 + dist Y O^2 = dist X Y^2)\n (h₃ : M = midpoint ℝ O X)\n (h₄ : N = midpoint ℝ O Y)\n (h₅ : dist X N = 19) (h₆ : dist Y M = 22) :\n dist X Y = 26 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4645", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "6286a3ac98939f1d3efcb74da0ff4439c06c09c1a1ba8abb3cc56ee3a0cf4378", "task_path": "tasks/rl_align__o_proofs_prove_4645__6286a3ac98939f1d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4645", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4669__5bb0992c7159b96b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {a : Fin 6 → ℕ | a.Injective ∧ ∀ i, a i ∈ Finset.Icc 1 6 ∧ a 0 ≠ 1 ∧ a 2 ≠ 3 ∧ a 4 ≠ 5 ∧ a 0 < a 2 ∧ a 2 < a 4} = 30 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4669", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "5bb0992c7159b96b391fabdf56d6a282a3d784fc482dbf5441af04b6429a80e2", "task_path": "tasks/rl_align__o_proofs_prove_4669__5bb0992c7159b96b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4669", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4711__e407751302704664", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (n : ℕ) (h : n = 7) :\n Set.ncard {x : Fin 5 → ℕ | x 0 ≥ 2 ∧ x 1 ≥ 2 ∧ ∑ i : Fin 5, x i = n} = 35 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_4711", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "e407751302704664073668cef07e858ca22870c0c42dfcf3712023b4cd359cd2", "task_path": "tasks/rl_align__o_proofs_prove_4711__e407751302704664", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_4711", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4762__d5d1139bb5a1a04f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (S : Finset ℕ) (hS : S = Nat.divisors 100000) :\n Set.ncard {x | ∃ a b, a ∈ S ∧ b ∈ S ∧ a ≠ b ∧ x = a * b} = 117 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4762", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "d5d1139bb5a1a04fb28f8449f0ce3a6a67b1e4f60a4285a49d08060237ea16be", "task_path": "tasks/rl_align__o_proofs_prove_4762__d5d1139bb5a1a04f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4762", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4785__59b8c1ab6de30bf4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {x : Finset ℕ | x ⊆ {1, 2, 3, 4, 5, 6, 7, 8, 9} ∧ x.card = 3 ∧ ∑ i ∈ x, i = 15 ∧ 5 ∈ x} = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4785", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "59b8c1ab6de30bf4a9cc43fcb8c62d1a6cb77e8c648c084bd38993a80095e34a", "task_path": "tasks/rl_align__o_proofs_prove_4785__59b8c1ab6de30bf4", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4785", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_484__db404bf8845b16eb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (n : ℕ) (a : Fin n → ℤ) :\n (∑ i : Fin n, a i ≥ n ^ 2) ∧ (∑ i : Fin n, (a i) ^ 2 ≤ n ^ 3 + 1) ↔\n ∀ i : Fin n, a i = n := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_484", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "db404bf8845b16eb22e8f02a2e56b209320a6a1a81b28bf2fd7985b47403e7b8", "task_path": "tasks/rl_align__o_proofs_prove_484__db404bf8845b16eb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_484", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_486228__9f327b3c6b2341d4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\ntheorem prove_486228 {f : ℕ → ℕ}\n (hf : ∀ k, f k = ∑ i ∈ Icc 1 k, (10 ^ i - 1) / 9 * 7) :\n IsLeast {k | 0 < k ∧ f k ≡ 1 [MOD 1000]} 823 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_486228", "source_license": null, "theorem_names": ["prove_486228"], "statement_sha256": "9f327b3c6b2341d4f3eab6b88a47ce9e5b03be791871a09f6ce81ae029f5e47e", "task_path": "tasks/rl_align__o_proofs_prove_486228__9f327b3c6b2341d4", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_486228", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4886__0c0d6359bf755388", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (f : ℝ → ℝ) (h : ∀ x y, f (f x + y) = f (x ^ 2 - y) + 4 * f x * y)\n (n : ℕ) (hn : n = {z | ∃ f : ℝ → ℝ, (∀ x y, f (f x + y) = f (x ^ 2 - y) + 4 * f x * y) ∧ f 3 = z}.ncard)\n (s : ℝ) (hs : s = ∑ᶠ z ∈ {z | ∃ f : ℝ → ℝ, (∀ x y, f (f x + y) = f (x ^ 2 - y) + 4 * f x * y) ∧ f 3 = z}, z) :\n n * s = 18 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_4886", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "0c0d6359bf75538802b3533416a4b8178c29597853c7a0eb84272e841f591760", "task_path": "tasks/rl_align__o_proofs_prove_4886__0c0d6359bf755388", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_4886", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4906__6b5f044957bc526b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {x : Fin 3 → ℕ | x 0 ∈ Finset.Icc 1 30 ∧ x 1 ∈ Finset.Icc 1 30 ∧ x 2 ∈ Finset.Icc 1 30 ∧ Odd (x 0) ∧ Even (x 1) ∧ 3 ∣ (x 2)} = 2250 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4906", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "6b5f044957bc526b42a2f5a4f1ad749650f55e502bc13ba6eba2d29c52ae1e18", "task_path": "tasks/rl_align__o_proofs_prove_4906__6b5f044957bc526b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4906", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_4908__0f737c27c7d5f857", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem prove : ⌊∑ i ∈ range 2014, (1 / (Nat.factorial (i + 1) : ℝ))⌋ = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4908", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "0f737c27c7d5f857a2728839d18536551cc552de2dc84c730470c3e7ea8e5e24", "task_path": "tasks/rl_align__o_proofs_prove_4908__0f737c27c7d5f857", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_4908", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5032__b507bb99e105e09f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove : {x | x ∣ 18000 ∧ ∃ n, x = n^2}.encard = 12 ∧\n {1, 4, 16, 25, 9, 36, 225, 100, 400, 144, 900, 3600} ⊆ {x | x ∣ 18000 ∧ ∃ n, x = n^2} := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5032", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "b507bb99e105e09f75eeca9393144d62461a5305e8f0d2b3bad26b031ebf6aa7", "task_path": "tasks/rl_align__o_proofs_prove_5032__b507bb99e105e09f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5032", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5088__631687f5be3e0d5c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem prove {f : ℝ → ℝ}\n (hf : Monotone f)\n (hff : ∀ x, f (f x) = x + Real.sqrt 2)\n (hconv : ∃ L, Tendsto (λ n => f n - n) atTop (𝓝 L)) :\n ∀ x, f x = x + Real.sqrt 2 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5088", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "631687f5be3e0d5cd05c0ff25063066809a5d797fdda579c2662a043a6787d09", "task_path": "tasks/rl_align__o_proofs_prove_5088__631687f5be3e0d5c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5088", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5172__fd06b7e9621d61ce", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {n : ℕ | 3 ≤ n ∧ n ≤ 2021 ∧ ∃ k, n = 3 + 5 * k ∧ ∃ m, n = 2021 - 4 * m} = 101 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5172", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "fd06b7e9621d61ce38a8875308f35fe71c11b011d6e1d05d007404f52ed28a09", "task_path": "tasks/rl_align__o_proofs_prove_5172__fd06b7e9621d61ce", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5172", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5226__a19cfec1ed3aefe5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {x : Finset ℕ | ∃ a b, x = {a, b} ∧ a ∈ Finset.Icc 1 50 ∧ b ∈ Finset.Icc 1 50 ∧ a ≠ b ∧ |(a : ℤ) - b| = 11 ∧ 5 ∣ a * b} = 15 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5226", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "a19cfec1ed3aefe51f3e76dfa2a407b70c8818fbdd766bf8df0ca86df45e4a00", "task_path": "tasks/rl_align__o_proofs_prove_5226__a19cfec1ed3aefe5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5226", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5368__0a46af7354da739b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Complex Filter Function Metric Finset\nopen scoped BigOperators Topology\n\n\ntheorem prove {a : ℕ → ℂ}\n (ha : ∀ n, a n = ∏ i ∈ Icc 1 n, (1 + I / Real.sqrt i)) :\n IsLeast {m | ∑ n ∈ Icc 1 m, ‖a n - a (n + 1)‖ = 2005} 2005 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5368", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "0a46af7354da739be98b969fb1a5d7fcdf263b26503470cb3f36a3cbad42078c", "task_path": "tasks/rl_align__o_proofs_prove_5368__0a46af7354da739b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5368", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5452__d09bf28406dbcb49", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem prove (n : ℕ) (hn : 0 < n) (x : Fin n → ℝ)\n (hx : ∀ i, x i ∈ Icc 0 (π/2)) (h : ∏ i, cot (x i) = 1) :\n (∏ i, cos (x i)) ≤ 1 / 2^(n/2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5452", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "d09bf28406dbcb49634af8022c7a1353f42914d57beb7fc78d7694fbe05d4b14", "task_path": "tasks/rl_align__o_proofs_prove_5452__d09bf28406dbcb49", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5452", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5482__8c7cc8a9ab52153d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {p : Fin 6 → ℕ | (∀ i j, p i = p j → i = j) ∧\n (∀ i, p i ∈ Finset.Icc 1 6) ∧ (∀ i, Nat.Coprime (p i) (p ((i + 1) % 6)))} = 24 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5482", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "8c7cc8a9ab52153d607073acbf1148083281485b889fa294a3271597313484c8", "task_path": "tasks/rl_align__o_proofs_prove_5482__8c7cc8a9ab52153d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5482", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5509__1ab42871dfb15371", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem prove (n : ℕ) (hn : 0 < n) :\n (∫ x in (0)..π, cos x ^ (2 * n + 2)) / (∫ x in (0)..π, cos x ^ (2 * n)) =\n (2 * n + 1) / (2 * n + 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5509", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "1ab42871dfb153713d2e86b2bdb9dfc28a9f67d27a7e7f2cf6a48d908f122d8d", "task_path": "tasks/rl_align__o_proofs_prove_5509__1ab42871dfb15371", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5509", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5664__7f0e5f6ed6073efd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {a : Fin 3 → ℕ | ∑ i, a i = 200 ∧ ∀ i, 15 ≤ a i} = Nat.choose 157 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5664", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "7f0e5f6ed6073efdaf415a48eb3121b6329d291a9d58bc59c1661fda06864f67", "task_path": "tasks/rl_align__o_proofs_prove_5664__7f0e5f6ed6073efd", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5664", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5704__d1604d4a2ca714eb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (n : ℕ) :\n ∃ s1 s2 : Finset ℕ,\n s1 ∪ s2 = Finset.Icc 1 (4 * n) ∧\n s1 ∩ s2 = ∅ ∧\n s1.card = 2 * n ∧\n s2.card = 2 * n ∧\n ∑ x ∈ s1, x = ∑ x ∈ s2, x := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5704", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "d1604d4a2ca714ebb1f10c0a40515c68e10a6a335c1782d71163c186d67afed1", "task_path": "tasks/rl_align__o_proofs_prove_5704__d1604d4a2ca714eb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5704", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5756__d02f83868acb4b21", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem prove (w : ℝ → ℝ) (hw : w = λ x => x)\n (l : ℝ) :\n ∃ u v : ℝ → ℝ,\n Continuous u ∧ Continuous v ∧\n ∫ x in (0)..1, (2 * (u x)^2 + (v x)^2) =\n l + 2 * ∫ x in (0)..1, (u x * v x + u x * w x) ↔\n l ∈ Set.Ici (-1/4) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5756", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "d02f83868acb4b21c87ba35b7d22cc3a0df0aea6d3a33f6063c67128e6bf3c34", "task_path": "tasks/rl_align__o_proofs_prove_5756__d02f83868acb4b21", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5756", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5869__41a03c45232d4905", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem prove {a b : ℕ → ℤ}\n (ha1 : a 1 = 1)\n (han : ∀ n ≥ 2, a n = ∑ i ∈ Icc 1 (n - 1), i * a (n - i))\n (hb : ∀ n, b n = ∑ i ∈ Icc 1 n, a i) :\n ∑ n ∈ Icc 1 2021, b n = a 2022 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5869", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "41a03c45232d4905a36e95cc88dc82cc73b9fa28d77aae0c8345412c0fd7612b", "task_path": "tasks/rl_align__o_proofs_prove_5869__41a03c45232d4905", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5869", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5888__f4017fd16e98b448", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (m : ℕ) (hm : 0 < m) (T : ℕ) (hT : T = 2 ^ m) :\n {x | x ⊆ Finset.Icc 1 m ∧ (x.card = 2 ∨ x.card = 3)}.ncard =\n ((Real.logb 2 T) ^ 3 - Real.logb 2 T) / 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5888", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "f4017fd16e98b448631f92ff60dddc97479fc8a528d1116df4198dfd9bc1fc35", "task_path": "tasks/rl_align__o_proofs_prove_5888__f4017fd16e98b448", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5888", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5899__501f447045cb2450", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem prove (X Y M N : EuclideanSpace ℝ (Fin 2))\n (h₀ : dist X Y > 0) (h₁ : dist X Y = sqrt (dist X 0 ^ 2 + dist Y 0 ^ 2))\n (h₂ : M = midpoint ℝ X 0) (h₃ : N = midpoint ℝ Y 0)\n (h₄ : dist X N = 19) (h₅ : dist Y M = 22) :\n dist X Y = 26 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5899", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "501f447045cb2450885f7689c417724121f81a6700379584f69876be480be594", "task_path": "tasks/rl_align__o_proofs_prove_5899__501f447045cb2450", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_5899", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_5914__fd721414ea65260e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem prove {T P : ℕ → ℝ}\n (hT : ∀ n, T n = n * (n + 1) / 2)\n (hP : ∀ n, P n = ∏ k ∈ Icc 2 n, T k / (T k - 1)) :\n abs (P 1991 - 2.9) < 0.1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5914", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "fd721414ea65260e2b956e0ec5e3150345182ec0ee2d431e359c749091031893", "task_path": "tasks/rl_align__o_proofs_prove_5914__fd721414ea65260e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_5914", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_7642__b3f5e5922c66781e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove (p d q : ℕ) (hp : p = 3) (hd : d = 4) (hq : q = 5) :\n Set.ncard {x | ∃ n m p : ℕ, x = n*1 + m*10 + p*25 ∧ n+m+p = 3} = 10 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_7642", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "b3f5e5922c66781e8b14f306a108768178ed6d4d6c5ca071de855ab1ad0532d9", "task_path": "tasks/rl_align__o_proofs_prove_7642__b3f5e5922c66781e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_7642", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_7_2__3c53fe136a32bcbf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem prove_7 (a : ℝ) (ha : 0 < a ∧ a < 1)\n (f : ℝ → ℝ) (hf : ContinuousOn f (Set.Icc 0 1))\n (h₀ : f 0 = 0) (h₁ : f 1 = 1)\n (h₂ : ∀ x y, x ≤ y → f ((x + y) / 2) = (1 - a) * f x + a * f y) :\n f (1 / 7) = 1 / 7 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_7_2", "source_license": null, "theorem_names": ["prove_7"], "statement_sha256": "3c53fe136a32bcbff8e77c7201285951240ddb24e8117606122fc6d4fa44a5e5", "task_path": "tasks/rl_align__o_proofs_prove_7_2__3c53fe136a32bcbf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_7_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_8511__b9dd79b617ead9b9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove :\n Set.ncard {n : ℕ | n ∈ Finset.Icc 2000 2010 ∧ 7 ∣ (2^(2*n) + 2^n + 5)} = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_8511", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "b9dd79b617ead9b910747e733f66e4ad9dc2c6732e951e7f1c9d63ca83a087be", "task_path": "tasks/rl_align__o_proofs_prove_8511__b9dd79b617ead9b9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_8511", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_868__c79cb6b37650cecd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem prove {n : ℕ} (hn : 0 < n) (a : ℕ → ℝ)\n (ha1 : a 1 = 1 / (n * (n + 1)))\n (hak : ∀ k ≥ 1, a (k + 1) = -1 / (k + n + 1) + (n / k) * ∑ i ∈ Icc 1 k, a i) :\n ∀ k ≥ 1, a k = 1 / ((n + k) * (n + k - 1)) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_868", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "c79cb6b37650cecdab2d0d337df49a6a99e201482464efe6b64c3c488e1ee445", "task_path": "tasks/rl_align__o_proofs_prove_868__c79cb6b37650cecd", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_868", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_935__f613ceca9664cb6d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem prove (n : ℕ) (hn : 0 < n) (x : ℕ → ℝ)\n (hx : ∀ i ∈ Icc 1 n, 0 < x i) (hxn : x (n + 1) = x 1) :\n ∑ k ∈ Icc 1 n, (x k)^3 / ((x k)^2 + x k * x (k + 1) + (x (k + 1))^2) ≥\n (1 / 3) * ∑ k ∈ Icc 1 n, x k := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_935", "source_license": null, "theorem_names": ["prove"], "statement_sha256": "f613ceca9664cb6dcbeea8a16823003c07808fc6d826f107cff052bdec69e33f", "task_path": "tasks/rl_align__o_proofs_prove_935__f613ceca9664cb6d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_935", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_diff_sum__2870ab383e97650f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove_diff_sum :\n ∃ s1 s2 : Finset ℕ,\n s1 ⊆ Finset.range 10 ∧\n s2 ⊆ Finset.range 10 ∧\n s1 ≠ s2 ∧\n s1.card = 6 ∧\n s2.card = 6 ∧\n ∑ i ∈ s1, i = ∑ i ∈ s2, i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_diff_sum", "source_license": null, "theorem_names": ["prove_diff_sum"], "statement_sha256": "2870ab383e97650fb083b72671c50e0e41af2098fbff2fc16478ddcfbd056855", "task_path": "tasks/rl_align__o_proofs_prove_diff_sum__2870ab383e97650f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_diff_sum", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_diverge_5__8e1eb3163d1443da", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem prove_diverge (a : ℕ → ℝ)\n (ha : ∀ n, a n = (n * 7^(2*n) + 2^(2*n / 3) + (-1)^n) / 2^(4*n)) :\n ¬ Summable a := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_diverge_5", "source_license": null, "theorem_names": ["prove_diverge"], "statement_sha256": "8e1eb3163d1443dab702e3181e6f5b60ff974ad8416083794b16cd0086b53722", "task_path": "tasks/rl_align__o_proofs_prove_diverge_5__8e1eb3163d1443da", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_diverge_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_divergence_4__7fe97cb093207d98", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem prove_divergence (a : ℕ → ℝ)\n (h₀ : a 1 = sin 1)\n (h₁ : ∀ n ≥ 1, Odd n → a (n + 1) = cos (a n))\n (h₂ : ∀ n ≥ 1, Even n → a (n + 1) = sin (a n)) :\n ¬ ∃ L, Tendsto a atTop (𝓝 L) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_divergence_4", "source_license": null, "theorem_names": ["prove_divergence"], "statement_sha256": "7fe97cb093207d98a594943fc095af79dab13947400d5be4165eb94b3fd5fff8", "task_path": "tasks/rl_align__o_proofs_prove_divergence_4__7fe97cb093207d98", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_divergence_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_f1__128063f9931606a1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem prove_f1\n {f : ℝ → ℝ}\n (hf0 : ∀ x, f x = exp x * sqrt ((2 / (exp 2 - 1)))) :\n DifferentiableOn ℝ f (Icc 0 1) ∧ (∫ x in Icc 0 1, (deriv f x)^2 = 1) ∧ (∫ x in Icc 0 1, (f x)^2 = 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_f1", "source_license": null, "theorem_names": ["prove_f1"], "statement_sha256": "128063f9931606a127c9fd8405ffb67b1d4f6ab2eb49ecfad5b735be13d0e69d", "task_path": "tasks/rl_align__o_proofs_prove_f1__128063f9931606a1", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_f1", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_f_52__6aced513c5baea98", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove_f (f : ℝ → ℝ) (m : ℝ) (hm : m ∈ Set.Ioo 0 (5 / 6))\n (hf : ∀ x ∈ Set.Icc 0 2, f x = (1 / 3) * x ^ 3 + m * x ^ 2 - 2 * x - 2 * m - (1 / 3))\n (h : ∫ x in (0)..2, |f x| = 4) : m = 1 / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_f_52", "source_license": null, "theorem_names": ["prove_f"], "statement_sha256": "6aced513c5baea98e8267400f1be3fbe5157c125fdde807e29acef9312cd9874", "task_path": "tasks/rl_align__o_proofs_prove_f_52__6aced513c5baea98", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_f_52", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_factorization_15__598654e7f7d69e9b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove_factorization {C : ℕ} (hC : ∀ n > 0, ∃ k, C * (Finset.sum (Finset.Icc 1 n) id) + 1 = k * (k + 1) / 2)\n (hC1 : IsLeast {x | 0 < x ∧ (∀ n > 0, ∃ k, x * (Finset.sum (Finset.Icc 1 n) id) + 1 = k * (k + 1) / 2)} C) :\n C.divisors.card = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_factorization_15", "source_license": null, "theorem_names": ["prove_factorization"], "statement_sha256": "598654e7f7d69e9b4536fe56c893fe1dd0727b982d5eca149d13a0cfb2b272f7", "task_path": "tasks/rl_align__o_proofs_prove_factorization_15__598654e7f7d69e9b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_factorization_15", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_fpos__f3b1f69737286066", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem prove_fpos {f : ℝ → ℝ}\n (hf : Differentiable ℝ f)\n (h : ∀ x, f x ≥ deriv f x)\n (l : ℝ)\n (hl : Tendsto f atTop (𝓝 l))\n (hl1 : l > 0) :\n ∀ x, f x > 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_fpos", "source_license": null, "theorem_names": ["prove_fpos"], "statement_sha256": "f3b1f697372860667becc7a2067a38ea1a1aaaf545dcab7e4ea2ee395d12eeb1", "task_path": "tasks/rl_align__o_proofs_prove_fpos__f3b1f69737286066", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_fpos", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_inequality_21__298aebe2bb2de2cf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem prove_inequality {a b c : ℝ} (ha : a ≠ 0) (h0 : 0 = a*0^2+b*0+c)\n (hπ : 0 = a*π^2+b*π+c) (f : ℝ → ℝ) (hf : f = λ x => a*x^2 + b*x + c)\n (h : ∫ x in (0)..π, (f x)^2 ≤ ∫ x in (0)..π, (deriv f x)^2) :\n π^2 ≤ 10 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_inequality_21", "source_license": null, "theorem_names": ["prove_inequality"], "statement_sha256": "298aebe2bb2de2cfe2a8c7d8dfc2c4501145cdff0259bbc30cd7e176417a5454", "task_path": "tasks/rl_align__o_proofs_prove_inequality_21__298aebe2bb2de2cf", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_inequality_21", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_infinite_37__800c6a8988a58667", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem prove_infinite\n {f : ℝ → ℝ}\n (hf : Differentiable ℝ f)\n (h0 : f 0 = 0)\n (h' : ∀ x, (1 + x ^ 2) * deriv f x ≥ 1 + (f x) ^ 2) :\n Tendsto f atTop atTop := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_infinite_37", "source_license": null, "theorem_names": ["prove_infinite"], "statement_sha256": "800c6a8988a58667832a88a596225ace730448f9f7f9961ca1a0f15c29ee12e6", "task_path": "tasks/rl_align__o_proofs_prove_infinite_37__800c6a8988a58667", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_infinite_37", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_length_3__12e8676c93a4b741", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem prove_length (A B : EuclideanSpace ℝ (Fin 2))\n (h₀ : dist A B = 2) (M : ℕ → EuclideanSpace ℝ (Fin 2))\n (h₁ : M 1 = midpoint ℝ A B) (h₂ : ∀ k ≥ 2, M k = midpoint ℝ A (M (k - 1))) :\n dist (M 2015) (M 2016) = 1 / 2 ^ 2015 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_length_3", "source_license": null, "theorem_names": ["prove_length"], "statement_sha256": "12e8676c93a4b741a051cfc0b8e451ae820e9b9b09cd43707cb27c22d5e60b8a", "task_path": "tasks/rl_align__o_proofs_prove_length_3__12e8676c93a4b741", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_length_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_math__3dc60f278cb4a65b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem prove_math (n : ℕ) (hn : 0 < n) (a : Fin n → ℕ) :\n ∏ i, (a i : ℝ) ^ ((a i : ℝ) / (∑ j, a j)) ≥\n (1 : ℝ) / n * ∑ i, a i := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_math", "source_license": null, "theorem_names": ["prove_math"], "statement_sha256": "3dc60f278cb4a65b76873f3f0a10ef4e8e391cfb4adf66ffb9b26f6d4522b341", "task_path": "tasks/rl_align__o_proofs_prove_math__3dc60f278cb4a65b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_prove_math", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_second_diff__eb3b6574fc15db5b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove_second_diff (f : ℝ → ℝ) (hf : DifferentiableOn ℝ f (Set.Icc 0 2))\n (hfn : DifferentiableOn ℝ (deriv f) (Set.Icc 0 2)) (h0 : f 0 = 0) (h2 : f 2 = 0) :\n ∃ x ∈ Set.Ioo 0 2, |(deriv (deriv f) x)| ≥ |f 1| := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_second_diff", "source_license": null, "theorem_names": ["prove_second_diff"], "statement_sha256": "eb3b6574fc15db5b62d18c8a1b268f8ede67e97eee40f3befa15a63a983f8b21", "task_path": "tasks/rl_align__o_proofs_prove_second_diff__eb3b6574fc15db5b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_second_diff", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_prove_sing__4dffa34d6a28581d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem prove_sing (a : Fin 12 → ℕ) (ha : ∀ s : Finset (Fin 12), s.card = 10 → ∑ i ∈ s, a i = 20)\n (hb : ∀ s : Finset (Fin 12), s.card = 8 → ∑ i ∈ s, a i = 16) :\n ∑ i : Fin 12, a i = 24 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_sing", "source_license": null, "theorem_names": ["prove_sing"], "statement_sha256": "4dffa34d6a28581d5f6763ce16c9946c89742826b39627a5cd22ca00286563ab", "task_path": "tasks/rl_align__o_proofs_prove_sing__4dffa34d6a28581d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_prove_sing", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_publish_optimistic_sequence__71e528e5f9ee9b1a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem publish_optimistic_sequence (n : ℕ) (hn : 0 < n) (a : ℕ → ℕ)\n (ha : ∀ i ∈ Icc 1 n, 0 < a i) (h : ∑ i ∈ Icc 1 n, (1 / a i : ℚ) ≤ 1 / 2) :\n ∀ N, ∃ m > N, {i | i ∈ Icc 1 n ∧ (m % a i) > (m - 1) % a i}.ncard ≥ n - 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_publish_optimistic_sequence", "source_license": null, "theorem_names": ["publish_optimistic_sequence"], "statement_sha256": "71e528e5f9ee9b1a4a1efc9c7ee0396b7d4fac4265c7074fb3452daa1f893eb1", "task_path": "tasks/rl_align__o_proofs_publish_optimistic_sequence__71e528e5f9ee9b1a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_publish_optimistic_sequence", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_q_3758__e2e97dbbc1bc7f43", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem q:\n ∃ A B: Finset ℕ, (A ∩ B = ∅ ∧ A ∪ B = Finset.Icc 1 2016 ∧ ∏ x ∈ A, x = ∑ x ∈ B, x) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_q_3758", "source_license": null, "theorem_names": ["q"], "statement_sha256": "e2e97dbbc1bc7f433ff0be331922db4a04d8e0b4b53f1dd229857e98f6bd71c9", "task_path": "tasks/rl_align__o_proofs_q_3758__e2e97dbbc1bc7f43", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_q_3758", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_q_626__9e1170bdc04b9bcc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem q (n : ℕ) (x : Fin n → ℕ)\n (h₁ : ∀ i, x i = 2 ∨ x i = 3 ∨ x i = 6)\n (h₂ : ∑ i, x i = 633)\n (h₃ : ∑ i, (1 / (x i ^ 2 : ℚ)) = 2017 / 36) :\n n = 262 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_q_626", "source_license": null, "theorem_names": ["q"], "statement_sha256": "9e1170bdc04b9bcc4c373791f4df2cc52887f9eb2906bac71145c27da7f06ea2", "task_path": "tasks/rl_align__o_proofs_q_626__9e1170bdc04b9bcc", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_q_626", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_q_836__90778beb6437226d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem q (b : ℝ) (z₁ z₂ : ℂ) (h₁ : z₁ ≠ z₂)\n (h₂ : 3 * z₁ ^ 2 + 3 * z₁ + b = 0) (h₃ : 3 * z₂ ^ 2 + 3 * z₂ + b = 0)\n (h₄ : ∃ A B C, A = z₁ ∧ B = z₂ ∧ C = 0 ∧ dist A B = dist A C ∧ dist B C = dist A C) :\n b = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_q_836", "source_license": null, "theorem_names": ["q"], "statement_sha256": "90778beb6437226df23d911836716558bcf815cee0f855575428d0e41ebdc5df", "task_path": "tasks/rl_align__o_proofs_q_836__90778beb6437226d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_q_836", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_quadratic_bound_4__fb37aa36f77c5599", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem quadratic_bound (p : Polynomial ℝ) (hp : p.degree ≤ 2) (h₀ : abs (p.eval (-1)) ≤ 1) (h₁ : abs (p.eval 0) ≤ 1) (h₂ : abs (p.eval 1) ≤ 1) : ∀ x ∈ Set.Icc (-1 : ℝ) 1, abs (p.eval x) ≤ 5 / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_quadratic_bound_4", "source_license": null, "theorem_names": ["quadratic_bound"], "statement_sha256": "fb37aa36f77c55990aec679b89cbad06016922f9b14b50777964039ab45d1bd1", "task_path": "tasks/rl_align__o_proofs_quadratic_bound_4__fb37aa36f77c5599", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_quadratic_bound_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_quadratic_f_042829__a1c092e21c026dc0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem quadratic_f_042829 (a b c : ℝ) (ha : a ≠ 0)\n (h1 : ∫ x in Set.Icc 0 4, a * x ^ 2 + b * x + c = 1)\n (h2 : ∫ x in Set.Icc 0 4, x * (a * x ^ 2 + b * x + c) = 2)\n (h3 : ∫ x in Set.Icc 0 4, x ^ 2 * (a * x ^ 2 + b * x + c) = 3) :\n ∃ x, x ∈ Set.Icc 0 4 ∧ a * x ^ 2 + b * x + c = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_quadratic_f_042829", "source_license": null, "theorem_names": ["quadratic_f_042829"], "statement_sha256": "a1c092e21c026dc04a35a8dfe66f6dec8d2ca52c6a057e226464e241ee374d9d", "task_path": "tasks/rl_align__o_proofs_quadratic_f_042829__a1c092e21c026dc0", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_quadratic_f_042829", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_quadratic_polynomial_49__50bcb8d2061ed7ad", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem quadratic_polynomial (p : Polynomial ℤ) (hp : p.degree = 2)\n (h₁ : p.eval 41 = 42) (h₂ : ∃ a b : ℤ, a > 41 ∧ b > 41 ∧ p.eval a = 13 ∧ p.eval b = 73) :\n p.eval 1 = 2842 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_quadratic_polynomial_49", "source_license": null, "theorem_names": ["quadratic_polynomial"], "statement_sha256": "50bcb8d2061ed7ad2c4446ae560c856b519911c311e718868d339d15fabd3147", "task_path": "tasks/rl_align__o_proofs_quadratic_polynomial_49__50bcb8d2061ed7ad", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_quadratic_polynomial_49", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_quadrilateral_6__08afa2cc91001ba2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem quadrilateral {A B C D M N : EuclideanSpace ℝ (Fin 2)}\n (hM : M = midpoint ℝ A B)\n (hN : N = midpoint ℝ C D)\n (h1 : dist A N = dist M D)\n (h2 : dist C M = dist B N) :\n dist A C = dist B D := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_quadrilateral_6", "source_license": null, "theorem_names": ["quadrilateral"], "statement_sha256": "08afa2cc91001ba291e769b8e994b0b62bdcc86671728ebd01e5c5d674c97b41", "task_path": "tasks/rl_align__o_proofs_quadrilateral_6__08afa2cc91001ba2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_quadrilateral_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_qwen_1217__1a7391aa598496e9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem qwen (F : Finset (Finset ℕ)) (hF : ∀ s ∈ F, s.card = 10)\n (hF' : ∀ T ⊆ F, T.card = 2004 → ∃ x, {s | x ∈ s ∧ s ∈ T}.ncard ≥ 11) :\n ∃ S, S.card = 2003 ∧ ∀ A ∈ F, S ∩ A = ∅ := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_qwen_1217", "source_license": null, "theorem_names": ["qwen"], "statement_sha256": "1a7391aa598496e93ec92cc2e3c118313ff01519d24e2541179272b99dc77f8c", "task_path": "tasks/rl_align__o_proofs_qwen_1217__1a7391aa598496e9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_qwen_1217", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_qwen_1736__1221e5f111b3fb02", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem qwen {f : ℝ → ℝ} (hf : ContDiffOn ℝ 1 f (Set.Ici 0))\n (hfn : DifferentiableOn ℝ (deriv f) (Set.Ici 0)) (h : ∀ x ≥ 0, deriv f x - 2 * x * f x ≥ 0) :\n ∀ x ≥ 0, f x ≥ f 0 * Real.exp (x ^ 2) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_qwen_1736", "source_license": null, "theorem_names": ["qwen"], "statement_sha256": "1221e5f111b3fb025c3350a17cbe08dab1e96cc041794101e4620e26ddf50e8a", "task_path": "tasks/rl_align__o_proofs_qwen_1736__1221e5f111b3fb02", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_qwen_1736", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_qwen_1782__9a4d85363ba111f7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem qwen {n : ℕ} (hn : 0 < n) (a : ℕ → ℝ)\n (ha : ∀ i ∈ Icc 1 n, 0 < a i)\n (h : ∀ k ∈ Icc 1 n, ∏ i ∈ Icc 1 k, a i ≥ k !) :\n ∑ i ∈ Icc 1 n, ((i + 1) ! / ∏ j ∈ Icc 1 i, (j + a j)) < 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_qwen_1782", "source_license": null, "theorem_names": ["qwen"], "statement_sha256": "9a4d85363ba111f766ef689c7d8300d42ca158e96327048337d9400da528f250", "task_path": "tasks/rl_align__o_proofs_qwen_1782__9a4d85363ba111f7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_qwen_1782", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_qwen_2156__dd7cc5820f74586e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem qwen {n : ℕ} (hn : 0 < n) (x : Fin n → ℝ)\n (hx : ∀ i, 0 < x i) (h : ∑ i, x i = ∑ i, (x i) ^ ((2 : ℝ) / x i)) :\n ∏ i, (x i) ^ (x i) ≥ ∏ i, (x i) ^ 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_qwen_2156", "source_license": null, "theorem_names": ["qwen"], "statement_sha256": "dd7cc5820f74586eacd64dc1ab07e29a515984abb808615f8237b5327f86db53", "task_path": "tasks/rl_align__o_proofs_qwen_2156__dd7cc5820f74586e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_qwen_2156", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_qwen_2243__497d9bbbfa0bba66", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem qwen (f : Polynomial ℤ) (h : f.eval 19 * f.eval 88 = 277) (k : ℤ) :\n f.eval k ≠ 2010 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_qwen_2243", "source_license": null, "theorem_names": ["qwen"], "statement_sha256": "497d9bbbfa0bba6682ff2c89dabdd7109a495c1b876761b4acad2c99f5023e58", "task_path": "tasks/rl_align__o_proofs_qwen_2243__497d9bbbfa0bba66", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_qwen_2243", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_qwen_316__25d96b98c59b5424", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem qwen (n : ℕ) (hn : 0 < n) (a : Fin n → ℝ)\n (ha : ∀ i, a i ∈ Set.Icc 0 1) (S : ℝ) (hS : S = ∑ i, a i ^ 3) :\n ∑ i, a i / (2 * n + 1 + S - a i ^ 3) ≤ 1 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_qwen_316", "source_license": null, "theorem_names": ["qwen"], "statement_sha256": "25d96b98c59b54245b43832dcc564185149052c32e0caffbc9d7083503ea4e92", "task_path": "tasks/rl_align__o_proofs_qwen_316__25d96b98c59b5424", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_qwen_316", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_qwen_605__5bb1d33975207f06", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem qwen {n : ℕ} (hn : 0 < n) (x : Fin n → ℝ)\n (h₀ : ∑ i : Fin n, x i = 0) (h₁ : ∑ i : Fin n, (x i)^2 = 1) :\n ∃ i j : Fin n, i ≠ j ∧ x i * x j ≤ -1 / n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_qwen_605", "source_license": null, "theorem_names": ["qwen"], "statement_sha256": "5bb1d33975207f06e169156746175591ea3bcc8aae9e7ede5f3085109af2a583", "task_path": "tasks/rl_align__o_proofs_qwen_605__5bb1d33975207f06", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_qwen_605", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_rank_of_ABD__64c9d7b0b44e0d0c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Matrix Finset\n\n\ntheorem rank_of_ABD {m n p q : ℕ} (hm : 0 < m) (hn : 0 < n) (hp : 0 < p)\n (hq : 0 < q) (A : Matrix (Fin m) (Fin n) ℝ) (B : Matrix (Fin n) (Fin p) ℝ)\n (D : Matrix (Fin p) (Fin q) ℝ) :\n rank (A * B * D) ≤ min (min (rank A) (rank B)) (rank D) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_rank_of_ABD", "source_license": null, "theorem_names": ["rank_of_ABD"], "statement_sha256": "64c9d7b0b44e0d0c9f64b17b4e71ed01e40f76d2e05f75db19567c5370b77b7e", "task_path": "tasks/rl_align__o_proofs_rank_of_ABD__64c9d7b0b44e0d0c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_rank_of_ABD", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_rate_of_change_equivalence__35a25ff6acc39a72", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem rate_of_change_equivalence : ∃ c : ℝ, c ∈ Set.Ioo 1 4 ∧ deriv (fun x => x + Real.log x) c = (4 + Real.log 4 - (1 + Real.log 1)) / (4 - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_rate_of_change_equivalence", "source_license": null, "theorem_names": ["rate_of_change_equivalence"], "statement_sha256": "35a25ff6acc39a72cecda2211d32da52e38412ba5e0741a5cc2b0d6bd7037227", "task_path": "tasks/rl_align__o_proofs_rate_of_change_equivalence__35a25ff6acc39a72", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_rate_of_change_equivalence", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_right_angled__b06af7c950021db1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Complex Filter Function Metric Finset\nopen scoped BigOperators Topology\n\n\ntheorem right_angled (a b c : ℂ) (h₀ : a ≠ b) (h₁ : a ≠ c) (h₂ : b ≠ c)\n (h₃ : ¬Collinear ℝ {a, b, c}) (h₄ : ‖a + 20172016 * b - 20172017 * c‖ =\n ‖a - 20172018 * b + 20172017 * c‖) :\n (dist a b)^2 + (dist a c)^2 = (dist b c)^2 ∨ (dist a b)^2 + (dist b c)^2 = (dist a c)^2 ∨\n (dist a c)^2 + (dist b c)^2 = (dist a b)^2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_right_angled", "source_license": null, "theorem_names": ["right_angled"], "statement_sha256": "b06af7c950021db174c4fc28cc9d6dbffac795aecbefe62f1ef8f3896125a7cd", "task_path": "tasks/rl_align__o_proofs_right_angled__b06af7c950021db1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_right_angled", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_right_angled_isoc_triangle__45a40e658cb1161f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem right_angled_isoc_triangle\n (A B C : EuclideanSpace ℝ (Fin 3))\n (h₀ : A = !₂[0, 7, 10])\n (h₁ : B = !₂[1, 6, 6])\n (h₂ : C = !₂[4, 9, 6]) :\n dist A B^2 + dist B C^2 = dist A C^2 ∧\n dist A B = dist B C ∨ dist A B = dist A C := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_right_angled_isoc_triangle", "source_license": null, "theorem_names": ["right_angled_isoc_triangle"], "statement_sha256": "c65dc8c8c6dd2f8a2299b5f994a89b2a4bcba4e810ad5ae727c94d1898a305a7", "task_path": "tasks/rl_align__o_proofs_right_angled_isoc_triangle__45a40e658cb1161f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_right_angled_isoc_triangle", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_seq_convergence_2__6a300096948ec422", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem seq_convergence {X : Type*} [MetricSpace X] (y : ℕ → X)\n (L : X) (h₁ : Tendsto (λ n => y (2 * n)) atTop (𝓝 L))\n (h₂ : Tendsto (λ n => y (2 * n + 1)) atTop (𝓝 L)) :\n Tendsto y atTop (𝓝 L) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_seq_convergence_2", "source_license": null, "theorem_names": ["seq_convergence"], "statement_sha256": "6a300096948ec42226d4abffb3969681f8eafdd0217803ce47ade53d6e8b7ccd", "task_path": "tasks/rl_align__o_proofs_seq_convergence_2__6a300096948ec422", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_seq_convergence_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_shortest_distance_to_parabola__23e820554170d88f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem shortest_distance_to_parabola : ∃! d : ℝ, d > 0 ∧ ∀ x : ℝ, dist (0, 5) (x, (x^2) / 16) ≥ d ∧ ∃ x₀ : ℝ, dist (0, 5) (x₀, (x₀^2) / 16) = d := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_shortest_distance_to_parabola", "source_license": null, "theorem_names": ["shortest_distance_to_parabola"], "statement_sha256": "23e820554170d88f08518bc9d6a8022220403997639b6c4aad062928e6ddd509", "task_path": "tasks/rl_align__o_proofs_shortest_distance_to_parabola__23e820554170d88f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_shortest_distance_to_parabola", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_shortest_path_with_common_point__ccd4864c10f20cf6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem shortest_path_with_common_point (a b : ℝ) (h₁ : a > 0) (h₂ : b > 0) (M : ℝ × ℝ) (h₃ : M.1 = 0 ∧ M.2 ∈ Set.Icc 0 b ∨ M.1 = a ∧ M.2 ∈ Set.Icc 0 b ∨ M.1 ∈ Set.Icc 0 a ∧ M.2 = 0 ∨ M.1 ∈ Set.Icc 0 a ∧ M.2 = b) :\n ∃ (P Q R S : ℝ × ℝ), P.1 = 0 ∧ P.2 ∈ Set.Icc 0 b ∧ Q.1 = a ∧ Q.2 ∈ Set.Icc 0 b ∧ R.1 ∈ Set.Icc 0 a ∧ R.2 = 0 ∧ S.1 ∈ Set.Icc 0 a ∧ S.2 = b ∧\n (dist M P + dist P Q + dist Q R + dist R S + dist S M) ≤\n (dist M (0, 0) + dist (0, 0) (a, 0) + dist (a, 0) (a, b) + dist (a, b) (0, b) + dist (0, b) M) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_shortest_path_with_common_point", "source_license": null, "theorem_names": ["shortest_path_with_common_point"], "statement_sha256": "ccd4864c10f20cf6527c321ba90c1a02dffd1d99c3ca3a39c8d7f118d216bba8", "task_path": "tasks/rl_align__o_proofs_shortest_path_with_common_point__ccd4864c10f20cf6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_shortest_path_with_common_point", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sign_change_nonnegative_row_col_sums__d957ef5d07407879", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem sign_change_nonnegative_row_col_sums (m n : ℕ) (A : Matrix (Fin m) (Fin n) ℝ) :\n ∃ (op_row : Fin m → Bool) (op_col : Fin n → Bool),\n (∀ i : Fin m, (∑ j : Fin n, if op_row i then -A i j else A i j) ≥ 0) ∧\n (∀ j : Fin n, (∑ i : Fin m, if op_col j then -A i j else A i j) ≥ 0) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sign_change_nonnegative_row_col_sums", "source_license": null, "theorem_names": ["sign_change_nonnegative_row_col_sums"], "statement_sha256": "d957ef5d07407879198a4d4a0877ef4c187b332129c9551728b6fc989ca377c0", "task_path": "tasks/rl_align__o_proofs_sign_change_nonnegative_row_col_sums__d957ef5d07407879", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sign_change_nonnegative_row_col_sums", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sin_area_with_binomial_coef__b2f2110ece4ae895", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem sin_area_with_binomial_coef {a : ℝ}\n (h_coef : (-(1/a^3) * (choose 9 3)) = -(21/2)) :\n 2 * ∫ x in (0)..(2), sin x = 2 - 2 * cos 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sin_area_with_binomial_coef", "source_license": null, "theorem_names": ["sin_area_with_binomial_coef"], "statement_sha256": "b2f2110ece4ae8950dd273970a90059bb737b92016f2781ddc5bf6fbd08b621d", "task_path": "tasks/rl_align__o_proofs_sin_area_with_binomial_coef__b2f2110ece4ae895", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sin_area_with_binomial_coef", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sin_ne_0_4__6259c641f0d56049", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped Topology\n\n\ntheorem sin_ne_0 (x : ℝ) (hx : sin x ≠ 0)\n (x_seq : ℕ → ℝ) (hx_seq : ∀ n, x_seq n = sin (n * x)) :\n ¬ ∃ L, Tendsto x_seq atTop (𝓝 L) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sin_ne_0_4", "source_license": null, "theorem_names": ["sin_ne_0"], "statement_sha256": "6259c641f0d5604914a91076413ab2e0baa6637560420129942ea367383f3f04", "task_path": "tasks/rl_align__o_proofs_sin_ne_0_4__6259c641f0d56049", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sin_ne_0_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sin_polynomial__f16177ed33c48af7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped Real\n\n\ntheorem sin_polynomial (P : Polynomial ℝ) (hP : P = 8 * Polynomial.X ^ 3 - 4 * Polynomial.X ^ 2 - 4 * Polynomial.X + 1)\n (r : Fin 3 → ℝ) (hr : r 0 = cos (π / 7) ∧ r 1 = cos (3 * π / 7) ∧ r 2 = cos (5 * π / 7)) :\n sin (π / 7) + sin (2 * π / 7) + sin (4 * π / 7) =\n 1 / 2 / tan (π / 14) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sin_polynomial", "source_license": null, "theorem_names": ["sin_polynomial"], "statement_sha256": "509f7ceb40f587c2cd75748c0b0a11081bdb3542897d59cd42b9e7b85a888631", "task_path": "tasks/rl_align__o_proofs_sin_polynomial__f16177ed33c48af7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sin_polynomial", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_slant_asymptote_2__e5496cb92901e5d5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem slant_asymptote (x : ℝ) (h : x ≠ 4) : ∃ m b : ℝ, Filter.Tendsto (fun x => (3 * x ^ 2 - 2 * x - 5) / (x - 4) - (m * x + b)) Filter.atTop (𝓝 0) ∧ m + b = 13 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_slant_asymptote_2", "source_license": null, "theorem_names": ["slant_asymptote"], "statement_sha256": "e5496cb92901e5d5108058ff1d054dd0ed8e41a0b0f41fc681db455b8c7af799", "task_path": "tasks/rl_align__o_proofs_slant_asymptote_2__e5496cb92901e5d5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_slant_asymptote_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_smallest_common_remainder_is_9241__da93870e34b02f06", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem smallest_common_remainder_is_9241 :\n ∀ n : ℕ, n > 1 ∧\n (∀ d : ℕ, d ∈ ({5, 7, 8, 10, 11, 12} : Set ℕ) → n % d = 1) →\n n ≥ 9241 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_smallest_common_remainder_is_9241", "source_license": null, "theorem_names": ["smallest_common_remainder_is_9241"], "statement_sha256": "da93870e34b02f06a9342f52060f5435688b2902b34ddbb4ed60a69a3ad1b23c", "task_path": "tasks/rl_align__o_proofs_smallest_common_remainder_is_9241__da93870e34b02f06", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_smallest_common_remainder_is_9241", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sol_15__be1c5301907c2c84", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem sol : ∫ y in (-3)..3, ∫ x in (0)..(π/2), (y + y^2 * cos x) = 18 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sol_15", "source_license": null, "theorem_names": ["sol"], "statement_sha256": "be1c5301907c2c84cb2eae5a0b31d476f5c49bd6daacfd07ce2df6fbb7dc834f", "task_path": "tasks/rl_align__o_proofs_sol_15__be1c5301907c2c84", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sol_15", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sol_8688__09f81c11e614dc51", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\ntheorem sol_8688 :\n {f : Fin 5 → Fin 5 | ∀ i, f (f i) = f i}.ncard = ∑ k ∈ Icc (1 : ℕ) 5, Nat.choose 5 k * k ^ (5 - k) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sol_8688", "source_license": null, "theorem_names": ["sol_8688"], "statement_sha256": "09f81c11e614dc51148655aa4096f92d4dd192e07f67ae4f9a7444e659f6d14f", "task_path": "tasks/rl_align__o_proofs_sol_8688__09f81c11e614dc51", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sol_8688", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_1255__38afd342b0ff5b9b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem solution (S : Set ℝ) (hS : S = {x : ℝ | x ^ 2 + 5 * x + 3 ≠ 0 ∧ x ^ 2 + x + 3 ≠ 0 ∧ 2 * x / (x ^ 2 + 5 * x + 3) + 3 * x / (x ^ 2 + x + 3) = 1}) :\n ∑ᶠ x ∈ S, x = -4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_1255", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "38afd342b0ff5b9b06f8ea1e0231ab5f481e89d55c13f862d2af17a6492e7478", "task_path": "tasks/rl_align__o_proofs_solution_1255__38afd342b0ff5b9b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_1255", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_1763__6e90e805d220b76e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution :\n Set.ncard {t : Fin 4 → ℕ | t 0 > 0 ∧ t 1 > 0 ∧ t 2 > 0 ∧ t 3 > 0 ∧ t 0 + t 1 ≥ 5 ∧ t 2 + t 3 ≥ 5 ∧ t 0 + t 1 + t 2 + t 3 = 20} = 781 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_1763", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "6e90e805d220b76e4ae9a209300ae35dd5ca50d323d71cb0d7c8432c5afe407e", "task_path": "tasks/rl_align__o_proofs_solution_1763__6e90e805d220b76e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_1763", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_1794__5ae611a3461dbaae", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution : {x : Finset ℕ | x ⊆ {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} ∧ x.card = 4 ∧\n (x ∩ {0, 1, 2}).card = 2 ∧ (x ∩ {3, 4, 5, 6, 7, 8, 9}).card = 2}.ncard = 63 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_1794", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "5ae611a3461dbaaee3b48002c6497be0d11d1a778c02457c2856e1d311186e8f", "task_path": "tasks/rl_align__o_proofs_solution_1794__5ae611a3461dbaae", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_1794", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_1799__34902d4966e2d147", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution : {n : ℕ | n ∈ Finset.Icc 1000000 9999999 ∧ 3 ∣ n ∧ (Nat.digits 10 n).length = 7 ∧ (Nat.digits 10 n).toFinset ⊆ Finset.Icc 0 4}.ncard = 20833 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_1799", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "34902d4966e2d147144173e509b719ff8c428e60b783490fb41096e2754eebac", "task_path": "tasks/rl_align__o_proofs_solution_1799__34902d4966e2d147", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_1799", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_2017__41f0f26ec8f407f1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem solution (s : Set ℕ) (hs : s = {x : ℕ | ∃ y : ℕ, x > 0 ∧ y > 0 ∧ (1 / x : ℚ) + 1 / y = 1 / 7}) :\n ∑ᶠ x ∈ s, x = 78 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_2017", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "41f0f26ec8f407f1470ead550a6dbf4f793daa620cee93abd3ce6cfae39685ce", "task_path": "tasks/rl_align__o_proofs_solution_2017__41f0f26ec8f407f1", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_2017", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_2307__708ac915091fd577", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem solution : Set.ncard {(a, b, c, d) : ℤ × ℤ × ℤ × ℤ | 1 ≤ a ∧ a < b ∧ b < c ∧ c < d ∧ d ≤ 10 ∧ a + d > b + c} = 80 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_2307", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "708ac915091fd577b9e4be584d8a83a2e69e1548ffacb6a353e55030857a054f", "task_path": "tasks/rl_align__o_proofs_solution_2307__708ac915091fd577", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_2307", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_2327__fc87f5d3b39d0976", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem solution :\n\n Set.ncard {n : ℕ | 2 ≤ n ∧ n ≤ 80 ∧ ∃ k : ℤ, (n - 1)*n*(n + 1)/((8:ℚ)) = k} = 49 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_2327", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "fc87f5d3b39d097662fe7170dcbe562f763b3a860f3e9af01c121852a6692f74", "task_path": "tasks/rl_align__o_proofs_solution_2327__fc87f5d3b39d0976", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_2327", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_2777__c1ee0a46714d7d17", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution :\n Set.ncard {x : Fin 3 → ℕ | ∑ i, x i = 15} = Nat.factorial 17 / (Nat.factorial 2 * Nat.factorial 15) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_2777", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "c1ee0a46714d7d17c9bfd7f4ce2c9b81ec4d0573959bfab09ca4fcb0fe48d8e2", "task_path": "tasks/rl_align__o_proofs_solution_2777__c1ee0a46714d7d17", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_2777", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_295__59056ed90dbdfe36", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution : (Set.ncard {p : Finset ℕ | ∃ q r : ℕ, p = {q, r} ∧ q.Prime ∧ r.Prime ∧ q + r = 40}) = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_295", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "59056ed90dbdfe363cc596e474a26f02d0ef2c7d2d52ad0adac91940194058fc", "task_path": "tasks/rl_align__o_proofs_solution_295__59056ed90dbdfe36", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_295", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_2965__e5114dfe9b588d75", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem solution : Set.ncard {n : ℕ | 1 ≤ n ∧ n ≤ 2003 ∧ ¬(Nat.Coprime (n ^ 2 + 4) (n + 5))} = 69 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_2965", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "e5114dfe9b588d75cd4dcf55fec47e98548adc4e2796f83f70010be10adbbf6a", "task_path": "tasks/rl_align__o_proofs_solution_2965__e5114dfe9b588d75", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_2965", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_3302__51a381857b2d8595", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem solution : Set.ncard {n : ℕ | n ∈ Finset.Icc 100000 999999 ∧ ∀ i < (Nat.digits 10 n).length - 1, (Nat.digits 10 n)[i + 1]! > (Nat.digits 10 n)[i]! ∧ (Nat.digits 10 n)[0]! ≠ 0} = 84 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_3302", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "51a381857b2d859547e4092f48186039960115c059544902d5e9c23729167c5e", "task_path": "tasks/rl_align__o_proofs_solution_3302__51a381857b2d8595", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_3302", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_3339__ded8ea29ed883811", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem solution : ∫ x in (0)..(2 * π), (1 + cos x) * cos x * (-sin x ^ 2 + cos x + cos x ^ 2) = 3 * π / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_3339", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "ded8ea29ed883811effe069a62e9fcff1b94afe053753180c5373bfc07c97a83", "task_path": "tasks/rl_align__o_proofs_solution_3339__ded8ea29ed883811", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_3339", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_392__5a0bbeda73cb96ec", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution :\n Set.ncard {n : ℕ | n ∈ Finset.Icc 1000 9999 ∧ (Nat.digits 10 n).length = 4 ∧ (Nat.digits 10 n).toFinset ⊆ {0, 1, 4, 5, 7, 9} ∧ ∃ k, (Nat.digits 10 n).contains k ∧ (Nat.digits 10 n).count k ≥ 2} = 780 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_392", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "5a0bbeda73cb96ec903a473930be64f1fcc9354f7e10ab96b0c7998be6ad303e", "task_path": "tasks/rl_align__o_proofs_solution_392__5a0bbeda73cb96ec", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_392", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_399__9b2d3b0dc88e06ca", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution :\n Set.ncard {n : ℕ | n ∈ Finset.Icc 100 999 ∧ ¬∃ k, (Nat.digits 10 n).length = 3 ∧\n (Nat.digits 10 n)[2]! = k ∧ (Nat.digits 10 n)[0]! = k ∧ (Nat.digits 10 n)[1]! ≠ k} = 819 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_399", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "9b2d3b0dc88e06cacf41aad056f5d66f6649a41955acb8bdaa7f08cede1e07c9", "task_path": "tasks/rl_align__o_proofs_solution_399__9b2d3b0dc88e06ca", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_399", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_412__bf3af2c426fd7380", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem solution:\n Set.ncard {n : ℤ | 1 ≤ n ∧ n ≤ 1000 ∧ ∃p q:ℕ, (n:ℚ)/(1400:ℚ) = p/10^q } = 142 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_412", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "bf3af2c426fd7380bfcd4ebc409aeb8900129e49796d65fd3eaf034d38b72180", "task_path": "tasks/rl_align__o_proofs_solution_412__bf3af2c426fd7380", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_412", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_415__96bafefe2e790965", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution : {x : Fin 4 → ℕ | (∀ i, x i > 0) ∧ ∑ i, x i < 30}.ncard = Nat.choose 29 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_415", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "96bafefe2e7909659e93360cf822f7c155fc92b589d7ab5fdc405fa1cc066e00", "task_path": "tasks/rl_align__o_proofs_solution_415__96bafefe2e790965", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_415", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_459__7f082550759b2707", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution : {k | ∃ f : ℝ → ℝ, (∀ x y : ℝ, f ((x - y) ^ 2) = f x ^ 2 - 2 * x * f y + y ^ 2) ∧ k = f 1}.ncard * (∑ᶠ k ∈ {k | ∃ f : ℝ → ℝ, (∀ x y : ℝ, f ((x - y) ^ 2) = f x ^ 2 - 2 * x * f y + y ^ 2) ∧ k = f 1}, k) = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_459", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "7f082550759b270720103936694413b96f7d3fc7d1f51e07fca51160b1faef08", "task_path": "tasks/rl_align__o_proofs_solution_459__7f082550759b2707", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_459", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_486__b3b9824611350925", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution (a : ℕ) (ha : a = 10) :\n {(x : Fin 5 → ℕ) | (∀ i, x i ≥ 1) ∧ (∀ i, x i ≤ a) ∧\n ∑ i, x i = a}.ncard = 126 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_486", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "b3b9824611350925988765fa3689b4556c06151136ae192a748672a1fe02fcfd", "task_path": "tasks/rl_align__o_proofs_solution_486__b3b9824611350925", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_486", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_492__1f9a2dd75b7b6a9d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem solution :\n Set.ncard {x : Fin 5 → ℕ | x 0 + x 1 + x 2 + x 3 + x 4 ≤ 19} = Nat.choose 24 5 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_492", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "1f9a2dd75b7b6a9dba7b7b84b008f1940552a35323efce48a49c5fb5a2080a2d", "task_path": "tasks/rl_align__o_proofs_solution_492__1f9a2dd75b7b6a9d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_492", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_511__ca9e35fd2245fd69", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem solution : (Set.ncard {p : ℤ × ℤ | p.1 * p.2 ≥ 0 ∧ p.1 ^ 3 + p.2 ^ 3 + 99 * p.1 * p.2 = 33 ^ 3}) = 35 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_511", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "ca9e35fd2245fd69ef02622f28df9678a16e19d291d21b5ae0d7f771e7e83c2b", "task_path": "tasks/rl_align__o_proofs_solution_511__ca9e35fd2245fd69", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_511", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_557__f8f59520b0b46e8e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution :\n Set.ncard {(x, y) : ℤ × ℤ | abs x ≤ 1000 ∧ abs y ≤ 1000 ∧ 4 * x ^ 3 - 5 * x ^ 2 * y + 10 * x * y ^ 2 + 12 * y ^ 3 - 108 * x - 81 * y = 0} = 503 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_557", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "f8f59520b0b46e8efdc7189766cea383f5ec75815e7ced3ab0b63e3fd3d05641", "task_path": "tasks/rl_align__o_proofs_solution_557__f8f59520b0b46e8e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_557", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_598__f94b507d84c6fb05", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem solution :\n {n : ℕ | 1 ≤ n ∧ n ≤ 2018 ∧ ∃ k, k > 0 ∧ (k * 4) = ∑ i ∈ Icc 1 n, i}.ncard = 504 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_598", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "f94b507d84c6fb056cc03562aedcb529af229156449d85fd13bf74bb9483e4b6", "task_path": "tasks/rl_align__o_proofs_solution_598__f94b507d84c6fb05", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_598", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_606__be74f7eec86189fa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution :\n Set.ncard {x : Fin 5 → ℕ | (∀ i, x i > 0) ∧ ∏ i, x i ≤ ∑ i, x i ∧ ∑ i, x i ≤ 10} = 116 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_606", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "be74f7eec86189fa0911e2dec9a1a8d7376bccb9cc10d87545c9b2b777dcd3f2", "task_path": "tasks/rl_align__o_proofs_solution_606__be74f7eec86189fa", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_606", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_993__7cc3ba7942ee404d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem solution (r : Set ℕ) (hr: r = {n | n > 3000 ∧ n < 4010 ∧ n % 10 = ((n / 10) % 10 + (n / 100) % 10 + (n / 1000) % 10) ∧ 3 ∣ n}) :\n r.encard = 12 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_993", "source_license": null, "theorem_names": ["solution"], "statement_sha256": "7cc3ba7942ee404d28b4c809ac1e97276b072a59a46cccc90437178cadce8747", "task_path": "tasks/rl_align__o_proofs_solution_993__7cc3ba7942ee404d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_993", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_number_2__ce0971380d7c0632", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution_number :\n {x : Fin 5 → ℕ | ∑ i, x i = 16}.ncard = 4845 ∧\n {x : Fin 5 → ℕ | ∀ i, x i > 0 ∧ ∑ i, x i = 16}.ncard = 1365 ∧\n ¬∃ x : Fin 5 → ℕ, (∀ i, Odd (x i)) ∧ ∑ i, x i = 16 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_number_2", "source_license": null, "theorem_names": ["solution_number"], "statement_sha256": "ce0971380d7c0632073be53c121139575336e01725c455bcc86e6474c6bdf163", "task_path": "tasks/rl_align__o_proofs_solution_number_2__ce0971380d7c0632", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_number_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_set_575__69da144415e4f1cf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem solution_set :\n Set.ncard {x : ℤ × ℤ | x.1 > 0 ∧ x.2 > 0 ∧ 9 * x.1 - 7 * x.2 = 1 ∧ x.1 < 1000 ∧ x.2 < 1000} = 111 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_set_575", "source_license": null, "theorem_names": ["solution_set"], "statement_sha256": "69da144415e4f1cf263adec85dc3b0dd16aa4960ebdf23dc5cf45c4350c7d696", "task_path": "tasks/rl_align__o_proofs_solution_set_575__69da144415e4f1cf", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_solution_set_575", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_solution_set_eq_4__6b1ed7193161e38f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem solution_set_eq (s : Set ℝ) (hs : s = {x : ℝ | x ^ 2 + 1 / x ^ 2 = 2006 + 1 / 2006}) :\n s.encard = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_set_eq_4", "source_license": null, "theorem_names": ["solution_set_eq"], "statement_sha256": "6b1ed7193161e38f6e95c31ee6aca23ba3c64b2a81b601a04acc8aa606b5c81e", "task_path": "tasks/rl_align__o_proofs_solution_set_eq_4__6b1ed7193161e38f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_solution_set_eq_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_span_5__5afe543c0824d98d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem span (n : ℕ) (u v : EuclideanSpace ℝ (Fin n)) :\n closure {x | ∃ t s : ℝ, x = t • u + s • v} =\n closure {x | ∃ t s : ℝ, x = t • (2 • u + 3 • v) + s • (u + 2 • v)} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_span_5", "source_license": null, "theorem_names": ["span"], "statement_sha256": "5afe543c0824d98d83260b8942d03fe0fb23a89c66d2e43eb7be3b9cd1406633", "task_path": "tasks/rl_align__o_proofs_span_5__5afe543c0824d98d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_span_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sphere_diameter_sufficient__f22675c18ce840fe", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem sphere_diameter_sufficient (n : ℕ) (hn : n = 2 ∨ n = 3 ∨ n = 4 ∨ n = 5 ∨ n = 6 ∨ n = 8) : ∃ d : ℝ, d ≥ 2 ∧ ∃ (points : Fin n → ℝ × ℝ × ℝ), (∀ i j : Fin n, i ≠ j → dist (points i) (points j) ≥ 1) ∧ ∀ i : Fin n, dist (0, 0, 0) (points i) ≤ d / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sphere_diameter_sufficient", "source_license": null, "theorem_names": ["sphere_diameter_sufficient"], "statement_sha256": "f22675c18ce840fe79ae498518ff39a410d0d84412c9fafa0bc29680294a43ec", "task_path": "tasks/rl_align__o_proofs_sphere_diameter_sufficient__f22675c18ce840fe", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sphere_diameter_sufficient", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_statement_0271761__ddbcb9868ef807a0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem σ {σ : ℕ → ℕ}\n (hσ : ∀ n, σ n = ∑ d ∈ n.divisors, d) :\n (∀ m n, m.gcd n = 1 → σ (m * n) = σ m * σ n) ∧\n (∀ p k, Nat.Prime p → σ (p ^ k) = ∑ i ∈ range (k + 1), p ^ i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_statement_0271761", "source_license": null, "theorem_names": ["σ"], "statement_sha256": "ddbcb9868ef807a0b7fbc10afb4ec309fa9e82ebc505d466ee2c4e92c9cd34eb", "task_path": "tasks/rl_align__o_proofs_statement_0271761__ddbcb9868ef807a0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_statement_0271761", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_statement_0275472__8442f549fc901e5e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem α {f : ℝ → ℝ × ℝ}\n (hf : f = λ t => (sin t, cos t + log (tan (t / 2)))) :\n DifferentiableOn ℝ f (Set.Ioo 0 π) ∧\n ∀ t ∈ Set.Ioo 0 π, t ≠ π / 2 → deriv f t ≠ 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_statement_0275472", "source_license": null, "theorem_names": ["α"], "statement_sha256": "8442f549fc901e5eb8b32818926c6f5d7bc27566f0a4f94183548b4c74482fdc", "task_path": "tasks/rl_align__o_proofs_statement_0275472__8442f549fc901e5e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_statement_0275472", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_statement_0317071__b19944613ce06fe2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem α : ∀ x : ℝ, (∀ f : ℝ → ℝ,\n ContinuousOn f (Set.Icc 0 1) ∧ DifferentiableOn ℝ f (Set.Ioo 0 1) ∧\n f 0 = 0 ∧ f 1 = 1 → ∃ ξ ∈ Set.Ioo 0 1, f ξ + x = deriv f ξ) ↔\n x = 1 / (Real.exp 1 - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_statement_0317071", "source_license": null, "theorem_names": ["α"], "statement_sha256": "b19944613ce06fe2a9972e1c6ce5434c9b6c512b802fb0ce0bbec9abe0792d95", "task_path": "tasks/rl_align__o_proofs_statement_0317071__b19944613ce06fe2", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_statement_0317071", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_stone_pile_process__078be488796632d6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem stone_pile_process (n k : ℕ) (h₀ : n > 0) (h₁ : k > 0) (s : Fin k → ℕ) (h₂ : ∑ i : Fin k, s i = n * (n + 1) / 2) :\n ∃ m : ℕ, ∃ f : Fin m → ℕ, (∑ i : Fin m, f i = n * (n + 1) / 2) ∧ ∀ i : Fin m, f i ≥ 1 ∧ f i ≤ n ∧ (∀ n : ℕ, n ≥ 1 → n ≤ m → ∃ i : Fin m, f i = n) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_stone_pile_process", "source_license": null, "theorem_names": ["stone_pile_process"], "statement_sha256": "078be488796632d6a6b75212e8e9abc453c1b795a2c75a0f60148c6a70e53ef0", "task_path": "tasks/rl_align__o_proofs_stone_pile_process__078be488796632d6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_stone_pile_process", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_stone_piles_final_state__fd237371d7295026", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem stone_piles_final_state (n k : ℕ) (stones : Fin k → ℕ)\n (h : ∑ i : Fin k, stones i = n * (n + 1) / 2) :\n ∃ m : ℕ, ∃ (new_stones : Fin m → ℕ),\n (∑ i : Fin m, new_stones i = n * (n + 1) / 2) ∧\n ∀ i : Fin m, new_stones i = i + 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_stone_piles_final_state", "source_license": null, "theorem_names": ["stone_piles_final_state"], "statement_sha256": "fd237371d7295026d601fe108e2ea440acde22ac3cc22f94ef512073ac41f8ed", "task_path": "tasks/rl_align__o_proofs_stone_piles_final_state__fd237371d7295026", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_stone_piles_final_state", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_student_group_theorem__835a0a04febf977e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem student_group_theorem (s : Finset ℕ) (hs : s.card = 46) (G : Finset (Finset ℕ)) (hG : ∀ g ∈ G, g.card = 3) (h_common : ∀ g1 ∈ G, ∀ g2 ∈ G, g1 ≠ g2 → (g1 ∩ g2).card ≤ 1) : ∃ S : Finset ℕ, S.card = 10 ∧ ∀ g ∈ G, ¬ (g ⊆ S) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_student_group_theorem", "source_license": null, "theorem_names": ["student_group_theorem"], "statement_sha256": "835a0a04febf977e31cf9158e1607d8ace41d9c8441f33dd0193d97843b64b3d", "task_path": "tasks/rl_align__o_proofs_student_group_theorem__835a0a04febf977e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_student_group_theorem", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_subset_count__5454cb1d65b129d8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem subset_count (a : ℝ) : Nat.card {s : Set ℝ | s ⊆ {x | x^2 - 3*x - a^2 + 2 = 0} ∧ s.Nonempty ∧ s ≠ {x | x^2 - 3*x - a^2 + 2 = 0}} = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_subset_count", "source_license": null, "theorem_names": ["subset_count"], "statement_sha256": "5454cb1d65b129d826a615521fe8185a26d5b8d9a8d7eeb81812181922a76ed1", "task_path": "tasks/rl_align__o_proofs_subset_count__5454cb1d65b129d8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_subset_count", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfBintimes__289045ab8d04aac3", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem sumOfBintimes {f : ℕ → ℝ}\n (hf : ∀ n, f n = ∑ i ∈ Icc 1 n, i * Nat.choose n i) :\n ∀ n, f n = n * 2^(n - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfBintimes", "source_license": null, "theorem_names": ["sumOfBintimes"], "statement_sha256": "289045ab8d04aac38c9bce7b72ab29d4f1fa265d571e1fbc25af8148be1bd86d", "task_path": "tasks/rl_align__o_proofs_sumOfBintimes__289045ab8d04aac3", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfBintimes", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfComplex_3__f22dc7fe2cbc46af", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sumOfComplex(ω : ℂ)(hω : ω ^ 3 = 1 ∧ ω ≠ 1) (n : ℕ) (hn : n > 0)\n (a : Fin n → ℝ) (h : ∑ i : Fin n, 1 / (a i + ω) = 2 + 5 * .I) :\n ∑ i : Fin n, (2 * a i - 1) / (a i ^ 2 - a i + 1) = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfComplex_3", "source_license": null, "theorem_names": ["sumOfComplex"], "statement_sha256": "f22dc7fe2cbc46af3ee11969c475010633d2f078432ac6cdf23167cf80410ed4", "task_path": "tasks/rl_align__o_proofs_sumOfComplex_3__f22dc7fe2cbc46af", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfComplex_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfDifferences_12__1482f57c0da355c6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem sumOfDifferences {n : ℕ} :\n ∑ i ∈ Icc 1 (n - 1), i * (i + 1) = 2 * Nat.choose (n + 1) 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfDifferences_12", "source_license": null, "theorem_names": ["sumOfDifferences"], "statement_sha256": "1482f57c0da355c6b88b379aa7541fe24b927adea403e5f9d157c9bdf4983ef5", "task_path": "tasks/rl_align__o_proofs_sumOfDifferences_12__1482f57c0da355c6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfDifferences_12", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfDivisors_6__21a34e641bdda9a6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem sumOfDivisors {n : ℕ} (hn : 0 < n) :\n ∑ k ∈ Icc 1 n, (Nat.divisors k).card =\n ∑ d ∈ Icc 1 n, n / d := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfDivisors_6", "source_license": null, "theorem_names": ["sumOfDivisors"], "statement_sha256": "21a34e641bdda9a66be36a4ab84b013e79a7332470d30336771b74c5e76198e5", "task_path": "tasks/rl_align__o_proofs_sumOfDivisors_6__21a34e641bdda9a6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfDivisors_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfInequalities_2__6ddc44042d2aea31", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sumOfInequalities {n : ℕ} (hn : 0 < n) (a : ℕ → ℝ)\n (ha : ∀ i ∈ Icc 1 n, 0 ≤ a i) :\n ∑ i ∈ Icc 1 n, (∏ j ∈ Icc 1 (i - 1), a j) / (∏ j ∈ Icc 1 i, (1 + a j)) ≤ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfInequalities_2", "source_license": null, "theorem_names": ["sumOfInequalities"], "statement_sha256": "6ddc44042d2aea31e261d6e24e38d83de1c18cdd3a729272363a35d1eaf1e9b3", "task_path": "tasks/rl_align__o_proofs_sumOfInequalities_2__6ddc44042d2aea31", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfInequalities_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfIntegers_68__a758836c87cacebb", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem sumOfIntegers : ⌊∑ i ∈ Icc 1 100, (2^i / (Nat.factorial i) : ℝ)⌋ = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfIntegers_68", "source_license": null, "theorem_names": ["sumOfIntegers"], "statement_sha256": "a758836c87cacebb158a5ca47365ba486d2f4a42c7201bc668370f069a190aed", "task_path": "tasks/rl_align__o_proofs_sumOfIntegers_68__a758836c87cacebb", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfIntegers_68", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfKs_6__4b5cfbe1b3c92d42", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem sumOfKs :\n ∑ᶠ k ∈ {x | (x ≥ 2) ∧ (∃ m : ℕ, ∀ n : ℕ, n ≠ 0 → Nat.Coprime n x → m ^ n + n ^ m ≡ 0 [MOD x])}, k = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfKs_6", "source_license": null, "theorem_names": ["sumOfKs"], "statement_sha256": "4b5cfbe1b3c92d420bc3dba655f5384460937c9dce8e9e9e8281be3806ce5f4c", "task_path": "tasks/rl_align__o_proofs_sumOfKs_6__4b5cfbe1b3c92d42", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfKs_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfPositives__c2213b09b6765430", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem sumOfPositives {n : ℕ} (hn : 0 < n) (a : ℕ → ℝ)\n (ha : ∀ i ∈ Icc 1 n, 0 < a i)\n (h : ∀ i ∈ Icc 1 (n - 1), a i - a (i + 1) = (Nat.factorial i))\n (h' : a n = Nat.factorial n) :\n ∑ i ∈ Icc 1 n, a i = ∑ k ∈ Icc 1 n, k * (Nat.factorial k) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfPositives", "source_license": null, "theorem_names": ["sumOfPositives"], "statement_sha256": "c2213b09b6765430c7b14fe488db66769f6bc912616588607c18c1076751c3e2", "task_path": "tasks/rl_align__o_proofs_sumOfPositives__c2213b09b6765430", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfPositives", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfPowers_32__33ad4cfa2d80757b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sumOfPowers (n : ℕ) (hn : 0 < n) (z : ℕ) (hz : z ∈ Icc 0 2)\n (S : ℕ → ℝ) (hS : ∀ k, S k = ∑ x ∈ Icc 1 n, x ^ k) :\n S 0 = n ∧ S 1 = n * (n + 1) / 2 ∧ S 2 = n * (n + 1) * (2 * n + 1) / 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfPowers_32", "source_license": null, "theorem_names": ["sumOfPowers"], "statement_sha256": "33ad4cfa2d80757be067379605ece7d1db61d03349ebffab8ceefba473435ebf", "task_path": "tasks/rl_align__o_proofs_sumOfPowers_32__33ad4cfa2d80757b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfPowers_32", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfPowerset__78adeecd7f55b0e8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem sumOfPowerset {n : ℕ} {r : ℕ} :\n 1 + ∑ k ∈ range r, Nat.choose r k * ∑ i ∈ range n, (i + 1)^k =\n (n + 1)^r := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfPowerset", "source_license": null, "theorem_names": ["sumOfPowerset"], "statement_sha256": "78adeecd7f55b0e8a08d04bab5a80bc67d518baba6c023c0bb463bf4aa313c65", "task_path": "tasks/rl_align__o_proofs_sumOfPowerset__78adeecd7f55b0e8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfPowerset", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfQualifiedTwoDigitIntegers__102ae0afaee508c0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem sumOfQualifiedTwoDigitIntegers (qualified_two_digit_integers : Set ℕ)\n (h_qualified_two_digit_integers : qualified_two_digit_integers = {n | ∃ a b : ℕ, 1 ≤ a ∧ a ≤ 9 ∧ b ≤ 9 ∧ n = 10 * a + b ∧ a ∣ n ∧ b ∣ n}) :\n ∑ᶠ x ∈ qualified_two_digit_integers, x = 630 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfQualifiedTwoDigitIntegers", "source_license": null, "theorem_names": ["sumOfQualifiedTwoDigitIntegers"], "statement_sha256": "102ae0afaee508c05b5c85a450aaa55023ed0f8646526b3c55dacd84b4127999", "task_path": "tasks/rl_align__o_proofs_sumOfQualifiedTwoDigitIntegers__102ae0afaee508c0", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfQualifiedTwoDigitIntegers", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfRat_2__a5b7548c24830632", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem sumOfRat : ⌊∑ i ∈ range 2018, (2 ^ (i + 1)) / ((Nat.factorial (i + 1)) : ℚ)⌋ = 6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfRat_2", "source_license": null, "theorem_names": ["sumOfRat"], "statement_sha256": "a5b7548c248306329b245e048ec7638db926d485495a22134611116488eeff1d", "task_path": "tasks/rl_align__o_proofs_sumOfRat_2__a5b7548c24830632", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfRat_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfRatios_11__0aa2062ee6e3ea6b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sumOfRatios {n : ℕ} (hn : 0 < n) (a : ℕ → ℝ)\n (ha : ∀ i ∈ range n, 0 < a i) :\n ∑ i ∈ range n, a i / (∑ j ∈ range n \\ {i}, a j) ≥ (n - 1) / n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfRatios_11", "source_license": null, "theorem_names": ["sumOfRatios"], "statement_sha256": "0aa2062ee6e3ea6b455307722867be31d3d63bc4a2c002ab278e61875c468804", "task_path": "tasks/rl_align__o_proofs_sumOfRatios_11__0aa2062ee6e3ea6b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfRatios_11", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfRatios_27__6a71970a1232ee4e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sumOfRatios {n : ℕ} (hn : 2 ≤ n) (a : ℕ → ℝ)\n (ha : ∀ i ∈ Icc 1 n, 0 < a i) (hsum : ∑ i ∈ Icc 1 n, a i = 1) :\n ∑ i ∈ Icc 1 n, a i / (1 + ∑ j ∈ (Icc 1 n).erase i, a j) ≥ n / (2 * n - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfRatios_27", "source_license": null, "theorem_names": ["sumOfRatios"], "statement_sha256": "6a71970a1232ee4e1665dc271b5e1408367477f9c09a5ab774475cc677e1f701", "task_path": "tasks/rl_align__o_proofs_sumOfRatios_27__6a71970a1232ee4e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfRatios_27", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfSequence_5__48d6138a091d0e12", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sumOfSequence {a : ℕ → ℝ} (ha : ∀ n, a (n + 1) = 1 / (1 + 1 / a n)) (ha1 : a 1 = 1) :\n ∑ i ∈ range 2010, a (i + 1) * a (i + 2) = 2010 / 2011 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfSequence_5", "source_license": null, "theorem_names": ["sumOfSequence"], "statement_sha256": "48d6138a091d0e124d3e160388ac879cc8f916b53d7ea43b84a3affaa3caf416", "task_path": "tasks/rl_align__o_proofs_sumOfSequence_5__48d6138a091d0e12", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfSequence_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfSeries_7__f7047b3c4915010d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sumOfSeries {n : ℕ} (hn : 0 < n) (a : ℕ → ℝ)\n (ha : ∀ i ∈ Icc 1 n, a i ≠ -1) :\n ∑ i ∈ Icc 1 n, a i / (∏ j ∈ Icc 1 i, (1 + a j)) =\n 1 - 1 / (∏ i ∈ Icc 1 n, (1 + a i)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfSeries_7", "source_license": null, "theorem_names": ["sumOfSeries"], "statement_sha256": "f7047b3c4915010dabceae8df2b909b769228e1aae98f1ef7a7ec50bfb12553d", "task_path": "tasks/rl_align__o_proofs_sumOfSeries_7__f7047b3c4915010d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfSeries_7", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfSolutions_15__9986c153447cc914", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem sumOfSolutions (s : Set ℤ) (hs : s = {x | 4 < (x - 3)^2 ∧ (x - 3)^2 < 64}) :\n ∑ᶠ x ∈ s, x = 30 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfSolutions_15", "source_license": null, "theorem_names": ["sumOfSolutions"], "statement_sha256": "9986c153447cc914993622c9fe45f41f9d20873bcfe35365e0e2096f7e43b57f", "task_path": "tasks/rl_align__o_proofs_sumOfSolutions_15__9986c153447cc914", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfSolutions_15", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfSolutions_40__759a023b96d0f966", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem sumOfSolutions (s : Set (ℝ × ℝ × ℝ))\n (hs : s = {(x, y, z) | x * y = 2 * x + y - 1 ∧ y * z = 2 * z + 3 * y - 8 ∧ z * x = 4 * z + 3 * x - 8}) :\n ∑ᶠ x ∈ s, x.1 = 5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfSolutions_40", "source_license": null, "theorem_names": ["sumOfSolutions"], "statement_sha256": "759a023b96d0f9663c3a59757f65c2867f8a7eda15303eaffc5c830daafe78d7", "task_path": "tasks/rl_align__o_proofs_sumOfSolutions_40__759a023b96d0f966", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfSolutions_40", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfSolutions_4__34319e7790fde404", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sumOfSolutions (s : Set ℝ) (hs : s = {x : ℝ | 2^abs x + 3 * abs x = 18}) :\n ∑ᶠ x ∈ s, x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfSolutions_4", "source_license": null, "theorem_names": ["sumOfSolutions"], "statement_sha256": "34319e7790fde404a555c6a03f35000f61f774ea00cb4aa83044939ee09e750d", "task_path": "tasks/rl_align__o_proofs_sumOfSolutions_4__34319e7790fde404", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfSolutions_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfThreeV__eafd7456c4bbfa31", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem sumOfThreeV (A B C : EuclideanSpace ℝ (Fin 2))\n (hABC : ¬Collinear ℝ {A, B, C}) :\n let v1 := midpoint ℝ B C - A\n let v2 := midpoint ℝ A C - B\n let v3 := midpoint ℝ A B - C\n v1 + v2 + v3 = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfThreeV", "source_license": null, "theorem_names": ["sumOfThreeV"], "statement_sha256": "eafd7456c4bbfa31fc649dbc5e56ad0b7e0be368f7d1f76a487a972f1fc11d85", "task_path": "tasks/rl_align__o_proofs_sumOfThreeV__eafd7456c4bbfa31", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfThreeV", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfX_6__1f0e5ce92b517187", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sumOfX (n : ℕ) (hn : 0 < n) (x : ℕ → ℝ)\n (hx : ∀ i ∈ Icc 1 n, 0 ≤ x i) :\n ∑ i ∈ Icc 1 n, i * x i ≤ (n * (n - 1)) / 2 + ∑ i ∈ Icc 1 n, (x i) ^ i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfX_6", "source_license": null, "theorem_names": ["sumOfX"], "statement_sha256": "1f0e5ce92b51718749bb3262a67330cd26e387b5d7bc3afec4a7821e38c16af8", "task_path": "tasks/rl_align__o_proofs_sumOfX_6__1f0e5ce92b517187", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sumOfX_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOfZeros__7ac7008742f1bb88", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem sumOfZeros (f : ℝ → ℝ) (hf : f = λ x => sin (2 * π * sin x))\n (I : Set ℝ) (hI : I = Ioo (-π/2) (π/2)) :\n ∑ᶠ x ∈ {x | x ∈ I ∧ f x = 0}, x = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfZeros", "source_license": null, "theorem_names": ["sumOfZeros"], "statement_sha256": "7ac7008742f1bb8815586457bd12da63ee969c249ab2f97d43cde35522babe17", "task_path": "tasks/rl_align__o_proofs_sumOfZeros__7ac7008742f1bb88", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOfZeros", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sumOf_2__5d7e6315bf189728", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem sumOf (n : ℕ) (a : Fin n → ℚ)\n (ha : ∀ i : Fin n, 0 < a i) :\n (∃ m : ℤ,\n ∑ i : Fin n, (1 - a i * (sqrt (i + 1) - sqrt (i + 2))) / (a i + sqrt (i + 1) + sqrt (i + 2)) = m)\n ↔ IsSquare (n + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOf_2", "source_license": null, "theorem_names": ["sumOf"], "statement_sha256": "5d7e6315bf1897281500d15b670382f81dbb1e179cf9804e7663e3a5909d0b28", "task_path": "tasks/rl_align__o_proofs_sumOf_2__5d7e6315bf189728", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sumOf_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_a_22__e50baa02037014af", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped BigOperators Topology\n\n\ntheorem sum_a (a : ℕ → ℝ)\n (h₀ : ∀ n, a n = (-1 : ℝ)^n * (sqrt (n^2 + n) - n)) :\n ¬ Summable a := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_a_22", "source_license": null, "theorem_names": ["sum_a"], "statement_sha256": "e50baa02037014afd30eeafd6e79a87910289cc0d189bc1b2acbd52bcbe881ef", "task_path": "tasks/rl_align__o_proofs_sum_a_22__e50baa02037014af", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_a_22", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_a_28__ca3ee0117e569cbd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sum_a (n : ℕ) (hn : 0 < n) (a : ℕ → ℝ)\n (ha : ∀ i ∈ Icc 1 n, 0 < a i) (hsum : ∑ i ∈ Icc 1 n, a i = 1)\n (ha' : a (n + 1) = a 1) :\n ∑ i ∈ Icc 1 n, (a i)^4 / ((a i)^2 + (a (i + 1))^2) ≥ 1 / (2 * n) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_a_28", "source_license": null, "theorem_names": ["sum_a"], "statement_sha256": "ca3ee0117e569cbd05b400fe8abf6037b2db6f1ee2aa981bfd82ff817ba6026d", "task_path": "tasks/rl_align__o_proofs_sum_a_28__ca3ee0117e569cbd", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_a_28", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_a_36__ff34b04730106319", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem sum_a (a : ℕ → ℝ)\n (h₀ : a 0 = 1)\n (h₁ : a 1 = 1)\n (h₂ : ∀ k, a (k + 2) = (1/3)*a (k + 1) + (1/4)*a k) :\n ∑' n, a n = 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_a_36", "source_license": null, "theorem_names": ["sum_a"], "statement_sha256": "ff34b047301063196b450b792764bc2832f5b5bc04d7e8ba1af0e7f23b6fe138", "task_path": "tasks/rl_align__o_proofs_sum_a_36__ff34b04730106319", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_a_36", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_a_38__32dd37d9266235bd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sum_a (a : ℕ → ℝ) (ha : ∀ k ∈ Icc 1 2016, a k = k / 2016) :\n ∑ k ∈ Icc 1 2016, (a k)^2 / (2 * (a k)^2 - 2 * a k + 1) = 1008.5 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_a_38", "source_license": null, "theorem_names": ["sum_a"], "statement_sha256": "32dd37d9266235bd558e463db568107ea2eb4b851abe5c261b50a28bd89eb885", "task_path": "tasks/rl_align__o_proofs_sum_a_38__32dd37d9266235bd", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_a_38", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_a_55__ae3a238662cfcfb9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sum_a (a : ℕ → ℝ) (ha1 : a 1 = 1 / 2)\n (ham : ∀ m > 1, a m = a (m - 1) / (2 * m * a (m - 1) + 1)) :\n ∀ k > 0, ∑ i ∈ range k, a (i + 1) = 1 - 1 / (k + 1) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_a_55", "source_license": null, "theorem_names": ["sum_a"], "statement_sha256": "ae3a238662cfcfb96854696438e6be757e2f0435bc08cb865d152adfd3929434", "task_path": "tasks/rl_align__o_proofs_sum_a_55__ae3a238662cfcfb9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_a_55", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_a_7__fe1649e2c679dca6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_a (n : ℕ) (hn : 0 < n) (a : Fin n → ℝ)\n (ha : ∀ i, 0 < a i) (h3 : ∑ i, (a i)^3 = 3) (h5 : ∑ i, (a i)^5 = 5) :\n 3 / 2 ≤ ∑ i, a i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_a_7", "source_license": null, "theorem_names": ["sum_a"], "statement_sha256": "fe1649e2c679dca65de97a555a7f2356336c8497f4c8048b65ec6477ce020391", "task_path": "tasks/rl_align__o_proofs_sum_a_7__fe1649e2c679dca6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_a_7", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_a_b_6__3a0700d5e422d61d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem sum_a_b {n : ℕ} (hn : 0 < n) (a b : Fin n → ℕ)\n (hsum : ∑ i : Fin n, a i = n ∧ ∑ i : Fin n, b i = n)\n (hprod : ∀ i : Fin n, a i * b i ≤ n) :\n ∑ i : Fin n, a i * b i ≤ n * sqrt n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_a_b_6", "source_license": null, "theorem_names": ["sum_a_b"], "statement_sha256": "3a0700d5e422d61d1134cadcbf377cbc6ba8a24d665022dde5e3f8468811bc51", "task_path": "tasks/rl_align__o_proofs_sum_a_b_6__3a0700d5e422d61d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_a_b_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_abs_diff_le_n2__b41f690c892fa661", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem sum_abs_diff_le_n2 (n : ℕ) (x : Fin n → ℝ) (h : ∀ i : Fin n, 0 ≤ x i ∧ x i ≤ 2) :\n (∑ i, ∑ j, |x i - x j|) ≤ n ^ 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_abs_diff_le_n2", "source_license": null, "theorem_names": ["sum_abs_diff_le_n2"], "statement_sha256": "b41f690c892fa6618f9808d35f93495e394580891b06b13552bfd91eda8355bb", "task_path": "tasks/rl_align__o_proofs_sum_abs_diff_le_n2__b41f690c892fa661", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_abs_diff_le_n2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_converges__91ec4421712839a4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem sum_converges (a : ℕ → ℝ) :\n Summable a → Summable (λ n => a n / n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_converges", "source_license": null, "theorem_names": ["sum_converges"], "statement_sha256": "91ec4421712839a46bd0477b139a9a2170b3d9d6e861dfd2870e7b8cbe3483c1", "task_path": "tasks/rl_align__o_proofs_sum_converges__91ec4421712839a4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_converges", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_dif__e032f62cec18337e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem sum_dif : ∑ n ∈ Icc 1 2000, (Nat.divisors n).card =\n ∑ n ∈ Icc 1 2000, Nat.floor (2000 / n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_dif", "source_license": null, "theorem_names": ["sum_dif"], "statement_sha256": "e032f62cec18337e2464fb37b50aea30eb202ae866cf6c806afb5cc1d5602688", "task_path": "tasks/rl_align__o_proofs_sum_dif__e032f62cec18337e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_dif", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_f_8__048ac8c86caf45d6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped BigOperators Topology\n\n\ntheorem sum_f (f : ℕ → ℝ) (hf : ∀ n, f n = 2 ^ n / (n ^ 3 + 1)) :\n ¬ Summable f := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_f_8", "source_license": null, "theorem_names": ["sum_f"], "statement_sha256": "048ac8c86caf45d61bd9046d038c721721fa1e91f1e24a355bed307dc4927acd", "task_path": "tasks/rl_align__o_proofs_sum_f_8__048ac8c86caf45d6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_f_8", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_infinite_156__48c5e461e5b7d67b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem sum_infinite : ∑' n : ℕ, (n^2 - 2)/(Nat.factorial n) = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_infinite_156", "source_license": null, "theorem_names": ["sum_infinite"], "statement_sha256": "48c5e461e5b7d67ba15d03bab3076ad90613c7c3b7ffd2b4c8cc44e60697cfbc", "task_path": "tasks/rl_align__o_proofs_sum_infinite_156__48c5e461e5b7d67b", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_infinite_156", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_infinite_series_33__f391d149e60544f4", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem sum_infinite_series (a : ℕ → ℝ)\n (h₀ : ∀ n, a n = (-1 : ℝ)^n * n * 4^(n - 1) / 6^(n + 1)) :\n ∑' n, a n = -1 / 100 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_infinite_series_33", "source_license": null, "theorem_names": ["sum_infinite_series"], "statement_sha256": "f391d149e60544f4cd6a90f1e0b5b576ac7fcf77ac48ecdc1bc1c832206696c6", "task_path": "tasks/rl_align__o_proofs_sum_infinite_series_33__f391d149e60544f4", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_infinite_series_33", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_k_53__026c6b6f89c74a39", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem sum_k : ∑ k ∈ Icc 1 99, Nat.factorial k * (k ^ 2 + k + 1) = 100 * Nat.factorial 100 - 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_k_53", "source_license": null, "theorem_names": ["sum_k"], "statement_sha256": "026c6b6f89c74a391cdd379a30853e29543fa185d234df344c973311c89e9276", "task_path": "tasks/rl_align__o_proofs_sum_k_53__026c6b6f89c74a39", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_k_53", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_k_95__0e670c63450a61bf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem sum_k : ∑ k ∈ range 101, (Nat.choose 100 k) / (k + 1) = (2 ^ 101 - 1) / 101 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_k_95", "source_license": null, "theorem_names": ["sum_k"], "statement_sha256": "0e670c63450a61bf40680ad5f1f9d23e31112f7c65180f1fb7750ebf86f0ad61", "task_path": "tasks/rl_align__o_proofs_sum_k_95__0e670c63450a61bf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_k_95", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_le_prod__27f9922e04963fdc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sum_le_prod {n : ℕ} (hn : 0 < n) (a b : Fin n → ℝ)\n (ha : ∀ i, 0 < a i) (hb : ∀ i, 0 < b i)\n (h1 : ∑ i, a i = ∏ i, a i) (h2 : ∀ i, a i ≤ b i) :\n ∑ i, b i ≤ ∏ i, b i := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_le_prod", "source_license": null, "theorem_names": ["sum_le_prod"], "statement_sha256": "27f9922e04963fdca0e93870e3a24ba704504e0f9cfbdf965b7010a37dd79ec0", "task_path": "tasks/rl_align__o_proofs_sum_le_prod__27f9922e04963fdc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_le_prod", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_13_perfect_fourth_powers__13f829b091966161", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_13_perfect_fourth_powers (a : Fin 13 → ℤ) (ha : ∀ i, ∃ x, a i = x ^ 4) :\n ∑ i, a i ≠ 1598 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_13_perfect_fourth_powers", "source_license": null, "theorem_names": ["sum_of_13_perfect_fourth_powers"], "statement_sha256": "13f829b09196616182a71bf8fe616dd3d300ed3f3bee9100ab678f1c93cd6bec", "task_path": "tasks/rl_align__o_proofs_sum_of_13_perfect_fourth_powers__13f829b091966161", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_13_perfect_fourth_powers", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_3D__5a56f3a7617e6b8b", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\ntheorem sum_of_3D (n : ℕ) (hn : 0 < n) (t : ℝ) :\n ∑ k ∈ Icc 1 n, (k / n : ℝ) * Nat.choose n k * t ^ k * (1 - t) ^ (n - k) = t := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_3D", "source_license": null, "theorem_names": ["sum_of_3D"], "statement_sha256": "5a56f3a7617e6b8bb9df856d092c00b40ea2f795b8367b42633b2ce729bac617", "task_path": "tasks/rl_align__o_proofs_sum_of_3D__5a56f3a7617e6b8b", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_3D", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_a_20__fbb77b45a0860c46", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sum_of_a (n : ℕ) (hn : n ≥ 3) (a : ℕ → ℝ)\n (ha : ∀ i ∈ Icc 1 n, 0 < a i) :\n ∑ i ∈ Icc 1 n, a i / (∑ j ∈ Icc 1 n, if j ≠ i then a j else 0) ≥\n n / (n - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_a_20", "source_license": null, "theorem_names": ["sum_of_a"], "statement_sha256": "fbb77b45a0860c469fe8f71e5815197c6161c3bc38a7863c7cd256cffc9741d3", "task_path": "tasks/rl_align__o_proofs_sum_of_a_20__fbb77b45a0860c46", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_a_20", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_a_5__8579469bd604689d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sum_of_a (n : ℕ) (hn : 0 < n) (a : ℕ → ℝ)\n (ha : ∀ i ∈ Icc 1 n, 0 < a i) (hsum : ∑ i ∈ Icc 1 n, a i = 1) :\n ∑ m ∈ Icc 1 n, a m / ∏ k ∈ Icc 1 m, (1 + a k) ≤ 1 - 1 / 2 ^ n := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_a_5", "source_license": null, "theorem_names": ["sum_of_a"], "statement_sha256": "8579469bd604689d9c3ca9aa5d1784996f37489f206f6e25f58d5051acee7757", "task_path": "tasks/rl_align__o_proofs_sum_of_a_5__8579469bd604689d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_a_5", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_binear_coeff__08465b2b785b7463", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem sum_of_binear_coeff (n : ℕ) :\n ∑ r ∈ range (n + 1), Nat.choose (2 * n) r =\n 2 ^ (2 * n - 1) + (Nat.choose (2 * n) n) / 2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_binear_coeff", "source_license": null, "theorem_names": ["sum_of_binear_coeff"], "statement_sha256": "08465b2b785b74636a95c3efed442d4d908dc21173abc47b7234de77b2c0c1ae", "task_path": "tasks/rl_align__o_proofs_sum_of_binear_coeff__08465b2b785b7463", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_binear_coeff", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_bionmialCoeffs__3d789d114c033238", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_bionmialCoeffs :\n (∑' a : ℕ, ∑' b : ℕ, if (Even (a + b) ∧ a + b < 100) then Nat.choose a b else 0) % 144 = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_bionmialCoeffs", "source_license": null, "theorem_names": ["sum_of_bionmialCoeffs"], "statement_sha256": "3d789d114c033238e27732b89136db921d2aed5c096b375be97717f42d052d86", "task_path": "tasks/rl_align__o_proofs_sum_of_bionmialCoeffs__3d789d114c033238", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_bionmialCoeffs", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_c_4__bc6dbe734e5929b1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_c (s : Set ℕ) (hs : s = {c : ℕ | ∃ a b : ℕ, 0 < a ∧ 0 < b ∧ 0 < c ∧ Nat.Prime b ∧ Nat.Prime c ∧ 4 * a ^ 2 = 4 * c ^ 2 - 225 * b ^ 2}) :\n ∑ᶠ x ∈ s, x = 130 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_c_4", "source_license": null, "theorem_names": ["sum_of_c"], "statement_sha256": "bc6dbe734e5929b1a54e572b8ae7455a085188ca3e556f56198248dd854d8f91", "task_path": "tasks/rl_align__o_proofs_sum_of_c_4__bc6dbe734e5929b1", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_c_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_differences_13__f4c8fe0904f20826", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_differences (φ : ℕ → ℝ) (k : ℕ) :\n ∑' i : ℕ, ∑' j : ℕ,\n (if i + j = k + 1 then φ i - φ j else 0) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_differences_13", "source_license": null, "theorem_names": ["sum_of_differences"], "statement_sha256": "f4c8fe0904f20826b1e4560717867f37820b51eac7f2e8512d80770ef28bd3f4", "task_path": "tasks/rl_align__o_proofs_sum_of_differences_13__f4c8fe0904f20826", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_differences_13", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_diffs_2__08230852eb2e6467", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sum_of_diffs {n : ℕ} (hn : 2 ≤ n) (a : ℕ → ℝ)\n (ha : ∑ k ∈ Icc 1 n, a k = 1) (hpos : ∀ k ∈ Icc 1 n, 0 < a k)\n (b : ℝ) (hb : b = ∑ k ∈ Icc 1 n, k * a k) :\n ∑ i ∈ Icc 1 n, ∑ j ∈ Icc 1 n, (if (i < j) then (i - j)^2 * a i * a j else 0) ≤\n (n - b) * (b - 1) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_diffs_2", "source_license": null, "theorem_names": ["sum_of_diffs"], "statement_sha256": "08230852eb2e64678fd87f28b1101d22373b68626b603efbe930039aa43ee1d1", "task_path": "tasks/rl_align__o_proofs_sum_of_diffs_2__08230852eb2e6467", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_diffs_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_even_n_choose__432af1bb76bb0f32", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_even_n.choose : ∑ i ∈ Finset.range 51, Nat.choose 100 (2 * i) = 2 ^ 99 ∧\n ∃ z : ℂ, z.re = ∑ i ∈ Finset.range 51, Nat.choose 100 (2 * i) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_even_n_choose", "source_license": null, "theorem_names": ["sum_of_even_n.choose"], "statement_sha256": "432af1bb76bb0f324eda427471bc99b1aeaf385ff7853cf665ff59442274db58", "task_path": "tasks/rl_align__o_proofs_sum_of_even_n_choose__432af1bb76bb0f32", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_even_n_choose", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_exponents_eq_34__9646d36b46f864ef", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem sum_of_exponents_eq_34 :\n ∃ r : ℕ, ∃ n : Fin r → ℕ, ∃ a : Fin r → ℤ,\n (∀ i : Fin r, a i = 0 ∨ a i = 1 ∨ a i = -1) ∧\n (∀ i j : Fin r, i ≠ j → n i ≠ n j) ∧\n (∀ i j : Fin r, i ≠ j → n i ≠ n j) ∧\n (∑ i : Fin r, a i * 3 ^ n i) = 2009 ∧\n ∑ i : Fin r, n i = 34 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_exponents_eq_34", "source_license": null, "theorem_names": ["sum_of_exponents_eq_34"], "statement_sha256": "9646d36b46f864efcfc993c992beaf0ae0158a50966195094aa08b61ed3fa8e8", "task_path": "tasks/rl_align__o_proofs_sum_of_exponents_eq_34__9646d36b46f864ef", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_exponents_eq_34", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_factorial_63__cf1e7946af38ebd5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem sum_of_factorial : ∑ i ∈ range 2021, (i + 1) * Nat.factorial (i + 1) ≡ 2025 [ZMOD 2026] := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_factorial_63", "source_license": null, "theorem_names": ["sum_of_factorial"], "statement_sha256": "cf1e7946af38ebd56d9986436b67253f3034b614f3bd4ddb0f86f9ad9444ef1d", "task_path": "tasks/rl_align__o_proofs_sum_of_factorial_63__cf1e7946af38ebd5", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_factorial_63", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_inferred_2__e974015a642b7e8d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_inferred (s : Set ℤ) (hs : s = {x | x < 0 ∧ 2 * x - 3 ≥ -11}) :\n ∑ᶠ x ∈ s, x = -10 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_inferred_2", "source_license": null, "theorem_names": ["sum_of_inferred"], "statement_sha256": "e974015a642b7e8dac1c2e8837c413beacdcc0ef72685ad93f207c1277c426a7", "task_path": "tasks/rl_align__o_proofs_sum_of_inferred_2__e974015a642b7e8d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_inferred_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_infinite_series_9__9f6ec375e4abe9e9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped BigOperators Topology\n\n\ntheorem sum_of_infinite_series : ∃ r : ℕ → ℚ, (∑' n : ℕ, |r n|) = ∑' n : ℕ, 1 / (Nat.factorial n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_infinite_series_9", "source_license": null, "theorem_names": ["sum_of_infinite_series"], "statement_sha256": "9f6ec375e4abe9e94f2100cc0c3044728018afb2126fce2bd435958342206794", "task_path": "tasks/rl_align__o_proofs_sum_of_infinite_series_9__9f6ec375e4abe9e9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_infinite_series_9", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_k_23__d98500809690e558", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_k : ∑ᶠ k ∈ {x | Nat.choose 23 4 + Nat.choose 23 5 = Nat.choose 24 x}, k = 24 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_k_23", "source_license": null, "theorem_names": ["sum_of_k"], "statement_sha256": "d98500809690e55808e5b4c64b2e658e18c82fed6d69867d8b5f205121626cd5", "task_path": "tasks/rl_align__o_proofs_sum_of_k_23__d98500809690e558", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_k_23", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_nat_choose_4__f058255aa5902d51", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem sum_of_nat.choose : ∑ k ∈ range 101, Nat.choose 300 (3 * k) = (2 ^ 300 + 2) / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_nat_choose_4", "source_license": null, "theorem_names": ["sum_of_nat.choose"], "statement_sha256": "f058255aa5902d5150a1bede43df01ad63fa7eae578badcc6cabbc8d35165902", "task_path": "tasks/rl_align__o_proofs_sum_of_nat_choose_4__f058255aa5902d51", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_nat_choose_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_non_const__8d2b3ccf733f454e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Polynomial\n\ntheorem sum_of_non_const (p : ℝ[X]) (hp : p = 3*(3*X^7 + 8*X^4 - 7) + 7*(X^5 - 7*X^2 + 5)) :\n ∑ᶠ n ∈ {n | n > 0 ∧ p.coeff n ≠ 0}, p.coeff n = -9 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_non_const", "source_license": null, "theorem_names": ["sum_of_non_const"], "statement_sha256": "8d2b3ccf733f454e75177df6f7bc5d95fbc24a093c453f9d4e4abd71f5f911c3", "task_path": "tasks/rl_align__o_proofs_sum_of_non_const__8d2b3ccf733f454e", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_non_const", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_pascals_triangle__fe22b25904601c58", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem sum_of_pascals_triangle : ∑ i ∈ range 673, Nat.choose 2016 (3 * i) = (2 ^ 2016 + 2) / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_pascals_triangle", "source_license": null, "theorem_names": ["sum_of_pascals_triangle"], "statement_sha256": "fe22b25904601c58d65f9278d5b152bb8fec31d3e6953c59d4218c5374b919f7", "task_path": "tasks/rl_align__o_proofs_sum_of_pascals_triangle__fe22b25904601c58", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_pascals_triangle", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_roots_150__a74a618ef52b9773", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem sum_of_roots (roots : Set ℝ) (hroots : roots = {x : ℝ | ⌊x ^ 2⌋ - 2 * x + 1 = 0}) :\n ∑ᶠ x ∈ roots, x = 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_roots_150", "source_license": null, "theorem_names": ["sum_of_roots"], "statement_sha256": "a74a618ef52b9773d38bc381f6ce5e91cddda822b0fd1c737ef4cec6c5aad617", "task_path": "tasks/rl_align__o_proofs_sum_of_roots_150__a74a618ef52b9773", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_roots_150", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_roots_181__a1959b2ef57359d7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem sum_of_roots (S : Set ℝ)(hS : S = { x : ℝ | x^2 + 4*x + 12 ≠ 0 ∧ 2*x^2 + 5*x + 13 ≠ 0 ∧(4*x^2 + 15*x + 17)/(x^2 + 4*x + 12) = (5*x^2 + 16*x + 18)/(2*x^2 + 5*x + 13) }):\n ∑ᶠ x ∈ S, x = -11/3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_roots_181", "source_license": null, "theorem_names": ["sum_of_roots"], "statement_sha256": "a1959b2ef57359d7472332d295ee3332e29351aae55cc2dcbebe96f7771bbdf2", "task_path": "tasks/rl_align__o_proofs_sum_of_roots_181__a1959b2ef57359d7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_roots_181", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_roots_185__27a99b62cd4f9bdc", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_roots (f : ℝ → ℝ) (hf : f = fun x => 4 * x ^ 4 - 3 * x ^ 2 + 7 * x - 3) :\n ∃ k : ℤ, ∑ᶠ x ∈ {x | f x = 0}, x = k ∧ k = -1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_roots_185", "source_license": null, "theorem_names": ["sum_of_roots"], "statement_sha256": "27a99b62cd4f9bdc827ce38d5f8d46eca76079f1390afe1031f2ee7d587c975e", "task_path": "tasks/rl_align__o_proofs_sum_of_roots_185__27a99b62cd4f9bdc", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_roots_185", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_sequence_8__78e013c7caaab7d9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sum_of_sequence {a : ℕ → ℝ}\n (ha1 : a 1 = 1 / 2)\n (han : ∀ n ≥ 1, a (n + 1) = (a n)^2 / (a n^2 - a n + 1)) :\n ∀ n > 0, ∑ i ∈ Icc 1 n, a i < 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_sequence_8", "source_license": null, "theorem_names": ["sum_of_sequence"], "statement_sha256": "78e013c7caaab7d92ed5246e101c8d4c7bc571425eab86b2a7cd085b8a279954", "task_path": "tasks/rl_align__o_proofs_sum_of_sequence_8__78e013c7caaab7d9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_sequence_8", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_set_2__2000403f77b75fe2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_set (A B C : Set ℕ)\n (hA : A = {x | 0 < x}) (hB : B = {x | x ≤ 20}) (hC : C = {x | Even x}) :\n ∑ᶠ x ∈ A ∩ B ∩ C, x = 110 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_set_2", "source_license": null, "theorem_names": ["sum_of_set"], "statement_sha256": "2000403f77b75fe24cbdadcf6113fb65485344981a79746ac8d1e4c5792ae592", "task_path": "tasks/rl_align__o_proofs_sum_of_set_2__2000403f77b75fe2", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_set_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_solutions_335__7e8f4bfd0c9662ae", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_solutions (S : Set ℝ) (hS : S = {x | x = abs (2 * x - abs (60 - 2 * x))}) :\n ∑ᶠ x ∈ S, x = 92 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_solutions_335", "source_license": null, "theorem_names": ["sum_of_solutions"], "statement_sha256": "7e8f4bfd0c9662aea67d9e622f5e0731805e05b820fbe05fb1397c9777f8bfc9", "task_path": "tasks/rl_align__o_proofs_sum_of_solutions_335__7e8f4bfd0c9662ae", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_solutions_335", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_solutions_79__7132250ab3aff7e2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_solutions (S : Set ℝ) (hS : S = {x : ℝ | abs x * abs (x - 5) = 3}) :\n ∑ᶠ x ∈ S, x = 10 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_solutions_79", "source_license": null, "theorem_names": ["sum_of_solutions"], "statement_sha256": "7132250ab3aff7e2e0a036800c421817790560e12dcace6b86684872d42b7d2d", "task_path": "tasks/rl_align__o_proofs_sum_of_solutions_79__7132250ab3aff7e2", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_solutions_79", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_squares_15__e32c351f58fe896c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem sum_of_squares (n : ℕ) :\n ∑ i ∈ range (n + 1), (Nat.choose n i)^2 = Nat.choose (2 * n) n := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_squares_15", "source_license": null, "theorem_names": ["sum_of_squares"], "statement_sha256": "e32c351f58fe896cba21be0e76b335c6bc91ac7f9cac8b8b6108df45510ef374", "task_path": "tasks/rl_align__o_proofs_sum_of_squares_15__e32c351f58fe896c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_squares_15", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_squares_309__4f6a91cc5278e6a9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem sum_of_squares : (∑ k ∈ range 2016, k ^ 2 * Nat.choose 2015 k) % 1000 = 80 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_squares_309", "source_license": null, "theorem_names": ["sum_of_squares"], "statement_sha256": "4f6a91cc5278e6a945d5471f16cc615c58e574efbf3fd6e15d9beea21b44732c", "task_path": "tasks/rl_align__o_proofs_sum_of_squares_309__4f6a91cc5278e6a9", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_squares_309", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_squares_328__552a4f43017f315f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\ntheorem sum_of_squares (s : Set ℤ) (hs : s = {n : ℤ | IsSquare (n ^ 2 + 20 * n + 15)}) :\n ∑ᶠ (x ∈ s), x = -40 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_squares_328", "source_license": null, "theorem_names": ["sum_of_squares"], "statement_sha256": "552a4f43017f315ffdbbc1743b6e6f9f3ab1b7deaffe3ad48d1ef082ad038bae", "task_path": "tasks/rl_align__o_proofs_sum_of_squares_328__552a4f43017f315f", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_squares_328", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_squares_at_least_10__b0bde0b504f384df", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem sum_of_squares_at_least_10 (a : Fin 35 → ℤ) (h : ∀ i, abs (a i - a (i + 1)) ≥ 1) : ∑ i, a i ^ 2 ≥ 10 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_squares_at_least_10", "source_license": null, "theorem_names": ["sum_of_squares_at_least_10"], "statement_sha256": "b0bde0b504f384df971b6d9cbeb0f1319d4a0cc78f227f9cc85b3a611bb716ce", "task_path": "tasks/rl_align__o_proofs_sum_of_squares_at_least_10__b0bde0b504f384df", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_squares_at_least_10", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_squares_in_triangle__0cdec06b93fd8acf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib.Geometry.Euclidean.Triangle\nopen scoped EuclideanGeometry\n\n\ntheorem sum_of_squares_in_triangle (A B C : EuclideanSpace ℝ (Fin 2))\n (a b c : ℝ) (h₀ : a = dist B C) (h₁ : b = dist A C) (h₂ : c = dist A B)\n (h₃ : a + b > c) (h₄ : a + c > b) (h₅ : b + c > a) (h₆ : a + b + c = 3) :\n (b^2 + c^2)/(4*a^2 + 2) + (c^2 + a^2)/(4*b^2 + 2) +\n (a^2 + b^2)/(4*c^2 + 2) ≥ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_squares_in_triangle", "source_license": null, "theorem_names": ["sum_of_squares_in_triangle"], "statement_sha256": "0cdec06b93fd8acffcca30289d2f4529ecd3a40ae80e90b440198f01dd341855", "task_path": "tasks/rl_align__o_proofs_sum_of_squares_in_triangle__0cdec06b93fd8acf", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_of_squares_in_triangle", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_squares_not_divisible__a62a3627b79d0a43", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_squares_not_divisible (a : Fin 9 → ℤ) (h : ∀ i, ¬ 3 ∣ a i) :\n ∑ i, a i ^ 2 ≡ 0 [ZMOD 3] := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_squares_not_divisible", "source_license": null, "theorem_names": ["sum_of_squares_not_divisible"], "statement_sha256": "a62a3627b79d0a43752a7311c1c095625b13365a53676a53f5705ce50c9372d5", "task_path": "tasks/rl_align__o_proofs_sum_of_squares_not_divisible__a62a3627b79d0a43", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_squares_not_divisible", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_squares_of_medians__a773d919c8799911", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem sum_of_squares_of_medians (A B C : EuclideanSpace ℝ (Fin 2))\n (h₀ : dist A B = 10) (h₁ : dist A C = 10) (h₂ : dist B C = 12) :\n (dist (midpoint ℝ A B) C)^2 + (dist (midpoint ℝ A C) B)^2 +\n (dist (midpoint ℝ B C) A)^2 = 258 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_squares_of_medians", "source_license": null, "theorem_names": ["sum_of_squares_of_medians"], "statement_sha256": "a773d919c8799911dc943fa6ecdf2e5a9f372abd12a28ec3730035eb753e1d30", "task_path": "tasks/rl_align__o_proofs_sum_of_squares_of_medians__a773d919c8799911", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_squares_of_medians", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_x_17__121f014db81a230f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_x (S : Set ℝ) (hS : S = {x | Real.sqrt ((x + 2) ^ 2) = 6}) :\n ∑ᶠ x ∈ S, x = -4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_x_17", "source_license": null, "theorem_names": ["sum_of_x"], "statement_sha256": "121f014db81a230f2e1b69a3facd565a87ad3ae8bed43de5fd59ba3a79daeb89", "task_path": "tasks/rl_align__o_proofs_sum_of_x_17__121f014db81a230f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_x_17", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_of_x_20__954153c6974521cf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem sum_of_x (S : Set ℝ) (hS : S = {x | abs (x ^ 2 - 12 * x + 34) = 2}) :\n ∑ᶠ x ∈ S, x = 18 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_x_20", "source_license": null, "theorem_names": ["sum_of_x"], "statement_sha256": "954153c6974521cf89c44e2827861cdf6e6cc4a5d87e25e4508bb018b3766c00", "task_path": "tasks/rl_align__o_proofs_sum_of_x_20__954153c6974521cf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_of_x_20", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_powers_eq_one_or_zero__cbb5cb751240e0d5", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem sum_powers_eq_one_or_zero (n : ℕ) (hn : n > 1) (x : Fin n → ℝ) (h : ∀ k : ℕ, k ≥ 1 → ∑ i, (x i)^k = ∑ i, (x i)^1) : ∀ i, x i = 0 ∨ x i = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_powers_eq_one_or_zero", "source_license": null, "theorem_names": ["sum_powers_eq_one_or_zero"], "statement_sha256": "cbb5cb751240e0d52fc8121fe41a4966f031d4714e5b7c8c242a0e54d1c2dcb4", "task_path": "tasks/rl_align__o_proofs_sum_powers_eq_one_or_zero__cbb5cb751240e0d5", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_powers_eq_one_or_zero", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_seq_13__969643d14ff3c58c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem sum_seq {x : ℕ → ℝ}\n (hx1 : x 1 = 1 / 2)\n (hxn : ∀ n ≥ 2, x n = x (n - 1) / (2 * n * x (n - 1) + 1)) :\n ∑ i ∈ Icc 1 2018, x i = 2018 / 2019 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_seq_13", "source_license": null, "theorem_names": ["sum_seq"], "statement_sha256": "969643d14ff3c58ceedb9618d7adcaa2ea2ff54eb5b024fa09a66d93713854d7", "task_path": "tasks/rl_align__o_proofs_sum_seq_13__969643d14ff3c58c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_seq_13", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_series_24__d08adad0d11ce3c8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Filter Function\nopen scoped BigOperators Topology\n\ntheorem sum_series (f : ℕ → ℝ)\n (h₀ : ∀ n, f n = n * (n + 1) * exp π - n) :\n ¬ Summable f := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_series_24", "source_license": null, "theorem_names": ["sum_series"], "statement_sha256": "d08adad0d11ce3c8439503a68f0ddf00c5528b6e39db8065d12be25b59ee7ff9", "task_path": "tasks/rl_align__o_proofs_sum_series_24__d08adad0d11ce3c8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_series_24", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_series_55__b197bd2a86cb02f6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\n\ntheorem sum_series (n : ℕ) (hn : n ≥ 1) (x : ℕ → ℝ)\n (hx : ∀ i, x i = 1 / (i * n) ^ ((1 : ℝ) / n)) :\n ¬ Summable fun i => |x i ^ n| := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_series_55", "source_license": null, "theorem_names": ["sum_series"], "statement_sha256": "b197bd2a86cb02f6063aedbcf4127a2b6f7ab4cc11c8b42be676c28e4912b315", "task_path": "tasks/rl_align__o_proofs_sum_series_55__b197bd2a86cb02f6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_series_55", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_series_564__a07f648ff8cd069e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem sum_series (b : ℕ → ℝ) (h : ¬ Tendsto b atTop (𝓝 0)) :\n ¬ Summable (λ n => b n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_series_564", "source_license": null, "theorem_names": ["sum_series"], "statement_sha256": "a07f648ff8cd069ef796ee8c0dfc00fb8e89314044362907e06fcecf04cc7d3a", "task_path": "tasks/rl_align__o_proofs_sum_series_564__a07f648ff8cd069e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_series_564", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_series_58__25908e70aeaae4ee", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem sum_series (a : ℕ → ℝ) (h : ¬ Tendsto (λ n => |a n|) atTop (𝓝 0)) :\n ¬ Summable (λ n => a n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_series_58", "source_license": null, "theorem_names": ["sum_series"], "statement_sha256": "25908e70aeaae4ee3c97ba1d6d6031f4b017b70310d15e51d77f0741a261003d", "task_path": "tasks/rl_align__o_proofs_sum_series_58__25908e70aeaae4ee", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_series_58", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_series_623__009d12f6d445b1ff", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem sum_series (a : ℕ+ → ℝ)\n (ha : ∀ j, a j = ((1 + 1 / j.val) ^ (2 * j.val)) / exp j.val) :\n Summable a := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_series_623", "source_license": null, "theorem_names": ["sum_series"], "statement_sha256": "009d12f6d445b1ff5d4df17fc8d5333d4dfa2391f858616686936b776e332226", "task_path": "tasks/rl_align__o_proofs_sum_series_623__009d12f6d445b1ff", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_series_623", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_sum__688c8b5d338a34e7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real Nat\n\n\ntheorem sum_sum (a b : ℝ) (hb : b ≠ 0) (n : ℕ) :\n ∑ r ∈ Icc 1 n, ∑ i ∈ range (n - r + 1), Nat.choose (n - r) i * a^(r + i - 1) * b^(n - (r + i)) =\n ((a + b)^n - a^n) / b := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_sum", "source_license": null, "theorem_names": ["sum_sum"], "statement_sha256": "688c8b5d338a34e7ee624c0af53a5f029281075d8f60b466af06d8c575538582", "task_path": "tasks/rl_align__o_proofs_sum_sum__688c8b5d338a34e7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_sum_sum", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_sum_value_33__ee54465219daf4a7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\ntheorem sum_value : ∑ i ∈ Icc 1 100, ∑ j ∈ Icc 1 i, ∑ k ∈ Icc 1 j, ∑ m ∈ Icc 1 k, 1 = Nat.choose 103 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_value_33", "source_license": null, "theorem_names": ["sum_value"], "statement_sha256": "ee54465219daf4a7c715e9745f5287e51a1ffd3245a48e3ad3dcc65f3ce254f7", "task_path": "tasks/rl_align__o_proofs_sum_value_33__ee54465219daf4a7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_sum_value_33", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_t_12__5b36818695b5d2aa", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset\n\n\ntheorem t {n : ℕ} (hn : 0 < n) (A : Matrix (Fin n) (Fin n) ℝ)\n (hA : ∀ i j, A i j = 0 ∨ A i j = 1) :\n {T : Finset (Fin n × Fin n) | T.card = n - 1 ∧\n (∀ i ∈ T, A i.1 i.2 = 1)}.ncard =\n ∑ T ∈ {T : Finset (Fin n × Fin n) | T.card = n - 1 ∧\n (∀ i ∈ T, A i.1 i.2 = 1)}, (∏ i ∈ T, A i.1 i.2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_t_12", "source_license": null, "theorem_names": ["t"], "statement_sha256": "5b36818695b5d2aa4079dfb4376fd1f9891fcee0fb3fdc27a7b14c745f96d108", "task_path": "tasks/rl_align__o_proofs_t_12__5b36818695b5d2aa", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_t_12", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_t_2__82087fdef332ce2c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\ntheorem t: ∫ x in (-π/2)..(π/2), sin (4*x) + cos (4*x) = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_t_2", "source_license": null, "theorem_names": ["t"], "statement_sha256": "82087fdef332ce2c8317f06038edacc924aff40d5bab8721661d5fa0920a45e4", "task_path": "tasks/rl_align__o_proofs_t_2__82087fdef332ce2c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_t_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_tan_products_3__a7ec373a09554fa6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem tan_products {n : ℕ} (hn : 0 < n) (x : Fin n → ℝ)\n (h : ∏ i, tan (x i) = 1) :\n ∏ i, sin (x i) ≤ 1 / 2 ^ (n / 2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_tan_products_3", "source_license": null, "theorem_names": ["tan_products"], "statement_sha256": "a7ec373a09554fa6612c531d6728103da911416edfcad57dedde9f0b4456a410", "task_path": "tasks/rl_align__o_proofs_tan_products_3__a7ec373a09554fa6", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_tan_products_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_tangent_segment_length_2__328bf48a5bb2e0cf", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem tangent_segment_length (C₁ : ℝ × ℝ → Prop) (C₂ : ℝ × ℝ → Prop)\n (h₁ : ∀ x y, C₁ (x, y) ↔ (x - 8) ^ 2 + y ^ 2 = 25)\n (h₂ : ∀ x y, C₂ (x, y) ↔ (x + 10) ^ 2 + y ^ 2 = 64) :\n ∃ (R S : ℝ × ℝ), C₁ R ∧ C₂ S ∧ dist R S = 1440 / 169 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_tangent_segment_length_2", "source_license": null, "theorem_names": ["tangent_segment_length"], "statement_sha256": "328bf48a5bb2e0cf20f3bf338c91f802618f1d8f7fe684a77aac2c740bcc05b4", "task_path": "tasks/rl_align__o_proofs_tangent_segment_length_2__328bf48a5bb2e0cf", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_tangent_segment_length_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_tangent_slope_angle_4__e834401424773350", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem tangent_slope_angle (f : ℝ → ℝ) (hf : DifferentiableAt ℝ f 1)\n(h : Filter.Tendsto (fun Δx => (f (1 + 2 * Δx) - f (1 - Δx)) / Δx) (𝓝[≠] 0) (𝓝 3)) :\nReal.arctan (deriv f 1) = Real.pi / 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_tangent_slope_angle_4", "source_license": null, "theorem_names": ["tangent_slope_angle"], "statement_sha256": "e8344014247733507d6363eb71845b619e32e25a7f06f68897f354919f2f6178", "task_path": "tasks/rl_align__o_proofs_tangent_slope_angle_4__e834401424773350", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_tangent_slope_angle_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_taylorPolynomial_4__831b95834076e0cd", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\n\ntheorem taylorPolynomial (f : ℝ → ℝ) (hf : f = fun x => 4 * x ^ 2 - 9 * x + 1) :\n ∃ p : Polynomial ℝ, p.degree = 2 ∧ ∀ x, p.eval x = f x ∧ p.coeff 2 = 4 ∧ p.coeff 1 = -9 ∧ p.coeff 0 = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_taylorPolynomial_4", "source_license": null, "theorem_names": ["taylorPolynomial"], "statement_sha256": "831b95834076e0cd174f082f0778f502b9b0f21815b0891d53ec7555623d15a7", "task_path": "tasks/rl_align__o_proofs_taylorPolynomial_4__831b95834076e0cd", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_taylorPolynomial_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_tetra_6__0cfc5116a2fa9bec", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem tetra (P A B C : EuclideanSpace ℝ (Fin 3))\n (x y z : ℝ)\n (h₀ : x = dist (midpoint ℝ P A) (midpoint ℝ B C))\n (h₁ : y = dist (midpoint ℝ P B) (midpoint ℝ A C))\n (h₂ : z = dist (midpoint ℝ P C) (midpoint ℝ A B))\n (h₃ : (dist P A)^2 + (dist P B)^2 + (dist P C)^2 +\n (dist A B)^2 + (dist A C)^2 + (dist B C)^2 = 300) :\n x^2 + y^2 + z^2 = 75 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_tetra_6", "source_license": null, "theorem_names": ["tetra"], "statement_sha256": "0cfc5116a2fa9becc5722b089d3c8d2d9949a5f63da5d52b3f70102561140bc2", "task_path": "tasks/rl_align__o_proofs_tetra_6__0cfc5116a2fa9bec", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_tetra_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_tetrahedron_mass__53713d703628305a", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem tetrahedron_mass (f : ℝ → ℝ → ℝ → ℝ)\n (h₀ : f = λ x y z => x * y) :\n ∫ x in (0)..1, ∫ y in (0)..(1 - x), ∫ z in (0)..(1 - x - y),\n f x y z = 1 / 120 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_tetrahedron_mass", "source_license": null, "theorem_names": ["tetrahedron_mass"], "statement_sha256": "53713d703628305a6f0c2843acb76ffcf3555b20a66996bdb2df6ab9a4672432", "task_path": "tasks/rl_align__o_proofs_tetrahedron_mass__53713d703628305a", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_tetrahedron_mass", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_10117__047ac468c8f74b45", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (A B C D M P N Q : EuclideanSpace ℝ (Fin 2))\n(hAB : dist A B = 5) (hBC : dist B C = 6) (hCD : dist C D = 7) (hDA : dist D A = 8)\n(hM : M = midpoint ℝ A B) (hP : P = midpoint ℝ B C) (hN : N = midpoint ℝ C D) (hQ : Q = midpoint ℝ D A) :\ndist M N ^ 2 - dist P Q ^ 2 = 13 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_10117", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "047ac468c8f74b45c8f9a3da4d4866088bc1ea914ed2c8fdd0276817e3b5b9ae", "task_path": "tasks/rl_align__o_proofs_theorem_name_10117__047ac468c8f74b45", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_10117", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_11349__66712517730a8a33", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (a : ℝ) : (∃ x₁ x₂ : ℝ, x₁ ≠ x₂ ∧ HasDerivAt (fun x => (1/3)*a*x^3 + x^2 + a*x + 1) 0 x₁ ∧ HasDerivAt (fun x => (1/3)*a*x^3 + x^2 + a*x + 1) 0 x₂) ↔ a ∈ Set.Ioo (-1) 0 ∪ Set.Ioo 0 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_11349", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "66712517730a8a33dacbf4c83a239ca2580da975fc6d0e76863d10ddf16dabd3", "task_path": "tasks/rl_align__o_proofs_theorem_name_11349__66712517730a8a33", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_11349", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_13658__d6a793318bbdd464", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (a : ℝ) :\n (∃ x₁ x₂ : ℝ, x₁ ∈ Set.Ioo (-2:ℝ) 2 ∧ x₂ ∈ Set.Ioo (-2:ℝ) 2 ∧ x₁ ≠ x₂ ∧ deriv (fun x => x^3 - a * x^2 + 3 * a * x + 1) x₁ = 0 ∧ deriv (fun x => x^3 - a * x^2 + 3 * a * x + 1) x₂ = 0) ↔\n a ∈ Set.Ioo (-12/7:ℝ) 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_13658", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "d6a793318bbdd464a5e6f24a9f7d4355018d54528addb3fc20d9b15d38c5eae0", "task_path": "tasks/rl_align__o_proofs_theorem_name_13658__d6a793318bbdd464", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_13658", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_14485__4fd9f7de935db45f", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (n : ℕ) (hn : n ≥ 3) : ∃ (A : Fin n → Finset (Fin n)), (∀ i j : Fin n, i ≠ j → (A i ∩ A j).card ≠ 1) ∧ (∀ i : Fin n, (A i).card = 3) ∧ (∀ i : Fin n, ∀ x ∈ A i, x < n) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_14485", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "4fd9f7de935db45f29281290d92bae5e52040a69088d29050da4868926658e4f", "task_path": "tasks/rl_align__o_proofs_theorem_name_14485__4fd9f7de935db45f", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_14485", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_19223__83b5473128ec61b7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (n : ℕ) (hn : 0 < n) (A : Finset ℤ) (hA : A.card = 2*n - 1) :\n ∃ (a : Fin n → ℤ) (h : ∀ i j, i ≠ j → a i ≠ a j), (Finset.sum Finset.univ (fun i => a i)) % n = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_19223", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "83b5473128ec61b7a19065de492196084becfab7b912b6f5f29053d93703f7c2", "task_path": "tasks/rl_align__o_proofs_theorem_name_19223__83b5473128ec61b7", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_19223", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_19478__286823f2cafdd28d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (t : ℝ) (ht : t > 0 ∧ t ≤ 4) :\n ∀ n : ℕ, ∃ T : Finset (Set (ℝ × ℝ)), T.Nonempty ∧ (∀ Δ ∈ T, ∃ (A B C : ℝ × ℝ), A ∈ Metric.sphere (0, 0) 1 ∧ B ∈ Metric.sphere (0, 0) 1 ∧ C ∈ Metric.sphere (0, 0) 1 ∧ Δ = {A, B, C}) ∧ (∀ Δ₁ ∈ T, ∀ Δ₂ ∈ T, Δ₁ ≠ Δ₂ → (Δ₁ ∩ Δ₂ : Set (ℝ × ℝ)).Nonempty → False) ∧ (∀ Δ ∈ T, ∃ (A B C : ℝ × ℝ), A ∈ Δ ∧ B ∈ Δ ∧ C ∈ Δ ∧ dist A B + dist B C + dist C A > t) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_19478", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "286823f2cafdd28d62d2bc7ff1f6b1ac8d75921102911922e05bb4d616738f51", "task_path": "tasks/rl_align__o_proofs_theorem_name_19478__286823f2cafdd28d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_19478", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_19551__659a0cf90439a458", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (x : ℕ → ℝ)\n (hx0 : x 0 = 0) (hx1 : x 1 = 3 / 2)\n (hx_rec : ∀ n, x (n + 2) = 5 / 2 * x (n + 1) - x n) :\n ∃ (L : ℝ), Filter.Tendsto (fun n => Finset.sum (Finset.range (n + 1)) (fun k => 1 / (x k)^2)) Filter.atTop (𝓝 L) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_theorem_name_19551", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "659a0cf90439a458921b4a2b07a5ed2c4a66d3676cfe54818b529b4dae8a45a7", "task_path": "tasks/rl_align__o_proofs_theorem_name_19551__659a0cf90439a458", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_theorem_name_19551", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_19567__6da3dee2b6dedb48", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (n : ℕ) (hn : 0 < n) : ∃ (S : Finset (Finset ℕ)), S.card = n ∧ ∀ s ∈ S, s.card = 3 ∧ (∀ a ∈ s, 2 ≤ a ∧ a ≤ 3*n+1) ∧ ∀ s ∈ S, ∃ (a b c : ℕ), a ∈ s ∧ b ∈ s ∧ c ∈ s ∧ (a ≤ b ∧ b ≤ c → a^2 + b^2 < c^2) ∧ ∀ s ∈ S, ∀ s' ∈ S, s ≠ s' → s ∩ s' = ∅ := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_theorem_name_19567", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "6da3dee2b6dedb482274a82bc3cddfbc9176f550c758abea8e7d692a065f440d", "task_path": "tasks/rl_align__o_proofs_theorem_name_19567__6da3dee2b6dedb48", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_theorem_name_19567", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_19592__950ac79001df2336", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (A B C D M N : EuclideanSpace ℝ (Fin 2))\n (h₁ : M = (1 / 2 : ℝ) • (A + B)) (h₂ : N = (1 / 2 : ℝ) • (C + D))\n (h₃ : dist A N = dist M D) (h₄ : dist C M = dist B N) :\n dist A C = dist B D := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_19592", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "950ac79001df2336705cfb308734cd89fdb2e6f1e2c6e4a9c44fd9aa511a474a", "task_path": "tasks/rl_align__o_proofs_theorem_name_19592__950ac79001df2336", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_19592", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_2336__4d3112fb00260ab9", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (a : ℝ) (h₀ : 0 < a) (h₁ : a ≠ 1) :\n (∀ x ∈ Set.Ioo (-1/2) 0, deriv (fun x => Real.logb a (x^3 - a * x)) x > 0) →\n 3/4 ≤ a ∧ a ≤ 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_2336", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "4d3112fb00260ab913960f732360b7182889c30f5197b547aa3c9a40390e1b28", "task_path": "tasks/rl_align__o_proofs_theorem_name_2336__4d3112fb00260ab9", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_2336", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_2396__25364a4ae91015c1", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (AB AC BC : ℝ) (h₁ : AB = 1) (h₂ : AC = 1) (h₃ : BC = Real.sqrt 2)\n (color : ℝ × ℝ → ℕ) (h₄ : ∀ p, color p < 4) : ∃ (x y : ℝ × ℝ) (hx : x ≠ y), color x = color y ∧ dist x y ≥ 2 - Real.sqrt 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_2396", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "25364a4ae91015c1aa01f681e1bb381beb44999811673d7ef337ccd551e783d5", "task_path": "tasks/rl_align__o_proofs_theorem_name_2396__25364a4ae91015c1", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_2396", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_2559__e0d0d7ee29ec7776", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (n : ℕ) (a b c : Fin n → ℝ) (h₁ : ∀ i, 0 < a i) (h₂ : ∀ i, 0 < b i) (h₃ : ∀ i, 0 < c i) (h₄ : ∀ i, a i + b i > c i) (h₅ : ∀ i, a i + c i > b i) (h₆ : ∀ i, b i + c i > a i) :\n ∏ i : Fin n, (a i / ((a i + b i + c i) / 2 - a i)) + ∏ i : Fin n, (b i / ((a i + b i + c i) / 2 - b i)) + ∏ i : Fin n, (c i / ((a i + b i + c i) / 2 - c i)) ≥ 3 * (2 / Real.sqrt 3) ^ n := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_theorem_name_2559", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "e0d0d7ee29ec7776ef456a9321a95a0bdbb24148b96c9b24427f4feb6b50da57", "task_path": "tasks/rl_align__o_proofs_theorem_name_2559__e0d0d7ee29ec7776", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_theorem_name_2559", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_366__a4be93e9f59791a0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (k : ℕ) (x : Fin k → ℝ) (h : ∀ i, 0 ≤ x i ∧ x i ≤ 2) :\n ∑ i : Fin k, ∑ j : Fin k, abs (x i - x j) ≤ k^2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_366", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "a4be93e9f59791a0ab14efea6764aaa28590c12876ba449bc15c00d60c8da968", "task_path": "tasks/rl_align__o_proofs_theorem_name_366__a4be93e9f59791a0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_366", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_4967__965926fcbb1d4644", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (f : ℝ → ℝ) (h_even : ∀ x, f x = f (-x)) (h_symm : ∀ x, f (2 + x) = f (2 - x)) (h_zero : ∃ x ∈ Set.Ioo 0 4, f x = 0) (h_f0 : f 0 = 0) : ∃ n ≥ 9, ∃ s : Finset ℝ, s.card = n ∧ (∀ x ∈ s, x ∈ Set.Ioc (-8) 10 ∧ f x = 0) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_theorem_name_4967", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "965926fcbb1d46444a09e3a0b23008239f28464b857af02898318a5b0c879b89", "task_path": "tasks/rl_align__o_proofs_theorem_name_4967__965926fcbb1d4644", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_theorem_name_4967", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_6039__1d89ac0f1ad6f2c8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (x : ℕ) (hx : x > 1) (h : ∀ a b : ℕ, x ∣ a * b → x ∣ a ∨ x ∣ b) : Nat.card (Nat.divisors x) = 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_6039", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "1d89ac0f1ad6f2c8979c32c8336888d7a7d2401d9534d54efc1ee90deb4900d7", "task_path": "tasks/rl_align__o_proofs_theorem_name_6039__1d89ac0f1ad6f2c8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_6039", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_7793__86c6145e220cbb63", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (a : ℝ) (h₁ : deriv (fun x => x^3 - 3 * a * x - 1) (-1) = 0) :\n a = 1 ∧ ∀ x ∈ Set.Icc (-2:ℝ) 1, x^3 - 3 * a * x - 1 ≥ -3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_7793", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "86c6145e220cbb638c5bb59dbf5c0510503690000b8fbd88d085b6b9fc03e49d", "task_path": "tasks/rl_align__o_proofs_theorem_name_7793__86c6145e220cbb63", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_7793", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_8403__9356d6ce7d364710", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (m : ℝ) (h : ∀ x ∈ Set.Icc 1 2, deriv (fun x => (1/3:ℝ) * x^3 - (1/2:ℝ) * m * x^2 + 4 * x - 3) x ≥ 0) : m ≤ 4 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_8403", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "9356d6ce7d3647104ccb810317d567f48f4550131e2217e6dd56e2c04e993821", "task_path": "tasks/rl_align__o_proofs_theorem_name_8403__9356d6ce7d364710", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_8403", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_8764__a31e94b21fd4aa47", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (b : ℝ) (h₁ : ∀ x ∈ Set.Ioo 1 2, deriv (fun x => x^3 - 3 * b * x + 1) x < 0) : b ≥ 4 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_theorem_name_8764", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "a31e94b21fd4aa473ab30db113786fc0675cfc6048bff1644869f75e9fd110cc", "task_path": "tasks/rl_align__o_proofs_theorem_name_8764__a31e94b21fd4aa47", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_theorem_name_8764", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_theorem_name_8__e44f43eff3ce6985", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem theorem_name (m : ℕ) (h : ∃ (a : Fin m → ℕ), (∀ i, 1 < a i) ∧ (∑ i, 1 / (a i : ℚ)) = 1) : ∃ (a : Fin (m + 1) → ℕ), (∀ i, 1 < a i) ∧ (∑ i, 1 / (a i : ℚ)) = 1 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_8", "source_license": null, "theorem_names": ["theorem_name"], "statement_sha256": "e44f43eff3ce6985f62e21dc31a50ccf38a3e97a0911f8b3f0448bab560c9121", "task_path": "tasks/rl_align__o_proofs_theorem_name_8__e44f43eff3ce6985", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_theorem_name_8", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_three_sum_divisible_by_three__950a3d095d805205", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem three_sum_divisible_by_three (S : Finset ℕ) (hS : S.card = 5) : ∃ (T : Finset ℕ), T ⊆ S ∧ T.card = 3 ∧ (↑(T.sum (λ i => i)) : ℤ) % 3 = 0 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_three_sum_divisible_by_three", "source_license": null, "theorem_names": ["three_sum_divisible_by_three"], "statement_sha256": "950a3d095d805205aa47f22aee84672b8b8c428ba4462e96a69e0df9523b639c", "task_path": "tasks/rl_align__o_proofs_three_sum_divisible_by_three__950a3d095d805205", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_three_sum_divisible_by_three", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_time_to_fill_box__341343c82924cd8d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem time_to_fill_box (R : ℝ → ℝ) (hR : ∀ t, R t = 2 * t ^ 2 + 5 * t) :\n ∃ t : ℝ, ∫ x in (0 : ℝ)..t, R x = 5 * 4 * 3 ∧ ∀ s < t, ∫ x in (0 : ℝ)..s, R x < 5 * 4 * 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_time_to_fill_box", "source_license": null, "theorem_names": ["time_to_fill_box"], "statement_sha256": "341343c82924cd8d84290dba9673a6645134a0bcc9ef7ced4f875b0d03ce0240", "task_path": "tasks/rl_align__o_proofs_time_to_fill_box__341343c82924cd8d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_time_to_fill_box", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_total_distance_3__399189a0078c185c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem total_distance (v : ℝ → ℝ) (h : v = λ t => 2 * t - 3)\n (a b : ℝ) (ha : a = 0) (hb : b = 4) :\n ∫ t in (a)..b, abs (v t) = 8.5 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_total_distance_3", "source_license": null, "theorem_names": ["total_distance"], "statement_sha256": "399189a0078c185c9dcd8ab659e81f1189929c09c05075e9c76b2eff2d6ecd40", "task_path": "tasks/rl_align__o_proofs_total_distance_3__399189a0078c185c", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_total_distance_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_total_distance_99__1eb5ffbea922a9d2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem total_distance (f : ℝ → ℝ) (hf : f = fun t => -t^2 + 7 * t + 19) :\n ∫ t in Set.Icc 2 4, |deriv f t| = 2.5 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_total_distance_99", "source_license": null, "theorem_names": ["total_distance"], "statement_sha256": "1eb5ffbea922a9d2dbeefc3ede39ad20fe1ca89547eee75fb70f976a2af6bd60", "task_path": "tasks/rl_align__o_proofs_total_distance_99__1eb5ffbea922a9d2", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_total_distance_99", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_total_length_less_than_11__d4ce02dd796e276e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem total_length_less_than_11 : ∃ (A B C D T : ℝ × ℝ), A = (0, 0) ∧ B = (4, 0) ∧ C = (4, 4) ∧ D = (0, 4) ∧ T = (2, 2 * Real.sqrt 3 / 3) ∧ dist A T + dist B T + dist C T + dist D T < 11 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_total_length_less_than_11", "source_license": null, "theorem_names": ["total_length_less_than_11"], "statement_sha256": "d4ce02dd796e276e193dcbb49bbb489309f9a9c11e7111435ee87f531d35669f", "task_path": "tasks/rl_align__o_proofs_total_length_less_than_11__d4ce02dd796e276e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_total_length_less_than_11", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_total_number_of_pairs_2__40ebe1386e197242", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem total_number_of_pairs :\n Set.ncard {p : ℤ × ℤ | p.1 > 0 ∧ p.2 > 0 ∧ p.1 + p.2 ≤ 60} = 1770 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_total_number_of_pairs_2", "source_license": null, "theorem_names": ["total_number_of_pairs"], "statement_sha256": "40ebe1386e19724293c16ee8c209ccbd1e00737c7c2429eccc7cd88085b46a42", "task_path": "tasks/rl_align__o_proofs_total_number_of_pairs_2__40ebe1386e197242", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_total_number_of_pairs_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_total_ways_85__eced7287cbfd4854", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem total_ways :\n (Nat.card {x : Fin 4 → ℕ | x 0 + x 1 + x 2 + x 3 > 0 ∧ x 0 ≤ 3 ∧ x 1 ≤ 4 ∧ x 2 ≤ 1 ∧ x 3 ≤ 1}) = 79 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_total_ways_85", "source_license": null, "theorem_names": ["total_ways"], "statement_sha256": "eced7287cbfd4854654440a369dda1162d68ebcab8b17908bf280f47b71f3b23", "task_path": "tasks/rl_align__o_proofs_total_ways_85__eced7287cbfd4854", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_total_ways_85", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_triangle_368240__aeaf99e510e0ebde", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem triangle_368240 (A B C : EuclideanSpace ℝ (Fin 2))\n (h₀ : dist A B = 1) (h₁ : dist A C = 2)\n (h₂ : dist B C = (dist A (midpoint ℝ B C))) :\n dist B C = sqrt 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_triangle_368240", "source_license": null, "theorem_names": ["triangle_368240"], "statement_sha256": "aeaf99e510e0ebde8438cd7f177fb133f901736b418a1025b2b23a492db128aa", "task_path": "tasks/rl_align__o_proofs_triangle_368240__aeaf99e510e0ebde", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_triangle_368240", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_triangle_94_2__1ddec5c044f4c488", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem triangle_94 (A B C D E : EuclideanSpace ℝ (Fin 2))\n (h₀ : dist A B = sqrt (dist A C ^ 2 + dist B C ^ 2))\n (h₁ : dist A D = 5) (h₂ : dist B E = 2 * sqrt 10)\n (h₃ : D = midpoint ℝ B C) (h₄ : E = midpoint ℝ A C) :\n dist A B = 2 * sqrt 13 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_triangle_94_2", "source_license": null, "theorem_names": ["triangle_94"], "statement_sha256": "068a312b04f3c5b45327d211c16547125d8b65ba9972a1c669148fae4f89358e", "task_path": "tasks/rl_align__o_proofs_triangle_94_2__1ddec5c044f4c488", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_triangle_94_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_triangle_inequality_2__9d0217691860b699", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Real\n\n\ntheorem triangle_inequality {d : Finset ℕ → Finset ℕ → ℝ}\n (hd : ∀ A B, d A B = ∑ x ∈ (A ∪ B) \\ (A ∩ B), (2 : ℝ)^(-x : ℤ)) :\n ∀ A B C, d A B ≤ d A C + d C B := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_triangle_inequality_2", "source_license": null, "theorem_names": ["triangle_inequality"], "statement_sha256": "9d0217691860b699f40808455bdb8dedeb037030d30bfafe5c1cefeaa33a445e", "task_path": "tasks/rl_align__o_proofs_triangle_inequality_2__9d0217691860b699", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_triangle_inequality_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_triangle_midpoint_4__9ad5f11f1272a073", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real\nopen scoped BigOperators\n\n\ntheorem triangle_midpoint (A B C L M : EuclideanSpace ℝ (Fin 2))\n (h₀ : L = midpoint ℝ B C)\n (h₁ : M = midpoint ℝ C A) :\n dist A L = dist B M ↔ dist A C = dist B C := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_triangle_midpoint_4", "source_license": null, "theorem_names": ["triangle_midpoint"], "statement_sha256": "9ad5f11f1272a0736044b35199751bda8180bcd466859e0abea47662ad74a164", "task_path": "tasks/rl_align__o_proofs_triangle_midpoint_4__9ad5f11f1272a073", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_triangle_midpoint_4", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_tripleIntegral_3__342ccb5c60b833e6", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem tripleIntegral : ∫ x in (0)..1, ∫ y in (1)..2, ∫ z in (0)..(x+y), 12 * (4 * x + y + 3 * z) ^ 2 = 1272 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_tripleIntegral_3", "source_license": null, "theorem_names": ["tripleIntegral"], "statement_sha256": "342ccb5c60b833e69f7befb1b0cf6dd282054dc1e3cf40c39ebecba96ac02778", "task_path": "tasks/rl_align__o_proofs_tripleIntegral_3__342ccb5c60b833e6", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_tripleIntegral_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_triple_integral_6__d4503773478e76a2", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem triple_integral :\n ∫ x in (0)..1, ∫ y in (0)..(1 - x), ∫ z in (0)..(x + y), (x ^ 2 + y ^ 2 + z ^ 2) = 1 / 5 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_triple_integral_6", "source_license": null, "theorem_names": ["triple_integral"], "statement_sha256": "d4503773478e76a2bce670e3979be233a35ece1f973ac995158db63ddbb29696", "task_path": "tasks/rl_align__o_proofs_triple_integral_6__d4503773478e76a2", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_triple_integral_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_truncated_cone_volume_2__4e42dacc8095880d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem truncated_cone_volume (r1 r2 h : ℝ)\n (hr1 : r1 = 18) (hr2 : r2 = 16) (hh : h = 1) :\n ∫ x in (0)..h, π * (r1 - (x / h) * (r1 - r2)) ^ 2 = 868 * π / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_truncated_cone_volume_2", "source_license": null, "theorem_names": ["truncated_cone_volume"], "statement_sha256": "4e42dacc8095880d5bab7a278b3b32f83af33a7fc22a60e911f5d1a0b54a2559", "task_path": "tasks/rl_align__o_proofs_truncated_cone_volume_2__4e42dacc8095880d", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_truncated_cone_volume_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_uniform_convergence_of_bounded_functions__53dc5832f67e8cd8", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem uniform_convergence_of_bounded_functions (D : Set ℝ) (f : ℕ → ℝ → ℝ) (f_limit : ℝ → ℝ)\n (hD : MetricSpace D)\n (h_bound : ∀ n, ∃ M : ℝ, ∀ x ∈ D, abs (f n x) ≤ M)\n (h_uniform_conv : ∀ ε > 0, ∃ N : ℕ, ∀ n ≥ N, ∀ x ∈ D, abs (f n x - f_limit x) < ε) :\n ∃ M : ℝ, ∀ x ∈ D, abs (f_limit x) ≤ M := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_uniform_convergence_of_bounded_functions", "source_license": null, "theorem_names": ["uniform_convergence_of_bounded_functions"], "statement_sha256": "53dc5832f67e8cd8f9fc9f37a4015dc62d0a5f6eb073f4f2a5c3ccc881ef999f", "task_path": "tasks/rl_align__o_proofs_uniform_convergence_of_bounded_functions__53dc5832f67e8cd8", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_uniform_convergence_of_bounded_functions", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_univ_35__16416aa962a6fd10", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Set Real\n\n\ntheorem univ : (∀ A : ℕ → Set ℝ, (∀ i j, i < j → A i ⊆ A j) ∧ (∀ i, Nonempty (A i)) ∧ (∀ i, Finite (A i)) → ∃ x, ∀ n, x ∈ A n) ∧ (∀ A : ℕ → Set ℝ, (∀ i j, i < j → A i ⊆ A j) ∧ (∀ i, Nonempty (A i)) ∧ (∀ i, Finite (A i)) → Finite (⋂ n, A n)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_univ_35", "source_license": null, "theorem_names": ["univ"], "statement_sha256": "16416aa962a6fd100598e2c7039d64ba3492f7e459b950dd9ae741d30b4c824e", "task_path": "tasks/rl_align__o_proofs_univ_35__16416aa962a6fd10", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_univ_35", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_variance_invariance__9848371037ce7237", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem variance_invariance (n : ℕ) (data : Fin n → ℝ) (c : ℝ) :\n ∑ i, (data i - c - (∑ j, (data j - c)) / n) ^ 2 = ∑ i, (data i - (∑ j, data j) / n) ^ 2 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_variance_invariance", "source_license": null, "theorem_names": ["variance_invariance"], "statement_sha256": "9848371037ce7237589a1139435c23e1144a4509d2155cf13422c21bf148a767", "task_path": "tasks/rl_align__o_proofs_variance_invariance__9848371037ce7237", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_variance_invariance", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_volume_2_2__02afb94d14b69f65", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem volume_2 (a b : ℝ) (ha : 0 < a) (hb : 0 < b) :\n ∫ x in (-a)..a, π * (b^2 * (1 - x^2 / a^2)) = 4 * π * a * b^2 / 3 ∧\n ∫ y in (-b)..b, π * (a^2 * (1 - y^2 / b^2)) = 4 * π * a^2 * b / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_volume_2_2", "source_license": null, "theorem_names": ["volume_2"], "statement_sha256": "02afb94d14b69f65c777b27fd8a39463a9f38c9f86a15551be0a4534975900fd", "task_path": "tasks/rl_align__o_proofs_volume_2_2__02afb94d14b69f65", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_volume_2_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_volume_39__a6d3777ca9c41a6c", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem volume (x y z : ℝ) (hx : x > 0) (hy : y > 0) (hz : z > 0)\n (h : {n | n = 2 * (x + y) + x * y ∨ n = 2 * (y + z) + y * z ∨\n n = 2 * (z + x) + z * x}.encard = 3 ∧\n {n | n = 2 * (x + y) + x * y ∨ n = 2 * (y + z) + y * z ∨\n n = 2 * (z + x) + z * x} = {16, 24, 31}) :\n 28 < x * y * z ∧ x * y * z < 35 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_volume_39", "source_license": null, "theorem_names": ["volume"], "statement_sha256": "a6d3777ca9c41a6cc9f71d248e0541bb8dc4c1032ca88165bf45b841e4394739", "task_path": "tasks/rl_align__o_proofs_volume_39__a6d3777ca9c41a6c", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_volume_39", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_volume_6__5a2564c918d7f537", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem volume (f : ℝ → ℝ) (hf : f = λ x => 4 - x ^ 2)\n (g : ℝ → ℝ) (hg : g = λ x => 2 - x) :\n ∫ x in (0)..2, max (f x) 0 * max (g x) 0 = 20 / 3 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_volume_6", "source_license": null, "theorem_names": ["volume"], "statement_sha256": "5a2564c918d7f5371b4a61695866acc770894339810fdd18a73de419cdf8ea09", "task_path": "tasks/rl_align__o_proofs_volume_6__5a2564c918d7f537", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_volume_6", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_volume_7__23a2f201c141114e", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem volume {n : ℕ} (hn : 0 < n) (a : ℝ) :\n Infinite {x : Fin n → ℝ | (∀ i, 0 < x i) ∧ ∑ i, x i ≥ a} := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_volume_7", "source_license": null, "theorem_names": ["volume"], "statement_sha256": "23a2f201c141114e60d9de84e0bd2a5fa5be619a276bfe20e5a7fa0e94f9e30b", "task_path": "tasks/rl_align__o_proofs_volume_7__23a2f201c141114e", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_volume_7", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_volume_conical_frustum_3__ec86daa47c26a74d", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Real Set\nopen scoped BigOperators\n\n\ntheorem volume_conical_frustum {h : ℝ} {r₁ r₂ : ℝ}\n (h₀ : h > 0) (r₁₀ : r₁ > 0) (r₂₀ : r₂ > 0) :\n (1 / 3) * h * π * (r₂^2 + r₁ * r₂ + r₁^2) =\n ∫ x in (0)..h, π * (r₁ + x * (r₂ - r₁) / h)^2 := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_volume_conical_frustum_3", "source_license": null, "theorem_names": ["volume_conical_frustum"], "statement_sha256": "ec86daa47c26a74d494de2a115331655170f19d4a7bfd09060590842e0b14507", "task_path": "tasks/rl_align__o_proofs_volume_conical_frustum_3__ec86daa47c26a74d", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_volume_conical_frustum_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_volume_tetrahedron_2__8251786106d6ca67", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nimport Aesop\n\nset_option maxHeartbeats 0\n\nopen BigOperators Real Nat Topology Rat\n\ntheorem volume_tetrahedron (a : ℝ) (ha : 0 < a) : ∫ x in (0:ℝ)..a, ∫ y in (0:ℝ)..(a-x), ∫ z in (0:ℝ)..(a-x-y), 1 = a^3/6 := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_volume_tetrahedron_2", "source_license": null, "theorem_names": ["volume_tetrahedron"], "statement_sha256": "8251786106d6ca678f16d3e105d842e16cfd6cf27c0dfc10d0a7981804671caf", "task_path": "tasks/rl_align__o_proofs_volume_tetrahedron_2__8251786106d6ca67", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_volume_tetrahedron_2", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_weight_division__098ae459990e49e7", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\n\ntheorem weight_division (n : ℕ) :\n (n = 2011 → ¬∃ s1 s2 s3 : Finset ℕ,\n s1 ∪ s2 ∪ s3 = Finset.Icc 1 n ∧\n s1 ∩ s2 = ∅ ∧\n s2 ∩ s3 = ∅ ∧\n s3 ∩ s1 = ∅ ∧\n ∑ i ∈ s1, i = ∑ i ∈ s2, i ∧\n ∑ i ∈ s2, i = ∑ i ∈ s3, i) ∧\n (n = 2012 → ∃ s1 s2 s3 : Finset ℕ,\n s1 ∪ s2 ∪ s3 = Finset.Icc 1 n ∧\n s1 ∩ s2 = ∅ ∧\n s2 ∩ s3 = ∅ ∧\n s3 ∩ s1 = ∅ ∧\n ∑ i ∈ s1, i = ∑ i ∈ s2, i ∧\n ∑ i ∈ s2, i = ∑ i ∈ s3, i) := by sorry", "target_workspace": {"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"}, "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_weight_division", "source_license": null, "theorem_names": ["weight_division"], "statement_sha256": "098ae459990e49e777b47c9b094f146cffa7c6b64fc8a56595e71b4d783bd2f4", "task_path": "tasks/rl_align__o_proofs_weight_division__098ae459990e49e7", "metadata": {"split": "train", "difficulty": "medium", "source": "oproof", "source_id": "o_proofs_weight_division", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_yes_3__7adbfa4824591132", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Topology Filter Real Complex TopologicalSpace Finset\nopen scoped BigOperators\n\n\ntheorem yes :\n ∀ (a b : ℕ → ℝ) (L : ℝ), (Tendsto (λ i => a i / b i) atTop (𝓝 L)) ∧\n (L ≠ 0) → (Tendsto b atTop (𝓝 0)) → (Tendsto a atTop (𝓝 0)) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_yes_3", "source_license": null, "theorem_names": ["yes"], "statement_sha256": "7adbfa48245911320936d0031ad4941875e6d696282a118a1de9aaf006e8c697", "task_path": "tasks/rl_align__o_proofs_yes_3__7adbfa4824591132", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_yes_3", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}} {"task_id": "rl_align__o_proofs_zhangsSum__40eeda4c53c369a0", "task_type": "lean_theorem_proving", "theorem_statement": "import Mathlib\n\nopen Finset Complex Polynomial\n\ntheorem zhangsSum (n : ℕ) (hnpos : 0 < n) (x y : ℕ → ℂ) :\n ∑ i ∈ Icc 1 (n - 1), ∑ j ∈ Icc (i + 1) n, ‖x i * starRingEnd ℂ (y j) - x j * starRingEnd ℂ (y i)‖^2 =\n (∑ i ∈ Ico 1 n, ∑ j ∈ Ioc i n, ‖x i * starRingEnd ℂ (y j) - x j * starRingEnd ℂ (y i)‖^2) := by sorry", "target_workspace": {"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"}, "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_zhangsSum", "source_license": null, "theorem_names": ["zhangsSum"], "statement_sha256": "e4c496dc21cd76d0883504645d9e26f7a1517e4808bcd2324ffdae3521518540", "task_path": "tasks/rl_align__o_proofs_zhangsSum__40eeda4c53c369a0", "metadata": {"split": "train", "difficulty": "easy", "source": "oproof", "source_id": "o_proofs_zhangsSum", "source_license": null, "source_dataset": "davinci-prover/agentic-prover-RL", "source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"}}