%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU269+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 : 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 : Thu Dec 30 02:43:58 EST 2010
% Result : Theorem 2.41s
% Output : Solution 2.41s
% 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/SystemOnTPTP18682/SEU269+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18682/SEU269+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18682/SEU269+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 18778
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:relation(inclusion_relation(X1)),file('/tmp/SRASS.s.p', dt_k1_wellord2)).
% fof(3, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', t1_xboole_1)).
% fof(4, axiom,![X1]:(relation(X1)=>(transitive(X1)<=>is_transitive_in(X1,relation_field(X1)))),file('/tmp/SRASS.s.p', d16_relat_2)).
% fof(5, 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(21, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(23, axiom,![X1]:![X2]:(relation(X2)=>(X2=inclusion_relation(X1)<=>(relation_field(X2)=X1&![X3]:![X4]:((in(X3,X1)&in(X4,X1))=>(in(ordered_pair(X3,X4),X2)<=>subset(X3,X4)))))),file('/tmp/SRASS.s.p', d1_wellord2)).
% fof(40, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(52, conjecture,![X1]:transitive(inclusion_relation(X1)),file('/tmp/SRASS.s.p', t3_wellord2)).
% fof(53, negated_conjecture,~(![X1]:transitive(inclusion_relation(X1))),inference(assume_negation,[status(cth)],[52])).
% fof(60, plain,![X2]:relation(inclusion_relation(X2)),inference(variable_rename,[status(thm)],[1])).
% cnf(61,plain,(relation(inclusion_relation(X1))),inference(split_conjunct,[status(thm)],[60])).
% fof(64, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X2,X3)))|subset(X1,X3)),inference(fof_nnf,[status(thm)],[3])).
% fof(65, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6)),inference(variable_rename,[status(thm)],[64])).
% cnf(66,plain,(subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[65])).
% fof(67, 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)],[4])).
% fof(68, 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)],[67])).
% fof(69, 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)],[68])).
% cnf(70,plain,(transitive(X1)|~relation(X1)|~is_transitive_in(X1,relation_field(X1))),inference(split_conjunct,[status(thm)],[69])).
% fof(72, 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)],[5])).
% fof(73, 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)],[72])).
% fof(74, 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)],[73])).
% fof(75, 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)],[74])).
% fof(76, 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)],[75])).
% cnf(77,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)],[76])).
% cnf(78,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)],[76])).
% cnf(79,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)],[76])).
% cnf(80,plain,(is_transitive_in(X1,X2)|in(esk3_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[76])).
% cnf(81,plain,(is_transitive_in(X1,X2)|in(esk2_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[76])).
% cnf(82,plain,(is_transitive_in(X1,X2)|in(esk1_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[76])).
% fof(149, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[21])).
% cnf(150,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[149])).
% fof(154, plain,![X1]:![X2]:(~(relation(X2))|((~(X2=inclusion_relation(X1))|(relation_field(X2)=X1&![X3]:![X4]:((~(in(X3,X1))|~(in(X4,X1)))|((~(in(ordered_pair(X3,X4),X2))|subset(X3,X4))&(~(subset(X3,X4))|in(ordered_pair(X3,X4),X2))))))&((~(relation_field(X2)=X1)|?[X3]:?[X4]:((in(X3,X1)&in(X4,X1))&((~(in(ordered_pair(X3,X4),X2))|~(subset(X3,X4)))&(in(ordered_pair(X3,X4),X2)|subset(X3,X4)))))|X2=inclusion_relation(X1)))),inference(fof_nnf,[status(thm)],[23])).
% fof(155, plain,![X5]:![X6]:(~(relation(X6))|((~(X6=inclusion_relation(X5))|(relation_field(X6)=X5&![X7]:![X8]:((~(in(X7,X5))|~(in(X8,X5)))|((~(in(ordered_pair(X7,X8),X6))|subset(X7,X8))&(~(subset(X7,X8))|in(ordered_pair(X7,X8),X6))))))&((~(relation_field(X6)=X5)|?[X9]:?[X10]:((in(X9,X5)&in(X10,X5))&((~(in(ordered_pair(X9,X10),X6))|~(subset(X9,X10)))&(in(ordered_pair(X9,X10),X6)|subset(X9,X10)))))|X6=inclusion_relation(X5)))),inference(variable_rename,[status(thm)],[154])).
% fof(156, plain,![X5]:![X6]:(~(relation(X6))|((~(X6=inclusion_relation(X5))|(relation_field(X6)=X5&![X7]:![X8]:((~(in(X7,X5))|~(in(X8,X5)))|((~(in(ordered_pair(X7,X8),X6))|subset(X7,X8))&(~(subset(X7,X8))|in(ordered_pair(X7,X8),X6))))))&((~(relation_field(X6)=X5)|((in(esk13_2(X5,X6),X5)&in(esk14_2(X5,X6),X5))&((~(in(ordered_pair(esk13_2(X5,X6),esk14_2(X5,X6)),X6))|~(subset(esk13_2(X5,X6),esk14_2(X5,X6))))&(in(ordered_pair(esk13_2(X5,X6),esk14_2(X5,X6)),X6)|subset(esk13_2(X5,X6),esk14_2(X5,X6))))))|X6=inclusion_relation(X5)))),inference(skolemize,[status(esa)],[155])).
% fof(157, plain,![X5]:![X6]:![X7]:![X8]:((((((~(in(X7,X5))|~(in(X8,X5)))|((~(in(ordered_pair(X7,X8),X6))|subset(X7,X8))&(~(subset(X7,X8))|in(ordered_pair(X7,X8),X6))))&relation_field(X6)=X5)|~(X6=inclusion_relation(X5)))&((~(relation_field(X6)=X5)|((in(esk13_2(X5,X6),X5)&in(esk14_2(X5,X6),X5))&((~(in(ordered_pair(esk13_2(X5,X6),esk14_2(X5,X6)),X6))|~(subset(esk13_2(X5,X6),esk14_2(X5,X6))))&(in(ordered_pair(esk13_2(X5,X6),esk14_2(X5,X6)),X6)|subset(esk13_2(X5,X6),esk14_2(X5,X6))))))|X6=inclusion_relation(X5)))|~(relation(X6))),inference(shift_quantors,[status(thm)],[156])).
% fof(158, plain,![X5]:![X6]:![X7]:![X8]:(((((((~(in(ordered_pair(X7,X8),X6))|subset(X7,X8))|(~(in(X7,X5))|~(in(X8,X5))))|~(X6=inclusion_relation(X5)))|~(relation(X6)))&((((~(subset(X7,X8))|in(ordered_pair(X7,X8),X6))|(~(in(X7,X5))|~(in(X8,X5))))|~(X6=inclusion_relation(X5)))|~(relation(X6))))&((relation_field(X6)=X5|~(X6=inclusion_relation(X5)))|~(relation(X6))))&(((((in(esk13_2(X5,X6),X5)|~(relation_field(X6)=X5))|X6=inclusion_relation(X5))|~(relation(X6)))&(((in(esk14_2(X5,X6),X5)|~(relation_field(X6)=X5))|X6=inclusion_relation(X5))|~(relation(X6))))&(((((~(in(ordered_pair(esk13_2(X5,X6),esk14_2(X5,X6)),X6))|~(subset(esk13_2(X5,X6),esk14_2(X5,X6))))|~(relation_field(X6)=X5))|X6=inclusion_relation(X5))|~(relation(X6)))&((((in(ordered_pair(esk13_2(X5,X6),esk14_2(X5,X6)),X6)|subset(esk13_2(X5,X6),esk14_2(X5,X6)))|~(relation_field(X6)=X5))|X6=inclusion_relation(X5))|~(relation(X6)))))),inference(distribute,[status(thm)],[157])).
% cnf(163,plain,(relation_field(X1)=X2|~relation(X1)|X1!=inclusion_relation(X2)),inference(split_conjunct,[status(thm)],[158])).
% cnf(164,plain,(in(ordered_pair(X4,X3),X1)|~relation(X1)|X1!=inclusion_relation(X2)|~in(X3,X2)|~in(X4,X2)|~subset(X4,X3)),inference(split_conjunct,[status(thm)],[158])).
% cnf(165,plain,(subset(X4,X3)|~relation(X1)|X1!=inclusion_relation(X2)|~in(X3,X2)|~in(X4,X2)|~in(ordered_pair(X4,X3),X1)),inference(split_conjunct,[status(thm)],[158])).
% fof(220, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[40])).
% cnf(221,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[220])).
% fof(235, negated_conjecture,?[X1]:~(transitive(inclusion_relation(X1))),inference(fof_nnf,[status(thm)],[53])).
% fof(236, negated_conjecture,?[X2]:~(transitive(inclusion_relation(X2))),inference(variable_rename,[status(thm)],[235])).
% fof(237, negated_conjecture,~(transitive(inclusion_relation(esk16_0))),inference(skolemize,[status(esa)],[236])).
% cnf(238,negated_conjecture,(~transitive(inclusion_relation(esk16_0))),inference(split_conjunct,[status(thm)],[237])).
% cnf(239,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)],[79,150,theory(equality)]),['unfolding']).
% cnf(240,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)],[78,150,theory(equality)]),['unfolding']).
% cnf(241,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)],[77,150,theory(equality)]),['unfolding']).
% cnf(244,plain,(subset(X4,X3)|inclusion_relation(X2)!=X1|~relation(X1)|~in(X4,X2)|~in(X3,X2)|~in(unordered_pair(unordered_pair(X4,X3),singleton(X4)),X1)),inference(rw,[status(thm)],[165,150,theory(equality)]),['unfolding']).
% cnf(245,plain,(in(unordered_pair(unordered_pair(X4,X3),singleton(X4)),X1)|inclusion_relation(X2)!=X1|~relation(X1)|~subset(X4,X3)|~in(X4,X2)|~in(X3,X2)),inference(rw,[status(thm)],[164,150,theory(equality)]),['unfolding']).
% cnf(248,plain,(relation_field(inclusion_relation(X1))=X1|~relation(inclusion_relation(X1))),inference(er,[status(thm)],[163,theory(equality)])).
% cnf(249,plain,(relation_field(inclusion_relation(X1))=X1|$false),inference(rw,[status(thm)],[248,61,theory(equality)])).
% cnf(250,plain,(relation_field(inclusion_relation(X1))=X1),inference(cn,[status(thm)],[249,theory(equality)])).
% cnf(325,plain,(subset(X1,X2)|inclusion_relation(X3)!=X4|~in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X4)|~in(X1,X3)|~in(X2,X3)|~relation(X4)),inference(spm,[status(thm)],[244,221,theory(equality)])).
% cnf(331,plain,(in(unordered_pair(unordered_pair(esk1_2(X1,X2),X3),singleton(esk1_2(X1,X2))),X4)|is_transitive_in(X1,X2)|inclusion_relation(X2)!=X4|~in(X3,X2)|~subset(esk1_2(X1,X2),X3)|~relation(X4)|~relation(X1)),inference(spm,[status(thm)],[245,82,theory(equality)])).
% cnf(332,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)],[239,221,theory(equality)])).
% cnf(336,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)],[241,221,theory(equality)])).
% cnf(338,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)],[240,221,theory(equality)])).
% cnf(352,plain,(transitive(inclusion_relation(X1))|~is_transitive_in(inclusion_relation(X1),X1)|~relation(inclusion_relation(X1))),inference(spm,[status(thm)],[70,250,theory(equality)])).
% cnf(355,plain,(transitive(inclusion_relation(X1))|~is_transitive_in(inclusion_relation(X1),X1)|$false),inference(rw,[status(thm)],[352,61,theory(equality)])).
% cnf(356,plain,(transitive(inclusion_relation(X1))|~is_transitive_in(inclusion_relation(X1),X1)),inference(cn,[status(thm)],[355,theory(equality)])).
% cnf(613,plain,(subset(esk1_2(X1,X2),esk2_2(X1,X2))|is_transitive_in(X1,X2)|inclusion_relation(X3)!=X1|~in(esk1_2(X1,X2),X3)|~in(esk2_2(X1,X2),X3)|~relation(X1)),inference(spm,[status(thm)],[325,332,theory(equality)])).
% cnf(615,plain,(subset(esk2_2(X1,X2),esk3_2(X1,X2))|is_transitive_in(X1,X2)|inclusion_relation(X3)!=X1|~in(esk2_2(X1,X2),X3)|~in(esk3_2(X1,X2),X3)|~relation(X1)),inference(spm,[status(thm)],[325,338,theory(equality)])).
% cnf(919,plain,(in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),X3)),X4)|is_transitive_in(X1,X2)|inclusion_relation(X2)!=X4|~in(X3,X2)|~subset(esk1_2(X1,X2),X3)|~relation(X4)|~relation(X1)),inference(spm,[status(thm)],[331,221,theory(equality)])).
% cnf(4182,plain,(is_transitive_in(X1,X2)|subset(esk1_2(X1,X2),esk2_2(X1,X2))|inclusion_relation(X2)!=X1|~in(esk1_2(X1,X2),X2)|~relation(X1)),inference(spm,[status(thm)],[613,81,theory(equality)])).
% cnf(4307,plain,(is_transitive_in(X1,X2)|subset(esk2_2(X1,X2),esk3_2(X1,X2))|inclusion_relation(X2)!=X1|~in(esk2_2(X1,X2),X2)|~relation(X1)),inference(spm,[status(thm)],[615,80,theory(equality)])).
% cnf(14038,plain,(is_transitive_in(X1,X2)|~relation(X1)|inclusion_relation(X2)!=X1|~in(esk3_2(X1,X2),X2)|~subset(esk1_2(X1,X2),esk3_2(X1,X2))),inference(spm,[status(thm)],[336,919,theory(equality)])).
% cnf(14077,plain,(is_transitive_in(X1,X2)|inclusion_relation(X2)!=X1|~subset(esk1_2(X1,X2),esk3_2(X1,X2))|~relation(X1)),inference(csr,[status(thm)],[14038,80])).
% cnf(17147,plain,(is_transitive_in(X1,X2)|subset(esk1_2(X1,X2),esk2_2(X1,X2))|inclusion_relation(X2)!=X1|~relation(X1)),inference(csr,[status(thm)],[4182,82])).
% cnf(17700,plain,(is_transitive_in(X1,X2)|subset(esk2_2(X1,X2),esk3_2(X1,X2))|inclusion_relation(X2)!=X1|~relation(X1)),inference(csr,[status(thm)],[4307,81])).
% cnf(17702,plain,(subset(X1,esk3_2(X2,X3))|is_transitive_in(X2,X3)|~subset(X1,esk2_2(X2,X3))|inclusion_relation(X3)!=X2|~relation(X2)),inference(spm,[status(thm)],[66,17700,theory(equality)])).
% cnf(17773,plain,(is_transitive_in(X1,X2)|inclusion_relation(X2)!=X1|~relation(X1)|~subset(esk1_2(X1,X2),esk2_2(X1,X2))),inference(spm,[status(thm)],[14077,17702,theory(equality)])).
% cnf(17834,plain,(is_transitive_in(X1,X2)|inclusion_relation(X2)!=X1|~relation(X1)),inference(csr,[status(thm)],[17773,17147])).
% cnf(17835,plain,(transitive(inclusion_relation(X1))|~relation(inclusion_relation(X1))),inference(spm,[status(thm)],[356,17834,theory(equality)])).
% cnf(17837,plain,(transitive(inclusion_relation(X1))|$false),inference(rw,[status(thm)],[17835,61,theory(equality)])).
% cnf(17838,plain,(transitive(inclusion_relation(X1))),inference(cn,[status(thm)],[17837,theory(equality)])).
% cnf(17848,negated_conjecture,($false),inference(rw,[status(thm)],[238,17838,theory(equality)])).
% cnf(17849,negated_conjecture,($false),inference(cn,[status(thm)],[17848,theory(equality)])).
% cnf(17850,negated_conjecture,($false),17849,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2423
% # ...of these trivial : 8
% # ...subsumed : 1602
% # ...remaining for further processing: 813
% # Other redundant clauses eliminated : 11
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 43
% # Backward-rewritten : 21
% # Generated clauses : 13388
% # ...of the previous two non-trivial : 13084
% # Contextual simplify-reflections : 1072
% # Paramodulations : 13359
% # Factorizations : 2
% # Equation resolutions : 24
% # Current number of processed clauses: 748
% # Positive orientable unit clauses: 43
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 12
% # Non-unit-clauses : 691
% # Current number of unprocessed clauses: 10014
% # ...number of literals in the above : 90719
% # Clause-clause subsumption calls (NU) : 91278
% # Rec. Clause-clause subsumption calls : 32325
% # Unit Clause-clause subsumption calls : 443
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 17
% # Indexed BW rewrite successes : 15
% # Backwards rewriting index: 505 leaves, 2.30+/-2.833 terms/leaf
% # Paramod-from index: 141 leaves, 1.43+/-1.545 terms/leaf
% # Paramod-into index: 444 leaves, 2.06+/-2.217 terms/leaf
% # -------------------------------------------------
% # User time : 1.066 s
% # System time : 0.032 s
% # Total time : 1.098 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.53 CPU 1.61 WC
% FINAL PrfWatch: 1.53 CPU 1.61 WC
% SZS output end Solution for /tmp/SystemOnTPTP18682/SEU269+1.tptp
%
%------------------------------------------------------------------------------