\item \self Check whether $\phi_1 = (a \land b) \lor \lnot c$ and $\phi_2 = (a \lor \lnot c) \land (b \lor \lnot c)$ 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.