%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET597+3 : TPTP v9.3.1. Released v2.2.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 : n020.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:03 AM UTC 2026
% Result : Theorem 233.03s 233.33s
% Output : Proof 233.38s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(subset_of_union,axiom,
! [B,C] : subset(B,union(B,C)),
file('theBenchmark.p',subset_of_union) ).
fof(union_subset,axiom,
! [B,C,D] :
( ( subset(D,C)
& subset(B,C) )
=> subset(union(B,D),C) ),
file('theBenchmark.p',union_subset) ).
fof(union_defn,axiom,
! [B,C,D] :
( member(D,union(B,C))
<=> ( member(D,C)
| member(D,B) ) ),
file('theBenchmark.p',union_defn) ).
fof(subset_defn,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('theBenchmark.p',subset_defn) ).
fof(equal_defn,axiom,
! [B,C] :
( B = C
<=> ( subset(C,B)
& subset(B,C) ) ),
file('theBenchmark.p',equal_defn) ).
fof(commutativity_of_union,axiom,
! [B,C] : union(B,C) = union(C,B),
file('theBenchmark.p',commutativity_of_union) ).
fof(reflexivity_of_subset,axiom,
! [B] : subset(B,B),
file('theBenchmark.p',reflexivity_of_subset) ).
fof(equal_member_defn,axiom,
! [B,C] :
( B = C
<=> ! [D] :
( member(D,B)
<=> member(D,C) ) ),
file('theBenchmark.p',equal_member_defn) ).
fof(prove_th56,conjecture,
! [B,C,D] :
( B = union(C,D)
<=> ( ! [E] :
( ( subset(D,E)
& subset(C,E) )
=> subset(B,E) )
& subset(D,B)
& subset(C,B) ) ),
file('theBenchmark.p',prove_th56) ).
fof(f_1_1,plain,
! [B,C] : subset(B,union(B,C)),
inference(fof_nnf,[status(thm)],[subset_of_union]) ).
fof(f_1_2,plain,
! [U_1,U_0] : subset(U_1,union(U_1,U_0)),
inference(variable_rename,[status(thm)],[f_1_1]) ).
cnf(f_1_3,plain,
subset(U_1,union(U_1,U_0)),
inference(clausify,[status(thm)],[f_1_2]) ).
fof(f_2_1,plain,
! [B,C,D] :
( subset(union(B,D),C)
| ~ subset(D,C)
| ~ subset(B,C) ),
inference(fof_nnf,[status(thm)],[union_subset]) ).
fof(f_2_2,plain,
! [U_4,U_3,U_2] :
( subset(union(U_4,U_2),U_3)
| ~ subset(U_2,U_3)
| ~ subset(U_4,U_3) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
( subset(union(U_4,U_2),U_3)
| ~ subset(U_2,U_3)
| ~ subset(U_4,U_3) ),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,plain,
! [B,C,D] :
( ( member(D,union(B,C))
| ( ~ member(D,C)
& ~ member(D,B) ) )
& ( member(D,C)
| member(D,B)
| ~ member(D,union(B,C)) ) ),
inference(fof_nnf,[status(thm)],[union_defn]) ).
fof(f_3_2,plain,
! [U_7,U_6,U_5] :
( ( member(U_5,union(U_7,U_6))
| ( ~ member(U_5,U_6)
& ~ member(U_5,U_7) ) )
& ( member(U_5,U_6)
| member(U_5,U_7)
| ~ member(U_5,union(U_7,U_6)) ) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
( ! [U_13,U_11,U_9] :
( member(U_9,union(U_13,U_11))
| ( ~ member(U_9,U_11)
& ~ member(U_9,U_13) ) )
& ! [U_12,U_10,U_8] :
( member(U_8,U_10)
| member(U_8,U_12)
| ~ member(U_8,union(U_12,U_10)) ) ),
inference(miniscope,[status(thm)],[f_3_2]) ).
cnf(f_3_4,plain,
( member(U_8,U_10)
| member(U_8,U_12)
| ~ member(U_8,union(U_12,U_10)) ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_5,plain,
( ~ member(U_9,U_13)
| member(U_9,union(U_13,U_11)) ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_6,plain,
( ~ member(U_9,U_11)
| member(U_9,union(U_13,U_11)) ),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_4_1,plain,
! [B,C] :
( ( subset(B,C)
| ? [D] :
( ~ member(D,C)
& member(D,B) ) )
& ( ! [D] :
( member(D,C)
| ~ member(D,B) )
| ~ subset(B,C) ) ),
inference(fof_nnf,[status(thm)],[subset_defn]) ).
fof(f_4_2,plain,
! [U_17,U_16] :
( ( subset(U_17,U_16)
| ? [U_15] :
( ~ member(U_15,U_16)
& member(U_15,U_17) ) )
& ( ! [U_14] :
( member(U_14,U_16)
| ~ member(U_14,U_17) )
| ~ subset(U_17,U_16) ) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
( ! [U_21,U_19] :
( subset(U_21,U_19)
| ? [U_15] :
( ~ member(U_15,U_19)
& member(U_15,U_21) ) )
& ! [U_20,U_18] :
( ! [U_14] :
( member(U_14,U_18)
| ~ member(U_14,U_20) )
| ~ subset(U_20,U_18) ) ),
inference(miniscope,[status(thm)],[f_4_2]) ).
fof(f_4_4,plain,
( ! [U_21,U_19] :
( subset(U_21,U_19)
| ( ~ member(sK1(U_21,U_19),U_19)
& member(sK1(U_21,U_19),U_21) ) )
& ! [U_20,U_18] :
( ! [U_14] :
( member(U_14,U_18)
| ~ member(U_14,U_20) )
| ~ subset(U_20,U_18) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_15,sK1(U_21,U_19))],[f_4_3]) ).
cnf(f_4_5,plain,
( member(U_14,U_18)
| ~ member(U_14,U_20)
| ~ subset(U_20,U_18) ),
inference(clausify,[status(thm)],[f_4_4]) ).
cnf(f_4_6,plain,
( member(sK1(U_21,U_19),U_21)
| subset(U_21,U_19) ),
inference(clausify,[status(thm)],[f_4_4]) ).
cnf(f_4_7,plain,
( ~ member(sK1(U_21,U_19),U_19)
| subset(U_21,U_19) ),
inference(clausify,[status(thm)],[f_4_4]) ).
fof(f_5_1,plain,
! [B,C] :
( ( B = C
| ~ subset(C,B)
| ~ subset(B,C) )
& ( ( subset(C,B)
& subset(B,C) )
| B != C ) ),
inference(fof_nnf,[status(thm)],[equal_defn]) ).
fof(f_5_2,plain,
! [U_23,U_22] :
( ( U_23 = U_22
| ~ subset(U_22,U_23)
| ~ subset(U_23,U_22) )
& ( ( subset(U_22,U_23)
& subset(U_23,U_22) )
| U_23 != U_22 ) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
( ! [U_27,U_25] :
( U_27 = U_25
| ~ subset(U_25,U_27)
| ~ subset(U_27,U_25) )
& ! [U_26,U_24] :
( ( subset(U_24,U_26)
& subset(U_26,U_24) )
| U_26 != U_24 ) ),
inference(miniscope,[status(thm)],[f_5_2]) ).
cnf(f_5_4,plain,
( subset(U_26,U_24)
| U_26 != U_24 ),
inference(clausify,[status(thm)],[f_5_3]) ).
cnf(f_5_5,plain,
( subset(U_24,U_26)
| U_26 != U_24 ),
inference(clausify,[status(thm)],[f_5_3]) ).
cnf(f_5_6,plain,
( U_27 = U_25
| ~ subset(U_25,U_27)
| ~ subset(U_27,U_25) ),
inference(clausify,[status(thm)],[f_5_3]) ).
fof(f_6_1,plain,
! [B,C] : union(B,C) = union(C,B),
inference(fof_nnf,[status(thm)],[commutativity_of_union]) ).
fof(f_6_2,plain,
! [U_29,U_28] : union(U_29,U_28) = union(U_28,U_29),
inference(variable_rename,[status(thm)],[f_6_1]) ).
cnf(f_6_3,plain,
union(U_29,U_28) = union(U_28,U_29),
inference(clausify,[status(thm)],[f_6_2]) ).
fof(f_7_1,plain,
! [B] : subset(B,B),
inference(fof_nnf,[status(thm)],[reflexivity_of_subset]) ).
fof(f_7_2,plain,
! [U_30] : subset(U_30,U_30),
inference(variable_rename,[status(thm)],[f_7_1]) ).
cnf(f_7_3,plain,
subset(U_30,U_30),
inference(clausify,[status(thm)],[f_7_2]) ).
fof(f_8_1,plain,
! [B,C] :
( ( B = C
| ? [D] :
( ( ~ member(D,B)
& member(D,C) )
| ( ~ member(D,C)
& member(D,B) ) ) )
& ( ! [D] :
( ( member(D,B)
| ~ member(D,C) )
& ( member(D,C)
| ~ member(D,B) ) )
| B != C ) ),
inference(fof_nnf,[status(thm)],[equal_member_defn]) ).
fof(f_8_2,plain,
! [U_34,U_33] :
( ( U_34 = U_33
| ? [U_32] :
( ( ~ member(U_32,U_34)
& member(U_32,U_33) )
| ( ~ member(U_32,U_33)
& member(U_32,U_34) ) ) )
& ( ! [U_31] :
( ( member(U_31,U_34)
| ~ member(U_31,U_33) )
& ( member(U_31,U_33)
| ~ member(U_31,U_34) ) )
| U_34 != U_33 ) ),
inference(variable_rename,[status(thm)],[f_8_1]) ).
fof(f_8_3,plain,
( ! [U_42,U_40] :
( U_42 = U_40
| ? [U_38] :
( ~ member(U_38,U_42)
& member(U_38,U_40) )
| ? [U_37] :
( ~ member(U_37,U_40)
& member(U_37,U_42) ) )
& ! [U_41,U_39] :
( ( ! [U_36] :
( member(U_36,U_41)
| ~ member(U_36,U_39) )
& ! [U_35] :
( member(U_35,U_39)
| ~ member(U_35,U_41) ) )
| U_41 != U_39 ) ),
inference(miniscope,[status(thm)],[f_8_2]) ).
fof(f_8_4,plain,
( ! [U_42,U_40] :
( U_42 = U_40
| ? [U_38] :
( ~ member(U_38,U_42)
& member(U_38,U_40) )
| ( ~ member(sK2(U_42,U_40),U_40)
& member(sK2(U_42,U_40),U_42) ) )
& ! [U_41,U_39] :
( ( ! [U_36] :
( member(U_36,U_41)
| ~ member(U_36,U_39) )
& ! [U_35] :
( member(U_35,U_39)
| ~ member(U_35,U_41) ) )
| U_41 != U_39 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_37,sK2(U_42,U_40))],[f_8_3]) ).
fof(f_8_5,plain,
( ! [U_42,U_40] :
( U_42 = U_40
| ( ~ member(sK3(U_42,U_40),U_42)
& member(sK3(U_42,U_40),U_40) )
| ( ~ member(sK2(U_42,U_40),U_40)
& member(sK2(U_42,U_40),U_42) ) )
& ! [U_41,U_39] :
( ( ! [U_36] :
( member(U_36,U_41)
| ~ member(U_36,U_39) )
& ! [U_35] :
( member(U_35,U_39)
| ~ member(U_35,U_41) ) )
| U_41 != U_39 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_38,sK3(U_42,U_40))],[f_8_4]) ).
cnf(f_8_6,plain,
( member(U_35,U_39)
| ~ member(U_35,U_41)
| U_41 != U_39 ),
inference(clausify,[status(thm)],[f_8_5]) ).
cnf(f_8_7,plain,
( member(U_36,U_41)
| ~ member(U_36,U_39)
| U_41 != U_39 ),
inference(clausify,[status(thm)],[f_8_5]) ).
cnf(f_8_8,plain,
( member(sK3(U_42,U_40),U_40)
| member(sK2(U_42,U_40),U_42)
| U_42 = U_40 ),
inference(clausify,[status(thm)],[f_8_5]) ).
cnf(f_8_9,plain,
( ~ member(sK3(U_42,U_40),U_42)
| member(sK2(U_42,U_40),U_42)
| U_42 = U_40 ),
inference(clausify,[status(thm)],[f_8_5]) ).
cnf(f_8_10,plain,
( member(sK3(U_42,U_40),U_40)
| ~ member(sK2(U_42,U_40),U_40)
| U_42 = U_40 ),
inference(clausify,[status(thm)],[f_8_5]) ).
cnf(f_8_11,plain,
( ~ member(sK3(U_42,U_40),U_42)
| ~ member(sK2(U_42,U_40),U_40)
| U_42 = U_40 ),
inference(clausify,[status(thm)],[f_8_5]) ).
fof(f_9_1,negated_conjecture,
~ ! [B,C,D] :
( B = union(C,D)
<=> ( ! [E] :
( ( subset(D,E)
& subset(C,E) )
=> subset(B,E) )
& subset(D,B)
& subset(C,B) ) ),
inference(negate,[status(cth)],[prove_th56]) ).
fof(f_9_2,negated_conjecture,
? [B,C,D] :
( ( B != union(C,D)
& ! [E] :
( subset(B,E)
| ~ subset(D,E)
| ~ subset(C,E) )
& subset(D,B)
& subset(C,B) )
| ( ( ? [E] :
( ~ subset(B,E)
& subset(D,E)
& subset(C,E) )
| ~ subset(D,B)
| ~ subset(C,B) )
& B = union(C,D) ) ),
inference(fof_nnf,[status(thm)],[f_9_1]) ).
fof(f_9_3,negated_conjecture,
? [U_47,U_46,U_45] :
( ( U_47 != union(U_46,U_45)
& ! [U_44] :
( subset(U_47,U_44)
| ~ subset(U_45,U_44)
| ~ subset(U_46,U_44) )
& subset(U_45,U_47)
& subset(U_46,U_47) )
| ( ( ? [U_43] :
( ~ subset(U_47,U_43)
& subset(U_45,U_43)
& subset(U_46,U_43) )
| ~ subset(U_45,U_47)
| ~ subset(U_46,U_47) )
& U_47 = union(U_46,U_45) ) ),
inference(variable_rename,[status(thm)],[f_9_2]) ).
fof(f_9_4,negated_conjecture,
( ? [U_53,U_51,U_49] :
( U_53 != union(U_51,U_49)
& ! [U_44] :
( subset(U_53,U_44)
| ~ subset(U_49,U_44)
| ~ subset(U_51,U_44) )
& subset(U_49,U_53)
& subset(U_51,U_53) )
| ? [U_52,U_50,U_48] :
( ( ? [U_43] :
( ~ subset(U_52,U_43)
& subset(U_48,U_43)
& subset(U_50,U_43) )
| ~ subset(U_48,U_52)
| ~ subset(U_50,U_52) )
& U_52 = union(U_50,U_48) ) ),
inference(miniscope,[status(thm)],[f_9_3]) ).
fof(f_9_5,negated_conjecture,
( ? [U_53,U_51,U_49] :
( U_53 != union(U_51,U_49)
& ! [U_44] :
( subset(U_53,U_44)
| ~ subset(U_49,U_44)
| ~ subset(U_51,U_44) )
& subset(U_49,U_53)
& subset(U_51,U_53) )
| ? [U_50,U_48] :
( ( ? [U_43] :
( ~ subset(sK4,U_43)
& subset(U_48,U_43)
& subset(U_50,U_43) )
| ~ subset(U_48,sK4)
| ~ subset(U_50,sK4) )
& sK4 = union(U_50,U_48) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_52,sK4)],[f_9_4]) ).
fof(f_9_6,negated_conjecture,
( ? [U_53,U_51,U_49] :
( U_53 != union(U_51,U_49)
& ! [U_44] :
( subset(U_53,U_44)
| ~ subset(U_49,U_44)
| ~ subset(U_51,U_44) )
& subset(U_49,U_53)
& subset(U_51,U_53) )
| ? [U_48] :
( ( ? [U_43] :
( ~ subset(sK4,U_43)
& subset(U_48,U_43)
& subset(sK5,U_43) )
| ~ subset(U_48,sK4)
| ~ subset(sK5,sK4) )
& sK4 = union(sK5,U_48) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_50,sK5)],[f_9_5]) ).
fof(f_9_7,negated_conjecture,
( ? [U_53,U_51,U_49] :
( U_53 != union(U_51,U_49)
& ! [U_44] :
( subset(U_53,U_44)
| ~ subset(U_49,U_44)
| ~ subset(U_51,U_44) )
& subset(U_49,U_53)
& subset(U_51,U_53) )
| ( ( ? [U_43] :
( ~ subset(sK4,U_43)
& subset(sK6,U_43)
& subset(sK5,U_43) )
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4) )
& sK4 = union(sK5,sK6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_48,sK6)],[f_9_6]) ).
fof(f_9_8,negated_conjecture,
( ? [U_53,U_51,U_49] :
( U_53 != union(U_51,U_49)
& ! [U_44] :
( subset(U_53,U_44)
| ~ subset(U_49,U_44)
| ~ subset(U_51,U_44) )
& subset(U_49,U_53)
& subset(U_51,U_53) )
| ( ( ( ~ subset(sK4,sK7)
& subset(sK6,sK7)
& subset(sK5,sK7) )
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4) )
& sK4 = union(sK5,sK6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_43,sK7)],[f_9_7]) ).
fof(f_9_9,negated_conjecture,
( ? [U_51,U_49] :
( sK8 != union(U_51,U_49)
& ! [U_44] :
( subset(sK8,U_44)
| ~ subset(U_49,U_44)
| ~ subset(U_51,U_44) )
& subset(U_49,sK8)
& subset(U_51,sK8) )
| ( ( ( ~ subset(sK4,sK7)
& subset(sK6,sK7)
& subset(sK5,sK7) )
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4) )
& sK4 = union(sK5,sK6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_53,sK8)],[f_9_8]) ).
fof(f_9_10,negated_conjecture,
( ? [U_49] :
( sK8 != union(sK9,U_49)
& ! [U_44] :
( subset(sK8,U_44)
| ~ subset(U_49,U_44)
| ~ subset(sK9,U_44) )
& subset(U_49,sK8)
& subset(sK9,sK8) )
| ( ( ( ~ subset(sK4,sK7)
& subset(sK6,sK7)
& subset(sK5,sK7) )
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4) )
& sK4 = union(sK5,sK6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(U_51,sK9)],[f_9_9]) ).
fof(f_9_11,negated_conjecture,
( ( sK8 != union(sK9,sK10)
& ! [U_44] :
( subset(sK8,U_44)
| ~ subset(sK10,U_44)
| ~ subset(sK9,U_44) )
& subset(sK10,sK8)
& subset(sK9,sK8) )
| ( ( ( ~ subset(sK4,sK7)
& subset(sK6,sK7)
& subset(sK5,sK7) )
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4) )
& sK4 = union(sK5,sK6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(U_49,sK10)],[f_9_10]) ).
cnf(f_9_12,negated_conjecture,
( subset(sK9,sK8)
| sK4 = union(sK5,sK6) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_13,negated_conjecture,
( subset(sK10,sK8)
| sK4 = union(sK5,sK6) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_14,negated_conjecture,
( subset(sK8,U_44)
| ~ subset(sK10,U_44)
| ~ subset(sK9,U_44)
| sK4 = union(sK5,sK6) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_15,negated_conjecture,
( sK8 != union(sK9,sK10)
| sK4 = union(sK5,sK6) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_16,negated_conjecture,
( subset(sK5,sK7)
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4)
| subset(sK9,sK8) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_17,negated_conjecture,
( subset(sK6,sK7)
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4)
| subset(sK9,sK8) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_18,negated_conjecture,
( ~ subset(sK4,sK7)
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4)
| subset(sK9,sK8) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_19,negated_conjecture,
( subset(sK5,sK7)
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4)
| subset(sK10,sK8) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_20,negated_conjecture,
( subset(sK6,sK7)
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4)
| subset(sK10,sK8) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_21,negated_conjecture,
( ~ subset(sK4,sK7)
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4)
| subset(sK10,sK8) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_22,negated_conjecture,
( subset(sK5,sK7)
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4)
| subset(sK8,U_44)
| ~ subset(sK10,U_44)
| ~ subset(sK9,U_44) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_23,negated_conjecture,
( subset(sK6,sK7)
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4)
| subset(sK8,U_44)
| ~ subset(sK10,U_44)
| ~ subset(sK9,U_44) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_24,negated_conjecture,
( ~ subset(sK4,sK7)
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4)
| subset(sK8,U_44)
| ~ subset(sK10,U_44)
| ~ subset(sK9,U_44) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_25,negated_conjecture,
( subset(sK5,sK7)
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4)
| sK8 != union(sK9,sK10) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_26,negated_conjecture,
( subset(sK6,sK7)
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4)
| sK8 != union(sK9,sK10) ),
inference(clausify,[status(thm)],[f_9_11]) ).
cnf(f_9_27,negated_conjecture,
( ~ subset(sK4,sK7)
| ~ subset(sK6,sK4)
| ~ subset(sK5,sK4)
| sK8 != union(sK9,sK10) ),
inference(clausify,[status(thm)],[f_9_11]) ).
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,
( union(Eq_x_0,Eq_x_1) = union(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,
( 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_6,axiom,
( sK2(Eq_x_0,Eq_x_1) = sK2(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_7,axiom,
( sK3(Eq_x_0,Eq_x_1) = sK3(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
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(equality_9,axiom,
( member(Eq_y_0,Eq_y_1)
| ~ member(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.02 % Problem : SET597+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n020.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 19 22:42:46 UTC 2026
% 0.09/0.35 % CPUTime :
% 233.03/233.33 % SZS status Theorem for theBenchmark
% 233.03/233.33 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------