↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ANA028-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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 12:02:48 PM UTC 2026

% Result   : Unsatisfiable 12.19s 2.35s
% Output   : CNFRefutation 12.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   49 (  18 unt;   4 nHn;  33 RR)
%            Number of literals    :   92 (   7 equ;  49 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-3 aty)
%            Number of variables   :   72 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clsrel_Ring__and__Field_Oordered__idom_4,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Oab__group__add(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_4) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_OrderedGroup_Oab__group__add__class_Odiff__minus_0,axiom,
    ( ~ class_OrderedGroup_Oab__group__add(X1)
    | c_minus(X2,X3,X1) = c_plus(X2,c_uminus(X3,X1),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_OrderedGroup_Oab__group__add__class_Odiff__minus_0) ).

cnf(tfree_tcs,negated_conjecture,
    class_Ring__and__Field_Oordered__idom(t_b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',tfree_tcs) ).

cnf(clsrel_Ring__and__Field_Oordered__idom_37,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_37) ).

cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Orderings_Olinorder(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_33) ).

cnf(cls_OrderedGroup_Oadd__le__cancel__left_1,axiom,
    ( ~ c_lessequals(X2,X3,X1)
    | ~ class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X1)
    | c_lessequals(c_plus(X4,X2,X1),c_plus(X4,X3,X1),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Oadd__le__cancel__left_1) ).

cnf(cls_Orderings_Olinorder__not__le_0,axiom,
    ( ~ class_Orderings_Olinorder(X1)
    | c_lessequals(X3,X2,X1)
    | c_less(X2,X3,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Olinorder__not__le_0) ).

cnf(cls_OrderedGroup_Ominus__minus_0,axiom,
    ( ~ class_OrderedGroup_Oab__group__add(X1)
    | c_uminus(c_uminus(X2,X1),X1) = X2 ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Ominus__minus_0) ).

cnf(clsrel_Ring__and__Field_Oordered__idom_54,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Opordered__ab__group__add(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_54) ).

cnf(cls_Orderings_Olinorder__not__le_1,axiom,
    ( ~ c_lessequals(X3,X2,X1)
    | ~ c_less(X2,X3,X1)
    | ~ class_Orderings_Olinorder(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Olinorder__not__le_1) ).

cnf(cls_OrderedGroup_Oneg__less__iff__less_1,axiom,
    ( ~ c_less(X2,X3,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | c_less(c_uminus(X3,X1),c_uminus(X2,X1),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Oneg__less__iff__less_1) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_lessequals(v_g(X1),v_k(X1),t_b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(c_0_13,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Oab__group__add(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_4]) ).

cnf(c_0_14,negated_conjecture,
    ~ c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
    inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).

cnf(c_0_15,plain,
    ( ~ class_OrderedGroup_Oab__group__add(X1)
    | c_minus(X2,X3,X1) = c_plus(X2,c_uminus(X3,X1),X1) ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oab__group__add__class_Odiff__minus_0]) ).

cnf(c_0_16,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Oab__group__add(X1) ),
    c_0_13 ).

cnf(c_0_17,negated_conjecture,
    class_Ring__and__Field_Oordered__idom(t_b),
    tfree_tcs ).

cnf(c_0_18,negated_conjecture,
    ~ c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
    c_0_14 ).

cnf(c_0_19,plain,
    ( ~ class_OrderedGroup_Oab__group__add(X1)
    | c_minus(X2,X3,X1) = c_plus(X2,c_uminus(X3,X1),X1) ),
    c_0_15 ).

cnf(c_0_20,negated_conjecture,
    class_OrderedGroup_Oab__group__add(t_b),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_37]) ).

cnf(c_0_22,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Orderings_Olinorder(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_33]) ).

cnf(c_0_23,negated_conjecture,
    ~ c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_plus(v_f(v_x),c_uminus(v_g(v_x),t_b),t_b),t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).

cnf(c_0_24,plain,
    ( ~ c_lessequals(X2,X3,X1)
    | ~ class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X1)
    | c_lessequals(c_plus(X4,X2,X1),c_plus(X4,X3,X1),X1) ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oadd__le__cancel__left_1]) ).

cnf(c_0_25,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X1) ),
    c_0_21 ).

cnf(c_0_26,plain,
    ( ~ class_Orderings_Olinorder(X1)
    | c_lessequals(X3,X2,X1)
    | c_less(X2,X3,X1) ),
    inference(fof_simplification,[status(thm)],[cls_Orderings_Olinorder__not__le_0]) ).

cnf(c_0_27,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Orderings_Olinorder(X1) ),
    c_0_22 ).

cnf(c_0_28,negated_conjecture,
    ~ c_lessequals(c_plus(v_f(v_x),c_uminus(v_k(v_x),t_b),t_b),c_plus(v_f(v_x),c_uminus(v_g(v_x),t_b),t_b),t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_20])]) ).

cnf(c_0_29,plain,
    ( ~ c_lessequals(X2,X3,X1)
    | ~ class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X1)
    | c_lessequals(c_plus(X4,X2,X1),c_plus(X4,X3,X1),X1) ),
    c_0_24 ).

