[1] http://www21.in.tum.de/~boehmes/proofrec.pdf
[2] http://stackoverflow.com/questions/11531589/difference-betwe...
[1] http://www21.in.tum.de/~boehmes/proofrec.pdf
[2] http://stackoverflow.com/questions/11531589/difference-betwe...
I haven't run into that issue myself, but I've mostly written toy code for it.
The tree of resolution deductions that SAT provers (modulo theories or otherwise) like Z3 produce is of course a proof in a valid proof system. Typically that is some variant of a propositional resolution proof system. The problem is that the reasoning is classical: to show A, falsity is deduced from (not A). This is not constructively valid, you can only deduce (not not A) if (not A) implies falsity.
So the resolution proof that Z3 outputs can be converted to a classical proof and expressed in classical proof systems like (Isabelle/)HOL, but not in constructive systems like Coq and Agda.