%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HEN007-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 12:45:37 PM UTC 2026
% Result : Unsatisfiable 0.40s 0.49s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 12
% Syntax : Number of clauses : 74 ( 41 unt; 0 nHn; 53 RR)
% Number of literals : 140 ( 16 equ; 69 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 137 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(divisor_existence,axiom,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(quotient_property,axiom,
( ~ quotient(X3,X4,X8)
| ~ quotient(X6,X5,X7)
| ~ quotient(X1,X4,X6)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X2,X3)
| less_equal(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
cnf(quotient_less_equal,axiom,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',closure) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).
cnf(less_equal_and_equal,axiom,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).
cnf(less_equal_quotient,axiom,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(zQy,hypothesis,
quotient(z,y,zQy),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zQy) ).
cnf(zQx,hypothesis,
quotient(z,x,zQx),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zQx) ).
cnf(xLEy,hypothesis,
less_equal(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xLEy) ).
cnf(well_defined,axiom,
( ~ quotient(X1,X2,X4)
| ~ quotient(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',well_defined) ).
cnf(prove_zQyLEzQx,negated_conjecture,
~ less_equal(zQy,zQx),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_zQyLEzQx) ).
cnf(c_0_12,plain,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
inference(fof_simplification,[status(thm)],[divisor_existence]) ).
cnf(c_0_13,plain,
( ~ quotient(X3,X4,X8)
| ~ quotient(X6,X5,X7)
| ~ quotient(X1,X4,X6)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X2,X3)
| less_equal(X7,X8) ),
inference(fof_simplification,[status(thm)],[quotient_property]) ).
cnf(c_0_14,plain,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal]) ).
cnf(c_0_15,plain,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
c_0_12 ).
cnf(c_0_16,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_17,plain,
( ~ quotient(X3,X4,X8)
| ~ quotient(X6,X5,X7)
| ~ quotient(X1,X4,X6)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X2,X3)
| less_equal(X7,X8) ),
c_0_13 ).
cnf(c_0_18,plain,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
c_0_14 ).
cnf(c_0_19,plain,
less_equal(divide(X1,X2),X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ quotient(X7,X6,X4)
| ~ quotient(X7,X5,X1)
| ~ quotient(X6,X5,X2)
| ~ quotient(X4,X5,X3)
| less_equal(divide(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,plain,
quotient(divide(X1,X2),X1,zero),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_23,plain,
( ~ quotient(X3,X5,X1)
| ~ quotient(X4,X5,X2)
| ~ quotient(X3,X4,divide(X5,X6))
| less_equal(divide(X1,X2),zero) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
quotient(zero,X1,zero),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_25,plain,
( ~ quotient(X2,X3,X1)
| ~ quotient(X2,zero,divide(X3,X4))
| less_equal(divide(X1,zero),zero) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_27,plain,
( ~ quotient(X1,zero,divide(X2,X3))
| less_equal(divide(divide(X1,X2),zero),zero) ),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_28,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
c_0_26 ).
cnf(c_0_29,plain,
less_equal(divide(divide(X1,X1),zero),zero),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_30,plain,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[less_equal_quotient]) ).
cnf(c_0_31,plain,
divide(divide(X1,X1),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_22])]) ).
cnf(c_0_32,plain,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
c_0_30 ).
cnf(c_0_33,plain,
quotient(divide(X1,X1),zero,zero),
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_34,plain,
less_equal(divide(X1,X1),zero),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
divide(X1,X1) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_34]),c_0_22])]) ).
cnf(c_0_36,plain,
quotient(X1,X1,zero),
inference(spm,[status(thm)],[c_0_16,c_0_35]) ).
cnf(c_0_37,plain,
( ~ quotient(X5,X3,X4)
| ~ quotient(X5,X4,X1)
| ~ quotient(X3,X4,X2)
| less_equal(divide(X1,X2),zero) ),
inference(spm,[status(thm)],[c_0_20,c_0_36]) ).
cnf(c_0_38,plain,
( ~ quotient(X2,X3,X1)
| ~ quotient(X2,zero,X3)
| less_equal(divide(X1,zero),zero) ),
inference(spm,[status(thm)],[c_0_37,c_0_24]) ).
cnf(c_0_39,plain,
( ~ quotient(X1,zero,X2)
| less_equal(divide(divide(X1,X2),zero),zero) ),
inference(spm,[status(thm)],[c_0_38,c_0_16]) ).
cnf(c_0_40,plain,
less_equal(divide(divide(X1,divide(X1,zero)),zero),zero),
inference(spm,[status(thm)],[c_0_39,c_0_16]) ).
cnf(c_0_41,plain,
divide(divide(X1,divide(X1,zero)),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_40]),c_0_22])]) ).
cnf(c_0_42,plain,
( ~ quotient(X3,X5,X1)
| ~ quotient(X4,X5,X2)
| ~ quotient(X3,X4,zero)
| less_equal(divide(X1,X2),zero) ),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_43,hypothesis,
quotient(z,y,zQy),
zQy ).
cnf(c_0_44,hypothesis,
quotient(z,x,zQx),
zQx ).
cnf(c_0_45,hypothesis,
less_equal(x,y),
xLEy ).
cnf(c_0_46,plain,
( ~ quotient(X1,X2,X4)
| ~ quotient(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[well_defined]) ).
cnf(c_0_47,plain,
quotient(divide(X1,divide(X1,zero)),zero,zero),
inference(spm,[status(thm)],[c_0_16,c_0_41]) ).
cnf(c_0_48,hypothesis,
( ~ quotient(X2,y,X1)
| ~ quotient(X2,z,zero)
| less_equal(divide(X1,zQy),zero) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,hypothesis,
less_equal(zQx,z),
inference(spm,[status(thm)],[c_0_15,c_0_44]) ).
cnf(c_0_50,plain,
( ~ quotient(X6,X5,X3)
| ~ quotient(X6,X4,X1)
| ~ quotient(X5,X4,X2)
| less_equal(divide(X1,X2),divide(X3,X4)) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_51,hypothesis,
quotient(x,y,zero),
inference(spm,[status(thm)],[c_0_18,c_0_45]) ).
cnf(c_0_52,plain,
( ~ quotient(X1,X2,X4)
| ~ quotient(X1,X2,X3)
| X3 = X4 ),
c_0_46 ).
cnf(c_0_53,plain,
less_equal(divide(X1,divide(X1,zero)),zero),
inference(spm,[status(thm)],[c_0_32,c_0_47]) ).
cnf(c_0_54,hypothesis,
( ~ quotient(X1,z,zero)
| less_equal(divide(divide(X1,y),zQy),zero) ),
inference(spm,[status(thm)],[c_0_48,c_0_16]) ).
cnf(c_0_55,hypothesis,
quotient(zQx,z,zero),
inference(spm,[status(thm)],[c_0_18,c_0_49]) ).
cnf(c_0_56,hypothesis,
( ~ quotient(X3,x,X2)
| ~ quotient(X3,y,X1)
| less_equal(divide(X1,zero),divide(X2,y)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,hypothesis,
( ~ quotient(z,x,X1)
| X1 = zQx ),
inference(spm,[status(thm)],[c_0_52,c_0_44]) ).
cnf(c_0_58,plain,
divide(X1,divide(X1,zero)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_53]),c_0_22])]) ).
cnf(c_0_59,hypothesis,
less_equal(divide(divide(zQx,y),zQy),zero),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,hypothesis,
( ~ quotient(z,x,X1)
| less_equal(divide(zQy,zero),divide(X1,y)) ),
inference(spm,[status(thm)],[c_0_56,c_0_43]) ).
cnf(c_0_61,hypothesis,
divide(z,x) = zQx,
inference(spm,[status(thm)],[c_0_57,c_0_16]) ).
cnf(c_0_62,plain,
quotient(X1,divide(X1,zero),zero),
inference(spm,[status(thm)],[c_0_16,c_0_58]) ).
cnf(c_0_63,hypothesis,
divide(divide(zQx,y),zQy) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_59]),c_0_22])]) ).
cnf(c_0_64,hypothesis,
less_equal(divide(zQy,zero),divide(zQx,y)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_16]),c_0_61]) ).
cnf(c_0_65,plain,
less_equal(X1,divide(X1,zero)),
inference(spm,[status(thm)],[c_0_32,c_0_62]) ).
cnf(c_0_66,hypothesis,
quotient(divide(zQx,y),zQy,zero),
inference(spm,[status(thm)],[c_0_16,c_0_63]) ).
cnf(c_0_67,hypothesis,
( ~ less_equal(divide(zQx,y),divide(zQy,zero))
| divide(zQy,zero) = divide(zQx,y) ),
inference(spm,[status(thm)],[c_0_28,c_0_64]) ).
cnf(c_0_68,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_65]),c_0_19])]) ).
cnf(c_0_69,hypothesis,
less_equal(divide(zQx,y),zQy),
inference(spm,[status(thm)],[c_0_32,c_0_66]) ).
cnf(c_0_70,negated_conjecture,
~ less_equal(zQy,zQx),
inference(fof_simplification,[status(thm)],[prove_zQyLEzQx]) ).
cnf(c_0_71,hypothesis,
divide(zQx,y) = zQy,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68]),c_0_68]),c_0_69])]) ).
cnf(c_0_72,negated_conjecture,
~ less_equal(zQy,zQx),
c_0_70 ).
cnf(c_0_73,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_71]),c_0_72]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN007-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n018.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 20:47:58 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.40/0.49 % Version: 3.5.1
% 0.40/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.40/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.40/0.49 % Starting sh5l with 300s (1) cores
% 0.40/0.49 % new_bool_1 with pid 164694 completed with status 9
% 0.40/0.49 % new_bool_3 with pid 164693 completed with status 9
% 0.40/0.49 % sh5l with pid 164695 completed with status 9
% 0.40/0.49 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 164692 completed with status 0
% 0.40/0.49 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.40/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.49 % No SInE strategy applied
% 0.40/0.49 % Search class: FHUSS-FFSS22-SFFFFFNN
% 0.40/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.40/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.40/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.40/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.40/0.49 % Starting new_bool_1 with 136s (1) cores
% 0.40/0.49 % new_bool_1 with pid 164704 completed with status 0
% 0.40/0.49 % Result found by new_bool_1
% 0.40/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.49 % No SInE strategy applied
% 0.40/0.49 % Search class: FHUSS-FFSS22-SFFFFFNN
% 0.40/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.40/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.40/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.40/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.40/0.49 % Starting new_bool_1 with 136s (1) cores
% 0.40/0.49 % Preprocessing time : 0.001 s
% 0.40/0.49 % Presaturation interreduction done
% 0.40/0.49
% 0.40/0.49 % Proof found!
% 0.40/0.49 % SZS status Unsatisfiable
% 0.40/0.49 % SZS output start CNFRefutation
% See solution above
% 0.40/0.49 % Parsed axioms : 13
% 0.40/0.49 % Removed by relevancy pruning/SinE : 0
% 0.40/0.49 % Initial clauses : 13
% 0.40/0.49 % Removed in clause preprocessing : 0
% 0.40/0.49 % Initial clauses in saturation : 13
% 0.40/0.49 % Processed clauses : 711
% 0.40/0.49 % ...of these trivial : 5
% 0.40/0.49 % ...subsumed : 279
% 0.40/0.49 % ...remaining for further processing : 427
% 0.40/0.49 % Other redundant clauses eliminated : 0
% 0.40/0.49 % Clauses deleted for lack of memory : 0
% 0.40/0.49 % Backward-subsumed : 15
% 0.40/0.49 % Backward-rewritten : 167
% 0.40/0.49 % Generated clauses : 2317
% 0.40/0.49 % ...of the previous two non-redundant : 1166
% 0.40/0.49 % ...aggressively subsumed : 0
% 0.40/0.49 % Contextual simplify-reflections : 0
% 0.40/0.49 % Paramodulations : 2317
% 0.40/0.49 % Factorizations : 0
% 0.40/0.49 % NegExts : 0
% 0.40/0.49 % Equation resolutions : 0
% 0.40/0.49 % Disequality decompositions : 0
% 0.40/0.49 % Total rewrite steps : 2720
% 0.40/0.49 % ...of those cached : 2477
% 0.40/0.49 % Propositional unsat checks : 0
% 0.40/0.49 % Propositional check models : 0
% 0.40/0.49 % Propositional check unsatisfiable : 0
% 0.40/0.49 % Propositional clauses : 0
% 0.40/0.49 % Propositional clauses after purity: 0
% 0.40/0.49 % Propositional unsat core size : 0
% 0.40/0.49 % Propositional preprocessing time : 0.000
% 0.40/0.49 % Propositional encoding time : 0.000
% 0.40/0.49 % Propositional solver time : 0.000
% 0.40/0.49 % Success case prop preproc time : 0.000
% 0.40/0.49 % Success case prop encoding time : 0.000
% 0.40/0.49 % Success case prop solver time : 0.000
% 0.40/0.49 % Current number of processed clauses : 232
% 0.40/0.49 % Positive orientable unit clauses : 64
% 0.40/0.49 % Positive unorientable unit clauses: 0
% 0.40/0.49 % Negative unit clauses : 1
% 0.40/0.49 % Non-unit-clauses : 167
% 0.40/0.49 % Current number of unprocessed clauses: 419
% 0.40/0.49 % ...number of literals in the above : 1088
% 0.40/0.49 % Current number of archived formulas : 0
% 0.40/0.49 % Current number of archived clauses : 195
% 0.40/0.49 % Clause-clause subsumption calls (NU) : 20746
% 0.40/0.49 % Rec. Clause-clause subsumption calls : 16863
% 0.40/0.49 % Non-unit clause-clause subsumptions : 294
% 0.40/0.49 % Unit Clause-clause subsumption calls : 547
% 0.40/0.49 % Rewrite failures with RHS unbound : 0
% 0.40/0.49 % BW rewrite match attempts : 459
% 0.40/0.49 % BW rewrite match successes : 36
% 0.40/0.49 % Condensation attempts : 0
% 0.40/0.49 % Condensation successes : 0
% 0.40/0.49 % Termbank termtop insertions : 34092
% 0.40/0.49 % Search garbage collected termcells : 30
% 0.40/0.49
% 0.40/0.49 % -------------------------------------------------
% 0.40/0.49 % User time : 0.058 s
% 0.40/0.49 % System time : 0.005 s
% 0.40/0.49 % Total time : 0.063 s
% 0.40/0.49 % Maximum resident set size: 3644 pages
% 0.40/0.49
% 0.40/0.49 % -------------------------------------------------
% 0.40/0.49 % User time : 0.378 s
% 0.40/0.49 % System time : 0.068 s
% 0.40/0.49 % Total time : 0.447 s
% 0.40/0.49 % Maximum resident set size: 4864 pages
% 0.40/0.49 % E exiting
%------------------------------------------------------------------------------