%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG387-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 11:56:01 AM UTC 2026
% Result : Unsatisfiable 0.15s 5.51s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 33 ( 12 unt; 4 nHn; 23 RR)
% Number of literals : 60 ( 6 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_abs__le__interval__iff_1,axiom,
( ~ c_lessequals(c_HOL_Oabs__class_Oabs(X1,tc_RealDef_Oreal),X2,tc_RealDef_Oreal)
| c_lessequals(X1,X2,tc_RealDef_Oreal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_abs__le__interval__iff_1) ).
cnf(cls_real__le__antisym_0,axiom,
( ~ c_lessequals(X1,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X2,X1,tc_RealDef_Oreal)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_real__le__antisym_0) ).
cnf(cls_real__le__refl_0,axiom,
c_lessequals(X1,X1,tc_RealDef_Oreal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_real__le__refl_0) ).
cnf(cls_abs__le__interval__iff_2,axiom,
( ~ c_lessequals(c_HOL_Ouminus__class_Ouminus(X2,tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
| ~ c_lessequals(X1,X2,tc_RealDef_Oreal)
| c_lessequals(c_HOL_Oabs__class_Oabs(X1,tc_RealDef_Oreal),X2,tc_RealDef_Oreal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_abs__le__interval__iff_2) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),hAPP(v_x,X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_v_0,axiom,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),c_HOL_Oabs__class_Oabs(v_r____,tc_RealDef_Oreal),tc_RealDef_Oreal)
| c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_v____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_v_0) ).
cnf(cls_real__le__linear_0,axiom,
( c_lessequals(X2,X1,tc_RealDef_Oreal)
| c_lessequals(X1,X2,tc_RealDef_Oreal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_real__le__linear_0) ).
cnf(cls_v0_0,axiom,
( ~ c_lessequals(v_r____,c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal)
| c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_v____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_v0_0) ).
cnf(cls_complex__mod__minus__le__complex__mod_0,axiom,
c_lessequals(c_HOL_Ouminus__class_Ouminus(c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_complex__mod__minus__le__complex__mod_0) ).
cnf(c_0_9,plain,
( ~ c_lessequals(c_HOL_Oabs__class_Oabs(X1,tc_RealDef_Oreal),X2,tc_RealDef_Oreal)
| c_lessequals(X1,X2,tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_abs__le__interval__iff_1]) ).
cnf(c_0_10,plain,
( ~ c_lessequals(X1,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X2,X1,tc_RealDef_Oreal)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[cls_real__le__antisym_0]) ).
cnf(c_0_11,plain,
( ~ c_lessequals(c_HOL_Oabs__class_Oabs(X1,tc_RealDef_Oreal),X2,tc_RealDef_Oreal)
| c_lessequals(X1,X2,tc_RealDef_Oreal) ),
c_0_9 ).
cnf(c_0_12,axiom,
c_lessequals(X1,X1,tc_RealDef_Oreal),
cls_real__le__refl_0 ).
cnf(c_0_13,plain,
( ~ c_lessequals(X1,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X2,X1,tc_RealDef_Oreal)
| X1 = X2 ),
c_0_10 ).
cnf(c_0_14,plain,
c_lessequals(X1,c_HOL_Oabs__class_Oabs(X1,tc_RealDef_Oreal),tc_RealDef_Oreal),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ c_lessequals(c_HOL_Ouminus__class_Ouminus(X2,tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
| ~ c_lessequals(X1,X2,tc_RealDef_Oreal)
| c_lessequals(c_HOL_Oabs__class_Oabs(X1,tc_RealDef_Oreal),X2,tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_abs__le__interval__iff_2]) ).
cnf(c_0_16,negated_conjecture,
~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),hAPP(v_x,X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_17,plain,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),c_HOL_Oabs__class_Oabs(v_r____,tc_RealDef_Oreal),tc_RealDef_Oreal)
| c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_v____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_v_0]) ).
cnf(c_0_18,axiom,
( c_lessequals(X2,X1,tc_RealDef_Oreal)
| c_lessequals(X1,X2,tc_RealDef_Oreal) ),
cls_real__le__linear_0 ).
cnf(c_0_19,plain,
( ~ c_lessequals(c_HOL_Oabs__class_Oabs(X1,tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
| c_HOL_Oabs__class_Oabs(X1,tc_RealDef_Oreal) = X1 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( ~ c_lessequals(c_HOL_Ouminus__class_Ouminus(X2,tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
| ~ c_lessequals(X1,X2,tc_RealDef_Oreal)
| c_lessequals(c_HOL_Oabs__class_Oabs(X1,tc_RealDef_Oreal),X2,tc_RealDef_Oreal) ),
c_0_15 ).
cnf(c_0_21,plain,
( ~ c_lessequals(v_r____,c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal)
| c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_v____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_v0_0]) ).
cnf(c_0_22,negated_conjecture,
~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),hAPP(v_x,X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
c_0_16 ).
cnf(c_0_23,plain,
( ~ c_lessequals(c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),c_HOL_Oabs__class_Oabs(v_r____,tc_RealDef_Oreal),tc_RealDef_Oreal)
| c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_v____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
c_0_17 ).
cnf(c_0_24,plain,
( c_lessequals(X2,X1,tc_RealDef_Oreal)
| c_lessequals(X1,c_HOL_Oabs__class_Oabs(X2,tc_RealDef_Oreal),tc_RealDef_Oreal) ),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_25,plain,
( ~ c_lessequals(c_HOL_Ouminus__class_Ouminus(X1,tc_RealDef_Oreal),X1,tc_RealDef_Oreal)
| c_HOL_Oabs__class_Oabs(X1,tc_RealDef_Oreal) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_12])]) ).
cnf(c_0_26,axiom,
c_lessequals(c_HOL_Ouminus__class_Ouminus(c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal),c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal),
cls_complex__mod__minus__le__complex__mod_0 ).
cnf(c_0_27,plain,
( ~ c_lessequals(v_r____,c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal)
| c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_v____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
c_0_21 ).
cnf(c_0_28,negated_conjecture,
~ c_lessequals(c_RealVector_Onorm__class_Onorm(hAPP(v_x,v_v____),tc_Complex_Ocomplex),c_HOL_Oabs__class_Oabs(v_r____,tc_RealDef_Oreal),tc_RealDef_Oreal),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( c_lessequals(X2,c_HOL_Oabs__class_Oabs(X1,tc_RealDef_Oreal),tc_RealDef_Oreal)
| c_lessequals(X1,c_HOL_Oabs__class_Oabs(X2,tc_RealDef_Oreal),tc_RealDef_Oreal) ),
inference(spm,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_30,plain,
c_HOL_Oabs__class_Oabs(c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal) = c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
~ c_lessequals(v_r____,c_RealVector_Onorm__class_Onorm(hAPP(v_x,v_v____),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG387-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.38 % Computer : n001.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Mon Sep 21 13:24:20 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.12/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.51 % Version: 3.5.1
% 0.15/5.51 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.15/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.51 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.15/5.51 % Starting new_bool_3 with 600s (2) cores
% 0.15/5.51 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.51 % Starting sh5l with 300s (1) cores
% 0.15/5.51 % new_bool_3 with pid 3218871 completed with status 0
% 0.15/5.51 % Result found by new_bool_3
% 0.15/5.51 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.15/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.51 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.15/5.51 % Starting new_bool_3 with 600s (2) cores
% 0.15/5.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.51 % Search class: FGUSM-FFLM32-MFFFFFNN
% 0.15/5.51 % partial match(1): FGHSM-FFLM32-MFFFFFNN
% 0.15/5.51 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.15/5.51 % Starting SubtermCWHack with 61s (1) cores
% 0.15/5.51 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 361s (1) cores
% 0.15/5.51 % SubtermCWHack with pid 3218874 completed with status 0
% 0.15/5.51 % Result found by SubtermCWHack
% 0.15/5.51 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.15/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.51 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.15/5.51 % Starting new_bool_3 with 600s (2) cores
% 0.15/5.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.51 % Search class: FGUSM-FFLM32-MFFFFFNN
% 0.15/5.51 % partial match(1): FGHSM-FFLM32-MFFFFFNN
% 0.15/5.51 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.15/5.51 % Starting SubtermCWHack with 61s (1) cores
% 0.15/5.51 % Preprocessing time : 0.002 s
% 0.15/5.51
% 0.15/5.51 % Proof found!
% 0.15/5.51 % SZS status Unsatisfiable
% 0.15/5.51 % SZS output start CNFRefutation
% See solution above
% 0.15/5.51 % Parsed axioms : 884
% 0.15/5.51 % Removed by relevancy pruning/SinE : 772
% 0.15/5.51 % Initial clauses : 112
% 0.15/5.51 % Removed in clause preprocessing : 0
% 0.15/5.51 % Initial clauses in saturation : 112
% 0.15/5.51 % Processed clauses : 695
% 0.15/5.51 % ...of these trivial : 46
% 0.15/5.51 % ...subsumed : 316
% 0.15/5.51 % ...remaining for further processing : 333
% 0.15/5.51 % Other redundant clauses eliminated : 0
% 0.15/5.51 % Clauses deleted for lack of memory : 0
% 0.15/5.51 % Backward-subsumed : 7
% 0.15/5.51 % Backward-rewritten : 14
% 0.15/5.51 % Generated clauses : 4431
% 0.15/5.51 % ...of the previous two non-redundant : 3590
% 0.15/5.51 % ...aggressively subsumed : 0
% 0.15/5.51 % Contextual simplify-reflections : 1
% 0.15/5.51 % Paramodulations : 4415
% 0.15/5.51 % Factorizations : 14
% 0.15/5.51 % NegExts : 0
% 0.15/5.51 % Equation resolutions : 2
% 0.15/5.51 % Disequality decompositions : 0
% 0.15/5.51 % Total rewrite steps : 2215
% 0.15/5.51 % ...of those cached : 2045
% 0.15/5.51 % Propositional unsat checks : 0
% 0.15/5.51 % Propositional check models : 0
% 0.15/5.51 % Propositional check unsatisfiable : 0
% 0.15/5.51 % Propositional clauses : 0
% 0.15/5.51 % Propositional clauses after purity: 0
% 0.15/5.51 % Propositional unsat core size : 0
% 0.15/5.51 % Propositional preprocessing time : 0.000
% 0.15/5.51 % Propositional encoding time : 0.000
% 0.15/5.51 % Propositional solver time : 0.000
% 0.15/5.51 % Success case prop preproc time : 0.000
% 0.15/5.51 % Success case prop encoding time : 0.000
% 0.15/5.51 % Success case prop solver time : 0.000
% 0.15/5.51 % Current number of processed clauses : 312
% 0.15/5.51 % Positive orientable unit clauses : 61
% 0.15/5.51 % Positive unorientable unit clauses: 2
% 0.15/5.51 % Negative unit clauses : 15
% 0.15/5.51 % Non-unit-clauses : 234
% 0.15/5.51 % Current number of unprocessed clauses: 2971
% 0.15/5.51 % ...number of literals in the above : 7638
% 0.15/5.51 % Current number of archived formulas : 0
% 0.15/5.51 % Current number of archived clauses : 21
% 0.15/5.51 % Clause-clause subsumption calls (NU) : 4369
% 0.15/5.51 % Rec. Clause-clause subsumption calls : 4292
% 0.15/5.51 % Non-unit clause-clause subsumptions : 276
% 0.15/5.51 % Unit Clause-clause subsumption calls : 314
% 0.15/5.51 % Rewrite failures with RHS unbound : 0
% 0.15/5.51 % BW rewrite match attempts : 56
% 0.15/5.51 % BW rewrite match successes : 11
% 0.15/5.51 % Condensation attempts : 0
% 0.15/5.51 % Condensation successes : 0
% 0.15/5.51 % Termbank termtop insertions : 76197
% 0.15/5.51 % Search garbage collected termcells : 2653
% 0.15/5.51
% 0.15/5.51 % -------------------------------------------------
% 0.15/5.51 % User time : 0.042 s
% 0.15/5.51 % System time : 0.005 s
% 0.15/5.51 % Total time : 0.047 s
% 0.15/5.51 % Maximum resident set size: 4440 pages
% 0.15/5.51
% 0.15/5.51 % -------------------------------------------------
% 0.15/5.51 % User time : 0.099 s
% 0.15/5.51 % System time : 0.014 s
% 0.15/5.51 % Total time : 0.114 s
% 0.15/5.51 % Maximum resident set size: 5120 pages
% 0.15/5.51 % E exiting
%------------------------------------------------------------------------------