Most algorithms for SAT and MaxSAT are based on the
branch-and-bound process [1]}. The Strong Exponential Time
Hypothesis conjectures that SAT cannot be solved in time
\(O^*(2^{cn})\)  for any constant \(c < 1\) , where \(n\)  is the number of
variables in the input CNF formula [2]}. The hypothesis indicates,
to some extent, a popular opinion that branch-and-bound is perhaps
unavoidable in solving the SAT problem and its variations.
