Let $\text{RM}(r,n)$ be the $r$th order Reed-Mullet code of length $2^n$, and let $\rho(r,n)$ denote its covering radius. It is known that $242\le\rho(1,9)\le 244$, and the determination of $\rho(1,9)$ is a long-standing open question. We give a computer-assisted proof that $\rho(1,9)=242$, leveraging the classificatio...