\item Given a propositional logic formula $\varphi$, the Tseitin transformation computes an
equisatisfiable formula $\varphi'$ in CNF.
Why is this enough for equivalence checking?