cnf(c_0_30,negated_conjecture,
    class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(t_b),
    inference(spm,[status(thm)],[c_0_25,c_0_17]) ).

cnf(c_0_31,plain,
    ( ~ class_Orderings_Olinorder(X1)
    | c_lessequals(X3,X2,X1)
    | c_less(X2,X3,X1) ),
    c_0_26 ).

cnf(c_0_32,negated_conjecture,
    class_Orderings_Olinorder(t_b),
    inference(spm,[status(thm)],[c_0_27,c_0_17]) ).

cnf(c_0_33,plain,
    ( ~ class_OrderedGroup_Oab__group__add(X1)
    | c_uminus(c_uminus(X2,X1),X1) = X2 ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Ominus__minus_0]) ).

cnf(c_0_34,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Opordered__ab__group__add(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_54]) ).

cnf(c_0_35,plain,
    ( ~ c_lessequals(X3,X2,X1)
    | ~ c_less(X2,X3,X1)
    | ~ class_Orderings_Olinorder(X1) ),
    inference(fof_simplification,[status(thm)],[cls_Orderings_Olinorder__not__le_1]) ).

cnf(c_0_36,plain,
    ( ~ c_less(X2,X3,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | c_less(c_uminus(X3,X1),c_uminus(X2,X1),X1) ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oneg__less__iff__less_1]) ).

cnf(c_0_37,negated_conjecture,
    ~ c_lessequals(c_uminus(v_k(v_x),t_b),c_uminus(v_g(v_x),t_b),t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).

cnf(c_0_38,negated_conjecture,
    ( c_lessequals(X2,X1,t_b)
    | c_less(X1,X2,t_b) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_39,plain,
    ( ~ class_OrderedGroup_Oab__group__add(X1)
    | c_uminus(c_uminus(X2,X1),X1) = X2 ),
    c_0_33 ).

cnf(c_0_40,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Opordered__ab__group__add(X1) ),
    c_0_34 ).

cnf(c_0_41,plain,
    ( ~ c_lessequals(X3,X2,X1)
    | ~ c_less(X2,X3,X1)
    | ~ class_Orderings_Olinorder(X1) ),
    c_0_35 ).

cnf(c_0_42,negated_conjecture,
    c_lessequals(v_g(X1),v_k(X1),t_b),
    cls_conjecture_1 ).

cnf(c_0_43,plain,
    ( ~ c_less(X2,X3,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | c_less(c_uminus(X3,X1),c_uminus(X2,X1),X1) ),
    c_0_36 ).

cnf(c_0_44,negated_conjecture,
    c_less(c_uminus(v_g(v_x),t_b),c_uminus(v_k(v_x),t_b),t_b),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_45,negated_conjecture,
    c_uminus(c_uminus(X1,t_b),t_b) = X1,
    inference(spm,[status(thm)],[c_0_39,c_0_20]) ).

cnf(c_0_46,negated_conjecture,
    class_OrderedGroup_Opordered__ab__group__add(t_b),
    inference(spm,[status(thm)],[c_0_40,c_0_17]) ).

cnf(c_0_47,negated_conjecture,
    ~ c_less(v_k(X1),v_g(X1),t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_32])]) ).

