TSTP Solution File: NUM769^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM769^4 : TPTP v8.2.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:17:12 EDT 2024
% Result : Theorem 0.19s 0.59s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 32
% Syntax : Number of formulae : 55 ( 26 unt; 21 typ; 0 def)
% Number of atoms : 110 ( 46 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 342 ( 9 ~; 6 |; 3 &; 313 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 46 ( 46 >; 0 *; 0 +; 0 <<)
% Number of symbols : 23 ( 21 usr; 5 con; 0-3 aty)
% Number of variables : 76 ( 65 ^ 11 !; 0 ?; 76 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_23,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_25,type,
in: $i > $i > $o ).
thf(decl_72,type,
l_some: $i > ( $i > $o ) > $o ).
thf(decl_77,type,
e_is: $i > $i > $i > $o ).
thf(decl_123,type,
nat: $i ).
thf(decl_124,type,
n_is: $i > $i > $o ).
thf(decl_127,type,
n_some: ( $i > $o ) > $o ).
thf(decl_142,type,
n_pl: $i > $i > $i ).
thf(decl_147,type,
diffprop: $i > $i > $i > $o ).
thf(decl_148,type,
d_29_ii: $i > $i > $o ).
thf(decl_162,type,
n_ts: $i > $i > $i ).
thf(decl_189,type,
frac: $i ).
thf(decl_191,type,
num: $i > $i ).
thf(decl_192,type,
den: $i > $i ).
thf(decl_193,type,
n_eq: $i > $i > $o ).
thf(decl_194,type,
moref: $i > $i > $o ).
thf(decl_198,type,
n_pf: $i > $i > $i ).
thf(decl_200,type,
d_367_w: $i > $i > $i ).
thf(decl_201,type,
esk1_0: $i ).
thf(decl_202,type,
esk2_0: $i ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_e_is) ).
thf(def_diffprop,axiom,
( diffprop
= ( ^ [X1: $i,X207: $i,X4: $i] : ( n_is @ X1 @ ( n_pl @ X207 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_diffprop) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_n_is) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_d_29_ii) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_is_of) ).
thf(def_moref,axiom,
( moref
= ( ^ [X1: $i,X449: $i] : ( d_29_ii @ ( n_ts @ ( num @ X1 ) @ ( den @ X449 ) ) @ ( n_ts @ ( num @ X449 ) @ ( den @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_moref) ).
thf(def_n_some,axiom,
( n_some
= ( l_some @ nat ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_n_some) ).
thf(def_n_eq,axiom,
( n_eq
= ( ^ [X1: $i,X436: $i] : ( n_is @ ( n_ts @ ( num @ X1 ) @ ( den @ X436 ) ) @ ( n_ts @ ( num @ X436 ) @ ( den @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_n_eq) ).
thf(k_satz67c,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ frac )
@ ^ [X1: $i] :
( all_of
@ ^ [X576: $i] : ( in @ X576 @ frac )
@ ^ [X577: $i] :
( ( moref @ X1 @ X577 )
=> ( n_eq @ ( n_pf @ X577 @ ( d_367_w @ X1 @ X577 ) ) @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_satz67c) ).
thf(satz67d,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ frac )
@ ^ [X1: $i] :
( all_of
@ ^ [X578: $i] : ( in @ X578 @ frac )
@ ^ [X579: $i] :
( ( moref @ X1 @ X579 )
=> ( n_eq @ X1 @ ( n_pf @ X579 @ ( d_367_w @ X1 @ X579 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz67d) ).
thf(c_0_11,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_12,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_diffprop]) ).
thf(c_0_13,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_11]) ).
thf(c_0_14,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_15,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_all_of]) ).
thf(c_0_17,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_18,plain,
( moref
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] :
( ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) )
= ( n_pl @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_moref]) ).
thf(c_0_19,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,def_n_some]),c_0_15]) ).
thf(c_0_20,plain,
( n_eq
= ( ^ [Z0: $i,Z1: $i] :
( ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) )
= ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_n_eq]) ).
thf(c_0_21,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,plain,
( moref
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] :
( ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) )
= ( n_pl @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_23,plain,
( n_eq
= ( ^ [Z0: $i,Z1: $i] :
( ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) )
= ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_20,c_0_13]) ).
thf(c_0_24,plain,
! [X654: $i] :
( ( in @ X654 @ frac )
=> ! [X653: $i] :
( ( in @ X653 @ frac )
=> ( ( l_some @ nat
@ ^ [Z0: $i] :
( ( n_ts @ ( num @ X654 ) @ ( den @ X653 ) )
= ( n_pl @ ( n_ts @ ( num @ X653 ) @ ( den @ X654 ) ) @ Z0 ) ) )
=> ( ( n_ts @ ( num @ ( n_pf @ X653 @ ( d_367_w @ X654 @ X653 ) ) ) @ ( den @ X654 ) )
= ( n_ts @ ( num @ X654 ) @ ( den @ ( n_pf @ X653 @ ( d_367_w @ X654 @ X653 ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[k_satz67c]),c_0_21]),c_0_22]),c_0_23]) ).
thf(c_0_25,negated_conjecture,
~ ! [X621: $i] :
( ( in @ X621 @ frac )
=> ! [X620: $i] :
( ( in @ X620 @ frac )
=> ( ( l_some @ nat
@ ^ [Z0: $i] :
( ( n_ts @ ( num @ X621 ) @ ( den @ X620 ) )
= ( n_pl @ ( n_ts @ ( num @ X620 ) @ ( den @ X621 ) ) @ Z0 ) ) )
=> ( ( n_ts @ ( num @ X621 ) @ ( den @ ( n_pf @ X620 @ ( d_367_w @ X621 @ X620 ) ) ) )
= ( n_ts @ ( num @ ( n_pf @ X620 @ ( d_367_w @ X621 @ X620 ) ) ) @ ( den @ X621 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz67d])]),c_0_21]),c_0_22]),c_0_23]) ).
thf(c_0_26,plain,
! [X979: $i,X980: $i] :
( ~ ( in @ X979 @ frac )
| ~ ( in @ X980 @ frac )
| ~ ( l_some @ nat
@ ^ [Z0: $i] :
( ( n_ts @ ( num @ X979 ) @ ( den @ X980 ) )
= ( n_pl @ ( n_ts @ ( num @ X980 ) @ ( den @ X979 ) ) @ Z0 ) ) )
| ( ( n_ts @ ( num @ ( n_pf @ X980 @ ( d_367_w @ X979 @ X980 ) ) ) @ ( den @ X979 ) )
= ( n_ts @ ( num @ X979 ) @ ( den @ ( n_pf @ X980 @ ( d_367_w @ X979 @ X980 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
thf(c_0_27,negated_conjecture,
( ( in @ esk1_0 @ frac )
& ( in @ esk2_0 @ frac )
& ( l_some @ nat
@ ^ [Z0: $i] :
( ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) )
= ( n_pl @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) @ Z0 ) ) )
& ( ( n_ts @ ( num @ esk1_0 ) @ ( den @ ( n_pf @ esk2_0 @ ( d_367_w @ esk1_0 @ esk2_0 ) ) ) )
!= ( n_ts @ ( num @ ( n_pf @ esk2_0 @ ( d_367_w @ esk1_0 @ esk2_0 ) ) ) @ ( den @ esk1_0 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
thf(c_0_28,plain,
! [X4: $i,X1: $i] :
( ( ( n_ts @ ( num @ ( n_pf @ X4 @ ( d_367_w @ X1 @ X4 ) ) ) @ ( den @ X1 ) )
= ( n_ts @ ( num @ X1 ) @ ( den @ ( n_pf @ X4 @ ( d_367_w @ X1 @ X4 ) ) ) ) )
| ~ ( in @ X1 @ frac )
| ~ ( in @ X4 @ frac )
| ~ ( l_some @ nat
@ ^ [Z0: $i] :
( ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) )
= ( n_pl @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) @ Z0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_29,negated_conjecture,
( l_some @ nat
@ ^ [Z0: $i] :
( ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) )
= ( n_pl @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) @ Z0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_30,negated_conjecture,
in @ esk2_0 @ frac,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_31,negated_conjecture,
in @ esk1_0 @ frac,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_32,negated_conjecture,
( ( n_ts @ ( num @ esk1_0 ) @ ( den @ ( n_pf @ esk2_0 @ ( d_367_w @ esk1_0 @ esk2_0 ) ) ) )
!= ( n_ts @ ( num @ ( n_pf @ esk2_0 @ ( d_367_w @ esk1_0 @ esk2_0 ) ) ) @ ( den @ esk1_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM769^4 : TPTP v8.2.0. Released v7.1.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 03:52:23 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 0.19/0.59 # Version: 3.1.0-ho
% 0.19/0.59 # Preprocessing class: HSLMSMSMLLLCHSA.
% 0.19/0.59 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.59 # Starting pre_casc_4 with 1200s (4) cores
% 0.19/0.59 # Starting full_lambda_6 with 300s (1) cores
% 0.19/0.59 # Starting sh10 with 300s (1) cores
% 0.19/0.59 # Starting post_as_ho9 with 300s (1) cores
% 0.19/0.59 # Starting post_as_ho8 with 300s (1) cores
% 0.19/0.59 # pre_casc_4 with pid 26242 completed with status 0
% 0.19/0.59 # Result found by pre_casc_4
% 0.19/0.59 # Preprocessing class: HSLMSMSMLLLCHSA.
% 0.19/0.59 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.59 # Starting pre_casc_4 with 1200s (4) cores
% 0.19/0.59 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.19/0.59 # Search class: HGUSM-FSLM31-DHSMMFBN
% 0.19/0.59 # partial match(2): HGUSM-FSLM31-DHSFFFBN
% 0.19/0.59 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.19/0.59 # Starting new_bool_5 with 540s (1) cores
% 0.19/0.59 # Starting pre_casc_4 with 121s (1) cores
% 0.19/0.59 # Starting ehoh_best8_lambda with 135s (1) cores
% 0.19/0.59 # Starting new_bool_1 with 135s (1) cores
% 0.19/0.59 # pre_casc_4 with pid 26248 completed with status 0
% 0.19/0.59 # Result found by pre_casc_4
% 0.19/0.59 # Preprocessing class: HSLMSMSMLLLCHSA.
% 0.19/0.59 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.59 # Starting pre_casc_4 with 1200s (4) cores
% 0.19/0.59 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.19/0.59 # Search class: HGUSM-FSLM31-DHSMMFBN
% 0.19/0.59 # partial match(2): HGUSM-FSLM31-DHSFFFBN
% 0.19/0.59 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.19/0.59 # Starting new_bool_5 with 540s (1) cores
% 0.19/0.59 # Starting pre_casc_4 with 121s (1) cores
% 0.19/0.59 # Preprocessing time : 0.006 s
% 0.19/0.59 # Presaturation interreduction done
% 0.19/0.59
% 0.19/0.59 # Proof found!
% 0.19/0.59 # SZS status Theorem
% 0.19/0.59 # SZS output start CNFRefutation
% See solution above
% 0.19/0.59 # Parsed axioms : 613
% 0.19/0.59 # Removed by relevancy pruning/SinE : 451
% 0.19/0.59 # Initial clauses : 160
% 0.19/0.59 # Removed in clause preprocessing : 12
% 0.19/0.59 # Initial clauses in saturation : 148
% 0.19/0.59 # Processed clauses : 305
% 0.19/0.59 # ...of these trivial : 2
% 0.19/0.59 # ...subsumed : 50
% 0.19/0.59 # ...remaining for further processing : 253
% 0.19/0.59 # Other redundant clauses eliminated : 20
% 0.19/0.59 # Clauses deleted for lack of memory : 0
% 0.19/0.59 # Backward-subsumed : 0
% 0.19/0.59 # Backward-rewritten : 5
% 0.19/0.59 # Generated clauses : 493
% 0.19/0.59 # ...of the previous two non-redundant : 461
% 0.19/0.59 # ...aggressively subsumed : 0
% 0.19/0.59 # Contextual simplify-reflections : 0
% 0.19/0.59 # Paramodulations : 281
% 0.19/0.59 # Factorizations : 0
% 0.19/0.59 # NegExts : 0
% 0.19/0.59 # Equation resolutions : 21
% 0.19/0.59 # Disequality decompositions : 0
% 0.19/0.59 # Total rewrite steps : 50
% 0.19/0.59 # ...of those cached : 26
% 0.19/0.59 # Propositional unsat checks : 0
% 0.19/0.59 # Propositional check models : 0
% 0.19/0.59 # Propositional check unsatisfiable : 0
% 0.19/0.59 # Propositional clauses : 0
% 0.19/0.59 # Propositional clauses after purity: 0
% 0.19/0.59 # Propositional unsat core size : 0
% 0.19/0.59 # Propositional preprocessing time : 0.000
% 0.19/0.59 # Propositional encoding time : 0.000
% 0.19/0.59 # Propositional solver time : 0.000
% 0.19/0.59 # Success case prop preproc time : 0.000
% 0.19/0.59 # Success case prop encoding time : 0.000
% 0.19/0.59 # Success case prop solver time : 0.000
% 0.19/0.59 # Current number of processed clauses : 134
% 0.19/0.59 # Positive orientable unit clauses : 47
% 0.19/0.59 # Positive unorientable unit clauses: 0
% 0.19/0.59 # Negative unit clauses : 14
% 0.19/0.59 # Non-unit-clauses : 73
% 0.19/0.59 # Current number of unprocessed clauses: 393
% 0.19/0.59 # ...number of literals in the above : 1910
% 0.19/0.59 # Current number of archived formulas : 0
% 0.19/0.59 # Current number of archived clauses : 111
% 0.19/0.59 # Clause-clause subsumption calls (NU) : 7429
% 0.19/0.59 # Rec. Clause-clause subsumption calls : 1245
% 0.19/0.59 # Non-unit clause-clause subsumptions : 47
% 0.19/0.59 # Unit Clause-clause subsumption calls : 74
% 0.19/0.59 # Rewrite failures with RHS unbound : 0
% 0.19/0.59 # BW rewrite match attempts : 13
% 0.19/0.59 # BW rewrite match successes : 5
% 0.19/0.59 # Condensation attempts : 0
% 0.19/0.59 # Condensation successes : 0
% 0.19/0.59 # Termbank termtop insertions : 68088
% 0.19/0.59 # Search garbage collected termcells : 21280
% 0.19/0.59
% 0.19/0.59 # -------------------------------------------------
% 0.19/0.59 # User time : 0.070 s
% 0.19/0.59 # System time : 0.014 s
% 0.19/0.59 # Total time : 0.084 s
% 0.19/0.59 # Maximum resident set size: 6116 pages
% 0.19/0.59
% 0.19/0.59 # -------------------------------------------------
% 0.19/0.59 # User time : 0.194 s
% 0.19/0.59 # System time : 0.037 s
% 0.19/0.59 # Total time : 0.232 s
% 0.19/0.59 # Maximum resident set size: 2884 pages
% 0.19/0.59 % E---3.1 exiting
% 0.19/0.59 % E exiting
%------------------------------------------------------------------------------