Reduce the non-empty intersection problem on CFGs over $\{a,b\}$ to the set of tuples of three CFGs $G_1,G_2,G_3$ whose alphabet is $\{a,b\}$ and such that $G_1$ and $G_2$ generate at least one common word, $G_2$ and $G_3$ generate at least one common word, but $G_1$ and $G_3$ do not generate a common word, in order to prove that such set is undecidable (not recursive).