TSTP Solution File: NUM534+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM534+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 09:33:30 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 12 unt; 0 def)
% Number of atoms : 227 ( 43 equ)
% Maximal formula atoms : 52 ( 5 avg)
% Number of connectives : 298 ( 114 ~; 128 |; 38 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 66 ( 5 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aSet0(sdtmndt0(xS,xx))
& ! [X1] :
( aElementOf0(X1,sdtmndt0(xS,xx))
<=> ( aElement0(X1)
& aElementOf0(X1,xS)
& X1 != xx ) ) )
=> ( ( aSet0(sdtpldt0(sdtmndt0(xS,xx),xx))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
<=> ( aElement0(X1)
& ( aElementOf0(X1,sdtmndt0(xS,xx))
| X1 = xx ) ) ) )
=> sdtpldt0(sdtmndt0(xS,xx),xx) = xS ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefSub) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& aElementOf0(X4,X1)
& X4 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefDiff) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mEOfElem) ).
fof(mSubASymm,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aSet0(X2) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSubASymm) ).
fof(m__617,hypothesis,
aSet0(xS),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__617) ).
fof(m__617_02,hypothesis,
aElementOf0(xx,xS),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__617_02) ).
fof(c_0_7,negated_conjecture,
~ ( ( aSet0(sdtmndt0(xS,xx))
& ! [X1] :
( aElementOf0(X1,sdtmndt0(xS,xx))
<=> ( aElement0(X1)
& aElementOf0(X1,xS)
& X1 != xx ) ) )
=> ( ( aSet0(sdtpldt0(sdtmndt0(xS,xx),xx))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
<=> ( aElement0(X1)
& ( aElementOf0(X1,sdtmndt0(xS,xx))
| X1 = xx ) ) ) )
=> sdtpldt0(sdtmndt0(xS,xx),xx) = xS ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,negated_conjecture,
! [X2,X2,X3,X3] :
( aSet0(sdtmndt0(xS,xx))
& ( aElement0(X2)
| ~ aElementOf0(X2,sdtmndt0(xS,xx)) )
& ( aElementOf0(X2,xS)
| ~ aElementOf0(X2,sdtmndt0(xS,xx)) )
& ( X2 != xx
| ~ aElementOf0(X2,sdtmndt0(xS,xx)) )
& ( ~ aElement0(X2)
| ~ aElementOf0(X2,xS)
| X2 = xx
| aElementOf0(X2,sdtmndt0(xS,xx)) )
& aSet0(sdtpldt0(sdtmndt0(xS,xx),xx))
& ( aElement0(X3)
| ~ aElementOf0(X3,sdtpldt0(sdtmndt0(xS,xx),xx)) )
& ( aElementOf0(X3,sdtmndt0(xS,xx))
| X3 = xx
| ~ aElementOf0(X3,sdtpldt0(sdtmndt0(xS,xx),xx)) )
& ( ~ aElementOf0(X3,sdtmndt0(xS,xx))
| ~ aElement0(X3)
| aElementOf0(X3,sdtpldt0(sdtmndt0(xS,xx),xx)) )
& ( X3 != xx
| ~ aElement0(X3)
| aElementOf0(X3,sdtpldt0(sdtmndt0(xS,xx),xx)) )
& sdtpldt0(sdtmndt0(xS,xx),xx) != xS ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])]) ).
fof(c_0_9,plain,
! [X4,X5,X6,X5] :
( ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk1_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk1_2(X4,X5),X4)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])])]) ).
cnf(c_0_10,negated_conjecture,
( X1 = xx
| aElementOf0(X1,sdtmndt0(xS,xx))
| ~ aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( aSubsetOf0(X2,X1)
| aElementOf0(esk1_2(X1,X2),X2)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
aSet0(sdtpldt0(sdtmndt0(xS,xx),xx)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X5,X6,X7,X8,X8,X7] :
( ( aSet0(X7)
| X7 != sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElement0(X8)
| ~ aElementOf0(X8,X7)
| X7 != sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElementOf0(X8,X5)
| ~ aElementOf0(X8,X7)
| X7 != sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( X8 != X6
| ~ aElementOf0(X8,X7)
| X7 != sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| X8 = X6
| aElementOf0(X8,X7)
| X7 != sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ aElementOf0(esk3_3(X5,X6,X7),X7)
| ~ aElement0(esk3_3(X5,X6,X7))
| ~ aElementOf0(esk3_3(X5,X6,X7),X5)
| esk3_3(X5,X6,X7) = X6
| ~ aSet0(X7)
| X7 = sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElement0(esk3_3(X5,X6,X7))
| aElementOf0(esk3_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| X7 = sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElementOf0(esk3_3(X5,X6,X7),X5)
| aElementOf0(esk3_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| X7 = sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( esk3_3(X5,X6,X7) != X6
| aElementOf0(esk3_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| X7 = sdtmndt0(X5,X6)
| ~ aSet0(X5)
| ~ aElement0(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])])])])]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ aSet0(X3)
| ~ aElementOf0(X4,X3)
| aElement0(X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])])]) ).
cnf(c_0_15,negated_conjecture,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,sdtmndt0(xS,xx)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( esk1_2(X1,sdtpldt0(sdtmndt0(xS,xx),xx)) = xx
| aSubsetOf0(sdtpldt0(sdtmndt0(xS,xx),xx),X1)
| aElementOf0(esk1_2(X1,sdtpldt0(sdtmndt0(xS,xx),xx)),sdtmndt0(xS,xx))
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_17,negated_conjecture,
( aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| ~ aElement0(X1)
| ~ aElementOf0(X1,sdtmndt0(xS,xx)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( aElement0(X1)
| ~ aElementOf0(X1,sdtmndt0(xS,xx)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,plain,
( aElementOf0(X4,X3)
| X4 = X1
| ~ aElement0(X1)
| ~ aSet0(X2)
| X3 != sdtmndt0(X2,X1)
| ~ aElementOf0(X4,X2)
| ~ aElement0(X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( aElement0(X1)
| ~ aElementOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ~ aSet0(X3)
| ~ aSet0(X4)
| ~ aSubsetOf0(X3,X4)
| ~ aSubsetOf0(X4,X3)
| X3 = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubASymm])]) ).
cnf(c_0_22,plain,
( aSubsetOf0(X2,X1)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( esk1_2(X1,sdtpldt0(sdtmndt0(xS,xx),xx)) = xx
| aSubsetOf0(sdtpldt0(sdtmndt0(xS,xx),xx),X1)
| aElementOf0(esk1_2(X1,sdtpldt0(sdtmndt0(xS,xx),xx)),xS)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[m__617]) ).
cnf(c_0_25,negated_conjecture,
( aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| ~ aElementOf0(X1,sdtmndt0(xS,xx)) ),
inference(csr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
( X1 = X2
| aElementOf0(X2,X3)
| X3 != sdtmndt0(X4,X1)
| ~ aElementOf0(X2,X4)
| ~ aElement0(X1)
| ~ aSet0(X4) ),
inference(csr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,hypothesis,
aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[m__617_02]) ).
cnf(c_0_28,plain,
( X1 = X2
| ~ aSubsetOf0(X2,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,negated_conjecture,
( esk1_2(xS,sdtpldt0(sdtmndt0(xS,xx),xx)) = xx
| aSubsetOf0(sdtpldt0(sdtmndt0(xS,xx),xx),xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12]),c_0_24])]) ).
cnf(c_0_31,negated_conjecture,
( aSubsetOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| ~ aElementOf0(esk1_2(sdtpldt0(sdtmndt0(xS,xx),xx),X1),sdtmndt0(xS,xx))
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_12])]) ).
cnf(c_0_32,plain,
( X1 = X2
| aElementOf0(X2,sdtmndt0(X3,X1))
| ~ aElementOf0(X2,X3)
| ~ aElement0(X1)
| ~ aSet0(X3) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_33,hypothesis,
aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_27]),c_0_24])]) ).
cnf(c_0_34,plain,
( X1 = X2
| ~ aSubsetOf0(X2,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
aSubsetOf0(sdtpldt0(sdtmndt0(xS,xx),xx),xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_30]),c_0_27]),c_0_12]),c_0_24])]) ).
cnf(c_0_36,negated_conjecture,
sdtpldt0(sdtmndt0(xS,xx),xx) != xS,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_37,negated_conjecture,
( esk1_2(sdtpldt0(sdtmndt0(xS,xx),xx),X1) = xx
| aSubsetOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| ~ aElementOf0(esk1_2(sdtpldt0(sdtmndt0(xS,xx),xx),X1),xS)
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_24])]) ).
cnf(c_0_38,negated_conjecture,
~ aSubsetOf0(xS,sdtpldt0(sdtmndt0(xS,xx),xx)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_12])]),c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| ~ aElement0(X1)
| X1 != xx ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_40,negated_conjecture,
esk1_2(sdtpldt0(sdtmndt0(xS,xx),xx),xS) = xx,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_11]),c_0_24]),c_0_12])]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
aElementOf0(xx,sdtpldt0(sdtmndt0(xS,xx),xx)),
inference(spm,[status(thm)],[c_0_39,c_0_33]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_40]),c_0_41]),c_0_24]),c_0_12])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM534+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jul 7 06:41:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.018 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 43
% 0.23/1.41 # Proof object clause steps : 30
% 0.23/1.41 # Proof object formula steps : 13
% 0.23/1.41 # Proof object conjectures : 21
% 0.23/1.41 # Proof object clause conjectures : 18
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 15
% 0.23/1.41 # Proof object initial formulas used : 7
% 0.23/1.41 # Proof object generating inferences : 12
% 0.23/1.41 # Proof object simplifying inferences : 31
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 19
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 50
% 0.23/1.41 # Removed in clause preprocessing : 4
% 0.23/1.41 # Initial clauses in saturation : 46
% 0.23/1.41 # Processed clauses : 677
% 0.23/1.41 # ...of these trivial : 15
% 0.23/1.41 # ...subsumed : 397
% 0.23/1.41 # ...remaining for further processing : 265
% 0.23/1.41 # Other redundant clauses eliminated : 2
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 26
% 0.23/1.41 # Backward-rewritten : 8
% 0.23/1.41 # Generated clauses : 1514
% 0.23/1.41 # ...of the previous two non-trivial : 1302
% 0.23/1.41 # Contextual simplify-reflections : 341
% 0.23/1.41 # Paramodulations : 1499
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 15
% 0.23/1.41 # Current number of processed clauses : 229
% 0.23/1.41 # Positive orientable unit clauses : 17
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 8
% 0.23/1.41 # Non-unit-clauses : 204
% 0.23/1.41 # Current number of unprocessed clauses: 555
% 0.23/1.41 # ...number of literals in the above : 3588
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 34
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 23559
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 8854
% 0.23/1.41 # Non-unit clause-clause subsumptions : 625
% 0.23/1.41 # Unit Clause-clause subsumption calls : 586
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 6
% 0.23/1.41 # BW rewrite match successes : 6
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 33376
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.119 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.123 s
% 0.23/1.41 # Maximum resident set size: 4112 pages
%------------------------------------------------------------------------------