TSTP Solution File: SWC110+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC110+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 : art04.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:05:07 EST 2010
% Result : Theorem 1.59s
% Output : Solution 1.59s
% 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/SystemOnTPTP22747/SWC110+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22747/SWC110+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22747/SWC110+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 22879
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, 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(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(7, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(14, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(27, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(equalelemsP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssList(X8)&app(X8,cons(X6,nil))=X3))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|(neq(X1,nil)&segmentP(X2,X1))))))))),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))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(equalelemsP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssList(X8)&app(X8,cons(X6,nil))=X3))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|(neq(X1,nil)&segmentP(X2,X1)))))))))),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))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(equalelemsP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssList(X8)&app(X8,cons(X6,nil))=X3))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|(neq(X1,nil)&segmentP(X2,X1)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, 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)],[3])).
% fof(116, 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)],[115])).
% fof(117, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[116])).
% fof(118, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[117])).
% fof(119, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk3_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk4_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[118])).
% cnf(123,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[119])).
% fof(136, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[5])).
% fof(137, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[136])).
% fof(138, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[137])).
% fof(139, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[138])).
% cnf(140,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[139])).
% cnf(146,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[7])).
% fof(176, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[14])).
% fof(177, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[176])).
% cnf(178,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[177])).
% fof(222, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(nil=app(X1,X2))|(nil=X2&nil=X1))&((~(nil=X2)|~(nil=X1))|nil=app(X1,X2))))),inference(fof_nnf,[status(thm)],[27])).
% fof(223, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))),inference(variable_rename,[status(thm)],[222])).
% fof(224, plain,![X3]:![X4]:((~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[223])).
% fof(225, plain,![X3]:![X4]:(((((nil=X4|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3)))&(((nil=X3|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3))))&((((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[224])).
% cnf(227,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[225])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&?[X5]:(ssList(X5)&((app(X3,X5)=X4&equalelemsP(X3))&![X6]:(~(ssItem(X6))|![X7]:((~(ssList(X7))|~(app(cons(X6,nil),X7)=X5))|![X8]:(~(ssList(X8))|~(app(X8,cons(X6,nil))=X3)))))))&(nil=X4|~(nil=X3)))&((nil=X2&~(nil=X1))|(neq(X2,nil)&(~(neq(X1,nil))|~(segmentP(X2,X1)))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&((((X10=X12&X9=X11)&?[X13]:(ssList(X13)&((app(X11,X13)=X12&equalelemsP(X11))&![X14]:(~(ssItem(X14))|![X15]:((~(ssList(X15))|~(app(cons(X14,nil),X15)=X13))|![X16]:(~(ssList(X16))|~(app(X16,cons(X14,nil))=X11)))))))&(nil=X12|~(nil=X11)))&((nil=X10&~(nil=X9))|(neq(X10,nil)&(~(neq(X9,nil))|~(segmentP(X10,X9)))))))))),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)&(ssList(esk52_0)&((app(esk50_0,esk52_0)=esk51_0&equalelemsP(esk50_0))&![X14]:(~(ssItem(X14))|![X15]:((~(ssList(X15))|~(app(cons(X14,nil),X15)=esk52_0))|![X16]:(~(ssList(X16))|~(app(X16,cons(X14,nil))=esk50_0)))))))&(nil=esk51_0|~(nil=esk50_0)))&((nil=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&(~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0)))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X14]:![X15]:![X16]:((((((((((((~(ssList(X16))|~(app(X16,cons(X14,nil))=esk50_0))|(~(ssList(X15))|~(app(cons(X14,nil),X15)=esk52_0)))|~(ssItem(X14)))&(app(esk50_0,esk52_0)=esk51_0&equalelemsP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk51_0|~(nil=esk50_0)))&((nil=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&(~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X14]:![X15]:![X16]:((((((((((((~(ssList(X16))|~(app(X16,cons(X14,nil))=esk50_0))|(~(ssList(X15))|~(app(cons(X14,nil),X15)=esk52_0)))|~(ssItem(X14)))&(app(esk50_0,esk52_0)=esk51_0&equalelemsP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk51_0|~(nil=esk50_0)))&(((neq(esk49_0,nil)|nil=esk49_0)&((~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0)))|nil=esk49_0))&((neq(esk49_0,nil)|~(nil=esk48_0))&((~(neq(esk48_0,nil))|~(segmentP(esk49_0,esk48_0)))|~(nil=esk48_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!=esk48_0|~segmentP(esk49_0,esk48_0)|~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(neq(esk49_0,nil)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(nil=esk49_0|~segmentP(esk49_0,esk48_0)|~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(nil=esk51_0|nil!=esk50_0),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,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(app(esk50_0,esk52_0)=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(esk49_0=nil|esk50_0!=nil),inference(rw,[status(thm)],[581,583,theory(equality)])).
% cnf(592,negated_conjecture,(esk49_0=nil|esk48_0!=nil),inference(rw,[status(thm)],[591,582,theory(equality)])).
% cnf(593,negated_conjecture,(app(esk48_0,esk52_0)=esk51_0),inference(rw,[status(thm)],[586,582,theory(equality)])).
% cnf(594,negated_conjecture,(app(esk48_0,esk52_0)=esk49_0),inference(rw,[status(thm)],[593,583,theory(equality)])).
% cnf(624,negated_conjecture,(nil=esk48_0|esk49_0!=nil|~ssList(esk52_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[227,594,theory(equality)])).
% cnf(626,negated_conjecture,(nil=esk48_0|esk49_0!=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[624,584,theory(equality)])).
% cnf(627,negated_conjecture,(nil=esk48_0|esk49_0!=nil|$false|$false),inference(rw,[status(thm)],[626,573,theory(equality)])).
% cnf(628,negated_conjecture,(nil=esk48_0|esk49_0!=nil),inference(cn,[status(thm)],[627,theory(equality)])).
% cnf(841,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[123,178,theory(equality)])).
% cnf(848,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[841,146,theory(equality)])).
% cnf(849,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[848,theory(equality)])).
% cnf(9194,negated_conjecture,(segmentP(X1,esk48_0)|esk49_0!=X1|~ssList(esk52_0)|~ssList(esk48_0)|~ssList(X1)),inference(spm,[status(thm)],[849,594,theory(equality)])).
% cnf(9235,negated_conjecture,(segmentP(X1,esk48_0)|esk49_0!=X1|$false|~ssList(esk48_0)|~ssList(X1)),inference(rw,[status(thm)],[9194,584,theory(equality)])).
% cnf(9236,negated_conjecture,(segmentP(X1,esk48_0)|esk49_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[9235,573,theory(equality)])).
% cnf(9237,negated_conjecture,(segmentP(X1,esk48_0)|esk49_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[9236,theory(equality)])).
% cnf(9659,negated_conjecture,(segmentP(esk49_0,esk48_0)|~ssList(esk49_0)),inference(er,[status(thm)],[9237,theory(equality)])).
% cnf(9660,negated_conjecture,(segmentP(esk49_0,esk48_0)|$false),inference(rw,[status(thm)],[9659,574,theory(equality)])).
% cnf(9661,negated_conjecture,(segmentP(esk49_0,esk48_0)),inference(cn,[status(thm)],[9660,theory(equality)])).
% cnf(9668,negated_conjecture,(esk48_0!=nil|$false|~neq(esk48_0,nil)),inference(rw,[status(thm)],[577,9661,theory(equality)])).
% cnf(9669,negated_conjecture,(esk48_0!=nil|~neq(esk48_0,nil)),inference(cn,[status(thm)],[9668,theory(equality)])).
% cnf(9670,negated_conjecture,(esk49_0=nil|$false|~neq(esk48_0,nil)),inference(rw,[status(thm)],[579,9661,theory(equality)])).
% cnf(9671,negated_conjecture,(esk49_0=nil|~neq(esk48_0,nil)),inference(cn,[status(thm)],[9670,theory(equality)])).
% cnf(9691,negated_conjecture,(esk49_0=nil|esk48_0=nil|~ssList(nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[9671,140,theory(equality)])).
% cnf(9692,negated_conjecture,(esk49_0=nil|esk48_0=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[9691,146,theory(equality)])).
% cnf(9693,negated_conjecture,(esk49_0=nil|esk48_0=nil|$false|$false),inference(rw,[status(thm)],[9692,573,theory(equality)])).
% cnf(9694,negated_conjecture,(esk49_0=nil|esk48_0=nil),inference(cn,[status(thm)],[9693,theory(equality)])).
% cnf(9695,negated_conjecture,(esk49_0=nil),inference(csr,[status(thm)],[9694,592])).
% cnf(10013,negated_conjecture,(esk48_0=nil|$false),inference(rw,[status(thm)],[628,9695,theory(equality)])).
% cnf(10014,negated_conjecture,(esk48_0=nil),inference(cn,[status(thm)],[10013,theory(equality)])).
% cnf(10017,negated_conjecture,(neq(nil,nil)|esk48_0!=nil),inference(rw,[status(thm)],[578,9695,theory(equality)])).
% cnf(10270,negated_conjecture,($false|~neq(esk48_0,nil)),inference(rw,[status(thm)],[9669,10014,theory(equality)])).
% cnf(10271,negated_conjecture,($false|~neq(nil,nil)),inference(rw,[status(thm)],[10270,10014,theory(equality)])).
% cnf(10272,negated_conjecture,(~neq(nil,nil)),inference(cn,[status(thm)],[10271,theory(equality)])).
% cnf(10333,negated_conjecture,(neq(nil,nil)|$false),inference(rw,[status(thm)],[10017,10014,theory(equality)])).
% cnf(10334,negated_conjecture,(neq(nil,nil)),inference(cn,[status(thm)],[10333,theory(equality)])).
% cnf(10335,negated_conjecture,($false),inference(sr,[status(thm)],[10334,10272,theory(equality)])).
% cnf(10336,negated_conjecture,($false),10335,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1149
% # ...of these trivial : 23
% # ...subsumed : 384
% # ...remaining for further processing: 742
% # Other redundant clauses eliminated : 120
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 63
% # Backward-rewritten : 402
% # Generated clauses : 3489
% # ...of the previous two non-trivial : 3116
% # Contextual simplify-reflections : 270
% # Paramodulations : 3321
% # Factorizations : 0
% # Equation resolutions : 168
% # Current number of processed clauses: 270
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 244
% # Current number of unprocessed clauses: 1039
% # ...number of literals in the above : 6538
% # Clause-clause subsumption calls (NU) : 15021
% # Rec. Clause-clause subsumption calls : 11236
% # Unit Clause-clause subsumption calls : 194
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 44
% # Indexed BW rewrite successes : 35
% # Backwards rewriting index: 266 leaves, 1.40+/-1.130 terms/leaf
% # Paramod-from index: 143 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 241 leaves, 1.22+/-0.946 terms/leaf
% # -------------------------------------------------
% # User time : 0.259 s
% # System time : 0.009 s
% # Total time : 0.268 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.51 CPU 0.59 WC
% FINAL PrfWatch: 0.51 CPU 0.59 WC
% SZS output end Solution for /tmp/SystemOnTPTP22747/SWC110+1.tptp
%
%------------------------------------------------------------------------------