LAC
/
Questionnaire-2024
3
0
Fork 0
Code Issues Pull Requests Projects Releases 12 Wiki Activity
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.
21 Commits
1 Branch
12 Tags
1.2 MiB
Tree: b4a9b0e01c
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'b4a9b0e01c'
${ noResults }
Questionnaire-2024/smt/3000.tex

3 lines
238 B
Raw Normal View History

added smt chapter
6 months ago
​
​
  1. \item \ifassignmentsheet \points{5} \fi
  2. Use the lazy encoding approach to check whether the formula $\varphi$ in $\EUF$ is satisfiable.
  3. $$\varphi := (x = y) \land (y = f(y)) \land (y \neq f(x)) \land (z = f(z)) \land (f(z) = f(x)) $$