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