\item \ifassignmentsheet \points{5} \fi
  Use the lazy encoding approach to check whether the formula $\varphi$ in $\EUF$ is satisfiable.
  \begin{align*}
\varphi = &(\clause{(f(a)=b); (f(a)=c); \lnot (b=c)}) \land (\clause{(b=c); (a=b); (f(a)=b)})~\land\\
          &(\clause{\lnot (f(a)=b); (a=b)}) \land (\clause{(b=c); \lnot (a=b); \lnot (f(a)=b)})~\land\\
          &(\clause{\lnot (f(a)=c); (b=c)}) \land (\clause{\lnot (f(a)=c); (b=c); \lnot (a=b)})~\land\\
          &(\clause{(f(a)=b); (f(a)=c)})
  \end{align*}
