\item Use the DPLL algorithm with BCP to determine whether or not the set of clauses given is satisfiable. Decide variables in alphabetical order starting with the \textit{negative} phase.\\
If the set of clauses resulted in \texttt{SAT}, give a satisfying model. If the set of clauses resulted in \texttt{UNSAT}, give a resolution proof that shows that the conjunction of the clauses from the table is unsatisfiable.

\begin{dpllCNFInput}
  \item (\lnot a \lor b)
  \item (\lnot b \lor c \lor d)
  \item (a \lor \lnot c)
  \item (\lnot d \lor e)
  \item (\lnot e \lor f)
  \item (\lnot f \lor g)
  \item (\lnot g)
\end{dpllCNFInput}
