\item \self In the following list, mark all items that are true for an \textit{eager encoding} procedure for $\mathcal{T}_{UE}$ with \textbf{E}, mark all items that are true for a \textit{lazy encoding} procedure with \textbf{L}, and mark all items which neither belong to an eager nor a lazy encoding procedure with \textbf{N}.

\begin{itemize}
    \item[\Huge{$\square$}] Only one call to a propositional SAT solver is required.
    \item[\Huge{$\square$}] A propositional formula that is equisatisfiable to the original theory formula is constructed before calling any solver.
    \item[\Huge{$\square$}] A propositional SAT solver and a theory solver for the conjunctive fragment of the theory interact with each other.
    \item[\Huge{$\square$}] For a theory-inconsistent assignment of literals, a blocking clause is created.
\end{itemize}