TSTP Solution File: SEU240+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU240+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:43 EST 2010
% Result : Theorem 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 6
% Syntax : Number of formulae : 104 ( 16 unt; 0 def)
% Number of atoms : 449 ( 6 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 568 ( 223 ~; 269 |; 63 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 179 ( 6 sgn 77 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/tmp/tmp1lAi_o/sel_SEU240+1.p_1',commutativity_k2_tarski) ).
fof(18,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_transitive_in(X1,X2)
<=> ! [X3,X4,X5] :
( ( in(X3,X2)
& in(X4,X2)
& in(X5,X2)
& in(ordered_pair(X3,X4),X1)
& in(ordered_pair(X4,X5),X1) )
=> in(ordered_pair(X3,X5),X1) ) ) ),
file('/tmp/tmp1lAi_o/sel_SEU240+1.p_1',d8_relat_2) ).
fof(19,axiom,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> is_transitive_in(X1,relation_field(X1)) ) ),
file('/tmp/tmp1lAi_o/sel_SEU240+1.p_1',d16_relat_2) ).
fof(27,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/tmp/tmp1lAi_o/sel_SEU240+1.p_1',d5_tarski) ).
fof(30,conjecture,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X3,X4),X1) )
=> in(ordered_pair(X2,X4),X1) ) ) ),
file('/tmp/tmp1lAi_o/sel_SEU240+1.p_1',l2_wellord1) ).
fof(31,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_field(X3))
& in(X2,relation_field(X3)) ) ) ),
file('/tmp/tmp1lAi_o/sel_SEU240+1.p_1',t30_relat_1) ).
fof(38,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X3,X4),X1) )
=> in(ordered_pair(X2,X4),X1) ) ) ),
inference(assume_negation,[status(cth)],[30]) ).
fof(46,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[2]) ).
cnf(47,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[46]) ).
fof(90,plain,
! [X1] :
( ~ relation(X1)
| ! [X2] :
( ( ~ is_transitive_in(X1,X2)
| ! [X3,X4,X5] :
( ~ in(X3,X2)
| ~ in(X4,X2)
| ~ in(X5,X2)
| ~ in(ordered_pair(X3,X4),X1)
| ~ in(ordered_pair(X4,X5),X1)
| in(ordered_pair(X3,X5),X1) ) )
& ( ? [X3,X4,X5] :
( in(X3,X2)
& in(X4,X2)
& in(X5,X2)
& in(ordered_pair(X3,X4),X1)
& in(ordered_pair(X4,X5),X1)
& ~ in(ordered_pair(X3,X5),X1) )
| is_transitive_in(X1,X2) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(91,plain,
! [X6] :
( ~ relation(X6)
| ! [X7] :
( ( ~ is_transitive_in(X6,X7)
| ! [X8,X9,X10] :
( ~ in(X8,X7)
| ~ in(X9,X7)
| ~ in(X10,X7)
| ~ in(ordered_pair(X8,X9),X6)
| ~ in(ordered_pair(X9,X10),X6)
| in(ordered_pair(X8,X10),X6) ) )
& ( ? [X11,X12,X13] :
( in(X11,X7)
& in(X12,X7)
& in(X13,X7)
& in(ordered_pair(X11,X12),X6)
& in(ordered_pair(X12,X13),X6)
& ~ in(ordered_pair(X11,X13),X6) )
| is_transitive_in(X6,X7) ) ) ),
inference(variable_rename,[status(thm)],[90]) ).
fof(92,plain,
! [X6] :
( ~ relation(X6)
| ! [X7] :
( ( ~ is_transitive_in(X6,X7)
| ! [X8,X9,X10] :
( ~ in(X8,X7)
| ~ in(X9,X7)
| ~ in(X10,X7)
| ~ in(ordered_pair(X8,X9),X6)
| ~ in(ordered_pair(X9,X10),X6)
| in(ordered_pair(X8,X10),X6) ) )
& ( ( in(esk4_2(X6,X7),X7)
& in(esk5_2(X6,X7),X7)
& in(esk6_2(X6,X7),X7)
& in(ordered_pair(esk4_2(X6,X7),esk5_2(X6,X7)),X6)
& in(ordered_pair(esk5_2(X6,X7),esk6_2(X6,X7)),X6)
& ~ in(ordered_pair(esk4_2(X6,X7),esk6_2(X6,X7)),X6) )
| is_transitive_in(X6,X7) ) ) ),
inference(skolemize,[status(esa)],[91]) ).
fof(93,plain,
! [X6,X7,X8,X9,X10] :
( ( ( ~ in(X8,X7)
| ~ in(X9,X7)
| ~ in(X10,X7)
| ~ in(ordered_pair(X8,X9),X6)
| ~ in(ordered_pair(X9,X10),X6)
| in(ordered_pair(X8,X10),X6)
| ~ is_transitive_in(X6,X7) )
& ( ( in(esk4_2(X6,X7),X7)
& in(esk5_2(X6,X7),X7)
& in(esk6_2(X6,X7),X7)
& in(ordered_pair(esk4_2(X6,X7),esk5_2(X6,X7)),X6)
& in(ordered_pair(esk5_2(X6,X7),esk6_2(X6,X7)),X6)
& ~ in(ordered_pair(esk4_2(X6,X7),esk6_2(X6,X7)),X6) )
| is_transitive_in(X6,X7) ) )
| ~ relation(X6) ),
inference(shift_quantors,[status(thm)],[92]) ).
fof(94,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ in(X8,X7)
| ~ in(X9,X7)
| ~ in(X10,X7)
| ~ in(ordered_pair(X8,X9),X6)
| ~ in(ordered_pair(X9,X10),X6)
| in(ordered_pair(X8,X10),X6)
| ~ is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( in(esk4_2(X6,X7),X7)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( in(esk5_2(X6,X7),X7)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( in(esk6_2(X6,X7),X7)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( in(ordered_pair(esk4_2(X6,X7),esk5_2(X6,X7)),X6)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( in(ordered_pair(esk5_2(X6,X7),esk6_2(X6,X7)),X6)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( ~ in(ordered_pair(esk4_2(X6,X7),esk6_2(X6,X7)),X6)
| is_transitive_in(X6,X7)
| ~ relation(X6) ) ),
inference(distribute,[status(thm)],[93]) ).
cnf(95,plain,
( is_transitive_in(X1,X2)
| ~ relation(X1)
| ~ in(ordered_pair(esk4_2(X1,X2),esk6_2(X1,X2)),X1) ),
inference(split_conjunct,[status(thm)],[94]) ).
cnf(96,plain,
( is_transitive_in(X1,X2)
| in(ordered_pair(esk5_2(X1,X2),esk6_2(X1,X2)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[94]) ).
cnf(97,plain,
( is_transitive_in(X1,X2)
| in(ordered_pair(esk4_2(X1,X2),esk5_2(X1,X2)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[94]) ).
cnf(101,plain,
( in(ordered_pair(X3,X4),X1)
| ~ relation(X1)
| ~ is_transitive_in(X1,X2)
| ~ in(ordered_pair(X5,X4),X1)
| ~ in(ordered_pair(X3,X5),X1)
| ~ in(X4,X2)
| ~ in(X5,X2)
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[94]) ).
fof(102,plain,
! [X1] :
( ~ relation(X1)
| ( ( ~ transitive(X1)
| is_transitive_in(X1,relation_field(X1)) )
& ( ~ is_transitive_in(X1,relation_field(X1))
| transitive(X1) ) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(103,plain,
! [X2] :
( ~ relation(X2)
| ( ( ~ transitive(X2)
| is_transitive_in(X2,relation_field(X2)) )
& ( ~ is_transitive_in(X2,relation_field(X2))
| transitive(X2) ) ) ),
inference(variable_rename,[status(thm)],[102]) ).
fof(104,plain,
! [X2] :
( ( ~ transitive(X2)
| is_transitive_in(X2,relation_field(X2))
| ~ relation(X2) )
& ( ~ is_transitive_in(X2,relation_field(X2))
| transitive(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[103]) ).
cnf(105,plain,
( transitive(X1)
| ~ relation(X1)
| ~ is_transitive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[104]) ).
cnf(106,plain,
( is_transitive_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ transitive(X1) ),
inference(split_conjunct,[status(thm)],[104]) ).
fof(119,plain,
! [X3,X4] : ordered_pair(X3,X4) = unordered_pair(unordered_pair(X3,X4),singleton(X3)),
inference(variable_rename,[status(thm)],[27]) ).
cnf(120,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[119]) ).
fof(127,negated_conjecture,
? [X1] :
( relation(X1)
& ( ~ transitive(X1)
| ? [X2,X3,X4] :
( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X3,X4),X1)
& ~ in(ordered_pair(X2,X4),X1) ) )
& ( transitive(X1)
| ! [X2,X3,X4] :
( ~ in(ordered_pair(X2,X3),X1)
| ~ in(ordered_pair(X3,X4),X1)
| in(ordered_pair(X2,X4),X1) ) ) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(128,negated_conjecture,
? [X5] :
( relation(X5)
& ( ~ transitive(X5)
| ? [X6,X7,X8] :
( in(ordered_pair(X6,X7),X5)
& in(ordered_pair(X7,X8),X5)
& ~ in(ordered_pair(X6,X8),X5) ) )
& ( transitive(X5)
| ! [X9,X10,X11] :
( ~ in(ordered_pair(X9,X10),X5)
| ~ in(ordered_pair(X10,X11),X5)
| in(ordered_pair(X9,X11),X5) ) ) ),
inference(variable_rename,[status(thm)],[127]) ).
fof(129,negated_conjecture,
( relation(esk8_0)
& ( ~ transitive(esk8_0)
| ( in(ordered_pair(esk9_0,esk10_0),esk8_0)
& in(ordered_pair(esk10_0,esk11_0),esk8_0)
& ~ in(ordered_pair(esk9_0,esk11_0),esk8_0) ) )
& ( transitive(esk8_0)
| ! [X9,X10,X11] :
( ~ in(ordered_pair(X9,X10),esk8_0)
| ~ in(ordered_pair(X10,X11),esk8_0)
| in(ordered_pair(X9,X11),esk8_0) ) ) ),
inference(skolemize,[status(esa)],[128]) ).
fof(130,negated_conjecture,
! [X9,X10,X11] :
( ( ~ in(ordered_pair(X9,X10),esk8_0)
| ~ in(ordered_pair(X10,X11),esk8_0)
| in(ordered_pair(X9,X11),esk8_0)
| transitive(esk8_0) )
& ( ~ transitive(esk8_0)
| ( in(ordered_pair(esk9_0,esk10_0),esk8_0)
& in(ordered_pair(esk10_0,esk11_0),esk8_0)
& ~ in(ordered_pair(esk9_0,esk11_0),esk8_0) ) )
& relation(esk8_0) ),
inference(shift_quantors,[status(thm)],[129]) ).
fof(131,negated_conjecture,
! [X9,X10,X11] :
( ( ~ in(ordered_pair(X9,X10),esk8_0)
| ~ in(ordered_pair(X10,X11),esk8_0)
| in(ordered_pair(X9,X11),esk8_0)
| transitive(esk8_0) )
& ( in(ordered_pair(esk9_0,esk10_0),esk8_0)
| ~ transitive(esk8_0) )
& ( in(ordered_pair(esk10_0,esk11_0),esk8_0)
| ~ transitive(esk8_0) )
& ( ~ in(ordered_pair(esk9_0,esk11_0),esk8_0)
| ~ transitive(esk8_0) )
& relation(esk8_0) ),
inference(distribute,[status(thm)],[130]) ).
cnf(132,negated_conjecture,
relation(esk8_0),
inference(split_conjunct,[status(thm)],[131]) ).
cnf(133,negated_conjecture,
( ~ transitive(esk8_0)
| ~ in(ordered_pair(esk9_0,esk11_0),esk8_0) ),
inference(split_conjunct,[status(thm)],[131]) ).
cnf(134,negated_conjecture,
( in(ordered_pair(esk10_0,esk11_0),esk8_0)
| ~ transitive(esk8_0) ),
inference(split_conjunct,[status(thm)],[131]) ).
cnf(135,negated_conjecture,
( in(ordered_pair(esk9_0,esk10_0),esk8_0)
| ~ transitive(esk8_0) ),
inference(split_conjunct,[status(thm)],[131]) ).
cnf(136,negated_conjecture,
( transitive(esk8_0)
| in(ordered_pair(X1,X2),esk8_0)
| ~ in(ordered_pair(X3,X2),esk8_0)
| ~ in(ordered_pair(X1,X3),esk8_0) ),
inference(split_conjunct,[status(thm)],[131]) ).
fof(137,plain,
! [X1,X2,X3] :
( ~ relation(X3)
| ~ in(ordered_pair(X1,X2),X3)
| ( in(X1,relation_field(X3))
& in(X2,relation_field(X3)) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(138,plain,
! [X4,X5,X6] :
( ~ relation(X6)
| ~ in(ordered_pair(X4,X5),X6)
| ( in(X4,relation_field(X6))
& in(X5,relation_field(X6)) ) ),
inference(variable_rename,[status(thm)],[137]) ).
fof(139,plain,
! [X4,X5,X6] :
( ( in(X4,relation_field(X6))
| ~ in(ordered_pair(X4,X5),X6)
| ~ relation(X6) )
& ( in(X5,relation_field(X6))
| ~ in(ordered_pair(X4,X5),X6)
| ~ relation(X6) ) ),
inference(distribute,[status(thm)],[138]) ).
cnf(140,plain,
( in(X3,relation_field(X1))
| ~ relation(X1)
| ~ in(ordered_pair(X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[139]) ).
cnf(141,plain,
( in(X2,relation_field(X1))
| ~ relation(X1)
| ~ in(ordered_pair(X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[139]) ).
cnf(157,negated_conjecture,
( in(unordered_pair(unordered_pair(esk9_0,esk10_0),singleton(esk9_0)),esk8_0)
| ~ transitive(esk8_0) ),
inference(rw,[status(thm)],[135,120,theory(equality)]),
[unfolding] ).
cnf(158,negated_conjecture,
( in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0)),esk8_0)
| ~ transitive(esk8_0) ),
inference(rw,[status(thm)],[134,120,theory(equality)]),
[unfolding] ).
cnf(159,plain,
( is_transitive_in(X1,X2)
| in(unordered_pair(unordered_pair(esk4_2(X1,X2),esk5_2(X1,X2)),singleton(esk4_2(X1,X2))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[97,120,theory(equality)]),
[unfolding] ).
cnf(160,plain,
( is_transitive_in(X1,X2)
| in(unordered_pair(unordered_pair(esk5_2(X1,X2),esk6_2(X1,X2)),singleton(esk5_2(X1,X2))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[96,120,theory(equality)]),
[unfolding] ).
cnf(161,plain,
( in(X3,relation_field(X1))
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),X1) ),
inference(rw,[status(thm)],[140,120,theory(equality)]),
[unfolding] ).
cnf(162,plain,
( in(X2,relation_field(X1))
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),X1) ),
inference(rw,[status(thm)],[141,120,theory(equality)]),
[unfolding] ).
cnf(163,plain,
( is_transitive_in(X1,X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk4_2(X1,X2),esk6_2(X1,X2)),singleton(esk4_2(X1,X2))),X1) ),
inference(rw,[status(thm)],[95,120,theory(equality)]),
[unfolding] ).
cnf(164,negated_conjecture,
( transitive(esk8_0)
| in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk8_0)
| ~ in(unordered_pair(unordered_pair(X3,X2),singleton(X3)),esk8_0)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),esk8_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[136,120,theory(equality)]),120,theory(equality)]),120,theory(equality)]),
[unfolding] ).
cnf(165,plain,
( in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)
| ~ relation(X1)
| ~ in(X5,X2)
| ~ in(X4,X2)
| ~ in(X3,X2)
| ~ is_transitive_in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X5,X4),singleton(X5)),X1)
| ~ in(unordered_pair(unordered_pair(X3,X5),singleton(X3)),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[101,120,theory(equality)]),120,theory(equality)]),120,theory(equality)]),
[unfolding] ).
cnf(167,negated_conjecture,
( ~ transitive(esk8_0)
| ~ in(unordered_pair(unordered_pair(esk9_0,esk11_0),singleton(esk9_0)),esk8_0) ),
inference(rw,[status(thm)],[133,120,theory(equality)]),
[unfolding] ).
cnf(212,negated_conjecture,
( in(esk10_0,relation_field(esk8_0))
| ~ relation(esk8_0)
| ~ transitive(esk8_0) ),
inference(spm,[status(thm)],[161,157,theory(equality)]) ).
cnf(213,negated_conjecture,
( in(esk11_0,relation_field(esk8_0))
| ~ relation(esk8_0)
| ~ transitive(esk8_0) ),
inference(spm,[status(thm)],[161,158,theory(equality)]) ).
cnf(214,negated_conjecture,
( in(esk10_0,relation_field(esk8_0))
| $false
| ~ transitive(esk8_0) ),
inference(rw,[status(thm)],[212,132,theory(equality)]) ).
cnf(215,negated_conjecture,
( in(esk10_0,relation_field(esk8_0))
| ~ transitive(esk8_0) ),
inference(cn,[status(thm)],[214,theory(equality)]) ).
cnf(216,negated_conjecture,
( in(esk11_0,relation_field(esk8_0))
| $false
| ~ transitive(esk8_0) ),
inference(rw,[status(thm)],[213,132,theory(equality)]) ).
cnf(217,negated_conjecture,
( in(esk11_0,relation_field(esk8_0))
| ~ transitive(esk8_0) ),
inference(cn,[status(thm)],[216,theory(equality)]) ).
cnf(222,negated_conjecture,
( in(esk9_0,relation_field(esk8_0))
| ~ relation(esk8_0)
| ~ transitive(esk8_0) ),
inference(spm,[status(thm)],[162,157,theory(equality)]) ).
cnf(224,negated_conjecture,
( in(esk9_0,relation_field(esk8_0))
| $false
| ~ transitive(esk8_0) ),
inference(rw,[status(thm)],[222,132,theory(equality)]) ).
cnf(225,negated_conjecture,
( in(esk9_0,relation_field(esk8_0))
| ~ transitive(esk8_0) ),
inference(cn,[status(thm)],[224,theory(equality)]) ).
cnf(228,plain,
( is_transitive_in(X1,X2)
| in(unordered_pair(singleton(esk4_2(X1,X2)),unordered_pair(esk4_2(X1,X2),esk5_2(X1,X2))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[159,47,theory(equality)]) ).
cnf(232,negated_conjecture,
( transitive(esk8_0)
| in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk8_0)
| ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X2)),esk8_0)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),esk8_0) ),
inference(spm,[status(thm)],[164,47,theory(equality)]) ).
cnf(237,plain,
( is_transitive_in(X1,X2)
| in(unordered_pair(singleton(esk5_2(X1,X2)),unordered_pair(esk5_2(X1,X2),esk6_2(X1,X2))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[160,47,theory(equality)]) ).
cnf(240,plain,
( is_transitive_in(X1,X2)
| ~ relation(X1)
| ~ in(unordered_pair(singleton(esk4_2(X1,X2)),unordered_pair(esk4_2(X1,X2),esk6_2(X1,X2))),X1) ),
inference(rw,[status(thm)],[163,47,theory(equality)]) ).
cnf(246,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,esk11_0),singleton(X1)),esk8_0)
| ~ is_transitive_in(esk8_0,X2)
| ~ in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk8_0)
| ~ in(esk10_0,X2)
| ~ in(esk11_0,X2)
| ~ in(X1,X2)
| ~ relation(esk8_0)
| ~ transitive(esk8_0) ),
inference(spm,[status(thm)],[165,158,theory(equality)]) ).
cnf(249,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,esk11_0),singleton(X1)),esk8_0)
| ~ is_transitive_in(esk8_0,X2)
| ~ in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk8_0)
| ~ in(esk10_0,X2)
| ~ in(esk11_0,X2)
| ~ in(X1,X2)
| $false
| ~ transitive(esk8_0) ),
inference(rw,[status(thm)],[246,132,theory(equality)]) ).
cnf(250,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,esk11_0),singleton(X1)),esk8_0)
| ~ is_transitive_in(esk8_0,X2)
| ~ in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk8_0)
| ~ in(esk10_0,X2)
| ~ in(esk11_0,X2)
| ~ in(X1,X2)
| ~ transitive(esk8_0) ),
inference(cn,[status(thm)],[249,theory(equality)]) ).
cnf(368,negated_conjecture,
( transitive(esk8_0)
| in(unordered_pair(unordered_pair(X1,esk6_2(esk8_0,X2)),singleton(X1)),esk8_0)
| is_transitive_in(esk8_0,X2)
| ~ in(unordered_pair(unordered_pair(X1,esk5_2(esk8_0,X2)),singleton(X1)),esk8_0)
| ~ relation(esk8_0) ),
inference(spm,[status(thm)],[232,237,theory(equality)]) ).
cnf(373,negated_conjecture,
( transitive(esk8_0)
| in(unordered_pair(singleton(X1),unordered_pair(X1,esk6_2(esk8_0,X2))),esk8_0)
| is_transitive_in(esk8_0,X2)
| ~ in(unordered_pair(unordered_pair(X1,esk5_2(esk8_0,X2)),singleton(X1)),esk8_0)
| ~ relation(esk8_0) ),
inference(rw,[status(thm)],[368,47,theory(equality)]) ).
cnf(374,negated_conjecture,
( transitive(esk8_0)
| in(unordered_pair(singleton(X1),unordered_pair(X1,esk6_2(esk8_0,X2))),esk8_0)
| is_transitive_in(esk8_0,X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,esk5_2(esk8_0,X2))),esk8_0)
| ~ relation(esk8_0) ),
inference(rw,[status(thm)],[373,47,theory(equality)]) ).
cnf(375,negated_conjecture,
( transitive(esk8_0)
| in(unordered_pair(singleton(X1),unordered_pair(X1,esk6_2(esk8_0,X2))),esk8_0)
| is_transitive_in(esk8_0,X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,esk5_2(esk8_0,X2))),esk8_0)
| $false ),
inference(rw,[status(thm)],[374,132,theory(equality)]) ).
cnf(376,negated_conjecture,
( transitive(esk8_0)
| in(unordered_pair(singleton(X1),unordered_pair(X1,esk6_2(esk8_0,X2))),esk8_0)
| is_transitive_in(esk8_0,X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,esk5_2(esk8_0,X2))),esk8_0) ),
inference(cn,[status(thm)],[375,theory(equality)]) ).
cnf(529,negated_conjecture,
( is_transitive_in(esk8_0,X1)
| transitive(esk8_0)
| ~ relation(esk8_0)
| ~ in(unordered_pair(singleton(esk4_2(esk8_0,X1)),unordered_pair(esk4_2(esk8_0,X1),esk5_2(esk8_0,X1))),esk8_0) ),
inference(spm,[status(thm)],[240,376,theory(equality)]) ).
cnf(536,negated_conjecture,
( is_transitive_in(esk8_0,X1)
| transitive(esk8_0)
| $false
| ~ in(unordered_pair(singleton(esk4_2(esk8_0,X1)),unordered_pair(esk4_2(esk8_0,X1),esk5_2(esk8_0,X1))),esk8_0) ),
inference(rw,[status(thm)],[529,132,theory(equality)]) ).
cnf(537,negated_conjecture,
( is_transitive_in(esk8_0,X1)
| transitive(esk8_0)
| ~ in(unordered_pair(singleton(esk4_2(esk8_0,X1)),unordered_pair(esk4_2(esk8_0,X1),esk5_2(esk8_0,X1))),esk8_0) ),
inference(cn,[status(thm)],[536,theory(equality)]) ).
cnf(610,negated_conjecture,
( transitive(esk8_0)
| is_transitive_in(esk8_0,X1)
| ~ relation(esk8_0) ),
inference(spm,[status(thm)],[537,228,theory(equality)]) ).
cnf(612,negated_conjecture,
( transitive(esk8_0)
| is_transitive_in(esk8_0,X1)
| $false ),
inference(rw,[status(thm)],[610,132,theory(equality)]) ).
cnf(613,negated_conjecture,
( transitive(esk8_0)
| is_transitive_in(esk8_0,X1) ),
inference(cn,[status(thm)],[612,theory(equality)]) ).
cnf(614,negated_conjecture,
( transitive(esk8_0)
| ~ relation(esk8_0) ),
inference(spm,[status(thm)],[105,613,theory(equality)]) ).
cnf(618,negated_conjecture,
( transitive(esk8_0)
| $false ),
inference(rw,[status(thm)],[614,132,theory(equality)]) ).
cnf(619,negated_conjecture,
transitive(esk8_0),
inference(cn,[status(thm)],[618,theory(equality)]) ).
cnf(621,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,esk11_0),singleton(X1)),esk8_0)
| $false
| ~ is_transitive_in(esk8_0,X2)
| ~ in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk8_0)
| ~ in(esk10_0,X2)
| ~ in(esk11_0,X2)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[250,619,theory(equality)]) ).
cnf(622,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,esk11_0),singleton(X1)),esk8_0)
| ~ is_transitive_in(esk8_0,X2)
| ~ in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk8_0)
| ~ in(esk10_0,X2)
| ~ in(esk11_0,X2)
| ~ in(X1,X2) ),
inference(cn,[status(thm)],[621,theory(equality)]) ).
cnf(635,negated_conjecture,
( in(esk9_0,relation_field(esk8_0))
| $false ),
inference(rw,[status(thm)],[225,619,theory(equality)]) ).
cnf(636,negated_conjecture,
in(esk9_0,relation_field(esk8_0)),
inference(cn,[status(thm)],[635,theory(equality)]) ).
cnf(637,negated_conjecture,
( in(esk11_0,relation_field(esk8_0))
| $false ),
inference(rw,[status(thm)],[217,619,theory(equality)]) ).
cnf(638,negated_conjecture,
in(esk11_0,relation_field(esk8_0)),
inference(cn,[status(thm)],[637,theory(equality)]) ).
cnf(639,negated_conjecture,
( in(esk10_0,relation_field(esk8_0))
| $false ),
inference(rw,[status(thm)],[215,619,theory(equality)]) ).
cnf(640,negated_conjecture,
in(esk10_0,relation_field(esk8_0)),
inference(cn,[status(thm)],[639,theory(equality)]) ).
cnf(648,negated_conjecture,
( $false
| ~ in(unordered_pair(unordered_pair(esk9_0,esk11_0),singleton(esk9_0)),esk8_0) ),
inference(rw,[status(thm)],[167,619,theory(equality)]) ).
cnf(649,negated_conjecture,
~ in(unordered_pair(unordered_pair(esk9_0,esk11_0),singleton(esk9_0)),esk8_0),
inference(cn,[status(thm)],[648,theory(equality)]) ).
cnf(652,negated_conjecture,
( in(unordered_pair(unordered_pair(esk9_0,esk10_0),singleton(esk9_0)),esk8_0)
| $false ),
inference(rw,[status(thm)],[157,619,theory(equality)]) ).
cnf(653,negated_conjecture,
in(unordered_pair(unordered_pair(esk9_0,esk10_0),singleton(esk9_0)),esk8_0),
inference(cn,[status(thm)],[652,theory(equality)]) ).
cnf(654,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,esk11_0),singleton(X1)),esk8_0)
| ~ in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk8_0)
| ~ in(esk10_0,relation_field(esk8_0))
| ~ in(esk11_0,relation_field(esk8_0))
| ~ in(X1,relation_field(esk8_0))
| ~ transitive(esk8_0)
| ~ relation(esk8_0) ),
inference(spm,[status(thm)],[622,106,theory(equality)]) ).
cnf(657,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,esk11_0),singleton(X1)),esk8_0)
| ~ in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk8_0)
| ~ in(esk10_0,relation_field(esk8_0))
| ~ in(esk11_0,relation_field(esk8_0))
| ~ in(X1,relation_field(esk8_0))
| $false
| ~ relation(esk8_0) ),
inference(rw,[status(thm)],[654,619,theory(equality)]) ).
cnf(658,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,esk11_0),singleton(X1)),esk8_0)
| ~ in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk8_0)
| ~ in(esk10_0,relation_field(esk8_0))
| ~ in(esk11_0,relation_field(esk8_0))
| ~ in(X1,relation_field(esk8_0))
| $false
| $false ),
inference(rw,[status(thm)],[657,132,theory(equality)]) ).
cnf(659,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,esk11_0),singleton(X1)),esk8_0)
| ~ in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk8_0)
| ~ in(esk10_0,relation_field(esk8_0))
| ~ in(esk11_0,relation_field(esk8_0))
| ~ in(X1,relation_field(esk8_0)) ),
inference(cn,[status(thm)],[658,theory(equality)]) ).
cnf(829,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,esk11_0),singleton(X1)),esk8_0)
| ~ in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk8_0)
| $false
| ~ in(esk11_0,relation_field(esk8_0))
| ~ in(X1,relation_field(esk8_0)) ),
inference(rw,[status(thm)],[659,640,theory(equality)]) ).
cnf(830,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,esk11_0),singleton(X1)),esk8_0)
| ~ in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk8_0)
| $false
| $false
| ~ in(X1,relation_field(esk8_0)) ),
inference(rw,[status(thm)],[829,638,theory(equality)]) ).
cnf(831,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,esk11_0),singleton(X1)),esk8_0)
| ~ in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk8_0)
| ~ in(X1,relation_field(esk8_0)) ),
inference(cn,[status(thm)],[830,theory(equality)]) ).
cnf(832,negated_conjecture,
( in(unordered_pair(unordered_pair(esk9_0,esk11_0),singleton(esk9_0)),esk8_0)
| ~ in(unordered_pair(unordered_pair(esk9_0,esk10_0),singleton(esk9_0)),esk8_0) ),
inference(spm,[status(thm)],[831,636,theory(equality)]) ).
cnf(844,negated_conjecture,
( in(unordered_pair(unordered_pair(esk9_0,esk11_0),singleton(esk9_0)),esk8_0)
| $false ),
inference(rw,[status(thm)],[832,653,theory(equality)]) ).
cnf(845,negated_conjecture,
in(unordered_pair(unordered_pair(esk9_0,esk11_0),singleton(esk9_0)),esk8_0),
inference(cn,[status(thm)],[844,theory(equality)]) ).
cnf(846,negated_conjecture,
$false,
inference(sr,[status(thm)],[845,649,theory(equality)]) ).
cnf(847,negated_conjecture,
$false,
846,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU240+1.p
% --creating new selector for []
% -running prover on /tmp/tmp1lAi_o/sel_SEU240+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU240+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU240+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU240+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
%
%------------------------------------------------------------------------------