TSTP Solution File: SEU238+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU238+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:10:09 EST 2010
% Result : Theorem 1.96s
% Output : CNFRefutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 92 ( 14 unt; 0 def)
% Number of atoms : 392 ( 43 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 523 ( 223 ~; 198 |; 79 &)
% ( 4 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 134 ( 0 sgn 74 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1] :
( ordinal(X1)
=> ( being_limit_ordinal(X1)
<=> ! [X2] :
( ordinal(X2)
=> ( in(X2,X1)
=> in(succ(X2),X1) ) ) ) ),
file('/tmp/tmpnOeZIa/sel_SEU238+1.p_1',t41_ordinal1) ).
fof(5,axiom,
! [X1] :
( epsilon_transitive(X1)
=> ! [X2] :
( ordinal(X2)
=> ( proper_subset(X1,X2)
=> in(X1,X2) ) ) ),
file('/tmp/tmpnOeZIa/sel_SEU238+1.p_1',t21_ordinal1) ).
fof(8,axiom,
! [X1] : in(X1,succ(X1)),
file('/tmp/tmpnOeZIa/sel_SEU238+1.p_1',t10_ordinal1) ).
fof(10,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
file('/tmp/tmpnOeZIa/sel_SEU238+1.p_1',t33_ordinal1) ).
fof(25,axiom,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
file('/tmp/tmpnOeZIa/sel_SEU238+1.p_1',fc3_ordinal1) ).
fof(26,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/tmp/tmpnOeZIa/sel_SEU238+1.p_1',antisymmetry_r2_hidden) ).
fof(30,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/tmp/tmpnOeZIa/sel_SEU238+1.p_1',redefinition_r1_ordinal1) ).
fof(31,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/tmp/tmpnOeZIa/sel_SEU238+1.p_1',d1_ordinal1) ).
fof(40,conjecture,
! [X1] :
( ordinal(X1)
=> ( ~ ( ~ being_limit_ordinal(X1)
& ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) ) )
& ~ ( ? [X2] :
( ordinal(X2)
& X1 = succ(X2) )
& being_limit_ordinal(X1) ) ) ),
file('/tmp/tmpnOeZIa/sel_SEU238+1.p_1',t42_ordinal1) ).
fof(42,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( subset(X1,X2)
& X1 != X2 ) ),
file('/tmp/tmpnOeZIa/sel_SEU238+1.p_1',d8_xboole_0) ).
fof(60,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ( ~ ( ~ being_limit_ordinal(X1)
& ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) ) )
& ~ ( ? [X2] :
( ordinal(X2)
& X1 = succ(X2) )
& being_limit_ordinal(X1) ) ) ),
inference(assume_negation,[status(cth)],[40]) ).
fof(66,plain,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
inference(fof_simplification,[status(thm)],[25,theory(equality)]) ).
fof(67,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[26,theory(equality)]) ).
fof(70,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ( ~ ( ~ being_limit_ordinal(X1)
& ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) ) )
& ~ ( ? [X2] :
( ordinal(X2)
& X1 = succ(X2) )
& being_limit_ordinal(X1) ) ) ),
inference(fof_simplification,[status(thm)],[60,theory(equality)]) ).
fof(85,plain,
! [X1] :
( ~ ordinal(X1)
| ( ( ~ being_limit_ordinal(X1)
| ! [X2] :
( ~ ordinal(X2)
| ~ in(X2,X1)
| in(succ(X2),X1) ) )
& ( ? [X2] :
( ordinal(X2)
& in(X2,X1)
& ~ in(succ(X2),X1) )
| being_limit_ordinal(X1) ) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(86,plain,
! [X3] :
( ~ ordinal(X3)
| ( ( ~ being_limit_ordinal(X3)
| ! [X4] :
( ~ ordinal(X4)
| ~ in(X4,X3)
| in(succ(X4),X3) ) )
& ( ? [X5] :
( ordinal(X5)
& in(X5,X3)
& ~ in(succ(X5),X3) )
| being_limit_ordinal(X3) ) ) ),
inference(variable_rename,[status(thm)],[85]) ).
fof(87,plain,
! [X3] :
( ~ ordinal(X3)
| ( ( ~ being_limit_ordinal(X3)
| ! [X4] :
( ~ ordinal(X4)
| ~ in(X4,X3)
| in(succ(X4),X3) ) )
& ( ( ordinal(esk2_1(X3))
& in(esk2_1(X3),X3)
& ~ in(succ(esk2_1(X3)),X3) )
| being_limit_ordinal(X3) ) ) ),
inference(skolemize,[status(esa)],[86]) ).
fof(88,plain,
! [X3,X4] :
( ( ( ~ ordinal(X4)
| ~ in(X4,X3)
| in(succ(X4),X3)
| ~ being_limit_ordinal(X3) )
& ( ( ordinal(esk2_1(X3))
& in(esk2_1(X3),X3)
& ~ in(succ(esk2_1(X3)),X3) )
| being_limit_ordinal(X3) ) )
| ~ ordinal(X3) ),
inference(shift_quantors,[status(thm)],[87]) ).
fof(89,plain,
! [X3,X4] :
( ( ~ ordinal(X4)
| ~ in(X4,X3)
| in(succ(X4),X3)
| ~ being_limit_ordinal(X3)
| ~ ordinal(X3) )
& ( ordinal(esk2_1(X3))
| being_limit_ordinal(X3)
| ~ ordinal(X3) )
& ( in(esk2_1(X3),X3)
| being_limit_ordinal(X3)
| ~ ordinal(X3) )
& ( ~ in(succ(esk2_1(X3)),X3)
| being_limit_ordinal(X3)
| ~ ordinal(X3) ) ),
inference(distribute,[status(thm)],[88]) ).
cnf(90,plain,
( being_limit_ordinal(X1)
| ~ ordinal(X1)
| ~ in(succ(esk2_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[89]) ).
cnf(91,plain,
( being_limit_ordinal(X1)
| in(esk2_1(X1),X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[89]) ).
cnf(92,plain,
( being_limit_ordinal(X1)
| ordinal(esk2_1(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[89]) ).
cnf(93,plain,
( in(succ(X2),X1)
| ~ ordinal(X1)
| ~ being_limit_ordinal(X1)
| ~ in(X2,X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[89]) ).
fof(94,plain,
! [X1] :
( ~ epsilon_transitive(X1)
| ! [X2] :
( ~ ordinal(X2)
| ~ proper_subset(X1,X2)
| in(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(95,plain,
! [X3] :
( ~ epsilon_transitive(X3)
| ! [X4] :
( ~ ordinal(X4)
| ~ proper_subset(X3,X4)
| in(X3,X4) ) ),
inference(variable_rename,[status(thm)],[94]) ).
fof(96,plain,
! [X3,X4] :
( ~ ordinal(X4)
| ~ proper_subset(X3,X4)
| in(X3,X4)
| ~ epsilon_transitive(X3) ),
inference(shift_quantors,[status(thm)],[95]) ).
cnf(97,plain,
( in(X1,X2)
| ~ epsilon_transitive(X1)
| ~ proper_subset(X1,X2)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[96]) ).
fof(104,plain,
! [X2] : in(X2,succ(X2)),
inference(variable_rename,[status(thm)],[8]) ).
cnf(105,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[104]) ).
fof(109,plain,
! [X1] :
( ~ ordinal(X1)
| ! [X2] :
( ~ ordinal(X2)
| ( ( ~ in(X1,X2)
| ordinal_subset(succ(X1),X2) )
& ( ~ ordinal_subset(succ(X1),X2)
| in(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(110,plain,
! [X3] :
( ~ ordinal(X3)
| ! [X4] :
( ~ ordinal(X4)
| ( ( ~ in(X3,X4)
| ordinal_subset(succ(X3),X4) )
& ( ~ ordinal_subset(succ(X3),X4)
| in(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[109]) ).
fof(111,plain,
! [X3,X4] :
( ~ ordinal(X4)
| ( ( ~ in(X3,X4)
| ordinal_subset(succ(X3),X4) )
& ( ~ ordinal_subset(succ(X3),X4)
| in(X3,X4) ) )
| ~ ordinal(X3) ),
inference(shift_quantors,[status(thm)],[110]) ).
fof(112,plain,
! [X3,X4] :
( ( ~ in(X3,X4)
| ordinal_subset(succ(X3),X4)
| ~ ordinal(X4)
| ~ ordinal(X3) )
& ( ~ ordinal_subset(succ(X3),X4)
| in(X3,X4)
| ~ ordinal(X4)
| ~ ordinal(X3) ) ),
inference(distribute,[status(thm)],[111]) ).
cnf(114,plain,
( ordinal_subset(succ(X1),X2)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[112]) ).
fof(169,plain,
! [X1] :
( ~ ordinal(X1)
| ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
inference(fof_nnf,[status(thm)],[66]) ).
fof(170,plain,
! [X2] :
( ~ ordinal(X2)
| ( ~ empty(succ(X2))
& epsilon_transitive(succ(X2))
& epsilon_connected(succ(X2))
& ordinal(succ(X2)) ) ),
inference(variable_rename,[status(thm)],[169]) ).
fof(171,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)],[170]) ).
cnf(172,plain,
( ordinal(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(174,plain,
( epsilon_transitive(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[171]) ).
fof(176,plain,
! [X1,X2] :
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(fof_nnf,[status(thm)],[67]) ).
fof(177,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[176]) ).
cnf(178,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[177]) ).
fof(190,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)],[30]) ).
fof(191,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)],[190]) ).
fof(192,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)],[191]) ).
cnf(194,plain,
( subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ ordinal_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[192]) ).
fof(195,plain,
! [X2] : succ(X2) = set_union2(X2,singleton(X2)),
inference(variable_rename,[status(thm)],[31]) ).
cnf(196,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[195]) ).
fof(216,negated_conjecture,
? [X1] :
( ordinal(X1)
& ( ( ~ being_limit_ordinal(X1)
& ! [X2] :
( ~ ordinal(X2)
| X1 != succ(X2) ) )
| ( ? [X2] :
( ordinal(X2)
& X1 = succ(X2) )
& being_limit_ordinal(X1) ) ) ),
inference(fof_nnf,[status(thm)],[70]) ).
fof(217,negated_conjecture,
? [X3] :
( ordinal(X3)
& ( ( ~ being_limit_ordinal(X3)
& ! [X4] :
( ~ ordinal(X4)
| X3 != succ(X4) ) )
| ( ? [X5] :
( ordinal(X5)
& X3 = succ(X5) )
& being_limit_ordinal(X3) ) ) ),
inference(variable_rename,[status(thm)],[216]) ).
fof(218,negated_conjecture,
( ordinal(esk8_0)
& ( ( ~ being_limit_ordinal(esk8_0)
& ! [X4] :
( ~ ordinal(X4)
| esk8_0 != succ(X4) ) )
| ( ordinal(esk9_0)
& esk8_0 = succ(esk9_0)
& being_limit_ordinal(esk8_0) ) ) ),
inference(skolemize,[status(esa)],[217]) ).
fof(219,negated_conjecture,
! [X4] :
( ( ( ( ~ ordinal(X4)
| esk8_0 != succ(X4) )
& ~ being_limit_ordinal(esk8_0) )
| ( ordinal(esk9_0)
& esk8_0 = succ(esk9_0)
& being_limit_ordinal(esk8_0) ) )
& ordinal(esk8_0) ),
inference(shift_quantors,[status(thm)],[218]) ).
fof(220,negated_conjecture,
! [X4] :
( ( ordinal(esk9_0)
| ~ ordinal(X4)
| esk8_0 != succ(X4) )
& ( esk8_0 = succ(esk9_0)
| ~ ordinal(X4)
| esk8_0 != succ(X4) )
& ( being_limit_ordinal(esk8_0)
| ~ ordinal(X4)
| esk8_0 != succ(X4) )
& ( ordinal(esk9_0)
| ~ being_limit_ordinal(esk8_0) )
& ( esk8_0 = succ(esk9_0)
| ~ being_limit_ordinal(esk8_0) )
& ( being_limit_ordinal(esk8_0)
| ~ being_limit_ordinal(esk8_0) )
& ordinal(esk8_0) ),
inference(distribute,[status(thm)],[219]) ).
cnf(221,negated_conjecture,
ordinal(esk8_0),
inference(split_conjunct,[status(thm)],[220]) ).
cnf(223,negated_conjecture,
( esk8_0 = succ(esk9_0)
| ~ being_limit_ordinal(esk8_0) ),
inference(split_conjunct,[status(thm)],[220]) ).
cnf(224,negated_conjecture,
( ordinal(esk9_0)
| ~ being_limit_ordinal(esk8_0) ),
inference(split_conjunct,[status(thm)],[220]) ).
cnf(225,negated_conjecture,
( being_limit_ordinal(esk8_0)
| esk8_0 != succ(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[220]) ).
fof(232,plain,
! [X1,X2] :
( ( ~ proper_subset(X1,X2)
| ( subset(X1,X2)
& X1 != X2 ) )
& ( ~ subset(X1,X2)
| X1 = X2
| proper_subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[42]) ).
fof(233,plain,
! [X3,X4] :
( ( ~ proper_subset(X3,X4)
| ( subset(X3,X4)
& X3 != X4 ) )
& ( ~ subset(X3,X4)
| X3 = X4
| proper_subset(X3,X4) ) ),
inference(variable_rename,[status(thm)],[232]) ).
fof(234,plain,
! [X3,X4] :
( ( subset(X3,X4)
| ~ proper_subset(X3,X4) )
& ( X3 != X4
| ~ proper_subset(X3,X4) )
& ( ~ subset(X3,X4)
| X3 = X4
| proper_subset(X3,X4) ) ),
inference(distribute,[status(thm)],[233]) ).
cnf(235,plain,
( proper_subset(X1,X2)
| X1 = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[234]) ).
cnf(289,plain,
in(X1,set_union2(X1,singleton(X1))),
inference(rw,[status(thm)],[105,196,theory(equality)]),
[unfolding] ).
cnf(290,negated_conjecture,
( set_union2(esk9_0,singleton(esk9_0)) = esk8_0
| ~ being_limit_ordinal(esk8_0) ),
inference(rw,[status(thm)],[223,196,theory(equality)]),
[unfolding] ).
cnf(291,plain,
( epsilon_transitive(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[174,196,theory(equality)]),
[unfolding] ).
cnf(293,plain,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[172,196,theory(equality)]),
[unfolding] ).
cnf(296,negated_conjecture,
( being_limit_ordinal(esk8_0)
| set_union2(X1,singleton(X1)) != esk8_0
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[225,196,theory(equality)]),
[unfolding] ).
cnf(297,plain,
( being_limit_ordinal(X1)
| ~ ordinal(X1)
| ~ in(set_union2(esk2_1(X1),singleton(esk2_1(X1))),X1) ),
inference(rw,[status(thm)],[90,196,theory(equality)]),
[unfolding] ).
cnf(299,plain,
( ordinal_subset(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[114,196,theory(equality)]),
[unfolding] ).
cnf(300,plain,
( in(set_union2(X2,singleton(X2)),X1)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ being_limit_ordinal(X1)
| ~ in(X2,X1) ),
inference(rw,[status(thm)],[93,196,theory(equality)]),
[unfolding] ).
cnf(376,plain,
~ in(set_union2(X1,singleton(X1)),X1),
inference(spm,[status(thm)],[178,289,theory(equality)]) ).
cnf(410,plain,
( in(X1,X2)
| X1 = X2
| ~ ordinal(X2)
| ~ epsilon_transitive(X1)
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[97,235,theory(equality)]) ).
cnf(418,plain,
( subset(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X2)
| ~ in(X1,X2)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[194,299,theory(equality)]) ).
cnf(511,plain,
( ~ being_limit_ordinal(X1)
| ~ in(X1,X1)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[376,300,theory(equality)]) ).
cnf(519,plain,
( ~ being_limit_ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(set_union2(X1,singleton(X1)))
| ~ in(X1,set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[511,300,theory(equality)]) ).
cnf(520,plain,
( ~ being_limit_ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(set_union2(X1,singleton(X1)))
| $false
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[519,289,theory(equality)]) ).
cnf(521,plain,
( ~ being_limit_ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(cn,[status(thm)],[520,theory(equality)]) ).
cnf(562,plain,
( ~ being_limit_ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[521,293]) ).
cnf(564,negated_conjecture,
( ~ being_limit_ordinal(esk8_0)
| ~ ordinal(esk9_0) ),
inference(spm,[status(thm)],[562,290,theory(equality)]) ).
cnf(569,negated_conjecture,
~ being_limit_ordinal(esk8_0),
inference(csr,[status(thm)],[564,224]) ).
cnf(978,plain,
( subset(set_union2(X1,singleton(X1)),X2)
| ~ in(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[418,293]) ).
cnf(985,plain,
( set_union2(X1,singleton(X1)) = X2
| in(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X2)
| ~ epsilon_transitive(set_union2(X1,singleton(X1)))
| ~ in(X1,X2)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[410,978,theory(equality)]) ).
cnf(3032,plain,
( set_union2(X1,singleton(X1)) = X2
| in(set_union2(X1,singleton(X1)),X2)
| ~ in(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(csr,[status(thm)],[985,291]) ).
cnf(3039,plain,
( being_limit_ordinal(X1)
| set_union2(esk2_1(X1),singleton(esk2_1(X1))) = X1
| ~ ordinal(X1)
| ~ in(esk2_1(X1),X1)
| ~ ordinal(esk2_1(X1)) ),
inference(spm,[status(thm)],[297,3032,theory(equality)]) ).
cnf(24298,plain,
( set_union2(esk2_1(X1),singleton(esk2_1(X1))) = X1
| being_limit_ordinal(X1)
| ~ in(esk2_1(X1),X1)
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[3039,92]) ).
cnf(24299,plain,
( set_union2(esk2_1(X1),singleton(esk2_1(X1))) = X1
| being_limit_ordinal(X1)
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[24298,91]) ).
cnf(24305,negated_conjecture,
( being_limit_ordinal(esk8_0)
| being_limit_ordinal(X1)
| X1 != esk8_0
| ~ ordinal(esk2_1(X1))
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[296,24299,theory(equality)]) ).
cnf(24388,negated_conjecture,
( being_limit_ordinal(X1)
| X1 != esk8_0
| ~ ordinal(esk2_1(X1))
| ~ ordinal(X1) ),
inference(sr,[status(thm)],[24305,569,theory(equality)]) ).
cnf(24403,negated_conjecture,
( being_limit_ordinal(X1)
| X1 != esk8_0
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[24388,92]) ).
cnf(24404,negated_conjecture,
~ ordinal(esk8_0),
inference(spm,[status(thm)],[569,24403,theory(equality)]) ).
cnf(24436,negated_conjecture,
$false,
inference(rw,[status(thm)],[24404,221,theory(equality)]) ).
cnf(24437,negated_conjecture,
$false,
inference(cn,[status(thm)],[24436,theory(equality)]) ).
cnf(24438,negated_conjecture,
$false,
24437,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU238+1.p
% --creating new selector for []
% -running prover on /tmp/tmpnOeZIa/sel_SEU238+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU238+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU238+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU238+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
%
%------------------------------------------------------------------------------