\item \self In the following list tick all statements that conform to the eager encoding approach for the implementation of SMT solver.

\begin{itemize}
    \item[$\square$] Eager encoding is based on the interaction between a SAT solver and a so-called theory solver.
    \item[$\square$] Eager encoding involves translating the original formula to an equisatisfiable boolean formula in a single step.
    \item[$\square$] Eager encoding is based on the direct encoding of axioms.
    \item[$\square$] Eager encoding starts with no constraints at all and adds constraints only when needed.
\end{itemize}