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
232 B
5 lines
232 B
|
|
\item \self Use the Congruence-Closure algorithm to check if the following assignment for the equalities is satisfiable.
|
|
|
|
$\varphi_{EUF} \quad := \quad x=y \land y=f(y) \land y \neq f(x) \land z=f(z) \land f(z)=f(x) \land z=f(y)$
|
|
|