%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU394+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 : n011.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:57 PM UTC 2026
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 13 unt; 0 def)
% Number of atoms : 145 ( 15 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 176 ( 70 ~; 43 |; 45 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 48 ( 1 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t15_yellow19,conjecture,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& ~ empty(X2) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t15_yellow19) ).
fof(t2_yellow19,axiom,
! [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(t14_yellow19,axiom,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& ~ empty(X2) )
=> set_difference(X2,singleton(empty_set)) = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_yellow19) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& in(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(t65_zfmisc_1,axiom,
! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t65_zfmisc_1) ).
fof(fc2_pre_topc,axiom,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ~ empty(cast_as_carrier_subset(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_pre_topc) ).
fof(fc4_relat_1,axiom,
( relation(empty_set)
& empty(empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc4_relat_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& ~ empty(X2) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
inference(assume_negation,[status(cth)],[t15_yellow19]) ).
fof(c_0_8,plain,
! [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)],[t2_yellow19]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& ~ empty(X2) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& ~ empty(X2) )
=> set_difference(X2,singleton(empty_set)) = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
inference(fof_simplification,[status(thm)],[t14_yellow19]) ).
fof(c_0_11,plain,
! [X48,X49,X50] :
( ~ empty(X50)
| ~ in(X50,X49)
| ~ element(X49,powerset(the_carrier(boole_POSet(X48))))
| ~ proper_element(X49,powerset(the_carrier(boole_POSet(X48))))
| ~ upper_relstr_subset(X49,boole_POSet(X48))
| ~ filtered_subset(X49,boole_POSet(X48))
| empty(X49)
| empty(X48) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_12,plain,
! [X109,X110] :
( ~ empty(X110)
| ~ in(X109,X110) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
fof(c_0_13,negated_conjecture,
( esk2_0 != filter_of_net_str(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
& element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))
& proper_element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))
& upper_relstr_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0)))
& filtered_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0)))
& ~ empty(esk2_0)
& one_sorted_str(esk1_0)
& ~ empty_carrier(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_14,plain,
! [X17,X18] :
( set_difference(X18,singleton(empty_set)) = filter_of_net_str(X17,net_of_bool_filter(X17,cast_as_carrier_subset(X17),X18))
| ~ element(X18,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X17)))))
| ~ upper_relstr_subset(X18,boole_POSet(cast_as_carrier_subset(X17)))
| ~ filtered_subset(X18,boole_POSet(cast_as_carrier_subset(X17)))
| empty(X18)
| ~ one_sorted_str(X17)
| empty_carrier(X17) ),
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_15,plain,
! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[t65_zfmisc_1]) ).
cnf(c_0_16,plain,
( ~ empty(X3)
| ~ in(X3,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)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
esk2_0 != filter_of_net_str(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
| ~ upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ one_sorted_str(X1)
| set_difference(X2,singleton(empty_set)) = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2))
| empty(X2)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
filtered_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,negated_conjecture,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_26,plain,
! [X72,X73] :
( ( set_difference(X72,singleton(X73)) = X72
| in(X73,X72) )
& ( ~ in(X73,X72)
| set_difference(X72,singleton(X73)) != X72 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
fof(c_0_27,plain,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ~ empty(cast_as_carrier_subset(X1)) ),
inference(fof_simplification,[status(thm)],[fc2_pre_topc]) ).
cnf(c_0_28,plain,
( ~ in(X3,X2)
| ~ empty(X3)
| ~ element(X2,powerset(the_carrier(boole_POSet(X1))))
| ~ filtered_subset(X2,boole_POSet(X1))
| ~ upper_relstr_subset(X2,boole_POSet(X1))
| ~ proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
| empty(X1) ),
inference(csr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_29,negated_conjecture,
proper_element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_30,negated_conjecture,
set_difference(esk2_0,singleton(empty_set)) != esk2_0,
inference(sr,[status(thm)],[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_18,c_0_19]),c_0_20]),c_0_21]),c_0_22]),c_0_23])]),c_0_24]),c_0_25]) ).
cnf(c_0_31,plain,
( set_difference(X2,singleton(X1)) = X2
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
! [X29] :
( ~ empty(cast_as_carrier_subset(X29))
| ~ one_sorted_str(X29)
| empty_carrier(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])]) ).
cnf(c_0_33,negated_conjecture,
( ~ in(X1,esk2_0)
| ~ empty(X1)
| empty(cast_as_carrier_subset(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_34,negated_conjecture,
in(empty_set,esk2_0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc4_relat_1]) ).
cnf(c_0_36,plain,
( ~ empty(cast_as_carrier_subset(X1))
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
empty(cast_as_carrier_subset(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_23])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU394+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 06:19:25 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.21/0.49 % Version: 3.5.1
% 0.21/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 % Starting sh5l with 300s (1) cores
% 0.21/0.49 % new_bool_1 with pid 1157243 completed with status 0
% 0.21/0.49 % Result found by new_bool_1
% 0.21/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.21/0.49 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.49 % SubtermCWHack with pid 1157245 completed with status 0
% 0.21/0.49 % Result found by SubtermCWHack
% 0.21/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.21/0.49 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.49 % Preprocessing time : 0.004 s
% 0.21/0.49
% 0.21/0.49 % Proof found!
% 0.21/0.49 % SZS status Theorem
% 0.21/0.49 % SZS output start CNFRefutation
% See solution above
% 0.21/0.49 % Parsed axioms : 127
% 0.21/0.49 % Removed by relevancy pruning/SinE : 39
% 0.21/0.49 % Initial clauses : 309
% 0.21/0.49 % Removed in clause preprocessing : 23
% 0.21/0.49 % Initial clauses in saturation : 286
% 0.21/0.49 % Processed clauses : 721
% 0.21/0.49 % ...of these trivial : 43
% 0.21/0.49 % ...subsumed : 219
% 0.21/0.49 % ...remaining for further processing : 459
% 0.21/0.49 % Other redundant clauses eliminated : 0
% 0.21/0.49 % Clauses deleted for lack of memory : 0
% 0.21/0.49 % Backward-subsumed : 5
% 0.21/0.49 % Backward-rewritten : 16
% 0.21/0.49 % Generated clauses : 1133
% 0.21/0.49 % ...of the previous two non-redundant : 984
% 0.21/0.49 % ...aggressively subsumed : 0
% 0.21/0.49 % Contextual simplify-reflections : 15
% 0.21/0.49 % Paramodulations : 1131
% 0.21/0.49 % Factorizations : 2
% 0.21/0.49 % NegExts : 0
% 0.21/0.49 % Equation resolutions : 0
% 0.21/0.49 % Disequality decompositions : 0
% 0.21/0.49 % Total rewrite steps : 335
% 0.21/0.49 % ...of those cached : 277
% 0.21/0.49 % Propositional unsat checks : 0
% 0.21/0.49 % Propositional check models : 0
% 0.21/0.49 % Propositional check unsatisfiable : 0
% 0.21/0.49 % Propositional clauses : 0
% 0.21/0.49 % Propositional clauses after purity: 0
% 0.21/0.49 % Propositional unsat core size : 0
% 0.21/0.49 % Propositional preprocessing time : 0.000
% 0.21/0.49 % Propositional encoding time : 0.000
% 0.21/0.49 % Propositional solver time : 0.000
% 0.21/0.49 % Success case prop preproc time : 0.000
% 0.21/0.49 % Success case prop encoding time : 0.000
% 0.21/0.49 % Success case prop solver time : 0.000
% 0.21/0.49 % Current number of processed clauses : 438
% 0.21/0.49 % Positive orientable unit clauses : 123
% 0.21/0.49 % Positive unorientable unit clauses: 0
% 0.21/0.49 % Negative unit clauses : 31
% 0.21/0.49 % Non-unit-clauses : 284
% 0.21/0.49 % Current number of unprocessed clauses: 520
% 0.21/0.49 % ...number of literals in the above : 1841
% 0.21/0.49 % Current number of archived formulas : 0
% 0.21/0.49 % Current number of archived clauses : 21
% 0.21/0.49 % Clause-clause subsumption calls (NU) : 21093
% 0.21/0.49 % Rec. Clause-clause subsumption calls : 8784
% 0.21/0.49 % Non-unit clause-clause subsumptions : 183
% 0.21/0.49 % Unit Clause-clause subsumption calls : 899
% 0.21/0.49 % Rewrite failures with RHS unbound : 0
% 0.21/0.49 % BW rewrite match attempts : 10
% 0.21/0.49 % BW rewrite match successes : 4
% 0.21/0.49 % Condensation attempts : 0
% 0.21/0.49 % Condensation successes : 0
% 0.21/0.49 % Termbank termtop insertions : 32265
% 0.21/0.49 % Search garbage collected termcells : 2586
% 0.21/0.49
% 0.21/0.49 % -------------------------------------------------
% 0.21/0.49 % User time : 0.050 s
% 0.21/0.49 % System time : 0.007 s
% 0.21/0.49 % Total time : 0.056 s
% 0.21/0.49 % Maximum resident set size: 4300 pages
% 0.21/0.49
% 0.21/0.49 % -------------------------------------------------
% 0.21/0.49 % User time : 0.054 s
% 0.21/0.49 % System time : 0.012 s
% 0.21/0.49 % Total time : 0.066 s
% 0.21/0.49 % Maximum resident set size: 4608 pages
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------