%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET043+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 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 : Thu Sep 24 08:56:03 AM UTC 2026
% Result : Theorem 0.12s 0.37s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel39,conjecture,
~ ? [X] :
! [Y] :
( element(Y,X)
<=> ~ element(Y,Y) ),
file('theBenchmark.p',pel39) ).
fof(f_1_1,negated_conjecture,
? [X] :
! [Y] :
( element(Y,X)
<=> ~ element(Y,Y) ),
inference(negate,[status(cth)],[pel39]) ).
fof(f_1_2,negated_conjecture,
? [X] :
! [Y] :
( ( element(Y,X)
| element(Y,Y) )
& ( ~ element(Y,Y)
| ~ element(Y,X) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
? [U_1] :
! [U_0] :
( ( element(U_0,U_1)
| element(U_0,U_0) )
& ( ~ element(U_0,U_0)
| ~ element(U_0,U_1) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
? [U_1] :
( ! [U_3] :
( element(U_3,U_1)
| element(U_3,U_3) )
& ! [U_2] :
( ~ element(U_2,U_2)
| ~ element(U_2,U_1) ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ! [U_3] :
( element(U_3,sK1)
| element(U_3,U_3) )
& ! [U_2] :
( ~ element(U_2,U_2)
| ~ element(U_2,sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ! [U_3] :
( element(U_3,sK1)
| element(U_3,U_3) )
& ! [U_2] :
( ~ element(U_2,U_2)
| ~ element(U_2,sK1) ) ),
inference(definitional_conversion,[status(esa)],[f_1_5]) ).
cnf(f_1_7,negated_conjecture,
( ~ element(U_2,U_2)
| ~ element(U_2,sK1) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
( element(U_3,sK1)
| element(U_3,U_3) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET043+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n003.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % 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 19 21:34:29 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------