Is {xyx | |x|≥1} context-free?
Consider $w = a^nb^na^nb^n$, then it is similar to proving language {ww} is not CFL.

In the given language there is no restriction on length of y. So, let it be zero.
Now, for any valid decomposition w = uvxyz, $uv^ixy^iz$ belongs to L.