The 11th IJCAR automated theorem proving system competition – CASC-J11

Abstract

The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic, Automated Theorem Proving (ATP) systems. CASC-J11 was the twenty-seventh competition in the CASC series. Twenty-four ATP systems competed in the various competition divisions. This paper presents an outline of the competition design and a commentated summary of the results.

Craig Interpolation with Clausal First-Order Tableaux

“…3 To get an idea of its practical feasibility, we experimented with an unbiased set of proofs of miscellaneous problems. For this we took those 112 CASC-J11 [50] problems that could be proven with Prover9 [34] in 400 s per problem, including a basic proof conversion with Prover9's tool Prooftrans. 4 The hyper conversion succeeded on 107 (or 96%) of these, given 400 s timeout per proof, where the actual median of used time was only 0.01 s. It was applied to a tableau in cut normal form that represents the proof tree of Prover9's proof.…”

“…The involved proof transformations lead from a proof with resolution and paramodulation via pure binary resolution and a clausal tableau in cut normal form to a clausal tableau with the hyper property. To get an impression of their practical feasibility, we tested them on problems from the latest CASC competition, CASC-J11 [50], as an unbiased set of proofs of miscellaneous problems.…”