%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU387+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 02:24:56 PM UTC 2026
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 18 unt; 0 def)
% Number of atoms : 185 ( 7 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 215 ( 71 ~; 47 |; 84 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 20 ( 18 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-1 aty)
% Number of variables : 45 ( 8 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_yellow19,conjecture,
! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(X1))))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& upper_relstr_subset(X2,boole_POSet(X1))
& filtered_subset(X2,boole_POSet(X1))
& ~ empty(X2) )
=> ! [X3] :
~ ( empty(X3)
& in(X3,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_yellow19) ).
fof(t8_waybel_7,axiom,
! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& transitive_relstr(X1)
& reflexive_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(X1)))
& upper_relstr_subset(X2,X1)
& filtered_subset(X2,X1)
& ~ empty(X2) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_waybel_7) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& in(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(fc7_yellow_1,axiom,
! [X1] :
( antisymmetric_relstr(boole_POSet(X1))
& transitive_relstr(boole_POSet(X1))
& reflexive_relstr(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1))
& ~ empty_carrier(boole_POSet(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc7_yellow_1) ).
fof(fc8_yellow_1,axiom,
! [X1] :
( complete_relstr(boole_POSet(X1))
& with_infima_relstr(boole_POSet(X1))
& with_suprema_relstr(boole_POSet(X1))
& bounded_relstr(boole_POSet(X1))
& upper_bounded_relstr(boole_POSet(X1))
& lower_bounded_relstr(boole_POSet(X1))
& antisymmetric_relstr(boole_POSet(X1))
& transitive_relstr(boole_POSet(X1))
& reflexive_relstr(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1))
& ~ empty_carrier(boole_POSet(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc8_yellow_1) ).
fof(t18_yellow_1,axiom,
! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_yellow_1) ).
fof(dt_k3_yellow_1,axiom,
! [X1] :
( rel_str(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k3_yellow_1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(X1))))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& upper_relstr_subset(X2,boole_POSet(X1))
& filtered_subset(X2,boole_POSet(X1))
& ~ empty(X2) )
=> ! [X3] :
~ ( empty(X3)
& in(X3,X2) ) ) ),
inference(assume_negation,[status(cth)],[t2_yellow19]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(X1))))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& upper_relstr_subset(X2,boole_POSet(X1))
& filtered_subset(X2,boole_POSet(X1))
& ~ empty(X2) )
=> ! [X3] :
~ ( empty(X3)
& in(X3,X2) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& transitive_relstr(X1)
& reflexive_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(X1)))
& upper_relstr_subset(X2,X1)
& filtered_subset(X2,X1)
& ~ empty(X2) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
inference(fof_simplification,[status(thm)],[t8_waybel_7]) ).
fof(c_0_11,plain,
! [X59] :
( X59 = empty_set
| ~ empty(X59) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_12,negated_conjecture,
( empty(esk3_0)
& in(esk3_0,esk2_0)
& element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0))))
& proper_element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0))))
& upper_relstr_subset(esk2_0,boole_POSet(esk1_0))
& filtered_subset(esk2_0,boole_POSet(esk1_0))
& ~ empty(esk2_0)
& ~ empty(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_13,plain,
! [X36,X37] :
( ( ~ rel_str(X36)
| ~ lower_bounded_relstr(X36)
| ~ antisymmetric_relstr(X36)
| ~ transitive_relstr(X36)
| ~ reflexive_relstr(X36)
| empty_carrier(X36)
| ~ element(X37,powerset(the_carrier(X36)))
| ~ upper_relstr_subset(X37,X36)
| ~ filtered_subset(X37,X36)
| empty(X37)
| proper_element(X37,powerset(the_carrier(X36)))
| in(bottom_of_relstr(X36),X37) )
& ( ~ rel_str(X36)
| ~ lower_bounded_relstr(X36)
| ~ antisymmetric_relstr(X36)
| ~ transitive_relstr(X36)
| ~ reflexive_relstr(X36)
| empty_carrier(X36)
| ~ element(X37,powerset(the_carrier(X36)))
| ~ upper_relstr_subset(X37,X36)
| ~ filtered_subset(X37,X36)
| empty(X37)
| ~ in(bottom_of_relstr(X36),X37)
| ~ proper_element(X37,powerset(the_carrier(X36))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_14,plain,
! [X27,X28] :
( ~ empty(X28)
| ~ in(X27,X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
fof(c_0_15,plain,
! [X1] :
( antisymmetric_relstr(boole_POSet(X1))
& transitive_relstr(boole_POSet(X1))
& reflexive_relstr(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1))
& ~ empty_carrier(boole_POSet(X1)) ),
inference(fof_simplification,[status(thm)],[fc7_yellow_1]) ).
fof(c_0_16,plain,
! [X1] :
( complete_relstr(boole_POSet(X1))
& with_infima_relstr(boole_POSet(X1))
& with_suprema_relstr(boole_POSet(X1))
& bounded_relstr(boole_POSet(X1))
& upper_bounded_relstr(boole_POSet(X1))
& lower_bounded_relstr(boole_POSet(X1))
& antisymmetric_relstr(boole_POSet(X1))
& transitive_relstr(boole_POSet(X1))
& reflexive_relstr(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1))
& ~ empty_carrier(boole_POSet(X1)) ),
inference(fof_simplification,[status(thm)],[fc8_yellow_1]) ).
cnf(c_0_17,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
empty(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ rel_str(X2)
| ~ lower_bounded_relstr(X2)
| ~ antisymmetric_relstr(X2)
| ~ transitive_relstr(X2)
| ~ reflexive_relstr(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ upper_relstr_subset(X1,X2)
| ~ filtered_subset(X1,X2)
| ~ in(bottom_of_relstr(X2),X1)
| ~ proper_element(X1,powerset(the_carrier(X2)))
| empty_carrier(X2)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X32] :
( antisymmetric_relstr(boole_POSet(X32))
& transitive_relstr(boole_POSet(X32))
& reflexive_relstr(boole_POSet(X32))
& strict_rel_str(boole_POSet(X32))
& ~ empty_carrier(boole_POSet(X32)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
fof(c_0_22,plain,
! [X33] :
( complete_relstr(boole_POSet(X33))
& with_infima_relstr(boole_POSet(X33))
& with_suprema_relstr(boole_POSet(X33))
& bounded_relstr(boole_POSet(X33))
& upper_bounded_relstr(boole_POSet(X33))
& lower_bounded_relstr(boole_POSet(X33))
& antisymmetric_relstr(boole_POSet(X33))
& transitive_relstr(boole_POSet(X33))
& reflexive_relstr(boole_POSet(X33))
& strict_rel_str(boole_POSet(X33))
& ~ empty_carrier(boole_POSet(X33)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).
fof(c_0_23,plain,
! [X54] : bottom_of_relstr(boole_POSet(X54)) = empty_set,
inference(variable_rename,[status(thm)],[t18_yellow_1]) ).
cnf(c_0_24,negated_conjecture,
in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
esk3_0 = empty_set,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_26,plain,
! [X31] :
( rel_str(boole_POSet(X31))
& strict_rel_str(boole_POSet(X31)) ),
inference(variable_rename,[status(thm)],[dt_k3_yellow_1]) ).
cnf(c_0_27,plain,
( ~ rel_str(X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ reflexive_relstr(X1)
| ~ lower_bounded_relstr(X1)
| ~ transitive_relstr(X1)
| ~ antisymmetric_relstr(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ filtered_subset(X2,X1)
| ~ upper_relstr_subset(X2,X1)
| ~ proper_element(X2,powerset(the_carrier(X1)))
| empty_carrier(X1) ),
inference(csr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
proper_element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,negated_conjecture,
filtered_subset(esk2_0,boole_POSet(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_31,negated_conjecture,
element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,plain,
antisymmetric_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
transitive_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_34,plain,
lower_bounded_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_35,plain,
reflexive_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_36,plain,
bottom_of_relstr(boole_POSet(X1)) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_37,negated_conjecture,
in(empty_set,esk2_0),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_38,plain,
rel_str(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,plain,
~ empty_carrier(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[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(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),c_0_31]),c_0_32]),c_0_33]),c_0_34]),c_0_35]),c_0_36]),c_0_37]),c_0_38])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU387+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n005.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 06:18:02 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.39 Running first-order theorem proving
% 0.08/0.39 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
% 0.15/0.42 % Version: 3.5.1
% 0.15/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 % Starting sh5l with 300s (1) cores
% 0.15/0.42 % new_bool_1 with pid 2735101 completed with status 0
% 0.15/0.42 % Result found by new_bool_1
% 0.15/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 % Search class: FGHSM-FFMM11-MFFFFFNN
% 0.15/0.42 % partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.15/0.42 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.42 % SubtermCWHack with pid 2735104 completed with status 0
% 0.15/0.42 % Result found by SubtermCWHack
% 0.15/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 % Search class: FGHSM-FFMM11-MFFFFFNN
% 0.15/0.42 % partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.15/0.42 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.42 % Preprocessing time : 0.001 s
% 0.15/0.42
% 0.15/0.42 % Proof found!
% 0.15/0.42 % SZS status Theorem
% 0.15/0.42 % SZS output start CNFRefutation
% See solution above
% 0.15/0.42 % Parsed axioms : 85
% 0.15/0.42 % Removed by relevancy pruning/SinE : 46
% 0.15/0.42 % Initial clauses : 138
% 0.15/0.42 % Removed in clause preprocessing : 15
% 0.15/0.42 % Initial clauses in saturation : 123
% 0.15/0.42 % Processed clauses : 253
% 0.15/0.42 % ...of these trivial : 5
% 0.15/0.42 % ...subsumed : 73
% 0.15/0.42 % ...remaining for further processing : 175
% 0.15/0.42 % Other redundant clauses eliminated : 0
% 0.15/0.42 % Clauses deleted for lack of memory : 0
% 0.15/0.42 % Backward-subsumed : 2
% 0.15/0.42 % Backward-rewritten : 3
% 0.15/0.42 % Generated clauses : 260
% 0.15/0.42 % ...of the previous two non-redundant : 216
% 0.15/0.42 % ...aggressively subsumed : 0
% 0.15/0.42 % Contextual simplify-reflections : 7
% 0.15/0.42 % Paramodulations : 260
% 0.15/0.42 % Factorizations : 0
% 0.15/0.42 % NegExts : 0
% 0.15/0.42 % Equation resolutions : 0
% 0.15/0.42 % Disequality decompositions : 0
% 0.15/0.42 % Total rewrite steps : 90
% 0.15/0.42 % ...of those cached : 52
% 0.15/0.42 % Propositional unsat checks : 0
% 0.15/0.42 % Propositional check models : 0
% 0.15/0.42 % Propositional check unsatisfiable : 0
% 0.15/0.42 % Propositional clauses : 0
% 0.15/0.42 % Propositional clauses after purity: 0
% 0.15/0.42 % Propositional unsat core size : 0
% 0.15/0.42 % Propositional preprocessing time : 0.000
% 0.15/0.42 % Propositional encoding time : 0.000
% 0.15/0.42 % Propositional solver time : 0.000
% 0.15/0.42 % Success case prop preproc time : 0.000
% 0.15/0.42 % Success case prop encoding time : 0.000
% 0.15/0.42 % Success case prop solver time : 0.000
% 0.15/0.42 % Current number of processed clauses : 170
% 0.15/0.42 % Positive orientable unit clauses : 72
% 0.15/0.42 % Positive unorientable unit clauses: 0
% 0.15/0.42 % Negative unit clauses : 11
% 0.15/0.42 % Non-unit-clauses : 87
% 0.15/0.42 % Current number of unprocessed clauses: 82
% 0.15/0.42 % ...number of literals in the above : 327
% 0.15/0.42 % Current number of archived formulas : 0
% 0.15/0.42 % Current number of archived clauses : 5
% 0.15/0.42 % Clause-clause subsumption calls (NU) : 2223
% 0.15/0.42 % Rec. Clause-clause subsumption calls : 747
% 0.15/0.42 % Non-unit clause-clause subsumptions : 70
% 0.15/0.42 % Unit Clause-clause subsumption calls : 20
% 0.15/0.42 % Rewrite failures with RHS unbound : 0
% 0.15/0.42 % BW rewrite match attempts : 2
% 0.15/0.42 % BW rewrite match successes : 2
% 0.15/0.42 % Condensation attempts : 0
% 0.15/0.42 % Condensation successes : 0
% 0.15/0.42 % Termbank termtop insertions : 11460
% 0.15/0.42 % Search garbage collected termcells : 1339
% 0.15/0.42
% 0.15/0.42 % -------------------------------------------------
% 0.15/0.42 % User time : 0.013 s
% 0.15/0.42 % System time : 0.003 s
% 0.15/0.42 % Total time : 0.016 s
% 0.15/0.42 % Maximum resident set size: 3980 pages
% 0.15/0.42
% 0.15/0.42 % -------------------------------------------------
% 0.15/0.42 % User time : 0.016 s
% 0.15/0.42 % System time : 0.005 s
% 0.15/0.42 % Total time : 0.022 s
% 0.15/0.42 % Maximum resident set size: 4608 pages
% 0.15/0.42 % E exiting
%------------------------------------------------------------------------------