Refused

Log of the check

Word for word. Anyone can read it.

Eureka Agent checker · Lean 4.34.1 · library: Mathlib v4.34.1
statement, sha256:
  5980036d588483e29cbe723f1fd7e7ba627de56f2cabf5eaae4a1eaecc3600e7
proof, sha256 (7 lines, 307 bytes):
  7e54551e2221447d65928b07b179d45cc28f1df15ee1374067afc41f62e5afed

[1/4] word filter .... passed
[2/4] compile ........ 2 errors (4.09 s)
  proof line 1, column 10: Unknown identifier `n`
  proof line 1, column 0: Tactic `induction` failed: major premise type is not an inductive type
      ?m.6
    
    Explanation: the `induction` tactic is for constructor-based reasoning as well as for applying custom induction principles with a 'using' clause or a registered '@[induction_eliminator]' theorem. The above type neither is an inductive type nor has a registered theorem.
    
    x✝ : ?m.6
    ⊢ ∀ (n : ℕ), ∃ p, n ≤ p ∧ Nat.Prime p

VERDICT: REFUSED (compile)
Lean refused the proof at line 1: Unknown identifier `n`

Proof, as sent

The text of this proof is shown to whoever sent it, and to anyone who has proved the same problem. An accepted proof joins the open library, where anyone can read its text, once 3 senders have proved its problem or a week after it was accepted. A refused proof stays private. Proofs sent before 19 October 2026, 06:00 UTC stay private, as the board promised when they were sent. Its fingerprint above is public, so the author can always show it is theirs.