%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET047+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n014.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:04 AM UTC 2026
% Result : Theorem 0.12s 0.39s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel43_1,axiom,
! [X,Y] :
( set_equal(X,Y)
<=> ! [Z] :
( element(Z,X)
<=> element(Z,Y) ) ),
file('theBenchmark.p',pel43_1) ).
fof(pel43,conjecture,
! [X,Y] :
( set_equal(X,Y)
<=> set_equal(Y,X) ),
file('theBenchmark.p',pel43) ).
fof(f_1_1,plain,
! [X,Y] :
( ( set_equal(X,Y)
| ? [Z] :
( ( ~ element(Z,X)
& element(Z,Y) )
| ( ~ element(Z,Y)
& element(Z,X) ) ) )
& ( ! [Z] :
( ( element(Z,X)
| ~ element(Z,Y) )
& ( element(Z,Y)
| ~ element(Z,X) ) )
| ~ set_equal(X,Y) ) ),
inference(fof_nnf,[status(thm)],[pel43_1]) ).
fof(f_1_2,plain,
! [U_3,U_2] :
( ( set_equal(U_3,U_2)
| ? [U_1] :
( ( ~ element(U_1,U_3)
& element(U_1,U_2) )
| ( ~ element(U_1,U_2)
& element(U_1,U_3) ) ) )
& ( ! [U_0] :
( ( element(U_0,U_3)
| ~ element(U_0,U_2) )
& ( element(U_0,U_2)
| ~ element(U_0,U_3) ) )
| ~ set_equal(U_3,U_2) ) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ! [U_11,U_9] :
( set_equal(U_11,U_9)
| ? [U_7] :
( ~ element(U_7,U_11)
& element(U_7,U_9) )
| ? [U_6] :
( ~ element(U_6,U_9)
& element(U_6,U_11) ) )
& ! [U_10,U_8] :
( ( ! [U_5] :
( element(U_5,U_10)
| ~ element(U_5,U_8) )
& ! [U_4] :
( element(U_4,U_8)
| ~ element(U_4,U_10) ) )
| ~ set_equal(U_10,U_8) ) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
fof(f_1_4,plain,
( ! [U_11,U_9] :
( set_equal(U_11,U_9)
| ? [U_7] :
( ~ element(U_7,U_11)
& element(U_7,U_9) )
| ( ~ element(sK1(U_11,U_9),U_9)
& element(sK1(U_11,U_9),U_11) ) )
& ! [U_10,U_8] :
( ( ! [U_5] :
( element(U_5,U_10)
| ~ element(U_5,U_8) )
& ! [U_4] :
( element(U_4,U_8)
| ~ element(U_4,U_10) ) )
| ~ set_equal(U_10,U_8) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_6,sK1(U_11,U_9))],[f_1_3]) ).
fof(f_1_5,plain,
( ! [U_11,U_9] :
( set_equal(U_11,U_9)
| ( ~ element(sK2(U_11,U_9),U_11)
& element(sK2(U_11,U_9),U_9) )
| ( ~ element(sK1(U_11,U_9),U_9)
& element(sK1(U_11,U_9),U_11) ) )
& ! [U_10,U_8] :
( ( ! [U_5] :
( element(U_5,U_10)
| ~ element(U_5,U_8) )
& ! [U_4] :
( element(U_4,U_8)
| ~ element(U_4,U_10) ) )
| ~ set_equal(U_10,U_8) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_7,sK2(U_11,U_9))],[f_1_4]) ).
cnf(f_1_6,plain,
( element(U_4,U_8)
| ~ element(U_4,U_10)
| ~ set_equal(U_10,U_8) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_7,plain,
( element(U_5,U_10)
| ~ element(U_5,U_8)
| ~ set_equal(U_10,U_8) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_8,plain,
( element(sK2(U_11,U_9),U_9)
| element(sK1(U_11,U_9),U_11)
| set_equal(U_11,U_9) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_9,plain,
( ~ element(sK2(U_11,U_9),U_11)
| element(sK1(U_11,U_9),U_11)
| set_equal(U_11,U_9) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_10,plain,
( element(sK2(U_11,U_9),U_9)
| ~ element(sK1(U_11,U_9),U_9)
| set_equal(U_11,U_9) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_11,plain,
( ~ element(sK2(U_11,U_9),U_11)
| ~ element(sK1(U_11,U_9),U_9)
| set_equal(U_11,U_9) ),
inference(clausify,[status(thm)],[f_1_5]) ).
fof(f_2_1,negated_conjecture,
~ ! [X,Y] :
( set_equal(X,Y)
<=> set_equal(Y,X) ),
inference(negate,[status(cth)],[pel43]) ).
fof(f_2_2,negated_conjecture,
? [X,Y] :
( ( ~ set_equal(X,Y)
& set_equal(Y,X) )
| ( ~ set_equal(Y,X)
& set_equal(X,Y) ) ),
inference(fof_nnf,[status(thm)],[f_2_1]) ).
fof(f_2_3,negated_conjecture,
? [U_13,U_12] :
( ( ~ set_equal(U_13,U_12)
& set_equal(U_12,U_13) )
| ( ~ set_equal(U_12,U_13)
& set_equal(U_13,U_12) ) ),
inference(variable_rename,[status(thm)],[f_2_2]) ).
fof(f_2_4,negated_conjecture,
( ? [U_17,U_15] :
( ~ set_equal(U_17,U_15)
& set_equal(U_15,U_17) )
| ? [U_16,U_14] :
( ~ set_equal(U_14,U_16)
& set_equal(U_16,U_14) ) ),
inference(miniscope,[status(thm)],[f_2_3]) ).
fof(f_2_5,negated_conjecture,
( ? [U_17,U_15] :
( ~ set_equal(U_17,U_15)
& set_equal(U_15,U_17) )
| ? [U_14] :
( ~ set_equal(U_14,sK3)
& set_equal(sK3,U_14) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_16,sK3)],[f_2_4]) ).
fof(f_2_6,negated_conjecture,
( ? [U_17,U_15] :
( ~ set_equal(U_17,U_15)
& set_equal(U_15,U_17) )
| ( ~ set_equal(sK4,sK3)
& set_equal(sK3,sK4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_14,sK4)],[f_2_5]) ).
fof(f_2_7,negated_conjecture,
( ? [U_15] :
( ~ set_equal(sK5,U_15)
& set_equal(U_15,sK5) )
| ( ~ set_equal(sK4,sK3)
& set_equal(sK3,sK4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_17,sK5)],[f_2_6]) ).
fof(f_2_8,negated_conjecture,
( ( ~ set_equal(sK5,sK6)
& set_equal(sK6,sK5) )
| ( ~ set_equal(sK4,sK3)
& set_equal(sK3,sK4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_15,sK6)],[f_2_7]) ).
fof(f_2_9,negated_conjecture,
( ( ~ set_equal(sK5,sK6)
| ~ sP1 )
& ( set_equal(sK6,sK5)
| ~ sP1 )
& ( ~ set_equal(sK4,sK3)
| ~ sP0 )
& ( set_equal(sK3,sK4)
| ~ sP0 )
& ( sP1
| sP0 ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_2_8]) ).
cnf(f_2_10,negated_conjecture,
( sP1
| sP0 ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(f_2_11,negated_conjecture,
( set_equal(sK3,sK4)
| ~ sP0 ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(f_2_12,negated_conjecture,
( ~ set_equal(sK4,sK3)
| ~ sP0 ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(f_2_13,negated_conjecture,
( set_equal(sK6,sK5)
| ~ sP1 ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(f_2_14,negated_conjecture,
( ~ set_equal(sK5,sK6)
| ~ sP1 ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET047+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/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n014.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 : Sat Sep 19 21:35:21 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.12/0.39 % SZS status Theorem for theBenchmark
% 0.12/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------