%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU148+1 : TPTP v9.3.1. Released v3.3.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 : n026.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:12 AM UTC 2026
% Result : Theorem 0.22s 0.47s
% Output : Proof 0.22s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(antisymmetry_r2_hidden,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ),
file('theBenchmark.p',antisymmetry_r2_hidden) ).
fof(d1_tarski,axiom,
! [A,B] :
( B = singleton(A)
<=> ! [C] :
( in(C,B)
<=> C = A ) ),
file('theBenchmark.p',d1_tarski) ).
fof(dt_k1_tarski,axiom,
$true,
file('theBenchmark.p',dt_k1_tarski) ).
fof(dt_k1_xboole_0,axiom,
$true,
file('theBenchmark.p',dt_k1_xboole_0) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('theBenchmark.p',fc1_xboole_0) ).
fof(l1_zfmisc_1,axiom,
! [A] : singleton(A) != empty_set,
file('theBenchmark.p',l1_zfmisc_1) ).
fof(l4_zfmisc_1,axiom,
! [A,B] :
( subset(A,singleton(B))
<=> ( A = singleton(B)
| A = empty_set ) ),
file('theBenchmark.p',l4_zfmisc_1) ).
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(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A),
file('theBenchmark.p',reflexivity_r1_tarski) ).
fof(t6_zfmisc_1,conjecture,
! [A,B] :
( subset(singleton(A),singleton(B))
=> A = B ),
file('theBenchmark.p',t6_zfmisc_1) ).
fof(f_1_1,plain,
! [A,B] :
( ~ in(B,A)
| ~ in(A,B) ),
inference(fof_nnf,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(f_1_2,plain,
! [U_1,U_0] :
( ~ in(U_0,U_1)
| ~ in(U_1,U_0) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
cnf(f_1_3,plain,
( ~ in(U_0,U_1)
| ~ in(U_1,U_0) ),
inference(clausify,[status(thm)],[f_1_2]) ).
fof(f_2_1,plain,
! [A,B] :
( ( B = singleton(A)
| ? [C] :
( ( ~ in(C,B)
& C = A )
| ( C != A
& in(C,B) ) ) )
& ( ! [C] :
( ( in(C,B)
| C != A )
& ( C = A
| ~ in(C,B) ) )
| B != singleton(A) ) ),
inference(fof_nnf,[status(thm)],[d1_tarski]) ).
fof(f_2_2,plain,
! [U_5,U_4] :
( ( U_4 = singleton(U_5)
| ? [U_3] :
( ( ~ in(U_3,U_4)
& U_3 = U_5 )
| ( U_3 != U_5
& in(U_3,U_4) ) ) )
& ( ! [U_2] :
( ( in(U_2,U_4)
| U_2 != U_5 )
& ( U_2 = U_5
| ~ in(U_2,U_4) ) )
| U_4 != singleton(U_5) ) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_13,U_11] :
( U_11 = singleton(U_13)
| ? [U_9] :
( ~ in(U_9,U_11)
& U_9 = U_13 )
| ? [U_8] :
( U_8 != U_13
& in(U_8,U_11) ) )
& ! [U_12,U_10] :
( ( ! [U_7] :
( in(U_7,U_10)
| U_7 != U_12 )
& ! [U_6] :
( U_6 = U_12
| ~ in(U_6,U_10) ) )
| U_10 != singleton(U_12) ) ),
inference(miniscope,[status(thm)],[f_2_2]) ).
fof(f_2_4,plain,
( ! [U_13,U_11] :
( U_11 = singleton(U_13)
| ? [U_9] :
( ~ in(U_9,U_11)
& U_9 = U_13 )
| ( sK1(U_13,U_11) != U_13
& in(sK1(U_13,U_11),U_11) ) )
& ! [U_12,U_10] :
( ( ! [U_7] :
( in(U_7,U_10)
| U_7 != U_12 )
& ! [U_6] :
( U_6 = U_12
| ~ in(U_6,U_10) ) )
| U_10 != singleton(U_12) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_8,sK1(U_13,U_11))],[f_2_3]) ).
fof(f_2_5,plain,
( ! [U_13,U_11] :
( U_11 = singleton(U_13)
| ( ~ in(sK2(U_13,U_11),U_11)
& sK2(U_13,U_11) = U_13 )
| ( sK1(U_13,U_11) != U_13
& in(sK1(U_13,U_11),U_11) ) )
& ! [U_12,U_10] :
( ( ! [U_7] :
( in(U_7,U_10)
| U_7 != U_12 )
& ! [U_6] :
( U_6 = U_12
| ~ in(U_6,U_10) ) )
| U_10 != singleton(U_12) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_9,sK2(U_13,U_11))],[f_2_4]) ).
cnf(f_2_6,plain,
( U_6 = U_12
| ~ in(U_6,U_10)
| U_10 != singleton(U_12) ),
inference(clausify,[status(thm)],[f_2_5]) ).
cnf(f_2_7,plain,
( in(U_7,U_10)
| U_7 != U_12
| U_10 != singleton(U_12) ),
inference(clausify,[status(thm)],[f_2_5]) ).
cnf(f_2_8,plain,
( sK2(U_13,U_11) = U_13
| in(sK1(U_13,U_11),U_11)
| U_11 = singleton(U_13) ),
inference(clausify,[status(thm)],[f_2_5]) ).
cnf(f_2_9,plain,
( ~ in(sK2(U_13,U_11),U_11)
| in(sK1(U_13,U_11),U_11)
| U_11 = singleton(U_13) ),
inference(clausify,[status(thm)],[f_2_5]) ).
cnf(f_2_10,plain,
( sK2(U_13,U_11) = U_13
| sK1(U_13,U_11) != U_13
| U_11 = singleton(U_13) ),
inference(clausify,[status(thm)],[f_2_5]) ).
cnf(f_2_11,plain,
( ~ in(sK2(U_13,U_11),U_11)
| sK1(U_13,U_11) != U_13
| U_11 = singleton(U_13) ),
inference(clausify,[status(thm)],[f_2_5]) ).
fof(f_3_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k1_tarski]) ).
cnf(f_3_2,plain,
$true,
inference(clausify,[status(thm)],[f_3_1]) ).
fof(f_4_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k1_xboole_0]) ).
cnf(f_4_2,plain,
$true,
inference(clausify,[status(thm)],[f_4_1]) ).
fof(f_5_1,plain,
empty(empty_set),
inference(fof_nnf,[status(thm)],[fc1_xboole_0]) ).
cnf(f_5_2,plain,
empty(empty_set),
inference(clausify,[status(thm)],[f_5_1]) ).
fof(f_6_1,plain,
! [A] : singleton(A) != empty_set,
inference(fof_nnf,[status(thm)],[l1_zfmisc_1]) ).
fof(f_6_2,plain,
! [U_14] : singleton(U_14) != empty_set,
inference(variable_rename,[status(thm)],[f_6_1]) ).
cnf(f_6_3,plain,
singleton(U_14) != empty_set,
inference(clausify,[status(thm)],[f_6_2]) ).
fof(f_7_1,plain,
! [A,B] :
( ( subset(A,singleton(B))
| ( A != singleton(B)
& A != empty_set ) )
& ( A = singleton(B)
| A = empty_set
| ~ subset(A,singleton(B)) ) ),
inference(fof_nnf,[status(thm)],[l4_zfmisc_1]) ).
fof(f_7_2,plain,
! [U_16,U_15] :
( ( subset(U_16,singleton(U_15))
| ( U_16 != singleton(U_15)
& U_16 != empty_set ) )
& ( U_16 = singleton(U_15)
| U_16 = empty_set
| ~ subset(U_16,singleton(U_15)) ) ),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
( ! [U_20,U_18] :
( subset(U_20,singleton(U_18))
| ( U_20 != singleton(U_18)
& U_20 != empty_set ) )
& ! [U_19,U_17] :
( U_19 = singleton(U_17)
| U_19 = empty_set
| ~ subset(U_19,singleton(U_17)) ) ),
inference(miniscope,[status(thm)],[f_7_2]) ).
cnf(f_7_4,plain,
( U_19 = singleton(U_17)
| U_19 = empty_set
| ~ subset(U_19,singleton(U_17)) ),
inference(clausify,[status(thm)],[f_7_3]) ).
cnf(f_7_5,plain,
( U_20 != empty_set
| subset(U_20,singleton(U_18)) ),
inference(clausify,[status(thm)],[f_7_3]) ).
cnf(f_7_6,plain,
( U_20 != singleton(U_18)
| subset(U_20,singleton(U_18)) ),
inference(clausify,[status(thm)],[f_7_3]) ).
fof(f_8_1,plain,
? [A] : empty(A),
inference(fof_nnf,[status(thm)],[rc1_xboole_0]) ).
fof(f_8_2,plain,
? [U_21] : empty(U_21),
inference(variable_rename,[status(thm)],[f_8_1]) ).
fof(f_8_3,plain,
empty(sK3),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_21,sK3)],[f_8_2]) ).
cnf(f_8_4,plain,
empty(sK3),
inference(clausify,[status(thm)],[f_8_3]) ).
fof(f_9_1,plain,
? [A] : ~ empty(A),
inference(fof_nnf,[status(thm)],[rc2_xboole_0]) ).
fof(f_9_2,plain,
? [U_22] : ~ empty(U_22),
inference(variable_rename,[status(thm)],[f_9_1]) ).
fof(f_9_3,plain,
~ empty(sK4),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_22,sK4)],[f_9_2]) ).
cnf(f_9_4,plain,
~ empty(sK4),
inference(clausify,[status(thm)],[f_9_3]) ).
fof(f_10_1,plain,
! [A,B] : subset(A,A),
inference(fof_nnf,[status(thm)],[reflexivity_r1_tarski]) ).
fof(f_10_2,plain,
! [U_24,U_23] : subset(U_24,U_24),
inference(variable_rename,[status(thm)],[f_10_1]) ).
fof(f_10_3,plain,
! [U_24] : subset(U_24,U_24),
inference(miniscope,[status(thm)],[f_10_2]) ).
cnf(f_10_4,plain,
subset(U_24,U_24),
inference(clausify,[status(thm)],[f_10_3]) ).
fof(f_11_1,negated_conjecture,
~ ! [A,B] :
( subset(singleton(A),singleton(B))
=> A = B ),
inference(negate,[status(cth)],[t6_zfmisc_1]) ).
fof(f_11_2,negated_conjecture,
? [A,B] :
( A != B
& subset(singleton(A),singleton(B)) ),
inference(fof_nnf,[status(thm)],[f_11_1]) ).
fof(f_11_3,negated_conjecture,
? [U_26,U_25] :
( U_26 != U_25
& subset(singleton(U_26),singleton(U_25)) ),
inference(variable_rename,[status(thm)],[f_11_2]) ).
fof(f_11_4,negated_conjecture,
? [U_25] :
( sK5 != U_25
& subset(singleton(sK5),singleton(U_25)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_26,sK5)],[f_11_3]) ).
fof(f_11_5,negated_conjecture,
( sK5 != sK6
& subset(singleton(sK5),singleton(sK6)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_25,sK6)],[f_11_4]) ).
fof(f_11_6,negated_conjecture,
( sK5 != sK6
& subset(singleton(sK5),singleton(sK6)) ),
inference(definitional_conversion,[status(esa)],[f_11_5]) ).
cnf(f_11_7,negated_conjecture,
subset(singleton(sK5),singleton(sK6)),
inference(clausify,[status(thm)],[f_11_6]) ).
cnf(f_11_8,negated_conjecture,
sK5 != sK6,
inference(clausify,[status(thm)],[f_11_6]) ).
cnf(f_3_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_3_2]) ).
cnf(f_4_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_4_2]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( singleton(Eq_x_0) = singleton(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( sK1(Eq_x_0,Eq_x_1) = sK1(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,axiom,
( sK2(Eq_x_0,Eq_x_1) = sK2(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_7,axiom,
( in(Eq_y_0,Eq_y_1)
| ~ in(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_8,axiom,
( empty(Eq_y_0)
| ~ empty(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_9,axiom,
( subset(Eq_y_0,Eq_y_1)
| ~ subset(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU148+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ 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.07/0.35 % Computer : n026.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sat Sep 19 23:25:21 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.22/0.47 % SZS status Theorem for theBenchmark
% 0.22/0.47 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------