%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU158+3 : TPTP v9.3.1. Released v3.2.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 : n001.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:58:16 AM UTC 2026
% Result : Theorem 0.10s 0.39s
% Output : Proof 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A),
file('theBenchmark.p',reflexivity_r1_tarski) ).
fof(antisymmetry_r2_hidden,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ),
file('theBenchmark.p',antisymmetry_r2_hidden) ).
fof(rc1_xboole_0,axiom,
? [A] : empty(A),
file('theBenchmark.p',rc1_xboole_0) ).
fof(rc2_xboole_0,axiom,
? [A] : ~ empty(A),
file('theBenchmark.p',rc2_xboole_0) ).
fof(t37_zfmisc_1,conjecture,
! [A,B] :
( subset(singleton(A),B)
<=> in(A,B) ),
file('theBenchmark.p',t37_zfmisc_1) ).
fof(l2_zfmisc_1,axiom,
! [A,B] :
( subset(singleton(A),B)
<=> in(A,B) ),
file('theBenchmark.p',l2_zfmisc_1) ).
fof(f_1_1,plain,
! [A,B] : subset(A,A),
inference(fof_nnf,[status(thm)],[reflexivity_r1_tarski]) ).
fof(f_1_2,plain,
! [U_1,U_0] : subset(U_1,U_1),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
! [U_1] : subset(U_1,U_1),
inference(miniscope,[status(thm)],[f_1_2]) ).
cnf(f_1_4,plain,
subset(U_1,U_1),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,plain,
! [A,B] :
( ~ in(B,A)
| ~ in(A,B) ),
inference(fof_nnf,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(f_2_2,plain,
! [U_3,U_2] :
( ~ in(U_2,U_3)
| ~ in(U_3,U_2) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
( ~ in(U_2,U_3)
| ~ in(U_3,U_2) ),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,plain,
? [A] : empty(A),
inference(fof_nnf,[status(thm)],[rc1_xboole_0]) ).
fof(f_3_2,plain,
? [U_4] : empty(U_4),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
empty(sK1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_4,sK1)],[f_3_2]) ).
cnf(f_3_4,plain,
empty(sK1),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_4_1,plain,
? [A] : ~ empty(A),
inference(fof_nnf,[status(thm)],[rc2_xboole_0]) ).
fof(f_4_2,plain,
? [U_5] : ~ empty(U_5),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
~ empty(sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_5,sK2)],[f_4_2]) ).
cnf(f_4_4,plain,
~ empty(sK2),
inference(clausify,[status(thm)],[f_4_3]) ).
fof(f_5_1,negated_conjecture,
~ ! [A,B] :
( subset(singleton(A),B)
<=> in(A,B) ),
inference(negate,[status(cth)],[t37_zfmisc_1]) ).
fof(f_5_2,negated_conjecture,
? [A,B] :
( ( ~ subset(singleton(A),B)
& in(A,B) )
| ( ~ in(A,B)
& subset(singleton(A),B) ) ),
inference(fof_nnf,[status(thm)],[f_5_1]) ).
fof(f_5_3,negated_conjecture,
? [U_7,U_6] :
( ( ~ subset(singleton(U_7),U_6)
& in(U_7,U_6) )
| ( ~ in(U_7,U_6)
& subset(singleton(U_7),U_6) ) ),
inference(variable_rename,[status(thm)],[f_5_2]) ).
fof(f_5_4,negated_conjecture,
( ? [U_11,U_9] :
( ~ subset(singleton(U_11),U_9)
& in(U_11,U_9) )
| ? [U_10,U_8] :
( ~ in(U_10,U_8)
& subset(singleton(U_10),U_8) ) ),
inference(miniscope,[status(thm)],[f_5_3]) ).
fof(f_5_5,negated_conjecture,
( ? [U_11,U_9] :
( ~ subset(singleton(U_11),U_9)
& in(U_11,U_9) )
| ? [U_8] :
( ~ in(sK3,U_8)
& subset(singleton(sK3),U_8) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_10,sK3)],[f_5_4]) ).
fof(f_5_6,negated_conjecture,
( ? [U_11,U_9] :
( ~ subset(singleton(U_11),U_9)
& in(U_11,U_9) )
| ( ~ in(sK3,sK4)
& subset(singleton(sK3),sK4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_8,sK4)],[f_5_5]) ).
fof(f_5_7,negated_conjecture,
( ? [U_9] :
( ~ subset(singleton(sK5),U_9)
& in(sK5,U_9) )
| ( ~ in(sK3,sK4)
& subset(singleton(sK3),sK4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_11,sK5)],[f_5_6]) ).
fof(f_5_8,negated_conjecture,
( ( ~ subset(singleton(sK5),sK6)
& in(sK5,sK6) )
| ( ~ in(sK3,sK4)
& subset(singleton(sK3),sK4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_9,sK6)],[f_5_7]) ).
fof(f_5_9,negated_conjecture,
( ( ~ subset(singleton(sK5),sK6)
| ~ sP1 )
& ( in(sK5,sK6)
| ~ sP1 )
& ( ~ in(sK3,sK4)
| ~ sP0 )
& ( subset(singleton(sK3),sK4)
| ~ sP0 )
& ( sP1
| sP0 ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_5_8]) ).
cnf(f_5_10,negated_conjecture,
( sP1
| sP0 ),
inference(clausify,[status(thm)],[f_5_9]) ).
cnf(f_5_11,negated_conjecture,
( subset(singleton(sK3),sK4)
| ~ sP0 ),
inference(clausify,[status(thm)],[f_5_9]) ).
cnf(f_5_12,negated_conjecture,
( ~ in(sK3,sK4)
| ~ sP0 ),
inference(clausify,[status(thm)],[f_5_9]) ).
cnf(f_5_13,negated_conjecture,
( in(sK5,sK6)
| ~ sP1 ),
inference(clausify,[status(thm)],[f_5_9]) ).
cnf(f_5_14,negated_conjecture,
( ~ subset(singleton(sK5),sK6)
| ~ sP1 ),
inference(clausify,[status(thm)],[f_5_9]) ).
fof(f_6_1,plain,
! [A,B] :
( ( subset(singleton(A),B)
| ~ in(A,B) )
& ( in(A,B)
| ~ subset(singleton(A),B) ) ),
inference(fof_nnf,[status(thm)],[l2_zfmisc_1]) ).
fof(f_6_2,plain,
! [U_13,U_12] :
( ( subset(singleton(U_13),U_12)
| ~ in(U_13,U_12) )
& ( in(U_13,U_12)
| ~ subset(singleton(U_13),U_12) ) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
fof(f_6_3,plain,
( ! [U_17,U_15] :
( subset(singleton(U_17),U_15)
| ~ in(U_17,U_15) )
& ! [U_16,U_14] :
( in(U_16,U_14)
| ~ subset(singleton(U_16),U_14) ) ),
inference(miniscope,[status(thm)],[f_6_2]) ).
cnf(f_6_4,plain,
( in(U_16,U_14)
| ~ subset(singleton(U_16),U_14) ),
inference(clausify,[status(thm)],[f_6_3]) ).
cnf(f_6_5,plain,
( subset(singleton(U_17),U_15)
| ~ in(U_17,U_15) ),
inference(clausify,[status(thm)],[f_6_3]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU158+3 : TPTP v9.3.1. Released v3.2.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.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 19 23:29:40 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.39 % SZS status Theorem for theBenchmark
% 0.10/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------