TSTP Solution File: SEU236+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU236+3 : TPTP v5.0.0. Released v3.2.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:54 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% 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/tmpXo5Kgx/sel_SEU236+3.p_1',cc1_ordinal1) ).
fof(6,axiom,
! [X1] : in(X1,succ(X1)),
file('/tmp/tmpXo5Kgx/sel_SEU236+3.p_1',t10_ordinal1) ).
fof(8,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
file('/tmp/tmpXo5Kgx/sel_SEU236+3.p_1',t33_ordinal1) ).
fof(22,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/tmp/tmpXo5Kgx/sel_SEU236+3.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/tmpXo5Kgx/sel_SEU236+3.p_1',fc3_ordinal1) ).
fof(28,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/tmp/tmpXo5Kgx/sel_SEU236+3.p_1',redefinition_r1_ordinal1) ).
fof(29,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/tmp/tmpXo5Kgx/sel_SEU236+3.p_1',d1_ordinal1) ).
fof(43,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/tmp/tmpXo5Kgx/sel_SEU236+3.p_1',t8_xboole_1) ).
fof(47,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/tmp/tmpXo5Kgx/sel_SEU236+3.p_1',d1_tarski) ).
fof(51,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/tmp/tmpXo5Kgx/sel_SEU236+3.p_1',d3_tarski) ).
fof(53,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
inference(assume_negation,[status(cth)],[8]) ).
fof(58,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(70,plain,
! [X1] :
( ~ ordinal(X1)
| ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(71,plain,
! [X2] :
( ~ ordinal(X2)
| ( epsilon_transitive(X2)
& epsilon_connected(X2) ) ),
inference(variable_rename,[status(thm)],[70]) ).
fof(72,plain,
! [X2] :
( ( epsilon_transitive(X2)
| ~ ordinal(X2) )
& ( epsilon_connected(X2)
| ~ ordinal(X2) ) ),
inference(distribute,[status(thm)],[71]) ).
cnf(74,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[72]) ).
fof(81,plain,
! [X2] : in(X2,succ(X2)),
inference(variable_rename,[status(thm)],[6]) ).
cnf(82,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[81]) ).
fof(86,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)],[53]) ).
fof(87,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)],[86]) ).
fof(88,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)],[87]) ).
cnf(89,negated_conjecture,
( ordinal_subset(succ(esk3_0),esk4_0)
| in(esk3_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[88]) ).
cnf(90,negated_conjecture,
( ~ ordinal_subset(succ(esk3_0),esk4_0)
| ~ in(esk3_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[88]) ).
cnf(91,negated_conjecture,
ordinal(esk4_0),
inference(split_conjunct,[status(thm)],[88]) ).
cnf(92,negated_conjecture,
ordinal(esk3_0),
inference(split_conjunct,[status(thm)],[88]) ).
fof(140,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(141,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)],[140]) ).
fof(142,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)],[141]) ).
fof(143,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)],[142]) ).
fof(144,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)],[143]) ).
cnf(147,plain,
( subset(X2,X1)
| ~ epsilon_transitive(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[144]) ).
fof(148,plain,
! [X1] :
( ~ ordinal(X1)
| ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
inference(fof_nnf,[status(thm)],[58]) ).
fof(149,plain,
! [X2] :
( ~ ordinal(X2)
| ( ~ empty(succ(X2))
& epsilon_transitive(succ(X2))
& epsilon_connected(succ(X2))
& ordinal(succ(X2)) ) ),
inference(variable_rename,[status(thm)],[148]) ).
fof(150,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)],[149]) ).
cnf(151,plain,
( ordinal(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[150]) ).
fof(169,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(170,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)],[169]) ).
fof(171,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)],[170]) ).
cnf(172,plain,
( ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(173,plain,
( subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ ordinal_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[171]) ).
fof(174,plain,
! [X2] : succ(X2) = set_union2(X2,singleton(X2)),
inference(variable_rename,[status(thm)],[29]) ).
cnf(175,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[174]) ).
fof(226,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| ~ subset(X3,X2)
| subset(set_union2(X1,X3),X2) ),
inference(fof_nnf,[status(thm)],[43]) ).
fof(227,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X6,X5)
| subset(set_union2(X4,X6),X5) ),
inference(variable_rename,[status(thm)],[226]) ).
cnf(228,plain,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[227]) ).
fof(237,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)],[47]) ).
fof(238,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)],[237]) ).
fof(239,plain,
! [X4,X5] :
( ( X5 != singleton(X4)
| ! [X6] :
( ( ~ in(X6,X5)
| X6 = X4 )
& ( X6 != X4
| in(X6,X5) ) ) )
& ( ( ( ~ in(esk14_2(X4,X5),X5)
| esk14_2(X4,X5) != X4 )
& ( in(esk14_2(X4,X5),X5)
| esk14_2(X4,X5) = X4 ) )
| X5 = singleton(X4) ) ),
inference(skolemize,[status(esa)],[238]) ).
fof(240,plain,
! [X4,X5,X6] :
( ( ( ( ~ in(X6,X5)
| X6 = X4 )
& ( X6 != X4
| in(X6,X5) ) )
| X5 != singleton(X4) )
& ( ( ( ~ in(esk14_2(X4,X5),X5)
| esk14_2(X4,X5) != X4 )
& ( in(esk14_2(X4,X5),X5)
| esk14_2(X4,X5) = X4 ) )
| X5 = singleton(X4) ) ),
inference(shift_quantors,[status(thm)],[239]) ).
fof(241,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X6 != X4
| in(X6,X5)
| X5 != singleton(X4) )
& ( ~ in(esk14_2(X4,X5),X5)
| esk14_2(X4,X5) != X4
| X5 = singleton(X4) )
& ( in(esk14_2(X4,X5),X5)
| esk14_2(X4,X5) = X4
| X5 = singleton(X4) ) ),
inference(distribute,[status(thm)],[240]) ).
cnf(245,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[241]) ).
fof(258,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)],[51]) ).
fof(259,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)],[258]) ).
fof(260,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ( in(esk18_2(X4,X5),X4)
& ~ in(esk18_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[259]) ).
fof(261,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( ( in(esk18_2(X4,X5),X4)
& ~ in(esk18_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[260]) ).
fof(262,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( in(esk18_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk18_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[261]) ).
cnf(263,plain,
( subset(X1,X2)
| ~ in(esk18_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[262]) ).
cnf(264,plain,
( subset(X1,X2)
| in(esk18_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[262]) ).
cnf(265,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[262]) ).
cnf(271,plain,
in(X1,set_union2(X1,singleton(X1))),
inference(rw,[status(thm)],[82,175,theory(equality)]),
[unfolding] ).
cnf(272,negated_conjecture,
( in(esk3_0,esk4_0)
| ordinal_subset(set_union2(esk3_0,singleton(esk3_0)),esk4_0) ),
inference(rw,[status(thm)],[89,175,theory(equality)]),
[unfolding] ).
cnf(275,plain,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[151,175,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)],[90,175,theory(equality)]),
[unfolding] ).
cnf(353,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)],[278,172,theory(equality)]) ).
cnf(354,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)],[353,91,theory(equality)]) ).
cnf(355,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)],[354,theory(equality)]) ).
cnf(356,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)],[173,272,theory(equality)]) ).
cnf(358,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)],[356,91,theory(equality)]) ).
cnf(359,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)],[358,theory(equality)]) ).
cnf(364,plain,
( X1 = esk18_2(X2,X3)
| subset(X2,X3)
| singleton(X1) != X2 ),
inference(spm,[status(thm)],[245,264,theory(equality)]) ).
cnf(373,plain,
( subset(X1,X2)
| ~ in(X1,X2)
| ~ ordinal(X2) ),
inference(spm,[status(thm)],[147,74,theory(equality)]) ).
cnf(535,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)],[355,228,theory(equality)]) ).
cnf(558,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)],[535,275,theory(equality)]) ).
cnf(559,negated_conjecture,
( ~ subset(singleton(esk3_0),esk4_0)
| ~ subset(esk3_0,esk4_0)
| ~ in(esk3_0,esk4_0)
| $false ),
inference(rw,[status(thm)],[558,92,theory(equality)]) ).
cnf(560,negated_conjecture,
( ~ subset(singleton(esk3_0),esk4_0)
| ~ subset(esk3_0,esk4_0)
| ~ in(esk3_0,esk4_0) ),
inference(cn,[status(thm)],[559,theory(equality)]) ).
cnf(702,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)],[265,359,theory(equality)]) ).
cnf(726,plain,
( X1 = esk18_2(singleton(X1),X2)
| subset(singleton(X1),X2) ),
inference(er,[status(thm)],[364,theory(equality)]) ).
cnf(1028,negated_conjecture,
( in(esk3_0,esk4_0)
| ~ ordinal(set_union2(esk3_0,singleton(esk3_0))) ),
inference(spm,[status(thm)],[702,271,theory(equality)]) ).
cnf(1035,negated_conjecture,
( in(esk3_0,esk4_0)
| ~ ordinal(esk3_0) ),
inference(spm,[status(thm)],[1028,275,theory(equality)]) ).
cnf(1036,negated_conjecture,
( in(esk3_0,esk4_0)
| $false ),
inference(rw,[status(thm)],[1035,92,theory(equality)]) ).
cnf(1037,negated_conjecture,
in(esk3_0,esk4_0),
inference(cn,[status(thm)],[1036,theory(equality)]) ).
cnf(1047,negated_conjecture,
( ~ subset(singleton(esk3_0),esk4_0)
| ~ subset(esk3_0,esk4_0)
| $false ),
inference(rw,[status(thm)],[560,1037,theory(equality)]) ).
cnf(1048,negated_conjecture,
( ~ subset(singleton(esk3_0),esk4_0)
| ~ subset(esk3_0,esk4_0) ),
inference(cn,[status(thm)],[1047,theory(equality)]) ).
cnf(1208,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[263,726,theory(equality)]) ).
cnf(1217,negated_conjecture,
( ~ subset(esk3_0,esk4_0)
| ~ in(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[1048,1208,theory(equality)]) ).
cnf(1218,negated_conjecture,
( ~ subset(esk3_0,esk4_0)
| $false ),
inference(rw,[status(thm)],[1217,1037,theory(equality)]) ).
cnf(1219,negated_conjecture,
~ subset(esk3_0,esk4_0),
inference(cn,[status(thm)],[1218,theory(equality)]) ).
cnf(1221,negated_conjecture,
( ~ in(esk3_0,esk4_0)
| ~ ordinal(esk4_0) ),
inference(spm,[status(thm)],[1219,373,theory(equality)]) ).
cnf(1227,negated_conjecture,
( $false
| ~ ordinal(esk4_0) ),
inference(rw,[status(thm)],[1221,1037,theory(equality)]) ).
cnf(1228,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[1227,91,theory(equality)]) ).
cnf(1229,negated_conjecture,
$false,
inference(cn,[status(thm)],[1228,theory(equality)]) ).
cnf(1230,negated_conjecture,
$false,
1229,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU236+3.p
% --creating new selector for []
% -running prover on /tmp/tmpXo5Kgx/sel_SEU236+3.p_1 with time limit 29
% -prover status Theorem
% Problem SEU236+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU236+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU236+3.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
%
%------------------------------------------------------------------------------