%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU121+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 : n005.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:05 AM UTC 2026
% Result : Theorem 0.10s 0.39s
% 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(d3_tarski,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('theBenchmark.p',d3_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(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(t1_xboole_1,conjecture,
! [A,B,C] :
( ( subset(B,C)
& subset(A,B) )
=> subset(A,C) ),
file('theBenchmark.p',t1_xboole_1) ).
fof(t6_boole,axiom,
! [A] :
( empty(A)
=> A = empty_set ),
file('theBenchmark.p',t6_boole) ).
fof(t7_boole,axiom,
! [A,B] :
~ ( empty(B)
& in(A,B) ),
file('theBenchmark.p',t7_boole) ).
fof(t8_boole,axiom,
! [A,B] :
~ ( empty(B)
& A != B
& empty(A) ),
file('theBenchmark.p',t8_boole) ).
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] :
( ( subset(A,B)
| ? [C] :
( ~ in(C,B)
& in(C,A) ) )
& ( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(fof_nnf,[status(thm)],[d3_tarski]) ).
fof(f_2_2,plain,
! [U_5,U_4] :
( ( subset(U_5,U_4)
| ? [U_3] :
( ~ in(U_3,U_4)
& in(U_3,U_5) ) )
& ( ! [U_2] :
( in(U_2,U_4)
| ~ in(U_2,U_5) )
| ~ subset(U_5,U_4) ) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_9,U_7] :
( subset(U_9,U_7)
| ? [U_3] :
( ~ in(U_3,U_7)
& in(U_3,U_9) ) )
& ! [U_8,U_6] :
( ! [U_2] :
( in(U_2,U_6)
| ~ in(U_2,U_8) )
| ~ subset(U_8,U_6) ) ),
inference(miniscope,[status(thm)],[f_2_2]) ).
fof(f_2_4,plain,
( ! [U_9,U_7] :
( subset(U_9,U_7)
| ( ~ in(sK1(U_9,U_7),U_7)
& in(sK1(U_9,U_7),U_9) ) )
& ! [U_8,U_6] :
( ! [U_2] :
( in(U_2,U_6)
| ~ in(U_2,U_8) )
| ~ subset(U_8,U_6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_3,sK1(U_9,U_7))],[f_2_3]) ).
cnf(f_2_5,plain,
( in(U_2,U_6)
| ~ in(U_2,U_8)
| ~ subset(U_8,U_6) ),
inference(clausify,[status(thm)],[f_2_4]) ).
cnf(f_2_6,plain,
( in(sK1(U_9,U_7),U_9)
| subset(U_9,U_7) ),
inference(clausify,[status(thm)],[f_2_4]) ).
cnf(f_2_7,plain,
( ~ in(sK1(U_9,U_7),U_7)
| subset(U_9,U_7) ),
inference(clausify,[status(thm)],[f_2_4]) ).
fof(f_3_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k1_xboole_0]) ).
cnf(f_3_2,plain,
$true,
inference(clausify,[status(thm)],[f_3_1]) ).
fof(f_4_1,plain,
empty(empty_set),
inference(fof_nnf,[status(thm)],[fc1_xboole_0]) ).
cnf(f_4_2,plain,
empty(empty_set),
inference(clausify,[status(thm)],[f_4_1]) ).
fof(f_5_1,plain,
? [A] : empty(A),
inference(fof_nnf,[status(thm)],[rc1_xboole_0]) ).
fof(f_5_2,plain,
? [U_10] : empty(U_10),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
empty(sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_10,sK2)],[f_5_2]) ).
cnf(f_5_4,plain,
empty(sK2),
inference(clausify,[status(thm)],[f_5_3]) ).
fof(f_6_1,plain,
? [A] : ~ empty(A),
inference(fof_nnf,[status(thm)],[rc2_xboole_0]) ).
fof(f_6_2,plain,
? [U_11] : ~ empty(U_11),
inference(variable_rename,[status(thm)],[f_6_1]) ).
fof(f_6_3,plain,
~ empty(sK3),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_11,sK3)],[f_6_2]) ).
cnf(f_6_4,plain,
~ empty(sK3),
inference(clausify,[status(thm)],[f_6_3]) ).
fof(f_7_1,plain,
! [A,B] : subset(A,A),
inference(fof_nnf,[status(thm)],[reflexivity_r1_tarski]) ).
fof(f_7_2,plain,
! [U_13,U_12] : subset(U_13,U_13),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
! [U_13] : subset(U_13,U_13),
inference(miniscope,[status(thm)],[f_7_2]) ).
cnf(f_7_4,plain,
subset(U_13,U_13),
inference(clausify,[status(thm)],[f_7_3]) ).
fof(f_8_1,negated_conjecture,
~ ! [A,B,C] :
( ( subset(B,C)
& subset(A,B) )
=> subset(A,C) ),
inference(negate,[status(cth)],[t1_xboole_1]) ).
fof(f_8_2,negated_conjecture,
? [A,B,C] :
( ~ subset(A,C)
& subset(B,C)
& subset(A,B) ),
inference(fof_nnf,[status(thm)],[f_8_1]) ).
fof(f_8_3,negated_conjecture,
? [U_16,U_15,U_14] :
( ~ subset(U_16,U_14)
& subset(U_15,U_14)
& subset(U_16,U_15) ),
inference(variable_rename,[status(thm)],[f_8_2]) ).
fof(f_8_4,negated_conjecture,
? [U_15,U_14] :
( ~ subset(sK4,U_14)
& subset(U_15,U_14)
& subset(sK4,U_15) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_16,sK4)],[f_8_3]) ).
fof(f_8_5,negated_conjecture,
? [U_14] :
( ~ subset(sK4,U_14)
& subset(sK5,U_14)
& subset(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_15,sK5)],[f_8_4]) ).
fof(f_8_6,negated_conjecture,
( ~ subset(sK4,sK6)
& subset(sK5,sK6)
& subset(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_14,sK6)],[f_8_5]) ).
fof(f_8_7,negated_conjecture,
( ~ subset(sK4,sK6)
& subset(sK5,sK6)
& subset(sK4,sK5) ),
inference(definitional_conversion,[status(esa)],[f_8_6]) ).
cnf(f_8_8,negated_conjecture,
subset(sK4,sK5),
inference(clausify,[status(thm)],[f_8_7]) ).
cnf(f_8_9,negated_conjecture,
subset(sK5,sK6),
inference(clausify,[status(thm)],[f_8_7]) ).
cnf(f_8_10,negated_conjecture,
~ subset(sK4,sK6),
inference(clausify,[status(thm)],[f_8_7]) ).
fof(f_9_1,plain,
! [A] :
( A = empty_set
| ~ empty(A) ),
inference(fof_nnf,[status(thm)],[t6_boole]) ).
fof(f_9_2,plain,
! [U_17] :
( U_17 = empty_set
| ~ empty(U_17) ),
inference(variable_rename,[status(thm)],[f_9_1]) ).
cnf(f_9_3,plain,
( U_17 = empty_set
| ~ empty(U_17) ),
inference(clausify,[status(thm)],[f_9_2]) ).
fof(f_10_1,plain,
! [A,B] :
( ~ empty(B)
| ~ in(A,B) ),
inference(fof_nnf,[status(thm)],[t7_boole]) ).
fof(f_10_2,plain,
! [U_19,U_18] :
( ~ empty(U_18)
| ~ in(U_19,U_18) ),
inference(variable_rename,[status(thm)],[f_10_1]) ).
cnf(f_10_3,plain,
( ~ empty(U_18)
| ~ in(U_19,U_18) ),
inference(clausify,[status(thm)],[f_10_2]) ).
fof(f_11_1,plain,
! [A,B] :
( ~ empty(B)
| A = B
| ~ empty(A) ),
inference(fof_nnf,[status(thm)],[t8_boole]) ).
fof(f_11_2,plain,
! [U_21,U_20] :
( ~ empty(U_20)
| U_21 = U_20
| ~ empty(U_21) ),
inference(variable_rename,[status(thm)],[f_11_1]) ).
fof(f_11_3,plain,
! [U_21] :
( ! [U_20] :
( ~ empty(U_20)
| U_21 = U_20 )
| ~ empty(U_21) ),
inference(miniscope,[status(thm)],[f_11_2]) ).
cnf(f_11_4,plain,
( ~ empty(U_20)
| U_21 = U_20
| ~ empty(U_21) ),
inference(clausify,[status(thm)],[f_11_3]) ).
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,
( 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_5,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_6,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(equality_7,axiom,
( empty(Eq_y_0)
| ~ empty(Eq_x_0)
| 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 : SEU121+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.10/0.37 % Computer : n005.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:20:18 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
%------------------------------------------------------------------------------