Sciweavers

Share
CADE
2015
Springer

SMTtoTPTP - A Converter for Theorem Proving Formats

4 years 7 months ago
SMTtoTPTP - A Converter for Theorem Proving Formats
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, and for making TPTP systems available to users of SMT solvers. This paper describes how the conversion works, its functionality and limitations.
Peter Baumgartner
Added 17 Apr 2016
Updated 17 Apr 2016
Type Journal
Year 2015
Where CADE
Authors Peter Baumgartner
Comments (0)
books