%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU371+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 : n012.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:53 PM UTC 2026
% Result : Theorem 22.21s 3.73s
% Output : CNFRefutation 22.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 24 unt; 0 def)
% Number of atoms : 170 ( 34 equ)
% Maximal formula atoms : 25 ( 3 avg)
% Number of connectives : 173 ( 48 ~; 39 |; 81 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 22 ( 20 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 9 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t18_yellow_1,conjecture,
! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_yellow_1) ).
fof(t4_yellow_1,lemma,
! [X1] : boole_POSet(X1) = incl_POSet(powerset(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_yellow_1) ).
fof(d2_yellow_1,axiom,
! [X1] : boole_POSet(X1) = poset_of_lattice(boole_lattice(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_yellow_1) ).
fof(t50_lattice3,lemma,
! [X1] :
( ( latt_str(X1)
& complete_latt_str(X1)
& lattice(X1)
& ~ empty_carrier(X1) )
=> ( bottom_of_semilattstr(X1) = join_of_latt_set(X1,empty_set)
& latt_str(X1)
& lower_bounded_semilattstr(X1)
& lattice(X1)
& ~ empty_carrier(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t50_lattice3) ).
fof(fc1_knaster,axiom,
! [X1] :
( complete_latt_str(boole_lattice(X1))
& boolean_lattstr(boole_lattice(X1))
& complemented_lattstr(boole_lattice(X1))
& bounded_lattstr(boole_lattice(X1))
& upper_bounded_semilattstr(boole_lattice(X1))
& lower_bounded_semilattstr(boole_lattice(X1))
& modular_lattstr(boole_lattice(X1))
& distributive_lattstr(boole_lattice(X1))
& lattice(boole_lattice(X1))
& join_absorbing(boole_lattice(X1))
& meet_absorbing(boole_lattice(X1))
& meet_associative(boole_lattice(X1))
& meet_commutative(boole_lattice(X1))
& join_associative(boole_lattice(X1))
& join_commutative(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1))
& ~ empty_carrier(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_knaster) ).
fof(d11_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> bottom_of_relstr(X1) = join_on_relstr(X1,empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d11_yellow_0) ).
fof(dt_k2_yellow_1,axiom,
! [X1] :
( rel_str(incl_POSet(X1))
& strict_rel_str(incl_POSet(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_yellow_1) ).
fof(t3_lattice3,lemma,
! [X1] :
( bottom_of_semilattstr(boole_lattice(X1)) = empty_set
& lower_bounded_semilattstr(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_lattice3) ).
fof(dt_k1_lattice3,axiom,
! [X1] :
( latt_str(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_lattice3) ).
fof(t29_yellow_0,lemma,
! [X1] :
( ( latt_str(X1)
& complete_latt_str(X1)
& lattice(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( meet_of_latt_set(X1,X2) = meet_on_relstr(poset_of_lattice(X1),X2)
& join_of_latt_set(X1,X2) = join_on_relstr(poset_of_lattice(X1),X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t29_yellow_0) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
inference(assume_negation,[status(cth)],[t18_yellow_1]) ).
fof(c_0_11,negated_conjecture,
bottom_of_relstr(boole_POSet(esk464_0)) != empty_set,
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_12,lemma,
! [X2226] : boole_POSet(X2226) = incl_POSet(powerset(X2226)),
inference(variable_rename,[status(thm)],[t4_yellow_1]) ).
fof(c_0_13,plain,
! [X461] : boole_POSet(X461) = poset_of_lattice(boole_lattice(X461)),
inference(variable_rename,[status(thm)],[d2_yellow_1]) ).
cnf(c_0_14,negated_conjecture,
bottom_of_relstr(boole_POSet(esk464_0)) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,lemma,
boole_POSet(X1) = incl_POSet(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
boole_POSet(X1) = poset_of_lattice(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,lemma,
! [X1] :
( ( latt_str(X1)
& complete_latt_str(X1)
& lattice(X1)
& ~ empty_carrier(X1) )
=> ( bottom_of_semilattstr(X1) = join_of_latt_set(X1,empty_set)
& latt_str(X1)
& lower_bounded_semilattstr(X1)
& lattice(X1)
& ~ empty_carrier(X1) ) ),
inference(fof_simplification,[status(thm)],[t50_lattice3]) ).
fof(c_0_18,plain,
! [X1] :
( complete_latt_str(boole_lattice(X1))
& boolean_lattstr(boole_lattice(X1))
& complemented_lattstr(boole_lattice(X1))
& bounded_lattstr(boole_lattice(X1))
& upper_bounded_semilattstr(boole_lattice(X1))
& lower_bounded_semilattstr(boole_lattice(X1))
& modular_lattstr(boole_lattice(X1))
& distributive_lattstr(boole_lattice(X1))
& lattice(boole_lattice(X1))
& join_absorbing(boole_lattice(X1))
& meet_absorbing(boole_lattice(X1))
& meet_associative(boole_lattice(X1))
& meet_commutative(boole_lattice(X1))
& join_associative(boole_lattice(X1))
& join_commutative(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1))
& ~ empty_carrier(boole_lattice(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_knaster]) ).
cnf(c_0_19,negated_conjecture,
bottom_of_relstr(incl_POSet(powerset(esk464_0))) != empty_set,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
poset_of_lattice(boole_lattice(X1)) = incl_POSet(powerset(X1)),
inference(rw,[status(thm)],[c_0_16,c_0_15]) ).
fof(c_0_21,plain,
! [X159] :
( bottom_of_relstr(X159) = join_on_relstr(X159,empty_set)
| ~ rel_str(X159) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d11_yellow_0])])]) ).
fof(c_0_22,plain,
! [X786] :
( rel_str(incl_POSet(X786))
& strict_rel_str(incl_POSet(X786)) ),
inference(variable_rename,[status(thm)],[dt_k2_yellow_1]) ).
fof(c_0_23,lemma,
! [X2143] :
( bottom_of_semilattstr(boole_lattice(X2143)) = empty_set
& lower_bounded_semilattstr(boole_lattice(X2143)) ),
inference(variable_rename,[status(thm)],[t3_lattice3]) ).
fof(c_0_24,lemma,
! [X2227] :
( ( ~ latt_str(X2227)
| ~ complete_latt_str(X2227)
| ~ lattice(X2227)
| empty_carrier(X2227)
| bottom_of_semilattstr(X2227) = join_of_latt_set(X2227,empty_set) )
& ( ~ latt_str(X2227)
| ~ complete_latt_str(X2227)
| ~ lattice(X2227)
| empty_carrier(X2227)
| latt_str(X2227) )
& ( ~ latt_str(X2227)
| ~ complete_latt_str(X2227)
| ~ lattice(X2227)
| empty_carrier(X2227)
| lower_bounded_semilattstr(X2227) )
& ( ~ latt_str(X2227)
| ~ complete_latt_str(X2227)
| ~ lattice(X2227)
| empty_carrier(X2227)
| lattice(X2227) )
& ( ~ latt_str(X2227)
| ~ complete_latt_str(X2227)
| ~ lattice(X2227)
| empty_carrier(X2227)
| ~ empty_carrier(X2227) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
fof(c_0_25,plain,
! [X907] :
( complete_latt_str(boole_lattice(X907))
& boolean_lattstr(boole_lattice(X907))
& complemented_lattstr(boole_lattice(X907))
& bounded_lattstr(boole_lattice(X907))
& upper_bounded_semilattstr(boole_lattice(X907))
& lower_bounded_semilattstr(boole_lattice(X907))
& modular_lattstr(boole_lattice(X907))
& distributive_lattstr(boole_lattice(X907))
& lattice(boole_lattice(X907))
& join_absorbing(boole_lattice(X907))
& meet_absorbing(boole_lattice(X907))
& meet_associative(boole_lattice(X907))
& meet_commutative(boole_lattice(X907))
& join_associative(boole_lattice(X907))
& join_commutative(boole_lattice(X907))
& strict_latt_str(boole_lattice(X907))
& ~ empty_carrier(boole_lattice(X907)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_18])]) ).
fof(c_0_26,plain,
! [X748] :
( latt_str(boole_lattice(X748))
& strict_latt_str(boole_lattice(X748)) ),
inference(variable_rename,[status(thm)],[dt_k1_lattice3]) ).
fof(c_0_27,lemma,
! [X1] :
( ( latt_str(X1)
& complete_latt_str(X1)
& lattice(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( meet_of_latt_set(X1,X2) = meet_on_relstr(poset_of_lattice(X1),X2)
& join_of_latt_set(X1,X2) = join_on_relstr(poset_of_lattice(X1),X2) ) ),
inference(fof_simplification,[status(thm)],[t29_yellow_0]) ).
cnf(c_0_28,negated_conjecture,
bottom_of_relstr(poset_of_lattice(boole_lattice(esk464_0))) != empty_set,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
( ~ rel_str(X1)
| bottom_of_relstr(X1) = join_on_relstr(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,lemma,
bottom_of_semilattstr(boole_lattice(X1)) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,lemma,
( ~ latt_str(X1)
| ~ complete_latt_str(X1)
| ~ lattice(X1)
| empty_carrier(X1)
| bottom_of_semilattstr(X1) = join_of_latt_set(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
complete_latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
lattice(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
~ empty_carrier(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_37,lemma,
! [X2059,X2060] :
( ( ~ latt_str(X2059)
| ~ complete_latt_str(X2059)
| ~ lattice(X2059)
| empty_carrier(X2059)
| meet_of_latt_set(X2059,X2060) = meet_on_relstr(poset_of_lattice(X2059),X2060) )
& ( ~ latt_str(X2059)
| ~ complete_latt_str(X2059)
| ~ lattice(X2059)
| empty_carrier(X2059)
| join_of_latt_set(X2059,X2060) = join_on_relstr(poset_of_lattice(X2059),X2060) ) ),
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_27])])])])]) ).
cnf(c_0_38,negated_conjecture,
( ~ rel_str(poset_of_lattice(boole_lattice(esk464_0)))
| join_on_relstr(poset_of_lattice(boole_lattice(esk464_0)),empty_set) != empty_set ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,plain,
rel_str(poset_of_lattice(boole_lattice(X1))),
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_40,lemma,
join_of_latt_set(boole_lattice(X1),empty_set) = empty_set,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]),c_0_35])]),c_0_36]) ).
cnf(c_0_41,lemma,
( ~ latt_str(X1)
| ~ complete_latt_str(X1)
| ~ lattice(X1)
| empty_carrier(X1)
| join_of_latt_set(X1,X2) = join_on_relstr(poset_of_lattice(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
join_on_relstr(poset_of_lattice(boole_lattice(esk464_0)),empty_set) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_43,lemma,
join_on_relstr(poset_of_lattice(boole_lattice(X1)),empty_set) = empty_set,
inference(sr,[status(thm)],[inference(cn,[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_33]),c_0_34]),c_0_35])]),c_0_36]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU371+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 21 06:16:22 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 Running first-order theorem proving
% 0.08/0.34 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
% 22.21/3.73 % Version: 3.5.1
% 22.21/3.73 % Preprocessing class: FSLMSMSSSSSNFFN.
% 22.21/3.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.21/3.73 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 22.21/3.73 % Starting new_bool_3 with 600s (2) cores
% 22.21/3.73 % Starting new_bool_1 with 600s (2) cores
% 22.21/3.73 % Starting sh5l with 300s (1) cores
% 22.21/3.73 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 1725365 completed with status 0
% 22.21/3.73 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 22.21/3.73 % Preprocessing class: FSLMSMSSSSSNFFN.
% 22.21/3.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.21/3.73 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 22.21/3.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 22.21/3.73 % No SInE strategy applied
% 22.21/3.73 % Search class: FGHSM-SMLM32-MFFFFFNN
% 22.21/3.73 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 22.21/3.73 % Starting SubtermCWHack with 82s (1) cores
% 22.21/3.73 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 22.21/3.73 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 22.21/3.73 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 1725375 completed with status 0
% 22.21/3.73 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 22.21/3.73 % Preprocessing class: FSLMSMSSSSSNFFN.
% 22.21/3.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.21/3.73 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 22.21/3.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 22.21/3.73 % No SInE strategy applied
% 22.21/3.73 % Search class: FGHSM-SMLM32-MFFFFFNN
% 22.21/3.73 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 22.21/3.73 % Starting SubtermCWHack with 82s (1) cores
% 22.21/3.73 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 22.21/3.73 % Preprocessing time : 0.057 s
% 22.21/3.73 % Presaturation interreduction done
% 22.21/3.73
% 22.21/3.73 % Proof found!
% 22.21/3.73 % SZS status Theorem
% 22.21/3.73 % SZS output start CNFRefutation
% See solution above
% 22.21/3.73 % Parsed axioms : 756
% 22.21/3.73 % Removed by relevancy pruning/SinE : 0
% 22.21/3.73 % Initial clauses : 3317
% 22.21/3.73 % Removed in clause preprocessing : 74
% 22.21/3.73 % Initial clauses in saturation : 3243
% 22.21/3.73 % Processed clauses : 11513
% 22.21/3.73 % ...of these trivial : 171
% 22.21/3.73 % ...subsumed : 4958
% 22.21/3.73 % ...remaining for further processing : 6384
% 22.21/3.73 % Other redundant clauses eliminated : 1016
% 22.21/3.73 % Clauses deleted for lack of memory : 0
% 22.21/3.73 % Backward-subsumed : 113
% 22.21/3.73 % Backward-rewritten : 124
% 22.21/3.73 % Generated clauses : 22812
% 22.21/3.73 % ...of the previous two non-redundant : 19829
% 22.21/3.73 % ...aggressively subsumed : 0
% 22.21/3.73 % Contextual simplify-reflections : 354
% 22.21/3.73 % Paramodulations : 22034
% 22.21/3.73 % Factorizations : 0
% 22.21/3.73 % NegExts : 0
% 22.21/3.73 % Equation resolutions : 1024
% 22.21/3.73 % Disequality decompositions : 0
% 22.21/3.73 % Total rewrite steps : 7392
% 22.21/3.73 % ...of those cached : 6588
% 22.21/3.73 % Propositional unsat checks : 1
% 22.21/3.73 % Propositional check models : 1
% 22.21/3.73 % Propositional check unsatisfiable : 0
% 22.21/3.73 % Propositional clauses : 0
% 22.21/3.73 % Propositional clauses after purity: 0
% 22.21/3.73 % Propositional unsat core size : 0
% 22.21/3.73 % Propositional preprocessing time : 0.000
% 22.21/3.73 % Propositional encoding time : 0.017
% 22.21/3.73 % Propositional solver time : 0.008
% 22.21/3.73 % Success case prop preproc time : 0.000
% 22.21/3.73 % Success case prop encoding time : 0.000
% 22.21/3.73 % Success case prop solver time : 0.000
% 22.21/3.73 % Current number of processed clauses : 2526
% 22.21/3.73 % Positive orientable unit clauses : 499
% 22.21/3.73 % Positive unorientable unit clauses: 6
% 22.21/3.73 % Negative unit clauses : 518
% 22.21/3.73 % Non-unit-clauses : 1503
% 22.21/3.73 % Current number of unprocessed clauses: 14218
% 22.21/3.73 % ...number of literals in the above : 47051
% 22.21/3.73 % Current number of archived formulas : 0
% 22.21/3.73 % Current number of archived clauses : 3203
% 22.21/3.73 % Clause-clause subsumption calls (NU) : 4461034
% 22.21/3.73 % Rec. Clause-clause subsumption calls : 554447
% 22.21/3.73 % Non-unit clause-clause subsumptions : 1877
% 22.21/3.73 % Unit Clause-clause subsumption calls : 66651
% 22.21/3.73 % Rewrite failures with RHS unbound : 26
% 22.21/3.73 % BW rewrite match attempts : 179
% 22.21/3.73 % BW rewrite match successes : 131
% 22.21/3.73 % Condensation attempts : 0
% 22.21/3.73 % Condensation successes : 0
% 22.21/3.73 % Termbank termtop insertions : 546449
% 22.21/3.73 % Search garbage collected termcells : 44569
% 22.21/3.73
% 22.21/3.73 % -------------------------------------------------
% 22.21/3.73 % User time : 3.041 s
% 22.21/3.73 % System time : 0.055 s
% 22.21/3.73 % Total time : 3.096 s
% 22.21/3.73 % Maximum resident set size: 12884 pages
% 22.21/3.73
% 22.21/3.73 % -------------------------------------------------
% 22.21/3.73 % User time : 8.848 s
% 22.21/3.73 % System time : 0.179 s
% 22.21/3.73 % Total time : 9.027 s
% 22.21/3.73 % Maximum resident set size: 5888 pages
% 22.21/3.73 % E exiting
%------------------------------------------------------------------------------