TSTP Solution File: COM023+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM023+1 : TPTP v5.0.0. Released v4.0.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 : Tue Dec 28 22:47:51 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP12633/COM023+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12633/COM023+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12633/COM023+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 12765
% 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(2, axiom,![X1]:(aRewritingSystem0(X1)=>(isConfluent0(X1)<=>![X2]:![X3]:![X4]:(((((aElement0(X2)&aElement0(X3))&aElement0(X4))&sdtmndtasgtdt0(X2,X1,X3))&sdtmndtasgtdt0(X2,X1,X4))=>?[X5]:((aElement0(X5)&sdtmndtasgtdt0(X3,X1,X5))&sdtmndtasgtdt0(X4,X1,X5))))),file('/tmp/SRASS.s.p', mCRDef)).
% fof(3, axiom,aRewritingSystem0(xR),file('/tmp/SRASS.s.p', m__656)).
% fof(5, axiom,![X1]:![X2]:![X3]:(((((aElement0(X1)&aElement0(X2))&aElement0(X3))&sdtmndtasgtdt0(X1,xR,X2))&sdtmndtasgtdt0(X1,xR,X3))=>?[X4]:((aElement0(X4)&sdtmndtasgtdt0(X2,xR,X4))&sdtmndtasgtdt0(X3,xR,X4))),file('/tmp/SRASS.s.p', m__715)).
% fof(18, conjecture,isConfluent0(xR),file('/tmp/SRASS.s.p', m__)).
% fof(19, negated_conjecture,~(isConfluent0(xR)),inference(assume_negation,[status(cth)],[18])).
% fof(24, negated_conjecture,~(isConfluent0(xR)),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% fof(28, plain,![X1]:(~(aRewritingSystem0(X1))|((~(isConfluent0(X1))|![X2]:![X3]:![X4]:(((((~(aElement0(X2))|~(aElement0(X3)))|~(aElement0(X4)))|~(sdtmndtasgtdt0(X2,X1,X3)))|~(sdtmndtasgtdt0(X2,X1,X4)))|?[X5]:((aElement0(X5)&sdtmndtasgtdt0(X3,X1,X5))&sdtmndtasgtdt0(X4,X1,X5))))&(?[X2]:?[X3]:?[X4]:(((((aElement0(X2)&aElement0(X3))&aElement0(X4))&sdtmndtasgtdt0(X2,X1,X3))&sdtmndtasgtdt0(X2,X1,X4))&![X5]:((~(aElement0(X5))|~(sdtmndtasgtdt0(X3,X1,X5)))|~(sdtmndtasgtdt0(X4,X1,X5))))|isConfluent0(X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(29, plain,![X6]:(~(aRewritingSystem0(X6))|((~(isConfluent0(X6))|![X7]:![X8]:![X9]:(((((~(aElement0(X7))|~(aElement0(X8)))|~(aElement0(X9)))|~(sdtmndtasgtdt0(X7,X6,X8)))|~(sdtmndtasgtdt0(X7,X6,X9)))|?[X10]:((aElement0(X10)&sdtmndtasgtdt0(X8,X6,X10))&sdtmndtasgtdt0(X9,X6,X10))))&(?[X11]:?[X12]:?[X13]:(((((aElement0(X11)&aElement0(X12))&aElement0(X13))&sdtmndtasgtdt0(X11,X6,X12))&sdtmndtasgtdt0(X11,X6,X13))&![X14]:((~(aElement0(X14))|~(sdtmndtasgtdt0(X12,X6,X14)))|~(sdtmndtasgtdt0(X13,X6,X14))))|isConfluent0(X6)))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X6]:(~(aRewritingSystem0(X6))|((~(isConfluent0(X6))|![X7]:![X8]:![X9]:(((((~(aElement0(X7))|~(aElement0(X8)))|~(aElement0(X9)))|~(sdtmndtasgtdt0(X7,X6,X8)))|~(sdtmndtasgtdt0(X7,X6,X9)))|((aElement0(esk1_4(X6,X7,X8,X9))&sdtmndtasgtdt0(X8,X6,esk1_4(X6,X7,X8,X9)))&sdtmndtasgtdt0(X9,X6,esk1_4(X6,X7,X8,X9)))))&((((((aElement0(esk2_1(X6))&aElement0(esk3_1(X6)))&aElement0(esk4_1(X6)))&sdtmndtasgtdt0(esk2_1(X6),X6,esk3_1(X6)))&sdtmndtasgtdt0(esk2_1(X6),X6,esk4_1(X6)))&![X14]:((~(aElement0(X14))|~(sdtmndtasgtdt0(esk3_1(X6),X6,X14)))|~(sdtmndtasgtdt0(esk4_1(X6),X6,X14))))|isConfluent0(X6)))),inference(skolemize,[status(esa)],[29])).
% fof(31, plain,![X6]:![X7]:![X8]:![X9]:![X14]:((((((~(aElement0(X14))|~(sdtmndtasgtdt0(esk3_1(X6),X6,X14)))|~(sdtmndtasgtdt0(esk4_1(X6),X6,X14)))&((((aElement0(esk2_1(X6))&aElement0(esk3_1(X6)))&aElement0(esk4_1(X6)))&sdtmndtasgtdt0(esk2_1(X6),X6,esk3_1(X6)))&sdtmndtasgtdt0(esk2_1(X6),X6,esk4_1(X6))))|isConfluent0(X6))&((((((~(aElement0(X7))|~(aElement0(X8)))|~(aElement0(X9)))|~(sdtmndtasgtdt0(X7,X6,X8)))|~(sdtmndtasgtdt0(X7,X6,X9)))|((aElement0(esk1_4(X6,X7,X8,X9))&sdtmndtasgtdt0(X8,X6,esk1_4(X6,X7,X8,X9)))&sdtmndtasgtdt0(X9,X6,esk1_4(X6,X7,X8,X9))))|~(isConfluent0(X6))))|~(aRewritingSystem0(X6))),inference(shift_quantors,[status(thm)],[30])).
% fof(32, plain,![X6]:![X7]:![X8]:![X9]:![X14]:((((((~(aElement0(X14))|~(sdtmndtasgtdt0(esk3_1(X6),X6,X14)))|~(sdtmndtasgtdt0(esk4_1(X6),X6,X14)))|isConfluent0(X6))|~(aRewritingSystem0(X6)))&((((((aElement0(esk2_1(X6))|isConfluent0(X6))|~(aRewritingSystem0(X6)))&((aElement0(esk3_1(X6))|isConfluent0(X6))|~(aRewritingSystem0(X6))))&((aElement0(esk4_1(X6))|isConfluent0(X6))|~(aRewritingSystem0(X6))))&((sdtmndtasgtdt0(esk2_1(X6),X6,esk3_1(X6))|isConfluent0(X6))|~(aRewritingSystem0(X6))))&((sdtmndtasgtdt0(esk2_1(X6),X6,esk4_1(X6))|isConfluent0(X6))|~(aRewritingSystem0(X6)))))&(((((aElement0(esk1_4(X6,X7,X8,X9))|((((~(aElement0(X7))|~(aElement0(X8)))|~(aElement0(X9)))|~(sdtmndtasgtdt0(X7,X6,X8)))|~(sdtmndtasgtdt0(X7,X6,X9))))|~(isConfluent0(X6)))|~(aRewritingSystem0(X6)))&(((sdtmndtasgtdt0(X8,X6,esk1_4(X6,X7,X8,X9))|((((~(aElement0(X7))|~(aElement0(X8)))|~(aElement0(X9)))|~(sdtmndtasgtdt0(X7,X6,X8)))|~(sdtmndtasgtdt0(X7,X6,X9))))|~(isConfluent0(X6)))|~(aRewritingSystem0(X6))))&(((sdtmndtasgtdt0(X9,X6,esk1_4(X6,X7,X8,X9))|((((~(aElement0(X7))|~(aElement0(X8)))|~(aElement0(X9)))|~(sdtmndtasgtdt0(X7,X6,X8)))|~(sdtmndtasgtdt0(X7,X6,X9))))|~(isConfluent0(X6)))|~(aRewritingSystem0(X6))))),inference(distribute,[status(thm)],[31])).
% cnf(36,plain,(isConfluent0(X1)|sdtmndtasgtdt0(esk2_1(X1),X1,esk4_1(X1))|~aRewritingSystem0(X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(37,plain,(isConfluent0(X1)|sdtmndtasgtdt0(esk2_1(X1),X1,esk3_1(X1))|~aRewritingSystem0(X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(38,plain,(isConfluent0(X1)|aElement0(esk4_1(X1))|~aRewritingSystem0(X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(39,plain,(isConfluent0(X1)|aElement0(esk3_1(X1))|~aRewritingSystem0(X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(40,plain,(isConfluent0(X1)|aElement0(esk2_1(X1))|~aRewritingSystem0(X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(41,plain,(isConfluent0(X1)|~aRewritingSystem0(X1)|~sdtmndtasgtdt0(esk4_1(X1),X1,X2)|~sdtmndtasgtdt0(esk3_1(X1),X1,X2)|~aElement0(X2)),inference(split_conjunct,[status(thm)],[32])).
% cnf(42,plain,(aRewritingSystem0(xR)),inference(split_conjunct,[status(thm)],[3])).
% fof(45, plain,![X1]:![X2]:![X3]:(((((~(aElement0(X1))|~(aElement0(X2)))|~(aElement0(X3)))|~(sdtmndtasgtdt0(X1,xR,X2)))|~(sdtmndtasgtdt0(X1,xR,X3)))|?[X4]:((aElement0(X4)&sdtmndtasgtdt0(X2,xR,X4))&sdtmndtasgtdt0(X3,xR,X4))),inference(fof_nnf,[status(thm)],[5])).
% fof(46, plain,![X5]:![X6]:![X7]:(((((~(aElement0(X5))|~(aElement0(X6)))|~(aElement0(X7)))|~(sdtmndtasgtdt0(X5,xR,X6)))|~(sdtmndtasgtdt0(X5,xR,X7)))|?[X8]:((aElement0(X8)&sdtmndtasgtdt0(X6,xR,X8))&sdtmndtasgtdt0(X7,xR,X8))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,![X5]:![X6]:![X7]:(((((~(aElement0(X5))|~(aElement0(X6)))|~(aElement0(X7)))|~(sdtmndtasgtdt0(X5,xR,X6)))|~(sdtmndtasgtdt0(X5,xR,X7)))|((aElement0(esk5_3(X5,X6,X7))&sdtmndtasgtdt0(X6,xR,esk5_3(X5,X6,X7)))&sdtmndtasgtdt0(X7,xR,esk5_3(X5,X6,X7)))),inference(skolemize,[status(esa)],[46])).
% fof(48, plain,![X5]:![X6]:![X7]:(((aElement0(esk5_3(X5,X6,X7))|((((~(aElement0(X5))|~(aElement0(X6)))|~(aElement0(X7)))|~(sdtmndtasgtdt0(X5,xR,X6)))|~(sdtmndtasgtdt0(X5,xR,X7))))&(sdtmndtasgtdt0(X6,xR,esk5_3(X5,X6,X7))|((((~(aElement0(X5))|~(aElement0(X6)))|~(aElement0(X7)))|~(sdtmndtasgtdt0(X5,xR,X6)))|~(sdtmndtasgtdt0(X5,xR,X7)))))&(sdtmndtasgtdt0(X7,xR,esk5_3(X5,X6,X7))|((((~(aElement0(X5))|~(aElement0(X6)))|~(aElement0(X7)))|~(sdtmndtasgtdt0(X5,xR,X6)))|~(sdtmndtasgtdt0(X5,xR,X7))))),inference(distribute,[status(thm)],[47])).
% cnf(49,plain,(sdtmndtasgtdt0(X2,xR,esk5_3(X1,X3,X2))|~sdtmndtasgtdt0(X1,xR,X2)|~sdtmndtasgtdt0(X1,xR,X3)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,plain,(sdtmndtasgtdt0(X3,xR,esk5_3(X1,X3,X2))|~sdtmndtasgtdt0(X1,xR,X2)|~sdtmndtasgtdt0(X1,xR,X3)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[48])).
% cnf(51,plain,(aElement0(esk5_3(X1,X3,X2))|~sdtmndtasgtdt0(X1,xR,X2)|~sdtmndtasgtdt0(X1,xR,X3)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[48])).
% cnf(121,negated_conjecture,(~isConfluent0(xR)),inference(split_conjunct,[status(thm)],[24])).
% cnf(131,negated_conjecture,(aElement0(esk2_1(xR))|~aRewritingSystem0(xR)),inference(spm,[status(thm)],[121,40,theory(equality)])).
% cnf(132,negated_conjecture,(aElement0(esk2_1(xR))|$false),inference(rw,[status(thm)],[131,42,theory(equality)])).
% cnf(133,negated_conjecture,(aElement0(esk2_1(xR))),inference(cn,[status(thm)],[132,theory(equality)])).
% cnf(134,negated_conjecture,(aElement0(esk3_1(xR))|~aRewritingSystem0(xR)),inference(spm,[status(thm)],[121,39,theory(equality)])).
% cnf(135,negated_conjecture,(aElement0(esk3_1(xR))|$false),inference(rw,[status(thm)],[134,42,theory(equality)])).
% cnf(136,negated_conjecture,(aElement0(esk3_1(xR))),inference(cn,[status(thm)],[135,theory(equality)])).
% cnf(137,negated_conjecture,(aElement0(esk4_1(xR))|~aRewritingSystem0(xR)),inference(spm,[status(thm)],[121,38,theory(equality)])).
% cnf(138,negated_conjecture,(aElement0(esk4_1(xR))|$false),inference(rw,[status(thm)],[137,42,theory(equality)])).
% cnf(139,negated_conjecture,(aElement0(esk4_1(xR))),inference(cn,[status(thm)],[138,theory(equality)])).
% cnf(140,plain,(isConfluent0(xR)|sdtmndtasgtdt0(esk2_1(xR),xR,esk3_1(xR))),inference(spm,[status(thm)],[37,42,theory(equality)])).
% cnf(141,plain,(sdtmndtasgtdt0(esk2_1(xR),xR,esk3_1(xR))),inference(sr,[status(thm)],[140,121,theory(equality)])).
% cnf(142,plain,(isConfluent0(xR)|sdtmndtasgtdt0(esk2_1(xR),xR,esk4_1(xR))),inference(spm,[status(thm)],[36,42,theory(equality)])).
% cnf(143,plain,(sdtmndtasgtdt0(esk2_1(xR),xR,esk4_1(xR))),inference(sr,[status(thm)],[142,121,theory(equality)])).
% cnf(160,plain,(isConfluent0(xR)|~sdtmndtasgtdt0(esk3_1(xR),xR,esk5_3(X1,esk4_1(xR),X2))|~aRewritingSystem0(xR)|~aElement0(esk5_3(X1,esk4_1(xR),X2))|~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,X2)|~aElement0(esk4_1(xR))|~aElement0(X2)|~aElement0(X1)),inference(spm,[status(thm)],[41,50,theory(equality)])).
% cnf(164,plain,(isConfluent0(xR)|~sdtmndtasgtdt0(esk3_1(xR),xR,esk5_3(X1,esk4_1(xR),X2))|$false|~aElement0(esk5_3(X1,esk4_1(xR),X2))|~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,X2)|~aElement0(esk4_1(xR))|~aElement0(X2)|~aElement0(X1)),inference(rw,[status(thm)],[160,42,theory(equality)])).
% cnf(165,plain,(isConfluent0(xR)|~sdtmndtasgtdt0(esk3_1(xR),xR,esk5_3(X1,esk4_1(xR),X2))|~aElement0(esk5_3(X1,esk4_1(xR),X2))|~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,X2)|~aElement0(esk4_1(xR))|~aElement0(X2)|~aElement0(X1)),inference(cn,[status(thm)],[164,theory(equality)])).
% cnf(166,plain,(~sdtmndtasgtdt0(esk3_1(xR),xR,esk5_3(X1,esk4_1(xR),X2))|~aElement0(esk5_3(X1,esk4_1(xR),X2))|~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,X2)|~aElement0(esk4_1(xR))|~aElement0(X2)|~aElement0(X1)),inference(sr,[status(thm)],[165,121,theory(equality)])).
% cnf(339,plain,(~sdtmndtasgtdt0(esk3_1(xR),xR,esk5_3(X1,esk4_1(xR),X2))|~aElement0(esk5_3(X1,esk4_1(xR),X2))|~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,X2)|$false|~aElement0(X2)|~aElement0(X1)),inference(rw,[status(thm)],[166,139,theory(equality)])).
% cnf(340,plain,(~sdtmndtasgtdt0(esk3_1(xR),xR,esk5_3(X1,esk4_1(xR),X2))|~aElement0(esk5_3(X1,esk4_1(xR),X2))|~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,X2)|~aElement0(X2)|~aElement0(X1)),inference(cn,[status(thm)],[339,theory(equality)])).
% cnf(341,plain,(~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,esk3_1(xR))|~aElement0(esk5_3(X1,esk4_1(xR),esk3_1(xR)))|~aElement0(esk3_1(xR))|~aElement0(X1)|~aElement0(esk4_1(xR))),inference(spm,[status(thm)],[340,49,theory(equality)])).
% cnf(342,plain,(~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,esk3_1(xR))|~aElement0(esk5_3(X1,esk4_1(xR),esk3_1(xR)))|$false|~aElement0(X1)|~aElement0(esk4_1(xR))),inference(rw,[status(thm)],[341,136,theory(equality)])).
% cnf(343,plain,(~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,esk3_1(xR))|~aElement0(esk5_3(X1,esk4_1(xR),esk3_1(xR)))|$false|~aElement0(X1)|$false),inference(rw,[status(thm)],[342,139,theory(equality)])).
% cnf(344,plain,(~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,esk3_1(xR))|~aElement0(esk5_3(X1,esk4_1(xR),esk3_1(xR)))|~aElement0(X1)),inference(cn,[status(thm)],[343,theory(equality)])).
% cnf(345,plain,(~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,esk3_1(xR))|~aElement0(X1)|~aElement0(esk4_1(xR))|~aElement0(esk3_1(xR))),inference(spm,[status(thm)],[344,51,theory(equality)])).
% cnf(346,plain,(~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,esk3_1(xR))|~aElement0(X1)|$false|~aElement0(esk3_1(xR))),inference(rw,[status(thm)],[345,139,theory(equality)])).
% cnf(347,plain,(~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,esk3_1(xR))|~aElement0(X1)|$false|$false),inference(rw,[status(thm)],[346,136,theory(equality)])).
% cnf(348,plain,(~sdtmndtasgtdt0(X1,xR,esk4_1(xR))|~sdtmndtasgtdt0(X1,xR,esk3_1(xR))|~aElement0(X1)),inference(cn,[status(thm)],[347,theory(equality)])).
% cnf(349,plain,(~sdtmndtasgtdt0(esk2_1(xR),xR,esk3_1(xR))|~aElement0(esk2_1(xR))),inference(spm,[status(thm)],[348,143,theory(equality)])).
% cnf(352,plain,($false|~aElement0(esk2_1(xR))),inference(rw,[status(thm)],[349,141,theory(equality)])).
% cnf(353,plain,($false|$false),inference(rw,[status(thm)],[352,133,theory(equality)])).
% cnf(354,plain,($false),inference(cn,[status(thm)],[353,theory(equality)])).
% cnf(355,plain,($false),354,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 137
% # ...of these trivial : 0
% # ...subsumed : 6
% # ...remaining for further processing: 131
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 105
% # ...of the previous two non-trivial : 91
% # Contextual simplify-reflections : 26
% # Paramodulations : 104
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 83
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 73
% # Current number of unprocessed clauses: 46
% # ...number of literals in the above : 350
% # Clause-clause subsumption calls (NU) : 201
% # Rec. Clause-clause subsumption calls : 89
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 82 leaves, 1.74+/-2.041 terms/leaf
% # Paramod-from index: 37 leaves, 1.27+/-0.722 terms/leaf
% # Paramod-into index: 68 leaves, 1.40+/-0.942 terms/leaf
% # -------------------------------------------------
% # User time : 0.028 s
% # System time : 0.003 s
% # Total time : 0.031 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.20 WC
% FINAL PrfWatch: 0.14 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP12633/COM023+1.tptp
%
%------------------------------------------------------------------------------