  Correctness of results returned from mixed-integer linear programming (MILP)
solvers is highly desirable, particularly in the context of applications such
as hardware verification, compiler optimization, or machine-assisted theorem
proving. To this end, VIPR is the first recently proposed certificate format
for answers produced by MILP solvers. We design a schema to encode VIPR's
inference rules as Satisfiability Modulo Theories (SMT) instances and show the
equivalence of the certificates' correctness and the satisfiability of the
corresponding SMT instances. In addition, we implement this schema with and
without parallelization in a checker for VIPR certificates and test the
viability of this approach on benchmark instances found in the literature with
the cvc5 solver.
