SMTtoTPTP - A Converter for Theorem Proving Formats

Abstract

Abstract. SMTtoTPTP is a converter from proof problems written in the SMT-LIB format into the TPTP TFF format. The SMT-LIB for-mat supports polymorphic sorts and frequently used theories like those of uninterpreted function symbols, arrays, and certain forms of arith-metics. The TPTP TFF format is an extension of the TPTP format widely used by automated theorem provers, adding a sort system and arithmetic theories. SMTtoTPTP is useful for, e.g., making SMT-LIB problems available to TPTP system developers, and for making TPTP systems available to users of SMT solvers. This paper describes how the conversion works, its functionality and limitations. Show more