%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET907+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 : n011.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:46 AM UTC 2026
% Result : Theorem 0.08s 15.46s
% 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_k2_xboole_0,axiom,
! [A,B] : set_union2(A,B) = set_union2(B,A),
file('theBenchmark.p',commutativity_k2_xboole_0) ).
fof(fc2_xboole_0,axiom,
! [A,B] :
( ~ empty(A)
=> ~ empty(set_union2(A,B)) ),
file('theBenchmark.p',fc2_xboole_0) ).
fof(fc3_xboole_0,axiom,
! [A,B] :
( ~ empty(A)
=> ~ empty(set_union2(B,A)) ),
file('theBenchmark.p',fc3_xboole_0) ).
fof(idempotence_k2_xboole_0,axiom,
! [A,B] : set_union2(A,A) = A,
file('theBenchmark.p',idempotence_k2_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(t12_xboole_1,axiom,
! [A,B] :
( subset(A,B)
=> set_union2(A,B) = B ),
file('theBenchmark.p',t12_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(t48_zfmisc_1,conjecture,
! [A,B,C] :
( ( in(C,B)
& in(A,B) )
=> set_union2(unordered_pair(A,C),B) = B ),
file('theBenchmark.p',t48_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_union2(A,B) = set_union2(B,A),
inference(fof_nnf,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(f_3_2,plain,
! [U_5,U_4] : set_union2(U_5,U_4) = set_union2(U_4,U_5),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
set_union2(U_5,U_4) = set_union2(U_4,U_5),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,plain,
! [A,B] :
( ~ empty(set_union2(A,B))
| empty(A) ),
inference(fof_nnf,[status(thm)],[fc2_xboole_0]) ).
fof(f_4_2,plain,
! [U_7,U_6] :
( ~ empty(set_union2(U_7,U_6))
| empty(U_7) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
! [U_7] :
( ! [U_6] : ~ empty(set_union2(U_7,U_6))
| empty(U_7) ),
inference(miniscope,[status(thm)],[f_4_2]) ).
cnf(f_4_4,plain,
( ~ empty(set_union2(U_7,U_6))
| empty(U_7) ),
inference(clausify,[status(thm)],[f_4_3]) ).
fof(f_5_1,plain,
! [A,B] :
( ~ empty(set_union2(B,A))
| empty(A) ),
inference(fof_nnf,[status(thm)],[fc3_xboole_0]) ).
fof(f_5_2,plain,
! [U_9,U_8] :
( ~ empty(set_union2(U_8,U_9))
| empty(U_9) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
! [U_9] :
( ! [U_8] : ~ empty(set_union2(U_8,U_9))
| empty(U_9) ),
inference(miniscope,[status(thm)],[f_5_2]) ).
cnf(f_5_4,plain,
( ~ empty(set_union2(U_8,U_9))
| empty(U_9) ),
inference(clausify,[status(thm)],[f_5_3]) ).
fof(f_6_1,plain,
! [A,B] : set_union2(A,A) = A,
inference(fof_nnf,[status(thm)],[idempotence_k2_xboole_0]) ).
fof(f_6_2,plain,
! [U_11,U_10] : set_union2(U_11,U_11) = U_11,
inference(variable_rename,[status(thm)],[f_6_1]) ).
fof(f_6_3,plain,
! [U_11] : set_union2(U_11,U_11) = U_11,
inference(miniscope,[status(thm)],[f_6_2]) ).
cnf(f_6_4,plain,
set_union2(U_11,U_11) = U_11,
inference(clausify,[status(thm)],[f_6_3]) ).
fof(f_7_1,plain,
? [A] : empty(A),
inference(fof_nnf,[status(thm)],[rc1_xboole_0]) ).
fof(f_7_2,plain,
? [U_12] : empty(U_12),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
empty(sK1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_12,sK1)],[f_7_2]) ).
cnf(f_7_4,plain,
empty(sK1),
inference(clausify,[status(thm)],[f_7_3]) ).
fof(f_8_1,plain,
? [A] : ~ empty(A),
inference(fof_nnf,[status(thm)],[rc2_xboole_0]) ).
fof(f_8_2,plain,
? [U_13] : ~ empty(U_13),
inference(variable_rename,[status(thm)],[f_8_1]) ).
fof(f_8_3,plain,
~ empty(sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_13,sK2)],[f_8_2]) ).
cnf(f_8_4,plain,
~ empty(sK2),
inference(clausify,[status(thm)],[f_8_3]) ).
fof(f_9_1,plain,
! [A,B] : subset(A,A),
inference(fof_nnf,[status(thm)],[reflexivity_r1_tarski]) ).
fof(f_9_2,plain,
! [U_15,U_14] : subset(U_15,U_15),
inference(variable_rename,[status(thm)],[f_9_1]) ).
fof(f_9_3,plain,
! [U_15] : subset(U_15,U_15),
inference(miniscope,[status(thm)],[f_9_2]) ).
cnf(f_9_4,plain,
subset(U_15,U_15),
inference(clausify,[status(thm)],[f_9_3]) ).
fof(f_10_1,plain,
! [A,B] :
( set_union2(A,B) = B
| ~ subset(A,B) ),
inference(fof_nnf,[status(thm)],[t12_xboole_1]) ).
fof(f_10_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_10_1]) ).
cnf(f_10_3,plain,
( set_union2(U_17,U_16) = U_16
| ~ subset(U_17,U_16) ),
inference(clausify,[status(thm)],[f_10_2]) ).
fof(f_11_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_11_2,plain,
! [U_20,U_19,U_18] :
( ( subset(unordered_pair(U_20,U_19),U_18)
| ~ in(U_19,U_18)
| ~ in(U_20,U_18) )
& ( ( in(U_19,U_18)
& in(U_20,U_18) )
| ~ subset(unordered_pair(U_20,U_19),U_18) ) ),
inference(variable_rename,[status(thm)],[f_11_1]) ).
fof(f_11_3,plain,
( ! [U_26,U_24,U_22] :
( subset(unordered_pair(U_26,U_24),U_22)
| ~ in(U_24,U_22)
| ~ in(U_26,U_22) )
& ! [U_25,U_23,U_21] :
( ( in(U_23,U_21)
& in(U_25,U_21) )
| ~ subset(unordered_pair(U_25,U_23),U_21) ) ),
inference(miniscope,[status(thm)],[f_11_2]) ).
cnf(f_11_4,plain,
( in(U_25,U_21)
| ~ subset(unordered_pair(U_25,U_23),U_21) ),
inference(clausify,[status(thm)],[f_11_3]) ).
cnf(f_11_5,plain,
( in(U_23,U_21)
| ~ subset(unordered_pair(U_25,U_23),U_21) ),
inference(clausify,[status(thm)],[f_11_3]) ).
cnf(f_11_6,plain,
( subset(unordered_pair(U_26,U_24),U_22)
| ~ in(U_24,U_22)
| ~ in(U_26,U_22) ),
inference(clausify,[status(thm)],[f_11_3]) ).
fof(f_12_1,negated_conjecture,
~ ! [A,B,C] :
( ( in(C,B)
& in(A,B) )
=> set_union2(unordered_pair(A,C),B) = B ),
inference(negate,[status(cth)],[t48_zfmisc_1]) ).
fof(f_12_2,negated_conjecture,
? [A,B,C] :
( set_union2(unordered_pair(A,C),B) != B
& in(C,B)
& in(A,B) ),
inference(fof_nnf,[status(thm)],[f_12_1]) ).
fof(f_12_3,negated_conjecture,
? [U_29,U_28,U_27] :
( set_union2(unordered_pair(U_29,U_27),U_28) != U_28
& in(U_27,U_28)
& in(U_29,U_28) ),
inference(variable_rename,[status(thm)],[f_12_2]) ).
fof(f_12_4,negated_conjecture,
? [U_28,U_27] :
( set_union2(unordered_pair(sK3,U_27),U_28) != U_28
& in(U_27,U_28)
& in(sK3,U_28) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_29,sK3)],[f_12_3]) ).
fof(f_12_5,negated_conjecture,
? [U_27] :
( set_union2(unordered_pair(sK3,U_27),sK4) != sK4
& in(U_27,sK4)
& in(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_28,sK4)],[f_12_4]) ).
fof(f_12_6,negated_conjecture,
( set_union2(unordered_pair(sK3,sK5),sK4) != sK4
& in(sK5,sK4)
& in(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_27,sK5)],[f_12_5]) ).
fof(f_12_7,negated_conjecture,
( set_union2(unordered_pair(sK3,sK5),sK4) != sK4
& in(sK5,sK4)
& in(sK3,sK4) ),
inference(definitional_conversion,[status(esa)],[f_12_6]) ).
cnf(f_12_8,negated_conjecture,
in(sK3,sK4),
inference(clausify,[status(thm)],[f_12_7]) ).
cnf(f_12_9,negated_conjecture,
in(sK5,sK4),
inference(clausify,[status(thm)],[f_12_7]) ).
cnf(f_12_10,negated_conjecture,
set_union2(unordered_pair(sK3,sK5),sK4) != sK4,
inference(clausify,[status(thm)],[f_12_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_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_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 : SET907+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/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/15.43 % CPULimit : 300
% 0.08/15.43 % WCLimit : 300
% 0.08/15.43 % DateTime : Sat Sep 19 23:07:12 UTC 2026
% 0.08/15.43 % CPUTime :
% 0.08/15.46 % SZS status Theorem for theBenchmark
% 0.08/15.46 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------