Proceedings of the 6th IJCAR ATP System Competition (CASC-J6)

Sutcliffe, Geoff

doi:10.29007/lvcc

Cited by 9 publications

(8 citation statements)

References 64 publications

(96 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SOTAC is calculated as follows: the SOTAC value of each formula is the inverse of the number of solvers which solved the formula. Then, the SOTAC value of each solver is the average SOTAC value of the problems it could solve [35].…”

Section: Application Trackmentioning

confidence: 99%

QBF Gallery 2014: The QBF Competition at the FLoC 2014 Olympic Games

Janota

Jordan

Klieber

et al. 2016

SAT

View full text Add to dashboard Cite

The QBF Gallery 2014 was a competitive evaluation for QBF solvers organized as part of the FLoC 2014 Olympic Games during the Vienna Summer of Logic. The QBF Gallery 2014 featured three different tracks on formulas in prenex conjunctive normal form (PCNF) including more than 1200 formulas to be solved. Gold, silver, and bronze track medals were awarded to the solvers that solved the most formulas in each of the three tracks. Additionally, the three participants that were most successful over the complete benchmark set were awarded with Kurt Gödel medals, the official prizes of the FLoC 2014 Olympic Games. In this paper, we give an overview of the setup and rules of the competition, briefly review the participating solvers, and finally report on the results of the QBF Gallery 2014.

show abstract

Section: Application Trackmentioning

confidence: 99%

QBF Gallery 2014: The QBF Competition at the FLoC 2014 Olympic Games

Janota

Jordan

Klieber

et al. 2016

SAT

View full text Add to dashboard Cite

show abstract

“…They are CVC3 [5] H2WO4 [33], leanCoP-Ω [31], Otter [20], MELIA [7], MetiTarski [1], SNARK [28], SPASS+T [22], SPASS-XDB [35], ToFoF, Vampire, Z3 [14]. ToFoF is the system that has no arithmetic capability -it is simply the TPTP2X implementation of the translation described in Section 2.3, combined with either the E prover 7 Free function symbols with the result type $i are less problematic.…”

Section: Tff Problems Atp Systems Tptp Softwarementioning

confidence: 99%

The TPTP Typed First-Order Form with Arithmetic

Sutcliffe

Schulz

Claessen

et al. 2012

Logic for Programming, Artificial Intelligence, and Reasoning

Self Cite

View full text Add to dashboard Cite

Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has been extended to include a typed first-order logic, which in turn has enabled the integration of arithmetic. This paper describes these developments. Motivation and HistoryThe TPTP World [32] is a well established infrastructure that supports research, development, and deployment of Automated Theorem Proving (ATP) systems. The TPTP World is based on the Thousands of Problems for Theorem Provers (TPTP) problem library [30], and includes the TPTP language, the SZS ontologies, the Thousands of Solutions from Theorem Provers (TSTP) solution library, various tools associated with the libraries, and the CADE ATP System Competition (CASC). This infrastructure has been central to the progress that has been made in the development of high performance first-order ATP systems -most state of the art systems natively read the TPTP language, many produce proofs or models in the TSTP format, much testing and development is done using the TPTP problem library, and CASC is an annual focal point where developers meet to discuss new ideas and advances in ATP techniques.Originally the TPTP supported only first-order problems in clause normal form (CNF). Over the years support for the full first-order form (FOF) and typed higher-order form (THF) have been added. Recently the simply typed first-order form (TFF) has been added. TFF has in turn been used as the basis for supporting arithmetic. Problems that use these new features have been added to the TPTP problem library, and ATP systems that can solve these problems have been developed. This paper describes the key steps of these developments.While the development of the TPTP World for typed first-order logic is new, several similar logics have been described previously, e.g., [36,26,13]. However, there are no contemporary ATP systems that implement those logics. There is active related research in the SMT community, which started in 2003 [24]. There are high performance systems for the various logics of the SMT-LIB 1 , e.g., those1 See the SMT-LIB web page

show abstract

“…For the experiments, we selected several high-performance theorem provers for untyped first-order formulas with equality. Most of the provers participated at the CASC-19 [21] proving competition in the FOL-category. We used two versions of e-setheo [15] which were both derived from the CASC-version.…”

Section: Theorem Proversmentioning

confidence: 99%

Using Automated Theorem Provers to Certify Auto-generated Aerospace Software

Denney¹,

Fischer

Schumann

2004

Automated Reasoning

View full text Add to dashboard Cite

We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligations which are then processed by an automated first-order theorem prover (ATP). For full automation, however, the obligations must be aggressively preprocessed and simplified. We discuss the unique requirements this application places on the ATPs and demonstrate how the individual simplification stages, which are implemented by rewriting, influence the ability of the ATPs to solve the proof tasks. Our results are based on 13 certification experiments that lead to more than 25,000 proof tasks which have each been attempted by Vampire, Spass, and e-setheo.

show abstract

Proceedings of the 6th IJCAR ATP System Competition (CASC-J6)

Cited by 9 publications

References 64 publications

QBF Gallery 2014: The QBF Competition at the FLoC 2014 Olympic Games

QBF Gallery 2014: The QBF Competition at the FLoC 2014 Olympic Games

The TPTP Typed First-Order Form with Arithmetic

Using Automated Theorem Provers to Certify Auto-generated Aerospace Software

Contact Info

Product

Resources

About