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

