%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU136+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 : 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:58:09 AM UTC 2026
% Result : Theorem 6.26s 6.56s
% Output : Proof 6.39s
% 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_xboole_0,axiom,
! [A,B] : set_union2(A,B) = set_union2(B,A),
file('theBenchmark.p',commutativity_k2_xboole_0) ).
fof(d10_xboole_0,axiom,
! [A,B] :
( A = B
<=> ( subset(B,A)
& subset(A,B) ) ),
file('theBenchmark.p',d10_xboole_0) ).
fof(d2_xboole_0,axiom,
! [A,B,C] :
( C = set_union2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,B)
| in(D,A) ) ) ),
file('theBenchmark.p',d2_xboole_0) ).
fof(d3_tarski,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('theBenchmark.p',d3_tarski) ).
fof(d4_xboole_0,axiom,
! [A,B,C] :
( C = set_difference(A,B)
<=> ! [D] :
( in(D,C)
<=> ( ~ in(D,B)
& in(D,A) ) ) ),
file('theBenchmark.p',d4_xboole_0) ).
fof(dt_k1_xboole_0,axiom,
$true,
file('theBenchmark.p',dt_k1_xboole_0) ).
fof(dt_k2_xboole_0,axiom,
$true,
file('theBenchmark.p',dt_k2_xboole_0) ).
fof(dt_k4_xboole_0,axiom,
$true,
file('theBenchmark.p',dt_k4_xboole_0) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('theBenchmark.p',fc1_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(t1_boole,axiom,
! [A] : set_union2(A,empty_set) = A,
file('theBenchmark.p',t1_boole) ).
fof(t3_boole,axiom,
! [A] : set_difference(A,empty_set) = A,
file('theBenchmark.p',t3_boole) ).
fof(t40_xboole_1,conjecture,
! [A,B] : set_difference(set_union2(A,B),B) = set_difference(A,B),
file('theBenchmark.p',t40_xboole_1) ).
fof(t4_boole,axiom,
! [A] : set_difference(empty_set,A) = empty_set,
file('theBenchmark.p',t4_boole) ).
fof(t6_boole,axiom,
! [A] :
( empty(A)
=> A = empty_set ),
file('theBenchmark.p',t6_boole) ).
fof(t7_boole,axiom,
! [A,B] :
~ ( empty(B)
& in(A,B) ),
file('theBenchmark.p',t7_boole) ).
fof(t8_boole,axiom,
! [A,B] :
~ ( empty(B)
& A != B
& empty(A) ),
file('theBenchmark.p',t8_boole) ).
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] : set_union2(A,B) = set_union2(B,A),
inference(fof_nnf,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(f_2_2,plain,
! [U_3,U_2] : set_union2(U_3,U_2) = set_union2(U_2,U_3),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
set_union2(U_3,U_2) = set_union2(U_2,U_3),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_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_3_2,plain,
! [U_5,U_4] :
( ( U_5 = U_4
| ~ subset(U_4,U_5)
| ~ subset(U_5,U_4) )
& ( ( subset(U_4,U_5)
& subset(U_5,U_4) )
| U_5 != U_4 ) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
( ! [U_9,U_7] :
( U_9 = U_7
| ~ subset(U_7,U_9)
| ~ subset(U_9,U_7) )
& ! [U_8,U_6] :
( ( subset(U_6,U_8)
& subset(U_8,U_6) )
| U_8 != U_6 ) ),
inference(miniscope,[status(thm)],[f_3_2]) ).
cnf(f_3_4,plain,
( subset(U_8,U_6)
| U_8 != U_6 ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_5,plain,
( subset(U_6,U_8)
| U_8 != U_6 ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_6,plain,
( U_9 = U_7
| ~ subset(U_7,U_9)
| ~ subset(U_9,U_7) ),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_4_1,plain,
! [A,B,C] :
( ( C = set_union2(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_union2(A,B) ) ),
inference(fof_nnf,[status(thm)],[d2_xboole_0]) ).
fof(f_4_2,plain,
! [U_14,U_13,U_12] :
( ( U_12 = set_union2(U_14,U_13)
| ? [U_11] :
( ( ~ in(U_11,U_12)
& ( in(U_11,U_13)
| in(U_11,U_14) ) )
| ( ~ in(U_11,U_13)
& ~ in(U_11,U_14)
& in(U_11,U_12) ) ) )
& ( ! [U_10] :
( ( in(U_10,U_12)
| ( ~ in(U_10,U_13)
& ~ in(U_10,U_14) ) )
& ( in(U_10,U_13)
| in(U_10,U_14)
| ~ in(U_10,U_12) ) )
| U_12 != set_union2(U_14,U_13) ) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
( ! [U_24,U_22,U_20] :
( U_20 = set_union2(U_24,U_22)
| ? [U_18] :
( ~ in(U_18,U_20)
& ( in(U_18,U_22)
| in(U_18,U_24) ) )
| ? [U_17] :
( ~ in(U_17,U_22)
& ~ in(U_17,U_24)
& in(U_17,U_20) ) )
& ! [U_23,U_21,U_19] :
( ( ! [U_16] :
( in(U_16,U_19)
| ( ~ in(U_16,U_21)
& ~ in(U_16,U_23) ) )
& ! [U_15] :
( in(U_15,U_21)
| in(U_15,U_23)
| ~ in(U_15,U_19) ) )
| U_19 != set_union2(U_23,U_21) ) ),
inference(miniscope,[status(thm)],[f_4_2]) ).
fof(f_4_4,plain,
( ! [U_24,U_22,U_20] :
( U_20 = set_union2(U_24,U_22)
| ? [U_18] :
( ~ in(U_18,U_20)
& ( in(U_18,U_22)
| in(U_18,U_24) ) )
| ( ~ in(sK1(U_24,U_22,U_20),U_22)
& ~ in(sK1(U_24,U_22,U_20),U_24)
& in(sK1(U_24,U_22,U_20),U_20) ) )
& ! [U_23,U_21,U_19] :
( ( ! [U_16] :
( in(U_16,U_19)
| ( ~ in(U_16,U_21)
& ~ in(U_16,U_23) ) )
& ! [U_15] :
( in(U_15,U_21)
| in(U_15,U_23)
| ~ in(U_15,U_19) ) )
| U_19 != set_union2(U_23,U_21) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_17,sK1(U_24,U_22,U_20))],[f_4_3]) ).
fof(f_4_5,plain,
( ! [U_24,U_22,U_20] :
( U_20 = set_union2(U_24,U_22)
| ( ~ in(sK2(U_24,U_22,U_20),U_20)
& ( in(sK2(U_24,U_22,U_20),U_22)
| in(sK2(U_24,U_22,U_20),U_24) ) )
| ( ~ in(sK1(U_24,U_22,U_20),U_22)
& ~ in(sK1(U_24,U_22,U_20),U_24)
& in(sK1(U_24,U_22,U_20),U_20) ) )
& ! [U_23,U_21,U_19] :
( ( ! [U_16] :
( in(U_16,U_19)
| ( ~ in(U_16,U_21)
& ~ in(U_16,U_23) ) )
& ! [U_15] :
( in(U_15,U_21)
| in(U_15,U_23)
| ~ in(U_15,U_19) ) )
| U_19 != set_union2(U_23,U_21) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_18,sK2(U_24,U_22,U_20))],[f_4_4]) ).
cnf(f_4_6,plain,
( in(U_15,U_21)
| in(U_15,U_23)
| ~ in(U_15,U_19)
| U_19 != set_union2(U_23,U_21) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_7,plain,
( ~ in(U_16,U_23)
| in(U_16,U_19)
| U_19 != set_union2(U_23,U_21) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_8,plain,
( ~ in(U_16,U_21)
| in(U_16,U_19)
| U_19 != set_union2(U_23,U_21) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_9,plain,
( in(sK2(U_24,U_22,U_20),U_22)
| in(sK2(U_24,U_22,U_20),U_24)
| in(sK1(U_24,U_22,U_20),U_20)
| U_20 = set_union2(U_24,U_22) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_10,plain,
( ~ in(sK2(U_24,U_22,U_20),U_20)
| in(sK1(U_24,U_22,U_20),U_20)
| U_20 = set_union2(U_24,U_22) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_11,plain,
( ~ in(sK1(U_24,U_22,U_20),U_24)
| in(sK2(U_24,U_22,U_20),U_22)
| in(sK2(U_24,U_22,U_20),U_24)
| U_20 = set_union2(U_24,U_22) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_12,plain,
( ~ in(sK1(U_24,U_22,U_20),U_22)
| in(sK2(U_24,U_22,U_20),U_22)
| in(sK2(U_24,U_22,U_20),U_24)
| U_20 = set_union2(U_24,U_22) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_13,plain,
( ~ in(sK1(U_24,U_22,U_20),U_24)
| ~ in(sK2(U_24,U_22,U_20),U_20)
| U_20 = set_union2(U_24,U_22) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_14,plain,
( ~ in(sK1(U_24,U_22,U_20),U_22)
| ~ in(sK2(U_24,U_22,U_20),U_20)
| U_20 = set_union2(U_24,U_22) ),
inference(clausify,[status(thm)],[f_4_5]) ).
fof(f_5_1,plain,
! [A,B] :
( ( subset(A,B)
| ? [C] :
( ~ in(C,B)
& in(C,A) ) )
& ( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(fof_nnf,[status(thm)],[d3_tarski]) ).
fof(f_5_2,plain,
! [U_28,U_27] :
( ( subset(U_28,U_27)
| ? [U_26] :
( ~ in(U_26,U_27)
& in(U_26,U_28) ) )
& ( ! [U_25] :
( in(U_25,U_27)
| ~ in(U_25,U_28) )
| ~ subset(U_28,U_27) ) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
( ! [U_32,U_30] :
( subset(U_32,U_30)
| ? [U_26] :
( ~ in(U_26,U_30)
& in(U_26,U_32) ) )
& ! [U_31,U_29] :
( ! [U_25] :
( in(U_25,U_29)
| ~ in(U_25,U_31) )
| ~ subset(U_31,U_29) ) ),
inference(miniscope,[status(thm)],[f_5_2]) ).
fof(f_5_4,plain,
( ! [U_32,U_30] :
( subset(U_32,U_30)
| ( ~ in(sK3(U_32,U_30),U_30)
& in(sK3(U_32,U_30),U_32) ) )
& ! [U_31,U_29] :
( ! [U_25] :
( in(U_25,U_29)
| ~ in(U_25,U_31) )
| ~ subset(U_31,U_29) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_26,sK3(U_32,U_30))],[f_5_3]) ).
cnf(f_5_5,plain,
( in(U_25,U_29)
| ~ in(U_25,U_31)
| ~ subset(U_31,U_29) ),
inference(clausify,[status(thm)],[f_5_4]) ).
cnf(f_5_6,plain,
( in(sK3(U_32,U_30),U_32)
| subset(U_32,U_30) ),
inference(clausify,[status(thm)],[f_5_4]) ).
cnf(f_5_7,plain,
( ~ in(sK3(U_32,U_30),U_30)
| subset(U_32,U_30) ),
inference(clausify,[status(thm)],[f_5_4]) ).
fof(f_6_1,plain,
! [A,B,C] :
( ( C = set_difference(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_difference(A,B) ) ),
inference(fof_nnf,[status(thm)],[d4_xboole_0]) ).
fof(f_6_2,plain,
! [U_37,U_36,U_35] :
( ( U_35 = set_difference(U_37,U_36)
| ? [U_34] :
( ( ~ in(U_34,U_35)
& ~ in(U_34,U_36)
& in(U_34,U_37) )
| ( ( in(U_34,U_36)
| ~ in(U_34,U_37) )
& in(U_34,U_35) ) ) )
& ( ! [U_33] :
( ( in(U_33,U_35)
| in(U_33,U_36)
| ~ in(U_33,U_37) )
& ( ( ~ in(U_33,U_36)
& in(U_33,U_37) )
| ~ in(U_33,U_35) ) )
| U_35 != set_difference(U_37,U_36) ) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
fof(f_6_3,plain,
( ! [U_47,U_45,U_43] :
( U_43 = set_difference(U_47,U_45)
| ? [U_41] :
( ~ in(U_41,U_43)
& ~ in(U_41,U_45)
& in(U_41,U_47) )
| ? [U_40] :
( ( in(U_40,U_45)
| ~ in(U_40,U_47) )
& in(U_40,U_43) ) )
& ! [U_46,U_44,U_42] :
( ( ! [U_39] :
( in(U_39,U_42)
| in(U_39,U_44)
| ~ in(U_39,U_46) )
& ! [U_38] :
( ( ~ in(U_38,U_44)
& in(U_38,U_46) )
| ~ in(U_38,U_42) ) )
| U_42 != set_difference(U_46,U_44) ) ),
inference(miniscope,[status(thm)],[f_6_2]) ).
fof(f_6_4,plain,
( ! [U_47,U_45,U_43] :
( U_43 = set_difference(U_47,U_45)
| ? [U_41] :
( ~ in(U_41,U_43)
& ~ in(U_41,U_45)
& in(U_41,U_47) )
| ( ( in(sK4(U_47,U_45,U_43),U_45)
| ~ in(sK4(U_47,U_45,U_43),U_47) )
& in(sK4(U_47,U_45,U_43),U_43) ) )
& ! [U_46,U_44,U_42] :
( ( ! [U_39] :
( in(U_39,U_42)
| in(U_39,U_44)
| ~ in(U_39,U_46) )
& ! [U_38] :
( ( ~ in(U_38,U_44)
& in(U_38,U_46) )
| ~ in(U_38,U_42) ) )
| U_42 != set_difference(U_46,U_44) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_40,sK4(U_47,U_45,U_43))],[f_6_3]) ).
fof(f_6_5,plain,
( ! [U_47,U_45,U_43] :
( U_43 = set_difference(U_47,U_45)
| ( ~ in(sK5(U_47,U_45,U_43),U_43)
& ~ in(sK5(U_47,U_45,U_43),U_45)
& in(sK5(U_47,U_45,U_43),U_47) )
| ( ( in(sK4(U_47,U_45,U_43),U_45)
| ~ in(sK4(U_47,U_45,U_43),U_47) )
& in(sK4(U_47,U_45,U_43),U_43) ) )
& ! [U_46,U_44,U_42] :
( ( ! [U_39] :
( in(U_39,U_42)
| in(U_39,U_44)
| ~ in(U_39,U_46) )
& ! [U_38] :
( ( ~ in(U_38,U_44)
& in(U_38,U_46) )
| ~ in(U_38,U_42) ) )
| U_42 != set_difference(U_46,U_44) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_41,sK5(U_47,U_45,U_43))],[f_6_4]) ).
cnf(f_6_6,plain,
( in(U_38,U_46)
| ~ in(U_38,U_42)
| U_42 != set_difference(U_46,U_44) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_7,plain,
( ~ in(U_38,U_44)
| ~ in(U_38,U_42)
| U_42 != set_difference(U_46,U_44) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_8,plain,
( in(U_39,U_42)
| in(U_39,U_44)
| ~ in(U_39,U_46)
| U_42 != set_difference(U_46,U_44) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_9,plain,
( in(sK5(U_47,U_45,U_43),U_47)
| in(sK4(U_47,U_45,U_43),U_43)
| U_43 = set_difference(U_47,U_45) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_10,plain,
( ~ in(sK5(U_47,U_45,U_43),U_45)
| in(sK4(U_47,U_45,U_43),U_43)
| U_43 = set_difference(U_47,U_45) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_11,plain,
( ~ in(sK5(U_47,U_45,U_43),U_43)
| in(sK4(U_47,U_45,U_43),U_43)
| U_43 = set_difference(U_47,U_45) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_12,plain,
( in(sK5(U_47,U_45,U_43),U_47)
| in(sK4(U_47,U_45,U_43),U_45)
| ~ in(sK4(U_47,U_45,U_43),U_47)
| U_43 = set_difference(U_47,U_45) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_13,plain,
( ~ in(sK5(U_47,U_45,U_43),U_45)
| in(sK4(U_47,U_45,U_43),U_45)
| ~ in(sK4(U_47,U_45,U_43),U_47)
| U_43 = set_difference(U_47,U_45) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_14,plain,
( ~ in(sK5(U_47,U_45,U_43),U_43)
| in(sK4(U_47,U_45,U_43),U_45)
| ~ in(sK4(U_47,U_45,U_43),U_47)
| U_43 = set_difference(U_47,U_45) ),
inference(clausify,[status(thm)],[f_6_5]) ).
fof(f_7_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k1_xboole_0]) ).
cnf(f_7_2,plain,
$true,
inference(clausify,[status(thm)],[f_7_1]) ).
fof(f_8_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k2_xboole_0]) ).
cnf(f_8_2,plain,
$true,
inference(clausify,[status(thm)],[f_8_1]) ).
fof(f_9_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k4_xboole_0]) ).
cnf(f_9_2,plain,
$true,
inference(clausify,[status(thm)],[f_9_1]) ).
fof(f_10_1,plain,
empty(empty_set),
inference(fof_nnf,[status(thm)],[fc1_xboole_0]) ).
cnf(f_10_2,plain,
empty(empty_set),
inference(clausify,[status(thm)],[f_10_1]) ).
fof(f_11_1,plain,
! [A,B] :
( ~ empty(set_union2(A,B))
| empty(A) ),
inference(fof_nnf,[status(thm)],[fc2_xboole_0]) ).
fof(f_11_2,plain,
! [U_49,U_48] :
( ~ empty(set_union2(U_49,U_48))
| empty(U_49) ),
inference(variable_rename,[status(thm)],[f_11_1]) ).
fof(f_11_3,plain,
! [U_49] :
( ! [U_48] : ~ empty(set_union2(U_49,U_48))
| empty(U_49) ),
inference(miniscope,[status(thm)],[f_11_2]) ).
cnf(f_11_4,plain,
( ~ empty(set_union2(U_49,U_48))
| empty(U_49) ),
inference(clausify,[status(thm)],[f_11_3]) ).
fof(f_12_1,plain,
! [A,B] :
( ~ empty(set_union2(B,A))
| empty(A) ),
inference(fof_nnf,[status(thm)],[fc3_xboole_0]) ).
fof(f_12_2,plain,
! [U_51,U_50] :
( ~ empty(set_union2(U_50,U_51))
| empty(U_51) ),
inference(variable_rename,[status(thm)],[f_12_1]) ).
fof(f_12_3,plain,
! [U_51] :
( ! [U_50] : ~ empty(set_union2(U_50,U_51))
| empty(U_51) ),
inference(miniscope,[status(thm)],[f_12_2]) ).
cnf(f_12_4,plain,
( ~ empty(set_union2(U_50,U_51))
| empty(U_51) ),
inference(clausify,[status(thm)],[f_12_3]) ).
fof(f_13_1,plain,
! [A,B] : set_union2(A,A) = A,
inference(fof_nnf,[status(thm)],[idempotence_k2_xboole_0]) ).
fof(f_13_2,plain,
! [U_53,U_52] : set_union2(U_53,U_53) = U_53,
inference(variable_rename,[status(thm)],[f_13_1]) ).
fof(f_13_3,plain,
! [U_53] : set_union2(U_53,U_53) = U_53,
inference(miniscope,[status(thm)],[f_13_2]) ).
cnf(f_13_4,plain,
set_union2(U_53,U_53) = U_53,
inference(clausify,[status(thm)],[f_13_3]) ).
fof(f_14_1,plain,
? [A] : empty(A),
inference(fof_nnf,[status(thm)],[rc1_xboole_0]) ).
fof(f_14_2,plain,
? [U_54] : empty(U_54),
inference(variable_rename,[status(thm)],[f_14_1]) ).
fof(f_14_3,plain,
empty(sK6),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_54,sK6)],[f_14_2]) ).
cnf(f_14_4,plain,
empty(sK6),
inference(clausify,[status(thm)],[f_14_3]) ).
fof(f_15_1,plain,
? [A] : ~ empty(A),
inference(fof_nnf,[status(thm)],[rc2_xboole_0]) ).
fof(f_15_2,plain,
? [U_55] : ~ empty(U_55),
inference(variable_rename,[status(thm)],[f_15_1]) ).
fof(f_15_3,plain,
~ empty(sK7),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_55,sK7)],[f_15_2]) ).
cnf(f_15_4,plain,
~ empty(sK7),
inference(clausify,[status(thm)],[f_15_3]) ).
fof(f_16_1,plain,
! [A,B] : subset(A,A),
inference(fof_nnf,[status(thm)],[reflexivity_r1_tarski]) ).
fof(f_16_2,plain,
! [U_57,U_56] : subset(U_57,U_57),
inference(variable_rename,[status(thm)],[f_16_1]) ).
fof(f_16_3,plain,
! [U_57] : subset(U_57,U_57),
inference(miniscope,[status(thm)],[f_16_2]) ).
cnf(f_16_4,plain,
subset(U_57,U_57),
inference(clausify,[status(thm)],[f_16_3]) ).
fof(f_17_1,plain,
! [A] : set_union2(A,empty_set) = A,
inference(fof_nnf,[status(thm)],[t1_boole]) ).
fof(f_17_2,plain,
! [U_58] : set_union2(U_58,empty_set) = U_58,
inference(variable_rename,[status(thm)],[f_17_1]) ).
cnf(f_17_3,plain,
set_union2(U_58,empty_set) = U_58,
inference(clausify,[status(thm)],[f_17_2]) ).
fof(f_18_1,plain,
! [A] : set_difference(A,empty_set) = A,
inference(fof_nnf,[status(thm)],[t3_boole]) ).
fof(f_18_2,plain,
! [U_59] : set_difference(U_59,empty_set) = U_59,
inference(variable_rename,[status(thm)],[f_18_1]) ).
cnf(f_18_3,plain,
set_difference(U_59,empty_set) = U_59,
inference(clausify,[status(thm)],[f_18_2]) ).
fof(f_19_1,negated_conjecture,
~ ! [A,B] : set_difference(set_union2(A,B),B) = set_difference(A,B),
inference(negate,[status(cth)],[t40_xboole_1]) ).
fof(f_19_2,negated_conjecture,
? [A,B] : set_difference(set_union2(A,B),B) != set_difference(A,B),
inference(fof_nnf,[status(thm)],[f_19_1]) ).
fof(f_19_3,negated_conjecture,
? [U_61,U_60] : set_difference(set_union2(U_61,U_60),U_60) != set_difference(U_61,U_60),
inference(variable_rename,[status(thm)],[f_19_2]) ).
fof(f_19_4,negated_conjecture,
? [U_60] : set_difference(set_union2(sK8,U_60),U_60) != set_difference(sK8,U_60),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_61,sK8)],[f_19_3]) ).
fof(f_19_5,negated_conjecture,
set_difference(set_union2(sK8,sK9),sK9) != set_difference(sK8,sK9),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(U_60,sK9)],[f_19_4]) ).
fof(f_19_6,negated_conjecture,
set_difference(set_union2(sK8,sK9),sK9) != set_difference(sK8,sK9),
inference(definitional_conversion,[status(esa)],[f_19_5]) ).
cnf(f_19_7,negated_conjecture,
set_difference(set_union2(sK8,sK9),sK9) != set_difference(sK8,sK9),
inference(clausify,[status(thm)],[f_19_6]) ).
fof(f_20_1,plain,
! [A] : set_difference(empty_set,A) = empty_set,
inference(fof_nnf,[status(thm)],[t4_boole]) ).
fof(f_20_2,plain,
! [U_62] : set_difference(empty_set,U_62) = empty_set,
inference(variable_rename,[status(thm)],[f_20_1]) ).
cnf(f_20_3,plain,
set_difference(empty_set,U_62) = empty_set,
inference(clausify,[status(thm)],[f_20_2]) ).
fof(f_21_1,plain,
! [A] :
( A = empty_set
| ~ empty(A) ),
inference(fof_nnf,[status(thm)],[t6_boole]) ).
fof(f_21_2,plain,
! [U_63] :
( U_63 = empty_set
| ~ empty(U_63) ),
inference(variable_rename,[status(thm)],[f_21_1]) ).
cnf(f_21_3,plain,
( U_63 = empty_set
| ~ empty(U_63) ),
inference(clausify,[status(thm)],[f_21_2]) ).
fof(f_22_1,plain,
! [A,B] :
( ~ empty(B)
| ~ in(A,B) ),
inference(fof_nnf,[status(thm)],[t7_boole]) ).
fof(f_22_2,plain,
! [U_65,U_64] :
( ~ empty(U_64)
| ~ in(U_65,U_64) ),
inference(variable_rename,[status(thm)],[f_22_1]) ).
cnf(f_22_3,plain,
( ~ empty(U_64)
| ~ in(U_65,U_64) ),
inference(clausify,[status(thm)],[f_22_2]) ).
fof(f_23_1,plain,
! [A,B] :
( ~ empty(B)
| A = B
| ~ empty(A) ),
inference(fof_nnf,[status(thm)],[t8_boole]) ).
fof(f_23_2,plain,
! [U_67,U_66] :
( ~ empty(U_66)
| U_67 = U_66
| ~ empty(U_67) ),
inference(variable_rename,[status(thm)],[f_23_1]) ).
fof(f_23_3,plain,
! [U_67] :
( ! [U_66] :
( ~ empty(U_66)
| U_67 = U_66 )
| ~ empty(U_67) ),
inference(miniscope,[status(thm)],[f_23_2]) ).
cnf(f_23_4,plain,
( ~ empty(U_66)
| U_67 = U_66
| ~ empty(U_67) ),
inference(clausify,[status(thm)],[f_23_3]) ).
cnf(f_7_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_7_2]) ).
cnf(f_8_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_8_2]) ).
cnf(f_9_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_9_2]) ).
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,
( 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_5,axiom,
( set_difference(Eq_x_0,Eq_x_1) = set_difference(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) = 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_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,
( sK5(Eq_x_0,Eq_x_1,Eq_x_2) = sK5(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_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,
( 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_13,axiom,
( empty(Eq_y_0)
| ~ empty(Eq_x_0)
| 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 : SEU136+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 19 23:21:10 UTC 2026
% 0.10/0.37 % CPUTime :
% 6.26/6.56 % SZS status Theorem for theBenchmark
% 6.26/6.56 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------