TSTP Solution File: SEU242+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU242+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 02:29:57 EST 2010
% Result : Theorem 1.23s
% Output : Solution 1.23s
% 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/SystemOnTPTP5313/SEU242+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5313/SEU242+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5313/SEU242+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 5445
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(relation(X1)=>![X2]:(is_connected_in(X1,X2)<=>![X3]:![X4]:~(((((in(X3,X2)&in(X4,X2))&~(X3=X4))&~(in(ordered_pair(X3,X4),X1)))&~(in(ordered_pair(X4,X3),X1)))))),file('/tmp/SRASS.s.p', d6_relat_2)).
% fof(3, axiom,![X1]:(relation(X1)=>(connected(X1)<=>is_connected_in(X1,relation_field(X1)))),file('/tmp/SRASS.s.p', d14_relat_2)).
% fof(15, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(16, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(36, conjecture,![X1]:(relation(X1)=>(connected(X1)<=>![X2]:![X3]:~(((((in(X2,relation_field(X1))&in(X3,relation_field(X1)))&~(X2=X3))&~(in(ordered_pair(X2,X3),X1)))&~(in(ordered_pair(X3,X2),X1)))))),file('/tmp/SRASS.s.p', l4_wellord1)).
% fof(37, negated_conjecture,~(![X1]:(relation(X1)=>(connected(X1)<=>![X2]:![X3]:~(((((in(X2,relation_field(X1))&in(X3,relation_field(X1)))&~(X2=X3))&~(in(ordered_pair(X2,X3),X1)))&~(in(ordered_pair(X3,X2),X1))))))),inference(assume_negation,[status(cth)],[36])).
% fof(39, plain,![X1]:(relation(X1)=>![X2]:(is_connected_in(X1,X2)<=>![X3]:![X4]:~(((((in(X3,X2)&in(X4,X2))&~(X3=X4))&~(in(ordered_pair(X3,X4),X1)))&~(in(ordered_pair(X4,X3),X1)))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(44, negated_conjecture,~(![X1]:(relation(X1)=>(connected(X1)<=>![X2]:![X3]:~(((((in(X2,relation_field(X1))&in(X3,relation_field(X1)))&~(X2=X3))&~(in(ordered_pair(X2,X3),X1)))&~(in(ordered_pair(X3,X2),X1))))))),inference(fof_simplification,[status(thm)],[37,theory(equality)])).
% fof(48, plain,![X1]:(~(relation(X1))|![X2]:((~(is_connected_in(X1,X2))|![X3]:![X4]:((((~(in(X3,X2))|~(in(X4,X2)))|X3=X4)|in(ordered_pair(X3,X4),X1))|in(ordered_pair(X4,X3),X1)))&(?[X3]:?[X4]:((((in(X3,X2)&in(X4,X2))&~(X3=X4))&~(in(ordered_pair(X3,X4),X1)))&~(in(ordered_pair(X4,X3),X1)))|is_connected_in(X1,X2)))),inference(fof_nnf,[status(thm)],[39])).
% fof(49, plain,![X5]:(~(relation(X5))|![X6]:((~(is_connected_in(X5,X6))|![X7]:![X8]:((((~(in(X7,X6))|~(in(X8,X6)))|X7=X8)|in(ordered_pair(X7,X8),X5))|in(ordered_pair(X8,X7),X5)))&(?[X9]:?[X10]:((((in(X9,X6)&in(X10,X6))&~(X9=X10))&~(in(ordered_pair(X9,X10),X5)))&~(in(ordered_pair(X10,X9),X5)))|is_connected_in(X5,X6)))),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,![X5]:(~(relation(X5))|![X6]:((~(is_connected_in(X5,X6))|![X7]:![X8]:((((~(in(X7,X6))|~(in(X8,X6)))|X7=X8)|in(ordered_pair(X7,X8),X5))|in(ordered_pair(X8,X7),X5)))&(((((in(esk1_2(X5,X6),X6)&in(esk2_2(X5,X6),X6))&~(esk1_2(X5,X6)=esk2_2(X5,X6)))&~(in(ordered_pair(esk1_2(X5,X6),esk2_2(X5,X6)),X5)))&~(in(ordered_pair(esk2_2(X5,X6),esk1_2(X5,X6)),X5)))|is_connected_in(X5,X6)))),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X5]:![X6]:![X7]:![X8]:(((((((~(in(X7,X6))|~(in(X8,X6)))|X7=X8)|in(ordered_pair(X7,X8),X5))|in(ordered_pair(X8,X7),X5))|~(is_connected_in(X5,X6)))&(((((in(esk1_2(X5,X6),X6)&in(esk2_2(X5,X6),X6))&~(esk1_2(X5,X6)=esk2_2(X5,X6)))&~(in(ordered_pair(esk1_2(X5,X6),esk2_2(X5,X6)),X5)))&~(in(ordered_pair(esk2_2(X5,X6),esk1_2(X5,X6)),X5)))|is_connected_in(X5,X6)))|~(relation(X5))),inference(shift_quantors,[status(thm)],[50])).
% fof(52, plain,![X5]:![X6]:![X7]:![X8]:(((((((~(in(X7,X6))|~(in(X8,X6)))|X7=X8)|in(ordered_pair(X7,X8),X5))|in(ordered_pair(X8,X7),X5))|~(is_connected_in(X5,X6)))|~(relation(X5)))&((((((in(esk1_2(X5,X6),X6)|is_connected_in(X5,X6))|~(relation(X5)))&((in(esk2_2(X5,X6),X6)|is_connected_in(X5,X6))|~(relation(X5))))&((~(esk1_2(X5,X6)=esk2_2(X5,X6))|is_connected_in(X5,X6))|~(relation(X5))))&((~(in(ordered_pair(esk1_2(X5,X6),esk2_2(X5,X6)),X5))|is_connected_in(X5,X6))|~(relation(X5))))&((~(in(ordered_pair(esk2_2(X5,X6),esk1_2(X5,X6)),X5))|is_connected_in(X5,X6))|~(relation(X5))))),inference(distribute,[status(thm)],[51])).
% cnf(53,plain,(is_connected_in(X1,X2)|~relation(X1)|~in(ordered_pair(esk2_2(X1,X2),esk1_2(X1,X2)),X1)),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,plain,(is_connected_in(X1,X2)|~relation(X1)|~in(ordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),X1)),inference(split_conjunct,[status(thm)],[52])).
% cnf(55,plain,(is_connected_in(X1,X2)|~relation(X1)|esk1_2(X1,X2)!=esk2_2(X1,X2)),inference(split_conjunct,[status(thm)],[52])).
% cnf(56,plain,(is_connected_in(X1,X2)|in(esk2_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[52])).
% cnf(57,plain,(is_connected_in(X1,X2)|in(esk1_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[52])).
% cnf(58,plain,(in(ordered_pair(X3,X4),X1)|in(ordered_pair(X4,X3),X1)|X4=X3|~relation(X1)|~is_connected_in(X1,X2)|~in(X3,X2)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[52])).
% fof(59, plain,![X1]:(~(relation(X1))|((~(connected(X1))|is_connected_in(X1,relation_field(X1)))&(~(is_connected_in(X1,relation_field(X1)))|connected(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(60, plain,![X2]:(~(relation(X2))|((~(connected(X2))|is_connected_in(X2,relation_field(X2)))&(~(is_connected_in(X2,relation_field(X2)))|connected(X2)))),inference(variable_rename,[status(thm)],[59])).
% fof(61, plain,![X2]:(((~(connected(X2))|is_connected_in(X2,relation_field(X2)))|~(relation(X2)))&((~(is_connected_in(X2,relation_field(X2)))|connected(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[60])).
% cnf(62,plain,(connected(X1)|~relation(X1)|~is_connected_in(X1,relation_field(X1))),inference(split_conjunct,[status(thm)],[61])).
% cnf(63,plain,(is_connected_in(X1,relation_field(X1))|~relation(X1)|~connected(X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(95, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[15])).
% cnf(96,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[95])).
% fof(97, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[16])).
% cnf(98,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[97])).
% fof(142, negated_conjecture,?[X1]:(relation(X1)&((~(connected(X1))|?[X2]:?[X3]:((((in(X2,relation_field(X1))&in(X3,relation_field(X1)))&~(X2=X3))&~(in(ordered_pair(X2,X3),X1)))&~(in(ordered_pair(X3,X2),X1))))&(connected(X1)|![X2]:![X3]:((((~(in(X2,relation_field(X1)))|~(in(X3,relation_field(X1))))|X2=X3)|in(ordered_pair(X2,X3),X1))|in(ordered_pair(X3,X2),X1))))),inference(fof_nnf,[status(thm)],[44])).
% fof(143, negated_conjecture,?[X4]:(relation(X4)&((~(connected(X4))|?[X5]:?[X6]:((((in(X5,relation_field(X4))&in(X6,relation_field(X4)))&~(X5=X6))&~(in(ordered_pair(X5,X6),X4)))&~(in(ordered_pair(X6,X5),X4))))&(connected(X4)|![X7]:![X8]:((((~(in(X7,relation_field(X4)))|~(in(X8,relation_field(X4))))|X7=X8)|in(ordered_pair(X7,X8),X4))|in(ordered_pair(X8,X7),X4))))),inference(variable_rename,[status(thm)],[142])).
% fof(144, negated_conjecture,(relation(esk9_0)&((~(connected(esk9_0))|((((in(esk10_0,relation_field(esk9_0))&in(esk11_0,relation_field(esk9_0)))&~(esk10_0=esk11_0))&~(in(ordered_pair(esk10_0,esk11_0),esk9_0)))&~(in(ordered_pair(esk11_0,esk10_0),esk9_0))))&(connected(esk9_0)|![X7]:![X8]:((((~(in(X7,relation_field(esk9_0)))|~(in(X8,relation_field(esk9_0))))|X7=X8)|in(ordered_pair(X7,X8),esk9_0))|in(ordered_pair(X8,X7),esk9_0))))),inference(skolemize,[status(esa)],[143])).
% fof(145, negated_conjecture,![X7]:![X8]:(((((((~(in(X7,relation_field(esk9_0)))|~(in(X8,relation_field(esk9_0))))|X7=X8)|in(ordered_pair(X7,X8),esk9_0))|in(ordered_pair(X8,X7),esk9_0))|connected(esk9_0))&(~(connected(esk9_0))|((((in(esk10_0,relation_field(esk9_0))&in(esk11_0,relation_field(esk9_0)))&~(esk10_0=esk11_0))&~(in(ordered_pair(esk10_0,esk11_0),esk9_0)))&~(in(ordered_pair(esk11_0,esk10_0),esk9_0)))))&relation(esk9_0)),inference(shift_quantors,[status(thm)],[144])).
% fof(146, negated_conjecture,![X7]:![X8]:(((((((~(in(X7,relation_field(esk9_0)))|~(in(X8,relation_field(esk9_0))))|X7=X8)|in(ordered_pair(X7,X8),esk9_0))|in(ordered_pair(X8,X7),esk9_0))|connected(esk9_0))&(((((in(esk10_0,relation_field(esk9_0))|~(connected(esk9_0)))&(in(esk11_0,relation_field(esk9_0))|~(connected(esk9_0))))&(~(esk10_0=esk11_0)|~(connected(esk9_0))))&(~(in(ordered_pair(esk10_0,esk11_0),esk9_0))|~(connected(esk9_0))))&(~(in(ordered_pair(esk11_0,esk10_0),esk9_0))|~(connected(esk9_0)))))&relation(esk9_0)),inference(distribute,[status(thm)],[145])).
% cnf(147,negated_conjecture,(relation(esk9_0)),inference(split_conjunct,[status(thm)],[146])).
% cnf(148,negated_conjecture,(~connected(esk9_0)|~in(ordered_pair(esk11_0,esk10_0),esk9_0)),inference(split_conjunct,[status(thm)],[146])).
% cnf(149,negated_conjecture,(~connected(esk9_0)|~in(ordered_pair(esk10_0,esk11_0),esk9_0)),inference(split_conjunct,[status(thm)],[146])).
% cnf(150,negated_conjecture,(~connected(esk9_0)|esk10_0!=esk11_0),inference(split_conjunct,[status(thm)],[146])).
% cnf(151,negated_conjecture,(in(esk11_0,relation_field(esk9_0))|~connected(esk9_0)),inference(split_conjunct,[status(thm)],[146])).
% cnf(152,negated_conjecture,(in(esk10_0,relation_field(esk9_0))|~connected(esk9_0)),inference(split_conjunct,[status(thm)],[146])).
% cnf(153,negated_conjecture,(connected(esk9_0)|in(ordered_pair(X1,X2),esk9_0)|in(ordered_pair(X2,X1),esk9_0)|X2=X1|~in(X1,relation_field(esk9_0))|~in(X2,relation_field(esk9_0))),inference(split_conjunct,[status(thm)],[146])).
% cnf(154,plain,(is_connected_in(X1,X2)|~relation(X1)|~in(unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),singleton(esk1_2(X1,X2))),X1)),inference(rw,[status(thm)],[54,96,theory(equality)]),['unfolding']).
% cnf(155,plain,(is_connected_in(X1,X2)|~relation(X1)|~in(unordered_pair(unordered_pair(esk2_2(X1,X2),esk1_2(X1,X2)),singleton(esk2_2(X1,X2))),X1)),inference(rw,[status(thm)],[53,96,theory(equality)]),['unfolding']).
% cnf(156,negated_conjecture,(X1=X2|connected(esk9_0)|in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),esk9_0)|in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk9_0)|~in(X2,relation_field(esk9_0))|~in(X1,relation_field(esk9_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[153,96,theory(equality)]),96,theory(equality)]),['unfolding']).
% cnf(157,plain,(X3=X4|in(unordered_pair(unordered_pair(X4,X3),singleton(X4)),X1)|in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)|~relation(X1)|~in(X4,X2)|~in(X3,X2)|~is_connected_in(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[58,96,theory(equality)]),96,theory(equality)]),['unfolding']).
% cnf(159,negated_conjecture,(~connected(esk9_0)|~in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0)),esk9_0)),inference(rw,[status(thm)],[149,96,theory(equality)]),['unfolding']).
% cnf(160,negated_conjecture,(~connected(esk9_0)|~in(unordered_pair(unordered_pair(esk11_0,esk10_0),singleton(esk11_0)),esk9_0)),inference(rw,[status(thm)],[148,96,theory(equality)]),['unfolding']).
% cnf(178,negated_conjecture,(~connected(esk9_0)|~in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk11_0)),esk9_0)),inference(rw,[status(thm)],[160,98,theory(equality)])).
% cnf(200,plain,(is_connected_in(X1,X2)|~relation(X1)|~in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2))),X1)),inference(rw,[status(thm)],[154,98,theory(equality)])).
% cnf(201,plain,(is_connected_in(X1,X2)|~relation(X1)|~in(unordered_pair(singleton(esk2_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2))),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[155,98,theory(equality)]),98,theory(equality)])).
% cnf(204,negated_conjecture,(X1=esk2_2(X2,relation_field(esk9_0))|connected(esk9_0)|in(unordered_pair(unordered_pair(X1,esk2_2(X2,relation_field(esk9_0))),singleton(X1)),esk9_0)|in(unordered_pair(unordered_pair(esk2_2(X2,relation_field(esk9_0)),X1),singleton(esk2_2(X2,relation_field(esk9_0)))),esk9_0)|is_connected_in(X2,relation_field(esk9_0))|~in(X1,relation_field(esk9_0))|~relation(X2)),inference(spm,[status(thm)],[156,56,theory(equality)])).
% cnf(206,plain,(X1=X2|in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)|in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),X3)|~relation(X3)|~in(X2,relation_field(X3))|~in(X1,relation_field(X3))|~connected(X3)),inference(spm,[status(thm)],[157,63,theory(equality)])).
% cnf(254,negated_conjecture,(X1=esk2_2(X2,relation_field(esk9_0))|connected(esk9_0)|in(unordered_pair(singleton(X1),unordered_pair(X1,esk2_2(X2,relation_field(esk9_0)))),esk9_0)|in(unordered_pair(unordered_pair(esk2_2(X2,relation_field(esk9_0)),X1),singleton(esk2_2(X2,relation_field(esk9_0)))),esk9_0)|is_connected_in(X2,relation_field(esk9_0))|~in(X1,relation_field(esk9_0))|~relation(X2)),inference(rw,[status(thm)],[204,98,theory(equality)])).
% cnf(259,negated_conjecture,(esk1_2(X1,relation_field(esk9_0))=esk2_2(X2,relation_field(esk9_0))|connected(esk9_0)|is_connected_in(X2,relation_field(esk9_0))|in(unordered_pair(unordered_pair(esk2_2(X2,relation_field(esk9_0)),esk1_2(X1,relation_field(esk9_0))),singleton(esk2_2(X2,relation_field(esk9_0)))),esk9_0)|in(unordered_pair(singleton(esk1_2(X1,relation_field(esk9_0))),unordered_pair(esk1_2(X1,relation_field(esk9_0)),esk2_2(X2,relation_field(esk9_0)))),esk9_0)|is_connected_in(X1,relation_field(esk9_0))|~relation(X2)|~relation(X1)),inference(spm,[status(thm)],[254,57,theory(equality)])).
% cnf(290,negated_conjecture,(X1=esk10_0|in(unordered_pair(unordered_pair(esk10_0,X1),singleton(esk10_0)),esk9_0)|in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk9_0)|~connected(esk9_0)|~relation(esk9_0)|~in(X1,relation_field(esk9_0))),inference(spm,[status(thm)],[206,152,theory(equality)])).
% cnf(296,negated_conjecture,(X1=esk10_0|in(unordered_pair(unordered_pair(esk10_0,X1),singleton(esk10_0)),esk9_0)|in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk9_0)|~connected(esk9_0)|$false|~in(X1,relation_field(esk9_0))),inference(rw,[status(thm)],[290,147,theory(equality)])).
% cnf(297,negated_conjecture,(X1=esk10_0|in(unordered_pair(unordered_pair(esk10_0,X1),singleton(esk10_0)),esk9_0)|in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk9_0)|~connected(esk9_0)|~in(X1,relation_field(esk9_0))),inference(cn,[status(thm)],[296,theory(equality)])).
% cnf(413,negated_conjecture,(esk1_2(X1,relation_field(esk9_0))=esk2_2(X2,relation_field(esk9_0))|connected(esk9_0)|is_connected_in(X2,relation_field(esk9_0))|in(unordered_pair(singleton(esk2_2(X2,relation_field(esk9_0))),unordered_pair(esk2_2(X2,relation_field(esk9_0)),esk1_2(X1,relation_field(esk9_0)))),esk9_0)|in(unordered_pair(singleton(esk1_2(X1,relation_field(esk9_0))),unordered_pair(esk1_2(X1,relation_field(esk9_0)),esk2_2(X2,relation_field(esk9_0)))),esk9_0)|is_connected_in(X1,relation_field(esk9_0))|~relation(X2)|~relation(X1)),inference(rw,[status(thm)],[259,98,theory(equality)])).
% cnf(414,negated_conjecture,(esk1_2(X1,relation_field(esk9_0))=esk2_2(esk9_0,relation_field(esk9_0))|connected(esk9_0)|is_connected_in(X1,relation_field(esk9_0))|is_connected_in(esk9_0,relation_field(esk9_0))|in(unordered_pair(singleton(esk1_2(X1,relation_field(esk9_0))),unordered_pair(esk1_2(X1,relation_field(esk9_0)),esk2_2(esk9_0,relation_field(esk9_0)))),esk9_0)|in(unordered_pair(singleton(esk2_2(esk9_0,relation_field(esk9_0))),unordered_pair(esk2_2(esk9_0,relation_field(esk9_0)),esk1_2(X1,relation_field(esk9_0)))),esk9_0)|~relation(X1)),inference(spm,[status(thm)],[413,147,theory(equality)])).
% cnf(876,negated_conjecture,(esk1_2(esk9_0,relation_field(esk9_0))=esk2_2(esk9_0,relation_field(esk9_0))|connected(esk9_0)|is_connected_in(esk9_0,relation_field(esk9_0))|in(unordered_pair(singleton(esk2_2(esk9_0,relation_field(esk9_0))),unordered_pair(esk2_2(esk9_0,relation_field(esk9_0)),esk1_2(esk9_0,relation_field(esk9_0)))),esk9_0)|in(unordered_pair(singleton(esk1_2(esk9_0,relation_field(esk9_0))),unordered_pair(esk1_2(esk9_0,relation_field(esk9_0)),esk2_2(esk9_0,relation_field(esk9_0)))),esk9_0)),inference(spm,[status(thm)],[414,147,theory(equality)])).
% cnf(1137,negated_conjecture,(esk2_2(esk9_0,relation_field(esk9_0))=esk1_2(esk9_0,relation_field(esk9_0))|connected(esk9_0)|is_connected_in(esk9_0,relation_field(esk9_0))|in(unordered_pair(singleton(esk2_2(esk9_0,relation_field(esk9_0))),unordered_pair(esk1_2(esk9_0,relation_field(esk9_0)),esk2_2(esk9_0,relation_field(esk9_0)))),esk9_0)|in(unordered_pair(singleton(esk1_2(esk9_0,relation_field(esk9_0))),unordered_pair(esk1_2(esk9_0,relation_field(esk9_0)),esk2_2(esk9_0,relation_field(esk9_0)))),esk9_0)),inference(rw,[status(thm)],[876,98,theory(equality)])).
% cnf(1140,negated_conjecture,(is_connected_in(esk9_0,relation_field(esk9_0))|esk2_2(esk9_0,relation_field(esk9_0))=esk1_2(esk9_0,relation_field(esk9_0))|connected(esk9_0)|in(unordered_pair(singleton(esk1_2(esk9_0,relation_field(esk9_0))),unordered_pair(esk1_2(esk9_0,relation_field(esk9_0)),esk2_2(esk9_0,relation_field(esk9_0)))),esk9_0)|~relation(esk9_0)),inference(spm,[status(thm)],[201,1137,theory(equality)])).
% cnf(1141,negated_conjecture,(is_connected_in(esk9_0,relation_field(esk9_0))|esk2_2(esk9_0,relation_field(esk9_0))=esk1_2(esk9_0,relation_field(esk9_0))|connected(esk9_0)|in(unordered_pair(singleton(esk1_2(esk9_0,relation_field(esk9_0))),unordered_pair(esk1_2(esk9_0,relation_field(esk9_0)),esk2_2(esk9_0,relation_field(esk9_0)))),esk9_0)|$false),inference(rw,[status(thm)],[1140,147,theory(equality)])).
% cnf(1142,negated_conjecture,(is_connected_in(esk9_0,relation_field(esk9_0))|esk2_2(esk9_0,relation_field(esk9_0))=esk1_2(esk9_0,relation_field(esk9_0))|connected(esk9_0)|in(unordered_pair(singleton(esk1_2(esk9_0,relation_field(esk9_0))),unordered_pair(esk1_2(esk9_0,relation_field(esk9_0)),esk2_2(esk9_0,relation_field(esk9_0)))),esk9_0)),inference(cn,[status(thm)],[1141,theory(equality)])).
% cnf(1145,negated_conjecture,(is_connected_in(esk9_0,relation_field(esk9_0))|esk2_2(esk9_0,relation_field(esk9_0))=esk1_2(esk9_0,relation_field(esk9_0))|connected(esk9_0)|~relation(esk9_0)),inference(spm,[status(thm)],[200,1142,theory(equality)])).
% cnf(1146,negated_conjecture,(is_connected_in(esk9_0,relation_field(esk9_0))|esk2_2(esk9_0,relation_field(esk9_0))=esk1_2(esk9_0,relation_field(esk9_0))|connected(esk9_0)|$false),inference(rw,[status(thm)],[1145,147,theory(equality)])).
% cnf(1147,negated_conjecture,(is_connected_in(esk9_0,relation_field(esk9_0))|esk2_2(esk9_0,relation_field(esk9_0))=esk1_2(esk9_0,relation_field(esk9_0))|connected(esk9_0)),inference(cn,[status(thm)],[1146,theory(equality)])).
% cnf(1150,negated_conjecture,(is_connected_in(esk9_0,relation_field(esk9_0))|connected(esk9_0)|~relation(esk9_0)),inference(spm,[status(thm)],[55,1147,theory(equality)])).
% cnf(1161,negated_conjecture,(is_connected_in(esk9_0,relation_field(esk9_0))|connected(esk9_0)|$false),inference(rw,[status(thm)],[1150,147,theory(equality)])).
% cnf(1162,negated_conjecture,(is_connected_in(esk9_0,relation_field(esk9_0))|connected(esk9_0)),inference(cn,[status(thm)],[1161,theory(equality)])).
% cnf(1178,negated_conjecture,(connected(esk9_0)|~relation(esk9_0)),inference(spm,[status(thm)],[62,1162,theory(equality)])).
% cnf(1181,negated_conjecture,(connected(esk9_0)|$false),inference(rw,[status(thm)],[1178,147,theory(equality)])).
% cnf(1182,negated_conjecture,(connected(esk9_0)),inference(cn,[status(thm)],[1181,theory(equality)])).
% cnf(1230,negated_conjecture,(X1=esk10_0|in(unordered_pair(unordered_pair(esk10_0,X1),singleton(esk10_0)),esk9_0)|in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk9_0)|$false|~in(X1,relation_field(esk9_0))),inference(rw,[status(thm)],[297,1182,theory(equality)])).
% cnf(1231,negated_conjecture,(X1=esk10_0|in(unordered_pair(unordered_pair(esk10_0,X1),singleton(esk10_0)),esk9_0)|in(unordered_pair(unordered_pair(X1,esk10_0),singleton(X1)),esk9_0)|~in(X1,relation_field(esk9_0))),inference(cn,[status(thm)],[1230,theory(equality)])).
% cnf(1247,negated_conjecture,($false|~in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk11_0)),esk9_0)),inference(rw,[status(thm)],[178,1182,theory(equality)])).
% cnf(1248,negated_conjecture,(~in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk11_0)),esk9_0)),inference(cn,[status(thm)],[1247,theory(equality)])).
% cnf(1249,negated_conjecture,($false|~in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0)),esk9_0)),inference(rw,[status(thm)],[159,1182,theory(equality)])).
% cnf(1250,negated_conjecture,(~in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0)),esk9_0)),inference(cn,[status(thm)],[1249,theory(equality)])).
% cnf(1251,negated_conjecture,(in(esk11_0,relation_field(esk9_0))|$false),inference(rw,[status(thm)],[151,1182,theory(equality)])).
% cnf(1252,negated_conjecture,(in(esk11_0,relation_field(esk9_0))),inference(cn,[status(thm)],[1251,theory(equality)])).
% cnf(1256,negated_conjecture,(esk11_0!=esk10_0|$false),inference(rw,[status(thm)],[150,1182,theory(equality)])).
% cnf(1257,negated_conjecture,(esk11_0!=esk10_0),inference(cn,[status(thm)],[1256,theory(equality)])).
% cnf(1308,negated_conjecture,(esk11_0=esk10_0|in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0)),esk9_0)|in(unordered_pair(unordered_pair(esk11_0,esk10_0),singleton(esk11_0)),esk9_0)),inference(spm,[status(thm)],[1231,1252,theory(equality)])).
% cnf(1312,negated_conjecture,(esk11_0=esk10_0|in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0)),esk9_0)|in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk11_0)),esk9_0)),inference(rw,[status(thm)],[1308,98,theory(equality)])).
% cnf(1313,negated_conjecture,(in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk10_0)),esk9_0)|in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk11_0)),esk9_0)),inference(sr,[status(thm)],[1312,1257,theory(equality)])).
% cnf(1314,negated_conjecture,(in(unordered_pair(unordered_pair(esk10_0,esk11_0),singleton(esk11_0)),esk9_0)),inference(sr,[status(thm)],[1313,1250,theory(equality)])).
% cnf(1315,negated_conjecture,($false),inference(sr,[status(thm)],[1314,1248,theory(equality)])).
% cnf(1316,negated_conjecture,($false),1315,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 446
% # ...of these trivial : 1
% # ...subsumed : 261
% # ...remaining for further processing: 184
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 22
% # Backward-rewritten : 53
% # Generated clauses : 579
% # ...of the previous two non-trivial : 536
% # Contextual simplify-reflections : 292
% # Paramodulations : 579
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 109
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 12
% # Non-unit-clauses : 77
% # Current number of unprocessed clauses: 25
% # ...number of literals in the above : 125
% # Clause-clause subsumption calls (NU) : 8814
% # Rec. Clause-clause subsumption calls : 2064
% # Unit Clause-clause subsumption calls : 11
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 137 leaves, 1.50+/-1.279 terms/leaf
% # Paramod-from index: 41 leaves, 1.20+/-0.454 terms/leaf
% # Paramod-into index: 96 leaves, 1.28+/-0.534 terms/leaf
% # -------------------------------------------------
% # User time : 0.079 s
% # System time : 0.003 s
% # Total time : 0.082 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.27 WC
% FINAL PrfWatch: 0.18 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP5313/SEU242+1.tptp
%
%------------------------------------------------------------------------------