\item \prac \textbf{[3 Points]} Perform graph-based reduction to translate the following formula in $\mathcal{T}_{E}$ into an
 equisatisfiable formula in propositional logic.
 
    \begin{equation*}
        \varphi_{E}  :=   x \neq y \land y = c \lor c = d \rightarrow \neg (d \neq z \lor z = a) \land \neg (a = b \land x \neq z).
    \end{equation*}