Releases: leoprover/tptp-utils
Version 1.2.3
tptp-utils is an application for pre- and post-processing automated theorem proving input files (so-called problem 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.
Version 1.2.3 updates:
- Update of parser library (new NCL TPTP syntax)
Simply download the pre-built executable JAR and run it using java -jar tptp-utils-app-1.2.3.jar, or build the tool from source using sbt.
Version 1.2.1
tptp-utils is an application for pre- and post-processing automated theorem proving input files (so-called problem 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.
Version 1.2.1 updates:
- Various bug fixes
- Support for importing files from LegalRuleML format (experimental)
- Updated parser to most recent NCL TPTP syntax
- Various refactoring and updates in libraries
Simply download the pre-built executable JAR and run it using java -jar tptp-utils-app-1.2.1.jar, or build the tool from source using sbt.
Version 1.1
tptp-utils is an application for pre- and post-processing automated theorem proving input files (so-called problem 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.
Current features include:
- Syntax checking (validate that the input file is syntactically well-formed)
- Reparsing (Read the input file and print an abstract syntax tree in JSON format)
- Dialect transformation (Translate problem from TPTP dialect A to TPTP dialect B)
- Linting (Read and check the problem file for suspicious content, malformed logic specification, etc.)
Note that the linting capacities are still quite limited and will be enhanced continuously.
Simply download the pre-built executable JAR and run it using java -jar tptp-utils-app-1.1.jar, or build the tool from source using sbt.
Version 1.0
tptp-utils is an application for post-processing automated theorem proving input files (i.e., problem 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.
Current features include:
- Syntax checking (validate that the input file is syntactically well-formed)
- Reparsing (Read the input file and print an abstract syntax tree in JSON format)
- Dialect transformation (Translate problem from TPTP dialect A to TPTP dialect B)