Questionnaire-2024/smt/practical_questions/0_3_a_smt_prac.tex

\item \prac \textbf{[3 Points]} Use the Congruence-Closure algorithm to check if the following assignment for the equalities is satisfiable.
    \begin{align*}
         \varphi_{EUF} \quad := \quad  f(o)=k \land l \neq f(m) \land n \neq l \land f(k)=m \land f(o)=f(k) \land o \neq k \land \\ l \neq f(n) \land f(m) \neq k \land m \neq f(m) \land o=n \land f(m)=o
    \end{align*}