%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU236+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 06:05:31 EST 2010
% Result : Theorem 0.31s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 10
% Syntax : Number of formulae : 92 ( 13 unt; 0 def)
% Number of atoms : 346 ( 42 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 419 ( 165 ~; 168 |; 68 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 127 ( 0 sgn 82 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/tmp/tmpR7PRTv/sel_SEU236+1.p_1',cc1_ordinal1) ).
fof(6,axiom,
! [X1] : in(X1,succ(X1)),
file('/tmp/tmpR7PRTv/sel_SEU236+1.p_1',t10_ordinal1) ).
fof(8,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
file('/tmp/tmpR7PRTv/sel_SEU236+1.p_1',t33_ordinal1) ).
fof(22,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/tmp/tmpR7PRTv/sel_SEU236+1.p_1',d2_ordinal1) ).
fof(23,axiom,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
file('/tmp/tmpR7PRTv/sel_SEU236+1.p_1',fc3_ordinal1) ).
fof(28,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/tmp/tmpR7PRTv/sel_SEU236+1.p_1',redefinition_r1_ordinal1) ).
fof(29,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/tmp/tmpR7PRTv/sel_SEU236+1.p_1',d1_ordinal1) ).
fof(47,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/tmp/tmpR7PRTv/sel_SEU236+1.p_1',t8_xboole_1) ).
fof(52,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/tmp/tmpR7PRTv/sel_SEU236+1.p_1',d1_tarski) ).
fof(56,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/tmp/tmpR7PRTv/sel_SEU236+1.p_1',d3_tarski) ).
fof(58,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
inference(assume_negation,[status(cth)],[8]) ).
fof(63,plain,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
inference(fof_simplification,[status(thm)],[23,theory(equality)]) ).
fof(75,plain,
! [X1] :
( ~ ordinal(X1)
| ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(76,plain,
! [X2] :
( ~ ordinal(X2)
| ( epsilon_transitive(X2)
& epsilon_connected(X2) ) ),
inference(variable_rename,[status(thm)],[75]) ).
fof(77,plain,
! [X2] :
( ( epsilon_transitive(X2)
| ~ ordinal(X2) )
& ( epsilon_connected(X2)
| ~ ordinal(X2) ) ),
inference(distribute,[status(thm)],[76]) ).
cnf(79,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[77]) ).
fof(86,plain,
! [X2] : in(X2,succ(X2)),
inference(variable_rename,[status(thm)],[6]) ).
cnf(87,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[86]) ).
fof(91,negated_conjecture,
? [X1] :
( ordinal(X1)
& ? [X2] :
( ordinal(X2)
& ( ~ in(X1,X2)
| ~ ordinal_subset(succ(X1),X2) )
& ( in(X1,X2)
| ordinal_subset(succ(X1),X2) ) ) ),
inference(fof_nnf,[status(thm)],[58]) ).
fof(92,negated_conjecture,
? [X3] :
( ordinal(X3)
& ? [X4] :
( ordinal(X4)
& ( ~ in(X3,X4)
| ~ ordinal_subset(succ(X3),X4) )
& ( in(X3,X4)
| ordinal_subset(succ(X3),X4) ) ) ),
inference(variable_rename,[status(thm)],[91]) ).
fof(93,negated_conjecture,
( ordinal(esk3_0)
& ordinal(esk4_0)
& ( ~ in(esk3_0,esk4_0)
| ~ ordinal_subset(succ(esk3_0),esk4_0) )
& ( in(esk3_0,esk4_0)
| ordinal_subset(succ(esk3_0),esk4_0) ) ),
inference(skolemize,[status(esa)],[92]) ).
cnf(94,negated_conjecture,
( ordinal_subset(succ(esk3_0),esk4_0)
| in(esk3_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[93]) ).
cnf(95,negated_conjecture,
( ~ ordinal_subset(succ(esk3_0),esk4_0)
| ~ in(esk3_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[93]) ).
cnf(96,negated_conjecture,
ordinal(esk4_0),
inference(split_conjunct,[status(thm)],[93]) ).
cnf(97,negated_conjecture,
ordinal(esk3_0),
inference(split_conjunct,[status(thm)],[93]) ).
fof(144,plain,
! [X1] :
( ( ~ epsilon_transitive(X1)
| ! [X2] :
( ~ in(X2,X1)
| subset(X2,X1) ) )
& ( ? [X2] :
( in(X2,X1)
& ~ subset(X2,X1) )
| epsilon_transitive(X1) ) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(145,plain,
! [X3] :
( ( ~ epsilon_transitive(X3)
| ! [X4] :
( ~ in(X4,X3)
| subset(X4,X3) ) )
& ( ? [X5] :
( in(X5,X3)
& ~ subset(X5,X3) )
| epsilon_transitive(X3) ) ),
inference(variable_rename,[status(thm)],[144]) ).
fof(146,plain,
! [X3] :
( ( ~ epsilon_transitive(X3)
| ! [X4] :
( ~ in(X4,X3)
| subset(X4,X3) ) )
& ( ( in(esk8_1(X3),X3)
& ~ subset(esk8_1(X3),X3) )
| epsilon_transitive(X3) ) ),
inference(skolemize,[status(esa)],[145]) ).
fof(147,plain,
! [X3,X4] :
( ( ~ in(X4,X3)
| subset(X4,X3)
| ~ epsilon_transitive(X3) )
& ( ( in(esk8_1(X3),X3)
& ~ subset(esk8_1(X3),X3) )
| epsilon_transitive(X3) ) ),
inference(shift_quantors,[status(thm)],[146]) ).
fof(148,plain,
! [X3,X4] :
( ( ~ in(X4,X3)
| subset(X4,X3)
| ~ epsilon_transitive(X3) )
& ( in(esk8_1(X3),X3)
| epsilon_transitive(X3) )
& ( ~ subset(esk8_1(X3),X3)
| epsilon_transitive(X3) ) ),
inference(distribute,[status(thm)],[147]) ).
cnf(151,plain,
( subset(X2,X1)
| ~ epsilon_transitive(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[148]) ).
fof(152,plain,
! [X1] :
( ~ ordinal(X1)
| ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
inference(fof_nnf,[status(thm)],[63]) ).
fof(153,plain,
! [X2] :
( ~ ordinal(X2)
| ( ~ empty(succ(X2))
& epsilon_transitive(succ(X2))
& epsilon_connected(succ(X2))
& ordinal(succ(X2)) ) ),
inference(variable_rename,[status(thm)],[152]) ).
fof(154,plain,
! [X2] :
( ( ~ empty(succ(X2))
| ~ ordinal(X2) )
& ( epsilon_transitive(succ(X2))
| ~ ordinal(X2) )
& ( epsilon_connected(succ(X2))
| ~ ordinal(X2) )
& ( ordinal(succ(X2))
| ~ ordinal(X2) ) ),
inference(distribute,[status(thm)],[153]) ).
cnf(155,plain,
( ordinal(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[154]) ).
fof(173,plain,
! [X1,X2] :
( ~ ordinal(X1)
| ~ ordinal(X2)
| ( ( ~ ordinal_subset(X1,X2)
| subset(X1,X2) )
& ( ~ subset(X1,X2)
| ordinal_subset(X1,X2) ) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(174,plain,
! [X3,X4] :
( ~ ordinal(X3)
| ~ ordinal(X4)
| ( ( ~ ordinal_subset(X3,X4)
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| ordinal_subset(X3,X4) ) ) ),
inference(variable_rename,[status(thm)],[173]) ).
fof(175,plain,
! [X3,X4] :
( ( ~ ordinal_subset(X3,X4)
| subset(X3,X4)
| ~ ordinal(X3)
| ~ ordinal(X4) )
& ( ~ subset(X3,X4)
| ordinal_subset(X3,X4)
| ~ ordinal(X3)
| ~ ordinal(X4) ) ),
inference(distribute,[status(thm)],[174]) ).
cnf(176,plain,
( ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[175]) ).
cnf(177,plain,
( subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ ordinal_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[175]) ).
fof(178,plain,
! [X2] : succ(X2) = set_union2(X2,singleton(X2)),
inference(variable_rename,[status(thm)],[29]) ).
cnf(179,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[178]) ).
fof(231,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| ~ subset(X3,X2)
| subset(set_union2(X1,X3),X2) ),
inference(fof_nnf,[status(thm)],[47]) ).
fof(232,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X6,X5)
| subset(set_union2(X4,X6),X5) ),
inference(variable_rename,[status(thm)],[231]) ).
cnf(233,plain,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[232]) ).
fof(243,plain,
! [X1,X2] :
( ( X2 != singleton(X1)
| ! [X3] :
( ( ~ in(X3,X2)
| X3 = X1 )
& ( X3 != X1
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( ~ in(X3,X2)
| X3 != X1 )
& ( in(X3,X2)
| X3 = X1 ) )
| X2 = singleton(X1) ) ),
inference(fof_nnf,[status(thm)],[52]) ).
fof(244,plain,
! [X4,X5] :
( ( X5 != singleton(X4)
| ! [X6] :
( ( ~ in(X6,X5)
| X6 = X4 )
& ( X6 != X4
| in(X6,X5) ) ) )
& ( ? [X7] :
( ( ~ in(X7,X5)
| X7 != X4 )
& ( in(X7,X5)
| X7 = X4 ) )
| X5 = singleton(X4) ) ),
inference(variable_rename,[status(thm)],[243]) ).
fof(245,plain,
! [X4,X5] :
( ( X5 != singleton(X4)
| ! [X6] :
( ( ~ in(X6,X5)
| X6 = X4 )
& ( X6 != X4
| in(X6,X5) ) ) )
& ( ( ( ~ in(esk13_2(X4,X5),X5)
| esk13_2(X4,X5) != X4 )
& ( in(esk13_2(X4,X5),X5)
| esk13_2(X4,X5) = X4 ) )
| X5 = singleton(X4) ) ),
inference(skolemize,[status(esa)],[244]) ).
fof(246,plain,
! [X4,X5,X6] :
( ( ( ( ~ in(X6,X5)
| X6 = X4 )
& ( X6 != X4
| in(X6,X5) ) )
| X5 != singleton(X4) )
& ( ( ( ~ in(esk13_2(X4,X5),X5)
| esk13_2(X4,X5) != X4 )
& ( in(esk13_2(X4,X5),X5)
| esk13_2(X4,X5) = X4 ) )
| X5 = singleton(X4) ) ),
inference(shift_quantors,[status(thm)],[245]) ).
fof(247,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X6 != X4
| in(X6,X5)
| X5 != singleton(X4) )
& ( ~ in(esk13_2(X4,X5),X5)
| esk13_2(X4,X5) != X4
| X5 = singleton(X4) )
& ( in(esk13_2(X4,X5),X5)
| esk13_2(X4,X5) = X4
| X5 = singleton(X4) ) ),
inference(distribute,[status(thm)],[246]) ).
cnf(251,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[247]) ).
fof(264,plain,
! [X1,X2] :
( ( ~ subset(X1,X2)
| ! [X3] :
( ~ in(X3,X1)
| in(X3,X2) ) )
& ( ? [X3] :
( in(X3,X1)
& ~ in(X3,X2) )
| subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[56]) ).
fof(265,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ? [X7] :
( in(X7,X4)
& ~ in(X7,X5) )
| subset(X4,X5) ) ),
inference(variable_rename,[status(thm)],[264]) ).
fof(266,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ( in(esk17_2(X4,X5),X4)
& ~ in(esk17_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[265]) ).
fof(267,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( ( in(esk17_2(X4,X5),X4)
& ~ in(esk17_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[266]) ).
fof(268,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( in(esk17_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk17_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[267]) ).
cnf(269,plain,
( subset(X1,X2)
| ~ in(esk17_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[268]) ).
cnf(270,plain,
( subset(X1,X2)
| in(esk17_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[268]) ).
cnf(271,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[268]) ).
cnf(277,plain,
in(X1,set_union2(X1,singleton(X1))),
inference(rw,[status(thm)],[87,179,theory(equality)]),
[unfolding] ).
cnf(278,negated_conjecture,
( in(esk3_0,esk4_0)
| ordinal_subset(set_union2(esk3_0,singleton(esk3_0)),esk4_0) ),
inference(rw,[status(thm)],[94,179,theory(equality)]),
[unfolding] ).
cnf(281,plain,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[155,179,theory(equality)]),
[unfolding] ).
cnf(284,negated_conjecture,
( ~ in(esk3_0,esk4_0)
| ~ ordinal_subset(set_union2(esk3_0,singleton(esk3_0)),esk4_0) ),
inference(rw,[status(thm)],[95,179,theory(equality)]),
[unfolding] ).
cnf(361,negated_conjecture,
( ~ in(esk3_0,esk4_0)
| ~ subset(set_union2(esk3_0,singleton(esk3_0)),esk4_0)
| ~ ordinal(set_union2(esk3_0,singleton(esk3_0)))
| ~ ordinal(esk4_0) ),
inference(spm,[status(thm)],[284,176,theory(equality)]) ).
cnf(362,negated_conjecture,
( ~ in(esk3_0,esk4_0)
| ~ subset(set_union2(esk3_0,singleton(esk3_0)),esk4_0)
| ~ ordinal(set_union2(esk3_0,singleton(esk3_0)))
| $false ),
inference(rw,[status(thm)],[361,96,theory(equality)]) ).
cnf(363,negated_conjecture,
( ~ in(esk3_0,esk4_0)
| ~ subset(set_union2(esk3_0,singleton(esk3_0)),esk4_0)
| ~ ordinal(set_union2(esk3_0,singleton(esk3_0))) ),
inference(cn,[status(thm)],[362,theory(equality)]) ).
cnf(364,negated_conjecture,
( subset(set_union2(esk3_0,singleton(esk3_0)),esk4_0)
| in(esk3_0,esk4_0)
| ~ ordinal(set_union2(esk3_0,singleton(esk3_0)))
| ~ ordinal(esk4_0) ),
inference(spm,[status(thm)],[177,278,theory(equality)]) ).
cnf(366,negated_conjecture,
( subset(set_union2(esk3_0,singleton(esk3_0)),esk4_0)
| in(esk3_0,esk4_0)
| ~ ordinal(set_union2(esk3_0,singleton(esk3_0)))
| $false ),
inference(rw,[status(thm)],[364,96,theory(equality)]) ).
cnf(367,negated_conjecture,
( subset(set_union2(esk3_0,singleton(esk3_0)),esk4_0)
| in(esk3_0,esk4_0)
| ~ ordinal(set_union2(esk3_0,singleton(esk3_0))) ),
inference(cn,[status(thm)],[366,theory(equality)]) ).
cnf(370,plain,
( X1 = esk17_2(X2,X3)
| subset(X2,X3)
| singleton(X1) != X2 ),
inference(spm,[status(thm)],[251,270,theory(equality)]) ).
cnf(380,plain,
( subset(X1,X2)
| ~ in(X1,X2)
| ~ ordinal(X2) ),
inference(spm,[status(thm)],[151,79,theory(equality)]) ).
cnf(542,negated_conjecture,
( ~ in(esk3_0,esk4_0)
| ~ ordinal(set_union2(esk3_0,singleton(esk3_0)))
| ~ subset(singleton(esk3_0),esk4_0)
| ~ subset(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[363,233,theory(equality)]) ).
cnf(573,negated_conjecture,
( ~ subset(singleton(esk3_0),esk4_0)
| ~ subset(esk3_0,esk4_0)
| ~ in(esk3_0,esk4_0)
| ~ ordinal(esk3_0) ),
inference(spm,[status(thm)],[542,281,theory(equality)]) ).
cnf(574,negated_conjecture,
( ~ subset(singleton(esk3_0),esk4_0)
| ~ subset(esk3_0,esk4_0)
| ~ in(esk3_0,esk4_0)
| $false ),
inference(rw,[status(thm)],[573,97,theory(equality)]) ).
cnf(575,negated_conjecture,
( ~ subset(singleton(esk3_0),esk4_0)
| ~ subset(esk3_0,esk4_0)
| ~ in(esk3_0,esk4_0) ),
inference(cn,[status(thm)],[574,theory(equality)]) ).
cnf(704,negated_conjecture,
( in(X1,esk4_0)
| in(esk3_0,esk4_0)
| ~ in(X1,set_union2(esk3_0,singleton(esk3_0)))
| ~ ordinal(set_union2(esk3_0,singleton(esk3_0))) ),
inference(spm,[status(thm)],[271,367,theory(equality)]) ).
cnf(724,plain,
( X1 = esk17_2(singleton(X1),X2)
| subset(singleton(X1),X2) ),
inference(er,[status(thm)],[370,theory(equality)]) ).
cnf(1040,negated_conjecture,
( in(esk3_0,esk4_0)
| ~ ordinal(set_union2(esk3_0,singleton(esk3_0))) ),
inference(spm,[status(thm)],[704,277,theory(equality)]) ).
cnf(1047,negated_conjecture,
( in(esk3_0,esk4_0)
| ~ ordinal(esk3_0) ),
inference(spm,[status(thm)],[1040,281,theory(equality)]) ).
cnf(1048,negated_conjecture,
( in(esk3_0,esk4_0)
| $false ),
inference(rw,[status(thm)],[1047,97,theory(equality)]) ).
cnf(1049,negated_conjecture,
in(esk3_0,esk4_0),
inference(cn,[status(thm)],[1048,theory(equality)]) ).
cnf(1059,negated_conjecture,
( ~ subset(singleton(esk3_0),esk4_0)
| ~ subset(esk3_0,esk4_0)
| $false ),
inference(rw,[status(thm)],[575,1049,theory(equality)]) ).
cnf(1060,negated_conjecture,
( ~ subset(singleton(esk3_0),esk4_0)
| ~ subset(esk3_0,esk4_0) ),
inference(cn,[status(thm)],[1059,theory(equality)]) ).
cnf(1217,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[269,724,theory(equality)]) ).
cnf(1226,negated_conjecture,
( ~ subset(esk3_0,esk4_0)
| ~ in(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[1060,1217,theory(equality)]) ).
cnf(1227,negated_conjecture,
( ~ subset(esk3_0,esk4_0)
| $false ),
inference(rw,[status(thm)],[1226,1049,theory(equality)]) ).
cnf(1228,negated_conjecture,
~ subset(esk3_0,esk4_0),
inference(cn,[status(thm)],[1227,theory(equality)]) ).
cnf(1231,negated_conjecture,
( ~ in(esk3_0,esk4_0)
| ~ ordinal(esk4_0) ),
inference(spm,[status(thm)],[1228,380,theory(equality)]) ).
cnf(1237,negated_conjecture,
( $false
| ~ ordinal(esk4_0) ),
inference(rw,[status(thm)],[1231,1049,theory(equality)]) ).
cnf(1238,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[1237,96,theory(equality)]) ).
cnf(1239,negated_conjecture,
$false,
inference(cn,[status(thm)],[1238,theory(equality)]) ).
cnf(1240,negated_conjecture,
$false,
1239,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU236+1.p
% --creating new selector for []
% -running prover on /tmp/tmpR7PRTv/sel_SEU236+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU236+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU236+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU236+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
%
%------------------------------------------------------------------------------