%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN391+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n018.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:34:35 PM UTC 2026
% Result : Theorem 3.27s 0.86s
% Output : Proof 3.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 57 ( 24 ~; 21 |; 10 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 3 ( 2 usr; 3 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,
( ( ( ~ p2
| p1 )
& ( p2
| ~ p1 )
& ( p2
| p1 ) )
=> ~ ( ~ p2
| ~ p1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel9) ).
fof(f0_neg,negated_conjecture,
~ ( ( ( ~ p2
| p1 )
& ( p2
| ~ p1 )
& ( p2
| p1 ) )
=> ~ ( ~ p2
| ~ p1 ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ( ~ p2
| ~ p1 )
& ( ~ p2
| p1 )
& ( p2
| ~ p1 )
& ( p2
| p1 ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
( ( ~ p2
| ~ p1 )
& ( ~ p2
| p1 )
& ( p2
| ~ p1 )
& ( p2
| p1 ) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c2,plain,
( ~ p2
| p1 ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c0,plain,
( p2
| p1 ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p4,plain,
( p1
| p1 ),
inference(resolution,[status(thm)],[c2,c0]) ).
cnf(p5,plain,
p1,
inference(factoring,[status(thm)],[p4]) ).
cnf(c3,plain,
( ~ p2
| ~ p1 ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p7,plain,
~ p2,
inference(resolution,[status(thm)],[p5,c3]) ).
cnf(c1,plain,
( p2
| ~ p1 ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p6,plain,
p2,
inference(resolution,[status(thm)],[p5,c1]) ).
cnf(p8,plain,
$false,
inference(resolution,[status(thm)],[p7,p6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN391+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 01:06:20 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.27/0.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.27/0.86 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------