%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM630+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 : n002.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:46 PM UTC 2026
% Result : Theorem 0.24s 0.53s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 47 ( 30 unt; 0 def)
% Number of atoms : 106 ( 37 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 94 ( 35 ~; 30 |; 21 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 12 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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__,conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__5309,hypothesis,
( sdtlpdtrp0(xe,xn) = xp
& aElementOf0(xn,szNzAzT0)
& aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5309) ).
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(m__4151,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ! [X2] :
( ( aElementOf0(X2,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))
& aSet0(X2) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = sdtlpdtrp0(xc,sdtpldt0(X2,szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& szDzozmdt0(sdtlpdtrp0(xC,X1)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)
& aFunction0(sdtlpdtrp0(xC,X1)) ) )
& szDzozmdt0(xC) = szNzAzT0
& aFunction0(xC) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4151) ).
fof(m__5585,hypothesis,
xD = sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5585) ).
fof(mConsDiff,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> sdtpldt0(sdtmndt0(X1,X2),X2) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mConsDiff) ).
fof(m__5164,hypothesis,
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& aSet0(xP) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5164) ).
fof(m__5147,hypothesis,
xp = szmzizndt0(xQ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5147) ).
fof(m__5106,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5106) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(m__5173,hypothesis,
aElementOf0(xp,xQ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5173) ).
fof(m__5599,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xD,xk)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5599) ).
fof(c_0_13,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_14,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_15,hypothesis,
sdtlpdtrp0(xe,xn) = xp,
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_16,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5309]) ).
fof(c_0_18,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_19,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_20,hypothesis,
! [X191,X192] :
( ( ~ aElementOf0(X191,szNzAzT0)
| sdtlpdtrp0(sdtlpdtrp0(xC,X191),X192) = sdtlpdtrp0(xc,sdtpldt0(X192,szmzizndt0(sdtlpdtrp0(xN,X191))))
| ~ aElementOf0(X192,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X191),szmzizndt0(sdtlpdtrp0(xN,X191))),xk))
| ~ aSet0(X192) )
& ( ~ aElementOf0(X191,szNzAzT0)
| szDzozmdt0(sdtlpdtrp0(xC,X191)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X191),szmzizndt0(sdtlpdtrp0(xN,X191))),xk) )
& ( ~ aElementOf0(X191,szNzAzT0)
| aFunction0(sdtlpdtrp0(xC,X191)) )
& szDzozmdt0(xC) = szNzAzT0
& aFunction0(xC) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4151])])])])]) ).
cnf(c_0_21,hypothesis,
xD = sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),
inference(split_conjunct,[status(thm)],[m__5585]) ).
cnf(c_0_22,hypothesis,
szmzizndt0(sdtlpdtrp0(xN,xn)) = xp,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
fof(c_0_23,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X46,X47] :
( sdtpldt0(sdtmndt0(X46,X47),X47) = X46
| ~ aElementOf0(X47,X46)
| ~ aSet0(X46) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mConsDiff])])])]) ).
cnf(c_0_25,hypothesis,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(split_conjunct,[status(thm)],[m__5164]) ).
cnf(c_0_26,hypothesis,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[m__5147]) ).
cnf(c_0_27,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5106]) ).
cnf(c_0_29,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_30,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| szDzozmdt0(sdtlpdtrp0(xC,X1)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,hypothesis,
sdtmndt0(sdtlpdtrp0(xN,xn),xp) = xD,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_32,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| sdtpldt0(sdtmndt0(X1,X2),X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,hypothesis,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,hypothesis,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[m__5173]) ).
cnf(c_0_36,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_37,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))),xk))
| ~ aSet0(X1)
| sdtlpdtrp0(sdtlpdtrp0(xC,X2),X1) = sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_38,hypothesis,
slbdtsldtrb0(xD,xk) = szDzozmdt0(sdtlpdtrp0(xC,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_22]),c_0_31]),c_0_17])]) ).
cnf(c_0_39,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xD,xk)),
inference(split_conjunct,[status(thm)],[m__5599]) ).
cnf(c_0_40,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,xp)) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(spm,[status(thm)],[c_0_32,c_0_22]) ).
cnf(c_0_41,hypothesis,
sdtpldt0(xP,xp) = xQ,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_42,hypothesis,
( ~ aSet0(X1)
| ~ aElementOf0(X1,szDzozmdt0(sdtlpdtrp0(xC,xn)))
| sdtlpdtrp0(xc,sdtpldt0(X1,xp)) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_22]),c_0_31]),c_0_38]),c_0_17])]) ).
cnf(c_0_43,hypothesis,
aElementOf0(xP,szDzozmdt0(sdtlpdtrp0(xC,xn))),
inference(rw,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_44,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[m__5164]) ).
cnf(c_0_45,negated_conjecture,
sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP) != sdtlpdtrp0(xc,xQ),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_41]),c_0_43]),c_0_44])]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM630+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n002.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 02:48:17 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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.24/0.53 % Version: 3.5.1
% 0.24/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.53 % Starting sh5l with 300s (1) cores
% 0.24/0.53 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2264523 completed with status 0
% 0.24/0.53 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.53 % No SInE strategy applied
% 0.24/0.53 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.24/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.53 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.24/0.53 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.24/0.53 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2264533 completed with status 0
% 0.24/0.53 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.53 % No SInE strategy applied
% 0.24/0.53 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.24/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.53 % Preprocessing time : 0.003 s
% 0.24/0.53 % Presaturation interreduction done
% 0.24/0.53
% 0.24/0.53 % Proof found!
% 0.24/0.53 % SZS status Theorem
% 0.24/0.53 % SZS output start CNFRefutation
% See solution above
% 0.24/0.53 % Parsed axioms : 116
% 0.24/0.53 % Removed by relevancy pruning/SinE : 0
% 0.24/0.53 % Initial clauses : 222
% 0.24/0.53 % Removed in clause preprocessing : 7
% 0.24/0.53 % Initial clauses in saturation : 215
% 0.24/0.53 % Processed clauses : 1192
% 0.24/0.53 % ...of these trivial : 17
% 0.24/0.53 % ...subsumed : 318
% 0.24/0.53 % ...remaining for further processing : 857
% 0.24/0.53 % Other redundant clauses eliminated : 59
% 0.24/0.53 % Clauses deleted for lack of memory : 0
% 0.24/0.53 % Backward-subsumed : 23
% 0.24/0.53 % Backward-rewritten : 19
% 0.24/0.53 % Generated clauses : 2448
% 0.24/0.53 % ...of the previous two non-redundant : 2158
% 0.24/0.53 % ...aggressively subsumed : 0
% 0.24/0.53 % Contextual simplify-reflections : 54
% 0.24/0.53 % Paramodulations : 2391
% 0.24/0.53 % Factorizations : 0
% 0.24/0.53 % NegExts : 0
% 0.24/0.53 % Equation resolutions : 62
% 0.24/0.53 % Disequality decompositions : 0
% 0.24/0.53 % Total rewrite steps : 1826
% 0.24/0.53 % ...of those cached : 1723
% 0.24/0.53 % Propositional unsat checks : 0
% 0.24/0.53 % Propositional check models : 0
% 0.24/0.53 % Propositional check unsatisfiable : 0
% 0.24/0.53 % Propositional clauses : 0
% 0.24/0.53 % Propositional clauses after purity: 0
% 0.24/0.53 % Propositional unsat core size : 0
% 0.24/0.53 % Propositional preprocessing time : 0.000
% 0.24/0.53 % Propositional encoding time : 0.000
% 0.24/0.53 % Propositional solver time : 0.000
% 0.24/0.53 % Success case prop preproc time : 0.000
% 0.24/0.53 % Success case prop encoding time : 0.000
% 0.24/0.53 % Success case prop solver time : 0.000
% 0.24/0.53 % Current number of processed clauses : 562
% 0.24/0.53 % Positive orientable unit clauses : 120
% 0.24/0.53 % Positive unorientable unit clauses: 0
% 0.24/0.53 % Negative unit clauses : 25
% 0.24/0.53 % Non-unit-clauses : 417
% 0.24/0.53 % Current number of unprocessed clauses: 1346
% 0.24/0.53 % ...number of literals in the above : 7005
% 0.24/0.53 % Current number of archived formulas : 0
% 0.24/0.53 % Current number of archived clauses : 255
% 0.24/0.53 % Clause-clause subsumption calls (NU) : 21319
% 0.24/0.53 % Rec. Clause-clause subsumption calls : 7891
% 0.24/0.53 % Non-unit clause-clause subsumptions : 270
% 0.24/0.53 % Unit Clause-clause subsumption calls : 2134
% 0.24/0.53 % Rewrite failures with RHS unbound : 0
% 0.24/0.53 % BW rewrite match attempts : 17
% 0.24/0.53 % BW rewrite match successes : 17
% 0.24/0.53 % Condensation attempts : 0
% 0.24/0.53 % Condensation successes : 0
% 0.24/0.53 % Termbank termtop insertions : 58738
% 0.24/0.53 % Search garbage collected termcells : 3742
% 0.24/0.53
% 0.24/0.53 % -------------------------------------------------
% 0.24/0.53 % User time : 0.075 s
% 0.24/0.53 % System time : 0.006 s
% 0.24/0.53 % Total time : 0.081 s
% 0.24/0.53 % Maximum resident set size: 4288 pages
% 0.24/0.53
% 0.24/0.53 % -------------------------------------------------
% 0.24/0.53 % User time : 0.345 s
% 0.24/0.53 % System time : 0.031 s
% 0.24/0.53 % Total time : 0.376 s
% 0.24/0.53 % Maximum resident set size: 4608 pages
% 0.24/0.53 % E exiting
%------------------------------------------------------------------------------