%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET916+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 : n014.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 273.33s 283.61s
% Output : Proof 275.68s
% 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(d2_tarski,axiom,
! [A,B,C] :
( C = unordered_pair(A,B)
<=> ! [D] :
( in(D,C)
<=> ( D = B
| D = A ) ) ),
file('theBenchmark.p',d2_tarski) ).
fof(d3_xboole_0,axiom,
! [A,B,C] :
( C = set_intersection2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,B)
& in(D,A) ) ) ),
file('theBenchmark.p',d3_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(symmetry_r1_xboole_0,axiom,
! [A,B] :
( disjoint(A,B)
=> disjoint(B,A) ),
file('theBenchmark.p',symmetry_r1_xboole_0) ).
fof(t4_xboole_0,axiom,
! [A,B] :
( ~ ( disjoint(A,B)
& ? [C] : in(C,set_intersection2(A,B)) )
& ~ ( ! [C] : ~ in(C,set_intersection2(A,B))
& ~ disjoint(A,B) ) ),
file('theBenchmark.p',t4_xboole_0) ).
fof(t57_zfmisc_1,conjecture,
! [A,B,C] :
~ ( ~ disjoint(unordered_pair(A,C),B)
& ~ in(C,B)
& ~ in(A,B) ),
file('theBenchmark.p',t57_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]) ).
fof(f_1_3,plain,
! [U_0,U_1] :
( ~ in(U_0,U_1)
| ~ in(U_1,U_0) ),
inference(definitional_conversion,[status(esa)],[f_1_2]) ).
cnf(f_1_4,plain,
( ~ in(U_0,U_1)
| ~ in(U_1,U_0) ),
inference(clausify,[status(thm)],[f_1_3]) ).
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]) ).
fof(f_2_3,plain,
! [U_2,U_3] : unordered_pair(U_3,U_2) = unordered_pair(U_2,U_3),
inference(definitional_conversion,[status(esa)],[f_2_2]) ).
cnf(f_2_4,plain,
unordered_pair(U_3,U_2) = unordered_pair(U_2,U_3),
inference(clausify,[status(thm)],[f_2_3]) ).
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]) ).
fof(f_3_3,plain,
! [U_5,U_4] : set_intersection2(U_5,U_4) = set_intersection2(U_4,U_5),
inference(definitional_conversion,[status(esa)],[f_3_2]) ).
cnf(f_3_4,plain,
set_intersection2(U_5,U_4) = set_intersection2(U_4,U_5),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_4_1,plain,
! [A,B,C] :
( ( C = unordered_pair(A,B)
| ? [D] :
( ( ~ in(D,C)
& ( D = B
| D = A ) )
| ( D != B
& D != A
& in(D,C) ) ) )
& ( ! [D] :
( ( in(D,C)
| ( D != B
& D != A ) )
& ( D = B
| D = A
| ~ in(D,C) ) )
| C != unordered_pair(A,B) ) ),
inference(fof_nnf,[status(thm)],[d2_tarski]) ).
fof(f_4_2,plain,
! [U_10,U_9,U_8] :
( ( U_8 = unordered_pair(U_10,U_9)
| ? [U_7] :
( ( ~ in(U_7,U_8)
& ( U_7 = U_9
| U_7 = U_10 ) )
| ( U_7 != U_9
& U_7 != U_10
& in(U_7,U_8) ) ) )
& ( ! [U_6] :
( ( in(U_6,U_8)
| ( U_6 != U_9
& U_6 != U_10 ) )
& ( U_6 = U_9
| U_6 = U_10
| ~ in(U_6,U_8) ) )
| U_8 != unordered_pair(U_10,U_9) ) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
( ! [U_20,U_18,U_16] :
( U_16 = unordered_pair(U_20,U_18)
| ? [U_14] :
( ~ in(U_14,U_16)
& ( U_14 = U_18
| U_14 = U_20 ) )
| ? [U_13] :
( U_13 != U_18
& U_13 != U_20
& in(U_13,U_16) ) )
& ! [U_19,U_17,U_15] :
( ( ! [U_12] :
( in(U_12,U_15)
| ( U_12 != U_17
& U_12 != U_19 ) )
& ! [U_11] :
( U_11 = U_17
| U_11 = U_19
| ~ in(U_11,U_15) ) )
| U_15 != unordered_pair(U_19,U_17) ) ),
inference(miniscope,[status(thm)],[f_4_2]) ).
fof(f_4_4,plain,
( ! [U_20,U_18,U_16] :
( U_16 = unordered_pair(U_20,U_18)
| ? [U_14] :
( ~ in(U_14,U_16)
& ( U_14 = U_18
| U_14 = U_20 ) )
| ( sK1(U_20,U_18,U_16) != U_18
& sK1(U_20,U_18,U_16) != U_20
& in(sK1(U_20,U_18,U_16),U_16) ) )
& ! [U_19,U_17,U_15] :
( ( ! [U_12] :
( in(U_12,U_15)
| ( U_12 != U_17
& U_12 != U_19 ) )
& ! [U_11] :
( U_11 = U_17
| U_11 = U_19
| ~ in(U_11,U_15) ) )
| U_15 != unordered_pair(U_19,U_17) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_13,sK1(U_20,U_18,U_16))],[f_4_3]) ).
fof(f_4_5,plain,
( ! [U_20,U_18,U_16] :
( U_16 = unordered_pair(U_20,U_18)
| ( ~ in(sK2(U_20,U_18,U_16),U_16)
& ( sK2(U_20,U_18,U_16) = U_18
| sK2(U_20,U_18,U_16) = U_20 ) )
| ( sK1(U_20,U_18,U_16) != U_18
& sK1(U_20,U_18,U_16) != U_20
& in(sK1(U_20,U_18,U_16),U_16) ) )
& ! [U_19,U_17,U_15] :
( ( ! [U_12] :
( in(U_12,U_15)
| ( U_12 != U_17
& U_12 != U_19 ) )
& ! [U_11] :
( U_11 = U_17
| U_11 = U_19
| ~ in(U_11,U_15) ) )
| U_15 != unordered_pair(U_19,U_17) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_14,sK2(U_20,U_18,U_16))],[f_4_4]) ).
fof(f_4_6,plain,
( ! [U_18,U_16,U_20] :
( ~ in(sK2(U_20,U_18,U_16),U_16)
| ~ sP3(U_18,U_16,U_20) )
& ! [U_18,U_16,U_20] :
( sK2(U_20,U_18,U_16) = U_18
| sK2(U_20,U_18,U_16) = U_20
| ~ sP3(U_18,U_16,U_20) )
& ! [U_18,U_16,U_20] :
( sK1(U_20,U_18,U_16) != U_18
| ~ sP2(U_18,U_16,U_20) )
& ! [U_18,U_16,U_20] :
( sK1(U_20,U_18,U_16) != U_20
| ~ sP2(U_18,U_16,U_20) )
& ! [U_18,U_16,U_20] :
( in(sK1(U_20,U_18,U_16),U_16)
| ~ sP2(U_18,U_16,U_20) )
& ! [U_12,U_17,U_19] :
( U_12 != U_17
| ~ sP0(U_12,U_17,U_19) )
& ! [U_12,U_17,U_19] :
( U_12 != U_19
| ~ sP0(U_12,U_17,U_19) )
& ! [U_11,U_12,U_17,U_15,U_19] :
( in(U_12,U_15)
| sP0(U_12,U_17,U_19)
| ~ sP1(U_11,U_12,U_17,U_15,U_19) )
& ! [U_11,U_12,U_17,U_15,U_19] :
( U_11 = U_17
| U_11 = U_19
| ~ in(U_11,U_15)
| ~ sP1(U_11,U_12,U_17,U_15,U_19) )
& ! [U_18,U_16,U_20] :
( U_16 = unordered_pair(U_20,U_18)
| sP3(U_18,U_16,U_20)
| sP2(U_18,U_16,U_20) )
& ! [U_11,U_12,U_17,U_15,U_19] :
( sP1(U_11,U_12,U_17,U_15,U_19)
| U_15 != unordered_pair(U_19,U_17) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1,sP2,sP3])],[f_4_5]) ).
cnf(f_4_7,plain,
( sP1(U_11,U_12,U_17,U_15,U_19)
| U_15 != unordered_pair(U_19,U_17) ),
inference(clausify,[status(thm)],[f_4_6]) ).
cnf(f_4_8,plain,
( U_16 = unordered_pair(U_20,U_18)
| sP3(U_18,U_16,U_20)
| sP2(U_18,U_16,U_20) ),
inference(clausify,[status(thm)],[f_4_6]) ).
cnf(f_4_9,plain,
( U_11 = U_17
| U_11 = U_19
| ~ in(U_11,U_15)
| ~ sP1(U_11,U_12,U_17,U_15,U_19) ),
inference(clausify,[status(thm)],[f_4_6]) ).
cnf(f_4_10,plain,
( in(U_12,U_15)
| sP0(U_12,U_17,U_19)
| ~ sP1(U_11,U_12,U_17,U_15,U_19) ),
inference(clausify,[status(thm)],[f_4_6]) ).
cnf(f_4_11,plain,
( U_12 != U_19
| ~ sP0(U_12,U_17,U_19) ),
inference(clausify,[status(thm)],[f_4_6]) ).
cnf(f_4_12,plain,
( U_12 != U_17
| ~ sP0(U_12,U_17,U_19) ),
inference(clausify,[status(thm)],[f_4_6]) ).
cnf(f_4_13,plain,
( in(sK1(U_20,U_18,U_16),U_16)
| ~ sP2(U_18,U_16,U_20) ),
inference(clausify,[status(thm)],[f_4_6]) ).
cnf(f_4_14,plain,
( sK1(U_20,U_18,U_16) != U_20
| ~ sP2(U_18,U_16,U_20) ),
inference(clausify,[status(thm)],[f_4_6]) ).
cnf(f_4_15,plain,
( sK1(U_20,U_18,U_16) != U_18
| ~ sP2(U_18,U_16,U_20) ),
inference(clausify,[status(thm)],[f_4_6]) ).
cnf(f_4_16,plain,
( sK2(U_20,U_18,U_16) = U_18
| sK2(U_20,U_18,U_16) = U_20
| ~ sP3(U_18,U_16,U_20) ),
inference(clausify,[status(thm)],[f_4_6]) ).
cnf(f_4_17,plain,
( ~ in(sK2(U_20,U_18,U_16),U_16)
| ~ sP3(U_18,U_16,U_20) ),
inference(clausify,[status(thm)],[f_4_6]) ).
fof(f_5_1,plain,
! [A,B,C] :
( ( C = set_intersection2(A,B)
| ? [D] :
( ( ~ in(D,C)
& in(D,B)
& in(D,A) )
| ( ( ~ in(D,B)
| ~ in(D,A) )
& in(D,C) ) ) )
& ( ! [D] :
( ( in(D,C)
| ~ in(D,B)
| ~ in(D,A) )
& ( ( in(D,B)
& in(D,A) )
| ~ in(D,C) ) )
| C != set_intersection2(A,B) ) ),
inference(fof_nnf,[status(thm)],[d3_xboole_0]) ).
fof(f_5_2,plain,
! [U_25,U_24,U_23] :
( ( U_23 = set_intersection2(U_25,U_24)
| ? [U_22] :
( ( ~ in(U_22,U_23)
& in(U_22,U_24)
& in(U_22,U_25) )
| ( ( ~ in(U_22,U_24)
| ~ in(U_22,U_25) )
& in(U_22,U_23) ) ) )
& ( ! [U_21] :
( ( in(U_21,U_23)
| ~ in(U_21,U_24)
| ~ in(U_21,U_25) )
& ( ( in(U_21,U_24)
& in(U_21,U_25) )
| ~ in(U_21,U_23) ) )
| U_23 != set_intersection2(U_25,U_24) ) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
( ! [U_35,U_33,U_31] :
( U_31 = set_intersection2(U_35,U_33)
| ? [U_29] :
( ~ in(U_29,U_31)
& in(U_29,U_33)
& in(U_29,U_35) )
| ? [U_28] :
( ( ~ in(U_28,U_33)
| ~ in(U_28,U_35) )
& in(U_28,U_31) ) )
& ! [U_34,U_32,U_30] :
( ( ! [U_27] :
( in(U_27,U_30)
| ~ in(U_27,U_32)
| ~ in(U_27,U_34) )
& ! [U_26] :
( ( in(U_26,U_32)
& in(U_26,U_34) )
| ~ in(U_26,U_30) ) )
| U_30 != set_intersection2(U_34,U_32) ) ),
inference(miniscope,[status(thm)],[f_5_2]) ).
fof(f_5_4,plain,
( ! [U_35,U_33,U_31] :
( U_31 = set_intersection2(U_35,U_33)
| ? [U_29] :
( ~ in(U_29,U_31)
& in(U_29,U_33)
& in(U_29,U_35) )
| ( ( ~ in(sK3(U_35,U_33,U_31),U_33)
| ~ in(sK3(U_35,U_33,U_31),U_35) )
& in(sK3(U_35,U_33,U_31),U_31) ) )
& ! [U_34,U_32,U_30] :
( ( ! [U_27] :
( in(U_27,U_30)
| ~ in(U_27,U_32)
| ~ in(U_27,U_34) )
& ! [U_26] :
( ( in(U_26,U_32)
& in(U_26,U_34) )
| ~ in(U_26,U_30) ) )
| U_30 != set_intersection2(U_34,U_32) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_28,sK3(U_35,U_33,U_31))],[f_5_3]) ).
fof(f_5_5,plain,
( ! [U_35,U_33,U_31] :
( U_31 = set_intersection2(U_35,U_33)
| ( ~ in(sK4(U_35,U_33,U_31),U_31)
& in(sK4(U_35,U_33,U_31),U_33)
& in(sK4(U_35,U_33,U_31),U_35) )
| ( ( ~ in(sK3(U_35,U_33,U_31),U_33)
| ~ in(sK3(U_35,U_33,U_31),U_35) )
& in(sK3(U_35,U_33,U_31),U_31) ) )
& ! [U_34,U_32,U_30] :
( ( ! [U_27] :
( in(U_27,U_30)
| ~ in(U_27,U_32)
| ~ in(U_27,U_34) )
& ! [U_26] :
( ( in(U_26,U_32)
& in(U_26,U_34) )
| ~ in(U_26,U_30) ) )
| U_30 != set_intersection2(U_34,U_32) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_29,sK4(U_35,U_33,U_31))],[f_5_4]) ).
fof(f_5_6,plain,
( ! [U_35,U_31,U_33] :
( ~ in(sK4(U_35,U_33,U_31),U_31)
| ~ sP7(U_35,U_31,U_33) )
& ! [U_35,U_31,U_33] :
( in(sK4(U_35,U_33,U_31),U_33)
| ~ sP7(U_35,U_31,U_33) )
& ! [U_35,U_31,U_33] :
( in(sK4(U_35,U_33,U_31),U_35)
| ~ sP7(U_35,U_31,U_33) )
& ! [U_35,U_31,U_33] :
( ~ in(sK3(U_35,U_33,U_31),U_33)
| ~ in(sK3(U_35,U_33,U_31),U_35)
| ~ sP6(U_35,U_31,U_33) )
& ! [U_35,U_31,U_33] :
( in(sK3(U_35,U_33,U_31),U_31)
| ~ sP6(U_35,U_31,U_33) )
& ! [U_26,U_34,U_32] :
( in(U_26,U_32)
| ~ sP4(U_26,U_34,U_32) )
& ! [U_26,U_34,U_32] :
( in(U_26,U_34)
| ~ sP4(U_26,U_34,U_32) )
& ! [U_30,U_27,U_26,U_34,U_32] :
( in(U_27,U_30)
| ~ in(U_27,U_32)
| ~ in(U_27,U_34)
| ~ sP5(U_30,U_27,U_26,U_34,U_32) )
& ! [U_30,U_27,U_26,U_34,U_32] :
( sP4(U_26,U_34,U_32)
| ~ in(U_26,U_30)
| ~ sP5(U_30,U_27,U_26,U_34,U_32) )
& ! [U_35,U_31,U_33] :
( U_31 = set_intersection2(U_35,U_33)
| sP7(U_35,U_31,U_33)
| sP6(U_35,U_31,U_33) )
& ! [U_30,U_27,U_26,U_34,U_32] :
( sP5(U_30,U_27,U_26,U_34,U_32)
| U_30 != set_intersection2(U_34,U_32) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP4,sP5,sP6,sP7])],[f_5_5]) ).
cnf(f_5_7,plain,
( sP5(U_30,U_27,U_26,U_34,U_32)
| U_30 != set_intersection2(U_34,U_32) ),
inference(clausify,[status(thm)],[f_5_6]) ).
cnf(f_5_8,plain,
( U_31 = set_intersection2(U_35,U_33)
| sP7(U_35,U_31,U_33)
| sP6(U_35,U_31,U_33) ),
inference(clausify,[status(thm)],[f_5_6]) ).
cnf(f_5_9,plain,
( sP4(U_26,U_34,U_32)
| ~ in(U_26,U_30)
| ~ sP5(U_30,U_27,U_26,U_34,U_32) ),
inference(clausify,[status(thm)],[f_5_6]) ).
cnf(f_5_10,plain,
( in(U_27,U_30)
| ~ in(U_27,U_32)
| ~ in(U_27,U_34)
| ~ sP5(U_30,U_27,U_26,U_34,U_32) ),
inference(clausify,[status(thm)],[f_5_6]) ).
cnf(f_5_11,plain,
( in(U_26,U_34)
| ~ sP4(U_26,U_34,U_32) ),
inference(clausify,[status(thm)],[f_5_6]) ).
cnf(f_5_12,plain,
( in(U_26,U_32)
| ~ sP4(U_26,U_34,U_32) ),
inference(clausify,[status(thm)],[f_5_6]) ).
cnf(f_5_13,plain,
( in(sK3(U_35,U_33,U_31),U_31)
| ~ sP6(U_35,U_31,U_33) ),
inference(clausify,[status(thm)],[f_5_6]) ).
cnf(f_5_14,plain,
( ~ in(sK3(U_35,U_33,U_31),U_33)
| ~ in(sK3(U_35,U_33,U_31),U_35)
| ~ sP6(U_35,U_31,U_33) ),
inference(clausify,[status(thm)],[f_5_6]) ).
cnf(f_5_15,plain,
( in(sK4(U_35,U_33,U_31),U_35)
| ~ sP7(U_35,U_31,U_33) ),
inference(clausify,[status(thm)],[f_5_6]) ).
cnf(f_5_16,plain,
( in(sK4(U_35,U_33,U_31),U_33)
| ~ sP7(U_35,U_31,U_33) ),
inference(clausify,[status(thm)],[f_5_6]) ).
cnf(f_5_17,plain,
( ~ in(sK4(U_35,U_33,U_31),U_31)
| ~ sP7(U_35,U_31,U_33) ),
inference(clausify,[status(thm)],[f_5_6]) ).
fof(f_6_1,plain,
! [A,B] : set_intersection2(A,A) = A,
inference(fof_nnf,[status(thm)],[idempotence_k3_xboole_0]) ).
fof(f_6_2,plain,
! [U_37,U_36] : set_intersection2(U_37,U_37) = U_37,
inference(variable_rename,[status(thm)],[f_6_1]) ).
fof(f_6_3,plain,
! [U_37] : set_intersection2(U_37,U_37) = U_37,
inference(miniscope,[status(thm)],[f_6_2]) ).
fof(f_6_4,plain,
! [U_37] : set_intersection2(U_37,U_37) = U_37,
inference(definitional_conversion,[status(esa)],[f_6_3]) ).
cnf(f_6_5,plain,
set_intersection2(U_37,U_37) = U_37,
inference(clausify,[status(thm)],[f_6_4]) ).
fof(f_7_1,plain,
? [A] : empty(A),
inference(fof_nnf,[status(thm)],[rc1_xboole_0]) ).
fof(f_7_2,plain,
? [U_38] : empty(U_38),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
empty(sK5),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_38,sK5)],[f_7_2]) ).
fof(f_7_4,plain,
empty(sK5),
inference(definitional_conversion,[status(esa)],[f_7_3]) ).
cnf(f_7_5,plain,
empty(sK5),
inference(clausify,[status(thm)],[f_7_4]) ).
fof(f_8_1,plain,
? [A] : ~ empty(A),
inference(fof_nnf,[status(thm)],[rc2_xboole_0]) ).
fof(f_8_2,plain,
? [U_39] : ~ empty(U_39),
inference(variable_rename,[status(thm)],[f_8_1]) ).
fof(f_8_3,plain,
~ empty(sK6),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_39,sK6)],[f_8_2]) ).
fof(f_8_4,plain,
~ empty(sK6),
inference(definitional_conversion,[status(esa)],[f_8_3]) ).
cnf(f_8_5,plain,
~ empty(sK6),
inference(clausify,[status(thm)],[f_8_4]) ).
fof(f_9_1,plain,
! [A,B] :
( disjoint(B,A)
| ~ disjoint(A,B) ),
inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0]) ).
fof(f_9_2,plain,
! [U_41,U_40] :
( disjoint(U_40,U_41)
| ~ disjoint(U_41,U_40) ),
inference(variable_rename,[status(thm)],[f_9_1]) ).
fof(f_9_3,plain,
! [U_40,U_41] :
( disjoint(U_40,U_41)
| ~ disjoint(U_41,U_40) ),
inference(definitional_conversion,[status(esa)],[f_9_2]) ).
cnf(f_9_4,plain,
( disjoint(U_40,U_41)
| ~ disjoint(U_41,U_40) ),
inference(clausify,[status(thm)],[f_9_3]) ).
fof(f_10_1,plain,
! [A,B] :
( ( ~ disjoint(A,B)
| ! [C] : ~ in(C,set_intersection2(A,B)) )
& ( ? [C] : in(C,set_intersection2(A,B))
| disjoint(A,B) ) ),
inference(fof_nnf,[status(thm)],[t4_xboole_0]) ).
fof(f_10_2,plain,
! [U_45,U_44] :
( ( ~ disjoint(U_45,U_44)
| ! [U_43] : ~ in(U_43,set_intersection2(U_45,U_44)) )
& ( ? [U_42] : in(U_42,set_intersection2(U_45,U_44))
| disjoint(U_45,U_44) ) ),
inference(variable_rename,[status(thm)],[f_10_1]) ).
fof(f_10_3,plain,
( ! [U_49,U_47] :
( ~ disjoint(U_49,U_47)
| ! [U_43] : ~ in(U_43,set_intersection2(U_49,U_47)) )
& ! [U_48,U_46] :
( ? [U_42] : in(U_42,set_intersection2(U_48,U_46))
| disjoint(U_48,U_46) ) ),
inference(miniscope,[status(thm)],[f_10_2]) ).
fof(f_10_4,plain,
( ! [U_49,U_47] :
( ~ disjoint(U_49,U_47)
| ! [U_43] : ~ in(U_43,set_intersection2(U_49,U_47)) )
& ! [U_48,U_46] :
( in(sK7(U_48,U_46),set_intersection2(U_48,U_46))
| disjoint(U_48,U_46) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_42,sK7(U_48,U_46))],[f_10_3]) ).
fof(f_10_5,plain,
( ! [U_43,U_47,U_49] :
( ~ disjoint(U_49,U_47)
| ~ in(U_43,set_intersection2(U_49,U_47)) )
& ! [U_46,U_48] :
( in(sK7(U_48,U_46),set_intersection2(U_48,U_46))
| disjoint(U_48,U_46) ) ),
inference(definitional_conversion,[status(esa)],[f_10_4]) ).
cnf(f_10_6,plain,
( in(sK7(U_48,U_46),set_intersection2(U_48,U_46))
| disjoint(U_48,U_46) ),
inference(clausify,[status(thm)],[f_10_5]) ).
cnf(f_10_7,plain,
( ~ disjoint(U_49,U_47)
| ~ in(U_43,set_intersection2(U_49,U_47)) ),
inference(clausify,[status(thm)],[f_10_5]) ).
fof(f_11_1,negated_conjecture,
~ ! [A,B,C] :
~ ( ~ disjoint(unordered_pair(A,C),B)
& ~ in(C,B)
& ~ in(A,B) ),
inference(negate,[status(cth)],[t57_zfmisc_1]) ).
fof(f_11_2,negated_conjecture,
? [A,B,C] :
( ~ disjoint(unordered_pair(A,C),B)
& ~ in(C,B)
& ~ in(A,B) ),
inference(fof_nnf,[status(thm)],[f_11_1]) ).
fof(f_11_3,negated_conjecture,
? [U_52,U_51,U_50] :
( ~ disjoint(unordered_pair(U_52,U_50),U_51)
& ~ in(U_50,U_51)
& ~ in(U_52,U_51) ),
inference(variable_rename,[status(thm)],[f_11_2]) ).
fof(f_11_4,negated_conjecture,
? [U_52,U_51] :
( ? [U_50] :
( ~ disjoint(unordered_pair(U_52,U_50),U_51)
& ~ in(U_50,U_51) )
& ~ in(U_52,U_51) ),
inference(miniscope,[status(thm)],[f_11_3]) ).
fof(f_11_5,negated_conjecture,
? [U_51] :
( ? [U_50] :
( ~ disjoint(unordered_pair(sK8,U_50),U_51)
& ~ in(U_50,U_51) )
& ~ in(sK8,U_51) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_52,sK8)],[f_11_4]) ).
fof(f_11_6,negated_conjecture,
( ? [U_50] :
( ~ disjoint(unordered_pair(sK8,U_50),sK9)
& ~ in(U_50,sK9) )
& ~ in(sK8,sK9) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(U_51,sK9)],[f_11_5]) ).
fof(f_11_7,negated_conjecture,
( ~ disjoint(unordered_pair(sK8,sK10),sK9)
& ~ in(sK10,sK9)
& ~ in(sK8,sK9) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(U_50,sK10)],[f_11_6]) ).
fof(f_11_8,negated_conjecture,
( ~ disjoint(unordered_pair(sK8,sK10),sK9)
& ~ in(sK10,sK9)
& ~ in(sK8,sK9) ),
inference(definitional_conversion,[status(esa)],[f_11_7]) ).
cnf(f_11_9,negated_conjecture,
~ in(sK8,sK9),
inference(clausify,[status(thm)],[f_11_8]) ).
cnf(f_11_10,negated_conjecture,
~ in(sK10,sK9),
inference(clausify,[status(thm)],[f_11_8]) ).
cnf(f_11_11,negated_conjecture,
~ disjoint(unordered_pair(sK8,sK10),sK9),
inference(clausify,[status(thm)],[f_11_8]) ).
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,
( sK1(Eq_x_0,Eq_x_1,Eq_x_2) = sK1(Eq_y_0,Eq_y_1,Eq_y_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_7,axiom,
( sK2(Eq_x_0,Eq_x_1,Eq_x_2) = sK2(Eq_y_0,Eq_y_1,Eq_y_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_8,axiom,
( sK3(Eq_x_0,Eq_x_1,Eq_x_2) = sK3(Eq_y_0,Eq_y_1,Eq_y_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_9,axiom,
( sK4(Eq_x_0,Eq_x_1,Eq_x_2) = sK4(Eq_y_0,Eq_y_1,Eq_y_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_10,axiom,
( sK7(Eq_x_0,Eq_x_1) = sK7(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_11,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_12,axiom,
( empty(Eq_y_0)
| ~ empty(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_13,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(equality_14,axiom,
( sP0(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ sP0(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_15,axiom,
( sP1(Eq_y_0,Eq_y_1,Eq_y_2,Eq_y_3,Eq_y_4)
| ~ sP1(Eq_x_0,Eq_x_1,Eq_x_2,Eq_x_3,Eq_x_4)
| Eq_x_4 != Eq_y_4
| Eq_x_3 != Eq_y_3
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_16,axiom,
( sP2(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ sP2(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_17,axiom,
( sP3(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ sP3(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_18,axiom,
( sP4(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ sP4(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_19,axiom,
( sP5(Eq_y_0,Eq_y_1,Eq_y_2,Eq_y_3,Eq_y_4)
| ~ sP5(Eq_x_0,Eq_x_1,Eq_x_2,Eq_x_3,Eq_x_4)
| Eq_x_4 != Eq_y_4
| Eq_x_3 != Eq_y_3
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_20,axiom,
( sP6(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ sP6(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_21,axiom,
( sP7(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ sP7(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| 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.02 % Problem : SET916+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.03 % 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/10.37 % Computer : n014.cluster.edu
% 0.09/10.37 % Model : x86_64 x86_64
% 0.09/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.37 % Memory : 8046.5625MB
% 0.09/10.37 % OS : Linux 6.8.0-71-generic
% 0.09/10.37 % CPULimit : 300
% 0.09/10.37 % WCLimit : 300
% 0.09/10.37 % DateTime : Sat Sep 19 23:07:33 UTC 2026
% 0.09/10.37 % CPUTime :
% 273.33/283.61 % SZS status Theorem for theBenchmark
% 273.33/283.61 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------