TSTP Solution File: SWC085+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC085+1 : TPTP v5.0.0. Released v2.4.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 07:01:11 EST 2010
% Result : Theorem 1.44s
% Output : Solution 1.44s
% 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/SystemOnTPTP21803/SWC085+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21803/SWC085+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21803/SWC085+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 21899
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(10, axiom,![X1]:(ssList(X1)=>segmentP(X1,X1)),file('/tmp/SRASS.s.p', ax55)).
% fof(11, axiom,![X1]:(ssList(X1)=>segmentP(X1,nil)),file('/tmp/SRASS.s.p', ax57)).
% fof(14, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(15, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(segmentP(X1,X2)<=>?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1))))),file('/tmp/SRASS.s.p', ax7)).
% fof(16, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(neq(X2,nil)))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(frontsegP(X4,X3))))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(neq(X2,nil)))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(frontsegP(X4,X3)))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(neq(X2,nil)))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(frontsegP(X4,X3)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% fof(138, plain,![X1]:(~(ssList(X1))|segmentP(X1,X1)),inference(fof_nnf,[status(thm)],[10])).
% fof(139, plain,![X2]:(~(ssList(X2))|segmentP(X2,X2)),inference(variable_rename,[status(thm)],[138])).
% cnf(140,plain,(segmentP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[139])).
% fof(141, plain,![X1]:(~(ssList(X1))|segmentP(X1,nil)),inference(fof_nnf,[status(thm)],[11])).
% fof(142, plain,![X2]:(~(ssList(X2))|segmentP(X2,nil)),inference(variable_rename,[status(thm)],[141])).
% cnf(143,plain,(segmentP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[142])).
% fof(155, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(frontsegP(X1,X2))|?[X3]:(ssList(X3)&app(X2,X3)=X1))&(![X3]:(~(ssList(X3))|~(app(X2,X3)=X1))|frontsegP(X1,X2))))),inference(fof_nnf,[status(thm)],[14])).
% fof(156, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|?[X6]:(ssList(X6)&app(X5,X6)=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(variable_rename,[status(thm)],[155])).
% fof(157, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(X5,esk1_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[156])).
% fof(158, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(X5,esk1_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[157])).
% fof(159, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk1_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk1_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[158])).
% cnf(160,plain,(app(X2,esk1_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[159])).
% cnf(161,plain,(ssList(esk1_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[159])).
% fof(163, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(segmentP(X1,X2))|?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1)))&(![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|~(app(app(X3,X2),X4)=X1)))|segmentP(X1,X2))))),inference(fof_nnf,[status(thm)],[15])).
% fof(164, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&app(app(X7,X6),X8)=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(variable_rename,[status(thm)],[163])).
% fof(165, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk2_2(X5,X6))&(ssList(esk3_2(X5,X6))&app(app(esk2_2(X5,X6),X6),esk3_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[164])).
% fof(166, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk2_2(X5,X6))&(ssList(esk3_2(X5,X6))&app(app(esk2_2(X5,X6),X6),esk3_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[165])).
% fof(167, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk2_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk3_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk2_2(X5,X6),X6),esk3_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[166])).
% cnf(171,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[167])).
% fof(172, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[16])).
% fof(173, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[172])).
% cnf(174,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[173])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&neq(X2,nil))&![X5]:(((~(ssList(X5))|~(neq(X5,nil)))|~(segmentP(X2,X5)))|~(segmentP(X1,X5))))&((nil=X4&nil=X3)|(neq(X3,nil)&frontsegP(X4,X3)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&((((X7=X9&X6=X8)&neq(X7,nil))&![X10]:(((~(ssList(X10))|~(neq(X10,nil)))|~(segmentP(X7,X10)))|~(segmentP(X6,X10))))&((nil=X9&nil=X8)|(neq(X8,nil)&frontsegP(X9,X8)))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil))&![X10]:(((~(ssList(X10))|~(neq(X10,nil)))|~(segmentP(esk49_0,X10)))|~(segmentP(esk48_0,X10))))&((nil=esk51_0&nil=esk50_0)|(neq(esk50_0,nil)&frontsegP(esk51_0,esk50_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X10]:(((((((((~(ssList(X10))|~(neq(X10,nil)))|~(segmentP(esk49_0,X10)))|~(segmentP(esk48_0,X10)))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil)))&((nil=esk51_0&nil=esk50_0)|(neq(esk50_0,nil)&frontsegP(esk51_0,esk50_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X10]:(((((((((~(ssList(X10))|~(neq(X10,nil)))|~(segmentP(esk49_0,X10)))|~(segmentP(esk48_0,X10)))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil)))&(((neq(esk50_0,nil)|nil=esk51_0)&(frontsegP(esk51_0,esk50_0)|nil=esk51_0))&((neq(esk50_0,nil)|nil=esk50_0)&(frontsegP(esk51_0,esk50_0)|nil=esk50_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(nil=esk50_0|frontsegP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(nil=esk50_0|neq(esk50_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(nil=esk51_0|neq(esk50_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,582,theory(equality)])).
% cnf(586,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,583,theory(equality)])).
% cnf(589,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[581,583,theory(equality)])).
% cnf(596,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~segmentP(esk50_0,X1)|~segmentP(esk49_0,X1)),inference(rw,[status(thm)],[584,582,theory(equality)])).
% cnf(597,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~segmentP(esk50_0,X1)|~segmentP(esk51_0,X1)),inference(rw,[status(thm)],[596,583,theory(equality)])).
% cnf(598,negated_conjecture,(~segmentP(esk51_0,nil)|~neq(nil,nil)|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[597,143,theory(equality)])).
% cnf(599,negated_conjecture,(~segmentP(esk51_0,esk50_0)|~neq(esk50_0,nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[597,140,theory(equality)])).
% cnf(600,negated_conjecture,(~segmentP(esk51_0,nil)|~neq(nil,nil)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[598,110,theory(equality)])).
% cnf(601,negated_conjecture,(~segmentP(esk51_0,nil)|~neq(nil,nil)|$false|$false),inference(rw,[status(thm)],[600,585,theory(equality)])).
% cnf(602,negated_conjecture,(~segmentP(esk51_0,nil)|~neq(nil,nil)),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(603,negated_conjecture,(~segmentP(esk51_0,esk50_0)|~neq(esk50_0,nil)|$false),inference(rw,[status(thm)],[599,585,theory(equality)])).
% cnf(604,negated_conjecture,(~segmentP(esk51_0,esk50_0)|~neq(esk50_0,nil)),inference(cn,[status(thm)],[603,theory(equality)])).
% cnf(629,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|esk50_0=nil|~ssList(esk50_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[161,577,theory(equality)])).
% cnf(633,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|esk50_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[629,585,theory(equality)])).
% cnf(634,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|esk50_0=nil|$false|$false),inference(rw,[status(thm)],[633,586,theory(equality)])).
% cnf(635,negated_conjecture,(ssList(esk1_2(esk51_0,esk50_0))|esk50_0=nil),inference(cn,[status(thm)],[634,theory(equality)])).
% cnf(800,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0|esk50_0=nil|~ssList(esk50_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[160,577,theory(equality)])).
% cnf(804,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0|esk50_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[800,585,theory(equality)])).
% cnf(805,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0|esk50_0=nil|$false|$false),inference(rw,[status(thm)],[804,586,theory(equality)])).
% cnf(806,negated_conjecture,(app(esk50_0,esk1_2(esk51_0,esk50_0))=esk51_0|esk50_0=nil),inference(cn,[status(thm)],[805,theory(equality)])).
% cnf(827,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[171,174,theory(equality)])).
% cnf(830,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[827,110,theory(equality)])).
% cnf(831,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[830,theory(equality)])).
% cnf(1373,negated_conjecture,(~neq(nil,nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[602,143,theory(equality)])).
% cnf(1374,negated_conjecture,(~neq(nil,nil)|$false),inference(rw,[status(thm)],[1373,586,theory(equality)])).
% cnf(1375,negated_conjecture,(~neq(nil,nil)),inference(cn,[status(thm)],[1374,theory(equality)])).
% cnf(4987,negated_conjecture,(segmentP(X1,esk50_0)|esk50_0=nil|esk51_0!=X1|~ssList(esk1_2(esk51_0,esk50_0))|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[831,806,theory(equality)])).
% cnf(5016,negated_conjecture,(segmentP(X1,esk50_0)|esk50_0=nil|esk51_0!=X1|~ssList(esk1_2(esk51_0,esk50_0))|$false|~ssList(X1)),inference(rw,[status(thm)],[4987,585,theory(equality)])).
% cnf(5017,negated_conjecture,(segmentP(X1,esk50_0)|esk50_0=nil|esk51_0!=X1|~ssList(esk1_2(esk51_0,esk50_0))|~ssList(X1)),inference(cn,[status(thm)],[5016,theory(equality)])).
% cnf(5066,negated_conjecture,(esk50_0=nil|segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(X1)),inference(csr,[status(thm)],[5017,635])).
% cnf(5067,negated_conjecture,(esk50_0=nil|segmentP(esk51_0,esk50_0)|~ssList(esk51_0)),inference(er,[status(thm)],[5066,theory(equality)])).
% cnf(5068,negated_conjecture,(esk50_0=nil|segmentP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[5067,586,theory(equality)])).
% cnf(5069,negated_conjecture,(esk50_0=nil|segmentP(esk51_0,esk50_0)),inference(cn,[status(thm)],[5068,theory(equality)])).
% cnf(5076,negated_conjecture,(esk50_0=nil|~neq(esk50_0,nil)),inference(spm,[status(thm)],[604,5069,theory(equality)])).
% cnf(5095,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[5076,578])).
% cnf(5268,negated_conjecture,(esk51_0=nil|neq(nil,nil)),inference(rw,[status(thm)],[580,5095,theory(equality)])).
% cnf(5269,negated_conjecture,(esk51_0=nil),inference(sr,[status(thm)],[5268,1375,theory(equality)])).
% cnf(5421,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[589,5269,theory(equality)])).
% cnf(5422,negated_conjecture,($false),inference(sr,[status(thm)],[5421,1375,theory(equality)])).
% cnf(5423,negated_conjecture,($false),5422,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 824
% # ...of these trivial : 2
% # ...subsumed : 339
% # ...remaining for further processing: 483
% # Other redundant clauses eliminated : 95
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 31
% # Backward-rewritten : 185
% # Generated clauses : 2059
% # ...of the previous two non-trivial : 1799
% # Contextual simplify-reflections : 435
% # Paramodulations : 1911
% # Factorizations : 0
% # Equation resolutions : 148
% # Current number of processed clauses: 261
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 238
% # Current number of unprocessed clauses: 802
% # ...number of literals in the above : 5593
% # Clause-clause subsumption calls (NU) : 11467
% # Rec. Clause-clause subsumption calls : 4630
% # Unit Clause-clause subsumption calls : 60
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 258 leaves, 1.39+/-1.170 terms/leaf
% # Paramod-from index: 138 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 232 leaves, 1.23+/-1.007 terms/leaf
% # -------------------------------------------------
% # User time : 0.170 s
% # System time : 0.011 s
% # Total time : 0.181 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.34 CPU 0.42 WC
% FINAL PrfWatch: 0.34 CPU 0.42 WC
% SZS output end Solution for /tmp/SystemOnTPTP21803/SWC085+1.tptp
%
%------------------------------------------------------------------------------