TSTP Solution File: SEU240+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU240+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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 : Thu Dec 30 02:22:23 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP28220/SEU240+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28220/SEU240+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28220/SEU240+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 28318
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, 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/SRASS.s.p', d8_relat_2)).
% fof(3, axiom,![X1]:![X2]:![X3]:(relation(X3)=>(in(ordered_pair(X1,X2),X3)=>(in(X1,relation_field(X3))&in(X2,relation_field(X3))))),file('/tmp/SRASS.s.p', t30_relat_1)).
% fof(9, axiom,![X1]:(relation(X1)=>(transitive(X1)<=>is_transitive_in(X1,relation_field(X1)))),file('/tmp/SRASS.s.p', d16_relat_2)).
% fof(17, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(26, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(37, 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/SRASS.s.p', l2_wellord1)).
% 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)],[37])).
% fof(47, 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)],[2])).
% fof(48, 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)],[47])).
% fof(49, 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(esk1_2(X6,X7),X7)&in(esk2_2(X6,X7),X7))&in(esk3_2(X6,X7),X7))&in(ordered_pair(esk1_2(X6,X7),esk2_2(X6,X7)),X6))&in(ordered_pair(esk2_2(X6,X7),esk3_2(X6,X7)),X6))&~(in(ordered_pair(esk1_2(X6,X7),esk3_2(X6,X7)),X6)))|is_transitive_in(X6,X7)))),inference(skolemize,[status(esa)],[48])).
% fof(50, 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(esk1_2(X6,X7),X7)&in(esk2_2(X6,X7),X7))&in(esk3_2(X6,X7),X7))&in(ordered_pair(esk1_2(X6,X7),esk2_2(X6,X7)),X6))&in(ordered_pair(esk2_2(X6,X7),esk3_2(X6,X7)),X6))&~(in(ordered_pair(esk1_2(X6,X7),esk3_2(X6,X7)),X6)))|is_transitive_in(X6,X7)))|~(relation(X6))),inference(shift_quantors,[status(thm)],[49])).
% fof(51, 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(esk1_2(X6,X7),X7)|is_transitive_in(X6,X7))|~(relation(X6)))&((in(esk2_2(X6,X7),X7)|is_transitive_in(X6,X7))|~(relation(X6))))&((in(esk3_2(X6,X7),X7)|is_transitive_in(X6,X7))|~(relation(X6))))&((in(ordered_pair(esk1_2(X6,X7),esk2_2(X6,X7)),X6)|is_transitive_in(X6,X7))|~(relation(X6))))&((in(ordered_pair(esk2_2(X6,X7),esk3_2(X6,X7)),X6)|is_transitive_in(X6,X7))|~(relation(X6))))&((~(in(ordered_pair(esk1_2(X6,X7),esk3_2(X6,X7)),X6))|is_transitive_in(X6,X7))|~(relation(X6))))),inference(distribute,[status(thm)],[50])).
% cnf(52,plain,(is_transitive_in(X1,X2)|~relation(X1)|~in(ordered_pair(esk1_2(X1,X2),esk3_2(X1,X2)),X1)),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,plain,(is_transitive_in(X1,X2)|in(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[51])).
% cnf(54,plain,(is_transitive_in(X1,X2)|in(ordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[51])).
% cnf(58,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)],[51])).
% fof(59, 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)],[3])).
% fof(60, 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)],[59])).
% fof(61, 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)],[60])).
% cnf(62,plain,(in(X3,relation_field(X1))|~relation(X1)|~in(ordered_pair(X2,X3),X1)),inference(split_conjunct,[status(thm)],[61])).
% cnf(63,plain,(in(X2,relation_field(X1))|~relation(X1)|~in(ordered_pair(X2,X3),X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(78, 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)],[9])).
% fof(79, 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)],[78])).
% fof(80, 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)],[79])).
% cnf(81,plain,(transitive(X1)|~relation(X1)|~is_transitive_in(X1,relation_field(X1))),inference(split_conjunct,[status(thm)],[80])).
% cnf(82,plain,(is_transitive_in(X1,relation_field(X1))|~relation(X1)|~transitive(X1)),inference(split_conjunct,[status(thm)],[80])).
% fof(112, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[17])).
% cnf(113,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[112])).
% fof(134, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[26])).
% cnf(135,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[134])).
% fof(147, 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(148, 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)],[147])).
% fof(149, negated_conjecture,(relation(esk10_0)&((~(transitive(esk10_0))|((in(ordered_pair(esk11_0,esk12_0),esk10_0)&in(ordered_pair(esk12_0,esk13_0),esk10_0))&~(in(ordered_pair(esk11_0,esk13_0),esk10_0))))&(transitive(esk10_0)|![X9]:![X10]:![X11]:((~(in(ordered_pair(X9,X10),esk10_0))|~(in(ordered_pair(X10,X11),esk10_0)))|in(ordered_pair(X9,X11),esk10_0))))),inference(skolemize,[status(esa)],[148])).
% fof(150, negated_conjecture,![X9]:![X10]:![X11]:(((((~(in(ordered_pair(X9,X10),esk10_0))|~(in(ordered_pair(X10,X11),esk10_0)))|in(ordered_pair(X9,X11),esk10_0))|transitive(esk10_0))&(~(transitive(esk10_0))|((in(ordered_pair(esk11_0,esk12_0),esk10_0)&in(ordered_pair(esk12_0,esk13_0),esk10_0))&~(in(ordered_pair(esk11_0,esk13_0),esk10_0)))))&relation(esk10_0)),inference(shift_quantors,[status(thm)],[149])).
% fof(151, negated_conjecture,![X9]:![X10]:![X11]:(((((~(in(ordered_pair(X9,X10),esk10_0))|~(in(ordered_pair(X10,X11),esk10_0)))|in(ordered_pair(X9,X11),esk10_0))|transitive(esk10_0))&(((in(ordered_pair(esk11_0,esk12_0),esk10_0)|~(transitive(esk10_0)))&(in(ordered_pair(esk12_0,esk13_0),esk10_0)|~(transitive(esk10_0))))&(~(in(ordered_pair(esk11_0,esk13_0),esk10_0))|~(transitive(esk10_0)))))&relation(esk10_0)),inference(distribute,[status(thm)],[150])).
% cnf(152,negated_conjecture,(relation(esk10_0)),inference(split_conjunct,[status(thm)],[151])).
% cnf(153,negated_conjecture,(~transitive(esk10_0)|~in(ordered_pair(esk11_0,esk13_0),esk10_0)),inference(split_conjunct,[status(thm)],[151])).
% cnf(154,negated_conjecture,(in(ordered_pair(esk12_0,esk13_0),esk10_0)|~transitive(esk10_0)),inference(split_conjunct,[status(thm)],[151])).
% cnf(155,negated_conjecture,(in(ordered_pair(esk11_0,esk12_0),esk10_0)|~transitive(esk10_0)),inference(split_conjunct,[status(thm)],[151])).
% cnf(156,negated_conjecture,(transitive(esk10_0)|in(ordered_pair(X1,X2),esk10_0)|~in(ordered_pair(X3,X2),esk10_0)|~in(ordered_pair(X1,X3),esk10_0)),inference(split_conjunct,[status(thm)],[151])).
% cnf(157,negated_conjecture,(in(unordered_pair(unordered_pair(esk11_0,esk12_0),singleton(esk11_0)),esk10_0)|~transitive(esk10_0)),inference(rw,[status(thm)],[155,113,theory(equality)]),['unfolding']).
% cnf(158,negated_conjecture,(in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk10_0)|~transitive(esk10_0)),inference(rw,[status(thm)],[154,113,theory(equality)]),['unfolding']).
% cnf(159,plain,(is_transitive_in(X1,X2)|in(unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),singleton(esk1_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[54,113,theory(equality)]),['unfolding']).
% cnf(160,plain,(is_transitive_in(X1,X2)|in(unordered_pair(unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),singleton(esk2_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[53,113,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)],[62,113,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)],[63,113,theory(equality)]),['unfolding']).
% cnf(163,plain,(is_transitive_in(X1,X2)|~relation(X1)|~in(unordered_pair(unordered_pair(esk1_2(X1,X2),esk3_2(X1,X2)),singleton(esk1_2(X1,X2))),X1)),inference(rw,[status(thm)],[52,113,theory(equality)]),['unfolding']).
% cnf(164,negated_conjecture,(transitive(esk10_0)|in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk10_0)|~in(unordered_pair(unordered_pair(X3,X2),singleton(X3)),esk10_0)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),esk10_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[156,113,theory(equality)]),113,theory(equality)]),113,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)],[58,113,theory(equality)]),113,theory(equality)]),113,theory(equality)]),['unfolding']).
% cnf(167,negated_conjecture,(~transitive(esk10_0)|~in(unordered_pair(unordered_pair(esk11_0,esk13_0),singleton(esk11_0)),esk10_0)),inference(rw,[status(thm)],[153,113,theory(equality)]),['unfolding']).
% cnf(204,negated_conjecture,(in(esk12_0,relation_field(esk10_0))|~relation(esk10_0)|~transitive(esk10_0)),inference(spm,[status(thm)],[161,157,theory(equality)])).
% cnf(205,negated_conjecture,(in(esk13_0,relation_field(esk10_0))|~relation(esk10_0)|~transitive(esk10_0)),inference(spm,[status(thm)],[161,158,theory(equality)])).
% cnf(206,negated_conjecture,(in(esk12_0,relation_field(esk10_0))|$false|~transitive(esk10_0)),inference(rw,[status(thm)],[204,152,theory(equality)])).
% cnf(207,negated_conjecture,(in(esk12_0,relation_field(esk10_0))|~transitive(esk10_0)),inference(cn,[status(thm)],[206,theory(equality)])).
% cnf(208,negated_conjecture,(in(esk13_0,relation_field(esk10_0))|$false|~transitive(esk10_0)),inference(rw,[status(thm)],[205,152,theory(equality)])).
% cnf(209,negated_conjecture,(in(esk13_0,relation_field(esk10_0))|~transitive(esk10_0)),inference(cn,[status(thm)],[208,theory(equality)])).
% cnf(214,negated_conjecture,(in(esk11_0,relation_field(esk10_0))|~relation(esk10_0)|~transitive(esk10_0)),inference(spm,[status(thm)],[162,157,theory(equality)])).
% cnf(216,negated_conjecture,(in(esk11_0,relation_field(esk10_0))|$false|~transitive(esk10_0)),inference(rw,[status(thm)],[214,152,theory(equality)])).
% cnf(217,negated_conjecture,(in(esk11_0,relation_field(esk10_0))|~transitive(esk10_0)),inference(cn,[status(thm)],[216,theory(equality)])).
% cnf(228,plain,(is_transitive_in(X1,X2)|~relation(X1)|~in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk3_2(X1,X2))),X1)),inference(rw,[status(thm)],[163,135,theory(equality)])).
% cnf(231,negated_conjecture,(transitive(esk10_0)|in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk10_0)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X2)),esk10_0)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),esk10_0)),inference(spm,[status(thm)],[164,135,theory(equality)])).
% cnf(235,plain,(is_transitive_in(X1,X2)|in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[159,135,theory(equality)])).
% cnf(238,plain,(is_transitive_in(X1,X2)|in(unordered_pair(singleton(esk2_2(X1,X2)),unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2))),X1)|~relation(X1)),inference(rw,[status(thm)],[160,135,theory(equality)])).
% cnf(246,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk13_0),singleton(X1)),esk10_0)|~is_transitive_in(esk10_0,X2)|~relation(esk10_0)|~in(unordered_pair(unordered_pair(X1,esk12_0),singleton(X1)),esk10_0)|~in(esk12_0,X2)|~in(esk13_0,X2)|~in(X1,X2)|~transitive(esk10_0)),inference(spm,[status(thm)],[165,158,theory(equality)])).
% cnf(249,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk13_0),singleton(X1)),esk10_0)|~is_transitive_in(esk10_0,X2)|$false|~in(unordered_pair(unordered_pair(X1,esk12_0),singleton(X1)),esk10_0)|~in(esk12_0,X2)|~in(esk13_0,X2)|~in(X1,X2)|~transitive(esk10_0)),inference(rw,[status(thm)],[246,152,theory(equality)])).
% cnf(250,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk13_0),singleton(X1)),esk10_0)|~is_transitive_in(esk10_0,X2)|~in(unordered_pair(unordered_pair(X1,esk12_0),singleton(X1)),esk10_0)|~in(esk12_0,X2)|~in(esk13_0,X2)|~in(X1,X2)|~transitive(esk10_0)),inference(cn,[status(thm)],[249,theory(equality)])).
% cnf(353,negated_conjecture,(transitive(esk10_0)|in(unordered_pair(unordered_pair(X1,esk3_2(esk10_0,X2)),singleton(X1)),esk10_0)|is_transitive_in(esk10_0,X2)|~in(unordered_pair(unordered_pair(X1,esk2_2(esk10_0,X2)),singleton(X1)),esk10_0)|~relation(esk10_0)),inference(spm,[status(thm)],[231,238,theory(equality)])).
% cnf(356,negated_conjecture,(transitive(esk10_0)|in(unordered_pair(unordered_pair(X1,esk3_2(esk10_0,X2)),singleton(X1)),esk10_0)|is_transitive_in(esk10_0,X2)|~in(unordered_pair(unordered_pair(X1,esk2_2(esk10_0,X2)),singleton(X1)),esk10_0)|$false),inference(rw,[status(thm)],[353,152,theory(equality)])).
% cnf(357,negated_conjecture,(transitive(esk10_0)|in(unordered_pair(unordered_pair(X1,esk3_2(esk10_0,X2)),singleton(X1)),esk10_0)|is_transitive_in(esk10_0,X2)|~in(unordered_pair(unordered_pair(X1,esk2_2(esk10_0,X2)),singleton(X1)),esk10_0)),inference(cn,[status(thm)],[356,theory(equality)])).
% cnf(689,negated_conjecture,(transitive(esk10_0)|in(unordered_pair(singleton(X1),unordered_pair(X1,esk3_2(esk10_0,X2))),esk10_0)|is_transitive_in(esk10_0,X2)|~in(unordered_pair(unordered_pair(X1,esk2_2(esk10_0,X2)),singleton(X1)),esk10_0)),inference(rw,[status(thm)],[357,135,theory(equality)])).
% cnf(690,negated_conjecture,(transitive(esk10_0)|in(unordered_pair(singleton(X1),unordered_pair(X1,esk3_2(esk10_0,X2))),esk10_0)|is_transitive_in(esk10_0,X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,esk2_2(esk10_0,X2))),esk10_0)),inference(rw,[status(thm)],[689,135,theory(equality)])).
% cnf(695,negated_conjecture,(is_transitive_in(esk10_0,X1)|transitive(esk10_0)|~relation(esk10_0)|~in(unordered_pair(singleton(esk1_2(esk10_0,X1)),unordered_pair(esk1_2(esk10_0,X1),esk2_2(esk10_0,X1))),esk10_0)),inference(spm,[status(thm)],[228,690,theory(equality)])).
% cnf(707,negated_conjecture,(is_transitive_in(esk10_0,X1)|transitive(esk10_0)|$false|~in(unordered_pair(singleton(esk1_2(esk10_0,X1)),unordered_pair(esk1_2(esk10_0,X1),esk2_2(esk10_0,X1))),esk10_0)),inference(rw,[status(thm)],[695,152,theory(equality)])).
% cnf(708,negated_conjecture,(is_transitive_in(esk10_0,X1)|transitive(esk10_0)|~in(unordered_pair(singleton(esk1_2(esk10_0,X1)),unordered_pair(esk1_2(esk10_0,X1),esk2_2(esk10_0,X1))),esk10_0)),inference(cn,[status(thm)],[707,theory(equality)])).
% cnf(737,negated_conjecture,(transitive(esk10_0)|is_transitive_in(esk10_0,X1)|~relation(esk10_0)),inference(spm,[status(thm)],[708,235,theory(equality)])).
% cnf(739,negated_conjecture,(transitive(esk10_0)|is_transitive_in(esk10_0,X1)|$false),inference(rw,[status(thm)],[737,152,theory(equality)])).
% cnf(740,negated_conjecture,(transitive(esk10_0)|is_transitive_in(esk10_0,X1)),inference(cn,[status(thm)],[739,theory(equality)])).
% cnf(741,negated_conjecture,(transitive(esk10_0)|~relation(esk10_0)),inference(spm,[status(thm)],[81,740,theory(equality)])).
% cnf(745,negated_conjecture,(transitive(esk10_0)|$false),inference(rw,[status(thm)],[741,152,theory(equality)])).
% cnf(746,negated_conjecture,(transitive(esk10_0)),inference(cn,[status(thm)],[745,theory(equality)])).
% cnf(748,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk13_0),singleton(X1)),esk10_0)|$false|~is_transitive_in(esk10_0,X2)|~in(unordered_pair(unordered_pair(X1,esk12_0),singleton(X1)),esk10_0)|~in(esk12_0,X2)|~in(esk13_0,X2)|~in(X1,X2)),inference(rw,[status(thm)],[250,746,theory(equality)])).
% cnf(749,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk13_0),singleton(X1)),esk10_0)|~is_transitive_in(esk10_0,X2)|~in(unordered_pair(unordered_pair(X1,esk12_0),singleton(X1)),esk10_0)|~in(esk12_0,X2)|~in(esk13_0,X2)|~in(X1,X2)),inference(cn,[status(thm)],[748,theory(equality)])).
% cnf(756,negated_conjecture,(in(esk11_0,relation_field(esk10_0))|$false),inference(rw,[status(thm)],[217,746,theory(equality)])).
% cnf(757,negated_conjecture,(in(esk11_0,relation_field(esk10_0))),inference(cn,[status(thm)],[756,theory(equality)])).
% cnf(758,negated_conjecture,(in(esk13_0,relation_field(esk10_0))|$false),inference(rw,[status(thm)],[209,746,theory(equality)])).
% cnf(759,negated_conjecture,(in(esk13_0,relation_field(esk10_0))),inference(cn,[status(thm)],[758,theory(equality)])).
% cnf(760,negated_conjecture,(in(esk12_0,relation_field(esk10_0))|$false),inference(rw,[status(thm)],[207,746,theory(equality)])).
% cnf(761,negated_conjecture,(in(esk12_0,relation_field(esk10_0))),inference(cn,[status(thm)],[760,theory(equality)])).
% cnf(775,negated_conjecture,($false|~in(unordered_pair(unordered_pair(esk11_0,esk13_0),singleton(esk11_0)),esk10_0)),inference(rw,[status(thm)],[167,746,theory(equality)])).
% cnf(776,negated_conjecture,(~in(unordered_pair(unordered_pair(esk11_0,esk13_0),singleton(esk11_0)),esk10_0)),inference(cn,[status(thm)],[775,theory(equality)])).
% cnf(779,negated_conjecture,(in(unordered_pair(unordered_pair(esk11_0,esk12_0),singleton(esk11_0)),esk10_0)|$false),inference(rw,[status(thm)],[157,746,theory(equality)])).
% cnf(780,negated_conjecture,(in(unordered_pair(unordered_pair(esk11_0,esk12_0),singleton(esk11_0)),esk10_0)),inference(cn,[status(thm)],[779,theory(equality)])).
% cnf(781,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk13_0),singleton(X1)),esk10_0)|~in(unordered_pair(unordered_pair(X1,esk12_0),singleton(X1)),esk10_0)|~in(esk12_0,relation_field(esk10_0))|~in(esk13_0,relation_field(esk10_0))|~in(X1,relation_field(esk10_0))|~transitive(esk10_0)|~relation(esk10_0)),inference(spm,[status(thm)],[749,82,theory(equality)])).
% cnf(784,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk13_0),singleton(X1)),esk10_0)|~in(unordered_pair(unordered_pair(X1,esk12_0),singleton(X1)),esk10_0)|~in(esk12_0,relation_field(esk10_0))|~in(esk13_0,relation_field(esk10_0))|~in(X1,relation_field(esk10_0))|$false|~relation(esk10_0)),inference(rw,[status(thm)],[781,746,theory(equality)])).
% cnf(785,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk13_0),singleton(X1)),esk10_0)|~in(unordered_pair(unordered_pair(X1,esk12_0),singleton(X1)),esk10_0)|~in(esk12_0,relation_field(esk10_0))|~in(esk13_0,relation_field(esk10_0))|~in(X1,relation_field(esk10_0))|$false|$false),inference(rw,[status(thm)],[784,152,theory(equality)])).
% cnf(786,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk13_0),singleton(X1)),esk10_0)|~in(unordered_pair(unordered_pair(X1,esk12_0),singleton(X1)),esk10_0)|~in(esk12_0,relation_field(esk10_0))|~in(esk13_0,relation_field(esk10_0))|~in(X1,relation_field(esk10_0))),inference(cn,[status(thm)],[785,theory(equality)])).
% cnf(1031,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk13_0),singleton(X1)),esk10_0)|~in(unordered_pair(unordered_pair(X1,esk12_0),singleton(X1)),esk10_0)|$false|~in(esk13_0,relation_field(esk10_0))|~in(X1,relation_field(esk10_0))),inference(rw,[status(thm)],[786,761,theory(equality)])).
% cnf(1032,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk13_0),singleton(X1)),esk10_0)|~in(unordered_pair(unordered_pair(X1,esk12_0),singleton(X1)),esk10_0)|$false|$false|~in(X1,relation_field(esk10_0))),inference(rw,[status(thm)],[1031,759,theory(equality)])).
% cnf(1033,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk13_0),singleton(X1)),esk10_0)|~in(unordered_pair(unordered_pair(X1,esk12_0),singleton(X1)),esk10_0)|~in(X1,relation_field(esk10_0))),inference(cn,[status(thm)],[1032,theory(equality)])).
% cnf(1036,negated_conjecture,(in(unordered_pair(unordered_pair(esk11_0,esk13_0),singleton(esk11_0)),esk10_0)|~in(unordered_pair(unordered_pair(esk11_0,esk12_0),singleton(esk11_0)),esk10_0)),inference(spm,[status(thm)],[1033,757,theory(equality)])).
% cnf(1047,negated_conjecture,(in(unordered_pair(unordered_pair(esk11_0,esk13_0),singleton(esk11_0)),esk10_0)|$false),inference(rw,[status(thm)],[1036,780,theory(equality)])).
% cnf(1048,negated_conjecture,(in(unordered_pair(unordered_pair(esk11_0,esk13_0),singleton(esk11_0)),esk10_0)),inference(cn,[status(thm)],[1047,theory(equality)])).
% cnf(1049,negated_conjecture,($false),inference(sr,[status(thm)],[1048,776,theory(equality)])).
% cnf(1050,negated_conjecture,($false),1049,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 403
% # ...of these trivial : 1
% # ...subsumed : 248
% # ...remaining for further processing: 154
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 24
% # Generated clauses : 513
% # ...of the previous two non-trivial : 471
% # Contextual simplify-reflections : 180
% # Paramodulations : 513
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 120
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 13
% # Non-unit-clauses : 84
% # Current number of unprocessed clauses: 81
% # ...number of literals in the above : 567
% # Clause-clause subsumption calls (NU) : 3155
% # Rec. Clause-clause subsumption calls : 1680
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 14
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 117 leaves, 1.58+/-1.592 terms/leaf
% # Paramod-from index: 48 leaves, 1.21+/-0.455 terms/leaf
% # Paramod-into index: 105 leaves, 1.50+/-1.435 terms/leaf
% # -------------------------------------------------
% # User time : 0.062 s
% # System time : 0.001 s
% # Total time : 0.063 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.25 WC
% FINAL PrfWatch: 0.16 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP28220/SEU240+1.tptp
%
%------------------------------------------------------------------------------