%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT016+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:27:09 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 38 ( 15 unt; 0 def)
% Number of atoms : 213 ( 0 equ)
% Maximal formula atoms : 13 ( 5 avg)
% Number of connectives : 278 ( 103 ~; 93 |; 75 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 134 ( 1 sgn 76 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_FOL,conjecture,
! [X1,X4,X12,X5,X6,X7,X13,X14,X15] :
( ( greater(X7,X6)
& complexity(X4,X7,X13)
& complexity(X1,X6,X13)
& reorganization_type(X4,X12,X13)
& reorganization_type(X1,X12,X13)
& reorganization(X4,X13,X15)
& reorganization(X1,X13,X14)
& class(X4,X5,X13)
& class(X1,X5,X13)
& ~ organization(X4,X15)
& organization(X4,X13)
& organization(X1,X13) )
=> greater(X14,X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL) ).
fof(a14_FOL,hypothesis,
! [X1,X4,X12,X5,X8,X9,X13,X14,X15] :
( ( greater(X9,X8)
& inertia(X4,X9,X13)
& inertia(X1,X8,X13)
& reorganization_type(X4,X12,X13)
& reorganization_type(X1,X12,X13)
& reorganization(X4,X13,X15)
& reorganization(X1,X13,X14)
& class(X4,X5,X13)
& class(X1,X5,X13)
& ~ organization(X4,X15)
& organization(X4,X13)
& organization(X1,X13) )
=> greater(X14,X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a14_FOL) ).
fof(a12_FOL,hypothesis,
! [X1,X4,X5,X6,X7,X8,X9,X10,X11] :
( ( greater(X7,X6)
& inertia(X4,X9,X11)
& inertia(X1,X8,X10)
& complexity(X4,X7,X11)
& complexity(X1,X6,X10)
& class(X4,X5,X11)
& class(X1,X5,X10)
& organization(X4,X11)
& organization(X1,X10) )
=> greater(X9,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a12_FOL) ).
fof(mp5,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X4,X12,X5,X6,X7,X13,X14,X15] :
( ( greater(X7,X6)
& complexity(X4,X7,X13)
& complexity(X1,X6,X13)
& reorganization_type(X4,X12,X13)
& reorganization_type(X1,X12,X13)
& reorganization(X4,X13,X15)
& reorganization(X1,X13,X14)
& class(X4,X5,X13)
& class(X1,X5,X13)
& ~ organization(X4,X15)
& organization(X4,X13)
& organization(X1,X13) )
=> greater(X14,X15) ),
inference(assume_negation,[status(cth)],[t16_FOL]) ).
fof(c_0_5,hypothesis,
! [X1,X4,X12,X5,X8,X9,X13,X14,X15] :
( ( greater(X9,X8)
& inertia(X4,X9,X13)
& inertia(X1,X8,X13)
& reorganization_type(X4,X12,X13)
& reorganization_type(X1,X12,X13)
& reorganization(X4,X13,X15)
& reorganization(X1,X13,X14)
& class(X4,X5,X13)
& class(X1,X5,X13)
& ~ organization(X4,X15)
& organization(X4,X13)
& organization(X1,X13) )
=> greater(X14,X15) ),
inference(fof_simplification,[status(thm)],[a14_FOL]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X4,X12,X5,X6,X7,X13,X14,X15] :
( ( greater(X7,X6)
& complexity(X4,X7,X13)
& complexity(X1,X6,X13)
& reorganization_type(X4,X12,X13)
& reorganization_type(X1,X12,X13)
& reorganization(X4,X13,X15)
& reorganization(X1,X13,X14)
& class(X4,X5,X13)
& class(X1,X5,X13)
& ~ organization(X4,X15)
& organization(X4,X13)
& organization(X1,X13) )
=> greater(X14,X15) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_7,hypothesis,
! [X34,X35,X36,X37,X38,X39,X40,X41,X42] :
( greater(X41,X42)
| ~ greater(X39,X38)
| ~ inertia(X35,X39,X40)
| ~ inertia(X34,X38,X40)
| ~ reorganization_type(X35,X36,X40)
| ~ reorganization_type(X34,X36,X40)
| ~ reorganization(X35,X40,X42)
| ~ reorganization(X34,X40,X41)
| ~ class(X35,X37,X40)
| ~ class(X34,X37,X40)
| organization(X35,X42)
| ~ organization(X35,X40)
| ~ organization(X34,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,negated_conjecture,
( ~ greater(esk8_0,esk9_0)
& greater(esk6_0,esk5_0)
& complexity(esk2_0,esk6_0,esk7_0)
& complexity(esk1_0,esk5_0,esk7_0)
& reorganization_type(esk2_0,esk3_0,esk7_0)
& reorganization_type(esk1_0,esk3_0,esk7_0)
& reorganization(esk2_0,esk7_0,esk9_0)
& reorganization(esk1_0,esk7_0,esk8_0)
& class(esk2_0,esk4_0,esk7_0)
& class(esk1_0,esk4_0,esk7_0)
& ~ organization(esk2_0,esk9_0)
& organization(esk2_0,esk7_0)
& organization(esk1_0,esk7_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_9,hypothesis,
( ~ greater(X9,X8)
| ~ inertia(X3,X9,X2)
| ~ inertia(X1,X8,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization(X3,X2,X4)
| ~ reorganization(X1,X2,X6)
| ~ class(X3,X5,X2)
| ~ class(X1,X5,X2)
| ~ organization(X3,X2)
| ~ organization(X1,X2)
| greater(X6,X4)
| organization(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
reorganization_type(esk2_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
organization(esk2_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,hypothesis,
! [X25,X26,X27,X28,X29,X30,X31,X32,X33] :
( greater(X31,X30)
| ~ greater(X29,X28)
| ~ inertia(X26,X31,X33)
| ~ inertia(X25,X30,X32)
| ~ complexity(X26,X29,X33)
| ~ complexity(X25,X28,X32)
| ~ class(X26,X27,X33)
| ~ class(X25,X27,X32)
| ~ organization(X26,X33)
| ~ organization(X25,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a12_FOL])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ organization(X3,esk7_0)
| ~ inertia(X3,X5,esk7_0)
| ~ inertia(esk2_0,X4,esk7_0)
| ~ class(X3,X6,esk7_0)
| ~ class(esk2_0,X6,esk7_0)
| ~ greater(X4,X5)
| ~ reorganization(X3,esk7_0,X1)
| ~ reorganization(esk2_0,esk7_0,X2)
| ~ reorganization_type(X3,esk3_0,esk7_0)
| organization(esk2_0,X2)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
reorganization_type(esk1_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
organization(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,hypothesis,
( ~ greater(X7,X6)
| ~ inertia(X3,X9,X4)
| ~ inertia(X1,X8,X2)
| ~ complexity(X3,X7,X4)
| ~ complexity(X1,X6,X2)
| ~ class(X3,X5,X4)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X9,X8) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
complexity(esk2_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( ~ inertia(esk1_0,X4,esk7_0)
| ~ inertia(esk2_0,X3,esk7_0)
| ~ class(esk1_0,X5,esk7_0)
| ~ class(esk2_0,X5,esk7_0)
| ~ greater(X3,X4)
| ~ reorganization(esk1_0,esk7_0,X1)
| ~ reorganization(esk2_0,esk7_0,X2)
| organization(esk2_0,X2)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_19,negated_conjecture,
reorganization(esk2_0,esk7_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
~ organization(esk2_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( ~ organization(X4,X5)
| ~ inertia(X4,X2,X5)
| ~ inertia(esk2_0,X1,esk7_0)
| ~ class(X4,X6,X5)
| ~ class(esk2_0,X6,esk7_0)
| ~ complexity(X4,X3,X5)
| ~ greater(esk6_0,X3)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_11])]) ).
cnf(c_0_22,negated_conjecture,
class(esk2_0,esk4_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_23,plain,
! [X43,X44] :
( inertia(X43,esk10_2(X43,X44),X44)
| ~ organization(X43,X44) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ inertia(esk1_0,X3,esk7_0)
| ~ inertia(esk2_0,X2,esk7_0)
| ~ class(esk1_0,X4,esk7_0)
| ~ class(esk2_0,X4,esk7_0)
| ~ greater(X2,X3)
| ~ reorganization(esk1_0,esk7_0,X1)
| greater(X1,esk9_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,negated_conjecture,
reorganization(esk1_0,esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
~ greater(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
( ~ organization(X4,X5)
| ~ inertia(X4,X2,X5)
| ~ inertia(esk2_0,X1,esk7_0)
| ~ class(X4,esk4_0,X5)
| ~ complexity(X4,X3,X5)
| ~ greater(esk6_0,X3)
| greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ organization(X1,X2)
| inertia(X1,esk10_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( ~ inertia(esk1_0,X2,esk7_0)
| ~ inertia(esk2_0,X1,esk7_0)
| ~ class(esk1_0,X3,esk7_0)
| ~ class(esk2_0,X3,esk7_0)
| ~ greater(X1,X2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
class(esk1_0,esk4_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_31,negated_conjecture,
( ~ organization(X3,X4)
| ~ inertia(X3,X1,X4)
| ~ class(X3,esk4_0,X4)
| ~ complexity(X3,X2,X4)
| ~ greater(esk6_0,X2)
| greater(esk10_2(esk2_0,esk7_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_11])]) ).
cnf(c_0_32,negated_conjecture,
complexity(esk1_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,negated_conjecture,
greater(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_34,negated_conjecture,
( ~ inertia(esk1_0,X2,esk7_0)
| ~ inertia(esk2_0,X1,esk7_0)
| ~ greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22])]) ).
cnf(c_0_35,negated_conjecture,
( ~ inertia(esk1_0,X1,esk7_0)
| greater(esk10_2(esk2_0,esk7_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[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_30]),c_0_15])]) ).
cnf(c_0_36,negated_conjecture,
~ inertia(esk1_0,X1,esk7_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_28]),c_0_11])]),c_0_35]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_28]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT016+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n017.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 01:16:43 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % sh5l with pid 1111539 completed with status 0
% 0.11/0.45 % Result found by sh5l
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.45 % Search class: FGUNF-FFSM22-SFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % SubtermCWHack with pid 1111540 completed with status 0
% 0.11/0.45 % Result found by SubtermCWHack
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.45 % Search class: FGUNF-FFSM22-SFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Theorem
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 4
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 16
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 16
% 0.11/0.45 % Processed clauses : 51
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 0
% 0.11/0.45 % ...remaining for further processing : 51
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 19
% 0.11/0.45 % Backward-rewritten : 0
% 0.11/0.45 % Generated clauses : 37
% 0.11/0.45 % ...of the previous two non-redundant : 36
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 1
% 0.11/0.45 % Paramodulations : 37
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 0
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 28
% 0.11/0.45 % ...of those cached : 23
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 32
% 0.11/0.45 % Positive orientable unit clauses : 11
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 3
% 0.11/0.45 % Non-unit-clauses : 18
% 0.11/0.45 % Current number of unprocessed clauses: 1
% 0.11/0.45 % ...number of literals in the above : 9
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 19
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 661
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 45
% 0.11/0.45 % Non-unit clause-clause subsumptions : 8
% 0.11/0.45 % Unit Clause-clause subsumption calls : 27
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 0
% 0.11/0.45 % BW rewrite match successes : 0
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 3057
% 0.11/0.45 % Search garbage collected termcells : 401
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.009 s
% 0.11/0.45 % System time : 0.001 s
% 0.11/0.45 % Total time : 0.011 s
% 0.11/0.45 % Maximum resident set size: 3644 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.011 s
% 0.11/0.45 % System time : 0.006 s
% 0.11/0.45 % Total time : 0.018 s
% 0.11/0.45 % Maximum resident set size: 4608 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------