%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU119+2 : 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 : n004.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:05 AM UTC 2026
% Result : Theorem 187.99s 188.34s
% Output : Proof 189.89s
% 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_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
file('theBenchmark.p',commutativity_k3_xboole_0) ).
fof(d1_xboole_0,axiom,
! [A] :
( A = empty_set
<=> ! [B] : ~ in(B,A) ),
file('theBenchmark.p',d1_xboole_0) ).
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(d7_xboole_0,axiom,
! [A,B] :
( disjoint(A,B)
<=> set_intersection2(A,B) = empty_set ),
file('theBenchmark.p',d7_xboole_0) ).
fof(dt_k1_xboole_0,axiom,
$true,
file('theBenchmark.p',dt_k1_xboole_0) ).
fof(dt_k3_xboole_0,axiom,
$true,
file('theBenchmark.p',dt_k3_xboole_0) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('theBenchmark.p',fc1_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(t3_xboole_0,conjecture,
! [A,B] :
( ~ ( disjoint(A,B)
& ? [C] :
( in(C,B)
& in(C,A) ) )
& ~ ( ! [C] :
~ ( in(C,B)
& in(C,A) )
& ~ disjoint(A,B) ) ),
file('theBenchmark.p',t3_xboole_0) ).
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_intersection2(A,B) = set_intersection2(B,A),
inference(fof_nnf,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(f_2_2,plain,
! [U_3,U_2] : set_intersection2(U_3,U_2) = set_intersection2(U_2,U_3),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
set_intersection2(U_3,U_2) = set_intersection2(U_2,U_3),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,plain,
! [A] :
( ( A = empty_set
| ? [B] : in(B,A) )
& ( ! [B] : ~ in(B,A)
| A != empty_set ) ),
inference(fof_nnf,[status(thm)],[d1_xboole_0]) ).
fof(f_3_2,plain,
! [U_6] :
( ( U_6 = empty_set
| ? [U_5] : in(U_5,U_6) )
& ( ! [U_4] : ~ in(U_4,U_6)
| U_6 != empty_set ) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
( ! [U_8] :
( U_8 = empty_set
| ? [U_5] : in(U_5,U_8) )
& ! [U_7] :
( ! [U_4] : ~ in(U_4,U_7)
| U_7 != empty_set ) ),
inference(miniscope,[status(thm)],[f_3_2]) ).
fof(f_3_4,plain,
( ! [U_8] :
( U_8 = empty_set
| in(sK1(U_8),U_8) )
& ! [U_7] :
( ! [U_4] : ~ in(U_4,U_7)
| U_7 != empty_set ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_5,sK1(U_8))],[f_3_3]) ).
cnf(f_3_5,plain,
( ~ in(U_4,U_7)
| U_7 != empty_set ),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(f_3_6,plain,
( U_8 = empty_set
| in(sK1(U_8),U_8) ),
inference(clausify,[status(thm)],[f_3_4]) ).
fof(f_4_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_4_2,plain,
! [U_13,U_12,U_11] :
( ( U_11 = set_intersection2(U_13,U_12)
| ? [U_10] :
( ( ~ in(U_10,U_11)
& in(U_10,U_12)
& in(U_10,U_13) )
| ( ( ~ in(U_10,U_12)
| ~ in(U_10,U_13) )
& in(U_10,U_11) ) ) )
& ( ! [U_9] :
( ( in(U_9,U_11)
| ~ in(U_9,U_12)
| ~ in(U_9,U_13) )
& ( ( in(U_9,U_12)
& in(U_9,U_13) )
| ~ in(U_9,U_11) ) )
| U_11 != set_intersection2(U_13,U_12) ) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
( ! [U_23,U_21,U_19] :
( U_19 = set_intersection2(U_23,U_21)
| ? [U_17] :
( ~ in(U_17,U_19)
& in(U_17,U_21)
& in(U_17,U_23) )
| ? [U_16] :
( ( ~ in(U_16,U_21)
| ~ in(U_16,U_23) )
& in(U_16,U_19) ) )
& ! [U_22,U_20,U_18] :
( ( ! [U_15] :
( in(U_15,U_18)
| ~ in(U_15,U_20)
| ~ in(U_15,U_22) )
& ! [U_14] :
( ( in(U_14,U_20)
& in(U_14,U_22) )
| ~ in(U_14,U_18) ) )
| U_18 != set_intersection2(U_22,U_20) ) ),
inference(miniscope,[status(thm)],[f_4_2]) ).
fof(f_4_4,plain,
( ! [U_23,U_21,U_19] :
( U_19 = set_intersection2(U_23,U_21)
| ? [U_17] :
( ~ in(U_17,U_19)
& in(U_17,U_21)
& in(U_17,U_23) )
| ( ( ~ in(sK2(U_23,U_21,U_19),U_21)
| ~ in(sK2(U_23,U_21,U_19),U_23) )
& in(sK2(U_23,U_21,U_19),U_19) ) )
& ! [U_22,U_20,U_18] :
( ( ! [U_15] :
( in(U_15,U_18)
| ~ in(U_15,U_20)
| ~ in(U_15,U_22) )
& ! [U_14] :
( ( in(U_14,U_20)
& in(U_14,U_22) )
| ~ in(U_14,U_18) ) )
| U_18 != set_intersection2(U_22,U_20) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_16,sK2(U_23,U_21,U_19))],[f_4_3]) ).
fof(f_4_5,plain,
( ! [U_23,U_21,U_19] :
( U_19 = set_intersection2(U_23,U_21)
| ( ~ in(sK3(U_23,U_21,U_19),U_19)
& in(sK3(U_23,U_21,U_19),U_21)
& in(sK3(U_23,U_21,U_19),U_23) )
| ( ( ~ in(sK2(U_23,U_21,U_19),U_21)
| ~ in(sK2(U_23,U_21,U_19),U_23) )
& in(sK2(U_23,U_21,U_19),U_19) ) )
& ! [U_22,U_20,U_18] :
( ( ! [U_15] :
( in(U_15,U_18)
| ~ in(U_15,U_20)
| ~ in(U_15,U_22) )
& ! [U_14] :
( ( in(U_14,U_20)
& in(U_14,U_22) )
| ~ in(U_14,U_18) ) )
| U_18 != set_intersection2(U_22,U_20) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_17,sK3(U_23,U_21,U_19))],[f_4_4]) ).
cnf(f_4_6,plain,
( in(U_14,U_22)
| ~ in(U_14,U_18)
| U_18 != set_intersection2(U_22,U_20) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_7,plain,
( in(U_14,U_20)
| ~ in(U_14,U_18)
| U_18 != set_intersection2(U_22,U_20) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_8,plain,
( in(U_15,U_18)
| ~ in(U_15,U_20)
| ~ in(U_15,U_22)
| U_18 != set_intersection2(U_22,U_20) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_9,plain,
( in(sK3(U_23,U_21,U_19),U_23)
| in(sK2(U_23,U_21,U_19),U_19)
| U_19 = set_intersection2(U_23,U_21) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_10,plain,
( in(sK3(U_23,U_21,U_19),U_21)
| in(sK2(U_23,U_21,U_19),U_19)
| U_19 = set_intersection2(U_23,U_21) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_11,plain,
( ~ in(sK3(U_23,U_21,U_19),U_19)
| in(sK2(U_23,U_21,U_19),U_19)
| U_19 = set_intersection2(U_23,U_21) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_12,plain,
( in(sK3(U_23,U_21,U_19),U_23)
| ~ in(sK2(U_23,U_21,U_19),U_21)
| ~ in(sK2(U_23,U_21,U_19),U_23)
| U_19 = set_intersection2(U_23,U_21) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_13,plain,
( in(sK3(U_23,U_21,U_19),U_21)
| ~ in(sK2(U_23,U_21,U_19),U_21)
| ~ in(sK2(U_23,U_21,U_19),U_23)
| U_19 = set_intersection2(U_23,U_21) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_14,plain,
( ~ in(sK3(U_23,U_21,U_19),U_19)
| ~ in(sK2(U_23,U_21,U_19),U_21)
| ~ in(sK2(U_23,U_21,U_19),U_23)
| U_19 = set_intersection2(U_23,U_21) ),
inference(clausify,[status(thm)],[f_4_5]) ).
fof(f_5_1,plain,
! [A,B] :
( ( disjoint(A,B)
| set_intersection2(A,B) != empty_set )
& ( set_intersection2(A,B) = empty_set
| ~ disjoint(A,B) ) ),
inference(fof_nnf,[status(thm)],[d7_xboole_0]) ).
fof(f_5_2,plain,
! [U_25,U_24] :
( ( disjoint(U_25,U_24)
| set_intersection2(U_25,U_24) != empty_set )
& ( set_intersection2(U_25,U_24) = empty_set
| ~ disjoint(U_25,U_24) ) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
( ! [U_29,U_27] :
( disjoint(U_29,U_27)
| set_intersection2(U_29,U_27) != empty_set )
& ! [U_28,U_26] :
( set_intersection2(U_28,U_26) = empty_set
| ~ disjoint(U_28,U_26) ) ),
inference(miniscope,[status(thm)],[f_5_2]) ).
cnf(f_5_4,plain,
( set_intersection2(U_28,U_26) = empty_set
| ~ disjoint(U_28,U_26) ),
inference(clausify,[status(thm)],[f_5_3]) ).
cnf(f_5_5,plain,
( disjoint(U_29,U_27)
| set_intersection2(U_29,U_27) != empty_set ),
inference(clausify,[status(thm)],[f_5_3]) ).
fof(f_6_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k1_xboole_0]) ).
cnf(f_6_2,plain,
$true,
inference(clausify,[status(thm)],[f_6_1]) ).
fof(f_7_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k3_xboole_0]) ).
cnf(f_7_2,plain,
$true,
inference(clausify,[status(thm)],[f_7_1]) ).
fof(f_8_1,plain,
empty(empty_set),
inference(fof_nnf,[status(thm)],[fc1_xboole_0]) ).
cnf(f_8_2,plain,
empty(empty_set),
inference(clausify,[status(thm)],[f_8_1]) ).
fof(f_9_1,plain,
! [A,B] : set_intersection2(A,A) = A,
inference(fof_nnf,[status(thm)],[idempotence_k3_xboole_0]) ).
fof(f_9_2,plain,
! [U_31,U_30] : set_intersection2(U_31,U_31) = U_31,
inference(variable_rename,[status(thm)],[f_9_1]) ).
fof(f_9_3,plain,
! [U_31] : set_intersection2(U_31,U_31) = U_31,
inference(miniscope,[status(thm)],[f_9_2]) ).
cnf(f_9_4,plain,
set_intersection2(U_31,U_31) = U_31,
inference(clausify,[status(thm)],[f_9_3]) ).
fof(f_10_1,plain,
? [A] : empty(A),
inference(fof_nnf,[status(thm)],[rc1_xboole_0]) ).
fof(f_10_2,plain,
? [U_32] : empty(U_32),
inference(variable_rename,[status(thm)],[f_10_1]) ).
fof(f_10_3,plain,
empty(sK4),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_32,sK4)],[f_10_2]) ).
cnf(f_10_4,plain,
empty(sK4),
inference(clausify,[status(thm)],[f_10_3]) ).
fof(f_11_1,plain,
? [A] : ~ empty(A),
inference(fof_nnf,[status(thm)],[rc2_xboole_0]) ).
fof(f_11_2,plain,
? [U_33] : ~ empty(U_33),
inference(variable_rename,[status(thm)],[f_11_1]) ).
fof(f_11_3,plain,
~ empty(sK5),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_33,sK5)],[f_11_2]) ).
cnf(f_11_4,plain,
~ empty(sK5),
inference(clausify,[status(thm)],[f_11_3]) ).
fof(f_12_1,plain,
! [A,B] :
( disjoint(B,A)
| ~ disjoint(A,B) ),
inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0]) ).
fof(f_12_2,plain,
! [U_35,U_34] :
( disjoint(U_34,U_35)
| ~ disjoint(U_35,U_34) ),
inference(variable_rename,[status(thm)],[f_12_1]) ).
cnf(f_12_3,plain,
( disjoint(U_34,U_35)
| ~ disjoint(U_35,U_34) ),
inference(clausify,[status(thm)],[f_12_2]) ).
fof(f_13_1,negated_conjecture,
~ ! [A,B] :
( ~ ( disjoint(A,B)
& ? [C] :
( in(C,B)
& in(C,A) ) )
& ~ ( ! [C] :
~ ( in(C,B)
& in(C,A) )
& ~ disjoint(A,B) ) ),
inference(negate,[status(cth)],[t3_xboole_0]) ).
fof(f_13_2,negated_conjecture,
? [A,B] :
( ( disjoint(A,B)
& ? [C] :
( in(C,B)
& in(C,A) ) )
| ( ! [C] :
( ~ in(C,B)
| ~ in(C,A) )
& ~ disjoint(A,B) ) ),
inference(fof_nnf,[status(thm)],[f_13_1]) ).
fof(f_13_3,negated_conjecture,
? [U_39,U_38] :
( ( disjoint(U_39,U_38)
& ? [U_37] :
( in(U_37,U_38)
& in(U_37,U_39) ) )
| ( ! [U_36] :
( ~ in(U_36,U_38)
| ~ in(U_36,U_39) )
& ~ disjoint(U_39,U_38) ) ),
inference(variable_rename,[status(thm)],[f_13_2]) ).
fof(f_13_4,negated_conjecture,
( ? [U_43,U_41] :
( disjoint(U_43,U_41)
& ? [U_37] :
( in(U_37,U_41)
& in(U_37,U_43) ) )
| ? [U_42,U_40] :
( ! [U_36] :
( ~ in(U_36,U_40)
| ~ in(U_36,U_42) )
& ~ disjoint(U_42,U_40) ) ),
inference(miniscope,[status(thm)],[f_13_3]) ).
fof(f_13_5,negated_conjecture,
( ? [U_43,U_41] :
( disjoint(U_43,U_41)
& ? [U_37] :
( in(U_37,U_41)
& in(U_37,U_43) ) )
| ? [U_40] :
( ! [U_36] :
( ~ in(U_36,U_40)
| ~ in(U_36,sK6) )
& ~ disjoint(sK6,U_40) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_42,sK6)],[f_13_4]) ).
fof(f_13_6,negated_conjecture,
( ? [U_43,U_41] :
( disjoint(U_43,U_41)
& ? [U_37] :
( in(U_37,U_41)
& in(U_37,U_43) ) )
| ( ! [U_36] :
( ~ in(U_36,sK7)
| ~ in(U_36,sK6) )
& ~ disjoint(sK6,sK7) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_40,sK7)],[f_13_5]) ).
fof(f_13_7,negated_conjecture,
( ? [U_41] :
( disjoint(sK8,U_41)
& ? [U_37] :
( in(U_37,U_41)
& in(U_37,sK8) ) )
| ( ! [U_36] :
( ~ in(U_36,sK7)
| ~ in(U_36,sK6) )
& ~ disjoint(sK6,sK7) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_43,sK8)],[f_13_6]) ).
fof(f_13_8,negated_conjecture,
( ( disjoint(sK8,sK9)
& ? [U_37] :
( in(U_37,sK9)
& in(U_37,sK8) ) )
| ( ! [U_36] :
( ~ in(U_36,sK7)
| ~ in(U_36,sK6) )
& ~ disjoint(sK6,sK7) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(U_41,sK9)],[f_13_7]) ).
fof(f_13_9,negated_conjecture,
( ( disjoint(sK8,sK9)
& in(sK10,sK9)
& in(sK10,sK8) )
| ( ! [U_36] :
( ~ in(U_36,sK7)
| ~ in(U_36,sK6) )
& ~ disjoint(sK6,sK7) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(U_37,sK10)],[f_13_8]) ).
fof(f_13_10,negated_conjecture,
( ( disjoint(sK8,sK9)
| ~ sP1 )
& ( in(sK10,sK9)
| ~ sP1 )
& ( in(sK10,sK8)
| ~ sP1 )
& ! [U_36] :
( ~ in(U_36,sK7)
| ~ in(U_36,sK6)
| ~ sP0(U_36) )
& ! [U_36] :
( ~ disjoint(sK6,sK7)
| ~ sP0(U_36) )
& ! [U_36] :
( sP1
| sP0(U_36) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_13_9]) ).
cnf(f_13_11,negated_conjecture,
( sP1
| sP0(U_36) ),
inference(clausify,[status(thm)],[f_13_10]) ).
cnf(f_13_12,negated_conjecture,
( ~ disjoint(sK6,sK7)
| ~ sP0(U_36) ),
inference(clausify,[status(thm)],[f_13_10]) ).
cnf(f_13_13,negated_conjecture,
( ~ in(U_36,sK7)
| ~ in(U_36,sK6)
| ~ sP0(U_36) ),
inference(clausify,[status(thm)],[f_13_10]) ).
cnf(f_13_14,negated_conjecture,
( in(sK10,sK8)
| ~ sP1 ),
inference(clausify,[status(thm)],[f_13_10]) ).
cnf(f_13_15,negated_conjecture,
( in(sK10,sK9)
| ~ sP1 ),
inference(clausify,[status(thm)],[f_13_10]) ).
cnf(f_13_16,negated_conjecture,
( disjoint(sK8,sK9)
| ~ sP1 ),
inference(clausify,[status(thm)],[f_13_10]) ).
cnf(f_6_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_6_2]) ).
cnf(f_7_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_7_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_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_5,axiom,
( sK1(Eq_x_0) = sK1(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,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_7,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_8,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_9,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_10,axiom,
( empty(Eq_y_0)
| ~ empty(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_11,axiom,
( sP0(Eq_y_0)
| ~ sP0(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.02 % Problem : SEU119+2 : 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.08/0.36 % Computer : n004.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 19 23:20:34 UTC 2026
% 0.08/0.36 % CPUTime :
% 187.99/188.34 % SZS status Theorem for theBenchmark
% 187.99/188.34 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------