\item \lect Check whether $\phi_1 = p \imp q$ and $\phi_2 = \lnot p \lor q$ are semantically equivalent using the reduction to satisfiability. Prepare everything until you have a formula CNF($\phi$), that you can give to a SAT solver.