diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2020-11-13 19:12:34 -0800 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2020-11-13 19:12:34 -0800 |
commit | cc840d8bd83775f911bc373aa3284d518dc050d0 (patch) | |
tree | 4ff6372b66785837144d61b6ff1dfbed53339ad4 /src/base | |
parent | 22388f901a88dddfe629dd3c1406b06fafa9675d (diff) | |
download | abc-cc840d8bd83775f911bc373aa3284d518dc050d0.tar.gz abc-cc840d8bd83775f911bc373aa3284d518dc050d0.tar.bz2 abc-cc840d8bd83775f911bc373aa3284d518dc050d0.zip |
Improvements to the SAT sweeper.
Diffstat (limited to 'src/base')
-rw-r--r-- | src/base/abci/abc.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/base/abci/abc.c b/src/base/abci/abc.c index 8277a0b3..b6b3dba5 100644 --- a/src/base/abci/abc.c +++ b/src/base/abci/abc.c @@ -36292,13 +36292,13 @@ int Abc_CommandAbc9Fraig( Abc_Frame_t * pAbc, int argc, char ** argv ) Cec_ManFraSetDefaultParams( pPars ); pPars->jType = 0; // solver type pPars->fSatSweeping = 1; // conflict limit at a node - pPars->nWords = 4; // simulation words - pPars->nRounds = 250; // simulation rounds + pPars->nWords = 8; // simulation words + pPars->nRounds = 10; // simulation rounds pPars->nItersMax = 1000000; // this is a miter pPars->nBTLimit = 1000000; // use logic cones pPars->nSatVarMax = 1000; // the max number of SAT variables before recycling SAT solver pPars->nCallsRecycle = 500; // calls to perform before recycling SAT solver - pPars->nGenIters = 5; // pattern generation iterations + pPars->nGenIters = 100; // pattern generation iterations Extra_UtilGetoptReset(); while ( ( c = Extra_UtilGetopt( argc, argv, "JWRILDCPrmdckngxwvh" ) ) != EOF ) { |