CBMC
|
#include <satcheck_cadical.h>
Additional Inherited Members | |
![]() | |
enum class | resultt { P_SATISFIABLE , P_UNSATISFIABLE , P_ERROR } |
![]() | |
std::unique_ptr< clause_hardness_collectort > | solver_hardness |
![]() | |
enum class | statust { INIT , SAT , UNSAT , ERROR } |
![]() | |
resultt | do_prop_solve (const bvt &assumptions) override |
![]() | |
void | gate_and (literalt a, literalt b, literalt o) |
Tseitin encoding of conjunction of two literals. | |
void | gate_or (literalt a, literalt b, literalt o) |
Tseitin encoding of disjunction of two literals. | |
void | gate_xor (literalt a, literalt b, literalt o) |
Tseitin encoding of XOR of two literals. | |
void | gate_nand (literalt a, literalt b, literalt o) |
Tseitin encoding of NAND of two literals. | |
void | gate_nor (literalt a, literalt b, literalt o) |
Tseitin encoding of NOR of two literals. | |
void | gate_equal (literalt a, literalt b, literalt o) |
Tseitin encoding of equality between two literals. | |
void | gate_implies (literalt a, literalt b, literalt o) |
Tseitin encoding of implication between two literals. | |
bool | process_clause (const bvt &bv, bvt &dest) const |
filter 'true' from clause, eliminate duplicates, recognise trivially satisfied clauses | |
![]() | |
static bvt | eliminate_duplicates (const bvt &) |
eliminate duplicates from given vector of literals | |
static bool | is_all (const bvt &bv, literalt l) |
![]() | |
CaDiCaL::Solver * | solver |
int | preprocessing_limit = 0 |
int | localsearch_limit = 0 |
![]() | |
statust | status |
size_t | clause_counter |
![]() | |
size_t | _no_variables |
![]() | |
bvt | lcnf_bv |
messaget | log |
std::size_t | number_of_solver_calls = 0 |
Definition at line 55 of file satcheck_cadical.h.
|
inlineexplicit |
Definition at line 58 of file satcheck_cadical.h.