{
 "fc_commit": "24371fbe346f01704b4aa18a6b60b41aac4d9622",
 "lean": "leanprover/lean4:v4.33.1",
 "proofs": [
  {
   "slug": "erdos_1198_variants_hindman",
   "number": "1198",
   "fc_name": "erdos_1198.variants.hindman",
   "fc_url": "https://github.com/google-deepmind/formal-conjectures/blob/24371fbe346f01704b4aa18a6b60b41aac4d9622/FormalConjectures/ErdosProblems/1198.lean",
   "fc_commit": "24371fbe346f01704b4aa18a6b60b41aac4d9622",
   "fc_file_sha256": "0359848480a1b281b9bc355d92a7e4f9f97675f002d8c7d9386b54ea25cd90cc",
   "statement": "open Finset in ∀ c : ℕ → Fin 2, ∃ a : ℕ → ℕ, StrictMono a ∧ 0 < a 0 ∧ ∃ col : Fin 2, ∀ T : Finset ℕ, T.Nonempty → c (∑ i ∈ T, a i) = col",
   "statement_sha256": "fa55073acdecd293fb7ca1682135e68e8acba2f5134b98727fde877f660723ea",
   "axioms": [
    "Classical.choice",
    "Quot.sound",
    "propext"
   ],
   "submission_sha256": "1738a5841fa479243860e67d285ec0a4936d81e1b3943c9e4bf9feed3dab1198",
   "lean": "leanprover/lean4:v4.33.1",
   "lean_file": "/data/lean/erdos_1198_variants_hindman.lean",
   "lines": 72,
   "model": "claude-opus-5-5",
   "attempt_cost_usd": 0.38,
   "turns": 5,
   "contributor": "lean-formal-prover",
   "result_id": 102,
   "also_proved_elsewhere": false,
   "disclosure": "This proof was written by an AI model (claude-opus-5-5) working in a tool loop with a Lean compiler, and checked by the Lean kernel. No person has read or reviewed the proof. It has not been offered to the formal-conjectures maintainers."
  },
  {
   "slug": "erdos_493",
   "number": "493",
   "fc_name": "erdos_493",
   "fc_url": "https://github.com/google-deepmind/formal-conjectures/blob/24371fbe346f01704b4aa18a6b60b41aac4d9622/FormalConjectures/ErdosProblems/493.lean",
   "fc_commit": "24371fbe346f01704b4aa18a6b60b41aac4d9622",
   "fc_file_sha256": "b0e8ca4d1dd9d2fecde1c36e6d8ac248a59ee10944e878fd097d227d2aa6a355",
   "statement": "∃ k : ℕ, ∃ N : ℤ, ∀ n : ℤ, N ≤ n → ∃ a : Fin k → ℤ, (∀ i : Fin k, (2 : ℤ) ≤ a i) ∧ (∏ i : Fin k, a i) - (∑ i : Fin k, a i) = n",
   "statement_sha256": "6af9dba8277be274f00840394c1f19dbcfcf6a82cfa2ef64c027c03ec4596186",
   "axioms": [
    "Classical.choice",
    "Quot.sound",
    "propext"
   ],
   "submission_sha256": "b9fd07092b27fd2dc176cbfc4aed928f2fd2472e180637e07d5d036a68699ae7",
   "lean": "leanprover/lean4:v4.33.1",
   "lean_file": "/data/lean/erdos_493.lean",
   "lines": 10,
   "model": "claude-opus-5-5",
   "attempt_cost_usd": 0.05,
   "turns": 2,
   "contributor": "lean-formal-prover",
   "result_id": 101,
   "also_proved_elsewhere": true,
   "disclosure": "This proof was written by an AI model (claude-opus-5-5) working in a tool loop with a Lean compiler, and checked by the Lean kernel. No person has read or reviewed the proof. It has not been offered to the formal-conjectures maintainers."
  },
  {
   "slug": "erdos_649",
   "number": "649",
   "fc_name": "erdos_649",
   "fc_url": "https://github.com/google-deepmind/formal-conjectures/blob/24371fbe346f01704b4aa18a6b60b41aac4d9622/FormalConjectures/ErdosProblems/649.lean",
   "fc_commit": "24371fbe346f01704b4aa18a6b60b41aac4d9622",
   "fc_file_sha256": "56cb42061685e72f30d8684036b01652aa66b8b027668fab5f4dd7b3ee2f1ed9",
   "statement": "¬ ∀ p q : ℕ, p.Prime → q.Prime → p ≠ q → ∃ n : ℕ, n.maxPrimeFac = p ∧ (n + 1).maxPrimeFac = q",
   "statement_sha256": "b499fd1e40e7f09acbfa7ffdca11704b9fb289d44fb26c4624046d116ffb1117",
   "axioms": [
    "Classical.choice",
    "Quot.sound",
    "propext"
   ],
   "submission_sha256": "a4bd66cc40962da7979bcb10d8639c2625f4fa1af6557dff29fa1403197c69ba",
   "lean": "leanprover/lean4:v4.33.1",
   "lean_file": "/data/lean/erdos_649.lean",
   "lines": 51,
   "model": "claude-opus-5-5",
   "attempt_cost_usd": 0.2,
   "turns": 5,
   "contributor": "lean-formal-prover",
   "result_id": 100,
   "also_proved_elsewhere": true,
   "disclosure": "This proof was written by an AI model (claude-opus-5-5) working in a tool loop with a Lean compiler, and checked by the Lean kernel. No person has read or reviewed the proof. It has not been offered to the formal-conjectures maintainers."
  },
  {
   "slug": "erdos_1008_variants_folkman",
   "number": "1008",
   "fc_name": "erdos_1008.variants.folkman",
   "fc_url": "https://github.com/google-deepmind/formal-conjectures/blob/24371fbe346f01704b4aa18a6b60b41aac4d9622/FormalConjectures/ErdosProblems/1008.lean",
   "fc_commit": "24371fbe346f01704b4aa18a6b60b41aac4d9622",
   "fc_file_sha256": "ba7f161fb12d64077035f9437456dbbf36f5c572afe24911a21c7878593f3c97",
   "statement": "open SimpleGraph in ∀ (n : ℕ), ((completeBipartiteGraph (Fin n) (Fin (n ^ 2))).edgeSet.ncard = n ^ 3) ∧ ∀ H ≤ completeBipartiteGraph (Fin n) (Fin (n ^ 2)), n ^ 2 + n.choose 2 < H.edgeSet.ncard → cycleGraph 4 ⊑ H",
   "statement_sha256": "864c34726e21805995c22aa1fbd6cb095293420677d5c926c2f5effdc2814c88",
   "axioms": [
    "Classical.choice",
    "Quot.sound",
    "propext"
   ],
   "submission_sha256": "d1826b6756ada0457fa1a49824d3a90a5c8dc31a54a02119002588088446d67b",
   "lean": "leanprover/lean4:v4.33.1",
   "lean_file": "/data/lean/erdos_1008_variants_folkman.lean",
   "lines": 85,
   "model": "claude-opus-5-5",
   "attempt_cost_usd": 0.58,
   "turns": 10,
   "contributor": "lean-formal-prover",
   "result_id": 99,
   "also_proved_elsewhere": false,
   "disclosure": "This proof was written by an AI model (claude-opus-5-5) working in a tool loop with a Lean compiler, and checked by the Lean kernel. No person has read or reviewed the proof. It has not been offered to the formal-conjectures maintainers."
  },
  {
   "slug": "erdos_110_variants_de_bruijn_erdos",
   "number": "110",
   "fc_name": "erdos_110.variants.de_bruijn_erdos",
   "fc_url": "https://github.com/google-deepmind/formal-conjectures/blob/24371fbe346f01704b4aa18a6b60b41aac4d9622/FormalConjectures/ErdosProblems/110.lean",
   "fc_commit": "24371fbe346f01704b4aa18a6b60b41aac4d9622",
   "fc_file_sha256": "cf600e719c3111959595cfb21756838c22c1f2fc1412d9c9595af802543213f8",
   "statement": "open Filter in ∀ {V : Type*} (G : SimpleGraph V) (hG : G.chromaticNumber = ⊤) (n : ℕ) (hn : 1 ≤ n), ∃ H : G.Subgraph, H.verts.Finite ∧ H.coe.chromaticNumber = (n : ℕ∞)",
   "statement_sha256": "aba244043eb44a8fbbc2b8cafdf9d40696b994cd3d586bbf07b6cd4205f05d76",
   "axioms": [
    "Classical.choice",
    "Quot.sound",
    "propext"
   ],
   "submission_sha256": "451e2302534e80326145b67ece4c6befa224dd2c73f2b86f0694954e4a5c16ce",
   "lean": "leanprover/lean4:v4.33.1",
   "lean_file": "/data/lean/erdos_110_variants_de_bruijn_erdos.lean",
   "lines": 63,
   "model": "claude-opus-5-5",
   "attempt_cost_usd": 0.31,
   "turns": 7,
   "contributor": "lean-formal-prover",
   "result_id": 98,
   "also_proved_elsewhere": false,
   "disclosure": "This proof was written by an AI model (claude-opus-5-5) working in a tool loop with a Lean compiler, and checked by the Lean kernel. No person has read or reviewed the proof. It has not been offered to the formal-conjectures maintainers."
  },
  {
   "slug": "erdos_1008_variants_lower_bound",
   "number": "1008",
   "fc_name": "erdos_1008.variants.lower_bound",
   "fc_url": "https://github.com/google-deepmind/formal-conjectures/blob/24371fbe346f01704b4aa18a6b60b41aac4d9622/FormalConjectures/ErdosProblems/1008.lean",
   "fc_commit": "24371fbe346f01704b4aa18a6b60b41aac4d9622",
   "fc_file_sha256": "ba7f161fb12d64077035f9437456dbbf36f5c572afe24911a21c7878593f3c97",
   "statement": "open SimpleGraph in ∃ c > (0 : ℝ), ∀ (V : Type) [Fintype V] (G : SimpleGraph V), ∃ H ≤ G, (cycleGraph 4).Free H ∧ c * (G.edgeSet.ncard : ℝ) ^ (1 / 2 : ℝ) ≤ (H.edgeSet.ncard : ℝ)",
   "statement_sha256": "6caa99e0f76f4d4a903e199c3514d3140fe6e480fd679ee1177613d6b00b9297",
   "axioms": [
    "Classical.choice",
    "Quot.sound",
    "propext"
   ],
   "submission_sha256": "5da3c179476213b69399a45216071184d73096d6972b3eab523d4a1c424ae7fd",
   "lean": "leanprover/lean4:v4.33.1",
   "lean_file": "/data/lean/erdos_1008_variants_lower_bound.lean",
   "lines": 140,
   "model": "claude-opus-5-5",
   "attempt_cost_usd": 0.96,
   "turns": 7,
   "contributor": "lean-formal-prover",
   "result_id": 97,
   "also_proved_elsewhere": false,
   "disclosure": "This proof was written by an AI model (claude-opus-5-5) working in a tool loop with a Lean compiler, and checked by the Lean kernel. No person has read or reviewed the proof. It has not been offered to the formal-conjectures maintainers."
  },
  {
   "slug": "erdos_376_variants_prime",
   "number": "376",
   "fc_name": "erdos_376.variants.prime",
   "fc_url": "https://github.com/google-deepmind/formal-conjectures/blob/24371fbe346f01704b4aa18a6b60b41aac4d9622/FormalConjectures/ErdosProblems/376.lean",
   "fc_commit": "24371fbe346f01704b4aa18a6b60b41aac4d9622",
   "fc_file_sha256": "69857f3bad8245576710057890a1b9feed5446f34db251c87e4ee96c3421b838",
   "statement": "∀ {p q : ℕ} (h₁ : p.Prime) (h₂ : Odd p) (h₃ : q.Prime) (h₄ : Odd q), { (n : ℕ) | n.centralBinom.Coprime (p * q) }.Infinite",
   "statement_sha256": "53f0bb5cfb6846fa3e65b7486915784cbd2abda9f5b2472172da2bd4d899d020",
   "axioms": [
    "Classical.choice",
    "Quot.sound",
    "propext"
   ],
   "submission_sha256": "79ae8c99d0015fb5cc4e8be933c6f2b0317bea4eecdfaa18cf8a34ae8e5a0a6c",
   "lean": "leanprover/lean4:v4.33.1",
   "lean_file": "/data/lean/erdos_376_variants_prime.lean",
   "lines": 205,
   "model": "claude-opus-5-5",
   "attempt_cost_usd": 4.94,
   "turns": 11,
   "contributor": "lean-formal-prover",
   "result_id": 104,
   "also_proved_elsewhere": false,
   "disclosure": "This proof was written by an AI model (claude-opus-5-5) working in a tool loop with a Lean compiler, and checked by the Lean kernel. No person has read or reviewed the proof. It has not been offered to the formal-conjectures maintainers."
  },
  {
   "slug": "erdos_83_variants_extremal",
   "number": "83",
   "fc_name": "erdos_83.variants.extremal",
   "fc_url": "https://github.com/google-deepmind/formal-conjectures/blob/24371fbe346f01704b4aa18a6b60b41aac4d9622/FormalConjectures/ErdosProblems/83.lean",
   "fc_commit": "24371fbe346f01704b4aa18a6b60b41aac4d9622",
   "fc_file_sha256": "ccc93e97f26ffc3fe63a80dda4f871ce6707f5adee09f37b1636e905d54a48c5",
   "statement": "∀ (n : ℕ), ∃ F : Finset (Finset (Fin (4 * n))), (∀ A ∈ F, A.card = 2 * n) ∧ (∀ A ∈ F, ∀ B ∈ F, 2 ≤ (A ∩ B).card) ∧ F.card = ((4 * n).choose (2 * n) - (2 * n).choose n ^ 2) / 2",
   "statement_sha256": "3075faccd126dbe940ac42bb7e2847d41ffe66b746a806ee401cb38cd2b623c1",
   "axioms": [
    "Classical.choice",
    "Quot.sound",
    "propext"
   ],
   "submission_sha256": "777f5f9679fdc9f4787a1d57de5c1e9350b99085f2c45118c08b3d1fb3bde8e7",
   "lean": "leanprover/lean4:v4.33.1",
   "lean_file": "/data/lean/erdos_83_variants_extremal.lean",
   "lines": 85,
   "model": "claude-opus-5-5",
   "attempt_cost_usd": 0.42,
   "turns": 6,
   "contributor": "lean-formal-prover",
   "result_id": 103,
   "also_proved_elsewhere": false,
   "disclosure": "This proof was written by an AI model (claude-opus-5-5) working in a tool loop with a Lean compiler, and checked by the Lean kernel. No person has read or reviewed the proof. It has not been offered to the formal-conjectures maintainers."
  }
 ],
 "not_proved": [
  {
   "fc_name": "erdos_372",
   "why": "Not proved. The model ran out of output budget inside its attempt ($2.39, 5 turns) without a compiling proof; nothing was submitted."
  },
  {
   "fc_name": "erdos_399.variants.pollack_shapiro",
   "why": "Not proved. The model stopped after 3 turns ($1.94) and reported that it could not find a proof; nothing was submitted."
  }
 ]
}
