TSTP Solution File: SET097+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET097+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : selma.cs.miami.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz @ 2394MHz
% Memory : 1004.5MB
% OS : Linux 2.6.27.5-117.fc10.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 08:06:32 EDT 2012
% Result : Theorem 186.21s
% Output : CNFRefutation 186.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 9
% Syntax : Number of formulae : 124 ( 31 unt; 0 def)
% Number of atoms : 344 ( 42 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 370 ( 150 ~; 161 |; 52 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 242 ( 30 sgn 81 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : ~ member(X1,null_class),
file('/tmp/tmpFFPGGe/sel_SET097+1.p_4',null_class_defn) ).
fof(7,axiom,
! [X1,X3] :
( equal(X1,X3)
<=> ( subclass(X1,X3)
& subclass(X3,X1) ) ),
file('/tmp/tmpFFPGGe/sel_SET097+1.p_4',extensionality) ).
fof(10,axiom,
! [X1] : equal(singleton(X1),unordered_pair(X1,X1)),
file('/tmp/tmpFFPGGe/sel_SET097+1.p_4',singleton_set_defn) ).
fof(16,axiom,
! [X1,X2] :
( member(X2,complement(X1))
<=> ( member(X2,universal_class)
& ~ member(X2,X1) ) ),
file('/tmp/tmpFFPGGe/sel_SET097+1.p_4',complement) ).
fof(20,axiom,
! [X1,X3,X2] :
( member(X2,intersection(X1,X3))
<=> ( member(X2,X1)
& member(X2,X3) ) ),
file('/tmp/tmpFFPGGe/sel_SET097+1.p_4',intersection) ).
fof(21,axiom,
! [X1,X3] :
( subclass(X1,X3)
<=> ! [X4] :
( member(X4,X1)
=> member(X4,X3) ) ),
file('/tmp/tmpFFPGGe/sel_SET097+1.p_4',subclass_defn) ).
fof(25,axiom,
! [X1] : subclass(X1,universal_class),
file('/tmp/tmpFFPGGe/sel_SET097+1.p_4',class_elements_are_sets) ).
fof(26,axiom,
! [X4,X1,X3] :
( member(X4,unordered_pair(X1,X3))
<=> ( member(X4,universal_class)
& ( equal(X4,X1)
| equal(X4,X3) ) ) ),
file('/tmp/tmpFFPGGe/sel_SET097+1.p_4',unordered_pair_defn) ).
fof(28,conjecture,
! [X1] :
( equal(X1,null_class)
| ? [X3] : equal(singleton(X3),X1)
| ? [X7] :
( member(X7,X1)
& ? [X8] : member(X8,intersection(complement(singleton(X7)),X1)) ) ),
file('/tmp/tmpFFPGGe/sel_SET097+1.p_4',number_of_elements_in_class) ).
fof(29,negated_conjecture,
~ ! [X1] :
( equal(X1,null_class)
| ? [X3] : equal(singleton(X3),X1)
| ? [X7] :
( member(X7,X1)
& ? [X8] : member(X8,intersection(complement(singleton(X7)),X1)) ) ),
inference(assume_negation,[status(cth)],[28]) ).
fof(30,plain,
! [X1] : ~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(31,plain,
! [X1,X2] :
( member(X2,complement(X1))
<=> ( member(X2,universal_class)
& ~ member(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[16,theory(equality)]) ).
fof(32,plain,
! [X2] : ~ member(X2,null_class),
inference(variable_rename,[status(thm)],[30]) ).
cnf(33,plain,
~ member(X1,null_class),
inference(split_conjunct,[status(thm)],[32]) ).
fof(60,plain,
! [X1,X3] :
( ( ~ equal(X1,X3)
| ( subclass(X1,X3)
& subclass(X3,X1) ) )
& ( ~ subclass(X1,X3)
| ~ subclass(X3,X1)
| equal(X1,X3) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(61,plain,
! [X4,X5] :
( ( ~ equal(X4,X5)
| ( subclass(X4,X5)
& subclass(X5,X4) ) )
& ( ~ subclass(X4,X5)
| ~ subclass(X5,X4)
| equal(X4,X5) ) ),
inference(variable_rename,[status(thm)],[60]) ).
fof(62,plain,
! [X4,X5] :
( ( subclass(X4,X5)
| ~ equal(X4,X5) )
& ( subclass(X5,X4)
| ~ equal(X4,X5) )
& ( ~ subclass(X4,X5)
| ~ subclass(X5,X4)
| equal(X4,X5) ) ),
inference(distribute,[status(thm)],[61]) ).
cnf(63,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[62]) ).
fof(74,plain,
! [X2] : equal(singleton(X2),unordered_pair(X2,X2)),
inference(variable_rename,[status(thm)],[10]) ).
cnf(75,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[74]) ).
fof(87,plain,
! [X1,X2] :
( ( ~ member(X2,complement(X1))
| ( member(X2,universal_class)
& ~ member(X2,X1) ) )
& ( ~ member(X2,universal_class)
| member(X2,X1)
| member(X2,complement(X1)) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(88,plain,
! [X3,X4] :
( ( ~ member(X4,complement(X3))
| ( member(X4,universal_class)
& ~ member(X4,X3) ) )
& ( ~ member(X4,universal_class)
| member(X4,X3)
| member(X4,complement(X3)) ) ),
inference(variable_rename,[status(thm)],[87]) ).
fof(89,plain,
! [X3,X4] :
( ( member(X4,universal_class)
| ~ member(X4,complement(X3)) )
& ( ~ member(X4,X3)
| ~ member(X4,complement(X3)) )
& ( ~ member(X4,universal_class)
| member(X4,X3)
| member(X4,complement(X3)) ) ),
inference(distribute,[status(thm)],[88]) ).
cnf(90,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[89]) ).
cnf(91,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[89]) ).
fof(111,plain,
! [X1,X3,X2] :
( ( ~ member(X2,intersection(X1,X3))
| ( member(X2,X1)
& member(X2,X3) ) )
& ( ~ member(X2,X1)
| ~ member(X2,X3)
| member(X2,intersection(X1,X3)) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(112,plain,
! [X4,X5,X6] :
( ( ~ member(X6,intersection(X4,X5))
| ( member(X6,X4)
& member(X6,X5) ) )
& ( ~ member(X6,X4)
| ~ member(X6,X5)
| member(X6,intersection(X4,X5)) ) ),
inference(variable_rename,[status(thm)],[111]) ).
fof(113,plain,
! [X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,intersection(X4,X5)) )
& ( member(X6,X5)
| ~ member(X6,intersection(X4,X5)) )
& ( ~ member(X6,X4)
| ~ member(X6,X5)
| member(X6,intersection(X4,X5)) ) ),
inference(distribute,[status(thm)],[112]) ).
cnf(114,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[113]) ).
cnf(115,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[113]) ).
cnf(116,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[113]) ).
fof(117,plain,
! [X1,X3] :
( ( ~ subclass(X1,X3)
| ! [X4] :
( ~ member(X4,X1)
| member(X4,X3) ) )
& ( ? [X4] :
( member(X4,X1)
& ~ member(X4,X3) )
| subclass(X1,X3) ) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(118,plain,
! [X5,X6] :
( ( ~ subclass(X5,X6)
| ! [X7] :
( ~ member(X7,X5)
| member(X7,X6) ) )
& ( ? [X8] :
( member(X8,X5)
& ~ member(X8,X6) )
| subclass(X5,X6) ) ),
inference(variable_rename,[status(thm)],[117]) ).
fof(119,plain,
! [X5,X6] :
( ( ~ subclass(X5,X6)
| ! [X7] :
( ~ member(X7,X5)
| member(X7,X6) ) )
& ( ( member(esk4_2(X5,X6),X5)
& ~ member(esk4_2(X5,X6),X6) )
| subclass(X5,X6) ) ),
inference(skolemize,[status(esa)],[118]) ).
fof(120,plain,
! [X5,X6,X7] :
( ( ~ member(X7,X5)
| member(X7,X6)
| ~ subclass(X5,X6) )
& ( ( member(esk4_2(X5,X6),X5)
& ~ member(esk4_2(X5,X6),X6) )
| subclass(X5,X6) ) ),
inference(shift_quantors,[status(thm)],[119]) ).
fof(121,plain,
! [X5,X6,X7] :
( ( ~ member(X7,X5)
| member(X7,X6)
| ~ subclass(X5,X6) )
& ( member(esk4_2(X5,X6),X5)
| subclass(X5,X6) )
& ( ~ member(esk4_2(X5,X6),X6)
| subclass(X5,X6) ) ),
inference(distribute,[status(thm)],[120]) ).
cnf(122,plain,
( subclass(X1,X2)
| ~ member(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(123,plain,
( subclass(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(124,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[121]) ).
fof(135,plain,
! [X2] : subclass(X2,universal_class),
inference(variable_rename,[status(thm)],[25]) ).
cnf(136,plain,
subclass(X1,universal_class),
inference(split_conjunct,[status(thm)],[135]) ).
fof(137,plain,
! [X4,X1,X3] :
( ( ~ member(X4,unordered_pair(X1,X3))
| ( member(X4,universal_class)
& ( equal(X4,X1)
| equal(X4,X3) ) ) )
& ( ~ member(X4,universal_class)
| ( ~ equal(X4,X1)
& ~ equal(X4,X3) )
| member(X4,unordered_pair(X1,X3)) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(138,plain,
! [X5,X6,X7] :
( ( ~ member(X5,unordered_pair(X6,X7))
| ( member(X5,universal_class)
& ( equal(X5,X6)
| equal(X5,X7) ) ) )
& ( ~ member(X5,universal_class)
| ( ~ equal(X5,X6)
& ~ equal(X5,X7) )
| member(X5,unordered_pair(X6,X7)) ) ),
inference(variable_rename,[status(thm)],[137]) ).
fof(139,plain,
! [X5,X6,X7] :
( ( member(X5,universal_class)
| ~ member(X5,unordered_pair(X6,X7)) )
& ( equal(X5,X6)
| equal(X5,X7)
| ~ member(X5,unordered_pair(X6,X7)) )
& ( ~ equal(X5,X6)
| ~ member(X5,universal_class)
| member(X5,unordered_pair(X6,X7)) )
& ( ~ equal(X5,X7)
| ~ member(X5,universal_class)
| member(X5,unordered_pair(X6,X7)) ) ),
inference(distribute,[status(thm)],[138]) ).
cnf(142,plain,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[139]) ).
fof(147,negated_conjecture,
? [X1] :
( ~ equal(X1,null_class)
& ! [X3] : ~ equal(singleton(X3),X1)
& ! [X7] :
( ~ member(X7,X1)
| ! [X8] : ~ member(X8,intersection(complement(singleton(X7)),X1)) ) ),
inference(fof_nnf,[status(thm)],[29]) ).
fof(148,negated_conjecture,
? [X9] :
( ~ equal(X9,null_class)
& ! [X10] : ~ equal(singleton(X10),X9)
& ! [X11] :
( ~ member(X11,X9)
| ! [X12] : ~ member(X12,intersection(complement(singleton(X11)),X9)) ) ),
inference(variable_rename,[status(thm)],[147]) ).
fof(149,negated_conjecture,
( ~ equal(esk5_0,null_class)
& ! [X10] : ~ equal(singleton(X10),esk5_0)
& ! [X11] :
( ~ member(X11,esk5_0)
| ! [X12] : ~ member(X12,intersection(complement(singleton(X11)),esk5_0)) ) ),
inference(skolemize,[status(esa)],[148]) ).
fof(150,negated_conjecture,
! [X10,X11,X12] :
( ( ~ member(X12,intersection(complement(singleton(X11)),esk5_0))
| ~ member(X11,esk5_0) )
& ~ equal(singleton(X10),esk5_0)
& ~ equal(esk5_0,null_class) ),
inference(shift_quantors,[status(thm)],[149]) ).
cnf(151,negated_conjecture,
esk5_0 != null_class,
inference(split_conjunct,[status(thm)],[150]) ).
cnf(152,negated_conjecture,
singleton(X1) != esk5_0,
inference(split_conjunct,[status(thm)],[150]) ).
cnf(153,negated_conjecture,
( ~ member(X1,esk5_0)
| ~ member(X2,intersection(complement(singleton(X1)),esk5_0)) ),
inference(split_conjunct,[status(thm)],[150]) ).
cnf(159,negated_conjecture,
unordered_pair(X1,X1) != esk5_0,
inference(rw,[status(thm)],[152,75,theory(equality)]),
[unfolding] ).
cnf(161,negated_conjecture,
( ~ member(X1,esk5_0)
| ~ member(X2,intersection(complement(unordered_pair(X1,X1)),esk5_0)) ),
inference(rw,[status(thm)],[153,75,theory(equality)]),
[unfolding] ).
cnf(192,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[124,136,theory(equality)]) ).
cnf(207,plain,
subclass(null_class,X1),
inference(spm,[status(thm)],[33,123,theory(equality)]) ).
cnf(209,plain,
( subclass(complement(X1),X2)
| ~ member(esk4_2(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[91,123,theory(equality)]) ).
cnf(210,plain,
( member(esk4_2(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[115,123,theory(equality)]) ).
cnf(211,plain,
( member(esk4_2(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[116,123,theory(equality)]) ).
cnf(214,plain,
( esk4_2(unordered_pair(X1,X2),X3) = X1
| esk4_2(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[142,123,theory(equality)]) ).
cnf(216,plain,
( subclass(X1,complement(X2))
| member(esk4_2(X1,complement(X2)),X2)
| ~ member(esk4_2(X1,complement(X2)),universal_class) ),
inference(spm,[status(thm)],[122,90,theory(equality)]) ).
cnf(229,negated_conjecture,
( ~ member(X2,esk5_0)
| ~ member(X1,esk5_0)
| ~ member(X1,complement(unordered_pair(X2,X2))) ),
inference(spm,[status(thm)],[161,114,theory(equality)]) ).
cnf(283,plain,
( X1 = null_class
| ~ subclass(X1,null_class) ),
inference(spm,[status(thm)],[63,207,theory(equality)]) ).
cnf(306,plain,
( member(esk4_2(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[192,123,theory(equality)]) ).
cnf(320,negated_conjecture,
( member(X1,unordered_pair(X2,X2))
| ~ member(X2,esk5_0)
| ~ member(X1,esk5_0)
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[229,90,theory(equality)]) ).
cnf(324,negated_conjecture,
( member(X1,unordered_pair(X2,X2))
| ~ member(X2,esk5_0)
| ~ member(X1,esk5_0) ),
inference(csr,[status(thm)],[320,192]) ).
cnf(325,negated_conjecture,
( X1 = X2
| ~ member(X2,esk5_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[142,324,theory(equality)]) ).
cnf(327,negated_conjecture,
( subclass(X1,unordered_pair(X2,X2))
| ~ member(X2,esk5_0)
| ~ member(esk4_2(X1,unordered_pair(X2,X2)),esk5_0) ),
inference(spm,[status(thm)],[122,324,theory(equality)]) ).
cnf(329,negated_conjecture,
( X1 = esk4_2(esk5_0,X2)
| subclass(esk5_0,X2)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[325,123,theory(equality)]) ).
cnf(340,plain,
( subclass(complement(complement(X1)),X2)
| member(esk4_2(complement(complement(X1)),X2),X1)
| ~ member(esk4_2(complement(complement(X1)),X2),universal_class) ),
inference(spm,[status(thm)],[209,90,theory(equality)]) ).
cnf(346,negated_conjecture,
( esk4_2(esk5_0,X1) = esk4_2(esk5_0,X2)
| subclass(esk5_0,X2)
| subclass(esk5_0,X1) ),
inference(spm,[status(thm)],[329,123,theory(equality)]) ).
cnf(411,negated_conjecture,
( subclass(esk5_0,X1)
| subclass(esk5_0,X2)
| ~ member(esk4_2(esk5_0,X2),X1) ),
inference(spm,[status(thm)],[122,346,theory(equality)]) ).
cnf(470,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[122,210,theory(equality)]) ).
cnf(500,plain,
( X1 = intersection(X2,X1)
| ~ subclass(X1,intersection(X2,X1)) ),
inference(spm,[status(thm)],[63,470,theory(equality)]) ).
cnf(579,plain,
subclass(intersection(null_class,X1),X2),
inference(spm,[status(thm)],[33,211,theory(equality)]) ).
cnf(585,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[122,211,theory(equality)]) ).
cnf(609,plain,
intersection(null_class,X1) = null_class,
inference(spm,[status(thm)],[283,579,theory(equality)]) ).
cnf(614,plain,
( X1 = intersection(X1,X2)
| ~ subclass(X1,intersection(X1,X2)) ),
inference(spm,[status(thm)],[63,585,theory(equality)]) ).
cnf(681,plain,
( esk4_2(unordered_pair(X4,X5),X6) = X4
| subclass(unordered_pair(X4,X5),X6)
| X5 != X4 ),
inference(ef,[status(thm)],[214,theory(equality)]) ).
cnf(690,plain,
( esk4_2(unordered_pair(X1,X1),X2) = X1
| subclass(unordered_pair(X1,X1),X2) ),
inference(er,[status(thm)],[681,theory(equality)]) ).
cnf(777,plain,
( subclass(X1,complement(X2))
| member(esk4_2(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[216,306]) ).
cnf(780,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(esk4_2(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[91,777,theory(equality)]) ).
cnf(798,negated_conjecture,
( subclass(esk5_0,complement(X1))
| subclass(esk5_0,X1) ),
inference(spm,[status(thm)],[411,777,theory(equality)]) ).
cnf(828,negated_conjecture,
( complement(X1) = esk5_0
| subclass(esk5_0,X1)
| ~ subclass(complement(X1),esk5_0) ),
inference(spm,[status(thm)],[63,798,theory(equality)]) ).
cnf(1070,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[780,123,theory(equality)]) ).
cnf(1076,plain,
subclass(intersection(X1,X2),complement(complement(X1))),
inference(spm,[status(thm)],[780,211,theory(equality)]) ).
cnf(1090,plain,
( complement(complement(X1)) = X1
| ~ subclass(complement(complement(X1)),X1) ),
inference(spm,[status(thm)],[63,1070,theory(equality)]) ).
cnf(1118,plain,
( member(X1,complement(complement(X2)))
| ~ member(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[124,1076,theory(equality)]) ).
cnf(1186,plain,
( member(esk4_2(intersection(X1,X2),X3),complement(complement(X1)))
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[1118,123,theory(equality)]) ).
cnf(1451,plain,
subclass(intersection(X1,X2),complement(complement(complement(complement(X1))))),
inference(spm,[status(thm)],[780,1186,theory(equality)]) ).
cnf(1472,plain,
( member(X1,complement(complement(complement(complement(X2)))))
| ~ member(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[124,1451,theory(equality)]) ).
cnf(1488,plain,
( member(esk4_2(intersection(X1,X2),X3),complement(complement(complement(complement(X1)))))
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[1472,123,theory(equality)]) ).
cnf(3110,plain,
subclass(intersection(X1,X2),complement(complement(complement(complement(complement(complement(X1))))))),
inference(spm,[status(thm)],[780,1488,theory(equality)]) ).
cnf(4387,negated_conjecture,
( subclass(esk5_0,unordered_pair(X1,X1))
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[327,123,theory(equality)]) ).
cnf(4395,negated_conjecture,
( unordered_pair(X1,X1) = esk5_0
| ~ subclass(unordered_pair(X1,X1),esk5_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[63,4387,theory(equality)]) ).
cnf(4397,negated_conjecture,
( ~ subclass(unordered_pair(X1,X1),esk5_0)
| ~ member(X1,esk5_0) ),
inference(sr,[status(thm)],[4395,159,theory(equality)]) ).
cnf(4483,plain,
( subclass(complement(complement(X1)),X2)
| member(esk4_2(complement(complement(X1)),X2),X1) ),
inference(csr,[status(thm)],[340,306]) ).
cnf(4492,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[122,4483,theory(equality)]) ).
cnf(4589,plain,
( complement(complement(X1)) = X1
| $false ),
inference(rw,[status(thm)],[1090,4492,theory(equality)]) ).
cnf(4590,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[4589,theory(equality)]) ).
cnf(4609,plain,
( subclass(X1,X2)
| member(esk4_2(X1,X2),complement(X2)) ),
inference(spm,[status(thm)],[777,4590,theory(equality)]) ).
cnf(4612,negated_conjecture,
( X1 = esk5_0
| subclass(esk5_0,complement(X1))
| ~ subclass(X1,esk5_0) ),
inference(spm,[status(thm)],[828,4590,theory(equality)]) ).
cnf(4627,plain,
subclass(intersection(X1,X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3110,4590,theory(equality)]),4590,theory(equality)]),4590,theory(equality)]) ).
cnf(5561,negated_conjecture,
( member(X1,complement(X2))
| X2 = esk5_0
| ~ member(X1,esk5_0)
| ~ subclass(X2,esk5_0) ),
inference(spm,[status(thm)],[124,4612,theory(equality)]) ).
cnf(5573,negated_conjecture,
( X2 = esk5_0
| ~ member(X1,X2)
| ~ subclass(X2,esk5_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[91,5561,theory(equality)]) ).
cnf(5772,negated_conjecture,
( X2 = esk5_0
| ~ subclass(X2,esk5_0)
| ~ member(X1,X2) ),
inference(csr,[status(thm)],[5573,124]) ).
cnf(5774,negated_conjecture,
( intersection(X1,esk5_0) = esk5_0
| ~ member(X2,intersection(X1,esk5_0)) ),
inference(spm,[status(thm)],[5772,470,theory(equality)]) ).
cnf(5775,negated_conjecture,
( intersection(esk5_0,X1) = esk5_0
| ~ member(X2,intersection(esk5_0,X1)) ),
inference(spm,[status(thm)],[5772,4627,theory(equality)]) ).
cnf(5784,negated_conjecture,
( intersection(X1,esk5_0) = esk5_0
| subclass(intersection(X1,esk5_0),X2) ),
inference(spm,[status(thm)],[5774,123,theory(equality)]) ).
cnf(5810,negated_conjecture,
( intersection(esk5_0,X1) = esk5_0
| subclass(intersection(esk5_0,X1),X2) ),
inference(spm,[status(thm)],[5775,123,theory(equality)]) ).
cnf(5867,negated_conjecture,
( intersection(X1,intersection(X2,esk5_0)) = intersection(X2,esk5_0)
| intersection(X2,esk5_0) = esk5_0 ),
inference(spm,[status(thm)],[500,5784,theory(equality)]) ).
cnf(6196,negated_conjecture,
( intersection(esk5_0,X1) = null_class
| intersection(esk5_0,X1) = esk5_0 ),
inference(spm,[status(thm)],[283,5810,theory(equality)]) ).
cnf(6284,negated_conjecture,
( esk5_0 = intersection(X1,esk5_0)
| intersection(esk5_0,intersection(X1,esk5_0)) = null_class ),
inference(spm,[status(thm)],[5867,6196,theory(equality)]) ).
cnf(6316,negated_conjecture,
( null_class = esk5_0
| intersection(X1,esk5_0) = esk5_0
| ~ subclass(esk5_0,null_class) ),
inference(spm,[status(thm)],[614,6284,theory(equality)]) ).
cnf(6368,negated_conjecture,
( intersection(X1,esk5_0) = esk5_0
| ~ subclass(esk5_0,null_class) ),
inference(sr,[status(thm)],[6316,151,theory(equality)]) ).
cnf(6421,negated_conjecture,
( esk5_0 = null_class
| ~ subclass(esk5_0,null_class) ),
inference(spm,[status(thm)],[609,6368,theory(equality)]) ).
cnf(6494,negated_conjecture,
~ subclass(esk5_0,null_class),
inference(sr,[status(thm)],[6421,151,theory(equality)]) ).
cnf(21531,plain,
( subclass(unordered_pair(X1,X1),X2)
| member(X1,complement(X2)) ),
inference(spm,[status(thm)],[4609,690,theory(equality)]) ).
cnf(21556,negated_conjecture,
( member(X1,complement(esk5_0))
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[4397,21531,theory(equality)]) ).
cnf(21580,negated_conjecture,
~ member(X1,esk5_0),
inference(csr,[status(thm)],[21556,91]) ).
cnf(21581,negated_conjecture,
subclass(esk5_0,X1),
inference(spm,[status(thm)],[21580,123,theory(equality)]) ).
cnf(21612,negated_conjecture,
$false,
inference(rw,[status(thm)],[6494,21581,theory(equality)]) ).
cnf(21613,negated_conjecture,
$false,
inference(cn,[status(thm)],[21612,theory(equality)]) ).
cnf(21614,negated_conjecture,
$false,
21613,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET097+1.p
% --creating new selector for [SET005+0.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpFFPGGe/sel_SET097+1.p_1 with time limit 29
% -running prover with command ['/davis/home/graph/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/tmp/tmpFFPGGe/sel_SET097+1.p_1']
% -prover status ResourceOut
% -running prover on /tmp/tmpFFPGGe/sel_SET097+1.p_2 with time limit 81
% -running prover with command ['/davis/home/graph/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=81', '/tmp/tmpFFPGGe/sel_SET097+1.p_2']
% -prover status ResourceOut
% --creating new selector for [SET005+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpFFPGGe/sel_SET097+1.p_3 with time limit 75
% -running prover with command ['/davis/home/graph/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=75', '/tmp/tmpFFPGGe/sel_SET097+1.p_3']
% -prover status ResourceOut
% --creating new selector for [SET005+0.ax]
% -running prover on /tmp/tmpFFPGGe/sel_SET097+1.p_4 with time limit 56
% -running prover with command ['/davis/home/graph/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=56', '/tmp/tmpFFPGGe/sel_SET097+1.p_4']
% -prover status Theorem
% Problem SET097+1.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET097+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET097+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------