%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM604+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:55:40 PM UTC 2026
% Result : Theorem 0.42s 0.70s
% Output : CNFRefutation 0.42s
% 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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',mDefMin) ).
fof(m__3435,hypothesis,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(m__,conjecture,
aElementOf0(xx,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__5045,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5045) ).
fof(mCountNFin,axiom,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> ~ isFinite0(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCountNFin) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',m__3671) ).
fof(m__5034,hypothesis,
( sdtlpdtrp0(xe,xi) = xx
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5034) ).
fof(mEmpFin,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEmpFin) ).
fof(c_0_13,plain,
! [X61,X62,X63] :
( aSubsetOf0(X61,X63)
| ~ aSubsetOf0(X62,X63)
| ~ aSubsetOf0(X61,X62)
| ~ aSet0(X63)
| ~ aSet0(X62)
| ~ aSet0(X61) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubTrans])])]) ).
fof(c_0_14,plain,
! [X53,X54,X55,X56] :
( ( ~ aSet0(X53)
| aSubsetOf0(X56,X53)
| ~ aSet0(X56)
| ~ aElementOf0(esk8_2(X53,X56),X53) )
& ( ~ aSet0(X53)
| aSubsetOf0(X56,X53)
| ~ aSet0(X56)
| aElementOf0(esk8_2(X53,X56),X56) )
& ( ~ aSet0(X53)
| ~ aSubsetOf0(X54,X53)
| aElementOf0(X55,X53)
| ~ aElementOf0(X55,X54) )
& ( ~ aSet0(X53)
| ~ aSubsetOf0(X54,X53)
| aSet0(X54) ) ),
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,
! [X124,X125,X126,X127] :
( ( X124 = slcrc0
| ~ aSubsetOf0(X124,szNzAzT0)
| X127 = szmzizndt0(X124)
| ~ aElementOf0(X127,X124)
| ~ sdtlseqdt0(X127,esk16_2(X124,X127)) )
& ( X124 = slcrc0
| ~ aSubsetOf0(X124,szNzAzT0)
| X127 = szmzizndt0(X124)
| ~ aElementOf0(X127,X124)
| aElementOf0(esk16_2(X124,X127),X124) )
& ( X124 = slcrc0
| ~ aSubsetOf0(X124,szNzAzT0)
| X125 != szmzizndt0(X124)
| sdtlseqdt0(X125,X126)
| ~ aElementOf0(X126,X124) )
& ( X124 = slcrc0
| ~ aSubsetOf0(X124,szNzAzT0)
| X125 != szmzizndt0(X124)
| aElementOf0(X125,X124) ) ),
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,
! [X165,X166,X167] :
( ( X167 = slcrc0
| aElementOf0(esk19_1(X167),X167)
| ~ aSet0(X167) )
& ( X165 != slcrc0
| ~ aElementOf0(X166,X165) )
& ( X165 != slcrc0
| aSet0(X165) ) ),
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,
! [X34] :
( ( sdtlpdtrp0(xe,X34) = szmzizndt0(sdtlpdtrp0(xN,X34))
| ~ aElementOf0(X34,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,
! [X40] :
( ~ isFinite0(X40)
| ~ isCountable0(X40)
| ~ aSet0(X40) ),
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,
! [X14] :
( ( ~ aElementOf0(X14,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X14)) )
& ( ~ aElementOf0(X14,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X14),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.05 % Problem : NUM604+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n010.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 02:44:24 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.53 Running first-order theorem proving
% 0.25/0.54 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.42/0.70 % Version: 3.5.1
% 0.42/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.42/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.42/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.42/0.70 % Starting new_bool_1 with 300s (1) cores
% 0.42/0.70 % Starting sh5l with 300s (1) cores
% 0.42/0.70 % new_bool_1 with pid 4066625 completed with status 0
% 0.42/0.70 % Result found by new_bool_1
% 0.42/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.42/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.42/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.42/0.70 % Starting new_bool_1 with 300s (1) cores
% 0.42/0.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.42/0.70 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/0.70 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.42/0.70 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.42/0.70 % Starting SubtermCWHack with 28s (1) cores
% 0.42/0.70 % SubtermCWHack with pid 4066627 completed with status 0
% 0.42/0.70 % Result found by SubtermCWHack
% 0.42/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.42/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.42/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.42/0.70 % Starting new_bool_1 with 300s (1) cores
% 0.42/0.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.42/0.70 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/0.70 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.42/0.70 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.42/0.70 % Starting SubtermCWHack with 28s (1) cores
% 0.42/0.70 % Preprocessing time : 0.003 s
% 0.42/0.70
% 0.42/0.70 % Proof found!
% 0.42/0.70 % SZS status Theorem
% 0.42/0.70 % SZS output start CNFRefutation
% See solution above
% 0.42/0.70 % Parsed axioms : 101
% 0.42/0.70 % Removed by relevancy pruning/SinE : 2
% 0.42/0.70 % Initial clauses : 195
% 0.42/0.70 % Removed in clause preprocessing : 7
% 0.42/0.70 % Initial clauses in saturation : 188
% 0.42/0.70 % Processed clauses : 1200
% 0.42/0.70 % ...of these trivial : 7
% 0.42/0.70 % ...subsumed : 470
% 0.42/0.70 % ...remaining for further processing : 723
% 0.42/0.70 % Other redundant clauses eliminated : 44
% 0.42/0.70 % Clauses deleted for lack of memory : 0
% 0.42/0.70 % Backward-subsumed : 18
% 0.42/0.70 % Backward-rewritten : 32
% 0.42/0.70 % Generated clauses : 2850
% 0.42/0.70 % ...of the previous two non-redundant : 2493
% 0.42/0.70 % ...aggressively subsumed : 0
% 0.42/0.70 % Contextual simplify-reflections : 59
% 0.42/0.70 % Paramodulations : 2808
% 0.42/0.70 % Factorizations : 0
% 0.42/0.70 % NegExts : 0
% 0.42/0.70 % Equation resolutions : 47
% 0.42/0.70 % Disequality decompositions : 0
% 0.42/0.70 % Total rewrite steps : 1898
% 0.42/0.70 % ...of those cached : 1823
% 0.42/0.70 % Propositional unsat checks : 0
% 0.42/0.70 % Propositional check models : 0
% 0.77/0.70 % Propositional check unsatisfiable : 0
% 0.77/0.70 % Propositional clauses : 0
% 0.77/0.70 % Propositional clauses after purity: 0
% 0.77/0.70 % Propositional unsat core size : 0
% 0.77/0.70 % Propositional preprocessing time : 0.000
% 0.77/0.70 % Propositional encoding time : 0.000
% 0.77/0.70 % Propositional solver time : 0.000
% 0.77/0.70 % Success case prop preproc time : 0.000
% 0.77/0.70 % Success case prop encoding time : 0.000
% 0.77/0.70 % Success case prop solver time : 0.000
% 0.77/0.70 % Current number of processed clauses : 640
% 0.77/0.70 % Positive orientable unit clauses : 83
% 0.77/0.70 % Positive unorientable unit clauses: 0
% 0.77/0.70 % Negative unit clauses : 29
% 0.77/0.70 % Non-unit-clauses : 528
% 0.77/0.70 % Current number of unprocessed clauses: 1438
% 0.77/0.70 % ...number of literals in the above : 8250
% 0.77/0.70 % Current number of archived formulas : 0
% 0.77/0.70 % Current number of archived clauses : 50
% 0.77/0.70 % Clause-clause subsumption calls (NU) : 46657
% 0.77/0.70 % Rec. Clause-clause subsumption calls : 21729
% 0.77/0.70 % Non-unit clause-clause subsumptions : 416
% 0.77/0.70 % Unit Clause-clause subsumption calls : 2157
% 0.77/0.70 % Rewrite failures with RHS unbound : 0
% 0.77/0.70 % BW rewrite match attempts : 10
% 0.77/0.70 % BW rewrite match successes : 10
% 0.77/0.70 % Condensation attempts : 0
% 0.77/0.70 % Condensation successes : 0
% 0.77/0.70 % Termbank termtop insertions : 66758
% 0.77/0.70 % Search garbage collected termcells : 3535
% 0.77/0.70
% 0.77/0.70 % -------------------------------------------------
% 0.77/0.70 % User time : 0.110 s
% 0.77/0.70 % System time : 0.007 s
% 0.77/0.70 % Total time : 0.116 s
% 0.77/0.70 % Maximum resident set size: 4276 pages
% 0.77/0.70
% 0.77/0.70 % -------------------------------------------------
% 0.77/0.70 % User time : 0.118 s
% 0.77/0.70 % System time : 0.012 s
% 0.77/0.70 % Total time : 0.130 s
% 0.77/0.70 % Maximum resident set size: 4608 pages
% 0.77/0.70 % E exiting
%------------------------------------------------------------------------------