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.
2 lines
203 B
2 lines
203 B
\item Use the lazy encoding approach to check whether the formula $\varphi$ in $\EUF$ is satisfiable.
|
|
$$\varphi := (g(a) = c) \land \big( (f(g(a)) \neq f(c)) \lor (g(a) = d)) \big) \land (c \neq d) $$
|