%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN045+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n003.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 : Fri Sep 25 03:33:34 PM UTC 2026
% Result : Theorem 4.12s 0.99s
% Output : Proof 4.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 3 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 92 ( 31 ~; 41 |; 18 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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(f0,conjecture,
( ( ( r
& q )
| p )
<=> ( ( r
| p )
& ( q
| p ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel13) ).
fof(f0_neg,negated_conjecture,
~ ( ( ( r
& q )
| p )
<=> ( ( r
| p )
& ( q
| p ) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ( ( r
| p )
& ( q
| p )
& ( ~ r
| ~ q )
& ~ p )
| ( ( ( ~ r
& ~ p )
| ( ~ q
& ~ p ) )
& ( ( r
& q )
| p ) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
( ( ( r
| p )
& ( q
| p )
& ( ~ r
| ~ q )
& ~ p )
| ( ( ( ~ r
& ~ p )
| ( ~ q
& ~ p ) )
& ( ( r
& q )
| p ) ) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c21,plain,
( ~ r
| ~ q
| ~ r
| ~ q ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p32,plain,
( ~ r
| ~ r
| ~ q ),
inference(factoring,[status(thm)],[c21]) ).
cnf(p34,plain,
( ~ r
| ~ q ),
inference(factoring,[status(thm)],[p32]) ).
cnf(c2,plain,
( q
| p
| q
| p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p26,plain,
( q
| q
| p ),
inference(factoring,[status(thm)],[c2]) ).
cnf(p28,plain,
( q
| p ),
inference(factoring,[status(thm)],[p26]) ).
cnf(p35,plain,
( p
| ~ r ),
inference(resolution,[status(thm)],[p34,p28]) ).
cnf(c7,plain,
( r
| p
| r
| p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p29,plain,
( r
| r
| p ),
inference(factoring,[status(thm)],[c7]) ).
cnf(p31,plain,
( r
| p ),
inference(factoring,[status(thm)],[p29]) ).
cnf(p36,plain,
( p
| p ),
inference(resolution,[status(thm)],[p35,p31]) ).
cnf(p37,plain,
p,
inference(factoring,[status(thm)],[p36]) ).
cnf(c8,plain,
( ~ p
| ~ p
| ~ p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p24,plain,
( ~ p
| ~ p ),
inference(factoring,[status(thm)],[c8]) ).
cnf(p25,plain,
~ p,
inference(factoring,[status(thm)],[p24]) ).
cnf(p38,plain,
$false,
inference(resolution,[status(thm)],[p37,p25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN045+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.35 % Computer : n003.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Thu Sep 24 23:57:21 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.12/0.99 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.12/0.99 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------