What is the example of another problem characterized by large instances that is routinely solved by SAT handlers employing efficient algorithms?
For example, the decision problem in Presburger arithmetic has been shown not to be in P, yet algorithms have been written that solve the problem in reasonable times in most cases.