TSTP Solution File: COM013+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM013+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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 : Tue Dec 28 22:39:19 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP25654/COM013+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25654/COM013+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25654/COM013+4.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 25750
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:![X2]:((aElement0(X1)&aRewritingSystem0(X2))=>![X3]:(aReductOfIn0(X3,X1,X2)=>aElement0(X3))),file('/tmp/SRASS.s.p', mReduct)).
% fof(8, axiom,((aRewritingSystem0(xR)&![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>(((aReductOfIn0(X2,X1,xR)|?[X3]:((aElement0(X3)&aReductOfIn0(X3,X1,xR))&sdtmndtplgtdt0(X3,xR,X2)))|sdtmndtplgtdt0(X1,xR,X2))=>iLess0(X2,X1))))&isTerminating0(xR)),file('/tmp/SRASS.s.p', m__587)).
% fof(15, conjecture,![X1]:(aElement0(X1)=>(![X2]:(aElement0(X2)=>(iLess0(X2,X1)=>?[X3]:((((aElement0(X3)&(X2=X3|((aReductOfIn0(X3,X2,xR)|?[X4]:((aElement0(X4)&aReductOfIn0(X4,X2,xR))&sdtmndtplgtdt0(X4,xR,X3)))&sdtmndtplgtdt0(X2,xR,X3))))&sdtmndtasgtdt0(X2,xR,X3))&~(?[X4]:aReductOfIn0(X4,X3,xR)))&aNormalFormOfIn0(X3,X2,xR))))=>?[X2]:(((aElement0(X2)&((((X1=X2|aReductOfIn0(X2,X1,xR))|?[X3]:((aElement0(X3)&aReductOfIn0(X3,X1,xR))&sdtmndtplgtdt0(X3,xR,X2)))|sdtmndtplgtdt0(X1,xR,X2))|sdtmndtasgtdt0(X1,xR,X2)))&~(?[X3]:aReductOfIn0(X3,X2,xR)))|aNormalFormOfIn0(X2,X1,xR)))),file('/tmp/SRASS.s.p', m__)).
% fof(16, negated_conjecture,~(![X1]:(aElement0(X1)=>(![X2]:(aElement0(X2)=>(iLess0(X2,X1)=>?[X3]:((((aElement0(X3)&(X2=X3|((aReductOfIn0(X3,X2,xR)|?[X4]:((aElement0(X4)&aReductOfIn0(X4,X2,xR))&sdtmndtplgtdt0(X4,xR,X3)))&sdtmndtplgtdt0(X2,xR,X3))))&sdtmndtasgtdt0(X2,xR,X3))&~(?[X4]:aReductOfIn0(X4,X3,xR)))&aNormalFormOfIn0(X3,X2,xR))))=>?[X2]:(((aElement0(X2)&((((X1=X2|aReductOfIn0(X2,X1,xR))|?[X3]:((aElement0(X3)&aReductOfIn0(X3,X1,xR))&sdtmndtplgtdt0(X3,xR,X2)))|sdtmndtplgtdt0(X1,xR,X2))|sdtmndtasgtdt0(X1,xR,X2)))&~(?[X3]:aReductOfIn0(X3,X2,xR)))|aNormalFormOfIn0(X2,X1,xR))))),inference(assume_negation,[status(cth)],[15])).
% fof(21, plain,![X1]:![X2]:((~(aElement0(X1))|~(aRewritingSystem0(X2)))|![X3]:(~(aReductOfIn0(X3,X1,X2))|aElement0(X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(22, plain,![X4]:![X5]:((~(aElement0(X4))|~(aRewritingSystem0(X5)))|![X6]:(~(aReductOfIn0(X6,X4,X5))|aElement0(X6))),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X4]:![X5]:![X6]:((~(aReductOfIn0(X6,X4,X5))|aElement0(X6))|(~(aElement0(X4))|~(aRewritingSystem0(X5)))),inference(shift_quantors,[status(thm)],[22])).
% cnf(24,plain,(aElement0(X3)|~aRewritingSystem0(X1)|~aElement0(X2)|~aReductOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(66, plain,((aRewritingSystem0(xR)&![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|(((~(aReductOfIn0(X2,X1,xR))&![X3]:((~(aElement0(X3))|~(aReductOfIn0(X3,X1,xR)))|~(sdtmndtplgtdt0(X3,xR,X2))))&~(sdtmndtplgtdt0(X1,xR,X2)))|iLess0(X2,X1))))&isTerminating0(xR)),inference(fof_nnf,[status(thm)],[8])).
% fof(67, plain,((aRewritingSystem0(xR)&![X4]:![X5]:((~(aElement0(X4))|~(aElement0(X5)))|(((~(aReductOfIn0(X5,X4,xR))&![X6]:((~(aElement0(X6))|~(aReductOfIn0(X6,X4,xR)))|~(sdtmndtplgtdt0(X6,xR,X5))))&~(sdtmndtplgtdt0(X4,xR,X5)))|iLess0(X5,X4))))&isTerminating0(xR)),inference(variable_rename,[status(thm)],[66])).
% fof(68, plain,![X4]:![X5]:![X6]:((((((((~(aElement0(X6))|~(aReductOfIn0(X6,X4,xR)))|~(sdtmndtplgtdt0(X6,xR,X5)))&~(aReductOfIn0(X5,X4,xR)))&~(sdtmndtplgtdt0(X4,xR,X5)))|iLess0(X5,X4))|(~(aElement0(X4))|~(aElement0(X5))))&aRewritingSystem0(xR))&isTerminating0(xR)),inference(shift_quantors,[status(thm)],[67])).
% fof(69, plain,![X4]:![X5]:![X6]:((((((((~(aElement0(X6))|~(aReductOfIn0(X6,X4,xR)))|~(sdtmndtplgtdt0(X6,xR,X5)))|iLess0(X5,X4))|(~(aElement0(X4))|~(aElement0(X5))))&((~(aReductOfIn0(X5,X4,xR))|iLess0(X5,X4))|(~(aElement0(X4))|~(aElement0(X5)))))&((~(sdtmndtplgtdt0(X4,xR,X5))|iLess0(X5,X4))|(~(aElement0(X4))|~(aElement0(X5)))))&aRewritingSystem0(xR))&isTerminating0(xR)),inference(distribute,[status(thm)],[68])).
% cnf(71,plain,(aRewritingSystem0(xR)),inference(split_conjunct,[status(thm)],[69])).
% cnf(73,plain,(iLess0(X1,X2)|~aElement0(X1)|~aElement0(X2)|~aReductOfIn0(X1,X2,xR)),inference(split_conjunct,[status(thm)],[69])).
% fof(111, negated_conjecture,?[X1]:(aElement0(X1)&(![X2]:(~(aElement0(X2))|(~(iLess0(X2,X1))|?[X3]:((((aElement0(X3)&(X2=X3|((aReductOfIn0(X3,X2,xR)|?[X4]:((aElement0(X4)&aReductOfIn0(X4,X2,xR))&sdtmndtplgtdt0(X4,xR,X3)))&sdtmndtplgtdt0(X2,xR,X3))))&sdtmndtasgtdt0(X2,xR,X3))&![X4]:~(aReductOfIn0(X4,X3,xR)))&aNormalFormOfIn0(X3,X2,xR))))&![X2]:(((~(aElement0(X2))|((((~(X1=X2)&~(aReductOfIn0(X2,X1,xR)))&![X3]:((~(aElement0(X3))|~(aReductOfIn0(X3,X1,xR)))|~(sdtmndtplgtdt0(X3,xR,X2))))&~(sdtmndtplgtdt0(X1,xR,X2)))&~(sdtmndtasgtdt0(X1,xR,X2))))|?[X3]:aReductOfIn0(X3,X2,xR))&~(aNormalFormOfIn0(X2,X1,xR))))),inference(fof_nnf,[status(thm)],[16])).
% fof(112, negated_conjecture,?[X5]:(aElement0(X5)&(![X6]:(~(aElement0(X6))|(~(iLess0(X6,X5))|?[X7]:((((aElement0(X7)&(X6=X7|((aReductOfIn0(X7,X6,xR)|?[X8]:((aElement0(X8)&aReductOfIn0(X8,X6,xR))&sdtmndtplgtdt0(X8,xR,X7)))&sdtmndtplgtdt0(X6,xR,X7))))&sdtmndtasgtdt0(X6,xR,X7))&![X9]:~(aReductOfIn0(X9,X7,xR)))&aNormalFormOfIn0(X7,X6,xR))))&![X10]:(((~(aElement0(X10))|((((~(X5=X10)&~(aReductOfIn0(X10,X5,xR)))&![X11]:((~(aElement0(X11))|~(aReductOfIn0(X11,X5,xR)))|~(sdtmndtplgtdt0(X11,xR,X10))))&~(sdtmndtplgtdt0(X5,xR,X10)))&~(sdtmndtasgtdt0(X5,xR,X10))))|?[X12]:aReductOfIn0(X12,X10,xR))&~(aNormalFormOfIn0(X10,X5,xR))))),inference(variable_rename,[status(thm)],[111])).
% fof(113, negated_conjecture,(aElement0(esk13_0)&(![X6]:(~(aElement0(X6))|(~(iLess0(X6,esk13_0))|((((aElement0(esk14_1(X6))&(X6=esk14_1(X6)|((aReductOfIn0(esk14_1(X6),X6,xR)|((aElement0(esk15_1(X6))&aReductOfIn0(esk15_1(X6),X6,xR))&sdtmndtplgtdt0(esk15_1(X6),xR,esk14_1(X6))))&sdtmndtplgtdt0(X6,xR,esk14_1(X6)))))&sdtmndtasgtdt0(X6,xR,esk14_1(X6)))&![X9]:~(aReductOfIn0(X9,esk14_1(X6),xR)))&aNormalFormOfIn0(esk14_1(X6),X6,xR))))&![X10]:(((~(aElement0(X10))|((((~(esk13_0=X10)&~(aReductOfIn0(X10,esk13_0,xR)))&![X11]:((~(aElement0(X11))|~(aReductOfIn0(X11,esk13_0,xR)))|~(sdtmndtplgtdt0(X11,xR,X10))))&~(sdtmndtplgtdt0(esk13_0,xR,X10)))&~(sdtmndtasgtdt0(esk13_0,xR,X10))))|aReductOfIn0(esk16_1(X10),X10,xR))&~(aNormalFormOfIn0(X10,esk13_0,xR))))),inference(skolemize,[status(esa)],[112])).
% fof(114, negated_conjecture,![X6]:![X9]:![X10]:![X11]:((((((((((~(aElement0(X11))|~(aReductOfIn0(X11,esk13_0,xR)))|~(sdtmndtplgtdt0(X11,xR,X10)))&(~(esk13_0=X10)&~(aReductOfIn0(X10,esk13_0,xR))))&~(sdtmndtplgtdt0(esk13_0,xR,X10)))&~(sdtmndtasgtdt0(esk13_0,xR,X10)))|~(aElement0(X10)))|aReductOfIn0(esk16_1(X10),X10,xR))&~(aNormalFormOfIn0(X10,esk13_0,xR)))&((((~(aReductOfIn0(X9,esk14_1(X6),xR))&((aElement0(esk14_1(X6))&(X6=esk14_1(X6)|((aReductOfIn0(esk14_1(X6),X6,xR)|((aElement0(esk15_1(X6))&aReductOfIn0(esk15_1(X6),X6,xR))&sdtmndtplgtdt0(esk15_1(X6),xR,esk14_1(X6))))&sdtmndtplgtdt0(X6,xR,esk14_1(X6)))))&sdtmndtasgtdt0(X6,xR,esk14_1(X6))))&aNormalFormOfIn0(esk14_1(X6),X6,xR))|~(iLess0(X6,esk13_0)))|~(aElement0(X6))))&aElement0(esk13_0)),inference(shift_quantors,[status(thm)],[113])).
% fof(115, negated_conjecture,![X6]:![X9]:![X10]:![X11]:((((((((((~(aElement0(X11))|~(aReductOfIn0(X11,esk13_0,xR)))|~(sdtmndtplgtdt0(X11,xR,X10)))|~(aElement0(X10)))|aReductOfIn0(esk16_1(X10),X10,xR))&(((~(esk13_0=X10)|~(aElement0(X10)))|aReductOfIn0(esk16_1(X10),X10,xR))&((~(aReductOfIn0(X10,esk13_0,xR))|~(aElement0(X10)))|aReductOfIn0(esk16_1(X10),X10,xR))))&((~(sdtmndtplgtdt0(esk13_0,xR,X10))|~(aElement0(X10)))|aReductOfIn0(esk16_1(X10),X10,xR)))&((~(sdtmndtasgtdt0(esk13_0,xR,X10))|~(aElement0(X10)))|aReductOfIn0(esk16_1(X10),X10,xR)))&~(aNormalFormOfIn0(X10,esk13_0,xR)))&((((~(aReductOfIn0(X9,esk14_1(X6),xR))|~(iLess0(X6,esk13_0)))|~(aElement0(X6)))&((((aElement0(esk14_1(X6))|~(iLess0(X6,esk13_0)))|~(aElement0(X6)))&(((((((aElement0(esk15_1(X6))|aReductOfIn0(esk14_1(X6),X6,xR))|X6=esk14_1(X6))|~(iLess0(X6,esk13_0)))|~(aElement0(X6)))&((((aReductOfIn0(esk15_1(X6),X6,xR)|aReductOfIn0(esk14_1(X6),X6,xR))|X6=esk14_1(X6))|~(iLess0(X6,esk13_0)))|~(aElement0(X6))))&((((sdtmndtplgtdt0(esk15_1(X6),xR,esk14_1(X6))|aReductOfIn0(esk14_1(X6),X6,xR))|X6=esk14_1(X6))|~(iLess0(X6,esk13_0)))|~(aElement0(X6))))&(((sdtmndtplgtdt0(X6,xR,esk14_1(X6))|X6=esk14_1(X6))|~(iLess0(X6,esk13_0)))|~(aElement0(X6)))))&((sdtmndtasgtdt0(X6,xR,esk14_1(X6))|~(iLess0(X6,esk13_0)))|~(aElement0(X6)))))&((aNormalFormOfIn0(esk14_1(X6),X6,xR)|~(iLess0(X6,esk13_0)))|~(aElement0(X6)))))&aElement0(esk13_0)),inference(distribute,[status(thm)],[114])).
% cnf(116,negated_conjecture,(aElement0(esk13_0)),inference(split_conjunct,[status(thm)],[115])).
% cnf(119,negated_conjecture,(X1=esk14_1(X1)|sdtmndtplgtdt0(X1,xR,esk14_1(X1))|~aElement0(X1)|~iLess0(X1,esk13_0)),inference(split_conjunct,[status(thm)],[115])).
% cnf(123,negated_conjecture,(aElement0(esk14_1(X1))|~aElement0(X1)|~iLess0(X1,esk13_0)),inference(split_conjunct,[status(thm)],[115])).
% cnf(124,negated_conjecture,(~aElement0(X1)|~iLess0(X1,esk13_0)|~aReductOfIn0(X2,esk14_1(X1),xR)),inference(split_conjunct,[status(thm)],[115])).
% cnf(128,negated_conjecture,(aReductOfIn0(esk16_1(X1),X1,xR)|~aElement0(X1)|~aReductOfIn0(X1,esk13_0,xR)),inference(split_conjunct,[status(thm)],[115])).
% cnf(129,negated_conjecture,(aReductOfIn0(esk16_1(X1),X1,xR)|~aElement0(X1)|esk13_0!=X1),inference(split_conjunct,[status(thm)],[115])).
% cnf(130,negated_conjecture,(aReductOfIn0(esk16_1(X1),X1,xR)|~aElement0(X1)|~sdtmndtplgtdt0(X2,xR,X1)|~aReductOfIn0(X2,esk13_0,xR)|~aElement0(X2)),inference(split_conjunct,[status(thm)],[115])).
% cnf(144,negated_conjecture,(~iLess0(X1,esk13_0)|~aElement0(X1)|~aReductOfIn0(esk14_1(X1),esk13_0,xR)|~aElement0(esk14_1(X1))),inference(spm,[status(thm)],[124,128,theory(equality)])).
% cnf(148,negated_conjecture,(aElement0(esk16_1(X1))|~aRewritingSystem0(xR)|~aElement0(X1)|esk13_0!=X1),inference(spm,[status(thm)],[24,129,theory(equality)])).
% cnf(152,negated_conjecture,(aElement0(esk16_1(X1))|$false|~aElement0(X1)|esk13_0!=X1),inference(rw,[status(thm)],[148,71,theory(equality)])).
% cnf(153,negated_conjecture,(aElement0(esk16_1(X1))|~aElement0(X1)|esk13_0!=X1),inference(cn,[status(thm)],[152,theory(equality)])).
% cnf(187,negated_conjecture,(aReductOfIn0(esk16_1(esk14_1(X1)),esk14_1(X1),xR)|esk14_1(X1)=X1|~aReductOfIn0(X1,esk13_0,xR)|~aElement0(X1)|~aElement0(esk14_1(X1))|~iLess0(X1,esk13_0)),inference(spm,[status(thm)],[130,119,theory(equality)])).
% cnf(337,negated_conjecture,(~iLess0(X1,esk13_0)|~aReductOfIn0(esk14_1(X1),esk13_0,xR)|~aElement0(X1)),inference(csr,[status(thm)],[144,123])).
% cnf(501,negated_conjecture,(esk14_1(X1)=X1|aReductOfIn0(esk16_1(esk14_1(X1)),esk14_1(X1),xR)|~iLess0(X1,esk13_0)|~aReductOfIn0(X1,esk13_0,xR)|~aElement0(X1)),inference(csr,[status(thm)],[187,123])).
% cnf(502,negated_conjecture,(esk14_1(X1)=X1|~iLess0(X1,esk13_0)|~aReductOfIn0(X1,esk13_0,xR)|~aElement0(X1)),inference(csr,[status(thm)],[501,124])).
% cnf(504,negated_conjecture,(esk14_1(X1)=X1|~aReductOfIn0(X1,esk13_0,xR)|~aElement0(X1)|~aElement0(esk13_0)),inference(spm,[status(thm)],[502,73,theory(equality)])).
% cnf(507,negated_conjecture,(esk14_1(X1)=X1|~aReductOfIn0(X1,esk13_0,xR)|~aElement0(X1)|$false),inference(rw,[status(thm)],[504,116,theory(equality)])).
% cnf(508,negated_conjecture,(esk14_1(X1)=X1|~aReductOfIn0(X1,esk13_0,xR)|~aElement0(X1)),inference(cn,[status(thm)],[507,theory(equality)])).
% cnf(509,negated_conjecture,(esk14_1(esk16_1(esk13_0))=esk16_1(esk13_0)|~aElement0(esk16_1(esk13_0))|~aElement0(esk13_0)),inference(spm,[status(thm)],[508,129,theory(equality)])).
% cnf(518,negated_conjecture,(esk14_1(esk16_1(esk13_0))=esk16_1(esk13_0)|~aElement0(esk16_1(esk13_0))|$false),inference(rw,[status(thm)],[509,116,theory(equality)])).
% cnf(519,negated_conjecture,(esk14_1(esk16_1(esk13_0))=esk16_1(esk13_0)|~aElement0(esk16_1(esk13_0))),inference(cn,[status(thm)],[518,theory(equality)])).
% cnf(542,negated_conjecture,(~iLess0(esk16_1(esk13_0),esk13_0)|~aReductOfIn0(esk16_1(esk13_0),esk13_0,xR)|~aElement0(esk16_1(esk13_0))),inference(spm,[status(thm)],[337,519,theory(equality)])).
% cnf(567,negated_conjecture,(~aReductOfIn0(esk16_1(esk13_0),esk13_0,xR)|~aElement0(esk16_1(esk13_0))|~aElement0(esk13_0)),inference(spm,[status(thm)],[542,73,theory(equality)])).
% cnf(568,negated_conjecture,(~aReductOfIn0(esk16_1(esk13_0),esk13_0,xR)|~aElement0(esk16_1(esk13_0))|$false),inference(rw,[status(thm)],[567,116,theory(equality)])).
% cnf(569,negated_conjecture,(~aReductOfIn0(esk16_1(esk13_0),esk13_0,xR)|~aElement0(esk16_1(esk13_0))),inference(cn,[status(thm)],[568,theory(equality)])).
% cnf(583,negated_conjecture,(~aElement0(esk16_1(esk13_0))|~aElement0(esk13_0)),inference(spm,[status(thm)],[569,129,theory(equality)])).
% cnf(588,negated_conjecture,(~aElement0(esk16_1(esk13_0))|$false),inference(rw,[status(thm)],[583,116,theory(equality)])).
% cnf(589,negated_conjecture,(~aElement0(esk16_1(esk13_0))),inference(cn,[status(thm)],[588,theory(equality)])).
% cnf(604,negated_conjecture,(~aElement0(esk13_0)),inference(spm,[status(thm)],[589,153,theory(equality)])).
% cnf(608,negated_conjecture,($false),inference(rw,[status(thm)],[604,116,theory(equality)])).
% cnf(609,negated_conjecture,($false),inference(cn,[status(thm)],[608,theory(equality)])).
% cnf(610,negated_conjecture,($false),609,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 199
% # ...of these trivial : 1
% # ...subsumed : 37
% # ...remaining for further processing: 161
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 0
% # Generated clauses : 197
% # ...of the previous two non-trivial : 179
% # Contextual simplify-reflections : 59
% # Paramodulations : 196
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 97
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 89
% # Current number of unprocessed clauses: 95
% # ...number of literals in the above : 603
% # Clause-clause subsumption calls (NU) : 484
% # Rec. Clause-clause subsumption calls : 247
% # Unit Clause-clause subsumption calls : 60
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 97 leaves, 1.52+/-1.619 terms/leaf
% # Paramod-from index: 38 leaves, 1.18+/-0.823 terms/leaf
% # Paramod-into index: 85 leaves, 1.25+/-0.880 terms/leaf
% # -------------------------------------------------
% # User time : 0.036 s
% # System time : 0.003 s
% # Total time : 0.039 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP25654/COM013+4.tptp
%
%------------------------------------------------------------------------------