%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU139+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 : n012.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:10 AM UTC 2026
% Result : Theorem 0.03s 10.32s
% Output : Proof 0.03s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(antisymmetry_r2_xboole_0,axiom,
! [A,B] :
( proper_subset(A,B)
=> ~ proper_subset(B,A) ),
file('theBenchmark.p',antisymmetry_r2_xboole_0) ).
fof(d10_xboole_0,axiom,
! [A,B] :
( A = B
<=> ( subset(B,A)
& subset(A,B) ) ),
file('theBenchmark.p',d10_xboole_0) ).
fof(d8_xboole_0,axiom,
! [A,B] :
( proper_subset(A,B)
<=> ( A != B
& subset(A,B) ) ),
file('theBenchmark.p',d8_xboole_0) ).
fof(irreflexivity_r2_xboole_0,axiom,
! [A,B] : ~ proper_subset(A,A),
file('theBenchmark.p',irreflexivity_r2_xboole_0) ).
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A),
file('theBenchmark.p',reflexivity_r1_tarski) ).
fof(t60_xboole_1,conjecture,
! [A,B] :
~ ( proper_subset(B,A)
& subset(A,B) ),
file('theBenchmark.p',t60_xboole_1) ).
fof(f_1_1,plain,
! [A,B] :
( ~ proper_subset(B,A)
| ~ proper_subset(A,B) ),
inference(fof_nnf,[status(thm)],[antisymmetry_r2_xboole_0]) ).
fof(f_1_2,plain,
! [U_1,U_0] :
( ~ proper_subset(U_0,U_1)
| ~ proper_subset(U_1,U_0) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
cnf(f_1_3,plain,
( ~ proper_subset(U_0,U_1)
| ~ proper_subset(U_1,U_0) ),
inference(clausify,[status(thm)],[f_1_2]) ).
fof(f_2_1,plain,
! [A,B] :
( ( A = B
| ~ subset(B,A)
| ~ subset(A,B) )
& ( ( subset(B,A)
& subset(A,B) )
| A != B ) ),
inference(fof_nnf,[status(thm)],[d10_xboole_0]) ).
fof(f_2_2,plain,
! [U_3,U_2] :
( ( U_3 = U_2
| ~ subset(U_2,U_3)
| ~ subset(U_3,U_2) )
& ( ( subset(U_2,U_3)
& subset(U_3,U_2) )
| U_3 != U_2 ) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_7,U_5] :
( U_7 = U_5
| ~ subset(U_5,U_7)
| ~ subset(U_7,U_5) )
& ! [U_6,U_4] :
( ( subset(U_4,U_6)
& subset(U_6,U_4) )
| U_6 != U_4 ) ),
inference(miniscope,[status(thm)],[f_2_2]) ).
cnf(f_2_4,plain,
( subset(U_6,U_4)
| U_6 != U_4 ),
inference(clausify,[status(thm)],[f_2_3]) ).
cnf(f_2_5,plain,
( subset(U_4,U_6)
| U_6 != U_4 ),
inference(clausify,[status(thm)],[f_2_3]) ).
cnf(f_2_6,plain,
( U_7 = U_5
| ~ subset(U_5,U_7)
| ~ subset(U_7,U_5) ),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_3_1,plain,
! [A,B] :
( ( proper_subset(A,B)
| A = B
| ~ subset(A,B) )
& ( ( A != B
& subset(A,B) )
| ~ proper_subset(A,B) ) ),
inference(fof_nnf,[status(thm)],[d8_xboole_0]) ).
fof(f_3_2,plain,
! [U_9,U_8] :
( ( proper_subset(U_9,U_8)
| U_9 = U_8
| ~ subset(U_9,U_8) )
& ( ( U_9 != U_8
& subset(U_9,U_8) )
| ~ proper_subset(U_9,U_8) ) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
( ! [U_13,U_11] :
( proper_subset(U_13,U_11)
| U_13 = U_11
| ~ subset(U_13,U_11) )
& ! [U_12,U_10] :
( ( U_12 != U_10
& subset(U_12,U_10) )
| ~ proper_subset(U_12,U_10) ) ),
inference(miniscope,[status(thm)],[f_3_2]) ).
cnf(f_3_4,plain,
( subset(U_12,U_10)
| ~ proper_subset(U_12,U_10) ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_5,plain,
( U_12 != U_10
| ~ proper_subset(U_12,U_10) ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_6,plain,
( proper_subset(U_13,U_11)
| U_13 = U_11
| ~ subset(U_13,U_11) ),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_4_1,plain,
! [A,B] : ~ proper_subset(A,A),
inference(fof_nnf,[status(thm)],[irreflexivity_r2_xboole_0]) ).
fof(f_4_2,plain,
! [U_15,U_14] : ~ proper_subset(U_15,U_15),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
! [U_15] : ~ proper_subset(U_15,U_15),
inference(miniscope,[status(thm)],[f_4_2]) ).
cnf(f_4_4,plain,
~ proper_subset(U_15,U_15),
inference(clausify,[status(thm)],[f_4_3]) ).
fof(f_5_1,plain,
! [A,B] : subset(A,A),
inference(fof_nnf,[status(thm)],[reflexivity_r1_tarski]) ).
fof(f_5_2,plain,
! [U_17,U_16] : subset(U_17,U_17),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
! [U_17] : subset(U_17,U_17),
inference(miniscope,[status(thm)],[f_5_2]) ).
cnf(f_5_4,plain,
subset(U_17,U_17),
inference(clausify,[status(thm)],[f_5_3]) ).
fof(f_6_1,negated_conjecture,
~ ! [A,B] :
~ ( proper_subset(B,A)
& subset(A,B) ),
inference(negate,[status(cth)],[t60_xboole_1]) ).
fof(f_6_2,negated_conjecture,
? [A,B] :
( proper_subset(B,A)
& subset(A,B) ),
inference(fof_nnf,[status(thm)],[f_6_1]) ).
fof(f_6_3,negated_conjecture,
? [U_19,U_18] :
( proper_subset(U_18,U_19)
& subset(U_19,U_18) ),
inference(variable_rename,[status(thm)],[f_6_2]) ).
fof(f_6_4,negated_conjecture,
? [U_18] :
( proper_subset(U_18,sK1)
& subset(sK1,U_18) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_19,sK1)],[f_6_3]) ).
fof(f_6_5,negated_conjecture,
( proper_subset(sK2,sK1)
& subset(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_18,sK2)],[f_6_4]) ).
fof(f_6_6,negated_conjecture,
( proper_subset(sK2,sK1)
& subset(sK1,sK2) ),
inference(definitional_conversion,[status(esa)],[f_6_5]) ).
cnf(f_6_7,negated_conjecture,
subset(sK1,sK2),
inference(clausify,[status(thm)],[f_6_6]) ).
cnf(f_6_8,negated_conjecture,
proper_subset(sK2,sK1),
inference(clausify,[status(thm)],[f_6_6]) ).
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,
( proper_subset(Eq_y_0,Eq_y_1)
| ~ proper_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_5,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.01 % Problem : SEU139+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.01 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.02 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/10.31 % Computer : n012.cluster.edu
% 0.03/10.31 % Model : x86_64 x86_64
% 0.03/10.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/10.31 % Memory : 8046.5625MB
% 0.03/10.31 % OS : Linux 6.8.0-71-generic
% 0.03/10.31 % CPULimit : 300
% 0.03/10.31 % WCLimit : 300
% 0.03/10.31 % DateTime : Sat Sep 19 23:21:44 UTC 2026
% 0.03/10.31 % CPUTime :
% 0.03/10.32 % SZS status Theorem for theBenchmark
% 0.03/10.32 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------