%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU162+1 : TPTP v9.3.1. Released v3.3.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 : n007.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:17 AM UTC 2026
% Result : Theorem 0.13s 5.44s
% Output : Proof 0.13s
% 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(dt_k1_tarski,axiom,
$true,
file('theBenchmark.p',dt_k1_tarski) ).
fof(dt_k4_xboole_0,axiom,
$true,
file('theBenchmark.p',dt_k4_xboole_0) ).
fof(l25_zfmisc_1,axiom,
! [A,B] :
~ ( in(A,B)
& disjoint(singleton(A),B) ),
file('theBenchmark.p',l25_zfmisc_1) ).
fof(l28_zfmisc_1,axiom,
! [A,B] :
( ~ in(A,B)
=> disjoint(singleton(A),B) ),
file('theBenchmark.p',l28_zfmisc_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [A,B] :
( disjoint(A,B)
=> disjoint(B,A) ),
file('theBenchmark.p',symmetry_r1_xboole_0) ).
fof(t65_zfmisc_1,conjecture,
! [A,B] :
( set_difference(A,singleton(B)) = A
<=> ~ in(B,A) ),
file('theBenchmark.p',t65_zfmisc_1) ).
fof(t83_xboole_1,axiom,
! [A,B] :
( disjoint(A,B)
<=> set_difference(A,B) = A ),
file('theBenchmark.p',t83_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,
$true,
inference(fof_nnf,[status(thm)],[dt_k1_tarski]) ).
cnf(f_2_2,plain,
$true,
inference(clausify,[status(thm)],[f_2_1]) ).
fof(f_3_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k4_xboole_0]) ).
cnf(f_3_2,plain,
$true,
inference(clausify,[status(thm)],[f_3_1]) ).
fof(f_4_1,plain,
! [A,B] :
( ~ in(A,B)
| ~ disjoint(singleton(A),B) ),
inference(fof_nnf,[status(thm)],[l25_zfmisc_1]) ).
fof(f_4_2,plain,
! [U_3,U_2] :
( ~ in(U_3,U_2)
| ~ disjoint(singleton(U_3),U_2) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
cnf(f_4_3,plain,
( ~ in(U_3,U_2)
| ~ disjoint(singleton(U_3),U_2) ),
inference(clausify,[status(thm)],[f_4_2]) ).
fof(f_5_1,plain,
! [A,B] :
( disjoint(singleton(A),B)
| in(A,B) ),
inference(fof_nnf,[status(thm)],[l28_zfmisc_1]) ).
fof(f_5_2,plain,
! [U_5,U_4] :
( disjoint(singleton(U_5),U_4)
| in(U_5,U_4) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
cnf(f_5_3,plain,
( disjoint(singleton(U_5),U_4)
| in(U_5,U_4) ),
inference(clausify,[status(thm)],[f_5_2]) ).
fof(f_6_1,plain,
! [A,B] :
( disjoint(B,A)
| ~ disjoint(A,B) ),
inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0]) ).
fof(f_6_2,plain,
! [U_7,U_6] :
( disjoint(U_6,U_7)
| ~ disjoint(U_7,U_6) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
cnf(f_6_3,plain,
( disjoint(U_6,U_7)
| ~ disjoint(U_7,U_6) ),
inference(clausify,[status(thm)],[f_6_2]) ).
fof(f_7_1,negated_conjecture,
~ ! [A,B] :
( set_difference(A,singleton(B)) = A
<=> ~ in(B,A) ),
inference(negate,[status(cth)],[t65_zfmisc_1]) ).
fof(f_7_2,negated_conjecture,
? [A,B] :
( ( set_difference(A,singleton(B)) != A
& ~ in(B,A) )
| ( in(B,A)
& set_difference(A,singleton(B)) = A ) ),
inference(fof_nnf,[status(thm)],[f_7_1]) ).
fof(f_7_3,negated_conjecture,
? [U_9,U_8] :
( ( set_difference(U_9,singleton(U_8)) != U_9
& ~ in(U_8,U_9) )
| ( in(U_8,U_9)
& set_difference(U_9,singleton(U_8)) = U_9 ) ),
inference(variable_rename,[status(thm)],[f_7_2]) ).
fof(f_7_4,negated_conjecture,
( ? [U_13,U_11] :
( set_difference(U_13,singleton(U_11)) != U_13
& ~ in(U_11,U_13) )
| ? [U_12,U_10] :
( in(U_10,U_12)
& set_difference(U_12,singleton(U_10)) = U_12 ) ),
inference(miniscope,[status(thm)],[f_7_3]) ).
fof(f_7_5,negated_conjecture,
( ? [U_13,U_11] :
( set_difference(U_13,singleton(U_11)) != U_13
& ~ in(U_11,U_13) )
| ? [U_10] :
( in(U_10,sK1)
& set_difference(sK1,singleton(U_10)) = sK1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_12,sK1)],[f_7_4]) ).
fof(f_7_6,negated_conjecture,
( ? [U_13,U_11] :
( set_difference(U_13,singleton(U_11)) != U_13
& ~ in(U_11,U_13) )
| ( in(sK2,sK1)
& set_difference(sK1,singleton(sK2)) = sK1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_10,sK2)],[f_7_5]) ).
fof(f_7_7,negated_conjecture,
( ? [U_11] :
( set_difference(sK3,singleton(U_11)) != sK3
& ~ in(U_11,sK3) )
| ( in(sK2,sK1)
& set_difference(sK1,singleton(sK2)) = sK1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_13,sK3)],[f_7_6]) ).
fof(f_7_8,negated_conjecture,
( ( set_difference(sK3,singleton(sK4)) != sK3
& ~ in(sK4,sK3) )
| ( in(sK2,sK1)
& set_difference(sK1,singleton(sK2)) = sK1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_11,sK4)],[f_7_7]) ).
fof(f_7_9,negated_conjecture,
( ( set_difference(sK3,singleton(sK4)) != sK3
| ~ sP1 )
& ( ~ in(sK4,sK3)
| ~ sP1 )
& ( in(sK2,sK1)
| ~ sP0 )
& ( set_difference(sK1,singleton(sK2)) = sK1
| ~ sP0 )
& ( sP1
| sP0 ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_7_8]) ).
cnf(f_7_10,negated_conjecture,
( sP1
| sP0 ),
inference(clausify,[status(thm)],[f_7_9]) ).
cnf(f_7_11,negated_conjecture,
( set_difference(sK1,singleton(sK2)) = sK1
| ~ sP0 ),
inference(clausify,[status(thm)],[f_7_9]) ).
cnf(f_7_12,negated_conjecture,
( in(sK2,sK1)
| ~ sP0 ),
inference(clausify,[status(thm)],[f_7_9]) ).
cnf(f_7_13,negated_conjecture,
( ~ in(sK4,sK3)
| ~ sP1 ),
inference(clausify,[status(thm)],[f_7_9]) ).
cnf(f_7_14,negated_conjecture,
( set_difference(sK3,singleton(sK4)) != sK3
| ~ sP1 ),
inference(clausify,[status(thm)],[f_7_9]) ).
fof(f_8_1,plain,
! [A,B] :
( ( disjoint(A,B)
| set_difference(A,B) != A )
& ( set_difference(A,B) = A
| ~ disjoint(A,B) ) ),
inference(fof_nnf,[status(thm)],[t83_xboole_1]) ).
fof(f_8_2,plain,
! [U_15,U_14] :
( ( disjoint(U_15,U_14)
| set_difference(U_15,U_14) != U_15 )
& ( set_difference(U_15,U_14) = U_15
| ~ disjoint(U_15,U_14) ) ),
inference(variable_rename,[status(thm)],[f_8_1]) ).
fof(f_8_3,plain,
( ! [U_19,U_17] :
( disjoint(U_19,U_17)
| set_difference(U_19,U_17) != U_19 )
& ! [U_18,U_16] :
( set_difference(U_18,U_16) = U_18
| ~ disjoint(U_18,U_16) ) ),
inference(miniscope,[status(thm)],[f_8_2]) ).
cnf(f_8_4,plain,
( set_difference(U_18,U_16) = U_18
| ~ disjoint(U_18,U_16) ),
inference(clausify,[status(thm)],[f_8_3]) ).
cnf(f_8_5,plain,
( disjoint(U_19,U_17)
| set_difference(U_19,U_17) != U_19 ),
inference(clausify,[status(thm)],[f_8_3]) ).
cnf(f_2_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_2_2]) ).
cnf(f_3_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_3_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,
( set_difference(Eq_x_0,Eq_x_1) = set_difference(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,
( 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,
( disjoint(Eq_y_0,Eq_y_1)
| ~ disjoint(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 : SEU162+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/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.37 % Computer : n007.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Sat Sep 19 23:22:40 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.13/5.44 % SZS status Theorem for theBenchmark
% 0.13/5.44 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------