tptp-utils 1.4.2

tptp-utils is an application for pre- and post-processing automated theorem proving input files given in the TPTP (Thousands of Problems for Theorem Proving) syntax standard. It is written in Scala and freely available as open-source software. The full functionality is decribed in the README.

Version 1.4.2 updates:

• Added support for TPTP epsilon binder
• Rework CLI to prevent accidental file overwrites (output file is now a --argument instead of a positional one)
• Add command normalization to allow simple formula normal form computations (so far only prenex normal form)
• Add command fragment to allow for scanning of decidable FOL fragments (only for FOF and TFF), see README for all supported fragments.
• Added --recursive option to allow recursive parsing of TPTP files (i.e., with includes).
• Updated Scala version

Full Changelog: https://github.com/leoprover/tptp-utils/compare/v1.2.3...v1.4.2

Simply download the pre-built executable JAR and run it using java -jar tptp-utils-app-1.4.2.jar, or build the tool from source using sbt or make.