%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN970+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 09:43:29 AM UTC 2026
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 4 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 20 ( 7 ~; 3 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 17 ( 3 sgn 8 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
! [A,B] :
? [X,Y] :
( ( p(X)
=> r(Y) )
=> ( p(A)
=> r(B) ) ),
file('theBenchmark.p',prove_this) ).
fof(prove_this_neg,negated_conjecture,
~ ! [A,B] :
? [X,Y] :
( ( p(X)
=> r(Y) )
=> ( p(A)
=> r(B) ) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(nnf_1,plain,
? [A,B] :
! [X,Y] :
( ~ r(B)
& p(A)
& ( r(Y)
| ~ p(X) ) ),
inference(fof_nnf,[status(thm)],[prove_this_neg]) ).
fof(sk_prove_this_neg,plain,
! [X,Y] :
( ~ r(sK1)
& p(sK0)
& ( r(Y)
| ~ p(X) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(A,sK0),skolemize(B,sK1)],[nnf_1]) ).
cnf(c_2,negated_conjecture,
p(sK0),
inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).
cnf(c_3,negated_conjecture,
( r(B)
| ~ p(A) ),
inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).
cnf(c_4,negated_conjecture,
~ r(sK1),
inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).
cnf(c_5,negated_conjecture,
r(A),
inference(resolve,[status(thm)],[c_2,c_3]) ).
cnf(c_6,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_4,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN970+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n013.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 18:51:51 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.36 % Process 3395430 was started by sandbox2 on n013,
% 0.12/0.36 % Sat Sep 26 18:51:51 2026
% 0.12/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.36
% 0.12/0.36 % From the command line: assign(max_seconds, 300).
% 0.12/0.37
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37
% 0.12/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.12/0.37 % Length of proof is 6.
% 0.12/0.37 % Level of proof is 3.
% 0.12/0.37 % Maximum clause weight is 0.000.
% 0.12/0.37 % Given clauses 0.
% 0.12/0.37
% 0.12/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------