%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU145+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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 : 600s
% DateTime : Tue Jul 19 09:17:07 EDT 2022
% Result : Theorem 0.36s 27.54s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 22
% Syntax : Number of formulae : 111 ( 60 unt; 0 def)
% Number of atoms : 227 ( 68 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 195 ( 79 ~; 86 |; 17 &)
% ( 6 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 220 ( 23 sgn 110 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l3_zfmisc_1,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( in(X3,X1)
| subset(X1,set_difference(X2,singleton(X3))) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l3_zfmisc_1) ).
fof(t1_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_xboole_1) ).
fof(t33_xboole_1,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_difference(X1,X3),set_difference(X2,X3)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t33_xboole_1) ).
fof(t40_xboole_1,lemma,
! [X1,X2] : set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t40_xboole_1) ).
fof(t39_xboole_1,lemma,
! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t39_xboole_1) ).
fof(t26_xboole_1,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t26_xboole_1) ).
fof(t48_xboole_1,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t48_xboole_1) ).
fof(l32_xboole_1,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l32_xboole_1) ).
fof(t2_boole,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_boole) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k3_xboole_0) ).
fof(t3_boole,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_boole) ).
fof(l2_zfmisc_1,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l2_zfmisc_1) ).
fof(idempotence_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X1) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',idempotence_k2_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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_xboole_0) ).
fof(t1_boole,axiom,
! [X1] : set_union2(X1,empty_set) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_boole) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_xboole_0) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity_r1_tarski) ).
fof(t28_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t28_xboole_1) ).
fof(t36_xboole_1,lemma,
! [X1,X2] : subset(set_difference(X1,X2),X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t36_xboole_1) ).
fof(t8_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_xboole_1) ).
fof(t7_xboole_1,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_xboole_1) ).
fof(c_0_22,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> ( in(X3,X1)
| subset(X1,set_difference(X2,singleton(X3))) ) ),
inference(assume_negation,[status(cth)],[l3_zfmisc_1]) ).
fof(c_0_23,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
fof(c_0_24,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| subset(set_difference(X4,X6),set_difference(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_xboole_1])])])]) ).
fof(c_0_25,lemma,
! [X3,X4] : set_difference(set_union2(X3,X4),X4) = set_difference(X3,X4),
inference(variable_rename,[status(thm)],[t40_xboole_1]) ).
fof(c_0_26,lemma,
! [X3,X4] : set_union2(X3,set_difference(X4,X3)) = set_union2(X3,X4),
inference(variable_rename,[status(thm)],[t39_xboole_1]) ).
fof(c_0_27,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| subset(set_intersection2(X4,X6),set_intersection2(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t26_xboole_1])])])]) ).
fof(c_0_28,lemma,
! [X3,X4] : set_difference(X3,set_difference(X3,X4)) = set_intersection2(X3,X4),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
fof(c_0_29,lemma,
! [X3,X4,X3,X4] :
( ( set_difference(X3,X4) != empty_set
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| set_difference(X3,X4) = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l32_xboole_1])])])]) ).
fof(c_0_30,negated_conjecture,
( subset(esk1_0,esk2_0)
& ~ in(esk3_0,esk1_0)
& ~ subset(esk1_0,set_difference(esk2_0,singleton(esk3_0))) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
fof(c_0_31,plain,
! [X2] : set_intersection2(X2,empty_set) = empty_set,
inference(variable_rename,[status(thm)],[t2_boole]) ).
fof(c_0_32,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_33,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,lemma,
( subset(set_difference(X1,X2),set_difference(X3,X2))
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,lemma,
set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,lemma,
( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_41,plain,
! [X2] : set_difference(X2,empty_set) = X2,
inference(variable_rename,[status(thm)],[t3_boole]) ).
cnf(c_0_42,plain,
set_intersection2(X1,empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_44,lemma,
! [X3,X4,X3,X4] :
( ( ~ subset(singleton(X3),X4)
| in(X3,X4) )
& ( ~ in(X3,X4)
| subset(singleton(X3),X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])])])]) ).
cnf(c_0_45,lemma,
( subset(X1,set_difference(X2,X3))
| ~ subset(X1,set_difference(X4,X3))
| ~ subset(X4,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_46,lemma,
set_difference(set_union2(X1,X2),set_difference(X2,X1)) = set_difference(X1,set_difference(X2,X1)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_47,lemma,
( subset(set_difference(X1,set_difference(X1,X2)),set_difference(X3,set_difference(X3,X2)))
| ~ subset(X1,X3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_38]) ).
cnf(c_0_48,negated_conjecture,
set_difference(esk1_0,esk2_0) = empty_set,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_49,plain,
set_difference(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,plain,
set_difference(X1,set_difference(X1,empty_set)) = empty_set,
inference(rw,[status(thm)],[c_0_42,c_0_38]) ).
fof(c_0_51,plain,
! [X3] : set_union2(X3,X3) = X3,
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[idempotence_k2_xboole_0])]) ).
cnf(c_0_52,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_53,plain,
set_difference(X1,set_difference(X1,X2)) = set_difference(X2,set_difference(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_38]),c_0_38]) ).
cnf(c_0_54,lemma,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_55,lemma,
( subset(X1,set_difference(X2,set_difference(X3,X4)))
| ~ subset(X1,set_difference(X4,set_difference(X3,X4)))
| ~ subset(set_union2(X4,X3),X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_56,lemma,
( subset(esk1_0,set_difference(X1,set_difference(X1,esk2_0)))
| ~ subset(esk1_0,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_57,plain,
set_difference(X1,X1) = empty_set,
inference(rw,[status(thm)],[c_0_50,c_0_49]) ).
cnf(c_0_58,plain,
set_union2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_59,lemma,
( subset(X1,set_difference(X1,X2))
| set_difference(X2,set_difference(X2,X1)) != empty_set ),
inference(pm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,lemma,
( set_difference(singleton(X1),X2) = empty_set
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_54]) ).
fof(c_0_61,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( ~ in(X8,X7)
| in(X8,X5)
| in(X8,X6)
| X7 != set_union2(X5,X6) )
& ( ~ in(X8,X5)
| in(X8,X7)
| X7 != set_union2(X5,X6) )
& ( ~ in(X8,X6)
| in(X8,X7)
| X7 != set_union2(X5,X6) )
& ( ~ in(esk7_3(X5,X6,X7),X5)
| ~ in(esk7_3(X5,X6,X7),X7)
| X7 = set_union2(X5,X6) )
& ( ~ in(esk7_3(X5,X6,X7),X6)
| ~ in(esk7_3(X5,X6,X7),X7)
| X7 = set_union2(X5,X6) )
& ( in(esk7_3(X5,X6,X7),X7)
| in(esk7_3(X5,X6,X7),X5)
| in(esk7_3(X5,X6,X7),X6)
| X7 = set_union2(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_xboole_0])])])])])])]) ).
fof(c_0_62,plain,
! [X2] : set_union2(X2,empty_set) = X2,
inference(variable_rename,[status(thm)],[t1_boole]) ).
fof(c_0_63,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_64,lemma,
( subset(esk1_0,X1)
| ~ subset(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_49]),c_0_58]),c_0_40])]) ).
cnf(c_0_65,lemma,
( subset(X1,set_difference(X1,singleton(X2)))
| ~ in(X2,set_difference(singleton(X2),X1)) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
fof(c_0_66,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X8,X6)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X8,X5)
| in(X8,X6)
| in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(esk4_3(X5,X6,X7),X7)
| ~ in(esk4_3(X5,X6,X7),X5)
| in(esk4_3(X5,X6,X7),X6)
| X7 = set_difference(X5,X6) )
& ( in(esk4_3(X5,X6,X7),X5)
| in(esk4_3(X5,X6,X7),X7)
| X7 = set_difference(X5,X6) )
& ( ~ in(esk4_3(X5,X6,X7),X6)
| in(esk4_3(X5,X6,X7),X7)
| X7 = set_difference(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d4_xboole_0])])])])])])])]) ).
fof(c_0_67,plain,
! [X3] : subset(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_68,lemma,
! [X3,X4] :
( ~ subset(X3,X4)
| set_intersection2(X3,X4) = X3 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).
fof(c_0_69,lemma,
! [X3,X4] : subset(set_difference(X3,X4),X3),
inference(variable_rename,[status(thm)],[t36_xboole_1]) ).
cnf(c_0_70,plain,
( in(X4,X3)
| in(X4,X2)
| X1 != set_union2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_71,plain,
set_union2(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_72,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_73,negated_conjecture,
~ subset(esk1_0,set_difference(esk2_0,singleton(esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_74,lemma,
( subset(esk1_0,set_difference(esk2_0,singleton(X1)))
| ~ in(X1,set_difference(singleton(X1),esk2_0)) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_75,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_76,lemma,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_77,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_78,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
fof(c_0_79,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X6,X5)
| subset(set_union2(X4,X6),X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])]) ).
cnf(c_0_80,lemma,
subset(set_difference(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_81,lemma,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
inference(spm,[status(thm)],[c_0_70,c_0_36]) ).
cnf(c_0_82,lemma,
set_union2(esk1_0,esk2_0) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_48]),c_0_71]),c_0_72]) ).
cnf(c_0_83,negated_conjecture,
~ in(esk3_0,set_difference(singleton(esk3_0),esk2_0)),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_84,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_75]) ).
cnf(c_0_85,lemma,
in(X1,singleton(X1)),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_86,lemma,
( set_difference(X1,set_difference(X1,X2)) = X1
| ~ subset(X1,X2) ),
inference(rw,[status(thm)],[c_0_78,c_0_38]) ).
cnf(c_0_87,lemma,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_88,lemma,
( subset(X1,X2)
| ~ subset(X1,set_difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_33,c_0_80]) ).
cnf(c_0_89,lemma,
( in(X1,set_difference(esk2_0,esk1_0))
| in(X1,esk1_0)
| X2 != esk2_0
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_90,negated_conjecture,
in(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85])]) ).
cnf(c_0_91,negated_conjecture,
~ in(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_92,lemma,
! [X3,X4] : subset(X3,set_union2(X3,X4)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
cnf(c_0_93,lemma,
( set_difference(set_union2(X1,X2),set_difference(set_union2(X1,X2),X3)) = set_union2(X1,X2)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_94,lemma,
( subset(singleton(X1),X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_88,c_0_54]) ).
cnf(c_0_95,lemma,
in(esk3_0,set_difference(esk2_0,esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]) ).
cnf(c_0_96,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_97,lemma,
set_difference(set_difference(X1,X2),X1) = empty_set,
inference(spm,[status(thm)],[c_0_39,c_0_80]) ).
cnf(c_0_98,negated_conjecture,
( set_difference(set_union2(X1,esk1_0),set_difference(set_union2(X1,esk1_0),esk2_0)) = set_union2(X1,esk1_0)
| ~ subset(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_93,c_0_40]) ).
cnf(c_0_99,lemma,
subset(singleton(esk3_0),esk2_0),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_100,lemma,
( subset(set_difference(X1,X2),set_difference(X3,X2))
| ~ subset(set_union2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_101,lemma,
subset(X1,set_union2(X2,X1)),
inference(pm,[status(thm)],[c_0_96,c_0_72]) ).
cnf(c_0_102,lemma,
set_union2(X1,set_difference(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_36,c_0_97]),c_0_71]) ).
cnf(c_0_103,negated_conjecture,
set_difference(esk2_0,set_difference(esk2_0,set_union2(esk1_0,singleton(esk3_0)))) = set_union2(esk1_0,singleton(esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_72]),c_0_72]),c_0_53]),c_0_72]) ).
cnf(c_0_104,lemma,
subset(set_difference(X1,X2),set_difference(set_union2(X3,set_union2(X1,X2)),X2)),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_105,lemma,
set_union2(esk2_0,set_union2(esk1_0,singleton(esk3_0))) = esk2_0,
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_106,lemma,
subset(set_difference(esk1_0,singleton(esk3_0)),set_difference(esk2_0,singleton(esk3_0))),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_107,lemma,
( subset(X1,set_difference(esk2_0,singleton(esk3_0)))
| ~ subset(X1,set_difference(esk1_0,singleton(esk3_0))) ),
inference(spm,[status(thm)],[c_0_33,c_0_106]) ).
cnf(c_0_108,negated_conjecture,
~ subset(esk1_0,set_difference(esk1_0,singleton(esk3_0))),
inference(spm,[status(thm)],[c_0_73,c_0_107]) ).
cnf(c_0_109,lemma,
~ in(esk3_0,set_difference(singleton(esk3_0),esk1_0)),
inference(spm,[status(thm)],[c_0_108,c_0_65]) ).
cnf(c_0_110,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_84]),c_0_85])]),c_0_91]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU145+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 19:07:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.34/23.41 eprover: CPU time limit exceeded, terminating
% 0.34/23.41 eprover: CPU time limit exceeded, terminating
% 0.34/23.41 eprover: CPU time limit exceeded, terminating
% 0.34/23.44 eprover: CPU time limit exceeded, terminating
% 0.36/27.54 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.36/27.54
% 0.36/27.54 # Failure: Resource limit exceeded (time)
% 0.36/27.54 # OLD status Res
% 0.36/27.54 # Preprocessing time : 0.019 s
% 0.36/27.54 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.36/27.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.36/27.54 # Preprocessing time : 0.018 s
% 0.36/27.54
% 0.36/27.54 # Proof found!
% 0.36/27.54 # SZS status Theorem
% 0.36/27.54 # SZS output start CNFRefutation
% See solution above
% 0.36/27.54 # Proof object total steps : 111
% 0.36/27.54 # Proof object clause steps : 66
% 0.36/27.54 # Proof object formula steps : 45
% 0.36/27.54 # Proof object conjectures : 12
% 0.36/27.54 # Proof object clause conjectures : 9
% 0.36/27.54 # Proof object formula conjectures : 3
% 0.36/27.54 # Proof object initial clauses used : 26
% 0.36/27.54 # Proof object initial formulas used : 22
% 0.36/27.54 # Proof object generating inferences : 35
% 0.36/27.54 # Proof object simplifying inferences : 26
% 0.36/27.54 # Training examples: 0 positive, 0 negative
% 0.36/27.54 # Parsed axioms : 66
% 0.36/27.54 # Removed by relevancy pruning/SinE : 19
% 0.36/27.54 # Initial clauses : 76
% 0.36/27.54 # Removed in clause preprocessing : 1
% 0.36/27.54 # Initial clauses in saturation : 75
% 0.36/27.54 # Processed clauses : 19862
% 0.36/27.54 # ...of these trivial : 282
% 0.36/27.54 # ...subsumed : 15579
% 0.36/27.54 # ...remaining for further processing : 4001
% 0.36/27.54 # Other redundant clauses eliminated : 915
% 0.36/27.54 # Clauses deleted for lack of memory : 0
% 0.36/27.54 # Backward-subsumed : 166
% 0.36/27.54 # Backward-rewritten : 955
% 0.36/27.54 # Generated clauses : 214168
% 0.36/27.54 # ...of the previous two non-trivial : 191746
% 0.36/27.54 # Contextual simplify-reflections : 4236
% 0.36/27.54 # Paramodulations : 210983
% 0.36/27.54 # Factorizations : 200
% 0.36/27.54 # Equation resolutions : 1103
% 0.36/27.54 # Current number of processed clauses : 2869
% 0.36/27.54 # Positive orientable unit clauses : 485
% 0.36/27.54 # Positive unorientable unit clauses: 24
% 0.36/27.54 # Negative unit clauses : 392
% 0.36/27.54 # Non-unit-clauses : 1968
% 0.36/27.54 # Current number of unprocessed clauses: 121792
% 0.36/27.54 # ...number of literals in the above : 402352
% 0.36/27.54 # Current number of archived formulas : 0
% 0.36/27.54 # Current number of archived clauses : 1126
% 0.36/27.54 # Clause-clause subsumption calls (NU) : 3158656
% 0.36/27.54 # Rec. Clause-clause subsumption calls : 2157064
% 0.36/27.54 # Non-unit clause-clause subsumptions : 11174
% 0.36/27.54 # Unit Clause-clause subsumption calls : 451142
% 0.36/27.54 # Rewrite failures with RHS unbound : 191
% 0.36/27.54 # BW rewrite match attempts : 2091
% 0.36/27.54 # BW rewrite match successes : 534
% 0.36/27.54 # Condensation attempts : 0
% 0.36/27.54 # Condensation successes : 0
% 0.36/27.54 # Termbank termtop insertions : 2995739
% 0.36/27.54
% 0.36/27.54 # -------------------------------------------------
% 0.36/27.54 # User time : 4.030 s
% 0.36/27.54 # System time : 0.066 s
% 0.36/27.54 # Total time : 4.096 s
% 0.36/27.54 # Maximum resident set size: 114192 pages
% 0.36/46.43 eprover: CPU time limit exceeded, terminating
% 0.36/46.43 eprover: CPU time limit exceeded, terminating
% 0.36/46.44 eprover: eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.pCannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.44
% 0.36/46.44 eprover: No such file or directory
% 0.36/46.44 eprover: No such file or directory
% 0.36/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.44 eprover: No such file or directory
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.45 eprover: CPU time limit exceeded, terminating
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.50 eprover: No such file or directory
% 0.36/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.50 eprover: No such file or directory
% 0.36/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.50 eprover: No such file or directory
%------------------------------------------------------------------------------