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.

4 lines
376 B

5 months ago
  1. \item \self Consider the following formula in the conjunctive fragment of $\mathcal{T}_{EUF}$.
  2. \begin{align*}
  3. \varphi_{EUF} \quad := \quad a = b \land c \neq d \land f(a) = c \land f(b) \neq f(c) \land f(a) = f(d) \land f(b) = c \land f(d) = f(c)
  4. \end{align*}
  5. Use the \textit{Congruence Closure} algorithm to determine whether this formula is satisfiable.