[9] | 1 | #include <iostream> |
---|
| 2 | |
---|
| 3 | #include <ctime> // To seed random generator |
---|
| 4 | #include <sys/time.h> // To seed random generator |
---|
| 5 | |
---|
| 6 | //include shared files |
---|
| 7 | #include <SomeTime.h> |
---|
| 8 | #include <Interface/AnalyzerData.h> |
---|
| 9 | |
---|
| 10 | #include "MainSolver/MainSolver.h" |
---|
| 11 | #include "Basics.h" |
---|
| 12 | |
---|
| 13 | |
---|
| 14 | using namespace std; |
---|
| 15 | |
---|
| 16 | |
---|
| 17 | CMainSolver theSolver; |
---|
| 18 | |
---|
| 19 | // No description |
---|
| 20 | void finalcSATEvaluation() |
---|
| 21 | { |
---|
| 22 | const AnalyzerData &rAda = theRunAn.getData(); |
---|
| 23 | |
---|
| 24 | if(rAda.theExitState == TIMEOUT) |
---|
| 25 | { |
---|
| 26 | toSTDOUT(endl << " TIMEOUT !"<<endl); |
---|
| 27 | return; |
---|
| 28 | } |
---|
| 29 | |
---|
| 30 | toSTDOUT(endl<<endl); |
---|
| 31 | toSTDOUT("#Variables:\t\t"<< rAda.nVars<<endl); |
---|
| 32 | |
---|
| 33 | if(rAda.nVars != rAda.nUsedVars) |
---|
| 34 | toSTDOUT("#used Variables:\t"<< rAda.nUsedVars<<endl); |
---|
| 35 | toSTDOUT("#Clauses:\t\t"<< rAda.nOriginalClauses<<endl); |
---|
| 36 | toSTDOUT("#Clauses removed:\t"<< rAda.nRemovedClauses<<endl); |
---|
| 37 | toSTDOUT("\n#added Clauses: \t"<< rAda.nAddedClauses<<endl); |
---|
| 38 | |
---|
| 39 | toSTDOUT("\n# of all assignments:\t" << rAda.getAllAssignments() |
---|
| 40 | << " = 2^(" << rAda.nVars<<")" <<endl); |
---|
| 41 | |
---|
| 42 | toSTDOUT("Pr[satisfaction]:\t" << rAda.rnProbOfSat <<endl); |
---|
| 43 | |
---|
| 44 | toSTDOUT("# of solutions:\t\t" << rAda.getNumSatAssignments() <<endl); |
---|
| 45 | toSTDOUT("#SAT (full): \t\t"); |
---|
| 46 | if(!CSolverConf::quietMode) rAda.printNumSatAss_whole(); |
---|
| 47 | toSTDOUT(endl); |
---|
| 48 | |
---|
| 49 | toDEBUGOUT(".. found in:\t\t" << rAda.nReceivedSatAssignments << " units"<<endl); |
---|
| 50 | |
---|
| 51 | toSTDOUT(endl); |
---|
| 52 | |
---|
| 53 | toSTDOUT("Num. conflicts:\t\t" << rAda.nConflicts<<endl); |
---|
| 54 | toSTDOUT("Num. implications:\t" << rAda.nImplications<<endl); |
---|
| 55 | toSTDOUT("Num. decisions:\t\t" << rAda.nDecisions<<endl); |
---|
| 56 | toSTDOUT("max decision level:\t" << rAda.maxDecLevel<<"\t\t"); |
---|
| 57 | toSTDOUT("avg decision level:\t"<< rAda.get(AVG_DEC_LEV)<<endl); |
---|
| 58 | toSTDOUT("avg conflict level:\t"<< rAda.get(AVG_CONFLICT_LEV)<<endl); |
---|
| 59 | toSTDOUT("avg solution level:\t"<< rAda.get(AVG_SOLUTION_LEV)<<endl); |
---|
| 60 | |
---|
| 61 | toSTDOUT("CCLLen 1stUIP - max:\t"<< rAda.get(LONGEST_CCL_1stUIP)); |
---|
| 62 | toSTDOUT("\t avg:\t"<< rAda.get(AVG_CCL_1stUIP)<<endl); |
---|
| 63 | toSTDOUT("CCLLen lastUIP - max:\t"<< rAda.get(LONGEST_CCL_lastUIP)); |
---|
| 64 | toSTDOUT("\t avg:\t"<< rAda.get(AVG_CCL_lastUIP)<<endl); |
---|
| 65 | |
---|
| 66 | |
---|
| 67 | toSTDOUT(endl); |
---|
| 68 | toSTDOUT("FormulaCache stats:"<<endl); |
---|
| 69 | toSTDOUT("memUse:\t\t\t"<<rAda.get(FCACHE_MEMUSE) <<endl); |
---|
| 70 | toSTDOUT("cached:\t\t\t"<<rAda.get(FCACHE_CACHEDCOMPS)<<endl); |
---|
| 71 | toSTDOUT("used Buckets:\t\t"<<rAda.get(FCACHE_USEDBUCKETS)<<endl); |
---|
| 72 | toSTDOUT("cache retrievals:\t"<<rAda.get(FCACHE_RETRIEVALS)<<endl); |
---|
| 73 | toSTDOUT("cache tries:\t\t"<<rAda.get(FCACHE_INCLUDETRIES)<<endl); |
---|
| 74 | |
---|
| 75 | toSTDOUT("\n\nZeit: "<<rAda.elapsedTime<<"s\n\n"); |
---|
| 76 | |
---|
| 77 | } |
---|
| 78 | |
---|
| 79 | |
---|
| 80 | int main_(int argc, char *argv[]) |
---|
| 81 | { |
---|
| 82 | char *s; |
---|
| 83 | char dataFile[1024]; |
---|
| 84 | memset(dataFile,0,1024); |
---|
| 85 | strcpy(dataFile,"data.txt"); |
---|
| 86 | bool fileout = false; |
---|
| 87 | |
---|
| 88 | CSolverConf::analyzeConflicts = true; |
---|
| 89 | CSolverConf::doNonChronBackTracking = true; |
---|
| 90 | |
---|
| 91 | //toSTDOUT ("sharpSAT v1.1, July 1st, 2006"<<endl); |
---|
| 92 | //toSTDOUT ("copyright 2006, Humboldt UniversitÀt zu Berlin"<<endl); |
---|
| 93 | |
---|
| 94 | if (argc <= 1){ |
---|
| 95 | |
---|
| 96 | cout << "Usage: sharpSAT [options] [CNF_File]"<<endl; |
---|
| 97 | cout << "Options: "<<endl; |
---|
| 98 | cout << "\t -noPP \t turn off preprocessing"<<endl; |
---|
| 99 | cout << "\t -noCA \t no conflict analysis nor -clauses"<<endl; |
---|
| 100 | cout << "\t -noNCB \t turn off nonchronological backtracking"<<endl; |
---|
| 101 | cout << "\t -q \t quiet mode"<<endl; |
---|
| 102 | cout << "\t -t [s] \t set time bound to s seconds"<<endl; |
---|
| 103 | cout << "\t -noCC \t turn off component caching"<<endl; |
---|
| 104 | cout << "\t -cs [n]\t set max cache size to n MB"<<endl; |
---|
| 105 | cout << "\t -noIBCP\t turn off implicit BCP"<<endl; |
---|
| 106 | cout << "\t"<<endl; |
---|
| 107 | |
---|
| 108 | return -1; |
---|
| 109 | } |
---|
| 110 | |
---|
| 111 | for(int i = 1; i < argc; i++) |
---|
| 112 | { |
---|
| 113 | if(strcmp(argv[i],"-noNCB") == 0) CSolverConf::doNonChronBackTracking = false; |
---|
| 114 | if(strcmp(argv[i],"-noCC") == 0) CSolverConf::allowComponentCaching = false; |
---|
| 115 | if(strcmp(argv[i],"-noIBCP") == 0) CSolverConf::allowImplicitBCP = false; |
---|
| 116 | if(strcmp(argv[i],"-noPP") == 0) CSolverConf::allowPreProcessing = false; |
---|
| 117 | else if(strcmp(argv[i],"-noCA") == 0) |
---|
| 118 | { |
---|
| 119 | CSolverConf::analyzeConflicts = false; |
---|
| 120 | } |
---|
| 121 | else if(strcmp(argv[i],"-q") == 0) CSolverConf::quietMode = true; |
---|
| 122 | else if(strcmp(argv[i],"-FrA") == 0) |
---|
| 123 | { |
---|
| 124 | memset(dataFile,0,1024); |
---|
| 125 | fileout = true; |
---|
| 126 | if(argc <= i+1){ toSTDOUT("wrong parameters"<<endl); return -1;} |
---|
| 127 | strcpy(dataFile,argv[i+1]); |
---|
| 128 | } |
---|
| 129 | else if(strcmp(argv[i],"-t") == 0) |
---|
| 130 | { |
---|
| 131 | if(argc <= i+1){ toSTDOUT("wrong parameters"<<endl); return -1;} |
---|
| 132 | CSolverConf::secsTimeBound = atoi(argv[i+1]); |
---|
| 133 | toSTDOUT("time bound:" <<CSolverConf::secsTimeBound<<"s\n"); |
---|
| 134 | theSolver.setTimeBound(CSolverConf::secsTimeBound); |
---|
| 135 | } |
---|
| 136 | else if(strcmp(argv[i],"-cs") == 0) |
---|
| 137 | { |
---|
| 138 | if(argc <= i+1){toSTDOUT("wrong parameters"<<endl); return -1;} |
---|
| 139 | CSolverConf::maxCacheSize = atoi(argv[i+1])*1024*1024; |
---|
| 140 | //cout <<"maxCacheSize:" <<CSolverConf::maxCacheSize<<"bytes\n"; |
---|
| 141 | } |
---|
| 142 | else s = argv[i]; |
---|
| 143 | } |
---|
| 144 | |
---|
| 145 | toSTDOUT("cachesize Max:\t"<<CSolverConf::maxCacheSize/1024 << " kbytes"<<endl); |
---|
| 146 | |
---|
| 147 | // first: delete all data in the output |
---|
| 148 | if(fileout) theRunAn.getData().writeToFile(dataFile); |
---|
| 149 | |
---|
| 150 | theRunAn = CRunAnalyzer(); |
---|
| 151 | |
---|
| 152 | theSolver.solve(s); |
---|
| 153 | |
---|
| 154 | theRunAn.finishcountSATAnalysis(); |
---|
| 155 | finalcSATEvaluation(); |
---|
| 156 | if(fileout) theRunAn.getData().writeToFile(dataFile); |
---|
| 157 | return 0; |
---|
| 158 | } |
---|