%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN045+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n002.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:36:50 AM UTC 2026
% Result : Theorem 0.09s 0.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 5 unt; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 20 ( 5 ~; 9 |; 4 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel13,conjecture,
( ( ( r
& q )
| p )
<=> ( ( r
| p )
& ( q
| p ) ) ),
file('theBenchmark.p',pel13) ).
fof(pel13_neg,negated_conjecture,
~ ( ( ( r
& q )
| p )
<=> ( ( r
| p )
& ( q
| p ) ) ),
inference(assume_negation,[status(cth)],[pel13]) ).
cnf(c_2,negated_conjecture,
( q
| p ),
inference(clausify,[status(thm)],[pel13_neg]) ).
cnf(c_3,negated_conjecture,
( r
| p ),
inference(clausify,[status(thm)],[pel13_neg]) ).
cnf(c_4,negated_conjecture,
~ p,
inference(clausify,[status(thm)],[pel13_neg]) ).
cnf(c_5,negated_conjecture,
( ~ r
| ~ q ),
inference(clausify,[status(thm)],[pel13_neg]) ).
cnf(c_6,negated_conjecture,
r,
inference(resolve,[status(thm)],[c_4,c_3]) ).
cnf(c_7,negated_conjecture,
q,
inference(resolve,[status(thm)],[c_4,c_2]) ).
cnf(c_9,negated_conjecture,
~ r,
inference(resolve,[status(thm)],[c_7,c_5]) ).
cnf(c_8,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_6,c_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN045+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n002.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 17:08:35 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 2269682 was started by sandbox on n002,
% 0.09/0.36 % Sat Sep 26 17:08:35 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.38
% 0.09/0.38 % SZS status Theorem for theBenchmark
% 0.09/0.38
% 0.09/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.38 % Length of proof is 8.
% 0.09/0.38 % Level of proof is 3.
% 0.09/0.38 % Maximum clause weight is 2.000.
% 0.09/0.38 % Given clauses 0.
% 0.09/0.38
% 0.09/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------