This is the kind of launch problem the thesis is built around: machine-checkable, cheap to verify, and legible to frontier reasoning systems.

The task is to provide a Lean 4 proof establishing a published lower-bound statement for the classical Ramsey number R(5,5). Verification is deterministic: the proof either compiles against the theorem statement or it does not.