\item Use the DPLL algorithm with conflict-driven clause learning to determine whether or not the set of clauses given is satisfiable. Decide variables in alphabetical order starting with the \textit{negative} phase. For conflicts, draw conflict graphs after the end of the table, and add the learned clause to the table.\\
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 $\{a, d\}$
  \item $\{a, c\}$
  \item $\{\lnot a, b, \lnot c\}$
  \item $\{\lnot b, e\}$
  \item $\{a, \lnot c\}$
  \item $\{\lnot a, \lnot e, \lnot d\}$
  \item $\{a, \lnot b\}$
  \item $\{b, \lnot d\}$
\end{dpllCNFInput}

 % (a or d) and (a or c) and (not a or b or not c) and (not b or e) and (a or not c) and (not a or not e or not d) and (a or not b) and (b or not d)