\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 (y=f(x)); \lnot (y=f(y))}) \land (\clause{(y=f(x)); (y=f(y))})~\land\\
	&(\clause{(f(x)=z); (f(y)=x); \lnot (f(y)=z)}) \land (\clause{(y=f(y)); \lnot (z=x)})~\land\\
	&(\clause{(f(y)=x); (z=x); (f(y)=z)}) \land (\clause{(y=f(x)); (z=x)})
  \end{align*}