cnf(c_0_48,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_43,c_0_44]),c_0_45]),c_0_45]),c_0_46])]),c_0_47]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ANA028-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43  % Computer : n017.cluster.edu
% 0.18/0.43  % Model    : x86_64 x86_64
% 0.18/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43  % Memory   : 8046.5625MB
% 0.18/0.43  % OS       : Linux 6.8.0-71-generic
% 0.18/0.43  % CPULimit : 300
% 0.18/0.43  % WCLimit  : 300
% 0.18/0.43  % DateTime : Mon Sep 21 13:20:14 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.48  Running first-order theorem proving
% 0.24/0.48  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 12.19/2.35  % Version: 3.5.1
% 12.19/2.35  % Preprocessing class: FMLMSMSMSSSNFFN.
% 12.19/2.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.19/2.35  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.19/2.35  % Starting new_bool_3 with 300s (1) cores
% 12.19/2.35  % Starting new_bool_1 with 300s (1) cores
% 12.19/2.35  % Starting sh5l with 300s (1) cores
% 12.19/2.35  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2404592 completed with status 0
% 12.19/2.35  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 12.19/2.35  % Preprocessing class: FMLMSMSMSSSNFFN.
% 12.19/2.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.19/2.35  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.19/2.35  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.19/2.35  % No SInE strategy applied
% 12.19/2.35  % Search class: FGHSM-SMLM32-DFFFFFNN
% 12.19/2.35  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 12.19/2.35  % Starting SubtermCWHack with 136s (1) cores
% 12.19/2.35  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 12.19/2.35  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 12.19/2.35  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 12.19/2.35  % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 12.19/2.35  % G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2404627 completed with status 0
% 12.19/2.35  % Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 12.19/2.35  % Preprocessing class: FMLMSMSMSSSNFFN.
% 12.19/2.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.19/2.35  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.19/2.35  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.19/2.35  % No SInE strategy applied
% 12.19/2.35  % Search class: FGHSM-SMLM32-DFFFFFNN
% 12.19/2.35  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 12.19/2.35  % Starting SubtermCWHack with 136s (1) cores
% 12.19/2.35  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 12.19/2.35  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 12.19/2.35  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 12.19/2.35  % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 12.19/2.35  % Preprocessing time       : 0.032 s
% 12.19/2.35  % Presaturation interreduction done
% 12.19/2.35  
% 12.19/2.35  % Proof found!
% 12.19/2.35  % SZS status Unsatisfiable
% 12.19/2.35  % SZS output start CNFRefutation
% See solution above
% 12.19/2.36  % Parsed axioms                        : 2809
% 12.19/2.36  % Removed by relevancy pruning/SinE    : 0
% 12.19/2.36  % Initial clauses                      : 2809
% 12.19/2.36  % Removed in clause preprocessing      : 9
% 12.19/2.36  % Initial clauses in saturation        : 2800
% 12.19/2.36  % Processed clauses                    : 12420
% 12.19/2.36  % ...of these trivial                  : 110
% 12.19/2.36  % ...subsumed                          : 5553
% 12.19/2.36  % ...remaining for further processing  : 6757
% 12.19/2.36  % Other redundant clauses eliminated   : 105
% 12.19/2.36  % Clauses deleted for lack of memory   : 0
% 12.19/2.36  % Backward-subsumed                    : 70
% 12.19/2.36  % Backward-rewritten                   : 619
% 12.19/2.36  % Generated clauses                    : 25389
% 12.19/2.36  % ...of the previous two non-redundant : 21927
% 12.19/2.36  % ...aggressively subsumed             : 0
% 12.19/2.36  % Contextual simplify-reflections      : 19
% 12.19/2.36  % Paramodulations                      : 25238
% 12.19/2.36  % Factorizations                       : 2
% 12.19/2.36  % NegExts                              : 0
% 12.19/2.36  % Equation resolutions                 : 149
% 12.19/2.36  % Disequality decompositions           : 0
% 12.19/2.36  % Total rewrite steps                  : 16558
% 12.19/2.36  % ...of those cached                   : 14785
% 12.19/2.36  % Propositional unsat checks           : 1
% 12.19/2.36  %    Propositional check models        : 1
% 12.19/2.36  %    Propositional check unsatisfiable : 0
% 12.19/2.36  %    Propositional clauses             : 0
% 12.19/2.36  %    Propositional clauses after purity: 0
% 12.19/2.36  %    Propositional unsat core size     : 0
% 12.19/2.36  %    Propositional preprocessing time  : 0.000
% 12.19/2.36  %    Propositional encoding time       : 0.012
% 12.19/2.36  %    Propositional solver time         : 0.015
% 12.19/2.36  %    Success case prop preproc time    : 0.000
% 12.19/2.36  %    Success case prop encoding time   : 0.000
% 12.19/2.36  %    Success case prop solver time     : 0.000
% 12.19/2.36  % Current number of processed clauses  : 3393
% 12.19/2.36  %    Positive orientable unit clauses  : 794
% 12.19/2.36  %    Positive unorientable unit clauses: 18
% 12.19/2.36  %    Negative unit clauses             : 496
% 12.19/2.36  %    Non-unit-clauses                  : 2085
% 12.19/2.36  % Current number of unprocessed clauses: 14499
% 12.19/2.36  % ...number of literals in the above   : 32212
% 12.19/2.36  % Current number of archived formulas  : 0
% 12.19/2.36  % Current number of archived clauses   : 3372
% 12.19/2.36  % Clause-clause subsumption calls (NU) : 3852349
% 12.19/2.36  % Rec. Clause-clause subsumption calls : 2832155
% 12.19/2.36  % Non-unit clause-clause subsumptions  : 3323
% 12.19/2.36  % Unit Clause-clause subsumption calls : 149405
% 12.19/2.36  % Rewrite failures with RHS unbound    : 0
% 12.19/2.36  % BW rewrite match attempts            : 1618
% 12.19/2.36  % BW rewrite match successes           : 136
% 12.19/2.36  % Condensation attempts                : 0
% 12.19/2.36  % Condensation successes               : 0
% 12.19/2.36  % Termbank termtop insertions          : 465112
% 12.19/2.36  % Search garbage collected termcells   : 4116
% 12.19/2.36  
% 12.19/2.36  % -------------------------------------------------
% 12.19/2.36  % User time                : 1.700 s
% 12.19/2.36  % System time              : 0.057 s
% 12.19/2.36  % Total time               : 1.757 s
% 12.19/2.36  % Maximum resident set size: 8776 pages
% 12.19/2.36  
% 12.19/2.36  % -------------------------------------------------
% 12.19/2.36  % User time                : 8.364 s
% 12.19/2.36  % System time              : 0.287 s
% 12.19/2.36  % Total time               : 8.652 s
% 12.19/2.36  % Maximum resident set size: 6656 pages
% 12.19/2.36  % E exiting
%------------------------------------------------------------------------------