SMTtoTPTP – A Converter for Theorem Proving Formats [chapter]

Peter Baumgartner
2015 Lecture Notes in Computer Science  
SMTtoTPTP is a converter from proof problems written in the SMT-LIB format into the TPTP TFF format. The SMT-LIB format supports polymorphic sorts and frequently used theories like those of uninterpreted function symbols, arrays, and certain forms of arithmetics. 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,
more » ... nd for making TPTP systems available to users of SMT solvers. This paper describes how the conversion works, its functionality and limitations. useful for, e. g., making the existing large SMT-LIB problem libraries available to (developers of) TPTP systems, and, perhaps more importantly, making TPTP systems available to users used to SMT-LIB. SMTtoTPTP may also help embed TPTP systems as sub-systems in other systems that use SMT-LIB as an interface language, e.g., interactive proof assistants. However, the SMTtoTPTP support for that needs to remain partial as some SMT-LIB commands, e.g. those related to proof management, are not translatable into TPTP. On notation: the SMT-LIB documents speak about sorts whereas in the TPTP world one has types. I use both terms below in their corresponding contexts, which is the only difference for the purpose of this paper. An operator is either a function or a predicate symbol. Unlike the TFF format, SMT-LIB does not formally distinguish between the boolean and other sorts. Hence, all SMT-LIB operators are function symbols.
doi:10.1007/978-3-319-21401-6_19 fatcat:gzyy2wkz25hktcao3kuzqabgdq