%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET043-5 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n006.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 : Unsatisfiable 2.56s 0.78s
% Output : Proof 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 3 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 8 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f1,negated_conjecture,
( element(X,a)
| element(X,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f1_nnf,plain,
! [X] :
( element(X,a)
| element(X,X) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X] :
( element(X,a)
| element(X,X) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( element(X0,a)
| element(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p3,plain,
element(a,a),
inference(factoring,[status(thm)],[c1]) ).
cnf(f0,negated_conjecture,
( ~ element(X,X)
| ~ element(X,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f0_nnf,plain,
! [X] :
( ~ element(X,X)
| ~ element(X,a) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X] :
( ~ element(X,X)
| ~ element(X,a) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( ~ element(X0,X0)
| ~ element(X0,a) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p2,plain,
~ element(a,a),
inference(factoring,[status(thm)],[c0]) ).
cnf(p4,plain,
$false,
inference(resolution,[status(thm)],[p3,p2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET043-5 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n006.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 : Thu Sep 24 09:24:12 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.56/0.78 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.56/0.78 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------