\item \lect Explain the concept of equisatisfiability.
Given a propositional logic formula $\varphi$, the Tseitin algorithm computes an 
equisatisfiable formula $CNF(\varphi)$ in CNF. 
Why is this enough for equivalence checking?