10 #ifndef CPROVER_SOLVERS_SAT_SATCHECK_CADICAL_H
11 #define CPROVER_SOLVERS_SAT_SATCHECK_CADICAL_H
bool has_is_in_conflict() const override
virtual ~satcheck_cadical_baset()
void lcnf(const bvt &bv) override
bool has_assumptions() const override
std::string solver_text() const override
satcheck_cadical_baset(int preprocessing_limit, int localsearch_limit, message_handlert &)
tvt l_get(literalt a) const override
bool is_in_conflict(literalt a) const override
Returns true if an assumption is in the final conflict.
void set_assignment(literalt a, bool value) override
resultt do_prop_solve(const bvt &assumptions) override
satcheck_cadical_no_preprocessingt(message_handlert &message_handler)
satcheck_cadical_preprocessingt(message_handlert &message_handler)
CNF Generation, via Tseitin.
Capability to collect the statistics of the complexity of individual solver queries.
std::vector< literalt > bvt