%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET043+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 : n015.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 02:41:42 PM UTC 2026
% Result : Theorem 2.30s 0.76s
% Output : Proof 2.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 22 ( 12 ~; 6 |; 2 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn 4 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
~ ? [X] :
! [Y] :
( element(Y,X)
<=> ~ element(Y,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel39) ).
fof(f0_neg,negated_conjecture,
~ ~ ? [X] :
! [Y] :
( element(Y,X)
<=> ~ element(Y,Y) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
? [X] :
! [Y] :
( ( element(Y,Y)
| element(Y,X) )
& ( ~ element(Y,Y)
| ~ element(Y,X) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [Y] :
( ( element(Y,Y)
| element(Y,sk0) )
& ( ~ element(Y,Y)
| ~ element(Y,sk0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c1,plain,
( element(X1,X1)
| element(X1,sk0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p3,plain,
element(sk0,sk0),
inference(factoring,[status(thm)],[c1]) ).
cnf(c0,plain,
( ~ element(X1,X1)
| ~ element(X1,sk0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p2,plain,
~ element(sk0,sk0),
inference(factoring,[status(thm)],[c0]) ).
cnf(p4,plain,
$false,
inference(resolution,[status(thm)],[p3,p2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET043+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.37 % Computer : n015.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Thu Sep 24 09:27:56 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.30/0.76 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.30/0.76 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------