TSTP Solution File: PRO010+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PRO010+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 : Wed Dec 29 21:10:34 EST 2010
% Result : Theorem 1.03s
% Output : Solution 1.03s
% 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/SystemOnTPTP18526/PRO010+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18526/PRO010+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18526/PRO010+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 18622
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,~(tptp1=tptp2),file('/tmp/SRASS.s.p', sos_44)).
% fof(7, axiom,![X17]:(occurrence_of(X17,tptp0)=>?[X18]:?[X19]:?[X20]:((((((occurrence_of(X18,tptp3)&root_occ(X18,X17))&occurrence_of(X19,tptp4))&next_subocc(X18,X19,tptp0))&(occurrence_of(X20,tptp1)|occurrence_of(X20,tptp2)))&next_subocc(X19,X20,tptp0))&leaf_occ(X20,X17))),file('/tmp/SRASS.s.p', sos_32)).
% fof(17, axiom,![X44]:![X45]:(leaf_occ(X44,X45)<=>?[X46]:((occurrence_of(X45,X46)&subactivity_occurrence(X44,X45))&leaf(X44,X46))),file('/tmp/SRASS.s.p', sos_18)).
% fof(18, axiom,![X47]:![X48]:![X49]:((occurrence_of(X47,X48)&occurrence_of(X47,X49))=>X48=X49),file('/tmp/SRASS.s.p', sos_08)).
% fof(30, axiom,![X70]:![X71]:(leaf(X70,X71)<=>((root(X70,X71)|?[X72]:min_precedes(X72,X70,X71))&~(?[X73]:min_precedes(X70,X73,X71)))),file('/tmp/SRASS.s.p', sos_15)).
% fof(43, axiom,![X100]:![X101]:(occurrence_of(X101,X100)=>(activity(X100)&activity_occurrence(X101))),file('/tmp/SRASS.s.p', sos_03)).
% fof(44, axiom,![X102]:(activity_occurrence(X102)=>?[X103]:(activity(X103)&occurrence_of(X102,X103))),file('/tmp/SRASS.s.p', sos_12)).
% fof(46, conjecture,![X106]:(occurrence_of(X106,tptp0)=>?[X107]:?[X108]:((leaf_occ(X108,X106)&(occurrence_of(X108,tptp1)=>~(?[X109]:(occurrence_of(X109,tptp2)&min_precedes(X107,X109,tptp0)))))&(occurrence_of(X108,tptp2)=>~(?[X110]:(occurrence_of(X110,tptp1)&min_precedes(X107,X110,tptp0)))))),file('/tmp/SRASS.s.p', goals)).
% fof(47, negated_conjecture,~(![X106]:(occurrence_of(X106,tptp0)=>?[X107]:?[X108]:((leaf_occ(X108,X106)&(occurrence_of(X108,tptp1)=>~(?[X109]:(occurrence_of(X109,tptp2)&min_precedes(X107,X109,tptp0)))))&(occurrence_of(X108,tptp2)=>~(?[X110]:(occurrence_of(X110,tptp1)&min_precedes(X107,X110,tptp0))))))),inference(assume_negation,[status(cth)],[46])).
% cnf(59,plain,(tptp1!=tptp2),inference(split_conjunct,[status(thm)],[2])).
% fof(75, plain,![X17]:(~(occurrence_of(X17,tptp0))|?[X18]:?[X19]:?[X20]:((((((occurrence_of(X18,tptp3)&root_occ(X18,X17))&occurrence_of(X19,tptp4))&next_subocc(X18,X19,tptp0))&(occurrence_of(X20,tptp1)|occurrence_of(X20,tptp2)))&next_subocc(X19,X20,tptp0))&leaf_occ(X20,X17))),inference(fof_nnf,[status(thm)],[7])).
% fof(76, plain,![X21]:(~(occurrence_of(X21,tptp0))|?[X22]:?[X23]:?[X24]:((((((occurrence_of(X22,tptp3)&root_occ(X22,X21))&occurrence_of(X23,tptp4))&next_subocc(X22,X23,tptp0))&(occurrence_of(X24,tptp1)|occurrence_of(X24,tptp2)))&next_subocc(X23,X24,tptp0))&leaf_occ(X24,X21))),inference(variable_rename,[status(thm)],[75])).
% fof(77, plain,![X21]:(~(occurrence_of(X21,tptp0))|((((((occurrence_of(esk2_1(X21),tptp3)&root_occ(esk2_1(X21),X21))&occurrence_of(esk3_1(X21),tptp4))&next_subocc(esk2_1(X21),esk3_1(X21),tptp0))&(occurrence_of(esk4_1(X21),tptp1)|occurrence_of(esk4_1(X21),tptp2)))&next_subocc(esk3_1(X21),esk4_1(X21),tptp0))&leaf_occ(esk4_1(X21),X21))),inference(skolemize,[status(esa)],[76])).
% fof(78, plain,![X21]:(((((((occurrence_of(esk2_1(X21),tptp3)|~(occurrence_of(X21,tptp0)))&(root_occ(esk2_1(X21),X21)|~(occurrence_of(X21,tptp0))))&(occurrence_of(esk3_1(X21),tptp4)|~(occurrence_of(X21,tptp0))))&(next_subocc(esk2_1(X21),esk3_1(X21),tptp0)|~(occurrence_of(X21,tptp0))))&((occurrence_of(esk4_1(X21),tptp1)|occurrence_of(esk4_1(X21),tptp2))|~(occurrence_of(X21,tptp0))))&(next_subocc(esk3_1(X21),esk4_1(X21),tptp0)|~(occurrence_of(X21,tptp0))))&(leaf_occ(esk4_1(X21),X21)|~(occurrence_of(X21,tptp0)))),inference(distribute,[status(thm)],[77])).
% cnf(79,plain,(leaf_occ(esk4_1(X1),X1)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[78])).
% fof(113, plain,![X44]:![X45]:((~(leaf_occ(X44,X45))|?[X46]:((occurrence_of(X45,X46)&subactivity_occurrence(X44,X45))&leaf(X44,X46)))&(![X46]:((~(occurrence_of(X45,X46))|~(subactivity_occurrence(X44,X45)))|~(leaf(X44,X46)))|leaf_occ(X44,X45))),inference(fof_nnf,[status(thm)],[17])).
% fof(114, plain,![X47]:![X48]:((~(leaf_occ(X47,X48))|?[X49]:((occurrence_of(X48,X49)&subactivity_occurrence(X47,X48))&leaf(X47,X49)))&(![X50]:((~(occurrence_of(X48,X50))|~(subactivity_occurrence(X47,X48)))|~(leaf(X47,X50)))|leaf_occ(X47,X48))),inference(variable_rename,[status(thm)],[113])).
% fof(115, plain,![X47]:![X48]:((~(leaf_occ(X47,X48))|((occurrence_of(X48,esk7_2(X47,X48))&subactivity_occurrence(X47,X48))&leaf(X47,esk7_2(X47,X48))))&(![X50]:((~(occurrence_of(X48,X50))|~(subactivity_occurrence(X47,X48)))|~(leaf(X47,X50)))|leaf_occ(X47,X48))),inference(skolemize,[status(esa)],[114])).
% fof(116, plain,![X47]:![X48]:![X50]:((((~(occurrence_of(X48,X50))|~(subactivity_occurrence(X47,X48)))|~(leaf(X47,X50)))|leaf_occ(X47,X48))&(~(leaf_occ(X47,X48))|((occurrence_of(X48,esk7_2(X47,X48))&subactivity_occurrence(X47,X48))&leaf(X47,esk7_2(X47,X48))))),inference(shift_quantors,[status(thm)],[115])).
% fof(117, plain,![X47]:![X48]:![X50]:((((~(occurrence_of(X48,X50))|~(subactivity_occurrence(X47,X48)))|~(leaf(X47,X50)))|leaf_occ(X47,X48))&(((occurrence_of(X48,esk7_2(X47,X48))|~(leaf_occ(X47,X48)))&(subactivity_occurrence(X47,X48)|~(leaf_occ(X47,X48))))&(leaf(X47,esk7_2(X47,X48))|~(leaf_occ(X47,X48))))),inference(distribute,[status(thm)],[116])).
% cnf(118,plain,(leaf(X1,esk7_2(X1,X2))|~leaf_occ(X1,X2)),inference(split_conjunct,[status(thm)],[117])).
% cnf(120,plain,(occurrence_of(X2,esk7_2(X1,X2))|~leaf_occ(X1,X2)),inference(split_conjunct,[status(thm)],[117])).
% fof(122, plain,![X47]:![X48]:![X49]:((~(occurrence_of(X47,X48))|~(occurrence_of(X47,X49)))|X48=X49),inference(fof_nnf,[status(thm)],[18])).
% fof(123, plain,![X50]:![X51]:![X52]:((~(occurrence_of(X50,X51))|~(occurrence_of(X50,X52)))|X51=X52),inference(variable_rename,[status(thm)],[122])).
% cnf(124,plain,(X1=X2|~occurrence_of(X3,X2)|~occurrence_of(X3,X1)),inference(split_conjunct,[status(thm)],[123])).
% fof(154, plain,![X70]:![X71]:((~(leaf(X70,X71))|((root(X70,X71)|?[X72]:min_precedes(X72,X70,X71))&![X73]:~(min_precedes(X70,X73,X71))))&(((~(root(X70,X71))&![X72]:~(min_precedes(X72,X70,X71)))|?[X73]:min_precedes(X70,X73,X71))|leaf(X70,X71))),inference(fof_nnf,[status(thm)],[30])).
% fof(155, plain,![X74]:![X75]:((~(leaf(X74,X75))|((root(X74,X75)|?[X76]:min_precedes(X76,X74,X75))&![X77]:~(min_precedes(X74,X77,X75))))&(((~(root(X74,X75))&![X78]:~(min_precedes(X78,X74,X75)))|?[X79]:min_precedes(X74,X79,X75))|leaf(X74,X75))),inference(variable_rename,[status(thm)],[154])).
% fof(156, plain,![X74]:![X75]:((~(leaf(X74,X75))|((root(X74,X75)|min_precedes(esk9_2(X74,X75),X74,X75))&![X77]:~(min_precedes(X74,X77,X75))))&(((~(root(X74,X75))&![X78]:~(min_precedes(X78,X74,X75)))|min_precedes(X74,esk10_2(X74,X75),X75))|leaf(X74,X75))),inference(skolemize,[status(esa)],[155])).
% fof(157, plain,![X74]:![X75]:![X77]:![X78]:((((~(min_precedes(X78,X74,X75))&~(root(X74,X75)))|min_precedes(X74,esk10_2(X74,X75),X75))|leaf(X74,X75))&((~(min_precedes(X74,X77,X75))&(root(X74,X75)|min_precedes(esk9_2(X74,X75),X74,X75)))|~(leaf(X74,X75)))),inference(shift_quantors,[status(thm)],[156])).
% fof(158, plain,![X74]:![X75]:![X77]:![X78]:((((~(min_precedes(X78,X74,X75))|min_precedes(X74,esk10_2(X74,X75),X75))|leaf(X74,X75))&((~(root(X74,X75))|min_precedes(X74,esk10_2(X74,X75),X75))|leaf(X74,X75)))&((~(min_precedes(X74,X77,X75))|~(leaf(X74,X75)))&((root(X74,X75)|min_precedes(esk9_2(X74,X75),X74,X75))|~(leaf(X74,X75))))),inference(distribute,[status(thm)],[157])).
% cnf(160,plain,(~leaf(X1,X2)|~min_precedes(X1,X3,X2)),inference(split_conjunct,[status(thm)],[158])).
% fof(219, plain,![X100]:![X101]:(~(occurrence_of(X101,X100))|(activity(X100)&activity_occurrence(X101))),inference(fof_nnf,[status(thm)],[43])).
% fof(220, plain,![X102]:![X103]:(~(occurrence_of(X103,X102))|(activity(X102)&activity_occurrence(X103))),inference(variable_rename,[status(thm)],[219])).
% fof(221, plain,![X102]:![X103]:((activity(X102)|~(occurrence_of(X103,X102)))&(activity_occurrence(X103)|~(occurrence_of(X103,X102)))),inference(distribute,[status(thm)],[220])).
% cnf(222,plain,(activity_occurrence(X1)|~occurrence_of(X1,X2)),inference(split_conjunct,[status(thm)],[221])).
% fof(224, plain,![X102]:(~(activity_occurrence(X102))|?[X103]:(activity(X103)&occurrence_of(X102,X103))),inference(fof_nnf,[status(thm)],[44])).
% fof(225, plain,![X104]:(~(activity_occurrence(X104))|?[X105]:(activity(X105)&occurrence_of(X104,X105))),inference(variable_rename,[status(thm)],[224])).
% fof(226, plain,![X104]:(~(activity_occurrence(X104))|(activity(esk15_1(X104))&occurrence_of(X104,esk15_1(X104)))),inference(skolemize,[status(esa)],[225])).
% fof(227, plain,![X104]:((activity(esk15_1(X104))|~(activity_occurrence(X104)))&(occurrence_of(X104,esk15_1(X104))|~(activity_occurrence(X104)))),inference(distribute,[status(thm)],[226])).
% cnf(228,plain,(occurrence_of(X1,esk15_1(X1))|~activity_occurrence(X1)),inference(split_conjunct,[status(thm)],[227])).
% fof(236, negated_conjecture,?[X106]:(occurrence_of(X106,tptp0)&![X107]:![X108]:((~(leaf_occ(X108,X106))|(occurrence_of(X108,tptp1)&?[X109]:(occurrence_of(X109,tptp2)&min_precedes(X107,X109,tptp0))))|(occurrence_of(X108,tptp2)&?[X110]:(occurrence_of(X110,tptp1)&min_precedes(X107,X110,tptp0))))),inference(fof_nnf,[status(thm)],[47])).
% fof(237, negated_conjecture,?[X111]:(occurrence_of(X111,tptp0)&![X112]:![X113]:((~(leaf_occ(X113,X111))|(occurrence_of(X113,tptp1)&?[X114]:(occurrence_of(X114,tptp2)&min_precedes(X112,X114,tptp0))))|(occurrence_of(X113,tptp2)&?[X115]:(occurrence_of(X115,tptp1)&min_precedes(X112,X115,tptp0))))),inference(variable_rename,[status(thm)],[236])).
% fof(238, negated_conjecture,(occurrence_of(esk16_0,tptp0)&![X112]:![X113]:((~(leaf_occ(X113,esk16_0))|(occurrence_of(X113,tptp1)&(occurrence_of(esk17_2(X112,X113),tptp2)&min_precedes(X112,esk17_2(X112,X113),tptp0))))|(occurrence_of(X113,tptp2)&(occurrence_of(esk18_2(X112,X113),tptp1)&min_precedes(X112,esk18_2(X112,X113),tptp0))))),inference(skolemize,[status(esa)],[237])).
% fof(239, negated_conjecture,![X112]:![X113]:(((~(leaf_occ(X113,esk16_0))|(occurrence_of(X113,tptp1)&(occurrence_of(esk17_2(X112,X113),tptp2)&min_precedes(X112,esk17_2(X112,X113),tptp0))))|(occurrence_of(X113,tptp2)&(occurrence_of(esk18_2(X112,X113),tptp1)&min_precedes(X112,esk18_2(X112,X113),tptp0))))&occurrence_of(esk16_0,tptp0)),inference(shift_quantors,[status(thm)],[238])).
% fof(240, negated_conjecture,![X112]:![X113]:((((occurrence_of(X113,tptp2)|(occurrence_of(X113,tptp1)|~(leaf_occ(X113,esk16_0))))&((occurrence_of(esk18_2(X112,X113),tptp1)|(occurrence_of(X113,tptp1)|~(leaf_occ(X113,esk16_0))))&(min_precedes(X112,esk18_2(X112,X113),tptp0)|(occurrence_of(X113,tptp1)|~(leaf_occ(X113,esk16_0))))))&(((occurrence_of(X113,tptp2)|(occurrence_of(esk17_2(X112,X113),tptp2)|~(leaf_occ(X113,esk16_0))))&((occurrence_of(esk18_2(X112,X113),tptp1)|(occurrence_of(esk17_2(X112,X113),tptp2)|~(leaf_occ(X113,esk16_0))))&(min_precedes(X112,esk18_2(X112,X113),tptp0)|(occurrence_of(esk17_2(X112,X113),tptp2)|~(leaf_occ(X113,esk16_0))))))&((occurrence_of(X113,tptp2)|(min_precedes(X112,esk17_2(X112,X113),tptp0)|~(leaf_occ(X113,esk16_0))))&((occurrence_of(esk18_2(X112,X113),tptp1)|(min_precedes(X112,esk17_2(X112,X113),tptp0)|~(leaf_occ(X113,esk16_0))))&(min_precedes(X112,esk18_2(X112,X113),tptp0)|(min_precedes(X112,esk17_2(X112,X113),tptp0)|~(leaf_occ(X113,esk16_0))))))))&occurrence_of(esk16_0,tptp0)),inference(distribute,[status(thm)],[239])).
% cnf(241,negated_conjecture,(occurrence_of(esk16_0,tptp0)),inference(split_conjunct,[status(thm)],[240])).
% cnf(244,negated_conjecture,(min_precedes(X2,esk17_2(X2,X1),tptp0)|occurrence_of(X1,tptp2)|~leaf_occ(X1,esk16_0)),inference(split_conjunct,[status(thm)],[240])).
% cnf(248,negated_conjecture,(occurrence_of(X1,tptp1)|min_precedes(X2,esk18_2(X2,X1),tptp0)|~leaf_occ(X1,esk16_0)),inference(split_conjunct,[status(thm)],[240])).
% cnf(256,negated_conjecture,(leaf_occ(esk4_1(esk16_0),esk16_0)),inference(spm,[status(thm)],[79,241,theory(equality)])).
% cnf(258,negated_conjecture,(activity_occurrence(esk16_0)),inference(spm,[status(thm)],[222,241,theory(equality)])).
% cnf(265,negated_conjecture,(X1=tptp0|~occurrence_of(esk16_0,X1)),inference(spm,[status(thm)],[124,241,theory(equality)])).
% cnf(266,plain,(X1=esk15_1(X2)|~occurrence_of(X2,X1)|~activity_occurrence(X2)),inference(spm,[status(thm)],[124,228,theory(equality)])).
% cnf(276,negated_conjecture,(esk15_1(esk16_0)=tptp0|~activity_occurrence(esk16_0)),inference(spm,[status(thm)],[265,228,theory(equality)])).
% cnf(277,negated_conjecture,(esk15_1(esk16_0)=tptp0|$false),inference(rw,[status(thm)],[276,258,theory(equality)])).
% cnf(278,negated_conjecture,(esk15_1(esk16_0)=tptp0),inference(cn,[status(thm)],[277,theory(equality)])).
% cnf(290,plain,(X1=esk15_1(X2)|~occurrence_of(X2,X1)),inference(csr,[status(thm)],[266,222])).
% cnf(325,negated_conjecture,(leaf(esk4_1(esk16_0),esk7_2(esk4_1(esk16_0),esk16_0))),inference(spm,[status(thm)],[118,256,theory(equality)])).
% cnf(326,negated_conjecture,(occurrence_of(esk16_0,esk7_2(esk4_1(esk16_0),esk16_0))),inference(spm,[status(thm)],[120,256,theory(equality)])).
% cnf(332,negated_conjecture,(min_precedes(X1,esk18_2(X1,esk4_1(esk16_0)),tptp0)|occurrence_of(esk4_1(esk16_0),tptp1)),inference(spm,[status(thm)],[248,256,theory(equality)])).
% cnf(333,negated_conjecture,(min_precedes(X1,esk17_2(X1,esk4_1(esk16_0)),tptp0)|occurrence_of(esk4_1(esk16_0),tptp2)),inference(spm,[status(thm)],[244,256,theory(equality)])).
% cnf(487,negated_conjecture,(esk7_2(esk4_1(esk16_0),esk16_0)=esk15_1(esk16_0)),inference(spm,[status(thm)],[290,326,theory(equality)])).
% cnf(491,negated_conjecture,(esk7_2(esk4_1(esk16_0),esk16_0)=tptp0),inference(rw,[status(thm)],[487,278,theory(equality)])).
% cnf(710,negated_conjecture,(leaf(esk4_1(esk16_0),tptp0)),inference(rw,[status(thm)],[325,491,theory(equality)])).
% cnf(1337,negated_conjecture,(occurrence_of(esk4_1(esk16_0),tptp1)|~leaf(X1,tptp0)),inference(spm,[status(thm)],[160,332,theory(equality)])).
% cnf(1379,negated_conjecture,(occurrence_of(esk4_1(esk16_0),tptp1)),inference(spm,[status(thm)],[1337,710,theory(equality)])).
% cnf(1401,negated_conjecture,(tptp1=esk15_1(esk4_1(esk16_0))),inference(spm,[status(thm)],[290,1379,theory(equality)])).
% cnf(1525,negated_conjecture,(occurrence_of(esk4_1(esk16_0),tptp2)|~leaf(X1,tptp0)),inference(spm,[status(thm)],[160,333,theory(equality)])).
% cnf(1558,negated_conjecture,(occurrence_of(esk4_1(esk16_0),tptp2)),inference(spm,[status(thm)],[1525,710,theory(equality)])).
% cnf(1584,negated_conjecture,(tptp2=esk15_1(esk4_1(esk16_0))),inference(spm,[status(thm)],[290,1558,theory(equality)])).
% cnf(1608,negated_conjecture,(tptp2=tptp1),inference(rw,[status(thm)],[1584,1401,theory(equality)])).
% cnf(1609,negated_conjecture,($false),inference(sr,[status(thm)],[1608,59,theory(equality)])).
% cnf(1610,negated_conjecture,($false),1609,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 358
% # ...of these trivial : 8
% # ...subsumed : 43
% # ...remaining for further processing: 307
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 51
% # Generated clauses : 652
% # ...of the previous two non-trivial : 465
% # Contextual simplify-reflections : 14
% # Paramodulations : 652
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 252
% # Positive orientable unit clauses: 80
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 42
% # Non-unit-clauses : 130
% # Current number of unprocessed clauses: 128
% # ...number of literals in the above : 269
% # Clause-clause subsumption calls (NU) : 523
% # Rec. Clause-clause subsumption calls : 358
% # Unit Clause-clause subsumption calls : 72
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 12
% # Backwards rewriting index: 255 leaves, 1.29+/-0.998 terms/leaf
% # Paramod-from index: 91 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 182 leaves, 1.15+/-0.650 terms/leaf
% # -------------------------------------------------
% # User time : 0.051 s
% # System time : 0.006 s
% # Total time : 0.057 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.25 WC
% FINAL PrfWatch: 0.15 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP18526/PRO010+4.tptp
%
%------------------------------------------------------------------------------