%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET912+1 : TPTP v9.3.1. Released v3.2.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 : n017.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:57:47 AM UTC 2026
% Result : Theorem 0.08s 5.39s
% Output : Proof 0.08s
% 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_tarski,axiom,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
file('theBenchmark.p',commutativity_k2_tarski) ).
fof(commutativity_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
file('theBenchmark.p',commutativity_k3_xboole_0) ).
fof(idempotence_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,A) = A,
file('theBenchmark.p',idempotence_k3_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(t28_xboole_1,axiom,
! [A,B] :
( subset(A,B)
=> set_intersection2(A,B) = A ),
file('theBenchmark.p',t28_xboole_1) ).
fof(t38_zfmisc_1,axiom,
! [A,B,C] :
( subset(unordered_pair(A,B),C)
<=> ( in(B,C)
& in(A,C) ) ),
file('theBenchmark.p',t38_zfmisc_1) ).
fof(t53_zfmisc_1,conjecture,
! [A,B,C] :
( ( in(C,B)
& in(A,B) )
=> set_intersection2(unordered_pair(A,C),B) = unordered_pair(A,C) ),
file('theBenchmark.p',t53_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] : unordered_pair(A,B) = unordered_pair(B,A),
inference(fof_nnf,[status(thm)],[commutativity_k2_tarski]) ).
fof(f_2_2,plain,
! [U_3,U_2] : unordered_pair(U_3,U_2) = unordered_pair(U_2,U_3),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
unordered_pair(U_3,U_2) = unordered_pair(U_2,U_3),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,plain,
! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
inference(fof_nnf,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(f_3_2,plain,
! [U_5,U_4] : set_intersection2(U_5,U_4) = set_intersection2(U_4,U_5),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
set_intersection2(U_5,U_4) = set_intersection2(U_4,U_5),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,plain,
! [A,B] : set_intersection2(A,A) = A,
inference(fof_nnf,[status(thm)],[idempotence_k3_xboole_0]) ).
fof(f_4_2,plain,
! [U_7,U_6] : set_intersection2(U_7,U_7) = U_7,
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
! [U_7] : set_intersection2(U_7,U_7) = U_7,
inference(miniscope,[status(thm)],[f_4_2]) ).
cnf(f_4_4,plain,
set_intersection2(U_7,U_7) = U_7,
inference(clausify,[status(thm)],[f_4_3]) ).
fof(f_5_1,plain,
? [A] : empty(A),
inference(fof_nnf,[status(thm)],[rc1_xboole_0]) ).
fof(f_5_2,plain,
? [U_8] : empty(U_8),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
empty(sK1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_8,sK1)],[f_5_2]) ).
cnf(f_5_4,plain,
empty(sK1),
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_9] : ~ empty(U_9),
inference(variable_rename,[status(thm)],[f_6_1]) ).
fof(f_6_3,plain,
~ empty(sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_9,sK2)],[f_6_2]) ).
cnf(f_6_4,plain,
~ empty(sK2),
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_11,U_10] : subset(U_11,U_11),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
! [U_11] : subset(U_11,U_11),
inference(miniscope,[status(thm)],[f_7_2]) ).
cnf(f_7_4,plain,
subset(U_11,U_11),
inference(clausify,[status(thm)],[f_7_3]) ).
fof(f_8_1,plain,
! [A,B] :
( set_intersection2(A,B) = A
| ~ subset(A,B) ),
inference(fof_nnf,[status(thm)],[t28_xboole_1]) ).
fof(f_8_2,plain,
! [U_13,U_12] :
( set_intersection2(U_13,U_12) = U_13
| ~ subset(U_13,U_12) ),
inference(variable_rename,[status(thm)],[f_8_1]) ).
cnf(f_8_3,plain,
( set_intersection2(U_13,U_12) = U_13
| ~ subset(U_13,U_12) ),
inference(clausify,[status(thm)],[f_8_2]) ).
fof(f_9_1,plain,
! [A,B,C] :
( ( subset(unordered_pair(A,B),C)
| ~ in(B,C)
| ~ in(A,C) )
& ( ( in(B,C)
& in(A,C) )
| ~ subset(unordered_pair(A,B),C) ) ),
inference(fof_nnf,[status(thm)],[t38_zfmisc_1]) ).
fof(f_9_2,plain,
! [U_16,U_15,U_14] :
( ( subset(unordered_pair(U_16,U_15),U_14)
| ~ in(U_15,U_14)
| ~ in(U_16,U_14) )
& ( ( in(U_15,U_14)
& in(U_16,U_14) )
| ~ subset(unordered_pair(U_16,U_15),U_14) ) ),
inference(variable_rename,[status(thm)],[f_9_1]) ).
fof(f_9_3,plain,
( ! [U_22,U_20,U_18] :
( subset(unordered_pair(U_22,U_20),U_18)
| ~ in(U_20,U_18)
| ~ in(U_22,U_18) )
& ! [U_21,U_19,U_17] :
( ( in(U_19,U_17)
& in(U_21,U_17) )
| ~ subset(unordered_pair(U_21,U_19),U_17) ) ),
inference(miniscope,[status(thm)],[f_9_2]) ).
cnf(f_9_4,plain,
( in(U_21,U_17)
| ~ subset(unordered_pair(U_21,U_19),U_17) ),
inference(clausify,[status(thm)],[f_9_3]) ).
cnf(f_9_5,plain,
( in(U_19,U_17)
| ~ subset(unordered_pair(U_21,U_19),U_17) ),
inference(clausify,[status(thm)],[f_9_3]) ).
cnf(f_9_6,plain,
( subset(unordered_pair(U_22,U_20),U_18)
| ~ in(U_20,U_18)
| ~ in(U_22,U_18) ),
inference(clausify,[status(thm)],[f_9_3]) ).
fof(f_10_1,negated_conjecture,
~ ! [A,B,C] :
( ( in(C,B)
& in(A,B) )
=> set_intersection2(unordered_pair(A,C),B) = unordered_pair(A,C) ),
inference(negate,[status(cth)],[t53_zfmisc_1]) ).
fof(f_10_2,negated_conjecture,
? [A,B,C] :
( set_intersection2(unordered_pair(A,C),B) != unordered_pair(A,C)
& in(C,B)
& in(A,B) ),
inference(fof_nnf,[status(thm)],[f_10_1]) ).
fof(f_10_3,negated_conjecture,
? [U_25,U_24,U_23] :
( set_intersection2(unordered_pair(U_25,U_23),U_24) != unordered_pair(U_25,U_23)
& in(U_23,U_24)
& in(U_25,U_24) ),
inference(variable_rename,[status(thm)],[f_10_2]) ).
fof(f_10_4,negated_conjecture,
? [U_24,U_23] :
( set_intersection2(unordered_pair(sK3,U_23),U_24) != unordered_pair(sK3,U_23)
& in(U_23,U_24)
& in(sK3,U_24) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_25,sK3)],[f_10_3]) ).
fof(f_10_5,negated_conjecture,
? [U_23] :
( set_intersection2(unordered_pair(sK3,U_23),sK4) != unordered_pair(sK3,U_23)
& in(U_23,sK4)
& in(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_24,sK4)],[f_10_4]) ).
fof(f_10_6,negated_conjecture,
( set_intersection2(unordered_pair(sK3,sK5),sK4) != unordered_pair(sK3,sK5)
& in(sK5,sK4)
& in(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_23,sK5)],[f_10_5]) ).
fof(f_10_7,negated_conjecture,
( set_intersection2(unordered_pair(sK3,sK5),sK4) != unordered_pair(sK3,sK5)
& in(sK5,sK4)
& in(sK3,sK4) ),
inference(definitional_conversion,[status(esa)],[f_10_6]) ).
cnf(f_10_8,negated_conjecture,
in(sK3,sK4),
inference(clausify,[status(thm)],[f_10_7]) ).
cnf(f_10_9,negated_conjecture,
in(sK5,sK4),
inference(clausify,[status(thm)],[f_10_7]) ).
cnf(f_10_10,negated_conjecture,
set_intersection2(unordered_pair(sK3,sK5),sK4) != unordered_pair(sK3,sK5),
inference(clausify,[status(thm)],[f_10_7]) ).
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,
( unordered_pair(Eq_x_0,Eq_x_1) = unordered_pair(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,
( set_intersection2(Eq_x_0,Eq_x_1) = set_intersection2(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,
( empty(Eq_y_0)
| ~ empty(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_8,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 : SET912+1 : TPTP v9.3.1. Released v3.2.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.08/5.36 % Computer : n017.cluster.edu
% 0.08/5.36 % Model : x86_64 x86_64
% 0.08/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.36 % Memory : 8046.5625MB
% 0.08/5.36 % OS : Linux 6.8.0-71-generic
% 0.08/5.36 % CPULimit : 300
% 0.08/5.36 % WCLimit : 300
% 0.08/5.36 % DateTime : Sat Sep 19 23:02:31 UTC 2026
% 0.08/5.36 % CPUTime :
% 0.08/5.39 % SZS status Theorem for theBenchmark
% 0.08/5.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------