%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU353+2 : 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 : n002.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:29:05 PM UTC 2026
% Result : Theorem 40.82s 6.60s
% Output : CNFRefutation 40.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 51 ( 19 unt; 0 def)
% Number of atoms : 145 ( 21 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 148 ( 54 ~; 43 |; 28 &)
% ( 6 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-4 aty)
% Number of variables : 75 ( 1 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t91_tmap_1,conjecture,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2) = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t91_tmap_1) ).
fof(dt_k6_partfun1,axiom,
! [X1] :
( relation_of2_as_subset(identity_as_relation_of(X1),X1,X1)
& v1_partfun1(identity_as_relation_of(X1),X1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k6_partfun1) ).
fof(redefinition_k6_partfun1,axiom,
! [X1] : identity_as_relation_of(X1) = identity_relation(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k6_partfun1) ).
fof(d11_grcat_1,axiom,
! [X1] :
( one_sorted_str(X1)
=> identity_on_carrier(X1) = identity_as_relation_of(the_carrier(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d11_grcat_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(redefinition_k8_funct_2,axiom,
! [X1,X2,X3,X4] :
( ( element(X4,X1)
& relation_of2(X3,X1,X2)
& quasi_total(X3,X1,X2)
& function(X3)
& ~ empty(X1) )
=> apply_as_element(X1,X2,X3,X4) = apply(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k8_funct_2) ).
fof(cc1_funct_2,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> ( ( v1_partfun1(X3,X1,X2)
& function(X3) )
=> ( quasi_total(X3,X1,X2)
& function(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_funct_2) ).
fof(fc2_funct_1,axiom,
! [X1] :
( function(identity_relation(X1))
& relation(identity_relation(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_funct_1) ).
fof(d1_struct_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ( empty_carrier(X1)
<=> empty(the_carrier(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_struct_0) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) )
& ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_subset_1) ).
fof(t35_funct_1,lemma,
! [X1,X2] :
( in(X2,X1)
=> apply(identity_relation(X1),X2) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t35_funct_1) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2) = X2 ) ),
inference(assume_negation,[status(cth)],[t91_tmap_1]) ).
fof(c_0_12,plain,
! [X715] :
( relation_of2_as_subset(identity_as_relation_of(X715),X715,X715)
& v1_partfun1(identity_as_relation_of(X715),X715,X715) ),
inference(variable_rename,[status(thm)],[dt_k6_partfun1]) ).
fof(c_0_13,plain,
! [X1070] : identity_as_relation_of(X1070) = identity_relation(X1070),
inference(variable_rename,[status(thm)],[redefinition_k6_partfun1]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2) = X2 ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X120] :
( identity_on_carrier(X120) = identity_as_relation_of(the_carrier(X120))
| ~ one_sorted_str(X120) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d11_grcat_1])])]) ).
fof(c_0_16,plain,
! [X1080,X1081,X1082] :
( ( relation_of2_as_subset(X1082,X1080,X1081)
| ~ relation_of2(X1082,X1080,X1081) )
& ( relation_of2(X1082,X1080,X1081)
| ~ relation_of2_as_subset(X1082,X1080,X1081) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])]) ).
cnf(c_0_17,plain,
relation_of2_as_subset(identity_as_relation_of(X1),X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
identity_as_relation_of(X1) = identity_relation(X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,negated_conjecture,
( apply_as_element(the_carrier(esk440_0),the_carrier(esk440_0),identity_on_carrier(esk440_0),esk441_0) != esk441_0
& element(esk441_0,the_carrier(esk440_0))
& one_sorted_str(esk440_0)
& ~ empty_carrier(esk440_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_20,plain,
( ~ one_sorted_str(X1)
| identity_on_carrier(X1) = identity_as_relation_of(the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X1,X2,X3,X4] :
( ( element(X4,X1)
& relation_of2(X3,X1,X2)
& quasi_total(X3,X1,X2)
& function(X3)
& ~ empty(X1) )
=> apply_as_element(X1,X2,X3,X4) = apply(X3,X4) ),
inference(fof_simplification,[status(thm)],[redefinition_k8_funct_2]) ).
fof(c_0_22,plain,
! [X51,X52,X53] :
( ( ~ relation_of2(X53,X51,X52)
| ~ v1_partfun1(X53,X51,X52)
| ~ function(X53)
| quasi_total(X53,X51,X52) )
& ( ~ relation_of2(X53,X51,X52)
| ~ v1_partfun1(X53,X51,X52)
| ~ function(X53)
| function(X53) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_funct_2])])])]) ).
cnf(c_0_23,plain,
v1_partfun1(identity_as_relation_of(X1),X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
relation_of2_as_subset(identity_relation(X1),X1,X1),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_26,plain,
! [X805] :
( function(identity_relation(X805))
& relation(identity_relation(X805)) ),
inference(variable_rename,[status(thm)],[fc2_funct_1]) ).
fof(c_0_27,plain,
! [X303] :
( ( ~ one_sorted_str(X303)
| empty_carrier(X303)
| ~ empty(the_carrier(X303)) )
& ( ~ one_sorted_str(X303)
| empty(the_carrier(X303))
| ~ empty_carrier(X303) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_struct_0])])])]) ).
fof(c_0_28,plain,
! [X1,X2] :
( ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) )
& ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
cnf(c_0_29,negated_conjecture,
apply_as_element(the_carrier(esk440_0),the_carrier(esk440_0),identity_on_carrier(esk440_0),esk441_0) != esk441_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
( ~ one_sorted_str(X1)
| identity_on_carrier(X1) = identity_relation(the_carrier(X1)) ),
inference(rw,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_31,negated_conjecture,
one_sorted_str(esk440_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_32,plain,
! [X1076,X1077,X1078,X1079] :
( apply_as_element(X1076,X1077,X1078,X1079) = apply(X1078,X1079)
| ~ element(X1079,X1076)
| ~ relation_of2(X1078,X1076,X1077)
| ~ quasi_total(X1078,X1076,X1077)
| ~ function(X1078)
| empty(X1076) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_33,plain,
( ~ relation_of2(X1,X2,X3)
| ~ v1_partfun1(X1,X2,X3)
| ~ function(X1)
| quasi_total(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
v1_partfun1(identity_relation(X1),X1,X1),
inference(rw,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_35,plain,
relation_of2(identity_relation(X1),X1,X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_36,plain,
function(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,negated_conjecture,
~ empty_carrier(esk440_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_38,plain,
( ~ one_sorted_str(X1)
| ~ empty(the_carrier(X1))
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_39,plain,
! [X379,X380] :
( ( ~ empty(X379)
| element(X380,X379)
| ~ empty(X380) )
& ( ~ empty(X379)
| empty(X380)
| ~ element(X380,X379) )
& ( empty(X379)
| element(X380,X379)
| ~ in(X380,X379) )
& ( empty(X379)
| in(X380,X379)
| ~ element(X380,X379) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])]) ).
cnf(c_0_40,negated_conjecture,
apply_as_element(the_carrier(esk440_0),the_carrier(esk440_0),identity_relation(the_carrier(esk440_0)),esk441_0) != esk441_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_41,plain,
( ~ element(X4,X1)
| ~ relation_of2(X2,X1,X3)
| ~ quasi_total(X2,X1,X3)
| ~ function(X2)
| apply_as_element(X1,X3,X2,X4) = apply(X2,X4)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
quasi_total(identity_relation(X1),X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_43,negated_conjecture,
element(esk441_0,the_carrier(esk440_0)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_44,negated_conjecture,
~ empty(the_carrier(esk440_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31])]) ).
fof(c_0_45,lemma,
! [X1898,X1899] :
( apply(identity_relation(X1898),X1899) = X1899
| ~ in(X1899,X1898) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t35_funct_1])])]) ).
cnf(c_0_46,plain,
( ~ element(X1,X2)
| empty(X2)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,negated_conjecture,
apply(identity_relation(the_carrier(esk440_0)),esk441_0) != esk441_0,
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(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_35]),c_0_36]),c_0_43])]),c_0_44]) ).
cnf(c_0_48,lemma,
( ~ in(X1,X2)
| apply(identity_relation(X2),X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_49,negated_conjecture,
in(esk441_0,the_carrier(esk440_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_43]),c_0_44]) ).
cnf(c_0_50,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU353+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n002.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 06:17:31 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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
% 40.82/6.60 % Version: 3.5.1
% 40.82/6.60 % Preprocessing class: FSLMSMSSSSSNFFN.
% 40.82/6.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 40.82/6.60 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 40.82/6.60 % Starting new_bool_3 with 600s (2) cores
% 40.82/6.60 % Starting new_bool_1 with 600s (2) cores
% 40.82/6.60 % Starting sh5l with 300s (1) cores
% 40.82/6.60 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 2606295 completed with status 0
% 40.82/6.60 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 40.82/6.60 % Preprocessing class: FSLMSMSSSSSNFFN.
% 40.82/6.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 40.82/6.60 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 40.82/6.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 40.82/6.60 % No SInE strategy applied
% 40.82/6.60 % Search class: FGHSM-SMLM32-MFFFFFNN
% 40.82/6.60 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 40.82/6.60 % Starting SubtermCWHack with 82s (1) cores
% 40.82/6.60 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 40.82/6.60 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 40.82/6.60 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 2606305 completed with status 0
% 40.82/6.60 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 40.82/6.60 % Preprocessing class: FSLMSMSSSSSNFFN.
% 40.82/6.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 40.82/6.60 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 40.82/6.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 40.82/6.60 % No SInE strategy applied
% 40.82/6.60 % Search class: FGHSM-SMLM32-MFFFFFNN
% 40.82/6.60 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 40.82/6.60 % Starting SubtermCWHack with 82s (1) cores
% 40.82/6.60 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 40.82/6.60 % Preprocessing time : 0.086 s
% 40.82/6.60 % Presaturation interreduction done
% 40.82/6.60
% 40.82/6.60 % Proof found!
% 40.82/6.60 % SZS status Theorem
% 40.82/6.60 % SZS output start CNFRefutation
% See solution above
% 40.82/6.60 % Parsed axioms : 665
% 40.82/6.60 % Removed by relevancy pruning/SinE : 0
% 40.82/6.60 % Initial clauses : 2820
% 40.82/6.60 % Removed in clause preprocessing : 58
% 40.82/6.60 % Initial clauses in saturation : 2762
% 40.82/6.60 % Processed clauses : 13817
% 40.82/6.60 % ...of these trivial : 118
% 40.82/6.60 % ...subsumed : 7189
% 40.82/6.60 % ...remaining for further processing : 6510
% 40.82/6.60 % Other redundant clauses eliminated : 1031
% 40.82/6.60 % Clauses deleted for lack of memory : 0
% 40.82/6.60 % Backward-subsumed : 80
% 40.82/6.60 % Backward-rewritten : 74
% 40.82/6.60 % Generated clauses : 43012
% 40.82/6.60 % ...of the previous two non-redundant : 38748
% 40.82/6.60 % ...aggressively subsumed : 0
% 40.82/6.60 % Contextual simplify-reflections : 328
% 40.82/6.60 % Paramodulations : 42205
% 40.82/6.60 % Factorizations : 2
% 40.82/6.60 % NegExts : 0
% 40.82/6.60 % Equation resolutions : 1038
% 40.82/6.60 % Disequality decompositions : 0
% 40.82/6.60 % Total rewrite steps : 9146
% 40.82/6.60 % ...of those cached : 8387
% 40.82/6.60 % Propositional unsat checks : 1
% 40.82/6.60 % Propositional check models : 1
% 40.82/6.60 % Propositional check unsatisfiable : 0
% 40.82/6.60 % Propositional clauses : 0
% 40.82/6.60 % Propositional clauses after purity: 0
% 40.82/6.60 % Propositional unsat core size : 0
% 40.82/6.60 % Propositional preprocessing time : 0.000
% 40.82/6.60 % Propositional encoding time : 0.027
% 40.82/6.60 % Propositional solver time : 0.026
% 40.82/6.60 % Success case prop preproc time : 0.000
% 40.82/6.60 % Success case prop encoding time : 0.000
% 40.82/6.60 % Success case prop solver time : 0.000
% 40.82/6.60 % Current number of processed clauses : 3147
% 40.82/6.60 % Positive orientable unit clauses : 324
% 40.82/6.60 % Positive unorientable unit clauses: 6
% 40.82/6.60 % Negative unit clauses : 591
% 40.82/6.60 % Non-unit-clauses : 2226
% 40.82/6.60 % Current number of unprocessed clauses: 30029
% 40.82/6.60 % ...number of literals in the above : 113746
% 40.82/6.60 % Current number of archived formulas : 0
% 40.82/6.60 % Current number of archived clauses : 2726
% 40.82/6.60 % Clause-clause subsumption calls (NU) : 5383709
% 40.82/6.60 % Rec. Clause-clause subsumption calls : 937698
% 40.82/6.60 % Non-unit clause-clause subsumptions : 3347
% 40.82/6.60 % Unit Clause-clause subsumption calls : 216135
% 40.82/6.60 % Rewrite failures with RHS unbound : 28
% 40.82/6.60 % BW rewrite match attempts : 196
% 40.82/6.60 % BW rewrite match successes : 122
% 40.82/6.60 % Condensation attempts : 0
% 40.82/6.60 % Condensation successes : 0
% 40.82/6.60 % Termbank termtop insertions : 777911
% 40.82/6.60 % Search garbage collected termcells : 38688
% 40.82/6.60
% 40.82/6.60 % -------------------------------------------------
% 40.82/6.60 % User time : 5.799 s
% 40.82/6.60 % System time : 0.101 s
% 40.82/6.60 % Total time : 5.899 s
% 40.82/6.60 % Maximum resident set size: 11464 pages
% 40.82/6.60
% 40.82/6.60 % -------------------------------------------------
% 40.82/6.60 % User time : 16.868 s
% 40.82/6.60 % System time : 0.338 s
% 40.82/6.60 % Total time : 17.207 s
% 40.82/6.60 % Maximum resident set size: 5376 pages
% 40.82/6.60 % E exiting
%------------------------------------------------------------------------------