complexity theory – Is clause learning in SAT parsimonius?

I have a model counting program bob. On some graph coloring formulas, bob got the right answer only after removing clause learning. That is to say, with clause learning, bob sometimes gets too many solutions, while satisfiability remains stable. This would be big news if true.