%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU387+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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 5.45s 1.25s
% Output : CNFRefutation 5.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 43 ( 23 unt; 0 def)
% Number of atoms : 184 ( 10 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 209 ( 68 ~; 47 |; 81 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 23 ( 21 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-1 aty)
% Number of variables : 45 ( 8 sgn 30 !; 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/sandbox2/benchmark/theBenchmark.p',t2_yellow19) ).
fof(t8_waybel_7,lemma,
! [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/sandbox2/benchmark/theBenchmark.p',t8_waybel_7) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(t4_waybel_7,lemma,
! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_waybel_7) ).
fof(fc1_waybel_1,axiom,
! [X1] :
( distributive_relstr(boole_POSet(X1))
& join_complete_relstr(boole_POSet(X1))
& up_complete_relstr(boole_POSet(X1))
& bounded_relstr(boole_POSet(X1))
& upper_bounded_relstr(boole_POSet(X1))
& lower_bounded_relstr(boole_POSet(X1))
& complete_relstr(boole_POSet(X1))
& with_infima_relstr(boole_POSet(X1))
& with_suprema_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/sandbox2/benchmark/theBenchmark.p',fc1_waybel_1) ).
fof(t18_yellow_1,lemma,
! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
file('/export/starexec/sandbox2/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/sandbox2/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,lemma,
! [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,
! [X382] :
( X382 = empty_set
| ~ empty(X382) ),
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,lemma,
! [X129,X130] :
( ( ~ rel_str(X129)
| ~ lower_bounded_relstr(X129)
| ~ antisymmetric_relstr(X129)
| ~ transitive_relstr(X129)
| ~ reflexive_relstr(X129)
| empty_carrier(X129)
| ~ element(X130,powerset(the_carrier(X129)))
| ~ upper_relstr_subset(X130,X129)
| ~ filtered_subset(X130,X129)
| empty(X130)
| proper_element(X130,powerset(the_carrier(X129)))
| in(bottom_of_relstr(X129),X130) )
& ( ~ rel_str(X129)
| ~ lower_bounded_relstr(X129)
| ~ antisymmetric_relstr(X129)
| ~ transitive_relstr(X129)
| ~ reflexive_relstr(X129)
| empty_carrier(X129)
| ~ element(X130,powerset(the_carrier(X129)))
| ~ upper_relstr_subset(X130,X129)
| ~ filtered_subset(X130,X129)
| empty(X130)
| ~ in(bottom_of_relstr(X129),X130)
| ~ proper_element(X130,powerset(the_carrier(X129))) ) ),
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,
! [X85,X86] :
( ~ empty(X86)
| ~ in(X85,X86) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
fof(c_0_15,lemma,
! [X120] : the_carrier(boole_POSet(X120)) = powerset(X120),
inference(variable_rename,[status(thm)],[t4_waybel_7]) ).
fof(c_0_16,plain,
! [X1] :
( distributive_relstr(boole_POSet(X1))
& join_complete_relstr(boole_POSet(X1))
& up_complete_relstr(boole_POSet(X1))
& bounded_relstr(boole_POSet(X1))
& upper_bounded_relstr(boole_POSet(X1))
& lower_bounded_relstr(boole_POSet(X1))
& complete_relstr(boole_POSet(X1))
& with_infima_relstr(boole_POSet(X1))
& with_suprema_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)],[fc1_waybel_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,lemma,
( ~ 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]) ).
cnf(c_0_21,negated_conjecture,
proper_element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,lemma,
the_carrier(boole_POSet(X1)) = powerset(X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X116] :
( distributive_relstr(boole_POSet(X116))
& join_complete_relstr(boole_POSet(X116))
& up_complete_relstr(boole_POSet(X116))
& bounded_relstr(boole_POSet(X116))
& upper_bounded_relstr(boole_POSet(X116))
& lower_bounded_relstr(boole_POSet(X116))
& complete_relstr(boole_POSet(X116))
& with_infima_relstr(boole_POSet(X116))
& with_suprema_relstr(boole_POSet(X116))
& antisymmetric_relstr(boole_POSet(X116))
& transitive_relstr(boole_POSet(X116))
& reflexive_relstr(boole_POSet(X116))
& strict_rel_str(boole_POSet(X116))
& ~ empty_carrier(boole_POSet(X116)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).
cnf(c_0_24,negated_conjecture,
element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_25,lemma,
! [X278] : bottom_of_relstr(boole_POSet(X278)) = empty_set,
inference(variable_rename,[status(thm)],[t18_yellow_1]) ).
cnf(c_0_26,negated_conjecture,
in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,negated_conjecture,
esk3_0 = empty_set,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_28,plain,
! [X115] :
( rel_str(boole_POSet(X115))
& strict_rel_str(boole_POSet(X115)) ),
inference(variable_rename,[status(thm)],[dt_k3_yellow_1]) ).
cnf(c_0_29,lemma,
( ~ rel_str(X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ reflexive_relstr(X1)
| ~ transitive_relstr(X1)
| ~ antisymmetric_relstr(X1)
| ~ lower_bounded_relstr(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_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,
proper_element(esk2_0,powerset(powerset(esk1_0))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_32,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,plain,
lower_bounded_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
antisymmetric_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,plain,
transitive_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_36,plain,
reflexive_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_37,negated_conjecture,
element(esk2_0,powerset(powerset(esk1_0))),
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_38,lemma,
bottom_of_relstr(boole_POSet(X1)) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_39,negated_conjecture,
in(empty_set,esk2_0),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_40,plain,
rel_str(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,plain,
~ empty_carrier(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_42,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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22]),c_0_31]),c_0_32]),c_0_33]),c_0_34]),c_0_35]),c_0_36]),c_0_22]),c_0_37]),c_0_38]),c_0_39]),c_0_40])]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU387+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n020.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:02 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 5.45/1.25 % Version: 3.5.1
% 5.45/1.25 % Preprocessing class: FSLMSMSSSSSNFFN.
% 5.45/1.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.45/1.25 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 5.45/1.25 % Starting new_bool_3 with 600s (2) cores
% 5.45/1.25 % Starting new_bool_1 with 600s (2) cores
% 5.45/1.25 % Starting sh5l with 300s (1) cores
% 5.45/1.25 % new_bool_3 with pid 2186171 completed with status 0
% 5.45/1.25 % Result found by new_bool_3
% 5.45/1.25 % Preprocessing class: FSLMSMSSSSSNFFN.
% 5.45/1.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.45/1.25 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 5.45/1.25 % Starting new_bool_3 with 600s (2) cores
% 5.45/1.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.45/1.25 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.45/1.25 % Search class: FGHSM-SMLM32-MFFFFFNN
% 5.45/1.25 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 5.45/1.25 % Starting SubtermCWHack with 55s (1) cores
% 5.45/1.25 % Starting new_bool_3 with 61s (1) cores
% 5.45/1.25 % new_bool_3 with pid 2186201 completed with status 0
% 5.45/1.25 % Result found by new_bool_3
% 5.45/1.25 % Preprocessing class: FSLMSMSSSSSNFFN.
% 5.45/1.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.45/1.25 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 5.45/1.25 % Starting new_bool_3 with 600s (2) cores
% 5.45/1.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.45/1.25 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.45/1.25 % Search class: FGHSM-SMLM32-MFFFFFNN
% 5.45/1.25 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 5.45/1.25 % Starting SubtermCWHack with 55s (1) cores
% 5.45/1.25 % Starting new_bool_3 with 61s (1) cores
% 5.45/1.25 % Preprocessing time : 0.017 s
% 5.45/1.25 % Presaturation interreduction done
% 5.45/1.25
% 5.45/1.25 % Proof found!
% 5.45/1.25 % SZS status Theorem
% 5.45/1.25 % SZS output start CNFRefutation
% See solution above
% 5.45/1.25 % Parsed axioms : 860
% 5.45/1.25 % Removed by relevancy pruning/SinE : 548
% 5.45/1.25 % Initial clauses : 1680
% 5.45/1.25 % Removed in clause preprocessing : 74
% 5.45/1.25 % Initial clauses in saturation : 1606
% 5.45/1.25 % Processed clauses : 8069
% 5.45/1.25 % ...of these trivial : 146
% 5.45/1.25 % ...subsumed : 3889
% 5.45/1.25 % ...remaining for further processing : 4034
% 5.45/1.25 % Other redundant clauses eliminated : 524
% 5.45/1.25 % Clauses deleted for lack of memory : 0
% 5.45/1.25 % Backward-subsumed : 35
% 5.45/1.25 % Backward-rewritten : 57
% 5.45/1.25 % Generated clauses : 26032
% 5.45/1.25 % ...of the previous two non-redundant : 23881
% 5.45/1.25 % ...aggressively subsumed : 0
% 5.45/1.25 % Contextual simplify-reflections : 193
% 5.45/1.25 % Paramodulations : 25627
% 5.45/1.25 % Factorizations : 6
% 5.45/1.25 % NegExts : 0
% 5.45/1.25 % Equation resolutions : 528
% 5.45/1.25 % Disequality decompositions : 0
% 5.45/1.25 % Total rewrite steps : 3995
% 5.45/1.25 % ...of those cached : 3382
% 5.45/1.25 % Propositional unsat checks : 0
% 5.45/1.25 % Propositional check models : 0
% 5.45/1.25 % Propositional check unsatisfiable : 0
% 5.45/1.25 % Propositional clauses : 0
% 5.45/1.25 % Propositional clauses after purity: 0
% 5.45/1.25 % Propositional unsat core size : 0
% 5.45/1.25 % Propositional preprocessing time : 0.000
% 5.45/1.25 % Propositional encoding time : 0.000
% 5.45/1.25 % Propositional solver time : 0.000
% 5.45/1.25 % Success case prop preproc time : 0.000
% 5.45/1.25 % Success case prop encoding time : 0.000
% 5.45/1.25 % Success case prop solver time : 0.000
% 5.45/1.25 % Current number of processed clauses : 2315
% 5.45/1.25 % Positive orientable unit clauses : 527
% 5.45/1.25 % Positive unorientable unit clauses: 2
% 5.45/1.25 % Negative unit clauses : 415
% 5.45/1.25 % Non-unit-clauses : 1371
% 5.45/1.25 % Current number of unprocessed clauses: 18727
% 5.45/1.25 % ...number of literals in the above : 64781
% 5.45/1.25 % Current number of archived formulas : 0
% 5.45/1.25 % Current number of archived clauses : 1501
% 5.45/1.25 % Clause-clause subsumption calls (NU) : 1181495
% 5.45/1.25 % Rec. Clause-clause subsumption calls : 225399
% 5.45/1.25 % Non-unit clause-clause subsumptions : 1386
% 5.45/1.25 % Unit Clause-clause subsumption calls : 52836
% 5.45/1.25 % Rewrite failures with RHS unbound : 0
% 5.45/1.25 % BW rewrite match attempts : 136
% 5.45/1.25 % BW rewrite match successes : 59
% 5.45/1.25 % Condensation attempts : 0
% 5.45/1.25 % Condensation successes : 0
% 5.45/1.25 % Termbank termtop insertions : 441469
% 5.45/1.25 % Search garbage collected termcells : 22943
% 5.45/1.25
% 5.45/1.25 % -------------------------------------------------
% 5.45/1.25 % User time : 0.747 s
% 5.45/1.25 % System time : 0.038 s
% 5.45/1.25 % Total time : 0.785 s
% 5.45/1.25 % Maximum resident set size: 8180 pages
% 5.45/1.25
% 5.45/1.25 % -------------------------------------------------
% 5.45/1.25 % User time : 1.479 s
% 5.45/1.25 % System time : 0.063 s
% 5.45/1.25 % Total time : 1.542 s
% 5.45/1.25 % Maximum resident set size: 5888 pages
% 5.45/1.25 % E exiting
%------------------------------------------------------------------------------