TSTP Solution File: SEU225+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU225+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 : art07.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 02:02:06 EST 2010

% Result   : Theorem 0.97s
% Output   : Solution 0.97s
% 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/SystemOnTPTP20197/SEU225+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP20197/SEU225+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20197/SEU225+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 20293
% 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]:![X2]:(relation(X1)=>relation(relation_dom_restriction(X1,X2))),file('/tmp/SRASS.s.p', dt_k7_relat_1)).
% fof(3, axiom,![X1]:![X2]:((relation(X1)&function(X1))=>(relation(relation_dom_restriction(X1,X2))&function(relation_dom_restriction(X1,X2)))),file('/tmp/SRASS.s.p', fc4_funct_1)).
% fof(5, axiom,![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>(in(X2,relation_dom(relation_dom_restriction(X3,X1)))<=>(in(X2,relation_dom(X3))&in(X2,X1)))),file('/tmp/SRASS.s.p', l82_funct_1)).
% fof(6, axiom,![X1]:![X2]:((relation(X2)&function(X2))=>![X3]:((relation(X3)&function(X3))=>(X2=relation_dom_restriction(X3,X1)<=>(relation_dom(X2)=set_intersection2(relation_dom(X3),X1)&![X4]:(in(X4,relation_dom(X2))=>apply(X2,X4)=apply(X3,X4)))))),file('/tmp/SRASS.s.p', t68_funct_1)).
% fof(9, axiom,![X1]:((relation(X1)&function(X1))=>![X2]:![X3]:((in(X2,relation_dom(X1))=>(X3=apply(X1,X2)<=>in(ordered_pair(X2,X3),X1)))&(~(in(X2,relation_dom(X1)))=>(X3=apply(X1,X2)<=>X3=empty_set)))),file('/tmp/SRASS.s.p', d4_funct_1)).
% fof(47, conjecture,![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>(in(X2,X1)=>apply(relation_dom_restriction(X3,X1),X2)=apply(X3,X2))),file('/tmp/SRASS.s.p', t72_funct_1)).
% fof(48, negated_conjecture,~(![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>(in(X2,X1)=>apply(relation_dom_restriction(X3,X1),X2)=apply(X3,X2)))),inference(assume_negation,[status(cth)],[47])).
% fof(50, plain,![X1]:((relation(X1)&function(X1))=>![X2]:![X3]:((in(X2,relation_dom(X1))=>(X3=apply(X1,X2)<=>in(ordered_pair(X2,X3),X1)))&(~(in(X2,relation_dom(X1)))=>(X3=apply(X1,X2)<=>X3=empty_set)))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(60, plain,![X1]:![X2]:(~(relation(X1))|relation(relation_dom_restriction(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(61, plain,![X3]:![X4]:(~(relation(X3))|relation(relation_dom_restriction(X3,X4))),inference(variable_rename,[status(thm)],[60])).
% cnf(62,plain,(relation(relation_dom_restriction(X1,X2))|~relation(X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(63, plain,![X1]:![X2]:((~(relation(X1))|~(function(X1)))|(relation(relation_dom_restriction(X1,X2))&function(relation_dom_restriction(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(64, plain,![X3]:![X4]:((~(relation(X3))|~(function(X3)))|(relation(relation_dom_restriction(X3,X4))&function(relation_dom_restriction(X3,X4)))),inference(variable_rename,[status(thm)],[63])).
% fof(65, plain,![X3]:![X4]:((relation(relation_dom_restriction(X3,X4))|(~(relation(X3))|~(function(X3))))&(function(relation_dom_restriction(X3,X4))|(~(relation(X3))|~(function(X3))))),inference(distribute,[status(thm)],[64])).
% cnf(66,plain,(function(relation_dom_restriction(X1,X2))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(72, plain,![X1]:![X2]:![X3]:((~(relation(X3))|~(function(X3)))|((~(in(X2,relation_dom(relation_dom_restriction(X3,X1))))|(in(X2,relation_dom(X3))&in(X2,X1)))&((~(in(X2,relation_dom(X3)))|~(in(X2,X1)))|in(X2,relation_dom(relation_dom_restriction(X3,X1)))))),inference(fof_nnf,[status(thm)],[5])).
% fof(73, plain,![X4]:![X5]:![X6]:((~(relation(X6))|~(function(X6)))|((~(in(X5,relation_dom(relation_dom_restriction(X6,X4))))|(in(X5,relation_dom(X6))&in(X5,X4)))&((~(in(X5,relation_dom(X6)))|~(in(X5,X4)))|in(X5,relation_dom(relation_dom_restriction(X6,X4)))))),inference(variable_rename,[status(thm)],[72])).
% fof(74, plain,![X4]:![X5]:![X6]:((((in(X5,relation_dom(X6))|~(in(X5,relation_dom(relation_dom_restriction(X6,X4)))))|(~(relation(X6))|~(function(X6))))&((in(X5,X4)|~(in(X5,relation_dom(relation_dom_restriction(X6,X4)))))|(~(relation(X6))|~(function(X6)))))&(((~(in(X5,relation_dom(X6)))|~(in(X5,X4)))|in(X5,relation_dom(relation_dom_restriction(X6,X4))))|(~(relation(X6))|~(function(X6))))),inference(distribute,[status(thm)],[73])).
% cnf(75,plain,(in(X2,relation_dom(relation_dom_restriction(X1,X3)))|~function(X1)|~relation(X1)|~in(X2,X3)|~in(X2,relation_dom(X1))),inference(split_conjunct,[status(thm)],[74])).
% cnf(77,plain,(in(X2,relation_dom(X1))|~function(X1)|~relation(X1)|~in(X2,relation_dom(relation_dom_restriction(X1,X3)))),inference(split_conjunct,[status(thm)],[74])).
% fof(78, plain,![X1]:![X2]:((~(relation(X2))|~(function(X2)))|![X3]:((~(relation(X3))|~(function(X3)))|((~(X2=relation_dom_restriction(X3,X1))|(relation_dom(X2)=set_intersection2(relation_dom(X3),X1)&![X4]:(~(in(X4,relation_dom(X2)))|apply(X2,X4)=apply(X3,X4))))&((~(relation_dom(X2)=set_intersection2(relation_dom(X3),X1))|?[X4]:(in(X4,relation_dom(X2))&~(apply(X2,X4)=apply(X3,X4))))|X2=relation_dom_restriction(X3,X1))))),inference(fof_nnf,[status(thm)],[6])).
% fof(79, plain,![X5]:![X6]:((~(relation(X6))|~(function(X6)))|![X7]:((~(relation(X7))|~(function(X7)))|((~(X6=relation_dom_restriction(X7,X5))|(relation_dom(X6)=set_intersection2(relation_dom(X7),X5)&![X8]:(~(in(X8,relation_dom(X6)))|apply(X6,X8)=apply(X7,X8))))&((~(relation_dom(X6)=set_intersection2(relation_dom(X7),X5))|?[X9]:(in(X9,relation_dom(X6))&~(apply(X6,X9)=apply(X7,X9))))|X6=relation_dom_restriction(X7,X5))))),inference(variable_rename,[status(thm)],[78])).
% fof(80, plain,![X5]:![X6]:((~(relation(X6))|~(function(X6)))|![X7]:((~(relation(X7))|~(function(X7)))|((~(X6=relation_dom_restriction(X7,X5))|(relation_dom(X6)=set_intersection2(relation_dom(X7),X5)&![X8]:(~(in(X8,relation_dom(X6)))|apply(X6,X8)=apply(X7,X8))))&((~(relation_dom(X6)=set_intersection2(relation_dom(X7),X5))|(in(esk2_3(X5,X6,X7),relation_dom(X6))&~(apply(X6,esk2_3(X5,X6,X7))=apply(X7,esk2_3(X5,X6,X7)))))|X6=relation_dom_restriction(X7,X5))))),inference(skolemize,[status(esa)],[79])).
% fof(81, plain,![X5]:![X6]:![X7]:![X8]:((((((~(in(X8,relation_dom(X6)))|apply(X6,X8)=apply(X7,X8))&relation_dom(X6)=set_intersection2(relation_dom(X7),X5))|~(X6=relation_dom_restriction(X7,X5)))&((~(relation_dom(X6)=set_intersection2(relation_dom(X7),X5))|(in(esk2_3(X5,X6,X7),relation_dom(X6))&~(apply(X6,esk2_3(X5,X6,X7))=apply(X7,esk2_3(X5,X6,X7)))))|X6=relation_dom_restriction(X7,X5)))|(~(relation(X7))|~(function(X7))))|(~(relation(X6))|~(function(X6)))),inference(shift_quantors,[status(thm)],[80])).
% fof(82, plain,![X5]:![X6]:![X7]:![X8]:((((((~(in(X8,relation_dom(X6)))|apply(X6,X8)=apply(X7,X8))|~(X6=relation_dom_restriction(X7,X5)))|(~(relation(X7))|~(function(X7))))|(~(relation(X6))|~(function(X6))))&(((relation_dom(X6)=set_intersection2(relation_dom(X7),X5)|~(X6=relation_dom_restriction(X7,X5)))|(~(relation(X7))|~(function(X7))))|(~(relation(X6))|~(function(X6)))))&(((((in(esk2_3(X5,X6,X7),relation_dom(X6))|~(relation_dom(X6)=set_intersection2(relation_dom(X7),X5)))|X6=relation_dom_restriction(X7,X5))|(~(relation(X7))|~(function(X7))))|(~(relation(X6))|~(function(X6))))&((((~(apply(X6,esk2_3(X5,X6,X7))=apply(X7,esk2_3(X5,X6,X7)))|~(relation_dom(X6)=set_intersection2(relation_dom(X7),X5)))|X6=relation_dom_restriction(X7,X5))|(~(relation(X7))|~(function(X7))))|(~(relation(X6))|~(function(X6)))))),inference(distribute,[status(thm)],[81])).
% cnf(86,plain,(apply(X1,X4)=apply(X2,X4)|~function(X1)|~relation(X1)|~function(X2)|~relation(X2)|X1!=relation_dom_restriction(X2,X3)|~in(X4,relation_dom(X1))),inference(split_conjunct,[status(thm)],[82])).
% fof(97, plain,![X1]:((~(relation(X1))|~(function(X1)))|![X2]:![X3]:((~(in(X2,relation_dom(X1)))|((~(X3=apply(X1,X2))|in(ordered_pair(X2,X3),X1))&(~(in(ordered_pair(X2,X3),X1))|X3=apply(X1,X2))))&(in(X2,relation_dom(X1))|((~(X3=apply(X1,X2))|X3=empty_set)&(~(X3=empty_set)|X3=apply(X1,X2)))))),inference(fof_nnf,[status(thm)],[50])).
% fof(98, plain,![X4]:((~(relation(X4))|~(function(X4)))|![X5]:![X6]:((~(in(X5,relation_dom(X4)))|((~(X6=apply(X4,X5))|in(ordered_pair(X5,X6),X4))&(~(in(ordered_pair(X5,X6),X4))|X6=apply(X4,X5))))&(in(X5,relation_dom(X4))|((~(X6=apply(X4,X5))|X6=empty_set)&(~(X6=empty_set)|X6=apply(X4,X5)))))),inference(variable_rename,[status(thm)],[97])).
% fof(99, plain,![X4]:![X5]:![X6]:(((~(in(X5,relation_dom(X4)))|((~(X6=apply(X4,X5))|in(ordered_pair(X5,X6),X4))&(~(in(ordered_pair(X5,X6),X4))|X6=apply(X4,X5))))&(in(X5,relation_dom(X4))|((~(X6=apply(X4,X5))|X6=empty_set)&(~(X6=empty_set)|X6=apply(X4,X5)))))|(~(relation(X4))|~(function(X4)))),inference(shift_quantors,[status(thm)],[98])).
% fof(100, plain,![X4]:![X5]:![X6]:(((((~(X6=apply(X4,X5))|in(ordered_pair(X5,X6),X4))|~(in(X5,relation_dom(X4))))|(~(relation(X4))|~(function(X4))))&(((~(in(ordered_pair(X5,X6),X4))|X6=apply(X4,X5))|~(in(X5,relation_dom(X4))))|(~(relation(X4))|~(function(X4)))))&((((~(X6=apply(X4,X5))|X6=empty_set)|in(X5,relation_dom(X4)))|(~(relation(X4))|~(function(X4))))&(((~(X6=empty_set)|X6=apply(X4,X5))|in(X5,relation_dom(X4)))|(~(relation(X4))|~(function(X4)))))),inference(distribute,[status(thm)],[99])).
% cnf(102,plain,(in(X2,relation_dom(X1))|X3=empty_set|~function(X1)|~relation(X1)|X3!=apply(X1,X2)),inference(split_conjunct,[status(thm)],[100])).
% fof(199, negated_conjecture,?[X1]:?[X2]:?[X3]:((relation(X3)&function(X3))&(in(X2,X1)&~(apply(relation_dom_restriction(X3,X1),X2)=apply(X3,X2)))),inference(fof_nnf,[status(thm)],[48])).
% fof(200, negated_conjecture,?[X4]:?[X5]:?[X6]:((relation(X6)&function(X6))&(in(X5,X4)&~(apply(relation_dom_restriction(X6,X4),X5)=apply(X6,X5)))),inference(variable_rename,[status(thm)],[199])).
% fof(201, negated_conjecture,((relation(esk13_0)&function(esk13_0))&(in(esk12_0,esk11_0)&~(apply(relation_dom_restriction(esk13_0,esk11_0),esk12_0)=apply(esk13_0,esk12_0)))),inference(skolemize,[status(esa)],[200])).
% cnf(202,negated_conjecture,(apply(relation_dom_restriction(esk13_0,esk11_0),esk12_0)!=apply(esk13_0,esk12_0)),inference(split_conjunct,[status(thm)],[201])).
% cnf(203,negated_conjecture,(in(esk12_0,esk11_0)),inference(split_conjunct,[status(thm)],[201])).
% cnf(204,negated_conjecture,(function(esk13_0)),inference(split_conjunct,[status(thm)],[201])).
% cnf(205,negated_conjecture,(relation(esk13_0)),inference(split_conjunct,[status(thm)],[201])).
% cnf(259,plain,(empty_set=apply(X1,X2)|in(X2,relation_dom(X1))|~function(X1)|~relation(X1)),inference(er,[status(thm)],[102,theory(equality)])).
% cnf(270,plain,(apply(relation_dom_restriction(X1,X2),X3)=apply(X1,X3)|~function(X1)|~function(relation_dom_restriction(X1,X2))|~relation(X1)|~relation(relation_dom_restriction(X1,X2))|~in(X3,relation_dom(relation_dom_restriction(X1,X2)))),inference(er,[status(thm)],[86,theory(equality)])).
% cnf(325,negated_conjecture,(in(esk12_0,relation_dom(relation_dom_restriction(esk13_0,esk11_0)))|empty_set!=apply(esk13_0,esk12_0)|~function(relation_dom_restriction(esk13_0,esk11_0))|~relation(relation_dom_restriction(esk13_0,esk11_0))),inference(spm,[status(thm)],[202,259,theory(equality)])).
% cnf(332,negated_conjecture,(in(esk12_0,relation_dom(esk13_0))|~function(esk13_0)|~relation(esk13_0)|apply(esk13_0,esk12_0)!=empty_set|~function(relation_dom_restriction(esk13_0,esk11_0))|~relation(relation_dom_restriction(esk13_0,esk11_0))),inference(spm,[status(thm)],[77,325,theory(equality)])).
% cnf(338,negated_conjecture,(in(esk12_0,relation_dom(esk13_0))|$false|~relation(esk13_0)|apply(esk13_0,esk12_0)!=empty_set|~function(relation_dom_restriction(esk13_0,esk11_0))|~relation(relation_dom_restriction(esk13_0,esk11_0))),inference(rw,[status(thm)],[332,204,theory(equality)])).
% cnf(339,negated_conjecture,(in(esk12_0,relation_dom(esk13_0))|$false|$false|apply(esk13_0,esk12_0)!=empty_set|~function(relation_dom_restriction(esk13_0,esk11_0))|~relation(relation_dom_restriction(esk13_0,esk11_0))),inference(rw,[status(thm)],[338,205,theory(equality)])).
% cnf(340,negated_conjecture,(in(esk12_0,relation_dom(esk13_0))|apply(esk13_0,esk12_0)!=empty_set|~function(relation_dom_restriction(esk13_0,esk11_0))|~relation(relation_dom_restriction(esk13_0,esk11_0))),inference(cn,[status(thm)],[339,theory(equality)])).
% cnf(342,negated_conjecture,(in(esk12_0,relation_dom(esk13_0))|~function(relation_dom_restriction(esk13_0,esk11_0))|~relation(relation_dom_restriction(esk13_0,esk11_0))|~function(esk13_0)|~relation(esk13_0)),inference(spm,[status(thm)],[340,259,theory(equality)])).
% cnf(343,negated_conjecture,(in(esk12_0,relation_dom(esk13_0))|~function(relation_dom_restriction(esk13_0,esk11_0))|~relation(relation_dom_restriction(esk13_0,esk11_0))|$false|~relation(esk13_0)),inference(rw,[status(thm)],[342,204,theory(equality)])).
% cnf(344,negated_conjecture,(in(esk12_0,relation_dom(esk13_0))|~function(relation_dom_restriction(esk13_0,esk11_0))|~relation(relation_dom_restriction(esk13_0,esk11_0))|$false|$false),inference(rw,[status(thm)],[343,205,theory(equality)])).
% cnf(345,negated_conjecture,(in(esk12_0,relation_dom(esk13_0))|~function(relation_dom_restriction(esk13_0,esk11_0))|~relation(relation_dom_restriction(esk13_0,esk11_0))),inference(cn,[status(thm)],[344,theory(equality)])).
% cnf(753,plain,(apply(relation_dom_restriction(X1,X2),X3)=apply(X1,X3)|~function(relation_dom_restriction(X1,X2))|~function(X1)|~relation(X1)|~in(X3,relation_dom(relation_dom_restriction(X1,X2)))),inference(csr,[status(thm)],[270,62])).
% cnf(754,plain,(apply(relation_dom_restriction(X1,X2),X3)=apply(X1,X3)|~function(X1)|~relation(X1)|~in(X3,relation_dom(relation_dom_restriction(X1,X2)))),inference(csr,[status(thm)],[753,66])).
% cnf(759,negated_conjecture,(~function(esk13_0)|~relation(esk13_0)|~in(esk12_0,relation_dom(relation_dom_restriction(esk13_0,esk11_0)))),inference(spm,[status(thm)],[202,754,theory(equality)])).
% cnf(761,negated_conjecture,($false|~relation(esk13_0)|~in(esk12_0,relation_dom(relation_dom_restriction(esk13_0,esk11_0)))),inference(rw,[status(thm)],[759,204,theory(equality)])).
% cnf(762,negated_conjecture,($false|$false|~in(esk12_0,relation_dom(relation_dom_restriction(esk13_0,esk11_0)))),inference(rw,[status(thm)],[761,205,theory(equality)])).
% cnf(763,negated_conjecture,(~in(esk12_0,relation_dom(relation_dom_restriction(esk13_0,esk11_0)))),inference(cn,[status(thm)],[762,theory(equality)])).
% cnf(769,negated_conjecture,(~function(esk13_0)|~relation(esk13_0)|~in(esk12_0,relation_dom(esk13_0))|~in(esk12_0,esk11_0)),inference(spm,[status(thm)],[763,75,theory(equality)])).
% cnf(771,negated_conjecture,($false|~relation(esk13_0)|~in(esk12_0,relation_dom(esk13_0))|~in(esk12_0,esk11_0)),inference(rw,[status(thm)],[769,204,theory(equality)])).
% cnf(772,negated_conjecture,($false|$false|~in(esk12_0,relation_dom(esk13_0))|~in(esk12_0,esk11_0)),inference(rw,[status(thm)],[771,205,theory(equality)])).
% cnf(773,negated_conjecture,($false|$false|~in(esk12_0,relation_dom(esk13_0))|$false),inference(rw,[status(thm)],[772,203,theory(equality)])).
% cnf(774,negated_conjecture,(~in(esk12_0,relation_dom(esk13_0))),inference(cn,[status(thm)],[773,theory(equality)])).
% cnf(779,negated_conjecture,(~function(relation_dom_restriction(esk13_0,esk11_0))|~relation(relation_dom_restriction(esk13_0,esk11_0))),inference(spm,[status(thm)],[774,345,theory(equality)])).
% cnf(784,negated_conjecture,(~relation(relation_dom_restriction(esk13_0,esk11_0))|~function(esk13_0)|~relation(esk13_0)),inference(spm,[status(thm)],[779,66,theory(equality)])).
% cnf(785,negated_conjecture,(~relation(relation_dom_restriction(esk13_0,esk11_0))|$false|~relation(esk13_0)),inference(rw,[status(thm)],[784,204,theory(equality)])).
% cnf(786,negated_conjecture,(~relation(relation_dom_restriction(esk13_0,esk11_0))|$false|$false),inference(rw,[status(thm)],[785,205,theory(equality)])).
% cnf(787,negated_conjecture,(~relation(relation_dom_restriction(esk13_0,esk11_0))),inference(cn,[status(thm)],[786,theory(equality)])).
% cnf(788,negated_conjecture,(~relation(esk13_0)),inference(spm,[status(thm)],[787,62,theory(equality)])).
% cnf(789,negated_conjecture,($false),inference(rw,[status(thm)],[788,205,theory(equality)])).
% cnf(790,negated_conjecture,($false),inference(cn,[status(thm)],[789,theory(equality)])).
% cnf(791,negated_conjecture,($false),790,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 246
% # ...of these trivial                : 4
% # ...subsumed                        : 67
% # ...remaining for further processing: 175
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 10
% # Backward-rewritten                 : 16
% # Generated clauses                  : 287
% # ...of the previous two non-trivial : 237
% # Contextual simplify-reflections    : 61
% # Paramodulations                    : 277
% # Factorizations                     : 0
% # Equation resolutions               : 7
% # Current number of processed clauses: 91
% #    Positive orientable unit clauses: 25
% #    Positive unorientable unit clauses: 2
% #    Negative unit clauses           : 15
% #    Non-unit-clauses                : 49
% # Current number of unprocessed clauses: 100
% # ...number of literals in the above : 595
% # Clause-clause subsumption calls (NU) : 641
% # Rec. Clause-clause subsumption calls : 409
% # Unit Clause-clause subsumption calls : 97
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 23
% # Indexed BW rewrite successes       : 21
% # Backwards rewriting index:    99 leaves,   1.40+/-0.963 terms/leaf
% # Paramod-from index:           44 leaves,   1.09+/-0.358 terms/leaf
% # Paramod-into index:           89 leaves,   1.29+/-0.767 terms/leaf
% # -------------------------------------------------
% # User time              : 0.032 s
% # System time            : 0.004 s
% # Total time             : 0.036 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP20197/SEU225+1.tptp
% 
%------------------------------------------------------------------------------