The Church-Rosser theorem in type-free $\lambda$-calculus
is investigated both for $\beta$-equality and $\beta$-reduction.
We provide yet another simple proof of the theorem for $\beta$-equality.
Following this, upper bounds on the theorems are obtained as
the fourth level of the Grzegorczyk hierarchy.