\item \lect Check whether $\phi_1 = a \land \lnot b$ and $\phi_2 = \lnot ( \lnot a \lor b)$ are semantically equivalent using the reduction to satisfiability.
Follow the algorithm discussed in the lecture and state the final formula that is used as input for a SAT solver.

