%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM924^2 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 : Wed Sep 30 08:17:12 AM UTC 2026
% Result : Theorem 0.32s 0.53s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 41 ( 41 unt; 0 typ; 0 def)
% Number of atoms : 41 ( 31 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 243 ( 6 ~; 0 |; 0 &; 237 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 33 ( 0 ^; 33 !; 0 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
int: $tType ).
thf(decl_sort2,type,
nat: $tType ).
thf(decl_26,type,
one_one_int: int ).
thf(decl_29,type,
plus_plus_int: int > int > int ).
thf(decl_32,type,
times_times_int: int > int > int ).
thf(decl_35,type,
zero_zero_int: int ).
thf(decl_40,type,
bit0: int > int ).
thf(decl_41,type,
bit1: int > int ).
thf(decl_43,type,
pls: int ).
thf(decl_44,type,
number_number_of_int: int > int ).
thf(decl_45,type,
number_number_of_nat: int > nat ).
thf(decl_47,type,
ord_less_int: int > int > $o ).
thf(decl_53,type,
power_power_int: int > nat > int ).
thf(decl_62,type,
m: int ).
thf(decl_64,type,
s: int ).
thf(decl_65,type,
t: int ).
thf(conj_0,conjecture,
ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int,
file('/export/starexec/sandbox2/tmp/tmp.buymUyYjK7/E---3.1_3951062.p',conj_0) ).
thf(fact_92_zmult__1,axiom,
! [X24: int] :
( ( times_times_int @ one_one_int @ X24 )
= X24 ),
file('/export/starexec/sandbox2/tmp/tmp.buymUyYjK7/E---3.1_3951062.p',fact_92_zmult__1) ).
thf(fact_34_number__of__is__id,axiom,
! [X23: int] :
( ( number_number_of_int @ X23 )
= X23 ),
file('/export/starexec/sandbox2/tmp/tmp.buymUyYjK7/E---3.1_3951062.p',fact_34_number__of__is__id) ).
thf(fact_181_zadd__0__right,axiom,
! [X24: int] :
( ( plus_plus_int @ X24 @ zero_zero_int )
= X24 ),
file('/export/starexec/sandbox2/tmp/tmp.buymUyYjK7/E---3.1_3951062.p',fact_181_zadd__0__right) ).
thf(fact_89_mult__Bit0,axiom,
! [X23: int,X26: int] :
( ( times_times_int @ ( bit0 @ X23 ) @ X26 )
= ( bit0 @ ( times_times_int @ X23 @ X26 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.buymUyYjK7/E---3.1_3951062.p',fact_89_mult__Bit0) ).
thf(fact_158_one__is__num__one,axiom,
( one_one_int
= ( number_number_of_int @ ( bit1 @ pls ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.buymUyYjK7/E---3.1_3951062.p',fact_158_one__is__num__one) ).
thf(fact_232_add__Bit0__Bit1,axiom,
! [X23: int,X26: int] :
( ( plus_plus_int @ ( bit0 @ X23 ) @ ( bit1 @ X26 ) )
= ( bit1 @ ( plus_plus_int @ X23 @ X26 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.buymUyYjK7/E---3.1_3951062.p',fact_232_add__Bit0__Bit1) ).
thf(fact_170_Pls__def,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox2/tmp/tmp.buymUyYjK7/E---3.1_3951062.p',fact_170_Pls__def) ).
thf(fact_132_zadd__commute,axiom,
! [X24: int,X22: int] :
( ( plus_plus_int @ X24 @ X22 )
= ( plus_plus_int @ X22 @ X24 ) ),
file('/export/starexec/sandbox2/tmp/tmp.buymUyYjK7/E---3.1_3951062.p',fact_132_zadd__commute) ).
thf(fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J,axiom,
! [X370: int] :
( ( times_times_int @ X370 @ zero_zero_int )
= zero_zero_int ),
file('/export/starexec/sandbox2/tmp/tmp.buymUyYjK7/E---3.1_3951062.p',fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J) ).
thf(fact_3_t,axiom,
( ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int )
= ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) ),
file('/export/starexec/sandbox2/tmp/tmp.buymUyYjK7/E---3.1_3951062.p',fact_3_t) ).
thf(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096,axiom,
ord_less_int @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ zero_zero_int ),
file('/export/starexec/sandbox2/tmp/tmp.buymUyYjK7/E---3.1_3951062.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).
thf(c_0_12,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_13,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
thf(c_0_14,plain,
! [X2275: int] :
( ( times_times_int @ one_one_int @ X2275 )
= X2275 ),
inference(variable_rename,[status(thm)],[fact_92_zmult__1]) ).
thf(c_0_15,plain,
! [X2176: int] :
( ( number_number_of_int @ X2176 )
= X2176 ),
inference(variable_rename,[status(thm)],[fact_34_number__of__is__id]) ).
thf(c_0_16,plain,
! [X2428: int] :
( ( plus_plus_int @ X2428 @ zero_zero_int )
= X2428 ),
inference(variable_rename,[status(thm)],[fact_181_zadd__0__right]) ).
thf(c_0_17,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int ),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
thf(c_0_18,plain,
! [X2270: int,X2271: int] :
( ( times_times_int @ ( bit0 @ X2270 ) @ X2271 )
= ( bit0 @ ( times_times_int @ X2270 @ X2271 ) ) ),
inference(variable_rename,[status(thm)],[fact_89_mult__Bit0]) ).
thf(c_0_19,plain,
! [X3: int] :
( ( times_times_int @ one_one_int @ X3 )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_20,plain,
( one_one_int
= ( number_number_of_int @ ( bit1 @ pls ) ) ),
inference(split_conjunct,[status(thm)],[fact_158_one__is__num__one]) ).
thf(c_0_21,plain,
! [X3: int] :
( ( number_number_of_int @ X3 )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_22,plain,
! [X2486: int,X2487: int] :
( ( plus_plus_int @ ( bit0 @ X2486 ) @ ( bit1 @ X2487 ) )
= ( bit1 @ ( plus_plus_int @ X2486 @ X2487 ) ) ),
inference(variable_rename,[status(thm)],[fact_232_add__Bit0__Bit1]) ).
thf(c_0_23,plain,
! [X3: int] :
( ( plus_plus_int @ X3 @ zero_zero_int )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_24,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[fact_170_Pls__def]) ).
thf(c_0_25,plain,
! [X2356: int,X2357: int] :
( ( plus_plus_int @ X2356 @ X2357 )
= ( plus_plus_int @ X2357 @ X2356 ) ),
inference(variable_rename,[status(thm)],[fact_132_zadd__commute]) ).
thf(c_0_26,plain,
! [X2741: int] :
( ( times_times_int @ X2741 @ zero_zero_int )
= zero_zero_int ),
inference(variable_rename,[status(thm)],[fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J]) ).
thf(c_0_27,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_28,plain,
( ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int )
= ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) ),
inference(split_conjunct,[status(thm)],[fact_3_t]) ).
thf(c_0_29,plain,
! [X3: int,X4: int] :
( ( times_times_int @ ( bit0 @ X3 ) @ X4 )
= ( bit0 @ ( times_times_int @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_30,plain,
! [X3: int] :
( ( times_times_int @ ( bit1 @ pls ) @ X3 )
= X3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
thf(c_0_31,plain,
! [X3: int,X4: int] :
( ( plus_plus_int @ ( bit0 @ X3 ) @ ( bit1 @ X4 ) )
= ( bit1 @ ( plus_plus_int @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_32,plain,
! [X3: int] :
( ( plus_plus_int @ X3 @ pls )
= X3 ),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_33,plain,
! [X4: int,X3: int] :
( ( plus_plus_int @ X3 @ X4 )
= ( plus_plus_int @ X4 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_34,plain,
! [X3: int] :
( ( times_times_int @ X3 @ zero_zero_int )
= zero_zero_int ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_35,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ pls ),
inference(rw,[status(thm)],[c_0_27,c_0_24]) ).
thf(c_0_36,plain,
ord_less_int @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ zero_zero_int ),
inference(split_conjunct,[status(thm)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096]) ).
thf(c_0_37,plain,
( ( times_times_int @ ( bit1 @ ( bit0 @ m ) ) @ t )
= ( plus_plus_int @ ( bit1 @ pls ) @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_21]),c_0_29]),c_0_29]),c_0_30]),c_0_20]),c_0_21]),c_0_31]),c_0_32]),c_0_33]),c_0_20]),c_0_21]) ).
thf(c_0_38,plain,
! [X3: int] :
( ( times_times_int @ X3 @ pls )
= pls ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_24]),c_0_24]) ).
thf(c_0_39,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( bit1 @ pls ) @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) @ pls ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_33]),c_0_20]),c_0_21]) ).
thf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_21]),c_0_29]),c_0_29]),c_0_30]),c_0_20]),c_0_21]),c_0_31]),c_0_32]),c_0_37]),c_0_21]),c_0_29]),c_0_29]),c_0_30]),c_0_20]),c_0_21]),c_0_31]),c_0_32]),c_0_24]),c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM924^2 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 % Computer : n009.cluster.edu
% 0.08/0.21 % Model : x86_64 x86_64
% 0.08/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.21 % Memory : 8046.5625MB
% 0.08/0.21 % OS : Linux 6.8.0-71-generic
% 0.08/0.21 % CPULimit : 300
% 0.08/0.21 % WCLimit : 300
% 0.08/0.21 % DateTime : Tue Sep 29 13:05:30 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.26 Running higher-order theorem proving
% 0.23/0.35 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.buymUyYjK7/E---3.1_3951062.p
% 0.32/0.53 % Version: 3.5.1-ho
% 0.32/0.53 % Preprocessing class: HSLSSMSMSSSNFFN.
% 0.32/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.53 % Starting sh3 with 1500s (5) cores
% 0.32/0.53 % Starting lpo1_def_fix with 300s (1) cores
% 0.32/0.53 % Starting lpo8_s with 300s (1) cores
% 0.32/0.53 % Starting lpo1_lambda_fix with 300s (1) cores
% 0.32/0.53 % sh3 with pid 3951076 completed with status 0
% 0.32/0.53 % Result found by sh3
% 0.32/0.53 % Preprocessing class: HSLSSMSMSSSNFFN.
% 0.32/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.53 % Starting sh3 with 1500s (5) cores
% 0.32/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.53 % No SInE strategy applied
% 0.32/0.53 % Search class: HGHSM-FSLM31-DFFFFFNN
% 0.32/0.53 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.32/0.53 % Starting SubtermCWHack with 151s (1) cores
% 0.32/0.53 % Starting sh3 with 901s (1) cores
% 0.32/0.53 % Starting lpo1_def_fix with 151s (1) cores
% 0.32/0.53 % Starting lpo8_s with 151s (1) cores
% 0.32/0.53 % Starting lpo1_lambda_fix with 146s (1) cores
% 0.32/0.53 % sh3 with pid 3951083 completed with status 0
% 0.32/0.53 % Result found by sh3
% 0.32/0.53 % Preprocessing class: HSLSSMSMSSSNFFN.
% 0.32/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.53 % Starting sh3 with 1500s (5) cores
% 0.32/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.53 % No SInE strategy applied
% 0.32/0.53 % Search class: HGHSM-FSLM31-DFFFFFNN
% 0.32/0.53 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.32/0.53 % Starting SubtermCWHack with 151s (1) cores
% 0.32/0.53 % Starting sh3 with 901s (1) cores
% 0.32/0.53 % Preprocessing time : 0.013 s
% 0.32/0.53 % Presaturation interreduction done
% 0.32/0.53
% 0.32/0.53 % Proof found!
% 0.32/0.53 % SZS status Theorem
% 0.32/0.53 % SZS output start CNFRefutation
% See solution above
% 0.32/0.53 % Parsed axioms : 745
% 0.32/0.53 % Removed by relevancy pruning/SinE : 0
% 0.32/0.53 % Initial clauses : 977
% 0.32/0.53 % Removed in clause preprocessing : 68
% 0.32/0.53 % Initial clauses in saturation : 909
% 0.32/0.53 % Processed clauses : 915
% 0.32/0.53 % ...of these trivial : 129
% 0.32/0.53 % ...subsumed : 137
% 0.32/0.53 % ...remaining for further processing : 648
% 0.32/0.53 % Other redundant clauses eliminated : 85
% 0.32/0.53 % Clauses deleted for lack of memory : 0
% 0.32/0.53 % Backward-subsumed : 8
% 0.32/0.53 % Backward-rewritten : 41
% 0.32/0.53 % Generated clauses : 68
% 0.32/0.53 % ...of the previous two non-redundant : 62
% 0.32/0.53 % ...aggressively subsumed : 0
% 0.32/0.53 % Contextual simplify-reflections : 2
% 0.32/0.53 % Paramodulations : 0
% 0.32/0.53 % Factorizations : 0
% 0.32/0.53 % NegExts : 0
% 0.32/0.53 % Equation resolutions : 85
% 0.32/0.53 % Disequality decompositions : 0
% 0.32/0.53 % Total rewrite steps : 1397
% 0.32/0.53 % ...of those cached : 1226
% 0.32/0.53 % Propositional unsat checks : 0
% 0.32/0.53 % Propositional check models : 0
% 0.32/0.53 % Propositional check unsatisfiable : 0
% 0.32/0.53 % Propositional clauses : 0
% 0.32/0.53 % Propositional clauses after purity: 0
% 0.32/0.53 % Propositional unsat core size : 0
% 0.32/0.53 % Propositional preprocessing time : 0.000
% 0.32/0.53 % Propositional encoding time : 0.000
% 0.32/0.53 % Propositional solver time : 0.000
% 0.32/0.53 % Success case prop preproc time : 0.000
% 0.32/0.53 % Success case prop encoding time : 0.000
% 0.32/0.53 % Success case prop solver time : 0.000
% 0.32/0.53 % Current number of processed clauses : 531
% 0.32/0.53 % Positive orientable unit clauses : 146
% 0.32/0.53 % Positive unorientable unit clauses: 28
% 0.32/0.53 % Negative unit clauses : 18
% 0.32/0.53 % Non-unit-clauses : 339
% 0.32/0.53 % Current number of unprocessed clauses: 56
% 0.32/0.53 % ...number of literals in the above : 108
% 0.32/0.53 % Current number of archived formulas : 0
% 0.32/0.53 % Current number of archived clauses : 49
% 0.32/0.53 % Clause-clause subsumption calls (NU) : 28415
% 0.32/0.53 % Rec. Clause-clause subsumption calls : 17282
% 0.32/0.53 % Non-unit clause-clause subsumptions : 98
% 0.32/0.53 % Unit Clause-clause subsumption calls : 477
% 0.32/0.53 % Rewrite failures with RHS unbound : 0
% 0.32/0.53 % BW rewrite match attempts : 252
% 0.32/0.53 % BW rewrite match successes : 156
% 0.32/0.53 % Condensation attempts : 0
% 0.32/0.53 % Condensation successes : 0
% 0.32/0.53 % Termbank termtop insertions : 76308
% 0.32/0.53 % Search garbage collected termcells : 13304
% 0.32/0.53
% 0.32/0.53 % -------------------------------------------------
% 0.32/0.53 % User time : 0.095 s
% 0.32/0.53 % System time : 0.015 s
% 0.32/0.53 % Total time : 0.110 s
% 0.32/0.53 % Maximum resident set size: 7192 pages
% 0.32/0.53
% 0.32/0.53 % -------------------------------------------------
% 0.32/0.53 % User time : 0.285 s
% 0.32/0.53 % System time : 0.049 s
% 0.32/0.53 % Total time : 0.333 s
% 0.32/0.53 % Maximum resident set size: 6144 pages
% 0.32/0.53 % E exiting
%------------------------------------------------------------------------------