%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU152+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 : n016.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:14 AM UTC 2026
% Result : Theorem 0.10s 5.38s
% Output : Proof 0.10s
% 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(commutativity_k2_xboole_0,axiom,
! [A,B] : set_union2(A,B) = set_union2(B,A),
file('theBenchmark.p',commutativity_k2_xboole_0) ).
fof(dt_k1_tarski,axiom,
$true,
file('theBenchmark.p',dt_k1_tarski) ).
fof(dt_k2_xboole_0,axiom,
$true,
file('theBenchmark.p',dt_k2_xboole_0) ).
fof(idempotence_k2_xboole_0,axiom,
! [A,B] : set_union2(A,A) = A,
file('theBenchmark.p',idempotence_k2_xboole_0) ).
fof(l23_zfmisc_1,conjecture,
! [A,B] :
( in(A,B)
=> set_union2(singleton(A),B) = B ),
file('theBenchmark.p',l23_zfmisc_1) ).
fof(l2_zfmisc_1,axiom,
! [A,B] :
( subset(singleton(A),B)
<=> in(A,B) ),
file('theBenchmark.p',l2_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A),
file('theBenchmark.p',reflexivity_r1_tarski) ).
fof(t12_xboole_1,axiom,
! [A,B] :
( subset(A,B)
=> set_union2(A,B) = B ),
file('theBenchmark.p',t12_xboole_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] : set_union2(A,B) = set_union2(B,A),
inference(fof_nnf,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(f_2_2,plain,
! [U_3,U_2] : set_union2(U_3,U_2) = set_union2(U_2,U_3),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
set_union2(U_3,U_2) = set_union2(U_2,U_3),
inference(clausify,[status(thm)],[f_2_2]) ).
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_k2_xboole_0]) ).
cnf(f_4_2,plain,
$true,
inference(clausify,[status(thm)],[f_4_1]) ).
fof(f_5_1,plain,
! [A,B] : set_union2(A,A) = A,
inference(fof_nnf,[status(thm)],[idempotence_k2_xboole_0]) ).
fof(f_5_2,plain,
! [U_5,U_4] : set_union2(U_5,U_5) = U_5,
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
! [U_5] : set_union2(U_5,U_5) = U_5,
inference(miniscope,[status(thm)],[f_5_2]) ).
cnf(f_5_4,plain,
set_union2(U_5,U_5) = U_5,
inference(clausify,[status(thm)],[f_5_3]) ).
fof(f_6_1,negated_conjecture,
~ ! [A,B] :
( in(A,B)
=> set_union2(singleton(A),B) = B ),
inference(negate,[status(cth)],[l23_zfmisc_1]) ).
fof(f_6_2,negated_conjecture,
? [A,B] :
( set_union2(singleton(A),B) != B
& in(A,B) ),
inference(fof_nnf,[status(thm)],[f_6_1]) ).
fof(f_6_3,negated_conjecture,
? [U_7,U_6] :
( set_union2(singleton(U_7),U_6) != U_6
& in(U_7,U_6) ),
inference(variable_rename,[status(thm)],[f_6_2]) ).
fof(f_6_4,negated_conjecture,
? [U_6] :
( set_union2(singleton(sK1),U_6) != U_6
& in(sK1,U_6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_7,sK1)],[f_6_3]) ).
fof(f_6_5,negated_conjecture,
( set_union2(singleton(sK1),sK2) != sK2
& in(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_6,sK2)],[f_6_4]) ).
fof(f_6_6,negated_conjecture,
( set_union2(singleton(sK1),sK2) != sK2
& in(sK1,sK2) ),
inference(definitional_conversion,[status(esa)],[f_6_5]) ).
cnf(f_6_7,negated_conjecture,
in(sK1,sK2),
inference(clausify,[status(thm)],[f_6_6]) ).
cnf(f_6_8,negated_conjecture,
set_union2(singleton(sK1),sK2) != sK2,
inference(clausify,[status(thm)],[f_6_6]) ).
fof(f_7_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_7_2,plain,
! [U_9,U_8] :
( ( subset(singleton(U_9),U_8)
| ~ in(U_9,U_8) )
& ( in(U_9,U_8)
| ~ subset(singleton(U_9),U_8) ) ),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
( ! [U_13,U_11] :
( subset(singleton(U_13),U_11)
| ~ in(U_13,U_11) )
& ! [U_12,U_10] :
( in(U_12,U_10)
| ~ subset(singleton(U_12),U_10) ) ),
inference(miniscope,[status(thm)],[f_7_2]) ).
cnf(f_7_4,plain,
( in(U_12,U_10)
| ~ subset(singleton(U_12),U_10) ),
inference(clausify,[status(thm)],[f_7_3]) ).
cnf(f_7_5,plain,
( subset(singleton(U_13),U_11)
| ~ in(U_13,U_11) ),
inference(clausify,[status(thm)],[f_7_3]) ).
fof(f_8_1,plain,
! [A,B] : subset(A,A),
inference(fof_nnf,[status(thm)],[reflexivity_r1_tarski]) ).
fof(f_8_2,plain,
! [U_15,U_14] : subset(U_15,U_15),
inference(variable_rename,[status(thm)],[f_8_1]) ).
fof(f_8_3,plain,
! [U_15] : subset(U_15,U_15),
inference(miniscope,[status(thm)],[f_8_2]) ).
cnf(f_8_4,plain,
subset(U_15,U_15),
inference(clausify,[status(thm)],[f_8_3]) ).
fof(f_9_1,plain,
! [A,B] :
( set_union2(A,B) = B
| ~ subset(A,B) ),
inference(fof_nnf,[status(thm)],[t12_xboole_1]) ).
fof(f_9_2,plain,
! [U_17,U_16] :
( set_union2(U_17,U_16) = U_16
| ~ subset(U_17,U_16) ),
inference(variable_rename,[status(thm)],[f_9_1]) ).
cnf(f_9_3,plain,
( set_union2(U_17,U_16) = U_16
| ~ subset(U_17,U_16) ),
inference(clausify,[status(thm)],[f_9_2]) ).
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,
( set_union2(Eq_x_0,Eq_x_1) = set_union2(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( singleton(Eq_x_0) = singleton(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,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_7,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.02 % Problem : SEU152+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/5.35 % Computer : n016.cluster.edu
% 0.10/5.35 % Model : x86_64 x86_64
% 0.10/5.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.35 % Memory : 8046.5625MB
% 0.10/5.35 % OS : Linux 6.8.0-71-generic
% 0.10/5.35 % CPULimit : 300
% 0.10/5.35 % WCLimit : 300
% 0.10/5.35 % DateTime : Sat Sep 19 23:27:56 UTC 2026
% 0.10/5.36 % CPUTime :
% 0.10/5.38 % SZS status Theorem for theBenchmark
% 0.10/5.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------