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.
5 lines
369 B
5 lines
369 B
\item \self Consider the following formula in the conjunctive fragment of $\mathcal{T}_{EUF}$.
|
|
\begin{align*}
|
|
\varphi_{EUF} \quad := \quad f(a) = c \land f(c) \neq f(d) \land b = f(c) \land a \neq f(c) \land c = d \land b \neq d \land a = c
|
|
\end{align*}
|
|
Use the \textit{Congruence Closure} algorithm to determine whether this formula is satisfiable.
|