  Two nonzero recursively enumerable (r.e.) degrees $\mathbf{a}$ and
$\mathbf{b}$ form a strong minimal pair if $\mathbf{a} \wedge
\mathbf{b}=\mathbf{0}$ and $\mathbf{b}\vee \mathbf{x}\geq \mathbf{a}$ for any
nonzero r.e. degree $\mathbf{x}\leq \mathbf{a}$. We prove that there is no
strong minimal pair in the r.e. degrees. Our construction goes beyond the usual
$\mathbf{0}'''$-priority arguments and we give some evidence to show that it
needs $\mathbf{0}^{(4)}$-priority arguments.
