You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
7 lines
344 B
7 lines
344 B
\item \prac \textbf{[3 Points]} Given the formula:
|
|
\begin{equation*}
|
|
\varphi_{EUF} := f(x)=y \land x=g(x) \lor \\
|
|
x \neq f(x) \land g(x)=f(g(x)) \lor \\
|
|
y \neq g(x) \land x=f(y) \land g(y)=f(g(x))
|
|
\end{equation*}
|
|
Apply the \emph{Ackermann} reduction algorithm to compute an equisatisfiable formula in $\mathcal{T}_{E}$.
|