10 #ifndef CPROVER_SOLVERS_SAT_SATCHECK_CADICAL_H
11 #define CPROVER_SOLVERS_SAT_SATCHECK_CADICAL_H
bool has_set_assumptions() const override
void set_assumptions(const bvt &_assumptions) override
virtual ~satcheck_cadicalt()
optionalt< solver_hardnesst > solver_hardness
const std::string solver_text() override
resultt do_prop_solve() override
void set_assignment(literalt a, bool value) override
void enable_hardness_collection() override
void lcnf(const bvt &bv) override
satcheck_cadicalt(message_handlert &message_handler)
tvt l_get(literalt a) const override
void with_solver_hardness(std::function< void(solver_hardnesst &)> handler) override
bool is_in_conflict(literalt a) const override
Returns true if an assumption is in the final conflict.
bool has_is_in_conflict() const override
CNF Generation, via Tseitin.
Capability to collect the statistics of the complexity of individual solver queries.
std::vector< literalt > bvt
nonstd::optional< T > optionalt
A structure that facilitates collecting the complexity statistics from a decision procedure.