%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU131+2 : TPTP v9.2.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:10:43 PM UTC 2026
% Result : Theorem 10.81s 7.19s
% Output : CNFRefutation 10.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of formulae : 89 ( 24 unt; 0 def)
% Number of atoms : 239 ( 69 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 247 ( 97 ~; 97 |; 37 &)
% ( 12 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 222 ( 30 sgn 103 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t4_xboole_0,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(t3_xboole_0,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(t12_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(t17_xboole_1,lemma,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(l32_xboole_1,conjecture,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(t1_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(t28_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(t7_xboole_1,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(c_0_15,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t4_xboole_0]) ).
fof(c_0_16,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t3_xboole_0]) ).
fof(c_0_17,lemma,
! [X180,X181,X183,X184,X185] :
( ( disjoint(X180,X181)
| in(esk12_2(X180,X181),set_intersection2(X180,X181)) )
& ( ~ in(X185,set_intersection2(X183,X184))
| ~ disjoint(X183,X184) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])]) ).
fof(c_0_18,lemma,
! [X172,X173,X175,X176,X177] :
( ( in(esk11_2(X172,X173),X172)
| disjoint(X172,X173) )
& ( in(esk11_2(X172,X173),X173)
| disjoint(X172,X173) )
& ( ~ in(X177,X175)
| ~ in(X177,X176)
| ~ disjoint(X175,X176) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])])]) ).
fof(c_0_19,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_20,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_21,plain,
! [X102,X103,X104,X105,X106,X107,X108,X109] :
( ( ~ in(X105,X104)
| in(X105,X102)
| in(X105,X103)
| X104 != set_union2(X102,X103) )
& ( ~ in(X106,X102)
| in(X106,X104)
| X104 != set_union2(X102,X103) )
& ( ~ in(X106,X103)
| in(X106,X104)
| X104 != set_union2(X102,X103) )
& ( ~ in(esk2_3(X107,X108,X109),X107)
| ~ in(esk2_3(X107,X108,X109),X109)
| X109 = set_union2(X107,X108) )
& ( ~ in(esk2_3(X107,X108,X109),X108)
| ~ in(esk2_3(X107,X108,X109),X109)
| X109 = set_union2(X107,X108) )
& ( in(esk2_3(X107,X108,X109),X109)
| in(esk2_3(X107,X108,X109),X107)
| in(esk2_3(X107,X108,X109),X108)
| X109 = set_union2(X107,X108) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_xboole_0])])])])])]) ).
cnf(c_0_22,lemma,
( ~ in(X1,set_intersection2(X2,X3))
| ~ disjoint(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,lemma,
( in(esk11_2(X1,X2),X2)
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X98,X99,X100] :
( ( X98 != empty_set
| ~ in(X99,X98) )
& ( in(esk1_1(X100),X100)
| X100 = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])]) ).
fof(c_0_25,plain,
! [X126,X127,X128,X129,X130,X131,X132,X133] :
( ( in(X129,X126)
| ~ in(X129,X128)
| X128 != set_difference(X126,X127) )
& ( ~ in(X129,X127)
| ~ in(X129,X128)
| X128 != set_difference(X126,X127) )
& ( ~ in(X130,X126)
| in(X130,X127)
| in(X130,X128)
| X128 != set_difference(X126,X127) )
& ( ~ in(esk5_3(X131,X132,X133),X133)
| ~ in(esk5_3(X131,X132,X133),X131)
| in(esk5_3(X131,X132,X133),X132)
| X133 = set_difference(X131,X132) )
& ( in(esk5_3(X131,X132,X133),X131)
| in(esk5_3(X131,X132,X133),X133)
| X133 = set_difference(X131,X132) )
& ( ~ in(esk5_3(X131,X132,X133),X132)
| in(esk5_3(X131,X132,X133),X133)
| X133 = set_difference(X131,X132) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])])]) ).
cnf(c_0_26,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,lemma,
( in(esk11_2(X1,X2),X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( in(esk1_1(X1),X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_31,lemma,
( set_intersection2(X1,X2) = empty_set
| in(esk11_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_32,plain,
! [X135,X136] :
( ( ~ disjoint(X135,X136)
| set_intersection2(X135,X136) = empty_set )
& ( set_intersection2(X135,X136) != empty_set
| disjoint(X135,X136) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])]) ).
cnf(c_0_33,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_34,lemma,
( set_intersection2(X1,X2) = empty_set
| in(esk11_2(X1,X2),set_union2(X3,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,lemma,
( in(esk11_2(X1,X2),X1)
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_37,plain,
! [X94,X95] : set_intersection2(X94,X95) = set_intersection2(X95,X94),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_38,lemma,
( set_intersection2(X1,X2) = empty_set
| ~ in(esk11_2(X1,X2),set_difference(X3,set_union2(X4,X2))) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,lemma,
( set_intersection2(X1,X2) = empty_set
| in(esk11_2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_41,lemma,
! [X150,X151] :
( ~ subset(X150,X151)
| set_union2(X150,X151) = X151 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])]) ).
fof(c_0_42,lemma,
! [X152,X153] : subset(set_intersection2(X152,X153),X152),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
fof(c_0_43,plain,
! [X92,X93] : set_union2(X92,X93) = set_union2(X93,X92),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_44,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_45,lemma,
set_intersection2(X1,set_difference(X2,set_union2(X3,X1))) = empty_set,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_46,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,lemma,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_49,negated_conjecture,
~ ! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
inference(assume_negation,[status(cth)],[l32_xboole_1]) ).
cnf(c_0_50,lemma,
disjoint(X1,set_difference(X2,set_union2(X3,X1))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,lemma,
set_union2(X1,set_intersection2(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
fof(c_0_52,lemma,
! [X158,X159,X160] :
( ~ subset(X158,X159)
| ~ subset(X159,X160)
| subset(X158,X160) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
fof(c_0_53,negated_conjecture,
( ( set_difference(esk6_0,esk7_0) != empty_set
| ~ subset(esk6_0,esk7_0) )
& ( set_difference(esk6_0,esk7_0) = empty_set
| subset(esk6_0,esk7_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_49])])]) ).
cnf(c_0_54,lemma,
( ~ in(X1,X2)
| ~ in(X1,X3)
| ~ disjoint(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_55,lemma,
disjoint(set_intersection2(X1,X2),set_difference(X3,X1)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_57,lemma,
( subset(X1,X3)
| ~ subset(X1,X2)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_58,negated_conjecture,
( set_difference(esk6_0,esk7_0) = empty_set
| subset(esk6_0,esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_59,lemma,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,set_intersection2(X3,X4)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_56]) ).
fof(c_0_61,lemma,
! [X164,X165] :
( ~ subset(X164,X165)
| set_intersection2(X164,X165) = X164 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).
cnf(c_0_62,negated_conjecture,
( set_difference(esk6_0,esk7_0) = empty_set
| subset(X1,esk7_0)
| ~ subset(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
fof(c_0_63,plain,
! [X111,X112,X113,X114,X115] :
( ( ~ subset(X111,X112)
| ~ in(X113,X111)
| in(X113,X112) )
& ( in(esk3_2(X114,X115),X114)
| subset(X114,X115) )
& ( ~ in(esk3_2(X114,X115),X115)
| subset(X114,X115) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).
cnf(c_0_64,lemma,
( set_difference(X1,X2) = empty_set
| ~ in(esk1_1(set_difference(X1,X2)),set_intersection2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_59,c_0_28]) ).
cnf(c_0_65,plain,
( set_difference(X1,X2) = empty_set
| in(esk1_1(set_difference(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_28]) ).
cnf(c_0_66,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_67,lemma,
( set_difference(esk6_0,esk7_0) = empty_set
| subset(set_intersection2(esk6_0,X1),esk7_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_47]) ).
fof(c_0_68,lemma,
! [X189,X190] : subset(X189,set_union2(X189,X190)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
cnf(c_0_69,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X4 != set_difference(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_70,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_71,lemma,
set_difference(set_intersection2(X1,X2),X1) = empty_set,
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_72,lemma,
( set_intersection2(esk7_0,set_intersection2(esk6_0,X1)) = set_intersection2(esk6_0,X1)
| set_difference(esk6_0,esk7_0) = empty_set ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_40]) ).
cnf(c_0_73,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_74,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_69]) ).
cnf(c_0_75,lemma,
( set_intersection2(X1,X2) = X1
| in(esk3_2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_70]) ).
cnf(c_0_76,lemma,
( set_difference(set_intersection2(esk6_0,X1),esk7_0) = empty_set
| set_difference(esk6_0,esk7_0) = empty_set ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_77,lemma,
set_intersection2(X1,set_union2(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_66,c_0_73]) ).
cnf(c_0_78,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_79,lemma,
( set_intersection2(X1,X2) = X1
| in(esk3_2(X1,X2),set_difference(X1,X3))
| in(esk3_2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_80,lemma,
set_difference(esk6_0,esk7_0) = empty_set,
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_78]) ).
cnf(c_0_82,negated_conjecture,
( set_difference(esk6_0,esk7_0) != empty_set
| ~ subset(esk6_0,esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_83,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_84,lemma,
( set_intersection2(esk6_0,X1) = esk6_0
| in(esk3_2(esk6_0,X1),esk7_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]) ).
cnf(c_0_85,negated_conjecture,
~ subset(esk6_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_80])]) ).
cnf(c_0_86,lemma,
subset(set_intersection2(X1,X2),X2),
inference(spm,[status(thm)],[c_0_47,c_0_40]) ).
cnf(c_0_87,lemma,
set_intersection2(esk6_0,esk7_0) = esk6_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]) ).
cnf(c_0_88,lemma,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU131+2 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n014.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 02:45:07 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 10.81/7.19 % Version : CSE_E---1.7
% 10.81/7.19 % Problem : theBenchmark.p
% 10.81/7.19 % SZS status Theorem for theBenchmark.p
% 10.81/7.19 % SZS output start CNFRefutation
% See solution above
% 10.88/7.23 % Total time : 5.373s
%------------------------------------------------------------------------------