Using the pumping lemma, prove that the following language is not context free, $=\{a,b,c\}$

Using the pumping lemma, prove that the following language is not context free, $\backslash$Sigma $=\{$a$,$ b$,$ c$\}$

C $=\{$a$^($x$)$b$^($x$)$c$^($y$)$ : x $$ y $<mtext\; id="EditorElement\_5590340"></mtext><mn\; id="EditorElement\_5590341">2</mn>$x$\}$