Let $M, N, P, Q$ be pure untyped lambda terms.
Suppose that $M \stackrel{*}\rightarrow P, Q$ and $N \stackrel{*}\rightarrow P, Q,$ where $\stackrel{*}\rightarrow$ denotes that the term on the left can be reduced to the term on the right by applying $\beta$-reduction zero or more times.
Does there always exist a lambda term $R$ such that $M, N \stackrel{*}\rightarrow R$ and $R \stackrel{*}\rightarrow P, Q$?
My assumption is that if two lambda terms are $\beta$-equivalent, then the reduction diagram of the two lambda terms should meet at a unique point:
