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.
11 lines
762 B
11 lines
762 B
\begin{align*}
|
|
& \{k,\underline{f(o)}\}, \{l\}, \{m,f(k)\}, \{f(k),\underline{f(o)}\}, \{f(n)\}, \{n,o\}, \{o,f(m)\} \\
|
|
& \{k,f(k),f(o)\}, \{l\}, \{m,f(k)\}, \{f(n)\}, \{n,\underline{o}\}, \{\underline{o},f(m)\} \\
|
|
& \{k,\underline{f(k)},f(o)\}, \{l\}, \{m,\underline{f(k)}\}, \{f(n)\}, \{n,o,f(m)\} \\
|
|
& \{k,m,f(k),\underline{f(o)}\}, \{l\}, \{\underline{f(n)}\}, \{\underline{n,o},f(m)\} \\
|
|
& \{\underline{k,m},\underline{f(k)},f(n),f(o)\}, \{l\}, \{n,o,\underline{f(m)}\} \\
|
|
& \{k,m,n,o,f(k),f(m),f(n),f(o)\}, \{l\} \\
|
|
\end{align*}
|
|
|
|
Checking the disequalities $o \neq k$, $f(m) \neq k$, $m \neq f(m)$ leads to the result that the assignment is UNSAT, since $o$ and $k$, $f(m)$ and $k$, $m$ and $f(m)$
|
|
are in the same congruence class.
|