%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM604+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 01:49:44 PM UTC 2026
% Result : Theorem 0.57s 0.53s
% Output : CNFRefutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 51 ( 19 unt; 0 def)
% Number of atoms : 161 ( 29 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 179 ( 69 ~; 66 |; 28 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 34 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mSubTrans,axiom,
! [X1,X2,X3] :
( ( aSet0(X3)
& aSet0(X2)
& aSet0(X1) )
=> ( ( aSubsetOf0(X2,X3)
& aSubsetOf0(X1,X2) )
=> aSubsetOf0(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubTrans) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(mDefMin,axiom,
! [X1] :
( ( X1 != slcrc0
& aSubsetOf0(X1,szNzAzT0) )
=> ! [X2] :
( X2 = szmzizndt0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aElementOf0(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefMin) ).
fof(m__3435,hypothesis,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(m__,conjecture,
aElementOf0(xx,xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__5045,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5045) ).
fof(mCountNFin,axiom,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> ~ isFinite0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCountNFin) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(m__4660,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4660) ).
fof(m__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( isCountable0(sdtlpdtrp0(xN,X1))
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3671) ).
fof(m__5034,hypothesis,
( sdtlpdtrp0(xe,xi) = xx
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5034) ).
fof(mEmpFin,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEmpFin) ).
fof(c_0_13,plain,
! [X29,X30,X31] :
( aSubsetOf0(X29,X31)
| ~ aSubsetOf0(X30,X31)
| ~ aSubsetOf0(X29,X30)
| ~ aSet0(X31)
| ~ aSet0(X30)
| ~ aSet0(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubTrans])])]) ).
fof(c_0_14,plain,
! [X19,X20,X21,X22] :
( ( ~ aSet0(X19)
| aSubsetOf0(X22,X19)
| ~ aSet0(X22)
| ~ aElementOf0(esk2_2(X19,X22),X19) )
& ( ~ aSet0(X19)
| aSubsetOf0(X22,X19)
| ~ aSet0(X22)
| aElementOf0(esk2_2(X19,X22),X22) )
& ( ~ aSet0(X19)
| ~ aSubsetOf0(X20,X19)
| aElementOf0(X21,X19)
| ~ aElementOf0(X21,X20) )
& ( ~ aSet0(X19)
| ~ aSubsetOf0(X20,X19)
| aSet0(X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])])]) ).
fof(c_0_15,plain,
! [X1] :
( ( X1 != slcrc0
& aSubsetOf0(X1,szNzAzT0) )
=> ! [X2] :
( X2 = szmzizndt0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aElementOf0(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[mDefMin]) ).
cnf(c_0_16,plain,
( ~ aSubsetOf0(X2,X3)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X3)
| ~ aSet0(X2)
| ~ aSet0(X1)
| aSubsetOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_19,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_20,plain,
! [X94,X95,X96,X97] :
( ( X94 = slcrc0
| ~ aSubsetOf0(X94,szNzAzT0)
| X97 = szmzizndt0(X94)
| ~ aElementOf0(X97,X94)
| ~ sdtlseqdt0(X97,esk7_2(X94,X97)) )
& ( X94 = slcrc0
| ~ aSubsetOf0(X94,szNzAzT0)
| X97 = szmzizndt0(X94)
| ~ aElementOf0(X97,X94)
| aElementOf0(esk7_2(X94,X97),X94) )
& ( X94 = slcrc0
| ~ aSubsetOf0(X94,szNzAzT0)
| X95 != szmzizndt0(X94)
| sdtlseqdt0(X95,X96)
| ~ aElementOf0(X96,X94) )
& ( X94 = slcrc0
| ~ aSubsetOf0(X94,szNzAzT0)
| X95 != szmzizndt0(X94)
| aElementOf0(X95,X94) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])])])]) ).
cnf(c_0_21,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSubsetOf0(X3,X2)
| aSubsetOf0(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
fof(c_0_22,negated_conjecture,
~ aElementOf0(xx,xS),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_23,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[m__5045]) ).
cnf(c_0_25,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_26,plain,
( ~ aSubsetOf0(X2,szNzAzT0)
| X1 != szmzizndt0(X2)
| X2 = slcrc0
| aElementOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,hypothesis,
( ~ aSubsetOf0(X1,xS)
| aSubsetOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_19])]) ).
fof(c_0_28,negated_conjecture,
~ aElementOf0(xx,xS),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
fof(c_0_29,plain,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> ~ isFinite0(X1) ),
inference(fof_simplification,[status(thm)],[mCountNFin]) ).
fof(c_0_30,plain,
! [X12,X13,X14] :
( ( X14 = slcrc0
| aElementOf0(esk1_1(X14),X14)
| ~ aSet0(X14) )
& ( X12 != slcrc0
| ~ aElementOf0(X13,X12) )
& ( X12 != slcrc0
| aSet0(X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefEmp])])])])])])]) ).
cnf(c_0_31,hypothesis,
( ~ aElementOf0(X1,sdtlpdtrp0(xN,xi))
| aElementOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_32,plain,
( ~ aSubsetOf0(X1,szNzAzT0)
| aElementOf0(szmzizndt0(X1),X1)
| X1 = slcrc0 ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_33,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
fof(c_0_34,hypothesis,
! [X204] :
( ( sdtlpdtrp0(xe,X204) = szmzizndt0(sdtlpdtrp0(xN,X204))
| ~ aElementOf0(X204,szNzAzT0) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4660])])])]) ).
fof(c_0_35,negated_conjecture,
~ aElementOf0(xx,xS),
inference(fof_nnf,[status(thm)],[c_0_28]) ).
fof(c_0_36,plain,
! [X17] :
( ~ isFinite0(X17)
| ~ isCountable0(X17)
| ~ aSet0(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
cnf(c_0_37,plain,
( X1 != slcrc0
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_38,hypothesis,
! [X184] :
( ( ~ aElementOf0(X184,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X184)) )
& ( ~ aElementOf0(X184,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X184),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])])]) ).
cnf(c_0_39,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xS)
| sdtlpdtrp0(xN,xi) = slcrc0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_40,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,hypothesis,
sdtlpdtrp0(xe,xi) = xx,
inference(split_conjunct,[status(thm)],[m__5034]) ).
cnf(c_0_42,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5034]) ).
cnf(c_0_43,negated_conjecture,
~ aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_44,plain,
( ~ isFinite0(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,plain,
isFinite0(slcrc0),
inference(split_conjunct,[status(thm)],[mEmpFin]) ).
cnf(c_0_46,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_47,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,hypothesis,
sdtlpdtrp0(xN,xi) = slcrc0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]),c_0_43]) ).
cnf(c_0_49,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_50,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_42])]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM604+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 02:44:10 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 0.57/0.53 % Version: 3.5.1
% 0.57/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.57/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.57/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.57/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.57/0.53 % Starting sh5l with 300s (1) cores
% 0.57/0.53 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 798346 completed with status 0
% 0.57/0.53 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.57/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.57/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.57/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.57/0.53 % No SInE strategy applied
% 0.57/0.53 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.57/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.57/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.57/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.57/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.57/0.53 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.57/0.53 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.57/0.53 % SubtermCWHack with pid 798357 completed with status 0
% 0.57/0.53 % Result found by SubtermCWHack
% 0.57/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.57/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.57/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.57/0.53 % No SInE strategy applied
% 0.57/0.53 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.57/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.57/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.57/0.53 % Preprocessing time : 0.002 s
% 0.57/0.53
% 0.57/0.53 % Proof found!
% 0.57/0.53 % SZS status Theorem
% 0.57/0.53 % SZS output start CNFRefutation
% See solution above
% 0.57/0.53 % Parsed axioms : 101
% 0.57/0.53 % Removed by relevancy pruning/SinE : 0
% 0.57/0.53 % Initial clauses : 204
% 0.57/0.53 % Removed in clause preprocessing : 7
% 0.57/0.53 % Initial clauses in saturation : 197
% 0.57/0.53 % Processed clauses : 1266
% 0.57/0.53 % ...of these trivial : 7
% 0.57/0.53 % ...subsumed : 507
% 0.57/0.53 % ...remaining for further processing : 752
% 0.57/0.53 % Other redundant clauses eliminated : 54
% 0.57/0.53 % Clauses deleted for lack of memory : 0
% 0.57/0.53 % Backward-subsumed : 23
% 0.57/0.53 % Backward-rewritten : 35
% 0.57/0.53 % Generated clauses : 3135
% 0.57/0.53 % ...of the previous two non-redundant : 2734
% 0.57/0.53 % ...aggressively subsumed : 0
% 0.57/0.53 % Contextual simplify-reflections : 61
% 0.57/0.53 % Paramodulations : 3083
% 0.57/0.53 % Factorizations : 0
% 0.57/0.53 % NegExts : 0
% 0.57/0.53 % Equation resolutions : 57
% 0.57/0.53 % Disequality decompositions : 0
% 0.57/0.53 % Total rewrite steps : 1972
% 0.57/0.53 % ...of those cached : 1897
% 0.57/0.53 % Propositional unsat checks : 0
% 0.57/0.53 % Propositional check models : 0
% 0.57/0.53 % Propositional check unsatisfiable : 0
% 0.57/0.53 % Propositional clauses : 0
% 0.57/0.53 % Propositional clauses after purity: 0
% 0.57/0.53 % Propositional unsat core size : 0
% 0.57/0.53 % Propositional preprocessing time : 0.000
% 0.57/0.53 % Propositional encoding time : 0.000
% 0.57/0.53 % Propositional solver time : 0.000
% 0.57/0.53 % Success case prop preproc time : 0.000
% 0.57/0.53 % Success case prop encoding time : 0.000
% 0.57/0.53 % Success case prop solver time : 0.000
% 0.57/0.53 % Current number of processed clauses : 654
% 0.57/0.53 % Positive orientable unit clauses : 81
% 0.57/0.53 % Positive unorientable unit clauses: 0
% 0.57/0.53 % Negative unit clauses : 28
% 0.57/0.53 % Non-unit-clauses : 545
% 0.57/0.53 % Current number of unprocessed clauses: 1618
% 0.57/0.53 % ...number of literals in the above : 9444
% 0.57/0.53 % Current number of archived formulas : 0
% 0.57/0.53 % Current number of archived clauses : 58
% 0.57/0.53 % Clause-clause subsumption calls (NU) : 45149
% 0.57/0.53 % Rec. Clause-clause subsumption calls : 20685
% 0.57/0.53 % Non-unit clause-clause subsumptions : 457
% 0.57/0.53 % Unit Clause-clause subsumption calls : 1397
% 0.57/0.53 % Rewrite failures with RHS unbound : 0
% 0.57/0.53 % BW rewrite match attempts : 10
% 0.57/0.53 % BW rewrite match successes : 10
% 0.57/0.53 % Condensation attempts : 0
% 0.57/0.53 % Condensation successes : 0
% 0.57/0.53 % Termbank termtop insertions : 72049
% 0.57/0.53 % Search garbage collected termcells : 3728
% 0.57/0.53
% 0.57/0.53 % -------------------------------------------------
% 0.57/0.53 % User time : 0.079 s
% 0.57/0.53 % System time : 0.006 s
% 0.57/0.53 % Total time : 0.085 s
% 0.57/0.53 % Maximum resident set size: 4020 pages
% 0.57/0.53
% 0.57/0.53 % -------------------------------------------------
% 0.57/0.53 % User time : 0.336 s
% 0.57/0.53 % System time : 0.030 s
% 0.57/0.53 % Total time : 0.366 s
% 0.57/0.53 % Maximum resident set size: 4608 pages
% 0.57/0.53 % E exiting
%------------------------------------------------------------------------------