52 for ( i = 0; i < pCnf->
nClauses; i++ )
65 Abc_Print( 1,
"Output %6d : ", iOutput );
67 Abc_Print( 1,
"Total: " );
70 Abc_Print( 1,
"UNDECIDED " );
71 else if ( status ==
l_True )
72 Abc_Print( 1,
"SATISFIABLE " );
74 Abc_Print( 1,
"UNSATISFIABLE " );
76 Abc_PrintTime( 1,
"Time", clk );
123 Abc_PrintTime( 1,
"Total time", Abc_Clock() - clk );
#define ABC_NAMESPACE_IMPL_START
#define ABC_NAMESPACE_IMPL_END
struct Cnf_Dat_t_ Cnf_Dat_t
void Cnf_DataFree(Cnf_Dat_t *p)
void Gia_ManSat3Call(Gia_Man_t *p, int fSplit)
int Gia_ManSat3CallOne(Gia_Man_t *p, int iOutput)
void Gia_ManSat3Report(int iOutput, int status, abctime clk)
ABC_NAMESPACE_IMPL_START sat_solver3 * Gia_ManSat3Init(Cnf_Dat_t *pCnf)
DECLARATIONS ///.
sat_solver3 * Gia_ManSat3Create(Gia_Man_t *p)
void Gia_ManStop(Gia_Man_t *p)
Gia_Man_t * Gia_ManDupDfsCone(Gia_Man_t *p, Gia_Obj_t *pObj)
struct Gia_Obj_t_ Gia_Obj_t
struct Gia_Man_t_ Gia_Man_t
#define Gia_ManForEachCo(p, pObj, i)
void * Mf_ManGenerateCnf(Gia_Man_t *pGia, int nLutSize, int fCnfObjIds, int fAddOrCla, int fMapping, int fVerbose)
int sat_solver3_simplify(sat_solver3 *s)
void sat_solver3_delete(sat_solver3 *s)
sat_solver3 * sat_solver3_new(void)
int sat_solver3_solve(sat_solver3 *s, lit *begin, lit *end, ABC_INT64_T nConfLimit, ABC_INT64_T nInsLimit, ABC_INT64_T nConfLimitGlobal, ABC_INT64_T nInsLimitGlobal)
int sat_solver3_addclause(sat_solver3 *s, lit *begin, lit *end)
struct sat_solver3_t sat_solver3