summaryrefslogtreecommitdiffstats
path: root/src/sat/bmc/bmcMaj.c
diff options
context:
space:
mode:
authorAlan Mishchenko <alanmi@berkeley.edu>2017-12-06 13:00:08 -0800
committerAlan Mishchenko <alanmi@berkeley.edu>2017-12-06 13:00:08 -0800
commite37bbba72d101debccd1f896f8a2aa09ebfbb297 (patch)
tree45d4fb14bbcd8913680232f56e9535916e633011 /src/sat/bmc/bmcMaj.c
parent9e515ae3631ab8e4e263a24392c1c74896122035 (diff)
downloadabc-e37bbba72d101debccd1f896f8a2aa09ebfbb297.tar.gz
abc-e37bbba72d101debccd1f896f8a2aa09ebfbb297.tar.bz2
abc-e37bbba72d101debccd1f896f8a2aa09ebfbb297.zip
An improvement to 'twoexact' and 'lutexact'.
Diffstat (limited to 'src/sat/bmc/bmcMaj.c')
-rw-r--r--src/sat/bmc/bmcMaj.c4
1 files changed, 4 insertions, 0 deletions
diff --git a/src/sat/bmc/bmcMaj.c b/src/sat/bmc/bmcMaj.c
index db56f98b..86934898 100644
--- a/src/sat/bmc/bmcMaj.c
+++ b/src/sat/bmc/bmcMaj.c
@@ -628,6 +628,7 @@ int Exa_ManAddCnfStart( Exa_Man_t * p, int fOnlyAnd )
return 0;
}
}
+#ifdef USE_NODE_ORDER
// node ordering
for ( j = p->nVars; j < i; j++ )
for ( n = 0; n < p->nObjs; n++ ) if ( p->VarMarks[i][0][n] )
@@ -638,6 +639,7 @@ int Exa_ManAddCnfStart( Exa_Man_t * p, int fOnlyAnd )
if ( !bmcg_sat_solver_addclause( p->pSat, pLits2, 2 ) )
return 0;
}
+#endif
// two input functions
for ( k = 0; k < 3; k++ )
{
@@ -1017,6 +1019,7 @@ static int Exa3_ManAddCnfStart( Exa3_Man_t * p, int fOnlyAnd )
return 0;
}
}
+#ifdef USE_NODE_ORDER
// node ordering
for ( j = p->nVars; j < i; j++ )
for ( n = 0; n < p->nObjs; n++ ) if ( p->VarMarks[i][0][n] )
@@ -1027,6 +1030,7 @@ static int Exa3_ManAddCnfStart( Exa3_Man_t * p, int fOnlyAnd )
if ( !bmcg_sat_solver_addclause( p->pSat, pLits2, 2 ) )
return 0;
}
+#endif
if ( p->nLutSize != 2 )
continue;
// two-input functions