I am trying to find out how SCIP treats SAT problems.
In the SCIP website, it is recommended to type 'set emphasis cpsolver' in the command line for SAT problems after reading the cnf file. The SCIP solver would then do its own thing after typing 'optimize'. I am not particularly skilled in code tracing and would like to know the pathway the SCIP solver takes after typing the 'set emphasis cpsolver' command.
Does this command take the SAT problem and simply call a SAT solver from elsewhere? Or does it treat the SAT problem as a discrete optimisation problem and use the classical methods such as cutting planes, branch and bound to solve it?
So far, I have ran SCIP on 50 instances of SAT problems on 8h time limit each, with no result. Using SAT solvers with backdoors under the same 8h time limit leads to successful solving of about half the instances.