A Satisfiability-modulo-theory (SMT) proof checker compatible with an existing SMT solver

Satisfiability-modulo-theory (SMT) solvers are state-of-the-art tools for verifying computer programs. They do this using a set of theories and a search algorithm to prove the correctness of software. One deficiency of SMT-solving is that there is no standardised format for SMT-proofs and therefore no standard approach to checking their validity.